./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/egcd-ll_unwindbound50.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/egcd-ll_unwindbound50.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 5599d9c401794fe6c69a2059d512381ecdcef42a .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.2.1-wip.dd.seqcomp-5fbdf5b [2021-09-13 14:17:37,125 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-09-13 14:17:37,126 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-09-13 14:17:37,156 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-09-13 14:17:37,156 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-09-13 14:17:37,157 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-09-13 14:17:37,158 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-09-13 14:17:37,159 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-09-13 14:17:37,160 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-09-13 14:17:37,160 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-09-13 14:17:37,161 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-09-13 14:17:37,162 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-09-13 14:17:37,162 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-09-13 14:17:37,163 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-09-13 14:17:37,163 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-09-13 14:17:37,164 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-09-13 14:17:37,165 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-09-13 14:17:37,165 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-09-13 14:17:37,166 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-09-13 14:17:37,167 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-09-13 14:17:37,168 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-09-13 14:17:37,169 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-09-13 14:17:37,169 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-09-13 14:17:37,170 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-09-13 14:17:37,172 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-09-13 14:17:37,172 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-09-13 14:17:37,172 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-09-13 14:17:37,172 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-09-13 14:17:37,173 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-09-13 14:17:37,173 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-09-13 14:17:37,173 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-09-13 14:17:37,174 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-09-13 14:17:37,174 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-09-13 14:17:37,175 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-09-13 14:17:37,175 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-09-13 14:17:37,175 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-09-13 14:17:37,176 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-09-13 14:17:37,176 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-09-13 14:17:37,176 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-09-13 14:17:37,177 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-09-13 14:17:37,177 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-09-13 14:17:37,178 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:37,191 INFO L113 SettingsManager]: Loading preferences was successful [2021-09-13 14:17:37,192 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-09-13 14:17:37,192 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-09-13 14:17:37,192 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-09-13 14:17:37,193 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-09-13 14:17:37,193 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-09-13 14:17:37,193 INFO L138 SettingsManager]: * Use SBE=true [2021-09-13 14:17:37,193 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-09-13 14:17:37,193 INFO L138 SettingsManager]: * sizeof long=4 [2021-09-13 14:17:37,194 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-09-13 14:17:37,194 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-09-13 14:17:37,194 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-09-13 14:17:37,194 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-09-13 14:17:37,194 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-09-13 14:17:37,194 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-09-13 14:17:37,194 INFO L138 SettingsManager]: * sizeof long double=12 [2021-09-13 14:17:37,195 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-09-13 14:17:37,195 INFO L138 SettingsManager]: * Use constant arrays=true [2021-09-13 14:17:37,195 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-09-13 14:17:37,195 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-09-13 14:17:37,202 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-09-13 14:17:37,202 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-09-13 14:17:37,202 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-09-13 14:17:37,202 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-09-13 14:17:37,202 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-09-13 14:17:37,202 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-09-13 14:17:37,202 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-09-13 14:17:37,203 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-09-13 14:17:37,203 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-09-13 14:17:37,203 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-09-13 14:17:37,203 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 -> 5599d9c401794fe6c69a2059d512381ecdcef42a [2021-09-13 14:17:37,407 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-09-13 14:17:37,432 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-09-13 14:17:37,433 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-09-13 14:17:37,434 INFO L271 PluginConnector]: Initializing CDTParser... [2021-09-13 14:17:37,435 INFO L275 PluginConnector]: CDTParser initialized [2021-09-13 14:17:37,436 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/egcd-ll_unwindbound50.c [2021-09-13 14:17:37,488 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/952e36b05/e4cc0bab60e146c98a8f5a17125558f1/FLAG85e2eae90 [2021-09-13 14:17:37,853 INFO L306 CDTParser]: Found 1 translation units. [2021-09-13 14:17:37,854 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/egcd-ll_unwindbound50.c [2021-09-13 14:17:37,858 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/952e36b05/e4cc0bab60e146c98a8f5a17125558f1/FLAG85e2eae90 [2021-09-13 14:17:38,300 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/952e36b05/e4cc0bab60e146c98a8f5a17125558f1 [2021-09-13 14:17:38,302 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-09-13 14:17:38,303 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-09-13 14:17:38,317 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-09-13 14:17:38,317 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-09-13 14:17:38,320 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-09-13 14:17:38,321 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.09 02:17:38" (1/1) ... [2021-09-13 14:17:38,322 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@585f5bcf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:17:38, skipping insertion in model container [2021-09-13 14:17:38,322 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.09 02:17:38" (1/1) ... [2021-09-13 14:17:38,326 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-09-13 14:17:38,335 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-09-13 14:17:38,533 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/egcd-ll_unwindbound50.c[489,502] [2021-09-13 14:17:38,557 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-09-13 14:17:38,563 INFO L203 MainTranslator]: Completed pre-run [2021-09-13 14:17:38,571 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/egcd-ll_unwindbound50.c[489,502] [2021-09-13 14:17:38,576 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-09-13 14:17:38,585 INFO L208 MainTranslator]: Completed translation [2021-09-13 14:17:38,585 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:17:38 WrapperNode [2021-09-13 14:17:38,585 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-09-13 14:17:38,586 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-09-13 14:17:38,586 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-09-13 14:17:38,587 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-09-13 14:17:38,591 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:38" (1/1) ... [2021-09-13 14:17:38,627 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:38" (1/1) ... [2021-09-13 14:17:38,657 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-09-13 14:17:38,658 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-09-13 14:17:38,658 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-09-13 14:17:38,658 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-09-13 14:17:38,666 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:38" (1/1) ... [2021-09-13 14:17:38,666 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:38" (1/1) ... [2021-09-13 14:17:38,673 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:38" (1/1) ... [2021-09-13 14:17:38,673 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:38" (1/1) ... [2021-09-13 14:17:38,676 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:38" (1/1) ... [2021-09-13 14:17:38,678 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:38" (1/1) ... [2021-09-13 14:17:38,679 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:38" (1/1) ... [2021-09-13 14:17:38,680 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-09-13 14:17:38,680 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-09-13 14:17:38,680 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-09-13 14:17:38,681 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-09-13 14:17:38,681 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:17:38" (1/1) ... [2021-09-13 14:17:38,689 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-09-13 14:17:38,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:17:38,738 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:38,790 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:38,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-09-13 14:17:38,817 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-09-13 14:17:38,818 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-09-13 14:17:38,818 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-09-13 14:17:38,969 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-09-13 14:17:38,969 INFO L299 CfgBuilder]: Removed 23 assume(true) statements. [2021-09-13 14:17:38,971 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 02:17:38 BoogieIcfgContainer [2021-09-13 14:17:38,971 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-09-13 14:17:38,984 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-09-13 14:17:38,984 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-09-13 14:17:38,986 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-09-13 14:17:39,000 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.09 02:17:38" (1/3) ... [2021-09-13 14:17:39,001 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47b65a23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.09 02:17:39, skipping insertion in model container [2021-09-13 14:17:39,001 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:17:38" (2/3) ... [2021-09-13 14:17:39,001 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47b65a23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.09 02:17:39, skipping insertion in model container [2021-09-13 14:17:39,001 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 02:17:38" (3/3) ... [2021-09-13 14:17:39,002 INFO L111 eAbstractionObserver]: Analyzing ICFG egcd-ll_unwindbound50.c [2021-09-13 14:17:39,006 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-09-13 14:17:39,006 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2021-09-13 14:17:39,043 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-09-13 14:17:39,059 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:39,065 INFO L340 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-09-13 14:17:39,088 INFO L276 IsEmpty]: Start isEmpty. Operand has 41 states, 33 states have (on average 1.606060606060606) internal successors, (53), 40 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:17:39,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-09-13 14:17:39,091 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:17:39,092 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 14:17:39,092 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-09-13 14:17:39,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:17:39,096 INFO L82 PathProgramCache]: Analyzing trace with hash -1236199694, now seen corresponding path program 1 times [2021-09-13 14:17:39,102 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:17:39,102 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106304470] [2021-09-13 14:17:39,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:17:39,103 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:17:39,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:17:39,216 INFO L281 TraceCheckUtils]: 0: Hoare triple {44#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(10);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~counter~0 := 0; {44#true} is VALID [2021-09-13 14:17:39,216 INFO L281 TraceCheckUtils]: 1: Hoare triple {44#true} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~post9, main_~a~0, main_~b~0, main_~p~0, main_~q~0, main_~r~0, main_~s~0, main_~x~0, 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_~x~0;havoc main_~y~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; {44#true} is VALID [2021-09-13 14:17:39,217 INFO L281 TraceCheckUtils]: 2: Hoare triple {44#true} assume 0 == assume_abort_if_not_~cond;assume false; {45#false} is VALID [2021-09-13 14:17:39,217 INFO L281 TraceCheckUtils]: 3: Hoare triple {45#false} assume_abort_if_not_#in~cond := (if main_~y~0 >= 1 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {45#false} is VALID [2021-09-13 14:17:39,217 INFO L281 TraceCheckUtils]: 4: Hoare triple {45#false} assume 0 == assume_abort_if_not_~cond;assume false; {45#false} is VALID [2021-09-13 14:17:39,217 INFO L281 TraceCheckUtils]: 5: Hoare triple {45#false} main_~a~0 := main_~x~0;main_~b~0 := main_~y~0;main_~p~0 := 1;main_~q~0 := 0;main_~r~0 := 0;main_~s~0 := 1; {45#false} is VALID [2021-09-13 14:17:39,217 INFO L281 TraceCheckUtils]: 6: Hoare triple {45#false} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {45#false} is VALID [2021-09-13 14:17:39,217 INFO L281 TraceCheckUtils]: 7: Hoare triple {45#false} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 1 == main_~p~0 * main_~s~0 - main_~r~0 * main_~q~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {45#false} is VALID [2021-09-13 14:17:39,217 INFO L281 TraceCheckUtils]: 8: Hoare triple {45#false} assume 0 == __VERIFIER_assert_~cond; {45#false} is VALID [2021-09-13 14:17:39,218 INFO L281 TraceCheckUtils]: 9: Hoare triple {45#false} assume !false; {45#false} is VALID [2021-09-13 14:17:39,218 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:39,218 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:17:39,219 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106304470] [2021-09-13 14:17:39,219 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106304470] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-13 14:17:39,219 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-13 14:17:39,219 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-09-13 14:17:39,220 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369921175] [2021-09-13 14:17:39,223 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2021-09-13 14:17:39,224 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:17:39,226 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call 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:39,239 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:17:39,239 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-09-13 14:17:39,239 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:17:39,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-09-13 14:17:39,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-09-13 14:17:39,253 INFO L87 Difference]: Start difference. First operand has 41 states, 33 states have (on average 1.606060606060606) internal successors, (53), 40 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) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call 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:39,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:17:39,355 INFO L93 Difference]: Finished difference Result 79 states and 102 transitions. [2021-09-13 14:17:39,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-09-13 14:17:39,355 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2021-09-13 14:17:39,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:17:39,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call 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:39,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 102 transitions. [2021-09-13 14:17:39,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call 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:39,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 102 transitions. [2021-09-13 14:17:39,368 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 102 transitions. [2021-09-13 14:17:39,462 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:17:39,469 INFO L225 Difference]: With dead ends: 79 [2021-09-13 14:17:39,469 INFO L226 Difference]: Without dead ends: 37 [2021-09-13 14:17:39,483 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:39,485 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 41.56ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.46ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 42.63ms IncrementalHoareTripleChecker+Time [2021-09-13 14:17:39,485 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 43 Unknown, 0 Unchecked, 0.46ms Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 42.63ms Time] [2021-09-13 14:17:39,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2021-09-13 14:17:39,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2021-09-13 14:17:39,504 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:17:39,505 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand has 37 states, 30 states have (on average 1.3) internal successors, (39), 36 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:17:39,505 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand has 37 states, 30 states have (on average 1.3) internal successors, (39), 36 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:17:39,506 INFO L87 Difference]: Start difference. First operand 37 states. Second operand has 37 states, 30 states have (on average 1.3) internal successors, (39), 36 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:17:39,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:17:39,508 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2021-09-13 14:17:39,508 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2021-09-13 14:17:39,508 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:17:39,508 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:17:39,508 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 30 states have (on average 1.3) internal successors, (39), 36 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 37 states. [2021-09-13 14:17:39,509 INFO L87 Difference]: Start difference. First operand has 37 states, 30 states have (on average 1.3) internal successors, (39), 36 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 37 states. [2021-09-13 14:17:39,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:17:39,510 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2021-09-13 14:17:39,510 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2021-09-13 14:17:39,511 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:17:39,511 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:17:39,511 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:17:39,511 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:17:39,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 30 states have (on average 1.3) internal successors, (39), 36 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:17:39,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2021-09-13 14:17:39,513 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 10 [2021-09-13 14:17:39,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:17:39,513 INFO L470 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2021-09-13 14:17:39,513 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call 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:39,514 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2021-09-13 14:17:39,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-09-13 14:17:39,514 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:17:39,514 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 14:17:39,514 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-09-13 14:17:39,514 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-09-13 14:17:39,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:17:39,515 INFO L82 PathProgramCache]: Analyzing trace with hash -1988288018, now seen corresponding path program 1 times [2021-09-13 14:17:39,515 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:17:39,515 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718173882] [2021-09-13 14:17:39,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:17:39,515 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:17:39,528 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-09-13 14:17:39,529 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2133601770] [2021-09-13 14:17:39,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:17:39,529 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:17:39,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:17:39,530 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:39,562 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:39,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:17:39,591 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 9 conjunts are in the unsatisfiable core [2021-09-13 14:17:39,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:17:39,601 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:17:39,745 INFO L281 TraceCheckUtils]: 0: Hoare triple {263#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(10);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~counter~0 := 0; {263#true} is VALID [2021-09-13 14:17:39,745 INFO L281 TraceCheckUtils]: 1: Hoare triple {263#true} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~post9, main_~a~0, main_~b~0, main_~p~0, main_~q~0, main_~r~0, main_~s~0, main_~x~0, 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_~x~0;havoc main_~y~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; {263#true} is VALID [2021-09-13 14:17:39,745 INFO L281 TraceCheckUtils]: 2: Hoare triple {263#true} assume !(0 == assume_abort_if_not_~cond); {263#true} is VALID [2021-09-13 14:17:39,745 INFO L281 TraceCheckUtils]: 3: Hoare triple {263#true} assume_abort_if_not_#in~cond := (if main_~y~0 >= 1 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {263#true} is VALID [2021-09-13 14:17:39,745 INFO L281 TraceCheckUtils]: 4: Hoare triple {263#true} assume !(0 == assume_abort_if_not_~cond); {263#true} is VALID [2021-09-13 14:17:39,746 INFO L281 TraceCheckUtils]: 5: Hoare triple {263#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; {283#(and (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1))} is VALID [2021-09-13 14:17:39,746 INFO L281 TraceCheckUtils]: 6: Hoare triple {283#(and (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1))} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {283#(and (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1))} is VALID [2021-09-13 14:17:39,747 INFO L281 TraceCheckUtils]: 7: Hoare triple {283#(and (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1))} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 1 == main_~p~0 * main_~s~0 - main_~r~0 * main_~q~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {290#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} is VALID [2021-09-13 14:17:39,747 INFO L281 TraceCheckUtils]: 8: Hoare triple {290#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} assume 0 == __VERIFIER_assert_~cond; {264#false} is VALID [2021-09-13 14:17:39,748 INFO L281 TraceCheckUtils]: 9: Hoare triple {264#false} assume !false; {264#false} is VALID [2021-09-13 14:17:39,748 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:39,748 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-09-13 14:17:39,748 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:17:39,748 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718173882] [2021-09-13 14:17:39,748 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-09-13 14:17:39,748 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2133601770] [2021-09-13 14:17:39,749 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2133601770] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-13 14:17:39,749 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-13 14:17:39,749 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-09-13 14:17:39,749 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54434382] [2021-09-13 14:17:39,750 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2021-09-13 14:17:39,750 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:17:39,750 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call 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:39,757 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:17:39,758 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-09-13 14:17:39,758 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:17:39,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-09-13 14:17:39,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-09-13 14:17:39,758 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call 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:39,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:17:39,963 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2021-09-13 14:17:39,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-09-13 14:17:39,963 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2021-09-13 14:17:39,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:17:39,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call 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:39,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 72 transitions. [2021-09-13 14:17:39,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call 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:39,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 72 transitions. [2021-09-13 14:17:39,971 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 72 transitions. [2021-09-13 14:17:40,031 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:17:40,035 INFO L225 Difference]: With dead ends: 68 [2021-09-13 14:17:40,035 INFO L226 Difference]: Without dead ends: 64 [2021-09-13 14:17:40,036 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 19.97ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-09-13 14:17:40,038 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 26 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 76.20ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.05ms SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 83.10ms IncrementalHoareTripleChecker+Time [2021-09-13 14:17:40,039 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 0 Invalid, 121 Unknown, 0 Unchecked, 2.05ms Time], IncrementalHoareTripleChecker [5 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 83.10ms Time] [2021-09-13 14:17:40,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2021-09-13 14:17:40,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 52. [2021-09-13 14:17:40,061 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:17:40,063 INFO L82 GeneralOperation]: Start isEquivalent. First operand 64 states. Second operand has 52 states, 45 states have (on average 1.3555555555555556) internal successors, (61), 51 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:40,063 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand has 52 states, 45 states have (on average 1.3555555555555556) internal successors, (61), 51 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:40,065 INFO L87 Difference]: Start difference. First operand 64 states. Second operand has 52 states, 45 states have (on average 1.3555555555555556) internal successors, (61), 51 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:40,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:17:40,072 INFO L93 Difference]: Finished difference Result 64 states and 68 transitions. [2021-09-13 14:17:40,072 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2021-09-13 14:17:40,073 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:17:40,073 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:17:40,073 INFO L74 IsIncluded]: Start isIncluded. First operand has 52 states, 45 states have (on average 1.3555555555555556) internal successors, (61), 51 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 64 states. [2021-09-13 14:17:40,074 INFO L87 Difference]: Start difference. First operand has 52 states, 45 states have (on average 1.3555555555555556) internal successors, (61), 51 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 64 states. [2021-09-13 14:17:40,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:17:40,077 INFO L93 Difference]: Finished difference Result 64 states and 68 transitions. [2021-09-13 14:17:40,077 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2021-09-13 14:17:40,078 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:17:40,078 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:17:40,078 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:17:40,078 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:17:40,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 45 states have (on average 1.3555555555555556) internal successors, (61), 51 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:40,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 61 transitions. [2021-09-13 14:17:40,082 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 61 transitions. Word has length 10 [2021-09-13 14:17:40,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:17:40,082 INFO L470 AbstractCegarLoop]: Abstraction has 52 states and 61 transitions. [2021-09-13 14:17:40,082 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call 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:40,082 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 61 transitions. [2021-09-13 14:17:40,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-09-13 14:17:40,087 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:17:40,087 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 14:17:40,129 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:40,304 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:40,305 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-09-13 14:17:40,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:17:40,307 INFO L82 PathProgramCache]: Analyzing trace with hash -1507402239, now seen corresponding path program 1 times [2021-09-13 14:17:40,307 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:17:40,307 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733544317] [2021-09-13 14:17:40,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:17:40,308 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:17:40,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:17:40,379 INFO L281 TraceCheckUtils]: 0: Hoare triple {573#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(10);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~counter~0 := 0; {575#(= ~counter~0 0)} is VALID [2021-09-13 14:17:40,379 INFO L281 TraceCheckUtils]: 1: Hoare triple {575#(= ~counter~0 0)} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~post9, main_~a~0, main_~b~0, main_~p~0, main_~q~0, main_~r~0, main_~s~0, main_~x~0, 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_~x~0;havoc main_~y~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; {575#(= ~counter~0 0)} is VALID [2021-09-13 14:17:40,380 INFO L281 TraceCheckUtils]: 2: Hoare triple {575#(= ~counter~0 0)} assume !(0 == assume_abort_if_not_~cond); {575#(= ~counter~0 0)} is VALID [2021-09-13 14:17:40,380 INFO L281 TraceCheckUtils]: 3: Hoare triple {575#(= ~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; {575#(= ~counter~0 0)} is VALID [2021-09-13 14:17:40,381 INFO L281 TraceCheckUtils]: 4: Hoare triple {575#(= ~counter~0 0)} assume !(0 == assume_abort_if_not_~cond); {575#(= ~counter~0 0)} is VALID [2021-09-13 14:17:40,381 INFO L281 TraceCheckUtils]: 5: Hoare triple {575#(= ~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; {575#(= ~counter~0 0)} is VALID [2021-09-13 14:17:40,382 INFO L281 TraceCheckUtils]: 6: Hoare triple {575#(= ~counter~0 0)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {576#(= |ULTIMATE.start_main_#t~post9| 0)} is VALID [2021-09-13 14:17:40,382 INFO L281 TraceCheckUtils]: 7: Hoare triple {576#(= |ULTIMATE.start_main_#t~post9| 0)} assume !(main_#t~post9 < 50);havoc main_#t~post9; {574#false} is VALID [2021-09-13 14:17:40,382 INFO L281 TraceCheckUtils]: 8: Hoare triple {574#false} __VERIFIER_assert_#in~cond := (if 0 == main_~a~0 - main_~b~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {574#false} is VALID [2021-09-13 14:17:40,382 INFO L281 TraceCheckUtils]: 9: Hoare triple {574#false} assume 0 == __VERIFIER_assert_~cond; {574#false} is VALID [2021-09-13 14:17:40,383 INFO L281 TraceCheckUtils]: 10: Hoare triple {574#false} assume !false; {574#false} is VALID [2021-09-13 14:17:40,386 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:40,386 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:17:40,387 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733544317] [2021-09-13 14:17:40,387 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733544317] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-13 14:17:40,387 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-13 14:17:40,387 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-09-13 14:17:40,387 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874687081] [2021-09-13 14:17:40,388 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2021-09-13 14:17:40,388 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:17:40,388 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call 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:40,397 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:17:40,398 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-09-13 14:17:40,398 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:17:40,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-09-13 14:17:40,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-09-13 14:17:40,399 INFO L87 Difference]: Start difference. First operand 52 states and 61 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call 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:40,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:17:40,549 INFO L93 Difference]: Finished difference Result 68 states and 77 transitions. [2021-09-13 14:17:40,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-09-13 14:17:40,550 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2021-09-13 14:17:40,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:17:40,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call 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:40,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 55 transitions. [2021-09-13 14:17:40,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call 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:40,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 55 transitions. [2021-09-13 14:17:40,552 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 55 transitions. [2021-09-13 14:17:40,591 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:17:40,593 INFO L225 Difference]: With dead ends: 68 [2021-09-13 14:17:40,595 INFO L226 Difference]: Without dead ends: 54 [2021-09-13 14:17:40,597 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.40ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-09-13 14:17:40,599 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 65.10ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.06ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 66.29ms IncrementalHoareTripleChecker+Time [2021-09-13 14:17:40,601 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 111 Unknown, 0 Unchecked, 1.06ms Time], IncrementalHoareTripleChecker [0 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 66.29ms Time] [2021-09-13 14:17:40,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2021-09-13 14:17:40,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2021-09-13 14:17:40,625 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:17:40,625 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand has 54 states, 47 states have (on average 1.3404255319148937) internal successors, (63), 53 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:40,625 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand has 54 states, 47 states have (on average 1.3404255319148937) internal successors, (63), 53 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:40,630 INFO L87 Difference]: Start difference. First operand 54 states. Second operand has 54 states, 47 states have (on average 1.3404255319148937) internal successors, (63), 53 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:40,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:17:40,632 INFO L93 Difference]: Finished difference Result 54 states and 63 transitions. [2021-09-13 14:17:40,632 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2021-09-13 14:17:40,632 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:17:40,634 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:17:40,634 INFO L74 IsIncluded]: Start isIncluded. First operand has 54 states, 47 states have (on average 1.3404255319148937) internal successors, (63), 53 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 54 states. [2021-09-13 14:17:40,634 INFO L87 Difference]: Start difference. First operand has 54 states, 47 states have (on average 1.3404255319148937) internal successors, (63), 53 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 54 states. [2021-09-13 14:17:40,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:17:40,636 INFO L93 Difference]: Finished difference Result 54 states and 63 transitions. [2021-09-13 14:17:40,636 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2021-09-13 14:17:40,636 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:17:40,636 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:17:40,636 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:17:40,637 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:17:40,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 47 states have (on average 1.3404255319148937) internal successors, (63), 53 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:40,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 63 transitions. [2021-09-13 14:17:40,638 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 63 transitions. Word has length 11 [2021-09-13 14:17:40,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:17:40,638 INFO L470 AbstractCegarLoop]: Abstraction has 54 states and 63 transitions. [2021-09-13 14:17:40,638 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call 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:40,638 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2021-09-13 14:17:40,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-09-13 14:17:40,639 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:17:40,639 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 14:17:40,640 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-09-13 14:17:40,640 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-09-13 14:17:40,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:17:40,643 INFO L82 PathProgramCache]: Analyzing trace with hash 515817425, now seen corresponding path program 1 times [2021-09-13 14:17:40,643 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:17:40,643 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546751137] [2021-09-13 14:17:40,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:17:40,643 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:17:40,653 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-09-13 14:17:40,658 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [442623192] [2021-09-13 14:17:40,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:17:40,659 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:17:40,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:17:40,659 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:40,661 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:40,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:17:40,694 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 19 conjunts are in the unsatisfiable core [2021-09-13 14:17:40,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:17:40,700 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:17:41,013 INFO L281 TraceCheckUtils]: 0: Hoare triple {840#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(10);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~counter~0 := 0; {840#true} is VALID [2021-09-13 14:17:41,014 INFO L281 TraceCheckUtils]: 1: Hoare triple {840#true} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~post9, main_~a~0, main_~b~0, main_~p~0, main_~q~0, main_~r~0, main_~s~0, main_~x~0, 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_~x~0;havoc main_~y~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; {848#(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:41,014 INFO L281 TraceCheckUtils]: 2: Hoare triple {848#(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); {852#(<= 1 ULTIMATE.start_main_~x~0)} is VALID [2021-09-13 14:17:41,015 INFO L281 TraceCheckUtils]: 3: Hoare triple {852#(<= 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; {856#(and (or (and (< ULTIMATE.start_main_~y~0 1) (= ULTIMATE.start_assume_abort_if_not_~cond 0)) (and (= ULTIMATE.start_assume_abort_if_not_~cond 1) (<= 1 ULTIMATE.start_main_~y~0))) (<= 1 ULTIMATE.start_main_~x~0))} is VALID [2021-09-13 14:17:41,015 INFO L281 TraceCheckUtils]: 4: Hoare triple {856#(and (or (and (< ULTIMATE.start_main_~y~0 1) (= ULTIMATE.start_assume_abort_if_not_~cond 0)) (and (= ULTIMATE.start_assume_abort_if_not_~cond 1) (<= 1 ULTIMATE.start_main_~y~0))) (<= 1 ULTIMATE.start_main_~x~0))} assume !(0 == assume_abort_if_not_~cond); {860#(and (<= 1 ULTIMATE.start_main_~y~0) (<= 1 ULTIMATE.start_main_~x~0))} is VALID [2021-09-13 14:17:41,016 INFO L281 TraceCheckUtils]: 5: Hoare triple {860#(and (<= 1 ULTIMATE.start_main_~y~0) (<= 1 ULTIMATE.start_main_~x~0))} main_~a~0 := main_~x~0;main_~b~0 := main_~y~0;main_~p~0 := 1;main_~q~0 := 0;main_~r~0 := 0;main_~s~0 := 1; {864#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~p~0 1) (<= 1 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~r~0 0) (<= 1 ULTIMATE.start_main_~x~0))} is VALID [2021-09-13 14:17:41,017 INFO L281 TraceCheckUtils]: 6: Hoare triple {864#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~p~0 1) (<= 1 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~r~0 0) (<= 1 ULTIMATE.start_main_~x~0))} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {864#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~p~0 1) (<= 1 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~r~0 0) (<= 1 ULTIMATE.start_main_~x~0))} is VALID [2021-09-13 14:17:41,017 INFO L281 TraceCheckUtils]: 7: Hoare triple {864#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~p~0 1) (<= 1 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~r~0 0) (<= 1 ULTIMATE.start_main_~x~0))} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 1 == main_~p~0 * main_~s~0 - main_~r~0 * main_~q~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {864#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~p~0 1) (<= 1 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~r~0 0) (<= 1 ULTIMATE.start_main_~x~0))} is VALID [2021-09-13 14:17:41,018 INFO L281 TraceCheckUtils]: 8: Hoare triple {864#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~p~0 1) (<= 1 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~r~0 0) (<= 1 ULTIMATE.start_main_~x~0))} assume !(0 == __VERIFIER_assert_~cond); {864#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~p~0 1) (<= 1 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~r~0 0) (<= 1 ULTIMATE.start_main_~x~0))} is VALID [2021-09-13 14:17:41,018 INFO L281 TraceCheckUtils]: 9: Hoare triple {864#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~p~0 1) (<= 1 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~r~0 0) (<= 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; {877#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} is VALID [2021-09-13 14:17:41,018 INFO L281 TraceCheckUtils]: 10: Hoare triple {877#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} assume 0 == __VERIFIER_assert_~cond; {841#false} is VALID [2021-09-13 14:17:41,019 INFO L281 TraceCheckUtils]: 11: Hoare triple {841#false} assume !false; {841#false} is VALID [2021-09-13 14:17:41,019 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:41,019 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-09-13 14:17:41,019 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:17:41,019 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546751137] [2021-09-13 14:17:41,019 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-09-13 14:17:41,020 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [442623192] [2021-09-13 14:17:41,020 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [442623192] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-13 14:17:41,020 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-13 14:17:41,020 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-09-13 14:17:41,020 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922112972] [2021-09-13 14:17:41,020 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 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 12 [2021-09-13 14:17:41,020 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:17:41,021 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call 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:41,029 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:17:41,029 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-09-13 14:17:41,029 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:17:41,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-09-13 14:17:41,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-09-13 14:17:41,030 INFO L87 Difference]: Start difference. First operand 54 states and 63 transitions. Second operand has 8 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call 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:41,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:17:41,411 INFO L93 Difference]: Finished difference Result 66 states and 70 transitions. [2021-09-13 14:17:41,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-09-13 14:17:41,411 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 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 12 [2021-09-13 14:17:41,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:17:41,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call 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:41,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 68 transitions. [2021-09-13 14:17:41,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call 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:41,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 68 transitions. [2021-09-13 14:17:41,413 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 68 transitions. [2021-09-13 14:17:41,460 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:17:41,461 INFO L225 Difference]: With dead ends: 66 [2021-09-13 14:17:41,461 INFO L226 Difference]: Without dead ends: 64 [2021-09-13 14:17:41,462 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 156.82ms TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2021-09-13 14:17:41,462 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 238 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 82.31ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.66ms SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 83.38ms IncrementalHoareTripleChecker+Time [2021-09-13 14:17:41,462 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [238 Valid, 0 Invalid, 132 Unknown, 0 Unchecked, 2.66ms Time], IncrementalHoareTripleChecker [9 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 83.38ms Time] [2021-09-13 14:17:41,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2021-09-13 14:17:41,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 54. [2021-09-13 14:17:41,491 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:17:41,492 INFO L82 GeneralOperation]: Start isEquivalent. First operand 64 states. Second operand has 54 states, 47 states have (on average 1.3191489361702127) internal successors, (62), 53 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:41,492 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand has 54 states, 47 states have (on average 1.3191489361702127) internal successors, (62), 53 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:41,492 INFO L87 Difference]: Start difference. First operand 64 states. Second operand has 54 states, 47 states have (on average 1.3191489361702127) internal successors, (62), 53 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:41,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:17:41,493 INFO L93 Difference]: Finished difference Result 64 states and 68 transitions. [2021-09-13 14:17:41,493 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2021-09-13 14:17:41,494 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:17:41,494 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:17:41,494 INFO L74 IsIncluded]: Start isIncluded. First operand has 54 states, 47 states have (on average 1.3191489361702127) internal successors, (62), 53 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 64 states. [2021-09-13 14:17:41,494 INFO L87 Difference]: Start difference. First operand has 54 states, 47 states have (on average 1.3191489361702127) internal successors, (62), 53 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 64 states. [2021-09-13 14:17:41,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:17:41,496 INFO L93 Difference]: Finished difference Result 64 states and 68 transitions. [2021-09-13 14:17:41,496 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2021-09-13 14:17:41,496 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:17:41,496 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:17:41,496 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:17:41,496 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:17:41,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 47 states have (on average 1.3191489361702127) internal successors, (62), 53 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:41,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 62 transitions. [2021-09-13 14:17:41,498 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 62 transitions. Word has length 12 [2021-09-13 14:17:41,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:17:41,498 INFO L470 AbstractCegarLoop]: Abstraction has 54 states and 62 transitions. [2021-09-13 14:17:41,498 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call 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:41,498 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 62 transitions. [2021-09-13 14:17:41,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-09-13 14:17:41,498 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:17:41,499 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 14:17:41,517 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:41,715 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,SelfDestructingSolverStorable3 [2021-09-13 14:17:41,715 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-09-13 14:17:41,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:17:41,715 INFO L82 PathProgramCache]: Analyzing trace with hash 1779462740, now seen corresponding path program 1 times [2021-09-13 14:17:41,715 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:17:41,715 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746403987] [2021-09-13 14:17:41,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:17:41,716 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:17:41,724 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-09-13 14:17:41,724 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [171002061] [2021-09-13 14:17:41,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:17:41,724 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:17:41,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:17:41,725 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:41,761 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:41,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:17:41,778 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 14 conjunts are in the unsatisfiable core [2021-09-13 14:17:41,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:17:41,784 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:17:42,017 INFO L281 TraceCheckUtils]: 0: Hoare triple {1168#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(10);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~counter~0 := 0; {1168#true} is VALID [2021-09-13 14:17:42,017 INFO L281 TraceCheckUtils]: 1: Hoare triple {1168#true} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~post9, main_~a~0, main_~b~0, main_~p~0, main_~q~0, main_~r~0, main_~s~0, main_~x~0, 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_~x~0;havoc main_~y~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; {1176#(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:42,018 INFO L281 TraceCheckUtils]: 2: Hoare triple {1176#(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); {1180#(<= 1 ULTIMATE.start_main_~x~0)} is VALID [2021-09-13 14:17:42,018 INFO L281 TraceCheckUtils]: 3: Hoare triple {1180#(<= 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; {1180#(<= 1 ULTIMATE.start_main_~x~0)} is VALID [2021-09-13 14:17:42,019 INFO L281 TraceCheckUtils]: 4: Hoare triple {1180#(<= 1 ULTIMATE.start_main_~x~0)} assume !(0 == assume_abort_if_not_~cond); {1180#(<= 1 ULTIMATE.start_main_~x~0)} is VALID [2021-09-13 14:17:42,019 INFO L281 TraceCheckUtils]: 5: Hoare triple {1180#(<= 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; {1190#(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:42,019 INFO L281 TraceCheckUtils]: 6: Hoare triple {1190#(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; {1190#(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:42,020 INFO L281 TraceCheckUtils]: 7: Hoare triple {1190#(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 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 1 == main_~p~0 * main_~s~0 - main_~r~0 * main_~q~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1190#(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:42,020 INFO L281 TraceCheckUtils]: 8: Hoare triple {1190#(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); {1190#(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:42,021 INFO L281 TraceCheckUtils]: 9: Hoare triple {1190#(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; {1190#(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:42,021 INFO L281 TraceCheckUtils]: 10: Hoare triple {1190#(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); {1190#(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:42,022 INFO L281 TraceCheckUtils]: 11: Hoare triple {1190#(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; {1209#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} is VALID [2021-09-13 14:17:42,022 INFO L281 TraceCheckUtils]: 12: Hoare triple {1209#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} assume 0 == __VERIFIER_assert_~cond; {1169#false} is VALID [2021-09-13 14:17:42,022 INFO L281 TraceCheckUtils]: 13: Hoare triple {1169#false} assume !false; {1169#false} is VALID [2021-09-13 14:17:42,023 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:42,023 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-09-13 14:17:42,023 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:17:42,023 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746403987] [2021-09-13 14:17:42,023 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-09-13 14:17:42,023 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [171002061] [2021-09-13 14:17:42,023 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [171002061] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-13 14:17:42,023 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-13 14:17:42,023 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-09-13 14:17:42,024 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387629068] [2021-09-13 14:17:42,024 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 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:42,024 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:17:42,024 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 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:42,040 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:42,041 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-09-13 14:17:42,041 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:17:42,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-09-13 14:17:42,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-09-13 14:17:42,042 INFO L87 Difference]: Start difference. First operand 54 states and 62 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 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:42,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:17:42,345 INFO L93 Difference]: Finished difference Result 104 states and 121 transitions. [2021-09-13 14:17:42,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-09-13 14:17:42,346 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 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:42,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:17:42,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 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:42,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 78 transitions. [2021-09-13 14:17:42,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 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:42,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 78 transitions. [2021-09-13 14:17:42,348 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 78 transitions. [2021-09-13 14:17:42,399 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:17:42,400 INFO L225 Difference]: With dead ends: 104 [2021-09-13 14:17:42,400 INFO L226 Difference]: Without dead ends: 96 [2021-09-13 14:17:42,401 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 52.82ms TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-09-13 14:17:42,401 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 74 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 97.92ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.97ms SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 99.28ms IncrementalHoareTripleChecker+Time [2021-09-13 14:17:42,401 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [74 Valid, 0 Invalid, 165 Unknown, 0 Unchecked, 0.97ms Time], IncrementalHoareTripleChecker [5 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 99.28ms Time] [2021-09-13 14:17:42,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2021-09-13 14:17:42,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 80. [2021-09-13 14:17:42,462 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:17:42,462 INFO L82 GeneralOperation]: Start isEquivalent. First operand 96 states. Second operand has 80 states, 73 states have (on average 1.3424657534246576) internal successors, (98), 79 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call 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:42,462 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand has 80 states, 73 states have (on average 1.3424657534246576) internal successors, (98), 79 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call 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:42,462 INFO L87 Difference]: Start difference. First operand 96 states. Second operand has 80 states, 73 states have (on average 1.3424657534246576) internal successors, (98), 79 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call 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:42,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:17:42,464 INFO L93 Difference]: Finished difference Result 96 states and 111 transitions. [2021-09-13 14:17:42,464 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 111 transitions. [2021-09-13 14:17:42,465 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:17:42,465 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:17:42,465 INFO L74 IsIncluded]: Start isIncluded. First operand has 80 states, 73 states have (on average 1.3424657534246576) internal successors, (98), 79 states have internal predecessors, (98), 0 states have call successors, (0), 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 96 states. [2021-09-13 14:17:42,465 INFO L87 Difference]: Start difference. First operand has 80 states, 73 states have (on average 1.3424657534246576) internal successors, (98), 79 states have internal predecessors, (98), 0 states have call successors, (0), 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 96 states. [2021-09-13 14:17:42,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:17:42,467 INFO L93 Difference]: Finished difference Result 96 states and 111 transitions. [2021-09-13 14:17:42,467 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 111 transitions. [2021-09-13 14:17:42,467 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:17:42,467 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:17:42,467 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:17:42,467 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:17:42,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 73 states have (on average 1.3424657534246576) internal successors, (98), 79 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call 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:42,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 98 transitions. [2021-09-13 14:17:42,469 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 98 transitions. Word has length 14 [2021-09-13 14:17:42,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:17:42,470 INFO L470 AbstractCegarLoop]: Abstraction has 80 states and 98 transitions. [2021-09-13 14:17:42,470 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 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:42,470 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 98 transitions. [2021-09-13 14:17:42,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-09-13 14:17:42,470 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:17:42,470 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 14:17:42,489 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:42,687 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:17:42,687 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-09-13 14:17:42,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:17:42,687 INFO L82 PathProgramCache]: Analyzing trace with hash -801918668, now seen corresponding path program 1 times [2021-09-13 14:17:42,687 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:17:42,687 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110056763] [2021-09-13 14:17:42,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:17:42,687 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:17:42,695 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-09-13 14:17:42,695 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2083104354] [2021-09-13 14:17:42,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:17:42,695 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:17:42,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:17:42,696 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:42,697 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:42,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:17:42,725 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 5 conjunts are in the unsatisfiable core [2021-09-13 14:17:42,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:17:42,730 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:17:42,810 INFO L281 TraceCheckUtils]: 0: Hoare triple {1649#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(10);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~counter~0 := 0; {1649#true} is VALID [2021-09-13 14:17:42,810 INFO L281 TraceCheckUtils]: 1: Hoare triple {1649#true} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~post9, main_~a~0, main_~b~0, main_~p~0, main_~q~0, main_~r~0, main_~s~0, main_~x~0, 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_~x~0;havoc main_~y~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; {1649#true} is VALID [2021-09-13 14:17:42,810 INFO L281 TraceCheckUtils]: 2: Hoare triple {1649#true} assume !(0 == assume_abort_if_not_~cond); {1649#true} is VALID [2021-09-13 14:17:42,810 INFO L281 TraceCheckUtils]: 3: Hoare triple {1649#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; {1649#true} is VALID [2021-09-13 14:17:42,810 INFO L281 TraceCheckUtils]: 4: Hoare triple {1649#true} assume !(0 == assume_abort_if_not_~cond); {1649#true} is VALID [2021-09-13 14:17:42,811 INFO L281 TraceCheckUtils]: 5: Hoare triple {1649#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; {1649#true} is VALID [2021-09-13 14:17:42,811 INFO L281 TraceCheckUtils]: 6: Hoare triple {1649#true} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {1649#true} is VALID [2021-09-13 14:17:42,811 INFO L281 TraceCheckUtils]: 7: Hoare triple {1649#true} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 1 == main_~p~0 * main_~s~0 - main_~r~0 * main_~q~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1649#true} is VALID [2021-09-13 14:17:42,811 INFO L281 TraceCheckUtils]: 8: Hoare triple {1649#true} assume !(0 == __VERIFIER_assert_~cond); {1649#true} is VALID [2021-09-13 14:17:42,811 INFO L281 TraceCheckUtils]: 9: Hoare triple {1649#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; {1649#true} is VALID [2021-09-13 14:17:42,811 INFO L281 TraceCheckUtils]: 10: Hoare triple {1649#true} assume !(0 == __VERIFIER_assert_~cond); {1649#true} is VALID [2021-09-13 14:17:42,811 INFO L281 TraceCheckUtils]: 11: Hoare triple {1649#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; {1649#true} is VALID [2021-09-13 14:17:42,812 INFO L281 TraceCheckUtils]: 12: Hoare triple {1649#true} assume !(0 == __VERIFIER_assert_~cond); {1649#true} is VALID [2021-09-13 14:17:42,812 INFO L281 TraceCheckUtils]: 13: Hoare triple {1649#true} assume !(main_~a~0 != main_~b~0); {1693#(= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~a~0)} is VALID [2021-09-13 14:17:42,812 INFO L281 TraceCheckUtils]: 14: Hoare triple {1693#(= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~a~0)} __VERIFIER_assert_#in~cond := (if 0 == main_~a~0 - main_~b~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1697#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} is VALID [2021-09-13 14:17:42,813 INFO L281 TraceCheckUtils]: 15: Hoare triple {1697#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} assume 0 == __VERIFIER_assert_~cond; {1650#false} is VALID [2021-09-13 14:17:42,813 INFO L281 TraceCheckUtils]: 16: Hoare triple {1650#false} assume !false; {1650#false} is VALID [2021-09-13 14:17:42,813 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:42,813 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-09-13 14:17:42,813 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:17:42,813 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110056763] [2021-09-13 14:17:42,814 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-09-13 14:17:42,814 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2083104354] [2021-09-13 14:17:42,814 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2083104354] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-13 14:17:42,814 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-13 14:17:42,814 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-09-13 14:17:42,814 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881097074] [2021-09-13 14:17:42,814 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-09-13 14:17:42,815 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:17:42,815 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:17:42,825 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:17:42,825 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-09-13 14:17:42,826 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:17:42,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-09-13 14:17:42,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-09-13 14:17:42,826 INFO L87 Difference]: Start difference. First operand 80 states and 98 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:17:43,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:17:43,044 INFO L93 Difference]: Finished difference Result 108 states and 129 transitions. [2021-09-13 14:17:43,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-09-13 14:17:43,044 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-09-13 14:17:43,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:17:43,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:17:43,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 54 transitions. [2021-09-13 14:17:43,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:17:43,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 54 transitions. [2021-09-13 14:17:43,046 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 54 transitions. [2021-09-13 14:17:43,077 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:17:43,078 INFO L225 Difference]: With dead ends: 108 [2021-09-13 14:17:43,078 INFO L226 Difference]: Without dead ends: 106 [2021-09-13 14:17:43,078 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.69ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-09-13 14:17:43,079 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 13 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 68.16ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.52ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 68.86ms IncrementalHoareTripleChecker+Time [2021-09-13 14:17:43,079 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 0 Invalid, 133 Unknown, 0 Unchecked, 0.52ms Time], IncrementalHoareTripleChecker [1 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 68.86ms Time] [2021-09-13 14:17:43,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2021-09-13 14:17:43,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 86. [2021-09-13 14:17:43,144 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:17:43,144 INFO L82 GeneralOperation]: Start isEquivalent. First operand 106 states. Second operand has 86 states, 79 states have (on average 1.3037974683544304) internal successors, (103), 85 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call 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:43,145 INFO L74 IsIncluded]: Start isIncluded. First operand 106 states. Second operand has 86 states, 79 states have (on average 1.3037974683544304) internal successors, (103), 85 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call 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:43,145 INFO L87 Difference]: Start difference. First operand 106 states. Second operand has 86 states, 79 states have (on average 1.3037974683544304) internal successors, (103), 85 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call 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:43,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:17:43,147 INFO L93 Difference]: Finished difference Result 106 states and 124 transitions. [2021-09-13 14:17:43,147 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 124 transitions. [2021-09-13 14:17:43,147 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:17:43,147 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:17:43,147 INFO L74 IsIncluded]: Start isIncluded. First operand has 86 states, 79 states have (on average 1.3037974683544304) internal successors, (103), 85 states have internal predecessors, (103), 0 states have call successors, (0), 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 106 states. [2021-09-13 14:17:43,148 INFO L87 Difference]: Start difference. First operand has 86 states, 79 states have (on average 1.3037974683544304) internal successors, (103), 85 states have internal predecessors, (103), 0 states have call successors, (0), 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 106 states. [2021-09-13 14:17:43,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:17:43,150 INFO L93 Difference]: Finished difference Result 106 states and 124 transitions. [2021-09-13 14:17:43,150 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 124 transitions. [2021-09-13 14:17:43,150 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:17:43,150 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:17:43,150 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:17:43,150 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:17:43,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 79 states have (on average 1.3037974683544304) internal successors, (103), 85 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call 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:43,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 103 transitions. [2021-09-13 14:17:43,152 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 103 transitions. Word has length 17 [2021-09-13 14:17:43,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:17:43,152 INFO L470 AbstractCegarLoop]: Abstraction has 86 states and 103 transitions. [2021-09-13 14:17:43,152 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:17:43,153 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 103 transitions. [2021-09-13 14:17:43,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-09-13 14:17:43,153 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:17:43,153 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 14:17:43,171 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-09-13 14:17:43,369 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:17:43,369 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-09-13 14:17:43,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:17:43,370 INFO L82 PathProgramCache]: Analyzing trace with hash -1844536457, now seen corresponding path program 1 times [2021-09-13 14:17:43,370 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:17:43,370 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426427383] [2021-09-13 14:17:43,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:17:43,370 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:17:43,378 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-09-13 14:17:43,378 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [752515384] [2021-09-13 14:17:43,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:17:43,378 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:17:43,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:17:43,385 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:43,386 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:43,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:17:43,419 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 10 conjunts are in the unsatisfiable core [2021-09-13 14:17:43,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:17:43,425 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:17:43,587 INFO L281 TraceCheckUtils]: 0: Hoare triple {2166#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(10);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~counter~0 := 0; {2166#true} is VALID [2021-09-13 14:17:43,587 INFO L281 TraceCheckUtils]: 1: Hoare triple {2166#true} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~post9, main_~a~0, main_~b~0, main_~p~0, main_~q~0, main_~r~0, main_~s~0, main_~x~0, 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_~x~0;havoc main_~y~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; {2166#true} is VALID [2021-09-13 14:17:43,587 INFO L281 TraceCheckUtils]: 2: Hoare triple {2166#true} assume !(0 == assume_abort_if_not_~cond); {2166#true} is VALID [2021-09-13 14:17:43,587 INFO L281 TraceCheckUtils]: 3: Hoare triple {2166#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; {2166#true} is VALID [2021-09-13 14:17:43,588 INFO L281 TraceCheckUtils]: 4: Hoare triple {2166#true} assume !(0 == assume_abort_if_not_~cond); {2166#true} is VALID [2021-09-13 14:17:43,588 INFO L281 TraceCheckUtils]: 5: Hoare triple {2166#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; {2166#true} is VALID [2021-09-13 14:17:43,588 INFO L281 TraceCheckUtils]: 6: Hoare triple {2166#true} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {2166#true} is VALID [2021-09-13 14:17:43,588 INFO L281 TraceCheckUtils]: 7: Hoare triple {2166#true} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 1 == main_~p~0 * main_~s~0 - main_~r~0 * main_~q~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {2166#true} is VALID [2021-09-13 14:17:43,588 INFO L281 TraceCheckUtils]: 8: Hoare triple {2166#true} assume !(0 == __VERIFIER_assert_~cond); {2166#true} is VALID [2021-09-13 14:17:43,589 INFO L281 TraceCheckUtils]: 9: Hoare triple {2166#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; {2198#(or (and (= 0 ULTIMATE.start___VERIFIER_assert_~cond) (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))))) (and (= 1 ULTIMATE.start___VERIFIER_assert_~cond) (= 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:17:43,589 INFO L281 TraceCheckUtils]: 10: Hoare triple {2198#(or (and (= 0 ULTIMATE.start___VERIFIER_assert_~cond) (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))))) (and (= 1 ULTIMATE.start___VERIFIER_assert_~cond) (= 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); {2202#(= 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:17:43,590 INFO L281 TraceCheckUtils]: 11: Hoare triple {2202#(= 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; {2202#(= 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:17:43,590 INFO L281 TraceCheckUtils]: 12: Hoare triple {2202#(= 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); {2202#(= 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:17:43,590 INFO L281 TraceCheckUtils]: 13: Hoare triple {2202#(= 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_~a~0 != main_~b~0); {2212#(= ULTIMATE.start_main_~b~0 (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)))} is VALID [2021-09-13 14:17:43,591 INFO L281 TraceCheckUtils]: 14: Hoare triple {2212#(= 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)))} __VERIFIER_assert_#in~cond := (if 0 == main_~a~0 - main_~b~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {2212#(= ULTIMATE.start_main_~b~0 (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)))} is VALID [2021-09-13 14:17:43,591 INFO L281 TraceCheckUtils]: 15: Hoare triple {2212#(= ULTIMATE.start_main_~b~0 (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)))} assume !(0 == __VERIFIER_assert_~cond); {2212#(= ULTIMATE.start_main_~b~0 (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)))} is VALID [2021-09-13 14:17:43,591 INFO L281 TraceCheckUtils]: 16: Hoare triple {2212#(= 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)))} __VERIFIER_assert_#in~cond := (if 0 == main_~p~0 * main_~x~0 + main_~r~0 * main_~y~0 - main_~b~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {2222#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} is VALID [2021-09-13 14:17:43,592 INFO L281 TraceCheckUtils]: 17: Hoare triple {2222#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} assume 0 == __VERIFIER_assert_~cond; {2167#false} is VALID [2021-09-13 14:17:43,592 INFO L281 TraceCheckUtils]: 18: Hoare triple {2167#false} assume !false; {2167#false} is VALID [2021-09-13 14:17:43,592 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:43,592 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-09-13 14:17:43,592 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:17:43,592 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426427383] [2021-09-13 14:17:43,593 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-09-13 14:17:43,593 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [752515384] [2021-09-13 14:17:43,593 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [752515384] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-13 14:17:43,593 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-13 14:17:43,593 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-09-13 14:17:43,593 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782446196] [2021-09-13 14:17:43,594 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-09-13 14:17:43,594 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:17:43,594 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:17:43,606 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:17:43,606 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-09-13 14:17:43,607 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:17:43,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-09-13 14:17:43,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-09-13 14:17:43,607 INFO L87 Difference]: Start difference. First operand 86 states and 103 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:17:44,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:17:44,066 INFO L93 Difference]: Finished difference Result 131 states and 149 transitions. [2021-09-13 14:17:44,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-09-13 14:17:44,067 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-09-13 14:17:44,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:17:44,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:17:44,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 77 transitions. [2021-09-13 14:17:44,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:17:44,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 77 transitions. [2021-09-13 14:17:44,068 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 77 transitions. [2021-09-13 14:17:44,112 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:17:44,113 INFO L225 Difference]: With dead ends: 131 [2021-09-13 14:17:44,113 INFO L226 Difference]: Without dead ends: 123 [2021-09-13 14:17:44,113 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 65.90ms TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2021-09-13 14:17:44,114 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 47 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 151.61ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.04ms SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 153.02ms IncrementalHoareTripleChecker+Time [2021-09-13 14:17:44,114 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 0 Invalid, 259 Unknown, 0 Unchecked, 1.04ms Time], IncrementalHoareTripleChecker [10 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 153.02ms Time] [2021-09-13 14:17:44,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2021-09-13 14:17:44,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 93. [2021-09-13 14:17:44,202 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:17:44,202 INFO L82 GeneralOperation]: Start isEquivalent. First operand 123 states. Second operand has 93 states, 86 states have (on average 1.2906976744186047) internal successors, (111), 92 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:17:44,202 INFO L74 IsIncluded]: Start isIncluded. First operand 123 states. Second operand has 93 states, 86 states have (on average 1.2906976744186047) internal successors, (111), 92 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:17:44,202 INFO L87 Difference]: Start difference. First operand 123 states. Second operand has 93 states, 86 states have (on average 1.2906976744186047) internal successors, (111), 92 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:17:44,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:17:44,216 INFO L93 Difference]: Finished difference Result 123 states and 138 transitions. [2021-09-13 14:17:44,216 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 138 transitions. [2021-09-13 14:17:44,216 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:17:44,217 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:17:44,221 INFO L74 IsIncluded]: Start isIncluded. First operand has 93 states, 86 states have (on average 1.2906976744186047) internal successors, (111), 92 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 123 states. [2021-09-13 14:17:44,222 INFO L87 Difference]: Start difference. First operand has 93 states, 86 states have (on average 1.2906976744186047) internal successors, (111), 92 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 123 states. [2021-09-13 14:17:44,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:17:44,224 INFO L93 Difference]: Finished difference Result 123 states and 138 transitions. [2021-09-13 14:17:44,224 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 138 transitions. [2021-09-13 14:17:44,224 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:17:44,224 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:17:44,224 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:17:44,225 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:17:44,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 86 states have (on average 1.2906976744186047) internal successors, (111), 92 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:17:44,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 111 transitions. [2021-09-13 14:17:44,232 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 111 transitions. Word has length 19 [2021-09-13 14:17:44,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:17:44,233 INFO L470 AbstractCegarLoop]: Abstraction has 93 states and 111 transitions. [2021-09-13 14:17:44,234 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:17:44,234 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 111 transitions. [2021-09-13 14:17:44,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-09-13 14:17:44,234 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:17:44,234 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 14:17:44,251 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:44,435 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:17:44,436 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-09-13 14:17:44,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:17:44,436 INFO L82 PathProgramCache]: Analyzing trace with hash -1795587856, now seen corresponding path program 1 times [2021-09-13 14:17:44,436 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:17:44,436 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753341981] [2021-09-13 14:17:44,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:17:44,437 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:17:44,472 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-09-13 14:17:44,481 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [461679659] [2021-09-13 14:17:44,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:17:44,481 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:17:44,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:17:44,482 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:44,502 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:44,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:17:44,540 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 11 conjunts are in the unsatisfiable core [2021-09-13 14:17:44,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:17:44,547 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:17:44,792 INFO L281 TraceCheckUtils]: 0: Hoare triple {2768#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(10);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~counter~0 := 0; {2768#true} is VALID [2021-09-13 14:17:44,792 INFO L281 TraceCheckUtils]: 1: Hoare triple {2768#true} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~post9, main_~a~0, main_~b~0, main_~p~0, main_~q~0, main_~r~0, main_~s~0, main_~x~0, 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_~x~0;havoc main_~y~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; {2768#true} is VALID [2021-09-13 14:17:44,792 INFO L281 TraceCheckUtils]: 2: Hoare triple {2768#true} assume !(0 == assume_abort_if_not_~cond); {2768#true} is VALID [2021-09-13 14:17:44,792 INFO L281 TraceCheckUtils]: 3: Hoare triple {2768#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; {2768#true} is VALID [2021-09-13 14:17:44,793 INFO L281 TraceCheckUtils]: 4: Hoare triple {2768#true} assume !(0 == assume_abort_if_not_~cond); {2768#true} is VALID [2021-09-13 14:17:44,793 INFO L281 TraceCheckUtils]: 5: Hoare triple {2768#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; {2788#(and (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~s~0 1))} is VALID [2021-09-13 14:17:44,794 INFO L281 TraceCheckUtils]: 6: Hoare triple {2788#(and (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~s~0 1))} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {2788#(and (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~s~0 1))} is VALID [2021-09-13 14:17:44,794 INFO L281 TraceCheckUtils]: 7: Hoare triple {2788#(and (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~s~0 1))} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 1 == main_~p~0 * main_~s~0 - main_~r~0 * main_~q~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {2788#(and (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~s~0 1))} is VALID [2021-09-13 14:17:44,794 INFO L281 TraceCheckUtils]: 8: Hoare triple {2788#(and (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~s~0 1))} assume !(0 == __VERIFIER_assert_~cond); {2788#(and (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~s~0 1))} is VALID [2021-09-13 14:17:44,795 INFO L281 TraceCheckUtils]: 9: Hoare triple {2788#(and (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~s~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; {2788#(and (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~s~0 1))} is VALID [2021-09-13 14:17:44,795 INFO L281 TraceCheckUtils]: 10: Hoare triple {2788#(and (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~s~0 1))} assume !(0 == __VERIFIER_assert_~cond); {2788#(and (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~s~0 1))} is VALID [2021-09-13 14:17:44,796 INFO L281 TraceCheckUtils]: 11: Hoare triple {2788#(and (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~s~0 1))} __VERIFIER_assert_#in~cond := (if main_~b~0 == main_~x~0 * main_~q~0 + main_~y~0 * main_~s~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {2788#(and (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~s~0 1))} is VALID [2021-09-13 14:17:44,796 INFO L281 TraceCheckUtils]: 12: Hoare triple {2788#(and (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~s~0 1))} assume !(0 == __VERIFIER_assert_~cond); {2788#(and (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~s~0 1))} is VALID [2021-09-13 14:17:44,797 INFO L281 TraceCheckUtils]: 13: Hoare triple {2788#(and (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~s~0 1))} assume !!(main_~a~0 != main_~b~0); {2788#(and (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~s~0 1))} is VALID [2021-09-13 14:17:44,797 INFO L281 TraceCheckUtils]: 14: Hoare triple {2788#(and (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~s~0 1))} assume main_~a~0 > main_~b~0;main_~a~0 := main_~a~0 - main_~b~0;main_~p~0 := main_~p~0 - main_~q~0;main_~r~0 := main_~r~0 - main_~s~0; {2788#(and (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~s~0 1))} is VALID [2021-09-13 14:17:44,798 INFO L281 TraceCheckUtils]: 15: Hoare triple {2788#(and (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~s~0 1))} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {2788#(and (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~s~0 1))} is VALID [2021-09-13 14:17:44,798 INFO L281 TraceCheckUtils]: 16: Hoare triple {2788#(and (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~s~0 1))} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 1 == main_~p~0 * main_~s~0 - main_~r~0 * main_~q~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {2822#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} is VALID [2021-09-13 14:17:44,799 INFO L281 TraceCheckUtils]: 17: Hoare triple {2822#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} assume 0 == __VERIFIER_assert_~cond; {2769#false} is VALID [2021-09-13 14:17:44,799 INFO L281 TraceCheckUtils]: 18: Hoare triple {2769#false} assume !false; {2769#false} is VALID [2021-09-13 14:17:44,799 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-09-13 14:17:44,799 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 14:24:23,953 INFO L281 TraceCheckUtils]: 18: Hoare triple {2769#false} assume !false; {2769#false} is VALID [2021-09-13 14:24:23,954 INFO L281 TraceCheckUtils]: 17: Hoare triple {2822#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} assume 0 == __VERIFIER_assert_~cond; {2769#false} is VALID [2021-09-13 14:24:23,956 INFO L281 TraceCheckUtils]: 16: Hoare triple {2835#(forall ((ULTIMATE.start_main_~r~0 Int)) (= (+ (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~r~0) 1) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~s~0)))} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 1 == main_~p~0 * main_~s~0 - main_~r~0 * main_~q~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {2822#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} is VALID [2021-09-13 14:24:23,957 INFO L281 TraceCheckUtils]: 15: Hoare triple {2835#(forall ((ULTIMATE.start_main_~r~0 Int)) (= (+ (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~r~0) 1) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~s~0)))} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {2835#(forall ((ULTIMATE.start_main_~r~0 Int)) (= (+ (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~r~0) 1) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~s~0)))} is VALID [2021-09-13 14:24:23,960 INFO L281 TraceCheckUtils]: 14: Hoare triple {2835#(forall ((ULTIMATE.start_main_~r~0 Int)) (= (+ (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~r~0) 1) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~s~0)))} assume main_~a~0 > main_~b~0;main_~a~0 := main_~a~0 - main_~b~0;main_~p~0 := main_~p~0 - main_~q~0;main_~r~0 := main_~r~0 - main_~s~0; {2835#(forall ((ULTIMATE.start_main_~r~0 Int)) (= (+ (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~r~0) 1) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~s~0)))} is VALID [2021-09-13 14:24:23,960 INFO L281 TraceCheckUtils]: 13: Hoare triple {2835#(forall ((ULTIMATE.start_main_~r~0 Int)) (= (+ (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~r~0) 1) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~s~0)))} assume !!(main_~a~0 != main_~b~0); {2835#(forall ((ULTIMATE.start_main_~r~0 Int)) (= (+ (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~r~0) 1) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~s~0)))} is VALID [2021-09-13 14:24:23,962 INFO L281 TraceCheckUtils]: 12: Hoare triple {2835#(forall ((ULTIMATE.start_main_~r~0 Int)) (= (+ (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~r~0) 1) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~s~0)))} assume !(0 == __VERIFIER_assert_~cond); {2835#(forall ((ULTIMATE.start_main_~r~0 Int)) (= (+ (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~r~0) 1) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~s~0)))} is VALID [2021-09-13 14:24:23,962 INFO L281 TraceCheckUtils]: 11: Hoare triple {2835#(forall ((ULTIMATE.start_main_~r~0 Int)) (= (+ (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~r~0) 1) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~s~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; {2835#(forall ((ULTIMATE.start_main_~r~0 Int)) (= (+ (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~r~0) 1) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~s~0)))} is VALID [2021-09-13 14:24:23,972 INFO L281 TraceCheckUtils]: 10: Hoare triple {2835#(forall ((ULTIMATE.start_main_~r~0 Int)) (= (+ (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~r~0) 1) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~s~0)))} assume !(0 == __VERIFIER_assert_~cond); {2835#(forall ((ULTIMATE.start_main_~r~0 Int)) (= (+ (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~r~0) 1) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~s~0)))} is VALID [2021-09-13 14:24:23,972 INFO L281 TraceCheckUtils]: 9: Hoare triple {2835#(forall ((ULTIMATE.start_main_~r~0 Int)) (= (+ (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~r~0) 1) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~s~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; {2835#(forall ((ULTIMATE.start_main_~r~0 Int)) (= (+ (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~r~0) 1) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~s~0)))} is VALID [2021-09-13 14:24:23,973 INFO L281 TraceCheckUtils]: 8: Hoare triple {2835#(forall ((ULTIMATE.start_main_~r~0 Int)) (= (+ (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~r~0) 1) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~s~0)))} assume !(0 == __VERIFIER_assert_~cond); {2835#(forall ((ULTIMATE.start_main_~r~0 Int)) (= (+ (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~r~0) 1) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~s~0)))} is VALID [2021-09-13 14:24:23,973 INFO L281 TraceCheckUtils]: 7: Hoare triple {2835#(forall ((ULTIMATE.start_main_~r~0 Int)) (= (+ (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~r~0) 1) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~s~0)))} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 1 == main_~p~0 * main_~s~0 - main_~r~0 * main_~q~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {2835#(forall ((ULTIMATE.start_main_~r~0 Int)) (= (+ (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~r~0) 1) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~s~0)))} is VALID [2021-09-13 14:24:23,973 INFO L281 TraceCheckUtils]: 6: Hoare triple {2835#(forall ((ULTIMATE.start_main_~r~0 Int)) (= (+ (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~r~0) 1) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~s~0)))} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {2835#(forall ((ULTIMATE.start_main_~r~0 Int)) (= (+ (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~r~0) 1) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~s~0)))} is VALID [2021-09-13 14:24:23,974 INFO L281 TraceCheckUtils]: 5: Hoare triple {2768#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; {2835#(forall ((ULTIMATE.start_main_~r~0 Int)) (= (+ (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~r~0) 1) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~s~0)))} is VALID [2021-09-13 14:24:23,974 INFO L281 TraceCheckUtils]: 4: Hoare triple {2768#true} assume !(0 == assume_abort_if_not_~cond); {2768#true} is VALID [2021-09-13 14:24:23,974 INFO L281 TraceCheckUtils]: 3: Hoare triple {2768#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; {2768#true} is VALID [2021-09-13 14:24:23,974 INFO L281 TraceCheckUtils]: 2: Hoare triple {2768#true} assume !(0 == assume_abort_if_not_~cond); {2768#true} is VALID [2021-09-13 14:24:23,974 INFO L281 TraceCheckUtils]: 1: Hoare triple {2768#true} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~post9, main_~a~0, main_~b~0, main_~p~0, main_~q~0, main_~r~0, main_~s~0, main_~x~0, 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_~x~0;havoc main_~y~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; {2768#true} is VALID [2021-09-13 14:24:23,974 INFO L281 TraceCheckUtils]: 0: Hoare triple {2768#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(10);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~counter~0 := 0; {2768#true} is VALID [2021-09-13 14:24:23,974 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-09-13 14:24:23,974 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:24:23,975 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753341981] [2021-09-13 14:24:23,975 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-09-13 14:24:23,975 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [461679659] [2021-09-13 14:24:23,975 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [461679659] provided 0 perfect and 2 imperfect interpolant sequences [2021-09-13 14:24:23,975 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-09-13 14:24:23,975 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2021-09-13 14:24:23,975 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085765719] [2021-09-13 14:24:23,975 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 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 19 [2021-09-13 14:24:23,975 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:24:23,975 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 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:24:23,999 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:24:24,000 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-09-13 14:24:24,000 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:24:24,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-09-13 14:24:24,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-09-13 14:24:24,001 INFO L87 Difference]: Start difference. First operand 93 states and 111 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 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:24:24,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:24:24,235 INFO L93 Difference]: Finished difference Result 103 states and 116 transitions. [2021-09-13 14:24:24,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-09-13 14:24:24,236 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 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 19 [2021-09-13 14:24:24,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:24:24,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 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:24:24,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 66 transitions. [2021-09-13 14:24:24,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 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:24:24,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 66 transitions. [2021-09-13 14:24:24,237 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 66 transitions. [2021-09-13 14:24:24,284 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:24:24,285 INFO L225 Difference]: With dead ends: 103 [2021-09-13 14:24:24,285 INFO L226 Difference]: Without dead ends: 93 [2021-09-13 14:24:24,285 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 30 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 340.05ms TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-09-13 14:24:24,286 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 27 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 64.18ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.62ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 38 IncrementalHoareTripleChecker+Unchecked, 65.01ms IncrementalHoareTripleChecker+Time [2021-09-13 14:24:24,286 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 0 Invalid, 141 Unknown, 0 Unchecked, 0.62ms Time], IncrementalHoareTripleChecker [2 Valid, 101 Invalid, 0 Unknown, 38 Unchecked, 65.01ms Time] [2021-09-13 14:24:24,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2021-09-13 14:24:24,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 87. [2021-09-13 14:24:24,372 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:24:24,373 INFO L82 GeneralOperation]: Start isEquivalent. First operand 93 states. Second operand has 87 states, 80 states have (on average 1.275) internal successors, (102), 86 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:24:24,377 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand has 87 states, 80 states have (on average 1.275) internal successors, (102), 86 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:24:24,383 INFO L87 Difference]: Start difference. First operand 93 states. Second operand has 87 states, 80 states have (on average 1.275) internal successors, (102), 86 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:24:24,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:24:24,385 INFO L93 Difference]: Finished difference Result 93 states and 105 transitions. [2021-09-13 14:24:24,385 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 105 transitions. [2021-09-13 14:24:24,385 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:24:24,386 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:24:24,387 INFO L74 IsIncluded]: Start isIncluded. First operand has 87 states, 80 states have (on average 1.275) internal successors, (102), 86 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 93 states. [2021-09-13 14:24:24,400 INFO L87 Difference]: Start difference. First operand has 87 states, 80 states have (on average 1.275) internal successors, (102), 86 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 93 states. [2021-09-13 14:24:24,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:24:24,402 INFO L93 Difference]: Finished difference Result 93 states and 105 transitions. [2021-09-13 14:24:24,402 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 105 transitions. [2021-09-13 14:24:24,402 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:24:24,402 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:24:24,403 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:24:24,403 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:24:24,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 80 states have (on average 1.275) internal successors, (102), 86 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:24:24,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 102 transitions. [2021-09-13 14:24:24,404 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 102 transitions. Word has length 19 [2021-09-13 14:24:24,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:24:24,405 INFO L470 AbstractCegarLoop]: Abstraction has 87 states and 102 transitions. [2021-09-13 14:24:24,405 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 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:24:24,405 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 102 transitions. [2021-09-13 14:24:24,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-09-13 14:24:24,405 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:24:24,405 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:24:24,425 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2021-09-13 14:24:24,606 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:24:24,606 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-09-13 14:24:24,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:24:24,607 INFO L82 PathProgramCache]: Analyzing trace with hash 171335487, now seen corresponding path program 1 times [2021-09-13 14:24:24,607 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:24:24,607 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050897170] [2021-09-13 14:24:24,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:24:24,607 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:24:24,628 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-09-13 14:24:24,628 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1689928852] [2021-09-13 14:24:24,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:24:24,629 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:24:24,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:24:24,630 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:24:24,631 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:24:24,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:24:24,668 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 5 conjunts are in the unsatisfiable core [2021-09-13 14:24:24,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:24:24,675 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:24:24,810 INFO L281 TraceCheckUtils]: 0: Hoare triple {3315#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(10);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~counter~0 := 0; {3320#(<= ~counter~0 0)} is VALID [2021-09-13 14:24:24,811 INFO L281 TraceCheckUtils]: 1: Hoare triple {3320#(<= ~counter~0 0)} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~post9, main_~a~0, main_~b~0, main_~p~0, main_~q~0, main_~r~0, main_~s~0, main_~x~0, 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_~x~0;havoc main_~y~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; {3320#(<= ~counter~0 0)} is VALID [2021-09-13 14:24:24,811 INFO L281 TraceCheckUtils]: 2: Hoare triple {3320#(<= ~counter~0 0)} assume !(0 == assume_abort_if_not_~cond); {3320#(<= ~counter~0 0)} is VALID [2021-09-13 14:24:24,812 INFO L281 TraceCheckUtils]: 3: Hoare triple {3320#(<= ~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; {3320#(<= ~counter~0 0)} is VALID [2021-09-13 14:24:24,812 INFO L281 TraceCheckUtils]: 4: Hoare triple {3320#(<= ~counter~0 0)} assume !(0 == assume_abort_if_not_~cond); {3320#(<= ~counter~0 0)} is VALID [2021-09-13 14:24:24,812 INFO L281 TraceCheckUtils]: 5: Hoare triple {3320#(<= ~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; {3320#(<= ~counter~0 0)} is VALID [2021-09-13 14:24:24,813 INFO L281 TraceCheckUtils]: 6: Hoare triple {3320#(<= ~counter~0 0)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {3339#(<= ~counter~0 1)} is VALID [2021-09-13 14:24:24,813 INFO L281 TraceCheckUtils]: 7: Hoare triple {3339#(<= ~counter~0 1)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 1 == main_~p~0 * main_~s~0 - main_~r~0 * main_~q~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {3339#(<= ~counter~0 1)} is VALID [2021-09-13 14:24:24,814 INFO L281 TraceCheckUtils]: 8: Hoare triple {3339#(<= ~counter~0 1)} assume !(0 == __VERIFIER_assert_~cond); {3339#(<= ~counter~0 1)} is VALID [2021-09-13 14:24:24,814 INFO L281 TraceCheckUtils]: 9: Hoare triple {3339#(<= ~counter~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; {3339#(<= ~counter~0 1)} is VALID [2021-09-13 14:24:24,814 INFO L281 TraceCheckUtils]: 10: Hoare triple {3339#(<= ~counter~0 1)} assume !(0 == __VERIFIER_assert_~cond); {3339#(<= ~counter~0 1)} is VALID [2021-09-13 14:24:24,815 INFO L281 TraceCheckUtils]: 11: Hoare triple {3339#(<= ~counter~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; {3339#(<= ~counter~0 1)} is VALID [2021-09-13 14:24:24,815 INFO L281 TraceCheckUtils]: 12: Hoare triple {3339#(<= ~counter~0 1)} assume !(0 == __VERIFIER_assert_~cond); {3339#(<= ~counter~0 1)} is VALID [2021-09-13 14:24:24,815 INFO L281 TraceCheckUtils]: 13: Hoare triple {3339#(<= ~counter~0 1)} assume !!(main_~a~0 != main_~b~0); {3339#(<= ~counter~0 1)} is VALID [2021-09-13 14:24:24,816 INFO L281 TraceCheckUtils]: 14: Hoare triple {3339#(<= ~counter~0 1)} assume main_~a~0 > main_~b~0;main_~a~0 := main_~a~0 - main_~b~0;main_~p~0 := main_~p~0 - main_~q~0;main_~r~0 := main_~r~0 - main_~s~0; {3339#(<= ~counter~0 1)} is VALID [2021-09-13 14:24:24,816 INFO L281 TraceCheckUtils]: 15: Hoare triple {3339#(<= ~counter~0 1)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {3367#(<= |ULTIMATE.start_main_#t~post9| 1)} is VALID [2021-09-13 14:24:24,816 INFO L281 TraceCheckUtils]: 16: Hoare triple {3367#(<= |ULTIMATE.start_main_#t~post9| 1)} assume !(main_#t~post9 < 50);havoc main_#t~post9; {3316#false} is VALID [2021-09-13 14:24:24,817 INFO L281 TraceCheckUtils]: 17: Hoare triple {3316#false} __VERIFIER_assert_#in~cond := (if 0 == main_~a~0 - main_~b~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {3316#false} is VALID [2021-09-13 14:24:24,817 INFO L281 TraceCheckUtils]: 18: Hoare triple {3316#false} assume 0 == __VERIFIER_assert_~cond; {3316#false} is VALID [2021-09-13 14:24:24,817 INFO L281 TraceCheckUtils]: 19: Hoare triple {3316#false} assume !false; {3316#false} is VALID [2021-09-13 14:24:24,817 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:24:24,817 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 14:24:24,972 INFO L281 TraceCheckUtils]: 19: Hoare triple {3316#false} assume !false; {3316#false} is VALID [2021-09-13 14:24:24,972 INFO L281 TraceCheckUtils]: 18: Hoare triple {3316#false} assume 0 == __VERIFIER_assert_~cond; {3316#false} is VALID [2021-09-13 14:24:24,972 INFO L281 TraceCheckUtils]: 17: Hoare triple {3316#false} __VERIFIER_assert_#in~cond := (if 0 == main_~a~0 - main_~b~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {3316#false} is VALID [2021-09-13 14:24:24,973 INFO L281 TraceCheckUtils]: 16: Hoare triple {3389#(< |ULTIMATE.start_main_#t~post9| 50)} assume !(main_#t~post9 < 50);havoc main_#t~post9; {3316#false} is VALID [2021-09-13 14:24:24,973 INFO L281 TraceCheckUtils]: 15: Hoare triple {3393#(< ~counter~0 50)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {3389#(< |ULTIMATE.start_main_#t~post9| 50)} is VALID [2021-09-13 14:24:24,974 INFO L281 TraceCheckUtils]: 14: Hoare triple {3393#(< ~counter~0 50)} assume main_~a~0 > main_~b~0;main_~a~0 := main_~a~0 - main_~b~0;main_~p~0 := main_~p~0 - main_~q~0;main_~r~0 := main_~r~0 - main_~s~0; {3393#(< ~counter~0 50)} is VALID [2021-09-13 14:24:24,974 INFO L281 TraceCheckUtils]: 13: Hoare triple {3393#(< ~counter~0 50)} assume !!(main_~a~0 != main_~b~0); {3393#(< ~counter~0 50)} is VALID [2021-09-13 14:24:24,974 INFO L281 TraceCheckUtils]: 12: Hoare triple {3393#(< ~counter~0 50)} assume !(0 == __VERIFIER_assert_~cond); {3393#(< ~counter~0 50)} is VALID [2021-09-13 14:24:24,975 INFO L281 TraceCheckUtils]: 11: Hoare triple {3393#(< ~counter~0 50)} __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; {3393#(< ~counter~0 50)} is VALID [2021-09-13 14:24:24,975 INFO L281 TraceCheckUtils]: 10: Hoare triple {3393#(< ~counter~0 50)} assume !(0 == __VERIFIER_assert_~cond); {3393#(< ~counter~0 50)} is VALID [2021-09-13 14:24:24,975 INFO L281 TraceCheckUtils]: 9: Hoare triple {3393#(< ~counter~0 50)} __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; {3393#(< ~counter~0 50)} is VALID [2021-09-13 14:24:24,976 INFO L281 TraceCheckUtils]: 8: Hoare triple {3393#(< ~counter~0 50)} assume !(0 == __VERIFIER_assert_~cond); {3393#(< ~counter~0 50)} is VALID [2021-09-13 14:24:24,976 INFO L281 TraceCheckUtils]: 7: Hoare triple {3393#(< ~counter~0 50)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 1 == main_~p~0 * main_~s~0 - main_~r~0 * main_~q~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {3393#(< ~counter~0 50)} is VALID [2021-09-13 14:24:24,977 INFO L281 TraceCheckUtils]: 6: Hoare triple {3421#(< ~counter~0 49)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {3393#(< ~counter~0 50)} is VALID [2021-09-13 14:24:24,977 INFO L281 TraceCheckUtils]: 5: Hoare triple {3421#(< ~counter~0 49)} 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; {3421#(< ~counter~0 49)} is VALID [2021-09-13 14:24:24,977 INFO L281 TraceCheckUtils]: 4: Hoare triple {3421#(< ~counter~0 49)} assume !(0 == assume_abort_if_not_~cond); {3421#(< ~counter~0 49)} is VALID [2021-09-13 14:24:24,978 INFO L281 TraceCheckUtils]: 3: Hoare triple {3421#(< ~counter~0 49)} 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; {3421#(< ~counter~0 49)} is VALID [2021-09-13 14:24:24,978 INFO L281 TraceCheckUtils]: 2: Hoare triple {3421#(< ~counter~0 49)} assume !(0 == assume_abort_if_not_~cond); {3421#(< ~counter~0 49)} is VALID [2021-09-13 14:24:24,978 INFO L281 TraceCheckUtils]: 1: Hoare triple {3421#(< ~counter~0 49)} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~post9, main_~a~0, main_~b~0, main_~p~0, main_~q~0, main_~r~0, main_~s~0, main_~x~0, 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_~x~0;havoc main_~y~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; {3421#(< ~counter~0 49)} is VALID [2021-09-13 14:24:24,979 INFO L281 TraceCheckUtils]: 0: Hoare triple {3315#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(10);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~counter~0 := 0; {3421#(< ~counter~0 49)} is VALID [2021-09-13 14:24:24,979 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:24:24,979 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:24:24,980 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050897170] [2021-09-13 14:24:24,980 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-09-13 14:24:24,980 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1689928852] [2021-09-13 14:24:24,980 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1689928852] provided 0 perfect and 2 imperfect interpolant sequences [2021-09-13 14:24:24,980 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-09-13 14:24:24,980 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2021-09-13 14:24:24,980 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385744385] [2021-09-13 14:24:24,981 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 7 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-09-13 14:24:24,981 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:24:24,981 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 4.625) internal successors, (37), 7 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:24:25,010 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:24:25,011 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-09-13 14:24:25,011 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:24:25,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-09-13 14:24:25,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2021-09-13 14:24:25,011 INFO L87 Difference]: Start difference. First operand 87 states and 102 transitions. Second operand has 8 states, 8 states have (on average 4.625) internal successors, (37), 7 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:24:25,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:24:25,515 INFO L93 Difference]: Finished difference Result 209 states and 245 transitions. [2021-09-13 14:24:25,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-09-13 14:24:25,516 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 7 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-09-13 14:24:25,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:24:25,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.625) internal successors, (37), 7 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:24:25,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 121 transitions. [2021-09-13 14:24:25,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.625) internal successors, (37), 7 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:24:25,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 121 transitions. [2021-09-13 14:24:25,519 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 121 transitions. [2021-09-13 14:24:25,613 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 121 edges. 121 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:24:25,615 INFO L225 Difference]: With dead ends: 209 [2021-09-13 14:24:25,615 INFO L226 Difference]: Without dead ends: 183 [2021-09-13 14:24:25,615 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 45.62ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-09-13 14:24:25,616 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 60 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 133.96ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.33ms SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 135.31ms IncrementalHoareTripleChecker+Time [2021-09-13 14:24:25,616 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [60 Valid, 0 Invalid, 223 Unknown, 0 Unchecked, 1.33ms Time], IncrementalHoareTripleChecker [6 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 135.31ms Time] [2021-09-13 14:24:25,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2021-09-13 14:24:25,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 145. [2021-09-13 14:24:25,780 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:24:25,780 INFO L82 GeneralOperation]: Start isEquivalent. First operand 183 states. Second operand has 145 states, 138 states have (on average 1.2753623188405796) internal successors, (176), 144 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call 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:25,780 INFO L74 IsIncluded]: Start isIncluded. First operand 183 states. Second operand has 145 states, 138 states have (on average 1.2753623188405796) internal successors, (176), 144 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call 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:25,780 INFO L87 Difference]: Start difference. First operand 183 states. Second operand has 145 states, 138 states have (on average 1.2753623188405796) internal successors, (176), 144 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call 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:25,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:24:25,785 INFO L93 Difference]: Finished difference Result 183 states and 207 transitions. [2021-09-13 14:24:25,785 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 207 transitions. [2021-09-13 14:24:25,785 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:24:25,786 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:24:25,786 INFO L74 IsIncluded]: Start isIncluded. First operand has 145 states, 138 states have (on average 1.2753623188405796) internal successors, (176), 144 states have internal predecessors, (176), 0 states have call successors, (0), 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 183 states. [2021-09-13 14:24:25,786 INFO L87 Difference]: Start difference. First operand has 145 states, 138 states have (on average 1.2753623188405796) internal successors, (176), 144 states have internal predecessors, (176), 0 states have call successors, (0), 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 183 states. [2021-09-13 14:24:25,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:24:25,811 INFO L93 Difference]: Finished difference Result 183 states and 207 transitions. [2021-09-13 14:24:25,811 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 207 transitions. [2021-09-13 14:24:25,811 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:24:25,811 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:24:25,811 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:24:25,811 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:24:25,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 138 states have (on average 1.2753623188405796) internal successors, (176), 144 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call 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:25,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 176 transitions. [2021-09-13 14:24:25,814 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 176 transitions. Word has length 20 [2021-09-13 14:24:25,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:24:25,814 INFO L470 AbstractCegarLoop]: Abstraction has 145 states and 176 transitions. [2021-09-13 14:24:25,814 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 7 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:24:25,814 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 176 transitions. [2021-09-13 14:24:25,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-09-13 14:24:25,815 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:24:25,815 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 14:24:25,837 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:24:26,015 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:24:26,016 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-09-13 14:24:26,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:24:26,016 INFO L82 PathProgramCache]: Analyzing trace with hash 1017079379, now seen corresponding path program 1 times [2021-09-13 14:24:26,016 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:24:26,016 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257685836] [2021-09-13 14:24:26,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:24:26,016 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:24:26,024 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-09-13 14:24:26,024 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1758054978] [2021-09-13 14:24:26,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:24:26,024 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:24:26,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:24:26,025 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:24:26,032 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:24:26,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:24:26,091 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 40 conjunts are in the unsatisfiable core [2021-09-13 14:24:26,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:24:26,097 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:24:26,720 INFO L281 TraceCheckUtils]: 0: Hoare triple {4283#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(10);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~counter~0 := 0; {4283#true} is VALID [2021-09-13 14:24:26,720 INFO L281 TraceCheckUtils]: 1: Hoare triple {4283#true} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~post9, main_~a~0, main_~b~0, main_~p~0, main_~q~0, main_~r~0, main_~s~0, main_~x~0, 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_~x~0;havoc main_~y~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; {4283#true} is VALID [2021-09-13 14:24:26,720 INFO L281 TraceCheckUtils]: 2: Hoare triple {4283#true} assume !(0 == assume_abort_if_not_~cond); {4283#true} is VALID [2021-09-13 14:24:26,721 INFO L281 TraceCheckUtils]: 3: Hoare triple {4283#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; {4297#(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:24:26,721 INFO L281 TraceCheckUtils]: 4: Hoare triple {4297#(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); {4301#(<= 1 ULTIMATE.start_main_~y~0)} is VALID [2021-09-13 14:24:26,721 INFO L281 TraceCheckUtils]: 5: Hoare triple {4301#(<= 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; {4305#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~p~0 1) (<= 1 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~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:24:26,722 INFO L281 TraceCheckUtils]: 6: Hoare triple {4305#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~p~0 1) (<= 1 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~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; {4305#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~p~0 1) (<= 1 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~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:24:26,722 INFO L281 TraceCheckUtils]: 7: Hoare triple {4305#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~p~0 1) (<= 1 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~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 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 1 == main_~p~0 * main_~s~0 - main_~r~0 * main_~q~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {4305#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~p~0 1) (<= 1 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~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:24:26,723 INFO L281 TraceCheckUtils]: 8: Hoare triple {4305#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~p~0 1) (<= 1 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~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); {4305#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~p~0 1) (<= 1 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~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:24:26,724 INFO L281 TraceCheckUtils]: 9: Hoare triple {4305#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~p~0 1) (<= 1 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~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_~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; {4318#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~p~0 1) (= 1 ULTIMATE.start___VERIFIER_assert_~cond) (<= 1 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:24:26,724 INFO L281 TraceCheckUtils]: 10: Hoare triple {4318#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~p~0 1) (= 1 ULTIMATE.start___VERIFIER_assert_~cond) (<= 1 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} assume !(0 == __VERIFIER_assert_~cond); {4305#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~p~0 1) (<= 1 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~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:24:26,725 INFO L281 TraceCheckUtils]: 11: Hoare triple {4305#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~p~0 1) (<= 1 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~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; {4318#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~p~0 1) (= 1 ULTIMATE.start___VERIFIER_assert_~cond) (<= 1 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:24:26,725 INFO L281 TraceCheckUtils]: 12: Hoare triple {4318#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~p~0 1) (= 1 ULTIMATE.start___VERIFIER_assert_~cond) (<= 1 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} assume !(0 == __VERIFIER_assert_~cond); {4305#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~p~0 1) (<= 1 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~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:24:26,726 INFO L281 TraceCheckUtils]: 13: Hoare triple {4305#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~p~0 1) (<= 1 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~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_~a~0 != main_~b~0); {4305#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~p~0 1) (<= 1 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~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:24:26,726 INFO L281 TraceCheckUtils]: 14: Hoare triple {4305#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~p~0 1) (<= 1 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~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_~a~0 > main_~b~0;main_~a~0 := main_~a~0 - main_~b~0;main_~p~0 := main_~p~0 - main_~q~0;main_~r~0 := main_~r~0 - main_~s~0; {4334#(and (= (+ ULTIMATE.start_main_~r~0 1) 0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~x~0 (+ ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~y~0)) (<= 1 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:24:26,727 INFO L281 TraceCheckUtils]: 15: Hoare triple {4334#(and (= (+ ULTIMATE.start_main_~r~0 1) 0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~x~0 (+ ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~y~0)) (<= 1 ULTIMATE.start_main_~y~0))} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {4334#(and (= (+ ULTIMATE.start_main_~r~0 1) 0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~x~0 (+ ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~y~0)) (<= 1 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:24:26,727 INFO L281 TraceCheckUtils]: 16: Hoare triple {4334#(and (= (+ ULTIMATE.start_main_~r~0 1) 0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~x~0 (+ ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~y~0)) (<= 1 ULTIMATE.start_main_~y~0))} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 1 == main_~p~0 * main_~s~0 - main_~r~0 * main_~q~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {4334#(and (= (+ ULTIMATE.start_main_~r~0 1) 0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~x~0 (+ ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~y~0)) (<= 1 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:24:26,727 INFO L281 TraceCheckUtils]: 17: Hoare triple {4334#(and (= (+ ULTIMATE.start_main_~r~0 1) 0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~x~0 (+ ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~y~0)) (<= 1 ULTIMATE.start_main_~y~0))} assume !(0 == __VERIFIER_assert_~cond); {4334#(and (= (+ ULTIMATE.start_main_~r~0 1) 0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~x~0 (+ ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~y~0)) (<= 1 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:24:26,728 INFO L281 TraceCheckUtils]: 18: Hoare triple {4334#(and (= (+ ULTIMATE.start_main_~r~0 1) 0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~x~0 (+ ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~y~0)) (<= 1 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; {4347#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} is VALID [2021-09-13 14:24:26,728 INFO L281 TraceCheckUtils]: 19: Hoare triple {4347#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} assume 0 == __VERIFIER_assert_~cond; {4284#false} is VALID [2021-09-13 14:24:26,728 INFO L281 TraceCheckUtils]: 20: Hoare triple {4284#false} assume !false; {4284#false} is VALID [2021-09-13 14:24:26,728 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:24:26,728 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 14:24:26,987 INFO L281 TraceCheckUtils]: 20: Hoare triple {4284#false} assume !false; {4284#false} is VALID [2021-09-13 14:24:26,987 INFO L281 TraceCheckUtils]: 19: Hoare triple {4347#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} assume 0 == __VERIFIER_assert_~cond; {4284#false} is VALID [2021-09-13 14:24:26,988 INFO L281 TraceCheckUtils]: 18: Hoare triple {4360#(= 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; {4347#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} is VALID [2021-09-13 14:24:26,988 INFO L281 TraceCheckUtils]: 17: Hoare triple {4360#(= 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); {4360#(= 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:24:26,988 INFO L281 TraceCheckUtils]: 16: Hoare triple {4360#(= 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 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 1 == main_~p~0 * main_~s~0 - main_~r~0 * main_~q~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {4360#(= 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:24:26,989 INFO L281 TraceCheckUtils]: 15: Hoare triple {4360#(= 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; {4360#(= 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:24:27,274 INFO L281 TraceCheckUtils]: 14: Hoare triple {4373#(= (+ ULTIMATE.start_main_~a~0 (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) (+ ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)))} assume main_~a~0 > main_~b~0;main_~a~0 := main_~a~0 - main_~b~0;main_~p~0 := main_~p~0 - main_~q~0;main_~r~0 := main_~r~0 - main_~s~0; {4360#(= 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:24:27,275 INFO L281 TraceCheckUtils]: 13: Hoare triple {4373#(= (+ ULTIMATE.start_main_~a~0 (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) (+ ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)))} assume !!(main_~a~0 != main_~b~0); {4373#(= (+ ULTIMATE.start_main_~a~0 (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) (+ ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)))} is VALID [2021-09-13 14:24:27,275 INFO L281 TraceCheckUtils]: 12: Hoare triple {4380#(or (= (+ ULTIMATE.start_main_~a~0 (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) (+ ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0))) (= 0 ULTIMATE.start___VERIFIER_assert_~cond))} assume !(0 == __VERIFIER_assert_~cond); {4373#(= (+ ULTIMATE.start_main_~a~0 (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) (+ ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)))} is VALID [2021-09-13 14:24:27,276 INFO L281 TraceCheckUtils]: 11: Hoare triple {4384#(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_~a~0 (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) (+ ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0))))} __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; {4380#(or (= (+ ULTIMATE.start_main_~a~0 (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) (+ ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0))) (= 0 ULTIMATE.start___VERIFIER_assert_~cond))} is VALID [2021-09-13 14:24:27,276 INFO L281 TraceCheckUtils]: 10: Hoare triple {4388#(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_~a~0 (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) (+ ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0))) (= 0 ULTIMATE.start___VERIFIER_assert_~cond))} assume !(0 == __VERIFIER_assert_~cond); {4384#(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_~a~0 (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) (+ ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0))))} is VALID [2021-09-13 14:24:27,277 INFO L281 TraceCheckUtils]: 9: Hoare triple {4283#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; {4388#(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_~a~0 (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) (+ ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0))) (= 0 ULTIMATE.start___VERIFIER_assert_~cond))} is VALID [2021-09-13 14:24:27,277 INFO L281 TraceCheckUtils]: 8: Hoare triple {4283#true} assume !(0 == __VERIFIER_assert_~cond); {4283#true} is VALID [2021-09-13 14:24:27,277 INFO L281 TraceCheckUtils]: 7: Hoare triple {4283#true} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 1 == main_~p~0 * main_~s~0 - main_~r~0 * main_~q~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {4283#true} is VALID [2021-09-13 14:24:27,277 INFO L281 TraceCheckUtils]: 6: Hoare triple {4283#true} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {4283#true} is VALID [2021-09-13 14:24:27,277 INFO L281 TraceCheckUtils]: 5: Hoare triple {4283#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; {4283#true} is VALID [2021-09-13 14:24:27,277 INFO L281 TraceCheckUtils]: 4: Hoare triple {4283#true} assume !(0 == assume_abort_if_not_~cond); {4283#true} is VALID [2021-09-13 14:24:27,278 INFO L281 TraceCheckUtils]: 3: Hoare triple {4283#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; {4283#true} is VALID [2021-09-13 14:24:27,278 INFO L281 TraceCheckUtils]: 2: Hoare triple {4283#true} assume !(0 == assume_abort_if_not_~cond); {4283#true} is VALID [2021-09-13 14:24:27,278 INFO L281 TraceCheckUtils]: 1: Hoare triple {4283#true} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~post9, main_~a~0, main_~b~0, main_~p~0, main_~q~0, main_~r~0, main_~s~0, main_~x~0, 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_~x~0;havoc main_~y~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; {4283#true} is VALID [2021-09-13 14:24:27,278 INFO L281 TraceCheckUtils]: 0: Hoare triple {4283#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(10);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~counter~0 := 0; {4283#true} is VALID [2021-09-13 14:24:27,278 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:24:27,278 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:24:27,278 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257685836] [2021-09-13 14:24:27,278 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-09-13 14:24:27,278 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1758054978] [2021-09-13 14:24:27,278 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1758054978] provided 0 perfect and 2 imperfect interpolant sequences [2021-09-13 14:24:27,278 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-09-13 14:24:27,278 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2021-09-13 14:24:27,278 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54678858] [2021-09-13 14:24:27,279 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 13 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-09-13 14:24:27,279 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:24:27,279 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 13 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:24:27,368 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:24:27,368 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-09-13 14:24:27,368 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:24:27,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-09-13 14:24:27,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2021-09-13 14:24:27,369 INFO L87 Difference]: Start difference. First operand 145 states and 176 transitions. Second operand has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 13 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:24:29,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:24:29,722 INFO L93 Difference]: Finished difference Result 180 states and 218 transitions. [2021-09-13 14:24:29,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-09-13 14:24:29,722 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 13 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-09-13 14:24:29,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:24:29,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 13 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:24:29,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 79 transitions. [2021-09-13 14:24:29,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 13 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:24:29,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 79 transitions. [2021-09-13 14:24:29,724 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 79 transitions. [2021-09-13 14:24:29,860 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:24:29,861 INFO L225 Difference]: With dead ends: 180 [2021-09-13 14:24:29,861 INFO L226 Difference]: Without dead ends: 164 [2021-09-13 14:24:29,862 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 394.37ms TimeCoverageRelationStatistics Valid=129, Invalid=251, Unknown=0, NotChecked=0, Total=380 [2021-09-13 14:24:29,862 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 270 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 820.87ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.88ms SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 826.78ms IncrementalHoareTripleChecker+Time [2021-09-13 14:24:29,863 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [270 Valid, 0 Invalid, 271 Unknown, 0 Unchecked, 1.88ms Time], IncrementalHoareTripleChecker [98 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 826.78ms Time] [2021-09-13 14:24:29,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2021-09-13 14:24:30,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 115. [2021-09-13 14:24:30,066 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:24:30,066 INFO L82 GeneralOperation]: Start isEquivalent. First operand 164 states. Second operand has 115 states, 111 states have (on average 1.1711711711711712) internal successors, (130), 114 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call 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:30,066 INFO L74 IsIncluded]: Start isIncluded. First operand 164 states. Second operand has 115 states, 111 states have (on average 1.1711711711711712) internal successors, (130), 114 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call 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:30,066 INFO L87 Difference]: Start difference. First operand 164 states. Second operand has 115 states, 111 states have (on average 1.1711711711711712) internal successors, (130), 114 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call 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:30,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:24:30,068 INFO L93 Difference]: Finished difference Result 164 states and 187 transitions. [2021-09-13 14:24:30,068 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 187 transitions. [2021-09-13 14:24:30,069 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:24:30,069 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:24:30,069 INFO L74 IsIncluded]: Start isIncluded. First operand has 115 states, 111 states have (on average 1.1711711711711712) internal successors, (130), 114 states have internal predecessors, (130), 0 states have call successors, (0), 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 164 states. [2021-09-13 14:24:30,069 INFO L87 Difference]: Start difference. First operand has 115 states, 111 states have (on average 1.1711711711711712) internal successors, (130), 114 states have internal predecessors, (130), 0 states have call successors, (0), 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 164 states. [2021-09-13 14:24:30,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:24:30,072 INFO L93 Difference]: Finished difference Result 164 states and 187 transitions. [2021-09-13 14:24:30,072 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 187 transitions. [2021-09-13 14:24:30,072 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:24:30,072 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:24:30,072 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:24:30,073 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:24:30,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 111 states have (on average 1.1711711711711712) internal successors, (130), 114 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call 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:30,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 130 transitions. [2021-09-13 14:24:30,075 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 130 transitions. Word has length 21 [2021-09-13 14:24:30,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:24:30,075 INFO L470 AbstractCegarLoop]: Abstraction has 115 states and 130 transitions. [2021-09-13 14:24:30,075 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 13 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:24:30,075 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 130 transitions. [2021-09-13 14:24:30,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-09-13 14:24:30,076 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:24:30,076 INFO L513 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 14:24:30,110 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2021-09-13 14:24:30,297 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,SelfDestructingSolverStorable9 [2021-09-13 14:24:30,297 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-09-13 14:24:30,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:24:30,297 INFO L82 PathProgramCache]: Analyzing trace with hash -559475920, now seen corresponding path program 1 times [2021-09-13 14:24:30,298 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:24:30,298 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953356190] [2021-09-13 14:24:30,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:24:30,298 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:24:30,304 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-09-13 14:24:30,304 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [414343350] [2021-09-13 14:24:30,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:24:30,304 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:24:30,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:24:30,305 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:24:30,306 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:24:30,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:24:30,341 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 19 conjunts are in the unsatisfiable core [2021-09-13 14:24:30,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:24:30,349 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:24:30,872 INFO L281 TraceCheckUtils]: 0: Hoare triple {5166#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(10);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~counter~0 := 0; {5166#true} is VALID [2021-09-13 14:24:30,873 INFO L281 TraceCheckUtils]: 1: Hoare triple {5166#true} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~post9, main_~a~0, main_~b~0, main_~p~0, main_~q~0, main_~r~0, main_~s~0, main_~x~0, 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_~x~0;havoc main_~y~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; {5166#true} is VALID [2021-09-13 14:24:30,873 INFO L281 TraceCheckUtils]: 2: Hoare triple {5166#true} assume !(0 == assume_abort_if_not_~cond); {5166#true} is VALID [2021-09-13 14:24:30,873 INFO L281 TraceCheckUtils]: 3: Hoare triple {5166#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; {5166#true} is VALID [2021-09-13 14:24:30,873 INFO L281 TraceCheckUtils]: 4: Hoare triple {5166#true} assume !(0 == assume_abort_if_not_~cond); {5166#true} is VALID [2021-09-13 14:24:30,873 INFO L281 TraceCheckUtils]: 5: Hoare triple {5166#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; {5186#(and (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1))} is VALID [2021-09-13 14:24:30,874 INFO L281 TraceCheckUtils]: 6: Hoare triple {5186#(and (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1))} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {5186#(and (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1))} is VALID [2021-09-13 14:24:30,874 INFO L281 TraceCheckUtils]: 7: Hoare triple {5186#(and (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1))} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 1 == main_~p~0 * main_~s~0 - main_~r~0 * main_~q~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {5186#(and (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1))} is VALID [2021-09-13 14:24:30,875 INFO L281 TraceCheckUtils]: 8: Hoare triple {5186#(and (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1))} assume !(0 == __VERIFIER_assert_~cond); {5186#(and (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1))} is VALID [2021-09-13 14:24:30,875 INFO L281 TraceCheckUtils]: 9: Hoare triple {5186#(and (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~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; {5186#(and (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1))} is VALID [2021-09-13 14:24:30,876 INFO L281 TraceCheckUtils]: 10: Hoare triple {5186#(and (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1))} assume !(0 == __VERIFIER_assert_~cond); {5186#(and (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1))} is VALID [2021-09-13 14:24:30,876 INFO L281 TraceCheckUtils]: 11: Hoare triple {5186#(and (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1))} __VERIFIER_assert_#in~cond := (if main_~b~0 == main_~x~0 * main_~q~0 + main_~y~0 * main_~s~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {5186#(and (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1))} is VALID [2021-09-13 14:24:30,876 INFO L281 TraceCheckUtils]: 12: Hoare triple {5186#(and (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1))} assume !(0 == __VERIFIER_assert_~cond); {5186#(and (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1))} is VALID [2021-09-13 14:24:30,877 INFO L281 TraceCheckUtils]: 13: Hoare triple {5186#(and (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1))} assume !!(main_~a~0 != main_~b~0); {5186#(and (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1))} is VALID [2021-09-13 14:24:30,877 INFO L281 TraceCheckUtils]: 14: Hoare triple {5186#(and (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1))} assume main_~a~0 > main_~b~0;main_~a~0 := main_~a~0 - main_~b~0;main_~p~0 := main_~p~0 - main_~q~0;main_~r~0 := main_~r~0 - main_~s~0; {5214#(and (= (+ ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~p~0) 1) (= (+ ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~r~0) 0) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~s~0 1))} is VALID [2021-09-13 14:24:30,878 INFO L281 TraceCheckUtils]: 15: Hoare triple {5214#(and (= (+ ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~p~0) 1) (= (+ ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~r~0) 0) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~s~0 1))} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {5214#(and (= (+ ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~p~0) 1) (= (+ ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~r~0) 0) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~s~0 1))} is VALID [2021-09-13 14:24:30,878 INFO L281 TraceCheckUtils]: 16: Hoare triple {5214#(and (= (+ ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~p~0) 1) (= (+ ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~r~0) 0) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~s~0 1))} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 1 == main_~p~0 * main_~s~0 - main_~r~0 * main_~q~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {5214#(and (= (+ ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~p~0) 1) (= (+ ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~r~0) 0) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~s~0 1))} is VALID [2021-09-13 14:24:30,879 INFO L281 TraceCheckUtils]: 17: Hoare triple {5214#(and (= (+ ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~p~0) 1) (= (+ ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~r~0) 0) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~s~0 1))} assume !(0 == __VERIFIER_assert_~cond); {5214#(and (= (+ ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~p~0) 1) (= (+ ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~r~0) 0) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~s~0 1))} is VALID [2021-09-13 14:24:30,879 INFO L281 TraceCheckUtils]: 18: Hoare triple {5214#(and (= (+ ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~p~0) 1) (= (+ ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~r~0) 0) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~s~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; {5214#(and (= (+ ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~p~0) 1) (= (+ ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~r~0) 0) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~s~0 1))} is VALID [2021-09-13 14:24:30,880 INFO L281 TraceCheckUtils]: 19: Hoare triple {5214#(and (= (+ ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~p~0) 1) (= (+ ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~r~0) 0) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~s~0 1))} assume !(0 == __VERIFIER_assert_~cond); {5214#(and (= (+ ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~p~0) 1) (= (+ ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~r~0) 0) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~s~0 1))} is VALID [2021-09-13 14:24:30,880 INFO L281 TraceCheckUtils]: 20: Hoare triple {5214#(and (= (+ ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~p~0) 1) (= (+ ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~r~0) 0) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~s~0 1))} __VERIFIER_assert_#in~cond := (if main_~b~0 == main_~x~0 * main_~q~0 + main_~y~0 * main_~s~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {5214#(and (= (+ ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~p~0) 1) (= (+ ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~r~0) 0) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~s~0 1))} is VALID [2021-09-13 14:24:30,880 INFO L281 TraceCheckUtils]: 21: Hoare triple {5214#(and (= (+ ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~p~0) 1) (= (+ ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~r~0) 0) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~s~0 1))} assume !(0 == __VERIFIER_assert_~cond); {5214#(and (= (+ ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~p~0) 1) (= (+ ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~r~0) 0) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~s~0 1))} is VALID [2021-09-13 14:24:30,881 INFO L281 TraceCheckUtils]: 22: Hoare triple {5214#(and (= (+ ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~p~0) 1) (= (+ ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~r~0) 0) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~s~0 1))} assume !!(main_~a~0 != main_~b~0); {5214#(and (= (+ ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~p~0) 1) (= (+ ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~r~0) 0) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~s~0 1))} is VALID [2021-09-13 14:24:30,881 INFO L281 TraceCheckUtils]: 23: Hoare triple {5214#(and (= (+ ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~p~0) 1) (= (+ ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~r~0) 0) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~s~0 1))} assume !(main_~a~0 > main_~b~0);main_~b~0 := main_~b~0 - main_~a~0;main_~q~0 := main_~q~0 - main_~p~0;main_~s~0 := main_~s~0 - main_~r~0; {5242#(and (= (+ ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~r~0) 1) (= (+ ULTIMATE.start_main_~s~0 (* 2 ULTIMATE.start_main_~r~0)) 0) (= (+ ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~p~0) 0) (= (+ (* 2 ULTIMATE.start_main_~p~0) ULTIMATE.start_main_~q~0) 1))} is VALID [2021-09-13 14:24:30,882 INFO L281 TraceCheckUtils]: 24: Hoare triple {5242#(and (= (+ ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~r~0) 1) (= (+ ULTIMATE.start_main_~s~0 (* 2 ULTIMATE.start_main_~r~0)) 0) (= (+ ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~p~0) 0) (= (+ (* 2 ULTIMATE.start_main_~p~0) ULTIMATE.start_main_~q~0) 1))} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {5242#(and (= (+ ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~r~0) 1) (= (+ ULTIMATE.start_main_~s~0 (* 2 ULTIMATE.start_main_~r~0)) 0) (= (+ ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~p~0) 0) (= (+ (* 2 ULTIMATE.start_main_~p~0) ULTIMATE.start_main_~q~0) 1))} is VALID [2021-09-13 14:24:30,883 INFO L281 TraceCheckUtils]: 25: Hoare triple {5242#(and (= (+ ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~r~0) 1) (= (+ ULTIMATE.start_main_~s~0 (* 2 ULTIMATE.start_main_~r~0)) 0) (= (+ ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~p~0) 0) (= (+ (* 2 ULTIMATE.start_main_~p~0) ULTIMATE.start_main_~q~0) 1))} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 1 == main_~p~0 * main_~s~0 - main_~r~0 * main_~q~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {5249#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} is VALID [2021-09-13 14:24:30,884 INFO L281 TraceCheckUtils]: 26: Hoare triple {5249#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} assume 0 == __VERIFIER_assert_~cond; {5167#false} is VALID [2021-09-13 14:24:30,884 INFO L281 TraceCheckUtils]: 27: Hoare triple {5167#false} assume !false; {5167#false} is VALID [2021-09-13 14:24:30,884 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:24:30,884 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 14:24:31,139 INFO L281 TraceCheckUtils]: 27: Hoare triple {5167#false} assume !false; {5167#false} is VALID [2021-09-13 14:24:31,140 INFO L281 TraceCheckUtils]: 26: Hoare triple {5249#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} assume 0 == __VERIFIER_assert_~cond; {5167#false} is VALID [2021-09-13 14:24:31,140 INFO L281 TraceCheckUtils]: 25: Hoare triple {5262#(= (+ (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~r~0) 1) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~s~0))} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 1 == main_~p~0 * main_~s~0 - main_~r~0 * main_~q~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {5249#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} is VALID [2021-09-13 14:24:31,141 INFO L281 TraceCheckUtils]: 24: Hoare triple {5262#(= (+ (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~r~0) 1) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~s~0))} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {5262#(= (+ (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~r~0) 1) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~s~0))} is VALID [2021-09-13 14:24:31,143 INFO L281 TraceCheckUtils]: 23: Hoare triple {5262#(= (+ (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~r~0) 1) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~s~0))} assume !(main_~a~0 > main_~b~0);main_~b~0 := main_~b~0 - main_~a~0;main_~q~0 := main_~q~0 - main_~p~0;main_~s~0 := main_~s~0 - main_~r~0; {5262#(= (+ (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~r~0) 1) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~s~0))} is VALID [2021-09-13 14:24:31,146 INFO L281 TraceCheckUtils]: 22: Hoare triple {5262#(= (+ (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~r~0) 1) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~s~0))} assume !!(main_~a~0 != main_~b~0); {5262#(= (+ (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~r~0) 1) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~s~0))} is VALID [2021-09-13 14:24:31,149 INFO L281 TraceCheckUtils]: 21: Hoare triple {5262#(= (+ (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~r~0) 1) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~s~0))} assume !(0 == __VERIFIER_assert_~cond); {5262#(= (+ (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~r~0) 1) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~s~0))} is VALID [2021-09-13 14:24:31,154 INFO L281 TraceCheckUtils]: 20: Hoare triple {5262#(= (+ (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~r~0) 1) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~s~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; {5262#(= (+ (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~r~0) 1) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~s~0))} is VALID [2021-09-13 14:24:31,155 INFO L281 TraceCheckUtils]: 19: Hoare triple {5262#(= (+ (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~r~0) 1) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~s~0))} assume !(0 == __VERIFIER_assert_~cond); {5262#(= (+ (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~r~0) 1) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~s~0))} is VALID [2021-09-13 14:24:31,156 INFO L281 TraceCheckUtils]: 18: Hoare triple {5262#(= (+ (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~r~0) 1) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~s~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; {5262#(= (+ (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~r~0) 1) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~s~0))} is VALID [2021-09-13 14:24:31,157 INFO L281 TraceCheckUtils]: 17: Hoare triple {5262#(= (+ (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~r~0) 1) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~s~0))} assume !(0 == __VERIFIER_assert_~cond); {5262#(= (+ (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~r~0) 1) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~s~0))} is VALID [2021-09-13 14:24:31,157 INFO L281 TraceCheckUtils]: 16: Hoare triple {5262#(= (+ (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~r~0) 1) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~s~0))} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 1 == main_~p~0 * main_~s~0 - main_~r~0 * main_~q~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {5262#(= (+ (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~r~0) 1) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~s~0))} is VALID [2021-09-13 14:24:31,157 INFO L281 TraceCheckUtils]: 15: Hoare triple {5262#(= (+ (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~r~0) 1) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~s~0))} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {5262#(= (+ (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~r~0) 1) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~s~0))} is VALID [2021-09-13 14:24:31,159 INFO L281 TraceCheckUtils]: 14: Hoare triple {5262#(= (+ (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~r~0) 1) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~s~0))} assume main_~a~0 > main_~b~0;main_~a~0 := main_~a~0 - main_~b~0;main_~p~0 := main_~p~0 - main_~q~0;main_~r~0 := main_~r~0 - main_~s~0; {5262#(= (+ (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~r~0) 1) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~s~0))} is VALID [2021-09-13 14:24:31,162 INFO L281 TraceCheckUtils]: 13: Hoare triple {5262#(= (+ (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~r~0) 1) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~s~0))} assume !!(main_~a~0 != main_~b~0); {5262#(= (+ (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~r~0) 1) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~s~0))} is VALID [2021-09-13 14:24:31,162 INFO L281 TraceCheckUtils]: 12: Hoare triple {5262#(= (+ (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~r~0) 1) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~s~0))} assume !(0 == __VERIFIER_assert_~cond); {5262#(= (+ (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~r~0) 1) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~s~0))} is VALID [2021-09-13 14:24:31,163 INFO L281 TraceCheckUtils]: 11: Hoare triple {5262#(= (+ (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~r~0) 1) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~s~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; {5262#(= (+ (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~r~0) 1) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~s~0))} is VALID [2021-09-13 14:24:31,163 INFO L281 TraceCheckUtils]: 10: Hoare triple {5262#(= (+ (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~r~0) 1) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~s~0))} assume !(0 == __VERIFIER_assert_~cond); {5262#(= (+ (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~r~0) 1) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~s~0))} is VALID [2021-09-13 14:24:31,163 INFO L281 TraceCheckUtils]: 9: Hoare triple {5262#(= (+ (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~r~0) 1) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~s~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; {5262#(= (+ (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~r~0) 1) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~s~0))} is VALID [2021-09-13 14:24:31,164 INFO L281 TraceCheckUtils]: 8: Hoare triple {5262#(= (+ (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~r~0) 1) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~s~0))} assume !(0 == __VERIFIER_assert_~cond); {5262#(= (+ (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~r~0) 1) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~s~0))} is VALID [2021-09-13 14:24:31,164 INFO L281 TraceCheckUtils]: 7: Hoare triple {5262#(= (+ (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~r~0) 1) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~s~0))} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 1 == main_~p~0 * main_~s~0 - main_~r~0 * main_~q~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {5262#(= (+ (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~r~0) 1) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~s~0))} is VALID [2021-09-13 14:24:31,164 INFO L281 TraceCheckUtils]: 6: Hoare triple {5262#(= (+ (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~r~0) 1) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~s~0))} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {5262#(= (+ (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~r~0) 1) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~s~0))} is VALID [2021-09-13 14:24:31,165 INFO L281 TraceCheckUtils]: 5: Hoare triple {5166#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; {5262#(= (+ (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~r~0) 1) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~s~0))} is VALID [2021-09-13 14:24:31,165 INFO L281 TraceCheckUtils]: 4: Hoare triple {5166#true} assume !(0 == assume_abort_if_not_~cond); {5166#true} is VALID [2021-09-13 14:24:31,165 INFO L281 TraceCheckUtils]: 3: Hoare triple {5166#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; {5166#true} is VALID [2021-09-13 14:24:31,165 INFO L281 TraceCheckUtils]: 2: Hoare triple {5166#true} assume !(0 == assume_abort_if_not_~cond); {5166#true} is VALID [2021-09-13 14:24:31,165 INFO L281 TraceCheckUtils]: 1: Hoare triple {5166#true} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~post9, main_~a~0, main_~b~0, main_~p~0, main_~q~0, main_~r~0, main_~s~0, main_~x~0, 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_~x~0;havoc main_~y~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; {5166#true} is VALID [2021-09-13 14:24:31,165 INFO L281 TraceCheckUtils]: 0: Hoare triple {5166#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(10);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~counter~0 := 0; {5166#true} is VALID [2021-09-13 14:24:31,166 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-09-13 14:24:31,166 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:24:31,166 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953356190] [2021-09-13 14:24:31,166 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-09-13 14:24:31,166 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [414343350] [2021-09-13 14:24:31,166 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [414343350] provided 0 perfect and 2 imperfect interpolant sequences [2021-09-13 14:24:31,166 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-09-13 14:24:31,167 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 7 [2021-09-13 14:24:31,167 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981268502] [2021-09-13 14:24:31,167 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2021-09-13 14:24:31,168 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:24:31,168 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:24:31,201 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:24:31,201 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-09-13 14:24:31,201 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:24:31,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-09-13 14:24:31,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-09-13 14:24:31,202 INFO L87 Difference]: Start difference. First operand 115 states and 130 transitions. Second operand has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:24:31,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:24:31,832 INFO L93 Difference]: Finished difference Result 130 states and 148 transitions. [2021-09-13 14:24:31,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-09-13 14:24:31,832 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2021-09-13 14:24:31,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:24:31,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:24:31,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 69 transitions. [2021-09-13 14:24:31,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:24:31,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 69 transitions. [2021-09-13 14:24:31,834 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 69 transitions. [2021-09-13 14:24:31,893 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:24:31,894 INFO L225 Difference]: With dead ends: 130 [2021-09-13 14:24:31,894 INFO L226 Difference]: Without dead ends: 114 [2021-09-13 14:24:31,894 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 102.45ms TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2021-09-13 14:24:31,895 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 32 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 161.14ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.25ms SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 162.64ms IncrementalHoareTripleChecker+Time [2021-09-13 14:24:31,895 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 0 Invalid, 196 Unknown, 0 Unchecked, 1.25ms Time], IncrementalHoareTripleChecker [5 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 162.64ms Time] [2021-09-13 14:24:31,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2021-09-13 14:24:31,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 52. [2021-09-13 14:24:31,999 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:24:31,999 INFO L82 GeneralOperation]: Start isEquivalent. First operand 114 states. Second operand has 52 states, 50 states have (on average 1.12) internal successors, (56), 51 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call 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:31,999 INFO L74 IsIncluded]: Start isIncluded. First operand 114 states. Second operand has 52 states, 50 states have (on average 1.12) internal successors, (56), 51 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call 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:32,000 INFO L87 Difference]: Start difference. First operand 114 states. Second operand has 52 states, 50 states have (on average 1.12) internal successors, (56), 51 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call 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:32,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:24:32,001 INFO L93 Difference]: Finished difference Result 114 states and 127 transitions. [2021-09-13 14:24:32,001 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 127 transitions. [2021-09-13 14:24:32,002 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:24:32,002 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:24:32,002 INFO L74 IsIncluded]: Start isIncluded. First operand has 52 states, 50 states have (on average 1.12) internal successors, (56), 51 states have internal predecessors, (56), 0 states have call successors, (0), 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 114 states. [2021-09-13 14:24:32,002 INFO L87 Difference]: Start difference. First operand has 52 states, 50 states have (on average 1.12) internal successors, (56), 51 states have internal predecessors, (56), 0 states have call successors, (0), 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 114 states. [2021-09-13 14:24:32,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:24:32,003 INFO L93 Difference]: Finished difference Result 114 states and 127 transitions. [2021-09-13 14:24:32,003 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 127 transitions. [2021-09-13 14:24:32,004 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:24:32,004 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:24:32,004 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:24:32,004 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:24:32,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 50 states have (on average 1.12) internal successors, (56), 51 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call 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:32,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2021-09-13 14:24:32,005 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 28 [2021-09-13 14:24:32,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:24:32,005 INFO L470 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2021-09-13 14:24:32,005 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:24:32,005 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2021-09-13 14:24:32,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-09-13 14:24:32,008 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:24:32,008 INFO L513 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 14:24:32,027 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-09-13 14:24:32,224 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:24:32,225 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-09-13 14:24:32,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:24:32,225 INFO L82 PathProgramCache]: Analyzing trace with hash -309462655, now seen corresponding path program 2 times [2021-09-13 14:24:32,225 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:24:32,225 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515601025] [2021-09-13 14:24:32,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:24:32,225 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:24:32,230 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-09-13 14:24:32,231 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [269172792] [2021-09-13 14:24:32,231 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-09-13 14:24:32,231 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:24:32,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:24:32,235 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:24:32,242 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:24:32,279 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-09-13 14:24:32,279 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-09-13 14:24:32,280 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 11 conjunts are in the unsatisfiable core [2021-09-13 14:24:32,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:24:32,289 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:24:32,549 INFO L281 TraceCheckUtils]: 0: Hoare triple {5822#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(10);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~counter~0 := 0; {5827#(<= ~counter~0 0)} is VALID [2021-09-13 14:24:32,550 INFO L281 TraceCheckUtils]: 1: Hoare triple {5827#(<= ~counter~0 0)} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~post9, main_~a~0, main_~b~0, main_~p~0, main_~q~0, main_~r~0, main_~s~0, main_~x~0, 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_~x~0;havoc main_~y~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; {5827#(<= ~counter~0 0)} is VALID [2021-09-13 14:24:32,550 INFO L281 TraceCheckUtils]: 2: Hoare triple {5827#(<= ~counter~0 0)} assume !(0 == assume_abort_if_not_~cond); {5827#(<= ~counter~0 0)} is VALID [2021-09-13 14:24:32,550 INFO L281 TraceCheckUtils]: 3: Hoare triple {5827#(<= ~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; {5827#(<= ~counter~0 0)} is VALID [2021-09-13 14:24:32,551 INFO L281 TraceCheckUtils]: 4: Hoare triple {5827#(<= ~counter~0 0)} assume !(0 == assume_abort_if_not_~cond); {5827#(<= ~counter~0 0)} is VALID [2021-09-13 14:24:32,551 INFO L281 TraceCheckUtils]: 5: Hoare triple {5827#(<= ~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; {5827#(<= ~counter~0 0)} is VALID [2021-09-13 14:24:32,551 INFO L281 TraceCheckUtils]: 6: Hoare triple {5827#(<= ~counter~0 0)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {5846#(<= ~counter~0 1)} is VALID [2021-09-13 14:24:32,552 INFO L281 TraceCheckUtils]: 7: Hoare triple {5846#(<= ~counter~0 1)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 1 == main_~p~0 * main_~s~0 - main_~r~0 * main_~q~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {5846#(<= ~counter~0 1)} is VALID [2021-09-13 14:24:32,552 INFO L281 TraceCheckUtils]: 8: Hoare triple {5846#(<= ~counter~0 1)} assume !(0 == __VERIFIER_assert_~cond); {5846#(<= ~counter~0 1)} is VALID [2021-09-13 14:24:32,552 INFO L281 TraceCheckUtils]: 9: Hoare triple {5846#(<= ~counter~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; {5846#(<= ~counter~0 1)} is VALID [2021-09-13 14:24:32,552 INFO L281 TraceCheckUtils]: 10: Hoare triple {5846#(<= ~counter~0 1)} assume !(0 == __VERIFIER_assert_~cond); {5846#(<= ~counter~0 1)} is VALID [2021-09-13 14:24:32,553 INFO L281 TraceCheckUtils]: 11: Hoare triple {5846#(<= ~counter~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; {5846#(<= ~counter~0 1)} is VALID [2021-09-13 14:24:32,553 INFO L281 TraceCheckUtils]: 12: Hoare triple {5846#(<= ~counter~0 1)} assume !(0 == __VERIFIER_assert_~cond); {5846#(<= ~counter~0 1)} is VALID [2021-09-13 14:24:32,553 INFO L281 TraceCheckUtils]: 13: Hoare triple {5846#(<= ~counter~0 1)} assume !!(main_~a~0 != main_~b~0); {5846#(<= ~counter~0 1)} is VALID [2021-09-13 14:24:32,554 INFO L281 TraceCheckUtils]: 14: Hoare triple {5846#(<= ~counter~0 1)} assume main_~a~0 > main_~b~0;main_~a~0 := main_~a~0 - main_~b~0;main_~p~0 := main_~p~0 - main_~q~0;main_~r~0 := main_~r~0 - main_~s~0; {5846#(<= ~counter~0 1)} is VALID [2021-09-13 14:24:32,554 INFO L281 TraceCheckUtils]: 15: Hoare triple {5846#(<= ~counter~0 1)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {5874#(<= ~counter~0 2)} is VALID [2021-09-13 14:24:32,554 INFO L281 TraceCheckUtils]: 16: Hoare triple {5874#(<= ~counter~0 2)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 1 == main_~p~0 * main_~s~0 - main_~r~0 * main_~q~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {5874#(<= ~counter~0 2)} is VALID [2021-09-13 14:24:32,555 INFO L281 TraceCheckUtils]: 17: Hoare triple {5874#(<= ~counter~0 2)} assume !(0 == __VERIFIER_assert_~cond); {5874#(<= ~counter~0 2)} is VALID [2021-09-13 14:24:32,556 INFO L281 TraceCheckUtils]: 18: Hoare triple {5874#(<= ~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; {5874#(<= ~counter~0 2)} is VALID [2021-09-13 14:24:32,556 INFO L281 TraceCheckUtils]: 19: Hoare triple {5874#(<= ~counter~0 2)} assume !(0 == __VERIFIER_assert_~cond); {5874#(<= ~counter~0 2)} is VALID [2021-09-13 14:24:32,556 INFO L281 TraceCheckUtils]: 20: Hoare triple {5874#(<= ~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; {5874#(<= ~counter~0 2)} is VALID [2021-09-13 14:24:32,556 INFO L281 TraceCheckUtils]: 21: Hoare triple {5874#(<= ~counter~0 2)} assume !(0 == __VERIFIER_assert_~cond); {5874#(<= ~counter~0 2)} is VALID [2021-09-13 14:24:32,557 INFO L281 TraceCheckUtils]: 22: Hoare triple {5874#(<= ~counter~0 2)} assume !!(main_~a~0 != main_~b~0); {5874#(<= ~counter~0 2)} is VALID [2021-09-13 14:24:32,557 INFO L281 TraceCheckUtils]: 23: Hoare triple {5874#(<= ~counter~0 2)} assume main_~a~0 > main_~b~0;main_~a~0 := main_~a~0 - main_~b~0;main_~p~0 := main_~p~0 - main_~q~0;main_~r~0 := main_~r~0 - main_~s~0; {5874#(<= ~counter~0 2)} is VALID [2021-09-13 14:24:32,557 INFO L281 TraceCheckUtils]: 24: Hoare triple {5874#(<= ~counter~0 2)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {5902#(<= ~counter~0 3)} is VALID [2021-09-13 14:24:32,558 INFO L281 TraceCheckUtils]: 25: Hoare triple {5902#(<= ~counter~0 3)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 1 == main_~p~0 * main_~s~0 - main_~r~0 * main_~q~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {5902#(<= ~counter~0 3)} is VALID [2021-09-13 14:24:32,558 INFO L281 TraceCheckUtils]: 26: Hoare triple {5902#(<= ~counter~0 3)} assume !(0 == __VERIFIER_assert_~cond); {5902#(<= ~counter~0 3)} is VALID [2021-09-13 14:24:32,558 INFO L281 TraceCheckUtils]: 27: Hoare triple {5902#(<= ~counter~0 3)} __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; {5902#(<= ~counter~0 3)} is VALID [2021-09-13 14:24:32,558 INFO L281 TraceCheckUtils]: 28: Hoare triple {5902#(<= ~counter~0 3)} assume !(0 == __VERIFIER_assert_~cond); {5902#(<= ~counter~0 3)} is VALID [2021-09-13 14:24:32,559 INFO L281 TraceCheckUtils]: 29: Hoare triple {5902#(<= ~counter~0 3)} __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; {5902#(<= ~counter~0 3)} is VALID [2021-09-13 14:24:32,559 INFO L281 TraceCheckUtils]: 30: Hoare triple {5902#(<= ~counter~0 3)} assume !(0 == __VERIFIER_assert_~cond); {5902#(<= ~counter~0 3)} is VALID [2021-09-13 14:24:32,559 INFO L281 TraceCheckUtils]: 31: Hoare triple {5902#(<= ~counter~0 3)} assume !!(main_~a~0 != main_~b~0); {5902#(<= ~counter~0 3)} is VALID [2021-09-13 14:24:32,560 INFO L281 TraceCheckUtils]: 32: Hoare triple {5902#(<= ~counter~0 3)} assume main_~a~0 > main_~b~0;main_~a~0 := main_~a~0 - main_~b~0;main_~p~0 := main_~p~0 - main_~q~0;main_~r~0 := main_~r~0 - main_~s~0; {5902#(<= ~counter~0 3)} is VALID [2021-09-13 14:24:32,560 INFO L281 TraceCheckUtils]: 33: Hoare triple {5902#(<= ~counter~0 3)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {5930#(<= ~counter~0 4)} is VALID [2021-09-13 14:24:32,560 INFO L281 TraceCheckUtils]: 34: Hoare triple {5930#(<= ~counter~0 4)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 1 == main_~p~0 * main_~s~0 - main_~r~0 * main_~q~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {5930#(<= ~counter~0 4)} is VALID [2021-09-13 14:24:32,560 INFO L281 TraceCheckUtils]: 35: Hoare triple {5930#(<= ~counter~0 4)} assume !(0 == __VERIFIER_assert_~cond); {5930#(<= ~counter~0 4)} is VALID [2021-09-13 14:24:32,561 INFO L281 TraceCheckUtils]: 36: Hoare triple {5930#(<= ~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; {5930#(<= ~counter~0 4)} is VALID [2021-09-13 14:24:32,561 INFO L281 TraceCheckUtils]: 37: Hoare triple {5930#(<= ~counter~0 4)} assume !(0 == __VERIFIER_assert_~cond); {5930#(<= ~counter~0 4)} is VALID [2021-09-13 14:24:32,562 INFO L281 TraceCheckUtils]: 38: Hoare triple {5930#(<= ~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; {5930#(<= ~counter~0 4)} is VALID [2021-09-13 14:24:32,562 INFO L281 TraceCheckUtils]: 39: Hoare triple {5930#(<= ~counter~0 4)} assume !(0 == __VERIFIER_assert_~cond); {5930#(<= ~counter~0 4)} is VALID [2021-09-13 14:24:32,562 INFO L281 TraceCheckUtils]: 40: Hoare triple {5930#(<= ~counter~0 4)} assume !!(main_~a~0 != main_~b~0); {5930#(<= ~counter~0 4)} is VALID [2021-09-13 14:24:32,562 INFO L281 TraceCheckUtils]: 41: Hoare triple {5930#(<= ~counter~0 4)} assume main_~a~0 > main_~b~0;main_~a~0 := main_~a~0 - main_~b~0;main_~p~0 := main_~p~0 - main_~q~0;main_~r~0 := main_~r~0 - main_~s~0; {5930#(<= ~counter~0 4)} is VALID [2021-09-13 14:24:32,563 INFO L281 TraceCheckUtils]: 42: Hoare triple {5930#(<= ~counter~0 4)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {5958#(<= |ULTIMATE.start_main_#t~post9| 4)} is VALID [2021-09-13 14:24:32,563 INFO L281 TraceCheckUtils]: 43: Hoare triple {5958#(<= |ULTIMATE.start_main_#t~post9| 4)} assume !(main_#t~post9 < 50);havoc main_#t~post9; {5823#false} is VALID [2021-09-13 14:24:32,563 INFO L281 TraceCheckUtils]: 44: Hoare triple {5823#false} __VERIFIER_assert_#in~cond := (if 0 == main_~a~0 - main_~b~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {5823#false} is VALID [2021-09-13 14:24:32,563 INFO L281 TraceCheckUtils]: 45: Hoare triple {5823#false} assume 0 == __VERIFIER_assert_~cond; {5823#false} is VALID [2021-09-13 14:24:32,563 INFO L281 TraceCheckUtils]: 46: Hoare triple {5823#false} assume !false; {5823#false} is VALID [2021-09-13 14:24:32,564 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:24:32,564 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 14:24:32,860 INFO L281 TraceCheckUtils]: 46: Hoare triple {5823#false} assume !false; {5823#false} is VALID [2021-09-13 14:24:32,861 INFO L281 TraceCheckUtils]: 45: Hoare triple {5823#false} assume 0 == __VERIFIER_assert_~cond; {5823#false} is VALID [2021-09-13 14:24:32,861 INFO L281 TraceCheckUtils]: 44: Hoare triple {5823#false} __VERIFIER_assert_#in~cond := (if 0 == main_~a~0 - main_~b~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {5823#false} is VALID [2021-09-13 14:24:32,861 INFO L281 TraceCheckUtils]: 43: Hoare triple {5980#(< |ULTIMATE.start_main_#t~post9| 50)} assume !(main_#t~post9 < 50);havoc main_#t~post9; {5823#false} is VALID [2021-09-13 14:24:32,861 INFO L281 TraceCheckUtils]: 42: Hoare triple {5984#(< ~counter~0 50)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {5980#(< |ULTIMATE.start_main_#t~post9| 50)} is VALID [2021-09-13 14:24:32,862 INFO L281 TraceCheckUtils]: 41: Hoare triple {5984#(< ~counter~0 50)} assume main_~a~0 > main_~b~0;main_~a~0 := main_~a~0 - main_~b~0;main_~p~0 := main_~p~0 - main_~q~0;main_~r~0 := main_~r~0 - main_~s~0; {5984#(< ~counter~0 50)} is VALID [2021-09-13 14:24:32,862 INFO L281 TraceCheckUtils]: 40: Hoare triple {5984#(< ~counter~0 50)} assume !!(main_~a~0 != main_~b~0); {5984#(< ~counter~0 50)} is VALID [2021-09-13 14:24:32,862 INFO L281 TraceCheckUtils]: 39: Hoare triple {5984#(< ~counter~0 50)} assume !(0 == __VERIFIER_assert_~cond); {5984#(< ~counter~0 50)} is VALID [2021-09-13 14:24:32,863 INFO L281 TraceCheckUtils]: 38: Hoare triple {5984#(< ~counter~0 50)} __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; {5984#(< ~counter~0 50)} is VALID [2021-09-13 14:24:32,863 INFO L281 TraceCheckUtils]: 37: Hoare triple {5984#(< ~counter~0 50)} assume !(0 == __VERIFIER_assert_~cond); {5984#(< ~counter~0 50)} is VALID [2021-09-13 14:24:32,863 INFO L281 TraceCheckUtils]: 36: Hoare triple {5984#(< ~counter~0 50)} __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; {5984#(< ~counter~0 50)} is VALID [2021-09-13 14:24:32,863 INFO L281 TraceCheckUtils]: 35: Hoare triple {5984#(< ~counter~0 50)} assume !(0 == __VERIFIER_assert_~cond); {5984#(< ~counter~0 50)} is VALID [2021-09-13 14:24:32,864 INFO L281 TraceCheckUtils]: 34: Hoare triple {5984#(< ~counter~0 50)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 1 == main_~p~0 * main_~s~0 - main_~r~0 * main_~q~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {5984#(< ~counter~0 50)} is VALID [2021-09-13 14:24:32,864 INFO L281 TraceCheckUtils]: 33: Hoare triple {6012#(< ~counter~0 49)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {5984#(< ~counter~0 50)} is VALID [2021-09-13 14:24:32,864 INFO L281 TraceCheckUtils]: 32: Hoare triple {6012#(< ~counter~0 49)} assume main_~a~0 > main_~b~0;main_~a~0 := main_~a~0 - main_~b~0;main_~p~0 := main_~p~0 - main_~q~0;main_~r~0 := main_~r~0 - main_~s~0; {6012#(< ~counter~0 49)} is VALID [2021-09-13 14:24:32,865 INFO L281 TraceCheckUtils]: 31: Hoare triple {6012#(< ~counter~0 49)} assume !!(main_~a~0 != main_~b~0); {6012#(< ~counter~0 49)} is VALID [2021-09-13 14:24:32,865 INFO L281 TraceCheckUtils]: 30: Hoare triple {6012#(< ~counter~0 49)} assume !(0 == __VERIFIER_assert_~cond); {6012#(< ~counter~0 49)} is VALID [2021-09-13 14:24:32,865 INFO L281 TraceCheckUtils]: 29: Hoare triple {6012#(< ~counter~0 49)} __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; {6012#(< ~counter~0 49)} is VALID [2021-09-13 14:24:32,865 INFO L281 TraceCheckUtils]: 28: Hoare triple {6012#(< ~counter~0 49)} assume !(0 == __VERIFIER_assert_~cond); {6012#(< ~counter~0 49)} is VALID [2021-09-13 14:24:32,866 INFO L281 TraceCheckUtils]: 27: Hoare triple {6012#(< ~counter~0 49)} __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; {6012#(< ~counter~0 49)} is VALID [2021-09-13 14:24:32,866 INFO L281 TraceCheckUtils]: 26: Hoare triple {6012#(< ~counter~0 49)} assume !(0 == __VERIFIER_assert_~cond); {6012#(< ~counter~0 49)} is VALID [2021-09-13 14:24:32,866 INFO L281 TraceCheckUtils]: 25: Hoare triple {6012#(< ~counter~0 49)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 1 == main_~p~0 * main_~s~0 - main_~r~0 * main_~q~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {6012#(< ~counter~0 49)} is VALID [2021-09-13 14:24:32,866 INFO L281 TraceCheckUtils]: 24: Hoare triple {6040#(< ~counter~0 48)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {6012#(< ~counter~0 49)} is VALID [2021-09-13 14:24:32,867 INFO L281 TraceCheckUtils]: 23: Hoare triple {6040#(< ~counter~0 48)} assume main_~a~0 > main_~b~0;main_~a~0 := main_~a~0 - main_~b~0;main_~p~0 := main_~p~0 - main_~q~0;main_~r~0 := main_~r~0 - main_~s~0; {6040#(< ~counter~0 48)} is VALID [2021-09-13 14:24:32,867 INFO L281 TraceCheckUtils]: 22: Hoare triple {6040#(< ~counter~0 48)} assume !!(main_~a~0 != main_~b~0); {6040#(< ~counter~0 48)} is VALID [2021-09-13 14:24:32,867 INFO L281 TraceCheckUtils]: 21: Hoare triple {6040#(< ~counter~0 48)} assume !(0 == __VERIFIER_assert_~cond); {6040#(< ~counter~0 48)} is VALID [2021-09-13 14:24:32,868 INFO L281 TraceCheckUtils]: 20: Hoare triple {6040#(< ~counter~0 48)} __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; {6040#(< ~counter~0 48)} is VALID [2021-09-13 14:24:32,868 INFO L281 TraceCheckUtils]: 19: Hoare triple {6040#(< ~counter~0 48)} assume !(0 == __VERIFIER_assert_~cond); {6040#(< ~counter~0 48)} is VALID [2021-09-13 14:24:32,868 INFO L281 TraceCheckUtils]: 18: Hoare triple {6040#(< ~counter~0 48)} __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; {6040#(< ~counter~0 48)} is VALID [2021-09-13 14:24:32,868 INFO L281 TraceCheckUtils]: 17: Hoare triple {6040#(< ~counter~0 48)} assume !(0 == __VERIFIER_assert_~cond); {6040#(< ~counter~0 48)} is VALID [2021-09-13 14:24:32,869 INFO L281 TraceCheckUtils]: 16: Hoare triple {6040#(< ~counter~0 48)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 1 == main_~p~0 * main_~s~0 - main_~r~0 * main_~q~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {6040#(< ~counter~0 48)} is VALID [2021-09-13 14:24:32,869 INFO L281 TraceCheckUtils]: 15: Hoare triple {6068#(< ~counter~0 47)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {6040#(< ~counter~0 48)} is VALID [2021-09-13 14:24:32,869 INFO L281 TraceCheckUtils]: 14: Hoare triple {6068#(< ~counter~0 47)} assume main_~a~0 > main_~b~0;main_~a~0 := main_~a~0 - main_~b~0;main_~p~0 := main_~p~0 - main_~q~0;main_~r~0 := main_~r~0 - main_~s~0; {6068#(< ~counter~0 47)} is VALID [2021-09-13 14:24:32,869 INFO L281 TraceCheckUtils]: 13: Hoare triple {6068#(< ~counter~0 47)} assume !!(main_~a~0 != main_~b~0); {6068#(< ~counter~0 47)} is VALID [2021-09-13 14:24:32,870 INFO L281 TraceCheckUtils]: 12: Hoare triple {6068#(< ~counter~0 47)} assume !(0 == __VERIFIER_assert_~cond); {6068#(< ~counter~0 47)} is VALID [2021-09-13 14:24:32,870 INFO L281 TraceCheckUtils]: 11: Hoare triple {6068#(< ~counter~0 47)} __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; {6068#(< ~counter~0 47)} is VALID [2021-09-13 14:24:32,870 INFO L281 TraceCheckUtils]: 10: Hoare triple {6068#(< ~counter~0 47)} assume !(0 == __VERIFIER_assert_~cond); {6068#(< ~counter~0 47)} is VALID [2021-09-13 14:24:32,870 INFO L281 TraceCheckUtils]: 9: Hoare triple {6068#(< ~counter~0 47)} __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; {6068#(< ~counter~0 47)} is VALID [2021-09-13 14:24:32,871 INFO L281 TraceCheckUtils]: 8: Hoare triple {6068#(< ~counter~0 47)} assume !(0 == __VERIFIER_assert_~cond); {6068#(< ~counter~0 47)} is VALID [2021-09-13 14:24:32,871 INFO L281 TraceCheckUtils]: 7: Hoare triple {6068#(< ~counter~0 47)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 1 == main_~p~0 * main_~s~0 - main_~r~0 * main_~q~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {6068#(< ~counter~0 47)} is VALID [2021-09-13 14:24:32,871 INFO L281 TraceCheckUtils]: 6: Hoare triple {6096#(< ~counter~0 46)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {6068#(< ~counter~0 47)} is VALID [2021-09-13 14:24:32,872 INFO L281 TraceCheckUtils]: 5: Hoare triple {6096#(< ~counter~0 46)} 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; {6096#(< ~counter~0 46)} is VALID [2021-09-13 14:24:32,872 INFO L281 TraceCheckUtils]: 4: Hoare triple {6096#(< ~counter~0 46)} assume !(0 == assume_abort_if_not_~cond); {6096#(< ~counter~0 46)} is VALID [2021-09-13 14:24:32,872 INFO L281 TraceCheckUtils]: 3: Hoare triple {6096#(< ~counter~0 46)} 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; {6096#(< ~counter~0 46)} is VALID [2021-09-13 14:24:32,872 INFO L281 TraceCheckUtils]: 2: Hoare triple {6096#(< ~counter~0 46)} assume !(0 == assume_abort_if_not_~cond); {6096#(< ~counter~0 46)} is VALID [2021-09-13 14:24:32,873 INFO L281 TraceCheckUtils]: 1: Hoare triple {6096#(< ~counter~0 46)} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~post9, main_~a~0, main_~b~0, main_~p~0, main_~q~0, main_~r~0, main_~s~0, main_~x~0, 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_~x~0;havoc main_~y~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; {6096#(< ~counter~0 46)} is VALID [2021-09-13 14:24:32,873 INFO L281 TraceCheckUtils]: 0: Hoare triple {5822#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(10);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~counter~0 := 0; {6096#(< ~counter~0 46)} is VALID [2021-09-13 14:24:32,874 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:24:32,874 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:24:32,874 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515601025] [2021-09-13 14:24:32,874 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-09-13 14:24:32,874 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [269172792] [2021-09-13 14:24:32,874 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [269172792] provided 0 perfect and 2 imperfect interpolant sequences [2021-09-13 14:24:32,874 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-09-13 14:24:32,874 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2021-09-13 14:24:32,875 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089898364] [2021-09-13 14:24:32,881 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.5) internal successors, (91), 13 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2021-09-13 14:24:32,881 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:24:32,882 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 6.5) internal successors, (91), 13 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:24:32,937 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:24:32,937 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-09-13 14:24:32,937 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:24:32,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-09-13 14:24:32,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2021-09-13 14:24:32,938 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand has 14 states, 14 states have (on average 6.5) internal successors, (91), 13 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:24:33,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:24:33,547 INFO L93 Difference]: Finished difference Result 114 states and 129 transitions. [2021-09-13 14:24:33,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-09-13 14:24:33,548 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.5) internal successors, (91), 13 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2021-09-13 14:24:33,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:24:33,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 6.5) internal successors, (91), 13 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:24:33,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 129 transitions. [2021-09-13 14:24:33,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 6.5) internal successors, (91), 13 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:24:33,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 129 transitions. [2021-09-13 14:24:33,549 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 129 transitions. [2021-09-13 14:24:33,629 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 129 edges. 129 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:24:33,630 INFO L225 Difference]: With dead ends: 114 [2021-09-13 14:24:33,630 INFO L226 Difference]: Without dead ends: 106 [2021-09-13 14:24:33,630 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 121.67ms TimeCoverageRelationStatistics Valid=184, Invalid=322, Unknown=0, NotChecked=0, Total=506 [2021-09-13 14:24:33,630 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 63 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 148.17ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.12ms SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 149.28ms IncrementalHoareTripleChecker+Time [2021-09-13 14:24:33,630 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [63 Valid, 0 Invalid, 208 Unknown, 0 Unchecked, 1.12ms Time], IncrementalHoareTripleChecker [12 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 149.28ms Time] [2021-09-13 14:24:33,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2021-09-13 14:24:33,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2021-09-13 14:24:33,872 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:24:33,872 INFO L82 GeneralOperation]: Start isEquivalent. First operand 106 states. Second operand has 106 states, 104 states have (on average 1.1153846153846154) internal successors, (116), 105 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call 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:33,872 INFO L74 IsIncluded]: Start isIncluded. First operand 106 states. Second operand has 106 states, 104 states have (on average 1.1153846153846154) internal successors, (116), 105 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call 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:33,872 INFO L87 Difference]: Start difference. First operand 106 states. Second operand has 106 states, 104 states have (on average 1.1153846153846154) internal successors, (116), 105 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call 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:33,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:24:33,873 INFO L93 Difference]: Finished difference Result 106 states and 116 transitions. [2021-09-13 14:24:33,874 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 116 transitions. [2021-09-13 14:24:33,874 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:24:33,874 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:24:33,874 INFO L74 IsIncluded]: Start isIncluded. First operand has 106 states, 104 states have (on average 1.1153846153846154) internal successors, (116), 105 states have internal predecessors, (116), 0 states have call successors, (0), 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 106 states. [2021-09-13 14:24:33,874 INFO L87 Difference]: Start difference. First operand has 106 states, 104 states have (on average 1.1153846153846154) internal successors, (116), 105 states have internal predecessors, (116), 0 states have call successors, (0), 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 106 states. [2021-09-13 14:24:33,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:24:33,875 INFO L93 Difference]: Finished difference Result 106 states and 116 transitions. [2021-09-13 14:24:33,875 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 116 transitions. [2021-09-13 14:24:33,876 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:24:33,876 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:24:33,876 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:24:33,876 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:24:33,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 104 states have (on average 1.1153846153846154) internal successors, (116), 105 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call 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:33,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 116 transitions. [2021-09-13 14:24:33,877 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 116 transitions. Word has length 47 [2021-09-13 14:24:33,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:24:33,877 INFO L470 AbstractCegarLoop]: Abstraction has 106 states and 116 transitions. [2021-09-13 14:24:33,878 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.5) internal successors, (91), 13 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:24:33,878 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 116 transitions. [2021-09-13 14:24:33,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2021-09-13 14:24:33,878 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:24:33,878 INFO L513 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 14:24:33,895 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:24:34,092 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,SelfDestructingSolverStorable11 [2021-09-13 14:24:34,092 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-09-13 14:24:34,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:24:34,093 INFO L82 PathProgramCache]: Analyzing trace with hash 2135431873, now seen corresponding path program 3 times [2021-09-13 14:24:34,093 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:24:34,093 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487711560] [2021-09-13 14:24:34,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:24:34,093 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:24:34,099 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-09-13 14:24:34,099 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1254406592] [2021-09-13 14:24:34,099 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-09-13 14:24:34,099 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:24:34,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:24:34,100 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:24:34,101 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:24:34,212 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2021-09-13 14:24:34,212 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-09-13 14:24:34,214 INFO L263 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 23 conjunts are in the unsatisfiable core [2021-09-13 14:24:34,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:24:34,231 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:24:34,979 INFO L281 TraceCheckUtils]: 0: Hoare triple {6649#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(10);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~counter~0 := 0; {6654#(<= ~counter~0 0)} is VALID [2021-09-13 14:24:34,980 INFO L281 TraceCheckUtils]: 1: Hoare triple {6654#(<= ~counter~0 0)} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~post9, main_~a~0, main_~b~0, main_~p~0, main_~q~0, main_~r~0, main_~s~0, main_~x~0, 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_~x~0;havoc main_~y~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; {6654#(<= ~counter~0 0)} is VALID [2021-09-13 14:24:34,980 INFO L281 TraceCheckUtils]: 2: Hoare triple {6654#(<= ~counter~0 0)} assume !(0 == assume_abort_if_not_~cond); {6654#(<= ~counter~0 0)} is VALID [2021-09-13 14:24:34,981 INFO L281 TraceCheckUtils]: 3: Hoare triple {6654#(<= ~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; {6654#(<= ~counter~0 0)} is VALID [2021-09-13 14:24:34,981 INFO L281 TraceCheckUtils]: 4: Hoare triple {6654#(<= ~counter~0 0)} assume !(0 == assume_abort_if_not_~cond); {6654#(<= ~counter~0 0)} is VALID [2021-09-13 14:24:34,981 INFO L281 TraceCheckUtils]: 5: Hoare triple {6654#(<= ~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; {6654#(<= ~counter~0 0)} is VALID [2021-09-13 14:24:34,982 INFO L281 TraceCheckUtils]: 6: Hoare triple {6654#(<= ~counter~0 0)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {6673#(<= ~counter~0 1)} is VALID [2021-09-13 14:24:34,982 INFO L281 TraceCheckUtils]: 7: Hoare triple {6673#(<= ~counter~0 1)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 1 == main_~p~0 * main_~s~0 - main_~r~0 * main_~q~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {6673#(<= ~counter~0 1)} is VALID [2021-09-13 14:24:34,982 INFO L281 TraceCheckUtils]: 8: Hoare triple {6673#(<= ~counter~0 1)} assume !(0 == __VERIFIER_assert_~cond); {6673#(<= ~counter~0 1)} is VALID [2021-09-13 14:24:34,983 INFO L281 TraceCheckUtils]: 9: Hoare triple {6673#(<= ~counter~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; {6673#(<= ~counter~0 1)} is VALID [2021-09-13 14:24:34,983 INFO L281 TraceCheckUtils]: 10: Hoare triple {6673#(<= ~counter~0 1)} assume !(0 == __VERIFIER_assert_~cond); {6673#(<= ~counter~0 1)} is VALID [2021-09-13 14:24:34,983 INFO L281 TraceCheckUtils]: 11: Hoare triple {6673#(<= ~counter~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; {6673#(<= ~counter~0 1)} is VALID [2021-09-13 14:24:34,984 INFO L281 TraceCheckUtils]: 12: Hoare triple {6673#(<= ~counter~0 1)} assume !(0 == __VERIFIER_assert_~cond); {6673#(<= ~counter~0 1)} is VALID [2021-09-13 14:24:34,984 INFO L281 TraceCheckUtils]: 13: Hoare triple {6673#(<= ~counter~0 1)} assume !!(main_~a~0 != main_~b~0); {6673#(<= ~counter~0 1)} is VALID [2021-09-13 14:24:34,984 INFO L281 TraceCheckUtils]: 14: Hoare triple {6673#(<= ~counter~0 1)} assume main_~a~0 > main_~b~0;main_~a~0 := main_~a~0 - main_~b~0;main_~p~0 := main_~p~0 - main_~q~0;main_~r~0 := main_~r~0 - main_~s~0; {6673#(<= ~counter~0 1)} is VALID [2021-09-13 14:24:34,985 INFO L281 TraceCheckUtils]: 15: Hoare triple {6673#(<= ~counter~0 1)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {6701#(<= ~counter~0 2)} is VALID [2021-09-13 14:24:34,985 INFO L281 TraceCheckUtils]: 16: Hoare triple {6701#(<= ~counter~0 2)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 1 == main_~p~0 * main_~s~0 - main_~r~0 * main_~q~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {6701#(<= ~counter~0 2)} is VALID [2021-09-13 14:24:34,986 INFO L281 TraceCheckUtils]: 17: Hoare triple {6701#(<= ~counter~0 2)} assume !(0 == __VERIFIER_assert_~cond); {6701#(<= ~counter~0 2)} is VALID [2021-09-13 14:24:34,986 INFO L281 TraceCheckUtils]: 18: Hoare triple {6701#(<= ~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; {6701#(<= ~counter~0 2)} is VALID [2021-09-13 14:24:34,986 INFO L281 TraceCheckUtils]: 19: Hoare triple {6701#(<= ~counter~0 2)} assume !(0 == __VERIFIER_assert_~cond); {6701#(<= ~counter~0 2)} is VALID [2021-09-13 14:24:34,987 INFO L281 TraceCheckUtils]: 20: Hoare triple {6701#(<= ~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; {6701#(<= ~counter~0 2)} is VALID [2021-09-13 14:24:34,987 INFO L281 TraceCheckUtils]: 21: Hoare triple {6701#(<= ~counter~0 2)} assume !(0 == __VERIFIER_assert_~cond); {6701#(<= ~counter~0 2)} is VALID [2021-09-13 14:24:34,987 INFO L281 TraceCheckUtils]: 22: Hoare triple {6701#(<= ~counter~0 2)} assume !!(main_~a~0 != main_~b~0); {6701#(<= ~counter~0 2)} is VALID [2021-09-13 14:24:34,987 INFO L281 TraceCheckUtils]: 23: Hoare triple {6701#(<= ~counter~0 2)} assume main_~a~0 > main_~b~0;main_~a~0 := main_~a~0 - main_~b~0;main_~p~0 := main_~p~0 - main_~q~0;main_~r~0 := main_~r~0 - main_~s~0; {6701#(<= ~counter~0 2)} is VALID [2021-09-13 14:24:34,988 INFO L281 TraceCheckUtils]: 24: Hoare triple {6701#(<= ~counter~0 2)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {6729#(<= ~counter~0 3)} is VALID [2021-09-13 14:24:34,988 INFO L281 TraceCheckUtils]: 25: Hoare triple {6729#(<= ~counter~0 3)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 1 == main_~p~0 * main_~s~0 - main_~r~0 * main_~q~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {6729#(<= ~counter~0 3)} is VALID [2021-09-13 14:24:34,988 INFO L281 TraceCheckUtils]: 26: Hoare triple {6729#(<= ~counter~0 3)} assume !(0 == __VERIFIER_assert_~cond); {6729#(<= ~counter~0 3)} is VALID [2021-09-13 14:24:34,989 INFO L281 TraceCheckUtils]: 27: Hoare triple {6729#(<= ~counter~0 3)} __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; {6729#(<= ~counter~0 3)} is VALID [2021-09-13 14:24:34,989 INFO L281 TraceCheckUtils]: 28: Hoare triple {6729#(<= ~counter~0 3)} assume !(0 == __VERIFIER_assert_~cond); {6729#(<= ~counter~0 3)} is VALID [2021-09-13 14:24:34,989 INFO L281 TraceCheckUtils]: 29: Hoare triple {6729#(<= ~counter~0 3)} __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; {6729#(<= ~counter~0 3)} is VALID [2021-09-13 14:24:34,990 INFO L281 TraceCheckUtils]: 30: Hoare triple {6729#(<= ~counter~0 3)} assume !(0 == __VERIFIER_assert_~cond); {6729#(<= ~counter~0 3)} is VALID [2021-09-13 14:24:34,990 INFO L281 TraceCheckUtils]: 31: Hoare triple {6729#(<= ~counter~0 3)} assume !!(main_~a~0 != main_~b~0); {6729#(<= ~counter~0 3)} is VALID [2021-09-13 14:24:34,990 INFO L281 TraceCheckUtils]: 32: Hoare triple {6729#(<= ~counter~0 3)} assume main_~a~0 > main_~b~0;main_~a~0 := main_~a~0 - main_~b~0;main_~p~0 := main_~p~0 - main_~q~0;main_~r~0 := main_~r~0 - main_~s~0; {6729#(<= ~counter~0 3)} is VALID [2021-09-13 14:24:34,991 INFO L281 TraceCheckUtils]: 33: Hoare triple {6729#(<= ~counter~0 3)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {6757#(<= ~counter~0 4)} is VALID [2021-09-13 14:24:34,991 INFO L281 TraceCheckUtils]: 34: Hoare triple {6757#(<= ~counter~0 4)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 1 == main_~p~0 * main_~s~0 - main_~r~0 * main_~q~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {6757#(<= ~counter~0 4)} is VALID [2021-09-13 14:24:34,991 INFO L281 TraceCheckUtils]: 35: Hoare triple {6757#(<= ~counter~0 4)} assume !(0 == __VERIFIER_assert_~cond); {6757#(<= ~counter~0 4)} is VALID [2021-09-13 14:24:34,992 INFO L281 TraceCheckUtils]: 36: Hoare triple {6757#(<= ~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; {6757#(<= ~counter~0 4)} is VALID [2021-09-13 14:24:34,992 INFO L281 TraceCheckUtils]: 37: Hoare triple {6757#(<= ~counter~0 4)} assume !(0 == __VERIFIER_assert_~cond); {6757#(<= ~counter~0 4)} is VALID [2021-09-13 14:24:34,992 INFO L281 TraceCheckUtils]: 38: Hoare triple {6757#(<= ~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; {6757#(<= ~counter~0 4)} is VALID [2021-09-13 14:24:34,992 INFO L281 TraceCheckUtils]: 39: Hoare triple {6757#(<= ~counter~0 4)} assume !(0 == __VERIFIER_assert_~cond); {6757#(<= ~counter~0 4)} is VALID [2021-09-13 14:24:34,993 INFO L281 TraceCheckUtils]: 40: Hoare triple {6757#(<= ~counter~0 4)} assume !!(main_~a~0 != main_~b~0); {6757#(<= ~counter~0 4)} is VALID [2021-09-13 14:24:34,993 INFO L281 TraceCheckUtils]: 41: Hoare triple {6757#(<= ~counter~0 4)} assume main_~a~0 > main_~b~0;main_~a~0 := main_~a~0 - main_~b~0;main_~p~0 := main_~p~0 - main_~q~0;main_~r~0 := main_~r~0 - main_~s~0; {6757#(<= ~counter~0 4)} is VALID [2021-09-13 14:24:34,993 INFO L281 TraceCheckUtils]: 42: Hoare triple {6757#(<= ~counter~0 4)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {6785#(<= ~counter~0 5)} is VALID [2021-09-13 14:24:34,994 INFO L281 TraceCheckUtils]: 43: Hoare triple {6785#(<= ~counter~0 5)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 1 == main_~p~0 * main_~s~0 - main_~r~0 * main_~q~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {6785#(<= ~counter~0 5)} is VALID [2021-09-13 14:24:34,994 INFO L281 TraceCheckUtils]: 44: Hoare triple {6785#(<= ~counter~0 5)} assume !(0 == __VERIFIER_assert_~cond); {6785#(<= ~counter~0 5)} is VALID [2021-09-13 14:24:34,994 INFO L281 TraceCheckUtils]: 45: Hoare triple {6785#(<= ~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; {6785#(<= ~counter~0 5)} is VALID [2021-09-13 14:24:34,995 INFO L281 TraceCheckUtils]: 46: Hoare triple {6785#(<= ~counter~0 5)} assume !(0 == __VERIFIER_assert_~cond); {6785#(<= ~counter~0 5)} is VALID [2021-09-13 14:24:34,995 INFO L281 TraceCheckUtils]: 47: Hoare triple {6785#(<= ~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; {6785#(<= ~counter~0 5)} is VALID [2021-09-13 14:24:34,995 INFO L281 TraceCheckUtils]: 48: Hoare triple {6785#(<= ~counter~0 5)} assume !(0 == __VERIFIER_assert_~cond); {6785#(<= ~counter~0 5)} is VALID [2021-09-13 14:24:34,995 INFO L281 TraceCheckUtils]: 49: Hoare triple {6785#(<= ~counter~0 5)} assume !!(main_~a~0 != main_~b~0); {6785#(<= ~counter~0 5)} is VALID [2021-09-13 14:24:34,996 INFO L281 TraceCheckUtils]: 50: Hoare triple {6785#(<= ~counter~0 5)} assume main_~a~0 > main_~b~0;main_~a~0 := main_~a~0 - main_~b~0;main_~p~0 := main_~p~0 - main_~q~0;main_~r~0 := main_~r~0 - main_~s~0; {6785#(<= ~counter~0 5)} is VALID [2021-09-13 14:24:34,996 INFO L281 TraceCheckUtils]: 51: Hoare triple {6785#(<= ~counter~0 5)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {6813#(<= ~counter~0 6)} is VALID [2021-09-13 14:24:34,996 INFO L281 TraceCheckUtils]: 52: Hoare triple {6813#(<= ~counter~0 6)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 1 == main_~p~0 * main_~s~0 - main_~r~0 * main_~q~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {6813#(<= ~counter~0 6)} is VALID [2021-09-13 14:24:34,997 INFO L281 TraceCheckUtils]: 53: Hoare triple {6813#(<= ~counter~0 6)} assume !(0 == __VERIFIER_assert_~cond); {6813#(<= ~counter~0 6)} is VALID [2021-09-13 14:24:34,997 INFO L281 TraceCheckUtils]: 54: Hoare triple {6813#(<= ~counter~0 6)} __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; {6813#(<= ~counter~0 6)} is VALID [2021-09-13 14:24:34,997 INFO L281 TraceCheckUtils]: 55: Hoare triple {6813#(<= ~counter~0 6)} assume !(0 == __VERIFIER_assert_~cond); {6813#(<= ~counter~0 6)} is VALID [2021-09-13 14:24:34,998 INFO L281 TraceCheckUtils]: 56: Hoare triple {6813#(<= ~counter~0 6)} __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; {6813#(<= ~counter~0 6)} is VALID [2021-09-13 14:24:34,998 INFO L281 TraceCheckUtils]: 57: Hoare triple {6813#(<= ~counter~0 6)} assume !(0 == __VERIFIER_assert_~cond); {6813#(<= ~counter~0 6)} is VALID [2021-09-13 14:24:34,998 INFO L281 TraceCheckUtils]: 58: Hoare triple {6813#(<= ~counter~0 6)} assume !!(main_~a~0 != main_~b~0); {6813#(<= ~counter~0 6)} is VALID [2021-09-13 14:24:34,998 INFO L281 TraceCheckUtils]: 59: Hoare triple {6813#(<= ~counter~0 6)} assume main_~a~0 > main_~b~0;main_~a~0 := main_~a~0 - main_~b~0;main_~p~0 := main_~p~0 - main_~q~0;main_~r~0 := main_~r~0 - main_~s~0; {6813#(<= ~counter~0 6)} is VALID [2021-09-13 14:24:34,999 INFO L281 TraceCheckUtils]: 60: Hoare triple {6813#(<= ~counter~0 6)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {6841#(<= ~counter~0 7)} is VALID [2021-09-13 14:24:34,999 INFO L281 TraceCheckUtils]: 61: Hoare triple {6841#(<= ~counter~0 7)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 1 == main_~p~0 * main_~s~0 - main_~r~0 * main_~q~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {6841#(<= ~counter~0 7)} is VALID [2021-09-13 14:24:35,000 INFO L281 TraceCheckUtils]: 62: Hoare triple {6841#(<= ~counter~0 7)} assume !(0 == __VERIFIER_assert_~cond); {6841#(<= ~counter~0 7)} is VALID [2021-09-13 14:24:35,000 INFO L281 TraceCheckUtils]: 63: Hoare triple {6841#(<= ~counter~0 7)} __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; {6841#(<= ~counter~0 7)} is VALID [2021-09-13 14:24:35,000 INFO L281 TraceCheckUtils]: 64: Hoare triple {6841#(<= ~counter~0 7)} assume !(0 == __VERIFIER_assert_~cond); {6841#(<= ~counter~0 7)} is VALID [2021-09-13 14:24:35,000 INFO L281 TraceCheckUtils]: 65: Hoare triple {6841#(<= ~counter~0 7)} __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; {6841#(<= ~counter~0 7)} is VALID [2021-09-13 14:24:35,001 INFO L281 TraceCheckUtils]: 66: Hoare triple {6841#(<= ~counter~0 7)} assume !(0 == __VERIFIER_assert_~cond); {6841#(<= ~counter~0 7)} is VALID [2021-09-13 14:24:35,001 INFO L281 TraceCheckUtils]: 67: Hoare triple {6841#(<= ~counter~0 7)} assume !!(main_~a~0 != main_~b~0); {6841#(<= ~counter~0 7)} is VALID [2021-09-13 14:24:35,001 INFO L281 TraceCheckUtils]: 68: Hoare triple {6841#(<= ~counter~0 7)} assume main_~a~0 > main_~b~0;main_~a~0 := main_~a~0 - main_~b~0;main_~p~0 := main_~p~0 - main_~q~0;main_~r~0 := main_~r~0 - main_~s~0; {6841#(<= ~counter~0 7)} is VALID [2021-09-13 14:24:35,002 INFO L281 TraceCheckUtils]: 69: Hoare triple {6841#(<= ~counter~0 7)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {6869#(<= ~counter~0 8)} is VALID [2021-09-13 14:24:35,002 INFO L281 TraceCheckUtils]: 70: Hoare triple {6869#(<= ~counter~0 8)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 1 == main_~p~0 * main_~s~0 - main_~r~0 * main_~q~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {6869#(<= ~counter~0 8)} is VALID [2021-09-13 14:24:35,002 INFO L281 TraceCheckUtils]: 71: Hoare triple {6869#(<= ~counter~0 8)} assume !(0 == __VERIFIER_assert_~cond); {6869#(<= ~counter~0 8)} is VALID [2021-09-13 14:24:35,003 INFO L281 TraceCheckUtils]: 72: Hoare triple {6869#(<= ~counter~0 8)} __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; {6869#(<= ~counter~0 8)} is VALID [2021-09-13 14:24:35,003 INFO L281 TraceCheckUtils]: 73: Hoare triple {6869#(<= ~counter~0 8)} assume !(0 == __VERIFIER_assert_~cond); {6869#(<= ~counter~0 8)} is VALID [2021-09-13 14:24:35,003 INFO L281 TraceCheckUtils]: 74: Hoare triple {6869#(<= ~counter~0 8)} __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; {6869#(<= ~counter~0 8)} is VALID [2021-09-13 14:24:35,004 INFO L281 TraceCheckUtils]: 75: Hoare triple {6869#(<= ~counter~0 8)} assume !(0 == __VERIFIER_assert_~cond); {6869#(<= ~counter~0 8)} is VALID [2021-09-13 14:24:35,004 INFO L281 TraceCheckUtils]: 76: Hoare triple {6869#(<= ~counter~0 8)} assume !!(main_~a~0 != main_~b~0); {6869#(<= ~counter~0 8)} is VALID [2021-09-13 14:24:35,004 INFO L281 TraceCheckUtils]: 77: Hoare triple {6869#(<= ~counter~0 8)} assume main_~a~0 > main_~b~0;main_~a~0 := main_~a~0 - main_~b~0;main_~p~0 := main_~p~0 - main_~q~0;main_~r~0 := main_~r~0 - main_~s~0; {6869#(<= ~counter~0 8)} is VALID [2021-09-13 14:24:35,005 INFO L281 TraceCheckUtils]: 78: Hoare triple {6869#(<= ~counter~0 8)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {6897#(<= ~counter~0 9)} is VALID [2021-09-13 14:24:35,005 INFO L281 TraceCheckUtils]: 79: Hoare triple {6897#(<= ~counter~0 9)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 1 == main_~p~0 * main_~s~0 - main_~r~0 * main_~q~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {6897#(<= ~counter~0 9)} is VALID [2021-09-13 14:24:35,005 INFO L281 TraceCheckUtils]: 80: Hoare triple {6897#(<= ~counter~0 9)} assume !(0 == __VERIFIER_assert_~cond); {6897#(<= ~counter~0 9)} is VALID [2021-09-13 14:24:35,006 INFO L281 TraceCheckUtils]: 81: Hoare triple {6897#(<= ~counter~0 9)} __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; {6897#(<= ~counter~0 9)} is VALID [2021-09-13 14:24:35,006 INFO L281 TraceCheckUtils]: 82: Hoare triple {6897#(<= ~counter~0 9)} assume !(0 == __VERIFIER_assert_~cond); {6897#(<= ~counter~0 9)} is VALID [2021-09-13 14:24:35,006 INFO L281 TraceCheckUtils]: 83: Hoare triple {6897#(<= ~counter~0 9)} __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; {6897#(<= ~counter~0 9)} is VALID [2021-09-13 14:24:35,006 INFO L281 TraceCheckUtils]: 84: Hoare triple {6897#(<= ~counter~0 9)} assume !(0 == __VERIFIER_assert_~cond); {6897#(<= ~counter~0 9)} is VALID [2021-09-13 14:24:35,007 INFO L281 TraceCheckUtils]: 85: Hoare triple {6897#(<= ~counter~0 9)} assume !!(main_~a~0 != main_~b~0); {6897#(<= ~counter~0 9)} is VALID [2021-09-13 14:24:35,007 INFO L281 TraceCheckUtils]: 86: Hoare triple {6897#(<= ~counter~0 9)} assume main_~a~0 > main_~b~0;main_~a~0 := main_~a~0 - main_~b~0;main_~p~0 := main_~p~0 - main_~q~0;main_~r~0 := main_~r~0 - main_~s~0; {6897#(<= ~counter~0 9)} is VALID [2021-09-13 14:24:35,007 INFO L281 TraceCheckUtils]: 87: Hoare triple {6897#(<= ~counter~0 9)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {6925#(<= ~counter~0 10)} is VALID [2021-09-13 14:24:35,008 INFO L281 TraceCheckUtils]: 88: Hoare triple {6925#(<= ~counter~0 10)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 1 == main_~p~0 * main_~s~0 - main_~r~0 * main_~q~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {6925#(<= ~counter~0 10)} is VALID [2021-09-13 14:24:35,008 INFO L281 TraceCheckUtils]: 89: Hoare triple {6925#(<= ~counter~0 10)} assume !(0 == __VERIFIER_assert_~cond); {6925#(<= ~counter~0 10)} is VALID [2021-09-13 14:24:35,008 INFO L281 TraceCheckUtils]: 90: Hoare triple {6925#(<= ~counter~0 10)} __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; {6925#(<= ~counter~0 10)} is VALID [2021-09-13 14:24:35,009 INFO L281 TraceCheckUtils]: 91: Hoare triple {6925#(<= ~counter~0 10)} assume !(0 == __VERIFIER_assert_~cond); {6925#(<= ~counter~0 10)} is VALID [2021-09-13 14:24:35,009 INFO L281 TraceCheckUtils]: 92: Hoare triple {6925#(<= ~counter~0 10)} __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; {6925#(<= ~counter~0 10)} is VALID [2021-09-13 14:24:35,009 INFO L281 TraceCheckUtils]: 93: Hoare triple {6925#(<= ~counter~0 10)} assume !(0 == __VERIFIER_assert_~cond); {6925#(<= ~counter~0 10)} is VALID [2021-09-13 14:24:35,010 INFO L281 TraceCheckUtils]: 94: Hoare triple {6925#(<= ~counter~0 10)} assume !!(main_~a~0 != main_~b~0); {6925#(<= ~counter~0 10)} is VALID [2021-09-13 14:24:35,010 INFO L281 TraceCheckUtils]: 95: Hoare triple {6925#(<= ~counter~0 10)} assume main_~a~0 > main_~b~0;main_~a~0 := main_~a~0 - main_~b~0;main_~p~0 := main_~p~0 - main_~q~0;main_~r~0 := main_~r~0 - main_~s~0; {6925#(<= ~counter~0 10)} is VALID [2021-09-13 14:24:35,010 INFO L281 TraceCheckUtils]: 96: Hoare triple {6925#(<= ~counter~0 10)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {6953#(<= |ULTIMATE.start_main_#t~post9| 10)} is VALID [2021-09-13 14:24:35,011 INFO L281 TraceCheckUtils]: 97: Hoare triple {6953#(<= |ULTIMATE.start_main_#t~post9| 10)} assume !(main_#t~post9 < 50);havoc main_#t~post9; {6650#false} is VALID [2021-09-13 14:24:35,011 INFO L281 TraceCheckUtils]: 98: Hoare triple {6650#false} __VERIFIER_assert_#in~cond := (if 0 == main_~a~0 - main_~b~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {6650#false} is VALID [2021-09-13 14:24:35,011 INFO L281 TraceCheckUtils]: 99: Hoare triple {6650#false} assume 0 == __VERIFIER_assert_~cond; {6650#false} is VALID [2021-09-13 14:24:35,011 INFO L281 TraceCheckUtils]: 100: Hoare triple {6650#false} assume !false; {6650#false} is VALID [2021-09-13 14:24:35,011 INFO L134 CoverageAnalysis]: Checked inductivity of 425 backedges. 0 proven. 425 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:24:35,011 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 14:24:35,791 INFO L281 TraceCheckUtils]: 100: Hoare triple {6650#false} assume !false; {6650#false} is VALID [2021-09-13 14:24:35,792 INFO L281 TraceCheckUtils]: 99: Hoare triple {6650#false} assume 0 == __VERIFIER_assert_~cond; {6650#false} is VALID [2021-09-13 14:24:35,792 INFO L281 TraceCheckUtils]: 98: Hoare triple {6650#false} __VERIFIER_assert_#in~cond := (if 0 == main_~a~0 - main_~b~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {6650#false} is VALID [2021-09-13 14:24:35,792 INFO L281 TraceCheckUtils]: 97: Hoare triple {6975#(< |ULTIMATE.start_main_#t~post9| 50)} assume !(main_#t~post9 < 50);havoc main_#t~post9; {6650#false} is VALID [2021-09-13 14:24:35,792 INFO L281 TraceCheckUtils]: 96: Hoare triple {6979#(< ~counter~0 50)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {6975#(< |ULTIMATE.start_main_#t~post9| 50)} is VALID [2021-09-13 14:24:35,793 INFO L281 TraceCheckUtils]: 95: Hoare triple {6979#(< ~counter~0 50)} assume main_~a~0 > main_~b~0;main_~a~0 := main_~a~0 - main_~b~0;main_~p~0 := main_~p~0 - main_~q~0;main_~r~0 := main_~r~0 - main_~s~0; {6979#(< ~counter~0 50)} is VALID [2021-09-13 14:24:35,793 INFO L281 TraceCheckUtils]: 94: Hoare triple {6979#(< ~counter~0 50)} assume !!(main_~a~0 != main_~b~0); {6979#(< ~counter~0 50)} is VALID [2021-09-13 14:24:35,793 INFO L281 TraceCheckUtils]: 93: Hoare triple {6979#(< ~counter~0 50)} assume !(0 == __VERIFIER_assert_~cond); {6979#(< ~counter~0 50)} is VALID [2021-09-13 14:24:35,793 INFO L281 TraceCheckUtils]: 92: Hoare triple {6979#(< ~counter~0 50)} __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; {6979#(< ~counter~0 50)} is VALID [2021-09-13 14:24:35,794 INFO L281 TraceCheckUtils]: 91: Hoare triple {6979#(< ~counter~0 50)} assume !(0 == __VERIFIER_assert_~cond); {6979#(< ~counter~0 50)} is VALID [2021-09-13 14:24:35,794 INFO L281 TraceCheckUtils]: 90: Hoare triple {6979#(< ~counter~0 50)} __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; {6979#(< ~counter~0 50)} is VALID [2021-09-13 14:24:35,794 INFO L281 TraceCheckUtils]: 89: Hoare triple {6979#(< ~counter~0 50)} assume !(0 == __VERIFIER_assert_~cond); {6979#(< ~counter~0 50)} is VALID [2021-09-13 14:24:35,795 INFO L281 TraceCheckUtils]: 88: Hoare triple {6979#(< ~counter~0 50)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 1 == main_~p~0 * main_~s~0 - main_~r~0 * main_~q~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {6979#(< ~counter~0 50)} is VALID [2021-09-13 14:24:35,795 INFO L281 TraceCheckUtils]: 87: Hoare triple {7007#(< ~counter~0 49)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {6979#(< ~counter~0 50)} is VALID [2021-09-13 14:24:35,795 INFO L281 TraceCheckUtils]: 86: Hoare triple {7007#(< ~counter~0 49)} assume main_~a~0 > main_~b~0;main_~a~0 := main_~a~0 - main_~b~0;main_~p~0 := main_~p~0 - main_~q~0;main_~r~0 := main_~r~0 - main_~s~0; {7007#(< ~counter~0 49)} is VALID [2021-09-13 14:24:35,796 INFO L281 TraceCheckUtils]: 85: Hoare triple {7007#(< ~counter~0 49)} assume !!(main_~a~0 != main_~b~0); {7007#(< ~counter~0 49)} is VALID [2021-09-13 14:24:35,796 INFO L281 TraceCheckUtils]: 84: Hoare triple {7007#(< ~counter~0 49)} assume !(0 == __VERIFIER_assert_~cond); {7007#(< ~counter~0 49)} is VALID [2021-09-13 14:24:35,796 INFO L281 TraceCheckUtils]: 83: Hoare triple {7007#(< ~counter~0 49)} __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; {7007#(< ~counter~0 49)} is VALID [2021-09-13 14:24:35,796 INFO L281 TraceCheckUtils]: 82: Hoare triple {7007#(< ~counter~0 49)} assume !(0 == __VERIFIER_assert_~cond); {7007#(< ~counter~0 49)} is VALID [2021-09-13 14:24:35,797 INFO L281 TraceCheckUtils]: 81: Hoare triple {7007#(< ~counter~0 49)} __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; {7007#(< ~counter~0 49)} is VALID [2021-09-13 14:24:35,797 INFO L281 TraceCheckUtils]: 80: Hoare triple {7007#(< ~counter~0 49)} assume !(0 == __VERIFIER_assert_~cond); {7007#(< ~counter~0 49)} is VALID [2021-09-13 14:24:35,797 INFO L281 TraceCheckUtils]: 79: Hoare triple {7007#(< ~counter~0 49)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 1 == main_~p~0 * main_~s~0 - main_~r~0 * main_~q~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {7007#(< ~counter~0 49)} is VALID [2021-09-13 14:24:35,798 INFO L281 TraceCheckUtils]: 78: Hoare triple {7035#(< ~counter~0 48)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {7007#(< ~counter~0 49)} is VALID [2021-09-13 14:24:35,798 INFO L281 TraceCheckUtils]: 77: Hoare triple {7035#(< ~counter~0 48)} assume main_~a~0 > main_~b~0;main_~a~0 := main_~a~0 - main_~b~0;main_~p~0 := main_~p~0 - main_~q~0;main_~r~0 := main_~r~0 - main_~s~0; {7035#(< ~counter~0 48)} is VALID [2021-09-13 14:24:35,798 INFO L281 TraceCheckUtils]: 76: Hoare triple {7035#(< ~counter~0 48)} assume !!(main_~a~0 != main_~b~0); {7035#(< ~counter~0 48)} is VALID [2021-09-13 14:24:35,798 INFO L281 TraceCheckUtils]: 75: Hoare triple {7035#(< ~counter~0 48)} assume !(0 == __VERIFIER_assert_~cond); {7035#(< ~counter~0 48)} is VALID [2021-09-13 14:24:35,799 INFO L281 TraceCheckUtils]: 74: Hoare triple {7035#(< ~counter~0 48)} __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; {7035#(< ~counter~0 48)} is VALID [2021-09-13 14:24:35,799 INFO L281 TraceCheckUtils]: 73: Hoare triple {7035#(< ~counter~0 48)} assume !(0 == __VERIFIER_assert_~cond); {7035#(< ~counter~0 48)} is VALID [2021-09-13 14:24:35,799 INFO L281 TraceCheckUtils]: 72: Hoare triple {7035#(< ~counter~0 48)} __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; {7035#(< ~counter~0 48)} is VALID [2021-09-13 14:24:35,800 INFO L281 TraceCheckUtils]: 71: Hoare triple {7035#(< ~counter~0 48)} assume !(0 == __VERIFIER_assert_~cond); {7035#(< ~counter~0 48)} is VALID [2021-09-13 14:24:35,800 INFO L281 TraceCheckUtils]: 70: Hoare triple {7035#(< ~counter~0 48)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 1 == main_~p~0 * main_~s~0 - main_~r~0 * main_~q~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {7035#(< ~counter~0 48)} is VALID [2021-09-13 14:24:35,800 INFO L281 TraceCheckUtils]: 69: Hoare triple {7063#(< ~counter~0 47)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {7035#(< ~counter~0 48)} is VALID [2021-09-13 14:24:35,801 INFO L281 TraceCheckUtils]: 68: Hoare triple {7063#(< ~counter~0 47)} assume main_~a~0 > main_~b~0;main_~a~0 := main_~a~0 - main_~b~0;main_~p~0 := main_~p~0 - main_~q~0;main_~r~0 := main_~r~0 - main_~s~0; {7063#(< ~counter~0 47)} is VALID [2021-09-13 14:24:35,801 INFO L281 TraceCheckUtils]: 67: Hoare triple {7063#(< ~counter~0 47)} assume !!(main_~a~0 != main_~b~0); {7063#(< ~counter~0 47)} is VALID [2021-09-13 14:24:35,801 INFO L281 TraceCheckUtils]: 66: Hoare triple {7063#(< ~counter~0 47)} assume !(0 == __VERIFIER_assert_~cond); {7063#(< ~counter~0 47)} is VALID [2021-09-13 14:24:35,801 INFO L281 TraceCheckUtils]: 65: Hoare triple {7063#(< ~counter~0 47)} __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; {7063#(< ~counter~0 47)} is VALID [2021-09-13 14:24:35,802 INFO L281 TraceCheckUtils]: 64: Hoare triple {7063#(< ~counter~0 47)} assume !(0 == __VERIFIER_assert_~cond); {7063#(< ~counter~0 47)} is VALID [2021-09-13 14:24:35,802 INFO L281 TraceCheckUtils]: 63: Hoare triple {7063#(< ~counter~0 47)} __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; {7063#(< ~counter~0 47)} is VALID [2021-09-13 14:24:35,802 INFO L281 TraceCheckUtils]: 62: Hoare triple {7063#(< ~counter~0 47)} assume !(0 == __VERIFIER_assert_~cond); {7063#(< ~counter~0 47)} is VALID [2021-09-13 14:24:35,802 INFO L281 TraceCheckUtils]: 61: Hoare triple {7063#(< ~counter~0 47)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 1 == main_~p~0 * main_~s~0 - main_~r~0 * main_~q~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {7063#(< ~counter~0 47)} is VALID [2021-09-13 14:24:35,803 INFO L281 TraceCheckUtils]: 60: Hoare triple {7091#(< ~counter~0 46)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {7063#(< ~counter~0 47)} is VALID [2021-09-13 14:24:35,803 INFO L281 TraceCheckUtils]: 59: Hoare triple {7091#(< ~counter~0 46)} assume main_~a~0 > main_~b~0;main_~a~0 := main_~a~0 - main_~b~0;main_~p~0 := main_~p~0 - main_~q~0;main_~r~0 := main_~r~0 - main_~s~0; {7091#(< ~counter~0 46)} is VALID [2021-09-13 14:24:35,803 INFO L281 TraceCheckUtils]: 58: Hoare triple {7091#(< ~counter~0 46)} assume !!(main_~a~0 != main_~b~0); {7091#(< ~counter~0 46)} is VALID [2021-09-13 14:24:35,804 INFO L281 TraceCheckUtils]: 57: Hoare triple {7091#(< ~counter~0 46)} assume !(0 == __VERIFIER_assert_~cond); {7091#(< ~counter~0 46)} is VALID [2021-09-13 14:24:35,804 INFO L281 TraceCheckUtils]: 56: Hoare triple {7091#(< ~counter~0 46)} __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; {7091#(< ~counter~0 46)} is VALID [2021-09-13 14:24:35,804 INFO L281 TraceCheckUtils]: 55: Hoare triple {7091#(< ~counter~0 46)} assume !(0 == __VERIFIER_assert_~cond); {7091#(< ~counter~0 46)} is VALID [2021-09-13 14:24:35,805 INFO L281 TraceCheckUtils]: 54: Hoare triple {7091#(< ~counter~0 46)} __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; {7091#(< ~counter~0 46)} is VALID [2021-09-13 14:24:35,805 INFO L281 TraceCheckUtils]: 53: Hoare triple {7091#(< ~counter~0 46)} assume !(0 == __VERIFIER_assert_~cond); {7091#(< ~counter~0 46)} is VALID [2021-09-13 14:24:35,805 INFO L281 TraceCheckUtils]: 52: Hoare triple {7091#(< ~counter~0 46)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 1 == main_~p~0 * main_~s~0 - main_~r~0 * main_~q~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {7091#(< ~counter~0 46)} is VALID [2021-09-13 14:24:35,806 INFO L281 TraceCheckUtils]: 51: Hoare triple {7119#(< ~counter~0 45)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {7091#(< ~counter~0 46)} is VALID [2021-09-13 14:24:35,806 INFO L281 TraceCheckUtils]: 50: Hoare triple {7119#(< ~counter~0 45)} assume main_~a~0 > main_~b~0;main_~a~0 := main_~a~0 - main_~b~0;main_~p~0 := main_~p~0 - main_~q~0;main_~r~0 := main_~r~0 - main_~s~0; {7119#(< ~counter~0 45)} is VALID [2021-09-13 14:24:35,806 INFO L281 TraceCheckUtils]: 49: Hoare triple {7119#(< ~counter~0 45)} assume !!(main_~a~0 != main_~b~0); {7119#(< ~counter~0 45)} is VALID [2021-09-13 14:24:35,806 INFO L281 TraceCheckUtils]: 48: Hoare triple {7119#(< ~counter~0 45)} assume !(0 == __VERIFIER_assert_~cond); {7119#(< ~counter~0 45)} is VALID [2021-09-13 14:24:35,807 INFO L281 TraceCheckUtils]: 47: Hoare triple {7119#(< ~counter~0 45)} __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; {7119#(< ~counter~0 45)} is VALID [2021-09-13 14:24:35,807 INFO L281 TraceCheckUtils]: 46: Hoare triple {7119#(< ~counter~0 45)} assume !(0 == __VERIFIER_assert_~cond); {7119#(< ~counter~0 45)} is VALID [2021-09-13 14:24:35,807 INFO L281 TraceCheckUtils]: 45: Hoare triple {7119#(< ~counter~0 45)} __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; {7119#(< ~counter~0 45)} is VALID [2021-09-13 14:24:35,807 INFO L281 TraceCheckUtils]: 44: Hoare triple {7119#(< ~counter~0 45)} assume !(0 == __VERIFIER_assert_~cond); {7119#(< ~counter~0 45)} is VALID [2021-09-13 14:24:35,808 INFO L281 TraceCheckUtils]: 43: Hoare triple {7119#(< ~counter~0 45)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 1 == main_~p~0 * main_~s~0 - main_~r~0 * main_~q~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {7119#(< ~counter~0 45)} is VALID [2021-09-13 14:24:35,808 INFO L281 TraceCheckUtils]: 42: Hoare triple {7147#(< ~counter~0 44)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {7119#(< ~counter~0 45)} is VALID [2021-09-13 14:24:35,808 INFO L281 TraceCheckUtils]: 41: Hoare triple {7147#(< ~counter~0 44)} assume main_~a~0 > main_~b~0;main_~a~0 := main_~a~0 - main_~b~0;main_~p~0 := main_~p~0 - main_~q~0;main_~r~0 := main_~r~0 - main_~s~0; {7147#(< ~counter~0 44)} is VALID [2021-09-13 14:24:35,809 INFO L281 TraceCheckUtils]: 40: Hoare triple {7147#(< ~counter~0 44)} assume !!(main_~a~0 != main_~b~0); {7147#(< ~counter~0 44)} is VALID [2021-09-13 14:24:35,809 INFO L281 TraceCheckUtils]: 39: Hoare triple {7147#(< ~counter~0 44)} assume !(0 == __VERIFIER_assert_~cond); {7147#(< ~counter~0 44)} is VALID [2021-09-13 14:24:35,809 INFO L281 TraceCheckUtils]: 38: Hoare triple {7147#(< ~counter~0 44)} __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; {7147#(< ~counter~0 44)} is VALID [2021-09-13 14:24:35,810 INFO L281 TraceCheckUtils]: 37: Hoare triple {7147#(< ~counter~0 44)} assume !(0 == __VERIFIER_assert_~cond); {7147#(< ~counter~0 44)} is VALID [2021-09-13 14:24:35,810 INFO L281 TraceCheckUtils]: 36: Hoare triple {7147#(< ~counter~0 44)} __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; {7147#(< ~counter~0 44)} is VALID [2021-09-13 14:24:35,810 INFO L281 TraceCheckUtils]: 35: Hoare triple {7147#(< ~counter~0 44)} assume !(0 == __VERIFIER_assert_~cond); {7147#(< ~counter~0 44)} is VALID [2021-09-13 14:24:35,810 INFO L281 TraceCheckUtils]: 34: Hoare triple {7147#(< ~counter~0 44)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 1 == main_~p~0 * main_~s~0 - main_~r~0 * main_~q~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {7147#(< ~counter~0 44)} is VALID [2021-09-13 14:24:35,811 INFO L281 TraceCheckUtils]: 33: Hoare triple {7175#(< ~counter~0 43)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {7147#(< ~counter~0 44)} is VALID [2021-09-13 14:24:35,811 INFO L281 TraceCheckUtils]: 32: Hoare triple {7175#(< ~counter~0 43)} assume main_~a~0 > main_~b~0;main_~a~0 := main_~a~0 - main_~b~0;main_~p~0 := main_~p~0 - main_~q~0;main_~r~0 := main_~r~0 - main_~s~0; {7175#(< ~counter~0 43)} is VALID [2021-09-13 14:24:35,811 INFO L281 TraceCheckUtils]: 31: Hoare triple {7175#(< ~counter~0 43)} assume !!(main_~a~0 != main_~b~0); {7175#(< ~counter~0 43)} is VALID [2021-09-13 14:24:35,812 INFO L281 TraceCheckUtils]: 30: Hoare triple {7175#(< ~counter~0 43)} assume !(0 == __VERIFIER_assert_~cond); {7175#(< ~counter~0 43)} is VALID [2021-09-13 14:24:35,812 INFO L281 TraceCheckUtils]: 29: Hoare triple {7175#(< ~counter~0 43)} __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; {7175#(< ~counter~0 43)} is VALID [2021-09-13 14:24:35,812 INFO L281 TraceCheckUtils]: 28: Hoare triple {7175#(< ~counter~0 43)} assume !(0 == __VERIFIER_assert_~cond); {7175#(< ~counter~0 43)} is VALID [2021-09-13 14:24:35,812 INFO L281 TraceCheckUtils]: 27: Hoare triple {7175#(< ~counter~0 43)} __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; {7175#(< ~counter~0 43)} is VALID [2021-09-13 14:24:35,813 INFO L281 TraceCheckUtils]: 26: Hoare triple {7175#(< ~counter~0 43)} assume !(0 == __VERIFIER_assert_~cond); {7175#(< ~counter~0 43)} is VALID [2021-09-13 14:24:35,813 INFO L281 TraceCheckUtils]: 25: Hoare triple {7175#(< ~counter~0 43)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 1 == main_~p~0 * main_~s~0 - main_~r~0 * main_~q~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {7175#(< ~counter~0 43)} is VALID [2021-09-13 14:24:35,813 INFO L281 TraceCheckUtils]: 24: Hoare triple {7203#(< ~counter~0 42)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {7175#(< ~counter~0 43)} is VALID [2021-09-13 14:24:35,814 INFO L281 TraceCheckUtils]: 23: Hoare triple {7203#(< ~counter~0 42)} assume main_~a~0 > main_~b~0;main_~a~0 := main_~a~0 - main_~b~0;main_~p~0 := main_~p~0 - main_~q~0;main_~r~0 := main_~r~0 - main_~s~0; {7203#(< ~counter~0 42)} is VALID [2021-09-13 14:24:35,814 INFO L281 TraceCheckUtils]: 22: Hoare triple {7203#(< ~counter~0 42)} assume !!(main_~a~0 != main_~b~0); {7203#(< ~counter~0 42)} is VALID [2021-09-13 14:24:35,814 INFO L281 TraceCheckUtils]: 21: Hoare triple {7203#(< ~counter~0 42)} assume !(0 == __VERIFIER_assert_~cond); {7203#(< ~counter~0 42)} is VALID [2021-09-13 14:24:35,814 INFO L281 TraceCheckUtils]: 20: Hoare triple {7203#(< ~counter~0 42)} __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; {7203#(< ~counter~0 42)} is VALID [2021-09-13 14:24:35,815 INFO L281 TraceCheckUtils]: 19: Hoare triple {7203#(< ~counter~0 42)} assume !(0 == __VERIFIER_assert_~cond); {7203#(< ~counter~0 42)} is VALID [2021-09-13 14:24:35,815 INFO L281 TraceCheckUtils]: 18: Hoare triple {7203#(< ~counter~0 42)} __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; {7203#(< ~counter~0 42)} is VALID [2021-09-13 14:24:35,815 INFO L281 TraceCheckUtils]: 17: Hoare triple {7203#(< ~counter~0 42)} assume !(0 == __VERIFIER_assert_~cond); {7203#(< ~counter~0 42)} is VALID [2021-09-13 14:24:35,816 INFO L281 TraceCheckUtils]: 16: Hoare triple {7203#(< ~counter~0 42)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 1 == main_~p~0 * main_~s~0 - main_~r~0 * main_~q~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {7203#(< ~counter~0 42)} is VALID [2021-09-13 14:24:35,816 INFO L281 TraceCheckUtils]: 15: Hoare triple {7231#(< ~counter~0 41)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {7203#(< ~counter~0 42)} is VALID [2021-09-13 14:24:35,816 INFO L281 TraceCheckUtils]: 14: Hoare triple {7231#(< ~counter~0 41)} assume main_~a~0 > main_~b~0;main_~a~0 := main_~a~0 - main_~b~0;main_~p~0 := main_~p~0 - main_~q~0;main_~r~0 := main_~r~0 - main_~s~0; {7231#(< ~counter~0 41)} is VALID [2021-09-13 14:24:35,817 INFO L281 TraceCheckUtils]: 13: Hoare triple {7231#(< ~counter~0 41)} assume !!(main_~a~0 != main_~b~0); {7231#(< ~counter~0 41)} is VALID [2021-09-13 14:24:35,817 INFO L281 TraceCheckUtils]: 12: Hoare triple {7231#(< ~counter~0 41)} assume !(0 == __VERIFIER_assert_~cond); {7231#(< ~counter~0 41)} is VALID [2021-09-13 14:24:35,817 INFO L281 TraceCheckUtils]: 11: Hoare triple {7231#(< ~counter~0 41)} __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; {7231#(< ~counter~0 41)} is VALID [2021-09-13 14:24:35,817 INFO L281 TraceCheckUtils]: 10: Hoare triple {7231#(< ~counter~0 41)} assume !(0 == __VERIFIER_assert_~cond); {7231#(< ~counter~0 41)} is VALID [2021-09-13 14:24:35,818 INFO L281 TraceCheckUtils]: 9: Hoare triple {7231#(< ~counter~0 41)} __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; {7231#(< ~counter~0 41)} is VALID [2021-09-13 14:24:35,818 INFO L281 TraceCheckUtils]: 8: Hoare triple {7231#(< ~counter~0 41)} assume !(0 == __VERIFIER_assert_~cond); {7231#(< ~counter~0 41)} is VALID [2021-09-13 14:24:35,818 INFO L281 TraceCheckUtils]: 7: Hoare triple {7231#(< ~counter~0 41)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 1 == main_~p~0 * main_~s~0 - main_~r~0 * main_~q~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {7231#(< ~counter~0 41)} is VALID [2021-09-13 14:24:35,819 INFO L281 TraceCheckUtils]: 6: Hoare triple {7259#(< ~counter~0 40)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {7231#(< ~counter~0 41)} is VALID [2021-09-13 14:24:35,819 INFO L281 TraceCheckUtils]: 5: Hoare triple {7259#(< ~counter~0 40)} 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; {7259#(< ~counter~0 40)} is VALID [2021-09-13 14:24:35,819 INFO L281 TraceCheckUtils]: 4: Hoare triple {7259#(< ~counter~0 40)} assume !(0 == assume_abort_if_not_~cond); {7259#(< ~counter~0 40)} is VALID [2021-09-13 14:24:35,819 INFO L281 TraceCheckUtils]: 3: Hoare triple {7259#(< ~counter~0 40)} 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; {7259#(< ~counter~0 40)} is VALID [2021-09-13 14:24:35,820 INFO L281 TraceCheckUtils]: 2: Hoare triple {7259#(< ~counter~0 40)} assume !(0 == assume_abort_if_not_~cond); {7259#(< ~counter~0 40)} is VALID [2021-09-13 14:24:35,820 INFO L281 TraceCheckUtils]: 1: Hoare triple {7259#(< ~counter~0 40)} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~post9, main_~a~0, main_~b~0, main_~p~0, main_~q~0, main_~r~0, main_~s~0, main_~x~0, 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_~x~0;havoc main_~y~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; {7259#(< ~counter~0 40)} is VALID [2021-09-13 14:24:35,821 INFO L281 TraceCheckUtils]: 0: Hoare triple {6649#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(10);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~counter~0 := 0; {7259#(< ~counter~0 40)} is VALID [2021-09-13 14:24:35,821 INFO L134 CoverageAnalysis]: Checked inductivity of 425 backedges. 0 proven. 425 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:24:35,821 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:24:35,821 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487711560] [2021-09-13 14:24:35,821 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-09-13 14:24:35,822 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1254406592] [2021-09-13 14:24:35,822 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1254406592] provided 0 perfect and 2 imperfect interpolant sequences [2021-09-13 14:24:35,822 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-09-13 14:24:35,822 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 25 [2021-09-13 14:24:35,822 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558507973] [2021-09-13 14:24:35,823 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 7.653846153846154) internal successors, (199), 25 states have internal predecessors, (199), 0 states have call successors, (0), 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 101 [2021-09-13 14:24:35,823 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:24:35,823 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 26 states, 26 states have (on average 7.653846153846154) internal successors, (199), 25 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call 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:35,947 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 199 edges. 199 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:24:35,948 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2021-09-13 14:24:35,948 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:24:35,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-09-13 14:24:35,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=369, Unknown=0, NotChecked=0, Total=650 [2021-09-13 14:24:35,948 INFO L87 Difference]: Start difference. First operand 106 states and 116 transitions. Second operand has 26 states, 26 states have (on average 7.653846153846154) internal successors, (199), 25 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call 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:37,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:24:37,146 INFO L93 Difference]: Finished difference Result 222 states and 255 transitions. [2021-09-13 14:24:37,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2021-09-13 14:24:37,146 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 7.653846153846154) internal successors, (199), 25 states have internal predecessors, (199), 0 states have call successors, (0), 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 101 [2021-09-13 14:24:37,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:24:37,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 7.653846153846154) internal successors, (199), 25 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call 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:37,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 255 transitions. [2021-09-13 14:24:37,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 7.653846153846154) internal successors, (199), 25 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call 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:37,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 255 transitions. [2021-09-13 14:24:37,150 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 46 states and 255 transitions. [2021-09-13 14:24:37,283 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 255 edges. 255 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:24:37,288 INFO L225 Difference]: With dead ends: 222 [2021-09-13 14:24:37,288 INFO L226 Difference]: Without dead ends: 214 [2021-09-13 14:24:37,289 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 442.30ms TimeCoverageRelationStatistics Valid=796, Invalid=1366, Unknown=0, NotChecked=0, Total=2162 [2021-09-13 14:24:37,293 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 159 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 206.68ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.91ms SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 208.29ms IncrementalHoareTripleChecker+Time [2021-09-13 14:24:37,293 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [159 Valid, 0 Invalid, 333 Unknown, 0 Unchecked, 1.91ms Time], IncrementalHoareTripleChecker [25 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 208.29ms Time] [2021-09-13 14:24:37,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2021-09-13 14:24:37,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 214. [2021-09-13 14:24:37,756 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:24:37,756 INFO L82 GeneralOperation]: Start isEquivalent. First operand 214 states. Second operand has 214 states, 212 states have (on average 1.1132075471698113) internal successors, (236), 213 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:24:37,756 INFO L74 IsIncluded]: Start isIncluded. First operand 214 states. Second operand has 214 states, 212 states have (on average 1.1132075471698113) internal successors, (236), 213 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:24:37,757 INFO L87 Difference]: Start difference. First operand 214 states. Second operand has 214 states, 212 states have (on average 1.1132075471698113) internal successors, (236), 213 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:24:37,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:24:37,777 INFO L93 Difference]: Finished difference Result 214 states and 236 transitions. [2021-09-13 14:24:37,777 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 236 transitions. [2021-09-13 14:24:37,778 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:24:37,778 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:24:37,778 INFO L74 IsIncluded]: Start isIncluded. First operand has 214 states, 212 states have (on average 1.1132075471698113) internal successors, (236), 213 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 214 states. [2021-09-13 14:24:37,778 INFO L87 Difference]: Start difference. First operand has 214 states, 212 states have (on average 1.1132075471698113) internal successors, (236), 213 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 214 states. [2021-09-13 14:24:37,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:24:37,796 INFO L93 Difference]: Finished difference Result 214 states and 236 transitions. [2021-09-13 14:24:37,797 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 236 transitions. [2021-09-13 14:24:37,797 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:24:37,797 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:24:37,797 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:24:37,797 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:24:37,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 212 states have (on average 1.1132075471698113) internal successors, (236), 213 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:24:37,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 236 transitions. [2021-09-13 14:24:37,801 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 236 transitions. Word has length 101 [2021-09-13 14:24:37,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:24:37,801 INFO L470 AbstractCegarLoop]: Abstraction has 214 states and 236 transitions. [2021-09-13 14:24:37,801 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 7.653846153846154) internal successors, (199), 25 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call 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:37,801 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 236 transitions. [2021-09-13 14:24:37,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2021-09-13 14:24:37,804 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:24:37,804 INFO L513 BasicCegarLoop]: trace histogram [23, 22, 22, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 14:24:37,824 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:24:38,005 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,SelfDestructingSolverStorable12 [2021-09-13 14:24:38,005 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-09-13 14:24:38,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:24:38,006 INFO L82 PathProgramCache]: Analyzing trace with hash -555217599, now seen corresponding path program 4 times [2021-09-13 14:24:38,006 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:24:38,006 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040740738] [2021-09-13 14:24:38,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:24:38,006 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:24:38,016 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-09-13 14:24:38,017 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [912837176] [2021-09-13 14:24:38,017 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-09-13 14:24:38,017 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:24:38,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:24:38,021 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:24:38,023 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:24:38,166 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-09-13 14:24:38,166 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-09-13 14:24:38,170 INFO L263 TraceCheckSpWp]: Trace formula consists of 691 conjuncts, 47 conjunts are in the unsatisfiable core [2021-09-13 14:24:38,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:24:38,216 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:24:39,876 INFO L281 TraceCheckUtils]: 0: Hoare triple {8364#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(10);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~counter~0 := 0; {8369#(<= ~counter~0 0)} is VALID [2021-09-13 14:24:39,877 INFO L281 TraceCheckUtils]: 1: Hoare triple {8369#(<= ~counter~0 0)} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~post9, main_~a~0, main_~b~0, main_~p~0, main_~q~0, main_~r~0, main_~s~0, main_~x~0, 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_~x~0;havoc main_~y~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; {8369#(<= ~counter~0 0)} is VALID [2021-09-13 14:24:39,877 INFO L281 TraceCheckUtils]: 2: Hoare triple {8369#(<= ~counter~0 0)} assume !(0 == assume_abort_if_not_~cond); {8369#(<= ~counter~0 0)} is VALID [2021-09-13 14:24:39,878 INFO L281 TraceCheckUtils]: 3: Hoare triple {8369#(<= ~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; {8369#(<= ~counter~0 0)} is VALID [2021-09-13 14:24:39,878 INFO L281 TraceCheckUtils]: 4: Hoare triple {8369#(<= ~counter~0 0)} assume !(0 == assume_abort_if_not_~cond); {8369#(<= ~counter~0 0)} is VALID [2021-09-13 14:24:39,878 INFO L281 TraceCheckUtils]: 5: Hoare triple {8369#(<= ~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; {8369#(<= ~counter~0 0)} is VALID [2021-09-13 14:24:39,879 INFO L281 TraceCheckUtils]: 6: Hoare triple {8369#(<= ~counter~0 0)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {8388#(<= ~counter~0 1)} is VALID [2021-09-13 14:24:39,879 INFO L281 TraceCheckUtils]: 7: Hoare triple {8388#(<= ~counter~0 1)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 1 == main_~p~0 * main_~s~0 - main_~r~0 * main_~q~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {8388#(<= ~counter~0 1)} is VALID [2021-09-13 14:24:39,879 INFO L281 TraceCheckUtils]: 8: Hoare triple {8388#(<= ~counter~0 1)} assume !(0 == __VERIFIER_assert_~cond); {8388#(<= ~counter~0 1)} is VALID [2021-09-13 14:24:39,880 INFO L281 TraceCheckUtils]: 9: Hoare triple {8388#(<= ~counter~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; {8388#(<= ~counter~0 1)} is VALID [2021-09-13 14:24:39,880 INFO L281 TraceCheckUtils]: 10: Hoare triple {8388#(<= ~counter~0 1)} assume !(0 == __VERIFIER_assert_~cond); {8388#(<= ~counter~0 1)} is VALID [2021-09-13 14:24:39,880 INFO L281 TraceCheckUtils]: 11: Hoare triple {8388#(<= ~counter~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; {8388#(<= ~counter~0 1)} is VALID [2021-09-13 14:24:39,881 INFO L281 TraceCheckUtils]: 12: Hoare triple {8388#(<= ~counter~0 1)} assume !(0 == __VERIFIER_assert_~cond); {8388#(<= ~counter~0 1)} is VALID [2021-09-13 14:24:39,881 INFO L281 TraceCheckUtils]: 13: Hoare triple {8388#(<= ~counter~0 1)} assume !!(main_~a~0 != main_~b~0); {8388#(<= ~counter~0 1)} is VALID [2021-09-13 14:24:39,881 INFO L281 TraceCheckUtils]: 14: Hoare triple {8388#(<= ~counter~0 1)} assume main_~a~0 > main_~b~0;main_~a~0 := main_~a~0 - main_~b~0;main_~p~0 := main_~p~0 - main_~q~0;main_~r~0 := main_~r~0 - main_~s~0; {8388#(<= ~counter~0 1)} is VALID [2021-09-13 14:24:39,882 INFO L281 TraceCheckUtils]: 15: Hoare triple {8388#(<= ~counter~0 1)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {8416#(<= ~counter~0 2)} is VALID [2021-09-13 14:24:39,882 INFO L281 TraceCheckUtils]: 16: Hoare triple {8416#(<= ~counter~0 2)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 1 == main_~p~0 * main_~s~0 - main_~r~0 * main_~q~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {8416#(<= ~counter~0 2)} is VALID [2021-09-13 14:24:39,883 INFO L281 TraceCheckUtils]: 17: Hoare triple {8416#(<= ~counter~0 2)} assume !(0 == __VERIFIER_assert_~cond); {8416#(<= ~counter~0 2)} is VALID [2021-09-13 14:24:39,883 INFO L281 TraceCheckUtils]: 18: Hoare triple {8416#(<= ~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; {8416#(<= ~counter~0 2)} is VALID [2021-09-13 14:24:39,883 INFO L281 TraceCheckUtils]: 19: Hoare triple {8416#(<= ~counter~0 2)} assume !(0 == __VERIFIER_assert_~cond); {8416#(<= ~counter~0 2)} is VALID [2021-09-13 14:24:39,883 INFO L281 TraceCheckUtils]: 20: Hoare triple {8416#(<= ~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; {8416#(<= ~counter~0 2)} is VALID [2021-09-13 14:24:39,884 INFO L281 TraceCheckUtils]: 21: Hoare triple {8416#(<= ~counter~0 2)} assume !(0 == __VERIFIER_assert_~cond); {8416#(<= ~counter~0 2)} is VALID [2021-09-13 14:24:39,884 INFO L281 TraceCheckUtils]: 22: Hoare triple {8416#(<= ~counter~0 2)} assume !!(main_~a~0 != main_~b~0); {8416#(<= ~counter~0 2)} is VALID [2021-09-13 14:24:39,884 INFO L281 TraceCheckUtils]: 23: Hoare triple {8416#(<= ~counter~0 2)} assume main_~a~0 > main_~b~0;main_~a~0 := main_~a~0 - main_~b~0;main_~p~0 := main_~p~0 - main_~q~0;main_~r~0 := main_~r~0 - main_~s~0; {8416#(<= ~counter~0 2)} is VALID [2021-09-13 14:24:39,885 INFO L281 TraceCheckUtils]: 24: Hoare triple {8416#(<= ~counter~0 2)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {8444#(<= ~counter~0 3)} is VALID [2021-09-13 14:24:39,885 INFO L281 TraceCheckUtils]: 25: Hoare triple {8444#(<= ~counter~0 3)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 1 == main_~p~0 * main_~s~0 - main_~r~0 * main_~q~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {8444#(<= ~counter~0 3)} is VALID [2021-09-13 14:24:39,885 INFO L281 TraceCheckUtils]: 26: Hoare triple {8444#(<= ~counter~0 3)} assume !(0 == __VERIFIER_assert_~cond); {8444#(<= ~counter~0 3)} is VALID [2021-09-13 14:24:39,886 INFO L281 TraceCheckUtils]: 27: Hoare triple {8444#(<= ~counter~0 3)} __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; {8444#(<= ~counter~0 3)} is VALID [2021-09-13 14:24:39,886 INFO L281 TraceCheckUtils]: 28: Hoare triple {8444#(<= ~counter~0 3)} assume !(0 == __VERIFIER_assert_~cond); {8444#(<= ~counter~0 3)} is VALID [2021-09-13 14:24:39,886 INFO L281 TraceCheckUtils]: 29: Hoare triple {8444#(<= ~counter~0 3)} __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; {8444#(<= ~counter~0 3)} is VALID [2021-09-13 14:24:39,887 INFO L281 TraceCheckUtils]: 30: Hoare triple {8444#(<= ~counter~0 3)} assume !(0 == __VERIFIER_assert_~cond); {8444#(<= ~counter~0 3)} is VALID [2021-09-13 14:24:39,887 INFO L281 TraceCheckUtils]: 31: Hoare triple {8444#(<= ~counter~0 3)} assume !!(main_~a~0 != main_~b~0); {8444#(<= ~counter~0 3)} is VALID [2021-09-13 14:24:39,887 INFO L281 TraceCheckUtils]: 32: Hoare triple {8444#(<= ~counter~0 3)} assume main_~a~0 > main_~b~0;main_~a~0 := main_~a~0 - main_~b~0;main_~p~0 := main_~p~0 - main_~q~0;main_~r~0 := main_~r~0 - main_~s~0; {8444#(<= ~counter~0 3)} is VALID [2021-09-13 14:24:39,888 INFO L281 TraceCheckUtils]: 33: Hoare triple {8444#(<= ~counter~0 3)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {8472#(<= ~counter~0 4)} is VALID [2021-09-13 14:24:39,888 INFO L281 TraceCheckUtils]: 34: Hoare triple {8472#(<= ~counter~0 4)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 1 == main_~p~0 * main_~s~0 - main_~r~0 * main_~q~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {8472#(<= ~counter~0 4)} is VALID [2021-09-13 14:24:39,889 INFO L281 TraceCheckUtils]: 35: Hoare triple {8472#(<= ~counter~0 4)} assume !(0 == __VERIFIER_assert_~cond); {8472#(<= ~counter~0 4)} is VALID [2021-09-13 14:24:39,889 INFO L281 TraceCheckUtils]: 36: Hoare triple {8472#(<= ~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; {8472#(<= ~counter~0 4)} is VALID [2021-09-13 14:24:39,889 INFO L281 TraceCheckUtils]: 37: Hoare triple {8472#(<= ~counter~0 4)} assume !(0 == __VERIFIER_assert_~cond); {8472#(<= ~counter~0 4)} is VALID [2021-09-13 14:24:39,889 INFO L281 TraceCheckUtils]: 38: Hoare triple {8472#(<= ~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; {8472#(<= ~counter~0 4)} is VALID [2021-09-13 14:24:39,890 INFO L281 TraceCheckUtils]: 39: Hoare triple {8472#(<= ~counter~0 4)} assume !(0 == __VERIFIER_assert_~cond); {8472#(<= ~counter~0 4)} is VALID [2021-09-13 14:24:39,890 INFO L281 TraceCheckUtils]: 40: Hoare triple {8472#(<= ~counter~0 4)} assume !!(main_~a~0 != main_~b~0); {8472#(<= ~counter~0 4)} is VALID [2021-09-13 14:24:39,890 INFO L281 TraceCheckUtils]: 41: Hoare triple {8472#(<= ~counter~0 4)} assume main_~a~0 > main_~b~0;main_~a~0 := main_~a~0 - main_~b~0;main_~p~0 := main_~p~0 - main_~q~0;main_~r~0 := main_~r~0 - main_~s~0; {8472#(<= ~counter~0 4)} is VALID [2021-09-13 14:24:39,891 INFO L281 TraceCheckUtils]: 42: Hoare triple {8472#(<= ~counter~0 4)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {8500#(<= ~counter~0 5)} is VALID [2021-09-13 14:24:39,891 INFO L281 TraceCheckUtils]: 43: Hoare triple {8500#(<= ~counter~0 5)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 1 == main_~p~0 * main_~s~0 - main_~r~0 * main_~q~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {8500#(<= ~counter~0 5)} is VALID [2021-09-13 14:24:39,892 INFO L281 TraceCheckUtils]: 44: Hoare triple {8500#(<= ~counter~0 5)} assume !(0 == __VERIFIER_assert_~cond); {8500#(<= ~counter~0 5)} is VALID [2021-09-13 14:24:39,892 INFO L281 TraceCheckUtils]: 45: Hoare triple {8500#(<= ~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; {8500#(<= ~counter~0 5)} is VALID [2021-09-13 14:24:39,892 INFO L281 TraceCheckUtils]: 46: Hoare triple {8500#(<= ~counter~0 5)} assume !(0 == __VERIFIER_assert_~cond); {8500#(<= ~counter~0 5)} is VALID [2021-09-13 14:24:39,892 INFO L281 TraceCheckUtils]: 47: Hoare triple {8500#(<= ~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; {8500#(<= ~counter~0 5)} is VALID [2021-09-13 14:24:39,893 INFO L281 TraceCheckUtils]: 48: Hoare triple {8500#(<= ~counter~0 5)} assume !(0 == __VERIFIER_assert_~cond); {8500#(<= ~counter~0 5)} is VALID [2021-09-13 14:24:39,893 INFO L281 TraceCheckUtils]: 49: Hoare triple {8500#(<= ~counter~0 5)} assume !!(main_~a~0 != main_~b~0); {8500#(<= ~counter~0 5)} is VALID [2021-09-13 14:24:39,893 INFO L281 TraceCheckUtils]: 50: Hoare triple {8500#(<= ~counter~0 5)} assume main_~a~0 > main_~b~0;main_~a~0 := main_~a~0 - main_~b~0;main_~p~0 := main_~p~0 - main_~q~0;main_~r~0 := main_~r~0 - main_~s~0; {8500#(<= ~counter~0 5)} is VALID [2021-09-13 14:24:39,894 INFO L281 TraceCheckUtils]: 51: Hoare triple {8500#(<= ~counter~0 5)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {8528#(<= ~counter~0 6)} is VALID [2021-09-13 14:24:39,894 INFO L281 TraceCheckUtils]: 52: Hoare triple {8528#(<= ~counter~0 6)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 1 == main_~p~0 * main_~s~0 - main_~r~0 * main_~q~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {8528#(<= ~counter~0 6)} is VALID [2021-09-13 14:24:39,894 INFO L281 TraceCheckUtils]: 53: Hoare triple {8528#(<= ~counter~0 6)} assume !(0 == __VERIFIER_assert_~cond); {8528#(<= ~counter~0 6)} is VALID [2021-09-13 14:24:39,895 INFO L281 TraceCheckUtils]: 54: Hoare triple {8528#(<= ~counter~0 6)} __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; {8528#(<= ~counter~0 6)} is VALID [2021-09-13 14:24:39,895 INFO L281 TraceCheckUtils]: 55: Hoare triple {8528#(<= ~counter~0 6)} assume !(0 == __VERIFIER_assert_~cond); {8528#(<= ~counter~0 6)} is VALID [2021-09-13 14:24:39,895 INFO L281 TraceCheckUtils]: 56: Hoare triple {8528#(<= ~counter~0 6)} __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; {8528#(<= ~counter~0 6)} is VALID [2021-09-13 14:24:39,895 INFO L281 TraceCheckUtils]: 57: Hoare triple {8528#(<= ~counter~0 6)} assume !(0 == __VERIFIER_assert_~cond); {8528#(<= ~counter~0 6)} is VALID [2021-09-13 14:24:39,896 INFO L281 TraceCheckUtils]: 58: Hoare triple {8528#(<= ~counter~0 6)} assume !!(main_~a~0 != main_~b~0); {8528#(<= ~counter~0 6)} is VALID [2021-09-13 14:24:39,896 INFO L281 TraceCheckUtils]: 59: Hoare triple {8528#(<= ~counter~0 6)} assume main_~a~0 > main_~b~0;main_~a~0 := main_~a~0 - main_~b~0;main_~p~0 := main_~p~0 - main_~q~0;main_~r~0 := main_~r~0 - main_~s~0; {8528#(<= ~counter~0 6)} is VALID [2021-09-13 14:24:39,896 INFO L281 TraceCheckUtils]: 60: Hoare triple {8528#(<= ~counter~0 6)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {8556#(<= ~counter~0 7)} is VALID [2021-09-13 14:24:39,897 INFO L281 TraceCheckUtils]: 61: Hoare triple {8556#(<= ~counter~0 7)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 1 == main_~p~0 * main_~s~0 - main_~r~0 * main_~q~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {8556#(<= ~counter~0 7)} is VALID [2021-09-13 14:24:39,897 INFO L281 TraceCheckUtils]: 62: Hoare triple {8556#(<= ~counter~0 7)} assume !(0 == __VERIFIER_assert_~cond); {8556#(<= ~counter~0 7)} is VALID [2021-09-13 14:24:39,897 INFO L281 TraceCheckUtils]: 63: Hoare triple {8556#(<= ~counter~0 7)} __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; {8556#(<= ~counter~0 7)} is VALID [2021-09-13 14:24:39,898 INFO L281 TraceCheckUtils]: 64: Hoare triple {8556#(<= ~counter~0 7)} assume !(0 == __VERIFIER_assert_~cond); {8556#(<= ~counter~0 7)} is VALID [2021-09-13 14:24:39,898 INFO L281 TraceCheckUtils]: 65: Hoare triple {8556#(<= ~counter~0 7)} __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; {8556#(<= ~counter~0 7)} is VALID [2021-09-13 14:24:39,898 INFO L281 TraceCheckUtils]: 66: Hoare triple {8556#(<= ~counter~0 7)} assume !(0 == __VERIFIER_assert_~cond); {8556#(<= ~counter~0 7)} is VALID [2021-09-13 14:24:39,898 INFO L281 TraceCheckUtils]: 67: Hoare triple {8556#(<= ~counter~0 7)} assume !!(main_~a~0 != main_~b~0); {8556#(<= ~counter~0 7)} is VALID [2021-09-13 14:24:39,899 INFO L281 TraceCheckUtils]: 68: Hoare triple {8556#(<= ~counter~0 7)} assume main_~a~0 > main_~b~0;main_~a~0 := main_~a~0 - main_~b~0;main_~p~0 := main_~p~0 - main_~q~0;main_~r~0 := main_~r~0 - main_~s~0; {8556#(<= ~counter~0 7)} is VALID [2021-09-13 14:24:39,899 INFO L281 TraceCheckUtils]: 69: Hoare triple {8556#(<= ~counter~0 7)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {8584#(<= ~counter~0 8)} is VALID [2021-09-13 14:24:39,900 INFO L281 TraceCheckUtils]: 70: Hoare triple {8584#(<= ~counter~0 8)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 1 == main_~p~0 * main_~s~0 - main_~r~0 * main_~q~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {8584#(<= ~counter~0 8)} is VALID [2021-09-13 14:24:39,900 INFO L281 TraceCheckUtils]: 71: Hoare triple {8584#(<= ~counter~0 8)} assume !(0 == __VERIFIER_assert_~cond); {8584#(<= ~counter~0 8)} is VALID [2021-09-13 14:24:39,900 INFO L281 TraceCheckUtils]: 72: Hoare triple {8584#(<= ~counter~0 8)} __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; {8584#(<= ~counter~0 8)} is VALID [2021-09-13 14:24:39,900 INFO L281 TraceCheckUtils]: 73: Hoare triple {8584#(<= ~counter~0 8)} assume !(0 == __VERIFIER_assert_~cond); {8584#(<= ~counter~0 8)} is VALID [2021-09-13 14:24:39,901 INFO L281 TraceCheckUtils]: 74: Hoare triple {8584#(<= ~counter~0 8)} __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; {8584#(<= ~counter~0 8)} is VALID [2021-09-13 14:24:39,901 INFO L281 TraceCheckUtils]: 75: Hoare triple {8584#(<= ~counter~0 8)} assume !(0 == __VERIFIER_assert_~cond); {8584#(<= ~counter~0 8)} is VALID [2021-09-13 14:24:39,901 INFO L281 TraceCheckUtils]: 76: Hoare triple {8584#(<= ~counter~0 8)} assume !!(main_~a~0 != main_~b~0); {8584#(<= ~counter~0 8)} is VALID [2021-09-13 14:24:39,902 INFO L281 TraceCheckUtils]: 77: Hoare triple {8584#(<= ~counter~0 8)} assume main_~a~0 > main_~b~0;main_~a~0 := main_~a~0 - main_~b~0;main_~p~0 := main_~p~0 - main_~q~0;main_~r~0 := main_~r~0 - main_~s~0; {8584#(<= ~counter~0 8)} is VALID [2021-09-13 14:24:39,902 INFO L281 TraceCheckUtils]: 78: Hoare triple {8584#(<= ~counter~0 8)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {8612#(<= ~counter~0 9)} is VALID [2021-09-13 14:24:39,902 INFO L281 TraceCheckUtils]: 79: Hoare triple {8612#(<= ~counter~0 9)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 1 == main_~p~0 * main_~s~0 - main_~r~0 * main_~q~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {8612#(<= ~counter~0 9)} is VALID [2021-09-13 14:24:39,903 INFO L281 TraceCheckUtils]: 80: Hoare triple {8612#(<= ~counter~0 9)} assume !(0 == __VERIFIER_assert_~cond); {8612#(<= ~counter~0 9)} is VALID [2021-09-13 14:24:39,903 INFO L281 TraceCheckUtils]: 81: Hoare triple {8612#(<= ~counter~0 9)} __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; {8612#(<= ~counter~0 9)} is VALID [2021-09-13 14:24:39,903 INFO L281 TraceCheckUtils]: 82: Hoare triple {8612#(<= ~counter~0 9)} assume !(0 == __VERIFIER_assert_~cond); {8612#(<= ~counter~0 9)} is VALID [2021-09-13 14:24:39,903 INFO L281 TraceCheckUtils]: 83: Hoare triple {8612#(<= ~counter~0 9)} __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; {8612#(<= ~counter~0 9)} is VALID [2021-09-13 14:24:39,904 INFO L281 TraceCheckUtils]: 84: Hoare triple {8612#(<= ~counter~0 9)} assume !(0 == __VERIFIER_assert_~cond); {8612#(<= ~counter~0 9)} is VALID [2021-09-13 14:24:39,904 INFO L281 TraceCheckUtils]: 85: Hoare triple {8612#(<= ~counter~0 9)} assume !!(main_~a~0 != main_~b~0); {8612#(<= ~counter~0 9)} is VALID [2021-09-13 14:24:39,904 INFO L281 TraceCheckUtils]: 86: Hoare triple {8612#(<= ~counter~0 9)} assume main_~a~0 > main_~b~0;main_~a~0 := main_~a~0 - main_~b~0;main_~p~0 := main_~p~0 - main_~q~0;main_~r~0 := main_~r~0 - main_~s~0; {8612#(<= ~counter~0 9)} is VALID [2021-09-13 14:24:39,905 INFO L281 TraceCheckUtils]: 87: Hoare triple {8612#(<= ~counter~0 9)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {8640#(<= ~counter~0 10)} is VALID [2021-09-13 14:24:39,905 INFO L281 TraceCheckUtils]: 88: Hoare triple {8640#(<= ~counter~0 10)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 1 == main_~p~0 * main_~s~0 - main_~r~0 * main_~q~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {8640#(<= ~counter~0 10)} is VALID [2021-09-13 14:24:39,905 INFO L281 TraceCheckUtils]: 89: Hoare triple {8640#(<= ~counter~0 10)} assume !(0 == __VERIFIER_assert_~cond); {8640#(<= ~counter~0 10)} is VALID [2021-09-13 14:24:39,906 INFO L281 TraceCheckUtils]: 90: Hoare triple {8640#(<= ~counter~0 10)} __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; {8640#(<= ~counter~0 10)} is VALID [2021-09-13 14:24:39,906 INFO L281 TraceCheckUtils]: 91: Hoare triple {8640#(<= ~counter~0 10)} assume !(0 == __VERIFIER_assert_~cond); {8640#(<= ~counter~0 10)} is VALID [2021-09-13 14:24:39,906 INFO L281 TraceCheckUtils]: 92: Hoare triple {8640#(<= ~counter~0 10)} __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; {8640#(<= ~counter~0 10)} is VALID [2021-09-13 14:24:39,906 INFO L281 TraceCheckUtils]: 93: Hoare triple {8640#(<= ~counter~0 10)} assume !(0 == __VERIFIER_assert_~cond); {8640#(<= ~counter~0 10)} is VALID [2021-09-13 14:24:39,907 INFO L281 TraceCheckUtils]: 94: Hoare triple {8640#(<= ~counter~0 10)} assume !!(main_~a~0 != main_~b~0); {8640#(<= ~counter~0 10)} is VALID [2021-09-13 14:24:39,907 INFO L281 TraceCheckUtils]: 95: Hoare triple {8640#(<= ~counter~0 10)} assume main_~a~0 > main_~b~0;main_~a~0 := main_~a~0 - main_~b~0;main_~p~0 := main_~p~0 - main_~q~0;main_~r~0 := main_~r~0 - main_~s~0; {8640#(<= ~counter~0 10)} is VALID [2021-09-13 14:24:39,907 INFO L281 TraceCheckUtils]: 96: Hoare triple {8640#(<= ~counter~0 10)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {8668#(<= ~counter~0 11)} is VALID [2021-09-13 14:24:39,908 INFO L281 TraceCheckUtils]: 97: Hoare triple {8668#(<= ~counter~0 11)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 1 == main_~p~0 * main_~s~0 - main_~r~0 * main_~q~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {8668#(<= ~counter~0 11)} is VALID [2021-09-13 14:24:39,908 INFO L281 TraceCheckUtils]: 98: Hoare triple {8668#(<= ~counter~0 11)} assume !(0 == __VERIFIER_assert_~cond); {8668#(<= ~counter~0 11)} is VALID [2021-09-13 14:24:39,908 INFO L281 TraceCheckUtils]: 99: Hoare triple {8668#(<= ~counter~0 11)} __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; {8668#(<= ~counter~0 11)} is VALID [2021-09-13 14:24:39,909 INFO L281 TraceCheckUtils]: 100: Hoare triple {8668#(<= ~counter~0 11)} assume !(0 == __VERIFIER_assert_~cond); {8668#(<= ~counter~0 11)} is VALID [2021-09-13 14:24:39,909 INFO L281 TraceCheckUtils]: 101: Hoare triple {8668#(<= ~counter~0 11)} __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; {8668#(<= ~counter~0 11)} is VALID [2021-09-13 14:24:39,909 INFO L281 TraceCheckUtils]: 102: Hoare triple {8668#(<= ~counter~0 11)} assume !(0 == __VERIFIER_assert_~cond); {8668#(<= ~counter~0 11)} is VALID [2021-09-13 14:24:39,909 INFO L281 TraceCheckUtils]: 103: Hoare triple {8668#(<= ~counter~0 11)} assume !!(main_~a~0 != main_~b~0); {8668#(<= ~counter~0 11)} is VALID [2021-09-13 14:24:39,910 INFO L281 TraceCheckUtils]: 104: Hoare triple {8668#(<= ~counter~0 11)} assume main_~a~0 > main_~b~0;main_~a~0 := main_~a~0 - main_~b~0;main_~p~0 := main_~p~0 - main_~q~0;main_~r~0 := main_~r~0 - main_~s~0; {8668#(<= ~counter~0 11)} is VALID [2021-09-13 14:24:39,910 INFO L281 TraceCheckUtils]: 105: Hoare triple {8668#(<= ~counter~0 11)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {8696#(<= ~counter~0 12)} is VALID [2021-09-13 14:24:39,911 INFO L281 TraceCheckUtils]: 106: Hoare triple {8696#(<= ~counter~0 12)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 1 == main_~p~0 * main_~s~0 - main_~r~0 * main_~q~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {8696#(<= ~counter~0 12)} is VALID [2021-09-13 14:24:39,911 INFO L281 TraceCheckUtils]: 107: Hoare triple {8696#(<= ~counter~0 12)} assume !(0 == __VERIFIER_assert_~cond); {8696#(<= ~counter~0 12)} is VALID [2021-09-13 14:24:39,911 INFO L281 TraceCheckUtils]: 108: Hoare triple {8696#(<= ~counter~0 12)} __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; {8696#(<= ~counter~0 12)} is VALID [2021-09-13 14:24:39,911 INFO L281 TraceCheckUtils]: 109: Hoare triple {8696#(<= ~counter~0 12)} assume !(0 == __VERIFIER_assert_~cond); {8696#(<= ~counter~0 12)} is VALID [2021-09-13 14:24:39,912 INFO L281 TraceCheckUtils]: 110: Hoare triple {8696#(<= ~counter~0 12)} __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; {8696#(<= ~counter~0 12)} is VALID [2021-09-13 14:24:39,912 INFO L281 TraceCheckUtils]: 111: Hoare triple {8696#(<= ~counter~0 12)} assume !(0 == __VERIFIER_assert_~cond); {8696#(<= ~counter~0 12)} is VALID [2021-09-13 14:24:39,912 INFO L281 TraceCheckUtils]: 112: Hoare triple {8696#(<= ~counter~0 12)} assume !!(main_~a~0 != main_~b~0); {8696#(<= ~counter~0 12)} is VALID [2021-09-13 14:24:39,913 INFO L281 TraceCheckUtils]: 113: Hoare triple {8696#(<= ~counter~0 12)} assume main_~a~0 > main_~b~0;main_~a~0 := main_~a~0 - main_~b~0;main_~p~0 := main_~p~0 - main_~q~0;main_~r~0 := main_~r~0 - main_~s~0; {8696#(<= ~counter~0 12)} is VALID [2021-09-13 14:24:39,913 INFO L281 TraceCheckUtils]: 114: Hoare triple {8696#(<= ~counter~0 12)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {8724#(<= ~counter~0 13)} is VALID [2021-09-13 14:24:39,913 INFO L281 TraceCheckUtils]: 115: Hoare triple {8724#(<= ~counter~0 13)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 1 == main_~p~0 * main_~s~0 - main_~r~0 * main_~q~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {8724#(<= ~counter~0 13)} is VALID [2021-09-13 14:24:39,914 INFO L281 TraceCheckUtils]: 116: Hoare triple {8724#(<= ~counter~0 13)} assume !(0 == __VERIFIER_assert_~cond); {8724#(<= ~counter~0 13)} is VALID [2021-09-13 14:24:39,914 INFO L281 TraceCheckUtils]: 117: Hoare triple {8724#(<= ~counter~0 13)} __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; {8724#(<= ~counter~0 13)} is VALID [2021-09-13 14:24:39,914 INFO L281 TraceCheckUtils]: 118: Hoare triple {8724#(<= ~counter~0 13)} assume !(0 == __VERIFIER_assert_~cond); {8724#(<= ~counter~0 13)} is VALID [2021-09-13 14:24:39,914 INFO L281 TraceCheckUtils]: 119: Hoare triple {8724#(<= ~counter~0 13)} __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; {8724#(<= ~counter~0 13)} is VALID [2021-09-13 14:24:39,915 INFO L281 TraceCheckUtils]: 120: Hoare triple {8724#(<= ~counter~0 13)} assume !(0 == __VERIFIER_assert_~cond); {8724#(<= ~counter~0 13)} is VALID [2021-09-13 14:24:39,915 INFO L281 TraceCheckUtils]: 121: Hoare triple {8724#(<= ~counter~0 13)} assume !!(main_~a~0 != main_~b~0); {8724#(<= ~counter~0 13)} is VALID [2021-09-13 14:24:39,915 INFO L281 TraceCheckUtils]: 122: Hoare triple {8724#(<= ~counter~0 13)} assume main_~a~0 > main_~b~0;main_~a~0 := main_~a~0 - main_~b~0;main_~p~0 := main_~p~0 - main_~q~0;main_~r~0 := main_~r~0 - main_~s~0; {8724#(<= ~counter~0 13)} is VALID [2021-09-13 14:24:39,916 INFO L281 TraceCheckUtils]: 123: Hoare triple {8724#(<= ~counter~0 13)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {8752#(<= ~counter~0 14)} is VALID [2021-09-13 14:24:39,916 INFO L281 TraceCheckUtils]: 124: Hoare triple {8752#(<= ~counter~0 14)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 1 == main_~p~0 * main_~s~0 - main_~r~0 * main_~q~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {8752#(<= ~counter~0 14)} is VALID [2021-09-13 14:24:39,916 INFO L281 TraceCheckUtils]: 125: Hoare triple {8752#(<= ~counter~0 14)} assume !(0 == __VERIFIER_assert_~cond); {8752#(<= ~counter~0 14)} is VALID [2021-09-13 14:24:39,917 INFO L281 TraceCheckUtils]: 126: Hoare triple {8752#(<= ~counter~0 14)} __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; {8752#(<= ~counter~0 14)} is VALID [2021-09-13 14:24:39,917 INFO L281 TraceCheckUtils]: 127: Hoare triple {8752#(<= ~counter~0 14)} assume !(0 == __VERIFIER_assert_~cond); {8752#(<= ~counter~0 14)} is VALID [2021-09-13 14:24:39,917 INFO L281 TraceCheckUtils]: 128: Hoare triple {8752#(<= ~counter~0 14)} __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; {8752#(<= ~counter~0 14)} is VALID [2021-09-13 14:24:39,917 INFO L281 TraceCheckUtils]: 129: Hoare triple {8752#(<= ~counter~0 14)} assume !(0 == __VERIFIER_assert_~cond); {8752#(<= ~counter~0 14)} is VALID [2021-09-13 14:24:39,918 INFO L281 TraceCheckUtils]: 130: Hoare triple {8752#(<= ~counter~0 14)} assume !!(main_~a~0 != main_~b~0); {8752#(<= ~counter~0 14)} is VALID [2021-09-13 14:24:39,918 INFO L281 TraceCheckUtils]: 131: Hoare triple {8752#(<= ~counter~0 14)} assume main_~a~0 > main_~b~0;main_~a~0 := main_~a~0 - main_~b~0;main_~p~0 := main_~p~0 - main_~q~0;main_~r~0 := main_~r~0 - main_~s~0; {8752#(<= ~counter~0 14)} is VALID [2021-09-13 14:24:39,918 INFO L281 TraceCheckUtils]: 132: Hoare triple {8752#(<= ~counter~0 14)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {8780#(<= ~counter~0 15)} is VALID [2021-09-13 14:24:39,919 INFO L281 TraceCheckUtils]: 133: Hoare triple {8780#(<= ~counter~0 15)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 1 == main_~p~0 * main_~s~0 - main_~r~0 * main_~q~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {8780#(<= ~counter~0 15)} is VALID [2021-09-13 14:24:39,919 INFO L281 TraceCheckUtils]: 134: Hoare triple {8780#(<= ~counter~0 15)} assume !(0 == __VERIFIER_assert_~cond); {8780#(<= ~counter~0 15)} is VALID [2021-09-13 14:24:39,919 INFO L281 TraceCheckUtils]: 135: Hoare triple {8780#(<= ~counter~0 15)} __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; {8780#(<= ~counter~0 15)} is VALID [2021-09-13 14:24:39,920 INFO L281 TraceCheckUtils]: 136: Hoare triple {8780#(<= ~counter~0 15)} assume !(0 == __VERIFIER_assert_~cond); {8780#(<= ~counter~0 15)} is VALID [2021-09-13 14:24:39,920 INFO L281 TraceCheckUtils]: 137: Hoare triple {8780#(<= ~counter~0 15)} __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; {8780#(<= ~counter~0 15)} is VALID [2021-09-13 14:24:39,920 INFO L281 TraceCheckUtils]: 138: Hoare triple {8780#(<= ~counter~0 15)} assume !(0 == __VERIFIER_assert_~cond); {8780#(<= ~counter~0 15)} is VALID [2021-09-13 14:24:39,920 INFO L281 TraceCheckUtils]: 139: Hoare triple {8780#(<= ~counter~0 15)} assume !!(main_~a~0 != main_~b~0); {8780#(<= ~counter~0 15)} is VALID [2021-09-13 14:24:39,921 INFO L281 TraceCheckUtils]: 140: Hoare triple {8780#(<= ~counter~0 15)} assume main_~a~0 > main_~b~0;main_~a~0 := main_~a~0 - main_~b~0;main_~p~0 := main_~p~0 - main_~q~0;main_~r~0 := main_~r~0 - main_~s~0; {8780#(<= ~counter~0 15)} is VALID [2021-09-13 14:24:39,921 INFO L281 TraceCheckUtils]: 141: Hoare triple {8780#(<= ~counter~0 15)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {8808#(<= ~counter~0 16)} is VALID [2021-09-13 14:24:39,922 INFO L281 TraceCheckUtils]: 142: Hoare triple {8808#(<= ~counter~0 16)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 1 == main_~p~0 * main_~s~0 - main_~r~0 * main_~q~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {8808#(<= ~counter~0 16)} is VALID [2021-09-13 14:24:39,922 INFO L281 TraceCheckUtils]: 143: Hoare triple {8808#(<= ~counter~0 16)} assume !(0 == __VERIFIER_assert_~cond); {8808#(<= ~counter~0 16)} is VALID [2021-09-13 14:24:39,922 INFO L281 TraceCheckUtils]: 144: Hoare triple {8808#(<= ~counter~0 16)} __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; {8808#(<= ~counter~0 16)} is VALID [2021-09-13 14:24:39,922 INFO L281 TraceCheckUtils]: 145: Hoare triple {8808#(<= ~counter~0 16)} assume !(0 == __VERIFIER_assert_~cond); {8808#(<= ~counter~0 16)} is VALID [2021-09-13 14:24:39,923 INFO L281 TraceCheckUtils]: 146: Hoare triple {8808#(<= ~counter~0 16)} __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; {8808#(<= ~counter~0 16)} is VALID [2021-09-13 14:24:39,923 INFO L281 TraceCheckUtils]: 147: Hoare triple {8808#(<= ~counter~0 16)} assume !(0 == __VERIFIER_assert_~cond); {8808#(<= ~counter~0 16)} is VALID [2021-09-13 14:24:39,923 INFO L281 TraceCheckUtils]: 148: Hoare triple {8808#(<= ~counter~0 16)} assume !!(main_~a~0 != main_~b~0); {8808#(<= ~counter~0 16)} is VALID [2021-09-13 14:24:39,924 INFO L281 TraceCheckUtils]: 149: Hoare triple {8808#(<= ~counter~0 16)} assume main_~a~0 > main_~b~0;main_~a~0 := main_~a~0 - main_~b~0;main_~p~0 := main_~p~0 - main_~q~0;main_~r~0 := main_~r~0 - main_~s~0; {8808#(<= ~counter~0 16)} is VALID [2021-09-13 14:24:39,924 INFO L281 TraceCheckUtils]: 150: Hoare triple {8808#(<= ~counter~0 16)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {8836#(<= ~counter~0 17)} is VALID [2021-09-13 14:24:39,924 INFO L281 TraceCheckUtils]: 151: Hoare triple {8836#(<= ~counter~0 17)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 1 == main_~p~0 * main_~s~0 - main_~r~0 * main_~q~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {8836#(<= ~counter~0 17)} is VALID [2021-09-13 14:24:39,925 INFO L281 TraceCheckUtils]: 152: Hoare triple {8836#(<= ~counter~0 17)} assume !(0 == __VERIFIER_assert_~cond); {8836#(<= ~counter~0 17)} is VALID [2021-09-13 14:24:39,925 INFO L281 TraceCheckUtils]: 153: Hoare triple {8836#(<= ~counter~0 17)} __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; {8836#(<= ~counter~0 17)} is VALID [2021-09-13 14:24:39,925 INFO L281 TraceCheckUtils]: 154: Hoare triple {8836#(<= ~counter~0 17)} assume !(0 == __VERIFIER_assert_~cond); {8836#(<= ~counter~0 17)} is VALID [2021-09-13 14:24:39,925 INFO L281 TraceCheckUtils]: 155: Hoare triple {8836#(<= ~counter~0 17)} __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; {8836#(<= ~counter~0 17)} is VALID [2021-09-13 14:24:39,926 INFO L281 TraceCheckUtils]: 156: Hoare triple {8836#(<= ~counter~0 17)} assume !(0 == __VERIFIER_assert_~cond); {8836#(<= ~counter~0 17)} is VALID [2021-09-13 14:24:39,926 INFO L281 TraceCheckUtils]: 157: Hoare triple {8836#(<= ~counter~0 17)} assume !!(main_~a~0 != main_~b~0); {8836#(<= ~counter~0 17)} is VALID [2021-09-13 14:24:39,926 INFO L281 TraceCheckUtils]: 158: Hoare triple {8836#(<= ~counter~0 17)} assume main_~a~0 > main_~b~0;main_~a~0 := main_~a~0 - main_~b~0;main_~p~0 := main_~p~0 - main_~q~0;main_~r~0 := main_~r~0 - main_~s~0; {8836#(<= ~counter~0 17)} is VALID [2021-09-13 14:24:39,927 INFO L281 TraceCheckUtils]: 159: Hoare triple {8836#(<= ~counter~0 17)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {8864#(<= ~counter~0 18)} is VALID [2021-09-13 14:24:39,927 INFO L281 TraceCheckUtils]: 160: Hoare triple {8864#(<= ~counter~0 18)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 1 == main_~p~0 * main_~s~0 - main_~r~0 * main_~q~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {8864#(<= ~counter~0 18)} is VALID [2021-09-13 14:24:39,927 INFO L281 TraceCheckUtils]: 161: Hoare triple {8864#(<= ~counter~0 18)} assume !(0 == __VERIFIER_assert_~cond); {8864#(<= ~counter~0 18)} is VALID [2021-09-13 14:24:39,928 INFO L281 TraceCheckUtils]: 162: Hoare triple {8864#(<= ~counter~0 18)} __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; {8864#(<= ~counter~0 18)} is VALID [2021-09-13 14:24:39,928 INFO L281 TraceCheckUtils]: 163: Hoare triple {8864#(<= ~counter~0 18)} assume !(0 == __VERIFIER_assert_~cond); {8864#(<= ~counter~0 18)} is VALID [2021-09-13 14:24:39,928 INFO L281 TraceCheckUtils]: 164: Hoare triple {8864#(<= ~counter~0 18)} __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; {8864#(<= ~counter~0 18)} is VALID [2021-09-13 14:24:39,928 INFO L281 TraceCheckUtils]: 165: Hoare triple {8864#(<= ~counter~0 18)} assume !(0 == __VERIFIER_assert_~cond); {8864#(<= ~counter~0 18)} is VALID [2021-09-13 14:24:39,929 INFO L281 TraceCheckUtils]: 166: Hoare triple {8864#(<= ~counter~0 18)} assume !!(main_~a~0 != main_~b~0); {8864#(<= ~counter~0 18)} is VALID [2021-09-13 14:24:39,929 INFO L281 TraceCheckUtils]: 167: Hoare triple {8864#(<= ~counter~0 18)} assume main_~a~0 > main_~b~0;main_~a~0 := main_~a~0 - main_~b~0;main_~p~0 := main_~p~0 - main_~q~0;main_~r~0 := main_~r~0 - main_~s~0; {8864#(<= ~counter~0 18)} is VALID [2021-09-13 14:24:39,929 INFO L281 TraceCheckUtils]: 168: Hoare triple {8864#(<= ~counter~0 18)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {8892#(<= ~counter~0 19)} is VALID [2021-09-13 14:24:39,930 INFO L281 TraceCheckUtils]: 169: Hoare triple {8892#(<= ~counter~0 19)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 1 == main_~p~0 * main_~s~0 - main_~r~0 * main_~q~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {8892#(<= ~counter~0 19)} is VALID [2021-09-13 14:24:39,930 INFO L281 TraceCheckUtils]: 170: Hoare triple {8892#(<= ~counter~0 19)} assume !(0 == __VERIFIER_assert_~cond); {8892#(<= ~counter~0 19)} is VALID [2021-09-13 14:24:39,930 INFO L281 TraceCheckUtils]: 171: Hoare triple {8892#(<= ~counter~0 19)} __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; {8892#(<= ~counter~0 19)} is VALID [2021-09-13 14:24:39,931 INFO L281 TraceCheckUtils]: 172: Hoare triple {8892#(<= ~counter~0 19)} assume !(0 == __VERIFIER_assert_~cond); {8892#(<= ~counter~0 19)} is VALID [2021-09-13 14:24:39,931 INFO L281 TraceCheckUtils]: 173: Hoare triple {8892#(<= ~counter~0 19)} __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; {8892#(<= ~counter~0 19)} is VALID [2021-09-13 14:24:39,931 INFO L281 TraceCheckUtils]: 174: Hoare triple {8892#(<= ~counter~0 19)} assume !(0 == __VERIFIER_assert_~cond); {8892#(<= ~counter~0 19)} is VALID [2021-09-13 14:24:39,931 INFO L281 TraceCheckUtils]: 175: Hoare triple {8892#(<= ~counter~0 19)} assume !!(main_~a~0 != main_~b~0); {8892#(<= ~counter~0 19)} is VALID [2021-09-13 14:24:39,932 INFO L281 TraceCheckUtils]: 176: Hoare triple {8892#(<= ~counter~0 19)} assume main_~a~0 > main_~b~0;main_~a~0 := main_~a~0 - main_~b~0;main_~p~0 := main_~p~0 - main_~q~0;main_~r~0 := main_~r~0 - main_~s~0; {8892#(<= ~counter~0 19)} is VALID [2021-09-13 14:24:39,932 INFO L281 TraceCheckUtils]: 177: Hoare triple {8892#(<= ~counter~0 19)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {8920#(<= ~counter~0 20)} is VALID [2021-09-13 14:24:39,933 INFO L281 TraceCheckUtils]: 178: Hoare triple {8920#(<= ~counter~0 20)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 1 == main_~p~0 * main_~s~0 - main_~r~0 * main_~q~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {8920#(<= ~counter~0 20)} is VALID [2021-09-13 14:24:39,933 INFO L281 TraceCheckUtils]: 179: Hoare triple {8920#(<= ~counter~0 20)} assume !(0 == __VERIFIER_assert_~cond); {8920#(<= ~counter~0 20)} is VALID [2021-09-13 14:24:39,933 INFO L281 TraceCheckUtils]: 180: Hoare triple {8920#(<= ~counter~0 20)} __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; {8920#(<= ~counter~0 20)} is VALID [2021-09-13 14:24:39,933 INFO L281 TraceCheckUtils]: 181: Hoare triple {8920#(<= ~counter~0 20)} assume !(0 == __VERIFIER_assert_~cond); {8920#(<= ~counter~0 20)} is VALID [2021-09-13 14:24:39,934 INFO L281 TraceCheckUtils]: 182: Hoare triple {8920#(<= ~counter~0 20)} __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; {8920#(<= ~counter~0 20)} is VALID [2021-09-13 14:24:39,934 INFO L281 TraceCheckUtils]: 183: Hoare triple {8920#(<= ~counter~0 20)} assume !(0 == __VERIFIER_assert_~cond); {8920#(<= ~counter~0 20)} is VALID [2021-09-13 14:24:39,934 INFO L281 TraceCheckUtils]: 184: Hoare triple {8920#(<= ~counter~0 20)} assume !!(main_~a~0 != main_~b~0); {8920#(<= ~counter~0 20)} is VALID [2021-09-13 14:24:39,935 INFO L281 TraceCheckUtils]: 185: Hoare triple {8920#(<= ~counter~0 20)} assume main_~a~0 > main_~b~0;main_~a~0 := main_~a~0 - main_~b~0;main_~p~0 := main_~p~0 - main_~q~0;main_~r~0 := main_~r~0 - main_~s~0; {8920#(<= ~counter~0 20)} is VALID [2021-09-13 14:24:39,935 INFO L281 TraceCheckUtils]: 186: Hoare triple {8920#(<= ~counter~0 20)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {8948#(<= ~counter~0 21)} is VALID [2021-09-13 14:24:39,935 INFO L281 TraceCheckUtils]: 187: Hoare triple {8948#(<= ~counter~0 21)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 1 == main_~p~0 * main_~s~0 - main_~r~0 * main_~q~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {8948#(<= ~counter~0 21)} is VALID [2021-09-13 14:24:39,936 INFO L281 TraceCheckUtils]: 188: Hoare triple {8948#(<= ~counter~0 21)} assume !(0 == __VERIFIER_assert_~cond); {8948#(<= ~counter~0 21)} is VALID [2021-09-13 14:24:39,936 INFO L281 TraceCheckUtils]: 189: Hoare triple {8948#(<= ~counter~0 21)} __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; {8948#(<= ~counter~0 21)} is VALID [2021-09-13 14:24:39,936 INFO L281 TraceCheckUtils]: 190: Hoare triple {8948#(<= ~counter~0 21)} assume !(0 == __VERIFIER_assert_~cond); {8948#(<= ~counter~0 21)} is VALID [2021-09-13 14:24:39,936 INFO L281 TraceCheckUtils]: 191: Hoare triple {8948#(<= ~counter~0 21)} __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; {8948#(<= ~counter~0 21)} is VALID [2021-09-13 14:24:39,937 INFO L281 TraceCheckUtils]: 192: Hoare triple {8948#(<= ~counter~0 21)} assume !(0 == __VERIFIER_assert_~cond); {8948#(<= ~counter~0 21)} is VALID [2021-09-13 14:24:39,937 INFO L281 TraceCheckUtils]: 193: Hoare triple {8948#(<= ~counter~0 21)} assume !!(main_~a~0 != main_~b~0); {8948#(<= ~counter~0 21)} is VALID [2021-09-13 14:24:39,937 INFO L281 TraceCheckUtils]: 194: Hoare triple {8948#(<= ~counter~0 21)} assume main_~a~0 > main_~b~0;main_~a~0 := main_~a~0 - main_~b~0;main_~p~0 := main_~p~0 - main_~q~0;main_~r~0 := main_~r~0 - main_~s~0; {8948#(<= ~counter~0 21)} is VALID [2021-09-13 14:24:39,938 INFO L281 TraceCheckUtils]: 195: Hoare triple {8948#(<= ~counter~0 21)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {8976#(<= ~counter~0 22)} is VALID [2021-09-13 14:24:39,938 INFO L281 TraceCheckUtils]: 196: Hoare triple {8976#(<= ~counter~0 22)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 1 == main_~p~0 * main_~s~0 - main_~r~0 * main_~q~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {8976#(<= ~counter~0 22)} is VALID [2021-09-13 14:24:39,938 INFO L281 TraceCheckUtils]: 197: Hoare triple {8976#(<= ~counter~0 22)} assume !(0 == __VERIFIER_assert_~cond); {8976#(<= ~counter~0 22)} is VALID [2021-09-13 14:24:39,938 INFO L281 TraceCheckUtils]: 198: Hoare triple {8976#(<= ~counter~0 22)} __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; {8976#(<= ~counter~0 22)} is VALID [2021-09-13 14:24:39,939 INFO L281 TraceCheckUtils]: 199: Hoare triple {8976#(<= ~counter~0 22)} assume !(0 == __VERIFIER_assert_~cond); {8976#(<= ~counter~0 22)} is VALID [2021-09-13 14:24:39,939 INFO L281 TraceCheckUtils]: 200: Hoare triple {8976#(<= ~counter~0 22)} __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; {8976#(<= ~counter~0 22)} is VALID [2021-09-13 14:24:39,939 INFO L281 TraceCheckUtils]: 201: Hoare triple {8976#(<= ~counter~0 22)} assume !(0 == __VERIFIER_assert_~cond); {8976#(<= ~counter~0 22)} is VALID [2021-09-13 14:24:39,939 INFO L281 TraceCheckUtils]: 202: Hoare triple {8976#(<= ~counter~0 22)} assume !!(main_~a~0 != main_~b~0); {8976#(<= ~counter~0 22)} is VALID [2021-09-13 14:24:39,940 INFO L281 TraceCheckUtils]: 203: Hoare triple {8976#(<= ~counter~0 22)} assume main_~a~0 > main_~b~0;main_~a~0 := main_~a~0 - main_~b~0;main_~p~0 := main_~p~0 - main_~q~0;main_~r~0 := main_~r~0 - main_~s~0; {8976#(<= ~counter~0 22)} is VALID [2021-09-13 14:24:39,940 INFO L281 TraceCheckUtils]: 204: Hoare triple {8976#(<= ~counter~0 22)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {9004#(<= |ULTIMATE.start_main_#t~post9| 22)} is VALID [2021-09-13 14:24:39,940 INFO L281 TraceCheckUtils]: 205: Hoare triple {9004#(<= |ULTIMATE.start_main_#t~post9| 22)} assume !(main_#t~post9 < 50);havoc main_#t~post9; {8365#false} is VALID [2021-09-13 14:24:39,940 INFO L281 TraceCheckUtils]: 206: Hoare triple {8365#false} __VERIFIER_assert_#in~cond := (if 0 == main_~a~0 - main_~b~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {8365#false} is VALID [2021-09-13 14:24:39,941 INFO L281 TraceCheckUtils]: 207: Hoare triple {8365#false} assume 0 == __VERIFIER_assert_~cond; {8365#false} is VALID [2021-09-13 14:24:39,941 INFO L281 TraceCheckUtils]: 208: Hoare triple {8365#false} assume !false; {8365#false} is VALID [2021-09-13 14:24:39,942 INFO L134 CoverageAnalysis]: Checked inductivity of 2123 backedges. 0 proven. 2123 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:24:39,942 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 14:24:41,739 INFO L281 TraceCheckUtils]: 208: Hoare triple {8365#false} assume !false; {8365#false} is VALID [2021-09-13 14:24:41,739 INFO L281 TraceCheckUtils]: 207: Hoare triple {8365#false} assume 0 == __VERIFIER_assert_~cond; {8365#false} is VALID [2021-09-13 14:24:41,739 INFO L281 TraceCheckUtils]: 206: Hoare triple {8365#false} __VERIFIER_assert_#in~cond := (if 0 == main_~a~0 - main_~b~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {8365#false} is VALID [2021-09-13 14:24:41,740 INFO L281 TraceCheckUtils]: 205: Hoare triple {9026#(< |ULTIMATE.start_main_#t~post9| 50)} assume !(main_#t~post9 < 50);havoc main_#t~post9; {8365#false} is VALID [2021-09-13 14:24:41,740 INFO L281 TraceCheckUtils]: 204: Hoare triple {9030#(< ~counter~0 50)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {9026#(< |ULTIMATE.start_main_#t~post9| 50)} is VALID [2021-09-13 14:24:41,740 INFO L281 TraceCheckUtils]: 203: Hoare triple {9030#(< ~counter~0 50)} assume main_~a~0 > main_~b~0;main_~a~0 := main_~a~0 - main_~b~0;main_~p~0 := main_~p~0 - main_~q~0;main_~r~0 := main_~r~0 - main_~s~0; {9030#(< ~counter~0 50)} is VALID [2021-09-13 14:24:41,741 INFO L281 TraceCheckUtils]: 202: Hoare triple {9030#(< ~counter~0 50)} assume !!(main_~a~0 != main_~b~0); {9030#(< ~counter~0 50)} is VALID [2021-09-13 14:24:41,741 INFO L281 TraceCheckUtils]: 201: Hoare triple {9030#(< ~counter~0 50)} assume !(0 == __VERIFIER_assert_~cond); {9030#(< ~counter~0 50)} is VALID [2021-09-13 14:24:41,741 INFO L281 TraceCheckUtils]: 200: Hoare triple {9030#(< ~counter~0 50)} __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; {9030#(< ~counter~0 50)} is VALID [2021-09-13 14:24:41,741 INFO L281 TraceCheckUtils]: 199: Hoare triple {9030#(< ~counter~0 50)} assume !(0 == __VERIFIER_assert_~cond); {9030#(< ~counter~0 50)} is VALID [2021-09-13 14:24:41,742 INFO L281 TraceCheckUtils]: 198: Hoare triple {9030#(< ~counter~0 50)} __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; {9030#(< ~counter~0 50)} is VALID [2021-09-13 14:24:41,742 INFO L281 TraceCheckUtils]: 197: Hoare triple {9030#(< ~counter~0 50)} assume !(0 == __VERIFIER_assert_~cond); {9030#(< ~counter~0 50)} is VALID [2021-09-13 14:24:41,742 INFO L281 TraceCheckUtils]: 196: Hoare triple {9030#(< ~counter~0 50)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 1 == main_~p~0 * main_~s~0 - main_~r~0 * main_~q~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {9030#(< ~counter~0 50)} is VALID [2021-09-13 14:24:41,743 INFO L281 TraceCheckUtils]: 195: Hoare triple {9058#(< ~counter~0 49)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {9030#(< ~counter~0 50)} is VALID [2021-09-13 14:24:41,743 INFO L281 TraceCheckUtils]: 194: Hoare triple {9058#(< ~counter~0 49)} assume main_~a~0 > main_~b~0;main_~a~0 := main_~a~0 - main_~b~0;main_~p~0 := main_~p~0 - main_~q~0;main_~r~0 := main_~r~0 - main_~s~0; {9058#(< ~counter~0 49)} is VALID [2021-09-13 14:24:41,743 INFO L281 TraceCheckUtils]: 193: Hoare triple {9058#(< ~counter~0 49)} assume !!(main_~a~0 != main_~b~0); {9058#(< ~counter~0 49)} is VALID [2021-09-13 14:24:41,744 INFO L281 TraceCheckUtils]: 192: Hoare triple {9058#(< ~counter~0 49)} assume !(0 == __VERIFIER_assert_~cond); {9058#(< ~counter~0 49)} is VALID [2021-09-13 14:24:41,744 INFO L281 TraceCheckUtils]: 191: Hoare triple {9058#(< ~counter~0 49)} __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; {9058#(< ~counter~0 49)} is VALID [2021-09-13 14:24:41,744 INFO L281 TraceCheckUtils]: 190: Hoare triple {9058#(< ~counter~0 49)} assume !(0 == __VERIFIER_assert_~cond); {9058#(< ~counter~0 49)} is VALID [2021-09-13 14:24:41,745 INFO L281 TraceCheckUtils]: 189: Hoare triple {9058#(< ~counter~0 49)} __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; {9058#(< ~counter~0 49)} is VALID [2021-09-13 14:24:41,745 INFO L281 TraceCheckUtils]: 188: Hoare triple {9058#(< ~counter~0 49)} assume !(0 == __VERIFIER_assert_~cond); {9058#(< ~counter~0 49)} is VALID [2021-09-13 14:24:41,745 INFO L281 TraceCheckUtils]: 187: Hoare triple {9058#(< ~counter~0 49)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 1 == main_~p~0 * main_~s~0 - main_~r~0 * main_~q~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {9058#(< ~counter~0 49)} is VALID [2021-09-13 14:24:41,745 INFO L281 TraceCheckUtils]: 186: Hoare triple {9086#(< ~counter~0 48)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {9058#(< ~counter~0 49)} is VALID [2021-09-13 14:24:41,746 INFO L281 TraceCheckUtils]: 185: Hoare triple {9086#(< ~counter~0 48)} assume main_~a~0 > main_~b~0;main_~a~0 := main_~a~0 - main_~b~0;main_~p~0 := main_~p~0 - main_~q~0;main_~r~0 := main_~r~0 - main_~s~0; {9086#(< ~counter~0 48)} is VALID [2021-09-13 14:24:41,746 INFO L281 TraceCheckUtils]: 184: Hoare triple {9086#(< ~counter~0 48)} assume !!(main_~a~0 != main_~b~0); {9086#(< ~counter~0 48)} is VALID [2021-09-13 14:24:41,746 INFO L281 TraceCheckUtils]: 183: Hoare triple {9086#(< ~counter~0 48)} assume !(0 == __VERIFIER_assert_~cond); {9086#(< ~counter~0 48)} is VALID [2021-09-13 14:24:41,747 INFO L281 TraceCheckUtils]: 182: Hoare triple {9086#(< ~counter~0 48)} __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; {9086#(< ~counter~0 48)} is VALID [2021-09-13 14:24:41,747 INFO L281 TraceCheckUtils]: 181: Hoare triple {9086#(< ~counter~0 48)} assume !(0 == __VERIFIER_assert_~cond); {9086#(< ~counter~0 48)} is VALID [2021-09-13 14:24:41,747 INFO L281 TraceCheckUtils]: 180: Hoare triple {9086#(< ~counter~0 48)} __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; {9086#(< ~counter~0 48)} is VALID [2021-09-13 14:24:41,747 INFO L281 TraceCheckUtils]: 179: Hoare triple {9086#(< ~counter~0 48)} assume !(0 == __VERIFIER_assert_~cond); {9086#(< ~counter~0 48)} is VALID [2021-09-13 14:24:41,748 INFO L281 TraceCheckUtils]: 178: Hoare triple {9086#(< ~counter~0 48)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 1 == main_~p~0 * main_~s~0 - main_~r~0 * main_~q~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {9086#(< ~counter~0 48)} is VALID [2021-09-13 14:24:41,748 INFO L281 TraceCheckUtils]: 177: Hoare triple {9114#(< ~counter~0 47)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {9086#(< ~counter~0 48)} is VALID [2021-09-13 14:24:41,748 INFO L281 TraceCheckUtils]: 176: Hoare triple {9114#(< ~counter~0 47)} assume main_~a~0 > main_~b~0;main_~a~0 := main_~a~0 - main_~b~0;main_~p~0 := main_~p~0 - main_~q~0;main_~r~0 := main_~r~0 - main_~s~0; {9114#(< ~counter~0 47)} is VALID [2021-09-13 14:24:41,749 INFO L281 TraceCheckUtils]: 175: Hoare triple {9114#(< ~counter~0 47)} assume !!(main_~a~0 != main_~b~0); {9114#(< ~counter~0 47)} is VALID [2021-09-13 14:24:41,749 INFO L281 TraceCheckUtils]: 174: Hoare triple {9114#(< ~counter~0 47)} assume !(0 == __VERIFIER_assert_~cond); {9114#(< ~counter~0 47)} is VALID [2021-09-13 14:24:41,749 INFO L281 TraceCheckUtils]: 173: Hoare triple {9114#(< ~counter~0 47)} __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; {9114#(< ~counter~0 47)} is VALID [2021-09-13 14:24:41,749 INFO L281 TraceCheckUtils]: 172: Hoare triple {9114#(< ~counter~0 47)} assume !(0 == __VERIFIER_assert_~cond); {9114#(< ~counter~0 47)} is VALID [2021-09-13 14:24:41,750 INFO L281 TraceCheckUtils]: 171: Hoare triple {9114#(< ~counter~0 47)} __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; {9114#(< ~counter~0 47)} is VALID [2021-09-13 14:24:41,750 INFO L281 TraceCheckUtils]: 170: Hoare triple {9114#(< ~counter~0 47)} assume !(0 == __VERIFIER_assert_~cond); {9114#(< ~counter~0 47)} is VALID [2021-09-13 14:24:41,750 INFO L281 TraceCheckUtils]: 169: Hoare triple {9114#(< ~counter~0 47)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 1 == main_~p~0 * main_~s~0 - main_~r~0 * main_~q~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {9114#(< ~counter~0 47)} is VALID [2021-09-13 14:24:41,751 INFO L281 TraceCheckUtils]: 168: Hoare triple {9142#(< ~counter~0 46)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {9114#(< ~counter~0 47)} is VALID [2021-09-13 14:24:41,751 INFO L281 TraceCheckUtils]: 167: Hoare triple {9142#(< ~counter~0 46)} assume main_~a~0 > main_~b~0;main_~a~0 := main_~a~0 - main_~b~0;main_~p~0 := main_~p~0 - main_~q~0;main_~r~0 := main_~r~0 - main_~s~0; {9142#(< ~counter~0 46)} is VALID [2021-09-13 14:24:41,751 INFO L281 TraceCheckUtils]: 166: Hoare triple {9142#(< ~counter~0 46)} assume !!(main_~a~0 != main_~b~0); {9142#(< ~counter~0 46)} is VALID [2021-09-13 14:24:41,751 INFO L281 TraceCheckUtils]: 165: Hoare triple {9142#(< ~counter~0 46)} assume !(0 == __VERIFIER_assert_~cond); {9142#(< ~counter~0 46)} is VALID [2021-09-13 14:24:41,752 INFO L281 TraceCheckUtils]: 164: Hoare triple {9142#(< ~counter~0 46)} __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; {9142#(< ~counter~0 46)} is VALID [2021-09-13 14:24:41,752 INFO L281 TraceCheckUtils]: 163: Hoare triple {9142#(< ~counter~0 46)} assume !(0 == __VERIFIER_assert_~cond); {9142#(< ~counter~0 46)} is VALID [2021-09-13 14:24:41,752 INFO L281 TraceCheckUtils]: 162: Hoare triple {9142#(< ~counter~0 46)} __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; {9142#(< ~counter~0 46)} is VALID [2021-09-13 14:24:41,752 INFO L281 TraceCheckUtils]: 161: Hoare triple {9142#(< ~counter~0 46)} assume !(0 == __VERIFIER_assert_~cond); {9142#(< ~counter~0 46)} is VALID [2021-09-13 14:24:41,753 INFO L281 TraceCheckUtils]: 160: Hoare triple {9142#(< ~counter~0 46)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 1 == main_~p~0 * main_~s~0 - main_~r~0 * main_~q~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {9142#(< ~counter~0 46)} is VALID [2021-09-13 14:24:41,753 INFO L281 TraceCheckUtils]: 159: Hoare triple {9170#(< ~counter~0 45)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {9142#(< ~counter~0 46)} is VALID [2021-09-13 14:24:41,753 INFO L281 TraceCheckUtils]: 158: Hoare triple {9170#(< ~counter~0 45)} assume main_~a~0 > main_~b~0;main_~a~0 := main_~a~0 - main_~b~0;main_~p~0 := main_~p~0 - main_~q~0;main_~r~0 := main_~r~0 - main_~s~0; {9170#(< ~counter~0 45)} is VALID [2021-09-13 14:24:41,754 INFO L281 TraceCheckUtils]: 157: Hoare triple {9170#(< ~counter~0 45)} assume !!(main_~a~0 != main_~b~0); {9170#(< ~counter~0 45)} is VALID [2021-09-13 14:24:41,754 INFO L281 TraceCheckUtils]: 156: Hoare triple {9170#(< ~counter~0 45)} assume !(0 == __VERIFIER_assert_~cond); {9170#(< ~counter~0 45)} is VALID [2021-09-13 14:24:41,754 INFO L281 TraceCheckUtils]: 155: Hoare triple {9170#(< ~counter~0 45)} __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; {9170#(< ~counter~0 45)} is VALID [2021-09-13 14:24:41,755 INFO L281 TraceCheckUtils]: 154: Hoare triple {9170#(< ~counter~0 45)} assume !(0 == __VERIFIER_assert_~cond); {9170#(< ~counter~0 45)} is VALID [2021-09-13 14:24:41,755 INFO L281 TraceCheckUtils]: 153: Hoare triple {9170#(< ~counter~0 45)} __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; {9170#(< ~counter~0 45)} is VALID [2021-09-13 14:24:41,755 INFO L281 TraceCheckUtils]: 152: Hoare triple {9170#(< ~counter~0 45)} assume !(0 == __VERIFIER_assert_~cond); {9170#(< ~counter~0 45)} is VALID [2021-09-13 14:24:41,755 INFO L281 TraceCheckUtils]: 151: Hoare triple {9170#(< ~counter~0 45)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 1 == main_~p~0 * main_~s~0 - main_~r~0 * main_~q~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {9170#(< ~counter~0 45)} is VALID [2021-09-13 14:24:41,756 INFO L281 TraceCheckUtils]: 150: Hoare triple {9198#(< ~counter~0 44)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {9170#(< ~counter~0 45)} is VALID [2021-09-13 14:24:41,756 INFO L281 TraceCheckUtils]: 149: Hoare triple {9198#(< ~counter~0 44)} assume main_~a~0 > main_~b~0;main_~a~0 := main_~a~0 - main_~b~0;main_~p~0 := main_~p~0 - main_~q~0;main_~r~0 := main_~r~0 - main_~s~0; {9198#(< ~counter~0 44)} is VALID [2021-09-13 14:24:41,756 INFO L281 TraceCheckUtils]: 148: Hoare triple {9198#(< ~counter~0 44)} assume !!(main_~a~0 != main_~b~0); {9198#(< ~counter~0 44)} is VALID [2021-09-13 14:24:41,757 INFO L281 TraceCheckUtils]: 147: Hoare triple {9198#(< ~counter~0 44)} assume !(0 == __VERIFIER_assert_~cond); {9198#(< ~counter~0 44)} is VALID [2021-09-13 14:24:41,757 INFO L281 TraceCheckUtils]: 146: Hoare triple {9198#(< ~counter~0 44)} __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; {9198#(< ~counter~0 44)} is VALID [2021-09-13 14:24:41,757 INFO L281 TraceCheckUtils]: 145: Hoare triple {9198#(< ~counter~0 44)} assume !(0 == __VERIFIER_assert_~cond); {9198#(< ~counter~0 44)} is VALID [2021-09-13 14:24:41,757 INFO L281 TraceCheckUtils]: 144: Hoare triple {9198#(< ~counter~0 44)} __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; {9198#(< ~counter~0 44)} is VALID [2021-09-13 14:24:41,758 INFO L281 TraceCheckUtils]: 143: Hoare triple {9198#(< ~counter~0 44)} assume !(0 == __VERIFIER_assert_~cond); {9198#(< ~counter~0 44)} is VALID [2021-09-13 14:24:41,758 INFO L281 TraceCheckUtils]: 142: Hoare triple {9198#(< ~counter~0 44)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 1 == main_~p~0 * main_~s~0 - main_~r~0 * main_~q~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {9198#(< ~counter~0 44)} is VALID [2021-09-13 14:24:41,758 INFO L281 TraceCheckUtils]: 141: Hoare triple {9226#(< ~counter~0 43)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {9198#(< ~counter~0 44)} is VALID [2021-09-13 14:24:41,759 INFO L281 TraceCheckUtils]: 140: Hoare triple {9226#(< ~counter~0 43)} assume main_~a~0 > main_~b~0;main_~a~0 := main_~a~0 - main_~b~0;main_~p~0 := main_~p~0 - main_~q~0;main_~r~0 := main_~r~0 - main_~s~0; {9226#(< ~counter~0 43)} is VALID [2021-09-13 14:24:41,759 INFO L281 TraceCheckUtils]: 139: Hoare triple {9226#(< ~counter~0 43)} assume !!(main_~a~0 != main_~b~0); {9226#(< ~counter~0 43)} is VALID [2021-09-13 14:24:41,759 INFO L281 TraceCheckUtils]: 138: Hoare triple {9226#(< ~counter~0 43)} assume !(0 == __VERIFIER_assert_~cond); {9226#(< ~counter~0 43)} is VALID [2021-09-13 14:24:41,759 INFO L281 TraceCheckUtils]: 137: Hoare triple {9226#(< ~counter~0 43)} __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; {9226#(< ~counter~0 43)} is VALID [2021-09-13 14:24:41,760 INFO L281 TraceCheckUtils]: 136: Hoare triple {9226#(< ~counter~0 43)} assume !(0 == __VERIFIER_assert_~cond); {9226#(< ~counter~0 43)} is VALID [2021-09-13 14:24:41,760 INFO L281 TraceCheckUtils]: 135: Hoare triple {9226#(< ~counter~0 43)} __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; {9226#(< ~counter~0 43)} is VALID [2021-09-13 14:24:41,760 INFO L281 TraceCheckUtils]: 134: Hoare triple {9226#(< ~counter~0 43)} assume !(0 == __VERIFIER_assert_~cond); {9226#(< ~counter~0 43)} is VALID [2021-09-13 14:24:41,761 INFO L281 TraceCheckUtils]: 133: Hoare triple {9226#(< ~counter~0 43)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 1 == main_~p~0 * main_~s~0 - main_~r~0 * main_~q~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {9226#(< ~counter~0 43)} is VALID [2021-09-13 14:24:41,761 INFO L281 TraceCheckUtils]: 132: Hoare triple {9254#(< ~counter~0 42)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {9226#(< ~counter~0 43)} is VALID [2021-09-13 14:24:41,761 INFO L281 TraceCheckUtils]: 131: Hoare triple {9254#(< ~counter~0 42)} assume main_~a~0 > main_~b~0;main_~a~0 := main_~a~0 - main_~b~0;main_~p~0 := main_~p~0 - main_~q~0;main_~r~0 := main_~r~0 - main_~s~0; {9254#(< ~counter~0 42)} is VALID [2021-09-13 14:24:41,762 INFO L281 TraceCheckUtils]: 130: Hoare triple {9254#(< ~counter~0 42)} assume !!(main_~a~0 != main_~b~0); {9254#(< ~counter~0 42)} is VALID [2021-09-13 14:24:41,762 INFO L281 TraceCheckUtils]: 129: Hoare triple {9254#(< ~counter~0 42)} assume !(0 == __VERIFIER_assert_~cond); {9254#(< ~counter~0 42)} is VALID [2021-09-13 14:24:41,762 INFO L281 TraceCheckUtils]: 128: Hoare triple {9254#(< ~counter~0 42)} __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; {9254#(< ~counter~0 42)} is VALID [2021-09-13 14:24:41,762 INFO L281 TraceCheckUtils]: 127: Hoare triple {9254#(< ~counter~0 42)} assume !(0 == __VERIFIER_assert_~cond); {9254#(< ~counter~0 42)} is VALID [2021-09-13 14:24:41,763 INFO L281 TraceCheckUtils]: 126: Hoare triple {9254#(< ~counter~0 42)} __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; {9254#(< ~counter~0 42)} is VALID [2021-09-13 14:24:41,763 INFO L281 TraceCheckUtils]: 125: Hoare triple {9254#(< ~counter~0 42)} assume !(0 == __VERIFIER_assert_~cond); {9254#(< ~counter~0 42)} is VALID [2021-09-13 14:24:41,763 INFO L281 TraceCheckUtils]: 124: Hoare triple {9254#(< ~counter~0 42)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 1 == main_~p~0 * main_~s~0 - main_~r~0 * main_~q~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {9254#(< ~counter~0 42)} is VALID [2021-09-13 14:24:41,764 INFO L281 TraceCheckUtils]: 123: Hoare triple {9282#(< ~counter~0 41)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {9254#(< ~counter~0 42)} is VALID [2021-09-13 14:24:41,764 INFO L281 TraceCheckUtils]: 122: Hoare triple {9282#(< ~counter~0 41)} assume main_~a~0 > main_~b~0;main_~a~0 := main_~a~0 - main_~b~0;main_~p~0 := main_~p~0 - main_~q~0;main_~r~0 := main_~r~0 - main_~s~0; {9282#(< ~counter~0 41)} is VALID [2021-09-13 14:24:41,764 INFO L281 TraceCheckUtils]: 121: Hoare triple {9282#(< ~counter~0 41)} assume !!(main_~a~0 != main_~b~0); {9282#(< ~counter~0 41)} is VALID [2021-09-13 14:24:41,764 INFO L281 TraceCheckUtils]: 120: Hoare triple {9282#(< ~counter~0 41)} assume !(0 == __VERIFIER_assert_~cond); {9282#(< ~counter~0 41)} is VALID [2021-09-13 14:24:41,765 INFO L281 TraceCheckUtils]: 119: Hoare triple {9282#(< ~counter~0 41)} __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; {9282#(< ~counter~0 41)} is VALID [2021-09-13 14:24:41,765 INFO L281 TraceCheckUtils]: 118: Hoare triple {9282#(< ~counter~0 41)} assume !(0 == __VERIFIER_assert_~cond); {9282#(< ~counter~0 41)} is VALID [2021-09-13 14:24:41,765 INFO L281 TraceCheckUtils]: 117: Hoare triple {9282#(< ~counter~0 41)} __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; {9282#(< ~counter~0 41)} is VALID [2021-09-13 14:24:41,766 INFO L281 TraceCheckUtils]: 116: Hoare triple {9282#(< ~counter~0 41)} assume !(0 == __VERIFIER_assert_~cond); {9282#(< ~counter~0 41)} is VALID [2021-09-13 14:24:41,766 INFO L281 TraceCheckUtils]: 115: Hoare triple {9282#(< ~counter~0 41)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 1 == main_~p~0 * main_~s~0 - main_~r~0 * main_~q~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {9282#(< ~counter~0 41)} is VALID [2021-09-13 14:24:41,766 INFO L281 TraceCheckUtils]: 114: Hoare triple {9310#(< ~counter~0 40)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {9282#(< ~counter~0 41)} is VALID [2021-09-13 14:24:41,766 INFO L281 TraceCheckUtils]: 113: Hoare triple {9310#(< ~counter~0 40)} assume main_~a~0 > main_~b~0;main_~a~0 := main_~a~0 - main_~b~0;main_~p~0 := main_~p~0 - main_~q~0;main_~r~0 := main_~r~0 - main_~s~0; {9310#(< ~counter~0 40)} is VALID [2021-09-13 14:24:41,767 INFO L281 TraceCheckUtils]: 112: Hoare triple {9310#(< ~counter~0 40)} assume !!(main_~a~0 != main_~b~0); {9310#(< ~counter~0 40)} is VALID [2021-09-13 14:24:41,767 INFO L281 TraceCheckUtils]: 111: Hoare triple {9310#(< ~counter~0 40)} assume !(0 == __VERIFIER_assert_~cond); {9310#(< ~counter~0 40)} is VALID [2021-09-13 14:24:41,767 INFO L281 TraceCheckUtils]: 110: Hoare triple {9310#(< ~counter~0 40)} __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; {9310#(< ~counter~0 40)} is VALID [2021-09-13 14:24:41,768 INFO L281 TraceCheckUtils]: 109: Hoare triple {9310#(< ~counter~0 40)} assume !(0 == __VERIFIER_assert_~cond); {9310#(< ~counter~0 40)} is VALID [2021-09-13 14:24:41,768 INFO L281 TraceCheckUtils]: 108: Hoare triple {9310#(< ~counter~0 40)} __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; {9310#(< ~counter~0 40)} is VALID [2021-09-13 14:24:41,768 INFO L281 TraceCheckUtils]: 107: Hoare triple {9310#(< ~counter~0 40)} assume !(0 == __VERIFIER_assert_~cond); {9310#(< ~counter~0 40)} is VALID [2021-09-13 14:24:41,768 INFO L281 TraceCheckUtils]: 106: Hoare triple {9310#(< ~counter~0 40)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 1 == main_~p~0 * main_~s~0 - main_~r~0 * main_~q~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {9310#(< ~counter~0 40)} is VALID [2021-09-13 14:24:41,769 INFO L281 TraceCheckUtils]: 105: Hoare triple {9338#(< ~counter~0 39)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {9310#(< ~counter~0 40)} is VALID [2021-09-13 14:24:41,769 INFO L281 TraceCheckUtils]: 104: Hoare triple {9338#(< ~counter~0 39)} assume main_~a~0 > main_~b~0;main_~a~0 := main_~a~0 - main_~b~0;main_~p~0 := main_~p~0 - main_~q~0;main_~r~0 := main_~r~0 - main_~s~0; {9338#(< ~counter~0 39)} is VALID [2021-09-13 14:24:41,769 INFO L281 TraceCheckUtils]: 103: Hoare triple {9338#(< ~counter~0 39)} assume !!(main_~a~0 != main_~b~0); {9338#(< ~counter~0 39)} is VALID [2021-09-13 14:24:41,770 INFO L281 TraceCheckUtils]: 102: Hoare triple {9338#(< ~counter~0 39)} assume !(0 == __VERIFIER_assert_~cond); {9338#(< ~counter~0 39)} is VALID [2021-09-13 14:24:41,770 INFO L281 TraceCheckUtils]: 101: Hoare triple {9338#(< ~counter~0 39)} __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; {9338#(< ~counter~0 39)} is VALID [2021-09-13 14:24:41,770 INFO L281 TraceCheckUtils]: 100: Hoare triple {9338#(< ~counter~0 39)} assume !(0 == __VERIFIER_assert_~cond); {9338#(< ~counter~0 39)} is VALID [2021-09-13 14:24:41,771 INFO L281 TraceCheckUtils]: 99: Hoare triple {9338#(< ~counter~0 39)} __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; {9338#(< ~counter~0 39)} is VALID [2021-09-13 14:24:41,771 INFO L281 TraceCheckUtils]: 98: Hoare triple {9338#(< ~counter~0 39)} assume !(0 == __VERIFIER_assert_~cond); {9338#(< ~counter~0 39)} is VALID [2021-09-13 14:24:41,771 INFO L281 TraceCheckUtils]: 97: Hoare triple {9338#(< ~counter~0 39)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 1 == main_~p~0 * main_~s~0 - main_~r~0 * main_~q~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {9338#(< ~counter~0 39)} is VALID [2021-09-13 14:24:41,771 INFO L281 TraceCheckUtils]: 96: Hoare triple {9366#(< ~counter~0 38)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {9338#(< ~counter~0 39)} is VALID [2021-09-13 14:24:41,772 INFO L281 TraceCheckUtils]: 95: Hoare triple {9366#(< ~counter~0 38)} assume main_~a~0 > main_~b~0;main_~a~0 := main_~a~0 - main_~b~0;main_~p~0 := main_~p~0 - main_~q~0;main_~r~0 := main_~r~0 - main_~s~0; {9366#(< ~counter~0 38)} is VALID [2021-09-13 14:24:41,772 INFO L281 TraceCheckUtils]: 94: Hoare triple {9366#(< ~counter~0 38)} assume !!(main_~a~0 != main_~b~0); {9366#(< ~counter~0 38)} is VALID [2021-09-13 14:24:41,772 INFO L281 TraceCheckUtils]: 93: Hoare triple {9366#(< ~counter~0 38)} assume !(0 == __VERIFIER_assert_~cond); {9366#(< ~counter~0 38)} is VALID [2021-09-13 14:24:41,773 INFO L281 TraceCheckUtils]: 92: Hoare triple {9366#(< ~counter~0 38)} __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; {9366#(< ~counter~0 38)} is VALID [2021-09-13 14:24:41,773 INFO L281 TraceCheckUtils]: 91: Hoare triple {9366#(< ~counter~0 38)} assume !(0 == __VERIFIER_assert_~cond); {9366#(< ~counter~0 38)} is VALID [2021-09-13 14:24:41,773 INFO L281 TraceCheckUtils]: 90: Hoare triple {9366#(< ~counter~0 38)} __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; {9366#(< ~counter~0 38)} is VALID [2021-09-13 14:24:41,773 INFO L281 TraceCheckUtils]: 89: Hoare triple {9366#(< ~counter~0 38)} assume !(0 == __VERIFIER_assert_~cond); {9366#(< ~counter~0 38)} is VALID [2021-09-13 14:24:41,774 INFO L281 TraceCheckUtils]: 88: Hoare triple {9366#(< ~counter~0 38)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 1 == main_~p~0 * main_~s~0 - main_~r~0 * main_~q~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {9366#(< ~counter~0 38)} is VALID [2021-09-13 14:24:41,774 INFO L281 TraceCheckUtils]: 87: Hoare triple {9394#(< ~counter~0 37)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {9366#(< ~counter~0 38)} is VALID [2021-09-13 14:24:41,774 INFO L281 TraceCheckUtils]: 86: Hoare triple {9394#(< ~counter~0 37)} assume main_~a~0 > main_~b~0;main_~a~0 := main_~a~0 - main_~b~0;main_~p~0 := main_~p~0 - main_~q~0;main_~r~0 := main_~r~0 - main_~s~0; {9394#(< ~counter~0 37)} is VALID [2021-09-13 14:24:41,775 INFO L281 TraceCheckUtils]: 85: Hoare triple {9394#(< ~counter~0 37)} assume !!(main_~a~0 != main_~b~0); {9394#(< ~counter~0 37)} is VALID [2021-09-13 14:24:41,775 INFO L281 TraceCheckUtils]: 84: Hoare triple {9394#(< ~counter~0 37)} assume !(0 == __VERIFIER_assert_~cond); {9394#(< ~counter~0 37)} is VALID [2021-09-13 14:24:41,775 INFO L281 TraceCheckUtils]: 83: Hoare triple {9394#(< ~counter~0 37)} __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; {9394#(< ~counter~0 37)} is VALID [2021-09-13 14:24:41,775 INFO L281 TraceCheckUtils]: 82: Hoare triple {9394#(< ~counter~0 37)} assume !(0 == __VERIFIER_assert_~cond); {9394#(< ~counter~0 37)} is VALID [2021-09-13 14:24:41,776 INFO L281 TraceCheckUtils]: 81: Hoare triple {9394#(< ~counter~0 37)} __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; {9394#(< ~counter~0 37)} is VALID [2021-09-13 14:24:41,776 INFO L281 TraceCheckUtils]: 80: Hoare triple {9394#(< ~counter~0 37)} assume !(0 == __VERIFIER_assert_~cond); {9394#(< ~counter~0 37)} is VALID [2021-09-13 14:24:41,776 INFO L281 TraceCheckUtils]: 79: Hoare triple {9394#(< ~counter~0 37)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 1 == main_~p~0 * main_~s~0 - main_~r~0 * main_~q~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {9394#(< ~counter~0 37)} is VALID [2021-09-13 14:24:41,777 INFO L281 TraceCheckUtils]: 78: Hoare triple {9422#(< ~counter~0 36)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {9394#(< ~counter~0 37)} is VALID [2021-09-13 14:24:41,777 INFO L281 TraceCheckUtils]: 77: Hoare triple {9422#(< ~counter~0 36)} assume main_~a~0 > main_~b~0;main_~a~0 := main_~a~0 - main_~b~0;main_~p~0 := main_~p~0 - main_~q~0;main_~r~0 := main_~r~0 - main_~s~0; {9422#(< ~counter~0 36)} is VALID [2021-09-13 14:24:41,777 INFO L281 TraceCheckUtils]: 76: Hoare triple {9422#(< ~counter~0 36)} assume !!(main_~a~0 != main_~b~0); {9422#(< ~counter~0 36)} is VALID [2021-09-13 14:24:41,778 INFO L281 TraceCheckUtils]: 75: Hoare triple {9422#(< ~counter~0 36)} assume !(0 == __VERIFIER_assert_~cond); {9422#(< ~counter~0 36)} is VALID [2021-09-13 14:24:41,778 INFO L281 TraceCheckUtils]: 74: Hoare triple {9422#(< ~counter~0 36)} __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; {9422#(< ~counter~0 36)} is VALID [2021-09-13 14:24:41,778 INFO L281 TraceCheckUtils]: 73: Hoare triple {9422#(< ~counter~0 36)} assume !(0 == __VERIFIER_assert_~cond); {9422#(< ~counter~0 36)} is VALID [2021-09-13 14:24:41,778 INFO L281 TraceCheckUtils]: 72: Hoare triple {9422#(< ~counter~0 36)} __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; {9422#(< ~counter~0 36)} is VALID [2021-09-13 14:24:41,779 INFO L281 TraceCheckUtils]: 71: Hoare triple {9422#(< ~counter~0 36)} assume !(0 == __VERIFIER_assert_~cond); {9422#(< ~counter~0 36)} is VALID [2021-09-13 14:24:41,779 INFO L281 TraceCheckUtils]: 70: Hoare triple {9422#(< ~counter~0 36)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 1 == main_~p~0 * main_~s~0 - main_~r~0 * main_~q~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {9422#(< ~counter~0 36)} is VALID [2021-09-13 14:24:41,779 INFO L281 TraceCheckUtils]: 69: Hoare triple {9450#(< ~counter~0 35)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {9422#(< ~counter~0 36)} is VALID [2021-09-13 14:24:41,780 INFO L281 TraceCheckUtils]: 68: Hoare triple {9450#(< ~counter~0 35)} assume main_~a~0 > main_~b~0;main_~a~0 := main_~a~0 - main_~b~0;main_~p~0 := main_~p~0 - main_~q~0;main_~r~0 := main_~r~0 - main_~s~0; {9450#(< ~counter~0 35)} is VALID [2021-09-13 14:24:41,780 INFO L281 TraceCheckUtils]: 67: Hoare triple {9450#(< ~counter~0 35)} assume !!(main_~a~0 != main_~b~0); {9450#(< ~counter~0 35)} is VALID [2021-09-13 14:24:41,780 INFO L281 TraceCheckUtils]: 66: Hoare triple {9450#(< ~counter~0 35)} assume !(0 == __VERIFIER_assert_~cond); {9450#(< ~counter~0 35)} is VALID [2021-09-13 14:24:41,780 INFO L281 TraceCheckUtils]: 65: Hoare triple {9450#(< ~counter~0 35)} __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; {9450#(< ~counter~0 35)} is VALID [2021-09-13 14:24:41,781 INFO L281 TraceCheckUtils]: 64: Hoare triple {9450#(< ~counter~0 35)} assume !(0 == __VERIFIER_assert_~cond); {9450#(< ~counter~0 35)} is VALID [2021-09-13 14:24:41,781 INFO L281 TraceCheckUtils]: 63: Hoare triple {9450#(< ~counter~0 35)} __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; {9450#(< ~counter~0 35)} is VALID [2021-09-13 14:24:41,781 INFO L281 TraceCheckUtils]: 62: Hoare triple {9450#(< ~counter~0 35)} assume !(0 == __VERIFIER_assert_~cond); {9450#(< ~counter~0 35)} is VALID [2021-09-13 14:24:41,782 INFO L281 TraceCheckUtils]: 61: Hoare triple {9450#(< ~counter~0 35)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 1 == main_~p~0 * main_~s~0 - main_~r~0 * main_~q~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {9450#(< ~counter~0 35)} is VALID [2021-09-13 14:24:41,782 INFO L281 TraceCheckUtils]: 60: Hoare triple {9478#(< ~counter~0 34)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {9450#(< ~counter~0 35)} is VALID [2021-09-13 14:24:41,782 INFO L281 TraceCheckUtils]: 59: Hoare triple {9478#(< ~counter~0 34)} assume main_~a~0 > main_~b~0;main_~a~0 := main_~a~0 - main_~b~0;main_~p~0 := main_~p~0 - main_~q~0;main_~r~0 := main_~r~0 - main_~s~0; {9478#(< ~counter~0 34)} is VALID [2021-09-13 14:24:41,783 INFO L281 TraceCheckUtils]: 58: Hoare triple {9478#(< ~counter~0 34)} assume !!(main_~a~0 != main_~b~0); {9478#(< ~counter~0 34)} is VALID [2021-09-13 14:24:41,783 INFO L281 TraceCheckUtils]: 57: Hoare triple {9478#(< ~counter~0 34)} assume !(0 == __VERIFIER_assert_~cond); {9478#(< ~counter~0 34)} is VALID [2021-09-13 14:24:41,783 INFO L281 TraceCheckUtils]: 56: Hoare triple {9478#(< ~counter~0 34)} __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; {9478#(< ~counter~0 34)} is VALID [2021-09-13 14:24:41,783 INFO L281 TraceCheckUtils]: 55: Hoare triple {9478#(< ~counter~0 34)} assume !(0 == __VERIFIER_assert_~cond); {9478#(< ~counter~0 34)} is VALID [2021-09-13 14:24:41,784 INFO L281 TraceCheckUtils]: 54: Hoare triple {9478#(< ~counter~0 34)} __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; {9478#(< ~counter~0 34)} is VALID [2021-09-13 14:24:41,784 INFO L281 TraceCheckUtils]: 53: Hoare triple {9478#(< ~counter~0 34)} assume !(0 == __VERIFIER_assert_~cond); {9478#(< ~counter~0 34)} is VALID [2021-09-13 14:24:41,784 INFO L281 TraceCheckUtils]: 52: Hoare triple {9478#(< ~counter~0 34)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 1 == main_~p~0 * main_~s~0 - main_~r~0 * main_~q~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {9478#(< ~counter~0 34)} is VALID [2021-09-13 14:24:41,785 INFO L281 TraceCheckUtils]: 51: Hoare triple {9506#(< ~counter~0 33)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {9478#(< ~counter~0 34)} is VALID [2021-09-13 14:24:41,785 INFO L281 TraceCheckUtils]: 50: Hoare triple {9506#(< ~counter~0 33)} assume main_~a~0 > main_~b~0;main_~a~0 := main_~a~0 - main_~b~0;main_~p~0 := main_~p~0 - main_~q~0;main_~r~0 := main_~r~0 - main_~s~0; {9506#(< ~counter~0 33)} is VALID [2021-09-13 14:24:41,785 INFO L281 TraceCheckUtils]: 49: Hoare triple {9506#(< ~counter~0 33)} assume !!(main_~a~0 != main_~b~0); {9506#(< ~counter~0 33)} is VALID [2021-09-13 14:24:41,786 INFO L281 TraceCheckUtils]: 48: Hoare triple {9506#(< ~counter~0 33)} assume !(0 == __VERIFIER_assert_~cond); {9506#(< ~counter~0 33)} is VALID [2021-09-13 14:24:41,786 INFO L281 TraceCheckUtils]: 47: Hoare triple {9506#(< ~counter~0 33)} __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; {9506#(< ~counter~0 33)} is VALID [2021-09-13 14:24:41,786 INFO L281 TraceCheckUtils]: 46: Hoare triple {9506#(< ~counter~0 33)} assume !(0 == __VERIFIER_assert_~cond); {9506#(< ~counter~0 33)} is VALID [2021-09-13 14:24:41,786 INFO L281 TraceCheckUtils]: 45: Hoare triple {9506#(< ~counter~0 33)} __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; {9506#(< ~counter~0 33)} is VALID [2021-09-13 14:24:41,787 INFO L281 TraceCheckUtils]: 44: Hoare triple {9506#(< ~counter~0 33)} assume !(0 == __VERIFIER_assert_~cond); {9506#(< ~counter~0 33)} is VALID [2021-09-13 14:24:41,787 INFO L281 TraceCheckUtils]: 43: Hoare triple {9506#(< ~counter~0 33)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 1 == main_~p~0 * main_~s~0 - main_~r~0 * main_~q~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {9506#(< ~counter~0 33)} is VALID [2021-09-13 14:24:41,787 INFO L281 TraceCheckUtils]: 42: Hoare triple {9534#(< ~counter~0 32)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {9506#(< ~counter~0 33)} is VALID [2021-09-13 14:24:41,788 INFO L281 TraceCheckUtils]: 41: Hoare triple {9534#(< ~counter~0 32)} assume main_~a~0 > main_~b~0;main_~a~0 := main_~a~0 - main_~b~0;main_~p~0 := main_~p~0 - main_~q~0;main_~r~0 := main_~r~0 - main_~s~0; {9534#(< ~counter~0 32)} is VALID [2021-09-13 14:24:41,788 INFO L281 TraceCheckUtils]: 40: Hoare triple {9534#(< ~counter~0 32)} assume !!(main_~a~0 != main_~b~0); {9534#(< ~counter~0 32)} is VALID [2021-09-13 14:24:41,788 INFO L281 TraceCheckUtils]: 39: Hoare triple {9534#(< ~counter~0 32)} assume !(0 == __VERIFIER_assert_~cond); {9534#(< ~counter~0 32)} is VALID [2021-09-13 14:24:41,789 INFO L281 TraceCheckUtils]: 38: Hoare triple {9534#(< ~counter~0 32)} __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; {9534#(< ~counter~0 32)} is VALID [2021-09-13 14:24:41,789 INFO L281 TraceCheckUtils]: 37: Hoare triple {9534#(< ~counter~0 32)} assume !(0 == __VERIFIER_assert_~cond); {9534#(< ~counter~0 32)} is VALID [2021-09-13 14:24:41,789 INFO L281 TraceCheckUtils]: 36: Hoare triple {9534#(< ~counter~0 32)} __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; {9534#(< ~counter~0 32)} is VALID [2021-09-13 14:24:41,789 INFO L281 TraceCheckUtils]: 35: Hoare triple {9534#(< ~counter~0 32)} assume !(0 == __VERIFIER_assert_~cond); {9534#(< ~counter~0 32)} is VALID [2021-09-13 14:24:41,790 INFO L281 TraceCheckUtils]: 34: Hoare triple {9534#(< ~counter~0 32)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 1 == main_~p~0 * main_~s~0 - main_~r~0 * main_~q~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {9534#(< ~counter~0 32)} is VALID [2021-09-13 14:24:41,790 INFO L281 TraceCheckUtils]: 33: Hoare triple {9562#(< ~counter~0 31)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {9534#(< ~counter~0 32)} is VALID [2021-09-13 14:24:41,790 INFO L281 TraceCheckUtils]: 32: Hoare triple {9562#(< ~counter~0 31)} assume main_~a~0 > main_~b~0;main_~a~0 := main_~a~0 - main_~b~0;main_~p~0 := main_~p~0 - main_~q~0;main_~r~0 := main_~r~0 - main_~s~0; {9562#(< ~counter~0 31)} is VALID [2021-09-13 14:24:41,791 INFO L281 TraceCheckUtils]: 31: Hoare triple {9562#(< ~counter~0 31)} assume !!(main_~a~0 != main_~b~0); {9562#(< ~counter~0 31)} is VALID [2021-09-13 14:24:41,791 INFO L281 TraceCheckUtils]: 30: Hoare triple {9562#(< ~counter~0 31)} assume !(0 == __VERIFIER_assert_~cond); {9562#(< ~counter~0 31)} is VALID [2021-09-13 14:24:41,791 INFO L281 TraceCheckUtils]: 29: Hoare triple {9562#(< ~counter~0 31)} __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; {9562#(< ~counter~0 31)} is VALID [2021-09-13 14:24:41,791 INFO L281 TraceCheckUtils]: 28: Hoare triple {9562#(< ~counter~0 31)} assume !(0 == __VERIFIER_assert_~cond); {9562#(< ~counter~0 31)} is VALID [2021-09-13 14:24:41,792 INFO L281 TraceCheckUtils]: 27: Hoare triple {9562#(< ~counter~0 31)} __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; {9562#(< ~counter~0 31)} is VALID [2021-09-13 14:24:41,792 INFO L281 TraceCheckUtils]: 26: Hoare triple {9562#(< ~counter~0 31)} assume !(0 == __VERIFIER_assert_~cond); {9562#(< ~counter~0 31)} is VALID [2021-09-13 14:24:41,792 INFO L281 TraceCheckUtils]: 25: Hoare triple {9562#(< ~counter~0 31)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 1 == main_~p~0 * main_~s~0 - main_~r~0 * main_~q~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {9562#(< ~counter~0 31)} is VALID [2021-09-13 14:24:41,793 INFO L281 TraceCheckUtils]: 24: Hoare triple {9590#(< ~counter~0 30)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {9562#(< ~counter~0 31)} is VALID [2021-09-13 14:24:41,793 INFO L281 TraceCheckUtils]: 23: Hoare triple {9590#(< ~counter~0 30)} assume main_~a~0 > main_~b~0;main_~a~0 := main_~a~0 - main_~b~0;main_~p~0 := main_~p~0 - main_~q~0;main_~r~0 := main_~r~0 - main_~s~0; {9590#(< ~counter~0 30)} is VALID [2021-09-13 14:24:41,793 INFO L281 TraceCheckUtils]: 22: Hoare triple {9590#(< ~counter~0 30)} assume !!(main_~a~0 != main_~b~0); {9590#(< ~counter~0 30)} is VALID [2021-09-13 14:24:41,794 INFO L281 TraceCheckUtils]: 21: Hoare triple {9590#(< ~counter~0 30)} assume !(0 == __VERIFIER_assert_~cond); {9590#(< ~counter~0 30)} is VALID [2021-09-13 14:24:41,794 INFO L281 TraceCheckUtils]: 20: Hoare triple {9590#(< ~counter~0 30)} __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; {9590#(< ~counter~0 30)} is VALID [2021-09-13 14:24:41,794 INFO L281 TraceCheckUtils]: 19: Hoare triple {9590#(< ~counter~0 30)} assume !(0 == __VERIFIER_assert_~cond); {9590#(< ~counter~0 30)} is VALID [2021-09-13 14:24:41,794 INFO L281 TraceCheckUtils]: 18: Hoare triple {9590#(< ~counter~0 30)} __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; {9590#(< ~counter~0 30)} is VALID [2021-09-13 14:24:41,795 INFO L281 TraceCheckUtils]: 17: Hoare triple {9590#(< ~counter~0 30)} assume !(0 == __VERIFIER_assert_~cond); {9590#(< ~counter~0 30)} is VALID [2021-09-13 14:24:41,795 INFO L281 TraceCheckUtils]: 16: Hoare triple {9590#(< ~counter~0 30)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 1 == main_~p~0 * main_~s~0 - main_~r~0 * main_~q~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {9590#(< ~counter~0 30)} is VALID [2021-09-13 14:24:41,795 INFO L281 TraceCheckUtils]: 15: Hoare triple {9618#(< ~counter~0 29)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {9590#(< ~counter~0 30)} is VALID [2021-09-13 14:24:41,796 INFO L281 TraceCheckUtils]: 14: Hoare triple {9618#(< ~counter~0 29)} assume main_~a~0 > main_~b~0;main_~a~0 := main_~a~0 - main_~b~0;main_~p~0 := main_~p~0 - main_~q~0;main_~r~0 := main_~r~0 - main_~s~0; {9618#(< ~counter~0 29)} is VALID [2021-09-13 14:24:41,796 INFO L281 TraceCheckUtils]: 13: Hoare triple {9618#(< ~counter~0 29)} assume !!(main_~a~0 != main_~b~0); {9618#(< ~counter~0 29)} is VALID [2021-09-13 14:24:41,796 INFO L281 TraceCheckUtils]: 12: Hoare triple {9618#(< ~counter~0 29)} assume !(0 == __VERIFIER_assert_~cond); {9618#(< ~counter~0 29)} is VALID [2021-09-13 14:24:41,796 INFO L281 TraceCheckUtils]: 11: Hoare triple {9618#(< ~counter~0 29)} __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; {9618#(< ~counter~0 29)} is VALID [2021-09-13 14:24:41,797 INFO L281 TraceCheckUtils]: 10: Hoare triple {9618#(< ~counter~0 29)} assume !(0 == __VERIFIER_assert_~cond); {9618#(< ~counter~0 29)} is VALID [2021-09-13 14:24:41,797 INFO L281 TraceCheckUtils]: 9: Hoare triple {9618#(< ~counter~0 29)} __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; {9618#(< ~counter~0 29)} is VALID [2021-09-13 14:24:41,797 INFO L281 TraceCheckUtils]: 8: Hoare triple {9618#(< ~counter~0 29)} assume !(0 == __VERIFIER_assert_~cond); {9618#(< ~counter~0 29)} is VALID [2021-09-13 14:24:41,798 INFO L281 TraceCheckUtils]: 7: Hoare triple {9618#(< ~counter~0 29)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 1 == main_~p~0 * main_~s~0 - main_~r~0 * main_~q~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {9618#(< ~counter~0 29)} is VALID [2021-09-13 14:24:41,798 INFO L281 TraceCheckUtils]: 6: Hoare triple {9646#(< ~counter~0 28)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {9618#(< ~counter~0 29)} is VALID [2021-09-13 14:24:41,798 INFO L281 TraceCheckUtils]: 5: Hoare triple {9646#(< ~counter~0 28)} 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; {9646#(< ~counter~0 28)} is VALID [2021-09-13 14:24:41,798 INFO L281 TraceCheckUtils]: 4: Hoare triple {9646#(< ~counter~0 28)} assume !(0 == assume_abort_if_not_~cond); {9646#(< ~counter~0 28)} is VALID [2021-09-13 14:24:41,799 INFO L281 TraceCheckUtils]: 3: Hoare triple {9646#(< ~counter~0 28)} 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; {9646#(< ~counter~0 28)} is VALID [2021-09-13 14:24:41,799 INFO L281 TraceCheckUtils]: 2: Hoare triple {9646#(< ~counter~0 28)} assume !(0 == assume_abort_if_not_~cond); {9646#(< ~counter~0 28)} is VALID [2021-09-13 14:24:41,799 INFO L281 TraceCheckUtils]: 1: Hoare triple {9646#(< ~counter~0 28)} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~post9, main_~a~0, main_~b~0, main_~p~0, main_~q~0, main_~r~0, main_~s~0, main_~x~0, 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_~x~0;havoc main_~y~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; {9646#(< ~counter~0 28)} is VALID [2021-09-13 14:24:41,800 INFO L281 TraceCheckUtils]: 0: Hoare triple {8364#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(10);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~counter~0 := 0; {9646#(< ~counter~0 28)} is VALID [2021-09-13 14:24:41,801 INFO L134 CoverageAnalysis]: Checked inductivity of 2123 backedges. 0 proven. 2123 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:24:41,801 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:24:41,801 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040740738] [2021-09-13 14:24:41,801 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-09-13 14:24:41,801 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [912837176] [2021-09-13 14:24:41,802 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [912837176] provided 0 perfect and 2 imperfect interpolant sequences [2021-09-13 14:24:41,802 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-09-13 14:24:41,802 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 49 [2021-09-13 14:24:41,802 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092340518] [2021-09-13 14:24:41,803 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 8.3) internal successors, (415), 49 states have internal predecessors, (415), 0 states have call successors, (0), 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 209 [2021-09-13 14:24:41,803 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:24:41,803 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 50 states, 50 states have (on average 8.3) internal successors, (415), 49 states have internal predecessors, (415), 0 states have call successors, (0), 0 states have call 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,063 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 415 edges. 415 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:24:42,063 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2021-09-13 14:24:42,063 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:24:42,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2021-09-13 14:24:42,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1133, Invalid=1317, Unknown=0, NotChecked=0, Total=2450 [2021-09-13 14:24:42,065 INFO L87 Difference]: Start difference. First operand 214 states and 236 transitions. Second operand has 50 states, 50 states have (on average 8.3) internal successors, (415), 49 states have internal predecessors, (415), 0 states have call successors, (0), 0 states have call 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:44,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:24:44,507 INFO L93 Difference]: Finished difference Result 438 states and 507 transitions. [2021-09-13 14:24:44,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2021-09-13 14:24:44,507 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 8.3) internal successors, (415), 49 states have internal predecessors, (415), 0 states have call successors, (0), 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 209 [2021-09-13 14:24:44,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:24:44,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 50 states have (on average 8.3) internal successors, (415), 49 states have internal predecessors, (415), 0 states have call successors, (0), 0 states have call 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:44,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 507 transitions. [2021-09-13 14:24:44,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 50 states have (on average 8.3) internal successors, (415), 49 states have internal predecessors, (415), 0 states have call successors, (0), 0 states have call 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:44,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 507 transitions. [2021-09-13 14:24:44,516 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 94 states and 507 transitions. [2021-09-13 14:24:44,775 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 507 edges. 507 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:24:44,783 INFO L225 Difference]: With dead ends: 438 [2021-09-13 14:24:44,784 INFO L226 Difference]: Without dead ends: 430 [2021-09-13 14:24:44,785 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 461 GetRequests, 368 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1288 ImplicationChecksByTransitivity, 1581.95ms TimeCoverageRelationStatistics Valid=3316, Invalid=5614, Unknown=0, NotChecked=0, Total=8930 [2021-09-13 14:24:44,786 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 356 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 533 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 374.33ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 356 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 585 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.21ms SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 533 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 376.50ms IncrementalHoareTripleChecker+Time [2021-09-13 14:24:44,786 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [356 Valid, 0 Invalid, 585 Unknown, 0 Unchecked, 3.21ms Time], IncrementalHoareTripleChecker [52 Valid, 533 Invalid, 0 Unknown, 0 Unchecked, 376.50ms Time] [2021-09-13 14:24:44,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2021-09-13 14:24:45,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 430. [2021-09-13 14:24:45,666 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:24:45,666 INFO L82 GeneralOperation]: Start isEquivalent. First operand 430 states. Second operand has 430 states, 428 states have (on average 1.1121495327102804) internal successors, (476), 429 states have internal predecessors, (476), 0 states have call successors, (0), 0 states have call 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,667 INFO L74 IsIncluded]: Start isIncluded. First operand 430 states. Second operand has 430 states, 428 states have (on average 1.1121495327102804) internal successors, (476), 429 states have internal predecessors, (476), 0 states have call successors, (0), 0 states have call 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,667 INFO L87 Difference]: Start difference. First operand 430 states. Second operand has 430 states, 428 states have (on average 1.1121495327102804) internal successors, (476), 429 states have internal predecessors, (476), 0 states have call successors, (0), 0 states have call 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,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:24:45,674 INFO L93 Difference]: Finished difference Result 430 states and 476 transitions. [2021-09-13 14:24:45,674 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 476 transitions. [2021-09-13 14:24:45,675 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:24:45,675 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:24:45,675 INFO L74 IsIncluded]: Start isIncluded. First operand has 430 states, 428 states have (on average 1.1121495327102804) internal successors, (476), 429 states have internal predecessors, (476), 0 states have call successors, (0), 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 430 states. [2021-09-13 14:24:45,676 INFO L87 Difference]: Start difference. First operand has 430 states, 428 states have (on average 1.1121495327102804) internal successors, (476), 429 states have internal predecessors, (476), 0 states have call successors, (0), 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 430 states. [2021-09-13 14:24:45,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:24:45,683 INFO L93 Difference]: Finished difference Result 430 states and 476 transitions. [2021-09-13 14:24:45,683 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 476 transitions. [2021-09-13 14:24:45,683 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:24:45,683 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:24:45,684 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:24:45,684 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:24:45,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 430 states, 428 states have (on average 1.1121495327102804) internal successors, (476), 429 states have internal predecessors, (476), 0 states have call successors, (0), 0 states have call 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,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 476 transitions. [2021-09-13 14:24:45,692 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 476 transitions. Word has length 209 [2021-09-13 14:24:45,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:24:45,693 INFO L470 AbstractCegarLoop]: Abstraction has 430 states and 476 transitions. [2021-09-13 14:24:45,693 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 8.3) internal successors, (415), 49 states have internal predecessors, (415), 0 states have call successors, (0), 0 states have call 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,693 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 476 transitions. [2021-09-13 14:24:45,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 426 [2021-09-13 14:24:45,697 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:24:45,697 INFO L513 BasicCegarLoop]: trace histogram [47, 46, 46, 46, 46, 46, 46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 14:24:45,717 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:24:45,915 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,SelfDestructingSolverStorable13 [2021-09-13 14:24:45,915 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-09-13 14:24:45,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:24:45,915 INFO L82 PathProgramCache]: Analyzing trace with hash -427380159, now seen corresponding path program 5 times [2021-09-13 14:24:45,915 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:24:45,915 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669728926] [2021-09-13 14:24:45,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:24:45,916 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:24:45,927 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-09-13 14:24:45,927 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1063592823] [2021-09-13 14:24:45,927 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-09-13 14:24:45,927 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:24:45,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:24:45,928 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:24:45,929 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:25:54,195 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2021-09-13 14:25:54,196 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-09-13 14:25:54,235 INFO L263 TraceCheckSpWp]: Trace formula consists of 1363 conjuncts, 95 conjunts are in the unsatisfiable core [2021-09-13 14:25:54,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:25:54,326 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:25:57,137 INFO L281 TraceCheckUtils]: 0: Hoare triple {11855#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(10);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~counter~0 := 0; {11860#(<= ~counter~0 0)} is VALID [2021-09-13 14:25:57,137 INFO L281 TraceCheckUtils]: 1: Hoare triple {11860#(<= ~counter~0 0)} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~post9, main_~a~0, main_~b~0, main_~p~0, main_~q~0, main_~r~0, main_~s~0, main_~x~0, 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_~x~0;havoc main_~y~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; {11860#(<= ~counter~0 0)} is VALID [2021-09-13 14:25:57,138 INFO L281 TraceCheckUtils]: 2: Hoare triple {11860#(<= ~counter~0 0)} assume !(0 == assume_abort_if_not_~cond); {11860#(<= ~counter~0 0)} is VALID [2021-09-13 14:25:57,138 INFO L281 TraceCheckUtils]: 3: Hoare triple {11860#(<= ~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; {11860#(<= ~counter~0 0)} is VALID [2021-09-13 14:25:57,138 INFO L281 TraceCheckUtils]: 4: Hoare triple {11860#(<= ~counter~0 0)} assume !(0 == assume_abort_if_not_~cond); {11860#(<= ~counter~0 0)} is VALID [2021-09-13 14:25:57,138 INFO L281 TraceCheckUtils]: 5: Hoare triple {11860#(<= ~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; {11860#(<= ~counter~0 0)} is VALID [2021-09-13 14:25:57,139 INFO L281 TraceCheckUtils]: 6: Hoare triple {11860#(<= ~counter~0 0)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {11879#(<= ~counter~0 1)} is VALID [2021-09-13 14:25:57,139 INFO L281 TraceCheckUtils]: 7: Hoare triple {11879#(<= ~counter~0 1)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 1 == main_~p~0 * main_~s~0 - main_~r~0 * main_~q~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {11879#(<= ~counter~0 1)} is VALID [2021-09-13 14:25:57,140 INFO L281 TraceCheckUtils]: 8: Hoare triple {11879#(<= ~counter~0 1)} assume !(0 == __VERIFIER_assert_~cond); {11879#(<= ~counter~0 1)} is VALID [2021-09-13 14:25:57,140 INFO L281 TraceCheckUtils]: 9: Hoare triple {11879#(<= ~counter~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; {11879#(<= ~counter~0 1)} is VALID [2021-09-13 14:25:57,140 INFO L281 TraceCheckUtils]: 10: Hoare triple {11879#(<= ~counter~0 1)} assume !(0 == __VERIFIER_assert_~cond); {11879#(<= ~counter~0 1)} is VALID [2021-09-13 14:25:57,140 INFO L281 TraceCheckUtils]: 11: Hoare triple {11879#(<= ~counter~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; {11879#(<= ~counter~0 1)} is VALID [2021-09-13 14:25:57,140 INFO L281 TraceCheckUtils]: 12: Hoare triple {11879#(<= ~counter~0 1)} assume !(0 == __VERIFIER_assert_~cond); {11879#(<= ~counter~0 1)} is VALID [2021-09-13 14:25:57,141 INFO L281 TraceCheckUtils]: 13: Hoare triple {11879#(<= ~counter~0 1)} assume !!(main_~a~0 != main_~b~0); {11879#(<= ~counter~0 1)} is VALID [2021-09-13 14:25:57,141 INFO L281 TraceCheckUtils]: 14: Hoare triple {11879#(<= ~counter~0 1)} assume main_~a~0 > main_~b~0;main_~a~0 := main_~a~0 - main_~b~0;main_~p~0 := main_~p~0 - main_~q~0;main_~r~0 := main_~r~0 - main_~s~0; {11879#(<= ~counter~0 1)} is VALID [2021-09-13 14:25:57,141 INFO L281 TraceCheckUtils]: 15: Hoare triple {11879#(<= ~counter~0 1)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {11907#(<= ~counter~0 2)} is VALID [2021-09-13 14:25:57,142 INFO L281 TraceCheckUtils]: 16: Hoare triple {11907#(<= ~counter~0 2)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 1 == main_~p~0 * main_~s~0 - main_~r~0 * main_~q~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {11907#(<= ~counter~0 2)} is VALID [2021-09-13 14:25:57,142 INFO L281 TraceCheckUtils]: 17: Hoare triple {11907#(<= ~counter~0 2)} assume !(0 == __VERIFIER_assert_~cond); {11907#(<= ~counter~0 2)} is VALID [2021-09-13 14:25:57,142 INFO L281 TraceCheckUtils]: 18: Hoare triple {11907#(<= ~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; {11907#(<= ~counter~0 2)} is VALID [2021-09-13 14:25:57,142 INFO L281 TraceCheckUtils]: 19: Hoare triple {11907#(<= ~counter~0 2)} assume !(0 == __VERIFIER_assert_~cond); {11907#(<= ~counter~0 2)} is VALID [2021-09-13 14:25:57,142 INFO L281 TraceCheckUtils]: 20: Hoare triple {11907#(<= ~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; {11907#(<= ~counter~0 2)} is VALID [2021-09-13 14:25:57,143 INFO L281 TraceCheckUtils]: 21: Hoare triple {11907#(<= ~counter~0 2)} assume !(0 == __VERIFIER_assert_~cond); {11907#(<= ~counter~0 2)} is VALID [2021-09-13 14:25:57,143 INFO L281 TraceCheckUtils]: 22: Hoare triple {11907#(<= ~counter~0 2)} assume !!(main_~a~0 != main_~b~0); {11907#(<= ~counter~0 2)} is VALID [2021-09-13 14:25:57,143 INFO L281 TraceCheckUtils]: 23: Hoare triple {11907#(<= ~counter~0 2)} assume main_~a~0 > main_~b~0;main_~a~0 := main_~a~0 - main_~b~0;main_~p~0 := main_~p~0 - main_~q~0;main_~r~0 := main_~r~0 - main_~s~0; {11907#(<= ~counter~0 2)} is VALID [2021-09-13 14:25:57,143 INFO L281 TraceCheckUtils]: 24: Hoare triple {11907#(<= ~counter~0 2)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {11935#(<= ~counter~0 3)} is VALID [2021-09-13 14:25:57,144 INFO L281 TraceCheckUtils]: 25: Hoare triple {11935#(<= ~counter~0 3)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 1 == main_~p~0 * main_~s~0 - main_~r~0 * main_~q~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {11935#(<= ~counter~0 3)} is VALID [2021-09-13 14:25:57,144 INFO L281 TraceCheckUtils]: 26: Hoare triple {11935#(<= ~counter~0 3)} assume !(0 == __VERIFIER_assert_~cond); {11935#(<= ~counter~0 3)} is VALID [2021-09-13 14:25:57,144 INFO L281 TraceCheckUtils]: 27: Hoare triple {11935#(<= ~counter~0 3)} __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; {11935#(<= ~counter~0 3)} is VALID [2021-09-13 14:25:57,144 INFO L281 TraceCheckUtils]: 28: Hoare triple {11935#(<= ~counter~0 3)} assume !(0 == __VERIFIER_assert_~cond); {11935#(<= ~counter~0 3)} is VALID [2021-09-13 14:25:57,144 INFO L281 TraceCheckUtils]: 29: Hoare triple {11935#(<= ~counter~0 3)} __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; {11935#(<= ~counter~0 3)} is VALID [2021-09-13 14:25:57,145 INFO L281 TraceCheckUtils]: 30: Hoare triple {11935#(<= ~counter~0 3)} assume !(0 == __VERIFIER_assert_~cond); {11935#(<= ~counter~0 3)} is VALID [2021-09-13 14:25:57,145 INFO L281 TraceCheckUtils]: 31: Hoare triple {11935#(<= ~counter~0 3)} assume !!(main_~a~0 != main_~b~0); {11935#(<= ~counter~0 3)} is VALID [2021-09-13 14:25:57,145 INFO L281 TraceCheckUtils]: 32: Hoare triple {11935#(<= ~counter~0 3)} assume main_~a~0 > main_~b~0;main_~a~0 := main_~a~0 - main_~b~0;main_~p~0 := main_~p~0 - main_~q~0;main_~r~0 := main_~r~0 - main_~s~0; {11935#(<= ~counter~0 3)} is VALID [2021-09-13 14:25:57,146 INFO L281 TraceCheckUtils]: 33: Hoare triple {11935#(<= ~counter~0 3)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {11963#(<= ~counter~0 4)} is VALID [2021-09-13 14:25:57,146 INFO L281 TraceCheckUtils]: 34: Hoare triple {11963#(<= ~counter~0 4)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 1 == main_~p~0 * main_~s~0 - main_~r~0 * main_~q~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {11963#(<= ~counter~0 4)} is VALID [2021-09-13 14:25:57,146 INFO L281 TraceCheckUtils]: 35: Hoare triple {11963#(<= ~counter~0 4)} assume !(0 == __VERIFIER_assert_~cond); {11963#(<= ~counter~0 4)} is VALID [2021-09-13 14:25:57,146 INFO L281 TraceCheckUtils]: 36: Hoare triple {11963#(<= ~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; {11963#(<= ~counter~0 4)} is VALID [2021-09-13 14:25:57,146 INFO L281 TraceCheckUtils]: 37: Hoare triple {11963#(<= ~counter~0 4)} assume !(0 == __VERIFIER_assert_~cond); {11963#(<= ~counter~0 4)} is VALID [2021-09-13 14:25:57,147 INFO L281 TraceCheckUtils]: 38: Hoare triple {11963#(<= ~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; {11963#(<= ~counter~0 4)} is VALID [2021-09-13 14:25:57,147 INFO L281 TraceCheckUtils]: 39: Hoare triple {11963#(<= ~counter~0 4)} assume !(0 == __VERIFIER_assert_~cond); {11963#(<= ~counter~0 4)} is VALID [2021-09-13 14:25:57,147 INFO L281 TraceCheckUtils]: 40: Hoare triple {11963#(<= ~counter~0 4)} assume !!(main_~a~0 != main_~b~0); {11963#(<= ~counter~0 4)} is VALID [2021-09-13 14:25:57,147 INFO L281 TraceCheckUtils]: 41: Hoare triple {11963#(<= ~counter~0 4)} assume main_~a~0 > main_~b~0;main_~a~0 := main_~a~0 - main_~b~0;main_~p~0 := main_~p~0 - main_~q~0;main_~r~0 := main_~r~0 - main_~s~0; {11963#(<= ~counter~0 4)} is VALID [2021-09-13 14:25:57,148 INFO L281 TraceCheckUtils]: 42: Hoare triple {11963#(<= ~counter~0 4)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {11991#(<= ~counter~0 5)} is VALID [2021-09-13 14:25:57,148 INFO L281 TraceCheckUtils]: 43: Hoare triple {11991#(<= ~counter~0 5)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 1 == main_~p~0 * main_~s~0 - main_~r~0 * main_~q~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {11991#(<= ~counter~0 5)} is VALID [2021-09-13 14:25:57,148 INFO L281 TraceCheckUtils]: 44: Hoare triple {11991#(<= ~counter~0 5)} assume !(0 == __VERIFIER_assert_~cond); {11991#(<= ~counter~0 5)} is VALID [2021-09-13 14:25:57,148 INFO L281 TraceCheckUtils]: 45: Hoare triple {11991#(<= ~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; {11991#(<= ~counter~0 5)} is VALID [2021-09-13 14:25:57,148 INFO L281 TraceCheckUtils]: 46: Hoare triple {11991#(<= ~counter~0 5)} assume !(0 == __VERIFIER_assert_~cond); {11991#(<= ~counter~0 5)} is VALID [2021-09-13 14:25:57,149 INFO L281 TraceCheckUtils]: 47: Hoare triple {11991#(<= ~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; {11991#(<= ~counter~0 5)} is VALID [2021-09-13 14:25:57,149 INFO L281 TraceCheckUtils]: 48: Hoare triple {11991#(<= ~counter~0 5)} assume !(0 == __VERIFIER_assert_~cond); {11991#(<= ~counter~0 5)} is VALID [2021-09-13 14:25:57,149 INFO L281 TraceCheckUtils]: 49: Hoare triple {11991#(<= ~counter~0 5)} assume !!(main_~a~0 != main_~b~0); {11991#(<= ~counter~0 5)} is VALID [2021-09-13 14:25:57,149 INFO L281 TraceCheckUtils]: 50: Hoare triple {11991#(<= ~counter~0 5)} assume main_~a~0 > main_~b~0;main_~a~0 := main_~a~0 - main_~b~0;main_~p~0 := main_~p~0 - main_~q~0;main_~r~0 := main_~r~0 - main_~s~0; {11991#(<= ~counter~0 5)} is VALID [2021-09-13 14:25:57,150 INFO L281 TraceCheckUtils]: 51: Hoare triple {11991#(<= ~counter~0 5)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {12019#(<= ~counter~0 6)} is VALID [2021-09-13 14:25:57,150 INFO L281 TraceCheckUtils]: 52: Hoare triple {12019#(<= ~counter~0 6)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 1 == main_~p~0 * main_~s~0 - main_~r~0 * main_~q~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {12019#(<= ~counter~0 6)} is VALID [2021-09-13 14:25:57,150 INFO L281 TraceCheckUtils]: 53: Hoare triple {12019#(<= ~counter~0 6)} assume !(0 == __VERIFIER_assert_~cond); {12019#(<= ~counter~0 6)} is VALID [2021-09-13 14:25:57,150 INFO L281 TraceCheckUtils]: 54: Hoare triple {12019#(<= ~counter~0 6)} __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; {12019#(<= ~counter~0 6)} is VALID [2021-09-13 14:25:57,150 INFO L281 TraceCheckUtils]: 55: Hoare triple {12019#(<= ~counter~0 6)} assume !(0 == __VERIFIER_assert_~cond); {12019#(<= ~counter~0 6)} is VALID [2021-09-13 14:25:57,151 INFO L281 TraceCheckUtils]: 56: Hoare triple {12019#(<= ~counter~0 6)} __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; {12019#(<= ~counter~0 6)} is VALID [2021-09-13 14:25:57,151 INFO L281 TraceCheckUtils]: 57: Hoare triple {12019#(<= ~counter~0 6)} assume !(0 == __VERIFIER_assert_~cond); {12019#(<= ~counter~0 6)} is VALID [2021-09-13 14:25:57,151 INFO L281 TraceCheckUtils]: 58: Hoare triple {12019#(<= ~counter~0 6)} assume !!(main_~a~0 != main_~b~0); {12019#(<= ~counter~0 6)} is VALID [2021-09-13 14:25:57,151 INFO L281 TraceCheckUtils]: 59: Hoare triple {12019#(<= ~counter~0 6)} assume main_~a~0 > main_~b~0;main_~a~0 := main_~a~0 - main_~b~0;main_~p~0 := main_~p~0 - main_~q~0;main_~r~0 := main_~r~0 - main_~s~0; {12019#(<= ~counter~0 6)} is VALID [2021-09-13 14:25:57,152 INFO L281 TraceCheckUtils]: 60: Hoare triple {12019#(<= ~counter~0 6)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {12047#(<= ~counter~0 7)} is VALID [2021-09-13 14:25:57,152 INFO L281 TraceCheckUtils]: 61: Hoare triple {12047#(<= ~counter~0 7)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 1 == main_~p~0 * main_~s~0 - main_~r~0 * main_~q~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {12047#(<= ~counter~0 7)} is VALID [2021-09-13 14:25:57,152 INFO L281 TraceCheckUtils]: 62: Hoare triple {12047#(<= ~counter~0 7)} assume !(0 == __VERIFIER_assert_~cond); {12047#(<= ~counter~0 7)} is VALID [2021-09-13 14:25:57,152 INFO L281 TraceCheckUtils]: 63: Hoare triple {12047#(<= ~counter~0 7)} __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; {12047#(<= ~counter~0 7)} is VALID [2021-09-13 14:25:57,152 INFO L281 TraceCheckUtils]: 64: Hoare triple {12047#(<= ~counter~0 7)} assume !(0 == __VERIFIER_assert_~cond); {12047#(<= ~counter~0 7)} is VALID [2021-09-13 14:25:57,153 INFO L281 TraceCheckUtils]: 65: Hoare triple {12047#(<= ~counter~0 7)} __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; {12047#(<= ~counter~0 7)} is VALID [2021-09-13 14:25:57,153 INFO L281 TraceCheckUtils]: 66: Hoare triple {12047#(<= ~counter~0 7)} assume !(0 == __VERIFIER_assert_~cond); {12047#(<= ~counter~0 7)} is VALID [2021-09-13 14:25:57,153 INFO L281 TraceCheckUtils]: 67: Hoare triple {12047#(<= ~counter~0 7)} assume !!(main_~a~0 != main_~b~0); {12047#(<= ~counter~0 7)} is VALID [2021-09-13 14:25:57,153 INFO L281 TraceCheckUtils]: 68: Hoare triple {12047#(<= ~counter~0 7)} assume main_~a~0 > main_~b~0;main_~a~0 := main_~a~0 - main_~b~0;main_~p~0 := main_~p~0 - main_~q~0;main_~r~0 := main_~r~0 - main_~s~0; {12047#(<= ~counter~0 7)} is VALID [2021-09-13 14:25:57,154 INFO L281 TraceCheckUtils]: 69: Hoare triple {12047#(<= ~counter~0 7)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {12075#(<= ~counter~0 8)} is VALID [2021-09-13 14:25:57,154 INFO L281 TraceCheckUtils]: 70: Hoare triple {12075#(<= ~counter~0 8)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 1 == main_~p~0 * main_~s~0 - main_~r~0 * main_~q~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {12075#(<= ~counter~0 8)} is VALID [2021-09-13 14:25:57,154 INFO L281 TraceCheckUtils]: 71: Hoare triple {12075#(<= ~counter~0 8)} assume !(0 == __VERIFIER_assert_~cond); {12075#(<= ~counter~0 8)} is VALID [2021-09-13 14:25:57,154 INFO L281 TraceCheckUtils]: 72: Hoare triple {12075#(<= ~counter~0 8)} __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; {12075#(<= ~counter~0 8)} is VALID [2021-09-13 14:25:57,154 INFO L281 TraceCheckUtils]: 73: Hoare triple {12075#(<= ~counter~0 8)} assume !(0 == __VERIFIER_assert_~cond); {12075#(<= ~counter~0 8)} is VALID [2021-09-13 14:25:57,155 INFO L281 TraceCheckUtils]: 74: Hoare triple {12075#(<= ~counter~0 8)} __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; {12075#(<= ~counter~0 8)} is VALID [2021-09-13 14:25:57,155 INFO L281 TraceCheckUtils]: 75: Hoare triple {12075#(<= ~counter~0 8)} assume !(0 == __VERIFIER_assert_~cond); {12075#(<= ~counter~0 8)} is VALID [2021-09-13 14:25:57,155 INFO L281 TraceCheckUtils]: 76: Hoare triple {12075#(<= ~counter~0 8)} assume !!(main_~a~0 != main_~b~0); {12075#(<= ~counter~0 8)} is VALID [2021-09-13 14:25:57,155 INFO L281 TraceCheckUtils]: 77: Hoare triple {12075#(<= ~counter~0 8)} assume main_~a~0 > main_~b~0;main_~a~0 := main_~a~0 - main_~b~0;main_~p~0 := main_~p~0 - main_~q~0;main_~r~0 := main_~r~0 - main_~s~0; {12075#(<= ~counter~0 8)} is VALID [2021-09-13 14:25:57,156 INFO L281 TraceCheckUtils]: 78: Hoare triple {12075#(<= ~counter~0 8)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {12103#(<= ~counter~0 9)} is VALID [2021-09-13 14:25:57,156 INFO L281 TraceCheckUtils]: 79: Hoare triple {12103#(<= ~counter~0 9)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 1 == main_~p~0 * main_~s~0 - main_~r~0 * main_~q~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {12103#(<= ~counter~0 9)} is VALID [2021-09-13 14:25:57,156 INFO L281 TraceCheckUtils]: 80: Hoare triple {12103#(<= ~counter~0 9)} assume !(0 == __VERIFIER_assert_~cond); {12103#(<= ~counter~0 9)} is VALID [2021-09-13 14:25:57,156 INFO L281 TraceCheckUtils]: 81: Hoare triple {12103#(<= ~counter~0 9)} __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; {12103#(<= ~counter~0 9)} is VALID [2021-09-13 14:25:57,157 INFO L281 TraceCheckUtils]: 82: Hoare triple {12103#(<= ~counter~0 9)} assume !(0 == __VERIFIER_assert_~cond); {12103#(<= ~counter~0 9)} is VALID [2021-09-13 14:25:57,157 INFO L281 TraceCheckUtils]: 83: Hoare triple {12103#(<= ~counter~0 9)} __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; {12103#(<= ~counter~0 9)} is VALID [2021-09-13 14:25:57,157 INFO L281 TraceCheckUtils]: 84: Hoare triple {12103#(<= ~counter~0 9)} assume !(0 == __VERIFIER_assert_~cond); {12103#(<= ~counter~0 9)} is VALID [2021-09-13 14:25:57,157 INFO L281 TraceCheckUtils]: 85: Hoare triple {12103#(<= ~counter~0 9)} assume !!(main_~a~0 != main_~b~0); {12103#(<= ~counter~0 9)} is VALID [2021-09-13 14:25:57,157 INFO L281 TraceCheckUtils]: 86: Hoare triple {12103#(<= ~counter~0 9)} assume main_~a~0 > main_~b~0;main_~a~0 := main_~a~0 - main_~b~0;main_~p~0 := main_~p~0 - main_~q~0;main_~r~0 := main_~r~0 - main_~s~0; {12103#(<= ~counter~0 9)} is VALID [2021-09-13 14:25:57,158 INFO L281 TraceCheckUtils]: 87: Hoare triple {12103#(<= ~counter~0 9)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {12131#(<= ~counter~0 10)} is VALID [2021-09-13 14:25:57,158 INFO L281 TraceCheckUtils]: 88: Hoare triple {12131#(<= ~counter~0 10)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 1 == main_~p~0 * main_~s~0 - main_~r~0 * main_~q~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {12131#(<= ~counter~0 10)} is VALID [2021-09-13 14:25:57,158 INFO L281 TraceCheckUtils]: 89: Hoare triple {12131#(<= ~counter~0 10)} assume !(0 == __VERIFIER_assert_~cond); {12131#(<= ~counter~0 10)} is VALID [2021-09-13 14:25:57,158 INFO L281 TraceCheckUtils]: 90: Hoare triple {12131#(<= ~counter~0 10)} __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; {12131#(<= ~counter~0 10)} is VALID [2021-09-13 14:25:57,159 INFO L281 TraceCheckUtils]: 91: Hoare triple {12131#(<= ~counter~0 10)} assume !(0 == __VERIFIER_assert_~cond); {12131#(<= ~counter~0 10)} is VALID [2021-09-13 14:25:57,159 INFO L281 TraceCheckUtils]: 92: Hoare triple {12131#(<= ~counter~0 10)} __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; {12131#(<= ~counter~0 10)} is VALID [2021-09-13 14:25:57,159 INFO L281 TraceCheckUtils]: 93: Hoare triple {12131#(<= ~counter~0 10)} assume !(0 == __VERIFIER_assert_~cond); {12131#(<= ~counter~0 10)} is VALID [2021-09-13 14:25:57,159 INFO L281 TraceCheckUtils]: 94: Hoare triple {12131#(<= ~counter~0 10)} assume !!(main_~a~0 != main_~b~0); {12131#(<= ~counter~0 10)} is VALID [2021-09-13 14:25:57,159 INFO L281 TraceCheckUtils]: 95: Hoare triple {12131#(<= ~counter~0 10)} assume main_~a~0 > main_~b~0;main_~a~0 := main_~a~0 - main_~b~0;main_~p~0 := main_~p~0 - main_~q~0;main_~r~0 := main_~r~0 - main_~s~0; {12131#(<= ~counter~0 10)} is VALID [2021-09-13 14:25:57,160 INFO L281 TraceCheckUtils]: 96: Hoare triple {12131#(<= ~counter~0 10)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {12159#(<= ~counter~0 11)} is VALID [2021-09-13 14:25:57,160 INFO L281 TraceCheckUtils]: 97: Hoare triple {12159#(<= ~counter~0 11)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 1 == main_~p~0 * main_~s~0 - main_~r~0 * main_~q~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {12159#(<= ~counter~0 11)} is VALID [2021-09-13 14:25:57,160 INFO L281 TraceCheckUtils]: 98: Hoare triple {12159#(<= ~counter~0 11)} assume !(0 == __VERIFIER_assert_~cond); {12159#(<= ~counter~0 11)} is VALID [2021-09-13 14:25:57,160 INFO L281 TraceCheckUtils]: 99: Hoare triple {12159#(<= ~counter~0 11)} __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; {12159#(<= ~counter~0 11)} is VALID [2021-09-13 14:25:57,161 INFO L281 TraceCheckUtils]: 100: Hoare triple {12159#(<= ~counter~0 11)} assume !(0 == __VERIFIER_assert_~cond); {12159#(<= ~counter~0 11)} is VALID [2021-09-13 14:25:57,161 INFO L281 TraceCheckUtils]: 101: Hoare triple {12159#(<= ~counter~0 11)} __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; {12159#(<= ~counter~0 11)} is VALID [2021-09-13 14:25:57,161 INFO L281 TraceCheckUtils]: 102: Hoare triple {12159#(<= ~counter~0 11)} assume !(0 == __VERIFIER_assert_~cond); {12159#(<= ~counter~0 11)} is VALID [2021-09-13 14:25:57,161 INFO L281 TraceCheckUtils]: 103: Hoare triple {12159#(<= ~counter~0 11)} assume !!(main_~a~0 != main_~b~0); {12159#(<= ~counter~0 11)} is VALID [2021-09-13 14:25:57,161 INFO L281 TraceCheckUtils]: 104: Hoare triple {12159#(<= ~counter~0 11)} assume main_~a~0 > main_~b~0;main_~a~0 := main_~a~0 - main_~b~0;main_~p~0 := main_~p~0 - main_~q~0;main_~r~0 := main_~r~0 - main_~s~0; {12159#(<= ~counter~0 11)} is VALID [2021-09-13 14:25:57,162 INFO L281 TraceCheckUtils]: 105: Hoare triple {12159#(<= ~counter~0 11)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {12187#(<= ~counter~0 12)} is VALID [2021-09-13 14:25:57,162 INFO L281 TraceCheckUtils]: 106: Hoare triple {12187#(<= ~counter~0 12)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 1 == main_~p~0 * main_~s~0 - main_~r~0 * main_~q~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {12187#(<= ~counter~0 12)} is VALID [2021-09-13 14:25:57,162 INFO L281 TraceCheckUtils]: 107: Hoare triple {12187#(<= ~counter~0 12)} assume !(0 == __VERIFIER_assert_~cond); {12187#(<= ~counter~0 12)} is VALID [2021-09-13 14:25:57,162 INFO L281 TraceCheckUtils]: 108: Hoare triple {12187#(<= ~counter~0 12)} __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; {12187#(<= ~counter~0 12)} is VALID [2021-09-13 14:25:57,163 INFO L281 TraceCheckUtils]: 109: Hoare triple {12187#(<= ~counter~0 12)} assume !(0 == __VERIFIER_assert_~cond); {12187#(<= ~counter~0 12)} is VALID [2021-09-13 14:25:57,163 INFO L281 TraceCheckUtils]: 110: Hoare triple {12187#(<= ~counter~0 12)} __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; {12187#(<= ~counter~0 12)} is VALID [2021-09-13 14:25:57,163 INFO L281 TraceCheckUtils]: 111: Hoare triple {12187#(<= ~counter~0 12)} assume !(0 == __VERIFIER_assert_~cond); {12187#(<= ~counter~0 12)} is VALID [2021-09-13 14:25:57,163 INFO L281 TraceCheckUtils]: 112: Hoare triple {12187#(<= ~counter~0 12)} assume !!(main_~a~0 != main_~b~0); {12187#(<= ~counter~0 12)} is VALID [2021-09-13 14:25:57,163 INFO L281 TraceCheckUtils]: 113: Hoare triple {12187#(<= ~counter~0 12)} assume main_~a~0 > main_~b~0;main_~a~0 := main_~a~0 - main_~b~0;main_~p~0 := main_~p~0 - main_~q~0;main_~r~0 := main_~r~0 - main_~s~0; {12187#(<= ~counter~0 12)} is VALID [2021-09-13 14:25:57,164 INFO L281 TraceCheckUtils]: 114: Hoare triple {12187#(<= ~counter~0 12)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {12215#(<= ~counter~0 13)} is VALID [2021-09-13 14:25:57,164 INFO L281 TraceCheckUtils]: 115: Hoare triple {12215#(<= ~counter~0 13)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 1 == main_~p~0 * main_~s~0 - main_~r~0 * main_~q~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {12215#(<= ~counter~0 13)} is VALID [2021-09-13 14:25:57,164 INFO L281 TraceCheckUtils]: 116: Hoare triple {12215#(<= ~counter~0 13)} assume !(0 == __VERIFIER_assert_~cond); {12215#(<= ~counter~0 13)} is VALID [2021-09-13 14:25:57,164 INFO L281 TraceCheckUtils]: 117: Hoare triple {12215#(<= ~counter~0 13)} __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; {12215#(<= ~counter~0 13)} is VALID [2021-09-13 14:25:57,165 INFO L281 TraceCheckUtils]: 118: Hoare triple {12215#(<= ~counter~0 13)} assume !(0 == __VERIFIER_assert_~cond); {12215#(<= ~counter~0 13)} is VALID [2021-09-13 14:25:57,165 INFO L281 TraceCheckUtils]: 119: Hoare triple {12215#(<= ~counter~0 13)} __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; {12215#(<= ~counter~0 13)} is VALID [2021-09-13 14:25:57,165 INFO L281 TraceCheckUtils]: 120: Hoare triple {12215#(<= ~counter~0 13)} assume !(0 == __VERIFIER_assert_~cond); {12215#(<= ~counter~0 13)} is VALID [2021-09-13 14:25:57,165 INFO L281 TraceCheckUtils]: 121: Hoare triple {12215#(<= ~counter~0 13)} assume !!(main_~a~0 != main_~b~0); {12215#(<= ~counter~0 13)} is VALID [2021-09-13 14:25:57,165 INFO L281 TraceCheckUtils]: 122: Hoare triple {12215#(<= ~counter~0 13)} assume main_~a~0 > main_~b~0;main_~a~0 := main_~a~0 - main_~b~0;main_~p~0 := main_~p~0 - main_~q~0;main_~r~0 := main_~r~0 - main_~s~0; {12215#(<= ~counter~0 13)} is VALID [2021-09-13 14:25:57,166 INFO L281 TraceCheckUtils]: 123: Hoare triple {12215#(<= ~counter~0 13)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {12243#(<= ~counter~0 14)} is VALID [2021-09-13 14:25:57,166 INFO L281 TraceCheckUtils]: 124: Hoare triple {12243#(<= ~counter~0 14)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 1 == main_~p~0 * main_~s~0 - main_~r~0 * main_~q~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {12243#(<= ~counter~0 14)} is VALID [2021-09-13 14:25:57,166 INFO L281 TraceCheckUtils]: 125: Hoare triple {12243#(<= ~counter~0 14)} assume !(0 == __VERIFIER_assert_~cond); {12243#(<= ~counter~0 14)} is VALID [2021-09-13 14:25:57,166 INFO L281 TraceCheckUtils]: 126: Hoare triple {12243#(<= ~counter~0 14)} __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; {12243#(<= ~counter~0 14)} is VALID [2021-09-13 14:25:57,167 INFO L281 TraceCheckUtils]: 127: Hoare triple {12243#(<= ~counter~0 14)} assume !(0 == __VERIFIER_assert_~cond); {12243#(<= ~counter~0 14)} is VALID [2021-09-13 14:25:57,167 INFO L281 TraceCheckUtils]: 128: Hoare triple {12243#(<= ~counter~0 14)} __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; {12243#(<= ~counter~0 14)} is VALID [2021-09-13 14:25:57,167 INFO L281 TraceCheckUtils]: 129: Hoare triple {12243#(<= ~counter~0 14)} assume !(0 == __VERIFIER_assert_~cond); {12243#(<= ~counter~0 14)} is VALID [2021-09-13 14:25:57,167 INFO L281 TraceCheckUtils]: 130: Hoare triple {12243#(<= ~counter~0 14)} assume !!(main_~a~0 != main_~b~0); {12243#(<= ~counter~0 14)} is VALID [2021-09-13 14:25:57,167 INFO L281 TraceCheckUtils]: 131: Hoare triple {12243#(<= ~counter~0 14)} assume main_~a~0 > main_~b~0;main_~a~0 := main_~a~0 - main_~b~0;main_~p~0 := main_~p~0 - main_~q~0;main_~r~0 := main_~r~0 - main_~s~0; {12243#(<= ~counter~0 14)} is VALID [2021-09-13 14:25:57,168 INFO L281 TraceCheckUtils]: 132: Hoare triple {12243#(<= ~counter~0 14)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {12271#(<= ~counter~0 15)} is VALID [2021-09-13 14:25:57,168 INFO L281 TraceCheckUtils]: 133: Hoare triple {12271#(<= ~counter~0 15)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 1 == main_~p~0 * main_~s~0 - main_~r~0 * main_~q~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {12271#(<= ~counter~0 15)} is VALID [2021-09-13 14:25:57,168 INFO L281 TraceCheckUtils]: 134: Hoare triple {12271#(<= ~counter~0 15)} assume !(0 == __VERIFIER_assert_~cond); {12271#(<= ~counter~0 15)} is VALID [2021-09-13 14:25:57,168 INFO L281 TraceCheckUtils]: 135: Hoare triple {12271#(<= ~counter~0 15)} __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; {12271#(<= ~counter~0 15)} is VALID [2021-09-13 14:25:57,169 INFO L281 TraceCheckUtils]: 136: Hoare triple {12271#(<= ~counter~0 15)} assume !(0 == __VERIFIER_assert_~cond); {12271#(<= ~counter~0 15)} is VALID [2021-09-13 14:25:57,169 INFO L281 TraceCheckUtils]: 137: Hoare triple {12271#(<= ~counter~0 15)} __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; {12271#(<= ~counter~0 15)} is VALID [2021-09-13 14:25:57,169 INFO L281 TraceCheckUtils]: 138: Hoare triple {12271#(<= ~counter~0 15)} assume !(0 == __VERIFIER_assert_~cond); {12271#(<= ~counter~0 15)} is VALID [2021-09-13 14:25:57,169 INFO L281 TraceCheckUtils]: 139: Hoare triple {12271#(<= ~counter~0 15)} assume !!(main_~a~0 != main_~b~0); {12271#(<= ~counter~0 15)} is VALID [2021-09-13 14:25:57,169 INFO L281 TraceCheckUtils]: 140: Hoare triple {12271#(<= ~counter~0 15)} assume main_~a~0 > main_~b~0;main_~a~0 := main_~a~0 - main_~b~0;main_~p~0 := main_~p~0 - main_~q~0;main_~r~0 := main_~r~0 - main_~s~0; {12271#(<= ~counter~0 15)} is VALID [2021-09-13 14:25:57,170 INFO L281 TraceCheckUtils]: 141: Hoare triple {12271#(<= ~counter~0 15)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {12299#(<= ~counter~0 16)} is VALID [2021-09-13 14:25:57,170 INFO L281 TraceCheckUtils]: 142: Hoare triple {12299#(<= ~counter~0 16)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 1 == main_~p~0 * main_~s~0 - main_~r~0 * main_~q~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {12299#(<= ~counter~0 16)} is VALID [2021-09-13 14:25:57,170 INFO L281 TraceCheckUtils]: 143: Hoare triple {12299#(<= ~counter~0 16)} assume !(0 == __VERIFIER_assert_~cond); {12299#(<= ~counter~0 16)} is VALID [2021-09-13 14:25:57,196 INFO L281 TraceCheckUtils]: 144: Hoare triple {12299#(<= ~counter~0 16)} __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; {12299#(<= ~counter~0 16)} is VALID [2021-09-13 14:25:57,197 INFO L281 TraceCheckUtils]: 145: Hoare triple {12299#(<= ~counter~0 16)} assume !(0 == __VERIFIER_assert_~cond); {12299#(<= ~counter~0 16)} is VALID [2021-09-13 14:25:57,197 INFO L281 TraceCheckUtils]: 146: Hoare triple {12299#(<= ~counter~0 16)} __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; {12299#(<= ~counter~0 16)} is VALID [2021-09-13 14:25:57,197 INFO L281 TraceCheckUtils]: 147: Hoare triple {12299#(<= ~counter~0 16)} assume !(0 == __VERIFIER_assert_~cond); {12299#(<= ~counter~0 16)} is VALID [2021-09-13 14:25:57,197 INFO L281 TraceCheckUtils]: 148: Hoare triple {12299#(<= ~counter~0 16)} assume !!(main_~a~0 != main_~b~0); {12299#(<= ~counter~0 16)} is VALID [2021-09-13 14:25:57,198 INFO L281 TraceCheckUtils]: 149: Hoare triple {12299#(<= ~counter~0 16)} assume main_~a~0 > main_~b~0;main_~a~0 := main_~a~0 - main_~b~0;main_~p~0 := main_~p~0 - main_~q~0;main_~r~0 := main_~r~0 - main_~s~0; {12299#(<= ~counter~0 16)} is VALID [2021-09-13 14:25:57,198 INFO L281 TraceCheckUtils]: 150: Hoare triple {12299#(<= ~counter~0 16)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {12327#(<= ~counter~0 17)} is VALID [2021-09-13 14:25:57,199 INFO L281 TraceCheckUtils]: 151: Hoare triple {12327#(<= ~counter~0 17)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 1 == main_~p~0 * main_~s~0 - main_~r~0 * main_~q~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {12327#(<= ~counter~0 17)} is VALID [2021-09-13 14:25:57,199 INFO L281 TraceCheckUtils]: 152: Hoare triple {12327#(<= ~counter~0 17)} assume !(0 == __VERIFIER_assert_~cond); {12327#(<= ~counter~0 17)} is VALID [2021-09-13 14:25:57,199 INFO L281 TraceCheckUtils]: 153: Hoare triple {12327#(<= ~counter~0 17)} __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; {12327#(<= ~counter~0 17)} is VALID [2021-09-13 14:25:57,199 INFO L281 TraceCheckUtils]: 154: Hoare triple {12327#(<= ~counter~0 17)} assume !(0 == __VERIFIER_assert_~cond); {12327#(<= ~counter~0 17)} is VALID [2021-09-13 14:25:57,200 INFO L281 TraceCheckUtils]: 155: Hoare triple {12327#(<= ~counter~0 17)} __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; {12327#(<= ~counter~0 17)} is VALID [2021-09-13 14:25:57,200 INFO L281 TraceCheckUtils]: 156: Hoare triple {12327#(<= ~counter~0 17)} assume !(0 == __VERIFIER_assert_~cond); {12327#(<= ~counter~0 17)} is VALID [2021-09-13 14:25:57,200 INFO L281 TraceCheckUtils]: 157: Hoare triple {12327#(<= ~counter~0 17)} assume !!(main_~a~0 != main_~b~0); {12327#(<= ~counter~0 17)} is VALID [2021-09-13 14:25:57,200 INFO L281 TraceCheckUtils]: 158: Hoare triple {12327#(<= ~counter~0 17)} assume main_~a~0 > main_~b~0;main_~a~0 := main_~a~0 - main_~b~0;main_~p~0 := main_~p~0 - main_~q~0;main_~r~0 := main_~r~0 - main_~s~0; {12327#(<= ~counter~0 17)} is VALID [2021-09-13 14:25:57,201 INFO L281 TraceCheckUtils]: 159: Hoare triple {12327#(<= ~counter~0 17)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {12355#(<= ~counter~0 18)} is VALID [2021-09-13 14:25:57,201 INFO L281 TraceCheckUtils]: 160: Hoare triple {12355#(<= ~counter~0 18)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 1 == main_~p~0 * main_~s~0 - main_~r~0 * main_~q~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {12355#(<= ~counter~0 18)} is VALID [2021-09-13 14:25:57,201 INFO L281 TraceCheckUtils]: 161: Hoare triple {12355#(<= ~counter~0 18)} assume !(0 == __VERIFIER_assert_~cond); {12355#(<= ~counter~0 18)} is VALID [2021-09-13 14:25:57,202 INFO L281 TraceCheckUtils]: 162: Hoare triple {12355#(<= ~counter~0 18)} __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; {12355#(<= ~counter~0 18)} is VALID [2021-09-13 14:25:57,202 INFO L281 TraceCheckUtils]: 163: Hoare triple {12355#(<= ~counter~0 18)} assume !(0 == __VERIFIER_assert_~cond); {12355#(<= ~counter~0 18)} is VALID [2021-09-13 14:25:57,202 INFO L281 TraceCheckUtils]: 164: Hoare triple {12355#(<= ~counter~0 18)} __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; {12355#(<= ~counter~0 18)} is VALID [2021-09-13 14:25:57,202 INFO L281 TraceCheckUtils]: 165: Hoare triple {12355#(<= ~counter~0 18)} assume !(0 == __VERIFIER_assert_~cond); {12355#(<= ~counter~0 18)} is VALID [2021-09-13 14:25:57,202 INFO L281 TraceCheckUtils]: 166: Hoare triple {12355#(<= ~counter~0 18)} assume !!(main_~a~0 != main_~b~0); {12355#(<= ~counter~0 18)} is VALID [2021-09-13 14:25:57,203 INFO L281 TraceCheckUtils]: 167: Hoare triple {12355#(<= ~counter~0 18)} assume main_~a~0 > main_~b~0;main_~a~0 := main_~a~0 - main_~b~0;main_~p~0 := main_~p~0 - main_~q~0;main_~r~0 := main_~r~0 - main_~s~0; {12355#(<= ~counter~0 18)} is VALID [2021-09-13 14:25:57,204 INFO L281 TraceCheckUtils]: 168: Hoare triple {12355#(<= ~counter~0 18)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {12383#(<= ~counter~0 19)} is VALID [2021-09-13 14:25:57,204 INFO L281 TraceCheckUtils]: 169: Hoare triple {12383#(<= ~counter~0 19)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 1 == main_~p~0 * main_~s~0 - main_~r~0 * main_~q~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {12383#(<= ~counter~0 19)} is VALID [2021-09-13 14:25:57,204 INFO L281 TraceCheckUtils]: 170: Hoare triple {12383#(<= ~counter~0 19)} assume !(0 == __VERIFIER_assert_~cond); {12383#(<= ~counter~0 19)} is VALID [2021-09-13 14:25:57,204 INFO L281 TraceCheckUtils]: 171: Hoare triple {12383#(<= ~counter~0 19)} __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; {12383#(<= ~counter~0 19)} is VALID [2021-09-13 14:25:57,205 INFO L281 TraceCheckUtils]: 172: Hoare triple {12383#(<= ~counter~0 19)} assume !(0 == __VERIFIER_assert_~cond); {12383#(<= ~counter~0 19)} is VALID [2021-09-13 14:25:57,205 INFO L281 TraceCheckUtils]: 173: Hoare triple {12383#(<= ~counter~0 19)} __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; {12383#(<= ~counter~0 19)} is VALID [2021-09-13 14:25:57,205 INFO L281 TraceCheckUtils]: 174: Hoare triple {12383#(<= ~counter~0 19)} assume !(0 == __VERIFIER_assert_~cond); {12383#(<= ~counter~0 19)} is VALID [2021-09-13 14:25:57,205 INFO L281 TraceCheckUtils]: 175: Hoare triple {12383#(<= ~counter~0 19)} assume !!(main_~a~0 != main_~b~0); {12383#(<= ~counter~0 19)} is VALID [2021-09-13 14:25:57,206 INFO L281 TraceCheckUtils]: 176: Hoare triple {12383#(<= ~counter~0 19)} assume main_~a~0 > main_~b~0;main_~a~0 := main_~a~0 - main_~b~0;main_~p~0 := main_~p~0 - main_~q~0;main_~r~0 := main_~r~0 - main_~s~0; {12383#(<= ~counter~0 19)} is VALID [2021-09-13 14:25:57,206 INFO L281 TraceCheckUtils]: 177: Hoare triple {12383#(<= ~counter~0 19)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {12411#(<= ~counter~0 20)} is VALID [2021-09-13 14:25:57,206 INFO L281 TraceCheckUtils]: 178: Hoare triple {12411#(<= ~counter~0 20)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 1 == main_~p~0 * main_~s~0 - main_~r~0 * main_~q~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {12411#(<= ~counter~0 20)} is VALID [2021-09-13 14:25:57,207 INFO L281 TraceCheckUtils]: 179: Hoare triple {12411#(<= ~counter~0 20)} assume !(0 == __VERIFIER_assert_~cond); {12411#(<= ~counter~0 20)} is VALID [2021-09-13 14:25:57,207 INFO L281 TraceCheckUtils]: 180: Hoare triple {12411#(<= ~counter~0 20)} __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; {12411#(<= ~counter~0 20)} is VALID [2021-09-13 14:25:57,207 INFO L281 TraceCheckUtils]: 181: Hoare triple {12411#(<= ~counter~0 20)} assume !(0 == __VERIFIER_assert_~cond); {12411#(<= ~counter~0 20)} is VALID [2021-09-13 14:25:57,207 INFO L281 TraceCheckUtils]: 182: Hoare triple {12411#(<= ~counter~0 20)} __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; {12411#(<= ~counter~0 20)} is VALID [2021-09-13 14:25:57,208 INFO L281 TraceCheckUtils]: 183: Hoare triple {12411#(<= ~counter~0 20)} assume !(0 == __VERIFIER_assert_~cond); {12411#(<= ~counter~0 20)} is VALID [2021-09-13 14:25:57,208 INFO L281 TraceCheckUtils]: 184: Hoare triple {12411#(<= ~counter~0 20)} assume !!(main_~a~0 != main_~b~0); {12411#(<= ~counter~0 20)} is VALID [2021-09-13 14:25:57,208 INFO L281 TraceCheckUtils]: 185: Hoare triple {12411#(<= ~counter~0 20)} assume main_~a~0 > main_~b~0;main_~a~0 := main_~a~0 - main_~b~0;main_~p~0 := main_~p~0 - main_~q~0;main_~r~0 := main_~r~0 - main_~s~0; {12411#(<= ~counter~0 20)} is VALID [2021-09-13 14:25:57,208 INFO L281 TraceCheckUtils]: 186: Hoare triple {12411#(<= ~counter~0 20)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {12439#(<= ~counter~0 21)} is VALID [2021-09-13 14:25:57,209 INFO L281 TraceCheckUtils]: 187: Hoare triple {12439#(<= ~counter~0 21)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 1 == main_~p~0 * main_~s~0 - main_~r~0 * main_~q~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {12439#(<= ~counter~0 21)} is VALID [2021-09-13 14:25:57,209 INFO L281 TraceCheckUtils]: 188: Hoare triple {12439#(<= ~counter~0 21)} assume !(0 == __VERIFIER_assert_~cond); {12439#(<= ~counter~0 21)} is VALID [2021-09-13 14:25:57,209 INFO L281 TraceCheckUtils]: 189: Hoare triple {12439#(<= ~counter~0 21)} __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; {12439#(<= ~counter~0 21)} is VALID [2021-09-13 14:25:57,209 INFO L281 TraceCheckUtils]: 190: Hoare triple {12439#(<= ~counter~0 21)} assume !(0 == __VERIFIER_assert_~cond); {12439#(<= ~counter~0 21)} is VALID [2021-09-13 14:25:57,210 INFO L281 TraceCheckUtils]: 191: Hoare triple {12439#(<= ~counter~0 21)} __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; {12439#(<= ~counter~0 21)} is VALID [2021-09-13 14:25:57,210 INFO L281 TraceCheckUtils]: 192: Hoare triple {12439#(<= ~counter~0 21)} assume !(0 == __VERIFIER_assert_~cond); {12439#(<= ~counter~0 21)} is VALID [2021-09-13 14:25:57,210 INFO L281 TraceCheckUtils]: 193: Hoare triple {12439#(<= ~counter~0 21)} assume !!(main_~a~0 != main_~b~0); {12439#(<= ~counter~0 21)} is VALID [2021-09-13 14:25:57,210 INFO L281 TraceCheckUtils]: 194: Hoare triple {12439#(<= ~counter~0 21)} assume main_~a~0 > main_~b~0;main_~a~0 := main_~a~0 - main_~b~0;main_~p~0 := main_~p~0 - main_~q~0;main_~r~0 := main_~r~0 - main_~s~0; {12439#(<= ~counter~0 21)} is VALID [2021-09-13 14:25:57,211 INFO L281 TraceCheckUtils]: 195: Hoare triple {12439#(<= ~counter~0 21)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {12467#(<= ~counter~0 22)} is VALID [2021-09-13 14:25:57,211 INFO L281 TraceCheckUtils]: 196: Hoare triple {12467#(<= ~counter~0 22)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 1 == main_~p~0 * main_~s~0 - main_~r~0 * main_~q~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {12467#(<= ~counter~0 22)} is VALID [2021-09-13 14:25:57,211 INFO L281 TraceCheckUtils]: 197: Hoare triple {12467#(<= ~counter~0 22)} assume !(0 == __VERIFIER_assert_~cond); {12467#(<= ~counter~0 22)} is VALID [2021-09-13 14:25:57,212 INFO L281 TraceCheckUtils]: 198: Hoare triple {12467#(<= ~counter~0 22)} __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; {12467#(<= ~counter~0 22)} is VALID [2021-09-13 14:25:57,212 INFO L281 TraceCheckUtils]: 199: Hoare triple {12467#(<= ~counter~0 22)} assume !(0 == __VERIFIER_assert_~cond); {12467#(<= ~counter~0 22)} is VALID [2021-09-13 14:25:57,212 INFO L281 TraceCheckUtils]: 200: Hoare triple {12467#(<= ~counter~0 22)} __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; {12467#(<= ~counter~0 22)} is VALID [2021-09-13 14:25:57,212 INFO L281 TraceCheckUtils]: 201: Hoare triple {12467#(<= ~counter~0 22)} assume !(0 == __VERIFIER_assert_~cond); {12467#(<= ~counter~0 22)} is VALID [2021-09-13 14:25:57,212 INFO L281 TraceCheckUtils]: 202: Hoare triple {12467#(<= ~counter~0 22)} assume !!(main_~a~0 != main_~b~0); {12467#(<= ~counter~0 22)} is VALID [2021-09-13 14:25:57,213 INFO L281 TraceCheckUtils]: 203: Hoare triple {12467#(<= ~counter~0 22)} assume main_~a~0 > main_~b~0;main_~a~0 := main_~a~0 - main_~b~0;main_~p~0 := main_~p~0 - main_~q~0;main_~r~0 := main_~r~0 - main_~s~0; {12467#(<= ~counter~0 22)} is VALID [2021-09-13 14:25:57,213 INFO L281 TraceCheckUtils]: 204: Hoare triple {12467#(<= ~counter~0 22)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {12495#(<= ~counter~0 23)} is VALID [2021-09-13 14:25:57,213 INFO L281 TraceCheckUtils]: 205: Hoare triple {12495#(<= ~counter~0 23)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 1 == main_~p~0 * main_~s~0 - main_~r~0 * main_~q~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {12495#(<= ~counter~0 23)} is VALID [2021-09-13 14:25:57,214 INFO L281 TraceCheckUtils]: 206: Hoare triple {12495#(<= ~counter~0 23)} assume !(0 == __VERIFIER_assert_~cond); {12495#(<= ~counter~0 23)} is VALID [2021-09-13 14:25:57,214 INFO L281 TraceCheckUtils]: 207: Hoare triple {12495#(<= ~counter~0 23)} __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; {12495#(<= ~counter~0 23)} is VALID [2021-09-13 14:25:57,214 INFO L281 TraceCheckUtils]: 208: Hoare triple {12495#(<= ~counter~0 23)} assume !(0 == __VERIFIER_assert_~cond); {12495#(<= ~counter~0 23)} is VALID [2021-09-13 14:25:57,214 INFO L281 TraceCheckUtils]: 209: Hoare triple {12495#(<= ~counter~0 23)} __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; {12495#(<= ~counter~0 23)} is VALID [2021-09-13 14:25:57,215 INFO L281 TraceCheckUtils]: 210: Hoare triple {12495#(<= ~counter~0 23)} assume !(0 == __VERIFIER_assert_~cond); {12495#(<= ~counter~0 23)} is VALID [2021-09-13 14:25:57,215 INFO L281 TraceCheckUtils]: 211: Hoare triple {12495#(<= ~counter~0 23)} assume !!(main_~a~0 != main_~b~0); {12495#(<= ~counter~0 23)} is VALID [2021-09-13 14:25:57,215 INFO L281 TraceCheckUtils]: 212: Hoare triple {12495#(<= ~counter~0 23)} assume main_~a~0 > main_~b~0;main_~a~0 := main_~a~0 - main_~b~0;main_~p~0 := main_~p~0 - main_~q~0;main_~r~0 := main_~r~0 - main_~s~0; {12495#(<= ~counter~0 23)} is VALID [2021-09-13 14:25:57,216 INFO L281 TraceCheckUtils]: 213: Hoare triple {12495#(<= ~counter~0 23)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {12523#(<= ~counter~0 24)} is VALID [2021-09-13 14:25:57,216 INFO L281 TraceCheckUtils]: 214: Hoare triple {12523#(<= ~counter~0 24)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 1 == main_~p~0 * main_~s~0 - main_~r~0 * main_~q~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {12523#(<= ~counter~0 24)} is VALID [2021-09-13 14:25:57,216 INFO L281 TraceCheckUtils]: 215: Hoare triple {12523#(<= ~counter~0 24)} assume !(0 == __VERIFIER_assert_~cond); {12523#(<= ~counter~0 24)} is VALID [2021-09-13 14:25:57,216 INFO L281 TraceCheckUtils]: 216: Hoare triple {12523#(<= ~counter~0 24)} __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; {12523#(<= ~counter~0 24)} is VALID [2021-09-13 14:25:57,217 INFO L281 TraceCheckUtils]: 217: Hoare triple {12523#(<= ~counter~0 24)} assume !(0 == __VERIFIER_assert_~cond); {12523#(<= ~counter~0 24)} is VALID [2021-09-13 14:25:57,217 INFO L281 TraceCheckUtils]: 218: Hoare triple {12523#(<= ~counter~0 24)} __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; {12523#(<= ~counter~0 24)} is VALID [2021-09-13 14:25:57,217 INFO L281 TraceCheckUtils]: 219: Hoare triple {12523#(<= ~counter~0 24)} assume !(0 == __VERIFIER_assert_~cond); {12523#(<= ~counter~0 24)} is VALID [2021-09-13 14:25:57,217 INFO L281 TraceCheckUtils]: 220: Hoare triple {12523#(<= ~counter~0 24)} assume !!(main_~a~0 != main_~b~0); {12523#(<= ~counter~0 24)} is VALID [2021-09-13 14:25:57,218 INFO L281 TraceCheckUtils]: 221: Hoare triple {12523#(<= ~counter~0 24)} assume main_~a~0 > main_~b~0;main_~a~0 := main_~a~0 - main_~b~0;main_~p~0 := main_~p~0 - main_~q~0;main_~r~0 := main_~r~0 - main_~s~0; {12523#(<= ~counter~0 24)} is VALID [2021-09-13 14:25:57,218 INFO L281 TraceCheckUtils]: 222: Hoare triple {12523#(<= ~counter~0 24)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {12551#(<= ~counter~0 25)} is VALID [2021-09-13 14:25:57,218 INFO L281 TraceCheckUtils]: 223: Hoare triple {12551#(<= ~counter~0 25)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 1 == main_~p~0 * main_~s~0 - main_~r~0 * main_~q~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {12551#(<= ~counter~0 25)} is VALID [2021-09-13 14:25:57,219 INFO L281 TraceCheckUtils]: 224: Hoare triple {12551#(<= ~counter~0 25)} assume !(0 == __VERIFIER_assert_~cond); {12551#(<= ~counter~0 25)} is VALID [2021-09-13 14:25:57,219 INFO L281 TraceCheckUtils]: 225: Hoare triple {12551#(<= ~counter~0 25)} __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; {12551#(<= ~counter~0 25)} is VALID [2021-09-13 14:25:57,219 INFO L281 TraceCheckUtils]: 226: Hoare triple {12551#(<= ~counter~0 25)} assume !(0 == __VERIFIER_assert_~cond); {12551#(<= ~counter~0 25)} is VALID [2021-09-13 14:25:57,219 INFO L281 TraceCheckUtils]: 227: Hoare triple {12551#(<= ~counter~0 25)} __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; {12551#(<= ~counter~0 25)} is VALID [2021-09-13 14:25:57,219 INFO L281 TraceCheckUtils]: 228: Hoare triple {12551#(<= ~counter~0 25)} assume !(0 == __VERIFIER_assert_~cond); {12551#(<= ~counter~0 25)} is VALID [2021-09-13 14:25:57,220 INFO L281 TraceCheckUtils]: 229: Hoare triple {12551#(<= ~counter~0 25)} assume !!(main_~a~0 != main_~b~0); {12551#(<= ~counter~0 25)} is VALID [2021-09-13 14:25:57,220 INFO L281 TraceCheckUtils]: 230: Hoare triple {12551#(<= ~counter~0 25)} assume main_~a~0 > main_~b~0;main_~a~0 := main_~a~0 - main_~b~0;main_~p~0 := main_~p~0 - main_~q~0;main_~r~0 := main_~r~0 - main_~s~0; {12551#(<= ~counter~0 25)} is VALID [2021-09-13 14:25:57,220 INFO L281 TraceCheckUtils]: 231: Hoare triple {12551#(<= ~counter~0 25)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {12579#(<= ~counter~0 26)} is VALID [2021-09-13 14:25:57,221 INFO L281 TraceCheckUtils]: 232: Hoare triple {12579#(<= ~counter~0 26)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 1 == main_~p~0 * main_~s~0 - main_~r~0 * main_~q~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {12579#(<= ~counter~0 26)} is VALID [2021-09-13 14:25:57,221 INFO L281 TraceCheckUtils]: 233: Hoare triple {12579#(<= ~counter~0 26)} assume !(0 == __VERIFIER_assert_~cond); {12579#(<= ~counter~0 26)} is VALID [2021-09-13 14:25:57,221 INFO L281 TraceCheckUtils]: 234: Hoare triple {12579#(<= ~counter~0 26)} __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; {12579#(<= ~counter~0 26)} is VALID [2021-09-13 14:25:57,221 INFO L281 TraceCheckUtils]: 235: Hoare triple {12579#(<= ~counter~0 26)} assume !(0 == __VERIFIER_assert_~cond); {12579#(<= ~counter~0 26)} is VALID [2021-09-13 14:25:57,222 INFO L281 TraceCheckUtils]: 236: Hoare triple {12579#(<= ~counter~0 26)} __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; {12579#(<= ~counter~0 26)} is VALID [2021-09-13 14:25:57,222 INFO L281 TraceCheckUtils]: 237: Hoare triple {12579#(<= ~counter~0 26)} assume !(0 == __VERIFIER_assert_~cond); {12579#(<= ~counter~0 26)} is VALID [2021-09-13 14:25:57,222 INFO L281 TraceCheckUtils]: 238: Hoare triple {12579#(<= ~counter~0 26)} assume !!(main_~a~0 != main_~b~0); {12579#(<= ~counter~0 26)} is VALID [2021-09-13 14:25:57,222 INFO L281 TraceCheckUtils]: 239: Hoare triple {12579#(<= ~counter~0 26)} assume main_~a~0 > main_~b~0;main_~a~0 := main_~a~0 - main_~b~0;main_~p~0 := main_~p~0 - main_~q~0;main_~r~0 := main_~r~0 - main_~s~0; {12579#(<= ~counter~0 26)} is VALID [2021-09-13 14:25:57,223 INFO L281 TraceCheckUtils]: 240: Hoare triple {12579#(<= ~counter~0 26)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {12607#(<= ~counter~0 27)} is VALID [2021-09-13 14:25:57,223 INFO L281 TraceCheckUtils]: 241: Hoare triple {12607#(<= ~counter~0 27)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 1 == main_~p~0 * main_~s~0 - main_~r~0 * main_~q~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {12607#(<= ~counter~0 27)} is VALID [2021-09-13 14:25:57,223 INFO L281 TraceCheckUtils]: 242: Hoare triple {12607#(<= ~counter~0 27)} assume !(0 == __VERIFIER_assert_~cond); {12607#(<= ~counter~0 27)} is VALID [2021-09-13 14:25:57,224 INFO L281 TraceCheckUtils]: 243: Hoare triple {12607#(<= ~counter~0 27)} __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; {12607#(<= ~counter~0 27)} is VALID [2021-09-13 14:25:57,224 INFO L281 TraceCheckUtils]: 244: Hoare triple {12607#(<= ~counter~0 27)} assume !(0 == __VERIFIER_assert_~cond); {12607#(<= ~counter~0 27)} is VALID [2021-09-13 14:25:57,224 INFO L281 TraceCheckUtils]: 245: Hoare triple {12607#(<= ~counter~0 27)} __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; {12607#(<= ~counter~0 27)} is VALID [2021-09-13 14:25:57,224 INFO L281 TraceCheckUtils]: 246: Hoare triple {12607#(<= ~counter~0 27)} assume !(0 == __VERIFIER_assert_~cond); {12607#(<= ~counter~0 27)} is VALID [2021-09-13 14:25:57,225 INFO L281 TraceCheckUtils]: 247: Hoare triple {12607#(<= ~counter~0 27)} assume !!(main_~a~0 != main_~b~0); {12607#(<= ~counter~0 27)} is VALID [2021-09-13 14:25:57,225 INFO L281 TraceCheckUtils]: 248: Hoare triple {12607#(<= ~counter~0 27)} assume main_~a~0 > main_~b~0;main_~a~0 := main_~a~0 - main_~b~0;main_~p~0 := main_~p~0 - main_~q~0;main_~r~0 := main_~r~0 - main_~s~0; {12607#(<= ~counter~0 27)} is VALID [2021-09-13 14:25:57,225 INFO L281 TraceCheckUtils]: 249: Hoare triple {12607#(<= ~counter~0 27)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {12635#(<= ~counter~0 28)} is VALID [2021-09-13 14:25:57,226 INFO L281 TraceCheckUtils]: 250: Hoare triple {12635#(<= ~counter~0 28)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 1 == main_~p~0 * main_~s~0 - main_~r~0 * main_~q~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {12635#(<= ~counter~0 28)} is VALID [2021-09-13 14:25:57,226 INFO L281 TraceCheckUtils]: 251: Hoare triple {12635#(<= ~counter~0 28)} assume !(0 == __VERIFIER_assert_~cond); {12635#(<= ~counter~0 28)} is VALID [2021-09-13 14:25:57,226 INFO L281 TraceCheckUtils]: 252: Hoare triple {12635#(<= ~counter~0 28)} __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; {12635#(<= ~counter~0 28)} is VALID [2021-09-13 14:25:57,226 INFO L281 TraceCheckUtils]: 253: Hoare triple {12635#(<= ~counter~0 28)} assume !(0 == __VERIFIER_assert_~cond); {12635#(<= ~counter~0 28)} is VALID [2021-09-13 14:25:57,226 INFO L281 TraceCheckUtils]: 254: Hoare triple {12635#(<= ~counter~0 28)} __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; {12635#(<= ~counter~0 28)} is VALID [2021-09-13 14:25:57,227 INFO L281 TraceCheckUtils]: 255: Hoare triple {12635#(<= ~counter~0 28)} assume !(0 == __VERIFIER_assert_~cond); {12635#(<= ~counter~0 28)} is VALID [2021-09-13 14:25:57,227 INFO L281 TraceCheckUtils]: 256: Hoare triple {12635#(<= ~counter~0 28)} assume !!(main_~a~0 != main_~b~0); {12635#(<= ~counter~0 28)} is VALID [2021-09-13 14:25:57,227 INFO L281 TraceCheckUtils]: 257: Hoare triple {12635#(<= ~counter~0 28)} assume main_~a~0 > main_~b~0;main_~a~0 := main_~a~0 - main_~b~0;main_~p~0 := main_~p~0 - main_~q~0;main_~r~0 := main_~r~0 - main_~s~0; {12635#(<= ~counter~0 28)} is VALID [2021-09-13 14:25:57,228 INFO L281 TraceCheckUtils]: 258: Hoare triple {12635#(<= ~counter~0 28)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {12663#(<= ~counter~0 29)} is VALID [2021-09-13 14:25:57,228 INFO L281 TraceCheckUtils]: 259: Hoare triple {12663#(<= ~counter~0 29)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 1 == main_~p~0 * main_~s~0 - main_~r~0 * main_~q~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {12663#(<= ~counter~0 29)} is VALID [2021-09-13 14:25:57,228 INFO L281 TraceCheckUtils]: 260: Hoare triple {12663#(<= ~counter~0 29)} assume !(0 == __VERIFIER_assert_~cond); {12663#(<= ~counter~0 29)} is VALID [2021-09-13 14:25:57,228 INFO L281 TraceCheckUtils]: 261: Hoare triple {12663#(<= ~counter~0 29)} __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; {12663#(<= ~counter~0 29)} is VALID [2021-09-13 14:25:57,229 INFO L281 TraceCheckUtils]: 262: Hoare triple {12663#(<= ~counter~0 29)} assume !(0 == __VERIFIER_assert_~cond); {12663#(<= ~counter~0 29)} is VALID [2021-09-13 14:25:57,229 INFO L281 TraceCheckUtils]: 263: Hoare triple {12663#(<= ~counter~0 29)} __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; {12663#(<= ~counter~0 29)} is VALID [2021-09-13 14:25:57,229 INFO L281 TraceCheckUtils]: 264: Hoare triple {12663#(<= ~counter~0 29)} assume !(0 == __VERIFIER_assert_~cond); {12663#(<= ~counter~0 29)} is VALID [2021-09-13 14:25:57,229 INFO L281 TraceCheckUtils]: 265: Hoare triple {12663#(<= ~counter~0 29)} assume !!(main_~a~0 != main_~b~0); {12663#(<= ~counter~0 29)} is VALID [2021-09-13 14:25:57,230 INFO L281 TraceCheckUtils]: 266: Hoare triple {12663#(<= ~counter~0 29)} assume main_~a~0 > main_~b~0;main_~a~0 := main_~a~0 - main_~b~0;main_~p~0 := main_~p~0 - main_~q~0;main_~r~0 := main_~r~0 - main_~s~0; {12663#(<= ~counter~0 29)} is VALID [2021-09-13 14:25:57,230 INFO L281 TraceCheckUtils]: 267: Hoare triple {12663#(<= ~counter~0 29)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {12691#(<= ~counter~0 30)} is VALID [2021-09-13 14:25:57,230 INFO L281 TraceCheckUtils]: 268: Hoare triple {12691#(<= ~counter~0 30)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 1 == main_~p~0 * main_~s~0 - main_~r~0 * main_~q~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {12691#(<= ~counter~0 30)} is VALID [2021-09-13 14:25:57,230 INFO L281 TraceCheckUtils]: 269: Hoare triple {12691#(<= ~counter~0 30)} assume !(0 == __VERIFIER_assert_~cond); {12691#(<= ~counter~0 30)} is VALID [2021-09-13 14:25:57,231 INFO L281 TraceCheckUtils]: 270: Hoare triple {12691#(<= ~counter~0 30)} __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; {12691#(<= ~counter~0 30)} is VALID [2021-09-13 14:25:57,231 INFO L281 TraceCheckUtils]: 271: Hoare triple {12691#(<= ~counter~0 30)} assume !(0 == __VERIFIER_assert_~cond); {12691#(<= ~counter~0 30)} is VALID [2021-09-13 14:25:57,231 INFO L281 TraceCheckUtils]: 272: Hoare triple {12691#(<= ~counter~0 30)} __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; {12691#(<= ~counter~0 30)} is VALID [2021-09-13 14:25:57,231 INFO L281 TraceCheckUtils]: 273: Hoare triple {12691#(<= ~counter~0 30)} assume !(0 == __VERIFIER_assert_~cond); {12691#(<= ~counter~0 30)} is VALID [2021-09-13 14:25:57,232 INFO L281 TraceCheckUtils]: 274: Hoare triple {12691#(<= ~counter~0 30)} assume !!(main_~a~0 != main_~b~0); {12691#(<= ~counter~0 30)} is VALID [2021-09-13 14:25:57,232 INFO L281 TraceCheckUtils]: 275: Hoare triple {12691#(<= ~counter~0 30)} assume main_~a~0 > main_~b~0;main_~a~0 := main_~a~0 - main_~b~0;main_~p~0 := main_~p~0 - main_~q~0;main_~r~0 := main_~r~0 - main_~s~0; {12691#(<= ~counter~0 30)} is VALID [2021-09-13 14:25:57,232 INFO L281 TraceCheckUtils]: 276: Hoare triple {12691#(<= ~counter~0 30)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {12719#(<= ~counter~0 31)} is VALID [2021-09-13 14:25:57,233 INFO L281 TraceCheckUtils]: 277: Hoare triple {12719#(<= ~counter~0 31)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 1 == main_~p~0 * main_~s~0 - main_~r~0 * main_~q~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {12719#(<= ~counter~0 31)} is VALID [2021-09-13 14:25:57,233 INFO L281 TraceCheckUtils]: 278: Hoare triple {12719#(<= ~counter~0 31)} assume !(0 == __VERIFIER_assert_~cond); {12719#(<= ~counter~0 31)} is VALID [2021-09-13 14:25:57,233 INFO L281 TraceCheckUtils]: 279: Hoare triple {12719#(<= ~counter~0 31)} __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; {12719#(<= ~counter~0 31)} is VALID [2021-09-13 14:25:57,233 INFO L281 TraceCheckUtils]: 280: Hoare triple {12719#(<= ~counter~0 31)} assume !(0 == __VERIFIER_assert_~cond); {12719#(<= ~counter~0 31)} is VALID [2021-09-13 14:25:57,233 INFO L281 TraceCheckUtils]: 281: Hoare triple {12719#(<= ~counter~0 31)} __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; {12719#(<= ~counter~0 31)} is VALID [2021-09-13 14:25:57,234 INFO L281 TraceCheckUtils]: 282: Hoare triple {12719#(<= ~counter~0 31)} assume !(0 == __VERIFIER_assert_~cond); {12719#(<= ~counter~0 31)} is VALID [2021-09-13 14:25:57,234 INFO L281 TraceCheckUtils]: 283: Hoare triple {12719#(<= ~counter~0 31)} assume !!(main_~a~0 != main_~b~0); {12719#(<= ~counter~0 31)} is VALID [2021-09-13 14:25:57,234 INFO L281 TraceCheckUtils]: 284: Hoare triple {12719#(<= ~counter~0 31)} assume main_~a~0 > main_~b~0;main_~a~0 := main_~a~0 - main_~b~0;main_~p~0 := main_~p~0 - main_~q~0;main_~r~0 := main_~r~0 - main_~s~0; {12719#(<= ~counter~0 31)} is VALID [2021-09-13 14:25:57,235 INFO L281 TraceCheckUtils]: 285: Hoare triple {12719#(<= ~counter~0 31)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {12747#(<= ~counter~0 32)} is VALID [2021-09-13 14:25:57,235 INFO L281 TraceCheckUtils]: 286: Hoare triple {12747#(<= ~counter~0 32)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 1 == main_~p~0 * main_~s~0 - main_~r~0 * main_~q~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {12747#(<= ~counter~0 32)} is VALID [2021-09-13 14:25:57,235 INFO L281 TraceCheckUtils]: 287: Hoare triple {12747#(<= ~counter~0 32)} assume !(0 == __VERIFIER_assert_~cond); {12747#(<= ~counter~0 32)} is VALID [2021-09-13 14:25:57,235 INFO L281 TraceCheckUtils]: 288: Hoare triple {12747#(<= ~counter~0 32)} __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; {12747#(<= ~counter~0 32)} is VALID [2021-09-13 14:25:57,236 INFO L281 TraceCheckUtils]: 289: Hoare triple {12747#(<= ~counter~0 32)} assume !(0 == __VERIFIER_assert_~cond); {12747#(<= ~counter~0 32)} is VALID [2021-09-13 14:25:57,236 INFO L281 TraceCheckUtils]: 290: Hoare triple {12747#(<= ~counter~0 32)} __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; {12747#(<= ~counter~0 32)} is VALID [2021-09-13 14:25:57,236 INFO L281 TraceCheckUtils]: 291: Hoare triple {12747#(<= ~counter~0 32)} assume !(0 == __VERIFIER_assert_~cond); {12747#(<= ~counter~0 32)} is VALID [2021-09-13 14:25:57,236 INFO L281 TraceCheckUtils]: 292: Hoare triple {12747#(<= ~counter~0 32)} assume !!(main_~a~0 != main_~b~0); {12747#(<= ~counter~0 32)} is VALID [2021-09-13 14:25:57,237 INFO L281 TraceCheckUtils]: 293: Hoare triple {12747#(<= ~counter~0 32)} assume main_~a~0 > main_~b~0;main_~a~0 := main_~a~0 - main_~b~0;main_~p~0 := main_~p~0 - main_~q~0;main_~r~0 := main_~r~0 - main_~s~0; {12747#(<= ~counter~0 32)} is VALID [2021-09-13 14:25:57,237 INFO L281 TraceCheckUtils]: 294: Hoare triple {12747#(<= ~counter~0 32)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {12775#(<= ~counter~0 33)} is VALID [2021-09-13 14:25:57,237 INFO L281 TraceCheckUtils]: 295: Hoare triple {12775#(<= ~counter~0 33)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 1 == main_~p~0 * main_~s~0 - main_~r~0 * main_~q~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {12775#(<= ~counter~0 33)} is VALID [2021-09-13 14:25:57,238 INFO L281 TraceCheckUtils]: 296: Hoare triple {12775#(<= ~counter~0 33)} assume !(0 == __VERIFIER_assert_~cond); {12775#(<= ~counter~0 33)} is VALID [2021-09-13 14:25:57,238 INFO L281 TraceCheckUtils]: 297: Hoare triple {12775#(<= ~counter~0 33)} __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; {12775#(<= ~counter~0 33)} is VALID [2021-09-13 14:25:57,238 INFO L281 TraceCheckUtils]: 298: Hoare triple {12775#(<= ~counter~0 33)} assume !(0 == __VERIFIER_assert_~cond); {12775#(<= ~counter~0 33)} is VALID [2021-09-13 14:25:57,238 INFO L281 TraceCheckUtils]: 299: Hoare triple {12775#(<= ~counter~0 33)} __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; {12775#(<= ~counter~0 33)} is VALID [2021-09-13 14:25:57,239 INFO L281 TraceCheckUtils]: 300: Hoare triple {12775#(<= ~counter~0 33)} assume !(0 == __VERIFIER_assert_~cond); {12775#(<= ~counter~0 33)} is VALID [2021-09-13 14:25:57,239 INFO L281 TraceCheckUtils]: 301: Hoare triple {12775#(<= ~counter~0 33)} assume !!(main_~a~0 != main_~b~0); {12775#(<= ~counter~0 33)} is VALID [2021-09-13 14:25:57,239 INFO L281 TraceCheckUtils]: 302: Hoare triple {12775#(<= ~counter~0 33)} assume main_~a~0 > main_~b~0;main_~a~0 := main_~a~0 - main_~b~0;main_~p~0 := main_~p~0 - main_~q~0;main_~r~0 := main_~r~0 - main_~s~0; {12775#(<= ~counter~0 33)} is VALID [2021-09-13 14:25:57,239 INFO L281 TraceCheckUtils]: 303: Hoare triple {12775#(<= ~counter~0 33)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {12803#(<= ~counter~0 34)} is VALID [2021-09-13 14:25:57,240 INFO L281 TraceCheckUtils]: 304: Hoare triple {12803#(<= ~counter~0 34)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 1 == main_~p~0 * main_~s~0 - main_~r~0 * main_~q~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {12803#(<= ~counter~0 34)} is VALID [2021-09-13 14:25:57,240 INFO L281 TraceCheckUtils]: 305: Hoare triple {12803#(<= ~counter~0 34)} assume !(0 == __VERIFIER_assert_~cond); {12803#(<= ~counter~0 34)} is VALID [2021-09-13 14:25:57,240 INFO L281 TraceCheckUtils]: 306: Hoare triple {12803#(<= ~counter~0 34)} __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; {12803#(<= ~counter~0 34)} is VALID [2021-09-13 14:25:57,240 INFO L281 TraceCheckUtils]: 307: Hoare triple {12803#(<= ~counter~0 34)} assume !(0 == __VERIFIER_assert_~cond); {12803#(<= ~counter~0 34)} is VALID [2021-09-13 14:25:57,241 INFO L281 TraceCheckUtils]: 308: Hoare triple {12803#(<= ~counter~0 34)} __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; {12803#(<= ~counter~0 34)} is VALID [2021-09-13 14:25:57,241 INFO L281 TraceCheckUtils]: 309: Hoare triple {12803#(<= ~counter~0 34)} assume !(0 == __VERIFIER_assert_~cond); {12803#(<= ~counter~0 34)} is VALID [2021-09-13 14:25:57,241 INFO L281 TraceCheckUtils]: 310: Hoare triple {12803#(<= ~counter~0 34)} assume !!(main_~a~0 != main_~b~0); {12803#(<= ~counter~0 34)} is VALID [2021-09-13 14:25:57,241 INFO L281 TraceCheckUtils]: 311: Hoare triple {12803#(<= ~counter~0 34)} assume main_~a~0 > main_~b~0;main_~a~0 := main_~a~0 - main_~b~0;main_~p~0 := main_~p~0 - main_~q~0;main_~r~0 := main_~r~0 - main_~s~0; {12803#(<= ~counter~0 34)} is VALID [2021-09-13 14:25:57,242 INFO L281 TraceCheckUtils]: 312: Hoare triple {12803#(<= ~counter~0 34)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {12831#(<= ~counter~0 35)} is VALID [2021-09-13 14:25:57,242 INFO L281 TraceCheckUtils]: 313: Hoare triple {12831#(<= ~counter~0 35)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 1 == main_~p~0 * main_~s~0 - main_~r~0 * main_~q~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {12831#(<= ~counter~0 35)} is VALID [2021-09-13 14:25:57,242 INFO L281 TraceCheckUtils]: 314: Hoare triple {12831#(<= ~counter~0 35)} assume !(0 == __VERIFIER_assert_~cond); {12831#(<= ~counter~0 35)} is VALID [2021-09-13 14:25:57,243 INFO L281 TraceCheckUtils]: 315: Hoare triple {12831#(<= ~counter~0 35)} __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; {12831#(<= ~counter~0 35)} is VALID [2021-09-13 14:25:57,243 INFO L281 TraceCheckUtils]: 316: Hoare triple {12831#(<= ~counter~0 35)} assume !(0 == __VERIFIER_assert_~cond); {12831#(<= ~counter~0 35)} is VALID [2021-09-13 14:25:57,243 INFO L281 TraceCheckUtils]: 317: Hoare triple {12831#(<= ~counter~0 35)} __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; {12831#(<= ~counter~0 35)} is VALID [2021-09-13 14:25:57,243 INFO L281 TraceCheckUtils]: 318: Hoare triple {12831#(<= ~counter~0 35)} assume !(0 == __VERIFIER_assert_~cond); {12831#(<= ~counter~0 35)} is VALID [2021-09-13 14:25:57,243 INFO L281 TraceCheckUtils]: 319: Hoare triple {12831#(<= ~counter~0 35)} assume !!(main_~a~0 != main_~b~0); {12831#(<= ~counter~0 35)} is VALID [2021-09-13 14:25:57,244 INFO L281 TraceCheckUtils]: 320: Hoare triple {12831#(<= ~counter~0 35)} assume main_~a~0 > main_~b~0;main_~a~0 := main_~a~0 - main_~b~0;main_~p~0 := main_~p~0 - main_~q~0;main_~r~0 := main_~r~0 - main_~s~0; {12831#(<= ~counter~0 35)} is VALID [2021-09-13 14:25:57,244 INFO L281 TraceCheckUtils]: 321: Hoare triple {12831#(<= ~counter~0 35)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {12859#(<= ~counter~0 36)} is VALID [2021-09-13 14:25:57,244 INFO L281 TraceCheckUtils]: 322: Hoare triple {12859#(<= ~counter~0 36)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 1 == main_~p~0 * main_~s~0 - main_~r~0 * main_~q~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {12859#(<= ~counter~0 36)} is VALID [2021-09-13 14:25:57,245 INFO L281 TraceCheckUtils]: 323: Hoare triple {12859#(<= ~counter~0 36)} assume !(0 == __VERIFIER_assert_~cond); {12859#(<= ~counter~0 36)} is VALID [2021-09-13 14:25:57,245 INFO L281 TraceCheckUtils]: 324: Hoare triple {12859#(<= ~counter~0 36)} __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; {12859#(<= ~counter~0 36)} is VALID [2021-09-13 14:25:57,245 INFO L281 TraceCheckUtils]: 325: Hoare triple {12859#(<= ~counter~0 36)} assume !(0 == __VERIFIER_assert_~cond); {12859#(<= ~counter~0 36)} is VALID [2021-09-13 14:25:57,245 INFO L281 TraceCheckUtils]: 326: Hoare triple {12859#(<= ~counter~0 36)} __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; {12859#(<= ~counter~0 36)} is VALID [2021-09-13 14:25:57,246 INFO L281 TraceCheckUtils]: 327: Hoare triple {12859#(<= ~counter~0 36)} assume !(0 == __VERIFIER_assert_~cond); {12859#(<= ~counter~0 36)} is VALID [2021-09-13 14:25:57,246 INFO L281 TraceCheckUtils]: 328: Hoare triple {12859#(<= ~counter~0 36)} assume !!(main_~a~0 != main_~b~0); {12859#(<= ~counter~0 36)} is VALID [2021-09-13 14:25:57,246 INFO L281 TraceCheckUtils]: 329: Hoare triple {12859#(<= ~counter~0 36)} assume main_~a~0 > main_~b~0;main_~a~0 := main_~a~0 - main_~b~0;main_~p~0 := main_~p~0 - main_~q~0;main_~r~0 := main_~r~0 - main_~s~0; {12859#(<= ~counter~0 36)} is VALID [2021-09-13 14:25:57,246 INFO L281 TraceCheckUtils]: 330: Hoare triple {12859#(<= ~counter~0 36)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {12887#(<= ~counter~0 37)} is VALID [2021-09-13 14:25:57,247 INFO L281 TraceCheckUtils]: 331: Hoare triple {12887#(<= ~counter~0 37)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 1 == main_~p~0 * main_~s~0 - main_~r~0 * main_~q~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {12887#(<= ~counter~0 37)} is VALID [2021-09-13 14:25:57,247 INFO L281 TraceCheckUtils]: 332: Hoare triple {12887#(<= ~counter~0 37)} assume !(0 == __VERIFIER_assert_~cond); {12887#(<= ~counter~0 37)} is VALID [2021-09-13 14:25:57,247 INFO L281 TraceCheckUtils]: 333: Hoare triple {12887#(<= ~counter~0 37)} __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; {12887#(<= ~counter~0 37)} is VALID [2021-09-13 14:25:57,247 INFO L281 TraceCheckUtils]: 334: Hoare triple {12887#(<= ~counter~0 37)} assume !(0 == __VERIFIER_assert_~cond); {12887#(<= ~counter~0 37)} is VALID [2021-09-13 14:25:57,248 INFO L281 TraceCheckUtils]: 335: Hoare triple {12887#(<= ~counter~0 37)} __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; {12887#(<= ~counter~0 37)} is VALID [2021-09-13 14:25:57,248 INFO L281 TraceCheckUtils]: 336: Hoare triple {12887#(<= ~counter~0 37)} assume !(0 == __VERIFIER_assert_~cond); {12887#(<= ~counter~0 37)} is VALID [2021-09-13 14:25:57,248 INFO L281 TraceCheckUtils]: 337: Hoare triple {12887#(<= ~counter~0 37)} assume !!(main_~a~0 != main_~b~0); {12887#(<= ~counter~0 37)} is VALID [2021-09-13 14:25:57,248 INFO L281 TraceCheckUtils]: 338: Hoare triple {12887#(<= ~counter~0 37)} assume main_~a~0 > main_~b~0;main_~a~0 := main_~a~0 - main_~b~0;main_~p~0 := main_~p~0 - main_~q~0;main_~r~0 := main_~r~0 - main_~s~0; {12887#(<= ~counter~0 37)} is VALID [2021-09-13 14:25:57,249 INFO L281 TraceCheckUtils]: 339: Hoare triple {12887#(<= ~counter~0 37)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {12915#(<= ~counter~0 38)} is VALID [2021-09-13 14:25:57,249 INFO L281 TraceCheckUtils]: 340: Hoare triple {12915#(<= ~counter~0 38)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 1 == main_~p~0 * main_~s~0 - main_~r~0 * main_~q~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {12915#(<= ~counter~0 38)} is VALID [2021-09-13 14:25:57,249 INFO L281 TraceCheckUtils]: 341: Hoare triple {12915#(<= ~counter~0 38)} assume !(0 == __VERIFIER_assert_~cond); {12915#(<= ~counter~0 38)} is VALID [2021-09-13 14:25:57,250 INFO L281 TraceCheckUtils]: 342: Hoare triple {12915#(<= ~counter~0 38)} __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; {12915#(<= ~counter~0 38)} is VALID [2021-09-13 14:25:57,250 INFO L281 TraceCheckUtils]: 343: Hoare triple {12915#(<= ~counter~0 38)} assume !(0 == __VERIFIER_assert_~cond); {12915#(<= ~counter~0 38)} is VALID [2021-09-13 14:25:57,250 INFO L281 TraceCheckUtils]: 344: Hoare triple {12915#(<= ~counter~0 38)} __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; {12915#(<= ~counter~0 38)} is VALID [2021-09-13 14:25:57,250 INFO L281 TraceCheckUtils]: 345: Hoare triple {12915#(<= ~counter~0 38)} assume !(0 == __VERIFIER_assert_~cond); {12915#(<= ~counter~0 38)} is VALID [2021-09-13 14:25:57,250 INFO L281 TraceCheckUtils]: 346: Hoare triple {12915#(<= ~counter~0 38)} assume !!(main_~a~0 != main_~b~0); {12915#(<= ~counter~0 38)} is VALID [2021-09-13 14:25:57,251 INFO L281 TraceCheckUtils]: 347: Hoare triple {12915#(<= ~counter~0 38)} assume main_~a~0 > main_~b~0;main_~a~0 := main_~a~0 - main_~b~0;main_~p~0 := main_~p~0 - main_~q~0;main_~r~0 := main_~r~0 - main_~s~0; {12915#(<= ~counter~0 38)} is VALID [2021-09-13 14:25:57,251 INFO L281 TraceCheckUtils]: 348: Hoare triple {12915#(<= ~counter~0 38)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {12943#(<= ~counter~0 39)} is VALID [2021-09-13 14:25:57,251 INFO L281 TraceCheckUtils]: 349: Hoare triple {12943#(<= ~counter~0 39)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 1 == main_~p~0 * main_~s~0 - main_~r~0 * main_~q~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {12943#(<= ~counter~0 39)} is VALID [2021-09-13 14:25:57,252 INFO L281 TraceCheckUtils]: 350: Hoare triple {12943#(<= ~counter~0 39)} assume !(0 == __VERIFIER_assert_~cond); {12943#(<= ~counter~0 39)} is VALID [2021-09-13 14:25:57,252 INFO L281 TraceCheckUtils]: 351: Hoare triple {12943#(<= ~counter~0 39)} __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; {12943#(<= ~counter~0 39)} is VALID [2021-09-13 14:25:57,252 INFO L281 TraceCheckUtils]: 352: Hoare triple {12943#(<= ~counter~0 39)} assume !(0 == __VERIFIER_assert_~cond); {12943#(<= ~counter~0 39)} is VALID [2021-09-13 14:25:57,252 INFO L281 TraceCheckUtils]: 353: Hoare triple {12943#(<= ~counter~0 39)} __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; {12943#(<= ~counter~0 39)} is VALID [2021-09-13 14:25:57,253 INFO L281 TraceCheckUtils]: 354: Hoare triple {12943#(<= ~counter~0 39)} assume !(0 == __VERIFIER_assert_~cond); {12943#(<= ~counter~0 39)} is VALID [2021-09-13 14:25:57,253 INFO L281 TraceCheckUtils]: 355: Hoare triple {12943#(<= ~counter~0 39)} assume !!(main_~a~0 != main_~b~0); {12943#(<= ~counter~0 39)} is VALID [2021-09-13 14:25:57,253 INFO L281 TraceCheckUtils]: 356: Hoare triple {12943#(<= ~counter~0 39)} assume main_~a~0 > main_~b~0;main_~a~0 := main_~a~0 - main_~b~0;main_~p~0 := main_~p~0 - main_~q~0;main_~r~0 := main_~r~0 - main_~s~0; {12943#(<= ~counter~0 39)} is VALID [2021-09-13 14:25:57,253 INFO L281 TraceCheckUtils]: 357: Hoare triple {12943#(<= ~counter~0 39)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {12971#(<= ~counter~0 40)} is VALID [2021-09-13 14:25:57,254 INFO L281 TraceCheckUtils]: 358: Hoare triple {12971#(<= ~counter~0 40)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 1 == main_~p~0 * main_~s~0 - main_~r~0 * main_~q~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {12971#(<= ~counter~0 40)} is VALID [2021-09-13 14:25:57,254 INFO L281 TraceCheckUtils]: 359: Hoare triple {12971#(<= ~counter~0 40)} assume !(0 == __VERIFIER_assert_~cond); {12971#(<= ~counter~0 40)} is VALID [2021-09-13 14:25:57,254 INFO L281 TraceCheckUtils]: 360: Hoare triple {12971#(<= ~counter~0 40)} __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; {12971#(<= ~counter~0 40)} is VALID [2021-09-13 14:25:57,254 INFO L281 TraceCheckUtils]: 361: Hoare triple {12971#(<= ~counter~0 40)} assume !(0 == __VERIFIER_assert_~cond); {12971#(<= ~counter~0 40)} is VALID [2021-09-13 14:25:57,255 INFO L281 TraceCheckUtils]: 362: Hoare triple {12971#(<= ~counter~0 40)} __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; {12971#(<= ~counter~0 40)} is VALID [2021-09-13 14:25:57,255 INFO L281 TraceCheckUtils]: 363: Hoare triple {12971#(<= ~counter~0 40)} assume !(0 == __VERIFIER_assert_~cond); {12971#(<= ~counter~0 40)} is VALID [2021-09-13 14:25:57,255 INFO L281 TraceCheckUtils]: 364: Hoare triple {12971#(<= ~counter~0 40)} assume !!(main_~a~0 != main_~b~0); {12971#(<= ~counter~0 40)} is VALID [2021-09-13 14:25:57,255 INFO L281 TraceCheckUtils]: 365: Hoare triple {12971#(<= ~counter~0 40)} assume main_~a~0 > main_~b~0;main_~a~0 := main_~a~0 - main_~b~0;main_~p~0 := main_~p~0 - main_~q~0;main_~r~0 := main_~r~0 - main_~s~0; {12971#(<= ~counter~0 40)} is VALID [2021-09-13 14:25:57,256 INFO L281 TraceCheckUtils]: 366: Hoare triple {12971#(<= ~counter~0 40)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {12999#(<= ~counter~0 41)} is VALID [2021-09-13 14:25:57,256 INFO L281 TraceCheckUtils]: 367: Hoare triple {12999#(<= ~counter~0 41)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 1 == main_~p~0 * main_~s~0 - main_~r~0 * main_~q~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {12999#(<= ~counter~0 41)} is VALID [2021-09-13 14:25:57,256 INFO L281 TraceCheckUtils]: 368: Hoare triple {12999#(<= ~counter~0 41)} assume !(0 == __VERIFIER_assert_~cond); {12999#(<= ~counter~0 41)} is VALID [2021-09-13 14:25:57,257 INFO L281 TraceCheckUtils]: 369: Hoare triple {12999#(<= ~counter~0 41)} __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; {12999#(<= ~counter~0 41)} is VALID [2021-09-13 14:25:57,257 INFO L281 TraceCheckUtils]: 370: Hoare triple {12999#(<= ~counter~0 41)} assume !(0 == __VERIFIER_assert_~cond); {12999#(<= ~counter~0 41)} is VALID [2021-09-13 14:25:57,257 INFO L281 TraceCheckUtils]: 371: Hoare triple {12999#(<= ~counter~0 41)} __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; {12999#(<= ~counter~0 41)} is VALID [2021-09-13 14:25:57,257 INFO L281 TraceCheckUtils]: 372: Hoare triple {12999#(<= ~counter~0 41)} assume !(0 == __VERIFIER_assert_~cond); {12999#(<= ~counter~0 41)} is VALID [2021-09-13 14:25:57,258 INFO L281 TraceCheckUtils]: 373: Hoare triple {12999#(<= ~counter~0 41)} assume !!(main_~a~0 != main_~b~0); {12999#(<= ~counter~0 41)} is VALID [2021-09-13 14:25:57,258 INFO L281 TraceCheckUtils]: 374: Hoare triple {12999#(<= ~counter~0 41)} assume main_~a~0 > main_~b~0;main_~a~0 := main_~a~0 - main_~b~0;main_~p~0 := main_~p~0 - main_~q~0;main_~r~0 := main_~r~0 - main_~s~0; {12999#(<= ~counter~0 41)} is VALID [2021-09-13 14:25:57,258 INFO L281 TraceCheckUtils]: 375: Hoare triple {12999#(<= ~counter~0 41)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {13027#(<= ~counter~0 42)} is VALID [2021-09-13 14:25:57,258 INFO L281 TraceCheckUtils]: 376: Hoare triple {13027#(<= ~counter~0 42)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 1 == main_~p~0 * main_~s~0 - main_~r~0 * main_~q~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {13027#(<= ~counter~0 42)} is VALID [2021-09-13 14:25:57,259 INFO L281 TraceCheckUtils]: 377: Hoare triple {13027#(<= ~counter~0 42)} assume !(0 == __VERIFIER_assert_~cond); {13027#(<= ~counter~0 42)} is VALID [2021-09-13 14:25:57,259 INFO L281 TraceCheckUtils]: 378: Hoare triple {13027#(<= ~counter~0 42)} __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; {13027#(<= ~counter~0 42)} is VALID [2021-09-13 14:25:57,259 INFO L281 TraceCheckUtils]: 379: Hoare triple {13027#(<= ~counter~0 42)} assume !(0 == __VERIFIER_assert_~cond); {13027#(<= ~counter~0 42)} is VALID [2021-09-13 14:25:57,259 INFO L281 TraceCheckUtils]: 380: Hoare triple {13027#(<= ~counter~0 42)} __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; {13027#(<= ~counter~0 42)} is VALID [2021-09-13 14:25:57,260 INFO L281 TraceCheckUtils]: 381: Hoare triple {13027#(<= ~counter~0 42)} assume !(0 == __VERIFIER_assert_~cond); {13027#(<= ~counter~0 42)} is VALID [2021-09-13 14:25:57,260 INFO L281 TraceCheckUtils]: 382: Hoare triple {13027#(<= ~counter~0 42)} assume !!(main_~a~0 != main_~b~0); {13027#(<= ~counter~0 42)} is VALID [2021-09-13 14:25:57,260 INFO L281 TraceCheckUtils]: 383: Hoare triple {13027#(<= ~counter~0 42)} assume main_~a~0 > main_~b~0;main_~a~0 := main_~a~0 - main_~b~0;main_~p~0 := main_~p~0 - main_~q~0;main_~r~0 := main_~r~0 - main_~s~0; {13027#(<= ~counter~0 42)} is VALID [2021-09-13 14:25:57,261 INFO L281 TraceCheckUtils]: 384: Hoare triple {13027#(<= ~counter~0 42)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {13055#(<= ~counter~0 43)} is VALID [2021-09-13 14:25:57,261 INFO L281 TraceCheckUtils]: 385: Hoare triple {13055#(<= ~counter~0 43)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 1 == main_~p~0 * main_~s~0 - main_~r~0 * main_~q~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {13055#(<= ~counter~0 43)} is VALID [2021-09-13 14:25:57,261 INFO L281 TraceCheckUtils]: 386: Hoare triple {13055#(<= ~counter~0 43)} assume !(0 == __VERIFIER_assert_~cond); {13055#(<= ~counter~0 43)} is VALID [2021-09-13 14:25:57,261 INFO L281 TraceCheckUtils]: 387: Hoare triple {13055#(<= ~counter~0 43)} __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; {13055#(<= ~counter~0 43)} is VALID [2021-09-13 14:25:57,261 INFO L281 TraceCheckUtils]: 388: Hoare triple {13055#(<= ~counter~0 43)} assume !(0 == __VERIFIER_assert_~cond); {13055#(<= ~counter~0 43)} is VALID [2021-09-13 14:25:57,262 INFO L281 TraceCheckUtils]: 389: Hoare triple {13055#(<= ~counter~0 43)} __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; {13055#(<= ~counter~0 43)} is VALID [2021-09-13 14:25:57,262 INFO L281 TraceCheckUtils]: 390: Hoare triple {13055#(<= ~counter~0 43)} assume !(0 == __VERIFIER_assert_~cond); {13055#(<= ~counter~0 43)} is VALID [2021-09-13 14:25:57,262 INFO L281 TraceCheckUtils]: 391: Hoare triple {13055#(<= ~counter~0 43)} assume !!(main_~a~0 != main_~b~0); {13055#(<= ~counter~0 43)} is VALID [2021-09-13 14:25:57,262 INFO L281 TraceCheckUtils]: 392: Hoare triple {13055#(<= ~counter~0 43)} assume main_~a~0 > main_~b~0;main_~a~0 := main_~a~0 - main_~b~0;main_~p~0 := main_~p~0 - main_~q~0;main_~r~0 := main_~r~0 - main_~s~0; {13055#(<= ~counter~0 43)} is VALID [2021-09-13 14:25:57,263 INFO L281 TraceCheckUtils]: 393: Hoare triple {13055#(<= ~counter~0 43)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {13083#(<= ~counter~0 44)} is VALID [2021-09-13 14:25:57,263 INFO L281 TraceCheckUtils]: 394: Hoare triple {13083#(<= ~counter~0 44)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 1 == main_~p~0 * main_~s~0 - main_~r~0 * main_~q~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {13083#(<= ~counter~0 44)} is VALID [2021-09-13 14:25:57,263 INFO L281 TraceCheckUtils]: 395: Hoare triple {13083#(<= ~counter~0 44)} assume !(0 == __VERIFIER_assert_~cond); {13083#(<= ~counter~0 44)} is VALID [2021-09-13 14:25:57,264 INFO L281 TraceCheckUtils]: 396: Hoare triple {13083#(<= ~counter~0 44)} __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; {13083#(<= ~counter~0 44)} is VALID [2021-09-13 14:25:57,264 INFO L281 TraceCheckUtils]: 397: Hoare triple {13083#(<= ~counter~0 44)} assume !(0 == __VERIFIER_assert_~cond); {13083#(<= ~counter~0 44)} is VALID [2021-09-13 14:25:57,264 INFO L281 TraceCheckUtils]: 398: Hoare triple {13083#(<= ~counter~0 44)} __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; {13083#(<= ~counter~0 44)} is VALID [2021-09-13 14:25:57,264 INFO L281 TraceCheckUtils]: 399: Hoare triple {13083#(<= ~counter~0 44)} assume !(0 == __VERIFIER_assert_~cond); {13083#(<= ~counter~0 44)} is VALID [2021-09-13 14:25:57,265 INFO L281 TraceCheckUtils]: 400: Hoare triple {13083#(<= ~counter~0 44)} assume !!(main_~a~0 != main_~b~0); {13083#(<= ~counter~0 44)} is VALID [2021-09-13 14:25:57,265 INFO L281 TraceCheckUtils]: 401: Hoare triple {13083#(<= ~counter~0 44)} assume main_~a~0 > main_~b~0;main_~a~0 := main_~a~0 - main_~b~0;main_~p~0 := main_~p~0 - main_~q~0;main_~r~0 := main_~r~0 - main_~s~0; {13083#(<= ~counter~0 44)} is VALID [2021-09-13 14:25:57,265 INFO L281 TraceCheckUtils]: 402: Hoare triple {13083#(<= ~counter~0 44)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {13111#(<= ~counter~0 45)} is VALID [2021-09-13 14:25:57,265 INFO L281 TraceCheckUtils]: 403: Hoare triple {13111#(<= ~counter~0 45)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 1 == main_~p~0 * main_~s~0 - main_~r~0 * main_~q~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {13111#(<= ~counter~0 45)} is VALID [2021-09-13 14:25:57,266 INFO L281 TraceCheckUtils]: 404: Hoare triple {13111#(<= ~counter~0 45)} assume !(0 == __VERIFIER_assert_~cond); {13111#(<= ~counter~0 45)} is VALID [2021-09-13 14:25:57,266 INFO L281 TraceCheckUtils]: 405: Hoare triple {13111#(<= ~counter~0 45)} __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; {13111#(<= ~counter~0 45)} is VALID [2021-09-13 14:25:57,266 INFO L281 TraceCheckUtils]: 406: Hoare triple {13111#(<= ~counter~0 45)} assume !(0 == __VERIFIER_assert_~cond); {13111#(<= ~counter~0 45)} is VALID [2021-09-13 14:25:57,266 INFO L281 TraceCheckUtils]: 407: Hoare triple {13111#(<= ~counter~0 45)} __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; {13111#(<= ~counter~0 45)} is VALID [2021-09-13 14:25:57,267 INFO L281 TraceCheckUtils]: 408: Hoare triple {13111#(<= ~counter~0 45)} assume !(0 == __VERIFIER_assert_~cond); {13111#(<= ~counter~0 45)} is VALID [2021-09-13 14:25:57,267 INFO L281 TraceCheckUtils]: 409: Hoare triple {13111#(<= ~counter~0 45)} assume !!(main_~a~0 != main_~b~0); {13111#(<= ~counter~0 45)} is VALID [2021-09-13 14:25:57,267 INFO L281 TraceCheckUtils]: 410: Hoare triple {13111#(<= ~counter~0 45)} assume main_~a~0 > main_~b~0;main_~a~0 := main_~a~0 - main_~b~0;main_~p~0 := main_~p~0 - main_~q~0;main_~r~0 := main_~r~0 - main_~s~0; {13111#(<= ~counter~0 45)} is VALID [2021-09-13 14:25:57,268 INFO L281 TraceCheckUtils]: 411: Hoare triple {13111#(<= ~counter~0 45)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {13139#(<= ~counter~0 46)} is VALID [2021-09-13 14:25:57,268 INFO L281 TraceCheckUtils]: 412: Hoare triple {13139#(<= ~counter~0 46)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 1 == main_~p~0 * main_~s~0 - main_~r~0 * main_~q~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {13139#(<= ~counter~0 46)} is VALID [2021-09-13 14:25:57,268 INFO L281 TraceCheckUtils]: 413: Hoare triple {13139#(<= ~counter~0 46)} assume !(0 == __VERIFIER_assert_~cond); {13139#(<= ~counter~0 46)} is VALID [2021-09-13 14:25:57,268 INFO L281 TraceCheckUtils]: 414: Hoare triple {13139#(<= ~counter~0 46)} __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; {13139#(<= ~counter~0 46)} is VALID [2021-09-13 14:25:57,268 INFO L281 TraceCheckUtils]: 415: Hoare triple {13139#(<= ~counter~0 46)} assume !(0 == __VERIFIER_assert_~cond); {13139#(<= ~counter~0 46)} is VALID [2021-09-13 14:25:57,269 INFO L281 TraceCheckUtils]: 416: Hoare triple {13139#(<= ~counter~0 46)} __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; {13139#(<= ~counter~0 46)} is VALID [2021-09-13 14:25:57,269 INFO L281 TraceCheckUtils]: 417: Hoare triple {13139#(<= ~counter~0 46)} assume !(0 == __VERIFIER_assert_~cond); {13139#(<= ~counter~0 46)} is VALID [2021-09-13 14:25:57,269 INFO L281 TraceCheckUtils]: 418: Hoare triple {13139#(<= ~counter~0 46)} assume !!(main_~a~0 != main_~b~0); {13139#(<= ~counter~0 46)} is VALID [2021-09-13 14:25:57,269 INFO L281 TraceCheckUtils]: 419: Hoare triple {13139#(<= ~counter~0 46)} assume main_~a~0 > main_~b~0;main_~a~0 := main_~a~0 - main_~b~0;main_~p~0 := main_~p~0 - main_~q~0;main_~r~0 := main_~r~0 - main_~s~0; {13139#(<= ~counter~0 46)} is VALID [2021-09-13 14:25:57,270 INFO L281 TraceCheckUtils]: 420: Hoare triple {13139#(<= ~counter~0 46)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {13167#(<= |ULTIMATE.start_main_#t~post9| 46)} is VALID [2021-09-13 14:25:57,270 INFO L281 TraceCheckUtils]: 421: Hoare triple {13167#(<= |ULTIMATE.start_main_#t~post9| 46)} assume !(main_#t~post9 < 50);havoc main_#t~post9; {11856#false} is VALID [2021-09-13 14:25:57,270 INFO L281 TraceCheckUtils]: 422: Hoare triple {11856#false} __VERIFIER_assert_#in~cond := (if 0 == main_~a~0 - main_~b~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {11856#false} is VALID [2021-09-13 14:25:57,270 INFO L281 TraceCheckUtils]: 423: Hoare triple {11856#false} assume 0 == __VERIFIER_assert_~cond; {11856#false} is VALID [2021-09-13 14:25:57,270 INFO L281 TraceCheckUtils]: 424: Hoare triple {11856#false} assume !false; {11856#false} is VALID [2021-09-13 14:25:57,274 INFO L134 CoverageAnalysis]: Checked inductivity of 9407 backedges. 0 proven. 9407 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:25:57,274 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 14:25:58,948 INFO L281 TraceCheckUtils]: 424: Hoare triple {11856#false} assume !false; {11856#false} is VALID [2021-09-13 14:25:58,948 INFO L281 TraceCheckUtils]: 423: Hoare triple {11856#false} assume 0 == __VERIFIER_assert_~cond; {11856#false} is VALID [2021-09-13 14:25:58,948 INFO L281 TraceCheckUtils]: 422: Hoare triple {11856#false} __VERIFIER_assert_#in~cond := (if 0 == main_~a~0 - main_~b~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {11856#false} is VALID [2021-09-13 14:25:58,949 INFO L281 TraceCheckUtils]: 421: Hoare triple {13189#(< |ULTIMATE.start_main_#t~post9| 50)} assume !(main_#t~post9 < 50);havoc main_#t~post9; {11856#false} is VALID [2021-09-13 14:25:58,949 INFO L281 TraceCheckUtils]: 420: Hoare triple {13193#(< ~counter~0 50)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {13189#(< |ULTIMATE.start_main_#t~post9| 50)} is VALID [2021-09-13 14:25:58,949 INFO L281 TraceCheckUtils]: 419: Hoare triple {13193#(< ~counter~0 50)} assume main_~a~0 > main_~b~0;main_~a~0 := main_~a~0 - main_~b~0;main_~p~0 := main_~p~0 - main_~q~0;main_~r~0 := main_~r~0 - main_~s~0; {13193#(< ~counter~0 50)} is VALID [2021-09-13 14:25:58,949 INFO L281 TraceCheckUtils]: 418: Hoare triple {13193#(< ~counter~0 50)} assume !!(main_~a~0 != main_~b~0); {13193#(< ~counter~0 50)} is VALID [2021-09-13 14:25:58,950 INFO L281 TraceCheckUtils]: 417: Hoare triple {13193#(< ~counter~0 50)} assume !(0 == __VERIFIER_assert_~cond); {13193#(< ~counter~0 50)} is VALID [2021-09-13 14:25:58,950 INFO L281 TraceCheckUtils]: 416: Hoare triple {13193#(< ~counter~0 50)} __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; {13193#(< ~counter~0 50)} is VALID [2021-09-13 14:25:58,950 INFO L281 TraceCheckUtils]: 415: Hoare triple {13193#(< ~counter~0 50)} assume !(0 == __VERIFIER_assert_~cond); {13193#(< ~counter~0 50)} is VALID [2021-09-13 14:25:58,950 INFO L281 TraceCheckUtils]: 414: Hoare triple {13193#(< ~counter~0 50)} __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; {13193#(< ~counter~0 50)} is VALID [2021-09-13 14:25:58,950 INFO L281 TraceCheckUtils]: 413: Hoare triple {13193#(< ~counter~0 50)} assume !(0 == __VERIFIER_assert_~cond); {13193#(< ~counter~0 50)} is VALID [2021-09-13 14:25:58,951 INFO L281 TraceCheckUtils]: 412: Hoare triple {13193#(< ~counter~0 50)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 1 == main_~p~0 * main_~s~0 - main_~r~0 * main_~q~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {13193#(< ~counter~0 50)} is VALID [2021-09-13 14:25:58,951 INFO L281 TraceCheckUtils]: 411: Hoare triple {13221#(< ~counter~0 49)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {13193#(< ~counter~0 50)} is VALID [2021-09-13 14:25:58,951 INFO L281 TraceCheckUtils]: 410: Hoare triple {13221#(< ~counter~0 49)} assume main_~a~0 > main_~b~0;main_~a~0 := main_~a~0 - main_~b~0;main_~p~0 := main_~p~0 - main_~q~0;main_~r~0 := main_~r~0 - main_~s~0; {13221#(< ~counter~0 49)} is VALID [2021-09-13 14:25:58,952 INFO L281 TraceCheckUtils]: 409: Hoare triple {13221#(< ~counter~0 49)} assume !!(main_~a~0 != main_~b~0); {13221#(< ~counter~0 49)} is VALID [2021-09-13 14:25:58,952 INFO L281 TraceCheckUtils]: 408: Hoare triple {13221#(< ~counter~0 49)} assume !(0 == __VERIFIER_assert_~cond); {13221#(< ~counter~0 49)} is VALID [2021-09-13 14:25:58,952 INFO L281 TraceCheckUtils]: 407: Hoare triple {13221#(< ~counter~0 49)} __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; {13221#(< ~counter~0 49)} is VALID [2021-09-13 14:25:58,952 INFO L281 TraceCheckUtils]: 406: Hoare triple {13221#(< ~counter~0 49)} assume !(0 == __VERIFIER_assert_~cond); {13221#(< ~counter~0 49)} is VALID [2021-09-13 14:25:58,952 INFO L281 TraceCheckUtils]: 405: Hoare triple {13221#(< ~counter~0 49)} __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; {13221#(< ~counter~0 49)} is VALID [2021-09-13 14:25:58,953 INFO L281 TraceCheckUtils]: 404: Hoare triple {13221#(< ~counter~0 49)} assume !(0 == __VERIFIER_assert_~cond); {13221#(< ~counter~0 49)} is VALID [2021-09-13 14:25:58,953 INFO L281 TraceCheckUtils]: 403: Hoare triple {13221#(< ~counter~0 49)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 1 == main_~p~0 * main_~s~0 - main_~r~0 * main_~q~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {13221#(< ~counter~0 49)} is VALID [2021-09-13 14:25:58,953 INFO L281 TraceCheckUtils]: 402: Hoare triple {13249#(< ~counter~0 48)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {13221#(< ~counter~0 49)} is VALID [2021-09-13 14:25:58,953 INFO L281 TraceCheckUtils]: 401: Hoare triple {13249#(< ~counter~0 48)} assume main_~a~0 > main_~b~0;main_~a~0 := main_~a~0 - main_~b~0;main_~p~0 := main_~p~0 - main_~q~0;main_~r~0 := main_~r~0 - main_~s~0; {13249#(< ~counter~0 48)} is VALID [2021-09-13 14:25:58,954 INFO L281 TraceCheckUtils]: 400: Hoare triple {13249#(< ~counter~0 48)} assume !!(main_~a~0 != main_~b~0); {13249#(< ~counter~0 48)} is VALID [2021-09-13 14:25:58,954 INFO L281 TraceCheckUtils]: 399: Hoare triple {13249#(< ~counter~0 48)} assume !(0 == __VERIFIER_assert_~cond); {13249#(< ~counter~0 48)} is VALID [2021-09-13 14:25:58,954 INFO L281 TraceCheckUtils]: 398: Hoare triple {13249#(< ~counter~0 48)} __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; {13249#(< ~counter~0 48)} is VALID [2021-09-13 14:25:58,954 INFO L281 TraceCheckUtils]: 397: Hoare triple {13249#(< ~counter~0 48)} assume !(0 == __VERIFIER_assert_~cond); {13249#(< ~counter~0 48)} is VALID [2021-09-13 14:25:58,955 INFO L281 TraceCheckUtils]: 396: Hoare triple {13249#(< ~counter~0 48)} __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; {13249#(< ~counter~0 48)} is VALID [2021-09-13 14:25:58,955 INFO L281 TraceCheckUtils]: 395: Hoare triple {13249#(< ~counter~0 48)} assume !(0 == __VERIFIER_assert_~cond); {13249#(< ~counter~0 48)} is VALID [2021-09-13 14:25:58,955 INFO L281 TraceCheckUtils]: 394: Hoare triple {13249#(< ~counter~0 48)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 1 == main_~p~0 * main_~s~0 - main_~r~0 * main_~q~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {13249#(< ~counter~0 48)} is VALID [2021-09-13 14:25:58,955 INFO L281 TraceCheckUtils]: 393: Hoare triple {13139#(<= ~counter~0 46)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {13249#(< ~counter~0 48)} is VALID [2021-09-13 14:25:58,955 INFO L281 TraceCheckUtils]: 392: Hoare triple {13139#(<= ~counter~0 46)} assume main_~a~0 > main_~b~0;main_~a~0 := main_~a~0 - main_~b~0;main_~p~0 := main_~p~0 - main_~q~0;main_~r~0 := main_~r~0 - main_~s~0; {13139#(<= ~counter~0 46)} is VALID [2021-09-13 14:25:58,956 INFO L281 TraceCheckUtils]: 391: Hoare triple {13139#(<= ~counter~0 46)} assume !!(main_~a~0 != main_~b~0); {13139#(<= ~counter~0 46)} is VALID [2021-09-13 14:25:58,956 INFO L281 TraceCheckUtils]: 390: Hoare triple {13139#(<= ~counter~0 46)} assume !(0 == __VERIFIER_assert_~cond); {13139#(<= ~counter~0 46)} is VALID [2021-09-13 14:25:58,956 INFO L281 TraceCheckUtils]: 389: Hoare triple {13139#(<= ~counter~0 46)} __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; {13139#(<= ~counter~0 46)} is VALID [2021-09-13 14:25:58,956 INFO L281 TraceCheckUtils]: 388: Hoare triple {13139#(<= ~counter~0 46)} assume !(0 == __VERIFIER_assert_~cond); {13139#(<= ~counter~0 46)} is VALID [2021-09-13 14:25:58,957 INFO L281 TraceCheckUtils]: 387: Hoare triple {13139#(<= ~counter~0 46)} __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; {13139#(<= ~counter~0 46)} is VALID [2021-09-13 14:25:58,957 INFO L281 TraceCheckUtils]: 386: Hoare triple {13139#(<= ~counter~0 46)} assume !(0 == __VERIFIER_assert_~cond); {13139#(<= ~counter~0 46)} is VALID [2021-09-13 14:25:58,957 INFO L281 TraceCheckUtils]: 385: Hoare triple {13139#(<= ~counter~0 46)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 1 == main_~p~0 * main_~s~0 - main_~r~0 * main_~q~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {13139#(<= ~counter~0 46)} is VALID [2021-09-13 14:25:58,957 INFO L281 TraceCheckUtils]: 384: Hoare triple {13111#(<= ~counter~0 45)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {13139#(<= ~counter~0 46)} is VALID [2021-09-13 14:25:58,957 INFO L281 TraceCheckUtils]: 383: Hoare triple {13111#(<= ~counter~0 45)} assume main_~a~0 > main_~b~0;main_~a~0 := main_~a~0 - main_~b~0;main_~p~0 := main_~p~0 - main_~q~0;main_~r~0 := main_~r~0 - main_~s~0; {13111#(<= ~counter~0 45)} is VALID [2021-09-13 14:25:58,958 INFO L281 TraceCheckUtils]: 382: Hoare triple {13111#(<= ~counter~0 45)} assume !!(main_~a~0 != main_~b~0); {13111#(<= ~counter~0 45)} is VALID [2021-09-13 14:25:58,958 INFO L281 TraceCheckUtils]: 381: Hoare triple {13111#(<= ~counter~0 45)} assume !(0 == __VERIFIER_assert_~cond); {13111#(<= ~counter~0 45)} is VALID [2021-09-13 14:25:58,958 INFO L281 TraceCheckUtils]: 380: Hoare triple {13111#(<= ~counter~0 45)} __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; {13111#(<= ~counter~0 45)} is VALID [2021-09-13 14:25:58,958 INFO L281 TraceCheckUtils]: 379: Hoare triple {13111#(<= ~counter~0 45)} assume !(0 == __VERIFIER_assert_~cond); {13111#(<= ~counter~0 45)} is VALID [2021-09-13 14:25:58,959 INFO L281 TraceCheckUtils]: 378: Hoare triple {13111#(<= ~counter~0 45)} __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; {13111#(<= ~counter~0 45)} is VALID [2021-09-13 14:25:58,959 INFO L281 TraceCheckUtils]: 377: Hoare triple {13111#(<= ~counter~0 45)} assume !(0 == __VERIFIER_assert_~cond); {13111#(<= ~counter~0 45)} is VALID [2021-09-13 14:25:58,959 INFO L281 TraceCheckUtils]: 376: Hoare triple {13111#(<= ~counter~0 45)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 1 == main_~p~0 * main_~s~0 - main_~r~0 * main_~q~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {13111#(<= ~counter~0 45)} is VALID [2021-09-13 14:25:58,959 INFO L281 TraceCheckUtils]: 375: Hoare triple {13083#(<= ~counter~0 44)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {13111#(<= ~counter~0 45)} is VALID [2021-09-13 14:25:58,960 INFO L281 TraceCheckUtils]: 374: Hoare triple {13083#(<= ~counter~0 44)} assume main_~a~0 > main_~b~0;main_~a~0 := main_~a~0 - main_~b~0;main_~p~0 := main_~p~0 - main_~q~0;main_~r~0 := main_~r~0 - main_~s~0; {13083#(<= ~counter~0 44)} is VALID [2021-09-13 14:25:58,960 INFO L281 TraceCheckUtils]: 373: Hoare triple {13083#(<= ~counter~0 44)} assume !!(main_~a~0 != main_~b~0); {13083#(<= ~counter~0 44)} is VALID [2021-09-13 14:25:58,960 INFO L281 TraceCheckUtils]: 372: Hoare triple {13083#(<= ~counter~0 44)} assume !(0 == __VERIFIER_assert_~cond); {13083#(<= ~counter~0 44)} is VALID [2021-09-13 14:25:58,960 INFO L281 TraceCheckUtils]: 371: Hoare triple {13083#(<= ~counter~0 44)} __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; {13083#(<= ~counter~0 44)} is VALID [2021-09-13 14:25:58,960 INFO L281 TraceCheckUtils]: 370: Hoare triple {13083#(<= ~counter~0 44)} assume !(0 == __VERIFIER_assert_~cond); {13083#(<= ~counter~0 44)} is VALID [2021-09-13 14:25:58,961 INFO L281 TraceCheckUtils]: 369: Hoare triple {13083#(<= ~counter~0 44)} __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; {13083#(<= ~counter~0 44)} is VALID [2021-09-13 14:25:58,961 INFO L281 TraceCheckUtils]: 368: Hoare triple {13083#(<= ~counter~0 44)} assume !(0 == __VERIFIER_assert_~cond); {13083#(<= ~counter~0 44)} is VALID [2021-09-13 14:25:58,961 INFO L281 TraceCheckUtils]: 367: Hoare triple {13083#(<= ~counter~0 44)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 1 == main_~p~0 * main_~s~0 - main_~r~0 * main_~q~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {13083#(<= ~counter~0 44)} is VALID [2021-09-13 14:25:58,962 INFO L281 TraceCheckUtils]: 366: Hoare triple {13055#(<= ~counter~0 43)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {13083#(<= ~counter~0 44)} is VALID [2021-09-13 14:25:58,962 INFO L281 TraceCheckUtils]: 365: Hoare triple {13055#(<= ~counter~0 43)} assume main_~a~0 > main_~b~0;main_~a~0 := main_~a~0 - main_~b~0;main_~p~0 := main_~p~0 - main_~q~0;main_~r~0 := main_~r~0 - main_~s~0; {13055#(<= ~counter~0 43)} is VALID [2021-09-13 14:25:58,962 INFO L281 TraceCheckUtils]: 364: Hoare triple {13055#(<= ~counter~0 43)} assume !!(main_~a~0 != main_~b~0); {13055#(<= ~counter~0 43)} is VALID [2021-09-13 14:25:58,962 INFO L281 TraceCheckUtils]: 363: Hoare triple {13055#(<= ~counter~0 43)} assume !(0 == __VERIFIER_assert_~cond); {13055#(<= ~counter~0 43)} is VALID [2021-09-13 14:25:58,962 INFO L281 TraceCheckUtils]: 362: Hoare triple {13055#(<= ~counter~0 43)} __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; {13055#(<= ~counter~0 43)} is VALID [2021-09-13 14:25:58,963 INFO L281 TraceCheckUtils]: 361: Hoare triple {13055#(<= ~counter~0 43)} assume !(0 == __VERIFIER_assert_~cond); {13055#(<= ~counter~0 43)} is VALID [2021-09-13 14:25:58,963 INFO L281 TraceCheckUtils]: 360: Hoare triple {13055#(<= ~counter~0 43)} __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; {13055#(<= ~counter~0 43)} is VALID [2021-09-13 14:25:58,963 INFO L281 TraceCheckUtils]: 359: Hoare triple {13055#(<= ~counter~0 43)} assume !(0 == __VERIFIER_assert_~cond); {13055#(<= ~counter~0 43)} is VALID [2021-09-13 14:25:58,963 INFO L281 TraceCheckUtils]: 358: Hoare triple {13055#(<= ~counter~0 43)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 1 == main_~p~0 * main_~s~0 - main_~r~0 * main_~q~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {13055#(<= ~counter~0 43)} is VALID [2021-09-13 14:25:58,964 INFO L281 TraceCheckUtils]: 357: Hoare triple {13027#(<= ~counter~0 42)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {13055#(<= ~counter~0 43)} is VALID [2021-09-13 14:25:58,964 INFO L281 TraceCheckUtils]: 356: Hoare triple {13027#(<= ~counter~0 42)} assume main_~a~0 > main_~b~0;main_~a~0 := main_~a~0 - main_~b~0;main_~p~0 := main_~p~0 - main_~q~0;main_~r~0 := main_~r~0 - main_~s~0; {13027#(<= ~counter~0 42)} is VALID [2021-09-13 14:25:58,964 INFO L281 TraceCheckUtils]: 355: Hoare triple {13027#(<= ~counter~0 42)} assume !!(main_~a~0 != main_~b~0); {13027#(<= ~counter~0 42)} is VALID [2021-09-13 14:25:58,964 INFO L281 TraceCheckUtils]: 354: Hoare triple {13027#(<= ~counter~0 42)} assume !(0 == __VERIFIER_assert_~cond); {13027#(<= ~counter~0 42)} is VALID [2021-09-13 14:25:58,965 INFO L281 TraceCheckUtils]: 353: Hoare triple {13027#(<= ~counter~0 42)} __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; {13027#(<= ~counter~0 42)} is VALID [2021-09-13 14:25:58,965 INFO L281 TraceCheckUtils]: 352: Hoare triple {13027#(<= ~counter~0 42)} assume !(0 == __VERIFIER_assert_~cond); {13027#(<= ~counter~0 42)} is VALID [2021-09-13 14:25:58,965 INFO L281 TraceCheckUtils]: 351: Hoare triple {13027#(<= ~counter~0 42)} __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; {13027#(<= ~counter~0 42)} is VALID [2021-09-13 14:25:58,965 INFO L281 TraceCheckUtils]: 350: Hoare triple {13027#(<= ~counter~0 42)} assume !(0 == __VERIFIER_assert_~cond); {13027#(<= ~counter~0 42)} is VALID [2021-09-13 14:25:58,965 INFO L281 TraceCheckUtils]: 349: Hoare triple {13027#(<= ~counter~0 42)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 1 == main_~p~0 * main_~s~0 - main_~r~0 * main_~q~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {13027#(<= ~counter~0 42)} is VALID [2021-09-13 14:25:58,966 INFO L281 TraceCheckUtils]: 348: Hoare triple {12999#(<= ~counter~0 41)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {13027#(<= ~counter~0 42)} is VALID [2021-09-13 14:25:58,966 INFO L281 TraceCheckUtils]: 347: Hoare triple {12999#(<= ~counter~0 41)} assume main_~a~0 > main_~b~0;main_~a~0 := main_~a~0 - main_~b~0;main_~p~0 := main_~p~0 - main_~q~0;main_~r~0 := main_~r~0 - main_~s~0; {12999#(<= ~counter~0 41)} is VALID [2021-09-13 14:25:58,966 INFO L281 TraceCheckUtils]: 346: Hoare triple {12999#(<= ~counter~0 41)} assume !!(main_~a~0 != main_~b~0); {12999#(<= ~counter~0 41)} is VALID [2021-09-13 14:25:58,966 INFO L281 TraceCheckUtils]: 345: Hoare triple {12999#(<= ~counter~0 41)} assume !(0 == __VERIFIER_assert_~cond); {12999#(<= ~counter~0 41)} is VALID [2021-09-13 14:25:58,967 INFO L281 TraceCheckUtils]: 344: Hoare triple {12999#(<= ~counter~0 41)} __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; {12999#(<= ~counter~0 41)} is VALID [2021-09-13 14:25:58,967 INFO L281 TraceCheckUtils]: 343: Hoare triple {12999#(<= ~counter~0 41)} assume !(0 == __VERIFIER_assert_~cond); {12999#(<= ~counter~0 41)} is VALID [2021-09-13 14:25:58,967 INFO L281 TraceCheckUtils]: 342: Hoare triple {12999#(<= ~counter~0 41)} __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; {12999#(<= ~counter~0 41)} is VALID [2021-09-13 14:25:58,967 INFO L281 TraceCheckUtils]: 341: Hoare triple {12999#(<= ~counter~0 41)} assume !(0 == __VERIFIER_assert_~cond); {12999#(<= ~counter~0 41)} is VALID [2021-09-13 14:25:58,967 INFO L281 TraceCheckUtils]: 340: Hoare triple {12999#(<= ~counter~0 41)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 1 == main_~p~0 * main_~s~0 - main_~r~0 * main_~q~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {12999#(<= ~counter~0 41)} is VALID [2021-09-13 14:25:58,968 INFO L281 TraceCheckUtils]: 339: Hoare triple {12971#(<= ~counter~0 40)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {12999#(<= ~counter~0 41)} is VALID [2021-09-13 14:25:58,968 INFO L281 TraceCheckUtils]: 338: Hoare triple {12971#(<= ~counter~0 40)} assume main_~a~0 > main_~b~0;main_~a~0 := main_~a~0 - main_~b~0;main_~p~0 := main_~p~0 - main_~q~0;main_~r~0 := main_~r~0 - main_~s~0; {12971#(<= ~counter~0 40)} is VALID [2021-09-13 14:25:58,968 INFO L281 TraceCheckUtils]: 337: Hoare triple {12971#(<= ~counter~0 40)} assume !!(main_~a~0 != main_~b~0); {12971#(<= ~counter~0 40)} is VALID [2021-09-13 14:25:58,968 INFO L281 TraceCheckUtils]: 336: Hoare triple {12971#(<= ~counter~0 40)} assume !(0 == __VERIFIER_assert_~cond); {12971#(<= ~counter~0 40)} is VALID [2021-09-13 14:25:58,969 INFO L281 TraceCheckUtils]: 335: Hoare triple {12971#(<= ~counter~0 40)} __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; {12971#(<= ~counter~0 40)} is VALID [2021-09-13 14:25:58,969 INFO L281 TraceCheckUtils]: 334: Hoare triple {12971#(<= ~counter~0 40)} assume !(0 == __VERIFIER_assert_~cond); {12971#(<= ~counter~0 40)} is VALID [2021-09-13 14:25:58,969 INFO L281 TraceCheckUtils]: 333: Hoare triple {12971#(<= ~counter~0 40)} __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; {12971#(<= ~counter~0 40)} is VALID [2021-09-13 14:25:58,969 INFO L281 TraceCheckUtils]: 332: Hoare triple {12971#(<= ~counter~0 40)} assume !(0 == __VERIFIER_assert_~cond); {12971#(<= ~counter~0 40)} is VALID [2021-09-13 14:25:58,969 INFO L281 TraceCheckUtils]: 331: Hoare triple {12971#(<= ~counter~0 40)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 1 == main_~p~0 * main_~s~0 - main_~r~0 * main_~q~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {12971#(<= ~counter~0 40)} is VALID [2021-09-13 14:25:58,970 INFO L281 TraceCheckUtils]: 330: Hoare triple {12943#(<= ~counter~0 39)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {12971#(<= ~counter~0 40)} is VALID [2021-09-13 14:25:58,970 INFO L281 TraceCheckUtils]: 329: Hoare triple {12943#(<= ~counter~0 39)} assume main_~a~0 > main_~b~0;main_~a~0 := main_~a~0 - main_~b~0;main_~p~0 := main_~p~0 - main_~q~0;main_~r~0 := main_~r~0 - main_~s~0; {12943#(<= ~counter~0 39)} is VALID [2021-09-13 14:25:58,970 INFO L281 TraceCheckUtils]: 328: Hoare triple {12943#(<= ~counter~0 39)} assume !!(main_~a~0 != main_~b~0); {12943#(<= ~counter~0 39)} is VALID [2021-09-13 14:25:58,970 INFO L281 TraceCheckUtils]: 327: Hoare triple {12943#(<= ~counter~0 39)} assume !(0 == __VERIFIER_assert_~cond); {12943#(<= ~counter~0 39)} is VALID [2021-09-13 14:25:58,971 INFO L281 TraceCheckUtils]: 326: Hoare triple {12943#(<= ~counter~0 39)} __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; {12943#(<= ~counter~0 39)} is VALID [2021-09-13 14:25:58,971 INFO L281 TraceCheckUtils]: 325: Hoare triple {12943#(<= ~counter~0 39)} assume !(0 == __VERIFIER_assert_~cond); {12943#(<= ~counter~0 39)} is VALID [2021-09-13 14:25:58,971 INFO L281 TraceCheckUtils]: 324: Hoare triple {12943#(<= ~counter~0 39)} __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; {12943#(<= ~counter~0 39)} is VALID [2021-09-13 14:25:58,971 INFO L281 TraceCheckUtils]: 323: Hoare triple {12943#(<= ~counter~0 39)} assume !(0 == __VERIFIER_assert_~cond); {12943#(<= ~counter~0 39)} is VALID [2021-09-13 14:25:58,971 INFO L281 TraceCheckUtils]: 322: Hoare triple {12943#(<= ~counter~0 39)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 1 == main_~p~0 * main_~s~0 - main_~r~0 * main_~q~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {12943#(<= ~counter~0 39)} is VALID [2021-09-13 14:25:58,972 INFO L281 TraceCheckUtils]: 321: Hoare triple {12915#(<= ~counter~0 38)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {12943#(<= ~counter~0 39)} is VALID [2021-09-13 14:25:58,972 INFO L281 TraceCheckUtils]: 320: Hoare triple {12915#(<= ~counter~0 38)} assume main_~a~0 > main_~b~0;main_~a~0 := main_~a~0 - main_~b~0;main_~p~0 := main_~p~0 - main_~q~0;main_~r~0 := main_~r~0 - main_~s~0; {12915#(<= ~counter~0 38)} is VALID [2021-09-13 14:25:58,972 INFO L281 TraceCheckUtils]: 319: Hoare triple {12915#(<= ~counter~0 38)} assume !!(main_~a~0 != main_~b~0); {12915#(<= ~counter~0 38)} is VALID [2021-09-13 14:25:58,972 INFO L281 TraceCheckUtils]: 318: Hoare triple {12915#(<= ~counter~0 38)} assume !(0 == __VERIFIER_assert_~cond); {12915#(<= ~counter~0 38)} is VALID [2021-09-13 14:25:58,973 INFO L281 TraceCheckUtils]: 317: Hoare triple {12915#(<= ~counter~0 38)} __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; {12915#(<= ~counter~0 38)} is VALID [2021-09-13 14:25:58,973 INFO L281 TraceCheckUtils]: 316: Hoare triple {12915#(<= ~counter~0 38)} assume !(0 == __VERIFIER_assert_~cond); {12915#(<= ~counter~0 38)} is VALID [2021-09-13 14:25:58,973 INFO L281 TraceCheckUtils]: 315: Hoare triple {12915#(<= ~counter~0 38)} __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; {12915#(<= ~counter~0 38)} is VALID [2021-09-13 14:25:58,973 INFO L281 TraceCheckUtils]: 314: Hoare triple {12915#(<= ~counter~0 38)} assume !(0 == __VERIFIER_assert_~cond); {12915#(<= ~counter~0 38)} is VALID [2021-09-13 14:25:58,973 INFO L281 TraceCheckUtils]: 313: Hoare triple {12915#(<= ~counter~0 38)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 1 == main_~p~0 * main_~s~0 - main_~r~0 * main_~q~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {12915#(<= ~counter~0 38)} is VALID [2021-09-13 14:25:58,974 INFO L281 TraceCheckUtils]: 312: Hoare triple {12887#(<= ~counter~0 37)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {12915#(<= ~counter~0 38)} is VALID [2021-09-13 14:25:58,974 INFO L281 TraceCheckUtils]: 311: Hoare triple {12887#(<= ~counter~0 37)} assume main_~a~0 > main_~b~0;main_~a~0 := main_~a~0 - main_~b~0;main_~p~0 := main_~p~0 - main_~q~0;main_~r~0 := main_~r~0 - main_~s~0; {12887#(<= ~counter~0 37)} is VALID [2021-09-13 14:25:58,974 INFO L281 TraceCheckUtils]: 310: Hoare triple {12887#(<= ~counter~0 37)} assume !!(main_~a~0 != main_~b~0); {12887#(<= ~counter~0 37)} is VALID [2021-09-13 14:25:58,974 INFO L281 TraceCheckUtils]: 309: Hoare triple {12887#(<= ~counter~0 37)} assume !(0 == __VERIFIER_assert_~cond); {12887#(<= ~counter~0 37)} is VALID [2021-09-13 14:25:58,975 INFO L281 TraceCheckUtils]: 308: Hoare triple {12887#(<= ~counter~0 37)} __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; {12887#(<= ~counter~0 37)} is VALID [2021-09-13 14:25:58,975 INFO L281 TraceCheckUtils]: 307: Hoare triple {12887#(<= ~counter~0 37)} assume !(0 == __VERIFIER_assert_~cond); {12887#(<= ~counter~0 37)} is VALID [2021-09-13 14:25:58,975 INFO L281 TraceCheckUtils]: 306: Hoare triple {12887#(<= ~counter~0 37)} __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; {12887#(<= ~counter~0 37)} is VALID [2021-09-13 14:25:58,975 INFO L281 TraceCheckUtils]: 305: Hoare triple {12887#(<= ~counter~0 37)} assume !(0 == __VERIFIER_assert_~cond); {12887#(<= ~counter~0 37)} is VALID [2021-09-13 14:25:58,975 INFO L281 TraceCheckUtils]: 304: Hoare triple {12887#(<= ~counter~0 37)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 1 == main_~p~0 * main_~s~0 - main_~r~0 * main_~q~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {12887#(<= ~counter~0 37)} is VALID [2021-09-13 14:25:58,976 INFO L281 TraceCheckUtils]: 303: Hoare triple {12859#(<= ~counter~0 36)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {12887#(<= ~counter~0 37)} is VALID [2021-09-13 14:25:58,977 INFO L281 TraceCheckUtils]: 302: Hoare triple {12859#(<= ~counter~0 36)} assume main_~a~0 > main_~b~0;main_~a~0 := main_~a~0 - main_~b~0;main_~p~0 := main_~p~0 - main_~q~0;main_~r~0 := main_~r~0 - main_~s~0; {12859#(<= ~counter~0 36)} is VALID [2021-09-13 14:25:58,977 INFO L281 TraceCheckUtils]: 301: Hoare triple {12859#(<= ~counter~0 36)} assume !!(main_~a~0 != main_~b~0); {12859#(<= ~counter~0 36)} is VALID [2021-09-13 14:25:58,979 INFO L281 TraceCheckUtils]: 300: Hoare triple {12859#(<= ~counter~0 36)} assume !(0 == __VERIFIER_assert_~cond); {12859#(<= ~counter~0 36)} is VALID [2021-09-13 14:25:58,980 INFO L281 TraceCheckUtils]: 299: Hoare triple {12859#(<= ~counter~0 36)} __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; {12859#(<= ~counter~0 36)} is VALID [2021-09-13 14:25:58,980 INFO L281 TraceCheckUtils]: 298: Hoare triple {12859#(<= ~counter~0 36)} assume !(0 == __VERIFIER_assert_~cond); {12859#(<= ~counter~0 36)} is VALID [2021-09-13 14:25:58,980 INFO L281 TraceCheckUtils]: 297: Hoare triple {12859#(<= ~counter~0 36)} __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; {12859#(<= ~counter~0 36)} is VALID [2021-09-13 14:25:58,980 INFO L281 TraceCheckUtils]: 296: Hoare triple {12859#(<= ~counter~0 36)} assume !(0 == __VERIFIER_assert_~cond); {12859#(<= ~counter~0 36)} is VALID [2021-09-13 14:25:58,980 INFO L281 TraceCheckUtils]: 295: Hoare triple {12859#(<= ~counter~0 36)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 1 == main_~p~0 * main_~s~0 - main_~r~0 * main_~q~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {12859#(<= ~counter~0 36)} is VALID [2021-09-13 14:25:58,981 INFO L281 TraceCheckUtils]: 294: Hoare triple {12831#(<= ~counter~0 35)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {12859#(<= ~counter~0 36)} is VALID [2021-09-13 14:25:58,981 INFO L281 TraceCheckUtils]: 293: Hoare triple {12831#(<= ~counter~0 35)} assume main_~a~0 > main_~b~0;main_~a~0 := main_~a~0 - main_~b~0;main_~p~0 := main_~p~0 - main_~q~0;main_~r~0 := main_~r~0 - main_~s~0; {12831#(<= ~counter~0 35)} is VALID [2021-09-13 14:25:58,981 INFO L281 TraceCheckUtils]: 292: Hoare triple {12831#(<= ~counter~0 35)} assume !!(main_~a~0 != main_~b~0); {12831#(<= ~counter~0 35)} is VALID [2021-09-13 14:25:58,982 INFO L281 TraceCheckUtils]: 291: Hoare triple {12831#(<= ~counter~0 35)} assume !(0 == __VERIFIER_assert_~cond); {12831#(<= ~counter~0 35)} is VALID [2021-09-13 14:25:58,982 INFO L281 TraceCheckUtils]: 290: Hoare triple {12831#(<= ~counter~0 35)} __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; {12831#(<= ~counter~0 35)} is VALID [2021-09-13 14:25:58,982 INFO L281 TraceCheckUtils]: 289: Hoare triple {12831#(<= ~counter~0 35)} assume !(0 == __VERIFIER_assert_~cond); {12831#(<= ~counter~0 35)} is VALID [2021-09-13 14:25:58,982 INFO L281 TraceCheckUtils]: 288: Hoare triple {12831#(<= ~counter~0 35)} __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; {12831#(<= ~counter~0 35)} is VALID [2021-09-13 14:25:58,982 INFO L281 TraceCheckUtils]: 287: Hoare triple {12831#(<= ~counter~0 35)} assume !(0 == __VERIFIER_assert_~cond); {12831#(<= ~counter~0 35)} is VALID [2021-09-13 14:25:58,983 INFO L281 TraceCheckUtils]: 286: Hoare triple {12831#(<= ~counter~0 35)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 1 == main_~p~0 * main_~s~0 - main_~r~0 * main_~q~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {12831#(<= ~counter~0 35)} is VALID [2021-09-13 14:25:58,983 INFO L281 TraceCheckUtils]: 285: Hoare triple {12803#(<= ~counter~0 34)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {12831#(<= ~counter~0 35)} is VALID [2021-09-13 14:25:58,983 INFO L281 TraceCheckUtils]: 284: Hoare triple {12803#(<= ~counter~0 34)} assume main_~a~0 > main_~b~0;main_~a~0 := main_~a~0 - main_~b~0;main_~p~0 := main_~p~0 - main_~q~0;main_~r~0 := main_~r~0 - main_~s~0; {12803#(<= ~counter~0 34)} is VALID [2021-09-13 14:25:58,983 INFO L281 TraceCheckUtils]: 283: Hoare triple {12803#(<= ~counter~0 34)} assume !!(main_~a~0 != main_~b~0); {12803#(<= ~counter~0 34)} is VALID [2021-09-13 14:25:58,984 INFO L281 TraceCheckUtils]: 282: Hoare triple {12803#(<= ~counter~0 34)} assume !(0 == __VERIFIER_assert_~cond); {12803#(<= ~counter~0 34)} is VALID [2021-09-13 14:25:58,984 INFO L281 TraceCheckUtils]: 281: Hoare triple {12803#(<= ~counter~0 34)} __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; {12803#(<= ~counter~0 34)} is VALID [2021-09-13 14:25:58,984 INFO L281 TraceCheckUtils]: 280: Hoare triple {12803#(<= ~counter~0 34)} assume !(0 == __VERIFIER_assert_~cond); {12803#(<= ~counter~0 34)} is VALID [2021-09-13 14:25:58,984 INFO L281 TraceCheckUtils]: 279: Hoare triple {12803#(<= ~counter~0 34)} __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; {12803#(<= ~counter~0 34)} is VALID [2021-09-13 14:25:58,984 INFO L281 TraceCheckUtils]: 278: Hoare triple {12803#(<= ~counter~0 34)} assume !(0 == __VERIFIER_assert_~cond); {12803#(<= ~counter~0 34)} is VALID [2021-09-13 14:25:58,985 INFO L281 TraceCheckUtils]: 277: Hoare triple {12803#(<= ~counter~0 34)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 1 == main_~p~0 * main_~s~0 - main_~r~0 * main_~q~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {12803#(<= ~counter~0 34)} is VALID [2021-09-13 14:25:58,985 INFO L281 TraceCheckUtils]: 276: Hoare triple {12775#(<= ~counter~0 33)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {12803#(<= ~counter~0 34)} is VALID [2021-09-13 14:25:58,985 INFO L281 TraceCheckUtils]: 275: Hoare triple {12775#(<= ~counter~0 33)} assume main_~a~0 > main_~b~0;main_~a~0 := main_~a~0 - main_~b~0;main_~p~0 := main_~p~0 - main_~q~0;main_~r~0 := main_~r~0 - main_~s~0; {12775#(<= ~counter~0 33)} is VALID [2021-09-13 14:25:58,985 INFO L281 TraceCheckUtils]: 274: Hoare triple {12775#(<= ~counter~0 33)} assume !!(main_~a~0 != main_~b~0); {12775#(<= ~counter~0 33)} is VALID [2021-09-13 14:25:58,986 INFO L281 TraceCheckUtils]: 273: Hoare triple {12775#(<= ~counter~0 33)} assume !(0 == __VERIFIER_assert_~cond); {12775#(<= ~counter~0 33)} is VALID [2021-09-13 14:25:58,986 INFO L281 TraceCheckUtils]: 272: Hoare triple {12775#(<= ~counter~0 33)} __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; {12775#(<= ~counter~0 33)} is VALID [2021-09-13 14:25:58,986 INFO L281 TraceCheckUtils]: 271: Hoare triple {12775#(<= ~counter~0 33)} assume !(0 == __VERIFIER_assert_~cond); {12775#(<= ~counter~0 33)} is VALID [2021-09-13 14:25:58,986 INFO L281 TraceCheckUtils]: 270: Hoare triple {12775#(<= ~counter~0 33)} __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; {12775#(<= ~counter~0 33)} is VALID [2021-09-13 14:25:58,986 INFO L281 TraceCheckUtils]: 269: Hoare triple {12775#(<= ~counter~0 33)} assume !(0 == __VERIFIER_assert_~cond); {12775#(<= ~counter~0 33)} is VALID [2021-09-13 14:25:58,987 INFO L281 TraceCheckUtils]: 268: Hoare triple {12775#(<= ~counter~0 33)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 1 == main_~p~0 * main_~s~0 - main_~r~0 * main_~q~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {12775#(<= ~counter~0 33)} is VALID [2021-09-13 14:25:58,987 INFO L281 TraceCheckUtils]: 267: Hoare triple {12747#(<= ~counter~0 32)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {12775#(<= ~counter~0 33)} is VALID [2021-09-13 14:25:58,987 INFO L281 TraceCheckUtils]: 266: Hoare triple {12747#(<= ~counter~0 32)} assume main_~a~0 > main_~b~0;main_~a~0 := main_~a~0 - main_~b~0;main_~p~0 := main_~p~0 - main_~q~0;main_~r~0 := main_~r~0 - main_~s~0; {12747#(<= ~counter~0 32)} is VALID [2021-09-13 14:25:58,987 INFO L281 TraceCheckUtils]: 265: Hoare triple {12747#(<= ~counter~0 32)} assume !!(main_~a~0 != main_~b~0); {12747#(<= ~counter~0 32)} is VALID [2021-09-13 14:25:58,988 INFO L281 TraceCheckUtils]: 264: Hoare triple {12747#(<= ~counter~0 32)} assume !(0 == __VERIFIER_assert_~cond); {12747#(<= ~counter~0 32)} is VALID [2021-09-13 14:25:58,988 INFO L281 TraceCheckUtils]: 263: Hoare triple {12747#(<= ~counter~0 32)} __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; {12747#(<= ~counter~0 32)} is VALID [2021-09-13 14:25:58,988 INFO L281 TraceCheckUtils]: 262: Hoare triple {12747#(<= ~counter~0 32)} assume !(0 == __VERIFIER_assert_~cond); {12747#(<= ~counter~0 32)} is VALID [2021-09-13 14:25:58,988 INFO L281 TraceCheckUtils]: 261: Hoare triple {12747#(<= ~counter~0 32)} __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; {12747#(<= ~counter~0 32)} is VALID [2021-09-13 14:25:58,989 INFO L281 TraceCheckUtils]: 260: Hoare triple {12747#(<= ~counter~0 32)} assume !(0 == __VERIFIER_assert_~cond); {12747#(<= ~counter~0 32)} is VALID [2021-09-13 14:25:58,989 INFO L281 TraceCheckUtils]: 259: Hoare triple {12747#(<= ~counter~0 32)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 1 == main_~p~0 * main_~s~0 - main_~r~0 * main_~q~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {12747#(<= ~counter~0 32)} is VALID [2021-09-13 14:25:58,989 INFO L281 TraceCheckUtils]: 258: Hoare triple {12719#(<= ~counter~0 31)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {12747#(<= ~counter~0 32)} is VALID [2021-09-13 14:25:58,989 INFO L281 TraceCheckUtils]: 257: Hoare triple {12719#(<= ~counter~0 31)} assume main_~a~0 > main_~b~0;main_~a~0 := main_~a~0 - main_~b~0;main_~p~0 := main_~p~0 - main_~q~0;main_~r~0 := main_~r~0 - main_~s~0; {12719#(<= ~counter~0 31)} is VALID [2021-09-13 14:25:58,989 INFO L281 TraceCheckUtils]: 256: Hoare triple {12719#(<= ~counter~0 31)} assume !!(main_~a~0 != main_~b~0); {12719#(<= ~counter~0 31)} is VALID [2021-09-13 14:25:58,990 INFO L281 TraceCheckUtils]: 255: Hoare triple {12719#(<= ~counter~0 31)} assume !(0 == __VERIFIER_assert_~cond); {12719#(<= ~counter~0 31)} is VALID [2021-09-13 14:25:58,990 INFO L281 TraceCheckUtils]: 254: Hoare triple {12719#(<= ~counter~0 31)} __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; {12719#(<= ~counter~0 31)} is VALID [2021-09-13 14:25:58,990 INFO L281 TraceCheckUtils]: 253: Hoare triple {12719#(<= ~counter~0 31)} assume !(0 == __VERIFIER_assert_~cond); {12719#(<= ~counter~0 31)} is VALID [2021-09-13 14:25:58,990 INFO L281 TraceCheckUtils]: 252: Hoare triple {12719#(<= ~counter~0 31)} __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; {12719#(<= ~counter~0 31)} is VALID [2021-09-13 14:25:58,990 INFO L281 TraceCheckUtils]: 251: Hoare triple {12719#(<= ~counter~0 31)} assume !(0 == __VERIFIER_assert_~cond); {12719#(<= ~counter~0 31)} is VALID [2021-09-13 14:25:58,991 INFO L281 TraceCheckUtils]: 250: Hoare triple {12719#(<= ~counter~0 31)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 1 == main_~p~0 * main_~s~0 - main_~r~0 * main_~q~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {12719#(<= ~counter~0 31)} is VALID [2021-09-13 14:25:58,991 INFO L281 TraceCheckUtils]: 249: Hoare triple {12691#(<= ~counter~0 30)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {12719#(<= ~counter~0 31)} is VALID [2021-09-13 14:25:58,991 INFO L281 TraceCheckUtils]: 248: Hoare triple {12691#(<= ~counter~0 30)} assume main_~a~0 > main_~b~0;main_~a~0 := main_~a~0 - main_~b~0;main_~p~0 := main_~p~0 - main_~q~0;main_~r~0 := main_~r~0 - main_~s~0; {12691#(<= ~counter~0 30)} is VALID [2021-09-13 14:25:58,991 INFO L281 TraceCheckUtils]: 247: Hoare triple {12691#(<= ~counter~0 30)} assume !!(main_~a~0 != main_~b~0); {12691#(<= ~counter~0 30)} is VALID [2021-09-13 14:25:58,992 INFO L281 TraceCheckUtils]: 246: Hoare triple {12691#(<= ~counter~0 30)} assume !(0 == __VERIFIER_assert_~cond); {12691#(<= ~counter~0 30)} is VALID [2021-09-13 14:25:58,992 INFO L281 TraceCheckUtils]: 245: Hoare triple {12691#(<= ~counter~0 30)} __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; {12691#(<= ~counter~0 30)} is VALID [2021-09-13 14:25:58,992 INFO L281 TraceCheckUtils]: 244: Hoare triple {12691#(<= ~counter~0 30)} assume !(0 == __VERIFIER_assert_~cond); {12691#(<= ~counter~0 30)} is VALID [2021-09-13 14:25:58,992 INFO L281 TraceCheckUtils]: 243: Hoare triple {12691#(<= ~counter~0 30)} __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; {12691#(<= ~counter~0 30)} is VALID [2021-09-13 14:25:58,993 INFO L281 TraceCheckUtils]: 242: Hoare triple {12691#(<= ~counter~0 30)} assume !(0 == __VERIFIER_assert_~cond); {12691#(<= ~counter~0 30)} is VALID [2021-09-13 14:25:58,994 INFO L281 TraceCheckUtils]: 241: Hoare triple {12691#(<= ~counter~0 30)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 1 == main_~p~0 * main_~s~0 - main_~r~0 * main_~q~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {12691#(<= ~counter~0 30)} is VALID [2021-09-13 14:25:58,994 INFO L281 TraceCheckUtils]: 240: Hoare triple {12663#(<= ~counter~0 29)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {12691#(<= ~counter~0 30)} is VALID [2021-09-13 14:25:58,994 INFO L281 TraceCheckUtils]: 239: Hoare triple {12663#(<= ~counter~0 29)} assume main_~a~0 > main_~b~0;main_~a~0 := main_~a~0 - main_~b~0;main_~p~0 := main_~p~0 - main_~q~0;main_~r~0 := main_~r~0 - main_~s~0; {12663#(<= ~counter~0 29)} is VALID [2021-09-13 14:25:58,995 INFO L281 TraceCheckUtils]: 238: Hoare triple {12663#(<= ~counter~0 29)} assume !!(main_~a~0 != main_~b~0); {12663#(<= ~counter~0 29)} is VALID [2021-09-13 14:25:58,995 INFO L281 TraceCheckUtils]: 237: Hoare triple {12663#(<= ~counter~0 29)} assume !(0 == __VERIFIER_assert_~cond); {12663#(<= ~counter~0 29)} is VALID [2021-09-13 14:25:58,995 INFO L281 TraceCheckUtils]: 236: Hoare triple {12663#(<= ~counter~0 29)} __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; {12663#(<= ~counter~0 29)} is VALID [2021-09-13 14:25:58,995 INFO L281 TraceCheckUtils]: 235: Hoare triple {12663#(<= ~counter~0 29)} assume !(0 == __VERIFIER_assert_~cond); {12663#(<= ~counter~0 29)} is VALID [2021-09-13 14:25:58,995 INFO L281 TraceCheckUtils]: 234: Hoare triple {12663#(<= ~counter~0 29)} __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; {12663#(<= ~counter~0 29)} is VALID [2021-09-13 14:25:58,996 INFO L281 TraceCheckUtils]: 233: Hoare triple {12663#(<= ~counter~0 29)} assume !(0 == __VERIFIER_assert_~cond); {12663#(<= ~counter~0 29)} is VALID [2021-09-13 14:25:58,996 INFO L281 TraceCheckUtils]: 232: Hoare triple {12663#(<= ~counter~0 29)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 1 == main_~p~0 * main_~s~0 - main_~r~0 * main_~q~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {12663#(<= ~counter~0 29)} is VALID [2021-09-13 14:25:58,996 INFO L281 TraceCheckUtils]: 231: Hoare triple {12635#(<= ~counter~0 28)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {12663#(<= ~counter~0 29)} is VALID [2021-09-13 14:25:58,996 INFO L281 TraceCheckUtils]: 230: Hoare triple {12635#(<= ~counter~0 28)} assume main_~a~0 > main_~b~0;main_~a~0 := main_~a~0 - main_~b~0;main_~p~0 := main_~p~0 - main_~q~0;main_~r~0 := main_~r~0 - main_~s~0; {12635#(<= ~counter~0 28)} is VALID [2021-09-13 14:25:58,997 INFO L281 TraceCheckUtils]: 229: Hoare triple {12635#(<= ~counter~0 28)} assume !!(main_~a~0 != main_~b~0); {12635#(<= ~counter~0 28)} is VALID [2021-09-13 14:25:58,997 INFO L281 TraceCheckUtils]: 228: Hoare triple {12635#(<= ~counter~0 28)} assume !(0 == __VERIFIER_assert_~cond); {12635#(<= ~counter~0 28)} is VALID [2021-09-13 14:25:58,997 INFO L281 TraceCheckUtils]: 227: Hoare triple {12635#(<= ~counter~0 28)} __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; {12635#(<= ~counter~0 28)} is VALID [2021-09-13 14:25:58,997 INFO L281 TraceCheckUtils]: 226: Hoare triple {12635#(<= ~counter~0 28)} assume !(0 == __VERIFIER_assert_~cond); {12635#(<= ~counter~0 28)} is VALID [2021-09-13 14:25:58,997 INFO L281 TraceCheckUtils]: 225: Hoare triple {12635#(<= ~counter~0 28)} __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; {12635#(<= ~counter~0 28)} is VALID [2021-09-13 14:25:58,998 INFO L281 TraceCheckUtils]: 224: Hoare triple {12635#(<= ~counter~0 28)} assume !(0 == __VERIFIER_assert_~cond); {12635#(<= ~counter~0 28)} is VALID [2021-09-13 14:25:58,998 INFO L281 TraceCheckUtils]: 223: Hoare triple {12635#(<= ~counter~0 28)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 1 == main_~p~0 * main_~s~0 - main_~r~0 * main_~q~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {12635#(<= ~counter~0 28)} is VALID [2021-09-13 14:25:58,998 INFO L281 TraceCheckUtils]: 222: Hoare triple {12607#(<= ~counter~0 27)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {12635#(<= ~counter~0 28)} is VALID [2021-09-13 14:25:58,998 INFO L281 TraceCheckUtils]: 221: Hoare triple {12607#(<= ~counter~0 27)} assume main_~a~0 > main_~b~0;main_~a~0 := main_~a~0 - main_~b~0;main_~p~0 := main_~p~0 - main_~q~0;main_~r~0 := main_~r~0 - main_~s~0; {12607#(<= ~counter~0 27)} is VALID [2021-09-13 14:25:58,999 INFO L281 TraceCheckUtils]: 220: Hoare triple {12607#(<= ~counter~0 27)} assume !!(main_~a~0 != main_~b~0); {12607#(<= ~counter~0 27)} is VALID [2021-09-13 14:25:58,999 INFO L281 TraceCheckUtils]: 219: Hoare triple {12607#(<= ~counter~0 27)} assume !(0 == __VERIFIER_assert_~cond); {12607#(<= ~counter~0 27)} is VALID [2021-09-13 14:25:58,999 INFO L281 TraceCheckUtils]: 218: Hoare triple {12607#(<= ~counter~0 27)} __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; {12607#(<= ~counter~0 27)} is VALID [2021-09-13 14:25:58,999 INFO L281 TraceCheckUtils]: 217: Hoare triple {12607#(<= ~counter~0 27)} assume !(0 == __VERIFIER_assert_~cond); {12607#(<= ~counter~0 27)} is VALID [2021-09-13 14:25:58,999 INFO L281 TraceCheckUtils]: 216: Hoare triple {12607#(<= ~counter~0 27)} __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; {12607#(<= ~counter~0 27)} is VALID [2021-09-13 14:25:59,000 INFO L281 TraceCheckUtils]: 215: Hoare triple {12607#(<= ~counter~0 27)} assume !(0 == __VERIFIER_assert_~cond); {12607#(<= ~counter~0 27)} is VALID [2021-09-13 14:25:59,000 INFO L281 TraceCheckUtils]: 214: Hoare triple {12607#(<= ~counter~0 27)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 1 == main_~p~0 * main_~s~0 - main_~r~0 * main_~q~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {12607#(<= ~counter~0 27)} is VALID [2021-09-13 14:25:59,000 INFO L281 TraceCheckUtils]: 213: Hoare triple {12579#(<= ~counter~0 26)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {12607#(<= ~counter~0 27)} is VALID [2021-09-13 14:25:59,001 INFO L281 TraceCheckUtils]: 212: Hoare triple {12579#(<= ~counter~0 26)} assume main_~a~0 > main_~b~0;main_~a~0 := main_~a~0 - main_~b~0;main_~p~0 := main_~p~0 - main_~q~0;main_~r~0 := main_~r~0 - main_~s~0; {12579#(<= ~counter~0 26)} is VALID [2021-09-13 14:25:59,001 INFO L281 TraceCheckUtils]: 211: Hoare triple {12579#(<= ~counter~0 26)} assume !!(main_~a~0 != main_~b~0); {12579#(<= ~counter~0 26)} is VALID [2021-09-13 14:25:59,001 INFO L281 TraceCheckUtils]: 210: Hoare triple {12579#(<= ~counter~0 26)} assume !(0 == __VERIFIER_assert_~cond); {12579#(<= ~counter~0 26)} is VALID [2021-09-13 14:25:59,001 INFO L281 TraceCheckUtils]: 209: Hoare triple {12579#(<= ~counter~0 26)} __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; {12579#(<= ~counter~0 26)} is VALID [2021-09-13 14:25:59,001 INFO L281 TraceCheckUtils]: 208: Hoare triple {12579#(<= ~counter~0 26)} assume !(0 == __VERIFIER_assert_~cond); {12579#(<= ~counter~0 26)} is VALID [2021-09-13 14:25:59,002 INFO L281 TraceCheckUtils]: 207: Hoare triple {12579#(<= ~counter~0 26)} __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; {12579#(<= ~counter~0 26)} is VALID [2021-09-13 14:25:59,002 INFO L281 TraceCheckUtils]: 206: Hoare triple {12579#(<= ~counter~0 26)} assume !(0 == __VERIFIER_assert_~cond); {12579#(<= ~counter~0 26)} is VALID [2021-09-13 14:25:59,002 INFO L281 TraceCheckUtils]: 205: Hoare triple {12579#(<= ~counter~0 26)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 1 == main_~p~0 * main_~s~0 - main_~r~0 * main_~q~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {12579#(<= ~counter~0 26)} is VALID [2021-09-13 14:25:59,002 INFO L281 TraceCheckUtils]: 204: Hoare triple {12551#(<= ~counter~0 25)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {12579#(<= ~counter~0 26)} is VALID [2021-09-13 14:25:59,002 INFO L281 TraceCheckUtils]: 203: Hoare triple {12551#(<= ~counter~0 25)} assume main_~a~0 > main_~b~0;main_~a~0 := main_~a~0 - main_~b~0;main_~p~0 := main_~p~0 - main_~q~0;main_~r~0 := main_~r~0 - main_~s~0; {12551#(<= ~counter~0 25)} is VALID [2021-09-13 14:25:59,003 INFO L281 TraceCheckUtils]: 202: Hoare triple {12551#(<= ~counter~0 25)} assume !!(main_~a~0 != main_~b~0); {12551#(<= ~counter~0 25)} is VALID [2021-09-13 14:25:59,003 INFO L281 TraceCheckUtils]: 201: Hoare triple {12551#(<= ~counter~0 25)} assume !(0 == __VERIFIER_assert_~cond); {12551#(<= ~counter~0 25)} is VALID [2021-09-13 14:25:59,003 INFO L281 TraceCheckUtils]: 200: Hoare triple {12551#(<= ~counter~0 25)} __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; {12551#(<= ~counter~0 25)} is VALID [2021-09-13 14:25:59,003 INFO L281 TraceCheckUtils]: 199: Hoare triple {12551#(<= ~counter~0 25)} assume !(0 == __VERIFIER_assert_~cond); {12551#(<= ~counter~0 25)} is VALID [2021-09-13 14:25:59,004 INFO L281 TraceCheckUtils]: 198: Hoare triple {12551#(<= ~counter~0 25)} __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; {12551#(<= ~counter~0 25)} is VALID [2021-09-13 14:25:59,004 INFO L281 TraceCheckUtils]: 197: Hoare triple {12551#(<= ~counter~0 25)} assume !(0 == __VERIFIER_assert_~cond); {12551#(<= ~counter~0 25)} is VALID [2021-09-13 14:25:59,004 INFO L281 TraceCheckUtils]: 196: Hoare triple {12551#(<= ~counter~0 25)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 1 == main_~p~0 * main_~s~0 - main_~r~0 * main_~q~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {12551#(<= ~counter~0 25)} is VALID [2021-09-13 14:25:59,004 INFO L281 TraceCheckUtils]: 195: Hoare triple {12523#(<= ~counter~0 24)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {12551#(<= ~counter~0 25)} is VALID [2021-09-13 14:25:59,005 INFO L281 TraceCheckUtils]: 194: Hoare triple {12523#(<= ~counter~0 24)} assume main_~a~0 > main_~b~0;main_~a~0 := main_~a~0 - main_~b~0;main_~p~0 := main_~p~0 - main_~q~0;main_~r~0 := main_~r~0 - main_~s~0; {12523#(<= ~counter~0 24)} is VALID [2021-09-13 14:25:59,005 INFO L281 TraceCheckUtils]: 193: Hoare triple {12523#(<= ~counter~0 24)} assume !!(main_~a~0 != main_~b~0); {12523#(<= ~counter~0 24)} is VALID [2021-09-13 14:25:59,005 INFO L281 TraceCheckUtils]: 192: Hoare triple {12523#(<= ~counter~0 24)} assume !(0 == __VERIFIER_assert_~cond); {12523#(<= ~counter~0 24)} is VALID [2021-09-13 14:25:59,005 INFO L281 TraceCheckUtils]: 191: Hoare triple {12523#(<= ~counter~0 24)} __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; {12523#(<= ~counter~0 24)} is VALID [2021-09-13 14:25:59,005 INFO L281 TraceCheckUtils]: 190: Hoare triple {12523#(<= ~counter~0 24)} assume !(0 == __VERIFIER_assert_~cond); {12523#(<= ~counter~0 24)} is VALID [2021-09-13 14:25:59,006 INFO L281 TraceCheckUtils]: 189: Hoare triple {12523#(<= ~counter~0 24)} __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; {12523#(<= ~counter~0 24)} is VALID [2021-09-13 14:25:59,006 INFO L281 TraceCheckUtils]: 188: Hoare triple {12523#(<= ~counter~0 24)} assume !(0 == __VERIFIER_assert_~cond); {12523#(<= ~counter~0 24)} is VALID [2021-09-13 14:25:59,006 INFO L281 TraceCheckUtils]: 187: Hoare triple {12523#(<= ~counter~0 24)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 1 == main_~p~0 * main_~s~0 - main_~r~0 * main_~q~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {12523#(<= ~counter~0 24)} is VALID [2021-09-13 14:25:59,006 INFO L281 TraceCheckUtils]: 186: Hoare triple {12495#(<= ~counter~0 23)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {12523#(<= ~counter~0 24)} is VALID [2021-09-13 14:25:59,007 INFO L281 TraceCheckUtils]: 185: Hoare triple {12495#(<= ~counter~0 23)} assume main_~a~0 > main_~b~0;main_~a~0 := main_~a~0 - main_~b~0;main_~p~0 := main_~p~0 - main_~q~0;main_~r~0 := main_~r~0 - main_~s~0; {12495#(<= ~counter~0 23)} is VALID [2021-09-13 14:25:59,007 INFO L281 TraceCheckUtils]: 184: Hoare triple {12495#(<= ~counter~0 23)} assume !!(main_~a~0 != main_~b~0); {12495#(<= ~counter~0 23)} is VALID [2021-09-13 14:25:59,007 INFO L281 TraceCheckUtils]: 183: Hoare triple {12495#(<= ~counter~0 23)} assume !(0 == __VERIFIER_assert_~cond); {12495#(<= ~counter~0 23)} is VALID [2021-09-13 14:25:59,007 INFO L281 TraceCheckUtils]: 182: Hoare triple {12495#(<= ~counter~0 23)} __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; {12495#(<= ~counter~0 23)} is VALID [2021-09-13 14:25:59,007 INFO L281 TraceCheckUtils]: 181: Hoare triple {12495#(<= ~counter~0 23)} assume !(0 == __VERIFIER_assert_~cond); {12495#(<= ~counter~0 23)} is VALID [2021-09-13 14:25:59,008 INFO L281 TraceCheckUtils]: 180: Hoare triple {12495#(<= ~counter~0 23)} __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; {12495#(<= ~counter~0 23)} is VALID [2021-09-13 14:25:59,008 INFO L281 TraceCheckUtils]: 179: Hoare triple {12495#(<= ~counter~0 23)} assume !(0 == __VERIFIER_assert_~cond); {12495#(<= ~counter~0 23)} is VALID [2021-09-13 14:25:59,008 INFO L281 TraceCheckUtils]: 178: Hoare triple {12495#(<= ~counter~0 23)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 1 == main_~p~0 * main_~s~0 - main_~r~0 * main_~q~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {12495#(<= ~counter~0 23)} is VALID [2021-09-13 14:25:59,008 INFO L281 TraceCheckUtils]: 177: Hoare triple {12467#(<= ~counter~0 22)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {12495#(<= ~counter~0 23)} is VALID [2021-09-13 14:25:59,009 INFO L281 TraceCheckUtils]: 176: Hoare triple {12467#(<= ~counter~0 22)} assume main_~a~0 > main_~b~0;main_~a~0 := main_~a~0 - main_~b~0;main_~p~0 := main_~p~0 - main_~q~0;main_~r~0 := main_~r~0 - main_~s~0; {12467#(<= ~counter~0 22)} is VALID [2021-09-13 14:25:59,009 INFO L281 TraceCheckUtils]: 175: Hoare triple {12467#(<= ~counter~0 22)} assume !!(main_~a~0 != main_~b~0); {12467#(<= ~counter~0 22)} is VALID [2021-09-13 14:25:59,009 INFO L281 TraceCheckUtils]: 174: Hoare triple {12467#(<= ~counter~0 22)} assume !(0 == __VERIFIER_assert_~cond); {12467#(<= ~counter~0 22)} is VALID [2021-09-13 14:25:59,009 INFO L281 TraceCheckUtils]: 173: Hoare triple {12467#(<= ~counter~0 22)} __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; {12467#(<= ~counter~0 22)} is VALID [2021-09-13 14:25:59,009 INFO L281 TraceCheckUtils]: 172: Hoare triple {12467#(<= ~counter~0 22)} assume !(0 == __VERIFIER_assert_~cond); {12467#(<= ~counter~0 22)} is VALID [2021-09-13 14:25:59,010 INFO L281 TraceCheckUtils]: 171: Hoare triple {12467#(<= ~counter~0 22)} __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; {12467#(<= ~counter~0 22)} is VALID [2021-09-13 14:25:59,010 INFO L281 TraceCheckUtils]: 170: Hoare triple {12467#(<= ~counter~0 22)} assume !(0 == __VERIFIER_assert_~cond); {12467#(<= ~counter~0 22)} is VALID [2021-09-13 14:25:59,010 INFO L281 TraceCheckUtils]: 169: Hoare triple {12467#(<= ~counter~0 22)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 1 == main_~p~0 * main_~s~0 - main_~r~0 * main_~q~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {12467#(<= ~counter~0 22)} is VALID [2021-09-13 14:25:59,010 INFO L281 TraceCheckUtils]: 168: Hoare triple {12439#(<= ~counter~0 21)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {12467#(<= ~counter~0 22)} is VALID [2021-09-13 14:25:59,011 INFO L281 TraceCheckUtils]: 167: Hoare triple {12439#(<= ~counter~0 21)} assume main_~a~0 > main_~b~0;main_~a~0 := main_~a~0 - main_~b~0;main_~p~0 := main_~p~0 - main_~q~0;main_~r~0 := main_~r~0 - main_~s~0; {12439#(<= ~counter~0 21)} is VALID [2021-09-13 14:25:59,011 INFO L281 TraceCheckUtils]: 166: Hoare triple {12439#(<= ~counter~0 21)} assume !!(main_~a~0 != main_~b~0); {12439#(<= ~counter~0 21)} is VALID [2021-09-13 14:25:59,011 INFO L281 TraceCheckUtils]: 165: Hoare triple {12439#(<= ~counter~0 21)} assume !(0 == __VERIFIER_assert_~cond); {12439#(<= ~counter~0 21)} is VALID [2021-09-13 14:25:59,011 INFO L281 TraceCheckUtils]: 164: Hoare triple {12439#(<= ~counter~0 21)} __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; {12439#(<= ~counter~0 21)} is VALID [2021-09-13 14:25:59,011 INFO L281 TraceCheckUtils]: 163: Hoare triple {12439#(<= ~counter~0 21)} assume !(0 == __VERIFIER_assert_~cond); {12439#(<= ~counter~0 21)} is VALID [2021-09-13 14:25:59,012 INFO L281 TraceCheckUtils]: 162: Hoare triple {12439#(<= ~counter~0 21)} __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; {12439#(<= ~counter~0 21)} is VALID [2021-09-13 14:25:59,012 INFO L281 TraceCheckUtils]: 161: Hoare triple {12439#(<= ~counter~0 21)} assume !(0 == __VERIFIER_assert_~cond); {12439#(<= ~counter~0 21)} is VALID [2021-09-13 14:25:59,012 INFO L281 TraceCheckUtils]: 160: Hoare triple {12439#(<= ~counter~0 21)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 1 == main_~p~0 * main_~s~0 - main_~r~0 * main_~q~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {12439#(<= ~counter~0 21)} is VALID [2021-09-13 14:25:59,012 INFO L281 TraceCheckUtils]: 159: Hoare triple {12411#(<= ~counter~0 20)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {12439#(<= ~counter~0 21)} is VALID [2021-09-13 14:25:59,013 INFO L281 TraceCheckUtils]: 158: Hoare triple {12411#(<= ~counter~0 20)} assume main_~a~0 > main_~b~0;main_~a~0 := main_~a~0 - main_~b~0;main_~p~0 := main_~p~0 - main_~q~0;main_~r~0 := main_~r~0 - main_~s~0; {12411#(<= ~counter~0 20)} is VALID [2021-09-13 14:25:59,013 INFO L281 TraceCheckUtils]: 157: Hoare triple {12411#(<= ~counter~0 20)} assume !!(main_~a~0 != main_~b~0); {12411#(<= ~counter~0 20)} is VALID [2021-09-13 14:25:59,013 INFO L281 TraceCheckUtils]: 156: Hoare triple {12411#(<= ~counter~0 20)} assume !(0 == __VERIFIER_assert_~cond); {12411#(<= ~counter~0 20)} is VALID [2021-09-13 14:25:59,013 INFO L281 TraceCheckUtils]: 155: Hoare triple {12411#(<= ~counter~0 20)} __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; {12411#(<= ~counter~0 20)} is VALID [2021-09-13 14:25:59,013 INFO L281 TraceCheckUtils]: 154: Hoare triple {12411#(<= ~counter~0 20)} assume !(0 == __VERIFIER_assert_~cond); {12411#(<= ~counter~0 20)} is VALID [2021-09-13 14:25:59,014 INFO L281 TraceCheckUtils]: 153: Hoare triple {12411#(<= ~counter~0 20)} __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; {12411#(<= ~counter~0 20)} is VALID [2021-09-13 14:25:59,014 INFO L281 TraceCheckUtils]: 152: Hoare triple {12411#(<= ~counter~0 20)} assume !(0 == __VERIFIER_assert_~cond); {12411#(<= ~counter~0 20)} is VALID [2021-09-13 14:25:59,014 INFO L281 TraceCheckUtils]: 151: Hoare triple {12411#(<= ~counter~0 20)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 1 == main_~p~0 * main_~s~0 - main_~r~0 * main_~q~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {12411#(<= ~counter~0 20)} is VALID [2021-09-13 14:25:59,014 INFO L281 TraceCheckUtils]: 150: Hoare triple {12383#(<= ~counter~0 19)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {12411#(<= ~counter~0 20)} is VALID [2021-09-13 14:25:59,015 INFO L281 TraceCheckUtils]: 149: Hoare triple {12383#(<= ~counter~0 19)} assume main_~a~0 > main_~b~0;main_~a~0 := main_~a~0 - main_~b~0;main_~p~0 := main_~p~0 - main_~q~0;main_~r~0 := main_~r~0 - main_~s~0; {12383#(<= ~counter~0 19)} is VALID [2021-09-13 14:25:59,015 INFO L281 TraceCheckUtils]: 148: Hoare triple {12383#(<= ~counter~0 19)} assume !!(main_~a~0 != main_~b~0); {12383#(<= ~counter~0 19)} is VALID [2021-09-13 14:25:59,015 INFO L281 TraceCheckUtils]: 147: Hoare triple {12383#(<= ~counter~0 19)} assume !(0 == __VERIFIER_assert_~cond); {12383#(<= ~counter~0 19)} is VALID [2021-09-13 14:25:59,015 INFO L281 TraceCheckUtils]: 146: Hoare triple {12383#(<= ~counter~0 19)} __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; {12383#(<= ~counter~0 19)} is VALID [2021-09-13 14:25:59,015 INFO L281 TraceCheckUtils]: 145: Hoare triple {12383#(<= ~counter~0 19)} assume !(0 == __VERIFIER_assert_~cond); {12383#(<= ~counter~0 19)} is VALID [2021-09-13 14:25:59,016 INFO L281 TraceCheckUtils]: 144: Hoare triple {12383#(<= ~counter~0 19)} __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; {12383#(<= ~counter~0 19)} is VALID [2021-09-13 14:25:59,016 INFO L281 TraceCheckUtils]: 143: Hoare triple {12383#(<= ~counter~0 19)} assume !(0 == __VERIFIER_assert_~cond); {12383#(<= ~counter~0 19)} is VALID [2021-09-13 14:25:59,016 INFO L281 TraceCheckUtils]: 142: Hoare triple {12383#(<= ~counter~0 19)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 1 == main_~p~0 * main_~s~0 - main_~r~0 * main_~q~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {12383#(<= ~counter~0 19)} is VALID [2021-09-13 14:25:59,016 INFO L281 TraceCheckUtils]: 141: Hoare triple {12355#(<= ~counter~0 18)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {12383#(<= ~counter~0 19)} is VALID [2021-09-13 14:25:59,016 INFO L281 TraceCheckUtils]: 140: Hoare triple {12355#(<= ~counter~0 18)} assume main_~a~0 > main_~b~0;main_~a~0 := main_~a~0 - main_~b~0;main_~p~0 := main_~p~0 - main_~q~0;main_~r~0 := main_~r~0 - main_~s~0; {12355#(<= ~counter~0 18)} is VALID [2021-09-13 14:25:59,017 INFO L281 TraceCheckUtils]: 139: Hoare triple {12355#(<= ~counter~0 18)} assume !!(main_~a~0 != main_~b~0); {12355#(<= ~counter~0 18)} is VALID [2021-09-13 14:25:59,017 INFO L281 TraceCheckUtils]: 138: Hoare triple {12355#(<= ~counter~0 18)} assume !(0 == __VERIFIER_assert_~cond); {12355#(<= ~counter~0 18)} is VALID [2021-09-13 14:25:59,017 INFO L281 TraceCheckUtils]: 137: Hoare triple {12355#(<= ~counter~0 18)} __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; {12355#(<= ~counter~0 18)} is VALID [2021-09-13 14:25:59,017 INFO L281 TraceCheckUtils]: 136: Hoare triple {12355#(<= ~counter~0 18)} assume !(0 == __VERIFIER_assert_~cond); {12355#(<= ~counter~0 18)} is VALID [2021-09-13 14:25:59,018 INFO L281 TraceCheckUtils]: 135: Hoare triple {12355#(<= ~counter~0 18)} __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; {12355#(<= ~counter~0 18)} is VALID [2021-09-13 14:25:59,018 INFO L281 TraceCheckUtils]: 134: Hoare triple {12355#(<= ~counter~0 18)} assume !(0 == __VERIFIER_assert_~cond); {12355#(<= ~counter~0 18)} is VALID [2021-09-13 14:25:59,018 INFO L281 TraceCheckUtils]: 133: Hoare triple {12355#(<= ~counter~0 18)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 1 == main_~p~0 * main_~s~0 - main_~r~0 * main_~q~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {12355#(<= ~counter~0 18)} is VALID [2021-09-13 14:25:59,018 INFO L281 TraceCheckUtils]: 132: Hoare triple {12327#(<= ~counter~0 17)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {12355#(<= ~counter~0 18)} is VALID [2021-09-13 14:25:59,018 INFO L281 TraceCheckUtils]: 131: Hoare triple {12327#(<= ~counter~0 17)} assume main_~a~0 > main_~b~0;main_~a~0 := main_~a~0 - main_~b~0;main_~p~0 := main_~p~0 - main_~q~0;main_~r~0 := main_~r~0 - main_~s~0; {12327#(<= ~counter~0 17)} is VALID [2021-09-13 14:25:59,019 INFO L281 TraceCheckUtils]: 130: Hoare triple {12327#(<= ~counter~0 17)} assume !!(main_~a~0 != main_~b~0); {12327#(<= ~counter~0 17)} is VALID [2021-09-13 14:25:59,019 INFO L281 TraceCheckUtils]: 129: Hoare triple {12327#(<= ~counter~0 17)} assume !(0 == __VERIFIER_assert_~cond); {12327#(<= ~counter~0 17)} is VALID [2021-09-13 14:25:59,019 INFO L281 TraceCheckUtils]: 128: Hoare triple {12327#(<= ~counter~0 17)} __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; {12327#(<= ~counter~0 17)} is VALID [2021-09-13 14:25:59,019 INFO L281 TraceCheckUtils]: 127: Hoare triple {12327#(<= ~counter~0 17)} assume !(0 == __VERIFIER_assert_~cond); {12327#(<= ~counter~0 17)} is VALID [2021-09-13 14:25:59,019 INFO L281 TraceCheckUtils]: 126: Hoare triple {12327#(<= ~counter~0 17)} __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; {12327#(<= ~counter~0 17)} is VALID [2021-09-13 14:25:59,020 INFO L281 TraceCheckUtils]: 125: Hoare triple {12327#(<= ~counter~0 17)} assume !(0 == __VERIFIER_assert_~cond); {12327#(<= ~counter~0 17)} is VALID [2021-09-13 14:25:59,020 INFO L281 TraceCheckUtils]: 124: Hoare triple {12327#(<= ~counter~0 17)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 1 == main_~p~0 * main_~s~0 - main_~r~0 * main_~q~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {12327#(<= ~counter~0 17)} is VALID [2021-09-13 14:25:59,020 INFO L281 TraceCheckUtils]: 123: Hoare triple {12299#(<= ~counter~0 16)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {12327#(<= ~counter~0 17)} is VALID [2021-09-13 14:25:59,020 INFO L281 TraceCheckUtils]: 122: Hoare triple {12299#(<= ~counter~0 16)} assume main_~a~0 > main_~b~0;main_~a~0 := main_~a~0 - main_~b~0;main_~p~0 := main_~p~0 - main_~q~0;main_~r~0 := main_~r~0 - main_~s~0; {12299#(<= ~counter~0 16)} is VALID [2021-09-13 14:25:59,021 INFO L281 TraceCheckUtils]: 121: Hoare triple {12299#(<= ~counter~0 16)} assume !!(main_~a~0 != main_~b~0); {12299#(<= ~counter~0 16)} is VALID [2021-09-13 14:25:59,021 INFO L281 TraceCheckUtils]: 120: Hoare triple {12299#(<= ~counter~0 16)} assume !(0 == __VERIFIER_assert_~cond); {12299#(<= ~counter~0 16)} is VALID [2021-09-13 14:25:59,021 INFO L281 TraceCheckUtils]: 119: Hoare triple {12299#(<= ~counter~0 16)} __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; {12299#(<= ~counter~0 16)} is VALID [2021-09-13 14:25:59,021 INFO L281 TraceCheckUtils]: 118: Hoare triple {12299#(<= ~counter~0 16)} assume !(0 == __VERIFIER_assert_~cond); {12299#(<= ~counter~0 16)} is VALID [2021-09-13 14:25:59,021 INFO L281 TraceCheckUtils]: 117: Hoare triple {12299#(<= ~counter~0 16)} __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; {12299#(<= ~counter~0 16)} is VALID [2021-09-13 14:25:59,022 INFO L281 TraceCheckUtils]: 116: Hoare triple {12299#(<= ~counter~0 16)} assume !(0 == __VERIFIER_assert_~cond); {12299#(<= ~counter~0 16)} is VALID [2021-09-13 14:25:59,022 INFO L281 TraceCheckUtils]: 115: Hoare triple {12299#(<= ~counter~0 16)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 1 == main_~p~0 * main_~s~0 - main_~r~0 * main_~q~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {12299#(<= ~counter~0 16)} is VALID [2021-09-13 14:25:59,022 INFO L281 TraceCheckUtils]: 114: Hoare triple {12271#(<= ~counter~0 15)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {12299#(<= ~counter~0 16)} is VALID [2021-09-13 14:25:59,022 INFO L281 TraceCheckUtils]: 113: Hoare triple {12271#(<= ~counter~0 15)} assume main_~a~0 > main_~b~0;main_~a~0 := main_~a~0 - main_~b~0;main_~p~0 := main_~p~0 - main_~q~0;main_~r~0 := main_~r~0 - main_~s~0; {12271#(<= ~counter~0 15)} is VALID [2021-09-13 14:25:59,023 INFO L281 TraceCheckUtils]: 112: Hoare triple {12271#(<= ~counter~0 15)} assume !!(main_~a~0 != main_~b~0); {12271#(<= ~counter~0 15)} is VALID [2021-09-13 14:25:59,023 INFO L281 TraceCheckUtils]: 111: Hoare triple {12271#(<= ~counter~0 15)} assume !(0 == __VERIFIER_assert_~cond); {12271#(<= ~counter~0 15)} is VALID [2021-09-13 14:25:59,023 INFO L281 TraceCheckUtils]: 110: Hoare triple {12271#(<= ~counter~0 15)} __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; {12271#(<= ~counter~0 15)} is VALID [2021-09-13 14:25:59,023 INFO L281 TraceCheckUtils]: 109: Hoare triple {12271#(<= ~counter~0 15)} assume !(0 == __VERIFIER_assert_~cond); {12271#(<= ~counter~0 15)} is VALID [2021-09-13 14:25:59,023 INFO L281 TraceCheckUtils]: 108: Hoare triple {12271#(<= ~counter~0 15)} __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; {12271#(<= ~counter~0 15)} is VALID [2021-09-13 14:25:59,024 INFO L281 TraceCheckUtils]: 107: Hoare triple {12271#(<= ~counter~0 15)} assume !(0 == __VERIFIER_assert_~cond); {12271#(<= ~counter~0 15)} is VALID [2021-09-13 14:25:59,024 INFO L281 TraceCheckUtils]: 106: Hoare triple {12271#(<= ~counter~0 15)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 1 == main_~p~0 * main_~s~0 - main_~r~0 * main_~q~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {12271#(<= ~counter~0 15)} is VALID [2021-09-13 14:25:59,024 INFO L281 TraceCheckUtils]: 105: Hoare triple {12243#(<= ~counter~0 14)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {12271#(<= ~counter~0 15)} is VALID [2021-09-13 14:25:59,024 INFO L281 TraceCheckUtils]: 104: Hoare triple {12243#(<= ~counter~0 14)} assume main_~a~0 > main_~b~0;main_~a~0 := main_~a~0 - main_~b~0;main_~p~0 := main_~p~0 - main_~q~0;main_~r~0 := main_~r~0 - main_~s~0; {12243#(<= ~counter~0 14)} is VALID [2021-09-13 14:25:59,025 INFO L281 TraceCheckUtils]: 103: Hoare triple {12243#(<= ~counter~0 14)} assume !!(main_~a~0 != main_~b~0); {12243#(<= ~counter~0 14)} is VALID [2021-09-13 14:25:59,025 INFO L281 TraceCheckUtils]: 102: Hoare triple {12243#(<= ~counter~0 14)} assume !(0 == __VERIFIER_assert_~cond); {12243#(<= ~counter~0 14)} is VALID [2021-09-13 14:25:59,025 INFO L281 TraceCheckUtils]: 101: Hoare triple {12243#(<= ~counter~0 14)} __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; {12243#(<= ~counter~0 14)} is VALID [2021-09-13 14:25:59,025 INFO L281 TraceCheckUtils]: 100: Hoare triple {12243#(<= ~counter~0 14)} assume !(0 == __VERIFIER_assert_~cond); {12243#(<= ~counter~0 14)} is VALID [2021-09-13 14:25:59,025 INFO L281 TraceCheckUtils]: 99: Hoare triple {12243#(<= ~counter~0 14)} __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; {12243#(<= ~counter~0 14)} is VALID [2021-09-13 14:25:59,026 INFO L281 TraceCheckUtils]: 98: Hoare triple {12243#(<= ~counter~0 14)} assume !(0 == __VERIFIER_assert_~cond); {12243#(<= ~counter~0 14)} is VALID [2021-09-13 14:25:59,026 INFO L281 TraceCheckUtils]: 97: Hoare triple {12243#(<= ~counter~0 14)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 1 == main_~p~0 * main_~s~0 - main_~r~0 * main_~q~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {12243#(<= ~counter~0 14)} is VALID [2021-09-13 14:25:59,026 INFO L281 TraceCheckUtils]: 96: Hoare triple {12215#(<= ~counter~0 13)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {12243#(<= ~counter~0 14)} is VALID [2021-09-13 14:25:59,026 INFO L281 TraceCheckUtils]: 95: Hoare triple {12215#(<= ~counter~0 13)} assume main_~a~0 > main_~b~0;main_~a~0 := main_~a~0 - main_~b~0;main_~p~0 := main_~p~0 - main_~q~0;main_~r~0 := main_~r~0 - main_~s~0; {12215#(<= ~counter~0 13)} is VALID [2021-09-13 14:25:59,027 INFO L281 TraceCheckUtils]: 94: Hoare triple {12215#(<= ~counter~0 13)} assume !!(main_~a~0 != main_~b~0); {12215#(<= ~counter~0 13)} is VALID [2021-09-13 14:25:59,027 INFO L281 TraceCheckUtils]: 93: Hoare triple {12215#(<= ~counter~0 13)} assume !(0 == __VERIFIER_assert_~cond); {12215#(<= ~counter~0 13)} is VALID [2021-09-13 14:25:59,027 INFO L281 TraceCheckUtils]: 92: Hoare triple {12215#(<= ~counter~0 13)} __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; {12215#(<= ~counter~0 13)} is VALID [2021-09-13 14:25:59,027 INFO L281 TraceCheckUtils]: 91: Hoare triple {12215#(<= ~counter~0 13)} assume !(0 == __VERIFIER_assert_~cond); {12215#(<= ~counter~0 13)} is VALID [2021-09-13 14:25:59,028 INFO L281 TraceCheckUtils]: 90: Hoare triple {12215#(<= ~counter~0 13)} __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; {12215#(<= ~counter~0 13)} is VALID [2021-09-13 14:25:59,028 INFO L281 TraceCheckUtils]: 89: Hoare triple {12215#(<= ~counter~0 13)} assume !(0 == __VERIFIER_assert_~cond); {12215#(<= ~counter~0 13)} is VALID [2021-09-13 14:25:59,028 INFO L281 TraceCheckUtils]: 88: Hoare triple {12215#(<= ~counter~0 13)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 1 == main_~p~0 * main_~s~0 - main_~r~0 * main_~q~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {12215#(<= ~counter~0 13)} is VALID [2021-09-13 14:25:59,028 INFO L281 TraceCheckUtils]: 87: Hoare triple {12187#(<= ~counter~0 12)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {12215#(<= ~counter~0 13)} is VALID [2021-09-13 14:25:59,029 INFO L281 TraceCheckUtils]: 86: Hoare triple {12187#(<= ~counter~0 12)} assume main_~a~0 > main_~b~0;main_~a~0 := main_~a~0 - main_~b~0;main_~p~0 := main_~p~0 - main_~q~0;main_~r~0 := main_~r~0 - main_~s~0; {12187#(<= ~counter~0 12)} is VALID [2021-09-13 14:25:59,029 INFO L281 TraceCheckUtils]: 85: Hoare triple {12187#(<= ~counter~0 12)} assume !!(main_~a~0 != main_~b~0); {12187#(<= ~counter~0 12)} is VALID [2021-09-13 14:25:59,029 INFO L281 TraceCheckUtils]: 84: Hoare triple {12187#(<= ~counter~0 12)} assume !(0 == __VERIFIER_assert_~cond); {12187#(<= ~counter~0 12)} is VALID [2021-09-13 14:25:59,029 INFO L281 TraceCheckUtils]: 83: Hoare triple {12187#(<= ~counter~0 12)} __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; {12187#(<= ~counter~0 12)} is VALID [2021-09-13 14:25:59,029 INFO L281 TraceCheckUtils]: 82: Hoare triple {12187#(<= ~counter~0 12)} assume !(0 == __VERIFIER_assert_~cond); {12187#(<= ~counter~0 12)} is VALID [2021-09-13 14:25:59,030 INFO L281 TraceCheckUtils]: 81: Hoare triple {12187#(<= ~counter~0 12)} __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; {12187#(<= ~counter~0 12)} is VALID [2021-09-13 14:25:59,030 INFO L281 TraceCheckUtils]: 80: Hoare triple {12187#(<= ~counter~0 12)} assume !(0 == __VERIFIER_assert_~cond); {12187#(<= ~counter~0 12)} is VALID [2021-09-13 14:25:59,030 INFO L281 TraceCheckUtils]: 79: Hoare triple {12187#(<= ~counter~0 12)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 1 == main_~p~0 * main_~s~0 - main_~r~0 * main_~q~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {12187#(<= ~counter~0 12)} is VALID [2021-09-13 14:25:59,030 INFO L281 TraceCheckUtils]: 78: Hoare triple {12159#(<= ~counter~0 11)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {12187#(<= ~counter~0 12)} is VALID [2021-09-13 14:25:59,031 INFO L281 TraceCheckUtils]: 77: Hoare triple {12159#(<= ~counter~0 11)} assume main_~a~0 > main_~b~0;main_~a~0 := main_~a~0 - main_~b~0;main_~p~0 := main_~p~0 - main_~q~0;main_~r~0 := main_~r~0 - main_~s~0; {12159#(<= ~counter~0 11)} is VALID [2021-09-13 14:25:59,031 INFO L281 TraceCheckUtils]: 76: Hoare triple {12159#(<= ~counter~0 11)} assume !!(main_~a~0 != main_~b~0); {12159#(<= ~counter~0 11)} is VALID [2021-09-13 14:25:59,038 INFO L281 TraceCheckUtils]: 75: Hoare triple {12159#(<= ~counter~0 11)} assume !(0 == __VERIFIER_assert_~cond); {12159#(<= ~counter~0 11)} is VALID [2021-09-13 14:25:59,038 INFO L281 TraceCheckUtils]: 74: Hoare triple {12159#(<= ~counter~0 11)} __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; {12159#(<= ~counter~0 11)} is VALID [2021-09-13 14:25:59,038 INFO L281 TraceCheckUtils]: 73: Hoare triple {12159#(<= ~counter~0 11)} assume !(0 == __VERIFIER_assert_~cond); {12159#(<= ~counter~0 11)} is VALID [2021-09-13 14:25:59,038 INFO L281 TraceCheckUtils]: 72: Hoare triple {12159#(<= ~counter~0 11)} __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; {12159#(<= ~counter~0 11)} is VALID [2021-09-13 14:25:59,039 INFO L281 TraceCheckUtils]: 71: Hoare triple {12159#(<= ~counter~0 11)} assume !(0 == __VERIFIER_assert_~cond); {12159#(<= ~counter~0 11)} is VALID [2021-09-13 14:25:59,039 INFO L281 TraceCheckUtils]: 70: Hoare triple {12159#(<= ~counter~0 11)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 1 == main_~p~0 * main_~s~0 - main_~r~0 * main_~q~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {12159#(<= ~counter~0 11)} is VALID [2021-09-13 14:25:59,039 INFO L281 TraceCheckUtils]: 69: Hoare triple {12131#(<= ~counter~0 10)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {12159#(<= ~counter~0 11)} is VALID [2021-09-13 14:25:59,040 INFO L281 TraceCheckUtils]: 68: Hoare triple {12131#(<= ~counter~0 10)} assume main_~a~0 > main_~b~0;main_~a~0 := main_~a~0 - main_~b~0;main_~p~0 := main_~p~0 - main_~q~0;main_~r~0 := main_~r~0 - main_~s~0; {12131#(<= ~counter~0 10)} is VALID [2021-09-13 14:25:59,040 INFO L281 TraceCheckUtils]: 67: Hoare triple {12131#(<= ~counter~0 10)} assume !!(main_~a~0 != main_~b~0); {12131#(<= ~counter~0 10)} is VALID [2021-09-13 14:25:59,040 INFO L281 TraceCheckUtils]: 66: Hoare triple {12131#(<= ~counter~0 10)} assume !(0 == __VERIFIER_assert_~cond); {12131#(<= ~counter~0 10)} is VALID [2021-09-13 14:25:59,040 INFO L281 TraceCheckUtils]: 65: Hoare triple {12131#(<= ~counter~0 10)} __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; {12131#(<= ~counter~0 10)} is VALID [2021-09-13 14:25:59,040 INFO L281 TraceCheckUtils]: 64: Hoare triple {12131#(<= ~counter~0 10)} assume !(0 == __VERIFIER_assert_~cond); {12131#(<= ~counter~0 10)} is VALID [2021-09-13 14:25:59,041 INFO L281 TraceCheckUtils]: 63: Hoare triple {12131#(<= ~counter~0 10)} __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; {12131#(<= ~counter~0 10)} is VALID [2021-09-13 14:25:59,041 INFO L281 TraceCheckUtils]: 62: Hoare triple {12131#(<= ~counter~0 10)} assume !(0 == __VERIFIER_assert_~cond); {12131#(<= ~counter~0 10)} is VALID [2021-09-13 14:25:59,041 INFO L281 TraceCheckUtils]: 61: Hoare triple {12131#(<= ~counter~0 10)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 1 == main_~p~0 * main_~s~0 - main_~r~0 * main_~q~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {12131#(<= ~counter~0 10)} is VALID [2021-09-13 14:25:59,041 INFO L281 TraceCheckUtils]: 60: Hoare triple {12103#(<= ~counter~0 9)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {12131#(<= ~counter~0 10)} is VALID [2021-09-13 14:25:59,042 INFO L281 TraceCheckUtils]: 59: Hoare triple {12103#(<= ~counter~0 9)} assume main_~a~0 > main_~b~0;main_~a~0 := main_~a~0 - main_~b~0;main_~p~0 := main_~p~0 - main_~q~0;main_~r~0 := main_~r~0 - main_~s~0; {12103#(<= ~counter~0 9)} is VALID [2021-09-13 14:25:59,042 INFO L281 TraceCheckUtils]: 58: Hoare triple {12103#(<= ~counter~0 9)} assume !!(main_~a~0 != main_~b~0); {12103#(<= ~counter~0 9)} is VALID [2021-09-13 14:25:59,042 INFO L281 TraceCheckUtils]: 57: Hoare triple {12103#(<= ~counter~0 9)} assume !(0 == __VERIFIER_assert_~cond); {12103#(<= ~counter~0 9)} is VALID [2021-09-13 14:25:59,042 INFO L281 TraceCheckUtils]: 56: Hoare triple {12103#(<= ~counter~0 9)} __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; {12103#(<= ~counter~0 9)} is VALID [2021-09-13 14:25:59,042 INFO L281 TraceCheckUtils]: 55: Hoare triple {12103#(<= ~counter~0 9)} assume !(0 == __VERIFIER_assert_~cond); {12103#(<= ~counter~0 9)} is VALID [2021-09-13 14:25:59,043 INFO L281 TraceCheckUtils]: 54: Hoare triple {12103#(<= ~counter~0 9)} __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; {12103#(<= ~counter~0 9)} is VALID [2021-09-13 14:25:59,043 INFO L281 TraceCheckUtils]: 53: Hoare triple {12103#(<= ~counter~0 9)} assume !(0 == __VERIFIER_assert_~cond); {12103#(<= ~counter~0 9)} is VALID [2021-09-13 14:25:59,043 INFO L281 TraceCheckUtils]: 52: Hoare triple {12103#(<= ~counter~0 9)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 1 == main_~p~0 * main_~s~0 - main_~r~0 * main_~q~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {12103#(<= ~counter~0 9)} is VALID [2021-09-13 14:25:59,043 INFO L281 TraceCheckUtils]: 51: Hoare triple {12075#(<= ~counter~0 8)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {12103#(<= ~counter~0 9)} is VALID [2021-09-13 14:25:59,044 INFO L281 TraceCheckUtils]: 50: Hoare triple {12075#(<= ~counter~0 8)} assume main_~a~0 > main_~b~0;main_~a~0 := main_~a~0 - main_~b~0;main_~p~0 := main_~p~0 - main_~q~0;main_~r~0 := main_~r~0 - main_~s~0; {12075#(<= ~counter~0 8)} is VALID [2021-09-13 14:25:59,044 INFO L281 TraceCheckUtils]: 49: Hoare triple {12075#(<= ~counter~0 8)} assume !!(main_~a~0 != main_~b~0); {12075#(<= ~counter~0 8)} is VALID [2021-09-13 14:25:59,044 INFO L281 TraceCheckUtils]: 48: Hoare triple {12075#(<= ~counter~0 8)} assume !(0 == __VERIFIER_assert_~cond); {12075#(<= ~counter~0 8)} is VALID [2021-09-13 14:25:59,044 INFO L281 TraceCheckUtils]: 47: Hoare triple {12075#(<= ~counter~0 8)} __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; {12075#(<= ~counter~0 8)} is VALID [2021-09-13 14:25:59,044 INFO L281 TraceCheckUtils]: 46: Hoare triple {12075#(<= ~counter~0 8)} assume !(0 == __VERIFIER_assert_~cond); {12075#(<= ~counter~0 8)} is VALID [2021-09-13 14:25:59,045 INFO L281 TraceCheckUtils]: 45: Hoare triple {12075#(<= ~counter~0 8)} __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; {12075#(<= ~counter~0 8)} is VALID [2021-09-13 14:25:59,045 INFO L281 TraceCheckUtils]: 44: Hoare triple {12075#(<= ~counter~0 8)} assume !(0 == __VERIFIER_assert_~cond); {12075#(<= ~counter~0 8)} is VALID [2021-09-13 14:25:59,059 INFO L281 TraceCheckUtils]: 43: Hoare triple {12075#(<= ~counter~0 8)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 1 == main_~p~0 * main_~s~0 - main_~r~0 * main_~q~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {12075#(<= ~counter~0 8)} is VALID [2021-09-13 14:25:59,060 INFO L281 TraceCheckUtils]: 42: Hoare triple {12047#(<= ~counter~0 7)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {12075#(<= ~counter~0 8)} is VALID [2021-09-13 14:25:59,060 INFO L281 TraceCheckUtils]: 41: Hoare triple {12047#(<= ~counter~0 7)} assume main_~a~0 > main_~b~0;main_~a~0 := main_~a~0 - main_~b~0;main_~p~0 := main_~p~0 - main_~q~0;main_~r~0 := main_~r~0 - main_~s~0; {12047#(<= ~counter~0 7)} is VALID [2021-09-13 14:25:59,060 INFO L281 TraceCheckUtils]: 40: Hoare triple {12047#(<= ~counter~0 7)} assume !!(main_~a~0 != main_~b~0); {12047#(<= ~counter~0 7)} is VALID [2021-09-13 14:25:59,060 INFO L281 TraceCheckUtils]: 39: Hoare triple {12047#(<= ~counter~0 7)} assume !(0 == __VERIFIER_assert_~cond); {12047#(<= ~counter~0 7)} is VALID [2021-09-13 14:25:59,060 INFO L281 TraceCheckUtils]: 38: Hoare triple {12047#(<= ~counter~0 7)} __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; {12047#(<= ~counter~0 7)} is VALID [2021-09-13 14:25:59,061 INFO L281 TraceCheckUtils]: 37: Hoare triple {12047#(<= ~counter~0 7)} assume !(0 == __VERIFIER_assert_~cond); {12047#(<= ~counter~0 7)} is VALID [2021-09-13 14:25:59,061 INFO L281 TraceCheckUtils]: 36: Hoare triple {12047#(<= ~counter~0 7)} __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; {12047#(<= ~counter~0 7)} is VALID [2021-09-13 14:25:59,061 INFO L281 TraceCheckUtils]: 35: Hoare triple {12047#(<= ~counter~0 7)} assume !(0 == __VERIFIER_assert_~cond); {12047#(<= ~counter~0 7)} is VALID [2021-09-13 14:25:59,061 INFO L281 TraceCheckUtils]: 34: Hoare triple {12047#(<= ~counter~0 7)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 1 == main_~p~0 * main_~s~0 - main_~r~0 * main_~q~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {12047#(<= ~counter~0 7)} is VALID [2021-09-13 14:25:59,062 INFO L281 TraceCheckUtils]: 33: Hoare triple {12019#(<= ~counter~0 6)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {12047#(<= ~counter~0 7)} is VALID [2021-09-13 14:25:59,062 INFO L281 TraceCheckUtils]: 32: Hoare triple {12019#(<= ~counter~0 6)} assume main_~a~0 > main_~b~0;main_~a~0 := main_~a~0 - main_~b~0;main_~p~0 := main_~p~0 - main_~q~0;main_~r~0 := main_~r~0 - main_~s~0; {12019#(<= ~counter~0 6)} is VALID [2021-09-13 14:25:59,062 INFO L281 TraceCheckUtils]: 31: Hoare triple {12019#(<= ~counter~0 6)} assume !!(main_~a~0 != main_~b~0); {12019#(<= ~counter~0 6)} is VALID [2021-09-13 14:25:59,062 INFO L281 TraceCheckUtils]: 30: Hoare triple {12019#(<= ~counter~0 6)} assume !(0 == __VERIFIER_assert_~cond); {12019#(<= ~counter~0 6)} is VALID [2021-09-13 14:25:59,062 INFO L281 TraceCheckUtils]: 29: Hoare triple {12019#(<= ~counter~0 6)} __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; {12019#(<= ~counter~0 6)} is VALID [2021-09-13 14:25:59,063 INFO L281 TraceCheckUtils]: 28: Hoare triple {12019#(<= ~counter~0 6)} assume !(0 == __VERIFIER_assert_~cond); {12019#(<= ~counter~0 6)} is VALID [2021-09-13 14:25:59,063 INFO L281 TraceCheckUtils]: 27: Hoare triple {12019#(<= ~counter~0 6)} __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; {12019#(<= ~counter~0 6)} is VALID [2021-09-13 14:25:59,063 INFO L281 TraceCheckUtils]: 26: Hoare triple {12019#(<= ~counter~0 6)} assume !(0 == __VERIFIER_assert_~cond); {12019#(<= ~counter~0 6)} is VALID [2021-09-13 14:25:59,063 INFO L281 TraceCheckUtils]: 25: Hoare triple {12019#(<= ~counter~0 6)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 1 == main_~p~0 * main_~s~0 - main_~r~0 * main_~q~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {12019#(<= ~counter~0 6)} is VALID [2021-09-13 14:25:59,064 INFO L281 TraceCheckUtils]: 24: Hoare triple {11991#(<= ~counter~0 5)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {12019#(<= ~counter~0 6)} is VALID [2021-09-13 14:25:59,064 INFO L281 TraceCheckUtils]: 23: Hoare triple {11991#(<= ~counter~0 5)} assume main_~a~0 > main_~b~0;main_~a~0 := main_~a~0 - main_~b~0;main_~p~0 := main_~p~0 - main_~q~0;main_~r~0 := main_~r~0 - main_~s~0; {11991#(<= ~counter~0 5)} is VALID [2021-09-13 14:25:59,064 INFO L281 TraceCheckUtils]: 22: Hoare triple {11991#(<= ~counter~0 5)} assume !!(main_~a~0 != main_~b~0); {11991#(<= ~counter~0 5)} is VALID [2021-09-13 14:25:59,064 INFO L281 TraceCheckUtils]: 21: Hoare triple {11991#(<= ~counter~0 5)} assume !(0 == __VERIFIER_assert_~cond); {11991#(<= ~counter~0 5)} is VALID [2021-09-13 14:25:59,064 INFO L281 TraceCheckUtils]: 20: Hoare triple {11991#(<= ~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; {11991#(<= ~counter~0 5)} is VALID [2021-09-13 14:25:59,065 INFO L281 TraceCheckUtils]: 19: Hoare triple {11991#(<= ~counter~0 5)} assume !(0 == __VERIFIER_assert_~cond); {11991#(<= ~counter~0 5)} is VALID [2021-09-13 14:25:59,065 INFO L281 TraceCheckUtils]: 18: Hoare triple {11991#(<= ~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; {11991#(<= ~counter~0 5)} is VALID [2021-09-13 14:25:59,065 INFO L281 TraceCheckUtils]: 17: Hoare triple {11991#(<= ~counter~0 5)} assume !(0 == __VERIFIER_assert_~cond); {11991#(<= ~counter~0 5)} is VALID [2021-09-13 14:25:59,065 INFO L281 TraceCheckUtils]: 16: Hoare triple {11991#(<= ~counter~0 5)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 1 == main_~p~0 * main_~s~0 - main_~r~0 * main_~q~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {11991#(<= ~counter~0 5)} is VALID [2021-09-13 14:25:59,066 INFO L281 TraceCheckUtils]: 15: Hoare triple {11963#(<= ~counter~0 4)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {11991#(<= ~counter~0 5)} is VALID [2021-09-13 14:25:59,066 INFO L281 TraceCheckUtils]: 14: Hoare triple {11963#(<= ~counter~0 4)} assume main_~a~0 > main_~b~0;main_~a~0 := main_~a~0 - main_~b~0;main_~p~0 := main_~p~0 - main_~q~0;main_~r~0 := main_~r~0 - main_~s~0; {11963#(<= ~counter~0 4)} is VALID [2021-09-13 14:25:59,066 INFO L281 TraceCheckUtils]: 13: Hoare triple {11963#(<= ~counter~0 4)} assume !!(main_~a~0 != main_~b~0); {11963#(<= ~counter~0 4)} is VALID [2021-09-13 14:25:59,066 INFO L281 TraceCheckUtils]: 12: Hoare triple {11963#(<= ~counter~0 4)} assume !(0 == __VERIFIER_assert_~cond); {11963#(<= ~counter~0 4)} is VALID [2021-09-13 14:25:59,066 INFO L281 TraceCheckUtils]: 11: Hoare triple {11963#(<= ~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; {11963#(<= ~counter~0 4)} is VALID [2021-09-13 14:25:59,067 INFO L281 TraceCheckUtils]: 10: Hoare triple {11963#(<= ~counter~0 4)} assume !(0 == __VERIFIER_assert_~cond); {11963#(<= ~counter~0 4)} is VALID [2021-09-13 14:25:59,067 INFO L281 TraceCheckUtils]: 9: Hoare triple {11963#(<= ~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; {11963#(<= ~counter~0 4)} is VALID [2021-09-13 14:25:59,067 INFO L281 TraceCheckUtils]: 8: Hoare triple {11963#(<= ~counter~0 4)} assume !(0 == __VERIFIER_assert_~cond); {11963#(<= ~counter~0 4)} is VALID [2021-09-13 14:25:59,067 INFO L281 TraceCheckUtils]: 7: Hoare triple {11963#(<= ~counter~0 4)} assume !!(main_#t~post9 < 50);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 1 == main_~p~0 * main_~s~0 - main_~r~0 * main_~q~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {11963#(<= ~counter~0 4)} is VALID [2021-09-13 14:25:59,067 INFO L281 TraceCheckUtils]: 6: Hoare triple {11935#(<= ~counter~0 3)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {11963#(<= ~counter~0 4)} is VALID [2021-09-13 14:25:59,068 INFO L281 TraceCheckUtils]: 5: Hoare triple {11935#(<= ~counter~0 3)} 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; {11935#(<= ~counter~0 3)} is VALID [2021-09-13 14:25:59,068 INFO L281 TraceCheckUtils]: 4: Hoare triple {11935#(<= ~counter~0 3)} assume !(0 == assume_abort_if_not_~cond); {11935#(<= ~counter~0 3)} is VALID [2021-09-13 14:25:59,068 INFO L281 TraceCheckUtils]: 3: Hoare triple {11935#(<= ~counter~0 3)} 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; {11935#(<= ~counter~0 3)} is VALID [2021-09-13 14:25:59,068 INFO L281 TraceCheckUtils]: 2: Hoare triple {11935#(<= ~counter~0 3)} assume !(0 == assume_abort_if_not_~cond); {11935#(<= ~counter~0 3)} is VALID [2021-09-13 14:25:59,069 INFO L281 TraceCheckUtils]: 1: Hoare triple {11935#(<= ~counter~0 3)} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~post9, main_~a~0, main_~b~0, main_~p~0, main_~q~0, main_~r~0, main_~s~0, main_~x~0, 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_~x~0;havoc main_~y~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; {11935#(<= ~counter~0 3)} is VALID [2021-09-13 14:25:59,069 INFO L281 TraceCheckUtils]: 0: Hoare triple {11855#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(10);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~counter~0 := 0; {11935#(<= ~counter~0 3)} is VALID [2021-09-13 14:25:59,072 INFO L134 CoverageAnalysis]: Checked inductivity of 9407 backedges. 0 proven. 9407 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:25:59,073 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:25:59,073 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669728926] [2021-09-13 14:25:59,073 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-09-13 14:25:59,073 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1063592823] [2021-09-13 14:25:59,073 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1063592823] provided 0 perfect and 2 imperfect interpolant sequences [2021-09-13 14:25:59,073 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-09-13 14:25:59,073 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49] total 53 [2021-09-13 14:25:59,073 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37516236] [2021-09-13 14:25:59,074 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 8.518518518518519) internal successors, (460), 53 states have internal predecessors, (460), 0 states have call successors, (0), 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 425 [2021-09-13 14:25:59,075 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:25:59,075 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 54 states, 54 states have (on average 8.518518518518519) internal successors, (460), 53 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call 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:59,255 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 460 edges. 460 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:25:59,255 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2021-09-13 14:25:59,255 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:25:59,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2021-09-13 14:25:59,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1331, Invalid=1531, Unknown=0, NotChecked=0, Total=2862 [2021-09-13 14:25:59,257 INFO L87 Difference]: Start difference. First operand 430 states and 476 transitions. Second operand has 54 states, 54 states have (on average 8.518518518518519) internal successors, (460), 53 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:26:01,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:26:01,598 INFO L93 Difference]: Finished difference Result 474 states and 527 transitions. [2021-09-13 14:26:01,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2021-09-13 14:26:01,599 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 8.518518518518519) internal successors, (460), 53 states have internal predecessors, (460), 0 states have call successors, (0), 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 425 [2021-09-13 14:26:01,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:26:01,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 54 states have (on average 8.518518518518519) internal successors, (460), 53 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:26:01,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 527 transitions. [2021-09-13 14:26:01,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 54 states have (on average 8.518518518518519) internal successors, (460), 53 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:26:01,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 527 transitions. [2021-09-13 14:26:01,608 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 102 states and 527 transitions. [2021-09-13 14:26:02,025 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 527 edges. 527 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:26:02,034 INFO L225 Difference]: With dead ends: 474 [2021-09-13 14:26:02,034 INFO L226 Difference]: Without dead ends: 466 [2021-09-13 14:26:02,037 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 897 GetRequests, 795 SyntacticMatches, 1 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1275 ImplicationChecksByTransitivity, 1406.07ms TimeCoverageRelationStatistics Valid=3926, Invalid=6580, Unknown=0, NotChecked=0, Total=10506 [2021-09-13 14:26:02,039 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 250 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 596 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 425.43ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.01ms SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 427.44ms IncrementalHoareTripleChecker+Time [2021-09-13 14:26:02,039 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [250 Valid, 0 Invalid, 603 Unknown, 0 Unchecked, 2.01ms Time], IncrementalHoareTripleChecker [7 Valid, 596 Invalid, 0 Unknown, 0 Unchecked, 427.44ms Time] [2021-09-13 14:26:02,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2021-09-13 14:26:03,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 466. [2021-09-13 14:26:03,380 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:26:03,380 INFO L82 GeneralOperation]: Start isEquivalent. First operand 466 states. Second operand has 466 states, 464 states have (on average 1.1120689655172413) internal successors, (516), 465 states have internal predecessors, (516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:26:03,381 INFO L74 IsIncluded]: Start isIncluded. First operand 466 states. Second operand has 466 states, 464 states have (on average 1.1120689655172413) internal successors, (516), 465 states have internal predecessors, (516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:26:03,381 INFO L87 Difference]: Start difference. First operand 466 states. Second operand has 466 states, 464 states have (on average 1.1120689655172413) internal successors, (516), 465 states have internal predecessors, (516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:26:03,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:26:03,389 INFO L93 Difference]: Finished difference Result 466 states and 516 transitions. [2021-09-13 14:26:03,389 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 516 transitions. [2021-09-13 14:26:03,389 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:26:03,389 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:26:03,390 INFO L74 IsIncluded]: Start isIncluded. First operand has 466 states, 464 states have (on average 1.1120689655172413) internal successors, (516), 465 states have internal predecessors, (516), 0 states have call successors, (0), 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 466 states. [2021-09-13 14:26:03,390 INFO L87 Difference]: Start difference. First operand has 466 states, 464 states have (on average 1.1120689655172413) internal successors, (516), 465 states have internal predecessors, (516), 0 states have call successors, (0), 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 466 states. [2021-09-13 14:26:03,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:26:03,398 INFO L93 Difference]: Finished difference Result 466 states and 516 transitions. [2021-09-13 14:26:03,398 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 516 transitions. [2021-09-13 14:26:03,398 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:26:03,398 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:26:03,399 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:26:03,399 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:26:03,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 466 states, 464 states have (on average 1.1120689655172413) internal successors, (516), 465 states have internal predecessors, (516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:26:03,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 516 transitions. [2021-09-13 14:26:03,408 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 516 transitions. Word has length 425 [2021-09-13 14:26:03,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:26:03,408 INFO L470 AbstractCegarLoop]: Abstraction has 466 states and 516 transitions. [2021-09-13 14:26:03,409 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 8.518518518518519) internal successors, (460), 53 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:26:03,409 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 516 transitions. [2021-09-13 14:26:03,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 462 [2021-09-13 14:26:03,413 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:26:03,413 INFO L513 BasicCegarLoop]: trace histogram [51, 50, 50, 50, 50, 50, 50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 14:26:03,464 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:26:03,634 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,SelfDestructingSolverStorable14 [2021-09-13 14:26:03,635 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-09-13 14:26:03,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:26:03,635 INFO L82 PathProgramCache]: Analyzing trace with hash -1886868031, now seen corresponding path program 6 times [2021-09-13 14:26:03,635 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:26:03,635 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690166876] [2021-09-13 14:26:03,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:26:03,635 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:26:03,650 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-09-13 14:26:03,650 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [276761662] [2021-09-13 14:26:03,650 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-09-13 14:26:03,651 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:26:03,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:26:03,651 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:26:03,653 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:26:04,420 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 51 check-sat command(s) [2021-09-13 14:26:04,420 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2021-09-13 14:26:04,421 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-09-13 14:26:04,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-09-13 14:26:04,753 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-09-13 14:26:04,753 INFO L627 BasicCegarLoop]: Counterexample is feasible [2021-09-13 14:26:04,754 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2021-09-13 14:26:04,755 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2021-09-13 14:26:04,755 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (4 of 7 remaining) [2021-09-13 14:26:04,756 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (3 of 7 remaining) [2021-09-13 14:26:04,756 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (2 of 7 remaining) [2021-09-13 14:26:04,756 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (1 of 7 remaining) [2021-09-13 14:26:04,756 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2021-09-13 14:26:04,777 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:26:04,977 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:26:04,982 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-09-13 14:26:05,196 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2021-09-13 14:26:05,197 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2021-09-13 14:26:05,197 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2021-09-13 14:26:05,197 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2021-09-13 14:26:05,197 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2021-09-13 14:26:05,197 WARN L170 areAnnotationChecker]: L8-2 has no Hoare annotation [2021-09-13 14:26:05,197 WARN L170 areAnnotationChecker]: L8-2 has no Hoare annotation [2021-09-13 14:26:05,197 WARN L170 areAnnotationChecker]: L7-1 has no Hoare annotation [2021-09-13 14:26:05,197 WARN L170 areAnnotationChecker]: L42-2 has no Hoare annotation [2021-09-13 14:26:05,197 WARN L170 areAnnotationChecker]: L42-2 has no Hoare annotation [2021-09-13 14:26:05,197 WARN L170 areAnnotationChecker]: L34-3 has no Hoare annotation [2021-09-13 14:26:05,197 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2021-09-13 14:26:05,197 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2021-09-13 14:26:05,198 WARN L170 areAnnotationChecker]: L11-9 has no Hoare annotation [2021-09-13 14:26:05,198 WARN L170 areAnnotationChecker]: L11-9 has no Hoare annotation [2021-09-13 14:26:05,198 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2021-09-13 14:26:05,198 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2021-09-13 14:26:05,199 WARN L170 areAnnotationChecker]: L12-3 has no Hoare annotation [2021-09-13 14:26:05,199 WARN L170 areAnnotationChecker]: L12-3 has no Hoare annotation [2021-09-13 14:26:05,199 WARN L170 areAnnotationChecker]: L11-11 has no Hoare annotation [2021-09-13 14:26:05,199 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2021-09-13 14:26:05,199 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2021-09-13 14:26:05,199 WARN L170 areAnnotationChecker]: L11-2 has no Hoare annotation [2021-09-13 14:26:05,199 WARN L170 areAnnotationChecker]: L11-12 has no Hoare annotation [2021-09-13 14:26:05,199 WARN L170 areAnnotationChecker]: L11-12 has no Hoare annotation [2021-09-13 14:26:05,199 WARN L170 areAnnotationChecker]: L11-3 has no Hoare annotation [2021-09-13 14:26:05,199 WARN L170 areAnnotationChecker]: L11-3 has no Hoare annotation [2021-09-13 14:26:05,199 WARN L170 areAnnotationChecker]: L12-4 has no Hoare annotation [2021-09-13 14:26:05,199 WARN L170 areAnnotationChecker]: L12-4 has no Hoare annotation [2021-09-13 14:26:05,200 WARN L170 areAnnotationChecker]: L11-14 has no Hoare annotation [2021-09-13 14:26:05,200 WARN L170 areAnnotationChecker]: L12-1 has no Hoare annotation [2021-09-13 14:26:05,200 WARN L170 areAnnotationChecker]: L12-1 has no Hoare annotation [2021-09-13 14:26:05,200 WARN L170 areAnnotationChecker]: L11-5 has no Hoare annotation [2021-09-13 14:26:05,200 WARN L170 areAnnotationChecker]: L11-15 has no Hoare annotation [2021-09-13 14:26:05,200 WARN L170 areAnnotationChecker]: L11-15 has no Hoare annotation [2021-09-13 14:26:05,200 WARN L170 areAnnotationChecker]: L11-6 has no Hoare annotation [2021-09-13 14:26:05,200 WARN L170 areAnnotationChecker]: L11-6 has no Hoare annotation [2021-09-13 14:26:05,200 WARN L170 areAnnotationChecker]: L12-5 has no Hoare annotation [2021-09-13 14:26:05,200 WARN L170 areAnnotationChecker]: L12-5 has no Hoare annotation [2021-09-13 14:26:05,200 WARN L170 areAnnotationChecker]: L11-17 has no Hoare annotation [2021-09-13 14:26:05,200 WARN L170 areAnnotationChecker]: L12-2 has no Hoare annotation [2021-09-13 14:26:05,200 WARN L170 areAnnotationChecker]: L12-2 has no Hoare annotation [2021-09-13 14:26:05,201 WARN L170 areAnnotationChecker]: L11-8 has no Hoare annotation [2021-09-13 14:26:05,201 WARN L170 areAnnotationChecker]: L11-8 has no Hoare annotation [2021-09-13 14:26:05,201 WARN L170 areAnnotationChecker]: L11-18 has no Hoare annotation [2021-09-13 14:26:05,201 WARN L170 areAnnotationChecker]: L11-18 has no Hoare annotation [2021-09-13 14:26:05,201 WARN L170 areAnnotationChecker]: L42 has no Hoare annotation [2021-09-13 14:26:05,201 WARN L170 areAnnotationChecker]: L42 has no Hoare annotation [2021-09-13 14:26:05,201 WARN L170 areAnnotationChecker]: L12-6 has no Hoare annotation [2021-09-13 14:26:05,201 WARN L170 areAnnotationChecker]: L12-6 has no Hoare annotation [2021-09-13 14:26:05,201 WARN L170 areAnnotationChecker]: L11-20 has no Hoare annotation [2021-09-13 14:26:05,201 WARN L170 areAnnotationChecker]: L57 has no Hoare annotation [2021-09-13 14:26:05,201 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2021-09-13 14:26:05,201 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:26:05,202 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.09 02:26:05 BoogieIcfgContainer [2021-09-13 14:26:05,202 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-09-13 14:26:05,203 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-09-13 14:26:05,203 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-09-13 14:26:05,203 INFO L275 PluginConnector]: Witness Printer initialized [2021-09-13 14:26:05,204 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:38" (3/4) ... [2021-09-13 14:26:05,205 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-09-13 14:26:05,353 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-09-13 14:26:05,353 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-09-13 14:26:05,354 INFO L158 Benchmark]: Toolchain (without parser) took 507050.88ms. Allocated memory was 79.7MB in the beginning and 180.4MB in the end (delta: 100.7MB). Free memory was 57.1MB in the beginning and 92.0MB in the end (delta: -34.9MB). Peak memory consumption was 105.4MB. Max. memory is 16.1GB. [2021-09-13 14:26:05,354 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 52.4MB. Free memory was 34.9MB in the beginning and 34.9MB in the end (delta: 37.6kB). There was no memory consumed. Max. memory is 16.1GB. [2021-09-13 14:26:05,354 INFO L158 Benchmark]: CACSL2BoogieTranslator took 268.53ms. Allocated memory is still 79.7MB. Free memory was 56.9MB in the beginning and 46.3MB in the end (delta: 10.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-09-13 14:26:05,355 INFO L158 Benchmark]: Boogie Procedure Inliner took 71.05ms. Allocated memory is still 79.7MB. Free memory was 46.3MB in the beginning and 62.4MB in the end (delta: -16.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-09-13 14:26:05,355 INFO L158 Benchmark]: Boogie Preprocessor took 22.08ms. Allocated memory is still 79.7MB. Free memory was 62.4MB in the beginning and 61.0MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2021-09-13 14:26:05,355 INFO L158 Benchmark]: RCFGBuilder took 290.59ms. Allocated memory is still 79.7MB. Free memory was 61.0MB in the beginning and 50.2MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-09-13 14:26:05,355 INFO L158 Benchmark]: TraceAbstraction took 506218.42ms. Allocated memory was 79.7MB in the beginning and 180.4MB in the end (delta: 100.7MB). Free memory was 49.9MB in the beginning and 64.4MB in the end (delta: -14.5MB). Peak memory consumption was 99.4MB. Max. memory is 16.1GB. [2021-09-13 14:26:05,356 INFO L158 Benchmark]: Witness Printer took 149.99ms. Allocated memory is still 180.4MB. Free memory was 64.4MB in the beginning and 92.0MB in the end (delta: -27.7MB). Peak memory consumption was 11.1MB. Max. memory is 16.1GB. [2021-09-13 14:26:05,357 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.12ms. Allocated memory is still 52.4MB. Free memory was 34.9MB in the beginning and 34.9MB in the end (delta: 37.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 268.53ms. Allocated memory is still 79.7MB. Free memory was 56.9MB in the beginning and 46.3MB in the end (delta: 10.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 71.05ms. Allocated memory is still 79.7MB. Free memory was 46.3MB in the beginning and 62.4MB in the end (delta: -16.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 22.08ms. Allocated memory is still 79.7MB. Free memory was 62.4MB in the beginning and 61.0MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 290.59ms. Allocated memory is still 79.7MB. Free memory was 61.0MB in the beginning and 50.2MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 506218.42ms. Allocated memory was 79.7MB in the beginning and 180.4MB in the end (delta: 100.7MB). Free memory was 49.9MB in the beginning and 64.4MB in the end (delta: -14.5MB). Peak memory consumption was 99.4MB. Max. memory is 16.1GB. * Witness Printer took 149.99ms. Allocated memory is still 180.4MB. Free memory was 64.4MB in the beginning and 92.0MB in the end (delta: -27.7MB). Peak memory consumption was 11.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.00ms ErrorAutomatonConstructionTimeTotal, 0.00ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.00ms ErrorAutomatonConstructionTimeAvg, 0.00ms ErrorAutomatonDifferenceTimeAvg, 0.00ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 13]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L18] int counter = 0; VAL [counter=0] [L20] long long a, b, p, q, r, s; [L21] int x, y; [L22] x = __VERIFIER_nondet_int() [L23] y = __VERIFIER_nondet_int() [L8] COND FALSE !(!cond) VAL [counter=0] [L8] COND FALSE !(!cond) VAL [counter=0] [L27] a = x [L28] b = y [L29] p = 1 [L30] q = 0 [L31] r = 0 [L32] s = 1 VAL [counter=0] [L34] EXPR counter++ VAL [counter=1] [L34] COND TRUE counter++<50 [L11] COND FALSE !(!(cond)) VAL [counter=1] [L11] COND FALSE !(!(cond)) VAL [counter=1] [L11] COND FALSE !(!(cond)) VAL [counter=1] [L39] COND FALSE !(!(a != b)) VAL [counter=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [counter=1] [L34] EXPR counter++ VAL [counter=2] [L34] COND TRUE counter++<50 [L11] COND FALSE !(!(cond)) VAL [counter=2] [L11] COND FALSE !(!(cond)) VAL [counter=2] [L11] COND FALSE !(!(cond)) VAL [counter=2] [L39] COND FALSE !(!(a != b)) VAL [counter=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [counter=2] [L34] EXPR counter++ VAL [counter=3] [L34] COND TRUE counter++<50 [L11] COND FALSE !(!(cond)) VAL [counter=3] [L11] COND FALSE !(!(cond)) VAL [counter=3] [L11] COND FALSE !(!(cond)) VAL [counter=3] [L39] COND FALSE !(!(a != b)) VAL [counter=3] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [counter=3] [L34] EXPR counter++ VAL [counter=4] [L34] COND TRUE counter++<50 [L11] COND FALSE !(!(cond)) VAL [counter=4] [L11] COND FALSE !(!(cond)) VAL [counter=4] [L11] COND FALSE !(!(cond)) VAL [counter=4] [L39] COND FALSE !(!(a != b)) VAL [counter=4] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [counter=4] [L34] EXPR counter++ VAL [counter=5] [L34] COND TRUE counter++<50 [L11] COND FALSE !(!(cond)) VAL [counter=5] [L11] COND FALSE !(!(cond)) VAL [counter=5] [L11] COND FALSE !(!(cond)) VAL [counter=5] [L39] COND FALSE !(!(a != b)) VAL [counter=5] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [counter=5] [L34] EXPR counter++ VAL [counter=6] [L34] COND TRUE counter++<50 [L11] COND FALSE !(!(cond)) VAL [counter=6] [L11] COND FALSE !(!(cond)) VAL [counter=6] [L11] COND FALSE !(!(cond)) VAL [counter=6] [L39] COND FALSE !(!(a != b)) VAL [counter=6] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [counter=6] [L34] EXPR counter++ VAL [counter=7] [L34] COND TRUE counter++<50 [L11] COND FALSE !(!(cond)) VAL [counter=7] [L11] COND FALSE !(!(cond)) VAL [counter=7] [L11] COND FALSE !(!(cond)) VAL [counter=7] [L39] COND FALSE !(!(a != b)) VAL [counter=7] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [counter=7] [L34] EXPR counter++ VAL [counter=8] [L34] COND TRUE counter++<50 [L11] COND FALSE !(!(cond)) VAL [counter=8] [L11] COND FALSE !(!(cond)) VAL [counter=8] [L11] COND FALSE !(!(cond)) VAL [counter=8] [L39] COND FALSE !(!(a != b)) VAL [counter=8] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [counter=8] [L34] EXPR counter++ VAL [counter=9] [L34] COND TRUE counter++<50 [L11] COND FALSE !(!(cond)) VAL [counter=9] [L11] COND FALSE !(!(cond)) VAL [counter=9] [L11] COND FALSE !(!(cond)) VAL [counter=9] [L39] COND FALSE !(!(a != b)) VAL [counter=9] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [counter=9] [L34] EXPR counter++ VAL [counter=10] [L34] COND TRUE counter++<50 [L11] COND FALSE !(!(cond)) VAL [counter=10] [L11] COND FALSE !(!(cond)) VAL [counter=10] [L11] COND FALSE !(!(cond)) VAL [counter=10] [L39] COND FALSE !(!(a != b)) VAL [counter=10] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [counter=10] [L34] EXPR counter++ VAL [counter=11] [L34] COND TRUE counter++<50 [L11] COND FALSE !(!(cond)) VAL [counter=11] [L11] COND FALSE !(!(cond)) VAL [counter=11] [L11] COND FALSE !(!(cond)) VAL [counter=11] [L39] COND FALSE !(!(a != b)) VAL [counter=11] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [counter=11] [L34] EXPR counter++ VAL [counter=12] [L34] COND TRUE counter++<50 [L11] COND FALSE !(!(cond)) VAL [counter=12] [L11] COND FALSE !(!(cond)) VAL [counter=12] [L11] COND FALSE !(!(cond)) VAL [counter=12] [L39] COND FALSE !(!(a != b)) VAL [counter=12] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [counter=12] [L34] EXPR counter++ VAL [counter=13] [L34] COND TRUE counter++<50 [L11] COND FALSE !(!(cond)) VAL [counter=13] [L11] COND FALSE !(!(cond)) VAL [counter=13] [L11] COND FALSE !(!(cond)) VAL [counter=13] [L39] COND FALSE !(!(a != b)) VAL [counter=13] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [counter=13] [L34] EXPR counter++ VAL [counter=14] [L34] COND TRUE counter++<50 [L11] COND FALSE !(!(cond)) VAL [counter=14] [L11] COND FALSE !(!(cond)) VAL [counter=14] [L11] COND FALSE !(!(cond)) VAL [counter=14] [L39] COND FALSE !(!(a != b)) VAL [counter=14] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [counter=14] [L34] EXPR counter++ VAL [counter=15] [L34] COND TRUE counter++<50 [L11] COND FALSE !(!(cond)) VAL [counter=15] [L11] COND FALSE !(!(cond)) VAL [counter=15] [L11] COND FALSE !(!(cond)) VAL [counter=15] [L39] COND FALSE !(!(a != b)) VAL [counter=15] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [counter=15] [L34] EXPR counter++ VAL [counter=16] [L34] COND TRUE counter++<50 [L11] COND FALSE !(!(cond)) VAL [counter=16] [L11] COND FALSE !(!(cond)) VAL [counter=16] [L11] COND FALSE !(!(cond)) VAL [counter=16] [L39] COND FALSE !(!(a != b)) VAL [counter=16] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [counter=16] [L34] EXPR counter++ VAL [counter=17] [L34] COND TRUE counter++<50 [L11] COND FALSE !(!(cond)) VAL [counter=17] [L11] COND FALSE !(!(cond)) VAL [counter=17] [L11] COND FALSE !(!(cond)) VAL [counter=17] [L39] COND FALSE !(!(a != b)) VAL [counter=17] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [counter=17] [L34] EXPR counter++ VAL [counter=18] [L34] COND TRUE counter++<50 [L11] COND FALSE !(!(cond)) VAL [counter=18] [L11] COND FALSE !(!(cond)) VAL [counter=18] [L11] COND FALSE !(!(cond)) VAL [counter=18] [L39] COND FALSE !(!(a != b)) VAL [counter=18] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [counter=18] [L34] EXPR counter++ VAL [counter=19] [L34] COND TRUE counter++<50 [L11] COND FALSE !(!(cond)) VAL [counter=19] [L11] COND FALSE !(!(cond)) VAL [counter=19] [L11] COND FALSE !(!(cond)) VAL [counter=19] [L39] COND FALSE !(!(a != b)) VAL [counter=19] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [counter=19] [L34] EXPR counter++ VAL [counter=20] [L34] COND TRUE counter++<50 [L11] COND FALSE !(!(cond)) VAL [counter=20] [L11] COND FALSE !(!(cond)) VAL [counter=20] [L11] COND FALSE !(!(cond)) VAL [counter=20] [L39] COND FALSE !(!(a != b)) VAL [counter=20] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [counter=20] [L34] EXPR counter++ VAL [counter=21] [L34] COND TRUE counter++<50 [L11] COND FALSE !(!(cond)) VAL [counter=21] [L11] COND FALSE !(!(cond)) VAL [counter=21] [L11] COND FALSE !(!(cond)) VAL [counter=21] [L39] COND FALSE !(!(a != b)) VAL [counter=21] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [counter=21] [L34] EXPR counter++ VAL [counter=22] [L34] COND TRUE counter++<50 [L11] COND FALSE !(!(cond)) VAL [counter=22] [L11] COND FALSE !(!(cond)) VAL [counter=22] [L11] COND FALSE !(!(cond)) VAL [counter=22] [L39] COND FALSE !(!(a != b)) VAL [counter=22] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [counter=22] [L34] EXPR counter++ VAL [counter=23] [L34] COND TRUE counter++<50 [L11] COND FALSE !(!(cond)) VAL [counter=23] [L11] COND FALSE !(!(cond)) VAL [counter=23] [L11] COND FALSE !(!(cond)) VAL [counter=23] [L39] COND FALSE !(!(a != b)) VAL [counter=23] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [counter=23] [L34] EXPR counter++ VAL [counter=24] [L34] COND TRUE counter++<50 [L11] COND FALSE !(!(cond)) VAL [counter=24] [L11] COND FALSE !(!(cond)) VAL [counter=24] [L11] COND FALSE !(!(cond)) VAL [counter=24] [L39] COND FALSE !(!(a != b)) VAL [counter=24] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [counter=24] [L34] EXPR counter++ VAL [counter=25] [L34] COND TRUE counter++<50 [L11] COND FALSE !(!(cond)) VAL [counter=25] [L11] COND FALSE !(!(cond)) VAL [counter=25] [L11] COND FALSE !(!(cond)) VAL [counter=25] [L39] COND FALSE !(!(a != b)) VAL [counter=25] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [counter=25] [L34] EXPR counter++ VAL [counter=26] [L34] COND TRUE counter++<50 [L11] COND FALSE !(!(cond)) VAL [counter=26] [L11] COND FALSE !(!(cond)) VAL [counter=26] [L11] COND FALSE !(!(cond)) VAL [counter=26] [L39] COND FALSE !(!(a != b)) VAL [counter=26] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [counter=26] [L34] EXPR counter++ VAL [counter=27] [L34] COND TRUE counter++<50 [L11] COND FALSE !(!(cond)) VAL [counter=27] [L11] COND FALSE !(!(cond)) VAL [counter=27] [L11] COND FALSE !(!(cond)) VAL [counter=27] [L39] COND FALSE !(!(a != b)) VAL [counter=27] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [counter=27] [L34] EXPR counter++ VAL [counter=28] [L34] COND TRUE counter++<50 [L11] COND FALSE !(!(cond)) VAL [counter=28] [L11] COND FALSE !(!(cond)) VAL [counter=28] [L11] COND FALSE !(!(cond)) VAL [counter=28] [L39] COND FALSE !(!(a != b)) VAL [counter=28] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [counter=28] [L34] EXPR counter++ VAL [counter=29] [L34] COND TRUE counter++<50 [L11] COND FALSE !(!(cond)) VAL [counter=29] [L11] COND FALSE !(!(cond)) VAL [counter=29] [L11] COND FALSE !(!(cond)) VAL [counter=29] [L39] COND FALSE !(!(a != b)) VAL [counter=29] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [counter=29] [L34] EXPR counter++ VAL [counter=30] [L34] COND TRUE counter++<50 [L11] COND FALSE !(!(cond)) VAL [counter=30] [L11] COND FALSE !(!(cond)) VAL [counter=30] [L11] COND FALSE !(!(cond)) VAL [counter=30] [L39] COND FALSE !(!(a != b)) VAL [counter=30] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [counter=30] [L34] EXPR counter++ VAL [counter=31] [L34] COND TRUE counter++<50 [L11] COND FALSE !(!(cond)) VAL [counter=31] [L11] COND FALSE !(!(cond)) VAL [counter=31] [L11] COND FALSE !(!(cond)) VAL [counter=31] [L39] COND FALSE !(!(a != b)) VAL [counter=31] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [counter=31] [L34] EXPR counter++ VAL [counter=32] [L34] COND TRUE counter++<50 [L11] COND FALSE !(!(cond)) VAL [counter=32] [L11] COND FALSE !(!(cond)) VAL [counter=32] [L11] COND FALSE !(!(cond)) VAL [counter=32] [L39] COND FALSE !(!(a != b)) VAL [counter=32] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [counter=32] [L34] EXPR counter++ VAL [counter=33] [L34] COND TRUE counter++<50 [L11] COND FALSE !(!(cond)) VAL [counter=33] [L11] COND FALSE !(!(cond)) VAL [counter=33] [L11] COND FALSE !(!(cond)) VAL [counter=33] [L39] COND FALSE !(!(a != b)) VAL [counter=33] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [counter=33] [L34] EXPR counter++ VAL [counter=34] [L34] COND TRUE counter++<50 [L11] COND FALSE !(!(cond)) VAL [counter=34] [L11] COND FALSE !(!(cond)) VAL [counter=34] [L11] COND FALSE !(!(cond)) VAL [counter=34] [L39] COND FALSE !(!(a != b)) VAL [counter=34] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [counter=34] [L34] EXPR counter++ VAL [counter=35] [L34] COND TRUE counter++<50 [L11] COND FALSE !(!(cond)) VAL [counter=35] [L11] COND FALSE !(!(cond)) VAL [counter=35] [L11] COND FALSE !(!(cond)) VAL [counter=35] [L39] COND FALSE !(!(a != b)) VAL [counter=35] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [counter=35] [L34] EXPR counter++ VAL [counter=36] [L34] COND TRUE counter++<50 [L11] COND FALSE !(!(cond)) VAL [counter=36] [L11] COND FALSE !(!(cond)) VAL [counter=36] [L11] COND FALSE !(!(cond)) VAL [counter=36] [L39] COND FALSE !(!(a != b)) VAL [counter=36] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [counter=36] [L34] EXPR counter++ VAL [counter=37] [L34] COND TRUE counter++<50 [L11] COND FALSE !(!(cond)) VAL [counter=37] [L11] COND FALSE !(!(cond)) VAL [counter=37] [L11] COND FALSE !(!(cond)) VAL [counter=37] [L39] COND FALSE !(!(a != b)) VAL [counter=37] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [counter=37] [L34] EXPR counter++ VAL [counter=38] [L34] COND TRUE counter++<50 [L11] COND FALSE !(!(cond)) VAL [counter=38] [L11] COND FALSE !(!(cond)) VAL [counter=38] [L11] COND FALSE !(!(cond)) VAL [counter=38] [L39] COND FALSE !(!(a != b)) VAL [counter=38] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [counter=38] [L34] EXPR counter++ VAL [counter=39] [L34] COND TRUE counter++<50 [L11] COND FALSE !(!(cond)) VAL [counter=39] [L11] COND FALSE !(!(cond)) VAL [counter=39] [L11] COND FALSE !(!(cond)) VAL [counter=39] [L39] COND FALSE !(!(a != b)) VAL [counter=39] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [counter=39] [L34] EXPR counter++ VAL [counter=40] [L34] COND TRUE counter++<50 [L11] COND FALSE !(!(cond)) VAL [counter=40] [L11] COND FALSE !(!(cond)) VAL [counter=40] [L11] COND FALSE !(!(cond)) VAL [counter=40] [L39] COND FALSE !(!(a != b)) VAL [counter=40] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [counter=40] [L34] EXPR counter++ VAL [counter=41] [L34] COND TRUE counter++<50 [L11] COND FALSE !(!(cond)) VAL [counter=41] [L11] COND FALSE !(!(cond)) VAL [counter=41] [L11] COND FALSE !(!(cond)) VAL [counter=41] [L39] COND FALSE !(!(a != b)) VAL [counter=41] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [counter=41] [L34] EXPR counter++ VAL [counter=42] [L34] COND TRUE counter++<50 [L11] COND FALSE !(!(cond)) VAL [counter=42] [L11] COND FALSE !(!(cond)) VAL [counter=42] [L11] COND FALSE !(!(cond)) VAL [counter=42] [L39] COND FALSE !(!(a != b)) VAL [counter=42] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [counter=42] [L34] EXPR counter++ VAL [counter=43] [L34] COND TRUE counter++<50 [L11] COND FALSE !(!(cond)) VAL [counter=43] [L11] COND FALSE !(!(cond)) VAL [counter=43] [L11] COND FALSE !(!(cond)) VAL [counter=43] [L39] COND FALSE !(!(a != b)) VAL [counter=43] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [counter=43] [L34] EXPR counter++ VAL [counter=44] [L34] COND TRUE counter++<50 [L11] COND FALSE !(!(cond)) VAL [counter=44] [L11] COND FALSE !(!(cond)) VAL [counter=44] [L11] COND FALSE !(!(cond)) VAL [counter=44] [L39] COND FALSE !(!(a != b)) VAL [counter=44] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [counter=44] [L34] EXPR counter++ VAL [counter=45] [L34] COND TRUE counter++<50 [L11] COND FALSE !(!(cond)) VAL [counter=45] [L11] COND FALSE !(!(cond)) VAL [counter=45] [L11] COND FALSE !(!(cond)) VAL [counter=45] [L39] COND FALSE !(!(a != b)) VAL [counter=45] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [counter=45] [L34] EXPR counter++ VAL [counter=46] [L34] COND TRUE counter++<50 [L11] COND FALSE !(!(cond)) VAL [counter=46] [L11] COND FALSE !(!(cond)) VAL [counter=46] [L11] COND FALSE !(!(cond)) VAL [counter=46] [L39] COND FALSE !(!(a != b)) VAL [counter=46] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [counter=46] [L34] EXPR counter++ VAL [counter=47] [L34] COND TRUE counter++<50 [L11] COND FALSE !(!(cond)) VAL [counter=47] [L11] COND FALSE !(!(cond)) VAL [counter=47] [L11] COND FALSE !(!(cond)) VAL [counter=47] [L39] COND FALSE !(!(a != b)) VAL [counter=47] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [counter=47] [L34] EXPR counter++ VAL [counter=48] [L34] COND TRUE counter++<50 [L11] COND FALSE !(!(cond)) VAL [counter=48] [L11] COND FALSE !(!(cond)) VAL [counter=48] [L11] COND FALSE !(!(cond)) VAL [counter=48] [L39] COND FALSE !(!(a != b)) VAL [counter=48] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [counter=48] [L34] EXPR counter++ VAL [counter=49] [L34] COND TRUE counter++<50 [L11] COND FALSE !(!(cond)) VAL [counter=49] [L11] COND FALSE !(!(cond)) VAL [counter=49] [L11] COND FALSE !(!(cond)) VAL [counter=49] [L39] COND FALSE !(!(a != b)) VAL [counter=49] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [counter=49] [L34] EXPR counter++ VAL [counter=50] [L34] COND TRUE counter++<50 [L11] COND FALSE !(!(cond)) VAL [counter=50] [L11] COND FALSE !(!(cond)) VAL [counter=50] [L11] COND FALSE !(!(cond)) VAL [counter=50] [L39] COND FALSE !(!(a != b)) VAL [counter=50] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [counter=50] [L34] EXPR counter++ VAL [counter=51] [L34] COND FALSE !(counter++<50) [L11] COND TRUE !(cond) VAL [counter=51] [L13] reach_error() VAL [counter=51] - 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. - UnprovableResult [Line: 13]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 41 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 505938.85ms, OverallIterations: 16, TraceHistogramMax: 51, EmptinessCheckTime: 41.64ms, AutomataDifference: 13917.66ms, DeadEndRemovalTime: 0.00ms, HoareAnnotationTime: 0.00ms, InitialAbstractionConstructionTime: 6.83ms, PartialOrderReductionTime: 0.00ms, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1615 SdHoareTripleChecker+Valid, 2947.80ms IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1615 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 2917.63ms Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 38 IncrementalHoareTripleChecker+Unchecked, 2407 mSDsCounter, 237 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3249 IncrementalHoareTripleChecker+Invalid, 3524 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 237 mSolverCounterUnsat, 0 mSDtfsCounter, 3249 mSolverCounterSat, 22.09ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1952 GetRequests, 1614 SyntacticMatches, 6 SemanticMatches, 332 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2974 ImplicationChecksByTransitivity, 4751.12ms Time, 0.00ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=466occurred in iteration=15, InterpolantAutomatonStates: 335, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.00ms DumpTime, AutomataMinimizationStatistics: 4052.86ms AutomataMinimizationTime, 15 MinimizatonAttempts, 243 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 200.26ms SsaConstructionTime, 69287.84ms SatisfiabilityAnalysisTime, 413584.26ms InterpolantComputationTime, 1424 NumberOfCodeBlocks, 1424 NumberOfCodeBlocksAsserted, 124 NumberOfCheckSat, 1810 ConstructedInterpolants, 11 QuantifiedInterpolants, 6335 SizeOfPredicates, 144 NumberOfNonLiveVariables, 3470 ConjunctsInSsa, 308 ConjunctsInUnsatCore, 23 InterpolantComputations, 7 PerfectInterpolantSequences, 21/24084 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 proved your program to be incorrect! [2021-09-13 14:26:05,461 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...