./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/egcd2-ll_unwindbound100.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/egcd2-ll_unwindbound100.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 73ac5e93c0fc4ad81ce4fa53fc8650626ce35cef ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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/egcd2-ll_unwindbound100.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 73ac5e93c0fc4ad81ce4fa53fc8650626ce35cef ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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@2331828c --- Real Ultimate output --- This is Ultimate 0.2.1-wip.dd.seqcomp-5fbdf5b [2021-09-13 14:17:48,259 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-09-13 14:17:48,260 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-09-13 14:17:48,288 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-09-13 14:17:48,289 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-09-13 14:17:48,290 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-09-13 14:17:48,291 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-09-13 14:17:48,293 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-09-13 14:17:48,298 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-09-13 14:17:48,302 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-09-13 14:17:48,303 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-09-13 14:17:48,308 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-09-13 14:17:48,308 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-09-13 14:17:48,310 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-09-13 14:17:48,312 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-09-13 14:17:48,314 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-09-13 14:17:48,315 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-09-13 14:17:48,316 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-09-13 14:17:48,319 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-09-13 14:17:48,322 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-09-13 14:17:48,324 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-09-13 14:17:48,325 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-09-13 14:17:48,326 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-09-13 14:17:48,328 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-09-13 14:17:48,334 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-09-13 14:17:48,337 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-09-13 14:17:48,337 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-09-13 14:17:48,338 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-09-13 14:17:48,339 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-09-13 14:17:48,339 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-09-13 14:17:48,340 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-09-13 14:17:48,340 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-09-13 14:17:48,343 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-09-13 14:17:48,343 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-09-13 14:17:48,344 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-09-13 14:17:48,345 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-09-13 14:17:48,345 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-09-13 14:17:48,346 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-09-13 14:17:48,346 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-09-13 14:17:48,347 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-09-13 14:17:48,348 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-09-13 14:17:48,348 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:17:48,379 INFO L113 SettingsManager]: Loading preferences was successful [2021-09-13 14:17:48,379 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-09-13 14:17:48,380 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-09-13 14:17:48,380 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-09-13 14:17:48,382 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-09-13 14:17:48,382 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-09-13 14:17:48,382 INFO L138 SettingsManager]: * Use SBE=true [2021-09-13 14:17:48,383 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-09-13 14:17:48,383 INFO L138 SettingsManager]: * sizeof long=4 [2021-09-13 14:17:48,383 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-09-13 14:17:48,384 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-09-13 14:17:48,384 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-09-13 14:17:48,384 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-09-13 14:17:48,384 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-09-13 14:17:48,384 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-09-13 14:17:48,385 INFO L138 SettingsManager]: * sizeof long double=12 [2021-09-13 14:17:48,385 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-09-13 14:17:48,385 INFO L138 SettingsManager]: * Use constant arrays=true [2021-09-13 14:17:48,385 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-09-13 14:17:48,385 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-09-13 14:17:48,386 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-09-13 14:17:48,386 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-09-13 14:17:48,386 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-09-13 14:17:48,386 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-09-13 14:17:48,386 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-09-13 14:17:48,386 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-09-13 14:17:48,387 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-09-13 14:17:48,387 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-09-13 14:17:48,387 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-09-13 14:17:48,387 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-09-13 14:17:48,387 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 -> 73ac5e93c0fc4ad81ce4fa53fc8650626ce35cef [2021-09-13 14:17:48,708 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-09-13 14:17:48,737 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-09-13 14:17:48,740 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-09-13 14:17:48,741 INFO L271 PluginConnector]: Initializing CDTParser... [2021-09-13 14:17:48,742 INFO L275 PluginConnector]: CDTParser initialized [2021-09-13 14:17:48,743 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/egcd2-ll_unwindbound100.c [2021-09-13 14:17:48,813 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e03742faf/e01b34d681494d1b8370135be477b281/FLAG4ada948ce [2021-09-13 14:17:49,270 INFO L306 CDTParser]: Found 1 translation units. [2021-09-13 14:17:49,270 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/egcd2-ll_unwindbound100.c [2021-09-13 14:17:49,277 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e03742faf/e01b34d681494d1b8370135be477b281/FLAG4ada948ce [2021-09-13 14:17:49,295 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e03742faf/e01b34d681494d1b8370135be477b281 [2021-09-13 14:17:49,297 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-09-13 14:17:49,299 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-09-13 14:17:49,302 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-09-13 14:17:49,303 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-09-13 14:17:49,306 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-09-13 14:17:49,306 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.09 02:17:49" (1/1) ... [2021-09-13 14:17:49,307 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@531b0f1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:17:49, skipping insertion in model container [2021-09-13 14:17:49,308 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.09 02:17:49" (1/1) ... [2021-09-13 14:17:49,313 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-09-13 14:17:49,329 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-09-13 14:17:49,475 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/egcd2-ll_unwindbound100.c[490,503] [2021-09-13 14:17:49,508 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-09-13 14:17:49,522 INFO L203 MainTranslator]: Completed pre-run [2021-09-13 14:17:49,539 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/egcd2-ll_unwindbound100.c[490,503] [2021-09-13 14:17:49,566 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-09-13 14:17:49,587 INFO L208 MainTranslator]: Completed translation [2021-09-13 14:17:49,587 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:17:49 WrapperNode [2021-09-13 14:17:49,589 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-09-13 14:17:49,590 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-09-13 14:17:49,590 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-09-13 14:17:49,590 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-09-13 14:17:49,596 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:17:49" (1/1) ... [2021-09-13 14:17:49,612 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:17:49" (1/1) ... [2021-09-13 14:17:49,642 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-09-13 14:17:49,643 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-09-13 14:17:49,643 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-09-13 14:17:49,643 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-09-13 14:17:49,649 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:17:49" (1/1) ... [2021-09-13 14:17:49,649 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:17:49" (1/1) ... [2021-09-13 14:17:49,650 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:17:49" (1/1) ... [2021-09-13 14:17:49,651 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:17:49" (1/1) ... [2021-09-13 14:17:49,656 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:17:49" (1/1) ... [2021-09-13 14:17:49,660 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:17:49" (1/1) ... [2021-09-13 14:17:49,661 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:17:49" (1/1) ... [2021-09-13 14:17:49,663 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-09-13 14:17:49,663 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-09-13 14:17:49,663 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-09-13 14:17:49,664 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-09-13 14:17:49,664 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:17:49" (1/1) ... [2021-09-13 14:17:49,669 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-09-13 14:17:49,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:17:49,689 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:17:49,709 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:17:49,722 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-09-13 14:17:49,724 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-09-13 14:17:49,724 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-09-13 14:17:49,724 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-09-13 14:17:50,045 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-09-13 14:17:50,045 INFO L299 CfgBuilder]: Removed 26 assume(true) statements. [2021-09-13 14:17:50,047 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 02:17:50 BoogieIcfgContainer [2021-09-13 14:17:50,047 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-09-13 14:17:50,048 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-09-13 14:17:50,048 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-09-13 14:17:50,051 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-09-13 14:17:50,051 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.09 02:17:49" (1/3) ... [2021-09-13 14:17:50,051 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25ac7f19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.09 02:17:50, skipping insertion in model container [2021-09-13 14:17:50,052 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:17:49" (2/3) ... [2021-09-13 14:17:50,052 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25ac7f19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.09 02:17:50, skipping insertion in model container [2021-09-13 14:17:50,052 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 02:17:50" (3/3) ... [2021-09-13 14:17:50,053 INFO L111 eAbstractionObserver]: Analyzing ICFG egcd2-ll_unwindbound100.c [2021-09-13 14:17:50,057 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-09-13 14:17:50,057 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2021-09-13 14:17:50,121 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-09-13 14:17:50,131 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:17:50,131 INFO L340 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-09-13 14:17:50,148 INFO L276 IsEmpty]: Start isEmpty. Operand has 43 states, 36 states have (on average 1.6111111111111112) internal successors, (58), 42 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:17:50,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-09-13 14:17:50,153 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:17:50,154 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 14:17:50,155 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-09-13 14:17:50,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:17:50,162 INFO L82 PathProgramCache]: Analyzing trace with hash -141782897, now seen corresponding path program 1 times [2021-09-13 14:17:50,170 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:17:50,171 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136274929] [2021-09-13 14:17:50,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:17:50,172 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:17:50,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:17:50,352 INFO L281 TraceCheckUtils]: 0: Hoare triple {46#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);~counter~0 := 0; {46#true} is VALID [2021-09-13 14:17:50,353 INFO L281 TraceCheckUtils]: 1: Hoare triple {46#true} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~post10, main_~temp~0, main_#t~post9, main_~x~0, main_~y~0, main_~a~0, main_~b~0, main_~p~0, main_~q~0, main_~r~0, main_~s~0, main_~c~0, main_~k~0, main_~xy~0, main_~yy~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;havoc main_~c~0;havoc main_~k~0;havoc main_~xy~0;havoc main_~yy~0;assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647;main_~x~0 := main_#t~nondet7;havoc main_#t~nondet7;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_~x~0 >= 1 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {46#true} is VALID [2021-09-13 14:17:50,354 INFO L281 TraceCheckUtils]: 2: Hoare triple {46#true} assume 0 == assume_abort_if_not_~cond;assume false; {47#false} is VALID [2021-09-13 14:17:50,354 INFO L281 TraceCheckUtils]: 3: Hoare triple {47#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; {47#false} is VALID [2021-09-13 14:17:50,354 INFO L281 TraceCheckUtils]: 4: Hoare triple {47#false} assume 0 == assume_abort_if_not_~cond;assume false; {47#false} is VALID [2021-09-13 14:17:50,355 INFO L281 TraceCheckUtils]: 5: Hoare triple {47#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;main_~c~0 := 0;main_~k~0 := 0;main_~xy~0 := main_~x~0 * main_~y~0;main_~yy~0 := main_~y~0 * main_~y~0;assume_abort_if_not_#in~cond := (if main_~xy~0 < 2147483647 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {47#false} is VALID [2021-09-13 14:17:50,356 INFO L281 TraceCheckUtils]: 6: Hoare triple {47#false} assume 0 == assume_abort_if_not_~cond;assume false; {47#false} is VALID [2021-09-13 14:17:50,357 INFO L281 TraceCheckUtils]: 7: Hoare triple {47#false} assume_abort_if_not_#in~cond := (if main_~yy~0 < 2147483647 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {47#false} is VALID [2021-09-13 14:17:50,358 INFO L281 TraceCheckUtils]: 8: Hoare triple {47#false} assume 0 == assume_abort_if_not_~cond;assume false; {47#false} is VALID [2021-09-13 14:17:50,358 INFO L281 TraceCheckUtils]: 9: Hoare triple {47#false} assume !true; {47#false} is VALID [2021-09-13 14:17:50,358 INFO L281 TraceCheckUtils]: 10: Hoare triple {47#false} __VERIFIER_assert_#in~cond := (if 0 == main_~q~0 * main_~x~0 + main_~s~0 * main_~y~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {47#false} is VALID [2021-09-13 14:17:50,358 INFO L281 TraceCheckUtils]: 11: Hoare triple {47#false} assume 0 == __VERIFIER_assert_~cond; {47#false} is VALID [2021-09-13 14:17:50,359 INFO L281 TraceCheckUtils]: 12: Hoare triple {47#false} assume !false; {47#false} is VALID [2021-09-13 14:17:50,360 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:17:50,361 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:17:50,361 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136274929] [2021-09-13 14:17:50,362 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136274929] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-13 14:17:50,362 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-13 14:17:50,362 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-09-13 14:17:50,363 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078562488] [2021-09-13 14:17:50,369 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 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 13 [2021-09-13 14:17:50,370 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:17:50,372 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:17:50,404 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:17:50,404 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-09-13 14:17:50,405 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:17:50,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-09-13 14:17:50,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-09-13 14:17:50,431 INFO L87 Difference]: Start difference. First operand has 43 states, 36 states have (on average 1.6111111111111112) internal successors, (58), 42 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 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:17:50,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:17:50,555 INFO L93 Difference]: Finished difference Result 83 states and 112 transitions. [2021-09-13 14:17:50,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-09-13 14:17:50,557 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 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 13 [2021-09-13 14:17:50,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:17:50,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:17:50,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 112 transitions. [2021-09-13 14:17:50,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:17:50,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 112 transitions. [2021-09-13 14:17:50,574 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 112 transitions. [2021-09-13 14:17:50,680 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:17:50,693 INFO L225 Difference]: With dead ends: 83 [2021-09-13 14:17:50,693 INFO L226 Difference]: Without dead ends: 39 [2021-09-13 14:17:50,696 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.04ms TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-09-13 14:17:50,702 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 45.87ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.92ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 47.56ms IncrementalHoareTripleChecker+Time [2021-09-13 14:17:50,703 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 46 Unknown, 0 Unchecked, 0.92ms Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 47.56ms Time] [2021-09-13 14:17:50,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2021-09-13 14:17:50,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2021-09-13 14:17:50,730 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:17:50,731 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand has 39 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 38 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:17:50,733 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand has 39 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 38 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:17:50,734 INFO L87 Difference]: Start difference. First operand 39 states. Second operand has 39 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 38 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:17:50,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:17:50,738 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2021-09-13 14:17:50,738 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2021-09-13 14:17:50,738 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:17:50,739 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:17:50,739 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 38 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) Second operand 39 states. [2021-09-13 14:17:50,744 INFO L87 Difference]: Start difference. First operand has 39 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 38 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) Second operand 39 states. [2021-09-13 14:17:50,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:17:50,746 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2021-09-13 14:17:50,746 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2021-09-13 14:17:50,747 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:17:50,747 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:17:50,747 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:17:50,747 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:17:50,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 38 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:17:50,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2021-09-13 14:17:50,749 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 13 [2021-09-13 14:17:50,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:17:50,750 INFO L470 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2021-09-13 14:17:50,750 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:17:50,750 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2021-09-13 14:17:50,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-09-13 14:17:50,750 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:17:50,751 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 14:17:50,751 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-09-13 14:17:50,751 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-09-13 14:17:50,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:17:50,752 INFO L82 PathProgramCache]: Analyzing trace with hash -1057770534, now seen corresponding path program 1 times [2021-09-13 14:17:50,752 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:17:50,752 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244227234] [2021-09-13 14:17:50,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:17:50,753 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:17:50,787 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-09-13 14:17:50,789 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [821664005] [2021-09-13 14:17:50,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:17:50,790 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:17:50,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:17:50,797 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:17:50,808 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:17:50,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:17:50,851 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 3 conjunts are in the unsatisfiable core [2021-09-13 14:17:50,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:17:50,863 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:17:51,021 INFO L281 TraceCheckUtils]: 0: Hoare triple {275#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);~counter~0 := 0; {280#(<= ~counter~0 0)} is VALID [2021-09-13 14:17:51,021 INFO L281 TraceCheckUtils]: 1: Hoare triple {280#(<= ~counter~0 0)} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~post10, main_~temp~0, main_#t~post9, main_~x~0, main_~y~0, main_~a~0, main_~b~0, main_~p~0, main_~q~0, main_~r~0, main_~s~0, main_~c~0, main_~k~0, main_~xy~0, main_~yy~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;havoc main_~c~0;havoc main_~k~0;havoc main_~xy~0;havoc main_~yy~0;assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647;main_~x~0 := main_#t~nondet7;havoc main_#t~nondet7;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_~x~0 >= 1 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {280#(<= ~counter~0 0)} is VALID [2021-09-13 14:17:51,026 INFO L281 TraceCheckUtils]: 2: Hoare triple {280#(<= ~counter~0 0)} assume !(0 == assume_abort_if_not_~cond); {280#(<= ~counter~0 0)} is VALID [2021-09-13 14:17:51,027 INFO L281 TraceCheckUtils]: 3: Hoare triple {280#(<= ~counter~0 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; {280#(<= ~counter~0 0)} is VALID [2021-09-13 14:17:51,028 INFO L281 TraceCheckUtils]: 4: Hoare triple {280#(<= ~counter~0 0)} assume !(0 == assume_abort_if_not_~cond); {280#(<= ~counter~0 0)} is VALID [2021-09-13 14:17:51,028 INFO L281 TraceCheckUtils]: 5: Hoare triple {280#(<= ~counter~0 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;main_~c~0 := 0;main_~k~0 := 0;main_~xy~0 := main_~x~0 * main_~y~0;main_~yy~0 := main_~y~0 * main_~y~0;assume_abort_if_not_#in~cond := (if main_~xy~0 < 2147483647 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {280#(<= ~counter~0 0)} is VALID [2021-09-13 14:17:51,028 INFO L281 TraceCheckUtils]: 6: Hoare triple {280#(<= ~counter~0 0)} assume !(0 == assume_abort_if_not_~cond); {280#(<= ~counter~0 0)} is VALID [2021-09-13 14:17:51,029 INFO L281 TraceCheckUtils]: 7: Hoare triple {280#(<= ~counter~0 0)} assume_abort_if_not_#in~cond := (if main_~yy~0 < 2147483647 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {280#(<= ~counter~0 0)} is VALID [2021-09-13 14:17:51,030 INFO L281 TraceCheckUtils]: 8: Hoare triple {280#(<= ~counter~0 0)} assume !(0 == assume_abort_if_not_~cond); {280#(<= ~counter~0 0)} is VALID [2021-09-13 14:17:51,031 INFO L281 TraceCheckUtils]: 9: Hoare triple {280#(<= ~counter~0 0)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {308#(<= |ULTIMATE.start_main_#t~post9| 0)} is VALID [2021-09-13 14:17:51,031 INFO L281 TraceCheckUtils]: 10: Hoare triple {308#(<= |ULTIMATE.start_main_#t~post9| 0)} assume !(main_#t~post9 < 100);havoc main_#t~post9; {276#false} is VALID [2021-09-13 14:17:51,031 INFO L281 TraceCheckUtils]: 11: Hoare triple {276#false} __VERIFIER_assert_#in~cond := (if 0 == main_~q~0 * main_~x~0 + main_~s~0 * main_~y~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {276#false} is VALID [2021-09-13 14:17:51,032 INFO L281 TraceCheckUtils]: 12: Hoare triple {276#false} assume 0 == __VERIFIER_assert_~cond; {276#false} is VALID [2021-09-13 14:17:51,033 INFO L281 TraceCheckUtils]: 13: Hoare triple {276#false} assume !false; {276#false} is VALID [2021-09-13 14:17:51,033 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:17:51,034 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-09-13 14:17:51,034 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:17:51,034 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244227234] [2021-09-13 14:17:51,034 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-09-13 14:17:51,035 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [821664005] [2021-09-13 14:17:51,037 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [821664005] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-13 14:17:51,038 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-13 14:17:51,038 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-09-13 14:17:51,038 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896799064] [2021-09-13 14:17:51,040 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 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:17:51,041 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:17:51,041 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 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:17:51,055 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:17:51,056 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-09-13 14:17:51,056 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:17:51,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-09-13 14:17:51,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-09-13 14:17:51,057 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 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:17:51,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:17:51,256 INFO L93 Difference]: Finished difference Result 49 states and 52 transitions. [2021-09-13 14:17:51,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-09-13 14:17:51,257 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 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:17:51,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:17:51,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 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:17:51,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 52 transitions. [2021-09-13 14:17:51,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 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:17:51,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 52 transitions. [2021-09-13 14:17:51,265 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 52 transitions. [2021-09-13 14:17:51,307 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:17:51,310 INFO L225 Difference]: With dead ends: 49 [2021-09-13 14:17:51,310 INFO L226 Difference]: Without dead ends: 41 [2021-09-13 14:17:51,311 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.21ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-09-13 14:17:51,313 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 83.93ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.56ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 93.46ms IncrementalHoareTripleChecker+Time [2021-09-13 14:17:51,313 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 117 Unknown, 0 Unchecked, 3.56ms Time], IncrementalHoareTripleChecker [0 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 93.46ms Time] [2021-09-13 14:17:51,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2021-09-13 14:17:51,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2021-09-13 14:17:51,323 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:17:51,324 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand has 41 states, 35 states have (on average 1.2571428571428571) internal successors, (44), 40 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:17:51,325 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand has 41 states, 35 states have (on average 1.2571428571428571) internal successors, (44), 40 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:17:51,326 INFO L87 Difference]: Start difference. First operand 41 states. Second operand has 41 states, 35 states have (on average 1.2571428571428571) internal successors, (44), 40 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:17:51,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:17:51,329 INFO L93 Difference]: Finished difference Result 41 states and 44 transitions. [2021-09-13 14:17:51,330 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2021-09-13 14:17:51,330 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:17:51,331 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:17:51,331 INFO L74 IsIncluded]: Start isIncluded. First operand has 41 states, 35 states have (on average 1.2571428571428571) internal successors, (44), 40 states have internal predecessors, (44), 0 states have call successors, (0), 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 41 states. [2021-09-13 14:17:51,331 INFO L87 Difference]: Start difference. First operand has 41 states, 35 states have (on average 1.2571428571428571) internal successors, (44), 40 states have internal predecessors, (44), 0 states have call successors, (0), 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 41 states. [2021-09-13 14:17:51,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:17:51,338 INFO L93 Difference]: Finished difference Result 41 states and 44 transitions. [2021-09-13 14:17:51,338 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2021-09-13 14:17:51,338 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:17:51,339 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:17:51,339 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:17:51,339 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:17:51,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 35 states have (on average 1.2571428571428571) internal successors, (44), 40 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:17:51,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2021-09-13 14:17:51,344 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 14 [2021-09-13 14:17:51,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:17:51,345 INFO L470 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2021-09-13 14:17:51,345 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 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:17:51,345 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2021-09-13 14:17:51,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-09-13 14:17:51,346 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:17:51,346 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 14:17:51,377 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-09-13 14:17:51,560 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:17:51,561 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-09-13 14:17:51,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:17:51,562 INFO L82 PathProgramCache]: Analyzing trace with hash 1568670238, now seen corresponding path program 1 times [2021-09-13 14:17:51,562 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:17:51,562 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694128546] [2021-09-13 14:17:51,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:17:51,563 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:17:51,573 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-09-13 14:17:51,573 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1076045502] [2021-09-13 14:17:51,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:17:51,574 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:17:51,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:17:51,576 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:17:51,579 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:17:51,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:17:51,635 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 7 conjunts are in the unsatisfiable core [2021-09-13 14:17:51,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:17:51,645 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:17:51,823 INFO L281 TraceCheckUtils]: 0: Hoare triple {509#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);~counter~0 := 0; {509#true} is VALID [2021-09-13 14:17:51,823 INFO L281 TraceCheckUtils]: 1: Hoare triple {509#true} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~post10, main_~temp~0, main_#t~post9, main_~x~0, main_~y~0, main_~a~0, main_~b~0, main_~p~0, main_~q~0, main_~r~0, main_~s~0, main_~c~0, main_~k~0, main_~xy~0, main_~yy~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;havoc main_~c~0;havoc main_~k~0;havoc main_~xy~0;havoc main_~yy~0;assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647;main_~x~0 := main_#t~nondet7;havoc main_#t~nondet7;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_~x~0 >= 1 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {509#true} is VALID [2021-09-13 14:17:51,824 INFO L281 TraceCheckUtils]: 2: Hoare triple {509#true} assume !(0 == assume_abort_if_not_~cond); {509#true} is VALID [2021-09-13 14:17:51,824 INFO L281 TraceCheckUtils]: 3: Hoare triple {509#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; {523#(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:17:51,825 INFO L281 TraceCheckUtils]: 4: Hoare triple {523#(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); {527#(<= 1 ULTIMATE.start_main_~y~0)} is VALID [2021-09-13 14:17:51,826 INFO L281 TraceCheckUtils]: 5: Hoare triple {527#(<= 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;main_~c~0 := 0;main_~k~0 := 0;main_~xy~0 := main_~x~0 * main_~y~0;main_~yy~0 := main_~y~0 * main_~y~0;assume_abort_if_not_#in~cond := (if main_~xy~0 < 2147483647 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {531#(<= 1 ULTIMATE.start_main_~b~0)} is VALID [2021-09-13 14:17:51,826 INFO L281 TraceCheckUtils]: 6: Hoare triple {531#(<= 1 ULTIMATE.start_main_~b~0)} assume !(0 == assume_abort_if_not_~cond); {531#(<= 1 ULTIMATE.start_main_~b~0)} is VALID [2021-09-13 14:17:51,827 INFO L281 TraceCheckUtils]: 7: Hoare triple {531#(<= 1 ULTIMATE.start_main_~b~0)} assume_abort_if_not_#in~cond := (if main_~yy~0 < 2147483647 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {531#(<= 1 ULTIMATE.start_main_~b~0)} is VALID [2021-09-13 14:17:51,827 INFO L281 TraceCheckUtils]: 8: Hoare triple {531#(<= 1 ULTIMATE.start_main_~b~0)} assume !(0 == assume_abort_if_not_~cond); {531#(<= 1 ULTIMATE.start_main_~b~0)} is VALID [2021-09-13 14:17:51,828 INFO L281 TraceCheckUtils]: 9: Hoare triple {531#(<= 1 ULTIMATE.start_main_~b~0)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {531#(<= 1 ULTIMATE.start_main_~b~0)} is VALID [2021-09-13 14:17:51,828 INFO L281 TraceCheckUtils]: 10: Hoare triple {531#(<= 1 ULTIMATE.start_main_~b~0)} assume !!(main_#t~post9 < 100);havoc main_#t~post9; {531#(<= 1 ULTIMATE.start_main_~b~0)} is VALID [2021-09-13 14:17:51,829 INFO L281 TraceCheckUtils]: 11: Hoare triple {531#(<= 1 ULTIMATE.start_main_~b~0)} assume !(0 != main_~b~0); {510#false} is VALID [2021-09-13 14:17:51,829 INFO L281 TraceCheckUtils]: 12: Hoare triple {510#false} __VERIFIER_assert_#in~cond := (if 0 == main_~q~0 * main_~x~0 + main_~s~0 * main_~y~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {510#false} is VALID [2021-09-13 14:17:51,829 INFO L281 TraceCheckUtils]: 13: Hoare triple {510#false} assume 0 == __VERIFIER_assert_~cond; {510#false} is VALID [2021-09-13 14:17:51,829 INFO L281 TraceCheckUtils]: 14: Hoare triple {510#false} assume !false; {510#false} is VALID [2021-09-13 14:17:51,829 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:17:51,829 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-09-13 14:17:51,830 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:17:51,830 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694128546] [2021-09-13 14:17:51,830 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-09-13 14:17:51,830 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1076045502] [2021-09-13 14:17:51,830 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1076045502] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-13 14:17:51,830 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-13 14:17:51,830 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-09-13 14:17:51,831 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966463284] [2021-09-13 14:17:51,831 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:17:51,831 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:17:51,831 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:17:51,844 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:17:51,844 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-09-13 14:17:51,845 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:17:51,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-09-13 14:17:51,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-09-13 14:17:51,845 INFO L87 Difference]: Start difference. First operand 41 states and 44 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:17:52,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:17:52,112 INFO L93 Difference]: Finished difference Result 69 states and 74 transitions. [2021-09-13 14:17:52,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-09-13 14:17:52,113 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:17:52,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:17:52,113 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:17:52,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 74 transitions. [2021-09-13 14:17:52,114 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:17:52,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 74 transitions. [2021-09-13 14:17:52,116 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 74 transitions. [2021-09-13 14:17:52,182 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:17:52,184 INFO L225 Difference]: With dead ends: 69 [2021-09-13 14:17:52,184 INFO L226 Difference]: Without dead ends: 61 [2021-09-13 14:17:52,184 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 51.00ms TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-09-13 14:17:52,185 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 81 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 92.68ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.36ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 94.93ms IncrementalHoareTripleChecker+Time [2021-09-13 14:17:52,186 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [81 Valid, 0 Invalid, 126 Unknown, 0 Unchecked, 2.36ms Time], IncrementalHoareTripleChecker [2 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 94.93ms Time] [2021-09-13 14:17:52,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2021-09-13 14:17:52,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 42. [2021-09-13 14:17:52,197 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:17:52,198 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand has 42 states, 36 states have (on average 1.25) internal successors, (45), 41 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:17:52,198 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand has 42 states, 36 states have (on average 1.25) internal successors, (45), 41 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:17:52,198 INFO L87 Difference]: Start difference. First operand 61 states. Second operand has 42 states, 36 states have (on average 1.25) internal successors, (45), 41 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:17:52,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:17:52,200 INFO L93 Difference]: Finished difference Result 61 states and 66 transitions. [2021-09-13 14:17:52,200 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 66 transitions. [2021-09-13 14:17:52,200 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:17:52,200 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:17:52,201 INFO L74 IsIncluded]: Start isIncluded. First operand has 42 states, 36 states have (on average 1.25) internal successors, (45), 41 states have internal predecessors, (45), 0 states have call successors, (0), 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 61 states. [2021-09-13 14:17:52,201 INFO L87 Difference]: Start difference. First operand has 42 states, 36 states have (on average 1.25) internal successors, (45), 41 states have internal predecessors, (45), 0 states have call successors, (0), 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 61 states. [2021-09-13 14:17:52,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:17:52,202 INFO L93 Difference]: Finished difference Result 61 states and 66 transitions. [2021-09-13 14:17:52,203 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 66 transitions. [2021-09-13 14:17:52,203 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:17:52,203 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:17:52,203 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:17:52,203 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:17:52,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 36 states have (on average 1.25) internal successors, (45), 41 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:17:52,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2021-09-13 14:17:52,205 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 15 [2021-09-13 14:17:52,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:17:52,205 INFO L470 AbstractCegarLoop]: Abstraction has 42 states and 45 transitions. [2021-09-13 14:17:52,205 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:17:52,205 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2021-09-13 14:17:52,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-09-13 14:17:52,213 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:17:52,213 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 14:17:52,233 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:17:52,428 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:17:52,429 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-09-13 14:17:52,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:17:52,430 INFO L82 PathProgramCache]: Analyzing trace with hash 1384108475, now seen corresponding path program 1 times [2021-09-13 14:17:52,430 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:17:52,430 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129506534] [2021-09-13 14:17:52,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:17:52,431 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:17:52,440 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-09-13 14:17:52,441 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [288031094] [2021-09-13 14:17:52,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:17:52,441 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:17:52,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:17:52,442 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:17:52,452 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:17:52,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:17:52,497 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 14 conjunts are in the unsatisfiable core [2021-09-13 14:17:52,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:17:52,507 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:17:52,762 INFO L281 TraceCheckUtils]: 0: Hoare triple {817#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);~counter~0 := 0; {817#true} is VALID [2021-09-13 14:17:52,763 INFO L281 TraceCheckUtils]: 1: Hoare triple {817#true} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~post10, main_~temp~0, main_#t~post9, main_~x~0, main_~y~0, main_~a~0, main_~b~0, main_~p~0, main_~q~0, main_~r~0, main_~s~0, main_~c~0, main_~k~0, main_~xy~0, main_~yy~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;havoc main_~c~0;havoc main_~k~0;havoc main_~xy~0;havoc main_~yy~0;assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647;main_~x~0 := main_#t~nondet7;havoc main_#t~nondet7;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_~x~0 >= 1 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {817#true} is VALID [2021-09-13 14:17:52,763 INFO L281 TraceCheckUtils]: 2: Hoare triple {817#true} assume !(0 == assume_abort_if_not_~cond); {817#true} is VALID [2021-09-13 14:17:52,764 INFO L281 TraceCheckUtils]: 3: Hoare triple {817#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; {831#(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:17:52,764 INFO L281 TraceCheckUtils]: 4: Hoare triple {831#(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); {835#(<= 1 ULTIMATE.start_main_~y~0)} is VALID [2021-09-13 14:17:52,765 INFO L281 TraceCheckUtils]: 5: Hoare triple {835#(<= 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;main_~c~0 := 0;main_~k~0 := 0;main_~xy~0 := main_~x~0 * main_~y~0;main_~yy~0 := main_~y~0 * main_~y~0;assume_abort_if_not_#in~cond := (if main_~xy~0 < 2147483647 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {839#(<= 1 ULTIMATE.start_main_~b~0)} is VALID [2021-09-13 14:17:52,765 INFO L281 TraceCheckUtils]: 6: Hoare triple {839#(<= 1 ULTIMATE.start_main_~b~0)} assume !(0 == assume_abort_if_not_~cond); {839#(<= 1 ULTIMATE.start_main_~b~0)} is VALID [2021-09-13 14:17:52,768 INFO L281 TraceCheckUtils]: 7: Hoare triple {839#(<= 1 ULTIMATE.start_main_~b~0)} assume_abort_if_not_#in~cond := (if main_~yy~0 < 2147483647 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {839#(<= 1 ULTIMATE.start_main_~b~0)} is VALID [2021-09-13 14:17:52,769 INFO L281 TraceCheckUtils]: 8: Hoare triple {839#(<= 1 ULTIMATE.start_main_~b~0)} assume !(0 == assume_abort_if_not_~cond); {839#(<= 1 ULTIMATE.start_main_~b~0)} is VALID [2021-09-13 14:17:52,769 INFO L281 TraceCheckUtils]: 9: Hoare triple {839#(<= 1 ULTIMATE.start_main_~b~0)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {839#(<= 1 ULTIMATE.start_main_~b~0)} is VALID [2021-09-13 14:17:52,770 INFO L281 TraceCheckUtils]: 10: Hoare triple {839#(<= 1 ULTIMATE.start_main_~b~0)} assume !!(main_#t~post9 < 100);havoc main_#t~post9; {839#(<= 1 ULTIMATE.start_main_~b~0)} is VALID [2021-09-13 14:17:52,772 INFO L281 TraceCheckUtils]: 11: Hoare triple {839#(<= 1 ULTIMATE.start_main_~b~0)} assume !!(0 != main_~b~0);main_~c~0 := main_~a~0;main_~k~0 := 0; {858#(and (= ULTIMATE.start_main_~k~0 0) (<= 1 ULTIMATE.start_main_~b~0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0))} is VALID [2021-09-13 14:17:52,772 INFO L281 TraceCheckUtils]: 12: Hoare triple {858#(and (= ULTIMATE.start_main_~k~0 0) (<= 1 ULTIMATE.start_main_~b~0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0))} main_#t~post10 := ~counter~0;~counter~0 := 1 + main_#t~post10; {858#(and (= ULTIMATE.start_main_~k~0 0) (<= 1 ULTIMATE.start_main_~b~0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0))} is VALID [2021-09-13 14:17:52,773 INFO L281 TraceCheckUtils]: 13: Hoare triple {858#(and (= ULTIMATE.start_main_~k~0 0) (<= 1 ULTIMATE.start_main_~b~0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0))} assume !!(main_#t~post10 < 100);havoc main_#t~post10;__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; {865#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} is VALID [2021-09-13 14:17:52,774 INFO L281 TraceCheckUtils]: 14: Hoare triple {865#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} assume 0 == __VERIFIER_assert_~cond; {818#false} is VALID [2021-09-13 14:17:52,774 INFO L281 TraceCheckUtils]: 15: Hoare triple {818#false} assume !false; {818#false} is VALID [2021-09-13 14:17:52,774 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:17:52,774 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-09-13 14:17:52,774 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:17:52,775 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129506534] [2021-09-13 14:17:52,775 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-09-13 14:17:52,775 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [288031094] [2021-09-13 14:17:52,775 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [288031094] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-13 14:17:52,775 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-13 14:17:52,775 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-09-13 14:17:52,776 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571809574] [2021-09-13 14:17:52,776 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2021-09-13 14:17:52,776 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:17:52,777 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:17:52,789 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:17:52,789 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-09-13 14:17:52,789 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:17:52,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-09-13 14:17:52,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-09-13 14:17:52,790 INFO L87 Difference]: Start difference. First operand 42 states and 45 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:17:53,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:17:53,203 INFO L93 Difference]: Finished difference Result 80 states and 87 transitions. [2021-09-13 14:17:53,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-09-13 14:17:53,203 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2021-09-13 14:17:53,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:17:53,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:17:53,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 87 transitions. [2021-09-13 14:17:53,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:17:53,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 87 transitions. [2021-09-13 14:17:53,207 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 87 transitions. [2021-09-13 14:17:53,281 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:17:53,287 INFO L225 Difference]: With dead ends: 80 [2021-09-13 14:17:53,287 INFO L226 Difference]: Without dead ends: 78 [2021-09-13 14:17:53,288 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 90.14ms TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2021-09-13 14:17:53,290 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 109 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 155.54ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.77ms SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 157.12ms IncrementalHoareTripleChecker+Time [2021-09-13 14:17:53,290 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [109 Valid, 0 Invalid, 207 Unknown, 0 Unchecked, 4.77ms Time], IncrementalHoareTripleChecker [7 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 157.12ms Time] [2021-09-13 14:17:53,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2021-09-13 14:17:53,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 45. [2021-09-13 14:17:53,322 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:17:53,322 INFO L82 GeneralOperation]: Start isEquivalent. First operand 78 states. Second operand has 45 states, 39 states have (on average 1.2564102564102564) internal successors, (49), 44 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:17:53,322 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand has 45 states, 39 states have (on average 1.2564102564102564) internal successors, (49), 44 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:17:53,323 INFO L87 Difference]: Start difference. First operand 78 states. Second operand has 45 states, 39 states have (on average 1.2564102564102564) internal successors, (49), 44 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:17:53,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:17:53,325 INFO L93 Difference]: Finished difference Result 78 states and 85 transitions. [2021-09-13 14:17:53,325 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 85 transitions. [2021-09-13 14:17:53,326 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:17:53,326 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:17:53,326 INFO L74 IsIncluded]: Start isIncluded. First operand has 45 states, 39 states have (on average 1.2564102564102564) internal successors, (49), 44 states have internal predecessors, (49), 0 states have call successors, (0), 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 78 states. [2021-09-13 14:17:53,327 INFO L87 Difference]: Start difference. First operand has 45 states, 39 states have (on average 1.2564102564102564) internal successors, (49), 44 states have internal predecessors, (49), 0 states have call successors, (0), 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 78 states. [2021-09-13 14:17:53,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:17:53,329 INFO L93 Difference]: Finished difference Result 78 states and 85 transitions. [2021-09-13 14:17:53,329 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 85 transitions. [2021-09-13 14:17:53,330 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:17:53,330 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:17:53,330 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:17:53,330 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:17:53,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 39 states have (on average 1.2564102564102564) internal successors, (49), 44 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:17:53,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2021-09-13 14:17:53,332 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 16 [2021-09-13 14:17:53,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:17:53,332 INFO L470 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2021-09-13 14:17:53,332 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:17:53,332 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2021-09-13 14:17:53,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-09-13 14:17:53,333 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:17:53,333 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 14:17:53,357 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:17:53,546 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:17:53,547 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-09-13 14:17:53,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:17:53,547 INFO L82 PathProgramCache]: Analyzing trace with hash -1311460386, now seen corresponding path program 1 times [2021-09-13 14:17:53,547 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:17:53,548 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442453102] [2021-09-13 14:17:53,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:17:53,548 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:17:53,570 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-09-13 14:17:53,570 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1886816104] [2021-09-13 14:17:53,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:17:53,570 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:17:53,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:17:53,572 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:17:53,588 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:17:53,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:17:53,635 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 9 conjunts are in the unsatisfiable core [2021-09-13 14:17:53,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:17:53,646 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:17:53,949 INFO L281 TraceCheckUtils]: 0: Hoare triple {1187#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);~counter~0 := 0; {1187#true} is VALID [2021-09-13 14:17:53,949 INFO L281 TraceCheckUtils]: 1: Hoare triple {1187#true} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~post10, main_~temp~0, main_#t~post9, main_~x~0, main_~y~0, main_~a~0, main_~b~0, main_~p~0, main_~q~0, main_~r~0, main_~s~0, main_~c~0, main_~k~0, main_~xy~0, main_~yy~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;havoc main_~c~0;havoc main_~k~0;havoc main_~xy~0;havoc main_~yy~0;assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647;main_~x~0 := main_#t~nondet7;havoc main_#t~nondet7;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_~x~0 >= 1 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {1187#true} is VALID [2021-09-13 14:17:53,949 INFO L281 TraceCheckUtils]: 2: Hoare triple {1187#true} assume !(0 == assume_abort_if_not_~cond); {1187#true} is VALID [2021-09-13 14:17:53,949 INFO L281 TraceCheckUtils]: 3: Hoare triple {1187#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; {1187#true} is VALID [2021-09-13 14:17:53,950 INFO L281 TraceCheckUtils]: 4: Hoare triple {1187#true} assume !(0 == assume_abort_if_not_~cond); {1187#true} is VALID [2021-09-13 14:17:53,950 INFO L281 TraceCheckUtils]: 5: Hoare triple {1187#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;main_~c~0 := 0;main_~k~0 := 0;main_~xy~0 := main_~x~0 * main_~y~0;main_~yy~0 := main_~y~0 * main_~y~0;assume_abort_if_not_#in~cond := (if main_~xy~0 < 2147483647 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {1207#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~r~0 0))} is VALID [2021-09-13 14:17:53,951 INFO L281 TraceCheckUtils]: 6: Hoare triple {1207#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~r~0 0))} assume !(0 == assume_abort_if_not_~cond); {1207#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~r~0 0))} is VALID [2021-09-13 14:17:53,951 INFO L281 TraceCheckUtils]: 7: Hoare triple {1207#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~r~0 0))} assume_abort_if_not_#in~cond := (if main_~yy~0 < 2147483647 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {1207#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~r~0 0))} is VALID [2021-09-13 14:17:53,952 INFO L281 TraceCheckUtils]: 8: Hoare triple {1207#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~r~0 0))} assume !(0 == assume_abort_if_not_~cond); {1207#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~r~0 0))} is VALID [2021-09-13 14:17:53,953 INFO L281 TraceCheckUtils]: 9: Hoare triple {1207#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~r~0 0))} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {1207#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~r~0 0))} is VALID [2021-09-13 14:17:53,953 INFO L281 TraceCheckUtils]: 10: Hoare triple {1207#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~r~0 0))} assume !!(main_#t~post9 < 100);havoc main_#t~post9; {1207#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~r~0 0))} is VALID [2021-09-13 14:17:53,954 INFO L281 TraceCheckUtils]: 11: Hoare triple {1207#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~r~0 0))} assume !!(0 != main_~b~0);main_~c~0 := main_~a~0;main_~k~0 := 0; {1207#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~r~0 0))} is VALID [2021-09-13 14:17:53,954 INFO L281 TraceCheckUtils]: 12: Hoare triple {1207#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~r~0 0))} main_#t~post10 := ~counter~0;~counter~0 := 1 + main_#t~post10; {1207#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~r~0 0))} is VALID [2021-09-13 14:17:53,955 INFO L281 TraceCheckUtils]: 13: Hoare triple {1207#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~r~0 0))} assume !!(main_#t~post10 < 100);havoc main_#t~post10;__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; {1207#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~r~0 0))} is VALID [2021-09-13 14:17:53,955 INFO L281 TraceCheckUtils]: 14: Hoare triple {1207#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~r~0 0))} assume !(0 == __VERIFIER_assert_~cond); {1207#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~r~0 0))} is VALID [2021-09-13 14:17:53,956 INFO L281 TraceCheckUtils]: 15: Hoare triple {1207#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~r~0 0))} __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; {1238#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} is VALID [2021-09-13 14:17:53,956 INFO L281 TraceCheckUtils]: 16: Hoare triple {1238#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} assume 0 == __VERIFIER_assert_~cond; {1188#false} is VALID [2021-09-13 14:17:53,957 INFO L281 TraceCheckUtils]: 17: Hoare triple {1188#false} assume !false; {1188#false} is VALID [2021-09-13 14:17:53,957 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:17:53,957 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-09-13 14:17:53,957 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:17:53,957 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442453102] [2021-09-13 14:17:53,957 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-09-13 14:17:53,958 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1886816104] [2021-09-13 14:17:53,958 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1886816104] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-13 14:17:53,958 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-13 14:17:53,958 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-09-13 14:17:53,958 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065502951] [2021-09-13 14:17:53,959 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 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 18 [2021-09-13 14:17:53,959 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:17:53,959 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:17:53,980 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:17:53,980 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-09-13 14:17:53,980 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:17:53,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-09-13 14:17:53,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-09-13 14:17:53,981 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:17:54,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:17:54,208 INFO L93 Difference]: Finished difference Result 64 states and 70 transitions. [2021-09-13 14:17:54,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-09-13 14:17:54,208 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 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 18 [2021-09-13 14:17:54,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:17:54,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:17:54,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 66 transitions. [2021-09-13 14:17:54,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:17:54,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 66 transitions. [2021-09-13 14:17:54,210 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 66 transitions. [2021-09-13 14:17:54,262 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:17:54,263 INFO L225 Difference]: With dead ends: 64 [2021-09-13 14:17:54,263 INFO L226 Difference]: Without dead ends: 62 [2021-09-13 14:17:54,263 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 25.89ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-09-13 14:17:54,264 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 15 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 91.65ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.64ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 92.45ms IncrementalHoareTripleChecker+Time [2021-09-13 14:17:54,264 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 0 Invalid, 127 Unknown, 0 Unchecked, 0.64ms Time], IncrementalHoareTripleChecker [1 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 92.45ms Time] [2021-09-13 14:17:54,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2021-09-13 14:17:54,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 55. [2021-09-13 14:17:54,302 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:17:54,303 INFO L82 GeneralOperation]: Start isEquivalent. First operand 62 states. Second operand has 55 states, 49 states have (on average 1.3061224489795917) internal successors, (64), 54 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:17:54,303 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand has 55 states, 49 states have (on average 1.3061224489795917) internal successors, (64), 54 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:17:54,303 INFO L87 Difference]: Start difference. First operand 62 states. Second operand has 55 states, 49 states have (on average 1.3061224489795917) internal successors, (64), 54 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:17:54,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:17:54,305 INFO L93 Difference]: Finished difference Result 62 states and 68 transitions. [2021-09-13 14:17:54,305 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 68 transitions. [2021-09-13 14:17:54,305 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:17:54,306 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:17:54,306 INFO L74 IsIncluded]: Start isIncluded. First operand has 55 states, 49 states have (on average 1.3061224489795917) internal successors, (64), 54 states have internal predecessors, (64), 0 states have call successors, (0), 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 62 states. [2021-09-13 14:17:54,306 INFO L87 Difference]: Start difference. First operand has 55 states, 49 states have (on average 1.3061224489795917) internal successors, (64), 54 states have internal predecessors, (64), 0 states have call successors, (0), 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 62 states. [2021-09-13 14:17:54,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:17:54,308 INFO L93 Difference]: Finished difference Result 62 states and 68 transitions. [2021-09-13 14:17:54,308 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 68 transitions. [2021-09-13 14:17:54,308 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:17:54,308 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:17:54,308 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:17:54,308 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:17:54,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 49 states have (on average 1.3061224489795917) internal successors, (64), 54 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:17:54,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 64 transitions. [2021-09-13 14:17:54,310 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 64 transitions. Word has length 18 [2021-09-13 14:17:54,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:17:54,311 INFO L470 AbstractCegarLoop]: Abstraction has 55 states and 64 transitions. [2021-09-13 14:17:54,311 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:17:54,311 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 64 transitions. [2021-09-13 14:17:54,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-09-13 14:17:54,311 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:17:54,312 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:17:54,335 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2021-09-13 14:17:54,528 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:17:54,529 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-09-13 14:17:54,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:17:54,529 INFO L82 PathProgramCache]: Analyzing trace with hash 1862118746, now seen corresponding path program 1 times [2021-09-13 14:17:54,529 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:17:54,530 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266801929] [2021-09-13 14:17:54,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:17:54,530 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:17:54,539 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-09-13 14:17:54,540 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1811643630] [2021-09-13 14:17:54,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:17:54,540 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:17:54,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:17:54,541 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:17:54,560 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:17:54,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:17:54,594 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 5 conjunts are in the unsatisfiable core [2021-09-13 14:17:54,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:17:54,602 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:17:54,730 INFO L281 TraceCheckUtils]: 0: Hoare triple {1517#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);~counter~0 := 0; {1522#(<= ~counter~0 0)} is VALID [2021-09-13 14:17:54,730 INFO L281 TraceCheckUtils]: 1: Hoare triple {1522#(<= ~counter~0 0)} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~post10, main_~temp~0, main_#t~post9, main_~x~0, main_~y~0, main_~a~0, main_~b~0, main_~p~0, main_~q~0, main_~r~0, main_~s~0, main_~c~0, main_~k~0, main_~xy~0, main_~yy~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;havoc main_~c~0;havoc main_~k~0;havoc main_~xy~0;havoc main_~yy~0;assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647;main_~x~0 := main_#t~nondet7;havoc main_#t~nondet7;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_~x~0 >= 1 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {1522#(<= ~counter~0 0)} is VALID [2021-09-13 14:17:54,731 INFO L281 TraceCheckUtils]: 2: Hoare triple {1522#(<= ~counter~0 0)} assume !(0 == assume_abort_if_not_~cond); {1522#(<= ~counter~0 0)} is VALID [2021-09-13 14:17:54,731 INFO L281 TraceCheckUtils]: 3: Hoare triple {1522#(<= ~counter~0 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; {1522#(<= ~counter~0 0)} is VALID [2021-09-13 14:17:54,731 INFO L281 TraceCheckUtils]: 4: Hoare triple {1522#(<= ~counter~0 0)} assume !(0 == assume_abort_if_not_~cond); {1522#(<= ~counter~0 0)} is VALID [2021-09-13 14:17:54,732 INFO L281 TraceCheckUtils]: 5: Hoare triple {1522#(<= ~counter~0 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;main_~c~0 := 0;main_~k~0 := 0;main_~xy~0 := main_~x~0 * main_~y~0;main_~yy~0 := main_~y~0 * main_~y~0;assume_abort_if_not_#in~cond := (if main_~xy~0 < 2147483647 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {1522#(<= ~counter~0 0)} is VALID [2021-09-13 14:17:54,732 INFO L281 TraceCheckUtils]: 6: Hoare triple {1522#(<= ~counter~0 0)} assume !(0 == assume_abort_if_not_~cond); {1522#(<= ~counter~0 0)} is VALID [2021-09-13 14:17:54,733 INFO L281 TraceCheckUtils]: 7: Hoare triple {1522#(<= ~counter~0 0)} assume_abort_if_not_#in~cond := (if main_~yy~0 < 2147483647 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {1522#(<= ~counter~0 0)} is VALID [2021-09-13 14:17:54,733 INFO L281 TraceCheckUtils]: 8: Hoare triple {1522#(<= ~counter~0 0)} assume !(0 == assume_abort_if_not_~cond); {1522#(<= ~counter~0 0)} is VALID [2021-09-13 14:17:54,734 INFO L281 TraceCheckUtils]: 9: Hoare triple {1522#(<= ~counter~0 0)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {1550#(<= ~counter~0 1)} is VALID [2021-09-13 14:17:54,734 INFO L281 TraceCheckUtils]: 10: Hoare triple {1550#(<= ~counter~0 1)} assume !!(main_#t~post9 < 100);havoc main_#t~post9; {1550#(<= ~counter~0 1)} is VALID [2021-09-13 14:17:54,735 INFO L281 TraceCheckUtils]: 11: Hoare triple {1550#(<= ~counter~0 1)} assume !!(0 != main_~b~0);main_~c~0 := main_~a~0;main_~k~0 := 0; {1550#(<= ~counter~0 1)} is VALID [2021-09-13 14:17:54,735 INFO L281 TraceCheckUtils]: 12: Hoare triple {1550#(<= ~counter~0 1)} main_#t~post10 := ~counter~0;~counter~0 := 1 + main_#t~post10; {1560#(<= |ULTIMATE.start_main_#t~post10| 1)} is VALID [2021-09-13 14:17:54,735 INFO L281 TraceCheckUtils]: 13: Hoare triple {1560#(<= |ULTIMATE.start_main_#t~post10| 1)} assume !(main_#t~post10 < 100);havoc main_#t~post10; {1518#false} is VALID [2021-09-13 14:17:54,736 INFO L281 TraceCheckUtils]: 14: Hoare triple {1518#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; {1518#false} is VALID [2021-09-13 14:17:54,736 INFO L281 TraceCheckUtils]: 15: Hoare triple {1518#false} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {1518#false} is VALID [2021-09-13 14:17:54,736 INFO L281 TraceCheckUtils]: 16: Hoare triple {1518#false} assume !(main_#t~post9 < 100);havoc main_#t~post9; {1518#false} is VALID [2021-09-13 14:17:54,736 INFO L281 TraceCheckUtils]: 17: Hoare triple {1518#false} __VERIFIER_assert_#in~cond := (if 0 == main_~q~0 * main_~x~0 + main_~s~0 * main_~y~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1518#false} is VALID [2021-09-13 14:17:54,737 INFO L281 TraceCheckUtils]: 18: Hoare triple {1518#false} assume 0 == __VERIFIER_assert_~cond; {1518#false} is VALID [2021-09-13 14:17:54,737 INFO L281 TraceCheckUtils]: 19: Hoare triple {1518#false} assume !false; {1518#false} is VALID [2021-09-13 14:17:54,738 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:17:54,738 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-09-13 14:17:54,738 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:17:54,738 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266801929] [2021-09-13 14:17:54,738 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-09-13 14:17:54,739 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1811643630] [2021-09-13 14:17:54,739 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1811643630] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-13 14:17:54,739 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-13 14:17:54,739 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-09-13 14:17:54,739 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717111454] [2021-09-13 14:17:54,740 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 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:17:54,740 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:17:54,740 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:17:54,757 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:17:54,758 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-09-13 14:17:54,758 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:17:54,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-09-13 14:17:54,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-09-13 14:17:54,760 INFO L87 Difference]: Start difference. First operand 55 states and 64 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:17:54,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:17:54,968 INFO L93 Difference]: Finished difference Result 85 states and 97 transitions. [2021-09-13 14:17:54,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-09-13 14:17:54,969 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 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:17:54,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:17:54,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:17:54,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 81 transitions. [2021-09-13 14:17:54,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:17:54,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 81 transitions. [2021-09-13 14:17:54,972 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 81 transitions. [2021-09-13 14:17:55,031 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:17:55,032 INFO L225 Difference]: With dead ends: 85 [2021-09-13 14:17:55,032 INFO L226 Difference]: Without dead ends: 55 [2021-09-13 14:17:55,032 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 8.99ms TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-09-13 14:17:55,033 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 8 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 85.87ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.65ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 86.70ms IncrementalHoareTripleChecker+Time [2021-09-13 14:17:55,033 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 0 Invalid, 151 Unknown, 0 Unchecked, 0.65ms Time], IncrementalHoareTripleChecker [1 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 86.70ms Time] [2021-09-13 14:17:55,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2021-09-13 14:17:55,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2021-09-13 14:17:55,067 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:17:55,067 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand has 55 states, 49 states have (on average 1.2857142857142858) internal successors, (63), 54 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:17:55,067 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand has 55 states, 49 states have (on average 1.2857142857142858) internal successors, (63), 54 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:17:55,068 INFO L87 Difference]: Start difference. First operand 55 states. Second operand has 55 states, 49 states have (on average 1.2857142857142858) internal successors, (63), 54 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:17:55,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:17:55,069 INFO L93 Difference]: Finished difference Result 55 states and 63 transitions. [2021-09-13 14:17:55,069 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2021-09-13 14:17:55,074 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:17:55,074 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:17:55,074 INFO L74 IsIncluded]: Start isIncluded. First operand has 55 states, 49 states have (on average 1.2857142857142858) internal successors, (63), 54 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 55 states. [2021-09-13 14:17:55,074 INFO L87 Difference]: Start difference. First operand has 55 states, 49 states have (on average 1.2857142857142858) internal successors, (63), 54 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 55 states. [2021-09-13 14:17:55,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:17:55,076 INFO L93 Difference]: Finished difference Result 55 states and 63 transitions. [2021-09-13 14:17:55,076 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2021-09-13 14:17:55,076 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:17:55,076 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:17:55,076 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:17:55,076 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:17:55,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 49 states have (on average 1.2857142857142858) internal successors, (63), 54 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:17:55,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 63 transitions. [2021-09-13 14:17:55,078 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 63 transitions. Word has length 20 [2021-09-13 14:17:55,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:17:55,078 INFO L470 AbstractCegarLoop]: Abstraction has 55 states and 63 transitions. [2021-09-13 14:17:55,078 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:17:55,078 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2021-09-13 14:17:55,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-09-13 14:17:55,079 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:17:55,079 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] [2021-09-13 14:17:55,105 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-09-13 14:17:55,305 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:17:55,305 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-09-13 14:17:55,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:17:55,305 INFO L82 PathProgramCache]: Analyzing trace with hash -1887855967, now seen corresponding path program 1 times [2021-09-13 14:17:55,306 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:17:55,306 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556148666] [2021-09-13 14:17:55,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:17:55,306 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:17:55,315 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-09-13 14:17:55,315 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [858275988] [2021-09-13 14:17:55,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:17:55,315 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:17:55,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:17:55,317 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:17:55,318 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:17:55,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:17:55,354 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 14 conjunts are in the unsatisfiable core [2021-09-13 14:17:55,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:17:55,361 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:17:55,799 INFO L281 TraceCheckUtils]: 0: Hoare triple {1866#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);~counter~0 := 0; {1866#true} is VALID [2021-09-13 14:17:55,800 INFO L281 TraceCheckUtils]: 1: Hoare triple {1866#true} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~post10, main_~temp~0, main_#t~post9, main_~x~0, main_~y~0, main_~a~0, main_~b~0, main_~p~0, main_~q~0, main_~r~0, main_~s~0, main_~c~0, main_~k~0, main_~xy~0, main_~yy~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;havoc main_~c~0;havoc main_~k~0;havoc main_~xy~0;havoc main_~yy~0;assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647;main_~x~0 := main_#t~nondet7;havoc main_#t~nondet7;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_~x~0 >= 1 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {1874#(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:17:55,800 INFO L281 TraceCheckUtils]: 2: Hoare triple {1874#(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); {1878#(<= 1 ULTIMATE.start_main_~x~0)} is VALID [2021-09-13 14:17:55,801 INFO L281 TraceCheckUtils]: 3: Hoare triple {1878#(<= 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; {1878#(<= 1 ULTIMATE.start_main_~x~0)} is VALID [2021-09-13 14:17:55,801 INFO L281 TraceCheckUtils]: 4: Hoare triple {1878#(<= 1 ULTIMATE.start_main_~x~0)} assume !(0 == assume_abort_if_not_~cond); {1878#(<= 1 ULTIMATE.start_main_~x~0)} is VALID [2021-09-13 14:17:55,802 INFO L281 TraceCheckUtils]: 5: Hoare triple {1878#(<= 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;main_~c~0 := 0;main_~k~0 := 0;main_~xy~0 := main_~x~0 * main_~y~0;main_~yy~0 := main_~y~0 * main_~y~0;assume_abort_if_not_#in~cond := (if main_~xy~0 < 2147483647 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {1888#(and (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~s~0 1) (<= 1 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:17:55,802 INFO L281 TraceCheckUtils]: 6: Hoare triple {1888#(and (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~s~0 1) (<= 1 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} assume !(0 == assume_abort_if_not_~cond); {1888#(and (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~s~0 1) (<= 1 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:17:55,803 INFO L281 TraceCheckUtils]: 7: Hoare triple {1888#(and (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~s~0 1) (<= 1 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} assume_abort_if_not_#in~cond := (if main_~yy~0 < 2147483647 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {1888#(and (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~s~0 1) (<= 1 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:17:55,803 INFO L281 TraceCheckUtils]: 8: Hoare triple {1888#(and (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~s~0 1) (<= 1 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} assume !(0 == assume_abort_if_not_~cond); {1888#(and (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~s~0 1) (<= 1 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:17:55,804 INFO L281 TraceCheckUtils]: 9: Hoare triple {1888#(and (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~s~0 1) (<= 1 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {1888#(and (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~s~0 1) (<= 1 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:17:55,807 INFO L281 TraceCheckUtils]: 10: Hoare triple {1888#(and (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~s~0 1) (<= 1 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} assume !!(main_#t~post9 < 100);havoc main_#t~post9; {1888#(and (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~s~0 1) (<= 1 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:17:55,807 INFO L281 TraceCheckUtils]: 11: Hoare triple {1888#(and (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~s~0 1) (<= 1 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} assume !!(0 != main_~b~0);main_~c~0 := main_~a~0;main_~k~0 := 0; {1888#(and (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~s~0 1) (<= 1 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:17:55,808 INFO L281 TraceCheckUtils]: 12: Hoare triple {1888#(and (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~s~0 1) (<= 1 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} main_#t~post10 := ~counter~0;~counter~0 := 1 + main_#t~post10; {1888#(and (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~s~0 1) (<= 1 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:17:55,808 INFO L281 TraceCheckUtils]: 13: Hoare triple {1888#(and (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~s~0 1) (<= 1 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} assume !!(main_#t~post10 < 100);havoc main_#t~post10;__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; {1888#(and (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~s~0 1) (<= 1 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:17:55,809 INFO L281 TraceCheckUtils]: 14: Hoare triple {1888#(and (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~s~0 1) (<= 1 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} assume !(0 == __VERIFIER_assert_~cond); {1888#(and (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~s~0 1) (<= 1 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:17:55,809 INFO L281 TraceCheckUtils]: 15: Hoare triple {1888#(and (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~s~0 1) (<= 1 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} __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; {1888#(and (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~s~0 1) (<= 1 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:17:55,811 INFO L281 TraceCheckUtils]: 16: Hoare triple {1888#(and (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~s~0 1) (<= 1 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} assume !(0 == __VERIFIER_assert_~cond); {1888#(and (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~s~0 1) (<= 1 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:17:55,811 INFO L281 TraceCheckUtils]: 17: Hoare triple {1888#(and (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~s~0 1) (<= 1 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} __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; {1925#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} is VALID [2021-09-13 14:17:55,811 INFO L281 TraceCheckUtils]: 18: Hoare triple {1925#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} assume 0 == __VERIFIER_assert_~cond; {1867#false} is VALID [2021-09-13 14:17:55,812 INFO L281 TraceCheckUtils]: 19: Hoare triple {1867#false} assume !false; {1867#false} is VALID [2021-09-13 14:17:55,812 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:17:55,812 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-09-13 14:17:55,812 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:17:55,812 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556148666] [2021-09-13 14:17:55,812 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-09-13 14:17:55,812 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [858275988] [2021-09-13 14:17:55,813 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [858275988] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-13 14:17:55,813 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-13 14:17:55,813 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-09-13 14:17:55,813 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947810666] [2021-09-13 14:17:55,813 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 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:17:55,813 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:17:55,814 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:17:55,829 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:17:55,830 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-09-13 14:17:55,830 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:17:55,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-09-13 14:17:55,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-09-13 14:17:55,830 INFO L87 Difference]: Start difference. First operand 55 states and 63 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:17:56,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:17:56,137 INFO L93 Difference]: Finished difference Result 62 states and 67 transitions. [2021-09-13 14:17:56,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-09-13 14:17:56,138 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 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:17:56,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:17:56,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:17:56,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 64 transitions. [2021-09-13 14:17:56,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:17:56,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 64 transitions. [2021-09-13 14:17:56,139 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 64 transitions. [2021-09-13 14:17:56,193 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:17:56,194 INFO L225 Difference]: With dead ends: 62 [2021-09-13 14:17:56,194 INFO L226 Difference]: Without dead ends: 60 [2021-09-13 14:17:56,194 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 58.42ms TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-09-13 14:17:56,195 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 67 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 113.90ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.95ms SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 114.89ms IncrementalHoareTripleChecker+Time [2021-09-13 14:17:56,195 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [67 Valid, 0 Invalid, 165 Unknown, 0 Unchecked, 0.95ms Time], IncrementalHoareTripleChecker [3 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 114.89ms Time] [2021-09-13 14:17:56,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2021-09-13 14:17:56,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 55. [2021-09-13 14:17:56,245 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:17:56,245 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand has 55 states, 49 states have (on average 1.2653061224489797) internal successors, (62), 54 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:17:56,246 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand has 55 states, 49 states have (on average 1.2653061224489797) internal successors, (62), 54 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:17:56,246 INFO L87 Difference]: Start difference. First operand 60 states. Second operand has 55 states, 49 states have (on average 1.2653061224489797) internal successors, (62), 54 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:17:56,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:17:56,247 INFO L93 Difference]: Finished difference Result 60 states and 65 transitions. [2021-09-13 14:17:56,247 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 65 transitions. [2021-09-13 14:17:56,248 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:17:56,248 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:17:56,248 INFO L74 IsIncluded]: Start isIncluded. First operand has 55 states, 49 states have (on average 1.2653061224489797) internal successors, (62), 54 states have internal predecessors, (62), 0 states have call successors, (0), 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:17:56,248 INFO L87 Difference]: Start difference. First operand has 55 states, 49 states have (on average 1.2653061224489797) internal successors, (62), 54 states have internal predecessors, (62), 0 states have call successors, (0), 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:17:56,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:17:56,250 INFO L93 Difference]: Finished difference Result 60 states and 65 transitions. [2021-09-13 14:17:56,250 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 65 transitions. [2021-09-13 14:17:56,250 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:17:56,250 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:17:56,250 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:17:56,250 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:17:56,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 49 states have (on average 1.2653061224489797) internal successors, (62), 54 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:17:56,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 62 transitions. [2021-09-13 14:17:56,252 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 62 transitions. Word has length 20 [2021-09-13 14:17:56,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:17:56,252 INFO L470 AbstractCegarLoop]: Abstraction has 55 states and 62 transitions. [2021-09-13 14:17:56,252 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:17:56,252 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 62 transitions. [2021-09-13 14:17:56,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-09-13 14:17:56,253 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:17:56,253 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] [2021-09-13 14:17:56,276 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:17:56,470 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:17:56,471 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-09-13 14:17:56,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:17:56,471 INFO L82 PathProgramCache]: Analyzing trace with hash -1753227772, now seen corresponding path program 1 times [2021-09-13 14:17:56,471 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:17:56,472 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807059792] [2021-09-13 14:17:56,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:17:56,472 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:17:56,480 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-09-13 14:17:56,480 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1929802195] [2021-09-13 14:17:56,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:17:56,480 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:17:56,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:17:56,481 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:17:56,482 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:17:56,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:17:56,520 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 18 conjunts are in the unsatisfiable core [2021-09-13 14:17:56,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:17:56,531 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:17:56,988 INFO L281 TraceCheckUtils]: 0: Hoare triple {2200#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);~counter~0 := 0; {2200#true} is VALID [2021-09-13 14:17:56,988 INFO L281 TraceCheckUtils]: 1: Hoare triple {2200#true} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~post10, main_~temp~0, main_#t~post9, main_~x~0, main_~y~0, main_~a~0, main_~b~0, main_~p~0, main_~q~0, main_~r~0, main_~s~0, main_~c~0, main_~k~0, main_~xy~0, main_~yy~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;havoc main_~c~0;havoc main_~k~0;havoc main_~xy~0;havoc main_~yy~0;assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647;main_~x~0 := main_#t~nondet7;havoc main_#t~nondet7;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_~x~0 >= 1 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {2200#true} is VALID [2021-09-13 14:17:56,988 INFO L281 TraceCheckUtils]: 2: Hoare triple {2200#true} assume !(0 == assume_abort_if_not_~cond); {2200#true} is VALID [2021-09-13 14:17:56,988 INFO L281 TraceCheckUtils]: 3: Hoare triple {2200#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; {2200#true} is VALID [2021-09-13 14:17:56,988 INFO L281 TraceCheckUtils]: 4: Hoare triple {2200#true} assume !(0 == assume_abort_if_not_~cond); {2200#true} is VALID [2021-09-13 14:17:56,997 INFO L281 TraceCheckUtils]: 5: Hoare triple {2200#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;main_~c~0 := 0;main_~k~0 := 0;main_~xy~0 := main_~x~0 * main_~y~0;main_~yy~0 := main_~y~0 * main_~y~0;assume_abort_if_not_#in~cond := (if main_~xy~0 < 2147483647 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {2220#(and (= ULTIMATE.start_main_~yy~0 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:17:56,998 INFO L281 TraceCheckUtils]: 6: Hoare triple {2220#(and (= ULTIMATE.start_main_~yy~0 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} assume !(0 == assume_abort_if_not_~cond); {2220#(and (= ULTIMATE.start_main_~yy~0 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:17:57,005 INFO L281 TraceCheckUtils]: 7: Hoare triple {2220#(and (= ULTIMATE.start_main_~yy~0 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} assume_abort_if_not_#in~cond := (if main_~yy~0 < 2147483647 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {2220#(and (= ULTIMATE.start_main_~yy~0 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:17:57,005 INFO L281 TraceCheckUtils]: 8: Hoare triple {2220#(and (= ULTIMATE.start_main_~yy~0 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} assume !(0 == assume_abort_if_not_~cond); {2220#(and (= ULTIMATE.start_main_~yy~0 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:17:57,006 INFO L281 TraceCheckUtils]: 9: Hoare triple {2220#(and (= ULTIMATE.start_main_~yy~0 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {2220#(and (= ULTIMATE.start_main_~yy~0 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:17:57,006 INFO L281 TraceCheckUtils]: 10: Hoare triple {2220#(and (= ULTIMATE.start_main_~yy~0 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} assume !!(main_#t~post9 < 100);havoc main_#t~post9; {2220#(and (= ULTIMATE.start_main_~yy~0 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:17:57,007 INFO L281 TraceCheckUtils]: 11: Hoare triple {2220#(and (= ULTIMATE.start_main_~yy~0 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} assume !!(0 != main_~b~0);main_~c~0 := main_~a~0;main_~k~0 := 0; {2220#(and (= ULTIMATE.start_main_~yy~0 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:17:57,008 INFO L281 TraceCheckUtils]: 12: Hoare triple {2220#(and (= ULTIMATE.start_main_~yy~0 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} main_#t~post10 := ~counter~0;~counter~0 := 1 + main_#t~post10; {2220#(and (= ULTIMATE.start_main_~yy~0 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:17:57,008 INFO L281 TraceCheckUtils]: 13: Hoare triple {2220#(and (= ULTIMATE.start_main_~yy~0 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} assume !!(main_#t~post10 < 100);havoc main_#t~post10;__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; {2220#(and (= ULTIMATE.start_main_~yy~0 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:17:57,009 INFO L281 TraceCheckUtils]: 14: Hoare triple {2220#(and (= ULTIMATE.start_main_~yy~0 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} assume !(0 == __VERIFIER_assert_~cond); {2220#(and (= ULTIMATE.start_main_~yy~0 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:17:57,009 INFO L281 TraceCheckUtils]: 15: Hoare triple {2220#(and (= ULTIMATE.start_main_~yy~0 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} __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; {2220#(and (= ULTIMATE.start_main_~yy~0 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:17:57,010 INFO L281 TraceCheckUtils]: 16: Hoare triple {2220#(and (= ULTIMATE.start_main_~yy~0 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} assume !(0 == __VERIFIER_assert_~cond); {2220#(and (= ULTIMATE.start_main_~yy~0 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:17:57,011 INFO L281 TraceCheckUtils]: 17: Hoare triple {2220#(and (= ULTIMATE.start_main_~yy~0 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} __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; {2257#(and (= 1 ULTIMATE.start___VERIFIER_assert_~cond) (= ULTIMATE.start_main_~yy~0 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:17:57,011 INFO L281 TraceCheckUtils]: 18: Hoare triple {2257#(and (= 1 ULTIMATE.start___VERIFIER_assert_~cond) (= ULTIMATE.start_main_~yy~0 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} assume !(0 == __VERIFIER_assert_~cond); {2220#(and (= ULTIMATE.start_main_~yy~0 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:17:57,012 INFO L281 TraceCheckUtils]: 19: Hoare triple {2220#(and (= ULTIMATE.start_main_~yy~0 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} __VERIFIER_assert_#in~cond := (if 0 == main_~q~0 * main_~xy~0 + main_~s~0 * main_~yy~0 - main_~q~0 * main_~x~0 - main_~b~0 * main_~y~0 - main_~s~0 * main_~y~0 + main_~b~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {2264#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} is VALID [2021-09-13 14:17:57,012 INFO L281 TraceCheckUtils]: 20: Hoare triple {2264#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} assume 0 == __VERIFIER_assert_~cond; {2201#false} is VALID [2021-09-13 14:17:57,018 INFO L281 TraceCheckUtils]: 21: Hoare triple {2201#false} assume !false; {2201#false} is VALID [2021-09-13 14:17:57,018 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:17:57,018 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-09-13 14:17:57,019 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:17:57,019 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807059792] [2021-09-13 14:17:57,019 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-09-13 14:17:57,019 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1929802195] [2021-09-13 14:17:57,019 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1929802195] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-13 14:17:57,019 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-13 14:17:57,019 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-09-13 14:17:57,020 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120060592] [2021-09-13 14:17:57,020 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 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 22 [2021-09-13 14:17:57,020 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:17:57,021 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 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:17:57,040 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:17:57,040 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-09-13 14:17:57,040 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:17:57,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-09-13 14:17:57,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-09-13 14:17:57,041 INFO L87 Difference]: Start difference. First operand 55 states and 62 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 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:17:57,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:17:57,308 INFO L93 Difference]: Finished difference Result 67 states and 75 transitions. [2021-09-13 14:17:57,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-09-13 14:17:57,308 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 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 22 [2021-09-13 14:17:57,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:17:57,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 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:17:57,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 74 transitions. [2021-09-13 14:17:57,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 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:17:57,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 74 transitions. [2021-09-13 14:17:57,311 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 74 transitions. [2021-09-13 14:17:57,373 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:17:57,374 INFO L225 Difference]: With dead ends: 67 [2021-09-13 14:17:57,374 INFO L226 Difference]: Without dead ends: 65 [2021-09-13 14:17:57,374 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 24.03ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-09-13 14:17:57,375 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 23 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 98.66ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.64ms SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 100.08ms IncrementalHoareTripleChecker+Time [2021-09-13 14:17:57,375 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 0 Invalid, 139 Unknown, 0 Unchecked, 0.64ms Time], IncrementalHoareTripleChecker [3 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 100.08ms Time] [2021-09-13 14:17:57,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2021-09-13 14:17:57,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 55. [2021-09-13 14:17:57,440 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:17:57,441 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand has 55 states, 49 states have (on average 1.2448979591836735) internal successors, (61), 54 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:17:57,441 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand has 55 states, 49 states have (on average 1.2448979591836735) internal successors, (61), 54 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:17:57,441 INFO L87 Difference]: Start difference. First operand 65 states. Second operand has 55 states, 49 states have (on average 1.2448979591836735) internal successors, (61), 54 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:17:57,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:17:57,443 INFO L93 Difference]: Finished difference Result 65 states and 73 transitions. [2021-09-13 14:17:57,443 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 73 transitions. [2021-09-13 14:17:57,443 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:17:57,443 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:17:57,444 INFO L74 IsIncluded]: Start isIncluded. First operand has 55 states, 49 states have (on average 1.2448979591836735) internal successors, (61), 54 states have internal predecessors, (61), 0 states have call successors, (0), 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 65 states. [2021-09-13 14:17:57,444 INFO L87 Difference]: Start difference. First operand has 55 states, 49 states have (on average 1.2448979591836735) internal successors, (61), 54 states have internal predecessors, (61), 0 states have call successors, (0), 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 65 states. [2021-09-13 14:17:57,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:17:57,445 INFO L93 Difference]: Finished difference Result 65 states and 73 transitions. [2021-09-13 14:17:57,445 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 73 transitions. [2021-09-13 14:17:57,446 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:17:57,446 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:17:57,446 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:17:57,446 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:17:57,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 49 states have (on average 1.2448979591836735) internal successors, (61), 54 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:17:57,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 61 transitions. [2021-09-13 14:17:57,447 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 61 transitions. Word has length 22 [2021-09-13 14:17:57,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:17:57,448 INFO L470 AbstractCegarLoop]: Abstraction has 55 states and 61 transitions. [2021-09-13 14:17:57,448 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 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:17:57,448 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 61 transitions. [2021-09-13 14:17:57,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-09-13 14:17:57,448 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:17:57,449 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] [2021-09-13 14:17:57,475 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-09-13 14:17:57,649 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:17:57,649 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-09-13 14:17:57,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:17:57,650 INFO L82 PathProgramCache]: Analyzing trace with hash 29719088, now seen corresponding path program 1 times [2021-09-13 14:17:57,650 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:17:57,650 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629714929] [2021-09-13 14:17:57,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:17:57,650 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:17:57,659 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-09-13 14:17:57,659 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [224341085] [2021-09-13 14:17:57,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:17:57,659 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:17:57,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:17:57,662 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:17:57,663 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:17:57,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:17:57,712 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 11 conjunts are in the unsatisfiable core [2021-09-13 14:17:57,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:17:57,723 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:17:58,000 INFO L281 TraceCheckUtils]: 0: Hoare triple {2552#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);~counter~0 := 0; {2552#true} is VALID [2021-09-13 14:17:58,001 INFO L281 TraceCheckUtils]: 1: Hoare triple {2552#true} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~post10, main_~temp~0, main_#t~post9, main_~x~0, main_~y~0, main_~a~0, main_~b~0, main_~p~0, main_~q~0, main_~r~0, main_~s~0, main_~c~0, main_~k~0, main_~xy~0, main_~yy~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;havoc main_~c~0;havoc main_~k~0;havoc main_~xy~0;havoc main_~yy~0;assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647;main_~x~0 := main_#t~nondet7;havoc main_#t~nondet7;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_~x~0 >= 1 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {2552#true} is VALID [2021-09-13 14:17:58,001 INFO L281 TraceCheckUtils]: 2: Hoare triple {2552#true} assume !(0 == assume_abort_if_not_~cond); {2552#true} is VALID [2021-09-13 14:17:58,001 INFO L281 TraceCheckUtils]: 3: Hoare triple {2552#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; {2552#true} is VALID [2021-09-13 14:17:58,001 INFO L281 TraceCheckUtils]: 4: Hoare triple {2552#true} assume !(0 == assume_abort_if_not_~cond); {2552#true} is VALID [2021-09-13 14:17:58,001 INFO L281 TraceCheckUtils]: 5: Hoare triple {2552#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;main_~c~0 := 0;main_~k~0 := 0;main_~xy~0 := main_~x~0 * main_~y~0;main_~yy~0 := main_~y~0 * main_~y~0;assume_abort_if_not_#in~cond := (if main_~xy~0 < 2147483647 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {2552#true} is VALID [2021-09-13 14:17:58,002 INFO L281 TraceCheckUtils]: 6: Hoare triple {2552#true} assume !(0 == assume_abort_if_not_~cond); {2552#true} is VALID [2021-09-13 14:17:58,002 INFO L281 TraceCheckUtils]: 7: Hoare triple {2552#true} assume_abort_if_not_#in~cond := (if main_~yy~0 < 2147483647 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {2552#true} is VALID [2021-09-13 14:17:58,002 INFO L281 TraceCheckUtils]: 8: Hoare triple {2552#true} assume !(0 == assume_abort_if_not_~cond); {2552#true} is VALID [2021-09-13 14:17:58,002 INFO L281 TraceCheckUtils]: 9: Hoare triple {2552#true} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {2552#true} is VALID [2021-09-13 14:17:58,002 INFO L281 TraceCheckUtils]: 10: Hoare triple {2552#true} assume !!(main_#t~post9 < 100);havoc main_#t~post9; {2552#true} is VALID [2021-09-13 14:17:58,003 INFO L281 TraceCheckUtils]: 11: Hoare triple {2552#true} assume !!(0 != main_~b~0);main_~c~0 := main_~a~0;main_~k~0 := 0; {2590#(and (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0))} is VALID [2021-09-13 14:17:58,003 INFO L281 TraceCheckUtils]: 12: Hoare triple {2590#(and (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0))} main_#t~post10 := ~counter~0;~counter~0 := 1 + main_#t~post10; {2590#(and (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0))} is VALID [2021-09-13 14:17:58,004 INFO L281 TraceCheckUtils]: 13: Hoare triple {2590#(and (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0))} assume !!(main_#t~post10 < 100);havoc main_#t~post10;__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; {2590#(and (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0))} is VALID [2021-09-13 14:17:58,004 INFO L281 TraceCheckUtils]: 14: Hoare triple {2590#(and (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0))} assume !(0 == __VERIFIER_assert_~cond); {2590#(and (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0))} is VALID [2021-09-13 14:17:58,005 INFO L281 TraceCheckUtils]: 15: Hoare triple {2590#(and (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0))} __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; {2590#(and (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0))} is VALID [2021-09-13 14:17:58,006 INFO L281 TraceCheckUtils]: 16: Hoare triple {2590#(and (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0))} assume !(0 == __VERIFIER_assert_~cond); {2590#(and (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0))} is VALID [2021-09-13 14:17:58,006 INFO L281 TraceCheckUtils]: 17: Hoare triple {2590#(and (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0))} __VERIFIER_assert_#in~cond := (if main_~b~0 == main_~x~0 * main_~q~0 + main_~y~0 * main_~s~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {2590#(and (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0))} is VALID [2021-09-13 14:17:58,008 INFO L281 TraceCheckUtils]: 18: Hoare triple {2590#(and (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0))} assume !(0 == __VERIFIER_assert_~cond); {2590#(and (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0))} is VALID [2021-09-13 14:17:58,008 INFO L281 TraceCheckUtils]: 19: Hoare triple {2590#(and (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0))} __VERIFIER_assert_#in~cond := (if 0 == main_~q~0 * main_~xy~0 + main_~s~0 * main_~yy~0 - main_~q~0 * main_~x~0 - main_~b~0 * main_~y~0 - main_~s~0 * main_~y~0 + main_~b~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {2590#(and (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0))} is VALID [2021-09-13 14:17:58,009 INFO L281 TraceCheckUtils]: 20: Hoare triple {2590#(and (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0))} assume !(0 == __VERIFIER_assert_~cond); {2590#(and (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0))} is VALID [2021-09-13 14:17:58,009 INFO L281 TraceCheckUtils]: 21: Hoare triple {2590#(and (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0))} assume !!(main_~c~0 >= main_~b~0);main_~c~0 := main_~c~0 - main_~b~0;main_~k~0 := 1 + main_~k~0; {2621#(and (= ULTIMATE.start_main_~a~0 (+ ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~b~0)) (= ULTIMATE.start_main_~k~0 1))} is VALID [2021-09-13 14:17:58,010 INFO L281 TraceCheckUtils]: 22: Hoare triple {2621#(and (= ULTIMATE.start_main_~a~0 (+ ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~b~0)) (= ULTIMATE.start_main_~k~0 1))} main_#t~post10 := ~counter~0;~counter~0 := 1 + main_#t~post10; {2621#(and (= ULTIMATE.start_main_~a~0 (+ ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~b~0)) (= ULTIMATE.start_main_~k~0 1))} is VALID [2021-09-13 14:17:58,011 INFO L281 TraceCheckUtils]: 23: Hoare triple {2621#(and (= ULTIMATE.start_main_~a~0 (+ ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~b~0)) (= ULTIMATE.start_main_~k~0 1))} assume !!(main_#t~post10 < 100);havoc main_#t~post10;__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; {2628#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} is VALID [2021-09-13 14:17:58,011 INFO L281 TraceCheckUtils]: 24: Hoare triple {2628#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} assume 0 == __VERIFIER_assert_~cond; {2553#false} is VALID [2021-09-13 14:17:58,011 INFO L281 TraceCheckUtils]: 25: Hoare triple {2553#false} assume !false; {2553#false} is VALID [2021-09-13 14:17:58,012 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:17:58,012 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 14:18:23,523 INFO L281 TraceCheckUtils]: 25: Hoare triple {2553#false} assume !false; {2553#false} is VALID [2021-09-13 14:18:23,524 INFO L281 TraceCheckUtils]: 24: Hoare triple {2628#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} assume 0 == __VERIFIER_assert_~cond; {2553#false} is VALID [2021-09-13 14:18:23,524 INFO L281 TraceCheckUtils]: 23: Hoare triple {2641#(= (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) ULTIMATE.start_main_~a~0)} assume !!(main_#t~post10 < 100);havoc main_#t~post10;__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; {2628#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} is VALID [2021-09-13 14:18:23,525 INFO L281 TraceCheckUtils]: 22: Hoare triple {2641#(= (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) ULTIMATE.start_main_~a~0)} main_#t~post10 := ~counter~0;~counter~0 := 1 + main_#t~post10; {2641#(= (+ 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:18:23,525 INFO L281 TraceCheckUtils]: 21: Hoare triple {2590#(and (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0))} assume !!(main_~c~0 >= main_~b~0);main_~c~0 := main_~c~0 - main_~b~0;main_~k~0 := 1 + main_~k~0; {2641#(= (+ 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:18:23,526 INFO L281 TraceCheckUtils]: 20: Hoare triple {2590#(and (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0))} assume !(0 == __VERIFIER_assert_~cond); {2590#(and (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0))} is VALID [2021-09-13 14:18:23,526 INFO L281 TraceCheckUtils]: 19: Hoare triple {2590#(and (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0))} __VERIFIER_assert_#in~cond := (if 0 == main_~q~0 * main_~xy~0 + main_~s~0 * main_~yy~0 - main_~q~0 * main_~x~0 - main_~b~0 * main_~y~0 - main_~s~0 * main_~y~0 + main_~b~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {2590#(and (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0))} is VALID [2021-09-13 14:18:23,527 INFO L281 TraceCheckUtils]: 18: Hoare triple {2590#(and (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0))} assume !(0 == __VERIFIER_assert_~cond); {2590#(and (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0))} is VALID [2021-09-13 14:18:23,527 INFO L281 TraceCheckUtils]: 17: Hoare triple {2590#(and (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0))} __VERIFIER_assert_#in~cond := (if main_~b~0 == main_~x~0 * main_~q~0 + main_~y~0 * main_~s~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {2590#(and (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0))} is VALID [2021-09-13 14:18:23,528 INFO L281 TraceCheckUtils]: 16: Hoare triple {2590#(and (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0))} assume !(0 == __VERIFIER_assert_~cond); {2590#(and (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0))} is VALID [2021-09-13 14:18:23,528 INFO L281 TraceCheckUtils]: 15: Hoare triple {2590#(and (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0))} __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; {2590#(and (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0))} is VALID [2021-09-13 14:18:23,529 INFO L281 TraceCheckUtils]: 14: Hoare triple {2590#(and (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0))} assume !(0 == __VERIFIER_assert_~cond); {2590#(and (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0))} is VALID [2021-09-13 14:18:23,529 INFO L281 TraceCheckUtils]: 13: Hoare triple {2590#(and (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0))} assume !!(main_#t~post10 < 100);havoc main_#t~post10;__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; {2590#(and (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0))} is VALID [2021-09-13 14:18:23,530 INFO L281 TraceCheckUtils]: 12: Hoare triple {2590#(and (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0))} main_#t~post10 := ~counter~0;~counter~0 := 1 + main_#t~post10; {2590#(and (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0))} is VALID [2021-09-13 14:18:23,530 INFO L281 TraceCheckUtils]: 11: Hoare triple {2552#true} assume !!(0 != main_~b~0);main_~c~0 := main_~a~0;main_~k~0 := 0; {2590#(and (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0))} is VALID [2021-09-13 14:18:23,530 INFO L281 TraceCheckUtils]: 10: Hoare triple {2552#true} assume !!(main_#t~post9 < 100);havoc main_#t~post9; {2552#true} is VALID [2021-09-13 14:18:23,531 INFO L281 TraceCheckUtils]: 9: Hoare triple {2552#true} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {2552#true} is VALID [2021-09-13 14:18:23,531 INFO L281 TraceCheckUtils]: 8: Hoare triple {2552#true} assume !(0 == assume_abort_if_not_~cond); {2552#true} is VALID [2021-09-13 14:18:23,531 INFO L281 TraceCheckUtils]: 7: Hoare triple {2552#true} assume_abort_if_not_#in~cond := (if main_~yy~0 < 2147483647 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {2552#true} is VALID [2021-09-13 14:18:23,531 INFO L281 TraceCheckUtils]: 6: Hoare triple {2552#true} assume !(0 == assume_abort_if_not_~cond); {2552#true} is VALID [2021-09-13 14:18:23,531 INFO L281 TraceCheckUtils]: 5: Hoare triple {2552#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;main_~c~0 := 0;main_~k~0 := 0;main_~xy~0 := main_~x~0 * main_~y~0;main_~yy~0 := main_~y~0 * main_~y~0;assume_abort_if_not_#in~cond := (if main_~xy~0 < 2147483647 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {2552#true} is VALID [2021-09-13 14:18:23,531 INFO L281 TraceCheckUtils]: 4: Hoare triple {2552#true} assume !(0 == assume_abort_if_not_~cond); {2552#true} is VALID [2021-09-13 14:18:23,531 INFO L281 TraceCheckUtils]: 3: Hoare triple {2552#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; {2552#true} is VALID [2021-09-13 14:18:23,532 INFO L281 TraceCheckUtils]: 2: Hoare triple {2552#true} assume !(0 == assume_abort_if_not_~cond); {2552#true} is VALID [2021-09-13 14:18:23,532 INFO L281 TraceCheckUtils]: 1: Hoare triple {2552#true} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~post10, main_~temp~0, main_#t~post9, main_~x~0, main_~y~0, main_~a~0, main_~b~0, main_~p~0, main_~q~0, main_~r~0, main_~s~0, main_~c~0, main_~k~0, main_~xy~0, main_~yy~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;havoc main_~c~0;havoc main_~k~0;havoc main_~xy~0;havoc main_~yy~0;assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647;main_~x~0 := main_#t~nondet7;havoc main_#t~nondet7;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_~x~0 >= 1 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {2552#true} is VALID [2021-09-13 14:18:23,532 INFO L281 TraceCheckUtils]: 0: Hoare triple {2552#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);~counter~0 := 0; {2552#true} is VALID [2021-09-13 14:18:23,532 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:18:23,532 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:18:23,532 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629714929] [2021-09-13 14:18:23,532 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-09-13 14:18:23,532 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [224341085] [2021-09-13 14:18:23,533 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [224341085] provided 0 perfect and 2 imperfect interpolant sequences [2021-09-13 14:18:23,533 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-09-13 14:18:23,533 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2021-09-13 14:18:23,533 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528139487] [2021-09-13 14:18:23,533 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-09-13 14:18:23,534 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:18:23,534 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:18:23,570 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:18:23,571 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-09-13 14:18:23,571 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:18:23,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-09-13 14:18:23,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-09-13 14:18:23,572 INFO L87 Difference]: Start difference. First operand 55 states and 61 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:18:24,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:18:24,082 INFO L93 Difference]: Finished difference Result 106 states and 122 transitions. [2021-09-13 14:18:24,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-09-13 14:18:24,082 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-09-13 14:18:24,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:18:24,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:18:24,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 82 transitions. [2021-09-13 14:18:24,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:18:24,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 82 transitions. [2021-09-13 14:18:24,085 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 82 transitions. [2021-09-13 14:18:24,143 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:18:24,144 INFO L225 Difference]: With dead ends: 106 [2021-09-13 14:18:24,145 INFO L226 Difference]: Without dead ends: 104 [2021-09-13 14:18:24,145 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 57.54ms TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-09-13 14:18:24,146 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 48 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 168.96ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.23ms SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 170.51ms IncrementalHoareTripleChecker+Time [2021-09-13 14:18:24,146 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 0 Invalid, 224 Unknown, 0 Unchecked, 1.23ms Time], IncrementalHoareTripleChecker [6 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 170.51ms Time] [2021-09-13 14:18:24,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2021-09-13 14:18:24,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 52. [2021-09-13 14:18:24,215 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:18:24,215 INFO L82 GeneralOperation]: Start isEquivalent. First operand 104 states. Second operand has 52 states, 47 states have (on average 1.2127659574468086) internal successors, (57), 51 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:18:24,215 INFO L74 IsIncluded]: Start isIncluded. First operand 104 states. Second operand has 52 states, 47 states have (on average 1.2127659574468086) internal successors, (57), 51 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:18:24,215 INFO L87 Difference]: Start difference. First operand 104 states. Second operand has 52 states, 47 states have (on average 1.2127659574468086) internal successors, (57), 51 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:18:24,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:18:24,218 INFO L93 Difference]: Finished difference Result 104 states and 116 transitions. [2021-09-13 14:18:24,218 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 116 transitions. [2021-09-13 14:18:24,218 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:18:24,218 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:18:24,219 INFO L74 IsIncluded]: Start isIncluded. First operand has 52 states, 47 states have (on average 1.2127659574468086) internal successors, (57), 51 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 104 states. [2021-09-13 14:18:24,219 INFO L87 Difference]: Start difference. First operand has 52 states, 47 states have (on average 1.2127659574468086) internal successors, (57), 51 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 104 states. [2021-09-13 14:18:24,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:18:24,221 INFO L93 Difference]: Finished difference Result 104 states and 116 transitions. [2021-09-13 14:18:24,221 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 116 transitions. [2021-09-13 14:18:24,222 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:18:24,222 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:18:24,222 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:18:24,222 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:18:24,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 47 states have (on average 1.2127659574468086) internal successors, (57), 51 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:18:24,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2021-09-13 14:18:24,224 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 26 [2021-09-13 14:18:24,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:18:24,224 INFO L470 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2021-09-13 14:18:24,224 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:18:24,224 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2021-09-13 14:18:24,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-09-13 14:18:24,225 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:18:24,225 INFO L513 BasicCegarLoop]: trace histogram [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] [2021-09-13 14:18:24,253 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:18:24,448 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:18:24,449 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-09-13 14:18:24,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:18:24,450 INFO L82 PathProgramCache]: Analyzing trace with hash -1666886870, now seen corresponding path program 1 times [2021-09-13 14:18:24,450 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:18:24,450 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89535441] [2021-09-13 14:18:24,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:18:24,450 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:18:24,457 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-09-13 14:18:24,457 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [105046071] [2021-09-13 14:18:24,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:18:24,458 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:18:24,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:18:24,462 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:18:24,463 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:18:24,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:18:24,503 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 7 conjunts are in the unsatisfiable core [2021-09-13 14:18:24,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:18:24,511 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:18:24,698 INFO L281 TraceCheckUtils]: 0: Hoare triple {3129#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);~counter~0 := 0; {3134#(<= ~counter~0 0)} is VALID [2021-09-13 14:18:24,699 INFO L281 TraceCheckUtils]: 1: Hoare triple {3134#(<= ~counter~0 0)} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~post10, main_~temp~0, main_#t~post9, main_~x~0, main_~y~0, main_~a~0, main_~b~0, main_~p~0, main_~q~0, main_~r~0, main_~s~0, main_~c~0, main_~k~0, main_~xy~0, main_~yy~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;havoc main_~c~0;havoc main_~k~0;havoc main_~xy~0;havoc main_~yy~0;assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647;main_~x~0 := main_#t~nondet7;havoc main_#t~nondet7;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_~x~0 >= 1 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {3134#(<= ~counter~0 0)} is VALID [2021-09-13 14:18:24,699 INFO L281 TraceCheckUtils]: 2: Hoare triple {3134#(<= ~counter~0 0)} assume !(0 == assume_abort_if_not_~cond); {3134#(<= ~counter~0 0)} is VALID [2021-09-13 14:18:24,699 INFO L281 TraceCheckUtils]: 3: Hoare triple {3134#(<= ~counter~0 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; {3134#(<= ~counter~0 0)} is VALID [2021-09-13 14:18:24,700 INFO L281 TraceCheckUtils]: 4: Hoare triple {3134#(<= ~counter~0 0)} assume !(0 == assume_abort_if_not_~cond); {3134#(<= ~counter~0 0)} is VALID [2021-09-13 14:18:24,700 INFO L281 TraceCheckUtils]: 5: Hoare triple {3134#(<= ~counter~0 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;main_~c~0 := 0;main_~k~0 := 0;main_~xy~0 := main_~x~0 * main_~y~0;main_~yy~0 := main_~y~0 * main_~y~0;assume_abort_if_not_#in~cond := (if main_~xy~0 < 2147483647 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {3134#(<= ~counter~0 0)} is VALID [2021-09-13 14:18:24,700 INFO L281 TraceCheckUtils]: 6: Hoare triple {3134#(<= ~counter~0 0)} assume !(0 == assume_abort_if_not_~cond); {3134#(<= ~counter~0 0)} is VALID [2021-09-13 14:18:24,701 INFO L281 TraceCheckUtils]: 7: Hoare triple {3134#(<= ~counter~0 0)} assume_abort_if_not_#in~cond := (if main_~yy~0 < 2147483647 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {3134#(<= ~counter~0 0)} is VALID [2021-09-13 14:18:24,701 INFO L281 TraceCheckUtils]: 8: Hoare triple {3134#(<= ~counter~0 0)} assume !(0 == assume_abort_if_not_~cond); {3134#(<= ~counter~0 0)} is VALID [2021-09-13 14:18:24,701 INFO L281 TraceCheckUtils]: 9: Hoare triple {3134#(<= ~counter~0 0)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {3162#(<= ~counter~0 1)} is VALID [2021-09-13 14:18:24,702 INFO L281 TraceCheckUtils]: 10: Hoare triple {3162#(<= ~counter~0 1)} assume !!(main_#t~post9 < 100);havoc main_#t~post9; {3162#(<= ~counter~0 1)} is VALID [2021-09-13 14:18:24,702 INFO L281 TraceCheckUtils]: 11: Hoare triple {3162#(<= ~counter~0 1)} assume !!(0 != main_~b~0);main_~c~0 := main_~a~0;main_~k~0 := 0; {3162#(<= ~counter~0 1)} is VALID [2021-09-13 14:18:24,702 INFO L281 TraceCheckUtils]: 12: Hoare triple {3162#(<= ~counter~0 1)} main_#t~post10 := ~counter~0;~counter~0 := 1 + main_#t~post10; {3172#(<= ~counter~0 2)} is VALID [2021-09-13 14:18:24,703 INFO L281 TraceCheckUtils]: 13: Hoare triple {3172#(<= ~counter~0 2)} assume !!(main_#t~post10 < 100);havoc main_#t~post10;__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; {3172#(<= ~counter~0 2)} is VALID [2021-09-13 14:18:24,713 INFO L281 TraceCheckUtils]: 14: Hoare triple {3172#(<= ~counter~0 2)} assume !(0 == __VERIFIER_assert_~cond); {3172#(<= ~counter~0 2)} is VALID [2021-09-13 14:18:24,714 INFO L281 TraceCheckUtils]: 15: Hoare triple {3172#(<= ~counter~0 2)} __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; {3172#(<= ~counter~0 2)} is VALID [2021-09-13 14:18:24,714 INFO L281 TraceCheckUtils]: 16: Hoare triple {3172#(<= ~counter~0 2)} assume !(0 == __VERIFIER_assert_~cond); {3172#(<= ~counter~0 2)} is VALID [2021-09-13 14:18:24,719 INFO L281 TraceCheckUtils]: 17: Hoare triple {3172#(<= ~counter~0 2)} __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; {3172#(<= ~counter~0 2)} is VALID [2021-09-13 14:18:24,719 INFO L281 TraceCheckUtils]: 18: Hoare triple {3172#(<= ~counter~0 2)} assume !(0 == __VERIFIER_assert_~cond); {3172#(<= ~counter~0 2)} is VALID [2021-09-13 14:18:24,720 INFO L281 TraceCheckUtils]: 19: Hoare triple {3172#(<= ~counter~0 2)} __VERIFIER_assert_#in~cond := (if 0 == main_~q~0 * main_~xy~0 + main_~s~0 * main_~yy~0 - main_~q~0 * main_~x~0 - main_~b~0 * main_~y~0 - main_~s~0 * main_~y~0 + main_~b~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {3172#(<= ~counter~0 2)} is VALID [2021-09-13 14:18:24,720 INFO L281 TraceCheckUtils]: 20: Hoare triple {3172#(<= ~counter~0 2)} assume !(0 == __VERIFIER_assert_~cond); {3172#(<= ~counter~0 2)} is VALID [2021-09-13 14:18:24,721 INFO L281 TraceCheckUtils]: 21: Hoare triple {3172#(<= ~counter~0 2)} assume !(main_~c~0 >= main_~b~0); {3172#(<= ~counter~0 2)} is VALID [2021-09-13 14:18:24,721 INFO L281 TraceCheckUtils]: 22: Hoare triple {3172#(<= ~counter~0 2)} 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; {3172#(<= ~counter~0 2)} is VALID [2021-09-13 14:18:24,721 INFO L281 TraceCheckUtils]: 23: Hoare triple {3172#(<= ~counter~0 2)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {3206#(<= |ULTIMATE.start_main_#t~post9| 2)} is VALID [2021-09-13 14:18:24,722 INFO L281 TraceCheckUtils]: 24: Hoare triple {3206#(<= |ULTIMATE.start_main_#t~post9| 2)} assume !(main_#t~post9 < 100);havoc main_#t~post9; {3130#false} is VALID [2021-09-13 14:18:24,722 INFO L281 TraceCheckUtils]: 25: Hoare triple {3130#false} __VERIFIER_assert_#in~cond := (if 0 == main_~q~0 * main_~x~0 + main_~s~0 * main_~y~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {3130#false} is VALID [2021-09-13 14:18:24,722 INFO L281 TraceCheckUtils]: 26: Hoare triple {3130#false} assume 0 == __VERIFIER_assert_~cond; {3130#false} is VALID [2021-09-13 14:18:24,723 INFO L281 TraceCheckUtils]: 27: Hoare triple {3130#false} assume !false; {3130#false} is VALID [2021-09-13 14:18:24,723 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:18:24,723 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 14:18:24,962 INFO L281 TraceCheckUtils]: 27: Hoare triple {3130#false} assume !false; {3130#false} is VALID [2021-09-13 14:18:24,962 INFO L281 TraceCheckUtils]: 26: Hoare triple {3130#false} assume 0 == __VERIFIER_assert_~cond; {3130#false} is VALID [2021-09-13 14:18:24,962 INFO L281 TraceCheckUtils]: 25: Hoare triple {3130#false} __VERIFIER_assert_#in~cond := (if 0 == main_~q~0 * main_~x~0 + main_~s~0 * main_~y~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {3130#false} is VALID [2021-09-13 14:18:24,962 INFO L281 TraceCheckUtils]: 24: Hoare triple {3228#(< |ULTIMATE.start_main_#t~post9| 100)} assume !(main_#t~post9 < 100);havoc main_#t~post9; {3130#false} is VALID [2021-09-13 14:18:24,963 INFO L281 TraceCheckUtils]: 23: Hoare triple {3232#(< ~counter~0 100)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {3228#(< |ULTIMATE.start_main_#t~post9| 100)} is VALID [2021-09-13 14:18:24,963 INFO L281 TraceCheckUtils]: 22: Hoare triple {3232#(< ~counter~0 100)} 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; {3232#(< ~counter~0 100)} is VALID [2021-09-13 14:18:24,963 INFO L281 TraceCheckUtils]: 21: Hoare triple {3232#(< ~counter~0 100)} assume !(main_~c~0 >= main_~b~0); {3232#(< ~counter~0 100)} is VALID [2021-09-13 14:18:24,964 INFO L281 TraceCheckUtils]: 20: Hoare triple {3232#(< ~counter~0 100)} assume !(0 == __VERIFIER_assert_~cond); {3232#(< ~counter~0 100)} is VALID [2021-09-13 14:18:24,964 INFO L281 TraceCheckUtils]: 19: Hoare triple {3232#(< ~counter~0 100)} __VERIFIER_assert_#in~cond := (if 0 == main_~q~0 * main_~xy~0 + main_~s~0 * main_~yy~0 - main_~q~0 * main_~x~0 - main_~b~0 * main_~y~0 - main_~s~0 * main_~y~0 + main_~b~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {3232#(< ~counter~0 100)} is VALID [2021-09-13 14:18:24,964 INFO L281 TraceCheckUtils]: 18: Hoare triple {3232#(< ~counter~0 100)} assume !(0 == __VERIFIER_assert_~cond); {3232#(< ~counter~0 100)} is VALID [2021-09-13 14:18:24,965 INFO L281 TraceCheckUtils]: 17: Hoare triple {3232#(< ~counter~0 100)} __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; {3232#(< ~counter~0 100)} is VALID [2021-09-13 14:18:24,965 INFO L281 TraceCheckUtils]: 16: Hoare triple {3232#(< ~counter~0 100)} assume !(0 == __VERIFIER_assert_~cond); {3232#(< ~counter~0 100)} is VALID [2021-09-13 14:18:24,970 INFO L281 TraceCheckUtils]: 15: Hoare triple {3232#(< ~counter~0 100)} __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; {3232#(< ~counter~0 100)} is VALID [2021-09-13 14:18:24,971 INFO L281 TraceCheckUtils]: 14: Hoare triple {3232#(< ~counter~0 100)} assume !(0 == __VERIFIER_assert_~cond); {3232#(< ~counter~0 100)} is VALID [2021-09-13 14:18:24,971 INFO L281 TraceCheckUtils]: 13: Hoare triple {3232#(< ~counter~0 100)} assume !!(main_#t~post10 < 100);havoc main_#t~post10;__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; {3232#(< ~counter~0 100)} is VALID [2021-09-13 14:18:24,972 INFO L281 TraceCheckUtils]: 12: Hoare triple {3266#(< ~counter~0 99)} main_#t~post10 := ~counter~0;~counter~0 := 1 + main_#t~post10; {3232#(< ~counter~0 100)} is VALID [2021-09-13 14:18:24,972 INFO L281 TraceCheckUtils]: 11: Hoare triple {3266#(< ~counter~0 99)} assume !!(0 != main_~b~0);main_~c~0 := main_~a~0;main_~k~0 := 0; {3266#(< ~counter~0 99)} is VALID [2021-09-13 14:18:24,972 INFO L281 TraceCheckUtils]: 10: Hoare triple {3266#(< ~counter~0 99)} assume !!(main_#t~post9 < 100);havoc main_#t~post9; {3266#(< ~counter~0 99)} is VALID [2021-09-13 14:18:24,973 INFO L281 TraceCheckUtils]: 9: Hoare triple {3276#(< ~counter~0 98)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {3266#(< ~counter~0 99)} is VALID [2021-09-13 14:18:24,973 INFO L281 TraceCheckUtils]: 8: Hoare triple {3276#(< ~counter~0 98)} assume !(0 == assume_abort_if_not_~cond); {3276#(< ~counter~0 98)} is VALID [2021-09-13 14:18:24,973 INFO L281 TraceCheckUtils]: 7: Hoare triple {3276#(< ~counter~0 98)} assume_abort_if_not_#in~cond := (if main_~yy~0 < 2147483647 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {3276#(< ~counter~0 98)} is VALID [2021-09-13 14:18:24,974 INFO L281 TraceCheckUtils]: 6: Hoare triple {3276#(< ~counter~0 98)} assume !(0 == assume_abort_if_not_~cond); {3276#(< ~counter~0 98)} is VALID [2021-09-13 14:18:24,979 INFO L281 TraceCheckUtils]: 5: Hoare triple {3276#(< ~counter~0 98)} 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;main_~c~0 := 0;main_~k~0 := 0;main_~xy~0 := main_~x~0 * main_~y~0;main_~yy~0 := main_~y~0 * main_~y~0;assume_abort_if_not_#in~cond := (if main_~xy~0 < 2147483647 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {3276#(< ~counter~0 98)} is VALID [2021-09-13 14:18:24,980 INFO L281 TraceCheckUtils]: 4: Hoare triple {3276#(< ~counter~0 98)} assume !(0 == assume_abort_if_not_~cond); {3276#(< ~counter~0 98)} is VALID [2021-09-13 14:18:24,981 INFO L281 TraceCheckUtils]: 3: Hoare triple {3276#(< ~counter~0 98)} 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; {3276#(< ~counter~0 98)} is VALID [2021-09-13 14:18:24,982 INFO L281 TraceCheckUtils]: 2: Hoare triple {3276#(< ~counter~0 98)} assume !(0 == assume_abort_if_not_~cond); {3276#(< ~counter~0 98)} is VALID [2021-09-13 14:18:24,982 INFO L281 TraceCheckUtils]: 1: Hoare triple {3276#(< ~counter~0 98)} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~post10, main_~temp~0, main_#t~post9, main_~x~0, main_~y~0, main_~a~0, main_~b~0, main_~p~0, main_~q~0, main_~r~0, main_~s~0, main_~c~0, main_~k~0, main_~xy~0, main_~yy~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;havoc main_~c~0;havoc main_~k~0;havoc main_~xy~0;havoc main_~yy~0;assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647;main_~x~0 := main_#t~nondet7;havoc main_#t~nondet7;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_~x~0 >= 1 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {3276#(< ~counter~0 98)} is VALID [2021-09-13 14:18:24,983 INFO L281 TraceCheckUtils]: 0: Hoare triple {3129#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);~counter~0 := 0; {3276#(< ~counter~0 98)} is VALID [2021-09-13 14:18:24,984 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:18:24,984 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:18:24,984 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89535441] [2021-09-13 14:18:24,984 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-09-13 14:18:24,984 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [105046071] [2021-09-13 14:18:24,984 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [105046071] provided 0 perfect and 2 imperfect interpolant sequences [2021-09-13 14:18:24,984 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-09-13 14:18:24,984 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2021-09-13 14:18:24,985 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369740524] [2021-09-13 14:18:24,985 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.3) internal successors, (53), 9 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 28 [2021-09-13 14:18:24,985 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:18:24,985 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 5.3) internal successors, (53), 9 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:18:25,028 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:18:25,028 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-09-13 14:18:25,028 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:18:25,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-09-13 14:18:25,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-09-13 14:18:25,029 INFO L87 Difference]: Start difference. First operand 52 states and 57 transitions. Second operand has 10 states, 10 states have (on average 5.3) internal successors, (53), 9 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:18:25,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:18:25,657 INFO L93 Difference]: Finished difference Result 171 states and 190 transitions. [2021-09-13 14:18:25,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-09-13 14:18:25,657 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.3) internal successors, (53), 9 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 28 [2021-09-13 14:18:25,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:18:25,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 5.3) internal successors, (53), 9 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:18:25,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 153 transitions. [2021-09-13 14:18:25,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 5.3) internal successors, (53), 9 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:18:25,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 153 transitions. [2021-09-13 14:18:25,660 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 153 transitions. [2021-09-13 14:18:25,757 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 153 edges. 153 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:18:25,759 INFO L225 Difference]: With dead ends: 171 [2021-09-13 14:18:25,759 INFO L226 Difference]: Without dead ends: 163 [2021-09-13 14:18:25,759 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 61.43ms TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2021-09-13 14:18:25,760 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 124 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 156.95ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.59ms SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 158.28ms IncrementalHoareTripleChecker+Time [2021-09-13 14:18:25,760 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [124 Valid, 0 Invalid, 236 Unknown, 0 Unchecked, 1.59ms Time], IncrementalHoareTripleChecker [17 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 158.28ms Time] [2021-09-13 14:18:25,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2021-09-13 14:18:26,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 121. [2021-09-13 14:18:26,007 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:18:26,007 INFO L82 GeneralOperation]: Start isEquivalent. First operand 163 states. Second operand has 121 states, 116 states have (on average 1.25) internal successors, (145), 120 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:18:26,007 INFO L74 IsIncluded]: Start isIncluded. First operand 163 states. Second operand has 121 states, 116 states have (on average 1.25) internal successors, (145), 120 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:18:26,008 INFO L87 Difference]: Start difference. First operand 163 states. Second operand has 121 states, 116 states have (on average 1.25) internal successors, (145), 120 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:18:26,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:18:26,010 INFO L93 Difference]: Finished difference Result 163 states and 179 transitions. [2021-09-13 14:18:26,011 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 179 transitions. [2021-09-13 14:18:26,011 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:18:26,011 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:18:26,011 INFO L74 IsIncluded]: Start isIncluded. First operand has 121 states, 116 states have (on average 1.25) internal successors, (145), 120 states have internal predecessors, (145), 0 states have call successors, (0), 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 163 states. [2021-09-13 14:18:26,012 INFO L87 Difference]: Start difference. First operand has 121 states, 116 states have (on average 1.25) internal successors, (145), 120 states have internal predecessors, (145), 0 states have call successors, (0), 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 163 states. [2021-09-13 14:18:26,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:18:26,014 INFO L93 Difference]: Finished difference Result 163 states and 179 transitions. [2021-09-13 14:18:26,014 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 179 transitions. [2021-09-13 14:18:26,014 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:18:26,015 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:18:26,015 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:18:26,015 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:18:26,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 116 states have (on average 1.25) internal successors, (145), 120 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:18:26,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 145 transitions. [2021-09-13 14:18:26,017 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 145 transitions. Word has length 28 [2021-09-13 14:18:26,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:18:26,017 INFO L470 AbstractCegarLoop]: Abstraction has 121 states and 145 transitions. [2021-09-13 14:18:26,017 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.3) internal successors, (53), 9 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:18:26,017 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 145 transitions. [2021-09-13 14:18:26,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-09-13 14:18:26,018 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:18:26,018 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] [2021-09-13 14:18:26,043 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2021-09-13 14:18:26,232 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:18:26,233 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-09-13 14:18:26,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:18:26,233 INFO L82 PathProgramCache]: Analyzing trace with hash -134066994, now seen corresponding path program 1 times [2021-09-13 14:18:26,233 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:18:26,233 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713196893] [2021-09-13 14:18:26,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:18:26,234 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:18:26,248 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-09-13 14:18:26,248 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1225246967] [2021-09-13 14:18:26,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:18:26,248 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:18:26,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:18:26,249 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:18:26,250 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:18:26,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:18:26,288 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 9 conjunts are in the unsatisfiable core [2021-09-13 14:18:26,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:18:26,300 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:18:26,508 INFO L281 TraceCheckUtils]: 0: Hoare triple {4028#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);~counter~0 := 0; {4028#true} is VALID [2021-09-13 14:18:26,509 INFO L281 TraceCheckUtils]: 1: Hoare triple {4028#true} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~post10, main_~temp~0, main_#t~post9, main_~x~0, main_~y~0, main_~a~0, main_~b~0, main_~p~0, main_~q~0, main_~r~0, main_~s~0, main_~c~0, main_~k~0, main_~xy~0, main_~yy~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;havoc main_~c~0;havoc main_~k~0;havoc main_~xy~0;havoc main_~yy~0;assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647;main_~x~0 := main_#t~nondet7;havoc main_#t~nondet7;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_~x~0 >= 1 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {4036#(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:18:26,509 INFO L281 TraceCheckUtils]: 2: Hoare triple {4036#(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); {4040#(<= 1 ULTIMATE.start_main_~x~0)} is VALID [2021-09-13 14:18:26,510 INFO L281 TraceCheckUtils]: 3: Hoare triple {4040#(<= 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; {4040#(<= 1 ULTIMATE.start_main_~x~0)} is VALID [2021-09-13 14:18:26,511 INFO L281 TraceCheckUtils]: 4: Hoare triple {4040#(<= 1 ULTIMATE.start_main_~x~0)} assume !(0 == assume_abort_if_not_~cond); {4040#(<= 1 ULTIMATE.start_main_~x~0)} is VALID [2021-09-13 14:18:26,512 INFO L281 TraceCheckUtils]: 5: Hoare triple {4040#(<= 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;main_~c~0 := 0;main_~k~0 := 0;main_~xy~0 := main_~x~0 * main_~y~0;main_~yy~0 := main_~y~0 * main_~y~0;assume_abort_if_not_#in~cond := (if main_~xy~0 < 2147483647 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {4050#(<= 1 ULTIMATE.start_main_~a~0)} is VALID [2021-09-13 14:18:26,512 INFO L281 TraceCheckUtils]: 6: Hoare triple {4050#(<= 1 ULTIMATE.start_main_~a~0)} assume !(0 == assume_abort_if_not_~cond); {4050#(<= 1 ULTIMATE.start_main_~a~0)} is VALID [2021-09-13 14:18:26,512 INFO L281 TraceCheckUtils]: 7: Hoare triple {4050#(<= 1 ULTIMATE.start_main_~a~0)} assume_abort_if_not_#in~cond := (if main_~yy~0 < 2147483647 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {4050#(<= 1 ULTIMATE.start_main_~a~0)} is VALID [2021-09-13 14:18:26,513 INFO L281 TraceCheckUtils]: 8: Hoare triple {4050#(<= 1 ULTIMATE.start_main_~a~0)} assume !(0 == assume_abort_if_not_~cond); {4050#(<= 1 ULTIMATE.start_main_~a~0)} is VALID [2021-09-13 14:18:26,515 INFO L281 TraceCheckUtils]: 9: Hoare triple {4050#(<= 1 ULTIMATE.start_main_~a~0)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {4050#(<= 1 ULTIMATE.start_main_~a~0)} is VALID [2021-09-13 14:18:26,516 INFO L281 TraceCheckUtils]: 10: Hoare triple {4050#(<= 1 ULTIMATE.start_main_~a~0)} assume !!(main_#t~post9 < 100);havoc main_#t~post9; {4050#(<= 1 ULTIMATE.start_main_~a~0)} is VALID [2021-09-13 14:18:26,517 INFO L281 TraceCheckUtils]: 11: Hoare triple {4050#(<= 1 ULTIMATE.start_main_~a~0)} assume !!(0 != main_~b~0);main_~c~0 := main_~a~0;main_~k~0 := 0; {4069#(<= 1 ULTIMATE.start_main_~c~0)} is VALID [2021-09-13 14:18:26,517 INFO L281 TraceCheckUtils]: 12: Hoare triple {4069#(<= 1 ULTIMATE.start_main_~c~0)} main_#t~post10 := ~counter~0;~counter~0 := 1 + main_#t~post10; {4069#(<= 1 ULTIMATE.start_main_~c~0)} is VALID [2021-09-13 14:18:26,517 INFO L281 TraceCheckUtils]: 13: Hoare triple {4069#(<= 1 ULTIMATE.start_main_~c~0)} assume !!(main_#t~post10 < 100);havoc main_#t~post10;__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; {4069#(<= 1 ULTIMATE.start_main_~c~0)} is VALID [2021-09-13 14:18:26,517 INFO L281 TraceCheckUtils]: 14: Hoare triple {4069#(<= 1 ULTIMATE.start_main_~c~0)} assume !(0 == __VERIFIER_assert_~cond); {4069#(<= 1 ULTIMATE.start_main_~c~0)} is VALID [2021-09-13 14:18:26,518 INFO L281 TraceCheckUtils]: 15: Hoare triple {4069#(<= 1 ULTIMATE.start_main_~c~0)} __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; {4069#(<= 1 ULTIMATE.start_main_~c~0)} is VALID [2021-09-13 14:18:26,518 INFO L281 TraceCheckUtils]: 16: Hoare triple {4069#(<= 1 ULTIMATE.start_main_~c~0)} assume !(0 == __VERIFIER_assert_~cond); {4069#(<= 1 ULTIMATE.start_main_~c~0)} is VALID [2021-09-13 14:18:26,518 INFO L281 TraceCheckUtils]: 17: Hoare triple {4069#(<= 1 ULTIMATE.start_main_~c~0)} __VERIFIER_assert_#in~cond := (if main_~b~0 == main_~x~0 * main_~q~0 + main_~y~0 * main_~s~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {4069#(<= 1 ULTIMATE.start_main_~c~0)} is VALID [2021-09-13 14:18:26,519 INFO L281 TraceCheckUtils]: 18: Hoare triple {4069#(<= 1 ULTIMATE.start_main_~c~0)} assume !(0 == __VERIFIER_assert_~cond); {4069#(<= 1 ULTIMATE.start_main_~c~0)} is VALID [2021-09-13 14:18:26,519 INFO L281 TraceCheckUtils]: 19: Hoare triple {4069#(<= 1 ULTIMATE.start_main_~c~0)} __VERIFIER_assert_#in~cond := (if 0 == main_~q~0 * main_~xy~0 + main_~s~0 * main_~yy~0 - main_~q~0 * main_~x~0 - main_~b~0 * main_~y~0 - main_~s~0 * main_~y~0 + main_~b~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {4069#(<= 1 ULTIMATE.start_main_~c~0)} is VALID [2021-09-13 14:18:26,519 INFO L281 TraceCheckUtils]: 20: Hoare triple {4069#(<= 1 ULTIMATE.start_main_~c~0)} assume !(0 == __VERIFIER_assert_~cond); {4069#(<= 1 ULTIMATE.start_main_~c~0)} is VALID [2021-09-13 14:18:26,519 INFO L281 TraceCheckUtils]: 21: Hoare triple {4069#(<= 1 ULTIMATE.start_main_~c~0)} assume !(main_~c~0 >= main_~b~0); {4069#(<= 1 ULTIMATE.start_main_~c~0)} is VALID [2021-09-13 14:18:26,520 INFO L281 TraceCheckUtils]: 22: Hoare triple {4069#(<= 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; {4103#(<= 1 ULTIMATE.start_main_~b~0)} is VALID [2021-09-13 14:18:26,520 INFO L281 TraceCheckUtils]: 23: Hoare triple {4103#(<= 1 ULTIMATE.start_main_~b~0)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {4103#(<= 1 ULTIMATE.start_main_~b~0)} is VALID [2021-09-13 14:18:26,521 INFO L281 TraceCheckUtils]: 24: Hoare triple {4103#(<= 1 ULTIMATE.start_main_~b~0)} assume !!(main_#t~post9 < 100);havoc main_#t~post9; {4103#(<= 1 ULTIMATE.start_main_~b~0)} is VALID [2021-09-13 14:18:26,521 INFO L281 TraceCheckUtils]: 25: Hoare triple {4103#(<= 1 ULTIMATE.start_main_~b~0)} assume !(0 != main_~b~0); {4029#false} is VALID [2021-09-13 14:18:26,521 INFO L281 TraceCheckUtils]: 26: Hoare triple {4029#false} __VERIFIER_assert_#in~cond := (if 0 == main_~q~0 * main_~x~0 + main_~s~0 * main_~y~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {4029#false} is VALID [2021-09-13 14:18:26,521 INFO L281 TraceCheckUtils]: 27: Hoare triple {4029#false} assume 0 == __VERIFIER_assert_~cond; {4029#false} is VALID [2021-09-13 14:18:26,521 INFO L281 TraceCheckUtils]: 28: Hoare triple {4029#false} assume !false; {4029#false} is VALID [2021-09-13 14:18:26,521 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:18:26,521 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 14:18:26,777 INFO L281 TraceCheckUtils]: 28: Hoare triple {4029#false} assume !false; {4029#false} is VALID [2021-09-13 14:18:26,777 INFO L281 TraceCheckUtils]: 27: Hoare triple {4029#false} assume 0 == __VERIFIER_assert_~cond; {4029#false} is VALID [2021-09-13 14:18:26,777 INFO L281 TraceCheckUtils]: 26: Hoare triple {4029#false} __VERIFIER_assert_#in~cond := (if 0 == main_~q~0 * main_~x~0 + main_~s~0 * main_~y~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {4029#false} is VALID [2021-09-13 14:18:26,778 INFO L281 TraceCheckUtils]: 25: Hoare triple {4103#(<= 1 ULTIMATE.start_main_~b~0)} assume !(0 != main_~b~0); {4029#false} is VALID [2021-09-13 14:18:26,779 INFO L281 TraceCheckUtils]: 24: Hoare triple {4103#(<= 1 ULTIMATE.start_main_~b~0)} assume !!(main_#t~post9 < 100);havoc main_#t~post9; {4103#(<= 1 ULTIMATE.start_main_~b~0)} is VALID [2021-09-13 14:18:26,779 INFO L281 TraceCheckUtils]: 23: Hoare triple {4103#(<= 1 ULTIMATE.start_main_~b~0)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {4103#(<= 1 ULTIMATE.start_main_~b~0)} is VALID [2021-09-13 14:18:26,780 INFO L281 TraceCheckUtils]: 22: Hoare triple {4069#(<= 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; {4103#(<= 1 ULTIMATE.start_main_~b~0)} is VALID [2021-09-13 14:18:26,780 INFO L281 TraceCheckUtils]: 21: Hoare triple {4069#(<= 1 ULTIMATE.start_main_~c~0)} assume !(main_~c~0 >= main_~b~0); {4069#(<= 1 ULTIMATE.start_main_~c~0)} is VALID [2021-09-13 14:18:26,781 INFO L281 TraceCheckUtils]: 20: Hoare triple {4069#(<= 1 ULTIMATE.start_main_~c~0)} assume !(0 == __VERIFIER_assert_~cond); {4069#(<= 1 ULTIMATE.start_main_~c~0)} is VALID [2021-09-13 14:18:26,781 INFO L281 TraceCheckUtils]: 19: Hoare triple {4069#(<= 1 ULTIMATE.start_main_~c~0)} __VERIFIER_assert_#in~cond := (if 0 == main_~q~0 * main_~xy~0 + main_~s~0 * main_~yy~0 - main_~q~0 * main_~x~0 - main_~b~0 * main_~y~0 - main_~s~0 * main_~y~0 + main_~b~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {4069#(<= 1 ULTIMATE.start_main_~c~0)} is VALID [2021-09-13 14:18:26,782 INFO L281 TraceCheckUtils]: 18: Hoare triple {4069#(<= 1 ULTIMATE.start_main_~c~0)} assume !(0 == __VERIFIER_assert_~cond); {4069#(<= 1 ULTIMATE.start_main_~c~0)} is VALID [2021-09-13 14:18:26,782 INFO L281 TraceCheckUtils]: 17: Hoare triple {4069#(<= 1 ULTIMATE.start_main_~c~0)} __VERIFIER_assert_#in~cond := (if main_~b~0 == main_~x~0 * main_~q~0 + main_~y~0 * main_~s~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {4069#(<= 1 ULTIMATE.start_main_~c~0)} is VALID [2021-09-13 14:18:26,782 INFO L281 TraceCheckUtils]: 16: Hoare triple {4069#(<= 1 ULTIMATE.start_main_~c~0)} assume !(0 == __VERIFIER_assert_~cond); {4069#(<= 1 ULTIMATE.start_main_~c~0)} is VALID [2021-09-13 14:18:26,783 INFO L281 TraceCheckUtils]: 15: Hoare triple {4069#(<= 1 ULTIMATE.start_main_~c~0)} __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; {4069#(<= 1 ULTIMATE.start_main_~c~0)} is VALID [2021-09-13 14:18:26,783 INFO L281 TraceCheckUtils]: 14: Hoare triple {4069#(<= 1 ULTIMATE.start_main_~c~0)} assume !(0 == __VERIFIER_assert_~cond); {4069#(<= 1 ULTIMATE.start_main_~c~0)} is VALID [2021-09-13 14:18:26,784 INFO L281 TraceCheckUtils]: 13: Hoare triple {4069#(<= 1 ULTIMATE.start_main_~c~0)} assume !!(main_#t~post10 < 100);havoc main_#t~post10;__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; {4069#(<= 1 ULTIMATE.start_main_~c~0)} is VALID [2021-09-13 14:18:26,784 INFO L281 TraceCheckUtils]: 12: Hoare triple {4069#(<= 1 ULTIMATE.start_main_~c~0)} main_#t~post10 := ~counter~0;~counter~0 := 1 + main_#t~post10; {4069#(<= 1 ULTIMATE.start_main_~c~0)} is VALID [2021-09-13 14:18:26,784 INFO L281 TraceCheckUtils]: 11: Hoare triple {4050#(<= 1 ULTIMATE.start_main_~a~0)} assume !!(0 != main_~b~0);main_~c~0 := main_~a~0;main_~k~0 := 0; {4069#(<= 1 ULTIMATE.start_main_~c~0)} is VALID [2021-09-13 14:18:26,785 INFO L281 TraceCheckUtils]: 10: Hoare triple {4050#(<= 1 ULTIMATE.start_main_~a~0)} assume !!(main_#t~post9 < 100);havoc main_#t~post9; {4050#(<= 1 ULTIMATE.start_main_~a~0)} is VALID [2021-09-13 14:18:26,785 INFO L281 TraceCheckUtils]: 9: Hoare triple {4050#(<= 1 ULTIMATE.start_main_~a~0)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {4050#(<= 1 ULTIMATE.start_main_~a~0)} is VALID [2021-09-13 14:18:26,786 INFO L281 TraceCheckUtils]: 8: Hoare triple {4050#(<= 1 ULTIMATE.start_main_~a~0)} assume !(0 == assume_abort_if_not_~cond); {4050#(<= 1 ULTIMATE.start_main_~a~0)} is VALID [2021-09-13 14:18:26,786 INFO L281 TraceCheckUtils]: 7: Hoare triple {4050#(<= 1 ULTIMATE.start_main_~a~0)} assume_abort_if_not_#in~cond := (if main_~yy~0 < 2147483647 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {4050#(<= 1 ULTIMATE.start_main_~a~0)} is VALID [2021-09-13 14:18:26,786 INFO L281 TraceCheckUtils]: 6: Hoare triple {4050#(<= 1 ULTIMATE.start_main_~a~0)} assume !(0 == assume_abort_if_not_~cond); {4050#(<= 1 ULTIMATE.start_main_~a~0)} is VALID [2021-09-13 14:18:26,787 INFO L281 TraceCheckUtils]: 5: Hoare triple {4040#(<= 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;main_~c~0 := 0;main_~k~0 := 0;main_~xy~0 := main_~x~0 * main_~y~0;main_~yy~0 := main_~y~0 * main_~y~0;assume_abort_if_not_#in~cond := (if main_~xy~0 < 2147483647 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {4050#(<= 1 ULTIMATE.start_main_~a~0)} is VALID [2021-09-13 14:18:26,788 INFO L281 TraceCheckUtils]: 4: Hoare triple {4040#(<= 1 ULTIMATE.start_main_~x~0)} assume !(0 == assume_abort_if_not_~cond); {4040#(<= 1 ULTIMATE.start_main_~x~0)} is VALID [2021-09-13 14:18:26,788 INFO L281 TraceCheckUtils]: 3: Hoare triple {4040#(<= 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; {4040#(<= 1 ULTIMATE.start_main_~x~0)} is VALID [2021-09-13 14:18:26,789 INFO L281 TraceCheckUtils]: 2: Hoare triple {4200#(or (= ULTIMATE.start_assume_abort_if_not_~cond 0) (<= 1 ULTIMATE.start_main_~x~0))} assume !(0 == assume_abort_if_not_~cond); {4040#(<= 1 ULTIMATE.start_main_~x~0)} is VALID [2021-09-13 14:18:26,789 INFO L281 TraceCheckUtils]: 1: Hoare triple {4028#true} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~post10, main_~temp~0, main_#t~post9, main_~x~0, main_~y~0, main_~a~0, main_~b~0, main_~p~0, main_~q~0, main_~r~0, main_~s~0, main_~c~0, main_~k~0, main_~xy~0, main_~yy~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;havoc main_~c~0;havoc main_~k~0;havoc main_~xy~0;havoc main_~yy~0;assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647;main_~x~0 := main_#t~nondet7;havoc main_#t~nondet7;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_~x~0 >= 1 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {4200#(or (= ULTIMATE.start_assume_abort_if_not_~cond 0) (<= 1 ULTIMATE.start_main_~x~0))} is VALID [2021-09-13 14:18:26,789 INFO L281 TraceCheckUtils]: 0: Hoare triple {4028#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);~counter~0 := 0; {4028#true} is VALID [2021-09-13 14:18:26,790 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:18:26,790 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:18:26,790 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713196893] [2021-09-13 14:18:26,790 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-09-13 14:18:26,790 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1225246967] [2021-09-13 14:18:26,790 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1225246967] provided 0 perfect and 2 imperfect interpolant sequences [2021-09-13 14:18:26,790 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-09-13 14:18:26,790 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2021-09-13 14:18:26,790 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335637168] [2021-09-13 14:18:26,791 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 0 states have call successors, (0), 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 29 [2021-09-13 14:18:26,791 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:18:26,791 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:18:26,816 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:18:26,816 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-09-13 14:18:26,816 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:18:26,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-09-13 14:18:26,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-09-13 14:18:26,817 INFO L87 Difference]: Start difference. First operand 121 states and 145 transitions. Second operand has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:18:27,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:18:27,727 INFO L93 Difference]: Finished difference Result 264 states and 305 transitions. [2021-09-13 14:18:27,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-09-13 14:18:27,727 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 0 states have call successors, (0), 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 29 [2021-09-13 14:18:27,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:18:27,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:18:27,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 178 transitions. [2021-09-13 14:18:27,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:18:27,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 178 transitions. [2021-09-13 14:18:27,730 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 178 transitions. [2021-09-13 14:18:27,847 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 178 edges. 178 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:18:27,851 INFO L225 Difference]: With dead ends: 264 [2021-09-13 14:18:27,851 INFO L226 Difference]: Without dead ends: 256 [2021-09-13 14:18:27,852 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 98.39ms TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2021-09-13 14:18:27,852 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 236 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 216.28ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.81ms SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 218.07ms IncrementalHoareTripleChecker+Time [2021-09-13 14:18:27,852 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [236 Valid, 0 Invalid, 332 Unknown, 0 Unchecked, 1.81ms Time], IncrementalHoareTripleChecker [13 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 218.07ms Time] [2021-09-13 14:18:27,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2021-09-13 14:18:28,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 179. [2021-09-13 14:18:28,244 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:18:28,245 INFO L82 GeneralOperation]: Start isEquivalent. First operand 256 states. Second operand has 179 states, 174 states have (on average 1.2988505747126438) internal successors, (226), 178 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:18:28,245 INFO L74 IsIncluded]: Start isIncluded. First operand 256 states. Second operand has 179 states, 174 states have (on average 1.2988505747126438) internal successors, (226), 178 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:18:28,245 INFO L87 Difference]: Start difference. First operand 256 states. Second operand has 179 states, 174 states have (on average 1.2988505747126438) internal successors, (226), 178 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:18:28,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:18:28,250 INFO L93 Difference]: Finished difference Result 256 states and 295 transitions. [2021-09-13 14:18:28,250 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 295 transitions. [2021-09-13 14:18:28,250 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:18:28,251 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:18:28,251 INFO L74 IsIncluded]: Start isIncluded. First operand has 179 states, 174 states have (on average 1.2988505747126438) internal successors, (226), 178 states have internal predecessors, (226), 0 states have call successors, (0), 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 256 states. [2021-09-13 14:18:28,251 INFO L87 Difference]: Start difference. First operand has 179 states, 174 states have (on average 1.2988505747126438) internal successors, (226), 178 states have internal predecessors, (226), 0 states have call successors, (0), 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 256 states. [2021-09-13 14:18:28,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:18:28,256 INFO L93 Difference]: Finished difference Result 256 states and 295 transitions. [2021-09-13 14:18:28,256 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 295 transitions. [2021-09-13 14:18:28,257 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:18:28,257 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:18:28,257 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:18:28,257 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:18:28,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 174 states have (on average 1.2988505747126438) internal successors, (226), 178 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:18:28,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 226 transitions. [2021-09-13 14:18:28,261 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 226 transitions. Word has length 29 [2021-09-13 14:18:28,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:18:28,261 INFO L470 AbstractCegarLoop]: Abstraction has 179 states and 226 transitions. [2021-09-13 14:18:28,261 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:18:28,261 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 226 transitions. [2021-09-13 14:18:28,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-09-13 14:18:28,262 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:18:28,262 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 14:18:28,296 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:18:28,476 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:18:28,477 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-09-13 14:18:28,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:18:28,477 INFO L82 PathProgramCache]: Analyzing trace with hash -94400183, now seen corresponding path program 1 times [2021-09-13 14:18:28,477 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:18:28,478 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373072162] [2021-09-13 14:18:28,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:18:28,478 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:18:28,485 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-09-13 14:18:28,489 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [860736397] [2021-09-13 14:18:28,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:18:28,489 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:18:28,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:18:28,490 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:18:28,491 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:18:28,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:18:28,531 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 7 conjunts are in the unsatisfiable core [2021-09-13 14:18:28,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:18:28,544 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:18:28,754 INFO L281 TraceCheckUtils]: 0: Hoare triple {5331#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);~counter~0 := 0; {5336#(<= ~counter~0 0)} is VALID [2021-09-13 14:18:28,755 INFO L281 TraceCheckUtils]: 1: Hoare triple {5336#(<= ~counter~0 0)} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~post10, main_~temp~0, main_#t~post9, main_~x~0, main_~y~0, main_~a~0, main_~b~0, main_~p~0, main_~q~0, main_~r~0, main_~s~0, main_~c~0, main_~k~0, main_~xy~0, main_~yy~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;havoc main_~c~0;havoc main_~k~0;havoc main_~xy~0;havoc main_~yy~0;assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647;main_~x~0 := main_#t~nondet7;havoc main_#t~nondet7;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_~x~0 >= 1 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {5336#(<= ~counter~0 0)} is VALID [2021-09-13 14:18:28,755 INFO L281 TraceCheckUtils]: 2: Hoare triple {5336#(<= ~counter~0 0)} assume !(0 == assume_abort_if_not_~cond); {5336#(<= ~counter~0 0)} is VALID [2021-09-13 14:18:28,755 INFO L281 TraceCheckUtils]: 3: Hoare triple {5336#(<= ~counter~0 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; {5336#(<= ~counter~0 0)} is VALID [2021-09-13 14:18:28,756 INFO L281 TraceCheckUtils]: 4: Hoare triple {5336#(<= ~counter~0 0)} assume !(0 == assume_abort_if_not_~cond); {5336#(<= ~counter~0 0)} is VALID [2021-09-13 14:18:28,756 INFO L281 TraceCheckUtils]: 5: Hoare triple {5336#(<= ~counter~0 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;main_~c~0 := 0;main_~k~0 := 0;main_~xy~0 := main_~x~0 * main_~y~0;main_~yy~0 := main_~y~0 * main_~y~0;assume_abort_if_not_#in~cond := (if main_~xy~0 < 2147483647 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {5336#(<= ~counter~0 0)} is VALID [2021-09-13 14:18:28,756 INFO L281 TraceCheckUtils]: 6: Hoare triple {5336#(<= ~counter~0 0)} assume !(0 == assume_abort_if_not_~cond); {5336#(<= ~counter~0 0)} is VALID [2021-09-13 14:18:28,757 INFO L281 TraceCheckUtils]: 7: Hoare triple {5336#(<= ~counter~0 0)} assume_abort_if_not_#in~cond := (if main_~yy~0 < 2147483647 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {5336#(<= ~counter~0 0)} is VALID [2021-09-13 14:18:28,757 INFO L281 TraceCheckUtils]: 8: Hoare triple {5336#(<= ~counter~0 0)} assume !(0 == assume_abort_if_not_~cond); {5336#(<= ~counter~0 0)} is VALID [2021-09-13 14:18:28,757 INFO L281 TraceCheckUtils]: 9: Hoare triple {5336#(<= ~counter~0 0)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {5364#(<= ~counter~0 1)} is VALID [2021-09-13 14:18:28,758 INFO L281 TraceCheckUtils]: 10: Hoare triple {5364#(<= ~counter~0 1)} assume !!(main_#t~post9 < 100);havoc main_#t~post9; {5364#(<= ~counter~0 1)} is VALID [2021-09-13 14:18:28,758 INFO L281 TraceCheckUtils]: 11: Hoare triple {5364#(<= ~counter~0 1)} assume !!(0 != main_~b~0);main_~c~0 := main_~a~0;main_~k~0 := 0; {5364#(<= ~counter~0 1)} is VALID [2021-09-13 14:18:28,758 INFO L281 TraceCheckUtils]: 12: Hoare triple {5364#(<= ~counter~0 1)} main_#t~post10 := ~counter~0;~counter~0 := 1 + main_#t~post10; {5374#(<= ~counter~0 2)} is VALID [2021-09-13 14:18:28,759 INFO L281 TraceCheckUtils]: 13: Hoare triple {5374#(<= ~counter~0 2)} assume !!(main_#t~post10 < 100);havoc main_#t~post10;__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; {5374#(<= ~counter~0 2)} is VALID [2021-09-13 14:18:28,759 INFO L281 TraceCheckUtils]: 14: Hoare triple {5374#(<= ~counter~0 2)} assume !(0 == __VERIFIER_assert_~cond); {5374#(<= ~counter~0 2)} is VALID [2021-09-13 14:18:28,759 INFO L281 TraceCheckUtils]: 15: Hoare triple {5374#(<= ~counter~0 2)} __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; {5374#(<= ~counter~0 2)} is VALID [2021-09-13 14:18:28,760 INFO L281 TraceCheckUtils]: 16: Hoare triple {5374#(<= ~counter~0 2)} assume !(0 == __VERIFIER_assert_~cond); {5374#(<= ~counter~0 2)} is VALID [2021-09-13 14:18:28,760 INFO L281 TraceCheckUtils]: 17: Hoare triple {5374#(<= ~counter~0 2)} __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; {5374#(<= ~counter~0 2)} is VALID [2021-09-13 14:18:28,760 INFO L281 TraceCheckUtils]: 18: Hoare triple {5374#(<= ~counter~0 2)} assume !(0 == __VERIFIER_assert_~cond); {5374#(<= ~counter~0 2)} is VALID [2021-09-13 14:18:28,760 INFO L281 TraceCheckUtils]: 19: Hoare triple {5374#(<= ~counter~0 2)} __VERIFIER_assert_#in~cond := (if 0 == main_~q~0 * main_~xy~0 + main_~s~0 * main_~yy~0 - main_~q~0 * main_~x~0 - main_~b~0 * main_~y~0 - main_~s~0 * main_~y~0 + main_~b~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {5374#(<= ~counter~0 2)} is VALID [2021-09-13 14:18:28,761 INFO L281 TraceCheckUtils]: 20: Hoare triple {5374#(<= ~counter~0 2)} assume !(0 == __VERIFIER_assert_~cond); {5374#(<= ~counter~0 2)} is VALID [2021-09-13 14:18:28,761 INFO L281 TraceCheckUtils]: 21: Hoare triple {5374#(<= ~counter~0 2)} assume !!(main_~c~0 >= main_~b~0);main_~c~0 := main_~c~0 - main_~b~0;main_~k~0 := 1 + main_~k~0; {5374#(<= ~counter~0 2)} is VALID [2021-09-13 14:18:28,761 INFO L281 TraceCheckUtils]: 22: Hoare triple {5374#(<= ~counter~0 2)} main_#t~post10 := ~counter~0;~counter~0 := 1 + main_#t~post10; {5405#(<= |ULTIMATE.start_main_#t~post10| 2)} is VALID [2021-09-13 14:18:28,762 INFO L281 TraceCheckUtils]: 23: Hoare triple {5405#(<= |ULTIMATE.start_main_#t~post10| 2)} assume !(main_#t~post10 < 100);havoc main_#t~post10; {5332#false} is VALID [2021-09-13 14:18:28,762 INFO L281 TraceCheckUtils]: 24: Hoare triple {5332#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; {5332#false} is VALID [2021-09-13 14:18:28,762 INFO L281 TraceCheckUtils]: 25: Hoare triple {5332#false} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {5332#false} is VALID [2021-09-13 14:18:28,762 INFO L281 TraceCheckUtils]: 26: Hoare triple {5332#false} assume !!(main_#t~post9 < 100);havoc main_#t~post9; {5332#false} is VALID [2021-09-13 14:18:28,762 INFO L281 TraceCheckUtils]: 27: Hoare triple {5332#false} assume !(0 != main_~b~0); {5332#false} is VALID [2021-09-13 14:18:28,762 INFO L281 TraceCheckUtils]: 28: Hoare triple {5332#false} __VERIFIER_assert_#in~cond := (if 0 == main_~q~0 * main_~x~0 + main_~s~0 * main_~y~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {5332#false} is VALID [2021-09-13 14:18:28,762 INFO L281 TraceCheckUtils]: 29: Hoare triple {5332#false} assume 0 == __VERIFIER_assert_~cond; {5332#false} is VALID [2021-09-13 14:18:28,762 INFO L281 TraceCheckUtils]: 30: Hoare triple {5332#false} assume !false; {5332#false} is VALID [2021-09-13 14:18:28,762 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:18:28,762 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 14:18:29,008 INFO L281 TraceCheckUtils]: 30: Hoare triple {5332#false} assume !false; {5332#false} is VALID [2021-09-13 14:18:29,009 INFO L281 TraceCheckUtils]: 29: Hoare triple {5332#false} assume 0 == __VERIFIER_assert_~cond; {5332#false} is VALID [2021-09-13 14:18:29,009 INFO L281 TraceCheckUtils]: 28: Hoare triple {5332#false} __VERIFIER_assert_#in~cond := (if 0 == main_~q~0 * main_~x~0 + main_~s~0 * main_~y~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {5332#false} is VALID [2021-09-13 14:18:29,009 INFO L281 TraceCheckUtils]: 27: Hoare triple {5332#false} assume !(0 != main_~b~0); {5332#false} is VALID [2021-09-13 14:18:29,009 INFO L281 TraceCheckUtils]: 26: Hoare triple {5332#false} assume !!(main_#t~post9 < 100);havoc main_#t~post9; {5332#false} is VALID [2021-09-13 14:18:29,009 INFO L281 TraceCheckUtils]: 25: Hoare triple {5332#false} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {5332#false} is VALID [2021-09-13 14:18:29,009 INFO L281 TraceCheckUtils]: 24: Hoare triple {5332#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; {5332#false} is VALID [2021-09-13 14:18:29,010 INFO L281 TraceCheckUtils]: 23: Hoare triple {5451#(< |ULTIMATE.start_main_#t~post10| 100)} assume !(main_#t~post10 < 100);havoc main_#t~post10; {5332#false} is VALID [2021-09-13 14:18:29,010 INFO L281 TraceCheckUtils]: 22: Hoare triple {5455#(< ~counter~0 100)} main_#t~post10 := ~counter~0;~counter~0 := 1 + main_#t~post10; {5451#(< |ULTIMATE.start_main_#t~post10| 100)} is VALID [2021-09-13 14:18:29,011 INFO L281 TraceCheckUtils]: 21: Hoare triple {5455#(< ~counter~0 100)} assume !!(main_~c~0 >= main_~b~0);main_~c~0 := main_~c~0 - main_~b~0;main_~k~0 := 1 + main_~k~0; {5455#(< ~counter~0 100)} is VALID [2021-09-13 14:18:29,011 INFO L281 TraceCheckUtils]: 20: Hoare triple {5455#(< ~counter~0 100)} assume !(0 == __VERIFIER_assert_~cond); {5455#(< ~counter~0 100)} is VALID [2021-09-13 14:18:29,012 INFO L281 TraceCheckUtils]: 19: Hoare triple {5455#(< ~counter~0 100)} __VERIFIER_assert_#in~cond := (if 0 == main_~q~0 * main_~xy~0 + main_~s~0 * main_~yy~0 - main_~q~0 * main_~x~0 - main_~b~0 * main_~y~0 - main_~s~0 * main_~y~0 + main_~b~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {5455#(< ~counter~0 100)} is VALID [2021-09-13 14:18:29,012 INFO L281 TraceCheckUtils]: 18: Hoare triple {5455#(< ~counter~0 100)} assume !(0 == __VERIFIER_assert_~cond); {5455#(< ~counter~0 100)} is VALID [2021-09-13 14:18:29,012 INFO L281 TraceCheckUtils]: 17: Hoare triple {5455#(< ~counter~0 100)} __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; {5455#(< ~counter~0 100)} is VALID [2021-09-13 14:18:29,013 INFO L281 TraceCheckUtils]: 16: Hoare triple {5455#(< ~counter~0 100)} assume !(0 == __VERIFIER_assert_~cond); {5455#(< ~counter~0 100)} is VALID [2021-09-13 14:18:29,013 INFO L281 TraceCheckUtils]: 15: Hoare triple {5455#(< ~counter~0 100)} __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; {5455#(< ~counter~0 100)} is VALID [2021-09-13 14:18:29,014 INFO L281 TraceCheckUtils]: 14: Hoare triple {5455#(< ~counter~0 100)} assume !(0 == __VERIFIER_assert_~cond); {5455#(< ~counter~0 100)} is VALID [2021-09-13 14:18:29,014 INFO L281 TraceCheckUtils]: 13: Hoare triple {5455#(< ~counter~0 100)} assume !!(main_#t~post10 < 100);havoc main_#t~post10;__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; {5455#(< ~counter~0 100)} is VALID [2021-09-13 14:18:29,015 INFO L281 TraceCheckUtils]: 12: Hoare triple {5486#(< ~counter~0 99)} main_#t~post10 := ~counter~0;~counter~0 := 1 + main_#t~post10; {5455#(< ~counter~0 100)} is VALID [2021-09-13 14:18:29,015 INFO L281 TraceCheckUtils]: 11: Hoare triple {5486#(< ~counter~0 99)} assume !!(0 != main_~b~0);main_~c~0 := main_~a~0;main_~k~0 := 0; {5486#(< ~counter~0 99)} is VALID [2021-09-13 14:18:29,015 INFO L281 TraceCheckUtils]: 10: Hoare triple {5486#(< ~counter~0 99)} assume !!(main_#t~post9 < 100);havoc main_#t~post9; {5486#(< ~counter~0 99)} is VALID [2021-09-13 14:18:29,016 INFO L281 TraceCheckUtils]: 9: Hoare triple {5496#(< ~counter~0 98)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {5486#(< ~counter~0 99)} is VALID [2021-09-13 14:18:29,016 INFO L281 TraceCheckUtils]: 8: Hoare triple {5496#(< ~counter~0 98)} assume !(0 == assume_abort_if_not_~cond); {5496#(< ~counter~0 98)} is VALID [2021-09-13 14:18:29,017 INFO L281 TraceCheckUtils]: 7: Hoare triple {5496#(< ~counter~0 98)} assume_abort_if_not_#in~cond := (if main_~yy~0 < 2147483647 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {5496#(< ~counter~0 98)} is VALID [2021-09-13 14:18:29,017 INFO L281 TraceCheckUtils]: 6: Hoare triple {5496#(< ~counter~0 98)} assume !(0 == assume_abort_if_not_~cond); {5496#(< ~counter~0 98)} is VALID [2021-09-13 14:18:29,018 INFO L281 TraceCheckUtils]: 5: Hoare triple {5496#(< ~counter~0 98)} 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;main_~c~0 := 0;main_~k~0 := 0;main_~xy~0 := main_~x~0 * main_~y~0;main_~yy~0 := main_~y~0 * main_~y~0;assume_abort_if_not_#in~cond := (if main_~xy~0 < 2147483647 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {5496#(< ~counter~0 98)} is VALID [2021-09-13 14:18:29,018 INFO L281 TraceCheckUtils]: 4: Hoare triple {5496#(< ~counter~0 98)} assume !(0 == assume_abort_if_not_~cond); {5496#(< ~counter~0 98)} is VALID [2021-09-13 14:18:29,018 INFO L281 TraceCheckUtils]: 3: Hoare triple {5496#(< ~counter~0 98)} 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; {5496#(< ~counter~0 98)} is VALID [2021-09-13 14:18:29,019 INFO L281 TraceCheckUtils]: 2: Hoare triple {5496#(< ~counter~0 98)} assume !(0 == assume_abort_if_not_~cond); {5496#(< ~counter~0 98)} is VALID [2021-09-13 14:18:29,019 INFO L281 TraceCheckUtils]: 1: Hoare triple {5496#(< ~counter~0 98)} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~post10, main_~temp~0, main_#t~post9, main_~x~0, main_~y~0, main_~a~0, main_~b~0, main_~p~0, main_~q~0, main_~r~0, main_~s~0, main_~c~0, main_~k~0, main_~xy~0, main_~yy~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;havoc main_~c~0;havoc main_~k~0;havoc main_~xy~0;havoc main_~yy~0;assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647;main_~x~0 := main_#t~nondet7;havoc main_#t~nondet7;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_~x~0 >= 1 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {5496#(< ~counter~0 98)} is VALID [2021-09-13 14:18:29,020 INFO L281 TraceCheckUtils]: 0: Hoare triple {5331#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);~counter~0 := 0; {5496#(< ~counter~0 98)} is VALID [2021-09-13 14:18:29,020 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:18:29,020 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:18:29,021 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373072162] [2021-09-13 14:18:29,021 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-09-13 14:18:29,021 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [860736397] [2021-09-13 14:18:29,021 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [860736397] provided 0 perfect and 2 imperfect interpolant sequences [2021-09-13 14:18:29,021 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-09-13 14:18:29,021 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2021-09-13 14:18:29,021 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604714731] [2021-09-13 14:18:29,022 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 9 states have internal predecessors, (55), 0 states have call successors, (0), 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 31 [2021-09-13 14:18:29,022 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:18:29,022 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 5.5) internal successors, (55), 9 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:18:29,065 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:18:29,065 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-09-13 14:18:29,066 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:18:29,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-09-13 14:18:29,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-09-13 14:18:29,066 INFO L87 Difference]: Start difference. First operand 179 states and 226 transitions. Second operand has 10 states, 10 states have (on average 5.5) internal successors, (55), 9 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:18:29,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:18:29,820 INFO L93 Difference]: Finished difference Result 313 states and 385 transitions. [2021-09-13 14:18:29,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-09-13 14:18:29,820 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 9 states have internal predecessors, (55), 0 states have call successors, (0), 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 31 [2021-09-13 14:18:29,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:18:29,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 5.5) internal successors, (55), 9 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:18:29,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 166 transitions. [2021-09-13 14:18:29,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 5.5) internal successors, (55), 9 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:18:29,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 166 transitions. [2021-09-13 14:18:29,823 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 166 transitions. [2021-09-13 14:18:29,948 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 166 edges. 166 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:18:29,951 INFO L225 Difference]: With dead ends: 313 [2021-09-13 14:18:29,951 INFO L226 Difference]: Without dead ends: 220 [2021-09-13 14:18:29,952 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 65.03ms TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2021-09-13 14:18:29,952 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 96 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 157.06ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.26ms SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 158.49ms IncrementalHoareTripleChecker+Time [2021-09-13 14:18:29,952 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [96 Valid, 0 Invalid, 253 Unknown, 0 Unchecked, 1.26ms Time], IncrementalHoareTripleChecker [16 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 158.49ms Time] [2021-09-13 14:18:29,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2021-09-13 14:18:30,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 192. [2021-09-13 14:18:30,353 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:18:30,353 INFO L82 GeneralOperation]: Start isEquivalent. First operand 220 states. Second operand has 192 states, 187 states have (on average 1.2513368983957218) internal successors, (234), 191 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:18:30,353 INFO L74 IsIncluded]: Start isIncluded. First operand 220 states. Second operand has 192 states, 187 states have (on average 1.2513368983957218) internal successors, (234), 191 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:18:30,354 INFO L87 Difference]: Start difference. First operand 220 states. Second operand has 192 states, 187 states have (on average 1.2513368983957218) internal successors, (234), 191 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:18:30,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:18:30,358 INFO L93 Difference]: Finished difference Result 220 states and 254 transitions. [2021-09-13 14:18:30,358 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 254 transitions. [2021-09-13 14:18:30,359 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:18:30,359 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:18:30,359 INFO L74 IsIncluded]: Start isIncluded. First operand has 192 states, 187 states have (on average 1.2513368983957218) internal successors, (234), 191 states have internal predecessors, (234), 0 states have call successors, (0), 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 220 states. [2021-09-13 14:18:30,359 INFO L87 Difference]: Start difference. First operand has 192 states, 187 states have (on average 1.2513368983957218) internal successors, (234), 191 states have internal predecessors, (234), 0 states have call successors, (0), 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 220 states. [2021-09-13 14:18:30,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:18:30,363 INFO L93 Difference]: Finished difference Result 220 states and 254 transitions. [2021-09-13 14:18:30,363 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 254 transitions. [2021-09-13 14:18:30,364 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:18:30,364 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:18:30,364 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:18:30,364 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:18:30,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 187 states have (on average 1.2513368983957218) internal successors, (234), 191 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:18:30,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 234 transitions. [2021-09-13 14:18:30,368 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 234 transitions. Word has length 31 [2021-09-13 14:18:30,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:18:30,368 INFO L470 AbstractCegarLoop]: Abstraction has 192 states and 234 transitions. [2021-09-13 14:18:30,368 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 9 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:18:30,368 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 234 transitions. [2021-09-13 14:18:30,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-09-13 14:18:30,368 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:18:30,369 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:18:30,385 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:18:30,572 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:18:30,573 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-09-13 14:18:30,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:18:30,573 INFO L82 PathProgramCache]: Analyzing trace with hash 302394158, now seen corresponding path program 1 times [2021-09-13 14:18:30,574 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:18:30,574 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721859405] [2021-09-13 14:18:30,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:18:30,574 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:18:30,581 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-09-13 14:18:30,581 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1954892450] [2021-09-13 14:18:30,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:18:30,582 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:18:30,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:18:30,583 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:18:30,584 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:18:30,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:18:30,628 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 24 conjunts are in the unsatisfiable core [2021-09-13 14:18:30,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:18:30,642 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:18:31,140 INFO L281 TraceCheckUtils]: 0: Hoare triple {6664#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);~counter~0 := 0; {6664#true} is VALID [2021-09-13 14:18:31,140 INFO L281 TraceCheckUtils]: 1: Hoare triple {6664#true} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~post10, main_~temp~0, main_#t~post9, main_~x~0, main_~y~0, main_~a~0, main_~b~0, main_~p~0, main_~q~0, main_~r~0, main_~s~0, main_~c~0, main_~k~0, main_~xy~0, main_~yy~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;havoc main_~c~0;havoc main_~k~0;havoc main_~xy~0;havoc main_~yy~0;assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647;main_~x~0 := main_#t~nondet7;havoc main_#t~nondet7;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_~x~0 >= 1 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {6664#true} is VALID [2021-09-13 14:18:31,141 INFO L281 TraceCheckUtils]: 2: Hoare triple {6664#true} assume !(0 == assume_abort_if_not_~cond); {6664#true} is VALID [2021-09-13 14:18:31,141 INFO L281 TraceCheckUtils]: 3: Hoare triple {6664#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; {6664#true} is VALID [2021-09-13 14:18:31,141 INFO L281 TraceCheckUtils]: 4: Hoare triple {6664#true} assume !(0 == assume_abort_if_not_~cond); {6664#true} is VALID [2021-09-13 14:18:31,143 INFO L281 TraceCheckUtils]: 5: Hoare triple {6664#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;main_~c~0 := 0;main_~k~0 := 0;main_~xy~0 := main_~x~0 * main_~y~0;main_~yy~0 := main_~y~0 * main_~y~0;assume_abort_if_not_#in~cond := (if main_~xy~0 < 2147483647 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {6684#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~q~0 0))} is VALID [2021-09-13 14:18:31,147 INFO L281 TraceCheckUtils]: 6: Hoare triple {6684#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~q~0 0))} assume !(0 == assume_abort_if_not_~cond); {6684#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~q~0 0))} is VALID [2021-09-13 14:18:31,147 INFO L281 TraceCheckUtils]: 7: Hoare triple {6684#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~q~0 0))} assume_abort_if_not_#in~cond := (if main_~yy~0 < 2147483647 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {6684#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~q~0 0))} is VALID [2021-09-13 14:18:31,147 INFO L281 TraceCheckUtils]: 8: Hoare triple {6684#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~q~0 0))} assume !(0 == assume_abort_if_not_~cond); {6684#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~q~0 0))} is VALID [2021-09-13 14:18:31,148 INFO L281 TraceCheckUtils]: 9: Hoare triple {6684#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~q~0 0))} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {6684#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~q~0 0))} is VALID [2021-09-13 14:18:31,149 INFO L281 TraceCheckUtils]: 10: Hoare triple {6684#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~q~0 0))} assume !!(main_#t~post9 < 100);havoc main_#t~post9; {6684#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~q~0 0))} is VALID [2021-09-13 14:18:31,149 INFO L281 TraceCheckUtils]: 11: Hoare triple {6684#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~q~0 0))} assume !!(0 != main_~b~0);main_~c~0 := main_~a~0;main_~k~0 := 0; {6703#(and (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~q~0 0))} is VALID [2021-09-13 14:18:31,150 INFO L281 TraceCheckUtils]: 12: Hoare triple {6703#(and (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~q~0 0))} main_#t~post10 := ~counter~0;~counter~0 := 1 + main_#t~post10; {6703#(and (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~q~0 0))} is VALID [2021-09-13 14:18:31,150 INFO L281 TraceCheckUtils]: 13: Hoare triple {6703#(and (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~q~0 0))} assume !!(main_#t~post10 < 100);havoc main_#t~post10;__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; {6703#(and (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~q~0 0))} is VALID [2021-09-13 14:18:31,151 INFO L281 TraceCheckUtils]: 14: Hoare triple {6703#(and (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~q~0 0))} assume !(0 == __VERIFIER_assert_~cond); {6703#(and (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~q~0 0))} is VALID [2021-09-13 14:18:31,151 INFO L281 TraceCheckUtils]: 15: Hoare triple {6703#(and (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~q~0 0))} __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; {6703#(and (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~q~0 0))} is VALID [2021-09-13 14:18:31,151 INFO L281 TraceCheckUtils]: 16: Hoare triple {6703#(and (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~q~0 0))} assume !(0 == __VERIFIER_assert_~cond); {6703#(and (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~q~0 0))} is VALID [2021-09-13 14:18:31,152 INFO L281 TraceCheckUtils]: 17: Hoare triple {6703#(and (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~q~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; {6722#(and (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~x~0) (or (and (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0) (= 1 ULTIMATE.start___VERIFIER_assert_~cond)) (and (not (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0)) (= 0 ULTIMATE.start___VERIFIER_assert_~cond))) (= ULTIMATE.start_main_~q~0 0))} is VALID [2021-09-13 14:18:31,152 INFO L281 TraceCheckUtils]: 18: Hoare triple {6722#(and (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~x~0) (or (and (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0) (= 1 ULTIMATE.start___VERIFIER_assert_~cond)) (and (not (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0)) (= 0 ULTIMATE.start___VERIFIER_assert_~cond))) (= ULTIMATE.start_main_~q~0 0))} assume !(0 == __VERIFIER_assert_~cond); {6726#(and (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~q~0 0))} is VALID [2021-09-13 14:18:31,153 INFO L281 TraceCheckUtils]: 19: Hoare triple {6726#(and (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~q~0 0))} __VERIFIER_assert_#in~cond := (if 0 == main_~q~0 * main_~xy~0 + main_~s~0 * main_~yy~0 - main_~q~0 * main_~x~0 - main_~b~0 * main_~y~0 - main_~s~0 * main_~y~0 + main_~b~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {6726#(and (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~q~0 0))} is VALID [2021-09-13 14:18:31,153 INFO L281 TraceCheckUtils]: 20: Hoare triple {6726#(and (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~q~0 0))} assume !(0 == __VERIFIER_assert_~cond); {6726#(and (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~q~0 0))} is VALID [2021-09-13 14:18:31,154 INFO L281 TraceCheckUtils]: 21: Hoare triple {6726#(and (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~q~0 0))} assume !(main_~c~0 >= main_~b~0); {6726#(and (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~q~0 0))} is VALID [2021-09-13 14:18:31,154 INFO L281 TraceCheckUtils]: 22: Hoare triple {6726#(and (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~q~0 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; {6739#(and (= ULTIMATE.start_main_~p~0 0) (= 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:18:31,154 INFO L281 TraceCheckUtils]: 23: Hoare triple {6739#(and (= ULTIMATE.start_main_~p~0 0) (= 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))))} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {6739#(and (= ULTIMATE.start_main_~p~0 0) (= 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:18:31,155 INFO L281 TraceCheckUtils]: 24: Hoare triple {6739#(and (= ULTIMATE.start_main_~p~0 0) (= 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_#t~post9 < 100);havoc main_#t~post9; {6739#(and (= ULTIMATE.start_main_~p~0 0) (= 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:18:31,157 INFO L281 TraceCheckUtils]: 25: Hoare triple {6739#(and (= ULTIMATE.start_main_~p~0 0) (= 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);main_~c~0 := main_~a~0;main_~k~0 := 0; {6739#(and (= ULTIMATE.start_main_~p~0 0) (= 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:18:31,157 INFO L281 TraceCheckUtils]: 26: Hoare triple {6739#(and (= ULTIMATE.start_main_~p~0 0) (= 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))))} main_#t~post10 := ~counter~0;~counter~0 := 1 + main_#t~post10; {6739#(and (= ULTIMATE.start_main_~p~0 0) (= 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:18:31,158 INFO L281 TraceCheckUtils]: 27: Hoare triple {6739#(and (= ULTIMATE.start_main_~p~0 0) (= 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_#t~post10 < 100);havoc main_#t~post10;__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; {6739#(and (= ULTIMATE.start_main_~p~0 0) (= 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:18:31,158 INFO L281 TraceCheckUtils]: 28: Hoare triple {6739#(and (= ULTIMATE.start_main_~p~0 0) (= 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); {6739#(and (= ULTIMATE.start_main_~p~0 0) (= 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:18:31,159 INFO L281 TraceCheckUtils]: 29: Hoare triple {6739#(and (= ULTIMATE.start_main_~p~0 0) (= 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_~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; {6761#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} is VALID [2021-09-13 14:18:31,160 INFO L281 TraceCheckUtils]: 30: Hoare triple {6761#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} assume 0 == __VERIFIER_assert_~cond; {6665#false} is VALID [2021-09-13 14:18:31,160 INFO L281 TraceCheckUtils]: 31: Hoare triple {6665#false} assume !false; {6665#false} is VALID [2021-09-13 14:18:31,160 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:18:31,160 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 14:18:31,462 INFO L281 TraceCheckUtils]: 31: Hoare triple {6665#false} assume !false; {6665#false} is VALID [2021-09-13 14:18:31,463 INFO L281 TraceCheckUtils]: 30: Hoare triple {6761#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} assume 0 == __VERIFIER_assert_~cond; {6665#false} is VALID [2021-09-13 14:18:31,464 INFO L281 TraceCheckUtils]: 29: Hoare triple {6774#(= 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_~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; {6761#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} is VALID [2021-09-13 14:18:31,464 INFO L281 TraceCheckUtils]: 28: Hoare triple {6774#(= 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); {6774#(= 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:18:31,465 INFO L281 TraceCheckUtils]: 27: Hoare triple {6774#(= 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_#t~post10 < 100);havoc main_#t~post10;__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; {6774#(= 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:18:31,465 INFO L281 TraceCheckUtils]: 26: Hoare triple {6774#(= 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)))} main_#t~post10 := ~counter~0;~counter~0 := 1 + main_#t~post10; {6774#(= 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:18:31,465 INFO L281 TraceCheckUtils]: 25: Hoare triple {6774#(= 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);main_~c~0 := main_~a~0;main_~k~0 := 0; {6774#(= 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:18:31,466 INFO L281 TraceCheckUtils]: 24: Hoare triple {6774#(= 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_#t~post9 < 100);havoc main_#t~post9; {6774#(= 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:18:31,466 INFO L281 TraceCheckUtils]: 23: Hoare triple {6774#(= 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)))} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {6774#(= 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:18:31,467 INFO L281 TraceCheckUtils]: 22: Hoare triple {6796#(= (+ (* ULTIMATE.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; {6774#(= 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:18:31,468 INFO L281 TraceCheckUtils]: 21: Hoare triple {6796#(= (+ (* ULTIMATE.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); {6796#(= (+ (* ULTIMATE.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:18:31,468 INFO L281 TraceCheckUtils]: 20: Hoare triple {6796#(= (+ (* ULTIMATE.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); {6796#(= (+ (* ULTIMATE.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:18:31,468 INFO L281 TraceCheckUtils]: 19: Hoare triple {6796#(= (+ (* ULTIMATE.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 0 == main_~q~0 * main_~xy~0 + main_~s~0 * main_~yy~0 - main_~q~0 * main_~x~0 - main_~b~0 * main_~y~0 - main_~s~0 * main_~y~0 + main_~b~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {6796#(= (+ (* ULTIMATE.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:18:31,469 INFO L281 TraceCheckUtils]: 18: Hoare triple {6809#(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); {6796#(= (+ (* ULTIMATE.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:18:31,470 INFO L281 TraceCheckUtils]: 17: Hoare triple {6664#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; {6809#(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:18:31,470 INFO L281 TraceCheckUtils]: 16: Hoare triple {6664#true} assume !(0 == __VERIFIER_assert_~cond); {6664#true} is VALID [2021-09-13 14:18:31,470 INFO L281 TraceCheckUtils]: 15: Hoare triple {6664#true} __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; {6664#true} is VALID [2021-09-13 14:18:31,470 INFO L281 TraceCheckUtils]: 14: Hoare triple {6664#true} assume !(0 == __VERIFIER_assert_~cond); {6664#true} is VALID [2021-09-13 14:18:31,470 INFO L281 TraceCheckUtils]: 13: Hoare triple {6664#true} assume !!(main_#t~post10 < 100);havoc main_#t~post10;__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; {6664#true} is VALID [2021-09-13 14:18:31,470 INFO L281 TraceCheckUtils]: 12: Hoare triple {6664#true} main_#t~post10 := ~counter~0;~counter~0 := 1 + main_#t~post10; {6664#true} is VALID [2021-09-13 14:18:31,471 INFO L281 TraceCheckUtils]: 11: Hoare triple {6664#true} assume !!(0 != main_~b~0);main_~c~0 := main_~a~0;main_~k~0 := 0; {6664#true} is VALID [2021-09-13 14:18:31,471 INFO L281 TraceCheckUtils]: 10: Hoare triple {6664#true} assume !!(main_#t~post9 < 100);havoc main_#t~post9; {6664#true} is VALID [2021-09-13 14:18:31,471 INFO L281 TraceCheckUtils]: 9: Hoare triple {6664#true} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {6664#true} is VALID [2021-09-13 14:18:31,471 INFO L281 TraceCheckUtils]: 8: Hoare triple {6664#true} assume !(0 == assume_abort_if_not_~cond); {6664#true} is VALID [2021-09-13 14:18:31,471 INFO L281 TraceCheckUtils]: 7: Hoare triple {6664#true} assume_abort_if_not_#in~cond := (if main_~yy~0 < 2147483647 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {6664#true} is VALID [2021-09-13 14:18:31,471 INFO L281 TraceCheckUtils]: 6: Hoare triple {6664#true} assume !(0 == assume_abort_if_not_~cond); {6664#true} is VALID [2021-09-13 14:18:31,471 INFO L281 TraceCheckUtils]: 5: Hoare triple {6664#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;main_~c~0 := 0;main_~k~0 := 0;main_~xy~0 := main_~x~0 * main_~y~0;main_~yy~0 := main_~y~0 * main_~y~0;assume_abort_if_not_#in~cond := (if main_~xy~0 < 2147483647 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {6664#true} is VALID [2021-09-13 14:18:31,472 INFO L281 TraceCheckUtils]: 4: Hoare triple {6664#true} assume !(0 == assume_abort_if_not_~cond); {6664#true} is VALID [2021-09-13 14:18:31,472 INFO L281 TraceCheckUtils]: 3: Hoare triple {6664#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; {6664#true} is VALID [2021-09-13 14:18:31,472 INFO L281 TraceCheckUtils]: 2: Hoare triple {6664#true} assume !(0 == assume_abort_if_not_~cond); {6664#true} is VALID [2021-09-13 14:18:31,472 INFO L281 TraceCheckUtils]: 1: Hoare triple {6664#true} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~post10, main_~temp~0, main_#t~post9, main_~x~0, main_~y~0, main_~a~0, main_~b~0, main_~p~0, main_~q~0, main_~r~0, main_~s~0, main_~c~0, main_~k~0, main_~xy~0, main_~yy~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;havoc main_~c~0;havoc main_~k~0;havoc main_~xy~0;havoc main_~yy~0;assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647;main_~x~0 := main_#t~nondet7;havoc main_#t~nondet7;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_~x~0 >= 1 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {6664#true} is VALID [2021-09-13 14:18:31,472 INFO L281 TraceCheckUtils]: 0: Hoare triple {6664#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);~counter~0 := 0; {6664#true} is VALID [2021-09-13 14:18:31,472 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:18:31,473 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:18:31,473 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721859405] [2021-09-13 14:18:31,473 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-09-13 14:18:31,473 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1954892450] [2021-09-13 14:18:31,473 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1954892450] provided 1 perfect and 1 imperfect interpolant sequences [2021-09-13 14:18:31,473 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-09-13 14:18:31,474 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 11 [2021-09-13 14:18:31,474 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787897061] [2021-09-13 14:18:31,474 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 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 32 [2021-09-13 14:18:31,474 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:18:31,474 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 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:18:31,504 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:18:31,504 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-09-13 14:18:31,504 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:18:31,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-09-13 14:18:31,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2021-09-13 14:18:31,505 INFO L87 Difference]: Start difference. First operand 192 states and 234 transitions. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 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:18:32,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:18:32,416 INFO L93 Difference]: Finished difference Result 294 states and 364 transitions. [2021-09-13 14:18:32,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-09-13 14:18:32,417 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 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 32 [2021-09-13 14:18:32,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:18:32,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 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:18:32,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 100 transitions. [2021-09-13 14:18:32,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 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:18:32,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 100 transitions. [2021-09-13 14:18:32,419 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 100 transitions. [2021-09-13 14:18:32,491 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:18:32,495 INFO L225 Difference]: With dead ends: 294 [2021-09-13 14:18:32,495 INFO L226 Difference]: Without dead ends: 286 [2021-09-13 14:18:32,496 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 169.16ms TimeCoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2021-09-13 14:18:32,496 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 98 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 128.23ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.87ms SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 129.28ms IncrementalHoareTripleChecker+Time [2021-09-13 14:18:32,497 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [98 Valid, 0 Invalid, 180 Unknown, 0 Unchecked, 0.87ms Time], IncrementalHoareTripleChecker [18 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 129.28ms Time] [2021-09-13 14:18:32,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2021-09-13 14:18:33,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 269. [2021-09-13 14:18:33,030 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:18:33,030 INFO L82 GeneralOperation]: Start isEquivalent. First operand 286 states. Second operand has 269 states, 264 states have (on average 1.2575757575757576) internal successors, (332), 268 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:18:33,031 INFO L74 IsIncluded]: Start isIncluded. First operand 286 states. Second operand has 269 states, 264 states have (on average 1.2575757575757576) internal successors, (332), 268 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:18:33,031 INFO L87 Difference]: Start difference. First operand 286 states. Second operand has 269 states, 264 states have (on average 1.2575757575757576) internal successors, (332), 268 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:18:33,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:18:33,037 INFO L93 Difference]: Finished difference Result 286 states and 345 transitions. [2021-09-13 14:18:33,037 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 345 transitions. [2021-09-13 14:18:33,038 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:18:33,038 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:18:33,038 INFO L74 IsIncluded]: Start isIncluded. First operand has 269 states, 264 states have (on average 1.2575757575757576) internal successors, (332), 268 states have internal predecessors, (332), 0 states have call successors, (0), 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 286 states. [2021-09-13 14:18:33,039 INFO L87 Difference]: Start difference. First operand has 269 states, 264 states have (on average 1.2575757575757576) internal successors, (332), 268 states have internal predecessors, (332), 0 states have call successors, (0), 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 286 states. [2021-09-13 14:18:33,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:18:33,044 INFO L93 Difference]: Finished difference Result 286 states and 345 transitions. [2021-09-13 14:18:33,045 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 345 transitions. [2021-09-13 14:18:33,045 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:18:33,045 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:18:33,045 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:18:33,045 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:18:33,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 264 states have (on average 1.2575757575757576) internal successors, (332), 268 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:18:33,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 332 transitions. [2021-09-13 14:18:33,052 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 332 transitions. Word has length 32 [2021-09-13 14:18:33,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:18:33,052 INFO L470 AbstractCegarLoop]: Abstraction has 269 states and 332 transitions. [2021-09-13 14:18:33,052 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 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:18:33,052 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 332 transitions. [2021-09-13 14:18:33,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-09-13 14:18:33,053 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:18:33,053 INFO L513 BasicCegarLoop]: trace histogram [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] [2021-09-13 14:18:33,076 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:18:33,266 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:18:33,266 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-09-13 14:18:33,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:18:33,270 INFO L82 PathProgramCache]: Analyzing trace with hash -1456833039, now seen corresponding path program 1 times [2021-09-13 14:18:33,270 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:18:33,270 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977077963] [2021-09-13 14:18:33,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:18:33,270 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:18:33,278 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-09-13 14:18:33,278 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [416806622] [2021-09-13 14:18:33,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:18:33,278 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:18:33,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:18:33,279 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:18:33,281 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:18:33,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:18:33,336 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 40 conjunts are in the unsatisfiable core [2021-09-13 14:18:33,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:18:33,346 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:18:34,566 INFO L281 TraceCheckUtils]: 0: Hoare triple {8233#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);~counter~0 := 0; {8233#true} is VALID [2021-09-13 14:18:34,567 INFO L281 TraceCheckUtils]: 1: Hoare triple {8233#true} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~post10, main_~temp~0, main_#t~post9, main_~x~0, main_~y~0, main_~a~0, main_~b~0, main_~p~0, main_~q~0, main_~r~0, main_~s~0, main_~c~0, main_~k~0, main_~xy~0, main_~yy~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;havoc main_~c~0;havoc main_~k~0;havoc main_~xy~0;havoc main_~yy~0;assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647;main_~x~0 := main_#t~nondet7;havoc main_#t~nondet7;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_~x~0 >= 1 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {8241#(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:18:34,567 INFO L281 TraceCheckUtils]: 2: Hoare triple {8241#(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); {8245#(<= 1 ULTIMATE.start_main_~x~0)} is VALID [2021-09-13 14:18:34,567 INFO L281 TraceCheckUtils]: 3: Hoare triple {8245#(<= 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; {8245#(<= 1 ULTIMATE.start_main_~x~0)} is VALID [2021-09-13 14:18:34,568 INFO L281 TraceCheckUtils]: 4: Hoare triple {8245#(<= 1 ULTIMATE.start_main_~x~0)} assume !(0 == assume_abort_if_not_~cond); {8245#(<= 1 ULTIMATE.start_main_~x~0)} is VALID [2021-09-13 14:18:34,568 INFO L281 TraceCheckUtils]: 5: Hoare triple {8245#(<= 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;main_~c~0 := 0;main_~k~0 := 0;main_~xy~0 := main_~x~0 * main_~y~0;main_~yy~0 := main_~y~0 * main_~y~0;assume_abort_if_not_#in~cond := (if main_~xy~0 < 2147483647 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {8255#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~p~0 1) (<= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (<= 1 ULTIMATE.start_main_~x~0))} is VALID [2021-09-13 14:18:34,569 INFO L281 TraceCheckUtils]: 6: Hoare triple {8255#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~p~0 1) (<= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (<= 1 ULTIMATE.start_main_~x~0))} assume !(0 == assume_abort_if_not_~cond); {8255#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~p~0 1) (<= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (<= 1 ULTIMATE.start_main_~x~0))} is VALID [2021-09-13 14:18:34,570 INFO L281 TraceCheckUtils]: 7: Hoare triple {8255#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~p~0 1) (<= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (<= 1 ULTIMATE.start_main_~x~0))} assume_abort_if_not_#in~cond := (if main_~yy~0 < 2147483647 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {8255#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~p~0 1) (<= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (<= 1 ULTIMATE.start_main_~x~0))} is VALID [2021-09-13 14:18:34,571 INFO L281 TraceCheckUtils]: 8: Hoare triple {8255#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~p~0 1) (<= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (<= 1 ULTIMATE.start_main_~x~0))} assume !(0 == assume_abort_if_not_~cond); {8255#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~p~0 1) (<= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (<= 1 ULTIMATE.start_main_~x~0))} is VALID [2021-09-13 14:18:34,571 INFO L281 TraceCheckUtils]: 9: Hoare triple {8255#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~p~0 1) (<= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (<= 1 ULTIMATE.start_main_~x~0))} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {8255#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~p~0 1) (<= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (<= 1 ULTIMATE.start_main_~x~0))} is VALID [2021-09-13 14:18:34,571 INFO L281 TraceCheckUtils]: 10: Hoare triple {8255#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~p~0 1) (<= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (<= 1 ULTIMATE.start_main_~x~0))} assume !!(main_#t~post9 < 100);havoc main_#t~post9; {8255#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~p~0 1) (<= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (<= 1 ULTIMATE.start_main_~x~0))} is VALID [2021-09-13 14:18:34,572 INFO L281 TraceCheckUtils]: 11: Hoare triple {8255#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~p~0 1) (<= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (<= 1 ULTIMATE.start_main_~x~0))} assume !!(0 != main_~b~0);main_~c~0 := main_~a~0;main_~k~0 := 0; {8274#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~p~0 1) (<= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (<= 1 ULTIMATE.start_main_~x~0))} is VALID [2021-09-13 14:18:34,579 INFO L281 TraceCheckUtils]: 12: Hoare triple {8274#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~p~0 1) (<= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (<= 1 ULTIMATE.start_main_~x~0))} main_#t~post10 := ~counter~0;~counter~0 := 1 + main_#t~post10; {8274#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~p~0 1) (<= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (<= 1 ULTIMATE.start_main_~x~0))} is VALID [2021-09-13 14:18:34,580 INFO L281 TraceCheckUtils]: 13: Hoare triple {8274#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~p~0 1) (<= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (<= 1 ULTIMATE.start_main_~x~0))} assume !!(main_#t~post10 < 100);havoc main_#t~post10;__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; {8274#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~p~0 1) (<= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (<= 1 ULTIMATE.start_main_~x~0))} is VALID [2021-09-13 14:18:34,580 INFO L281 TraceCheckUtils]: 14: Hoare triple {8274#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~p~0 1) (<= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (<= 1 ULTIMATE.start_main_~x~0))} assume !(0 == __VERIFIER_assert_~cond); {8274#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~p~0 1) (<= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (<= 1 ULTIMATE.start_main_~x~0))} is VALID [2021-09-13 14:18:34,581 INFO L281 TraceCheckUtils]: 15: Hoare triple {8274#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~p~0 1) (<= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (<= 1 ULTIMATE.start_main_~x~0))} __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; {8287#(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_~y~0) (= 1 ULTIMATE.start___VERIFIER_assert_~cond) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (<= 1 ULTIMATE.start_main_~x~0))} is VALID [2021-09-13 14:18:34,581 INFO L281 TraceCheckUtils]: 16: Hoare triple {8287#(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_~y~0) (= 1 ULTIMATE.start___VERIFIER_assert_~cond) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (<= 1 ULTIMATE.start_main_~x~0))} assume !(0 == __VERIFIER_assert_~cond); {8291#(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_~y~0) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (<= 1 ULTIMATE.start_main_~x~0))} is VALID [2021-09-13 14:18:34,582 INFO L281 TraceCheckUtils]: 17: Hoare triple {8291#(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_~y~0) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (<= 1 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; {8291#(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_~y~0) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (<= 1 ULTIMATE.start_main_~x~0))} is VALID [2021-09-13 14:18:34,582 INFO L281 TraceCheckUtils]: 18: Hoare triple {8291#(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_~y~0) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (<= 1 ULTIMATE.start_main_~x~0))} assume !(0 == __VERIFIER_assert_~cond); {8291#(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_~y~0) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (<= 1 ULTIMATE.start_main_~x~0))} is VALID [2021-09-13 14:18:34,583 INFO L281 TraceCheckUtils]: 19: Hoare triple {8291#(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_~y~0) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (<= 1 ULTIMATE.start_main_~x~0))} __VERIFIER_assert_#in~cond := (if 0 == main_~q~0 * main_~xy~0 + main_~s~0 * main_~yy~0 - main_~q~0 * main_~x~0 - main_~b~0 * main_~y~0 - main_~s~0 * main_~y~0 + main_~b~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {8291#(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_~y~0) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (<= 1 ULTIMATE.start_main_~x~0))} is VALID [2021-09-13 14:18:34,583 INFO L281 TraceCheckUtils]: 20: Hoare triple {8291#(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_~y~0) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (<= 1 ULTIMATE.start_main_~x~0))} assume !(0 == __VERIFIER_assert_~cond); {8291#(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_~y~0) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (<= 1 ULTIMATE.start_main_~x~0))} is VALID [2021-09-13 14:18:34,584 INFO L281 TraceCheckUtils]: 21: Hoare triple {8291#(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_~y~0) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (<= 1 ULTIMATE.start_main_~x~0))} assume !(main_~c~0 >= main_~b~0); {8307#(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_~c~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (<= 1 ULTIMATE.start_main_~x~0))} is VALID [2021-09-13 14:18:34,584 INFO L281 TraceCheckUtils]: 22: Hoare triple {8307#(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_~c~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (<= 1 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; {8311#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~s~0 0) (< ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~q~0 1) (<= 1 ULTIMATE.start_main_~x~0))} is VALID [2021-09-13 14:18:34,585 INFO L281 TraceCheckUtils]: 23: Hoare triple {8311#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~s~0 0) (< ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~q~0 1) (<= 1 ULTIMATE.start_main_~x~0))} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {8311#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~s~0 0) (< ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~q~0 1) (<= 1 ULTIMATE.start_main_~x~0))} is VALID [2021-09-13 14:18:34,585 INFO L281 TraceCheckUtils]: 24: Hoare triple {8311#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~s~0 0) (< ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~q~0 1) (<= 1 ULTIMATE.start_main_~x~0))} assume !!(main_#t~post9 < 100);havoc main_#t~post9; {8311#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~s~0 0) (< ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~q~0 1) (<= 1 ULTIMATE.start_main_~x~0))} is VALID [2021-09-13 14:18:34,585 INFO L281 TraceCheckUtils]: 25: Hoare triple {8311#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~s~0 0) (< ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~q~0 1) (<= 1 ULTIMATE.start_main_~x~0))} assume !!(0 != main_~b~0);main_~c~0 := main_~a~0;main_~k~0 := 0; {8311#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~s~0 0) (< ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~q~0 1) (<= 1 ULTIMATE.start_main_~x~0))} is VALID [2021-09-13 14:18:34,586 INFO L281 TraceCheckUtils]: 26: Hoare triple {8311#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~s~0 0) (< ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~q~0 1) (<= 1 ULTIMATE.start_main_~x~0))} main_#t~post10 := ~counter~0;~counter~0 := 1 + main_#t~post10; {8311#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~s~0 0) (< ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~q~0 1) (<= 1 ULTIMATE.start_main_~x~0))} is VALID [2021-09-13 14:18:34,586 INFO L281 TraceCheckUtils]: 27: Hoare triple {8311#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~s~0 0) (< ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~q~0 1) (<= 1 ULTIMATE.start_main_~x~0))} assume !!(main_#t~post10 < 100);havoc main_#t~post10;__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; {8311#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~s~0 0) (< ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~q~0 1) (<= 1 ULTIMATE.start_main_~x~0))} is VALID [2021-09-13 14:18:34,587 INFO L281 TraceCheckUtils]: 28: Hoare triple {8311#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~s~0 0) (< ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~q~0 1) (<= 1 ULTIMATE.start_main_~x~0))} assume !(0 == __VERIFIER_assert_~cond); {8311#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~s~0 0) (< ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~q~0 1) (<= 1 ULTIMATE.start_main_~x~0))} is VALID [2021-09-13 14:18:34,587 INFO L281 TraceCheckUtils]: 29: Hoare triple {8311#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~s~0 0) (< ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~q~0 1) (<= 1 ULTIMATE.start_main_~x~0))} __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; {8311#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~s~0 0) (< ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~q~0 1) (<= 1 ULTIMATE.start_main_~x~0))} is VALID [2021-09-13 14:18:34,588 INFO L281 TraceCheckUtils]: 30: Hoare triple {8311#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~s~0 0) (< ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~q~0 1) (<= 1 ULTIMATE.start_main_~x~0))} assume !(0 == __VERIFIER_assert_~cond); {8311#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~s~0 0) (< ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~q~0 1) (<= 1 ULTIMATE.start_main_~x~0))} is VALID [2021-09-13 14:18:34,588 INFO L281 TraceCheckUtils]: 31: Hoare triple {8311#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~s~0 0) (< ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~q~0 1) (<= 1 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; {8339#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} is VALID [2021-09-13 14:18:34,589 INFO L281 TraceCheckUtils]: 32: Hoare triple {8339#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} assume 0 == __VERIFIER_assert_~cond; {8234#false} is VALID [2021-09-13 14:18:34,589 INFO L281 TraceCheckUtils]: 33: Hoare triple {8234#false} assume !false; {8234#false} is VALID [2021-09-13 14:18:34,589 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:18:34,589 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 14:18:35,401 INFO L281 TraceCheckUtils]: 33: Hoare triple {8234#false} assume !false; {8234#false} is VALID [2021-09-13 14:18:35,402 INFO L281 TraceCheckUtils]: 32: Hoare triple {8339#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} assume 0 == __VERIFIER_assert_~cond; {8234#false} is VALID [2021-09-13 14:18:35,403 INFO L281 TraceCheckUtils]: 31: Hoare triple {8352#(= (+ (* ULTIMATE.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; {8339#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} is VALID [2021-09-13 14:18:35,403 INFO L281 TraceCheckUtils]: 30: Hoare triple {8352#(= (+ (* ULTIMATE.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); {8352#(= (+ (* ULTIMATE.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:18:35,403 INFO L281 TraceCheckUtils]: 29: Hoare triple {8352#(= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0)} __VERIFIER_assert_#in~cond := (if main_~a~0 == main_~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; {8352#(= (+ (* ULTIMATE.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:18:35,404 INFO L281 TraceCheckUtils]: 28: Hoare triple {8352#(= (+ (* ULTIMATE.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); {8352#(= (+ (* ULTIMATE.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:18:35,404 INFO L281 TraceCheckUtils]: 27: Hoare triple {8352#(= (+ (* ULTIMATE.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_#t~post10 < 100);havoc main_#t~post10;__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; {8352#(= (+ (* ULTIMATE.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:18:35,405 INFO L281 TraceCheckUtils]: 26: Hoare triple {8352#(= (+ (* ULTIMATE.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_#t~post10 := ~counter~0;~counter~0 := 1 + main_#t~post10; {8352#(= (+ (* ULTIMATE.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:18:35,405 INFO L281 TraceCheckUtils]: 25: Hoare triple {8371#(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 0))} assume !!(0 != main_~b~0);main_~c~0 := main_~a~0;main_~k~0 := 0; {8352#(= (+ (* ULTIMATE.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:18:35,405 INFO L281 TraceCheckUtils]: 24: Hoare triple {8371#(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 0))} assume !!(main_#t~post9 < 100);havoc main_#t~post9; {8371#(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 0))} is VALID [2021-09-13 14:18:35,406 INFO L281 TraceCheckUtils]: 23: Hoare triple {8371#(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 0))} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {8371#(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 0))} is VALID [2021-09-13 14:18:36,379 INFO L281 TraceCheckUtils]: 22: Hoare triple {8381#(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))) (= ULTIMATE.start_main_~c~0 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; {8371#(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 0))} is VALID [2021-09-13 14:18:36,380 INFO L281 TraceCheckUtils]: 21: Hoare triple {8385#(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))) (<= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~c~0) (= ULTIMATE.start_main_~c~0 0))} assume !(main_~c~0 >= main_~b~0); {8381#(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))) (= ULTIMATE.start_main_~c~0 0))} is VALID [2021-09-13 14:18:36,380 INFO L281 TraceCheckUtils]: 20: Hoare triple {8385#(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))) (<= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~c~0) (= ULTIMATE.start_main_~c~0 0))} assume !(0 == __VERIFIER_assert_~cond); {8385#(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))) (<= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~c~0) (= ULTIMATE.start_main_~c~0 0))} is VALID [2021-09-13 14:18:36,381 INFO L281 TraceCheckUtils]: 19: Hoare triple {8385#(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))) (<= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~c~0) (= ULTIMATE.start_main_~c~0 0))} __VERIFIER_assert_#in~cond := (if 0 == main_~q~0 * main_~xy~0 + main_~s~0 * main_~yy~0 - main_~q~0 * main_~x~0 - main_~b~0 * main_~y~0 - main_~s~0 * main_~y~0 + main_~b~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {8385#(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))) (<= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~c~0) (= ULTIMATE.start_main_~c~0 0))} is VALID [2021-09-13 14:18:36,381 INFO L281 TraceCheckUtils]: 18: Hoare triple {8385#(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))) (<= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~c~0) (= ULTIMATE.start_main_~c~0 0))} assume !(0 == __VERIFIER_assert_~cond); {8385#(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))) (<= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~c~0) (= ULTIMATE.start_main_~c~0 0))} is VALID [2021-09-13 14:18:36,381 INFO L281 TraceCheckUtils]: 17: Hoare triple {8385#(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))) (<= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~c~0) (= ULTIMATE.start_main_~c~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; {8385#(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))) (<= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~c~0) (= ULTIMATE.start_main_~c~0 0))} is VALID [2021-09-13 14:18:36,382 INFO L281 TraceCheckUtils]: 16: Hoare triple {8401#(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))) (<= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~c~0) (= 0 ULTIMATE.start___VERIFIER_assert_~cond) (= ULTIMATE.start_main_~c~0 0))} assume !(0 == __VERIFIER_assert_~cond); {8385#(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))) (<= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~c~0) (= ULTIMATE.start_main_~c~0 0))} is VALID [2021-09-13 14:18:36,382 INFO L281 TraceCheckUtils]: 15: Hoare triple {8405#(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))) (<= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~c~0) (not (= ULTIMATE.start_main_~a~0 (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)))) (= ULTIMATE.start_main_~c~0 0))} __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; {8401#(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))) (<= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~c~0) (= 0 ULTIMATE.start___VERIFIER_assert_~cond) (= ULTIMATE.start_main_~c~0 0))} is VALID [2021-09-13 14:18:36,383 INFO L281 TraceCheckUtils]: 14: Hoare triple {8405#(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))) (<= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~c~0) (not (= ULTIMATE.start_main_~a~0 (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)))) (= ULTIMATE.start_main_~c~0 0))} assume !(0 == __VERIFIER_assert_~cond); {8405#(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))) (<= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~c~0) (not (= ULTIMATE.start_main_~a~0 (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)))) (= ULTIMATE.start_main_~c~0 0))} is VALID [2021-09-13 14:18:36,383 INFO L281 TraceCheckUtils]: 13: Hoare triple {8405#(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))) (<= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~c~0) (not (= ULTIMATE.start_main_~a~0 (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)))) (= ULTIMATE.start_main_~c~0 0))} assume !!(main_#t~post10 < 100);havoc main_#t~post10;__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; {8405#(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))) (<= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~c~0) (not (= ULTIMATE.start_main_~a~0 (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)))) (= ULTIMATE.start_main_~c~0 0))} is VALID [2021-09-13 14:18:36,383 INFO L281 TraceCheckUtils]: 12: Hoare triple {8405#(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))) (<= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~c~0) (not (= ULTIMATE.start_main_~a~0 (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)))) (= ULTIMATE.start_main_~c~0 0))} main_#t~post10 := ~counter~0;~counter~0 := 1 + main_#t~post10; {8405#(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))) (<= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~c~0) (not (= ULTIMATE.start_main_~a~0 (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)))) (= ULTIMATE.start_main_~c~0 0))} is VALID [2021-09-13 14:18:36,384 INFO L281 TraceCheckUtils]: 11: Hoare triple {8233#true} assume !!(0 != main_~b~0);main_~c~0 := main_~a~0;main_~k~0 := 0; {8405#(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))) (<= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~c~0) (not (= ULTIMATE.start_main_~a~0 (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)))) (= ULTIMATE.start_main_~c~0 0))} is VALID [2021-09-13 14:18:36,384 INFO L281 TraceCheckUtils]: 10: Hoare triple {8233#true} assume !!(main_#t~post9 < 100);havoc main_#t~post9; {8233#true} is VALID [2021-09-13 14:18:36,384 INFO L281 TraceCheckUtils]: 9: Hoare triple {8233#true} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {8233#true} is VALID [2021-09-13 14:18:36,384 INFO L281 TraceCheckUtils]: 8: Hoare triple {8233#true} assume !(0 == assume_abort_if_not_~cond); {8233#true} is VALID [2021-09-13 14:18:36,384 INFO L281 TraceCheckUtils]: 7: Hoare triple {8233#true} assume_abort_if_not_#in~cond := (if main_~yy~0 < 2147483647 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {8233#true} is VALID [2021-09-13 14:18:36,385 INFO L281 TraceCheckUtils]: 6: Hoare triple {8233#true} assume !(0 == assume_abort_if_not_~cond); {8233#true} is VALID [2021-09-13 14:18:36,385 INFO L281 TraceCheckUtils]: 5: Hoare triple {8233#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;main_~c~0 := 0;main_~k~0 := 0;main_~xy~0 := main_~x~0 * main_~y~0;main_~yy~0 := main_~y~0 * main_~y~0;assume_abort_if_not_#in~cond := (if main_~xy~0 < 2147483647 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {8233#true} is VALID [2021-09-13 14:18:36,385 INFO L281 TraceCheckUtils]: 4: Hoare triple {8233#true} assume !(0 == assume_abort_if_not_~cond); {8233#true} is VALID [2021-09-13 14:18:36,385 INFO L281 TraceCheckUtils]: 3: Hoare triple {8233#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; {8233#true} is VALID [2021-09-13 14:18:36,385 INFO L281 TraceCheckUtils]: 2: Hoare triple {8233#true} assume !(0 == assume_abort_if_not_~cond); {8233#true} is VALID [2021-09-13 14:18:36,385 INFO L281 TraceCheckUtils]: 1: Hoare triple {8233#true} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~post10, main_~temp~0, main_#t~post9, main_~x~0, main_~y~0, main_~a~0, main_~b~0, main_~p~0, main_~q~0, main_~r~0, main_~s~0, main_~c~0, main_~k~0, main_~xy~0, main_~yy~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;havoc main_~c~0;havoc main_~k~0;havoc main_~xy~0;havoc main_~yy~0;assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647;main_~x~0 := main_#t~nondet7;havoc main_#t~nondet7;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_~x~0 >= 1 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {8233#true} is VALID [2021-09-13 14:18:36,385 INFO L281 TraceCheckUtils]: 0: Hoare triple {8233#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);~counter~0 := 0; {8233#true} is VALID [2021-09-13 14:18:36,385 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:18:36,386 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:18:36,386 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977077963] [2021-09-13 14:18:36,386 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-09-13 14:18:36,386 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [416806622] [2021-09-13 14:18:36,386 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [416806622] provided 0 perfect and 2 imperfect interpolant sequences [2021-09-13 14:18:36,386 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-09-13 14:18:36,386 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 17 [2021-09-13 14:18:36,386 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973921260] [2021-09-13 14:18:36,387 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.823529411764706) internal successors, (65), 17 states have internal predecessors, (65), 0 states have call successors, (0), 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 34 [2021-09-13 14:18:36,387 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:18:36,387 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 3.823529411764706) internal successors, (65), 17 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:18:38,449 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 64 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2021-09-13 14:18:38,450 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-09-13 14:18:38,450 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:18:38,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-09-13 14:18:38,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2021-09-13 14:18:38,450 INFO L87 Difference]: Start difference. First operand 269 states and 332 transitions. Second operand has 17 states, 17 states have (on average 3.823529411764706) internal successors, (65), 17 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:18:48,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:18:48,908 INFO L93 Difference]: Finished difference Result 361 states and 440 transitions. [2021-09-13 14:18:48,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-09-13 14:18:48,909 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.823529411764706) internal successors, (65), 17 states have internal predecessors, (65), 0 states have call successors, (0), 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 34 [2021-09-13 14:18:48,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:18:48,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 3.823529411764706) internal successors, (65), 17 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:18:48,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 179 transitions. [2021-09-13 14:18:48,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 3.823529411764706) internal successors, (65), 17 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:18:48,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 179 transitions. [2021-09-13 14:18:48,912 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 36 states and 179 transitions. [2021-09-13 14:18:49,177 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 179 edges. 179 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:18:49,188 INFO L225 Difference]: With dead ends: 361 [2021-09-13 14:18:49,188 INFO L226 Difference]: Without dead ends: 359 [2021-09-13 14:18:49,190 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 648 ImplicationChecksByTransitivity, 5297.49ms TimeCoverageRelationStatistics Valid=567, Invalid=1689, Unknown=0, NotChecked=0, Total=2256 [2021-09-13 14:18:49,194 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 495 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 518 mSolverCounterSat, 142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2266.58ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 495 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 660 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.39ms SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 518 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2271.99ms IncrementalHoareTripleChecker+Time [2021-09-13 14:18:49,195 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [495 Valid, 0 Invalid, 660 Unknown, 0 Unchecked, 4.39ms Time], IncrementalHoareTripleChecker [142 Valid, 518 Invalid, 0 Unknown, 0 Unchecked, 2271.99ms Time] [2021-09-13 14:18:49,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2021-09-13 14:18:49,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 300. [2021-09-13 14:18:49,951 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:18:49,951 INFO L82 GeneralOperation]: Start isEquivalent. First operand 359 states. Second operand has 300 states, 295 states have (on average 1.2610169491525425) internal successors, (372), 299 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:18:49,951 INFO L74 IsIncluded]: Start isIncluded. First operand 359 states. Second operand has 300 states, 295 states have (on average 1.2610169491525425) internal successors, (372), 299 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:18:49,952 INFO L87 Difference]: Start difference. First operand 359 states. Second operand has 300 states, 295 states have (on average 1.2610169491525425) internal successors, (372), 299 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:18:49,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:18:49,960 INFO L93 Difference]: Finished difference Result 359 states and 434 transitions. [2021-09-13 14:18:49,960 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 434 transitions. [2021-09-13 14:18:49,960 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:18:49,961 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:18:49,961 INFO L74 IsIncluded]: Start isIncluded. First operand has 300 states, 295 states have (on average 1.2610169491525425) internal successors, (372), 299 states have internal predecessors, (372), 0 states have call successors, (0), 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 359 states. [2021-09-13 14:18:49,962 INFO L87 Difference]: Start difference. First operand has 300 states, 295 states have (on average 1.2610169491525425) internal successors, (372), 299 states have internal predecessors, (372), 0 states have call successors, (0), 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 359 states. [2021-09-13 14:18:49,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:18:49,969 INFO L93 Difference]: Finished difference Result 359 states and 434 transitions. [2021-09-13 14:18:49,969 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 434 transitions. [2021-09-13 14:18:49,970 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:18:49,970 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:18:49,970 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:18:49,970 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:18:49,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 295 states have (on average 1.2610169491525425) internal successors, (372), 299 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:18:49,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 372 transitions. [2021-09-13 14:18:49,978 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 372 transitions. Word has length 34 [2021-09-13 14:18:49,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:18:49,978 INFO L470 AbstractCegarLoop]: Abstraction has 300 states and 372 transitions. [2021-09-13 14:18:49,978 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.823529411764706) internal successors, (65), 17 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:18:49,978 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 372 transitions. [2021-09-13 14:18:49,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-09-13 14:18:49,979 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:18:49,979 INFO L513 BasicCegarLoop]: trace histogram [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] [2021-09-13 14:18:50,012 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:18:50,192 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:18:50,193 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-09-13 14:18:50,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:18:50,193 INFO L82 PathProgramCache]: Analyzing trace with hash 142945620, now seen corresponding path program 1 times [2021-09-13 14:18:50,193 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:18:50,193 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048785316] [2021-09-13 14:18:50,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:18:50,194 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:18:50,199 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-09-13 14:18:50,199 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1398318853] [2021-09-13 14:18:50,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:18:50,199 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:18:50,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:18:50,207 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:18:50,208 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:18:50,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:18:50,263 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 51 conjunts are in the unsatisfiable core [2021-09-13 14:18:50,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:18:50,283 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:18:52,299 INFO L281 TraceCheckUtils]: 0: Hoare triple {10156#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);~counter~0 := 0; {10156#true} is VALID [2021-09-13 14:18:52,299 INFO L281 TraceCheckUtils]: 1: Hoare triple {10156#true} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~post10, main_~temp~0, main_#t~post9, main_~x~0, main_~y~0, main_~a~0, main_~b~0, main_~p~0, main_~q~0, main_~r~0, main_~s~0, main_~c~0, main_~k~0, main_~xy~0, main_~yy~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;havoc main_~c~0;havoc main_~k~0;havoc main_~xy~0;havoc main_~yy~0;assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647;main_~x~0 := main_#t~nondet7;havoc main_#t~nondet7;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_~x~0 >= 1 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {10164#(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:18:52,300 INFO L281 TraceCheckUtils]: 2: Hoare triple {10164#(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); {10168#(<= 1 ULTIMATE.start_main_~x~0)} is VALID [2021-09-13 14:18:52,300 INFO L281 TraceCheckUtils]: 3: Hoare triple {10168#(<= 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; {10168#(<= 1 ULTIMATE.start_main_~x~0)} is VALID [2021-09-13 14:18:52,300 INFO L281 TraceCheckUtils]: 4: Hoare triple {10168#(<= 1 ULTIMATE.start_main_~x~0)} assume !(0 == assume_abort_if_not_~cond); {10168#(<= 1 ULTIMATE.start_main_~x~0)} is VALID [2021-09-13 14:18:52,301 INFO L281 TraceCheckUtils]: 5: Hoare triple {10168#(<= 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;main_~c~0 := 0;main_~k~0 := 0;main_~xy~0 := main_~x~0 * main_~y~0;main_~yy~0 := main_~y~0 * main_~y~0;assume_abort_if_not_#in~cond := (if main_~xy~0 < 2147483647 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {10178#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= (* ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~xy~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) (<= 1 ULTIMATE.start_main_~x~0) (<= (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~yy~0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:18:52,301 INFO L281 TraceCheckUtils]: 6: Hoare triple {10178#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= (* ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~xy~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) (<= 1 ULTIMATE.start_main_~x~0) (<= (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~yy~0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} assume !(0 == assume_abort_if_not_~cond); {10178#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= (* ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~xy~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) (<= 1 ULTIMATE.start_main_~x~0) (<= (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~yy~0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:18:52,302 INFO L281 TraceCheckUtils]: 7: Hoare triple {10178#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= (* ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~xy~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) (<= 1 ULTIMATE.start_main_~x~0) (<= (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~yy~0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} assume_abort_if_not_#in~cond := (if main_~yy~0 < 2147483647 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {10185#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= (* ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~xy~0) (= ULTIMATE.start_main_~p~0 1) (or (and (< ULTIMATE.start_main_~yy~0 2147483647) (= ULTIMATE.start_assume_abort_if_not_~cond 1)) (and (= ULTIMATE.start_assume_abort_if_not_~cond 0) (<= 2147483647 ULTIMATE.start_main_~yy~0))) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (<= 1 ULTIMATE.start_main_~x~0) (<= (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~yy~0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:18:52,303 INFO L281 TraceCheckUtils]: 8: Hoare triple {10185#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= (* ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~xy~0) (= ULTIMATE.start_main_~p~0 1) (or (and (< ULTIMATE.start_main_~yy~0 2147483647) (= ULTIMATE.start_assume_abort_if_not_~cond 1)) (and (= ULTIMATE.start_assume_abort_if_not_~cond 0) (<= 2147483647 ULTIMATE.start_main_~yy~0))) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (<= 1 ULTIMATE.start_main_~x~0) (<= (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~yy~0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} assume !(0 == assume_abort_if_not_~cond); {10189#(and (< ULTIMATE.start_main_~yy~0 2147483647) (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= (* ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~xy~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) (<= 1 ULTIMATE.start_main_~x~0) (<= (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~yy~0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:18:52,303 INFO L281 TraceCheckUtils]: 9: Hoare triple {10189#(and (< ULTIMATE.start_main_~yy~0 2147483647) (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= (* ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~xy~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) (<= 1 ULTIMATE.start_main_~x~0) (<= (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~yy~0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {10189#(and (< ULTIMATE.start_main_~yy~0 2147483647) (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= (* ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~xy~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) (<= 1 ULTIMATE.start_main_~x~0) (<= (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~yy~0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:18:52,304 INFO L281 TraceCheckUtils]: 10: Hoare triple {10189#(and (< ULTIMATE.start_main_~yy~0 2147483647) (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= (* ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~xy~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) (<= 1 ULTIMATE.start_main_~x~0) (<= (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~yy~0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} assume !!(main_#t~post9 < 100);havoc main_#t~post9; {10189#(and (< ULTIMATE.start_main_~yy~0 2147483647) (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= (* ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~xy~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) (<= 1 ULTIMATE.start_main_~x~0) (<= (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~yy~0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:18:52,304 INFO L281 TraceCheckUtils]: 11: Hoare triple {10189#(and (< ULTIMATE.start_main_~yy~0 2147483647) (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= (* ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~xy~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) (<= 1 ULTIMATE.start_main_~x~0) (<= (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~yy~0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} assume !!(0 != main_~b~0);main_~c~0 := main_~a~0;main_~k~0 := 0; {10199#(and (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~x~0) (< ULTIMATE.start_main_~yy~0 2147483647) (= ULTIMATE.start_main_~k~0 0) (= (* ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~xy~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) (<= 1 ULTIMATE.start_main_~x~0) (<= (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~yy~0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:18:52,305 INFO L281 TraceCheckUtils]: 12: Hoare triple {10199#(and (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~x~0) (< ULTIMATE.start_main_~yy~0 2147483647) (= ULTIMATE.start_main_~k~0 0) (= (* ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~xy~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) (<= 1 ULTIMATE.start_main_~x~0) (<= (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~yy~0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} main_#t~post10 := ~counter~0;~counter~0 := 1 + main_#t~post10; {10199#(and (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~x~0) (< ULTIMATE.start_main_~yy~0 2147483647) (= ULTIMATE.start_main_~k~0 0) (= (* ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~xy~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) (<= 1 ULTIMATE.start_main_~x~0) (<= (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~yy~0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:18:52,305 INFO L281 TraceCheckUtils]: 13: Hoare triple {10199#(and (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~x~0) (< ULTIMATE.start_main_~yy~0 2147483647) (= ULTIMATE.start_main_~k~0 0) (= (* ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~xy~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) (<= 1 ULTIMATE.start_main_~x~0) (<= (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~yy~0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} assume !!(main_#t~post10 < 100);havoc main_#t~post10;__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; {10199#(and (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~x~0) (< ULTIMATE.start_main_~yy~0 2147483647) (= ULTIMATE.start_main_~k~0 0) (= (* ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~xy~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) (<= 1 ULTIMATE.start_main_~x~0) (<= (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~yy~0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:18:52,306 INFO L281 TraceCheckUtils]: 14: Hoare triple {10199#(and (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~x~0) (< ULTIMATE.start_main_~yy~0 2147483647) (= ULTIMATE.start_main_~k~0 0) (= (* ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~xy~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) (<= 1 ULTIMATE.start_main_~x~0) (<= (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~yy~0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} assume !(0 == __VERIFIER_assert_~cond); {10199#(and (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~x~0) (< ULTIMATE.start_main_~yy~0 2147483647) (= ULTIMATE.start_main_~k~0 0) (= (* ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~xy~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) (<= 1 ULTIMATE.start_main_~x~0) (<= (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~yy~0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:18:52,306 INFO L281 TraceCheckUtils]: 15: Hoare triple {10199#(and (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~x~0) (< ULTIMATE.start_main_~yy~0 2147483647) (= ULTIMATE.start_main_~k~0 0) (= (* ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~xy~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) (<= 1 ULTIMATE.start_main_~x~0) (<= (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~yy~0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} __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; {10199#(and (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~x~0) (< ULTIMATE.start_main_~yy~0 2147483647) (= ULTIMATE.start_main_~k~0 0) (= (* ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~xy~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) (<= 1 ULTIMATE.start_main_~x~0) (<= (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~yy~0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:18:52,307 INFO L281 TraceCheckUtils]: 16: Hoare triple {10199#(and (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~x~0) (< ULTIMATE.start_main_~yy~0 2147483647) (= ULTIMATE.start_main_~k~0 0) (= (* ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~xy~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) (<= 1 ULTIMATE.start_main_~x~0) (<= (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~yy~0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} assume !(0 == __VERIFIER_assert_~cond); {10199#(and (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~x~0) (< ULTIMATE.start_main_~yy~0 2147483647) (= ULTIMATE.start_main_~k~0 0) (= (* ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~xy~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) (<= 1 ULTIMATE.start_main_~x~0) (<= (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~yy~0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:18:52,307 INFO L281 TraceCheckUtils]: 17: Hoare triple {10199#(and (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~x~0) (< ULTIMATE.start_main_~yy~0 2147483647) (= ULTIMATE.start_main_~k~0 0) (= (* ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~xy~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) (<= 1 ULTIMATE.start_main_~x~0) (<= (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~yy~0) (= 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; {10199#(and (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~x~0) (< ULTIMATE.start_main_~yy~0 2147483647) (= ULTIMATE.start_main_~k~0 0) (= (* ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~xy~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) (<= 1 ULTIMATE.start_main_~x~0) (<= (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~yy~0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:18:52,308 INFO L281 TraceCheckUtils]: 18: Hoare triple {10199#(and (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~x~0) (< ULTIMATE.start_main_~yy~0 2147483647) (= ULTIMATE.start_main_~k~0 0) (= (* ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~xy~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) (<= 1 ULTIMATE.start_main_~x~0) (<= (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~yy~0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} assume !(0 == __VERIFIER_assert_~cond); {10199#(and (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~x~0) (< ULTIMATE.start_main_~yy~0 2147483647) (= ULTIMATE.start_main_~k~0 0) (= (* ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~xy~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) (<= 1 ULTIMATE.start_main_~x~0) (<= (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~yy~0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:18:52,308 INFO L281 TraceCheckUtils]: 19: Hoare triple {10199#(and (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~x~0) (< ULTIMATE.start_main_~yy~0 2147483647) (= ULTIMATE.start_main_~k~0 0) (= (* ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~xy~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) (<= 1 ULTIMATE.start_main_~x~0) (<= (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~yy~0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} __VERIFIER_assert_#in~cond := (if 0 == main_~q~0 * main_~xy~0 + main_~s~0 * main_~yy~0 - main_~q~0 * main_~x~0 - main_~b~0 * main_~y~0 - main_~s~0 * main_~y~0 + main_~b~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {10199#(and (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~x~0) (< ULTIMATE.start_main_~yy~0 2147483647) (= ULTIMATE.start_main_~k~0 0) (= (* ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~xy~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) (<= 1 ULTIMATE.start_main_~x~0) (<= (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~yy~0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:18:52,309 INFO L281 TraceCheckUtils]: 20: Hoare triple {10199#(and (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~x~0) (< ULTIMATE.start_main_~yy~0 2147483647) (= ULTIMATE.start_main_~k~0 0) (= (* ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~xy~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) (<= 1 ULTIMATE.start_main_~x~0) (<= (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~yy~0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} assume !(0 == __VERIFIER_assert_~cond); {10199#(and (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~x~0) (< ULTIMATE.start_main_~yy~0 2147483647) (= ULTIMATE.start_main_~k~0 0) (= (* ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~xy~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) (<= 1 ULTIMATE.start_main_~x~0) (<= (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~yy~0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:18:52,309 INFO L281 TraceCheckUtils]: 21: Hoare triple {10199#(and (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~x~0) (< ULTIMATE.start_main_~yy~0 2147483647) (= ULTIMATE.start_main_~k~0 0) (= (* ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~xy~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) (<= 1 ULTIMATE.start_main_~x~0) (<= (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~yy~0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} assume !(main_~c~0 >= main_~b~0); {10230#(and (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~x~0) (< ULTIMATE.start_main_~yy~0 2147483647) (= ULTIMATE.start_main_~k~0 0) (= (* ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~xy~0) (= ULTIMATE.start_main_~p~0 1) (< ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (<= 1 ULTIMATE.start_main_~x~0) (<= (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~yy~0))} is VALID [2021-09-13 14:18:52,310 INFO L281 TraceCheckUtils]: 22: Hoare triple {10230#(and (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~x~0) (< ULTIMATE.start_main_~yy~0 2147483647) (= ULTIMATE.start_main_~k~0 0) (= (* ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~xy~0) (= ULTIMATE.start_main_~p~0 1) (< ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (<= 1 ULTIMATE.start_main_~x~0) (<= (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~yy~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; {10234#(and (< ULTIMATE.start_main_~yy~0 2147483647) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= (* ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~xy~0) (= ULTIMATE.start_main_~s~0 0) (< ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~q~0 1) (<= 1 ULTIMATE.start_main_~x~0) (<= (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~yy~0))} is VALID [2021-09-13 14:18:52,310 INFO L281 TraceCheckUtils]: 23: Hoare triple {10234#(and (< ULTIMATE.start_main_~yy~0 2147483647) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= (* ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~xy~0) (= ULTIMATE.start_main_~s~0 0) (< ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~q~0 1) (<= 1 ULTIMATE.start_main_~x~0) (<= (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~yy~0))} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {10234#(and (< ULTIMATE.start_main_~yy~0 2147483647) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= (* ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~xy~0) (= ULTIMATE.start_main_~s~0 0) (< ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~q~0 1) (<= 1 ULTIMATE.start_main_~x~0) (<= (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~yy~0))} is VALID [2021-09-13 14:18:52,311 INFO L281 TraceCheckUtils]: 24: Hoare triple {10234#(and (< ULTIMATE.start_main_~yy~0 2147483647) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= (* ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~xy~0) (= ULTIMATE.start_main_~s~0 0) (< ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~q~0 1) (<= 1 ULTIMATE.start_main_~x~0) (<= (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~yy~0))} assume !!(main_#t~post9 < 100);havoc main_#t~post9; {10234#(and (< ULTIMATE.start_main_~yy~0 2147483647) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= (* ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~xy~0) (= ULTIMATE.start_main_~s~0 0) (< ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~q~0 1) (<= 1 ULTIMATE.start_main_~x~0) (<= (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~yy~0))} is VALID [2021-09-13 14:18:52,311 INFO L281 TraceCheckUtils]: 25: Hoare triple {10234#(and (< ULTIMATE.start_main_~yy~0 2147483647) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= (* ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~xy~0) (= ULTIMATE.start_main_~s~0 0) (< ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~q~0 1) (<= 1 ULTIMATE.start_main_~x~0) (<= (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~yy~0))} assume !!(0 != main_~b~0);main_~c~0 := main_~a~0;main_~k~0 := 0; {10234#(and (< ULTIMATE.start_main_~yy~0 2147483647) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= (* ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~xy~0) (= ULTIMATE.start_main_~s~0 0) (< ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~q~0 1) (<= 1 ULTIMATE.start_main_~x~0) (<= (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~yy~0))} is VALID [2021-09-13 14:18:52,312 INFO L281 TraceCheckUtils]: 26: Hoare triple {10234#(and (< ULTIMATE.start_main_~yy~0 2147483647) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= (* ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~xy~0) (= ULTIMATE.start_main_~s~0 0) (< ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~q~0 1) (<= 1 ULTIMATE.start_main_~x~0) (<= (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~yy~0))} main_#t~post10 := ~counter~0;~counter~0 := 1 + main_#t~post10; {10234#(and (< ULTIMATE.start_main_~yy~0 2147483647) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= (* ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~xy~0) (= ULTIMATE.start_main_~s~0 0) (< ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~q~0 1) (<= 1 ULTIMATE.start_main_~x~0) (<= (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~yy~0))} is VALID [2021-09-13 14:18:52,312 INFO L281 TraceCheckUtils]: 27: Hoare triple {10234#(and (< ULTIMATE.start_main_~yy~0 2147483647) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= (* ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~xy~0) (= ULTIMATE.start_main_~s~0 0) (< ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~q~0 1) (<= 1 ULTIMATE.start_main_~x~0) (<= (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~yy~0))} assume !!(main_#t~post10 < 100);havoc main_#t~post10;__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; {10234#(and (< ULTIMATE.start_main_~yy~0 2147483647) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= (* ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~xy~0) (= ULTIMATE.start_main_~s~0 0) (< ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~q~0 1) (<= 1 ULTIMATE.start_main_~x~0) (<= (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~yy~0))} is VALID [2021-09-13 14:18:52,313 INFO L281 TraceCheckUtils]: 28: Hoare triple {10234#(and (< ULTIMATE.start_main_~yy~0 2147483647) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= (* ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~xy~0) (= ULTIMATE.start_main_~s~0 0) (< ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~q~0 1) (<= 1 ULTIMATE.start_main_~x~0) (<= (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~yy~0))} assume !(0 == __VERIFIER_assert_~cond); {10234#(and (< ULTIMATE.start_main_~yy~0 2147483647) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= (* ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~xy~0) (= ULTIMATE.start_main_~s~0 0) (< ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~q~0 1) (<= 1 ULTIMATE.start_main_~x~0) (<= (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~yy~0))} is VALID [2021-09-13 14:18:52,313 INFO L281 TraceCheckUtils]: 29: Hoare triple {10234#(and (< ULTIMATE.start_main_~yy~0 2147483647) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= (* ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~xy~0) (= ULTIMATE.start_main_~s~0 0) (< ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~q~0 1) (<= 1 ULTIMATE.start_main_~x~0) (<= (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~yy~0))} __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; {10234#(and (< ULTIMATE.start_main_~yy~0 2147483647) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= (* ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~xy~0) (= ULTIMATE.start_main_~s~0 0) (< ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~q~0 1) (<= 1 ULTIMATE.start_main_~x~0) (<= (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~yy~0))} is VALID [2021-09-13 14:18:52,314 INFO L281 TraceCheckUtils]: 30: Hoare triple {10234#(and (< ULTIMATE.start_main_~yy~0 2147483647) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= (* ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~xy~0) (= ULTIMATE.start_main_~s~0 0) (< ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~q~0 1) (<= 1 ULTIMATE.start_main_~x~0) (<= (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~yy~0))} assume !(0 == __VERIFIER_assert_~cond); {10234#(and (< ULTIMATE.start_main_~yy~0 2147483647) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= (* ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~xy~0) (= ULTIMATE.start_main_~s~0 0) (< ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~q~0 1) (<= 1 ULTIMATE.start_main_~x~0) (<= (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~yy~0))} is VALID [2021-09-13 14:18:52,314 INFO L281 TraceCheckUtils]: 31: Hoare triple {10234#(and (< ULTIMATE.start_main_~yy~0 2147483647) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= (* ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~xy~0) (= ULTIMATE.start_main_~s~0 0) (< ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~q~0 1) (<= 1 ULTIMATE.start_main_~x~0) (<= (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~yy~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; {10262#(and (< ULTIMATE.start_main_~yy~0 2147483647) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= (* ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~xy~0) (= ULTIMATE.start_main_~s~0 0) (< ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (= 1 ULTIMATE.start___VERIFIER_assert_~cond) (= ULTIMATE.start_main_~q~0 1) (<= 1 ULTIMATE.start_main_~x~0) (<= (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~yy~0))} is VALID [2021-09-13 14:18:52,315 INFO L281 TraceCheckUtils]: 32: Hoare triple {10262#(and (< ULTIMATE.start_main_~yy~0 2147483647) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= (* ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~xy~0) (= ULTIMATE.start_main_~s~0 0) (< ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (= 1 ULTIMATE.start___VERIFIER_assert_~cond) (= ULTIMATE.start_main_~q~0 1) (<= 1 ULTIMATE.start_main_~x~0) (<= (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~yy~0))} assume !(0 == __VERIFIER_assert_~cond); {10234#(and (< ULTIMATE.start_main_~yy~0 2147483647) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= (* ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~xy~0) (= ULTIMATE.start_main_~s~0 0) (< ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~q~0 1) (<= 1 ULTIMATE.start_main_~x~0) (<= (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~yy~0))} is VALID [2021-09-13 14:18:52,315 INFO L281 TraceCheckUtils]: 33: Hoare triple {10234#(and (< ULTIMATE.start_main_~yy~0 2147483647) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= (* ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~xy~0) (= ULTIMATE.start_main_~s~0 0) (< ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~q~0 1) (<= 1 ULTIMATE.start_main_~x~0) (<= (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~yy~0))} __VERIFIER_assert_#in~cond := (if 0 == main_~q~0 * main_~xy~0 + main_~s~0 * main_~yy~0 - main_~q~0 * main_~x~0 - main_~b~0 * main_~y~0 - main_~s~0 * main_~y~0 + main_~b~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {10269#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} is VALID [2021-09-13 14:18:52,315 INFO L281 TraceCheckUtils]: 34: Hoare triple {10269#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} assume 0 == __VERIFIER_assert_~cond; {10157#false} is VALID [2021-09-13 14:18:52,316 INFO L281 TraceCheckUtils]: 35: Hoare triple {10157#false} assume !false; {10157#false} is VALID [2021-09-13 14:18:52,316 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:18:52,316 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 14:18:54,124 INFO L281 TraceCheckUtils]: 35: Hoare triple {10157#false} assume !false; {10157#false} is VALID [2021-09-13 14:18:54,125 INFO L281 TraceCheckUtils]: 34: Hoare triple {10269#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} assume 0 == __VERIFIER_assert_~cond; {10157#false} is VALID [2021-09-13 14:18:54,125 INFO L281 TraceCheckUtils]: 33: Hoare triple {10282#(= (+ ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~yy~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~xy~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_~y~0)))} __VERIFIER_assert_#in~cond := (if 0 == main_~q~0 * main_~xy~0 + main_~s~0 * main_~yy~0 - main_~q~0 * main_~x~0 - main_~b~0 * main_~y~0 - main_~s~0 * main_~y~0 + main_~b~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {10269#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} is VALID [2021-09-13 14:18:54,126 INFO L281 TraceCheckUtils]: 32: Hoare triple {10286#(or (= (+ ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~yy~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~xy~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_~y~0))) (= 0 ULTIMATE.start___VERIFIER_assert_~cond))} assume !(0 == __VERIFIER_assert_~cond); {10282#(= (+ ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~yy~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~xy~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_~y~0)))} is VALID [2021-09-13 14:18:54,127 INFO L281 TraceCheckUtils]: 31: Hoare triple {10290#(or (not (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0)) (= (+ ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~yy~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~xy~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_~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; {10286#(or (= (+ ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~yy~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~xy~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_~y~0))) (= 0 ULTIMATE.start___VERIFIER_assert_~cond))} is VALID [2021-09-13 14:18:54,127 INFO L281 TraceCheckUtils]: 30: Hoare triple {10290#(or (not (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0)) (= (+ ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~yy~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~xy~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_~y~0))))} assume !(0 == __VERIFIER_assert_~cond); {10290#(or (not (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0)) (= (+ ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~yy~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~xy~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_~y~0))))} is VALID [2021-09-13 14:18:54,128 INFO L281 TraceCheckUtils]: 29: Hoare triple {10290#(or (not (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0)) (= (+ ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~yy~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~xy~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_~y~0))))} __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; {10290#(or (not (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0)) (= (+ ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~yy~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~xy~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_~y~0))))} is VALID [2021-09-13 14:18:54,128 INFO L281 TraceCheckUtils]: 28: Hoare triple {10290#(or (not (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0)) (= (+ ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~yy~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~xy~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_~y~0))))} assume !(0 == __VERIFIER_assert_~cond); {10290#(or (not (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0)) (= (+ ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~yy~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~xy~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_~y~0))))} is VALID [2021-09-13 14:18:54,129 INFO L281 TraceCheckUtils]: 27: Hoare triple {10290#(or (not (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0)) (= (+ ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~yy~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~xy~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_~y~0))))} assume !!(main_#t~post10 < 100);havoc main_#t~post10;__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; {10290#(or (not (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0)) (= (+ ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~yy~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~xy~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_~y~0))))} is VALID [2021-09-13 14:18:54,129 INFO L281 TraceCheckUtils]: 26: Hoare triple {10290#(or (not (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0)) (= (+ ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~yy~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~xy~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_~y~0))))} main_#t~post10 := ~counter~0;~counter~0 := 1 + main_#t~post10; {10290#(or (not (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0)) (= (+ ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~yy~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~xy~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_~y~0))))} is VALID [2021-09-13 14:18:54,130 INFO L281 TraceCheckUtils]: 25: Hoare triple {10309#(or (not (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0)) (= (+ ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~yy~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~xy~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_~y~0))) (= ULTIMATE.start_main_~b~0 0))} assume !!(0 != main_~b~0);main_~c~0 := main_~a~0;main_~k~0 := 0; {10290#(or (not (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0)) (= (+ ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~yy~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~xy~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_~y~0))))} is VALID [2021-09-13 14:18:54,130 INFO L281 TraceCheckUtils]: 24: Hoare triple {10309#(or (not (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0)) (= (+ ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~yy~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~xy~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_~y~0))) (= ULTIMATE.start_main_~b~0 0))} assume !!(main_#t~post9 < 100);havoc main_#t~post9; {10309#(or (not (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0)) (= (+ ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~yy~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~xy~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_~y~0))) (= ULTIMATE.start_main_~b~0 0))} is VALID [2021-09-13 14:18:54,131 INFO L281 TraceCheckUtils]: 23: Hoare triple {10309#(or (not (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0)) (= (+ ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~yy~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~xy~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_~y~0))) (= ULTIMATE.start_main_~b~0 0))} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {10309#(or (not (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0)) (= (+ ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~yy~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~xy~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_~y~0))) (= ULTIMATE.start_main_~b~0 0))} is VALID [2021-09-13 14:18:56,133 INFO L281 TraceCheckUtils]: 22: Hoare triple {10319#(or (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~yy~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~xy~0) (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (+ (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~xy~0) (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~yy~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~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)) (+ (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))) (not (= (+ ULTIMATE.start_main_~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; {10309#(or (not (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0)) (= (+ ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~yy~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~xy~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_~y~0))) (= ULTIMATE.start_main_~b~0 0))} is UNKNOWN [2021-09-13 14:18:56,134 INFO L281 TraceCheckUtils]: 21: Hoare triple {10323#(or (<= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~c~0) (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~yy~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~xy~0) (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (+ (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~xy~0) (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~yy~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~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)) (+ (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))) (not (= (+ ULTIMATE.start_main_~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); {10319#(or (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~yy~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~xy~0) (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (+ (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~xy~0) (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~yy~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~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)) (+ (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))) (not (= (+ ULTIMATE.start_main_~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:18:56,134 INFO L281 TraceCheckUtils]: 20: Hoare triple {10323#(or (<= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~c~0) (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~yy~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~xy~0) (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (+ (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~xy~0) (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~yy~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~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)) (+ (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))) (not (= (+ ULTIMATE.start_main_~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 !(0 == __VERIFIER_assert_~cond); {10323#(or (<= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~c~0) (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~yy~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~xy~0) (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (+ (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~xy~0) (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~yy~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~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)) (+ (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))) (not (= (+ ULTIMATE.start_main_~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:18:56,135 INFO L281 TraceCheckUtils]: 19: Hoare triple {10323#(or (<= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~c~0) (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~yy~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~xy~0) (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (+ (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~xy~0) (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~yy~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~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)) (+ (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))) (not (= (+ ULTIMATE.start_main_~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)))))} __VERIFIER_assert_#in~cond := (if 0 == main_~q~0 * main_~xy~0 + main_~s~0 * main_~yy~0 - main_~q~0 * main_~x~0 - main_~b~0 * main_~y~0 - main_~s~0 * main_~y~0 + main_~b~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {10323#(or (<= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~c~0) (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~yy~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~xy~0) (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (+ (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~xy~0) (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~yy~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~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)) (+ (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))) (not (= (+ ULTIMATE.start_main_~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:18:56,135 INFO L281 TraceCheckUtils]: 18: Hoare triple {10323#(or (<= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~c~0) (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~yy~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~xy~0) (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (+ (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~xy~0) (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~yy~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~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)) (+ (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))) (not (= (+ ULTIMATE.start_main_~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 !(0 == __VERIFIER_assert_~cond); {10323#(or (<= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~c~0) (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~yy~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~xy~0) (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (+ (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~xy~0) (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~yy~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~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)) (+ (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))) (not (= (+ ULTIMATE.start_main_~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:18:56,135 INFO L281 TraceCheckUtils]: 17: Hoare triple {10323#(or (<= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~c~0) (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~yy~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~xy~0) (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (+ (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~xy~0) (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~yy~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~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)) (+ (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))) (not (= (+ ULTIMATE.start_main_~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)))))} __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; {10323#(or (<= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~c~0) (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~yy~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~xy~0) (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (+ (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~xy~0) (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~yy~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~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)) (+ (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))) (not (= (+ ULTIMATE.start_main_~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:18:56,136 INFO L281 TraceCheckUtils]: 16: Hoare triple {10323#(or (<= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~c~0) (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~yy~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~xy~0) (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (+ (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~xy~0) (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~yy~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~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)) (+ (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))) (not (= (+ ULTIMATE.start_main_~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 !(0 == __VERIFIER_assert_~cond); {10323#(or (<= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~c~0) (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~yy~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~xy~0) (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (+ (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~xy~0) (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~yy~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~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)) (+ (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))) (not (= (+ ULTIMATE.start_main_~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:18:56,136 INFO L281 TraceCheckUtils]: 15: Hoare triple {10323#(or (<= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~c~0) (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~yy~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~xy~0) (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (+ (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~xy~0) (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~yy~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~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)) (+ (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))) (not (= (+ ULTIMATE.start_main_~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)))))} __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; {10323#(or (<= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~c~0) (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~yy~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~xy~0) (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (+ (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~xy~0) (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~yy~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~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)) (+ (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))) (not (= (+ ULTIMATE.start_main_~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:18:56,136 INFO L281 TraceCheckUtils]: 14: Hoare triple {10323#(or (<= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~c~0) (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~yy~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~xy~0) (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (+ (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~xy~0) (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~yy~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~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)) (+ (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))) (not (= (+ ULTIMATE.start_main_~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 !(0 == __VERIFIER_assert_~cond); {10323#(or (<= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~c~0) (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~yy~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~xy~0) (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (+ (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~xy~0) (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~yy~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~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)) (+ (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))) (not (= (+ ULTIMATE.start_main_~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:18:56,137 INFO L281 TraceCheckUtils]: 13: Hoare triple {10323#(or (<= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~c~0) (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~yy~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~xy~0) (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (+ (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~xy~0) (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~yy~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~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)) (+ (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))) (not (= (+ ULTIMATE.start_main_~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_#t~post10 < 100);havoc main_#t~post10;__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; {10323#(or (<= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~c~0) (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~yy~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~xy~0) (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (+ (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~xy~0) (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~yy~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~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)) (+ (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))) (not (= (+ ULTIMATE.start_main_~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:18:56,137 INFO L281 TraceCheckUtils]: 12: Hoare triple {10323#(or (<= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~c~0) (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~yy~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~xy~0) (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (+ (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~xy~0) (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~yy~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~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)) (+ (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))) (not (= (+ ULTIMATE.start_main_~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_#t~post10 := ~counter~0;~counter~0 := 1 + main_#t~post10; {10323#(or (<= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~c~0) (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~yy~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~xy~0) (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (+ (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~xy~0) (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~yy~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~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)) (+ (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))) (not (= (+ ULTIMATE.start_main_~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:18:56,138 INFO L281 TraceCheckUtils]: 11: Hoare triple {10354#(or (<= ULTIMATE.start_main_~b~0 (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0))) (= (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)) 0) (= (+ (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (+ (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~xy~0) (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~yy~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);main_~c~0 := main_~a~0;main_~k~0 := 0; {10323#(or (<= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~c~0) (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~yy~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~xy~0) (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (+ (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~xy~0) (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~yy~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~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)) (+ (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))) (not (= (+ ULTIMATE.start_main_~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:18:56,138 INFO L281 TraceCheckUtils]: 10: Hoare triple {10354#(or (<= ULTIMATE.start_main_~b~0 (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0))) (= (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)) 0) (= (+ (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (+ (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~xy~0) (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~yy~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_#t~post9 < 100);havoc main_#t~post9; {10354#(or (<= ULTIMATE.start_main_~b~0 (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0))) (= (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)) 0) (= (+ (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (+ (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~xy~0) (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~yy~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:18:56,139 INFO L281 TraceCheckUtils]: 9: Hoare triple {10354#(or (<= ULTIMATE.start_main_~b~0 (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0))) (= (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)) 0) (= (+ (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (+ (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~xy~0) (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~yy~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)))))} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {10354#(or (<= ULTIMATE.start_main_~b~0 (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0))) (= (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)) 0) (= (+ (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (+ (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~xy~0) (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~yy~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:18:56,139 INFO L281 TraceCheckUtils]: 8: Hoare triple {10364#(or (<= ULTIMATE.start_main_~b~0 (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0))) (= ULTIMATE.start_assume_abort_if_not_~cond 0) (= (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)) 0) (= (+ (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (+ (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~xy~0) (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~yy~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 == assume_abort_if_not_~cond); {10354#(or (<= ULTIMATE.start_main_~b~0 (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0))) (= (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)) 0) (= (+ (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (+ (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~xy~0) (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~yy~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:18:56,140 INFO L281 TraceCheckUtils]: 7: Hoare triple {10368#(or (<= 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))) (<= 2147483647 ULTIMATE.start_main_~yy~0) (= (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)) 0) (= (+ (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (+ (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~xy~0) (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~yy~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_abort_if_not_#in~cond := (if main_~yy~0 < 2147483647 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {10364#(or (<= ULTIMATE.start_main_~b~0 (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0))) (= ULTIMATE.start_assume_abort_if_not_~cond 0) (= (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)) 0) (= (+ (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (+ (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~xy~0) (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~yy~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:18:56,140 INFO L281 TraceCheckUtils]: 6: Hoare triple {10368#(or (<= 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))) (<= 2147483647 ULTIMATE.start_main_~yy~0) (= (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)) 0) (= (+ (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (+ (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~xy~0) (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~yy~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 == assume_abort_if_not_~cond); {10368#(or (<= 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))) (<= 2147483647 ULTIMATE.start_main_~yy~0) (= (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)) 0) (= (+ (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (+ (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~xy~0) (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~yy~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:18:56,141 INFO L281 TraceCheckUtils]: 5: Hoare triple {10156#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;main_~c~0 := 0;main_~k~0 := 0;main_~xy~0 := main_~x~0 * main_~y~0;main_~yy~0 := main_~y~0 * main_~y~0;assume_abort_if_not_#in~cond := (if main_~xy~0 < 2147483647 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {10368#(or (<= 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))) (<= 2147483647 ULTIMATE.start_main_~yy~0) (= (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)) 0) (= (+ (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (+ (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~xy~0) (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~yy~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:18:56,141 INFO L281 TraceCheckUtils]: 4: Hoare triple {10156#true} assume !(0 == assume_abort_if_not_~cond); {10156#true} is VALID [2021-09-13 14:18:56,141 INFO L281 TraceCheckUtils]: 3: Hoare triple {10156#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; {10156#true} is VALID [2021-09-13 14:18:56,141 INFO L281 TraceCheckUtils]: 2: Hoare triple {10156#true} assume !(0 == assume_abort_if_not_~cond); {10156#true} is VALID [2021-09-13 14:18:56,141 INFO L281 TraceCheckUtils]: 1: Hoare triple {10156#true} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~post10, main_~temp~0, main_#t~post9, main_~x~0, main_~y~0, main_~a~0, main_~b~0, main_~p~0, main_~q~0, main_~r~0, main_~s~0, main_~c~0, main_~k~0, main_~xy~0, main_~yy~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;havoc main_~c~0;havoc main_~k~0;havoc main_~xy~0;havoc main_~yy~0;assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647;main_~x~0 := main_#t~nondet7;havoc main_#t~nondet7;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_~x~0 >= 1 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {10156#true} is VALID [2021-09-13 14:18:56,141 INFO L281 TraceCheckUtils]: 0: Hoare triple {10156#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);~counter~0 := 0; {10156#true} is VALID [2021-09-13 14:18:56,142 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:18:56,142 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:18:56,142 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048785316] [2021-09-13 14:18:56,142 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-09-13 14:18:56,142 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1398318853] [2021-09-13 14:18:56,142 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1398318853] provided 0 perfect and 2 imperfect interpolant sequences [2021-09-13 14:18:56,143 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-09-13 14:18:56,143 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2021-09-13 14:18:56,143 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442420290] [2021-09-13 14:18:56,143 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.2857142857142856) internal successors, (69), 21 states have internal predecessors, (69), 0 states have call successors, (0), 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 36 [2021-09-13 14:18:56,144 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:18:56,144 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 21 states, 21 states have (on average 3.2857142857142856) internal successors, (69), 21 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:18:58,219 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 68 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2021-09-13 14:18:58,219 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-09-13 14:18:58,219 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:18:58,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-09-13 14:18:58,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=336, Unknown=0, NotChecked=0, Total=420 [2021-09-13 14:18:58,219 INFO L87 Difference]: Start difference. First operand 300 states and 372 transitions. Second operand has 21 states, 21 states have (on average 3.2857142857142856) internal successors, (69), 21 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:20:07,603 WARN L210 SmtUtils]: Spent 9.67s on a formula simplification. DAG size of input: 69 DAG size of output: 64 [2021-09-13 14:20:37,644 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2021-09-13 14:20:57,183 WARN L210 SmtUtils]: Spent 5.83s on a formula simplification. DAG size of input: 61 DAG size of output: 56 [2021-09-13 14:21:16,616 WARN L210 SmtUtils]: Spent 6.16s on a formula simplification. DAG size of input: 61 DAG size of output: 56 [2021-09-13 14:21:20,520 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2021-09-13 14:21:27,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:21:27,303 INFO L93 Difference]: Finished difference Result 537 states and 669 transitions. [2021-09-13 14:21:27,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2021-09-13 14:21:27,304 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.2857142857142856) internal successors, (69), 21 states have internal predecessors, (69), 0 states have call successors, (0), 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 36 [2021-09-13 14:21:27,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:21:27,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 3.2857142857142856) internal successors, (69), 21 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:21:27,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 246 transitions. [2021-09-13 14:21:27,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 3.2857142857142856) internal successors, (69), 21 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:21:27,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 246 transitions. [2021-09-13 14:21:27,308 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 47 states and 246 transitions. [2021-09-13 14:21:33,792 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 246 edges. 243 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2021-09-13 14:21:33,808 INFO L225 Difference]: With dead ends: 537 [2021-09-13 14:21:33,808 INFO L226 Difference]: Without dead ends: 535 [2021-09-13 14:21:33,811 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1237 ImplicationChecksByTransitivity, 92841.90ms TimeCoverageRelationStatistics Valid=1065, Invalid=2967, Unknown=0, NotChecked=0, Total=4032 [2021-09-13 14:21:33,811 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 847 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 753 mSolverCounterSat, 261 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24770.51ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 847 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1016 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 8.45ms SdHoareTripleChecker+Time, 261 IncrementalHoareTripleChecker+Valid, 753 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 24788.16ms IncrementalHoareTripleChecker+Time [2021-09-13 14:21:33,811 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [847 Valid, 0 Invalid, 1016 Unknown, 0 Unchecked, 8.45ms Time], IncrementalHoareTripleChecker [261 Valid, 753 Invalid, 2 Unknown, 0 Unchecked, 24788.16ms Time] [2021-09-13 14:21:33,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2021-09-13 14:21:35,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 365. [2021-09-13 14:21:35,350 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:21:35,351 INFO L82 GeneralOperation]: Start isEquivalent. First operand 535 states. Second operand has 365 states, 360 states have (on average 1.2555555555555555) internal successors, (452), 364 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:21:35,351 INFO L74 IsIncluded]: Start isIncluded. First operand 535 states. Second operand has 365 states, 360 states have (on average 1.2555555555555555) internal successors, (452), 364 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:21:35,351 INFO L87 Difference]: Start difference. First operand 535 states. Second operand has 365 states, 360 states have (on average 1.2555555555555555) internal successors, (452), 364 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:21:35,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:21:35,365 INFO L93 Difference]: Finished difference Result 535 states and 656 transitions. [2021-09-13 14:21:35,365 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 656 transitions. [2021-09-13 14:21:35,366 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:21:35,366 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:21:35,367 INFO L74 IsIncluded]: Start isIncluded. First operand has 365 states, 360 states have (on average 1.2555555555555555) internal successors, (452), 364 states have internal predecessors, (452), 0 states have call successors, (0), 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 535 states. [2021-09-13 14:21:35,367 INFO L87 Difference]: Start difference. First operand has 365 states, 360 states have (on average 1.2555555555555555) internal successors, (452), 364 states have internal predecessors, (452), 0 states have call successors, (0), 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 535 states. [2021-09-13 14:21:35,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:21:35,381 INFO L93 Difference]: Finished difference Result 535 states and 656 transitions. [2021-09-13 14:21:35,382 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 656 transitions. [2021-09-13 14:21:35,382 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:21:35,383 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:21:35,383 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:21:35,383 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:21:35,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 360 states have (on average 1.2555555555555555) internal successors, (452), 364 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:21:35,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 452 transitions. [2021-09-13 14:21:35,392 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 452 transitions. Word has length 36 [2021-09-13 14:21:35,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:21:35,392 INFO L470 AbstractCegarLoop]: Abstraction has 365 states and 452 transitions. [2021-09-13 14:21:35,392 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.2857142857142856) internal successors, (69), 21 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:21:35,393 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 452 transitions. [2021-09-13 14:21:35,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-09-13 14:21:35,393 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:21:35,393 INFO L513 BasicCegarLoop]: trace histogram [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] [2021-09-13 14:21:35,438 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:21:35,598 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:21:35,599 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-09-13 14:21:35,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:21:35,599 INFO L82 PathProgramCache]: Analyzing trace with hash -947205511, now seen corresponding path program 1 times [2021-09-13 14:21:35,599 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:21:35,599 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097656836] [2021-09-13 14:21:35,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:21:35,600 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:21:35,605 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-09-13 14:21:35,605 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [599762131] [2021-09-13 14:21:35,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:21:35,606 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:21:35,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:21:35,629 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:21:35,632 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:21:35,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:21:35,679 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 47 conjunts are in the unsatisfiable core [2021-09-13 14:21:35,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:21:35,690 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:21:37,050 INFO L281 TraceCheckUtils]: 0: Hoare triple {12794#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);~counter~0 := 0; {12794#true} is VALID [2021-09-13 14:21:37,050 INFO L281 TraceCheckUtils]: 1: Hoare triple {12794#true} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~post10, main_~temp~0, main_#t~post9, main_~x~0, main_~y~0, main_~a~0, main_~b~0, main_~p~0, main_~q~0, main_~r~0, main_~s~0, main_~c~0, main_~k~0, main_~xy~0, main_~yy~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;havoc main_~c~0;havoc main_~k~0;havoc main_~xy~0;havoc main_~yy~0;assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647;main_~x~0 := main_#t~nondet7;havoc main_#t~nondet7;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_~x~0 >= 1 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {12794#true} is VALID [2021-09-13 14:21:37,051 INFO L281 TraceCheckUtils]: 2: Hoare triple {12794#true} assume !(0 == assume_abort_if_not_~cond); {12794#true} is VALID [2021-09-13 14:21:37,051 INFO L281 TraceCheckUtils]: 3: Hoare triple {12794#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; {12794#true} is VALID [2021-09-13 14:21:37,051 INFO L281 TraceCheckUtils]: 4: Hoare triple {12794#true} assume !(0 == assume_abort_if_not_~cond); {12794#true} is VALID [2021-09-13 14:21:37,051 INFO L281 TraceCheckUtils]: 5: Hoare triple {12794#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;main_~c~0 := 0;main_~k~0 := 0;main_~xy~0 := main_~x~0 * main_~y~0;main_~yy~0 := main_~y~0 * main_~y~0;assume_abort_if_not_#in~cond := (if main_~xy~0 < 2147483647 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {12814#(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:21:37,052 INFO L281 TraceCheckUtils]: 6: Hoare triple {12814#(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 == assume_abort_if_not_~cond); {12814#(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:21:37,052 INFO L281 TraceCheckUtils]: 7: Hoare triple {12814#(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_abort_if_not_#in~cond := (if main_~yy~0 < 2147483647 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {12814#(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:21:37,053 INFO L281 TraceCheckUtils]: 8: Hoare triple {12814#(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 == assume_abort_if_not_~cond); {12814#(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:21:37,053 INFO L281 TraceCheckUtils]: 9: Hoare triple {12814#(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))} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {12814#(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:21:37,053 INFO L281 TraceCheckUtils]: 10: Hoare triple {12814#(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 !!(main_#t~post9 < 100);havoc main_#t~post9; {12814#(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:21:37,054 INFO L281 TraceCheckUtils]: 11: Hoare triple {12814#(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);main_~c~0 := main_~a~0;main_~k~0 := 0; {12833#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:21:37,054 INFO L281 TraceCheckUtils]: 12: Hoare triple {12833#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} main_#t~post10 := ~counter~0;~counter~0 := 1 + main_#t~post10; {12833#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:21:37,055 INFO L281 TraceCheckUtils]: 13: Hoare triple {12833#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} assume !!(main_#t~post10 < 100);havoc main_#t~post10;__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; {12833#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:21:37,055 INFO L281 TraceCheckUtils]: 14: Hoare triple {12833#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} assume !(0 == __VERIFIER_assert_~cond); {12833#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:21:37,056 INFO L281 TraceCheckUtils]: 15: Hoare triple {12833#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} __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; {12833#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:21:37,056 INFO L281 TraceCheckUtils]: 16: Hoare triple {12833#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} assume !(0 == __VERIFIER_assert_~cond); {12833#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:21:37,057 INFO L281 TraceCheckUtils]: 17: Hoare triple {12833#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} __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; {12833#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:21:37,057 INFO L281 TraceCheckUtils]: 18: Hoare triple {12833#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} assume !(0 == __VERIFIER_assert_~cond); {12833#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:21:37,058 INFO L281 TraceCheckUtils]: 19: Hoare triple {12833#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} __VERIFIER_assert_#in~cond := (if 0 == main_~q~0 * main_~xy~0 + main_~s~0 * main_~yy~0 - main_~q~0 * main_~x~0 - main_~b~0 * main_~y~0 - main_~s~0 * main_~y~0 + main_~b~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {12833#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:21:37,058 INFO L281 TraceCheckUtils]: 20: Hoare triple {12833#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} assume !(0 == __VERIFIER_assert_~cond); {12833#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:21:37,058 INFO L281 TraceCheckUtils]: 21: Hoare triple {12833#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} assume !!(main_~c~0 >= main_~b~0);main_~c~0 := main_~c~0 - main_~b~0;main_~k~0 := 1 + main_~k~0; {12864#(and (= ULTIMATE.start_main_~a~0 (+ ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~b~0)) (= 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_~k~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:21:37,059 INFO L281 TraceCheckUtils]: 22: Hoare triple {12864#(and (= ULTIMATE.start_main_~a~0 (+ ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~b~0)) (= 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_~k~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} main_#t~post10 := ~counter~0;~counter~0 := 1 + main_#t~post10; {12864#(and (= ULTIMATE.start_main_~a~0 (+ ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~b~0)) (= 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_~k~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:21:37,059 INFO L281 TraceCheckUtils]: 23: Hoare triple {12864#(and (= ULTIMATE.start_main_~a~0 (+ ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~b~0)) (= 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_~k~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} assume !!(main_#t~post10 < 100);havoc main_#t~post10;__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; {12864#(and (= ULTIMATE.start_main_~a~0 (+ ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~b~0)) (= 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_~k~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:21:37,060 INFO L281 TraceCheckUtils]: 24: Hoare triple {12864#(and (= ULTIMATE.start_main_~a~0 (+ ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~b~0)) (= 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_~k~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} assume !(0 == __VERIFIER_assert_~cond); {12864#(and (= ULTIMATE.start_main_~a~0 (+ ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~b~0)) (= 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_~k~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:21:37,061 INFO L281 TraceCheckUtils]: 25: Hoare triple {12864#(and (= ULTIMATE.start_main_~a~0 (+ ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~b~0)) (= 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_~k~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} __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; {12877#(and (= ULTIMATE.start_main_~x~0 (+ ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~b~0)) (= ULTIMATE.start_main_~p~0 1) (= 1 ULTIMATE.start___VERIFIER_assert_~cond) (= 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:21:37,072 INFO L281 TraceCheckUtils]: 26: Hoare triple {12877#(and (= ULTIMATE.start_main_~x~0 (+ ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~b~0)) (= ULTIMATE.start_main_~p~0 1) (= 1 ULTIMATE.start___VERIFIER_assert_~cond) (= 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 !(0 == __VERIFIER_assert_~cond); {12881#(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:21:37,072 INFO L281 TraceCheckUtils]: 27: Hoare triple {12881#(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))} __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; {12885#(and (= ULTIMATE.start_main_~x~0 (+ ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~y~0)) (= ULTIMATE.start_main_~p~0 1) (= 1 ULTIMATE.start___VERIFIER_assert_~cond) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~k~0 1))} is VALID [2021-09-13 14:21:37,073 INFO L281 TraceCheckUtils]: 28: Hoare triple {12885#(and (= ULTIMATE.start_main_~x~0 (+ ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~y~0)) (= ULTIMATE.start_main_~p~0 1) (= 1 ULTIMATE.start___VERIFIER_assert_~cond) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~k~0 1))} assume !(0 == __VERIFIER_assert_~cond); {12889#(and (= ULTIMATE.start_main_~x~0 (+ ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~y~0)) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~k~0 1))} is VALID [2021-09-13 14:21:37,074 INFO L281 TraceCheckUtils]: 29: Hoare triple {12889#(and (= ULTIMATE.start_main_~x~0 (+ ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~y~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))} __VERIFIER_assert_#in~cond := (if 0 == main_~q~0 * main_~xy~0 + main_~s~0 * main_~yy~0 - main_~q~0 * main_~x~0 - main_~b~0 * main_~y~0 - main_~s~0 * main_~y~0 + main_~b~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {12889#(and (= ULTIMATE.start_main_~x~0 (+ ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~y~0)) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~k~0 1))} is VALID [2021-09-13 14:21:37,074 INFO L281 TraceCheckUtils]: 30: Hoare triple {12889#(and (= ULTIMATE.start_main_~x~0 (+ ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~y~0)) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~k~0 1))} assume !(0 == __VERIFIER_assert_~cond); {12889#(and (= ULTIMATE.start_main_~x~0 (+ ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~y~0)) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~k~0 1))} is VALID [2021-09-13 14:21:37,074 INFO L281 TraceCheckUtils]: 31: Hoare triple {12889#(and (= ULTIMATE.start_main_~x~0 (+ ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~y~0)) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~k~0 1))} assume !(main_~c~0 >= main_~b~0); {12889#(and (= ULTIMATE.start_main_~x~0 (+ ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~y~0)) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~k~0 1))} is VALID [2021-09-13 14:21:37,075 INFO L281 TraceCheckUtils]: 32: Hoare triple {12889#(and (= ULTIMATE.start_main_~x~0 (+ ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~y~0)) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~k~0 1))} main_~a~0 := main_~b~0;main_~b~0 := main_~c~0;havoc main_~temp~0;main_~temp~0 := main_~p~0;main_~p~0 := main_~q~0;main_~q~0 := main_~temp~0 - main_~q~0 * main_~k~0;main_~temp~0 := main_~r~0;main_~r~0 := main_~s~0;main_~s~0 := main_~temp~0 - main_~s~0 * main_~k~0; {12902#(and (= (+ ULTIMATE.start_main_~s~0 1) 0) (= 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:21:37,075 INFO L281 TraceCheckUtils]: 33: Hoare triple {12902#(and (= (+ ULTIMATE.start_main_~s~0 1) 0) (= ULTIMATE.start_main_~q~0 1) (= ULTIMATE.start_main_~x~0 (+ ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0)))} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {12902#(and (= (+ ULTIMATE.start_main_~s~0 1) 0) (= 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:21:37,076 INFO L281 TraceCheckUtils]: 34: Hoare triple {12902#(and (= (+ ULTIMATE.start_main_~s~0 1) 0) (= ULTIMATE.start_main_~q~0 1) (= ULTIMATE.start_main_~x~0 (+ ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0)))} assume !!(main_#t~post9 < 100);havoc main_#t~post9; {12902#(and (= (+ ULTIMATE.start_main_~s~0 1) 0) (= 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:21:37,080 INFO L281 TraceCheckUtils]: 35: Hoare triple {12902#(and (= (+ ULTIMATE.start_main_~s~0 1) 0) (= 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); {12912#(and (= (+ ULTIMATE.start_main_~s~0 1) 0) (= ULTIMATE.start_main_~q~0 1) (= ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~x~0))} is VALID [2021-09-13 14:21:37,081 INFO L281 TraceCheckUtils]: 36: Hoare triple {12912#(and (= (+ ULTIMATE.start_main_~s~0 1) 0) (= ULTIMATE.start_main_~q~0 1) (= ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~x~0))} __VERIFIER_assert_#in~cond := (if 0 == main_~q~0 * main_~x~0 + main_~s~0 * main_~y~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {12916#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} is VALID [2021-09-13 14:21:37,081 INFO L281 TraceCheckUtils]: 37: Hoare triple {12916#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} assume 0 == __VERIFIER_assert_~cond; {12795#false} is VALID [2021-09-13 14:21:37,081 INFO L281 TraceCheckUtils]: 38: Hoare triple {12795#false} assume !false; {12795#false} is VALID [2021-09-13 14:21:37,081 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:21:37,081 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 14:21:38,400 INFO L281 TraceCheckUtils]: 38: Hoare triple {12795#false} assume !false; {12795#false} is VALID [2021-09-13 14:21:38,401 INFO L281 TraceCheckUtils]: 37: Hoare triple {12916#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} assume 0 == __VERIFIER_assert_~cond; {12795#false} is VALID [2021-09-13 14:21:38,401 INFO L281 TraceCheckUtils]: 36: Hoare triple {12929#(= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) 0)} __VERIFIER_assert_#in~cond := (if 0 == main_~q~0 * main_~x~0 + main_~s~0 * main_~y~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {12916#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} is VALID [2021-09-13 14:21:38,402 INFO L281 TraceCheckUtils]: 35: Hoare triple {12933#(or (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) 0) (not (= ULTIMATE.start_main_~b~0 0)))} assume !(0 != main_~b~0); {12929#(= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) 0)} is VALID [2021-09-13 14:21:38,402 INFO L281 TraceCheckUtils]: 34: Hoare triple {12933#(or (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) 0) (not (= ULTIMATE.start_main_~b~0 0)))} assume !!(main_#t~post9 < 100);havoc main_#t~post9; {12933#(or (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) 0) (not (= ULTIMATE.start_main_~b~0 0)))} is VALID [2021-09-13 14:21:38,402 INFO L281 TraceCheckUtils]: 33: Hoare triple {12933#(or (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) 0) (not (= ULTIMATE.start_main_~b~0 0)))} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {12933#(or (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) 0) (not (= ULTIMATE.start_main_~b~0 0)))} is VALID [2021-09-13 14:21:40,404 INFO L281 TraceCheckUtils]: 32: Hoare triple {12943#(or (not (= ULTIMATE.start_main_~c~0 0)) (= (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)) (+ (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))))} 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; {12933#(or (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) 0) (not (= ULTIMATE.start_main_~b~0 0)))} is UNKNOWN [2021-09-13 14:21:40,405 INFO L281 TraceCheckUtils]: 31: Hoare triple {12943#(or (not (= ULTIMATE.start_main_~c~0 0)) (= (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)) (+ (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))))} assume !(main_~c~0 >= main_~b~0); {12943#(or (not (= ULTIMATE.start_main_~c~0 0)) (= (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)) (+ (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))))} is VALID [2021-09-13 14:21:40,405 INFO L281 TraceCheckUtils]: 30: Hoare triple {12943#(or (not (= ULTIMATE.start_main_~c~0 0)) (= (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)) (+ (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))))} assume !(0 == __VERIFIER_assert_~cond); {12943#(or (not (= ULTIMATE.start_main_~c~0 0)) (= (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)) (+ (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))))} is VALID [2021-09-13 14:21:40,405 INFO L281 TraceCheckUtils]: 29: Hoare triple {12943#(or (not (= ULTIMATE.start_main_~c~0 0)) (= (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)) (+ (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))))} __VERIFIER_assert_#in~cond := (if 0 == main_~q~0 * main_~xy~0 + main_~s~0 * main_~yy~0 - main_~q~0 * main_~x~0 - main_~b~0 * main_~y~0 - main_~s~0 * main_~y~0 + main_~b~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {12943#(or (not (= ULTIMATE.start_main_~c~0 0)) (= (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)) (+ (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))))} is VALID [2021-09-13 14:21:40,407 INFO L281 TraceCheckUtils]: 28: Hoare triple {12956#(or (not (= ULTIMATE.start_main_~c~0 0)) (= 0 ULTIMATE.start___VERIFIER_assert_~cond) (= (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)) (+ (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))))} assume !(0 == __VERIFIER_assert_~cond); {12943#(or (not (= ULTIMATE.start_main_~c~0 0)) (= (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)) (+ (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))))} is VALID [2021-09-13 14:21:40,407 INFO L281 TraceCheckUtils]: 27: Hoare triple {12960#(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_~c~0 0)) (= (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)) (+ (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))))} __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; {12956#(or (not (= ULTIMATE.start_main_~c~0 0)) (= 0 ULTIMATE.start___VERIFIER_assert_~cond) (= (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)) (+ (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))))} is VALID [2021-09-13 14:21:40,408 INFO L281 TraceCheckUtils]: 26: Hoare triple {12964#(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_~c~0 0)) (= 0 ULTIMATE.start___VERIFIER_assert_~cond) (= (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)) (+ (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))))} assume !(0 == __VERIFIER_assert_~cond); {12960#(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_~c~0 0)) (= (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)) (+ (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))))} is VALID [2021-09-13 14:21:40,408 INFO L281 TraceCheckUtils]: 25: Hoare triple {12968#(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_~c~0 0)) (= (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)) (+ (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))) (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_~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; {12964#(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_~c~0 0)) (= 0 ULTIMATE.start___VERIFIER_assert_~cond) (= (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)) (+ (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))))} is VALID [2021-09-13 14:21:40,409 INFO L281 TraceCheckUtils]: 24: Hoare triple {12968#(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_~c~0 0)) (= (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)) (+ (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))) (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); {12968#(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_~c~0 0)) (= (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)) (+ (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))) (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:21:40,409 INFO L281 TraceCheckUtils]: 23: Hoare triple {12968#(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_~c~0 0)) (= (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)) (+ (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))) (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_#t~post10 < 100);havoc main_#t~post10;__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; {12968#(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_~c~0 0)) (= (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)) (+ (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))) (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:21:40,409 INFO L281 TraceCheckUtils]: 22: Hoare triple {12968#(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_~c~0 0)) (= (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)) (+ (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))) (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)))))} main_#t~post10 := ~counter~0;~counter~0 := 1 + main_#t~post10; {12968#(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_~c~0 0)) (= (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)) (+ (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))) (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:21:41,314 INFO L281 TraceCheckUtils]: 21: Hoare triple {12981#(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_~c~0 ULTIMATE.start_main_~b~0)) (= (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)) (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))) (not (= ULTIMATE.start_main_~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);main_~c~0 := main_~c~0 - main_~b~0;main_~k~0 := 1 + main_~k~0; {12968#(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_~c~0 0)) (= (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)) (+ (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))) (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:21:41,315 INFO L281 TraceCheckUtils]: 20: Hoare triple {12981#(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_~c~0 ULTIMATE.start_main_~b~0)) (= (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)) (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))) (not (= ULTIMATE.start_main_~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); {12981#(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_~c~0 ULTIMATE.start_main_~b~0)) (= (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)) (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))) (not (= ULTIMATE.start_main_~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:21:41,315 INFO L281 TraceCheckUtils]: 19: Hoare triple {12981#(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_~c~0 ULTIMATE.start_main_~b~0)) (= (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)) (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))) (not (= ULTIMATE.start_main_~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 0 == main_~q~0 * main_~xy~0 + main_~s~0 * main_~yy~0 - main_~q~0 * main_~x~0 - main_~b~0 * main_~y~0 - main_~s~0 * main_~y~0 + main_~b~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {12981#(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_~c~0 ULTIMATE.start_main_~b~0)) (= (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)) (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))) (not (= ULTIMATE.start_main_~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:21:41,316 INFO L281 TraceCheckUtils]: 18: Hoare triple {12981#(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_~c~0 ULTIMATE.start_main_~b~0)) (= (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)) (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))) (not (= ULTIMATE.start_main_~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); {12981#(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_~c~0 ULTIMATE.start_main_~b~0)) (= (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)) (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))) (not (= ULTIMATE.start_main_~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:21:41,316 INFO L281 TraceCheckUtils]: 17: Hoare triple {12981#(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_~c~0 ULTIMATE.start_main_~b~0)) (= (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)) (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))) (not (= ULTIMATE.start_main_~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; {12981#(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_~c~0 ULTIMATE.start_main_~b~0)) (= (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)) (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))) (not (= ULTIMATE.start_main_~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:21:41,316 INFO L281 TraceCheckUtils]: 16: Hoare triple {12981#(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_~c~0 ULTIMATE.start_main_~b~0)) (= (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)) (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))) (not (= ULTIMATE.start_main_~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); {12981#(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_~c~0 ULTIMATE.start_main_~b~0)) (= (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)) (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))) (not (= ULTIMATE.start_main_~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:21:41,321 INFO L281 TraceCheckUtils]: 15: Hoare triple {12981#(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_~c~0 ULTIMATE.start_main_~b~0)) (= (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)) (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))) (not (= ULTIMATE.start_main_~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_~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; {12981#(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_~c~0 ULTIMATE.start_main_~b~0)) (= (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)) (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))) (not (= ULTIMATE.start_main_~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:21:41,321 INFO L281 TraceCheckUtils]: 14: Hoare triple {12981#(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_~c~0 ULTIMATE.start_main_~b~0)) (= (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)) (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))) (not (= ULTIMATE.start_main_~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); {12981#(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_~c~0 ULTIMATE.start_main_~b~0)) (= (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)) (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))) (not (= ULTIMATE.start_main_~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:21:41,321 INFO L281 TraceCheckUtils]: 13: Hoare triple {12981#(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_~c~0 ULTIMATE.start_main_~b~0)) (= (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)) (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))) (not (= ULTIMATE.start_main_~a~0 (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)))))} assume !!(main_#t~post10 < 100);havoc main_#t~post10;__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; {12981#(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_~c~0 ULTIMATE.start_main_~b~0)) (= (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)) (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))) (not (= ULTIMATE.start_main_~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:21:41,322 INFO L281 TraceCheckUtils]: 12: Hoare triple {12981#(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_~c~0 ULTIMATE.start_main_~b~0)) (= (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)) (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))) (not (= ULTIMATE.start_main_~a~0 (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)))))} main_#t~post10 := ~counter~0;~counter~0 := 1 + main_#t~post10; {12981#(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_~c~0 ULTIMATE.start_main_~b~0)) (= (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)) (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))) (not (= ULTIMATE.start_main_~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:21:41,323 INFO L281 TraceCheckUtils]: 11: Hoare triple {12794#true} assume !!(0 != main_~b~0);main_~c~0 := main_~a~0;main_~k~0 := 0; {12981#(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_~c~0 ULTIMATE.start_main_~b~0)) (= (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)) (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))) (not (= ULTIMATE.start_main_~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:21:41,323 INFO L281 TraceCheckUtils]: 10: Hoare triple {12794#true} assume !!(main_#t~post9 < 100);havoc main_#t~post9; {12794#true} is VALID [2021-09-13 14:21:41,323 INFO L281 TraceCheckUtils]: 9: Hoare triple {12794#true} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {12794#true} is VALID [2021-09-13 14:21:41,323 INFO L281 TraceCheckUtils]: 8: Hoare triple {12794#true} assume !(0 == assume_abort_if_not_~cond); {12794#true} is VALID [2021-09-13 14:21:41,323 INFO L281 TraceCheckUtils]: 7: Hoare triple {12794#true} assume_abort_if_not_#in~cond := (if main_~yy~0 < 2147483647 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {12794#true} is VALID [2021-09-13 14:21:41,323 INFO L281 TraceCheckUtils]: 6: Hoare triple {12794#true} assume !(0 == assume_abort_if_not_~cond); {12794#true} is VALID [2021-09-13 14:21:41,323 INFO L281 TraceCheckUtils]: 5: Hoare triple {12794#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;main_~c~0 := 0;main_~k~0 := 0;main_~xy~0 := main_~x~0 * main_~y~0;main_~yy~0 := main_~y~0 * main_~y~0;assume_abort_if_not_#in~cond := (if main_~xy~0 < 2147483647 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {12794#true} is VALID [2021-09-13 14:21:41,323 INFO L281 TraceCheckUtils]: 4: Hoare triple {12794#true} assume !(0 == assume_abort_if_not_~cond); {12794#true} is VALID [2021-09-13 14:21:41,324 INFO L281 TraceCheckUtils]: 3: Hoare triple {12794#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; {12794#true} is VALID [2021-09-13 14:21:41,324 INFO L281 TraceCheckUtils]: 2: Hoare triple {12794#true} assume !(0 == assume_abort_if_not_~cond); {12794#true} is VALID [2021-09-13 14:21:41,324 INFO L281 TraceCheckUtils]: 1: Hoare triple {12794#true} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~post10, main_~temp~0, main_#t~post9, main_~x~0, main_~y~0, main_~a~0, main_~b~0, main_~p~0, main_~q~0, main_~r~0, main_~s~0, main_~c~0, main_~k~0, main_~xy~0, main_~yy~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;havoc main_~c~0;havoc main_~k~0;havoc main_~xy~0;havoc main_~yy~0;assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647;main_~x~0 := main_#t~nondet7;havoc main_#t~nondet7;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_~x~0 >= 1 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {12794#true} is VALID [2021-09-13 14:21:41,324 INFO L281 TraceCheckUtils]: 0: Hoare triple {12794#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);~counter~0 := 0; {12794#true} is VALID [2021-09-13 14:21:41,324 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:21:41,324 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:21:41,324 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097656836] [2021-09-13 14:21:41,324 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-09-13 14:21:41,324 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [599762131] [2021-09-13 14:21:41,325 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [599762131] provided 0 perfect and 2 imperfect interpolant sequences [2021-09-13 14:21:41,325 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-09-13 14:21:41,325 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 20 [2021-09-13 14:21:41,325 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114898779] [2021-09-13 14:21:41,325 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.55) internal successors, (71), 20 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 39 [2021-09-13 14:21:41,325 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:21:41,325 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 20 states, 20 states have (on average 3.55) internal successors, (71), 20 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:21:41,803 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:21:41,803 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-09-13 14:21:41,803 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:21:41,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-09-13 14:21:41,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=280, Unknown=0, NotChecked=0, Total=380 [2021-09-13 14:21:41,804 INFO L87 Difference]: Start difference. First operand 365 states and 452 transitions. Second operand has 20 states, 20 states have (on average 3.55) internal successors, (71), 20 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:21:49,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:21:49,138 INFO L93 Difference]: Finished difference Result 454 states and 554 transitions. [2021-09-13 14:21:49,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2021-09-13 14:21:49,138 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.55) internal successors, (71), 20 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 39 [2021-09-13 14:21:49,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:21:49,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 3.55) internal successors, (71), 20 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:21:49,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 181 transitions. [2021-09-13 14:21:49,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 3.55) internal successors, (71), 20 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:21:49,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 181 transitions. [2021-09-13 14:21:49,141 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 43 states and 181 transitions. [2021-09-13 14:21:51,641 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 181 edges. 180 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2021-09-13 14:21:51,650 INFO L225 Difference]: With dead ends: 454 [2021-09-13 14:21:51,650 INFO L226 Difference]: Without dead ends: 448 [2021-09-13 14:21:51,651 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 701 ImplicationChecksByTransitivity, 2915.03ms TimeCoverageRelationStatistics Valid=657, Invalid=2205, Unknown=0, NotChecked=0, Total=2862 [2021-09-13 14:21:51,651 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 308 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 555 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1622.36ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 660 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.14ms SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 555 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1628.26ms IncrementalHoareTripleChecker+Time [2021-09-13 14:21:51,651 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [308 Valid, 0 Invalid, 660 Unknown, 0 Unchecked, 4.14ms Time], IncrementalHoareTripleChecker [105 Valid, 555 Invalid, 0 Unknown, 0 Unchecked, 1628.26ms Time] [2021-09-13 14:21:51,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2021-09-13 14:21:53,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 413. [2021-09-13 14:21:53,604 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:21:53,604 INFO L82 GeneralOperation]: Start isEquivalent. First operand 448 states. Second operand has 413 states, 408 states have (on average 1.2426470588235294) internal successors, (507), 412 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:21:53,604 INFO L74 IsIncluded]: Start isIncluded. First operand 448 states. Second operand has 413 states, 408 states have (on average 1.2426470588235294) internal successors, (507), 412 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:21:53,605 INFO L87 Difference]: Start difference. First operand 448 states. Second operand has 413 states, 408 states have (on average 1.2426470588235294) internal successors, (507), 412 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:21:53,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:21:53,615 INFO L93 Difference]: Finished difference Result 448 states and 542 transitions. [2021-09-13 14:21:53,615 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 542 transitions. [2021-09-13 14:21:53,616 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:21:53,616 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:21:53,617 INFO L74 IsIncluded]: Start isIncluded. First operand has 413 states, 408 states have (on average 1.2426470588235294) internal successors, (507), 412 states have internal predecessors, (507), 0 states have call successors, (0), 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 448 states. [2021-09-13 14:21:53,617 INFO L87 Difference]: Start difference. First operand has 413 states, 408 states have (on average 1.2426470588235294) internal successors, (507), 412 states have internal predecessors, (507), 0 states have call successors, (0), 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 448 states. [2021-09-13 14:21:53,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:21:53,631 INFO L93 Difference]: Finished difference Result 448 states and 542 transitions. [2021-09-13 14:21:53,632 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 542 transitions. [2021-09-13 14:21:53,632 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:21:53,632 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:21:53,633 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:21:53,633 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:21:53,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 413 states, 408 states have (on average 1.2426470588235294) internal successors, (507), 412 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:21:53,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 507 transitions. [2021-09-13 14:21:53,643 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 507 transitions. Word has length 39 [2021-09-13 14:21:53,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:21:53,643 INFO L470 AbstractCegarLoop]: Abstraction has 413 states and 507 transitions. [2021-09-13 14:21:53,643 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.55) internal successors, (71), 20 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:21:53,643 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 507 transitions. [2021-09-13 14:21:53,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-09-13 14:21:53,644 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:21:53,644 INFO L513 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 14:21:53,667 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:21:53,852 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:21:53,853 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-09-13 14:21:53,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:21:53,854 INFO L82 PathProgramCache]: Analyzing trace with hash -365269558, now seen corresponding path program 2 times [2021-09-13 14:21:53,854 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:21:53,854 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764576008] [2021-09-13 14:21:53,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:21:53,854 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:21:53,863 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-09-13 14:21:53,863 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [570794387] [2021-09-13 14:21:53,863 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-09-13 14:21:53,864 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:21:53,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:21:53,866 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-09-13 14:21:53,871 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2021-09-13 14:21:53,918 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-09-13 14:21:53,919 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-09-13 14:21:53,920 INFO L263 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 5 conjunts are in the unsatisfiable core [2021-09-13 14:21:53,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:21:53,940 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:21:54,190 INFO L281 TraceCheckUtils]: 0: Hoare triple {15226#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);~counter~0 := 0; {15226#true} is VALID [2021-09-13 14:21:54,191 INFO L281 TraceCheckUtils]: 1: Hoare triple {15226#true} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~post10, main_~temp~0, main_#t~post9, main_~x~0, main_~y~0, main_~a~0, main_~b~0, main_~p~0, main_~q~0, main_~r~0, main_~s~0, main_~c~0, main_~k~0, main_~xy~0, main_~yy~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;havoc main_~c~0;havoc main_~k~0;havoc main_~xy~0;havoc main_~yy~0;assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647;main_~x~0 := main_#t~nondet7;havoc main_#t~nondet7;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_~x~0 >= 1 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {15226#true} is VALID [2021-09-13 14:21:54,191 INFO L281 TraceCheckUtils]: 2: Hoare triple {15226#true} assume !(0 == assume_abort_if_not_~cond); {15226#true} is VALID [2021-09-13 14:21:54,191 INFO L281 TraceCheckUtils]: 3: Hoare triple {15226#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; {15226#true} is VALID [2021-09-13 14:21:54,191 INFO L281 TraceCheckUtils]: 4: Hoare triple {15226#true} assume !(0 == assume_abort_if_not_~cond); {15226#true} is VALID [2021-09-13 14:21:54,191 INFO L281 TraceCheckUtils]: 5: Hoare triple {15226#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;main_~c~0 := 0;main_~k~0 := 0;main_~xy~0 := main_~x~0 * main_~y~0;main_~yy~0 := main_~y~0 * main_~y~0;assume_abort_if_not_#in~cond := (if main_~xy~0 < 2147483647 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {15226#true} is VALID [2021-09-13 14:21:54,191 INFO L281 TraceCheckUtils]: 6: Hoare triple {15226#true} assume !(0 == assume_abort_if_not_~cond); {15226#true} is VALID [2021-09-13 14:21:54,192 INFO L281 TraceCheckUtils]: 7: Hoare triple {15226#true} assume_abort_if_not_#in~cond := (if main_~yy~0 < 2147483647 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {15226#true} is VALID [2021-09-13 14:21:54,192 INFO L281 TraceCheckUtils]: 8: Hoare triple {15226#true} assume !(0 == assume_abort_if_not_~cond); {15226#true} is VALID [2021-09-13 14:21:54,192 INFO L281 TraceCheckUtils]: 9: Hoare triple {15226#true} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {15226#true} is VALID [2021-09-13 14:21:54,192 INFO L281 TraceCheckUtils]: 10: Hoare triple {15226#true} assume !!(main_#t~post9 < 100);havoc main_#t~post9; {15226#true} is VALID [2021-09-13 14:21:54,192 INFO L281 TraceCheckUtils]: 11: Hoare triple {15226#true} assume !!(0 != main_~b~0);main_~c~0 := main_~a~0;main_~k~0 := 0; {15226#true} is VALID [2021-09-13 14:21:54,192 INFO L281 TraceCheckUtils]: 12: Hoare triple {15226#true} main_#t~post10 := ~counter~0;~counter~0 := 1 + main_#t~post10; {15226#true} is VALID [2021-09-13 14:21:54,192 INFO L281 TraceCheckUtils]: 13: Hoare triple {15226#true} assume !!(main_#t~post10 < 100);havoc main_#t~post10;__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; {15226#true} is VALID [2021-09-13 14:21:54,193 INFO L281 TraceCheckUtils]: 14: Hoare triple {15226#true} assume !(0 == __VERIFIER_assert_~cond); {15226#true} is VALID [2021-09-13 14:21:54,193 INFO L281 TraceCheckUtils]: 15: Hoare triple {15226#true} __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; {15226#true} is VALID [2021-09-13 14:21:54,193 INFO L281 TraceCheckUtils]: 16: Hoare triple {15226#true} assume !(0 == __VERIFIER_assert_~cond); {15226#true} is VALID [2021-09-13 14:21:54,193 INFO L281 TraceCheckUtils]: 17: Hoare triple {15226#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; {15226#true} is VALID [2021-09-13 14:21:54,193 INFO L281 TraceCheckUtils]: 18: Hoare triple {15226#true} assume !(0 == __VERIFIER_assert_~cond); {15226#true} is VALID [2021-09-13 14:21:54,193 INFO L281 TraceCheckUtils]: 19: Hoare triple {15226#true} __VERIFIER_assert_#in~cond := (if 0 == main_~q~0 * main_~xy~0 + main_~s~0 * main_~yy~0 - main_~q~0 * main_~x~0 - main_~b~0 * main_~y~0 - main_~s~0 * main_~y~0 + main_~b~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {15226#true} is VALID [2021-09-13 14:21:54,194 INFO L281 TraceCheckUtils]: 20: Hoare triple {15226#true} assume !(0 == __VERIFIER_assert_~cond); {15226#true} is VALID [2021-09-13 14:21:54,194 INFO L281 TraceCheckUtils]: 21: Hoare triple {15226#true} assume !(main_~c~0 >= main_~b~0); {15294#(< ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~b~0)} is VALID [2021-09-13 14:21:54,195 INFO L281 TraceCheckUtils]: 22: Hoare triple {15294#(< 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; {15298#(< ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~a~0)} is VALID [2021-09-13 14:21:54,195 INFO L281 TraceCheckUtils]: 23: Hoare triple {15298#(< ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~a~0)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {15298#(< ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~a~0)} is VALID [2021-09-13 14:21:54,195 INFO L281 TraceCheckUtils]: 24: Hoare triple {15298#(< ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~a~0)} assume !!(main_#t~post9 < 100);havoc main_#t~post9; {15298#(< ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~a~0)} is VALID [2021-09-13 14:21:54,196 INFO L281 TraceCheckUtils]: 25: Hoare triple {15298#(< ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~a~0)} assume !!(0 != main_~b~0);main_~c~0 := main_~a~0;main_~k~0 := 0; {15308#(< ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~c~0)} is VALID [2021-09-13 14:21:54,196 INFO L281 TraceCheckUtils]: 26: Hoare triple {15308#(< ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~c~0)} main_#t~post10 := ~counter~0;~counter~0 := 1 + main_#t~post10; {15308#(< ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~c~0)} is VALID [2021-09-13 14:21:54,197 INFO L281 TraceCheckUtils]: 27: Hoare triple {15308#(< ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~c~0)} assume !!(main_#t~post10 < 100);havoc main_#t~post10;__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; {15308#(< ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~c~0)} is VALID [2021-09-13 14:21:54,197 INFO L281 TraceCheckUtils]: 28: Hoare triple {15308#(< ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~c~0)} assume !(0 == __VERIFIER_assert_~cond); {15308#(< ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~c~0)} is VALID [2021-09-13 14:21:54,197 INFO L281 TraceCheckUtils]: 29: Hoare triple {15308#(< ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~c~0)} __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; {15308#(< ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~c~0)} is VALID [2021-09-13 14:21:54,198 INFO L281 TraceCheckUtils]: 30: Hoare triple {15308#(< ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~c~0)} assume !(0 == __VERIFIER_assert_~cond); {15308#(< ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~c~0)} is VALID [2021-09-13 14:21:54,198 INFO L281 TraceCheckUtils]: 31: Hoare triple {15308#(< ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~c~0)} __VERIFIER_assert_#in~cond := (if main_~b~0 == main_~x~0 * main_~q~0 + main_~y~0 * main_~s~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {15308#(< ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~c~0)} is VALID [2021-09-13 14:21:54,199 INFO L281 TraceCheckUtils]: 32: Hoare triple {15308#(< ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~c~0)} assume !(0 == __VERIFIER_assert_~cond); {15308#(< ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~c~0)} is VALID [2021-09-13 14:21:54,199 INFO L281 TraceCheckUtils]: 33: Hoare triple {15308#(< ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~c~0)} __VERIFIER_assert_#in~cond := (if 0 == main_~q~0 * main_~xy~0 + main_~s~0 * main_~yy~0 - main_~q~0 * main_~x~0 - main_~b~0 * main_~y~0 - main_~s~0 * main_~y~0 + main_~b~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {15308#(< ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~c~0)} is VALID [2021-09-13 14:21:54,199 INFO L281 TraceCheckUtils]: 34: Hoare triple {15308#(< ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~c~0)} assume !(0 == __VERIFIER_assert_~cond); {15308#(< ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~c~0)} is VALID [2021-09-13 14:21:54,200 INFO L281 TraceCheckUtils]: 35: Hoare triple {15308#(< ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~c~0)} assume !(main_~c~0 >= main_~b~0); {15227#false} is VALID [2021-09-13 14:21:54,200 INFO L281 TraceCheckUtils]: 36: Hoare triple {15227#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; {15227#false} is VALID [2021-09-13 14:21:54,201 INFO L281 TraceCheckUtils]: 37: Hoare triple {15227#false} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {15227#false} is VALID [2021-09-13 14:21:54,201 INFO L281 TraceCheckUtils]: 38: Hoare triple {15227#false} assume !!(main_#t~post9 < 100);havoc main_#t~post9; {15227#false} is VALID [2021-09-13 14:21:54,201 INFO L281 TraceCheckUtils]: 39: Hoare triple {15227#false} assume !!(0 != main_~b~0);main_~c~0 := main_~a~0;main_~k~0 := 0; {15227#false} is VALID [2021-09-13 14:21:54,201 INFO L281 TraceCheckUtils]: 40: Hoare triple {15227#false} main_#t~post10 := ~counter~0;~counter~0 := 1 + main_#t~post10; {15227#false} is VALID [2021-09-13 14:21:54,201 INFO L281 TraceCheckUtils]: 41: Hoare triple {15227#false} assume !!(main_#t~post10 < 100);havoc main_#t~post10;__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; {15227#false} is VALID [2021-09-13 14:21:54,201 INFO L281 TraceCheckUtils]: 42: Hoare triple {15227#false} assume !(0 == __VERIFIER_assert_~cond); {15227#false} is VALID [2021-09-13 14:21:54,201 INFO L281 TraceCheckUtils]: 43: Hoare triple {15227#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; {15227#false} is VALID [2021-09-13 14:21:54,202 INFO L281 TraceCheckUtils]: 44: Hoare triple {15227#false} assume !(0 == __VERIFIER_assert_~cond); {15227#false} is VALID [2021-09-13 14:21:54,202 INFO L281 TraceCheckUtils]: 45: Hoare triple {15227#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; {15227#false} is VALID [2021-09-13 14:21:54,202 INFO L281 TraceCheckUtils]: 46: Hoare triple {15227#false} assume !(0 == __VERIFIER_assert_~cond); {15227#false} is VALID [2021-09-13 14:21:54,202 INFO L281 TraceCheckUtils]: 47: Hoare triple {15227#false} __VERIFIER_assert_#in~cond := (if 0 == main_~q~0 * main_~xy~0 + main_~s~0 * main_~yy~0 - main_~q~0 * main_~x~0 - main_~b~0 * main_~y~0 - main_~s~0 * main_~y~0 + main_~b~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {15227#false} is VALID [2021-09-13 14:21:54,202 INFO L281 TraceCheckUtils]: 48: Hoare triple {15227#false} assume !(0 == __VERIFIER_assert_~cond); {15227#false} is VALID [2021-09-13 14:21:54,202 INFO L281 TraceCheckUtils]: 49: Hoare triple {15227#false} assume !(main_~c~0 >= main_~b~0); {15227#false} is VALID [2021-09-13 14:21:54,203 INFO L281 TraceCheckUtils]: 50: Hoare triple {15227#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; {15227#false} is VALID [2021-09-13 14:21:54,203 INFO L281 TraceCheckUtils]: 51: Hoare triple {15227#false} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {15227#false} is VALID [2021-09-13 14:21:54,203 INFO L281 TraceCheckUtils]: 52: Hoare triple {15227#false} assume !(main_#t~post9 < 100);havoc main_#t~post9; {15227#false} is VALID [2021-09-13 14:21:54,203 INFO L281 TraceCheckUtils]: 53: Hoare triple {15227#false} __VERIFIER_assert_#in~cond := (if 0 == main_~q~0 * main_~x~0 + main_~s~0 * main_~y~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {15227#false} is VALID [2021-09-13 14:21:54,203 INFO L281 TraceCheckUtils]: 54: Hoare triple {15227#false} assume 0 == __VERIFIER_assert_~cond; {15227#false} is VALID [2021-09-13 14:21:54,203 INFO L281 TraceCheckUtils]: 55: Hoare triple {15227#false} assume !false; {15227#false} is VALID [2021-09-13 14:21:54,204 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-09-13 14:21:54,204 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-09-13 14:21:54,204 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:21:54,204 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764576008] [2021-09-13 14:21:54,204 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-09-13 14:21:54,205 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [570794387] [2021-09-13 14:21:54,205 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [570794387] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-13 14:21:54,205 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-13 14:21:54,205 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-09-13 14:21:54,207 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516743011] [2021-09-13 14:21:54,208 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 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 56 [2021-09-13 14:21:54,208 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:21:54,208 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:21:54,254 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:21:54,255 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-09-13 14:21:54,255 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:21:54,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-09-13 14:21:54,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-09-13 14:21:54,256 INFO L87 Difference]: Start difference. First operand 413 states and 507 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:21:56,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:21:56,847 INFO L93 Difference]: Finished difference Result 762 states and 950 transitions. [2021-09-13 14:21:56,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-09-13 14:21:56,847 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 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 56 [2021-09-13 14:21:56,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:21:56,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:21:56,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 111 transitions. [2021-09-13 14:21:56,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:21:56,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 111 transitions. [2021-09-13 14:21:56,848 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 111 transitions. [2021-09-13 14:21:56,926 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:21:56,936 INFO L225 Difference]: With dead ends: 762 [2021-09-13 14:21:56,936 INFO L226 Difference]: Without dead ends: 475 [2021-09-13 14:21:56,937 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 34.31ms TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-09-13 14:21:56,938 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 37 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 168.81ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.90ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 170.20ms IncrementalHoareTripleChecker+Time [2021-09-13 14:21:56,938 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 0 Invalid, 219 Unknown, 0 Unchecked, 0.90ms Time], IncrementalHoareTripleChecker [1 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 170.20ms Time] [2021-09-13 14:21:56,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2021-09-13 14:21:58,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 424. [2021-09-13 14:21:58,922 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:21:58,923 INFO L82 GeneralOperation]: Start isEquivalent. First operand 475 states. Second operand has 424 states, 419 states have (on average 1.2482100238663485) internal successors, (523), 423 states have internal predecessors, (523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:21:58,923 INFO L74 IsIncluded]: Start isIncluded. First operand 475 states. Second operand has 424 states, 419 states have (on average 1.2482100238663485) internal successors, (523), 423 states have internal predecessors, (523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:21:58,923 INFO L87 Difference]: Start difference. First operand 475 states. Second operand has 424 states, 419 states have (on average 1.2482100238663485) internal successors, (523), 423 states have internal predecessors, (523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:21:58,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:21:58,933 INFO L93 Difference]: Finished difference Result 475 states and 577 transitions. [2021-09-13 14:21:58,934 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 577 transitions. [2021-09-13 14:21:58,934 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:21:58,934 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:21:58,935 INFO L74 IsIncluded]: Start isIncluded. First operand has 424 states, 419 states have (on average 1.2482100238663485) internal successors, (523), 423 states have internal predecessors, (523), 0 states have call successors, (0), 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 475 states. [2021-09-13 14:21:58,936 INFO L87 Difference]: Start difference. First operand has 424 states, 419 states have (on average 1.2482100238663485) internal successors, (523), 423 states have internal predecessors, (523), 0 states have call successors, (0), 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 475 states. [2021-09-13 14:21:58,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:21:58,947 INFO L93 Difference]: Finished difference Result 475 states and 577 transitions. [2021-09-13 14:21:58,947 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 577 transitions. [2021-09-13 14:21:58,948 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:21:58,948 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:21:58,948 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:21:58,948 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:21:58,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 424 states, 419 states have (on average 1.2482100238663485) internal successors, (523), 423 states have internal predecessors, (523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:21:58,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 523 transitions. [2021-09-13 14:21:58,960 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 523 transitions. Word has length 56 [2021-09-13 14:21:58,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:21:58,960 INFO L470 AbstractCegarLoop]: Abstraction has 424 states and 523 transitions. [2021-09-13 14:21:58,960 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:21:58,960 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 523 transitions. [2021-09-13 14:21:58,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-09-13 14:21:58,961 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:21:58,961 INFO L513 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 14:21:58,986 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2021-09-13 14:21:59,181 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-09-13 14:21:59,181 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-09-13 14:21:59,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:21:59,182 INFO L82 PathProgramCache]: Analyzing trace with hash -859252433, now seen corresponding path program 1 times [2021-09-13 14:21:59,182 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:21:59,182 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097513622] [2021-09-13 14:21:59,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:21:59,182 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:21:59,188 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-09-13 14:21:59,189 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1507364215] [2021-09-13 14:21:59,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:21:59,189 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:21:59,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:21:59,190 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-09-13 14:21:59,191 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2021-09-13 14:21:59,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:21:59,239 INFO L263 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 15 conjunts are in the unsatisfiable core [2021-09-13 14:21:59,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:21:59,251 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:21:59,637 INFO L281 TraceCheckUtils]: 0: Hoare triple {18025#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);~counter~0 := 0; {18030#(<= ~counter~0 0)} is VALID [2021-09-13 14:21:59,637 INFO L281 TraceCheckUtils]: 1: Hoare triple {18030#(<= ~counter~0 0)} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~post10, main_~temp~0, main_#t~post9, main_~x~0, main_~y~0, main_~a~0, main_~b~0, main_~p~0, main_~q~0, main_~r~0, main_~s~0, main_~c~0, main_~k~0, main_~xy~0, main_~yy~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;havoc main_~c~0;havoc main_~k~0;havoc main_~xy~0;havoc main_~yy~0;assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647;main_~x~0 := main_#t~nondet7;havoc main_#t~nondet7;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_~x~0 >= 1 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {18030#(<= ~counter~0 0)} is VALID [2021-09-13 14:21:59,638 INFO L281 TraceCheckUtils]: 2: Hoare triple {18030#(<= ~counter~0 0)} assume !(0 == assume_abort_if_not_~cond); {18030#(<= ~counter~0 0)} is VALID [2021-09-13 14:21:59,638 INFO L281 TraceCheckUtils]: 3: Hoare triple {18030#(<= ~counter~0 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; {18030#(<= ~counter~0 0)} is VALID [2021-09-13 14:21:59,638 INFO L281 TraceCheckUtils]: 4: Hoare triple {18030#(<= ~counter~0 0)} assume !(0 == assume_abort_if_not_~cond); {18030#(<= ~counter~0 0)} is VALID [2021-09-13 14:21:59,638 INFO L281 TraceCheckUtils]: 5: Hoare triple {18030#(<= ~counter~0 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;main_~c~0 := 0;main_~k~0 := 0;main_~xy~0 := main_~x~0 * main_~y~0;main_~yy~0 := main_~y~0 * main_~y~0;assume_abort_if_not_#in~cond := (if main_~xy~0 < 2147483647 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {18030#(<= ~counter~0 0)} is VALID [2021-09-13 14:21:59,639 INFO L281 TraceCheckUtils]: 6: Hoare triple {18030#(<= ~counter~0 0)} assume !(0 == assume_abort_if_not_~cond); {18030#(<= ~counter~0 0)} is VALID [2021-09-13 14:21:59,639 INFO L281 TraceCheckUtils]: 7: Hoare triple {18030#(<= ~counter~0 0)} assume_abort_if_not_#in~cond := (if main_~yy~0 < 2147483647 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {18030#(<= ~counter~0 0)} is VALID [2021-09-13 14:21:59,639 INFO L281 TraceCheckUtils]: 8: Hoare triple {18030#(<= ~counter~0 0)} assume !(0 == assume_abort_if_not_~cond); {18030#(<= ~counter~0 0)} is VALID [2021-09-13 14:21:59,640 INFO L281 TraceCheckUtils]: 9: Hoare triple {18030#(<= ~counter~0 0)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {18058#(<= ~counter~0 1)} is VALID [2021-09-13 14:21:59,641 INFO L281 TraceCheckUtils]: 10: Hoare triple {18058#(<= ~counter~0 1)} assume !!(main_#t~post9 < 100);havoc main_#t~post9; {18058#(<= ~counter~0 1)} is VALID [2021-09-13 14:21:59,641 INFO L281 TraceCheckUtils]: 11: Hoare triple {18058#(<= ~counter~0 1)} assume !!(0 != main_~b~0);main_~c~0 := main_~a~0;main_~k~0 := 0; {18058#(<= ~counter~0 1)} is VALID [2021-09-13 14:21:59,641 INFO L281 TraceCheckUtils]: 12: Hoare triple {18058#(<= ~counter~0 1)} main_#t~post10 := ~counter~0;~counter~0 := 1 + main_#t~post10; {18068#(<= ~counter~0 2)} is VALID [2021-09-13 14:21:59,642 INFO L281 TraceCheckUtils]: 13: Hoare triple {18068#(<= ~counter~0 2)} assume !!(main_#t~post10 < 100);havoc main_#t~post10;__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; {18068#(<= ~counter~0 2)} is VALID [2021-09-13 14:21:59,642 INFO L281 TraceCheckUtils]: 14: Hoare triple {18068#(<= ~counter~0 2)} assume !(0 == __VERIFIER_assert_~cond); {18068#(<= ~counter~0 2)} is VALID [2021-09-13 14:21:59,642 INFO L281 TraceCheckUtils]: 15: Hoare triple {18068#(<= ~counter~0 2)} __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; {18068#(<= ~counter~0 2)} is VALID [2021-09-13 14:21:59,643 INFO L281 TraceCheckUtils]: 16: Hoare triple {18068#(<= ~counter~0 2)} assume !(0 == __VERIFIER_assert_~cond); {18068#(<= ~counter~0 2)} is VALID [2021-09-13 14:21:59,643 INFO L281 TraceCheckUtils]: 17: Hoare triple {18068#(<= ~counter~0 2)} __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; {18068#(<= ~counter~0 2)} is VALID [2021-09-13 14:21:59,643 INFO L281 TraceCheckUtils]: 18: Hoare triple {18068#(<= ~counter~0 2)} assume !(0 == __VERIFIER_assert_~cond); {18068#(<= ~counter~0 2)} is VALID [2021-09-13 14:21:59,643 INFO L281 TraceCheckUtils]: 19: Hoare triple {18068#(<= ~counter~0 2)} __VERIFIER_assert_#in~cond := (if 0 == main_~q~0 * main_~xy~0 + main_~s~0 * main_~yy~0 - main_~q~0 * main_~x~0 - main_~b~0 * main_~y~0 - main_~s~0 * main_~y~0 + main_~b~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {18068#(<= ~counter~0 2)} is VALID [2021-09-13 14:21:59,644 INFO L281 TraceCheckUtils]: 20: Hoare triple {18068#(<= ~counter~0 2)} assume !(0 == __VERIFIER_assert_~cond); {18068#(<= ~counter~0 2)} is VALID [2021-09-13 14:21:59,644 INFO L281 TraceCheckUtils]: 21: Hoare triple {18068#(<= ~counter~0 2)} assume !(main_~c~0 >= main_~b~0); {18068#(<= ~counter~0 2)} is VALID [2021-09-13 14:21:59,644 INFO L281 TraceCheckUtils]: 22: Hoare triple {18068#(<= ~counter~0 2)} 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; {18068#(<= ~counter~0 2)} is VALID [2021-09-13 14:21:59,645 INFO L281 TraceCheckUtils]: 23: Hoare triple {18068#(<= ~counter~0 2)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {18102#(<= ~counter~0 3)} is VALID [2021-09-13 14:21:59,645 INFO L281 TraceCheckUtils]: 24: Hoare triple {18102#(<= ~counter~0 3)} assume !!(main_#t~post9 < 100);havoc main_#t~post9; {18102#(<= ~counter~0 3)} is VALID [2021-09-13 14:21:59,645 INFO L281 TraceCheckUtils]: 25: Hoare triple {18102#(<= ~counter~0 3)} assume !!(0 != main_~b~0);main_~c~0 := main_~a~0;main_~k~0 := 0; {18102#(<= ~counter~0 3)} is VALID [2021-09-13 14:21:59,646 INFO L281 TraceCheckUtils]: 26: Hoare triple {18102#(<= ~counter~0 3)} main_#t~post10 := ~counter~0;~counter~0 := 1 + main_#t~post10; {18112#(<= ~counter~0 4)} is VALID [2021-09-13 14:21:59,646 INFO L281 TraceCheckUtils]: 27: Hoare triple {18112#(<= ~counter~0 4)} assume !!(main_#t~post10 < 100);havoc main_#t~post10;__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; {18112#(<= ~counter~0 4)} is VALID [2021-09-13 14:21:59,647 INFO L281 TraceCheckUtils]: 28: Hoare triple {18112#(<= ~counter~0 4)} assume !(0 == __VERIFIER_assert_~cond); {18112#(<= ~counter~0 4)} is VALID [2021-09-13 14:21:59,647 INFO L281 TraceCheckUtils]: 29: Hoare triple {18112#(<= ~counter~0 4)} __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; {18112#(<= ~counter~0 4)} is VALID [2021-09-13 14:21:59,647 INFO L281 TraceCheckUtils]: 30: Hoare triple {18112#(<= ~counter~0 4)} assume !(0 == __VERIFIER_assert_~cond); {18112#(<= ~counter~0 4)} is VALID [2021-09-13 14:21:59,647 INFO L281 TraceCheckUtils]: 31: Hoare triple {18112#(<= ~counter~0 4)} __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; {18112#(<= ~counter~0 4)} is VALID [2021-09-13 14:21:59,648 INFO L281 TraceCheckUtils]: 32: Hoare triple {18112#(<= ~counter~0 4)} assume !(0 == __VERIFIER_assert_~cond); {18112#(<= ~counter~0 4)} is VALID [2021-09-13 14:21:59,648 INFO L281 TraceCheckUtils]: 33: Hoare triple {18112#(<= ~counter~0 4)} __VERIFIER_assert_#in~cond := (if 0 == main_~q~0 * main_~xy~0 + main_~s~0 * main_~yy~0 - main_~q~0 * main_~x~0 - main_~b~0 * main_~y~0 - main_~s~0 * main_~y~0 + main_~b~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {18112#(<= ~counter~0 4)} is VALID [2021-09-13 14:21:59,648 INFO L281 TraceCheckUtils]: 34: Hoare triple {18112#(<= ~counter~0 4)} assume !(0 == __VERIFIER_assert_~cond); {18112#(<= ~counter~0 4)} is VALID [2021-09-13 14:21:59,649 INFO L281 TraceCheckUtils]: 35: Hoare triple {18112#(<= ~counter~0 4)} assume !!(main_~c~0 >= main_~b~0);main_~c~0 := main_~c~0 - main_~b~0;main_~k~0 := 1 + main_~k~0; {18112#(<= ~counter~0 4)} is VALID [2021-09-13 14:21:59,649 INFO L281 TraceCheckUtils]: 36: Hoare triple {18112#(<= ~counter~0 4)} main_#t~post10 := ~counter~0;~counter~0 := 1 + main_#t~post10; {18143#(<= ~counter~0 5)} is VALID [2021-09-13 14:21:59,649 INFO L281 TraceCheckUtils]: 37: Hoare triple {18143#(<= ~counter~0 5)} assume !!(main_#t~post10 < 100);havoc main_#t~post10;__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; {18143#(<= ~counter~0 5)} is VALID [2021-09-13 14:21:59,650 INFO L281 TraceCheckUtils]: 38: Hoare triple {18143#(<= ~counter~0 5)} assume !(0 == __VERIFIER_assert_~cond); {18143#(<= ~counter~0 5)} is VALID [2021-09-13 14:21:59,650 INFO L281 TraceCheckUtils]: 39: Hoare triple {18143#(<= ~counter~0 5)} __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; {18143#(<= ~counter~0 5)} is VALID [2021-09-13 14:21:59,650 INFO L281 TraceCheckUtils]: 40: Hoare triple {18143#(<= ~counter~0 5)} assume !(0 == __VERIFIER_assert_~cond); {18143#(<= ~counter~0 5)} is VALID [2021-09-13 14:21:59,651 INFO L281 TraceCheckUtils]: 41: Hoare triple {18143#(<= ~counter~0 5)} __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; {18143#(<= ~counter~0 5)} is VALID [2021-09-13 14:21:59,651 INFO L281 TraceCheckUtils]: 42: Hoare triple {18143#(<= ~counter~0 5)} assume !(0 == __VERIFIER_assert_~cond); {18143#(<= ~counter~0 5)} is VALID [2021-09-13 14:21:59,651 INFO L281 TraceCheckUtils]: 43: Hoare triple {18143#(<= ~counter~0 5)} __VERIFIER_assert_#in~cond := (if 0 == main_~q~0 * main_~xy~0 + main_~s~0 * main_~yy~0 - main_~q~0 * main_~x~0 - main_~b~0 * main_~y~0 - main_~s~0 * main_~y~0 + main_~b~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {18143#(<= ~counter~0 5)} is VALID [2021-09-13 14:21:59,651 INFO L281 TraceCheckUtils]: 44: Hoare triple {18143#(<= ~counter~0 5)} assume !(0 == __VERIFIER_assert_~cond); {18143#(<= ~counter~0 5)} is VALID [2021-09-13 14:21:59,652 INFO L281 TraceCheckUtils]: 45: Hoare triple {18143#(<= ~counter~0 5)} assume !(main_~c~0 >= main_~b~0); {18143#(<= ~counter~0 5)} is VALID [2021-09-13 14:21:59,652 INFO L281 TraceCheckUtils]: 46: Hoare triple {18143#(<= ~counter~0 5)} 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; {18143#(<= ~counter~0 5)} is VALID [2021-09-13 14:21:59,653 INFO L281 TraceCheckUtils]: 47: Hoare triple {18143#(<= ~counter~0 5)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {18177#(<= ~counter~0 6)} is VALID [2021-09-13 14:21:59,653 INFO L281 TraceCheckUtils]: 48: Hoare triple {18177#(<= ~counter~0 6)} assume !!(main_#t~post9 < 100);havoc main_#t~post9; {18177#(<= ~counter~0 6)} is VALID [2021-09-13 14:21:59,653 INFO L281 TraceCheckUtils]: 49: Hoare triple {18177#(<= ~counter~0 6)} assume !!(0 != main_~b~0);main_~c~0 := main_~a~0;main_~k~0 := 0; {18177#(<= ~counter~0 6)} is VALID [2021-09-13 14:21:59,653 INFO L281 TraceCheckUtils]: 50: Hoare triple {18177#(<= ~counter~0 6)} main_#t~post10 := ~counter~0;~counter~0 := 1 + main_#t~post10; {18187#(<= |ULTIMATE.start_main_#t~post10| 6)} is VALID [2021-09-13 14:21:59,654 INFO L281 TraceCheckUtils]: 51: Hoare triple {18187#(<= |ULTIMATE.start_main_#t~post10| 6)} assume !(main_#t~post10 < 100);havoc main_#t~post10; {18026#false} is VALID [2021-09-13 14:21:59,654 INFO L281 TraceCheckUtils]: 52: Hoare triple {18026#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; {18026#false} is VALID [2021-09-13 14:21:59,654 INFO L281 TraceCheckUtils]: 53: Hoare triple {18026#false} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {18026#false} is VALID [2021-09-13 14:21:59,654 INFO L281 TraceCheckUtils]: 54: Hoare triple {18026#false} assume !(main_#t~post9 < 100);havoc main_#t~post9; {18026#false} is VALID [2021-09-13 14:21:59,654 INFO L281 TraceCheckUtils]: 55: Hoare triple {18026#false} __VERIFIER_assert_#in~cond := (if 0 == main_~q~0 * main_~x~0 + main_~s~0 * main_~y~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {18026#false} is VALID [2021-09-13 14:21:59,654 INFO L281 TraceCheckUtils]: 56: Hoare triple {18026#false} assume 0 == __VERIFIER_assert_~cond; {18026#false} is VALID [2021-09-13 14:21:59,654 INFO L281 TraceCheckUtils]: 57: Hoare triple {18026#false} assume !false; {18026#false} is VALID [2021-09-13 14:21:59,655 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 8 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:21:59,655 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 14:22:00,093 INFO L281 TraceCheckUtils]: 57: Hoare triple {18026#false} assume !false; {18026#false} is VALID [2021-09-13 14:22:00,093 INFO L281 TraceCheckUtils]: 56: Hoare triple {18026#false} assume 0 == __VERIFIER_assert_~cond; {18026#false} is VALID [2021-09-13 14:22:00,093 INFO L281 TraceCheckUtils]: 55: Hoare triple {18026#false} __VERIFIER_assert_#in~cond := (if 0 == main_~q~0 * main_~x~0 + main_~s~0 * main_~y~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {18026#false} is VALID [2021-09-13 14:22:00,093 INFO L281 TraceCheckUtils]: 54: Hoare triple {18026#false} assume !(main_#t~post9 < 100);havoc main_#t~post9; {18026#false} is VALID [2021-09-13 14:22:00,093 INFO L281 TraceCheckUtils]: 53: Hoare triple {18026#false} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {18026#false} is VALID [2021-09-13 14:22:00,093 INFO L281 TraceCheckUtils]: 52: Hoare triple {18026#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; {18026#false} is VALID [2021-09-13 14:22:00,093 INFO L281 TraceCheckUtils]: 51: Hoare triple {18227#(< |ULTIMATE.start_main_#t~post10| 100)} assume !(main_#t~post10 < 100);havoc main_#t~post10; {18026#false} is VALID [2021-09-13 14:22:00,094 INFO L281 TraceCheckUtils]: 50: Hoare triple {18231#(< ~counter~0 100)} main_#t~post10 := ~counter~0;~counter~0 := 1 + main_#t~post10; {18227#(< |ULTIMATE.start_main_#t~post10| 100)} is VALID [2021-09-13 14:22:00,094 INFO L281 TraceCheckUtils]: 49: Hoare triple {18231#(< ~counter~0 100)} assume !!(0 != main_~b~0);main_~c~0 := main_~a~0;main_~k~0 := 0; {18231#(< ~counter~0 100)} is VALID [2021-09-13 14:22:00,094 INFO L281 TraceCheckUtils]: 48: Hoare triple {18231#(< ~counter~0 100)} assume !!(main_#t~post9 < 100);havoc main_#t~post9; {18231#(< ~counter~0 100)} is VALID [2021-09-13 14:22:00,095 INFO L281 TraceCheckUtils]: 47: Hoare triple {18241#(< ~counter~0 99)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {18231#(< ~counter~0 100)} is VALID [2021-09-13 14:22:00,096 INFO L281 TraceCheckUtils]: 46: Hoare triple {18241#(< ~counter~0 99)} 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; {18241#(< ~counter~0 99)} is VALID [2021-09-13 14:22:00,096 INFO L281 TraceCheckUtils]: 45: Hoare triple {18241#(< ~counter~0 99)} assume !(main_~c~0 >= main_~b~0); {18241#(< ~counter~0 99)} is VALID [2021-09-13 14:22:00,096 INFO L281 TraceCheckUtils]: 44: Hoare triple {18241#(< ~counter~0 99)} assume !(0 == __VERIFIER_assert_~cond); {18241#(< ~counter~0 99)} is VALID [2021-09-13 14:22:00,097 INFO L281 TraceCheckUtils]: 43: Hoare triple {18241#(< ~counter~0 99)} __VERIFIER_assert_#in~cond := (if 0 == main_~q~0 * main_~xy~0 + main_~s~0 * main_~yy~0 - main_~q~0 * main_~x~0 - main_~b~0 * main_~y~0 - main_~s~0 * main_~y~0 + main_~b~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {18241#(< ~counter~0 99)} is VALID [2021-09-13 14:22:00,097 INFO L281 TraceCheckUtils]: 42: Hoare triple {18241#(< ~counter~0 99)} assume !(0 == __VERIFIER_assert_~cond); {18241#(< ~counter~0 99)} is VALID [2021-09-13 14:22:00,097 INFO L281 TraceCheckUtils]: 41: Hoare triple {18241#(< ~counter~0 99)} __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; {18241#(< ~counter~0 99)} is VALID [2021-09-13 14:22:00,097 INFO L281 TraceCheckUtils]: 40: Hoare triple {18241#(< ~counter~0 99)} assume !(0 == __VERIFIER_assert_~cond); {18241#(< ~counter~0 99)} is VALID [2021-09-13 14:22:00,098 INFO L281 TraceCheckUtils]: 39: Hoare triple {18241#(< ~counter~0 99)} __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; {18241#(< ~counter~0 99)} is VALID [2021-09-13 14:22:00,098 INFO L281 TraceCheckUtils]: 38: Hoare triple {18241#(< ~counter~0 99)} assume !(0 == __VERIFIER_assert_~cond); {18241#(< ~counter~0 99)} is VALID [2021-09-13 14:22:00,098 INFO L281 TraceCheckUtils]: 37: Hoare triple {18241#(< ~counter~0 99)} assume !!(main_#t~post10 < 100);havoc main_#t~post10;__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; {18241#(< ~counter~0 99)} is VALID [2021-09-13 14:22:00,099 INFO L281 TraceCheckUtils]: 36: Hoare triple {18275#(< ~counter~0 98)} main_#t~post10 := ~counter~0;~counter~0 := 1 + main_#t~post10; {18241#(< ~counter~0 99)} is VALID [2021-09-13 14:22:00,099 INFO L281 TraceCheckUtils]: 35: Hoare triple {18275#(< ~counter~0 98)} assume !!(main_~c~0 >= main_~b~0);main_~c~0 := main_~c~0 - main_~b~0;main_~k~0 := 1 + main_~k~0; {18275#(< ~counter~0 98)} is VALID [2021-09-13 14:22:00,099 INFO L281 TraceCheckUtils]: 34: Hoare triple {18275#(< ~counter~0 98)} assume !(0 == __VERIFIER_assert_~cond); {18275#(< ~counter~0 98)} is VALID [2021-09-13 14:22:00,100 INFO L281 TraceCheckUtils]: 33: Hoare triple {18275#(< ~counter~0 98)} __VERIFIER_assert_#in~cond := (if 0 == main_~q~0 * main_~xy~0 + main_~s~0 * main_~yy~0 - main_~q~0 * main_~x~0 - main_~b~0 * main_~y~0 - main_~s~0 * main_~y~0 + main_~b~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {18275#(< ~counter~0 98)} is VALID [2021-09-13 14:22:00,100 INFO L281 TraceCheckUtils]: 32: Hoare triple {18275#(< ~counter~0 98)} assume !(0 == __VERIFIER_assert_~cond); {18275#(< ~counter~0 98)} is VALID [2021-09-13 14:22:00,100 INFO L281 TraceCheckUtils]: 31: Hoare triple {18275#(< ~counter~0 98)} __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; {18275#(< ~counter~0 98)} is VALID [2021-09-13 14:22:00,117 INFO L281 TraceCheckUtils]: 30: Hoare triple {18275#(< ~counter~0 98)} assume !(0 == __VERIFIER_assert_~cond); {18275#(< ~counter~0 98)} is VALID [2021-09-13 14:22:00,117 INFO L281 TraceCheckUtils]: 29: Hoare triple {18275#(< ~counter~0 98)} __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; {18275#(< ~counter~0 98)} is VALID [2021-09-13 14:22:00,118 INFO L281 TraceCheckUtils]: 28: Hoare triple {18275#(< ~counter~0 98)} assume !(0 == __VERIFIER_assert_~cond); {18275#(< ~counter~0 98)} is VALID [2021-09-13 14:22:00,118 INFO L281 TraceCheckUtils]: 27: Hoare triple {18275#(< ~counter~0 98)} assume !!(main_#t~post10 < 100);havoc main_#t~post10;__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; {18275#(< ~counter~0 98)} is VALID [2021-09-13 14:22:00,119 INFO L281 TraceCheckUtils]: 26: Hoare triple {18306#(< ~counter~0 97)} main_#t~post10 := ~counter~0;~counter~0 := 1 + main_#t~post10; {18275#(< ~counter~0 98)} is VALID [2021-09-13 14:22:00,120 INFO L281 TraceCheckUtils]: 25: Hoare triple {18306#(< ~counter~0 97)} assume !!(0 != main_~b~0);main_~c~0 := main_~a~0;main_~k~0 := 0; {18306#(< ~counter~0 97)} is VALID [2021-09-13 14:22:00,120 INFO L281 TraceCheckUtils]: 24: Hoare triple {18306#(< ~counter~0 97)} assume !!(main_#t~post9 < 100);havoc main_#t~post9; {18306#(< ~counter~0 97)} is VALID [2021-09-13 14:22:00,121 INFO L281 TraceCheckUtils]: 23: Hoare triple {18316#(< ~counter~0 96)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {18306#(< ~counter~0 97)} is VALID [2021-09-13 14:22:00,126 INFO L281 TraceCheckUtils]: 22: Hoare triple {18316#(< ~counter~0 96)} 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; {18316#(< ~counter~0 96)} is VALID [2021-09-13 14:22:00,127 INFO L281 TraceCheckUtils]: 21: Hoare triple {18316#(< ~counter~0 96)} assume !(main_~c~0 >= main_~b~0); {18316#(< ~counter~0 96)} is VALID [2021-09-13 14:22:00,127 INFO L281 TraceCheckUtils]: 20: Hoare triple {18316#(< ~counter~0 96)} assume !(0 == __VERIFIER_assert_~cond); {18316#(< ~counter~0 96)} is VALID [2021-09-13 14:22:00,128 INFO L281 TraceCheckUtils]: 19: Hoare triple {18316#(< ~counter~0 96)} __VERIFIER_assert_#in~cond := (if 0 == main_~q~0 * main_~xy~0 + main_~s~0 * main_~yy~0 - main_~q~0 * main_~x~0 - main_~b~0 * main_~y~0 - main_~s~0 * main_~y~0 + main_~b~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {18316#(< ~counter~0 96)} is VALID [2021-09-13 14:22:00,128 INFO L281 TraceCheckUtils]: 18: Hoare triple {18316#(< ~counter~0 96)} assume !(0 == __VERIFIER_assert_~cond); {18316#(< ~counter~0 96)} is VALID [2021-09-13 14:22:00,129 INFO L281 TraceCheckUtils]: 17: Hoare triple {18316#(< ~counter~0 96)} __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; {18316#(< ~counter~0 96)} is VALID [2021-09-13 14:22:00,129 INFO L281 TraceCheckUtils]: 16: Hoare triple {18316#(< ~counter~0 96)} assume !(0 == __VERIFIER_assert_~cond); {18316#(< ~counter~0 96)} is VALID [2021-09-13 14:22:00,129 INFO L281 TraceCheckUtils]: 15: Hoare triple {18316#(< ~counter~0 96)} __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; {18316#(< ~counter~0 96)} is VALID [2021-09-13 14:22:00,130 INFO L281 TraceCheckUtils]: 14: Hoare triple {18316#(< ~counter~0 96)} assume !(0 == __VERIFIER_assert_~cond); {18316#(< ~counter~0 96)} is VALID [2021-09-13 14:22:00,130 INFO L281 TraceCheckUtils]: 13: Hoare triple {18316#(< ~counter~0 96)} assume !!(main_#t~post10 < 100);havoc main_#t~post10;__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; {18316#(< ~counter~0 96)} is VALID [2021-09-13 14:22:00,131 INFO L281 TraceCheckUtils]: 12: Hoare triple {18350#(< ~counter~0 95)} main_#t~post10 := ~counter~0;~counter~0 := 1 + main_#t~post10; {18316#(< ~counter~0 96)} is VALID [2021-09-13 14:22:00,132 INFO L281 TraceCheckUtils]: 11: Hoare triple {18350#(< ~counter~0 95)} assume !!(0 != main_~b~0);main_~c~0 := main_~a~0;main_~k~0 := 0; {18350#(< ~counter~0 95)} is VALID [2021-09-13 14:22:00,132 INFO L281 TraceCheckUtils]: 10: Hoare triple {18350#(< ~counter~0 95)} assume !!(main_#t~post9 < 100);havoc main_#t~post9; {18350#(< ~counter~0 95)} is VALID [2021-09-13 14:22:00,133 INFO L281 TraceCheckUtils]: 9: Hoare triple {18360#(< ~counter~0 94)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {18350#(< ~counter~0 95)} is VALID [2021-09-13 14:22:00,133 INFO L281 TraceCheckUtils]: 8: Hoare triple {18360#(< ~counter~0 94)} assume !(0 == assume_abort_if_not_~cond); {18360#(< ~counter~0 94)} is VALID [2021-09-13 14:22:00,134 INFO L281 TraceCheckUtils]: 7: Hoare triple {18360#(< ~counter~0 94)} assume_abort_if_not_#in~cond := (if main_~yy~0 < 2147483647 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {18360#(< ~counter~0 94)} is VALID [2021-09-13 14:22:00,134 INFO L281 TraceCheckUtils]: 6: Hoare triple {18360#(< ~counter~0 94)} assume !(0 == assume_abort_if_not_~cond); {18360#(< ~counter~0 94)} is VALID [2021-09-13 14:22:00,135 INFO L281 TraceCheckUtils]: 5: Hoare triple {18360#(< ~counter~0 94)} 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;main_~c~0 := 0;main_~k~0 := 0;main_~xy~0 := main_~x~0 * main_~y~0;main_~yy~0 := main_~y~0 * main_~y~0;assume_abort_if_not_#in~cond := (if main_~xy~0 < 2147483647 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {18360#(< ~counter~0 94)} is VALID [2021-09-13 14:22:00,135 INFO L281 TraceCheckUtils]: 4: Hoare triple {18360#(< ~counter~0 94)} assume !(0 == assume_abort_if_not_~cond); {18360#(< ~counter~0 94)} is VALID [2021-09-13 14:22:00,135 INFO L281 TraceCheckUtils]: 3: Hoare triple {18360#(< ~counter~0 94)} 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; {18360#(< ~counter~0 94)} is VALID [2021-09-13 14:22:00,136 INFO L281 TraceCheckUtils]: 2: Hoare triple {18360#(< ~counter~0 94)} assume !(0 == assume_abort_if_not_~cond); {18360#(< ~counter~0 94)} is VALID [2021-09-13 14:22:00,136 INFO L281 TraceCheckUtils]: 1: Hoare triple {18360#(< ~counter~0 94)} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~post10, main_~temp~0, main_#t~post9, main_~x~0, main_~y~0, main_~a~0, main_~b~0, main_~p~0, main_~q~0, main_~r~0, main_~s~0, main_~c~0, main_~k~0, main_~xy~0, main_~yy~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;havoc main_~c~0;havoc main_~k~0;havoc main_~xy~0;havoc main_~yy~0;assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647;main_~x~0 := main_#t~nondet7;havoc main_#t~nondet7;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_~x~0 >= 1 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {18360#(< ~counter~0 94)} is VALID [2021-09-13 14:22:00,137 INFO L281 TraceCheckUtils]: 0: Hoare triple {18025#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);~counter~0 := 0; {18360#(< ~counter~0 94)} is VALID [2021-09-13 14:22:00,137 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 8 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:22:00,137 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:22:00,138 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097513622] [2021-09-13 14:22:00,138 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-09-13 14:22:00,138 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1507364215] [2021-09-13 14:22:00,138 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1507364215] provided 0 perfect and 2 imperfect interpolant sequences [2021-09-13 14:22:00,138 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-09-13 14:22:00,138 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2021-09-13 14:22:00,138 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461015472] [2021-09-13 14:22:00,139 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 6.111111111111111) internal successors, (110), 17 states have internal predecessors, (110), 0 states have call successors, (0), 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 58 [2021-09-13 14:22:00,139 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:22:00,139 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 6.111111111111111) internal successors, (110), 17 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:22:00,241 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:22:00,241 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-09-13 14:22:00,241 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:22:00,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-09-13 14:22:00,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2021-09-13 14:22:00,242 INFO L87 Difference]: Start difference. First operand 424 states and 523 transitions. Second operand has 18 states, 18 states have (on average 6.111111111111111) internal successors, (110), 17 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:22:06,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:22:06,432 INFO L93 Difference]: Finished difference Result 1375 states and 1685 transitions. [2021-09-13 14:22:06,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-09-13 14:22:06,432 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 6.111111111111111) internal successors, (110), 17 states have internal predecessors, (110), 0 states have call successors, (0), 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 58 [2021-09-13 14:22:06,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:22:06,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 6.111111111111111) internal successors, (110), 17 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:22:06,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 325 transitions. [2021-09-13 14:22:06,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 6.111111111111111) internal successors, (110), 17 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:22:06,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 325 transitions. [2021-09-13 14:22:06,435 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 29 states and 325 transitions. [2021-09-13 14:22:06,703 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 325 edges. 325 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:22:06,763 INFO L225 Difference]: With dead ends: 1375 [2021-09-13 14:22:06,764 INFO L226 Difference]: Without dead ends: 1069 [2021-09-13 14:22:06,764 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 207.95ms TimeCoverageRelationStatistics Valid=311, Invalid=559, Unknown=0, NotChecked=0, Total=870 [2021-09-13 14:22:06,765 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 443 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 372 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 356.95ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 443 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 449 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.42ms SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 359.95ms IncrementalHoareTripleChecker+Time [2021-09-13 14:22:06,765 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [443 Valid, 0 Invalid, 449 Unknown, 0 Unchecked, 3.42ms Time], IncrementalHoareTripleChecker [77 Valid, 372 Invalid, 0 Unknown, 0 Unchecked, 359.95ms Time] [2021-09-13 14:22:06,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1069 states. [2021-09-13 14:22:11,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1069 to 967. [2021-09-13 14:22:11,823 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:22:11,824 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1069 states. Second operand has 967 states, 962 states have (on average 1.183991683991684) internal successors, (1139), 966 states have internal predecessors, (1139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:22:11,825 INFO L74 IsIncluded]: Start isIncluded. First operand 1069 states. Second operand has 967 states, 962 states have (on average 1.183991683991684) internal successors, (1139), 966 states have internal predecessors, (1139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:22:11,825 INFO L87 Difference]: Start difference. First operand 1069 states. Second operand has 967 states, 962 states have (on average 1.183991683991684) internal successors, (1139), 966 states have internal predecessors, (1139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:22:11,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:22:11,861 INFO L93 Difference]: Finished difference Result 1069 states and 1232 transitions. [2021-09-13 14:22:11,861 INFO L276 IsEmpty]: Start isEmpty. Operand 1069 states and 1232 transitions. [2021-09-13 14:22:11,863 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:22:11,863 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:22:11,864 INFO L74 IsIncluded]: Start isIncluded. First operand has 967 states, 962 states have (on average 1.183991683991684) internal successors, (1139), 966 states have internal predecessors, (1139), 0 states have call successors, (0), 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 1069 states. [2021-09-13 14:22:11,865 INFO L87 Difference]: Start difference. First operand has 967 states, 962 states have (on average 1.183991683991684) internal successors, (1139), 966 states have internal predecessors, (1139), 0 states have call successors, (0), 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 1069 states. [2021-09-13 14:22:11,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:22:11,899 INFO L93 Difference]: Finished difference Result 1069 states and 1232 transitions. [2021-09-13 14:22:11,900 INFO L276 IsEmpty]: Start isEmpty. Operand 1069 states and 1232 transitions. [2021-09-13 14:22:11,901 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:22:11,901 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:22:11,901 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:22:11,901 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:22:11,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 967 states, 962 states have (on average 1.183991683991684) internal successors, (1139), 966 states have internal predecessors, (1139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:22:11,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 967 states to 967 states and 1139 transitions. [2021-09-13 14:22:11,936 INFO L78 Accepts]: Start accepts. Automaton has 967 states and 1139 transitions. Word has length 58 [2021-09-13 14:22:11,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:22:11,936 INFO L470 AbstractCegarLoop]: Abstraction has 967 states and 1139 transitions. [2021-09-13 14:22:11,937 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 6.111111111111111) internal successors, (110), 17 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:22:11,937 INFO L276 IsEmpty]: Start isEmpty. Operand 967 states and 1139 transitions. [2021-09-13 14:22:11,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-09-13 14:22:11,937 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:22:11,937 INFO L513 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 14:22:11,954 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2021-09-13 14:22:12,138 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-09-13 14:22:12,138 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-09-13 14:22:12,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:22:12,139 INFO L82 PathProgramCache]: Analyzing trace with hash -314259850, now seen corresponding path program 1 times [2021-09-13 14:22:12,139 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:22:12,139 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806911903] [2021-09-13 14:22:12,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:22:12,139 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:22:12,145 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-09-13 14:22:12,145 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [184662273] [2021-09-13 14:22:12,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:22:12,146 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:22:12,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:22:12,150 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-09-13 14:22:12,160 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2021-09-13 14:22:12,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:22:12,212 INFO L263 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 82 conjunts are in the unsatisfiable core [2021-09-13 14:22:12,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:22:12,234 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:22:39,833 INFO L281 TraceCheckUtils]: 0: Hoare triple {23878#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);~counter~0 := 0; {23878#true} is VALID [2021-09-13 14:22:39,833 INFO L281 TraceCheckUtils]: 1: Hoare triple {23878#true} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~post10, main_~temp~0, main_#t~post9, main_~x~0, main_~y~0, main_~a~0, main_~b~0, main_~p~0, main_~q~0, main_~r~0, main_~s~0, main_~c~0, main_~k~0, main_~xy~0, main_~yy~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;havoc main_~c~0;havoc main_~k~0;havoc main_~xy~0;havoc main_~yy~0;assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647;main_~x~0 := main_#t~nondet7;havoc main_#t~nondet7;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_~x~0 >= 1 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {23878#true} is VALID [2021-09-13 14:22:39,833 INFO L281 TraceCheckUtils]: 2: Hoare triple {23878#true} assume !(0 == assume_abort_if_not_~cond); {23878#true} is VALID [2021-09-13 14:22:39,833 INFO L281 TraceCheckUtils]: 3: Hoare triple {23878#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; {23878#true} is VALID [2021-09-13 14:22:39,833 INFO L281 TraceCheckUtils]: 4: Hoare triple {23878#true} assume !(0 == assume_abort_if_not_~cond); {23878#true} is VALID [2021-09-13 14:22:39,834 INFO L281 TraceCheckUtils]: 5: Hoare triple {23878#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;main_~c~0 := 0;main_~k~0 := 0;main_~xy~0 := main_~x~0 * main_~y~0;main_~yy~0 := main_~y~0 * main_~y~0;assume_abort_if_not_#in~cond := (if main_~xy~0 < 2147483647 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {23898#(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:22:39,834 INFO L281 TraceCheckUtils]: 6: Hoare triple {23898#(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 == assume_abort_if_not_~cond); {23898#(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:22:39,835 INFO L281 TraceCheckUtils]: 7: Hoare triple {23898#(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_abort_if_not_#in~cond := (if main_~yy~0 < 2147483647 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {23898#(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:22:39,835 INFO L281 TraceCheckUtils]: 8: Hoare triple {23898#(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 == assume_abort_if_not_~cond); {23898#(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:22:39,836 INFO L281 TraceCheckUtils]: 9: Hoare triple {23898#(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))} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {23898#(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:22:39,836 INFO L281 TraceCheckUtils]: 10: Hoare triple {23898#(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 !!(main_#t~post9 < 100);havoc main_#t~post9; {23898#(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:22:39,837 INFO L281 TraceCheckUtils]: 11: Hoare triple {23898#(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);main_~c~0 := main_~a~0;main_~k~0 := 0; {23917#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:22:39,837 INFO L281 TraceCheckUtils]: 12: Hoare triple {23917#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} main_#t~post10 := ~counter~0;~counter~0 := 1 + main_#t~post10; {23917#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:22:39,838 INFO L281 TraceCheckUtils]: 13: Hoare triple {23917#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} assume !!(main_#t~post10 < 100);havoc main_#t~post10;__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; {23917#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:22:39,839 INFO L281 TraceCheckUtils]: 14: Hoare triple {23917#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} assume !(0 == __VERIFIER_assert_~cond); {23917#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:22:39,840 INFO L281 TraceCheckUtils]: 15: Hoare triple {23917#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} __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; {23930#(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_~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:22:39,840 INFO L281 TraceCheckUtils]: 16: Hoare triple {23930#(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_~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 == __VERIFIER_assert_~cond); {23934#(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:22:39,841 INFO L281 TraceCheckUtils]: 17: Hoare triple {23934#(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))} __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; {23930#(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_~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:22:39,841 INFO L281 TraceCheckUtils]: 18: Hoare triple {23930#(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_~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 == __VERIFIER_assert_~cond); {23934#(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:22:39,842 INFO L281 TraceCheckUtils]: 19: Hoare triple {23934#(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))} __VERIFIER_assert_#in~cond := (if 0 == main_~q~0 * main_~xy~0 + main_~s~0 * main_~yy~0 - main_~q~0 * main_~x~0 - main_~b~0 * main_~y~0 - main_~s~0 * main_~y~0 + main_~b~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {23934#(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:22:39,843 INFO L281 TraceCheckUtils]: 20: Hoare triple {23934#(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 !(0 == __VERIFIER_assert_~cond); {23934#(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:22:39,843 INFO L281 TraceCheckUtils]: 21: Hoare triple {23934#(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); {23934#(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:22:39,844 INFO L281 TraceCheckUtils]: 22: Hoare triple {23934#(and (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} main_~a~0 := main_~b~0;main_~b~0 := main_~c~0;havoc main_~temp~0;main_~temp~0 := main_~p~0;main_~p~0 := main_~q~0;main_~q~0 := main_~temp~0 - main_~q~0 * main_~k~0;main_~temp~0 := main_~r~0;main_~r~0 := main_~s~0;main_~s~0 := main_~temp~0 - main_~s~0 * main_~k~0; {23953#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~s~0 0) (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~p~0 0) (= ULTIMATE.start_main_~r~0 1) (= ULTIMATE.start_main_~q~0 1))} is VALID [2021-09-13 14:22:39,845 INFO L281 TraceCheckUtils]: 23: Hoare triple {23953#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~s~0 0) (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~p~0 0) (= ULTIMATE.start_main_~r~0 1) (= ULTIMATE.start_main_~q~0 1))} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {23953#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~s~0 0) (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~p~0 0) (= ULTIMATE.start_main_~r~0 1) (= ULTIMATE.start_main_~q~0 1))} is VALID [2021-09-13 14:22:39,845 INFO L281 TraceCheckUtils]: 24: Hoare triple {23953#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~s~0 0) (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~p~0 0) (= ULTIMATE.start_main_~r~0 1) (= ULTIMATE.start_main_~q~0 1))} assume !!(main_#t~post9 < 100);havoc main_#t~post9; {23953#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~s~0 0) (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~p~0 0) (= ULTIMATE.start_main_~r~0 1) (= ULTIMATE.start_main_~q~0 1))} is VALID [2021-09-13 14:22:39,846 INFO L281 TraceCheckUtils]: 25: Hoare triple {23953#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~s~0 0) (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~p~0 0) (= ULTIMATE.start_main_~r~0 1) (= ULTIMATE.start_main_~q~0 1))} assume !!(0 != main_~b~0);main_~c~0 := main_~a~0;main_~k~0 := 0; {23963#(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_~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:22:39,847 INFO L281 TraceCheckUtils]: 26: Hoare triple {23963#(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_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~r~0 1) (= ULTIMATE.start_main_~q~0 1))} main_#t~post10 := ~counter~0;~counter~0 := 1 + main_#t~post10; {23963#(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_~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:22:39,847 INFO L281 TraceCheckUtils]: 27: Hoare triple {23963#(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_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~r~0 1) (= ULTIMATE.start_main_~q~0 1))} assume !!(main_#t~post10 < 100);havoc main_#t~post10;__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; {23963#(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_~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:22:39,848 INFO L281 TraceCheckUtils]: 28: Hoare triple {23963#(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_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~r~0 1) (= ULTIMATE.start_main_~q~0 1))} assume !(0 == __VERIFIER_assert_~cond); {23963#(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_~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:22:39,848 INFO L281 TraceCheckUtils]: 29: Hoare triple {23963#(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_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~r~0 1) (= ULTIMATE.start_main_~q~0 1))} __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; {23963#(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_~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:22:39,849 INFO L281 TraceCheckUtils]: 30: Hoare triple {23963#(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_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~r~0 1) (= ULTIMATE.start_main_~q~0 1))} assume !(0 == __VERIFIER_assert_~cond); {23963#(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_~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:22:39,850 INFO L281 TraceCheckUtils]: 31: Hoare triple {23963#(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_~c~0 ULTIMATE.start_main_~a~0) (= 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; {23963#(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_~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:22:39,850 INFO L281 TraceCheckUtils]: 32: Hoare triple {23963#(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_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~r~0 1) (= ULTIMATE.start_main_~q~0 1))} assume !(0 == __VERIFIER_assert_~cond); {23963#(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_~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:22:39,851 INFO L281 TraceCheckUtils]: 33: Hoare triple {23963#(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_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~r~0 1) (= ULTIMATE.start_main_~q~0 1))} __VERIFIER_assert_#in~cond := (if 0 == main_~q~0 * main_~xy~0 + main_~s~0 * main_~yy~0 - main_~q~0 * main_~x~0 - main_~b~0 * main_~y~0 - main_~s~0 * main_~y~0 + main_~b~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {23963#(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_~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:22:39,852 INFO L281 TraceCheckUtils]: 34: Hoare triple {23963#(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_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~r~0 1) (= ULTIMATE.start_main_~q~0 1))} assume !(0 == __VERIFIER_assert_~cond); {23963#(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_~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:22:39,852 INFO L281 TraceCheckUtils]: 35: Hoare triple {23963#(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_~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);main_~c~0 := main_~c~0 - main_~b~0;main_~k~0 := 1 + main_~k~0; {23994#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~a~0 (+ ULTIMATE.start_main_~c~0 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_~r~0 1) (= ULTIMATE.start_main_~q~0 1))} is VALID [2021-09-13 14:22:39,853 INFO L281 TraceCheckUtils]: 36: Hoare triple {23994#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~a~0 (+ ULTIMATE.start_main_~c~0 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_~r~0 1) (= ULTIMATE.start_main_~q~0 1))} main_#t~post10 := ~counter~0;~counter~0 := 1 + main_#t~post10; {23994#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~a~0 (+ ULTIMATE.start_main_~c~0 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_~r~0 1) (= ULTIMATE.start_main_~q~0 1))} is VALID [2021-09-13 14:22:39,854 INFO L281 TraceCheckUtils]: 37: Hoare triple {23994#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~a~0 (+ ULTIMATE.start_main_~c~0 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_~r~0 1) (= ULTIMATE.start_main_~q~0 1))} assume !!(main_#t~post10 < 100);havoc main_#t~post10;__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; {24001#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~a~0 (+ ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~b~0)) (= ULTIMATE.start_main_~s~0 0) (or (and (= 0 ULTIMATE.start___VERIFIER_assert_~cond) (not (= (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) ULTIMATE.start_main_~a~0))) (and (= (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) ULTIMATE.start_main_~a~0) (= 1 ULTIMATE.start___VERIFIER_assert_~cond))) (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~p~0 0) (= ULTIMATE.start_main_~r~0 1) (= ULTIMATE.start_main_~q~0 1))} is VALID [2021-09-13 14:22:39,855 INFO L281 TraceCheckUtils]: 38: Hoare triple {24001#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~a~0 (+ ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~b~0)) (= ULTIMATE.start_main_~s~0 0) (or (and (= 0 ULTIMATE.start___VERIFIER_assert_~cond) (not (= (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) ULTIMATE.start_main_~a~0))) (and (= (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) ULTIMATE.start_main_~a~0) (= 1 ULTIMATE.start___VERIFIER_assert_~cond))) (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~p~0 0) (= ULTIMATE.start_main_~r~0 1) (= ULTIMATE.start_main_~q~0 1))} assume !(0 == __VERIFIER_assert_~cond); {24005#(and (= (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~a~0 (+ ULTIMATE.start_main_~c~0 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_~r~0 1) (= ULTIMATE.start_main_~q~0 1))} is VALID [2021-09-13 14:22:39,856 INFO L281 TraceCheckUtils]: 39: Hoare triple {24005#(and (= (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~a~0 (+ ULTIMATE.start_main_~c~0 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_~r~0 1) (= ULTIMATE.start_main_~q~0 1))} __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; {24009#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~s~0 0) (= ULTIMATE.start_main_~p~0 0) (= ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) (= 1 ULTIMATE.start___VERIFIER_assert_~cond) (= ULTIMATE.start_main_~r~0 1) (= ULTIMATE.start_main_~q~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:22:39,857 INFO L281 TraceCheckUtils]: 40: Hoare triple {24009#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~s~0 0) (= ULTIMATE.start_main_~p~0 0) (= ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) (= 1 ULTIMATE.start___VERIFIER_assert_~cond) (= ULTIMATE.start_main_~r~0 1) (= ULTIMATE.start_main_~q~0 1) (= (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) ULTIMATE.start_main_~y~0))} assume !(0 == __VERIFIER_assert_~cond); {24013#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~s~0 0) (= ULTIMATE.start_main_~p~0 0) (= ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) (= ULTIMATE.start_main_~r~0 1) (= ULTIMATE.start_main_~q~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:22:39,858 INFO L281 TraceCheckUtils]: 41: Hoare triple {24013#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~s~0 0) (= ULTIMATE.start_main_~p~0 0) (= ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) (= ULTIMATE.start_main_~r~0 1) (= ULTIMATE.start_main_~q~0 1) (= (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~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; {24013#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~s~0 0) (= ULTIMATE.start_main_~p~0 0) (= ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) (= ULTIMATE.start_main_~r~0 1) (= ULTIMATE.start_main_~q~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:22:39,858 INFO L281 TraceCheckUtils]: 42: Hoare triple {24013#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~s~0 0) (= ULTIMATE.start_main_~p~0 0) (= ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) (= ULTIMATE.start_main_~r~0 1) (= ULTIMATE.start_main_~q~0 1) (= (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) ULTIMATE.start_main_~y~0))} assume !(0 == __VERIFIER_assert_~cond); {24013#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~s~0 0) (= ULTIMATE.start_main_~p~0 0) (= ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) (= ULTIMATE.start_main_~r~0 1) (= ULTIMATE.start_main_~q~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:22:39,859 INFO L281 TraceCheckUtils]: 43: Hoare triple {24013#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~s~0 0) (= ULTIMATE.start_main_~p~0 0) (= ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) (= ULTIMATE.start_main_~r~0 1) (= ULTIMATE.start_main_~q~0 1) (= (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) ULTIMATE.start_main_~y~0))} __VERIFIER_assert_#in~cond := (if 0 == main_~q~0 * main_~xy~0 + main_~s~0 * main_~yy~0 - main_~q~0 * main_~x~0 - main_~b~0 * main_~y~0 - main_~s~0 * main_~y~0 + main_~b~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {24013#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~s~0 0) (= ULTIMATE.start_main_~p~0 0) (= ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) (= ULTIMATE.start_main_~r~0 1) (= ULTIMATE.start_main_~q~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:22:39,860 INFO L281 TraceCheckUtils]: 44: Hoare triple {24013#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~s~0 0) (= ULTIMATE.start_main_~p~0 0) (= ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) (= ULTIMATE.start_main_~r~0 1) (= ULTIMATE.start_main_~q~0 1) (= (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) ULTIMATE.start_main_~y~0))} assume !(0 == __VERIFIER_assert_~cond); {24013#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~s~0 0) (= ULTIMATE.start_main_~p~0 0) (= ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) (= ULTIMATE.start_main_~r~0 1) (= ULTIMATE.start_main_~q~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:22:39,860 INFO L281 TraceCheckUtils]: 45: Hoare triple {24013#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~s~0 0) (= ULTIMATE.start_main_~p~0 0) (= ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) (= ULTIMATE.start_main_~r~0 1) (= ULTIMATE.start_main_~q~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); {24013#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~s~0 0) (= ULTIMATE.start_main_~p~0 0) (= ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) (= ULTIMATE.start_main_~r~0 1) (= ULTIMATE.start_main_~q~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:22:39,863 INFO L281 TraceCheckUtils]: 46: Hoare triple {24013#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~s~0 0) (= ULTIMATE.start_main_~p~0 0) (= ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) (= ULTIMATE.start_main_~r~0 1) (= ULTIMATE.start_main_~q~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; {24032#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (or (and (= ULTIMATE.start_main_~y~0 (+ ULTIMATE.start_main_~b~0 (* (div ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~x~0))) (= (+ ULTIMATE.start_main_~s~0 (* (div ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~r~0)) 1) (= (+ ULTIMATE.start_main_~q~0 (* (div ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~p~0)) 0)) (= ULTIMATE.start_main_~x~0 0)) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~r~0 0))} is VALID [2021-09-13 14:22:39,864 INFO L281 TraceCheckUtils]: 47: Hoare triple {24032#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (or (and (= ULTIMATE.start_main_~y~0 (+ ULTIMATE.start_main_~b~0 (* (div ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~x~0))) (= (+ ULTIMATE.start_main_~s~0 (* (div ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~r~0)) 1) (= (+ ULTIMATE.start_main_~q~0 (* (div ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~p~0)) 0)) (= ULTIMATE.start_main_~x~0 0)) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~r~0 0))} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {24032#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (or (and (= ULTIMATE.start_main_~y~0 (+ ULTIMATE.start_main_~b~0 (* (div ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~x~0))) (= (+ ULTIMATE.start_main_~s~0 (* (div ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~r~0)) 1) (= (+ ULTIMATE.start_main_~q~0 (* (div ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~p~0)) 0)) (= ULTIMATE.start_main_~x~0 0)) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~r~0 0))} is VALID [2021-09-13 14:22:39,865 INFO L281 TraceCheckUtils]: 48: Hoare triple {24032#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (or (and (= ULTIMATE.start_main_~y~0 (+ ULTIMATE.start_main_~b~0 (* (div ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~x~0))) (= (+ ULTIMATE.start_main_~s~0 (* (div ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~r~0)) 1) (= (+ ULTIMATE.start_main_~q~0 (* (div ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~p~0)) 0)) (= ULTIMATE.start_main_~x~0 0)) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~r~0 0))} assume !!(main_#t~post9 < 100);havoc main_#t~post9; {24032#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (or (and (= ULTIMATE.start_main_~y~0 (+ ULTIMATE.start_main_~b~0 (* (div ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~x~0))) (= (+ ULTIMATE.start_main_~s~0 (* (div ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~r~0)) 1) (= (+ ULTIMATE.start_main_~q~0 (* (div ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~p~0)) 0)) (= ULTIMATE.start_main_~x~0 0)) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~r~0 0))} is VALID [2021-09-13 14:22:39,866 INFO L281 TraceCheckUtils]: 49: Hoare triple {24032#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (or (and (= ULTIMATE.start_main_~y~0 (+ ULTIMATE.start_main_~b~0 (* (div ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~x~0))) (= (+ ULTIMATE.start_main_~s~0 (* (div ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~r~0)) 1) (= (+ ULTIMATE.start_main_~q~0 (* (div ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~p~0)) 0)) (= ULTIMATE.start_main_~x~0 0)) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~r~0 0))} assume !!(0 != main_~b~0);main_~c~0 := main_~a~0;main_~k~0 := 0; {24032#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (or (and (= ULTIMATE.start_main_~y~0 (+ ULTIMATE.start_main_~b~0 (* (div ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~x~0))) (= (+ ULTIMATE.start_main_~s~0 (* (div ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~r~0)) 1) (= (+ ULTIMATE.start_main_~q~0 (* (div ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~p~0)) 0)) (= ULTIMATE.start_main_~x~0 0)) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~r~0 0))} is VALID [2021-09-13 14:22:39,867 INFO L281 TraceCheckUtils]: 50: Hoare triple {24032#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (or (and (= ULTIMATE.start_main_~y~0 (+ ULTIMATE.start_main_~b~0 (* (div ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~x~0))) (= (+ ULTIMATE.start_main_~s~0 (* (div ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~r~0)) 1) (= (+ ULTIMATE.start_main_~q~0 (* (div ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~p~0)) 0)) (= ULTIMATE.start_main_~x~0 0)) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~r~0 0))} main_#t~post10 := ~counter~0;~counter~0 := 1 + main_#t~post10; {24032#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (or (and (= ULTIMATE.start_main_~y~0 (+ ULTIMATE.start_main_~b~0 (* (div ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~x~0))) (= (+ ULTIMATE.start_main_~s~0 (* (div ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~r~0)) 1) (= (+ ULTIMATE.start_main_~q~0 (* (div ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~p~0)) 0)) (= ULTIMATE.start_main_~x~0 0)) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~r~0 0))} is VALID [2021-09-13 14:22:39,867 INFO L281 TraceCheckUtils]: 51: Hoare triple {24032#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (or (and (= ULTIMATE.start_main_~y~0 (+ ULTIMATE.start_main_~b~0 (* (div ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~x~0))) (= (+ ULTIMATE.start_main_~s~0 (* (div ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~r~0)) 1) (= (+ ULTIMATE.start_main_~q~0 (* (div ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~p~0)) 0)) (= ULTIMATE.start_main_~x~0 0)) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~r~0 0))} assume !!(main_#t~post10 < 100);havoc main_#t~post10;__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; {24032#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (or (and (= ULTIMATE.start_main_~y~0 (+ ULTIMATE.start_main_~b~0 (* (div ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~x~0))) (= (+ ULTIMATE.start_main_~s~0 (* (div ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~r~0)) 1) (= (+ ULTIMATE.start_main_~q~0 (* (div ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~p~0)) 0)) (= ULTIMATE.start_main_~x~0 0)) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~r~0 0))} is VALID [2021-09-13 14:22:39,868 INFO L281 TraceCheckUtils]: 52: Hoare triple {24032#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (or (and (= ULTIMATE.start_main_~y~0 (+ ULTIMATE.start_main_~b~0 (* (div ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~x~0))) (= (+ ULTIMATE.start_main_~s~0 (* (div ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~r~0)) 1) (= (+ ULTIMATE.start_main_~q~0 (* (div ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~p~0)) 0)) (= ULTIMATE.start_main_~x~0 0)) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~r~0 0))} assume !(0 == __VERIFIER_assert_~cond); {24032#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (or (and (= ULTIMATE.start_main_~y~0 (+ ULTIMATE.start_main_~b~0 (* (div ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~x~0))) (= (+ ULTIMATE.start_main_~s~0 (* (div ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~r~0)) 1) (= (+ ULTIMATE.start_main_~q~0 (* (div ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~p~0)) 0)) (= ULTIMATE.start_main_~x~0 0)) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~r~0 0))} is VALID [2021-09-13 14:22:39,870 INFO L281 TraceCheckUtils]: 53: Hoare triple {24032#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (or (and (= ULTIMATE.start_main_~y~0 (+ ULTIMATE.start_main_~b~0 (* (div ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~x~0))) (= (+ ULTIMATE.start_main_~s~0 (* (div ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~r~0)) 1) (= (+ ULTIMATE.start_main_~q~0 (* (div ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~p~0)) 0)) (= ULTIMATE.start_main_~x~0 0)) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~r~0 0))} __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; {24054#(and (or (= ULTIMATE.start_main_~x~0 0) (and (= ULTIMATE.start_main_~y~0 (+ ULTIMATE.start_main_~b~0 (* (div ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~x~0))) (= ULTIMATE.start_main_~s~0 1) (= (+ (div ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~q~0) 0))) (= 1 ULTIMATE.start___VERIFIER_assert_~cond))} is VALID [2021-09-13 14:22:39,871 INFO L281 TraceCheckUtils]: 54: Hoare triple {24054#(and (or (= ULTIMATE.start_main_~x~0 0) (and (= ULTIMATE.start_main_~y~0 (+ ULTIMATE.start_main_~b~0 (* (div ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~x~0))) (= ULTIMATE.start_main_~s~0 1) (= (+ (div ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~q~0) 0))) (= 1 ULTIMATE.start___VERIFIER_assert_~cond))} assume !(0 == __VERIFIER_assert_~cond); {24058#(or (= ULTIMATE.start_main_~x~0 0) (and (= ULTIMATE.start_main_~y~0 (+ ULTIMATE.start_main_~b~0 (* (div ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~x~0))) (= ULTIMATE.start_main_~s~0 1) (= (+ (div ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~q~0) 0)))} is VALID [2021-09-13 14:22:39,872 INFO L281 TraceCheckUtils]: 55: Hoare triple {24058#(or (= ULTIMATE.start_main_~x~0 0) (and (= ULTIMATE.start_main_~y~0 (+ ULTIMATE.start_main_~b~0 (* (div ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~x~0))) (= ULTIMATE.start_main_~s~0 1) (= (+ (div ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~q~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; {24062#(<= 0 ULTIMATE.start___VERIFIER_assert_~cond)} is VALID [2021-09-13 14:22:39,872 INFO L281 TraceCheckUtils]: 56: Hoare triple {24062#(<= 0 ULTIMATE.start___VERIFIER_assert_~cond)} assume 0 == __VERIFIER_assert_~cond; {23878#true} is VALID [2021-09-13 14:22:39,872 INFO L281 TraceCheckUtils]: 57: Hoare triple {23878#true} assume !false; {23879#false} is INVALID [2021-09-13 14:22:39,873 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:22:39,873 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806911903] [2021-09-13 14:22:39,873 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-09-13 14:22:39,873 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [184662273] [2021-09-13 14:22:39,873 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: invalid Hoare triple in FP [2021-09-13 14:22:39,873 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 0 imperfect interpolant sequences. [2021-09-13 14:22:39,874 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [] total 0 [2021-09-13 14:22:39,874 ERROR L172 FreeRefinementEngine]: Strategy CAMEL failed to provide any proof altough trace is infeasible [2021-09-13 14:22:39,874 INFO L627 BasicCegarLoop]: Counterexample might be feasible [2021-09-13 14:22:39,878 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2021-09-13 14:22:39,879 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2021-09-13 14:22:39,879 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (3 of 6 remaining) [2021-09-13 14:22:39,880 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2021-09-13 14:22:39,880 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2021-09-13 14:22:39,884 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2021-09-13 14:22:39,908 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2021-09-13 14:22:40,108 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:22:40,112 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-09-13 14:22:40,143 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2021-09-13 14:22:40,143 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2021-09-13 14:22:40,143 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2021-09-13 14:22:40,143 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2021-09-13 14:22:40,143 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2021-09-13 14:22:40,143 WARN L170 areAnnotationChecker]: L8-2 has no Hoare annotation [2021-09-13 14:22:40,143 WARN L170 areAnnotationChecker]: L8-2 has no Hoare annotation [2021-09-13 14:22:40,143 WARN L170 areAnnotationChecker]: L7-1 has no Hoare annotation [2021-09-13 14:22:40,143 WARN L170 areAnnotationChecker]: L8-4 has no Hoare annotation [2021-09-13 14:22:40,143 WARN L170 areAnnotationChecker]: L8-4 has no Hoare annotation [2021-09-13 14:22:40,143 WARN L170 areAnnotationChecker]: L7-2 has no Hoare annotation [2021-09-13 14:22:40,143 WARN L170 areAnnotationChecker]: L8-6 has no Hoare annotation [2021-09-13 14:22:40,143 WARN L170 areAnnotationChecker]: L8-6 has no Hoare annotation [2021-09-13 14:22:40,143 WARN L170 areAnnotationChecker]: L40-2 has no Hoare annotation [2021-09-13 14:22:40,143 WARN L170 areAnnotationChecker]: L40-2 has no Hoare annotation [2021-09-13 14:22:40,143 WARN L170 areAnnotationChecker]: L40-3 has no Hoare annotation [2021-09-13 14:22:40,143 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2021-09-13 14:22:40,144 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2021-09-13 14:22:40,144 WARN L170 areAnnotationChecker]: L11-12 has no Hoare annotation [2021-09-13 14:22:40,144 WARN L170 areAnnotationChecker]: L11-12 has no Hoare annotation [2021-09-13 14:22:40,144 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2021-09-13 14:22:40,144 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2021-09-13 14:22:40,144 WARN L170 areAnnotationChecker]: L12-4 has no Hoare annotation [2021-09-13 14:22:40,144 WARN L170 areAnnotationChecker]: L12-4 has no Hoare annotation [2021-09-13 14:22:40,144 WARN L170 areAnnotationChecker]: L11-14 has no Hoare annotation [2021-09-13 14:22:40,144 WARN L170 areAnnotationChecker]: L46-3 has no Hoare annotation [2021-09-13 14:22:40,144 WARN L170 areAnnotationChecker]: L46-3 has no Hoare annotation [2021-09-13 14:22:40,144 WARN L170 areAnnotationChecker]: L11-15 has no Hoare annotation [2021-09-13 14:22:40,144 WARN L170 areAnnotationChecker]: L11-15 has no Hoare annotation [2021-09-13 14:22:40,144 WARN L170 areAnnotationChecker]: L46-4 has no Hoare annotation [2021-09-13 14:22:40,144 WARN L170 areAnnotationChecker]: L46-1 has no Hoare annotation [2021-09-13 14:22:40,144 WARN L170 areAnnotationChecker]: L46-1 has no Hoare annotation [2021-09-13 14:22:40,144 WARN L170 areAnnotationChecker]: L12-5 has no Hoare annotation [2021-09-13 14:22:40,144 WARN L170 areAnnotationChecker]: L12-5 has no Hoare annotation [2021-09-13 14:22:40,144 WARN L170 areAnnotationChecker]: L11-17 has no Hoare annotation [2021-09-13 14:22:40,145 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2021-09-13 14:22:40,145 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2021-09-13 14:22:40,145 WARN L170 areAnnotationChecker]: L72 has no Hoare annotation [2021-09-13 14:22:40,145 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2021-09-13 14:22:40,145 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2021-09-13 14:22:40,145 WARN L170 areAnnotationChecker]: L11-2 has no Hoare annotation [2021-09-13 14:22:40,145 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2021-09-13 14:22:40,145 WARN L170 areAnnotationChecker]: L11-3 has no Hoare annotation [2021-09-13 14:22:40,145 WARN L170 areAnnotationChecker]: L11-3 has no Hoare annotation [2021-09-13 14:22:40,145 WARN L170 areAnnotationChecker]: L12-1 has no Hoare annotation [2021-09-13 14:22:40,146 WARN L170 areAnnotationChecker]: L12-1 has no Hoare annotation [2021-09-13 14:22:40,146 WARN L170 areAnnotationChecker]: L11-5 has no Hoare annotation [2021-09-13 14:22:40,146 WARN L170 areAnnotationChecker]: L11-6 has no Hoare annotation [2021-09-13 14:22:40,146 WARN L170 areAnnotationChecker]: L11-6 has no Hoare annotation [2021-09-13 14:22:40,146 WARN L170 areAnnotationChecker]: L12-2 has no Hoare annotation [2021-09-13 14:22:40,146 WARN L170 areAnnotationChecker]: L12-2 has no Hoare annotation [2021-09-13 14:22:40,146 WARN L170 areAnnotationChecker]: L11-8 has no Hoare annotation [2021-09-13 14:22:40,146 WARN L170 areAnnotationChecker]: L11-9 has no Hoare annotation [2021-09-13 14:22:40,146 WARN L170 areAnnotationChecker]: L11-9 has no Hoare annotation [2021-09-13 14:22:40,147 WARN L170 areAnnotationChecker]: L12-3 has no Hoare annotation [2021-09-13 14:22:40,147 WARN L170 areAnnotationChecker]: L12-3 has no Hoare annotation [2021-09-13 14:22:40,147 WARN L170 areAnnotationChecker]: L11-11 has no Hoare annotation [2021-09-13 14:22:40,147 WARN L170 areAnnotationChecker]: L11-11 has no Hoare annotation [2021-09-13 14:22:40,147 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:22:40,148 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.09 02:22:40 BoogieIcfgContainer [2021-09-13 14:22:40,148 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-09-13 14:22:40,148 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-09-13 14:22:40,149 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-09-13 14:22:40,149 INFO L275 PluginConnector]: Witness Printer initialized [2021-09-13 14:22:40,149 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 02:17:50" (3/4) ... [2021-09-13 14:22:40,152 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-09-13 14:22:40,152 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-09-13 14:22:40,153 INFO L158 Benchmark]: Toolchain (without parser) took 290853.61ms. Allocated memory was 54.5MB in the beginning and 98.6MB in the end (delta: 44.0MB). Free memory was 31.8MB in the beginning and 65.5MB in the end (delta: -33.7MB). Peak memory consumption was 8.7MB. Max. memory is 16.1GB. [2021-09-13 14:22:40,153 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 54.5MB. Free memory was 37.1MB in the beginning and 37.1MB in the end (delta: 38.2kB). There was no memory consumed. Max. memory is 16.1GB. [2021-09-13 14:22:40,153 INFO L158 Benchmark]: CACSL2BoogieTranslator took 286.70ms. Allocated memory was 54.5MB in the beginning and 67.1MB in the end (delta: 12.6MB). Free memory was 31.6MB in the beginning and 49.9MB in the end (delta: -18.3MB). Peak memory consumption was 7.2MB. Max. memory is 16.1GB. [2021-09-13 14:22:40,153 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.65ms. Allocated memory is still 67.1MB. Free memory was 49.9MB in the beginning and 47.8MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2021-09-13 14:22:40,154 INFO L158 Benchmark]: Boogie Preprocessor took 19.67ms. Allocated memory is still 67.1MB. Free memory was 47.8MB in the beginning and 46.4MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-09-13 14:22:40,154 INFO L158 Benchmark]: RCFGBuilder took 383.52ms. Allocated memory is still 67.1MB. Free memory was 46.4MB in the beginning and 50.1MB in the end (delta: -3.7MB). Peak memory consumption was 16.4MB. Max. memory is 16.1GB. [2021-09-13 14:22:40,154 INFO L158 Benchmark]: TraceAbstraction took 290100.01ms. Allocated memory was 67.1MB in the beginning and 98.6MB in the end (delta: 31.5MB). Free memory was 49.4MB in the beginning and 65.5MB in the end (delta: -16.1MB). Peak memory consumption was 60.7MB. Max. memory is 16.1GB. [2021-09-13 14:22:40,154 INFO L158 Benchmark]: Witness Printer took 3.39ms. Allocated memory is still 98.6MB. Free memory is still 65.5MB. There was no memory consumed. Max. memory is 16.1GB. [2021-09-13 14:22:40,155 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 54.5MB. Free memory was 37.1MB in the beginning and 37.1MB in the end (delta: 38.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 286.70ms. Allocated memory was 54.5MB in the beginning and 67.1MB in the end (delta: 12.6MB). Free memory was 31.6MB in the beginning and 49.9MB in the end (delta: -18.3MB). Peak memory consumption was 7.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.65ms. Allocated memory is still 67.1MB. Free memory was 49.9MB in the beginning and 47.8MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 19.67ms. Allocated memory is still 67.1MB. Free memory was 47.8MB in the beginning and 46.4MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 383.52ms. Allocated memory is still 67.1MB. Free memory was 46.4MB in the beginning and 50.1MB in the end (delta: -3.7MB). Peak memory consumption was 16.4MB. Max. memory is 16.1GB. * TraceAbstraction took 290100.01ms. Allocated memory was 67.1MB in the beginning and 98.6MB in the end (delta: 31.5MB). Free memory was 49.4MB in the beginning and 65.5MB in the end (delta: -16.1MB). Peak memory consumption was 60.7MB. Max. memory is 16.1GB. * Witness Printer took 3.39ms. Allocated memory is still 98.6MB. Free memory is still 65.5MB. There was no memory consumed. 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: [L18] int counter = 0; [L20] int x, y; [L21] long long a, b, p, q, r, s, c, k, xy, yy; [L22] x = __VERIFIER_nondet_int() [L23] y = __VERIFIER_nondet_int() [L8] COND FALSE !(!cond) [L8] COND FALSE !(!cond) [L27] a = x [L28] b = y [L29] p = 1 [L30] q = 0 [L31] r = 0 [L32] s = 1 [L33] c = 0 [L34] k = 0 [L35] xy = (long long) x * y [L36] yy = (long long) y * y [L8] COND FALSE !(!cond) [L8] COND FALSE !(!cond) [L40] EXPR counter++ [L40] COND TRUE counter++<100 [L41] COND FALSE !(!(b != 0)) [L43] c = a [L44] k = 0 [L46] EXPR counter++ [L46] COND TRUE counter++<100 [L11] COND FALSE !(!(cond)) [L11] COND FALSE !(!(cond)) [L11] COND FALSE !(!(cond)) [L11] COND FALSE !(!(cond)) [L51] COND TRUE !(c >= b) [L57] a = b [L58] b = c [L60] long long temp; [L61] temp = p [L62] p = q [L63] q = temp - q * k [L64] temp = r [L65] r = s [L66] s = temp - s * k [L40] EXPR counter++ [L40] COND TRUE counter++<100 [L41] COND FALSE !(!(b != 0)) [L43] c = a [L44] k = 0 [L46] EXPR counter++ [L46] COND TRUE counter++<100 [L11] COND FALSE !(!(cond)) [L11] COND FALSE !(!(cond)) [L11] COND FALSE !(!(cond)) [L11] COND FALSE !(!(cond)) [L51] COND FALSE !(!(c >= b)) [L53] c = c - b [L54] k = k + 1 [L46] EXPR counter++ [L46] COND TRUE counter++<100 [L11] COND FALSE !(!(cond)) [L11] COND FALSE !(!(cond)) [L11] COND FALSE !(!(cond)) [L11] COND FALSE !(!(cond)) [L51] COND TRUE !(c >= b) [L57] a = b [L58] b = c [L60] long long temp; [L61] temp = p [L62] p = q [L63] q = temp - q * k [L64] temp = r [L65] r = s [L66] s = temp - s * k [L40] EXPR counter++ [L40] COND TRUE counter++<100 [L41] COND FALSE !(!(b != 0)) [L43] c = a [L44] k = 0 [L46] EXPR counter++ [L46] COND TRUE counter++<100 [L11] COND FALSE !(!(cond)) [L11] COND FALSE !(!(cond)) [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. - 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, 43 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 289991.61ms, OverallIterations: 19, TraceHistogramMax: 4, EmptinessCheckTime: 26.27ms, AutomataDifference: 192295.08ms, DeadEndRemovalTime: 0.00ms, HoareAnnotationTime: 0.00ms, InitialAbstractionConstructionTime: 9.43ms, PartialOrderReductionTime: 0.00ms, HoareTripleCheckerStatistics: 2 mSolverCounterUnknown, 3035 SdHoareTripleChecker+Valid, 30840.37ms IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3035 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 30780.79ms Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3006 mSDsCounter, 673 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4632 IncrementalHoareTripleChecker+Invalid, 5307 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 673 mSolverCounterUnsat, 0 mSDtfsCounter, 4632 mSolverCounterSat, 42.54ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 946 GetRequests, 657 SyntacticMatches, 7 SemanticMatches, 282 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2780 ImplicationChecksByTransitivity, 102016.92ms Time, 0.00ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=967occurred in iteration=18, InterpolantAutomatonStates: 257, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.00ms DumpTime, AutomataMinimizationStatistics: 13585.02ms AutomataMinimizationTime, 18 MinimizatonAttempts, 707 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 141.00ms SsaConstructionTime, 363.75ms SatisfiabilityAnalysisTime, 46063.15ms InterpolantComputationTime, 507 NumberOfCodeBlocks, 507 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 793 ConstructedInterpolants, 0 QuantifiedInterpolants, 7228 SizeOfPredicates, 119 NumberOfNonLiveVariables, 2486 ConjunctsInSsa, 286 ConjunctsInUnsatCore, 27 InterpolantComputations, 10 PerfectInterpolantSequences, 86/270 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:22:40,211 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... ### Bit-precise run ### This is Ultimate 0.2.1-wip.dd.seqcomp-5fbdf5b [2021-09-13 14:22:42,404 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-09-13 14:22:42,407 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-09-13 14:22:42,434 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-09-13 14:22:42,435 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-09-13 14:22:42,436 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-09-13 14:22:42,437 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-09-13 14:22:42,439 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-09-13 14:22:42,442 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-09-13 14:22:42,448 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-09-13 14:22:42,449 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-09-13 14:22:42,457 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-09-13 14:22:42,457 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-09-13 14:22:42,460 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-09-13 14:22:42,462 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-09-13 14:22:42,465 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-09-13 14:22:42,467 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-09-13 14:22:42,468 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-09-13 14:22:42,470 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-09-13 14:22:42,474 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-09-13 14:22:42,479 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-09-13 14:22:42,480 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-09-13 14:22:42,481 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-09-13 14:22:42,483 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-09-13 14:22:42,488 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-09-13 14:22:42,489 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-09-13 14:22:42,490 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-09-13 14:22:42,491 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-09-13 14:22:42,492 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-09-13 14:22:42,493 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-09-13 14:22:42,493 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-09-13 14:22:42,493 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-09-13 14:22:42,495 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-09-13 14:22:42,495 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-09-13 14:22:42,497 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-09-13 14:22:42,497 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-09-13 14:22:42,497 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-09-13 14:22:42,498 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-09-13 14:22:42,498 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-09-13 14:22:42,499 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-09-13 14:22:42,500 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-09-13 14:22:42,501 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:22:42,539 INFO L113 SettingsManager]: Loading preferences was successful [2021-09-13 14:22:42,539 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-09-13 14:22:42,540 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-09-13 14:22:42,540 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-09-13 14:22:42,542 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-09-13 14:22:42,542 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-09-13 14:22:42,542 INFO L138 SettingsManager]: * Use SBE=true [2021-09-13 14:22:42,542 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-09-13 14:22:42,543 INFO L138 SettingsManager]: * sizeof long=4 [2021-09-13 14:22:42,543 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-09-13 14:22:42,543 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-09-13 14:22:42,544 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-09-13 14:22:42,544 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-09-13 14:22:42,544 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-09-13 14:22:42,544 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-09-13 14:22:42,544 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-09-13 14:22:42,545 INFO L138 SettingsManager]: * sizeof long double=12 [2021-09-13 14:22:42,545 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-09-13 14:22:42,545 INFO L138 SettingsManager]: * Use constant arrays=true [2021-09-13 14:22:42,545 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-09-13 14:22:42,545 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-09-13 14:22:42,545 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-09-13 14:22:42,553 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-09-13 14:22:42,554 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-09-13 14:22:42,554 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-09-13 14:22:42,554 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-09-13 14:22:42,554 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-09-13 14:22:42,555 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-09-13 14:22:42,555 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-09-13 14:22:42,555 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-09-13 14:22:42,555 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-09-13 14:22:42,555 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-09-13 14:22:42,556 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 -> 73ac5e93c0fc4ad81ce4fa53fc8650626ce35cef [2021-09-13 14:22:42,858 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-09-13 14:22:42,882 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-09-13 14:22:42,885 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-09-13 14:22:42,886 INFO L271 PluginConnector]: Initializing CDTParser... [2021-09-13 14:22:42,886 INFO L275 PluginConnector]: CDTParser initialized [2021-09-13 14:22:42,889 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/egcd2-ll_unwindbound100.c [2021-09-13 14:22:42,959 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c7d06d574/a3cccbac9f63465998796686d551bf41/FLAGdbad76bb0 [2021-09-13 14:22:43,432 INFO L306 CDTParser]: Found 1 translation units. [2021-09-13 14:22:43,433 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/egcd2-ll_unwindbound100.c [2021-09-13 14:22:43,440 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c7d06d574/a3cccbac9f63465998796686d551bf41/FLAGdbad76bb0 [2021-09-13 14:22:43,458 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c7d06d574/a3cccbac9f63465998796686d551bf41 [2021-09-13 14:22:43,461 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-09-13 14:22:43,462 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-09-13 14:22:43,464 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-09-13 14:22:43,464 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-09-13 14:22:43,467 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-09-13 14:22:43,468 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.09 02:22:43" (1/1) ... [2021-09-13 14:22:43,471 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50148a82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:22:43, skipping insertion in model container [2021-09-13 14:22:43,472 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.09 02:22:43" (1/1) ... [2021-09-13 14:22:43,479 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-09-13 14:22:43,494 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-09-13 14:22:43,617 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/egcd2-ll_unwindbound100.c[490,503] [2021-09-13 14:22:43,642 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-09-13 14:22:43,651 INFO L203 MainTranslator]: Completed pre-run [2021-09-13 14:22:43,671 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/egcd2-ll_unwindbound100.c[490,503] [2021-09-13 14:22:43,708 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-09-13 14:22:43,726 INFO L208 MainTranslator]: Completed translation [2021-09-13 14:22:43,727 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:22:43 WrapperNode [2021-09-13 14:22:43,727 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-09-13 14:22:43,728 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-09-13 14:22:43,729 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-09-13 14:22:43,729 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-09-13 14:22:43,735 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:22:43" (1/1) ... [2021-09-13 14:22:43,749 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:22:43" (1/1) ... [2021-09-13 14:22:43,785 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-09-13 14:22:43,786 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-09-13 14:22:43,787 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-09-13 14:22:43,787 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-09-13 14:22:43,793 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:22:43" (1/1) ... [2021-09-13 14:22:43,793 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:22:43" (1/1) ... [2021-09-13 14:22:43,798 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:22:43" (1/1) ... [2021-09-13 14:22:43,799 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:22:43" (1/1) ... [2021-09-13 14:22:43,815 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:22:43" (1/1) ... [2021-09-13 14:22:43,821 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:22:43" (1/1) ... [2021-09-13 14:22:43,826 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:22:43" (1/1) ... [2021-09-13 14:22:43,829 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-09-13 14:22:43,831 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-09-13 14:22:43,832 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-09-13 14:22:43,833 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-09-13 14:22:43,834 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:22:43" (1/1) ... [2021-09-13 14:22:43,840 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-09-13 14:22:43,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:22:43,866 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:22:43,890 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:22:43,907 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-09-13 14:22:43,907 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-09-13 14:22:43,908 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-09-13 14:22:43,908 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-09-13 14:22:48,211 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-09-13 14:22:48,211 INFO L299 CfgBuilder]: Removed 26 assume(true) statements. [2021-09-13 14:22:48,212 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 02:22:48 BoogieIcfgContainer [2021-09-13 14:22:48,213 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-09-13 14:22:48,214 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-09-13 14:22:48,214 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-09-13 14:22:48,228 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-09-13 14:22:48,229 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.09 02:22:43" (1/3) ... [2021-09-13 14:22:48,229 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16083c63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.09 02:22:48, skipping insertion in model container [2021-09-13 14:22:48,229 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:22:43" (2/3) ... [2021-09-13 14:22:48,230 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16083c63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.09 02:22:48, skipping insertion in model container [2021-09-13 14:22:48,230 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 02:22:48" (3/3) ... [2021-09-13 14:22:48,231 INFO L111 eAbstractionObserver]: Analyzing ICFG egcd2-ll_unwindbound100.c [2021-09-13 14:22:48,235 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-09-13 14:22:48,236 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2021-09-13 14:22:48,275 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-09-13 14:22:48,284 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:22:48,285 INFO L340 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-09-13 14:22:48,308 INFO L276 IsEmpty]: Start isEmpty. Operand has 43 states, 36 states have (on average 1.6111111111111112) internal successors, (58), 42 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:22:48,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-09-13 14:22:48,317 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:22:48,318 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 14:22:48,319 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-09-13 14:22:48,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:22:48,328 INFO L82 PathProgramCache]: Analyzing trace with hash -141782897, now seen corresponding path program 1 times [2021-09-13 14:22:48,337 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-09-13 14:22:48,338 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1527364484] [2021-09-13 14:22:48,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:22:48,339 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-09-13 14:22:48,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-09-13 14:22:48,341 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:22:48,342 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:22:48,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:22:48,538 INFO L263 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 1 conjunts are in the unsatisfiable core [2021-09-13 14:22:48,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:22:48,558 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:22:48,679 INFO L281 TraceCheckUtils]: 0: Hoare triple {46#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);~counter~0 := 0bv32; {46#true} is VALID [2021-09-13 14:22:48,680 INFO L281 TraceCheckUtils]: 1: Hoare triple {46#true} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~post10, main_~temp~0, main_#t~post9, main_~x~0, main_~y~0, main_~a~0, main_~b~0, main_~p~0, main_~q~0, main_~r~0, main_~s~0, main_~c~0, main_~k~0, main_~xy~0, main_~yy~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;havoc main_~c~0;havoc main_~k~0;havoc main_~xy~0;havoc main_~yy~0;main_~x~0 := main_#t~nondet7;havoc main_#t~nondet7;main_~y~0 := main_#t~nondet8;havoc main_#t~nondet8;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; {46#true} is VALID [2021-09-13 14:22:48,681 INFO L281 TraceCheckUtils]: 2: Hoare triple {46#true} assume 0bv32 == assume_abort_if_not_~cond;assume false; {47#false} is VALID [2021-09-13 14:22:48,681 INFO L281 TraceCheckUtils]: 3: Hoare triple {47#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; {47#false} is VALID [2021-09-13 14:22:48,681 INFO L281 TraceCheckUtils]: 4: Hoare triple {47#false} assume 0bv32 == assume_abort_if_not_~cond;assume false; {47#false} is VALID [2021-09-13 14:22:48,682 INFO L281 TraceCheckUtils]: 5: Hoare triple {47#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);main_~c~0 := ~sign_extendFrom32To64(0bv32);main_~k~0 := ~sign_extendFrom32To64(0bv32);main_~xy~0 := ~bvmul64(~sign_extendFrom32To64(main_~x~0), ~sign_extendFrom32To64(main_~y~0));main_~yy~0 := ~bvmul64(~sign_extendFrom32To64(main_~y~0), ~sign_extendFrom32To64(main_~y~0));assume_abort_if_not_#in~cond := (if ~bvslt64(main_~xy~0, ~sign_extendFrom32To64(2147483647bv32)) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {47#false} is VALID [2021-09-13 14:22:48,682 INFO L281 TraceCheckUtils]: 6: Hoare triple {47#false} assume 0bv32 == assume_abort_if_not_~cond;assume false; {47#false} is VALID [2021-09-13 14:22:48,682 INFO L281 TraceCheckUtils]: 7: Hoare triple {47#false} assume_abort_if_not_#in~cond := (if ~bvslt64(main_~yy~0, ~sign_extendFrom32To64(2147483647bv32)) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {47#false} is VALID [2021-09-13 14:22:48,682 INFO L281 TraceCheckUtils]: 8: Hoare triple {47#false} assume 0bv32 == assume_abort_if_not_~cond;assume false; {47#false} is VALID [2021-09-13 14:22:48,683 INFO L281 TraceCheckUtils]: 9: Hoare triple {47#false} assume !true; {47#false} is VALID [2021-09-13 14:22:48,683 INFO L281 TraceCheckUtils]: 10: Hoare triple {47#false} __VERIFIER_assert_#in~cond := (if ~bvadd64(~bvmul64(main_~q~0, ~sign_extendFrom32To64(main_~x~0)), ~bvmul64(main_~s~0, ~sign_extendFrom32To64(main_~y~0))) == ~sign_extendFrom32To64(0bv32) then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {47#false} is VALID [2021-09-13 14:22:48,683 INFO L281 TraceCheckUtils]: 11: Hoare triple {47#false} assume 0bv32 == __VERIFIER_assert_~cond; {47#false} is VALID [2021-09-13 14:22:48,683 INFO L281 TraceCheckUtils]: 12: Hoare triple {47#false} assume !false; {47#false} is VALID [2021-09-13 14:22:48,684 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:22:48,685 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 14:22:48,756 INFO L281 TraceCheckUtils]: 12: Hoare triple {47#false} assume !false; {47#false} is VALID [2021-09-13 14:22:48,756 INFO L281 TraceCheckUtils]: 11: Hoare triple {47#false} assume 0bv32 == __VERIFIER_assert_~cond; {47#false} is VALID [2021-09-13 14:22:48,757 INFO L281 TraceCheckUtils]: 10: Hoare triple {47#false} __VERIFIER_assert_#in~cond := (if ~bvadd64(~bvmul64(main_~q~0, ~sign_extendFrom32To64(main_~x~0)), ~bvmul64(main_~s~0, ~sign_extendFrom32To64(main_~y~0))) == ~sign_extendFrom32To64(0bv32) then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {47#false} is VALID [2021-09-13 14:22:48,757 INFO L281 TraceCheckUtils]: 9: Hoare triple {47#false} assume !true; {47#false} is VALID [2021-09-13 14:22:48,757 INFO L281 TraceCheckUtils]: 8: Hoare triple {47#false} assume 0bv32 == assume_abort_if_not_~cond;assume false; {47#false} is VALID [2021-09-13 14:22:48,757 INFO L281 TraceCheckUtils]: 7: Hoare triple {47#false} assume_abort_if_not_#in~cond := (if ~bvslt64(main_~yy~0, ~sign_extendFrom32To64(2147483647bv32)) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {47#false} is VALID [2021-09-13 14:22:48,758 INFO L281 TraceCheckUtils]: 6: Hoare triple {47#false} assume 0bv32 == assume_abort_if_not_~cond;assume false; {47#false} is VALID [2021-09-13 14:22:48,758 INFO L281 TraceCheckUtils]: 5: Hoare triple {47#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);main_~c~0 := ~sign_extendFrom32To64(0bv32);main_~k~0 := ~sign_extendFrom32To64(0bv32);main_~xy~0 := ~bvmul64(~sign_extendFrom32To64(main_~x~0), ~sign_extendFrom32To64(main_~y~0));main_~yy~0 := ~bvmul64(~sign_extendFrom32To64(main_~y~0), ~sign_extendFrom32To64(main_~y~0));assume_abort_if_not_#in~cond := (if ~bvslt64(main_~xy~0, ~sign_extendFrom32To64(2147483647bv32)) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {47#false} is VALID [2021-09-13 14:22:48,758 INFO L281 TraceCheckUtils]: 4: Hoare triple {47#false} assume 0bv32 == assume_abort_if_not_~cond;assume false; {47#false} is VALID [2021-09-13 14:22:48,758 INFO L281 TraceCheckUtils]: 3: Hoare triple {47#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; {47#false} is VALID [2021-09-13 14:22:48,759 INFO L281 TraceCheckUtils]: 2: Hoare triple {46#true} assume 0bv32 == assume_abort_if_not_~cond;assume false; {47#false} is VALID [2021-09-13 14:22:48,759 INFO L281 TraceCheckUtils]: 1: Hoare triple {46#true} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~post10, main_~temp~0, main_#t~post9, main_~x~0, main_~y~0, main_~a~0, main_~b~0, main_~p~0, main_~q~0, main_~r~0, main_~s~0, main_~c~0, main_~k~0, main_~xy~0, main_~yy~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;havoc main_~c~0;havoc main_~k~0;havoc main_~xy~0;havoc main_~yy~0;main_~x~0 := main_#t~nondet7;havoc main_#t~nondet7;main_~y~0 := main_#t~nondet8;havoc main_#t~nondet8;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; {46#true} is VALID [2021-09-13 14:22:48,759 INFO L281 TraceCheckUtils]: 0: Hoare triple {46#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);~counter~0 := 0bv32; {46#true} is VALID [2021-09-13 14:22:48,760 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:22:48,761 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-09-13 14:22:48,761 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1527364484] [2021-09-13 14:22:48,761 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1527364484] provided 2 perfect and 0 imperfect interpolant sequences [2021-09-13 14:22:48,762 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-09-13 14:22:48,762 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-09-13 14:22:48,763 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94728166] [2021-09-13 14:22:48,768 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 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 13 [2021-09-13 14:22:48,768 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:22:48,771 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:22:48,881 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:22:48,881 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-09-13 14:22:48,881 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-09-13 14:22:48,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-09-13 14:22:48,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-09-13 14:22:48,902 INFO L87 Difference]: Start difference. First operand has 43 states, 36 states have (on average 1.6111111111111112) internal successors, (58), 42 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 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:22:51,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:22:51,944 INFO L93 Difference]: Finished difference Result 83 states and 112 transitions. [2021-09-13 14:22:51,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-09-13 14:22:51,945 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 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 13 [2021-09-13 14:22:51,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:22:51,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:22:51,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 112 transitions. [2021-09-13 14:22:51,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:22:51,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 112 transitions. [2021-09-13 14:22:51,956 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 112 transitions. [2021-09-13 14:22:52,822 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:22:52,829 INFO L225 Difference]: With dead ends: 83 [2021-09-13 14:22:52,830 INFO L226 Difference]: Without dead ends: 39 [2021-09-13 14:22:52,832 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.16ms TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-09-13 14:22:52,835 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1569.40ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.13ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1586.49ms IncrementalHoareTripleChecker+Time [2021-09-13 14:22:52,836 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 46 Unknown, 0 Unchecked, 1.13ms Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 1586.49ms Time] [2021-09-13 14:22:52,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2021-09-13 14:22:52,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2021-09-13 14:22:52,860 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:22:52,861 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand has 39 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 38 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:22:52,862 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand has 39 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 38 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:22:52,862 INFO L87 Difference]: Start difference. First operand 39 states. Second operand has 39 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 38 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:22:52,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:22:52,866 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2021-09-13 14:22:52,866 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2021-09-13 14:22:52,866 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:22:52,866 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:22:52,867 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 38 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) Second operand 39 states. [2021-09-13 14:22:52,867 INFO L87 Difference]: Start difference. First operand has 39 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 38 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) Second operand 39 states. [2021-09-13 14:22:52,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:22:52,870 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2021-09-13 14:22:52,870 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2021-09-13 14:22:52,870 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:22:52,870 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:22:52,871 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:22:52,871 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:22:52,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 38 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:22:52,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2021-09-13 14:22:52,874 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 13 [2021-09-13 14:22:52,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:22:52,875 INFO L470 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2021-09-13 14:22:52,875 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:22:52,875 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2021-09-13 14:22:52,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-09-13 14:22:52,876 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:22:52,876 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 14:22:52,889 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:22:53,080 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:22:53,081 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-09-13 14:22:53,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:22:53,082 INFO L82 PathProgramCache]: Analyzing trace with hash -1057770534, now seen corresponding path program 1 times [2021-09-13 14:22:53,082 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-09-13 14:22:53,083 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1397713421] [2021-09-13 14:22:53,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:22:53,083 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-09-13 14:22:53,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-09-13 14:22:53,084 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:22:53,102 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:22:53,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:22:53,263 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 3 conjunts are in the unsatisfiable core [2021-09-13 14:22:53,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:22:53,276 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:22:53,515 INFO L281 TraceCheckUtils]: 0: Hoare triple {347#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);~counter~0 := 0bv32; {352#(= ~counter~0 (_ bv0 32))} is VALID [2021-09-13 14:22:53,516 INFO L281 TraceCheckUtils]: 1: Hoare triple {352#(= ~counter~0 (_ bv0 32))} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~post10, main_~temp~0, main_#t~post9, main_~x~0, main_~y~0, main_~a~0, main_~b~0, main_~p~0, main_~q~0, main_~r~0, main_~s~0, main_~c~0, main_~k~0, main_~xy~0, main_~yy~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;havoc main_~c~0;havoc main_~k~0;havoc main_~xy~0;havoc main_~yy~0;main_~x~0 := main_#t~nondet7;havoc main_#t~nondet7;main_~y~0 := main_#t~nondet8;havoc main_#t~nondet8;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; {352#(= ~counter~0 (_ bv0 32))} is VALID [2021-09-13 14:22:53,516 INFO L281 TraceCheckUtils]: 2: Hoare triple {352#(= ~counter~0 (_ bv0 32))} assume !(0bv32 == assume_abort_if_not_~cond); {352#(= ~counter~0 (_ bv0 32))} is VALID [2021-09-13 14:22:53,517 INFO L281 TraceCheckUtils]: 3: Hoare triple {352#(= ~counter~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; {352#(= ~counter~0 (_ bv0 32))} is VALID [2021-09-13 14:22:53,518 INFO L281 TraceCheckUtils]: 4: Hoare triple {352#(= ~counter~0 (_ bv0 32))} assume !(0bv32 == assume_abort_if_not_~cond); {352#(= ~counter~0 (_ bv0 32))} is VALID [2021-09-13 14:22:53,518 INFO L281 TraceCheckUtils]: 5: Hoare triple {352#(= ~counter~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);main_~c~0 := ~sign_extendFrom32To64(0bv32);main_~k~0 := ~sign_extendFrom32To64(0bv32);main_~xy~0 := ~bvmul64(~sign_extendFrom32To64(main_~x~0), ~sign_extendFrom32To64(main_~y~0));main_~yy~0 := ~bvmul64(~sign_extendFrom32To64(main_~y~0), ~sign_extendFrom32To64(main_~y~0));assume_abort_if_not_#in~cond := (if ~bvslt64(main_~xy~0, ~sign_extendFrom32To64(2147483647bv32)) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {352#(= ~counter~0 (_ bv0 32))} is VALID [2021-09-13 14:22:53,519 INFO L281 TraceCheckUtils]: 6: Hoare triple {352#(= ~counter~0 (_ bv0 32))} assume !(0bv32 == assume_abort_if_not_~cond); {352#(= ~counter~0 (_ bv0 32))} is VALID [2021-09-13 14:22:53,520 INFO L281 TraceCheckUtils]: 7: Hoare triple {352#(= ~counter~0 (_ bv0 32))} assume_abort_if_not_#in~cond := (if ~bvslt64(main_~yy~0, ~sign_extendFrom32To64(2147483647bv32)) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {352#(= ~counter~0 (_ bv0 32))} is VALID [2021-09-13 14:22:53,521 INFO L281 TraceCheckUtils]: 8: Hoare triple {352#(= ~counter~0 (_ bv0 32))} assume !(0bv32 == assume_abort_if_not_~cond); {352#(= ~counter~0 (_ bv0 32))} is VALID [2021-09-13 14:22:53,521 INFO L281 TraceCheckUtils]: 9: Hoare triple {352#(= ~counter~0 (_ bv0 32))} main_#t~post9 := ~counter~0;~counter~0 := ~bvadd32(1bv32, main_#t~post9); {380#(= |ULTIMATE.start_main_#t~post9| (_ bv0 32))} is VALID [2021-09-13 14:22:53,522 INFO L281 TraceCheckUtils]: 10: Hoare triple {380#(= |ULTIMATE.start_main_#t~post9| (_ bv0 32))} assume !~bvslt32(main_#t~post9, 100bv32);havoc main_#t~post9; {348#false} is VALID [2021-09-13 14:22:53,522 INFO L281 TraceCheckUtils]: 11: Hoare triple {348#false} __VERIFIER_assert_#in~cond := (if ~bvadd64(~bvmul64(main_~q~0, ~sign_extendFrom32To64(main_~x~0)), ~bvmul64(main_~s~0, ~sign_extendFrom32To64(main_~y~0))) == ~sign_extendFrom32To64(0bv32) then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {348#false} is VALID [2021-09-13 14:22:53,522 INFO L281 TraceCheckUtils]: 12: Hoare triple {348#false} assume 0bv32 == __VERIFIER_assert_~cond; {348#false} is VALID [2021-09-13 14:22:53,522 INFO L281 TraceCheckUtils]: 13: Hoare triple {348#false} assume !false; {348#false} is VALID [2021-09-13 14:22:53,523 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:22:53,523 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 14:22:53,707 INFO L281 TraceCheckUtils]: 13: Hoare triple {348#false} assume !false; {348#false} is VALID [2021-09-13 14:22:53,708 INFO L281 TraceCheckUtils]: 12: Hoare triple {348#false} assume 0bv32 == __VERIFIER_assert_~cond; {348#false} is VALID [2021-09-13 14:22:53,708 INFO L281 TraceCheckUtils]: 11: Hoare triple {348#false} __VERIFIER_assert_#in~cond := (if ~bvadd64(~bvmul64(main_~q~0, ~sign_extendFrom32To64(main_~x~0)), ~bvmul64(main_~s~0, ~sign_extendFrom32To64(main_~y~0))) == ~sign_extendFrom32To64(0bv32) then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {348#false} is VALID [2021-09-13 14:22:53,708 INFO L281 TraceCheckUtils]: 10: Hoare triple {402#(bvslt |ULTIMATE.start_main_#t~post9| (_ bv100 32))} assume !~bvslt32(main_#t~post9, 100bv32);havoc main_#t~post9; {348#false} is VALID [2021-09-13 14:22:53,709 INFO L281 TraceCheckUtils]: 9: Hoare triple {406#(bvslt ~counter~0 (_ bv100 32))} main_#t~post9 := ~counter~0;~counter~0 := ~bvadd32(1bv32, main_#t~post9); {402#(bvslt |ULTIMATE.start_main_#t~post9| (_ bv100 32))} is VALID [2021-09-13 14:22:53,709 INFO L281 TraceCheckUtils]: 8: Hoare triple {406#(bvslt ~counter~0 (_ bv100 32))} assume !(0bv32 == assume_abort_if_not_~cond); {406#(bvslt ~counter~0 (_ bv100 32))} is VALID [2021-09-13 14:22:53,710 INFO L281 TraceCheckUtils]: 7: Hoare triple {406#(bvslt ~counter~0 (_ bv100 32))} assume_abort_if_not_#in~cond := (if ~bvslt64(main_~yy~0, ~sign_extendFrom32To64(2147483647bv32)) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {406#(bvslt ~counter~0 (_ bv100 32))} is VALID [2021-09-13 14:22:53,711 INFO L281 TraceCheckUtils]: 6: Hoare triple {406#(bvslt ~counter~0 (_ bv100 32))} assume !(0bv32 == assume_abort_if_not_~cond); {406#(bvslt ~counter~0 (_ bv100 32))} is VALID [2021-09-13 14:22:53,712 INFO L281 TraceCheckUtils]: 5: Hoare triple {406#(bvslt ~counter~0 (_ bv100 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);main_~c~0 := ~sign_extendFrom32To64(0bv32);main_~k~0 := ~sign_extendFrom32To64(0bv32);main_~xy~0 := ~bvmul64(~sign_extendFrom32To64(main_~x~0), ~sign_extendFrom32To64(main_~y~0));main_~yy~0 := ~bvmul64(~sign_extendFrom32To64(main_~y~0), ~sign_extendFrom32To64(main_~y~0));assume_abort_if_not_#in~cond := (if ~bvslt64(main_~xy~0, ~sign_extendFrom32To64(2147483647bv32)) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {406#(bvslt ~counter~0 (_ bv100 32))} is VALID [2021-09-13 14:22:53,712 INFO L281 TraceCheckUtils]: 4: Hoare triple {406#(bvslt ~counter~0 (_ bv100 32))} assume !(0bv32 == assume_abort_if_not_~cond); {406#(bvslt ~counter~0 (_ bv100 32))} is VALID [2021-09-13 14:22:53,716 INFO L281 TraceCheckUtils]: 3: Hoare triple {406#(bvslt ~counter~0 (_ bv100 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; {406#(bvslt ~counter~0 (_ bv100 32))} is VALID [2021-09-13 14:22:53,716 INFO L281 TraceCheckUtils]: 2: Hoare triple {406#(bvslt ~counter~0 (_ bv100 32))} assume !(0bv32 == assume_abort_if_not_~cond); {406#(bvslt ~counter~0 (_ bv100 32))} is VALID [2021-09-13 14:22:53,717 INFO L281 TraceCheckUtils]: 1: Hoare triple {406#(bvslt ~counter~0 (_ bv100 32))} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~post10, main_~temp~0, main_#t~post9, main_~x~0, main_~y~0, main_~a~0, main_~b~0, main_~p~0, main_~q~0, main_~r~0, main_~s~0, main_~c~0, main_~k~0, main_~xy~0, main_~yy~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;havoc main_~c~0;havoc main_~k~0;havoc main_~xy~0;havoc main_~yy~0;main_~x~0 := main_#t~nondet7;havoc main_#t~nondet7;main_~y~0 := main_#t~nondet8;havoc main_#t~nondet8;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; {406#(bvslt ~counter~0 (_ bv100 32))} is VALID [2021-09-13 14:22:53,720 INFO L281 TraceCheckUtils]: 0: Hoare triple {347#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);~counter~0 := 0bv32; {406#(bvslt ~counter~0 (_ bv100 32))} is VALID [2021-09-13 14:22:53,720 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:22:53,720 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-09-13 14:22:53,720 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1397713421] [2021-09-13 14:22:53,720 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1397713421] provided 2 perfect and 0 imperfect interpolant sequences [2021-09-13 14:22:53,721 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-09-13 14:22:53,721 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2021-09-13 14:22:53,721 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712244944] [2021-09-13 14:22:53,722 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2021-09-13 14:22:53,722 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:22:53,722 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:22:53,903 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:22:53,904 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-09-13 14:22:53,904 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-09-13 14:22:53,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-09-13 14:22:53,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-09-13 14:22:53,905 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:23:08,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:23:08,098 INFO L93 Difference]: Finished difference Result 59 states and 62 transitions. [2021-09-13 14:23:08,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-09-13 14:23:08,098 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2021-09-13 14:23:08,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:23:08,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:23:08,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 62 transitions. [2021-09-13 14:23:08,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:23:08,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 62 transitions. [2021-09-13 14:23:08,102 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 62 transitions. [2021-09-13 14:23:08,701 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:23:08,702 INFO L225 Difference]: With dead ends: 59 [2021-09-13 14:23:08,703 INFO L226 Difference]: Without dead ends: 51 [2021-09-13 14:23:08,703 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 108.72ms TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2021-09-13 14:23:08,704 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 9 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6151.67ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.27ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6157.51ms IncrementalHoareTripleChecker+Time [2021-09-13 14:23:08,705 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 0 Invalid, 172 Unknown, 0 Unchecked, 4.27ms Time], IncrementalHoareTripleChecker [2 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 6157.51ms Time] [2021-09-13 14:23:08,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2021-09-13 14:23:08,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 41. [2021-09-13 14:23:08,713 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:23:08,714 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand has 41 states, 35 states have (on average 1.2571428571428571) internal successors, (44), 40 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:23:08,714 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand has 41 states, 35 states have (on average 1.2571428571428571) internal successors, (44), 40 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:23:08,714 INFO L87 Difference]: Start difference. First operand 51 states. Second operand has 41 states, 35 states have (on average 1.2571428571428571) internal successors, (44), 40 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:23:08,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:23:08,717 INFO L93 Difference]: Finished difference Result 51 states and 54 transitions. [2021-09-13 14:23:08,717 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 54 transitions. [2021-09-13 14:23:08,717 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:23:08,717 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:23:08,718 INFO L74 IsIncluded]: Start isIncluded. First operand has 41 states, 35 states have (on average 1.2571428571428571) internal successors, (44), 40 states have internal predecessors, (44), 0 states have call successors, (0), 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 51 states. [2021-09-13 14:23:08,718 INFO L87 Difference]: Start difference. First operand has 41 states, 35 states have (on average 1.2571428571428571) internal successors, (44), 40 states have internal predecessors, (44), 0 states have call successors, (0), 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 51 states. [2021-09-13 14:23:08,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:23:08,720 INFO L93 Difference]: Finished difference Result 51 states and 54 transitions. [2021-09-13 14:23:08,720 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 54 transitions. [2021-09-13 14:23:08,721 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:23:08,721 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:23:08,721 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:23:08,721 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:23:08,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 35 states have (on average 1.2571428571428571) internal successors, (44), 40 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:23:08,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2021-09-13 14:23:08,723 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 14 [2021-09-13 14:23:08,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:23:08,724 INFO L470 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2021-09-13 14:23:08,724 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:23:08,724 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2021-09-13 14:23:08,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-09-13 14:23:08,725 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:23:08,725 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 14:23:08,745 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:23:08,937 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:23:08,938 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-09-13 14:23:08,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:23:08,939 INFO L82 PathProgramCache]: Analyzing trace with hash 1568670238, now seen corresponding path program 1 times [2021-09-13 14:23:08,941 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-09-13 14:23:08,941 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1606686518] [2021-09-13 14:23:08,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:23:08,942 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-09-13 14:23:08,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-09-13 14:23:08,945 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:23:08,952 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:23:09,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:23:09,071 INFO L263 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 9 conjunts are in the unsatisfiable core [2021-09-13 14:23:09,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:23:09,081 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:23:13,928 INFO L281 TraceCheckUtils]: 0: Hoare triple {656#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);~counter~0 := 0bv32; {656#true} is VALID [2021-09-13 14:23:13,928 INFO L281 TraceCheckUtils]: 1: Hoare triple {656#true} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~post10, main_~temp~0, main_#t~post9, main_~x~0, main_~y~0, main_~a~0, main_~b~0, main_~p~0, main_~q~0, main_~r~0, main_~s~0, main_~c~0, main_~k~0, main_~xy~0, main_~yy~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;havoc main_~c~0;havoc main_~k~0;havoc main_~xy~0;havoc main_~yy~0;main_~x~0 := main_#t~nondet7;havoc main_#t~nondet7;main_~y~0 := main_#t~nondet8;havoc main_#t~nondet8;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; {656#true} is VALID [2021-09-13 14:23:13,929 INFO L281 TraceCheckUtils]: 2: Hoare triple {656#true} assume !(0bv32 == assume_abort_if_not_~cond); {656#true} is VALID [2021-09-13 14:23:13,930 INFO L281 TraceCheckUtils]: 3: Hoare triple {656#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; {670#(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:23:13,930 INFO L281 TraceCheckUtils]: 4: Hoare triple {670#(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); {674#(bvsge ULTIMATE.start_main_~y~0 (_ bv1 32))} is VALID [2021-09-13 14:23:15,958 INFO L281 TraceCheckUtils]: 5: Hoare triple {674#(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);main_~c~0 := ~sign_extendFrom32To64(0bv32);main_~k~0 := ~sign_extendFrom32To64(0bv32);main_~xy~0 := ~bvmul64(~sign_extendFrom32To64(main_~x~0), ~sign_extendFrom32To64(main_~y~0));main_~yy~0 := ~bvmul64(~sign_extendFrom32To64(main_~y~0), ~sign_extendFrom32To64(main_~y~0));assume_abort_if_not_#in~cond := (if ~bvslt64(main_~xy~0, ~sign_extendFrom32To64(2147483647bv32)) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {678#(exists ((ULTIMATE.start_main_~y~0 (_ BitVec 32))) (and (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~b~0) (= ULTIMATE.start_main_~yy~0 (bvmul ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ((_ sign_extend 32) ULTIMATE.start_main_~y~0))) (bvsge ULTIMATE.start_main_~y~0 (_ bv1 32))))} is UNKNOWN [2021-09-13 14:23:15,959 INFO L281 TraceCheckUtils]: 6: Hoare triple {678#(exists ((ULTIMATE.start_main_~y~0 (_ BitVec 32))) (and (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~b~0) (= ULTIMATE.start_main_~yy~0 (bvmul ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ((_ sign_extend 32) ULTIMATE.start_main_~y~0))) (bvsge ULTIMATE.start_main_~y~0 (_ bv1 32))))} assume !(0bv32 == assume_abort_if_not_~cond); {678#(exists ((ULTIMATE.start_main_~y~0 (_ BitVec 32))) (and (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~b~0) (= ULTIMATE.start_main_~yy~0 (bvmul ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ((_ sign_extend 32) ULTIMATE.start_main_~y~0))) (bvsge ULTIMATE.start_main_~y~0 (_ bv1 32))))} is VALID [2021-09-13 14:23:15,982 INFO L281 TraceCheckUtils]: 7: Hoare triple {678#(exists ((ULTIMATE.start_main_~y~0 (_ BitVec 32))) (and (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~b~0) (= ULTIMATE.start_main_~yy~0 (bvmul ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ((_ sign_extend 32) ULTIMATE.start_main_~y~0))) (bvsge ULTIMATE.start_main_~y~0 (_ bv1 32))))} assume_abort_if_not_#in~cond := (if ~bvslt64(main_~yy~0, ~sign_extendFrom32To64(2147483647bv32)) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {685#(exists ((ULTIMATE.start_main_~y~0 (_ BitVec 32))) (and (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~b~0) (bvsge ULTIMATE.start_main_~y~0 (_ bv1 32)) (or (and (= ULTIMATE.start_assume_abort_if_not_~cond (_ bv1 32)) (bvslt (bvmul ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ((_ sign_extend 32) ULTIMATE.start_main_~y~0)) ((_ sign_extend 32) (_ bv2147483647 32)))) (and (not (bvslt (bvmul ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ((_ sign_extend 32) ULTIMATE.start_main_~y~0)) ((_ sign_extend 32) (_ bv2147483647 32)))) (= ULTIMATE.start_assume_abort_if_not_~cond (_ bv0 32))))))} is VALID [2021-09-13 14:23:15,998 INFO L281 TraceCheckUtils]: 8: Hoare triple {685#(exists ((ULTIMATE.start_main_~y~0 (_ BitVec 32))) (and (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~b~0) (bvsge ULTIMATE.start_main_~y~0 (_ bv1 32)) (or (and (= ULTIMATE.start_assume_abort_if_not_~cond (_ bv1 32)) (bvslt (bvmul ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ((_ sign_extend 32) ULTIMATE.start_main_~y~0)) ((_ sign_extend 32) (_ bv2147483647 32)))) (and (not (bvslt (bvmul ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ((_ sign_extend 32) ULTIMATE.start_main_~y~0)) ((_ sign_extend 32) (_ bv2147483647 32)))) (= ULTIMATE.start_assume_abort_if_not_~cond (_ bv0 32))))))} assume !(0bv32 == assume_abort_if_not_~cond); {689#(exists ((ULTIMATE.start_main_~y~0 (_ BitVec 32))) (and (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~b~0) (bvsge ULTIMATE.start_main_~y~0 (_ bv1 32)) (bvslt (bvmul ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ((_ sign_extend 32) ULTIMATE.start_main_~y~0)) ((_ sign_extend 32) (_ bv2147483647 32)))))} is VALID [2021-09-13 14:23:15,998 INFO L281 TraceCheckUtils]: 9: Hoare triple {689#(exists ((ULTIMATE.start_main_~y~0 (_ BitVec 32))) (and (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~b~0) (bvsge ULTIMATE.start_main_~y~0 (_ bv1 32)) (bvslt (bvmul ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ((_ sign_extend 32) ULTIMATE.start_main_~y~0)) ((_ sign_extend 32) (_ bv2147483647 32)))))} main_#t~post9 := ~counter~0;~counter~0 := ~bvadd32(1bv32, main_#t~post9); {689#(exists ((ULTIMATE.start_main_~y~0 (_ BitVec 32))) (and (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~b~0) (bvsge ULTIMATE.start_main_~y~0 (_ bv1 32)) (bvslt (bvmul ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ((_ sign_extend 32) ULTIMATE.start_main_~y~0)) ((_ sign_extend 32) (_ bv2147483647 32)))))} is VALID [2021-09-13 14:23:15,999 INFO L281 TraceCheckUtils]: 10: Hoare triple {689#(exists ((ULTIMATE.start_main_~y~0 (_ BitVec 32))) (and (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~b~0) (bvsge ULTIMATE.start_main_~y~0 (_ bv1 32)) (bvslt (bvmul ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ((_ sign_extend 32) ULTIMATE.start_main_~y~0)) ((_ sign_extend 32) (_ bv2147483647 32)))))} assume !!~bvslt32(main_#t~post9, 100bv32);havoc main_#t~post9; {689#(exists ((ULTIMATE.start_main_~y~0 (_ BitVec 32))) (and (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~b~0) (bvsge ULTIMATE.start_main_~y~0 (_ bv1 32)) (bvslt (bvmul ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ((_ sign_extend 32) ULTIMATE.start_main_~y~0)) ((_ sign_extend 32) (_ bv2147483647 32)))))} is VALID [2021-09-13 14:23:16,013 INFO L281 TraceCheckUtils]: 11: Hoare triple {689#(exists ((ULTIMATE.start_main_~y~0 (_ BitVec 32))) (and (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~b~0) (bvsge ULTIMATE.start_main_~y~0 (_ bv1 32)) (bvslt (bvmul ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ((_ sign_extend 32) ULTIMATE.start_main_~y~0)) ((_ sign_extend 32) (_ bv2147483647 32)))))} assume !(main_~b~0 != ~sign_extendFrom32To64(0bv32)); {657#false} is VALID [2021-09-13 14:23:16,014 INFO L281 TraceCheckUtils]: 12: Hoare triple {657#false} __VERIFIER_assert_#in~cond := (if ~bvadd64(~bvmul64(main_~q~0, ~sign_extendFrom32To64(main_~x~0)), ~bvmul64(main_~s~0, ~sign_extendFrom32To64(main_~y~0))) == ~sign_extendFrom32To64(0bv32) then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {657#false} is VALID [2021-09-13 14:23:16,014 INFO L281 TraceCheckUtils]: 13: Hoare triple {657#false} assume 0bv32 == __VERIFIER_assert_~cond; {657#false} is VALID [2021-09-13 14:23:16,014 INFO L281 TraceCheckUtils]: 14: Hoare triple {657#false} assume !false; {657#false} is VALID [2021-09-13 14:23:16,015 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:23:16,015 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 14:23:17,474 INFO L281 TraceCheckUtils]: 14: Hoare triple {657#false} assume !false; {657#false} is VALID [2021-09-13 14:23:17,474 INFO L281 TraceCheckUtils]: 13: Hoare triple {657#false} assume 0bv32 == __VERIFIER_assert_~cond; {657#false} is VALID [2021-09-13 14:23:17,474 INFO L281 TraceCheckUtils]: 12: Hoare triple {657#false} __VERIFIER_assert_#in~cond := (if ~bvadd64(~bvmul64(main_~q~0, ~sign_extendFrom32To64(main_~x~0)), ~bvmul64(main_~s~0, ~sign_extendFrom32To64(main_~y~0))) == ~sign_extendFrom32To64(0bv32) then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {657#false} is VALID [2021-09-13 14:23:17,475 INFO L281 TraceCheckUtils]: 11: Hoare triple {717#(not (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~b~0))} assume !(main_~b~0 != ~sign_extendFrom32To64(0bv32)); {657#false} is VALID [2021-09-13 14:23:17,476 INFO L281 TraceCheckUtils]: 10: Hoare triple {717#(not (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~b~0))} assume !!~bvslt32(main_#t~post9, 100bv32);havoc main_#t~post9; {717#(not (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~b~0))} is VALID [2021-09-13 14:23:17,476 INFO L281 TraceCheckUtils]: 9: Hoare triple {717#(not (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~b~0))} main_#t~post9 := ~counter~0;~counter~0 := ~bvadd32(1bv32, main_#t~post9); {717#(not (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~b~0))} is VALID [2021-09-13 14:23:17,476 INFO L281 TraceCheckUtils]: 8: Hoare triple {727#(or (not (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~b~0)) (= ULTIMATE.start_assume_abort_if_not_~cond (_ bv0 32)))} assume !(0bv32 == assume_abort_if_not_~cond); {717#(not (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~b~0))} is VALID [2021-09-13 14:23:17,477 INFO L281 TraceCheckUtils]: 7: Hoare triple {731#(or (not (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~b~0)) (not (bvslt ULTIMATE.start_main_~yy~0 ((_ sign_extend 32) (_ bv2147483647 32)))))} assume_abort_if_not_#in~cond := (if ~bvslt64(main_~yy~0, ~sign_extendFrom32To64(2147483647bv32)) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {727#(or (not (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~b~0)) (= ULTIMATE.start_assume_abort_if_not_~cond (_ bv0 32)))} is VALID [2021-09-13 14:23:17,477 INFO L281 TraceCheckUtils]: 6: Hoare triple {731#(or (not (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~b~0)) (not (bvslt ULTIMATE.start_main_~yy~0 ((_ sign_extend 32) (_ bv2147483647 32)))))} assume !(0bv32 == assume_abort_if_not_~cond); {731#(or (not (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~b~0)) (not (bvslt ULTIMATE.start_main_~yy~0 ((_ sign_extend 32) (_ bv2147483647 32)))))} is VALID [2021-09-13 14:23:17,479 INFO L281 TraceCheckUtils]: 5: Hoare triple {738#(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);main_~c~0 := ~sign_extendFrom32To64(0bv32);main_~k~0 := ~sign_extendFrom32To64(0bv32);main_~xy~0 := ~bvmul64(~sign_extendFrom32To64(main_~x~0), ~sign_extendFrom32To64(main_~y~0));main_~yy~0 := ~bvmul64(~sign_extendFrom32To64(main_~y~0), ~sign_extendFrom32To64(main_~y~0));assume_abort_if_not_#in~cond := (if ~bvslt64(main_~xy~0, ~sign_extendFrom32To64(2147483647bv32)) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {731#(or (not (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~b~0)) (not (bvslt ULTIMATE.start_main_~yy~0 ((_ sign_extend 32) (_ bv2147483647 32)))))} is VALID [2021-09-13 14:23:17,480 INFO L281 TraceCheckUtils]: 4: Hoare triple {742#(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); {738#(not (= ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) ULTIMATE.start_main_~y~0)))} is VALID [2021-09-13 14:23:17,481 INFO L281 TraceCheckUtils]: 3: Hoare triple {656#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; {742#(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:23:17,481 INFO L281 TraceCheckUtils]: 2: Hoare triple {656#true} assume !(0bv32 == assume_abort_if_not_~cond); {656#true} is VALID [2021-09-13 14:23:17,481 INFO L281 TraceCheckUtils]: 1: Hoare triple {656#true} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~post10, main_~temp~0, main_#t~post9, main_~x~0, main_~y~0, main_~a~0, main_~b~0, main_~p~0, main_~q~0, main_~r~0, main_~s~0, main_~c~0, main_~k~0, main_~xy~0, main_~yy~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;havoc main_~c~0;havoc main_~k~0;havoc main_~xy~0;havoc main_~yy~0;main_~x~0 := main_#t~nondet7;havoc main_#t~nondet7;main_~y~0 := main_#t~nondet8;havoc main_#t~nondet8;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; {656#true} is VALID [2021-09-13 14:23:17,481 INFO L281 TraceCheckUtils]: 0: Hoare triple {656#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);~counter~0 := 0bv32; {656#true} is VALID [2021-09-13 14:23:17,482 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:23:17,482 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-09-13 14:23:17,482 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1606686518] [2021-09-13 14:23:17,482 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1606686518] provided 2 perfect and 0 imperfect interpolant sequences [2021-09-13 14:23:17,482 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-09-13 14:23:17,482 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 12 [2021-09-13 14:23:17,483 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185642560] [2021-09-13 14:23:17,483 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.0) internal successors, (24), 12 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:23:17,483 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:23:17,484 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 2.0) internal successors, (24), 12 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:23:19,743 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 23 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2021-09-13 14:23:19,743 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-09-13 14:23:19,743 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-09-13 14:23:19,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-09-13 14:23:19,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2021-09-13 14:23:19,744 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand has 12 states, 12 states have (on average 2.0) internal successors, (24), 12 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:23:35,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:23:35,321 INFO L93 Difference]: Finished difference Result 50 states and 53 transitions. [2021-09-13 14:23:35,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-09-13 14:23:35,322 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.0) internal successors, (24), 12 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:23:35,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:23:35,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.0) internal successors, (24), 12 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:23:35,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 53 transitions. [2021-09-13 14:23:35,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.0) internal successors, (24), 12 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:23:35,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 53 transitions. [2021-09-13 14:23:35,325 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 53 transitions. [2021-09-13 14:23:37,951 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 52 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2021-09-13 14:23:37,953 INFO L225 Difference]: With dead ends: 50 [2021-09-13 14:23:37,953 INFO L226 Difference]: Without dead ends: 42 [2021-09-13 14:23:37,953 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 2845.49ms TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2021-09-13 14:23:37,954 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 1 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7200.07ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.43ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 113 IncrementalHoareTripleChecker+Unchecked, 7204.10ms IncrementalHoareTripleChecker+Time [2021-09-13 14:23:37,955 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 0 Invalid, 285 Unknown, 0 Unchecked, 3.43ms Time], IncrementalHoareTripleChecker [1 Valid, 171 Invalid, 0 Unknown, 113 Unchecked, 7204.10ms Time] [2021-09-13 14:23:37,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2021-09-13 14:23:37,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2021-09-13 14:23:37,965 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:23:37,965 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand has 42 states, 36 states have (on average 1.25) internal successors, (45), 41 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:23:37,966 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand has 42 states, 36 states have (on average 1.25) internal successors, (45), 41 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:23:37,966 INFO L87 Difference]: Start difference. First operand 42 states. Second operand has 42 states, 36 states have (on average 1.25) internal successors, (45), 41 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:23:37,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:23:37,968 INFO L93 Difference]: Finished difference Result 42 states and 45 transitions. [2021-09-13 14:23:37,968 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2021-09-13 14:23:37,968 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:23:37,968 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:23:37,969 INFO L74 IsIncluded]: Start isIncluded. First operand has 42 states, 36 states have (on average 1.25) internal successors, (45), 41 states have internal predecessors, (45), 0 states have call successors, (0), 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 42 states. [2021-09-13 14:23:37,969 INFO L87 Difference]: Start difference. First operand has 42 states, 36 states have (on average 1.25) internal successors, (45), 41 states have internal predecessors, (45), 0 states have call successors, (0), 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 42 states. [2021-09-13 14:23:37,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:23:37,971 INFO L93 Difference]: Finished difference Result 42 states and 45 transitions. [2021-09-13 14:23:37,971 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2021-09-13 14:23:37,971 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:23:37,971 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:23:37,971 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:23:37,972 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:23:37,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 36 states have (on average 1.25) internal successors, (45), 41 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:23:37,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2021-09-13 14:23:37,973 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 15 [2021-09-13 14:23:37,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:23:37,973 INFO L470 AbstractCegarLoop]: Abstraction has 42 states and 45 transitions. [2021-09-13 14:23:37,974 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.0) internal successors, (24), 12 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:23:37,974 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2021-09-13 14:23:37,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-09-13 14:23:37,974 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:23:37,975 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 14:23:37,987 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:23:38,183 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:23:38,183 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-09-13 14:23:38,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:23:38,184 INFO L82 PathProgramCache]: Analyzing trace with hash 1384108475, now seen corresponding path program 1 times [2021-09-13 14:23:38,184 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-09-13 14:23:38,185 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [407809542] [2021-09-13 14:23:38,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:23:38,185 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-09-13 14:23:38,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-09-13 14:23:38,186 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:23:38,186 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:23:38,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:23:38,292 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 17 conjunts are in the unsatisfiable core [2021-09-13 14:23:38,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:23:38,301 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:23:49,756 INFO L281 TraceCheckUtils]: 0: Hoare triple {951#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);~counter~0 := 0bv32; {951#true} is VALID [2021-09-13 14:23:49,757 INFO L281 TraceCheckUtils]: 1: Hoare triple {951#true} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~post10, main_~temp~0, main_#t~post9, main_~x~0, main_~y~0, main_~a~0, main_~b~0, main_~p~0, main_~q~0, main_~r~0, main_~s~0, main_~c~0, main_~k~0, main_~xy~0, main_~yy~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;havoc main_~c~0;havoc main_~k~0;havoc main_~xy~0;havoc main_~yy~0;main_~x~0 := main_#t~nondet7;havoc main_#t~nondet7;main_~y~0 := main_#t~nondet8;havoc main_#t~nondet8;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; {959#(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:23:49,758 INFO L281 TraceCheckUtils]: 2: Hoare triple {959#(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); {963#(bvsge ULTIMATE.start_main_~x~0 (_ bv1 32))} is VALID [2021-09-13 14:23:49,758 INFO L281 TraceCheckUtils]: 3: Hoare triple {963#(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; {967#(and (bvsge ULTIMATE.start_main_~x~0 (_ bv1 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:23:49,759 INFO L281 TraceCheckUtils]: 4: Hoare triple {967#(and (bvsge ULTIMATE.start_main_~x~0 (_ bv1 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); {971#(and (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv1 32)))} is VALID [2021-09-13 14:23:51,786 INFO L281 TraceCheckUtils]: 5: Hoare triple {971#(and (bvsge ULTIMATE.start_main_~x~0 (_ bv1 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);main_~c~0 := ~sign_extendFrom32To64(0bv32);main_~k~0 := ~sign_extendFrom32To64(0bv32);main_~xy~0 := ~bvmul64(~sign_extendFrom32To64(main_~x~0), ~sign_extendFrom32To64(main_~y~0));main_~yy~0 := ~bvmul64(~sign_extendFrom32To64(main_~y~0), ~sign_extendFrom32To64(main_~y~0));assume_abort_if_not_#in~cond := (if ~bvslt64(main_~xy~0, ~sign_extendFrom32To64(2147483647bv32)) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {975#(and (exists ((ULTIMATE.start_main_~y~0 (_ BitVec 32))) (and (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~b~0) (= ULTIMATE.start_main_~yy~0 (bvmul ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ((_ sign_extend 32) ULTIMATE.start_main_~y~0))) (bvsge ULTIMATE.start_main_~y~0 (_ bv1 32)))) (exists ((ULTIMATE.start_main_~x~0 (_ BitVec 32))) (and (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)) (= ((_ sign_extend 32) ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~a~0))))} is UNKNOWN [2021-09-13 14:23:51,787 INFO L281 TraceCheckUtils]: 6: Hoare triple {975#(and (exists ((ULTIMATE.start_main_~y~0 (_ BitVec 32))) (and (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~b~0) (= ULTIMATE.start_main_~yy~0 (bvmul ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ((_ sign_extend 32) ULTIMATE.start_main_~y~0))) (bvsge ULTIMATE.start_main_~y~0 (_ bv1 32)))) (exists ((ULTIMATE.start_main_~x~0 (_ BitVec 32))) (and (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)) (= ((_ sign_extend 32) ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~a~0))))} assume !(0bv32 == assume_abort_if_not_~cond); {975#(and (exists ((ULTIMATE.start_main_~y~0 (_ BitVec 32))) (and (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~b~0) (= ULTIMATE.start_main_~yy~0 (bvmul ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ((_ sign_extend 32) ULTIMATE.start_main_~y~0))) (bvsge ULTIMATE.start_main_~y~0 (_ bv1 32)))) (exists ((ULTIMATE.start_main_~x~0 (_ BitVec 32))) (and (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)) (= ((_ sign_extend 32) ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~a~0))))} is VALID [2021-09-13 14:23:51,828 INFO L281 TraceCheckUtils]: 7: Hoare triple {975#(and (exists ((ULTIMATE.start_main_~y~0 (_ BitVec 32))) (and (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~b~0) (= ULTIMATE.start_main_~yy~0 (bvmul ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ((_ sign_extend 32) ULTIMATE.start_main_~y~0))) (bvsge ULTIMATE.start_main_~y~0 (_ bv1 32)))) (exists ((ULTIMATE.start_main_~x~0 (_ BitVec 32))) (and (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)) (= ((_ sign_extend 32) ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~a~0))))} assume_abort_if_not_#in~cond := (if ~bvslt64(main_~yy~0, ~sign_extendFrom32To64(2147483647bv32)) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {982#(and (exists ((ULTIMATE.start_main_~x~0 (_ BitVec 32))) (and (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)) (= ((_ sign_extend 32) ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~a~0))) (exists ((ULTIMATE.start_main_~y~0 (_ BitVec 32))) (and (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~b~0) (bvsge ULTIMATE.start_main_~y~0 (_ bv1 32)) (or (and (= ULTIMATE.start_assume_abort_if_not_~cond (_ bv1 32)) (bvslt (bvmul ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ((_ sign_extend 32) ULTIMATE.start_main_~y~0)) ((_ sign_extend 32) (_ bv2147483647 32)))) (and (not (bvslt (bvmul ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ((_ sign_extend 32) ULTIMATE.start_main_~y~0)) ((_ sign_extend 32) (_ bv2147483647 32)))) (= ULTIMATE.start_assume_abort_if_not_~cond (_ bv0 32)))))))} is VALID [2021-09-13 14:23:51,864 INFO L281 TraceCheckUtils]: 8: Hoare triple {982#(and (exists ((ULTIMATE.start_main_~x~0 (_ BitVec 32))) (and (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)) (= ((_ sign_extend 32) ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~a~0))) (exists ((ULTIMATE.start_main_~y~0 (_ BitVec 32))) (and (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~b~0) (bvsge ULTIMATE.start_main_~y~0 (_ bv1 32)) (or (and (= ULTIMATE.start_assume_abort_if_not_~cond (_ bv1 32)) (bvslt (bvmul ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ((_ sign_extend 32) ULTIMATE.start_main_~y~0)) ((_ sign_extend 32) (_ bv2147483647 32)))) (and (not (bvslt (bvmul ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ((_ sign_extend 32) ULTIMATE.start_main_~y~0)) ((_ sign_extend 32) (_ bv2147483647 32)))) (= ULTIMATE.start_assume_abort_if_not_~cond (_ bv0 32)))))))} assume !(0bv32 == assume_abort_if_not_~cond); {986#(and (exists ((ULTIMATE.start_main_~y~0 (_ BitVec 32))) (and (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~b~0) (bvsge ULTIMATE.start_main_~y~0 (_ bv1 32)) (bvslt (bvmul ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ((_ sign_extend 32) ULTIMATE.start_main_~y~0)) ((_ sign_extend 32) (_ bv2147483647 32))))) (exists ((ULTIMATE.start_main_~x~0 (_ BitVec 32))) (and (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)) (= ((_ sign_extend 32) ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~a~0))))} is VALID [2021-09-13 14:23:51,866 INFO L281 TraceCheckUtils]: 9: Hoare triple {986#(and (exists ((ULTIMATE.start_main_~y~0 (_ BitVec 32))) (and (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~b~0) (bvsge ULTIMATE.start_main_~y~0 (_ bv1 32)) (bvslt (bvmul ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ((_ sign_extend 32) ULTIMATE.start_main_~y~0)) ((_ sign_extend 32) (_ bv2147483647 32))))) (exists ((ULTIMATE.start_main_~x~0 (_ BitVec 32))) (and (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)) (= ((_ sign_extend 32) ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~a~0))))} main_#t~post9 := ~counter~0;~counter~0 := ~bvadd32(1bv32, main_#t~post9); {986#(and (exists ((ULTIMATE.start_main_~y~0 (_ BitVec 32))) (and (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~b~0) (bvsge ULTIMATE.start_main_~y~0 (_ bv1 32)) (bvslt (bvmul ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ((_ sign_extend 32) ULTIMATE.start_main_~y~0)) ((_ sign_extend 32) (_ bv2147483647 32))))) (exists ((ULTIMATE.start_main_~x~0 (_ BitVec 32))) (and (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)) (= ((_ sign_extend 32) ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~a~0))))} is VALID [2021-09-13 14:23:51,867 INFO L281 TraceCheckUtils]: 10: Hoare triple {986#(and (exists ((ULTIMATE.start_main_~y~0 (_ BitVec 32))) (and (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~b~0) (bvsge ULTIMATE.start_main_~y~0 (_ bv1 32)) (bvslt (bvmul ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ((_ sign_extend 32) ULTIMATE.start_main_~y~0)) ((_ sign_extend 32) (_ bv2147483647 32))))) (exists ((ULTIMATE.start_main_~x~0 (_ BitVec 32))) (and (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)) (= ((_ sign_extend 32) ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~a~0))))} assume !!~bvslt32(main_#t~post9, 100bv32);havoc main_#t~post9; {986#(and (exists ((ULTIMATE.start_main_~y~0 (_ BitVec 32))) (and (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~b~0) (bvsge ULTIMATE.start_main_~y~0 (_ bv1 32)) (bvslt (bvmul ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ((_ sign_extend 32) ULTIMATE.start_main_~y~0)) ((_ sign_extend 32) (_ bv2147483647 32))))) (exists ((ULTIMATE.start_main_~x~0 (_ BitVec 32))) (and (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)) (= ((_ sign_extend 32) ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~a~0))))} is VALID [2021-09-13 14:23:51,867 INFO L281 TraceCheckUtils]: 11: Hoare triple {986#(and (exists ((ULTIMATE.start_main_~y~0 (_ BitVec 32))) (and (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~b~0) (bvsge ULTIMATE.start_main_~y~0 (_ bv1 32)) (bvslt (bvmul ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ((_ sign_extend 32) ULTIMATE.start_main_~y~0)) ((_ sign_extend 32) (_ bv2147483647 32))))) (exists ((ULTIMATE.start_main_~x~0 (_ BitVec 32))) (and (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)) (= ((_ sign_extend 32) ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~a~0))))} assume !!(main_~b~0 != ~sign_extendFrom32To64(0bv32));main_~c~0 := main_~a~0;main_~k~0 := ~sign_extendFrom32To64(0bv32); {996#(and (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~k~0) (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~c~0) (exists ((ULTIMATE.start_main_~y~0 (_ BitVec 32))) (and (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~b~0) (bvsge ULTIMATE.start_main_~y~0 (_ bv1 32)) (bvslt (bvmul ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ((_ sign_extend 32) ULTIMATE.start_main_~y~0)) ((_ sign_extend 32) (_ bv2147483647 32))))) (exists ((ULTIMATE.start_main_~x~0 (_ BitVec 32))) (and (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)) (= ((_ sign_extend 32) ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~a~0))))} is VALID [2021-09-13 14:23:51,868 INFO L281 TraceCheckUtils]: 12: Hoare triple {996#(and (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~k~0) (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~c~0) (exists ((ULTIMATE.start_main_~y~0 (_ BitVec 32))) (and (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~b~0) (bvsge ULTIMATE.start_main_~y~0 (_ bv1 32)) (bvslt (bvmul ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ((_ sign_extend 32) ULTIMATE.start_main_~y~0)) ((_ sign_extend 32) (_ bv2147483647 32))))) (exists ((ULTIMATE.start_main_~x~0 (_ BitVec 32))) (and (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)) (= ((_ sign_extend 32) ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~a~0))))} main_#t~post10 := ~counter~0;~counter~0 := ~bvadd32(1bv32, main_#t~post10); {996#(and (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~k~0) (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~c~0) (exists ((ULTIMATE.start_main_~y~0 (_ BitVec 32))) (and (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~b~0) (bvsge ULTIMATE.start_main_~y~0 (_ bv1 32)) (bvslt (bvmul ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ((_ sign_extend 32) ULTIMATE.start_main_~y~0)) ((_ sign_extend 32) (_ bv2147483647 32))))) (exists ((ULTIMATE.start_main_~x~0 (_ BitVec 32))) (and (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)) (= ((_ sign_extend 32) ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~a~0))))} is VALID [2021-09-13 14:23:51,869 INFO L281 TraceCheckUtils]: 13: Hoare triple {996#(and (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~k~0) (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~c~0) (exists ((ULTIMATE.start_main_~y~0 (_ BitVec 32))) (and (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~b~0) (bvsge ULTIMATE.start_main_~y~0 (_ bv1 32)) (bvslt (bvmul ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ((_ sign_extend 32) ULTIMATE.start_main_~y~0)) ((_ sign_extend 32) (_ bv2147483647 32))))) (exists ((ULTIMATE.start_main_~x~0 (_ BitVec 32))) (and (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)) (= ((_ sign_extend 32) ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~a~0))))} assume !!~bvslt32(main_#t~post10, 100bv32);havoc main_#t~post10;__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; {1003#(= ULTIMATE.start___VERIFIER_assert_~cond (_ bv1 32))} is VALID [2021-09-13 14:23:51,869 INFO L281 TraceCheckUtils]: 14: Hoare triple {1003#(= ULTIMATE.start___VERIFIER_assert_~cond (_ bv1 32))} assume 0bv32 == __VERIFIER_assert_~cond; {952#false} is VALID [2021-09-13 14:23:51,869 INFO L281 TraceCheckUtils]: 15: Hoare triple {952#false} assume !false; {952#false} is VALID [2021-09-13 14:23:51,870 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:23:51,870 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 14:23:54,991 INFO L281 TraceCheckUtils]: 15: Hoare triple {952#false} assume !false; {952#false} is VALID [2021-09-13 14:23:54,991 INFO L281 TraceCheckUtils]: 14: Hoare triple {1013#(not (= ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)))} assume 0bv32 == __VERIFIER_assert_~cond; {952#false} is VALID [2021-09-13 14:23:54,992 INFO L281 TraceCheckUtils]: 13: Hoare triple {1017#(= ULTIMATE.start_main_~a~0 (bvadd (bvmul ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0) ULTIMATE.start_main_~c~0))} assume !!~bvslt32(main_#t~post10, 100bv32);havoc main_#t~post10;__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; {1013#(not (= ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)))} is VALID [2021-09-13 14:23:54,993 INFO L281 TraceCheckUtils]: 12: Hoare triple {1017#(= ULTIMATE.start_main_~a~0 (bvadd (bvmul ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0) ULTIMATE.start_main_~c~0))} main_#t~post10 := ~counter~0;~counter~0 := ~bvadd32(1bv32, main_#t~post10); {1017#(= 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:23:54,993 INFO L281 TraceCheckUtils]: 11: Hoare triple {951#true} assume !!(main_~b~0 != ~sign_extendFrom32To64(0bv32));main_~c~0 := main_~a~0;main_~k~0 := ~sign_extendFrom32To64(0bv32); {1017#(= 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:23:54,993 INFO L281 TraceCheckUtils]: 10: Hoare triple {951#true} assume !!~bvslt32(main_#t~post9, 100bv32);havoc main_#t~post9; {951#true} is VALID [2021-09-13 14:23:54,994 INFO L281 TraceCheckUtils]: 9: Hoare triple {951#true} main_#t~post9 := ~counter~0;~counter~0 := ~bvadd32(1bv32, main_#t~post9); {951#true} is VALID [2021-09-13 14:23:54,994 INFO L281 TraceCheckUtils]: 8: Hoare triple {951#true} assume !(0bv32 == assume_abort_if_not_~cond); {951#true} is VALID [2021-09-13 14:23:54,994 INFO L281 TraceCheckUtils]: 7: Hoare triple {951#true} assume_abort_if_not_#in~cond := (if ~bvslt64(main_~yy~0, ~sign_extendFrom32To64(2147483647bv32)) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {951#true} is VALID [2021-09-13 14:23:54,994 INFO L281 TraceCheckUtils]: 6: Hoare triple {951#true} assume !(0bv32 == assume_abort_if_not_~cond); {951#true} is VALID [2021-09-13 14:23:54,994 INFO L281 TraceCheckUtils]: 5: Hoare triple {951#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);main_~c~0 := ~sign_extendFrom32To64(0bv32);main_~k~0 := ~sign_extendFrom32To64(0bv32);main_~xy~0 := ~bvmul64(~sign_extendFrom32To64(main_~x~0), ~sign_extendFrom32To64(main_~y~0));main_~yy~0 := ~bvmul64(~sign_extendFrom32To64(main_~y~0), ~sign_extendFrom32To64(main_~y~0));assume_abort_if_not_#in~cond := (if ~bvslt64(main_~xy~0, ~sign_extendFrom32To64(2147483647bv32)) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {951#true} is VALID [2021-09-13 14:23:54,995 INFO L281 TraceCheckUtils]: 4: Hoare triple {951#true} assume !(0bv32 == assume_abort_if_not_~cond); {951#true} is VALID [2021-09-13 14:23:54,995 INFO L281 TraceCheckUtils]: 3: Hoare triple {951#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; {951#true} is VALID [2021-09-13 14:23:54,995 INFO L281 TraceCheckUtils]: 2: Hoare triple {951#true} assume !(0bv32 == assume_abort_if_not_~cond); {951#true} is VALID [2021-09-13 14:23:54,995 INFO L281 TraceCheckUtils]: 1: Hoare triple {951#true} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~post10, main_~temp~0, main_#t~post9, main_~x~0, main_~y~0, main_~a~0, main_~b~0, main_~p~0, main_~q~0, main_~r~0, main_~s~0, main_~c~0, main_~k~0, main_~xy~0, main_~yy~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;havoc main_~c~0;havoc main_~k~0;havoc main_~xy~0;havoc main_~yy~0;main_~x~0 := main_#t~nondet7;havoc main_#t~nondet7;main_~y~0 := main_#t~nondet8;havoc main_#t~nondet8;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; {951#true} is VALID [2021-09-13 14:23:54,995 INFO L281 TraceCheckUtils]: 0: Hoare triple {951#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);~counter~0 := 0bv32; {951#true} is VALID [2021-09-13 14:23:54,996 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:23:54,996 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-09-13 14:23:54,996 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [407809542] [2021-09-13 14:23:54,996 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [407809542] provided 2 perfect and 0 imperfect interpolant sequences [2021-09-13 14:23:54,996 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-09-13 14:23:54,997 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11, 4] imperfect sequences [] total 13 [2021-09-13 14:23:54,997 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846909589] [2021-09-13 14:23:54,997 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 0 states have call successors, (0), 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 16 [2021-09-13 14:23:54,997 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:23:54,998 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:23:57,709 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 29 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2021-09-13 14:23:57,709 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-09-13 14:23:57,709 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-09-13 14:23:57,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-09-13 14:23:57,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2021-09-13 14:23:57,710 INFO L87 Difference]: Start difference. First operand 42 states and 45 transitions. Second operand has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:24:24,402 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-09-13 14:24:31,710 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:24:34,180 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-09-13 14:24:42,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:24:42,591 INFO L93 Difference]: Finished difference Result 53 states and 59 transitions. [2021-09-13 14:24:42,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-09-13 14:24:42,591 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 0 states have call successors, (0), 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 16 [2021-09-13 14:24:42,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:24:42,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:24:42,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 59 transitions. [2021-09-13 14:24:42,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:24:42,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 59 transitions. [2021-09-13 14:24:42,594 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 59 transitions. [2021-09-13 14:24:45,863 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 58 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2021-09-13 14:24:45,864 INFO L225 Difference]: With dead ends: 53 [2021-09-13 14:24:45,864 INFO L226 Difference]: Without dead ends: 51 [2021-09-13 14:24:45,864 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 9088.83ms TimeCoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2021-09-13 14:24:45,865 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 10 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20971.85ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.02ms SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 125 IncrementalHoareTripleChecker+Unchecked, 20977.68ms IncrementalHoareTripleChecker+Time [2021-09-13 14:24:45,866 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 0 Invalid, 407 Unknown, 0 Unchecked, 4.02ms Time], IncrementalHoareTripleChecker [7 Valid, 275 Invalid, 0 Unknown, 125 Unchecked, 20977.68ms Time] [2021-09-13 14:24:45,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2021-09-13 14:24:45,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 45. [2021-09-13 14:24:45,883 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:24:45,884 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand has 45 states, 39 states have (on average 1.2564102564102564) internal successors, (49), 44 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:24:45,884 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand has 45 states, 39 states have (on average 1.2564102564102564) internal successors, (49), 44 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:24:45,884 INFO L87 Difference]: Start difference. First operand 51 states. Second operand has 45 states, 39 states have (on average 1.2564102564102564) internal successors, (49), 44 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:24:45,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:24:45,887 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2021-09-13 14:24:45,887 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2021-09-13 14:24:45,888 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:24:45,888 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:24:45,889 INFO L74 IsIncluded]: Start isIncluded. First operand has 45 states, 39 states have (on average 1.2564102564102564) internal successors, (49), 44 states have internal predecessors, (49), 0 states have call successors, (0), 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 51 states. [2021-09-13 14:24:45,889 INFO L87 Difference]: Start difference. First operand has 45 states, 39 states have (on average 1.2564102564102564) internal successors, (49), 44 states have internal predecessors, (49), 0 states have call successors, (0), 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 51 states. [2021-09-13 14:24:45,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:24:45,890 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2021-09-13 14:24:45,891 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2021-09-13 14:24:45,891 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:24:45,891 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:24:45,891 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:24:45,891 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:24:45,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 39 states have (on average 1.2564102564102564) internal successors, (49), 44 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:24:45,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2021-09-13 14:24:45,895 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 16 [2021-09-13 14:24:45,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:24:45,895 INFO L470 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2021-09-13 14:24:45,896 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:24:45,896 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2021-09-13 14:24:45,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-09-13 14:24:45,900 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:24:45,900 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 14:24:45,910 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:24:46,101 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:24:46,101 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-09-13 14:24:46,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:24:46,102 INFO L82 PathProgramCache]: Analyzing trace with hash -1311460386, now seen corresponding path program 1 times [2021-09-13 14:24:46,102 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-09-13 14:24:46,102 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1999337475] [2021-09-13 14:24:46,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:24:46,103 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-09-13 14:24:46,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-09-13 14:24:46,103 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:24:46,106 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:24:46,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:24:46,474 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 12 conjunts are in the unsatisfiable core [2021-09-13 14:24:46,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:24:46,482 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:24:47,839 INFO L281 TraceCheckUtils]: 0: Hoare triple {1283#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);~counter~0 := 0bv32; {1283#true} is VALID [2021-09-13 14:24:47,841 INFO L281 TraceCheckUtils]: 1: Hoare triple {1283#true} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~post10, main_~temp~0, main_#t~post9, main_~x~0, main_~y~0, main_~a~0, main_~b~0, main_~p~0, main_~q~0, main_~r~0, main_~s~0, main_~c~0, main_~k~0, main_~xy~0, main_~yy~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;havoc main_~c~0;havoc main_~k~0;havoc main_~xy~0;havoc main_~yy~0;main_~x~0 := main_#t~nondet7;havoc main_#t~nondet7;main_~y~0 := main_#t~nondet8;havoc main_#t~nondet8;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; {1291#(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:24:47,841 INFO L281 TraceCheckUtils]: 2: Hoare triple {1291#(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); {1295#(bvsge ULTIMATE.start_main_~x~0 (_ bv1 32))} is VALID [2021-09-13 14:24:47,842 INFO L281 TraceCheckUtils]: 3: Hoare triple {1295#(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; {1299#(and (bvsge ULTIMATE.start_main_~x~0 (_ bv1 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:24:47,843 INFO L281 TraceCheckUtils]: 4: Hoare triple {1299#(and (bvsge ULTIMATE.start_main_~x~0 (_ bv1 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); {1303#(and (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv1 32)))} is VALID [2021-09-13 14:24:47,843 INFO L281 TraceCheckUtils]: 5: Hoare triple {1303#(and (bvsge ULTIMATE.start_main_~x~0 (_ bv1 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);main_~c~0 := ~sign_extendFrom32To64(0bv32);main_~k~0 := ~sign_extendFrom32To64(0bv32);main_~xy~0 := ~bvmul64(~sign_extendFrom32To64(main_~x~0), ~sign_extendFrom32To64(main_~y~0));main_~yy~0 := ~bvmul64(~sign_extendFrom32To64(main_~y~0), ~sign_extendFrom32To64(main_~y~0));assume_abort_if_not_#in~cond := (if ~bvslt64(main_~xy~0, ~sign_extendFrom32To64(2147483647bv32)) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {1307#(and (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~r~0) (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv1 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:24:47,844 INFO L281 TraceCheckUtils]: 6: Hoare triple {1307#(and (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~r~0) (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv1 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 !(0bv32 == assume_abort_if_not_~cond); {1307#(and (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~r~0) (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv1 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:24:47,845 INFO L281 TraceCheckUtils]: 7: Hoare triple {1307#(and (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~r~0) (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv1 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_abort_if_not_#in~cond := (if ~bvslt64(main_~yy~0, ~sign_extendFrom32To64(2147483647bv32)) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {1307#(and (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~r~0) (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv1 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:24:47,845 INFO L281 TraceCheckUtils]: 8: Hoare triple {1307#(and (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~r~0) (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv1 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 !(0bv32 == assume_abort_if_not_~cond); {1307#(and (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~r~0) (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv1 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:24:47,846 INFO L281 TraceCheckUtils]: 9: Hoare triple {1307#(and (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~r~0) (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv1 32)) (= ((_ sign_extend 32) ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~a~0) (= ((_ sign_extend 32) (_ bv1 32)) ULTIMATE.start_main_~p~0))} main_#t~post9 := ~counter~0;~counter~0 := ~bvadd32(1bv32, main_#t~post9); {1307#(and (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~r~0) (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv1 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:24:47,846 INFO L281 TraceCheckUtils]: 10: Hoare triple {1307#(and (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~r~0) (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv1 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 !!~bvslt32(main_#t~post9, 100bv32);havoc main_#t~post9; {1307#(and (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~r~0) (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv1 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:24:47,847 INFO L281 TraceCheckUtils]: 11: Hoare triple {1307#(and (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~r~0) (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv1 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));main_~c~0 := main_~a~0;main_~k~0 := ~sign_extendFrom32To64(0bv32); {1307#(and (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~r~0) (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv1 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:24:47,847 INFO L281 TraceCheckUtils]: 12: Hoare triple {1307#(and (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~r~0) (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv1 32)) (= ((_ sign_extend 32) ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~a~0) (= ((_ sign_extend 32) (_ bv1 32)) ULTIMATE.start_main_~p~0))} main_#t~post10 := ~counter~0;~counter~0 := ~bvadd32(1bv32, main_#t~post10); {1307#(and (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~r~0) (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv1 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:24:47,848 INFO L281 TraceCheckUtils]: 13: Hoare triple {1307#(and (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~r~0) (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv1 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 !!~bvslt32(main_#t~post10, 100bv32);havoc main_#t~post10;__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; {1307#(and (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~r~0) (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv1 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:24:47,849 INFO L281 TraceCheckUtils]: 14: Hoare triple {1307#(and (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~r~0) (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv1 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 !(0bv32 == __VERIFIER_assert_~cond); {1307#(and (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~r~0) (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv1 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:24:47,849 INFO L281 TraceCheckUtils]: 15: Hoare triple {1307#(and (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~r~0) (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv1 32)) (= ((_ sign_extend 32) ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~a~0) (= ((_ sign_extend 32) (_ bv1 32)) ULTIMATE.start_main_~p~0))} __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; {1338#(= ULTIMATE.start___VERIFIER_assert_~cond (_ bv1 32))} is VALID [2021-09-13 14:24:47,850 INFO L281 TraceCheckUtils]: 16: Hoare triple {1338#(= ULTIMATE.start___VERIFIER_assert_~cond (_ bv1 32))} assume 0bv32 == __VERIFIER_assert_~cond; {1284#false} is VALID [2021-09-13 14:24:47,850 INFO L281 TraceCheckUtils]: 17: Hoare triple {1284#false} assume !false; {1284#false} is VALID [2021-09-13 14:24:47,850 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:24:47,850 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 14:24:58,427 INFO L281 TraceCheckUtils]: 17: Hoare triple {1284#false} assume !false; {1284#false} is VALID [2021-09-13 14:24:58,428 INFO L281 TraceCheckUtils]: 16: Hoare triple {1348#(not (= ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)))} assume 0bv32 == __VERIFIER_assert_~cond; {1284#false} is VALID [2021-09-13 14:24:58,428 INFO L281 TraceCheckUtils]: 15: Hoare triple {1352#(= (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)} __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; {1348#(not (= ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)))} is VALID [2021-09-13 14:24:58,429 INFO L281 TraceCheckUtils]: 14: Hoare triple {1352#(= (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 !(0bv32 == __VERIFIER_assert_~cond); {1352#(= (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:24:58,429 INFO L281 TraceCheckUtils]: 13: Hoare triple {1352#(= (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 !!~bvslt32(main_#t~post10, 100bv32);havoc main_#t~post10;__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; {1352#(= (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:24:58,429 INFO L281 TraceCheckUtils]: 12: Hoare triple {1352#(= (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)} main_#t~post10 := ~counter~0;~counter~0 := ~bvadd32(1bv32, main_#t~post10); {1352#(= (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:24:58,430 INFO L281 TraceCheckUtils]: 11: Hoare triple {1352#(= (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));main_~c~0 := main_~a~0;main_~k~0 := ~sign_extendFrom32To64(0bv32); {1352#(= (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:24:58,430 INFO L281 TraceCheckUtils]: 10: Hoare triple {1352#(= (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 !!~bvslt32(main_#t~post9, 100bv32);havoc main_#t~post9; {1352#(= (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:24:58,430 INFO L281 TraceCheckUtils]: 9: Hoare triple {1352#(= (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)} main_#t~post9 := ~counter~0;~counter~0 := ~bvadd32(1bv32, main_#t~post9); {1352#(= (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:24:58,431 INFO L281 TraceCheckUtils]: 8: Hoare triple {1352#(= (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 !(0bv32 == assume_abort_if_not_~cond); {1352#(= (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:24:58,431 INFO L281 TraceCheckUtils]: 7: Hoare triple {1352#(= (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_abort_if_not_#in~cond := (if ~bvslt64(main_~yy~0, ~sign_extendFrom32To64(2147483647bv32)) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {1352#(= (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:24:58,431 INFO L281 TraceCheckUtils]: 6: Hoare triple {1352#(= (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 !(0bv32 == assume_abort_if_not_~cond); {1352#(= (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:24:58,432 INFO L281 TraceCheckUtils]: 5: Hoare triple {1283#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);main_~c~0 := ~sign_extendFrom32To64(0bv32);main_~k~0 := ~sign_extendFrom32To64(0bv32);main_~xy~0 := ~bvmul64(~sign_extendFrom32To64(main_~x~0), ~sign_extendFrom32To64(main_~y~0));main_~yy~0 := ~bvmul64(~sign_extendFrom32To64(main_~y~0), ~sign_extendFrom32To64(main_~y~0));assume_abort_if_not_#in~cond := (if ~bvslt64(main_~xy~0, ~sign_extendFrom32To64(2147483647bv32)) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {1352#(= (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:24:58,432 INFO L281 TraceCheckUtils]: 4: Hoare triple {1283#true} assume !(0bv32 == assume_abort_if_not_~cond); {1283#true} is VALID [2021-09-13 14:24:58,432 INFO L281 TraceCheckUtils]: 3: Hoare triple {1283#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; {1283#true} is VALID [2021-09-13 14:24:58,432 INFO L281 TraceCheckUtils]: 2: Hoare triple {1283#true} assume !(0bv32 == assume_abort_if_not_~cond); {1283#true} is VALID [2021-09-13 14:24:58,433 INFO L281 TraceCheckUtils]: 1: Hoare triple {1283#true} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~post10, main_~temp~0, main_#t~post9, main_~x~0, main_~y~0, main_~a~0, main_~b~0, main_~p~0, main_~q~0, main_~r~0, main_~s~0, main_~c~0, main_~k~0, main_~xy~0, main_~yy~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;havoc main_~c~0;havoc main_~k~0;havoc main_~xy~0;havoc main_~yy~0;main_~x~0 := main_#t~nondet7;havoc main_#t~nondet7;main_~y~0 := main_#t~nondet8;havoc main_#t~nondet8;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; {1283#true} is VALID [2021-09-13 14:24:58,433 INFO L281 TraceCheckUtils]: 0: Hoare triple {1283#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);~counter~0 := 0bv32; {1283#true} is VALID [2021-09-13 14:24:58,433 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:24:58,433 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-09-13 14:24:58,433 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1999337475] [2021-09-13 14:24:58,434 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1999337475] provided 2 perfect and 0 imperfect interpolant sequences [2021-09-13 14:24:58,434 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-09-13 14:24:58,434 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 4] imperfect sequences [] total 10 [2021-09-13 14:24:58,434 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267308879] [2021-09-13 14:24:58,435 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.4) internal successors, (34), 10 states have internal predecessors, (34), 0 states have call successors, (0), 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 18 [2021-09-13 14:24:58,435 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:24:58,435 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 3.4) internal successors, (34), 10 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:24:59,227 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:24:59,228 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-09-13 14:24:59,228 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-09-13 14:24:59,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-09-13 14:24:59,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-09-13 14:24:59,228 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand has 10 states, 10 states have (on average 3.4) internal successors, (34), 10 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:25:26,330 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-09-13 14:25:30,937 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-09-13 14:25:33,161 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-09-13 14:25:49,288 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-09-13 14:25:51,495 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:25:51,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-09-13 14:25:51,556 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 4419.57ms TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2021-09-13 14:25:51,557 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 95 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 27 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25270.76ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.68ms SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 25276.65ms IncrementalHoareTripleChecker+Time [2021-09-13 14:25:51,557 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [95 Valid, 0 Invalid, 284 Unknown, 0 Unchecked, 5.68ms Time], IncrementalHoareTripleChecker [27 Valid, 256 Invalid, 1 Unknown, 0 Unchecked, 25276.65ms Time] [2021-09-13 14:25:51,575 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:25:51,758 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:25:51,759 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@2331828c 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:25:51,763 INFO L158 Benchmark]: Toolchain (without parser) took 188300.94ms. Allocated memory was 52.4MB in the beginning and 65.0MB in the end (delta: 12.6MB). Free memory was 29.4MB in the beginning and 43.7MB in the end (delta: -14.3MB). Peak memory consumption was 20.7MB. Max. memory is 16.1GB. [2021-09-13 14:25:51,763 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 52.4MB. Free memory was 34.6MB in the beginning and 34.6MB in the end (delta: 39.6kB). There was no memory consumed. Max. memory is 16.1GB. [2021-09-13 14:25:51,764 INFO L158 Benchmark]: CACSL2BoogieTranslator took 263.91ms. Allocated memory was 52.4MB in the beginning and 65.0MB in the end (delta: 12.6MB). Free memory was 29.2MB in the beginning and 47.4MB in the end (delta: -18.2MB). Peak memory consumption was 7.3MB. Max. memory is 16.1GB. [2021-09-13 14:25:51,764 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.20ms. Allocated memory is still 65.0MB. Free memory was 47.2MB in the beginning and 45.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-09-13 14:25:51,764 INFO L158 Benchmark]: Boogie Preprocessor took 44.27ms. Allocated memory is still 65.0MB. Free memory was 45.2MB in the beginning and 43.7MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2021-09-13 14:25:51,765 INFO L158 Benchmark]: RCFGBuilder took 4381.37ms. Allocated memory is still 65.0MB. Free memory was 43.5MB in the beginning and 46.9MB in the end (delta: -3.4MB). Peak memory consumption was 16.4MB. Max. memory is 16.1GB. [2021-09-13 14:25:51,765 INFO L158 Benchmark]: TraceAbstraction took 183548.05ms. Allocated memory is still 65.0MB. Free memory was 46.2MB in the beginning and 43.7MB in the end (delta: 2.5MB). Peak memory consumption was 26.2MB. Max. memory is 16.1GB. [2021-09-13 14:25:51,766 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 52.4MB. Free memory was 34.6MB in the beginning and 34.6MB in the end (delta: 39.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 263.91ms. Allocated memory was 52.4MB in the beginning and 65.0MB in the end (delta: 12.6MB). Free memory was 29.2MB in the beginning and 47.4MB in the end (delta: -18.2MB). Peak memory consumption was 7.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.20ms. Allocated memory is still 65.0MB. Free memory was 47.2MB in the beginning and 45.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 44.27ms. Allocated memory is still 65.0MB. Free memory was 45.2MB in the beginning and 43.7MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 4381.37ms. Allocated memory is still 65.0MB. Free memory was 43.5MB in the beginning and 46.9MB in the end (delta: -3.4MB). Peak memory consumption was 16.4MB. Max. memory is 16.1GB. * TraceAbstraction took 183548.05ms. Allocated memory is still 65.0MB. Free memory was 46.2MB in the beginning and 43.7MB in the end (delta: 2.5MB). Peak memory consumption was 26.2MB. 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@2331828c de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker@2331828c: 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:25:51,826 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...