/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/egcd-ll_unwindbound50.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 12:49:55,237 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 12:49:55,239 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 12:49:55,280 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 12:49:55,281 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 12:49:55,283 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 12:49:55,286 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 12:49:55,288 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 12:49:55,289 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 12:49:55,293 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 12:49:55,294 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 12:49:55,295 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 12:49:55,296 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 12:49:55,298 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 12:49:55,298 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 12:49:55,301 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 12:49:55,301 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 12:49:55,302 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 12:49:55,304 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 12:49:55,308 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 12:49:55,310 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 12:49:55,311 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 12:49:55,312 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 12:49:55,313 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 12:49:55,314 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 12:49:55,320 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 12:49:55,320 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 12:49:55,320 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 12:49:55,321 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 12:49:55,321 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 12:49:55,322 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 12:49:55,322 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 12:49:55,324 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 12:49:55,324 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 12:49:55,325 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 12:49:55,325 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 12:49:55,326 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 12:49:55,326 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 12:49:55,327 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 12:49:55,327 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 12:49:55,327 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 12:49:55,329 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 12:49:55,330 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-04-27 12:49:55,358 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 12:49:55,358 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 12:49:55,358 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 12:49:55,359 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 12:49:55,359 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 12:49:55,359 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 12:49:55,360 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 12:49:55,360 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 12:49:55,360 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 12:49:55,361 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 12:49:55,361 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 12:49:55,361 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 12:49:55,361 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 12:49:55,361 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 12:49:55,361 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 12:49:55,361 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 12:49:55,361 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 12:49:55,362 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 12:49:55,363 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 12:49:55,363 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 12:49:55,363 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 12:49:55,363 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 12:49:55,363 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 12:49:55,363 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 12:49:55,363 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 12:49:55,364 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 12:49:55,364 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 12:49:55,364 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 12:49:55,364 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 12:49:55,364 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 12:49:55,364 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 12:49:55,364 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 12:49:55,364 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 12:49:55,365 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.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-27 12:49:55,604 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 12:49:55,623 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 12:49:55,625 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 12:49:55,626 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 12:49:55,627 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 12:49:55,628 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/egcd-ll_unwindbound50.c [2022-04-27 12:49:55,676 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea0532f87/dedc447df6f74421bb1fa9caa80ba189/FLAG7a908be33 [2022-04-27 12:49:56,097 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 12:49:56,098 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/egcd-ll_unwindbound50.c [2022-04-27 12:49:56,106 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea0532f87/dedc447df6f74421bb1fa9caa80ba189/FLAG7a908be33 [2022-04-27 12:49:56,119 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea0532f87/dedc447df6f74421bb1fa9caa80ba189 [2022-04-27 12:49:56,121 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 12:49:56,122 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 12:49:56,125 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 12:49:56,125 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 12:49:56,127 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 12:49:56,128 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 12:49:56" (1/1) ... [2022-04-27 12:49:56,129 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@358120bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:49:56, skipping insertion in model container [2022-04-27 12:49:56,129 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 12:49:56" (1/1) ... [2022-04-27 12:49:56,135 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 12:49:56,147 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 12:49:56,282 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/egcd-ll_unwindbound50.c[489,502] [2022-04-27 12:49:56,298 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 12:49:56,305 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 12:49:56,314 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/egcd-ll_unwindbound50.c[489,502] [2022-04-27 12:49:56,321 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 12:49:56,331 INFO L208 MainTranslator]: Completed translation [2022-04-27 12:49:56,332 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:49:56 WrapperNode [2022-04-27 12:49:56,332 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 12:49:56,332 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 12:49:56,333 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 12:49:56,333 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 12:49:56,341 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:49:56" (1/1) ... [2022-04-27 12:49:56,341 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:49:56" (1/1) ... [2022-04-27 12:49:56,346 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:49:56" (1/1) ... [2022-04-27 12:49:56,346 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:49:56" (1/1) ... [2022-04-27 12:49:56,351 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:49:56" (1/1) ... [2022-04-27 12:49:56,354 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:49:56" (1/1) ... [2022-04-27 12:49:56,355 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:49:56" (1/1) ... [2022-04-27 12:49:56,356 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 12:49:56,357 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 12:49:56,357 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 12:49:56,357 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 12:49:56,358 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:49:56" (1/1) ... [2022-04-27 12:49:56,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 12:49:56,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:49:56,380 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-27 12:49:56,412 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-27 12:49:56,432 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 12:49:56,432 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 12:49:56,432 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 12:49:56,433 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 12:49:56,434 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 12:49:56,434 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 12:49:56,434 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 12:49:56,434 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 12:49:56,435 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 12:49:56,435 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 12:49:56,435 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 12:49:56,435 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 12:49:56,435 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 12:49:56,435 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 12:49:56,435 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 12:49:56,435 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 12:49:56,435 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 12:49:56,435 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 12:49:56,435 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 12:49:56,435 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 12:49:56,492 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 12:49:56,493 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 12:49:56,698 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 12:49:56,704 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 12:49:56,704 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 12:49:56,705 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 12:49:56 BoogieIcfgContainer [2022-04-27 12:49:56,705 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 12:49:56,707 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 12:49:56,707 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 12:49:56,712 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 12:49:56,713 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 12:49:56" (1/3) ... [2022-04-27 12:49:56,713 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b598ba1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 12:49:56, skipping insertion in model container [2022-04-27 12:49:56,713 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:49:56" (2/3) ... [2022-04-27 12:49:56,714 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b598ba1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 12:49:56, skipping insertion in model container [2022-04-27 12:49:56,714 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 12:49:56" (3/3) ... [2022-04-27 12:49:56,716 INFO L111 eAbstractionObserver]: Analyzing ICFG egcd-ll_unwindbound50.c [2022-04-27 12:49:56,728 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 12:49:56,728 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 12:49:56,784 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 12:49:56,799 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@41c29278, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@3760f9d5 [2022-04-27 12:49:56,799 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 12:49:56,806 INFO L276 IsEmpty]: Start isEmpty. Operand has 35 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 19 states have internal predecessors, (25), 11 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 12:49:56,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-27 12:49:56,815 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:49:56,816 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:49:56,816 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:49:56,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:49:56,821 INFO L85 PathProgramCache]: Analyzing trace with hash 1226702723, now seen corresponding path program 1 times [2022-04-27 12:49:56,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:49:56,829 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083593793] [2022-04-27 12:49:56,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:49:56,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:49:56,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:49:57,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 12:49:57,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:49:57,045 INFO L290 TraceCheckUtils]: 0: Hoare triple {51#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {38#true} is VALID [2022-04-27 12:49:57,045 INFO L290 TraceCheckUtils]: 1: Hoare triple {38#true} assume true; {38#true} is VALID [2022-04-27 12:49:57,046 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {38#true} {38#true} #82#return; {38#true} is VALID [2022-04-27 12:49:57,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 12:49:57,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:49:57,058 INFO L290 TraceCheckUtils]: 0: Hoare triple {38#true} ~cond := #in~cond; {38#true} is VALID [2022-04-27 12:49:57,059 INFO L290 TraceCheckUtils]: 1: Hoare triple {38#true} assume 0 == ~cond;assume false; {39#false} is VALID [2022-04-27 12:49:57,059 INFO L290 TraceCheckUtils]: 2: Hoare triple {39#false} assume true; {39#false} is VALID [2022-04-27 12:49:57,059 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {39#false} {38#true} #64#return; {39#false} is VALID [2022-04-27 12:49:57,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-27 12:49:57,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:49:57,077 INFO L290 TraceCheckUtils]: 0: Hoare triple {38#true} ~cond := #in~cond; {38#true} is VALID [2022-04-27 12:49:57,078 INFO L290 TraceCheckUtils]: 1: Hoare triple {38#true} assume 0 == ~cond;assume false; {39#false} is VALID [2022-04-27 12:49:57,079 INFO L290 TraceCheckUtils]: 2: Hoare triple {39#false} assume true; {39#false} is VALID [2022-04-27 12:49:57,079 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {39#false} {39#false} #66#return; {39#false} is VALID [2022-04-27 12:49:57,080 INFO L272 TraceCheckUtils]: 0: Hoare triple {38#true} call ULTIMATE.init(); {51#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 12:49:57,080 INFO L290 TraceCheckUtils]: 1: Hoare triple {51#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {38#true} is VALID [2022-04-27 12:49:57,080 INFO L290 TraceCheckUtils]: 2: Hoare triple {38#true} assume true; {38#true} is VALID [2022-04-27 12:49:57,080 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38#true} {38#true} #82#return; {38#true} is VALID [2022-04-27 12:49:57,081 INFO L272 TraceCheckUtils]: 4: Hoare triple {38#true} call #t~ret7 := main(); {38#true} is VALID [2022-04-27 12:49:57,081 INFO L290 TraceCheckUtils]: 5: Hoare triple {38#true} havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~x~0;havoc ~y~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {38#true} is VALID [2022-04-27 12:49:57,081 INFO L272 TraceCheckUtils]: 6: Hoare triple {38#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {38#true} is VALID [2022-04-27 12:49:57,081 INFO L290 TraceCheckUtils]: 7: Hoare triple {38#true} ~cond := #in~cond; {38#true} is VALID [2022-04-27 12:49:57,082 INFO L290 TraceCheckUtils]: 8: Hoare triple {38#true} assume 0 == ~cond;assume false; {39#false} is VALID [2022-04-27 12:49:57,082 INFO L290 TraceCheckUtils]: 9: Hoare triple {39#false} assume true; {39#false} is VALID [2022-04-27 12:49:57,082 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {39#false} {38#true} #64#return; {39#false} is VALID [2022-04-27 12:49:57,083 INFO L272 TraceCheckUtils]: 11: Hoare triple {39#false} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {38#true} is VALID [2022-04-27 12:49:57,083 INFO L290 TraceCheckUtils]: 12: Hoare triple {38#true} ~cond := #in~cond; {38#true} is VALID [2022-04-27 12:49:57,084 INFO L290 TraceCheckUtils]: 13: Hoare triple {38#true} assume 0 == ~cond;assume false; {39#false} is VALID [2022-04-27 12:49:57,084 INFO L290 TraceCheckUtils]: 14: Hoare triple {39#false} assume true; {39#false} is VALID [2022-04-27 12:49:57,084 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {39#false} {39#false} #66#return; {39#false} is VALID [2022-04-27 12:49:57,085 INFO L290 TraceCheckUtils]: 16: Hoare triple {39#false} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {39#false} is VALID [2022-04-27 12:49:57,085 INFO L290 TraceCheckUtils]: 17: Hoare triple {39#false} assume !true; {39#false} is VALID [2022-04-27 12:49:57,085 INFO L272 TraceCheckUtils]: 18: Hoare triple {39#false} call __VERIFIER_assert((if 0 == ~a~0 - ~b~0 then 1 else 0)); {39#false} is VALID [2022-04-27 12:49:57,085 INFO L290 TraceCheckUtils]: 19: Hoare triple {39#false} ~cond := #in~cond; {39#false} is VALID [2022-04-27 12:49:57,086 INFO L290 TraceCheckUtils]: 20: Hoare triple {39#false} assume 0 == ~cond; {39#false} is VALID [2022-04-27 12:49:57,086 INFO L290 TraceCheckUtils]: 21: Hoare triple {39#false} assume !false; {39#false} is VALID [2022-04-27 12:49:57,087 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 12:49:57,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:49:57,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083593793] [2022-04-27 12:49:57,088 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083593793] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 12:49:57,089 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 12:49:57,089 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 12:49:57,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997662600] [2022-04-27 12:49:57,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:49:57,097 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-27 12:49:57,099 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:49:57,102 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 12:49:57,140 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:49:57,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 12:49:57,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:49:57,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 12:49:57,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 12:49:57,171 INFO L87 Difference]: Start difference. First operand has 35 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 19 states have internal predecessors, (25), 11 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 12:49:57,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:49:57,343 INFO L93 Difference]: Finished difference Result 64 states and 97 transitions. [2022-04-27 12:49:57,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 12:49:57,344 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-27 12:49:57,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:49:57,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 12:49:57,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 97 transitions. [2022-04-27 12:49:57,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 12:49:57,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 97 transitions. [2022-04-27 12:49:57,361 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 97 transitions. [2022-04-27 12:49:57,474 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:49:57,482 INFO L225 Difference]: With dead ends: 64 [2022-04-27 12:49:57,482 INFO L226 Difference]: Without dead ends: 31 [2022-04-27 12:49:57,485 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 12:49:57,487 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 10 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 12:49:57,488 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 45 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 12:49:57,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-04-27 12:49:57,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2022-04-27 12:49:57,513 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:49:57,514 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand has 30 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 12:49:57,515 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand has 30 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 12:49:57,516 INFO L87 Difference]: Start difference. First operand 31 states. Second operand has 30 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 12:49:57,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:49:57,520 INFO L93 Difference]: Finished difference Result 31 states and 40 transitions. [2022-04-27 12:49:57,520 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 40 transitions. [2022-04-27 12:49:57,521 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:49:57,521 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:49:57,521 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 31 states. [2022-04-27 12:49:57,522 INFO L87 Difference]: Start difference. First operand has 30 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 31 states. [2022-04-27 12:49:57,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:49:57,525 INFO L93 Difference]: Finished difference Result 31 states and 40 transitions. [2022-04-27 12:49:57,525 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 40 transitions. [2022-04-27 12:49:57,526 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:49:57,526 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:49:57,526 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:49:57,527 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:49:57,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 12:49:57,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 39 transitions. [2022-04-27 12:49:57,531 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 39 transitions. Word has length 22 [2022-04-27 12:49:57,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:49:57,531 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 39 transitions. [2022-04-27 12:49:57,531 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 12:49:57,532 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 39 transitions. [2022-04-27 12:49:57,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-27 12:49:57,532 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:49:57,532 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:49:57,533 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 12:49:57,533 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:49:57,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:49:57,534 INFO L85 PathProgramCache]: Analyzing trace with hash 1346542817, now seen corresponding path program 1 times [2022-04-27 12:49:57,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:49:57,534 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255458573] [2022-04-27 12:49:57,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:49:57,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:49:57,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:49:57,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 12:49:57,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:49:57,619 INFO L290 TraceCheckUtils]: 0: Hoare triple {269#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {259#(= ~counter~0 0)} is VALID [2022-04-27 12:49:57,619 INFO L290 TraceCheckUtils]: 1: Hoare triple {259#(= ~counter~0 0)} assume true; {259#(= ~counter~0 0)} is VALID [2022-04-27 12:49:57,620 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {259#(= ~counter~0 0)} {254#true} #82#return; {259#(= ~counter~0 0)} is VALID [2022-04-27 12:49:57,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 12:49:57,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:49:57,627 INFO L290 TraceCheckUtils]: 0: Hoare triple {254#true} ~cond := #in~cond; {254#true} is VALID [2022-04-27 12:49:57,628 INFO L290 TraceCheckUtils]: 1: Hoare triple {254#true} assume !(0 == ~cond); {254#true} is VALID [2022-04-27 12:49:57,628 INFO L290 TraceCheckUtils]: 2: Hoare triple {254#true} assume true; {254#true} is VALID [2022-04-27 12:49:57,628 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {254#true} {259#(= ~counter~0 0)} #64#return; {259#(= ~counter~0 0)} is VALID [2022-04-27 12:49:57,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-27 12:49:57,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:49:57,644 INFO L290 TraceCheckUtils]: 0: Hoare triple {254#true} ~cond := #in~cond; {254#true} is VALID [2022-04-27 12:49:57,644 INFO L290 TraceCheckUtils]: 1: Hoare triple {254#true} assume !(0 == ~cond); {254#true} is VALID [2022-04-27 12:49:57,644 INFO L290 TraceCheckUtils]: 2: Hoare triple {254#true} assume true; {254#true} is VALID [2022-04-27 12:49:57,645 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {254#true} {259#(= ~counter~0 0)} #66#return; {259#(= ~counter~0 0)} is VALID [2022-04-27 12:49:57,646 INFO L272 TraceCheckUtils]: 0: Hoare triple {254#true} call ULTIMATE.init(); {269#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 12:49:57,646 INFO L290 TraceCheckUtils]: 1: Hoare triple {269#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {259#(= ~counter~0 0)} is VALID [2022-04-27 12:49:57,647 INFO L290 TraceCheckUtils]: 2: Hoare triple {259#(= ~counter~0 0)} assume true; {259#(= ~counter~0 0)} is VALID [2022-04-27 12:49:57,647 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {259#(= ~counter~0 0)} {254#true} #82#return; {259#(= ~counter~0 0)} is VALID [2022-04-27 12:49:57,648 INFO L272 TraceCheckUtils]: 4: Hoare triple {259#(= ~counter~0 0)} call #t~ret7 := main(); {259#(= ~counter~0 0)} is VALID [2022-04-27 12:49:57,660 INFO L290 TraceCheckUtils]: 5: Hoare triple {259#(= ~counter~0 0)} havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~x~0;havoc ~y~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {259#(= ~counter~0 0)} is VALID [2022-04-27 12:49:57,660 INFO L272 TraceCheckUtils]: 6: Hoare triple {259#(= ~counter~0 0)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {254#true} is VALID [2022-04-27 12:49:57,660 INFO L290 TraceCheckUtils]: 7: Hoare triple {254#true} ~cond := #in~cond; {254#true} is VALID [2022-04-27 12:49:57,661 INFO L290 TraceCheckUtils]: 8: Hoare triple {254#true} assume !(0 == ~cond); {254#true} is VALID [2022-04-27 12:49:57,661 INFO L290 TraceCheckUtils]: 9: Hoare triple {254#true} assume true; {254#true} is VALID [2022-04-27 12:49:57,661 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {254#true} {259#(= ~counter~0 0)} #64#return; {259#(= ~counter~0 0)} is VALID [2022-04-27 12:49:57,662 INFO L272 TraceCheckUtils]: 11: Hoare triple {259#(= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {254#true} is VALID [2022-04-27 12:49:57,662 INFO L290 TraceCheckUtils]: 12: Hoare triple {254#true} ~cond := #in~cond; {254#true} is VALID [2022-04-27 12:49:57,662 INFO L290 TraceCheckUtils]: 13: Hoare triple {254#true} assume !(0 == ~cond); {254#true} is VALID [2022-04-27 12:49:57,662 INFO L290 TraceCheckUtils]: 14: Hoare triple {254#true} assume true; {254#true} is VALID [2022-04-27 12:49:57,663 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {254#true} {259#(= ~counter~0 0)} #66#return; {259#(= ~counter~0 0)} is VALID [2022-04-27 12:49:57,663 INFO L290 TraceCheckUtils]: 16: Hoare triple {259#(= ~counter~0 0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {259#(= ~counter~0 0)} is VALID [2022-04-27 12:49:57,664 INFO L290 TraceCheckUtils]: 17: Hoare triple {259#(= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {268#(= |main_#t~post6| 0)} is VALID [2022-04-27 12:49:57,664 INFO L290 TraceCheckUtils]: 18: Hoare triple {268#(= |main_#t~post6| 0)} assume !(#t~post6 < 50);havoc #t~post6; {255#false} is VALID [2022-04-27 12:49:57,664 INFO L272 TraceCheckUtils]: 19: Hoare triple {255#false} call __VERIFIER_assert((if 0 == ~a~0 - ~b~0 then 1 else 0)); {255#false} is VALID [2022-04-27 12:49:57,665 INFO L290 TraceCheckUtils]: 20: Hoare triple {255#false} ~cond := #in~cond; {255#false} is VALID [2022-04-27 12:49:57,665 INFO L290 TraceCheckUtils]: 21: Hoare triple {255#false} assume 0 == ~cond; {255#false} is VALID [2022-04-27 12:49:57,665 INFO L290 TraceCheckUtils]: 22: Hoare triple {255#false} assume !false; {255#false} is VALID [2022-04-27 12:49:57,665 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 12:49:57,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:49:57,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255458573] [2022-04-27 12:49:57,666 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255458573] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 12:49:57,666 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 12:49:57,666 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 12:49:57,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65963025] [2022-04-27 12:49:57,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:49:57,668 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 3 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-27 12:49:57,668 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:49:57,668 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 3 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 12:49:57,700 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:49:57,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 12:49:57,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:49:57,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 12:49:57,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 12:49:57,702 INFO L87 Difference]: Start difference. First operand 30 states and 39 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 3 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 12:49:57,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:49:57,942 INFO L93 Difference]: Finished difference Result 42 states and 54 transitions. [2022-04-27 12:49:57,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 12:49:57,943 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 3 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-27 12:49:57,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:49:57,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 3 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 12:49:57,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 54 transitions. [2022-04-27 12:49:57,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 3 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 12:49:57,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 54 transitions. [2022-04-27 12:49:57,960 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 54 transitions. [2022-04-27 12:49:58,022 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:49:58,025 INFO L225 Difference]: With dead ends: 42 [2022-04-27 12:49:58,026 INFO L226 Difference]: Without dead ends: 32 [2022-04-27 12:49:58,029 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 12:49:58,032 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 13 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 12:49:58,032 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 65 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 12:49:58,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-27 12:49:58,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-27 12:49:58,040 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:49:58,041 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 32 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 12:49:58,041 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 32 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 12:49:58,042 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 32 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 12:49:58,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:49:58,047 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2022-04-27 12:49:58,047 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-04-27 12:49:58,053 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:49:58,053 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:49:58,054 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 32 states. [2022-04-27 12:49:58,056 INFO L87 Difference]: Start difference. First operand has 32 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 32 states. [2022-04-27 12:49:58,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:49:58,063 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2022-04-27 12:49:58,063 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-04-27 12:49:58,064 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:49:58,065 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:49:58,065 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:49:58,066 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:49:58,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 12:49:58,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 41 transitions. [2022-04-27 12:49:58,078 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 41 transitions. Word has length 23 [2022-04-27 12:49:58,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:49:58,078 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 41 transitions. [2022-04-27 12:49:58,078 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 3 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 12:49:58,078 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-04-27 12:49:58,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-27 12:49:58,079 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:49:58,079 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:49:58,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 12:49:58,080 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:49:58,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:49:58,080 INFO L85 PathProgramCache]: Analyzing trace with hash 1348211113, now seen corresponding path program 1 times [2022-04-27 12:49:58,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:49:58,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417935841] [2022-04-27 12:49:58,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:49:58,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:49:58,097 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:49:58,098 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1862381402] [2022-04-27 12:49:58,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:49:58,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:49:58,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:49:58,100 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 12:49:58,106 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-27 12:49:58,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:49:58,159 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-27 12:49:58,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:49:58,173 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:50:01,433 INFO L272 TraceCheckUtils]: 0: Hoare triple {452#true} call ULTIMATE.init(); {452#true} is VALID [2022-04-27 12:50:01,433 INFO L290 TraceCheckUtils]: 1: Hoare triple {452#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {452#true} is VALID [2022-04-27 12:50:01,433 INFO L290 TraceCheckUtils]: 2: Hoare triple {452#true} assume true; {452#true} is VALID [2022-04-27 12:50:01,433 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {452#true} {452#true} #82#return; {452#true} is VALID [2022-04-27 12:50:01,434 INFO L272 TraceCheckUtils]: 4: Hoare triple {452#true} call #t~ret7 := main(); {452#true} is VALID [2022-04-27 12:50:01,434 INFO L290 TraceCheckUtils]: 5: Hoare triple {452#true} havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~x~0;havoc ~y~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {452#true} is VALID [2022-04-27 12:50:01,434 INFO L272 TraceCheckUtils]: 6: Hoare triple {452#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {452#true} is VALID [2022-04-27 12:50:01,434 INFO L290 TraceCheckUtils]: 7: Hoare triple {452#true} ~cond := #in~cond; {452#true} is VALID [2022-04-27 12:50:01,434 INFO L290 TraceCheckUtils]: 8: Hoare triple {452#true} assume !(0 == ~cond); {452#true} is VALID [2022-04-27 12:50:01,435 INFO L290 TraceCheckUtils]: 9: Hoare triple {452#true} assume true; {452#true} is VALID [2022-04-27 12:50:01,435 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {452#true} {452#true} #64#return; {452#true} is VALID [2022-04-27 12:50:01,435 INFO L272 TraceCheckUtils]: 11: Hoare triple {452#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {452#true} is VALID [2022-04-27 12:50:01,435 INFO L290 TraceCheckUtils]: 12: Hoare triple {452#true} ~cond := #in~cond; {452#true} is VALID [2022-04-27 12:50:01,435 INFO L290 TraceCheckUtils]: 13: Hoare triple {452#true} assume !(0 == ~cond); {452#true} is VALID [2022-04-27 12:50:01,436 INFO L290 TraceCheckUtils]: 14: Hoare triple {452#true} assume true; {452#true} is VALID [2022-04-27 12:50:01,436 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {452#true} {452#true} #66#return; {452#true} is VALID [2022-04-27 12:50:01,436 INFO L290 TraceCheckUtils]: 16: Hoare triple {452#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {505#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~p~0 1))} is VALID [2022-04-27 12:50:01,437 INFO L290 TraceCheckUtils]: 17: Hoare triple {505#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~p~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {505#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~p~0 1))} is VALID [2022-04-27 12:50:01,438 INFO L290 TraceCheckUtils]: 18: Hoare triple {505#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~p~0 1))} assume !!(#t~post6 < 50);havoc #t~post6; {505#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~p~0 1))} is VALID [2022-04-27 12:50:01,439 INFO L272 TraceCheckUtils]: 19: Hoare triple {505#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~p~0 1))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {515#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:50:01,440 INFO L290 TraceCheckUtils]: 20: Hoare triple {515#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {519#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:50:01,440 INFO L290 TraceCheckUtils]: 21: Hoare triple {519#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {453#false} is VALID [2022-04-27 12:50:01,440 INFO L290 TraceCheckUtils]: 22: Hoare triple {453#false} assume !false; {453#false} is VALID [2022-04-27 12:50:01,440 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 12:50:01,441 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 12:50:01,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:50:01,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417935841] [2022-04-27 12:50:01,441 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:50:01,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1862381402] [2022-04-27 12:50:01,442 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1862381402] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 12:50:01,442 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 12:50:01,442 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 12:50:01,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051806752] [2022-04-27 12:50:01,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:50:01,443 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 23 [2022-04-27 12:50:01,443 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:50:01,443 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 12:50:01,460 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:50:01,460 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 12:50:01,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:50:01,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 12:50:01,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 12:50:01,461 INFO L87 Difference]: Start difference. First operand 32 states and 41 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 12:50:01,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:50:01,658 INFO L93 Difference]: Finished difference Result 49 states and 66 transitions. [2022-04-27 12:50:01,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 12:50:01,658 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 23 [2022-04-27 12:50:01,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:50:01,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 12:50:01,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-04-27 12:50:01,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 12:50:01,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-04-27 12:50:01,672 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 64 transitions. [2022-04-27 12:50:01,733 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:50:01,737 INFO L225 Difference]: With dead ends: 49 [2022-04-27 12:50:01,738 INFO L226 Difference]: Without dead ends: 47 [2022-04-27 12:50:01,739 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 12:50:01,741 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 8 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 12:50:01,742 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 134 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 12:50:01,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-04-27 12:50:01,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2022-04-27 12:50:01,755 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:50:01,757 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand has 46 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 26 states have internal predecessors, (31), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-27 12:50:01,757 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand has 46 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 26 states have internal predecessors, (31), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-27 12:50:01,758 INFO L87 Difference]: Start difference. First operand 47 states. Second operand has 46 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 26 states have internal predecessors, (31), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-27 12:50:01,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:50:01,763 INFO L93 Difference]: Finished difference Result 47 states and 64 transitions. [2022-04-27 12:50:01,763 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 64 transitions. [2022-04-27 12:50:01,765 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:50:01,765 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:50:01,765 INFO L74 IsIncluded]: Start isIncluded. First operand has 46 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 26 states have internal predecessors, (31), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) Second operand 47 states. [2022-04-27 12:50:01,767 INFO L87 Difference]: Start difference. First operand has 46 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 26 states have internal predecessors, (31), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) Second operand 47 states. [2022-04-27 12:50:01,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:50:01,769 INFO L93 Difference]: Finished difference Result 47 states and 64 transitions. [2022-04-27 12:50:01,769 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 64 transitions. [2022-04-27 12:50:01,770 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:50:01,770 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:50:01,770 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:50:01,770 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:50:01,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 26 states have internal predecessors, (31), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-27 12:50:01,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 63 transitions. [2022-04-27 12:50:01,773 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 63 transitions. Word has length 23 [2022-04-27 12:50:01,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:50:01,773 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 63 transitions. [2022-04-27 12:50:01,774 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 12:50:01,774 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 63 transitions. [2022-04-27 12:50:01,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-27 12:50:01,774 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:50:01,774 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:50:01,798 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-27 12:50:01,997 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:50:01,998 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:50:01,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:50:01,998 INFO L85 PathProgramCache]: Analyzing trace with hash -1060153012, now seen corresponding path program 1 times [2022-04-27 12:50:01,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:50:01,999 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435465858] [2022-04-27 12:50:01,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:50:01,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:50:02,018 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:50:02,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1487968834] [2022-04-27 12:50:02,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:50:02,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:50:02,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:50:02,023 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 12:50:02,056 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-27 12:50:02,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:50:02,082 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-27 12:50:02,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:50:02,092 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:50:03,063 INFO L272 TraceCheckUtils]: 0: Hoare triple {767#true} call ULTIMATE.init(); {767#true} is VALID [2022-04-27 12:50:03,063 INFO L290 TraceCheckUtils]: 1: Hoare triple {767#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {767#true} is VALID [2022-04-27 12:50:03,063 INFO L290 TraceCheckUtils]: 2: Hoare triple {767#true} assume true; {767#true} is VALID [2022-04-27 12:50:03,063 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {767#true} {767#true} #82#return; {767#true} is VALID [2022-04-27 12:50:03,064 INFO L272 TraceCheckUtils]: 4: Hoare triple {767#true} call #t~ret7 := main(); {767#true} is VALID [2022-04-27 12:50:03,064 INFO L290 TraceCheckUtils]: 5: Hoare triple {767#true} havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~x~0;havoc ~y~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {767#true} is VALID [2022-04-27 12:50:03,064 INFO L272 TraceCheckUtils]: 6: Hoare triple {767#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {767#true} is VALID [2022-04-27 12:50:03,067 INFO L290 TraceCheckUtils]: 7: Hoare triple {767#true} ~cond := #in~cond; {793#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 12:50:03,068 INFO L290 TraceCheckUtils]: 8: Hoare triple {793#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {797#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 12:50:03,068 INFO L290 TraceCheckUtils]: 9: Hoare triple {797#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {797#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 12:50:03,070 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {797#(not (= |assume_abort_if_not_#in~cond| 0))} {767#true} #64#return; {804#(<= 1 main_~x~0)} is VALID [2022-04-27 12:50:03,070 INFO L272 TraceCheckUtils]: 11: Hoare triple {804#(<= 1 main_~x~0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {767#true} is VALID [2022-04-27 12:50:03,070 INFO L290 TraceCheckUtils]: 12: Hoare triple {767#true} ~cond := #in~cond; {767#true} is VALID [2022-04-27 12:50:03,071 INFO L290 TraceCheckUtils]: 13: Hoare triple {767#true} assume !(0 == ~cond); {767#true} is VALID [2022-04-27 12:50:03,071 INFO L290 TraceCheckUtils]: 14: Hoare triple {767#true} assume true; {767#true} is VALID [2022-04-27 12:50:03,073 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {767#true} {804#(<= 1 main_~x~0)} #66#return; {804#(<= 1 main_~x~0)} is VALID [2022-04-27 12:50:03,073 INFO L290 TraceCheckUtils]: 16: Hoare triple {804#(<= 1 main_~x~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {823#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 12:50:03,074 INFO L290 TraceCheckUtils]: 17: Hoare triple {823#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {823#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 12:50:03,074 INFO L290 TraceCheckUtils]: 18: Hoare triple {823#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(#t~post6 < 50);havoc #t~post6; {823#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 12:50:03,074 INFO L272 TraceCheckUtils]: 19: Hoare triple {823#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {767#true} is VALID [2022-04-27 12:50:03,075 INFO L290 TraceCheckUtils]: 20: Hoare triple {767#true} ~cond := #in~cond; {767#true} is VALID [2022-04-27 12:50:03,075 INFO L290 TraceCheckUtils]: 21: Hoare triple {767#true} assume !(0 == ~cond); {767#true} is VALID [2022-04-27 12:50:03,075 INFO L290 TraceCheckUtils]: 22: Hoare triple {767#true} assume true; {767#true} is VALID [2022-04-27 12:50:03,076 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {767#true} {823#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #68#return; {823#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 12:50:03,077 INFO L272 TraceCheckUtils]: 24: Hoare triple {823#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {848#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:50:03,078 INFO L290 TraceCheckUtils]: 25: Hoare triple {848#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {852#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:50:03,079 INFO L290 TraceCheckUtils]: 26: Hoare triple {852#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {768#false} is VALID [2022-04-27 12:50:03,079 INFO L290 TraceCheckUtils]: 27: Hoare triple {768#false} assume !false; {768#false} is VALID [2022-04-27 12:50:03,079 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-27 12:50:03,080 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:50:37,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:50:37,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435465858] [2022-04-27 12:50:37,874 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:50:37,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1487968834] [2022-04-27 12:50:37,874 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1487968834] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 12:50:37,874 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 12:50:37,875 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2022-04-27 12:50:37,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576312726] [2022-04-27 12:50:37,875 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 12:50:37,876 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 28 [2022-04-27 12:50:37,876 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:50:37,876 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.25) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 12:50:37,900 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:50:37,901 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 12:50:37,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:50:37,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 12:50:37,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-04-27 12:50:37,902 INFO L87 Difference]: Start difference. First operand 46 states and 63 transitions. Second operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 12:50:38,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:50:38,380 INFO L93 Difference]: Finished difference Result 53 states and 69 transitions. [2022-04-27 12:50:38,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 12:50:38,380 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 28 [2022-04-27 12:50:38,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:50:38,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 12:50:38,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 64 transitions. [2022-04-27 12:50:38,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 12:50:38,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 64 transitions. [2022-04-27 12:50:38,385 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 64 transitions. [2022-04-27 12:50:38,445 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:50:38,446 INFO L225 Difference]: With dead ends: 53 [2022-04-27 12:50:38,446 INFO L226 Difference]: Without dead ends: 51 [2022-04-27 12:50:38,447 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-04-27 12:50:38,447 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 21 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 12:50:38,448 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 185 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 12:50:38,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-04-27 12:50:38,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2022-04-27 12:50:38,465 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:50:38,466 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand has 50 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 29 states have internal predecessors, (34), 17 states have call successors, (17), 6 states have call predecessors, (17), 5 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-27 12:50:38,466 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand has 50 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 29 states have internal predecessors, (34), 17 states have call successors, (17), 6 states have call predecessors, (17), 5 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-27 12:50:38,466 INFO L87 Difference]: Start difference. First operand 51 states. Second operand has 50 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 29 states have internal predecessors, (34), 17 states have call successors, (17), 6 states have call predecessors, (17), 5 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-27 12:50:38,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:50:38,469 INFO L93 Difference]: Finished difference Result 51 states and 67 transitions. [2022-04-27 12:50:38,469 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 67 transitions. [2022-04-27 12:50:38,469 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:50:38,469 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:50:38,469 INFO L74 IsIncluded]: Start isIncluded. First operand has 50 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 29 states have internal predecessors, (34), 17 states have call successors, (17), 6 states have call predecessors, (17), 5 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) Second operand 51 states. [2022-04-27 12:50:38,470 INFO L87 Difference]: Start difference. First operand has 50 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 29 states have internal predecessors, (34), 17 states have call successors, (17), 6 states have call predecessors, (17), 5 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) Second operand 51 states. [2022-04-27 12:50:38,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:50:38,472 INFO L93 Difference]: Finished difference Result 51 states and 67 transitions. [2022-04-27 12:50:38,472 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 67 transitions. [2022-04-27 12:50:38,472 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:50:38,473 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:50:38,473 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:50:38,473 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:50:38,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 29 states have internal predecessors, (34), 17 states have call successors, (17), 6 states have call predecessors, (17), 5 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-27 12:50:38,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 66 transitions. [2022-04-27 12:50:38,475 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 66 transitions. Word has length 28 [2022-04-27 12:50:38,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:50:38,475 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 66 transitions. [2022-04-27 12:50:38,476 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 12:50:38,476 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 66 transitions. [2022-04-27 12:50:38,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-27 12:50:38,476 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:50:38,476 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:50:38,500 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-27 12:50:38,691 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-04-27 12:50:38,692 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:50:38,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:50:38,692 INFO L85 PathProgramCache]: Analyzing trace with hash -560761015, now seen corresponding path program 1 times [2022-04-27 12:50:38,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:50:38,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213502433] [2022-04-27 12:50:38,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:50:38,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:50:38,713 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:50:38,714 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1019066661] [2022-04-27 12:50:38,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:50:38,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:50:38,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:50:38,718 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 12:50:38,721 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-27 12:50:38,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:50:38,763 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-27 12:50:38,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:50:38,784 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:50:39,018 INFO L272 TraceCheckUtils]: 0: Hoare triple {1136#true} call ULTIMATE.init(); {1136#true} is VALID [2022-04-27 12:50:39,019 INFO L290 TraceCheckUtils]: 1: Hoare triple {1136#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1136#true} is VALID [2022-04-27 12:50:39,019 INFO L290 TraceCheckUtils]: 2: Hoare triple {1136#true} assume true; {1136#true} is VALID [2022-04-27 12:50:39,019 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1136#true} {1136#true} #82#return; {1136#true} is VALID [2022-04-27 12:50:39,019 INFO L272 TraceCheckUtils]: 4: Hoare triple {1136#true} call #t~ret7 := main(); {1136#true} is VALID [2022-04-27 12:50:39,019 INFO L290 TraceCheckUtils]: 5: Hoare triple {1136#true} havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~x~0;havoc ~y~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {1136#true} is VALID [2022-04-27 12:50:39,019 INFO L272 TraceCheckUtils]: 6: Hoare triple {1136#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {1136#true} is VALID [2022-04-27 12:50:39,024 INFO L290 TraceCheckUtils]: 7: Hoare triple {1136#true} ~cond := #in~cond; {1162#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 12:50:39,025 INFO L290 TraceCheckUtils]: 8: Hoare triple {1162#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {1166#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 12:50:39,025 INFO L290 TraceCheckUtils]: 9: Hoare triple {1166#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {1166#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 12:50:39,026 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1166#(not (= |assume_abort_if_not_#in~cond| 0))} {1136#true} #64#return; {1173#(<= 1 main_~x~0)} is VALID [2022-04-27 12:50:39,026 INFO L272 TraceCheckUtils]: 11: Hoare triple {1173#(<= 1 main_~x~0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1136#true} is VALID [2022-04-27 12:50:39,026 INFO L290 TraceCheckUtils]: 12: Hoare triple {1136#true} ~cond := #in~cond; {1136#true} is VALID [2022-04-27 12:50:39,026 INFO L290 TraceCheckUtils]: 13: Hoare triple {1136#true} assume !(0 == ~cond); {1136#true} is VALID [2022-04-27 12:50:39,026 INFO L290 TraceCheckUtils]: 14: Hoare triple {1136#true} assume true; {1136#true} is VALID [2022-04-27 12:50:39,027 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1136#true} {1173#(<= 1 main_~x~0)} #66#return; {1173#(<= 1 main_~x~0)} is VALID [2022-04-27 12:50:39,027 INFO L290 TraceCheckUtils]: 16: Hoare triple {1173#(<= 1 main_~x~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {1192#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-27 12:50:39,028 INFO L290 TraceCheckUtils]: 17: Hoare triple {1192#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1192#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-27 12:50:39,028 INFO L290 TraceCheckUtils]: 18: Hoare triple {1192#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} assume !!(#t~post6 < 50);havoc #t~post6; {1192#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-27 12:50:39,028 INFO L272 TraceCheckUtils]: 19: Hoare triple {1192#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {1136#true} is VALID [2022-04-27 12:50:39,028 INFO L290 TraceCheckUtils]: 20: Hoare triple {1136#true} ~cond := #in~cond; {1136#true} is VALID [2022-04-27 12:50:39,028 INFO L290 TraceCheckUtils]: 21: Hoare triple {1136#true} assume !(0 == ~cond); {1136#true} is VALID [2022-04-27 12:50:39,029 INFO L290 TraceCheckUtils]: 22: Hoare triple {1136#true} assume true; {1136#true} is VALID [2022-04-27 12:50:39,029 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1136#true} {1192#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #68#return; {1192#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-27 12:50:39,029 INFO L272 TraceCheckUtils]: 24: Hoare triple {1192#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {1136#true} is VALID [2022-04-27 12:50:39,030 INFO L290 TraceCheckUtils]: 25: Hoare triple {1136#true} ~cond := #in~cond; {1136#true} is VALID [2022-04-27 12:50:39,030 INFO L290 TraceCheckUtils]: 26: Hoare triple {1136#true} assume !(0 == ~cond); {1136#true} is VALID [2022-04-27 12:50:39,030 INFO L290 TraceCheckUtils]: 27: Hoare triple {1136#true} assume true; {1136#true} is VALID [2022-04-27 12:50:39,030 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1136#true} {1192#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #70#return; {1192#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-27 12:50:39,031 INFO L272 TraceCheckUtils]: 29: Hoare triple {1192#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {1232#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:50:39,032 INFO L290 TraceCheckUtils]: 30: Hoare triple {1232#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1236#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:50:39,032 INFO L290 TraceCheckUtils]: 31: Hoare triple {1236#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1137#false} is VALID [2022-04-27 12:50:39,032 INFO L290 TraceCheckUtils]: 32: Hoare triple {1137#false} assume !false; {1137#false} is VALID [2022-04-27 12:50:39,032 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-04-27 12:50:39,032 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:50:39,270 INFO L290 TraceCheckUtils]: 32: Hoare triple {1137#false} assume !false; {1137#false} is VALID [2022-04-27 12:50:39,271 INFO L290 TraceCheckUtils]: 31: Hoare triple {1236#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1137#false} is VALID [2022-04-27 12:50:39,271 INFO L290 TraceCheckUtils]: 30: Hoare triple {1232#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1236#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:50:39,273 INFO L272 TraceCheckUtils]: 29: Hoare triple {1252#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {1232#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:50:39,273 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1136#true} {1252#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #70#return; {1252#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 12:50:39,274 INFO L290 TraceCheckUtils]: 27: Hoare triple {1136#true} assume true; {1136#true} is VALID [2022-04-27 12:50:39,274 INFO L290 TraceCheckUtils]: 26: Hoare triple {1136#true} assume !(0 == ~cond); {1136#true} is VALID [2022-04-27 12:50:39,274 INFO L290 TraceCheckUtils]: 25: Hoare triple {1136#true} ~cond := #in~cond; {1136#true} is VALID [2022-04-27 12:50:39,274 INFO L272 TraceCheckUtils]: 24: Hoare triple {1252#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {1136#true} is VALID [2022-04-27 12:50:39,275 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1136#true} {1252#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #68#return; {1252#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 12:50:39,275 INFO L290 TraceCheckUtils]: 22: Hoare triple {1136#true} assume true; {1136#true} is VALID [2022-04-27 12:50:39,275 INFO L290 TraceCheckUtils]: 21: Hoare triple {1136#true} assume !(0 == ~cond); {1136#true} is VALID [2022-04-27 12:50:39,275 INFO L290 TraceCheckUtils]: 20: Hoare triple {1136#true} ~cond := #in~cond; {1136#true} is VALID [2022-04-27 12:50:39,275 INFO L272 TraceCheckUtils]: 19: Hoare triple {1252#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {1136#true} is VALID [2022-04-27 12:50:39,276 INFO L290 TraceCheckUtils]: 18: Hoare triple {1252#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !!(#t~post6 < 50);havoc #t~post6; {1252#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 12:50:39,277 INFO L290 TraceCheckUtils]: 17: Hoare triple {1252#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1252#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 12:50:39,277 INFO L290 TraceCheckUtils]: 16: Hoare triple {1136#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {1252#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 12:50:39,277 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1136#true} {1136#true} #66#return; {1136#true} is VALID [2022-04-27 12:50:39,277 INFO L290 TraceCheckUtils]: 14: Hoare triple {1136#true} assume true; {1136#true} is VALID [2022-04-27 12:50:39,277 INFO L290 TraceCheckUtils]: 13: Hoare triple {1136#true} assume !(0 == ~cond); {1136#true} is VALID [2022-04-27 12:50:39,278 INFO L290 TraceCheckUtils]: 12: Hoare triple {1136#true} ~cond := #in~cond; {1136#true} is VALID [2022-04-27 12:50:39,278 INFO L272 TraceCheckUtils]: 11: Hoare triple {1136#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1136#true} is VALID [2022-04-27 12:50:39,278 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1136#true} {1136#true} #64#return; {1136#true} is VALID [2022-04-27 12:50:39,278 INFO L290 TraceCheckUtils]: 9: Hoare triple {1136#true} assume true; {1136#true} is VALID [2022-04-27 12:50:39,278 INFO L290 TraceCheckUtils]: 8: Hoare triple {1136#true} assume !(0 == ~cond); {1136#true} is VALID [2022-04-27 12:50:39,278 INFO L290 TraceCheckUtils]: 7: Hoare triple {1136#true} ~cond := #in~cond; {1136#true} is VALID [2022-04-27 12:50:39,278 INFO L272 TraceCheckUtils]: 6: Hoare triple {1136#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {1136#true} is VALID [2022-04-27 12:50:39,278 INFO L290 TraceCheckUtils]: 5: Hoare triple {1136#true} havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~x~0;havoc ~y~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {1136#true} is VALID [2022-04-27 12:50:39,279 INFO L272 TraceCheckUtils]: 4: Hoare triple {1136#true} call #t~ret7 := main(); {1136#true} is VALID [2022-04-27 12:50:39,279 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1136#true} {1136#true} #82#return; {1136#true} is VALID [2022-04-27 12:50:39,279 INFO L290 TraceCheckUtils]: 2: Hoare triple {1136#true} assume true; {1136#true} is VALID [2022-04-27 12:50:39,279 INFO L290 TraceCheckUtils]: 1: Hoare triple {1136#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1136#true} is VALID [2022-04-27 12:50:39,279 INFO L272 TraceCheckUtils]: 0: Hoare triple {1136#true} call ULTIMATE.init(); {1136#true} is VALID [2022-04-27 12:50:39,279 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-04-27 12:50:39,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:50:39,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213502433] [2022-04-27 12:50:39,280 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:50:39,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1019066661] [2022-04-27 12:50:39,280 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1019066661] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-27 12:50:39,280 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-27 12:50:39,280 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 9 [2022-04-27 12:50:39,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252181756] [2022-04-27 12:50:39,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:50:39,281 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 33 [2022-04-27 12:50:39,281 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:50:39,281 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 12:50:39,304 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:50:39,304 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 12:50:39,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:50:39,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 12:50:39,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-04-27 12:50:39,305 INFO L87 Difference]: Start difference. First operand 50 states and 66 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 12:50:39,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:50:39,629 INFO L93 Difference]: Finished difference Result 75 states and 107 transitions. [2022-04-27 12:50:39,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 12:50:39,630 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 33 [2022-04-27 12:50:39,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:50:39,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 12:50:39,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-04-27 12:50:39,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 12:50:39,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-04-27 12:50:39,633 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 64 transitions. [2022-04-27 12:50:39,688 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:50:39,690 INFO L225 Difference]: With dead ends: 75 [2022-04-27 12:50:39,690 INFO L226 Difference]: Without dead ends: 71 [2022-04-27 12:50:39,691 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-04-27 12:50:39,691 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 9 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 12:50:39,692 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 128 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 12:50:39,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-04-27 12:50:39,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2022-04-27 12:50:39,717 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:50:39,718 INFO L82 GeneralOperation]: Start isEquivalent. First operand 71 states. Second operand has 71 states, 36 states have (on average 1.3333333333333333) internal successors, (48), 40 states have internal predecessors, (48), 28 states have call successors, (28), 7 states have call predecessors, (28), 6 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-27 12:50:39,718 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand has 71 states, 36 states have (on average 1.3333333333333333) internal successors, (48), 40 states have internal predecessors, (48), 28 states have call successors, (28), 7 states have call predecessors, (28), 6 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-27 12:50:39,718 INFO L87 Difference]: Start difference. First operand 71 states. Second operand has 71 states, 36 states have (on average 1.3333333333333333) internal successors, (48), 40 states have internal predecessors, (48), 28 states have call successors, (28), 7 states have call predecessors, (28), 6 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-27 12:50:39,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:50:39,721 INFO L93 Difference]: Finished difference Result 71 states and 100 transitions. [2022-04-27 12:50:39,722 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 100 transitions. [2022-04-27 12:50:39,722 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:50:39,722 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:50:39,723 INFO L74 IsIncluded]: Start isIncluded. First operand has 71 states, 36 states have (on average 1.3333333333333333) internal successors, (48), 40 states have internal predecessors, (48), 28 states have call successors, (28), 7 states have call predecessors, (28), 6 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) Second operand 71 states. [2022-04-27 12:50:39,723 INFO L87 Difference]: Start difference. First operand has 71 states, 36 states have (on average 1.3333333333333333) internal successors, (48), 40 states have internal predecessors, (48), 28 states have call successors, (28), 7 states have call predecessors, (28), 6 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) Second operand 71 states. [2022-04-27 12:50:39,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:50:39,726 INFO L93 Difference]: Finished difference Result 71 states and 100 transitions. [2022-04-27 12:50:39,726 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 100 transitions. [2022-04-27 12:50:39,727 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:50:39,727 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:50:39,727 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:50:39,727 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:50:39,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 36 states have (on average 1.3333333333333333) internal successors, (48), 40 states have internal predecessors, (48), 28 states have call successors, (28), 7 states have call predecessors, (28), 6 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-27 12:50:39,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 100 transitions. [2022-04-27 12:50:39,730 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 100 transitions. Word has length 33 [2022-04-27 12:50:39,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:50:39,730 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 100 transitions. [2022-04-27 12:50:39,730 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 12:50:39,731 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 100 transitions. [2022-04-27 12:50:39,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-27 12:50:39,731 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:50:39,731 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:50:39,751 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-27 12:50:39,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:50:39,944 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:50:39,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:50:39,944 INFO L85 PathProgramCache]: Analyzing trace with hash 201438379, now seen corresponding path program 1 times [2022-04-27 12:50:39,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:50:39,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645477970] [2022-04-27 12:50:39,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:50:39,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:50:39,958 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:50:39,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1915298900] [2022-04-27 12:50:39,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:50:39,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:50:39,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:50:39,960 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 12:50:39,963 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-27 12:50:40,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:50:40,011 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-27 12:50:40,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:50:40,023 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:50:40,140 INFO L272 TraceCheckUtils]: 0: Hoare triple {1712#true} call ULTIMATE.init(); {1712#true} is VALID [2022-04-27 12:50:40,140 INFO L290 TraceCheckUtils]: 1: Hoare triple {1712#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1712#true} is VALID [2022-04-27 12:50:40,140 INFO L290 TraceCheckUtils]: 2: Hoare triple {1712#true} assume true; {1712#true} is VALID [2022-04-27 12:50:40,140 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1712#true} {1712#true} #82#return; {1712#true} is VALID [2022-04-27 12:50:40,140 INFO L272 TraceCheckUtils]: 4: Hoare triple {1712#true} call #t~ret7 := main(); {1712#true} is VALID [2022-04-27 12:50:40,140 INFO L290 TraceCheckUtils]: 5: Hoare triple {1712#true} havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~x~0;havoc ~y~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {1712#true} is VALID [2022-04-27 12:50:40,140 INFO L272 TraceCheckUtils]: 6: Hoare triple {1712#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {1712#true} is VALID [2022-04-27 12:50:40,140 INFO L290 TraceCheckUtils]: 7: Hoare triple {1712#true} ~cond := #in~cond; {1712#true} is VALID [2022-04-27 12:50:40,141 INFO L290 TraceCheckUtils]: 8: Hoare triple {1712#true} assume !(0 == ~cond); {1712#true} is VALID [2022-04-27 12:50:40,141 INFO L290 TraceCheckUtils]: 9: Hoare triple {1712#true} assume true; {1712#true} is VALID [2022-04-27 12:50:40,141 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1712#true} {1712#true} #64#return; {1712#true} is VALID [2022-04-27 12:50:40,141 INFO L272 TraceCheckUtils]: 11: Hoare triple {1712#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1712#true} is VALID [2022-04-27 12:50:40,141 INFO L290 TraceCheckUtils]: 12: Hoare triple {1712#true} ~cond := #in~cond; {1712#true} is VALID [2022-04-27 12:50:40,141 INFO L290 TraceCheckUtils]: 13: Hoare triple {1712#true} assume !(0 == ~cond); {1712#true} is VALID [2022-04-27 12:50:40,141 INFO L290 TraceCheckUtils]: 14: Hoare triple {1712#true} assume true; {1712#true} is VALID [2022-04-27 12:50:40,141 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1712#true} {1712#true} #66#return; {1712#true} is VALID [2022-04-27 12:50:40,141 INFO L290 TraceCheckUtils]: 16: Hoare triple {1712#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {1712#true} is VALID [2022-04-27 12:50:40,141 INFO L290 TraceCheckUtils]: 17: Hoare triple {1712#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1712#true} is VALID [2022-04-27 12:50:40,141 INFO L290 TraceCheckUtils]: 18: Hoare triple {1712#true} assume !!(#t~post6 < 50);havoc #t~post6; {1712#true} is VALID [2022-04-27 12:50:40,141 INFO L272 TraceCheckUtils]: 19: Hoare triple {1712#true} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {1712#true} is VALID [2022-04-27 12:50:40,142 INFO L290 TraceCheckUtils]: 20: Hoare triple {1712#true} ~cond := #in~cond; {1712#true} is VALID [2022-04-27 12:50:40,142 INFO L290 TraceCheckUtils]: 21: Hoare triple {1712#true} assume !(0 == ~cond); {1712#true} is VALID [2022-04-27 12:50:40,142 INFO L290 TraceCheckUtils]: 22: Hoare triple {1712#true} assume true; {1712#true} is VALID [2022-04-27 12:50:40,142 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1712#true} {1712#true} #68#return; {1712#true} is VALID [2022-04-27 12:50:40,142 INFO L272 TraceCheckUtils]: 24: Hoare triple {1712#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {1712#true} is VALID [2022-04-27 12:50:40,142 INFO L290 TraceCheckUtils]: 25: Hoare triple {1712#true} ~cond := #in~cond; {1712#true} is VALID [2022-04-27 12:50:40,142 INFO L290 TraceCheckUtils]: 26: Hoare triple {1712#true} assume !(0 == ~cond); {1712#true} is VALID [2022-04-27 12:50:40,142 INFO L290 TraceCheckUtils]: 27: Hoare triple {1712#true} assume true; {1712#true} is VALID [2022-04-27 12:50:40,142 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1712#true} {1712#true} #70#return; {1712#true} is VALID [2022-04-27 12:50:40,142 INFO L272 TraceCheckUtils]: 29: Hoare triple {1712#true} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {1712#true} is VALID [2022-04-27 12:50:40,142 INFO L290 TraceCheckUtils]: 30: Hoare triple {1712#true} ~cond := #in~cond; {1712#true} is VALID [2022-04-27 12:50:40,142 INFO L290 TraceCheckUtils]: 31: Hoare triple {1712#true} assume !(0 == ~cond); {1712#true} is VALID [2022-04-27 12:50:40,143 INFO L290 TraceCheckUtils]: 32: Hoare triple {1712#true} assume true; {1712#true} is VALID [2022-04-27 12:50:40,143 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {1712#true} {1712#true} #72#return; {1712#true} is VALID [2022-04-27 12:50:40,147 INFO L290 TraceCheckUtils]: 34: Hoare triple {1712#true} assume !(~a~0 != ~b~0); {1819#(= main_~b~0 main_~a~0)} is VALID [2022-04-27 12:50:40,148 INFO L272 TraceCheckUtils]: 35: Hoare triple {1819#(= main_~b~0 main_~a~0)} call __VERIFIER_assert((if 0 == ~a~0 - ~b~0 then 1 else 0)); {1823#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:50:40,149 INFO L290 TraceCheckUtils]: 36: Hoare triple {1823#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1827#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:50:40,149 INFO L290 TraceCheckUtils]: 37: Hoare triple {1827#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1713#false} is VALID [2022-04-27 12:50:40,149 INFO L290 TraceCheckUtils]: 38: Hoare triple {1713#false} assume !false; {1713#false} is VALID [2022-04-27 12:50:40,150 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-27 12:50:40,150 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 12:50:40,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:50:40,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645477970] [2022-04-27 12:50:40,150 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:50:40,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1915298900] [2022-04-27 12:50:40,150 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1915298900] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 12:50:40,150 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 12:50:40,150 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 12:50:40,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6630501] [2022-04-27 12:50:40,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:50:40,152 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 39 [2022-04-27 12:50:40,152 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:50:40,152 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-04-27 12:50:40,176 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:50:40,176 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 12:50:40,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:50:40,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 12:50:40,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 12:50:40,177 INFO L87 Difference]: Start difference. First operand 71 states and 100 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-04-27 12:50:40,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:50:40,377 INFO L93 Difference]: Finished difference Result 87 states and 123 transitions. [2022-04-27 12:50:40,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 12:50:40,377 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 39 [2022-04-27 12:50:40,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:50:40,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-04-27 12:50:40,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 51 transitions. [2022-04-27 12:50:40,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-04-27 12:50:40,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 51 transitions. [2022-04-27 12:50:40,380 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 51 transitions. [2022-04-27 12:50:40,426 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:50:40,430 INFO L225 Difference]: With dead ends: 87 [2022-04-27 12:50:40,430 INFO L226 Difference]: Without dead ends: 85 [2022-04-27 12:50:40,431 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 12:50:40,432 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 5 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 12:50:40,432 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 144 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 12:50:40,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-04-27 12:50:40,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 78. [2022-04-27 12:50:40,480 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:50:40,480 INFO L82 GeneralOperation]: Start isEquivalent. First operand 85 states. Second operand has 78 states, 39 states have (on average 1.3076923076923077) internal successors, (51), 46 states have internal predecessors, (51), 31 states have call successors, (31), 8 states have call predecessors, (31), 7 states have return successors, (27), 23 states have call predecessors, (27), 27 states have call successors, (27) [2022-04-27 12:50:40,480 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand has 78 states, 39 states have (on average 1.3076923076923077) internal successors, (51), 46 states have internal predecessors, (51), 31 states have call successors, (31), 8 states have call predecessors, (31), 7 states have return successors, (27), 23 states have call predecessors, (27), 27 states have call successors, (27) [2022-04-27 12:50:40,480 INFO L87 Difference]: Start difference. First operand 85 states. Second operand has 78 states, 39 states have (on average 1.3076923076923077) internal successors, (51), 46 states have internal predecessors, (51), 31 states have call successors, (31), 8 states have call predecessors, (31), 7 states have return successors, (27), 23 states have call predecessors, (27), 27 states have call successors, (27) [2022-04-27 12:50:40,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:50:40,486 INFO L93 Difference]: Finished difference Result 85 states and 121 transitions. [2022-04-27 12:50:40,486 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 121 transitions. [2022-04-27 12:50:40,488 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:50:40,488 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:50:40,488 INFO L74 IsIncluded]: Start isIncluded. First operand has 78 states, 39 states have (on average 1.3076923076923077) internal successors, (51), 46 states have internal predecessors, (51), 31 states have call successors, (31), 8 states have call predecessors, (31), 7 states have return successors, (27), 23 states have call predecessors, (27), 27 states have call successors, (27) Second operand 85 states. [2022-04-27 12:50:40,488 INFO L87 Difference]: Start difference. First operand has 78 states, 39 states have (on average 1.3076923076923077) internal successors, (51), 46 states have internal predecessors, (51), 31 states have call successors, (31), 8 states have call predecessors, (31), 7 states have return successors, (27), 23 states have call predecessors, (27), 27 states have call successors, (27) Second operand 85 states. [2022-04-27 12:50:40,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:50:40,493 INFO L93 Difference]: Finished difference Result 85 states and 121 transitions. [2022-04-27 12:50:40,493 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 121 transitions. [2022-04-27 12:50:40,493 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:50:40,493 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:50:40,493 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:50:40,493 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:50:40,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 39 states have (on average 1.3076923076923077) internal successors, (51), 46 states have internal predecessors, (51), 31 states have call successors, (31), 8 states have call predecessors, (31), 7 states have return successors, (27), 23 states have call predecessors, (27), 27 states have call successors, (27) [2022-04-27 12:50:40,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 109 transitions. [2022-04-27 12:50:40,497 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 109 transitions. Word has length 39 [2022-04-27 12:50:40,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:50:40,499 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 109 transitions. [2022-04-27 12:50:40,499 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-04-27 12:50:40,499 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 109 transitions. [2022-04-27 12:50:40,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-27 12:50:40,501 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:50:40,501 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:50:40,527 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-27 12:50:40,723 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:50:40,723 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:50:40,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:50:40,724 INFO L85 PathProgramCache]: Analyzing trace with hash -1085077998, now seen corresponding path program 1 times [2022-04-27 12:50:40,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:50:40,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731320404] [2022-04-27 12:50:40,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:50:40,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:50:40,743 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:50:40,743 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [699489505] [2022-04-27 12:50:40,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:50:40,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:50:40,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:50:40,745 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 12:50:40,755 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-27 12:50:40,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:50:40,803 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 12:50:40,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:50:40,818 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:50:41,027 INFO L272 TraceCheckUtils]: 0: Hoare triple {2263#true} call ULTIMATE.init(); {2263#true} is VALID [2022-04-27 12:50:41,028 INFO L290 TraceCheckUtils]: 1: Hoare triple {2263#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2271#(<= ~counter~0 0)} is VALID [2022-04-27 12:50:41,029 INFO L290 TraceCheckUtils]: 2: Hoare triple {2271#(<= ~counter~0 0)} assume true; {2271#(<= ~counter~0 0)} is VALID [2022-04-27 12:50:41,029 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2271#(<= ~counter~0 0)} {2263#true} #82#return; {2271#(<= ~counter~0 0)} is VALID [2022-04-27 12:50:41,029 INFO L272 TraceCheckUtils]: 4: Hoare triple {2271#(<= ~counter~0 0)} call #t~ret7 := main(); {2271#(<= ~counter~0 0)} is VALID [2022-04-27 12:50:41,030 INFO L290 TraceCheckUtils]: 5: Hoare triple {2271#(<= ~counter~0 0)} havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~x~0;havoc ~y~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {2271#(<= ~counter~0 0)} is VALID [2022-04-27 12:50:41,030 INFO L272 TraceCheckUtils]: 6: Hoare triple {2271#(<= ~counter~0 0)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {2271#(<= ~counter~0 0)} is VALID [2022-04-27 12:50:41,032 INFO L290 TraceCheckUtils]: 7: Hoare triple {2271#(<= ~counter~0 0)} ~cond := #in~cond; {2271#(<= ~counter~0 0)} is VALID [2022-04-27 12:50:41,032 INFO L290 TraceCheckUtils]: 8: Hoare triple {2271#(<= ~counter~0 0)} assume !(0 == ~cond); {2271#(<= ~counter~0 0)} is VALID [2022-04-27 12:50:41,032 INFO L290 TraceCheckUtils]: 9: Hoare triple {2271#(<= ~counter~0 0)} assume true; {2271#(<= ~counter~0 0)} is VALID [2022-04-27 12:50:41,033 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2271#(<= ~counter~0 0)} {2271#(<= ~counter~0 0)} #64#return; {2271#(<= ~counter~0 0)} is VALID [2022-04-27 12:50:41,033 INFO L272 TraceCheckUtils]: 11: Hoare triple {2271#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {2271#(<= ~counter~0 0)} is VALID [2022-04-27 12:50:41,034 INFO L290 TraceCheckUtils]: 12: Hoare triple {2271#(<= ~counter~0 0)} ~cond := #in~cond; {2271#(<= ~counter~0 0)} is VALID [2022-04-27 12:50:41,034 INFO L290 TraceCheckUtils]: 13: Hoare triple {2271#(<= ~counter~0 0)} assume !(0 == ~cond); {2271#(<= ~counter~0 0)} is VALID [2022-04-27 12:50:41,034 INFO L290 TraceCheckUtils]: 14: Hoare triple {2271#(<= ~counter~0 0)} assume true; {2271#(<= ~counter~0 0)} is VALID [2022-04-27 12:50:41,035 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2271#(<= ~counter~0 0)} {2271#(<= ~counter~0 0)} #66#return; {2271#(<= ~counter~0 0)} is VALID [2022-04-27 12:50:41,035 INFO L290 TraceCheckUtils]: 16: Hoare triple {2271#(<= ~counter~0 0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {2271#(<= ~counter~0 0)} is VALID [2022-04-27 12:50:41,041 INFO L290 TraceCheckUtils]: 17: Hoare triple {2271#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2320#(<= ~counter~0 1)} is VALID [2022-04-27 12:50:41,041 INFO L290 TraceCheckUtils]: 18: Hoare triple {2320#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {2320#(<= ~counter~0 1)} is VALID [2022-04-27 12:50:41,042 INFO L272 TraceCheckUtils]: 19: Hoare triple {2320#(<= ~counter~0 1)} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {2320#(<= ~counter~0 1)} is VALID [2022-04-27 12:50:41,042 INFO L290 TraceCheckUtils]: 20: Hoare triple {2320#(<= ~counter~0 1)} ~cond := #in~cond; {2320#(<= ~counter~0 1)} is VALID [2022-04-27 12:50:41,043 INFO L290 TraceCheckUtils]: 21: Hoare triple {2320#(<= ~counter~0 1)} assume !(0 == ~cond); {2320#(<= ~counter~0 1)} is VALID [2022-04-27 12:50:41,043 INFO L290 TraceCheckUtils]: 22: Hoare triple {2320#(<= ~counter~0 1)} assume true; {2320#(<= ~counter~0 1)} is VALID [2022-04-27 12:50:41,044 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2320#(<= ~counter~0 1)} {2320#(<= ~counter~0 1)} #68#return; {2320#(<= ~counter~0 1)} is VALID [2022-04-27 12:50:41,044 INFO L272 TraceCheckUtils]: 24: Hoare triple {2320#(<= ~counter~0 1)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {2320#(<= ~counter~0 1)} is VALID [2022-04-27 12:50:41,045 INFO L290 TraceCheckUtils]: 25: Hoare triple {2320#(<= ~counter~0 1)} ~cond := #in~cond; {2320#(<= ~counter~0 1)} is VALID [2022-04-27 12:50:41,045 INFO L290 TraceCheckUtils]: 26: Hoare triple {2320#(<= ~counter~0 1)} assume !(0 == ~cond); {2320#(<= ~counter~0 1)} is VALID [2022-04-27 12:50:41,045 INFO L290 TraceCheckUtils]: 27: Hoare triple {2320#(<= ~counter~0 1)} assume true; {2320#(<= ~counter~0 1)} is VALID [2022-04-27 12:50:41,046 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2320#(<= ~counter~0 1)} {2320#(<= ~counter~0 1)} #70#return; {2320#(<= ~counter~0 1)} is VALID [2022-04-27 12:50:41,047 INFO L272 TraceCheckUtils]: 29: Hoare triple {2320#(<= ~counter~0 1)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {2320#(<= ~counter~0 1)} is VALID [2022-04-27 12:50:41,047 INFO L290 TraceCheckUtils]: 30: Hoare triple {2320#(<= ~counter~0 1)} ~cond := #in~cond; {2320#(<= ~counter~0 1)} is VALID [2022-04-27 12:50:41,047 INFO L290 TraceCheckUtils]: 31: Hoare triple {2320#(<= ~counter~0 1)} assume !(0 == ~cond); {2320#(<= ~counter~0 1)} is VALID [2022-04-27 12:50:41,048 INFO L290 TraceCheckUtils]: 32: Hoare triple {2320#(<= ~counter~0 1)} assume true; {2320#(<= ~counter~0 1)} is VALID [2022-04-27 12:50:41,048 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {2320#(<= ~counter~0 1)} {2320#(<= ~counter~0 1)} #72#return; {2320#(<= ~counter~0 1)} is VALID [2022-04-27 12:50:41,049 INFO L290 TraceCheckUtils]: 34: Hoare triple {2320#(<= ~counter~0 1)} assume !!(~a~0 != ~b~0); {2320#(<= ~counter~0 1)} is VALID [2022-04-27 12:50:41,049 INFO L290 TraceCheckUtils]: 35: Hoare triple {2320#(<= ~counter~0 1)} assume ~a~0 > ~b~0;~a~0 := ~a~0 - ~b~0;~p~0 := ~p~0 - ~q~0;~r~0 := ~r~0 - ~s~0; {2320#(<= ~counter~0 1)} is VALID [2022-04-27 12:50:41,049 INFO L290 TraceCheckUtils]: 36: Hoare triple {2320#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2378#(<= |main_#t~post6| 1)} is VALID [2022-04-27 12:50:41,050 INFO L290 TraceCheckUtils]: 37: Hoare triple {2378#(<= |main_#t~post6| 1)} assume !(#t~post6 < 50);havoc #t~post6; {2264#false} is VALID [2022-04-27 12:50:41,050 INFO L272 TraceCheckUtils]: 38: Hoare triple {2264#false} call __VERIFIER_assert((if 0 == ~a~0 - ~b~0 then 1 else 0)); {2264#false} is VALID [2022-04-27 12:50:41,050 INFO L290 TraceCheckUtils]: 39: Hoare triple {2264#false} ~cond := #in~cond; {2264#false} is VALID [2022-04-27 12:50:41,050 INFO L290 TraceCheckUtils]: 40: Hoare triple {2264#false} assume 0 == ~cond; {2264#false} is VALID [2022-04-27 12:50:41,050 INFO L290 TraceCheckUtils]: 41: Hoare triple {2264#false} assume !false; {2264#false} is VALID [2022-04-27 12:50:41,051 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-27 12:50:41,051 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:50:41,264 INFO L290 TraceCheckUtils]: 41: Hoare triple {2264#false} assume !false; {2264#false} is VALID [2022-04-27 12:50:41,265 INFO L290 TraceCheckUtils]: 40: Hoare triple {2264#false} assume 0 == ~cond; {2264#false} is VALID [2022-04-27 12:50:41,265 INFO L290 TraceCheckUtils]: 39: Hoare triple {2264#false} ~cond := #in~cond; {2264#false} is VALID [2022-04-27 12:50:41,265 INFO L272 TraceCheckUtils]: 38: Hoare triple {2264#false} call __VERIFIER_assert((if 0 == ~a~0 - ~b~0 then 1 else 0)); {2264#false} is VALID [2022-04-27 12:50:41,265 INFO L290 TraceCheckUtils]: 37: Hoare triple {2406#(< |main_#t~post6| 50)} assume !(#t~post6 < 50);havoc #t~post6; {2264#false} is VALID [2022-04-27 12:50:41,266 INFO L290 TraceCheckUtils]: 36: Hoare triple {2410#(< ~counter~0 50)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2406#(< |main_#t~post6| 50)} is VALID [2022-04-27 12:50:41,266 INFO L290 TraceCheckUtils]: 35: Hoare triple {2410#(< ~counter~0 50)} assume ~a~0 > ~b~0;~a~0 := ~a~0 - ~b~0;~p~0 := ~p~0 - ~q~0;~r~0 := ~r~0 - ~s~0; {2410#(< ~counter~0 50)} is VALID [2022-04-27 12:50:41,266 INFO L290 TraceCheckUtils]: 34: Hoare triple {2410#(< ~counter~0 50)} assume !!(~a~0 != ~b~0); {2410#(< ~counter~0 50)} is VALID [2022-04-27 12:50:41,267 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {2263#true} {2410#(< ~counter~0 50)} #72#return; {2410#(< ~counter~0 50)} is VALID [2022-04-27 12:50:41,267 INFO L290 TraceCheckUtils]: 32: Hoare triple {2263#true} assume true; {2263#true} is VALID [2022-04-27 12:50:41,267 INFO L290 TraceCheckUtils]: 31: Hoare triple {2263#true} assume !(0 == ~cond); {2263#true} is VALID [2022-04-27 12:50:41,267 INFO L290 TraceCheckUtils]: 30: Hoare triple {2263#true} ~cond := #in~cond; {2263#true} is VALID [2022-04-27 12:50:41,267 INFO L272 TraceCheckUtils]: 29: Hoare triple {2410#(< ~counter~0 50)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {2263#true} is VALID [2022-04-27 12:50:41,269 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2263#true} {2410#(< ~counter~0 50)} #70#return; {2410#(< ~counter~0 50)} is VALID [2022-04-27 12:50:41,269 INFO L290 TraceCheckUtils]: 27: Hoare triple {2263#true} assume true; {2263#true} is VALID [2022-04-27 12:50:41,269 INFO L290 TraceCheckUtils]: 26: Hoare triple {2263#true} assume !(0 == ~cond); {2263#true} is VALID [2022-04-27 12:50:41,269 INFO L290 TraceCheckUtils]: 25: Hoare triple {2263#true} ~cond := #in~cond; {2263#true} is VALID [2022-04-27 12:50:41,269 INFO L272 TraceCheckUtils]: 24: Hoare triple {2410#(< ~counter~0 50)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {2263#true} is VALID [2022-04-27 12:50:41,270 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2263#true} {2410#(< ~counter~0 50)} #68#return; {2410#(< ~counter~0 50)} is VALID [2022-04-27 12:50:41,270 INFO L290 TraceCheckUtils]: 22: Hoare triple {2263#true} assume true; {2263#true} is VALID [2022-04-27 12:50:41,270 INFO L290 TraceCheckUtils]: 21: Hoare triple {2263#true} assume !(0 == ~cond); {2263#true} is VALID [2022-04-27 12:50:41,270 INFO L290 TraceCheckUtils]: 20: Hoare triple {2263#true} ~cond := #in~cond; {2263#true} is VALID [2022-04-27 12:50:41,270 INFO L272 TraceCheckUtils]: 19: Hoare triple {2410#(< ~counter~0 50)} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {2263#true} is VALID [2022-04-27 12:50:41,273 INFO L290 TraceCheckUtils]: 18: Hoare triple {2410#(< ~counter~0 50)} assume !!(#t~post6 < 50);havoc #t~post6; {2410#(< ~counter~0 50)} is VALID [2022-04-27 12:50:41,273 INFO L290 TraceCheckUtils]: 17: Hoare triple {2468#(< ~counter~0 49)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2410#(< ~counter~0 50)} is VALID [2022-04-27 12:50:41,274 INFO L290 TraceCheckUtils]: 16: Hoare triple {2468#(< ~counter~0 49)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {2468#(< ~counter~0 49)} is VALID [2022-04-27 12:50:41,274 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2263#true} {2468#(< ~counter~0 49)} #66#return; {2468#(< ~counter~0 49)} is VALID [2022-04-27 12:50:41,274 INFO L290 TraceCheckUtils]: 14: Hoare triple {2263#true} assume true; {2263#true} is VALID [2022-04-27 12:50:41,274 INFO L290 TraceCheckUtils]: 13: Hoare triple {2263#true} assume !(0 == ~cond); {2263#true} is VALID [2022-04-27 12:50:41,274 INFO L290 TraceCheckUtils]: 12: Hoare triple {2263#true} ~cond := #in~cond; {2263#true} is VALID [2022-04-27 12:50:41,275 INFO L272 TraceCheckUtils]: 11: Hoare triple {2468#(< ~counter~0 49)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {2263#true} is VALID [2022-04-27 12:50:41,275 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2263#true} {2468#(< ~counter~0 49)} #64#return; {2468#(< ~counter~0 49)} is VALID [2022-04-27 12:50:41,275 INFO L290 TraceCheckUtils]: 9: Hoare triple {2263#true} assume true; {2263#true} is VALID [2022-04-27 12:50:41,275 INFO L290 TraceCheckUtils]: 8: Hoare triple {2263#true} assume !(0 == ~cond); {2263#true} is VALID [2022-04-27 12:50:41,275 INFO L290 TraceCheckUtils]: 7: Hoare triple {2263#true} ~cond := #in~cond; {2263#true} is VALID [2022-04-27 12:50:41,275 INFO L272 TraceCheckUtils]: 6: Hoare triple {2468#(< ~counter~0 49)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {2263#true} is VALID [2022-04-27 12:50:41,276 INFO L290 TraceCheckUtils]: 5: Hoare triple {2468#(< ~counter~0 49)} havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~x~0;havoc ~y~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {2468#(< ~counter~0 49)} is VALID [2022-04-27 12:50:41,276 INFO L272 TraceCheckUtils]: 4: Hoare triple {2468#(< ~counter~0 49)} call #t~ret7 := main(); {2468#(< ~counter~0 49)} is VALID [2022-04-27 12:50:41,276 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2468#(< ~counter~0 49)} {2263#true} #82#return; {2468#(< ~counter~0 49)} is VALID [2022-04-27 12:50:41,277 INFO L290 TraceCheckUtils]: 2: Hoare triple {2468#(< ~counter~0 49)} assume true; {2468#(< ~counter~0 49)} is VALID [2022-04-27 12:50:41,277 INFO L290 TraceCheckUtils]: 1: Hoare triple {2263#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2468#(< ~counter~0 49)} is VALID [2022-04-27 12:50:41,277 INFO L272 TraceCheckUtils]: 0: Hoare triple {2263#true} call ULTIMATE.init(); {2263#true} is VALID [2022-04-27 12:50:41,278 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-27 12:50:41,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:50:41,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731320404] [2022-04-27 12:50:41,278 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:50:41,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [699489505] [2022-04-27 12:50:41,278 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [699489505] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 12:50:41,278 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 12:50:41,278 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-04-27 12:50:41,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084842091] [2022-04-27 12:50:41,279 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 12:50:41,279 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 6 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 4 states have call predecessors, (12), 5 states have call successors, (12) Word has length 42 [2022-04-27 12:50:41,280 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:50:41,280 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 6 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 4 states have call predecessors, (12), 5 states have call successors, (12) [2022-04-27 12:50:41,328 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:50:41,329 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 12:50:41,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:50:41,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 12:50:41,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-04-27 12:50:41,330 INFO L87 Difference]: Start difference. First operand 78 states and 109 transitions. Second operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 6 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 4 states have call predecessors, (12), 5 states have call successors, (12) [2022-04-27 12:50:41,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:50:41,750 INFO L93 Difference]: Finished difference Result 222 states and 290 transitions. [2022-04-27 12:50:41,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-27 12:50:41,750 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 6 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 4 states have call predecessors, (12), 5 states have call successors, (12) Word has length 42 [2022-04-27 12:50:41,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:50:41,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 6 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 4 states have call predecessors, (12), 5 states have call successors, (12) [2022-04-27 12:50:41,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 124 transitions. [2022-04-27 12:50:41,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 6 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 4 states have call predecessors, (12), 5 states have call successors, (12) [2022-04-27 12:50:41,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 124 transitions. [2022-04-27 12:50:41,756 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 124 transitions. [2022-04-27 12:50:41,859 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 124 edges. 124 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:50:41,865 INFO L225 Difference]: With dead ends: 222 [2022-04-27 12:50:41,865 INFO L226 Difference]: Without dead ends: 200 [2022-04-27 12:50:41,866 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-04-27 12:50:41,866 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 62 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 12:50:41,866 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 222 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 12:50:41,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2022-04-27 12:50:41,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 194. [2022-04-27 12:50:41,952 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:50:41,952 INFO L82 GeneralOperation]: Start isEquivalent. First operand 200 states. Second operand has 194 states, 109 states have (on average 1.2201834862385321) internal successors, (133), 120 states have internal predecessors, (133), 63 states have call successors, (63), 23 states have call predecessors, (63), 21 states have return successors, (55), 50 states have call predecessors, (55), 55 states have call successors, (55) [2022-04-27 12:50:41,953 INFO L74 IsIncluded]: Start isIncluded. First operand 200 states. Second operand has 194 states, 109 states have (on average 1.2201834862385321) internal successors, (133), 120 states have internal predecessors, (133), 63 states have call successors, (63), 23 states have call predecessors, (63), 21 states have return successors, (55), 50 states have call predecessors, (55), 55 states have call successors, (55) [2022-04-27 12:50:41,953 INFO L87 Difference]: Start difference. First operand 200 states. Second operand has 194 states, 109 states have (on average 1.2201834862385321) internal successors, (133), 120 states have internal predecessors, (133), 63 states have call successors, (63), 23 states have call predecessors, (63), 21 states have return successors, (55), 50 states have call predecessors, (55), 55 states have call successors, (55) [2022-04-27 12:50:41,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:50:41,961 INFO L93 Difference]: Finished difference Result 200 states and 254 transitions. [2022-04-27 12:50:41,961 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 254 transitions. [2022-04-27 12:50:41,962 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:50:41,962 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:50:41,963 INFO L74 IsIncluded]: Start isIncluded. First operand has 194 states, 109 states have (on average 1.2201834862385321) internal successors, (133), 120 states have internal predecessors, (133), 63 states have call successors, (63), 23 states have call predecessors, (63), 21 states have return successors, (55), 50 states have call predecessors, (55), 55 states have call successors, (55) Second operand 200 states. [2022-04-27 12:50:41,963 INFO L87 Difference]: Start difference. First operand has 194 states, 109 states have (on average 1.2201834862385321) internal successors, (133), 120 states have internal predecessors, (133), 63 states have call successors, (63), 23 states have call predecessors, (63), 21 states have return successors, (55), 50 states have call predecessors, (55), 55 states have call successors, (55) Second operand 200 states. [2022-04-27 12:50:41,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:50:41,972 INFO L93 Difference]: Finished difference Result 200 states and 254 transitions. [2022-04-27 12:50:41,972 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 254 transitions. [2022-04-27 12:50:41,972 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:50:41,973 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:50:41,973 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:50:41,973 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:50:41,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 109 states have (on average 1.2201834862385321) internal successors, (133), 120 states have internal predecessors, (133), 63 states have call successors, (63), 23 states have call predecessors, (63), 21 states have return successors, (55), 50 states have call predecessors, (55), 55 states have call successors, (55) [2022-04-27 12:50:41,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 251 transitions. [2022-04-27 12:50:41,981 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 251 transitions. Word has length 42 [2022-04-27 12:50:41,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:50:41,981 INFO L495 AbstractCegarLoop]: Abstraction has 194 states and 251 transitions. [2022-04-27 12:50:41,981 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 6 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 4 states have call predecessors, (12), 5 states have call successors, (12) [2022-04-27 12:50:41,981 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 251 transitions. [2022-04-27 12:50:41,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-27 12:50:41,982 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:50:41,982 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:50:42,009 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-27 12:50:42,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:50:42,204 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:50:42,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:50:42,204 INFO L85 PathProgramCache]: Analyzing trace with hash -1083409702, now seen corresponding path program 1 times [2022-04-27 12:50:42,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:50:42,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454064782] [2022-04-27 12:50:42,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:50:42,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:50:42,219 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:50:42,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1284974387] [2022-04-27 12:50:42,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:50:42,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:50:42,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:50:42,221 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 12:50:42,251 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-27 12:50:42,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:50:42,294 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-27 12:50:42,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:50:42,314 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:50:44,854 INFO L272 TraceCheckUtils]: 0: Hoare triple {3552#true} call ULTIMATE.init(); {3552#true} is VALID [2022-04-27 12:50:44,855 INFO L290 TraceCheckUtils]: 1: Hoare triple {3552#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {3552#true} is VALID [2022-04-27 12:50:44,855 INFO L290 TraceCheckUtils]: 2: Hoare triple {3552#true} assume true; {3552#true} is VALID [2022-04-27 12:50:44,855 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3552#true} {3552#true} #82#return; {3552#true} is VALID [2022-04-27 12:50:44,855 INFO L272 TraceCheckUtils]: 4: Hoare triple {3552#true} call #t~ret7 := main(); {3552#true} is VALID [2022-04-27 12:50:44,855 INFO L290 TraceCheckUtils]: 5: Hoare triple {3552#true} havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~x~0;havoc ~y~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {3552#true} is VALID [2022-04-27 12:50:44,855 INFO L272 TraceCheckUtils]: 6: Hoare triple {3552#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {3552#true} is VALID [2022-04-27 12:50:44,856 INFO L290 TraceCheckUtils]: 7: Hoare triple {3552#true} ~cond := #in~cond; {3552#true} is VALID [2022-04-27 12:50:44,856 INFO L290 TraceCheckUtils]: 8: Hoare triple {3552#true} assume !(0 == ~cond); {3552#true} is VALID [2022-04-27 12:50:44,856 INFO L290 TraceCheckUtils]: 9: Hoare triple {3552#true} assume true; {3552#true} is VALID [2022-04-27 12:50:44,856 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3552#true} {3552#true} #64#return; {3552#true} is VALID [2022-04-27 12:50:44,856 INFO L272 TraceCheckUtils]: 11: Hoare triple {3552#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {3552#true} is VALID [2022-04-27 12:50:44,856 INFO L290 TraceCheckUtils]: 12: Hoare triple {3552#true} ~cond := #in~cond; {3552#true} is VALID [2022-04-27 12:50:44,856 INFO L290 TraceCheckUtils]: 13: Hoare triple {3552#true} assume !(0 == ~cond); {3552#true} is VALID [2022-04-27 12:50:44,856 INFO L290 TraceCheckUtils]: 14: Hoare triple {3552#true} assume true; {3552#true} is VALID [2022-04-27 12:50:44,856 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3552#true} {3552#true} #66#return; {3552#true} is VALID [2022-04-27 12:50:44,857 INFO L290 TraceCheckUtils]: 16: Hoare triple {3552#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {3605#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-27 12:50:44,857 INFO L290 TraceCheckUtils]: 17: Hoare triple {3605#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3605#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-27 12:50:44,858 INFO L290 TraceCheckUtils]: 18: Hoare triple {3605#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} assume !!(#t~post6 < 50);havoc #t~post6; {3605#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-27 12:50:44,858 INFO L272 TraceCheckUtils]: 19: Hoare triple {3605#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {3552#true} is VALID [2022-04-27 12:50:44,858 INFO L290 TraceCheckUtils]: 20: Hoare triple {3552#true} ~cond := #in~cond; {3552#true} is VALID [2022-04-27 12:50:44,858 INFO L290 TraceCheckUtils]: 21: Hoare triple {3552#true} assume !(0 == ~cond); {3552#true} is VALID [2022-04-27 12:50:44,858 INFO L290 TraceCheckUtils]: 22: Hoare triple {3552#true} assume true; {3552#true} is VALID [2022-04-27 12:50:44,859 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {3552#true} {3605#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} #68#return; {3605#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-27 12:50:44,860 INFO L272 TraceCheckUtils]: 24: Hoare triple {3605#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {3552#true} is VALID [2022-04-27 12:50:44,860 INFO L290 TraceCheckUtils]: 25: Hoare triple {3552#true} ~cond := #in~cond; {3552#true} is VALID [2022-04-27 12:50:44,861 INFO L290 TraceCheckUtils]: 26: Hoare triple {3552#true} assume !(0 == ~cond); {3552#true} is VALID [2022-04-27 12:50:44,861 INFO L290 TraceCheckUtils]: 27: Hoare triple {3552#true} assume true; {3552#true} is VALID [2022-04-27 12:50:44,862 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {3552#true} {3605#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} #70#return; {3605#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-27 12:50:44,862 INFO L272 TraceCheckUtils]: 29: Hoare triple {3605#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {3552#true} is VALID [2022-04-27 12:50:44,862 INFO L290 TraceCheckUtils]: 30: Hoare triple {3552#true} ~cond := #in~cond; {3552#true} is VALID [2022-04-27 12:50:44,863 INFO L290 TraceCheckUtils]: 31: Hoare triple {3552#true} assume !(0 == ~cond); {3552#true} is VALID [2022-04-27 12:50:44,863 INFO L290 TraceCheckUtils]: 32: Hoare triple {3552#true} assume true; {3552#true} is VALID [2022-04-27 12:50:44,863 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {3552#true} {3605#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} #72#return; {3605#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-27 12:50:44,864 INFO L290 TraceCheckUtils]: 34: Hoare triple {3605#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} assume !!(~a~0 != ~b~0); {3605#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-27 12:50:44,864 INFO L290 TraceCheckUtils]: 35: Hoare triple {3605#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} assume ~a~0 > ~b~0;~a~0 := ~a~0 - ~b~0;~p~0 := ~p~0 - ~q~0;~r~0 := ~r~0 - ~s~0; {3605#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-27 12:50:44,865 INFO L290 TraceCheckUtils]: 36: Hoare triple {3605#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3605#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-27 12:50:44,865 INFO L290 TraceCheckUtils]: 37: Hoare triple {3605#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} assume !!(#t~post6 < 50);havoc #t~post6; {3605#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-27 12:50:44,866 INFO L272 TraceCheckUtils]: 38: Hoare triple {3605#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {3672#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:50:44,866 INFO L290 TraceCheckUtils]: 39: Hoare triple {3672#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3676#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:50:44,867 INFO L290 TraceCheckUtils]: 40: Hoare triple {3676#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3553#false} is VALID [2022-04-27 12:50:44,867 INFO L290 TraceCheckUtils]: 41: Hoare triple {3553#false} assume !false; {3553#false} is VALID [2022-04-27 12:50:44,867 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-04-27 12:50:44,867 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 12:50:44,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:50:44,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454064782] [2022-04-27 12:50:44,868 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:50:44,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1284974387] [2022-04-27 12:50:44,868 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1284974387] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 12:50:44,868 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 12:50:44,868 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 12:50:44,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851452939] [2022-04-27 12:50:44,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:50:44,870 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 42 [2022-04-27 12:50:44,870 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:50:44,870 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-27 12:50:44,899 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:50:44,900 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 12:50:44,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:50:44,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 12:50:44,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 12:50:44,901 INFO L87 Difference]: Start difference. First operand 194 states and 251 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-27 12:50:45,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:50:45,167 INFO L93 Difference]: Finished difference Result 208 states and 264 transitions. [2022-04-27 12:50:45,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 12:50:45,167 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 42 [2022-04-27 12:50:45,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:50:45,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-27 12:50:45,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 62 transitions. [2022-04-27 12:50:45,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-27 12:50:45,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 62 transitions. [2022-04-27 12:50:45,170 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 62 transitions. [2022-04-27 12:50:45,219 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:50:45,224 INFO L225 Difference]: With dead ends: 208 [2022-04-27 12:50:45,225 INFO L226 Difference]: Without dead ends: 203 [2022-04-27 12:50:45,225 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 12:50:45,226 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 7 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 12:50:45,226 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 132 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 12:50:45,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2022-04-27 12:50:45,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2022-04-27 12:50:45,305 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:50:45,306 INFO L82 GeneralOperation]: Start isEquivalent. First operand 203 states. Second operand has 203 states, 118 states have (on average 1.2033898305084745) internal successors, (142), 129 states have internal predecessors, (142), 60 states have call successors, (60), 26 states have call predecessors, (60), 24 states have return successors, (52), 47 states have call predecessors, (52), 52 states have call successors, (52) [2022-04-27 12:50:45,306 INFO L74 IsIncluded]: Start isIncluded. First operand 203 states. Second operand has 203 states, 118 states have (on average 1.2033898305084745) internal successors, (142), 129 states have internal predecessors, (142), 60 states have call successors, (60), 26 states have call predecessors, (60), 24 states have return successors, (52), 47 states have call predecessors, (52), 52 states have call successors, (52) [2022-04-27 12:50:45,307 INFO L87 Difference]: Start difference. First operand 203 states. Second operand has 203 states, 118 states have (on average 1.2033898305084745) internal successors, (142), 129 states have internal predecessors, (142), 60 states have call successors, (60), 26 states have call predecessors, (60), 24 states have return successors, (52), 47 states have call predecessors, (52), 52 states have call successors, (52) [2022-04-27 12:50:45,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:50:45,314 INFO L93 Difference]: Finished difference Result 203 states and 254 transitions. [2022-04-27 12:50:45,314 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 254 transitions. [2022-04-27 12:50:45,315 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:50:45,315 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:50:45,316 INFO L74 IsIncluded]: Start isIncluded. First operand has 203 states, 118 states have (on average 1.2033898305084745) internal successors, (142), 129 states have internal predecessors, (142), 60 states have call successors, (60), 26 states have call predecessors, (60), 24 states have return successors, (52), 47 states have call predecessors, (52), 52 states have call successors, (52) Second operand 203 states. [2022-04-27 12:50:45,317 INFO L87 Difference]: Start difference. First operand has 203 states, 118 states have (on average 1.2033898305084745) internal successors, (142), 129 states have internal predecessors, (142), 60 states have call successors, (60), 26 states have call predecessors, (60), 24 states have return successors, (52), 47 states have call predecessors, (52), 52 states have call successors, (52) Second operand 203 states. [2022-04-27 12:50:45,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:50:45,324 INFO L93 Difference]: Finished difference Result 203 states and 254 transitions. [2022-04-27 12:50:45,324 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 254 transitions. [2022-04-27 12:50:45,325 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:50:45,325 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:50:45,325 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:50:45,325 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:50:45,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 118 states have (on average 1.2033898305084745) internal successors, (142), 129 states have internal predecessors, (142), 60 states have call successors, (60), 26 states have call predecessors, (60), 24 states have return successors, (52), 47 states have call predecessors, (52), 52 states have call successors, (52) [2022-04-27 12:50:45,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 254 transitions. [2022-04-27 12:50:45,333 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 254 transitions. Word has length 42 [2022-04-27 12:50:45,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:50:45,333 INFO L495 AbstractCegarLoop]: Abstraction has 203 states and 254 transitions. [2022-04-27 12:50:45,333 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-27 12:50:45,333 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 254 transitions. [2022-04-27 12:50:45,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-27 12:50:45,334 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:50:45,334 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:50:45,358 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-27 12:50:45,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:50:45,555 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:50:45,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:50:45,556 INFO L85 PathProgramCache]: Analyzing trace with hash -1376219446, now seen corresponding path program 1 times [2022-04-27 12:50:45,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:50:45,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832054377] [2022-04-27 12:50:45,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:50:45,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:50:45,568 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:50:45,569 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2134886119] [2022-04-27 12:50:45,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:50:45,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:50:45,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:50:45,570 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 12:50:45,588 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-27 12:50:45,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:50:45,623 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-27 12:50:45,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:50:45,634 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:50:45,779 INFO L272 TraceCheckUtils]: 0: Hoare triple {4700#true} call ULTIMATE.init(); {4700#true} is VALID [2022-04-27 12:50:45,779 INFO L290 TraceCheckUtils]: 1: Hoare triple {4700#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {4700#true} is VALID [2022-04-27 12:50:45,780 INFO L290 TraceCheckUtils]: 2: Hoare triple {4700#true} assume true; {4700#true} is VALID [2022-04-27 12:50:45,780 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4700#true} {4700#true} #82#return; {4700#true} is VALID [2022-04-27 12:50:45,780 INFO L272 TraceCheckUtils]: 4: Hoare triple {4700#true} call #t~ret7 := main(); {4700#true} is VALID [2022-04-27 12:50:45,780 INFO L290 TraceCheckUtils]: 5: Hoare triple {4700#true} havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~x~0;havoc ~y~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {4700#true} is VALID [2022-04-27 12:50:45,780 INFO L272 TraceCheckUtils]: 6: Hoare triple {4700#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {4700#true} is VALID [2022-04-27 12:50:45,780 INFO L290 TraceCheckUtils]: 7: Hoare triple {4700#true} ~cond := #in~cond; {4700#true} is VALID [2022-04-27 12:50:45,780 INFO L290 TraceCheckUtils]: 8: Hoare triple {4700#true} assume !(0 == ~cond); {4700#true} is VALID [2022-04-27 12:50:45,780 INFO L290 TraceCheckUtils]: 9: Hoare triple {4700#true} assume true; {4700#true} is VALID [2022-04-27 12:50:45,780 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4700#true} {4700#true} #64#return; {4700#true} is VALID [2022-04-27 12:50:45,781 INFO L272 TraceCheckUtils]: 11: Hoare triple {4700#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {4700#true} is VALID [2022-04-27 12:50:45,781 INFO L290 TraceCheckUtils]: 12: Hoare triple {4700#true} ~cond := #in~cond; {4700#true} is VALID [2022-04-27 12:50:45,781 INFO L290 TraceCheckUtils]: 13: Hoare triple {4700#true} assume !(0 == ~cond); {4700#true} is VALID [2022-04-27 12:50:45,781 INFO L290 TraceCheckUtils]: 14: Hoare triple {4700#true} assume true; {4700#true} is VALID [2022-04-27 12:50:45,781 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {4700#true} {4700#true} #66#return; {4700#true} is VALID [2022-04-27 12:50:45,781 INFO L290 TraceCheckUtils]: 16: Hoare triple {4700#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {4700#true} is VALID [2022-04-27 12:50:45,781 INFO L290 TraceCheckUtils]: 17: Hoare triple {4700#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4700#true} is VALID [2022-04-27 12:50:45,781 INFO L290 TraceCheckUtils]: 18: Hoare triple {4700#true} assume !!(#t~post6 < 50);havoc #t~post6; {4700#true} is VALID [2022-04-27 12:50:45,781 INFO L272 TraceCheckUtils]: 19: Hoare triple {4700#true} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {4700#true} is VALID [2022-04-27 12:50:45,781 INFO L290 TraceCheckUtils]: 20: Hoare triple {4700#true} ~cond := #in~cond; {4700#true} is VALID [2022-04-27 12:50:45,782 INFO L290 TraceCheckUtils]: 21: Hoare triple {4700#true} assume !(0 == ~cond); {4700#true} is VALID [2022-04-27 12:50:45,782 INFO L290 TraceCheckUtils]: 22: Hoare triple {4700#true} assume true; {4700#true} is VALID [2022-04-27 12:50:45,782 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {4700#true} {4700#true} #68#return; {4700#true} is VALID [2022-04-27 12:50:45,782 INFO L272 TraceCheckUtils]: 24: Hoare triple {4700#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {4700#true} is VALID [2022-04-27 12:50:45,786 INFO L290 TraceCheckUtils]: 25: Hoare triple {4700#true} ~cond := #in~cond; {4780#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:50:45,786 INFO L290 TraceCheckUtils]: 26: Hoare triple {4780#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {4784#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:50:45,787 INFO L290 TraceCheckUtils]: 27: Hoare triple {4784#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {4784#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:50:45,787 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {4784#(not (= |__VERIFIER_assert_#in~cond| 0))} {4700#true} #70#return; {4791#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 12:50:45,788 INFO L272 TraceCheckUtils]: 29: Hoare triple {4791#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {4700#true} is VALID [2022-04-27 12:50:45,788 INFO L290 TraceCheckUtils]: 30: Hoare triple {4700#true} ~cond := #in~cond; {4700#true} is VALID [2022-04-27 12:50:45,788 INFO L290 TraceCheckUtils]: 31: Hoare triple {4700#true} assume !(0 == ~cond); {4700#true} is VALID [2022-04-27 12:50:45,788 INFO L290 TraceCheckUtils]: 32: Hoare triple {4700#true} assume true; {4700#true} is VALID [2022-04-27 12:50:45,789 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {4700#true} {4791#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #72#return; {4791#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 12:50:45,789 INFO L290 TraceCheckUtils]: 34: Hoare triple {4791#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !(~a~0 != ~b~0); {4810#(= main_~b~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 12:50:45,789 INFO L272 TraceCheckUtils]: 35: Hoare triple {4810#(= main_~b~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} call __VERIFIER_assert((if 0 == ~a~0 - ~b~0 then 1 else 0)); {4700#true} is VALID [2022-04-27 12:50:45,789 INFO L290 TraceCheckUtils]: 36: Hoare triple {4700#true} ~cond := #in~cond; {4700#true} is VALID [2022-04-27 12:50:45,789 INFO L290 TraceCheckUtils]: 37: Hoare triple {4700#true} assume !(0 == ~cond); {4700#true} is VALID [2022-04-27 12:50:45,789 INFO L290 TraceCheckUtils]: 38: Hoare triple {4700#true} assume true; {4700#true} is VALID [2022-04-27 12:50:45,790 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {4700#true} {4810#(= main_~b~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #74#return; {4810#(= main_~b~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 12:50:45,791 INFO L272 TraceCheckUtils]: 40: Hoare triple {4810#(= main_~b~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} call __VERIFIER_assert((if 0 == ~p~0 * ~x~0 + ~r~0 * ~y~0 - ~b~0 then 1 else 0)); {4829#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:50:45,791 INFO L290 TraceCheckUtils]: 41: Hoare triple {4829#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4833#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:50:45,792 INFO L290 TraceCheckUtils]: 42: Hoare triple {4833#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4701#false} is VALID [2022-04-27 12:50:45,792 INFO L290 TraceCheckUtils]: 43: Hoare triple {4701#false} assume !false; {4701#false} is VALID [2022-04-27 12:50:45,792 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-04-27 12:50:45,792 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:51:02,396 INFO L290 TraceCheckUtils]: 43: Hoare triple {4701#false} assume !false; {4701#false} is VALID [2022-04-27 12:51:02,397 INFO L290 TraceCheckUtils]: 42: Hoare triple {4833#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4701#false} is VALID [2022-04-27 12:51:02,397 INFO L290 TraceCheckUtils]: 41: Hoare triple {4829#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4833#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:51:02,399 INFO L272 TraceCheckUtils]: 40: Hoare triple {4810#(= main_~b~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} call __VERIFIER_assert((if 0 == ~p~0 * ~x~0 + ~r~0 * ~y~0 - ~b~0 then 1 else 0)); {4829#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:51:02,399 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {4700#true} {4810#(= main_~b~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #74#return; {4810#(= main_~b~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 12:51:02,399 INFO L290 TraceCheckUtils]: 38: Hoare triple {4700#true} assume true; {4700#true} is VALID [2022-04-27 12:51:02,400 INFO L290 TraceCheckUtils]: 37: Hoare triple {4700#true} assume !(0 == ~cond); {4700#true} is VALID [2022-04-27 12:51:02,400 INFO L290 TraceCheckUtils]: 36: Hoare triple {4700#true} ~cond := #in~cond; {4700#true} is VALID [2022-04-27 12:51:02,400 INFO L272 TraceCheckUtils]: 35: Hoare triple {4810#(= main_~b~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} call __VERIFIER_assert((if 0 == ~a~0 - ~b~0 then 1 else 0)); {4700#true} is VALID [2022-04-27 12:51:02,400 INFO L290 TraceCheckUtils]: 34: Hoare triple {4791#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !(~a~0 != ~b~0); {4810#(= main_~b~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 12:51:02,401 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {4700#true} {4791#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #72#return; {4791#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 12:51:02,401 INFO L290 TraceCheckUtils]: 32: Hoare triple {4700#true} assume true; {4700#true} is VALID [2022-04-27 12:51:02,401 INFO L290 TraceCheckUtils]: 31: Hoare triple {4700#true} assume !(0 == ~cond); {4700#true} is VALID [2022-04-27 12:51:02,401 INFO L290 TraceCheckUtils]: 30: Hoare triple {4700#true} ~cond := #in~cond; {4700#true} is VALID [2022-04-27 12:51:02,402 INFO L272 TraceCheckUtils]: 29: Hoare triple {4791#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {4700#true} is VALID [2022-04-27 12:51:02,402 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {4784#(not (= |__VERIFIER_assert_#in~cond| 0))} {4700#true} #70#return; {4791#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 12:51:02,403 INFO L290 TraceCheckUtils]: 27: Hoare triple {4784#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {4784#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:51:02,403 INFO L290 TraceCheckUtils]: 26: Hoare triple {4894#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {4784#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:51:02,404 INFO L290 TraceCheckUtils]: 25: Hoare triple {4700#true} ~cond := #in~cond; {4894#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 12:51:02,404 INFO L272 TraceCheckUtils]: 24: Hoare triple {4700#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {4700#true} is VALID [2022-04-27 12:51:02,404 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {4700#true} {4700#true} #68#return; {4700#true} is VALID [2022-04-27 12:51:02,404 INFO L290 TraceCheckUtils]: 22: Hoare triple {4700#true} assume true; {4700#true} is VALID [2022-04-27 12:51:02,404 INFO L290 TraceCheckUtils]: 21: Hoare triple {4700#true} assume !(0 == ~cond); {4700#true} is VALID [2022-04-27 12:51:02,404 INFO L290 TraceCheckUtils]: 20: Hoare triple {4700#true} ~cond := #in~cond; {4700#true} is VALID [2022-04-27 12:51:02,404 INFO L272 TraceCheckUtils]: 19: Hoare triple {4700#true} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {4700#true} is VALID [2022-04-27 12:51:02,404 INFO L290 TraceCheckUtils]: 18: Hoare triple {4700#true} assume !!(#t~post6 < 50);havoc #t~post6; {4700#true} is VALID [2022-04-27 12:51:02,404 INFO L290 TraceCheckUtils]: 17: Hoare triple {4700#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4700#true} is VALID [2022-04-27 12:51:02,405 INFO L290 TraceCheckUtils]: 16: Hoare triple {4700#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {4700#true} is VALID [2022-04-27 12:51:02,405 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {4700#true} {4700#true} #66#return; {4700#true} is VALID [2022-04-27 12:51:02,405 INFO L290 TraceCheckUtils]: 14: Hoare triple {4700#true} assume true; {4700#true} is VALID [2022-04-27 12:51:02,405 INFO L290 TraceCheckUtils]: 13: Hoare triple {4700#true} assume !(0 == ~cond); {4700#true} is VALID [2022-04-27 12:51:02,405 INFO L290 TraceCheckUtils]: 12: Hoare triple {4700#true} ~cond := #in~cond; {4700#true} is VALID [2022-04-27 12:51:02,405 INFO L272 TraceCheckUtils]: 11: Hoare triple {4700#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {4700#true} is VALID [2022-04-27 12:51:02,405 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4700#true} {4700#true} #64#return; {4700#true} is VALID [2022-04-27 12:51:02,405 INFO L290 TraceCheckUtils]: 9: Hoare triple {4700#true} assume true; {4700#true} is VALID [2022-04-27 12:51:02,405 INFO L290 TraceCheckUtils]: 8: Hoare triple {4700#true} assume !(0 == ~cond); {4700#true} is VALID [2022-04-27 12:51:02,405 INFO L290 TraceCheckUtils]: 7: Hoare triple {4700#true} ~cond := #in~cond; {4700#true} is VALID [2022-04-27 12:51:02,406 INFO L272 TraceCheckUtils]: 6: Hoare triple {4700#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {4700#true} is VALID [2022-04-27 12:51:02,406 INFO L290 TraceCheckUtils]: 5: Hoare triple {4700#true} havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~x~0;havoc ~y~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {4700#true} is VALID [2022-04-27 12:51:02,406 INFO L272 TraceCheckUtils]: 4: Hoare triple {4700#true} call #t~ret7 := main(); {4700#true} is VALID [2022-04-27 12:51:02,406 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4700#true} {4700#true} #82#return; {4700#true} is VALID [2022-04-27 12:51:02,406 INFO L290 TraceCheckUtils]: 2: Hoare triple {4700#true} assume true; {4700#true} is VALID [2022-04-27 12:51:02,406 INFO L290 TraceCheckUtils]: 1: Hoare triple {4700#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {4700#true} is VALID [2022-04-27 12:51:02,406 INFO L272 TraceCheckUtils]: 0: Hoare triple {4700#true} call ULTIMATE.init(); {4700#true} is VALID [2022-04-27 12:51:02,406 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-04-27 12:51:02,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:51:02,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832054377] [2022-04-27 12:51:02,407 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:51:02,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2134886119] [2022-04-27 12:51:02,407 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2134886119] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 12:51:02,407 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 12:51:02,407 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2022-04-27 12:51:02,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828266495] [2022-04-27 12:51:02,407 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 12:51:02,408 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 44 [2022-04-27 12:51:02,408 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:51:02,408 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-27 12:51:02,439 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:51:02,440 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-27 12:51:02,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:51:02,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-27 12:51:02,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-04-27 12:51:02,440 INFO L87 Difference]: Start difference. First operand 203 states and 254 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-27 12:51:03,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:51:03,199 INFO L93 Difference]: Finished difference Result 232 states and 290 transitions. [2022-04-27 12:51:03,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-27 12:51:03,199 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 44 [2022-04-27 12:51:03,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:51:03,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-27 12:51:03,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 60 transitions. [2022-04-27 12:51:03,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-27 12:51:03,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 60 transitions. [2022-04-27 12:51:03,203 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 60 transitions. [2022-04-27 12:51:03,258 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:51:03,263 INFO L225 Difference]: With dead ends: 232 [2022-04-27 12:51:03,263 INFO L226 Difference]: Without dead ends: 216 [2022-04-27 12:51:03,264 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 79 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-04-27 12:51:03,264 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 15 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 12:51:03,264 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 141 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 12:51:03,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2022-04-27 12:51:03,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 214. [2022-04-27 12:51:03,358 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:51:03,358 INFO L82 GeneralOperation]: Start isEquivalent. First operand 216 states. Second operand has 214 states, 128 states have (on average 1.1640625) internal successors, (149), 139 states have internal predecessors, (149), 59 states have call successors, (59), 27 states have call predecessors, (59), 26 states have return successors, (54), 47 states have call predecessors, (54), 54 states have call successors, (54) [2022-04-27 12:51:03,359 INFO L74 IsIncluded]: Start isIncluded. First operand 216 states. Second operand has 214 states, 128 states have (on average 1.1640625) internal successors, (149), 139 states have internal predecessors, (149), 59 states have call successors, (59), 27 states have call predecessors, (59), 26 states have return successors, (54), 47 states have call predecessors, (54), 54 states have call successors, (54) [2022-04-27 12:51:03,359 INFO L87 Difference]: Start difference. First operand 216 states. Second operand has 214 states, 128 states have (on average 1.1640625) internal successors, (149), 139 states have internal predecessors, (149), 59 states have call successors, (59), 27 states have call predecessors, (59), 26 states have return successors, (54), 47 states have call predecessors, (54), 54 states have call successors, (54) [2022-04-27 12:51:03,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:51:03,367 INFO L93 Difference]: Finished difference Result 216 states and 265 transitions. [2022-04-27 12:51:03,367 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 265 transitions. [2022-04-27 12:51:03,368 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:51:03,368 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:51:03,369 INFO L74 IsIncluded]: Start isIncluded. First operand has 214 states, 128 states have (on average 1.1640625) internal successors, (149), 139 states have internal predecessors, (149), 59 states have call successors, (59), 27 states have call predecessors, (59), 26 states have return successors, (54), 47 states have call predecessors, (54), 54 states have call successors, (54) Second operand 216 states. [2022-04-27 12:51:03,369 INFO L87 Difference]: Start difference. First operand has 214 states, 128 states have (on average 1.1640625) internal successors, (149), 139 states have internal predecessors, (149), 59 states have call successors, (59), 27 states have call predecessors, (59), 26 states have return successors, (54), 47 states have call predecessors, (54), 54 states have call successors, (54) Second operand 216 states. [2022-04-27 12:51:03,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:51:03,377 INFO L93 Difference]: Finished difference Result 216 states and 265 transitions. [2022-04-27 12:51:03,377 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 265 transitions. [2022-04-27 12:51:03,378 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:51:03,378 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:51:03,378 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:51:03,378 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:51:03,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 128 states have (on average 1.1640625) internal successors, (149), 139 states have internal predecessors, (149), 59 states have call successors, (59), 27 states have call predecessors, (59), 26 states have return successors, (54), 47 states have call predecessors, (54), 54 states have call successors, (54) [2022-04-27 12:51:03,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 262 transitions. [2022-04-27 12:51:03,385 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 262 transitions. Word has length 44 [2022-04-27 12:51:03,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:51:03,385 INFO L495 AbstractCegarLoop]: Abstraction has 214 states and 262 transitions. [2022-04-27 12:51:03,385 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-27 12:51:03,386 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 262 transitions. [2022-04-27 12:51:03,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-27 12:51:03,386 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:51:03,386 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:51:03,418 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-27 12:51:03,599 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:51:03,599 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:51:03,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:51:03,600 INFO L85 PathProgramCache]: Analyzing trace with hash -1137310021, now seen corresponding path program 2 times [2022-04-27 12:51:03,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:51:03,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683124039] [2022-04-27 12:51:03,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:51:03,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:51:03,611 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:51:03,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1069790493] [2022-04-27 12:51:03,612 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 12:51:03,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:51:03,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:51:03,613 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 12:51:03,616 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-27 12:51:03,659 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 12:51:03,660 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 12:51:03,661 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-27 12:51:03,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:51:03,672 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:51:03,982 INFO L272 TraceCheckUtils]: 0: Hoare triple {6070#true} call ULTIMATE.init(); {6070#true} is VALID [2022-04-27 12:51:03,982 INFO L290 TraceCheckUtils]: 1: Hoare triple {6070#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {6070#true} is VALID [2022-04-27 12:51:03,982 INFO L290 TraceCheckUtils]: 2: Hoare triple {6070#true} assume true; {6070#true} is VALID [2022-04-27 12:51:03,983 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6070#true} {6070#true} #82#return; {6070#true} is VALID [2022-04-27 12:51:03,983 INFO L272 TraceCheckUtils]: 4: Hoare triple {6070#true} call #t~ret7 := main(); {6070#true} is VALID [2022-04-27 12:51:03,983 INFO L290 TraceCheckUtils]: 5: Hoare triple {6070#true} havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~x~0;havoc ~y~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {6070#true} is VALID [2022-04-27 12:51:03,983 INFO L272 TraceCheckUtils]: 6: Hoare triple {6070#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {6070#true} is VALID [2022-04-27 12:51:03,983 INFO L290 TraceCheckUtils]: 7: Hoare triple {6070#true} ~cond := #in~cond; {6070#true} is VALID [2022-04-27 12:51:03,983 INFO L290 TraceCheckUtils]: 8: Hoare triple {6070#true} assume !(0 == ~cond); {6070#true} is VALID [2022-04-27 12:51:03,983 INFO L290 TraceCheckUtils]: 9: Hoare triple {6070#true} assume true; {6070#true} is VALID [2022-04-27 12:51:03,983 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6070#true} {6070#true} #64#return; {6070#true} is VALID [2022-04-27 12:51:03,983 INFO L272 TraceCheckUtils]: 11: Hoare triple {6070#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {6070#true} is VALID [2022-04-27 12:51:03,983 INFO L290 TraceCheckUtils]: 12: Hoare triple {6070#true} ~cond := #in~cond; {6070#true} is VALID [2022-04-27 12:51:03,983 INFO L290 TraceCheckUtils]: 13: Hoare triple {6070#true} assume !(0 == ~cond); {6070#true} is VALID [2022-04-27 12:51:03,983 INFO L290 TraceCheckUtils]: 14: Hoare triple {6070#true} assume true; {6070#true} is VALID [2022-04-27 12:51:03,987 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {6070#true} {6070#true} #66#return; {6070#true} is VALID [2022-04-27 12:51:03,995 INFO L290 TraceCheckUtils]: 16: Hoare triple {6070#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {6123#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 12:51:03,996 INFO L290 TraceCheckUtils]: 17: Hoare triple {6123#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6123#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 12:51:03,996 INFO L290 TraceCheckUtils]: 18: Hoare triple {6123#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(#t~post6 < 50);havoc #t~post6; {6123#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 12:51:03,997 INFO L272 TraceCheckUtils]: 19: Hoare triple {6123#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {6070#true} is VALID [2022-04-27 12:51:03,997 INFO L290 TraceCheckUtils]: 20: Hoare triple {6070#true} ~cond := #in~cond; {6070#true} is VALID [2022-04-27 12:51:03,997 INFO L290 TraceCheckUtils]: 21: Hoare triple {6070#true} assume !(0 == ~cond); {6070#true} is VALID [2022-04-27 12:51:03,997 INFO L290 TraceCheckUtils]: 22: Hoare triple {6070#true} assume true; {6070#true} is VALID [2022-04-27 12:51:03,998 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {6070#true} {6123#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #68#return; {6123#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 12:51:03,998 INFO L272 TraceCheckUtils]: 24: Hoare triple {6123#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {6070#true} is VALID [2022-04-27 12:51:03,998 INFO L290 TraceCheckUtils]: 25: Hoare triple {6070#true} ~cond := #in~cond; {6070#true} is VALID [2022-04-27 12:51:03,999 INFO L290 TraceCheckUtils]: 26: Hoare triple {6070#true} assume !(0 == ~cond); {6070#true} is VALID [2022-04-27 12:51:03,999 INFO L290 TraceCheckUtils]: 27: Hoare triple {6070#true} assume true; {6070#true} is VALID [2022-04-27 12:51:04,000 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {6070#true} {6123#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #70#return; {6123#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 12:51:04,000 INFO L272 TraceCheckUtils]: 29: Hoare triple {6123#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {6070#true} is VALID [2022-04-27 12:51:04,000 INFO L290 TraceCheckUtils]: 30: Hoare triple {6070#true} ~cond := #in~cond; {6070#true} is VALID [2022-04-27 12:51:04,000 INFO L290 TraceCheckUtils]: 31: Hoare triple {6070#true} assume !(0 == ~cond); {6070#true} is VALID [2022-04-27 12:51:04,000 INFO L290 TraceCheckUtils]: 32: Hoare triple {6070#true} assume true; {6070#true} is VALID [2022-04-27 12:51:04,001 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {6070#true} {6123#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #72#return; {6123#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 12:51:04,001 INFO L290 TraceCheckUtils]: 34: Hoare triple {6123#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(~a~0 != ~b~0); {6123#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 12:51:04,002 INFO L290 TraceCheckUtils]: 35: Hoare triple {6123#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume ~a~0 > ~b~0;~a~0 := ~a~0 - ~b~0;~p~0 := ~p~0 - ~q~0;~r~0 := ~r~0 - ~s~0; {6181#(and (= (+ (* (- 1) main_~p~0) 1) 0) (= main_~y~0 (+ (* (- 1) main_~a~0) main_~x~0)) (= (- 1) main_~r~0))} is VALID [2022-04-27 12:51:04,003 INFO L290 TraceCheckUtils]: 36: Hoare triple {6181#(and (= (+ (* (- 1) main_~p~0) 1) 0) (= main_~y~0 (+ (* (- 1) main_~a~0) main_~x~0)) (= (- 1) main_~r~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6181#(and (= (+ (* (- 1) main_~p~0) 1) 0) (= main_~y~0 (+ (* (- 1) main_~a~0) main_~x~0)) (= (- 1) main_~r~0))} is VALID [2022-04-27 12:51:04,003 INFO L290 TraceCheckUtils]: 37: Hoare triple {6181#(and (= (+ (* (- 1) main_~p~0) 1) 0) (= main_~y~0 (+ (* (- 1) main_~a~0) main_~x~0)) (= (- 1) main_~r~0))} assume !!(#t~post6 < 50);havoc #t~post6; {6181#(and (= (+ (* (- 1) main_~p~0) 1) 0) (= main_~y~0 (+ (* (- 1) main_~a~0) main_~x~0)) (= (- 1) main_~r~0))} is VALID [2022-04-27 12:51:04,003 INFO L272 TraceCheckUtils]: 38: Hoare triple {6181#(and (= (+ (* (- 1) main_~p~0) 1) 0) (= main_~y~0 (+ (* (- 1) main_~a~0) main_~x~0)) (= (- 1) main_~r~0))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {6070#true} is VALID [2022-04-27 12:51:04,003 INFO L290 TraceCheckUtils]: 39: Hoare triple {6070#true} ~cond := #in~cond; {6070#true} is VALID [2022-04-27 12:51:04,003 INFO L290 TraceCheckUtils]: 40: Hoare triple {6070#true} assume !(0 == ~cond); {6070#true} is VALID [2022-04-27 12:51:04,004 INFO L290 TraceCheckUtils]: 41: Hoare triple {6070#true} assume true; {6070#true} is VALID [2022-04-27 12:51:04,004 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {6070#true} {6181#(and (= (+ (* (- 1) main_~p~0) 1) 0) (= main_~y~0 (+ (* (- 1) main_~a~0) main_~x~0)) (= (- 1) main_~r~0))} #68#return; {6181#(and (= (+ (* (- 1) main_~p~0) 1) 0) (= main_~y~0 (+ (* (- 1) main_~a~0) main_~x~0)) (= (- 1) main_~r~0))} is VALID [2022-04-27 12:51:04,005 INFO L272 TraceCheckUtils]: 43: Hoare triple {6181#(and (= (+ (* (- 1) main_~p~0) 1) 0) (= main_~y~0 (+ (* (- 1) main_~a~0) main_~x~0)) (= (- 1) main_~r~0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {6206#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:51:04,006 INFO L290 TraceCheckUtils]: 44: Hoare triple {6206#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6210#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:51:04,006 INFO L290 TraceCheckUtils]: 45: Hoare triple {6210#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6071#false} is VALID [2022-04-27 12:51:04,006 INFO L290 TraceCheckUtils]: 46: Hoare triple {6071#false} assume !false; {6071#false} is VALID [2022-04-27 12:51:04,006 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-27 12:51:04,006 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:51:04,230 INFO L290 TraceCheckUtils]: 46: Hoare triple {6071#false} assume !false; {6071#false} is VALID [2022-04-27 12:51:04,231 INFO L290 TraceCheckUtils]: 45: Hoare triple {6210#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6071#false} is VALID [2022-04-27 12:51:04,231 INFO L290 TraceCheckUtils]: 44: Hoare triple {6206#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6210#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:51:04,232 INFO L272 TraceCheckUtils]: 43: Hoare triple {6226#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {6206#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:51:04,233 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {6070#true} {6226#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #68#return; {6226#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 12:51:04,233 INFO L290 TraceCheckUtils]: 41: Hoare triple {6070#true} assume true; {6070#true} is VALID [2022-04-27 12:51:04,233 INFO L290 TraceCheckUtils]: 40: Hoare triple {6070#true} assume !(0 == ~cond); {6070#true} is VALID [2022-04-27 12:51:04,233 INFO L290 TraceCheckUtils]: 39: Hoare triple {6070#true} ~cond := #in~cond; {6070#true} is VALID [2022-04-27 12:51:04,234 INFO L272 TraceCheckUtils]: 38: Hoare triple {6226#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {6070#true} is VALID [2022-04-27 12:51:04,234 INFO L290 TraceCheckUtils]: 37: Hoare triple {6226#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !!(#t~post6 < 50);havoc #t~post6; {6226#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 12:51:04,234 INFO L290 TraceCheckUtils]: 36: Hoare triple {6226#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6226#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 12:51:04,837 INFO L290 TraceCheckUtils]: 35: Hoare triple {6251#(= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))} assume ~a~0 > ~b~0;~a~0 := ~a~0 - ~b~0;~p~0 := ~p~0 - ~q~0;~r~0 := ~r~0 - ~s~0; {6226#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 12:51:04,838 INFO L290 TraceCheckUtils]: 34: Hoare triple {6251#(= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))} assume !!(~a~0 != ~b~0); {6251#(= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))} is VALID [2022-04-27 12:51:04,839 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {6070#true} {6251#(= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))} #72#return; {6251#(= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))} is VALID [2022-04-27 12:51:04,839 INFO L290 TraceCheckUtils]: 32: Hoare triple {6070#true} assume true; {6070#true} is VALID [2022-04-27 12:51:04,839 INFO L290 TraceCheckUtils]: 31: Hoare triple {6070#true} assume !(0 == ~cond); {6070#true} is VALID [2022-04-27 12:51:04,839 INFO L290 TraceCheckUtils]: 30: Hoare triple {6070#true} ~cond := #in~cond; {6070#true} is VALID [2022-04-27 12:51:04,839 INFO L272 TraceCheckUtils]: 29: Hoare triple {6251#(= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {6070#true} is VALID [2022-04-27 12:51:04,842 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {6070#true} {6251#(= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))} #70#return; {6251#(= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))} is VALID [2022-04-27 12:51:04,843 INFO L290 TraceCheckUtils]: 27: Hoare triple {6070#true} assume true; {6070#true} is VALID [2022-04-27 12:51:04,843 INFO L290 TraceCheckUtils]: 26: Hoare triple {6070#true} assume !(0 == ~cond); {6070#true} is VALID [2022-04-27 12:51:04,843 INFO L290 TraceCheckUtils]: 25: Hoare triple {6070#true} ~cond := #in~cond; {6070#true} is VALID [2022-04-27 12:51:04,843 INFO L272 TraceCheckUtils]: 24: Hoare triple {6251#(= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {6070#true} is VALID [2022-04-27 12:51:04,843 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {6070#true} {6251#(= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))} #68#return; {6251#(= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))} is VALID [2022-04-27 12:51:04,843 INFO L290 TraceCheckUtils]: 22: Hoare triple {6070#true} assume true; {6070#true} is VALID [2022-04-27 12:51:04,844 INFO L290 TraceCheckUtils]: 21: Hoare triple {6070#true} assume !(0 == ~cond); {6070#true} is VALID [2022-04-27 12:51:04,844 INFO L290 TraceCheckUtils]: 20: Hoare triple {6070#true} ~cond := #in~cond; {6070#true} is VALID [2022-04-27 12:51:04,844 INFO L272 TraceCheckUtils]: 19: Hoare triple {6251#(= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {6070#true} is VALID [2022-04-27 12:51:04,844 INFO L290 TraceCheckUtils]: 18: Hoare triple {6251#(= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))} assume !!(#t~post6 < 50);havoc #t~post6; {6251#(= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))} is VALID [2022-04-27 12:51:04,845 INFO L290 TraceCheckUtils]: 17: Hoare triple {6251#(= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6251#(= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))} is VALID [2022-04-27 12:51:04,845 INFO L290 TraceCheckUtils]: 16: Hoare triple {6070#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {6251#(= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))} is VALID [2022-04-27 12:51:04,845 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {6070#true} {6070#true} #66#return; {6070#true} is VALID [2022-04-27 12:51:04,845 INFO L290 TraceCheckUtils]: 14: Hoare triple {6070#true} assume true; {6070#true} is VALID [2022-04-27 12:51:04,845 INFO L290 TraceCheckUtils]: 13: Hoare triple {6070#true} assume !(0 == ~cond); {6070#true} is VALID [2022-04-27 12:51:04,845 INFO L290 TraceCheckUtils]: 12: Hoare triple {6070#true} ~cond := #in~cond; {6070#true} is VALID [2022-04-27 12:51:04,845 INFO L272 TraceCheckUtils]: 11: Hoare triple {6070#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {6070#true} is VALID [2022-04-27 12:51:04,845 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6070#true} {6070#true} #64#return; {6070#true} is VALID [2022-04-27 12:51:04,845 INFO L290 TraceCheckUtils]: 9: Hoare triple {6070#true} assume true; {6070#true} is VALID [2022-04-27 12:51:04,845 INFO L290 TraceCheckUtils]: 8: Hoare triple {6070#true} assume !(0 == ~cond); {6070#true} is VALID [2022-04-27 12:51:04,846 INFO L290 TraceCheckUtils]: 7: Hoare triple {6070#true} ~cond := #in~cond; {6070#true} is VALID [2022-04-27 12:51:04,846 INFO L272 TraceCheckUtils]: 6: Hoare triple {6070#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {6070#true} is VALID [2022-04-27 12:51:04,846 INFO L290 TraceCheckUtils]: 5: Hoare triple {6070#true} havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~x~0;havoc ~y~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {6070#true} is VALID [2022-04-27 12:51:04,846 INFO L272 TraceCheckUtils]: 4: Hoare triple {6070#true} call #t~ret7 := main(); {6070#true} is VALID [2022-04-27 12:51:04,846 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6070#true} {6070#true} #82#return; {6070#true} is VALID [2022-04-27 12:51:04,846 INFO L290 TraceCheckUtils]: 2: Hoare triple {6070#true} assume true; {6070#true} is VALID [2022-04-27 12:51:04,846 INFO L290 TraceCheckUtils]: 1: Hoare triple {6070#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {6070#true} is VALID [2022-04-27 12:51:04,846 INFO L272 TraceCheckUtils]: 0: Hoare triple {6070#true} call ULTIMATE.init(); {6070#true} is VALID [2022-04-27 12:51:04,846 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-27 12:51:04,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:51:04,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683124039] [2022-04-27 12:51:04,847 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:51:04,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1069790493] [2022-04-27 12:51:04,847 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1069790493] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 12:51:04,847 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 12:51:04,847 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2022-04-27 12:51:04,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840986823] [2022-04-27 12:51:04,847 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 12:51:04,848 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 5 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) Word has length 47 [2022-04-27 12:51:04,848 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:51:04,848 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 5 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2022-04-27 12:51:04,903 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:51:04,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 12:51:04,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:51:04,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 12:51:04,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-04-27 12:51:04,904 INFO L87 Difference]: Start difference. First operand 214 states and 262 transitions. Second operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 5 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2022-04-27 12:51:08,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:51:08,217 INFO L93 Difference]: Finished difference Result 253 states and 314 transitions. [2022-04-27 12:51:08,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 12:51:08,218 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 5 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) Word has length 47 [2022-04-27 12:51:08,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:51:08,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 5 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2022-04-27 12:51:08,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 75 transitions. [2022-04-27 12:51:08,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 5 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2022-04-27 12:51:08,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 75 transitions. [2022-04-27 12:51:08,221 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 75 transitions. [2022-04-27 12:51:08,364 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:51:08,368 INFO L225 Difference]: With dead ends: 253 [2022-04-27 12:51:08,369 INFO L226 Difference]: Without dead ends: 229 [2022-04-27 12:51:08,369 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 86 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-04-27 12:51:08,370 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 14 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-27 12:51:08,370 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 152 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-27 12:51:08,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2022-04-27 12:51:08,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 210. [2022-04-27 12:51:08,473 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:51:08,474 INFO L82 GeneralOperation]: Start isEquivalent. First operand 229 states. Second operand has 210 states, 134 states have (on average 1.126865671641791) internal successors, (151), 142 states have internal predecessors, (151), 47 states have call successors, (47), 29 states have call predecessors, (47), 28 states have return successors, (42), 38 states have call predecessors, (42), 42 states have call successors, (42) [2022-04-27 12:51:08,475 INFO L74 IsIncluded]: Start isIncluded. First operand 229 states. Second operand has 210 states, 134 states have (on average 1.126865671641791) internal successors, (151), 142 states have internal predecessors, (151), 47 states have call successors, (47), 29 states have call predecessors, (47), 28 states have return successors, (42), 38 states have call predecessors, (42), 42 states have call successors, (42) [2022-04-27 12:51:08,476 INFO L87 Difference]: Start difference. First operand 229 states. Second operand has 210 states, 134 states have (on average 1.126865671641791) internal successors, (151), 142 states have internal predecessors, (151), 47 states have call successors, (47), 29 states have call predecessors, (47), 28 states have return successors, (42), 38 states have call predecessors, (42), 42 states have call successors, (42) [2022-04-27 12:51:08,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:51:08,483 INFO L93 Difference]: Finished difference Result 229 states and 273 transitions. [2022-04-27 12:51:08,483 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 273 transitions. [2022-04-27 12:51:08,484 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:51:08,484 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:51:08,484 INFO L74 IsIncluded]: Start isIncluded. First operand has 210 states, 134 states have (on average 1.126865671641791) internal successors, (151), 142 states have internal predecessors, (151), 47 states have call successors, (47), 29 states have call predecessors, (47), 28 states have return successors, (42), 38 states have call predecessors, (42), 42 states have call successors, (42) Second operand 229 states. [2022-04-27 12:51:08,485 INFO L87 Difference]: Start difference. First operand has 210 states, 134 states have (on average 1.126865671641791) internal successors, (151), 142 states have internal predecessors, (151), 47 states have call successors, (47), 29 states have call predecessors, (47), 28 states have return successors, (42), 38 states have call predecessors, (42), 42 states have call successors, (42) Second operand 229 states. [2022-04-27 12:51:08,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:51:08,491 INFO L93 Difference]: Finished difference Result 229 states and 273 transitions. [2022-04-27 12:51:08,491 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 273 transitions. [2022-04-27 12:51:08,491 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:51:08,491 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:51:08,491 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:51:08,491 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:51:08,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 134 states have (on average 1.126865671641791) internal successors, (151), 142 states have internal predecessors, (151), 47 states have call successors, (47), 29 states have call predecessors, (47), 28 states have return successors, (42), 38 states have call predecessors, (42), 42 states have call successors, (42) [2022-04-27 12:51:08,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 240 transitions. [2022-04-27 12:51:08,497 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 240 transitions. Word has length 47 [2022-04-27 12:51:08,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:51:08,497 INFO L495 AbstractCegarLoop]: Abstraction has 210 states and 240 transitions. [2022-04-27 12:51:08,497 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 5 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2022-04-27 12:51:08,497 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 240 transitions. [2022-04-27 12:51:08,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-04-27 12:51:08,498 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:51:08,498 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:51:08,523 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-04-27 12:51:08,713 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-04-27 12:51:08,713 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:51:08,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:51:08,713 INFO L85 PathProgramCache]: Analyzing trace with hash 1997533323, now seen corresponding path program 1 times [2022-04-27 12:51:08,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:51:08,714 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812475402] [2022-04-27 12:51:08,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:51:08,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:51:08,733 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:51:08,733 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1399090131] [2022-04-27 12:51:08,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:51:08,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:51:08,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:51:08,736 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 12:51:08,769 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-04-27 12:51:08,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:51:08,801 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-27 12:51:08,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:51:08,813 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:51:09,189 INFO L272 TraceCheckUtils]: 0: Hoare triple {7497#true} call ULTIMATE.init(); {7497#true} is VALID [2022-04-27 12:51:09,189 INFO L290 TraceCheckUtils]: 1: Hoare triple {7497#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {7497#true} is VALID [2022-04-27 12:51:09,190 INFO L290 TraceCheckUtils]: 2: Hoare triple {7497#true} assume true; {7497#true} is VALID [2022-04-27 12:51:09,190 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7497#true} {7497#true} #82#return; {7497#true} is VALID [2022-04-27 12:51:09,190 INFO L272 TraceCheckUtils]: 4: Hoare triple {7497#true} call #t~ret7 := main(); {7497#true} is VALID [2022-04-27 12:51:09,190 INFO L290 TraceCheckUtils]: 5: Hoare triple {7497#true} havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~x~0;havoc ~y~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {7497#true} is VALID [2022-04-27 12:51:09,190 INFO L272 TraceCheckUtils]: 6: Hoare triple {7497#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {7497#true} is VALID [2022-04-27 12:51:09,190 INFO L290 TraceCheckUtils]: 7: Hoare triple {7497#true} ~cond := #in~cond; {7497#true} is VALID [2022-04-27 12:51:09,190 INFO L290 TraceCheckUtils]: 8: Hoare triple {7497#true} assume !(0 == ~cond); {7497#true} is VALID [2022-04-27 12:51:09,190 INFO L290 TraceCheckUtils]: 9: Hoare triple {7497#true} assume true; {7497#true} is VALID [2022-04-27 12:51:09,190 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7497#true} {7497#true} #64#return; {7497#true} is VALID [2022-04-27 12:51:09,190 INFO L272 TraceCheckUtils]: 11: Hoare triple {7497#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {7497#true} is VALID [2022-04-27 12:51:09,191 INFO L290 TraceCheckUtils]: 12: Hoare triple {7497#true} ~cond := #in~cond; {7497#true} is VALID [2022-04-27 12:51:09,191 INFO L290 TraceCheckUtils]: 13: Hoare triple {7497#true} assume !(0 == ~cond); {7497#true} is VALID [2022-04-27 12:51:09,191 INFO L290 TraceCheckUtils]: 14: Hoare triple {7497#true} assume true; {7497#true} is VALID [2022-04-27 12:51:09,191 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {7497#true} {7497#true} #66#return; {7497#true} is VALID [2022-04-27 12:51:09,191 INFO L290 TraceCheckUtils]: 16: Hoare triple {7497#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {7550#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-27 12:51:09,192 INFO L290 TraceCheckUtils]: 17: Hoare triple {7550#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7550#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-27 12:51:09,192 INFO L290 TraceCheckUtils]: 18: Hoare triple {7550#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} assume !!(#t~post6 < 50);havoc #t~post6; {7550#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-27 12:51:09,192 INFO L272 TraceCheckUtils]: 19: Hoare triple {7550#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {7497#true} is VALID [2022-04-27 12:51:09,192 INFO L290 TraceCheckUtils]: 20: Hoare triple {7497#true} ~cond := #in~cond; {7497#true} is VALID [2022-04-27 12:51:09,192 INFO L290 TraceCheckUtils]: 21: Hoare triple {7497#true} assume !(0 == ~cond); {7497#true} is VALID [2022-04-27 12:51:09,193 INFO L290 TraceCheckUtils]: 22: Hoare triple {7497#true} assume true; {7497#true} is VALID [2022-04-27 12:51:09,193 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {7497#true} {7550#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} #68#return; {7550#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-27 12:51:09,193 INFO L272 TraceCheckUtils]: 24: Hoare triple {7550#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {7497#true} is VALID [2022-04-27 12:51:09,193 INFO L290 TraceCheckUtils]: 25: Hoare triple {7497#true} ~cond := #in~cond; {7497#true} is VALID [2022-04-27 12:51:09,193 INFO L290 TraceCheckUtils]: 26: Hoare triple {7497#true} assume !(0 == ~cond); {7497#true} is VALID [2022-04-27 12:51:09,193 INFO L290 TraceCheckUtils]: 27: Hoare triple {7497#true} assume true; {7497#true} is VALID [2022-04-27 12:51:09,194 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {7497#true} {7550#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} #70#return; {7550#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-27 12:51:09,194 INFO L272 TraceCheckUtils]: 29: Hoare triple {7550#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {7497#true} is VALID [2022-04-27 12:51:09,194 INFO L290 TraceCheckUtils]: 30: Hoare triple {7497#true} ~cond := #in~cond; {7497#true} is VALID [2022-04-27 12:51:09,194 INFO L290 TraceCheckUtils]: 31: Hoare triple {7497#true} assume !(0 == ~cond); {7497#true} is VALID [2022-04-27 12:51:09,195 INFO L290 TraceCheckUtils]: 32: Hoare triple {7497#true} assume true; {7497#true} is VALID [2022-04-27 12:51:09,195 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {7497#true} {7550#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} #72#return; {7550#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-27 12:51:09,196 INFO L290 TraceCheckUtils]: 34: Hoare triple {7550#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} assume !!(~a~0 != ~b~0); {7550#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-27 12:51:09,196 INFO L290 TraceCheckUtils]: 35: Hoare triple {7550#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} assume ~a~0 > ~b~0;~a~0 := ~a~0 - ~b~0;~p~0 := ~p~0 - ~q~0;~r~0 := ~r~0 - ~s~0; {7608#(and (= main_~s~0 1) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0))} is VALID [2022-04-27 12:51:09,197 INFO L290 TraceCheckUtils]: 36: Hoare triple {7608#(and (= main_~s~0 1) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7608#(and (= main_~s~0 1) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0))} is VALID [2022-04-27 12:51:09,197 INFO L290 TraceCheckUtils]: 37: Hoare triple {7608#(and (= main_~s~0 1) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0))} assume !!(#t~post6 < 50);havoc #t~post6; {7608#(and (= main_~s~0 1) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0))} is VALID [2022-04-27 12:51:09,197 INFO L272 TraceCheckUtils]: 38: Hoare triple {7608#(and (= main_~s~0 1) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {7497#true} is VALID [2022-04-27 12:51:09,197 INFO L290 TraceCheckUtils]: 39: Hoare triple {7497#true} ~cond := #in~cond; {7497#true} is VALID [2022-04-27 12:51:09,197 INFO L290 TraceCheckUtils]: 40: Hoare triple {7497#true} assume !(0 == ~cond); {7497#true} is VALID [2022-04-27 12:51:09,198 INFO L290 TraceCheckUtils]: 41: Hoare triple {7497#true} assume true; {7497#true} is VALID [2022-04-27 12:51:09,198 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {7497#true} {7608#(and (= main_~s~0 1) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0))} #68#return; {7608#(and (= main_~s~0 1) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0))} is VALID [2022-04-27 12:51:09,198 INFO L272 TraceCheckUtils]: 43: Hoare triple {7608#(and (= main_~s~0 1) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {7497#true} is VALID [2022-04-27 12:51:09,198 INFO L290 TraceCheckUtils]: 44: Hoare triple {7497#true} ~cond := #in~cond; {7497#true} is VALID [2022-04-27 12:51:09,198 INFO L290 TraceCheckUtils]: 45: Hoare triple {7497#true} assume !(0 == ~cond); {7497#true} is VALID [2022-04-27 12:51:09,199 INFO L290 TraceCheckUtils]: 46: Hoare triple {7497#true} assume true; {7497#true} is VALID [2022-04-27 12:51:09,199 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {7497#true} {7608#(and (= main_~s~0 1) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0))} #70#return; {7608#(and (= main_~s~0 1) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0))} is VALID [2022-04-27 12:51:09,199 INFO L272 TraceCheckUtils]: 48: Hoare triple {7608#(and (= main_~s~0 1) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {7497#true} is VALID [2022-04-27 12:51:09,199 INFO L290 TraceCheckUtils]: 49: Hoare triple {7497#true} ~cond := #in~cond; {7497#true} is VALID [2022-04-27 12:51:09,200 INFO L290 TraceCheckUtils]: 50: Hoare triple {7497#true} assume !(0 == ~cond); {7497#true} is VALID [2022-04-27 12:51:09,200 INFO L290 TraceCheckUtils]: 51: Hoare triple {7497#true} assume true; {7497#true} is VALID [2022-04-27 12:51:09,200 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {7497#true} {7608#(and (= main_~s~0 1) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0))} #72#return; {7608#(and (= main_~s~0 1) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0))} is VALID [2022-04-27 12:51:09,201 INFO L290 TraceCheckUtils]: 53: Hoare triple {7608#(and (= main_~s~0 1) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0))} assume !!(~a~0 != ~b~0); {7608#(and (= main_~s~0 1) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0))} is VALID [2022-04-27 12:51:09,202 INFO L290 TraceCheckUtils]: 54: Hoare triple {7608#(and (= main_~s~0 1) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0))} assume !(~a~0 > ~b~0);~b~0 := ~b~0 - ~a~0;~q~0 := ~q~0 - ~p~0;~s~0 := ~s~0 - ~r~0; {7666#(and (= (+ (* (- 1) main_~r~0) 1) main_~s~0) (= (- 1) main_~r~0) (= main_~q~0 (* (- 1) main_~p~0)) (= main_~p~0 1))} is VALID [2022-04-27 12:51:09,202 INFO L290 TraceCheckUtils]: 55: Hoare triple {7666#(and (= (+ (* (- 1) main_~r~0) 1) main_~s~0) (= (- 1) main_~r~0) (= main_~q~0 (* (- 1) main_~p~0)) (= main_~p~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7666#(and (= (+ (* (- 1) main_~r~0) 1) main_~s~0) (= (- 1) main_~r~0) (= main_~q~0 (* (- 1) main_~p~0)) (= main_~p~0 1))} is VALID [2022-04-27 12:51:09,203 INFO L290 TraceCheckUtils]: 56: Hoare triple {7666#(and (= (+ (* (- 1) main_~r~0) 1) main_~s~0) (= (- 1) main_~r~0) (= main_~q~0 (* (- 1) main_~p~0)) (= main_~p~0 1))} assume !!(#t~post6 < 50);havoc #t~post6; {7666#(and (= (+ (* (- 1) main_~r~0) 1) main_~s~0) (= (- 1) main_~r~0) (= main_~q~0 (* (- 1) main_~p~0)) (= main_~p~0 1))} is VALID [2022-04-27 12:51:09,203 INFO L272 TraceCheckUtils]: 57: Hoare triple {7666#(and (= (+ (* (- 1) main_~r~0) 1) main_~s~0) (= (- 1) main_~r~0) (= main_~q~0 (* (- 1) main_~p~0)) (= main_~p~0 1))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {7676#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:51:09,204 INFO L290 TraceCheckUtils]: 58: Hoare triple {7676#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7680#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:51:09,204 INFO L290 TraceCheckUtils]: 59: Hoare triple {7680#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7498#false} is VALID [2022-04-27 12:51:09,204 INFO L290 TraceCheckUtils]: 60: Hoare triple {7498#false} assume !false; {7498#false} is VALID [2022-04-27 12:51:09,204 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 12 proven. 13 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-04-27 12:51:09,205 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:51:09,509 INFO L290 TraceCheckUtils]: 60: Hoare triple {7498#false} assume !false; {7498#false} is VALID [2022-04-27 12:51:09,509 INFO L290 TraceCheckUtils]: 59: Hoare triple {7680#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7498#false} is VALID [2022-04-27 12:51:09,510 INFO L290 TraceCheckUtils]: 58: Hoare triple {7676#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7680#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:51:09,510 INFO L272 TraceCheckUtils]: 57: Hoare triple {7696#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {7676#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:51:09,511 INFO L290 TraceCheckUtils]: 56: Hoare triple {7696#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} assume !!(#t~post6 < 50);havoc #t~post6; {7696#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} is VALID [2022-04-27 12:51:09,511 INFO L290 TraceCheckUtils]: 55: Hoare triple {7696#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7696#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} is VALID [2022-04-27 12:51:09,514 INFO L290 TraceCheckUtils]: 54: Hoare triple {7696#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} assume !(~a~0 > ~b~0);~b~0 := ~b~0 - ~a~0;~q~0 := ~q~0 - ~p~0;~s~0 := ~s~0 - ~r~0; {7696#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} is VALID [2022-04-27 12:51:09,515 INFO L290 TraceCheckUtils]: 53: Hoare triple {7696#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} assume !!(~a~0 != ~b~0); {7696#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} is VALID [2022-04-27 12:51:09,515 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {7497#true} {7696#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} #72#return; {7696#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} is VALID [2022-04-27 12:51:09,515 INFO L290 TraceCheckUtils]: 51: Hoare triple {7497#true} assume true; {7497#true} is VALID [2022-04-27 12:51:09,516 INFO L290 TraceCheckUtils]: 50: Hoare triple {7497#true} assume !(0 == ~cond); {7497#true} is VALID [2022-04-27 12:51:09,516 INFO L290 TraceCheckUtils]: 49: Hoare triple {7497#true} ~cond := #in~cond; {7497#true} is VALID [2022-04-27 12:51:09,516 INFO L272 TraceCheckUtils]: 48: Hoare triple {7696#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {7497#true} is VALID [2022-04-27 12:51:09,516 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {7497#true} {7696#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} #70#return; {7696#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} is VALID [2022-04-27 12:51:09,517 INFO L290 TraceCheckUtils]: 46: Hoare triple {7497#true} assume true; {7497#true} is VALID [2022-04-27 12:51:09,517 INFO L290 TraceCheckUtils]: 45: Hoare triple {7497#true} assume !(0 == ~cond); {7497#true} is VALID [2022-04-27 12:51:09,517 INFO L290 TraceCheckUtils]: 44: Hoare triple {7497#true} ~cond := #in~cond; {7497#true} is VALID [2022-04-27 12:51:09,517 INFO L272 TraceCheckUtils]: 43: Hoare triple {7696#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {7497#true} is VALID [2022-04-27 12:51:09,517 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {7497#true} {7696#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} #68#return; {7696#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} is VALID [2022-04-27 12:51:09,517 INFO L290 TraceCheckUtils]: 41: Hoare triple {7497#true} assume true; {7497#true} is VALID [2022-04-27 12:51:09,518 INFO L290 TraceCheckUtils]: 40: Hoare triple {7497#true} assume !(0 == ~cond); {7497#true} is VALID [2022-04-27 12:51:09,518 INFO L290 TraceCheckUtils]: 39: Hoare triple {7497#true} ~cond := #in~cond; {7497#true} is VALID [2022-04-27 12:51:09,518 INFO L272 TraceCheckUtils]: 38: Hoare triple {7696#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {7497#true} is VALID [2022-04-27 12:51:09,518 INFO L290 TraceCheckUtils]: 37: Hoare triple {7696#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} assume !!(#t~post6 < 50);havoc #t~post6; {7696#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} is VALID [2022-04-27 12:51:09,518 INFO L290 TraceCheckUtils]: 36: Hoare triple {7696#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7696#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} is VALID [2022-04-27 12:51:09,521 INFO L290 TraceCheckUtils]: 35: Hoare triple {7696#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} assume ~a~0 > ~b~0;~a~0 := ~a~0 - ~b~0;~p~0 := ~p~0 - ~q~0;~r~0 := ~r~0 - ~s~0; {7696#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} is VALID [2022-04-27 12:51:09,522 INFO L290 TraceCheckUtils]: 34: Hoare triple {7696#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} assume !!(~a~0 != ~b~0); {7696#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} is VALID [2022-04-27 12:51:09,522 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {7497#true} {7696#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} #72#return; {7696#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} is VALID [2022-04-27 12:51:09,523 INFO L290 TraceCheckUtils]: 32: Hoare triple {7497#true} assume true; {7497#true} is VALID [2022-04-27 12:51:09,523 INFO L290 TraceCheckUtils]: 31: Hoare triple {7497#true} assume !(0 == ~cond); {7497#true} is VALID [2022-04-27 12:51:09,523 INFO L290 TraceCheckUtils]: 30: Hoare triple {7497#true} ~cond := #in~cond; {7497#true} is VALID [2022-04-27 12:51:09,523 INFO L272 TraceCheckUtils]: 29: Hoare triple {7696#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {7497#true} is VALID [2022-04-27 12:51:09,524 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {7497#true} {7696#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} #70#return; {7696#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} is VALID [2022-04-27 12:51:09,524 INFO L290 TraceCheckUtils]: 27: Hoare triple {7497#true} assume true; {7497#true} is VALID [2022-04-27 12:51:09,524 INFO L290 TraceCheckUtils]: 26: Hoare triple {7497#true} assume !(0 == ~cond); {7497#true} is VALID [2022-04-27 12:51:09,524 INFO L290 TraceCheckUtils]: 25: Hoare triple {7497#true} ~cond := #in~cond; {7497#true} is VALID [2022-04-27 12:51:09,524 INFO L272 TraceCheckUtils]: 24: Hoare triple {7696#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {7497#true} is VALID [2022-04-27 12:51:09,524 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {7497#true} {7696#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} #68#return; {7696#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} is VALID [2022-04-27 12:51:09,525 INFO L290 TraceCheckUtils]: 22: Hoare triple {7497#true} assume true; {7497#true} is VALID [2022-04-27 12:51:09,525 INFO L290 TraceCheckUtils]: 21: Hoare triple {7497#true} assume !(0 == ~cond); {7497#true} is VALID [2022-04-27 12:51:09,525 INFO L290 TraceCheckUtils]: 20: Hoare triple {7497#true} ~cond := #in~cond; {7497#true} is VALID [2022-04-27 12:51:09,525 INFO L272 TraceCheckUtils]: 19: Hoare triple {7696#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {7497#true} is VALID [2022-04-27 12:51:09,525 INFO L290 TraceCheckUtils]: 18: Hoare triple {7696#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} assume !!(#t~post6 < 50);havoc #t~post6; {7696#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} is VALID [2022-04-27 12:51:09,526 INFO L290 TraceCheckUtils]: 17: Hoare triple {7696#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7696#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} is VALID [2022-04-27 12:51:09,526 INFO L290 TraceCheckUtils]: 16: Hoare triple {7497#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {7696#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} is VALID [2022-04-27 12:51:09,526 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {7497#true} {7497#true} #66#return; {7497#true} is VALID [2022-04-27 12:51:09,526 INFO L290 TraceCheckUtils]: 14: Hoare triple {7497#true} assume true; {7497#true} is VALID [2022-04-27 12:51:09,526 INFO L290 TraceCheckUtils]: 13: Hoare triple {7497#true} assume !(0 == ~cond); {7497#true} is VALID [2022-04-27 12:51:09,527 INFO L290 TraceCheckUtils]: 12: Hoare triple {7497#true} ~cond := #in~cond; {7497#true} is VALID [2022-04-27 12:51:09,527 INFO L272 TraceCheckUtils]: 11: Hoare triple {7497#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {7497#true} is VALID [2022-04-27 12:51:09,527 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7497#true} {7497#true} #64#return; {7497#true} is VALID [2022-04-27 12:51:09,527 INFO L290 TraceCheckUtils]: 9: Hoare triple {7497#true} assume true; {7497#true} is VALID [2022-04-27 12:51:09,527 INFO L290 TraceCheckUtils]: 8: Hoare triple {7497#true} assume !(0 == ~cond); {7497#true} is VALID [2022-04-27 12:51:09,527 INFO L290 TraceCheckUtils]: 7: Hoare triple {7497#true} ~cond := #in~cond; {7497#true} is VALID [2022-04-27 12:51:09,527 INFO L272 TraceCheckUtils]: 6: Hoare triple {7497#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {7497#true} is VALID [2022-04-27 12:51:09,527 INFO L290 TraceCheckUtils]: 5: Hoare triple {7497#true} havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~x~0;havoc ~y~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {7497#true} is VALID [2022-04-27 12:51:09,527 INFO L272 TraceCheckUtils]: 4: Hoare triple {7497#true} call #t~ret7 := main(); {7497#true} is VALID [2022-04-27 12:51:09,527 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7497#true} {7497#true} #82#return; {7497#true} is VALID [2022-04-27 12:51:09,527 INFO L290 TraceCheckUtils]: 2: Hoare triple {7497#true} assume true; {7497#true} is VALID [2022-04-27 12:51:09,528 INFO L290 TraceCheckUtils]: 1: Hoare triple {7497#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {7497#true} is VALID [2022-04-27 12:51:09,528 INFO L272 TraceCheckUtils]: 0: Hoare triple {7497#true} call ULTIMATE.init(); {7497#true} is VALID [2022-04-27 12:51:09,528 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2022-04-27 12:51:09,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:51:09,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812475402] [2022-04-27 12:51:09,528 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:51:09,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1399090131] [2022-04-27 12:51:09,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1399090131] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-27 12:51:09,528 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-27 12:51:09,529 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2022-04-27 12:51:09,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299049600] [2022-04-27 12:51:09,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:51:09,529 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 61 [2022-04-27 12:51:09,529 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:51:09,530 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-27 12:51:09,559 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:51:09,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 12:51:09,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:51:09,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 12:51:09,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-04-27 12:51:09,560 INFO L87 Difference]: Start difference. First operand 210 states and 240 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-27 12:51:09,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:51:09,783 INFO L93 Difference]: Finished difference Result 216 states and 245 transitions. [2022-04-27 12:51:09,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 12:51:09,784 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 61 [2022-04-27 12:51:09,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:51:09,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-27 12:51:09,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 42 transitions. [2022-04-27 12:51:09,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-27 12:51:09,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 42 transitions. [2022-04-27 12:51:09,786 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 42 transitions. [2022-04-27 12:51:09,825 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:51:09,829 INFO L225 Difference]: With dead ends: 216 [2022-04-27 12:51:09,829 INFO L226 Difference]: Without dead ends: 192 [2022-04-27 12:51:09,830 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 112 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-04-27 12:51:09,830 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 7 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 12:51:09,831 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 101 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 12:51:09,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2022-04-27 12:51:09,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 189. [2022-04-27 12:51:09,894 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:51:09,895 INFO L82 GeneralOperation]: Start isEquivalent. First operand 192 states. Second operand has 189 states, 125 states have (on average 1.112) internal successors, (139), 129 states have internal predecessors, (139), 38 states have call successors, (38), 26 states have call predecessors, (38), 25 states have return successors, (35), 33 states have call predecessors, (35), 35 states have call successors, (35) [2022-04-27 12:51:09,895 INFO L74 IsIncluded]: Start isIncluded. First operand 192 states. Second operand has 189 states, 125 states have (on average 1.112) internal successors, (139), 129 states have internal predecessors, (139), 38 states have call successors, (38), 26 states have call predecessors, (38), 25 states have return successors, (35), 33 states have call predecessors, (35), 35 states have call successors, (35) [2022-04-27 12:51:09,895 INFO L87 Difference]: Start difference. First operand 192 states. Second operand has 189 states, 125 states have (on average 1.112) internal successors, (139), 129 states have internal predecessors, (139), 38 states have call successors, (38), 26 states have call predecessors, (38), 25 states have return successors, (35), 33 states have call predecessors, (35), 35 states have call successors, (35) [2022-04-27 12:51:09,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:51:09,900 INFO L93 Difference]: Finished difference Result 192 states and 216 transitions. [2022-04-27 12:51:09,900 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 216 transitions. [2022-04-27 12:51:09,901 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:51:09,901 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:51:09,901 INFO L74 IsIncluded]: Start isIncluded. First operand has 189 states, 125 states have (on average 1.112) internal successors, (139), 129 states have internal predecessors, (139), 38 states have call successors, (38), 26 states have call predecessors, (38), 25 states have return successors, (35), 33 states have call predecessors, (35), 35 states have call successors, (35) Second operand 192 states. [2022-04-27 12:51:09,902 INFO L87 Difference]: Start difference. First operand has 189 states, 125 states have (on average 1.112) internal successors, (139), 129 states have internal predecessors, (139), 38 states have call successors, (38), 26 states have call predecessors, (38), 25 states have return successors, (35), 33 states have call predecessors, (35), 35 states have call successors, (35) Second operand 192 states. [2022-04-27 12:51:09,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:51:09,906 INFO L93 Difference]: Finished difference Result 192 states and 216 transitions. [2022-04-27 12:51:09,906 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 216 transitions. [2022-04-27 12:51:09,906 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:51:09,907 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:51:09,907 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:51:09,907 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:51:09,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 125 states have (on average 1.112) internal successors, (139), 129 states have internal predecessors, (139), 38 states have call successors, (38), 26 states have call predecessors, (38), 25 states have return successors, (35), 33 states have call predecessors, (35), 35 states have call successors, (35) [2022-04-27 12:51:09,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 212 transitions. [2022-04-27 12:51:09,911 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 212 transitions. Word has length 61 [2022-04-27 12:51:09,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:51:09,912 INFO L495 AbstractCegarLoop]: Abstraction has 189 states and 212 transitions. [2022-04-27 12:51:09,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-27 12:51:09,912 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 212 transitions. [2022-04-27 12:51:09,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-04-27 12:51:09,913 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:51:09,913 INFO L195 NwaCegarLoop]: trace histogram [13, 12, 12, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:51:09,941 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-04-27 12:51:10,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:51:10,136 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:51:10,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:51:10,136 INFO L85 PathProgramCache]: Analyzing trace with hash -1449122399, now seen corresponding path program 2 times [2022-04-27 12:51:10,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:51:10,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989946270] [2022-04-27 12:51:10,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:51:10,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:51:10,150 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:51:10,150 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [780484437] [2022-04-27 12:51:10,150 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 12:51:10,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:51:10,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:51:10,152 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) [2022-04-27 12:51:10,162 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-04-27 12:51:10,229 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 12:51:10,229 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 12:51:10,230 INFO L263 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-27 12:51:10,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:51:10,250 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:51:10,677 INFO L272 TraceCheckUtils]: 0: Hoare triple {8832#true} call ULTIMATE.init(); {8832#true} is VALID [2022-04-27 12:51:10,678 INFO L290 TraceCheckUtils]: 1: Hoare triple {8832#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {8840#(<= ~counter~0 0)} is VALID [2022-04-27 12:51:10,678 INFO L290 TraceCheckUtils]: 2: Hoare triple {8840#(<= ~counter~0 0)} assume true; {8840#(<= ~counter~0 0)} is VALID [2022-04-27 12:51:10,679 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8840#(<= ~counter~0 0)} {8832#true} #82#return; {8840#(<= ~counter~0 0)} is VALID [2022-04-27 12:51:10,679 INFO L272 TraceCheckUtils]: 4: Hoare triple {8840#(<= ~counter~0 0)} call #t~ret7 := main(); {8840#(<= ~counter~0 0)} is VALID [2022-04-27 12:51:10,679 INFO L290 TraceCheckUtils]: 5: Hoare triple {8840#(<= ~counter~0 0)} havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~x~0;havoc ~y~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {8840#(<= ~counter~0 0)} is VALID [2022-04-27 12:51:10,680 INFO L272 TraceCheckUtils]: 6: Hoare triple {8840#(<= ~counter~0 0)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {8840#(<= ~counter~0 0)} is VALID [2022-04-27 12:51:10,680 INFO L290 TraceCheckUtils]: 7: Hoare triple {8840#(<= ~counter~0 0)} ~cond := #in~cond; {8840#(<= ~counter~0 0)} is VALID [2022-04-27 12:51:10,680 INFO L290 TraceCheckUtils]: 8: Hoare triple {8840#(<= ~counter~0 0)} assume !(0 == ~cond); {8840#(<= ~counter~0 0)} is VALID [2022-04-27 12:51:10,681 INFO L290 TraceCheckUtils]: 9: Hoare triple {8840#(<= ~counter~0 0)} assume true; {8840#(<= ~counter~0 0)} is VALID [2022-04-27 12:51:10,681 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8840#(<= ~counter~0 0)} {8840#(<= ~counter~0 0)} #64#return; {8840#(<= ~counter~0 0)} is VALID [2022-04-27 12:51:10,682 INFO L272 TraceCheckUtils]: 11: Hoare triple {8840#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {8840#(<= ~counter~0 0)} is VALID [2022-04-27 12:51:10,682 INFO L290 TraceCheckUtils]: 12: Hoare triple {8840#(<= ~counter~0 0)} ~cond := #in~cond; {8840#(<= ~counter~0 0)} is VALID [2022-04-27 12:51:10,682 INFO L290 TraceCheckUtils]: 13: Hoare triple {8840#(<= ~counter~0 0)} assume !(0 == ~cond); {8840#(<= ~counter~0 0)} is VALID [2022-04-27 12:51:10,683 INFO L290 TraceCheckUtils]: 14: Hoare triple {8840#(<= ~counter~0 0)} assume true; {8840#(<= ~counter~0 0)} is VALID [2022-04-27 12:51:10,683 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {8840#(<= ~counter~0 0)} {8840#(<= ~counter~0 0)} #66#return; {8840#(<= ~counter~0 0)} is VALID [2022-04-27 12:51:10,684 INFO L290 TraceCheckUtils]: 16: Hoare triple {8840#(<= ~counter~0 0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {8840#(<= ~counter~0 0)} is VALID [2022-04-27 12:51:10,684 INFO L290 TraceCheckUtils]: 17: Hoare triple {8840#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8889#(<= ~counter~0 1)} is VALID [2022-04-27 12:51:10,684 INFO L290 TraceCheckUtils]: 18: Hoare triple {8889#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {8889#(<= ~counter~0 1)} is VALID [2022-04-27 12:51:10,685 INFO L272 TraceCheckUtils]: 19: Hoare triple {8889#(<= ~counter~0 1)} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {8889#(<= ~counter~0 1)} is VALID [2022-04-27 12:51:10,685 INFO L290 TraceCheckUtils]: 20: Hoare triple {8889#(<= ~counter~0 1)} ~cond := #in~cond; {8889#(<= ~counter~0 1)} is VALID [2022-04-27 12:51:10,686 INFO L290 TraceCheckUtils]: 21: Hoare triple {8889#(<= ~counter~0 1)} assume !(0 == ~cond); {8889#(<= ~counter~0 1)} is VALID [2022-04-27 12:51:10,686 INFO L290 TraceCheckUtils]: 22: Hoare triple {8889#(<= ~counter~0 1)} assume true; {8889#(<= ~counter~0 1)} is VALID [2022-04-27 12:51:10,687 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {8889#(<= ~counter~0 1)} {8889#(<= ~counter~0 1)} #68#return; {8889#(<= ~counter~0 1)} is VALID [2022-04-27 12:51:10,687 INFO L272 TraceCheckUtils]: 24: Hoare triple {8889#(<= ~counter~0 1)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {8889#(<= ~counter~0 1)} is VALID [2022-04-27 12:51:10,688 INFO L290 TraceCheckUtils]: 25: Hoare triple {8889#(<= ~counter~0 1)} ~cond := #in~cond; {8889#(<= ~counter~0 1)} is VALID [2022-04-27 12:51:10,688 INFO L290 TraceCheckUtils]: 26: Hoare triple {8889#(<= ~counter~0 1)} assume !(0 == ~cond); {8889#(<= ~counter~0 1)} is VALID [2022-04-27 12:51:10,688 INFO L290 TraceCheckUtils]: 27: Hoare triple {8889#(<= ~counter~0 1)} assume true; {8889#(<= ~counter~0 1)} is VALID [2022-04-27 12:51:10,689 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {8889#(<= ~counter~0 1)} {8889#(<= ~counter~0 1)} #70#return; {8889#(<= ~counter~0 1)} is VALID [2022-04-27 12:51:10,690 INFO L272 TraceCheckUtils]: 29: Hoare triple {8889#(<= ~counter~0 1)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {8889#(<= ~counter~0 1)} is VALID [2022-04-27 12:51:10,690 INFO L290 TraceCheckUtils]: 30: Hoare triple {8889#(<= ~counter~0 1)} ~cond := #in~cond; {8889#(<= ~counter~0 1)} is VALID [2022-04-27 12:51:10,690 INFO L290 TraceCheckUtils]: 31: Hoare triple {8889#(<= ~counter~0 1)} assume !(0 == ~cond); {8889#(<= ~counter~0 1)} is VALID [2022-04-27 12:51:10,691 INFO L290 TraceCheckUtils]: 32: Hoare triple {8889#(<= ~counter~0 1)} assume true; {8889#(<= ~counter~0 1)} is VALID [2022-04-27 12:51:10,691 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {8889#(<= ~counter~0 1)} {8889#(<= ~counter~0 1)} #72#return; {8889#(<= ~counter~0 1)} is VALID [2022-04-27 12:51:10,692 INFO L290 TraceCheckUtils]: 34: Hoare triple {8889#(<= ~counter~0 1)} assume !!(~a~0 != ~b~0); {8889#(<= ~counter~0 1)} is VALID [2022-04-27 12:51:10,692 INFO L290 TraceCheckUtils]: 35: Hoare triple {8889#(<= ~counter~0 1)} assume ~a~0 > ~b~0;~a~0 := ~a~0 - ~b~0;~p~0 := ~p~0 - ~q~0;~r~0 := ~r~0 - ~s~0; {8889#(<= ~counter~0 1)} is VALID [2022-04-27 12:51:10,693 INFO L290 TraceCheckUtils]: 36: Hoare triple {8889#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8947#(<= ~counter~0 2)} is VALID [2022-04-27 12:51:10,693 INFO L290 TraceCheckUtils]: 37: Hoare triple {8947#(<= ~counter~0 2)} assume !!(#t~post6 < 50);havoc #t~post6; {8947#(<= ~counter~0 2)} is VALID [2022-04-27 12:51:10,694 INFO L272 TraceCheckUtils]: 38: Hoare triple {8947#(<= ~counter~0 2)} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {8947#(<= ~counter~0 2)} is VALID [2022-04-27 12:51:10,694 INFO L290 TraceCheckUtils]: 39: Hoare triple {8947#(<= ~counter~0 2)} ~cond := #in~cond; {8947#(<= ~counter~0 2)} is VALID [2022-04-27 12:51:10,695 INFO L290 TraceCheckUtils]: 40: Hoare triple {8947#(<= ~counter~0 2)} assume !(0 == ~cond); {8947#(<= ~counter~0 2)} is VALID [2022-04-27 12:51:10,695 INFO L290 TraceCheckUtils]: 41: Hoare triple {8947#(<= ~counter~0 2)} assume true; {8947#(<= ~counter~0 2)} is VALID [2022-04-27 12:51:10,696 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {8947#(<= ~counter~0 2)} {8947#(<= ~counter~0 2)} #68#return; {8947#(<= ~counter~0 2)} is VALID [2022-04-27 12:51:10,697 INFO L272 TraceCheckUtils]: 43: Hoare triple {8947#(<= ~counter~0 2)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {8947#(<= ~counter~0 2)} is VALID [2022-04-27 12:51:10,697 INFO L290 TraceCheckUtils]: 44: Hoare triple {8947#(<= ~counter~0 2)} ~cond := #in~cond; {8947#(<= ~counter~0 2)} is VALID [2022-04-27 12:51:10,697 INFO L290 TraceCheckUtils]: 45: Hoare triple {8947#(<= ~counter~0 2)} assume !(0 == ~cond); {8947#(<= ~counter~0 2)} is VALID [2022-04-27 12:51:10,698 INFO L290 TraceCheckUtils]: 46: Hoare triple {8947#(<= ~counter~0 2)} assume true; {8947#(<= ~counter~0 2)} is VALID [2022-04-27 12:51:10,699 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {8947#(<= ~counter~0 2)} {8947#(<= ~counter~0 2)} #70#return; {8947#(<= ~counter~0 2)} is VALID [2022-04-27 12:51:10,699 INFO L272 TraceCheckUtils]: 48: Hoare triple {8947#(<= ~counter~0 2)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {8947#(<= ~counter~0 2)} is VALID [2022-04-27 12:51:10,712 INFO L290 TraceCheckUtils]: 49: Hoare triple {8947#(<= ~counter~0 2)} ~cond := #in~cond; {8947#(<= ~counter~0 2)} is VALID [2022-04-27 12:51:10,713 INFO L290 TraceCheckUtils]: 50: Hoare triple {8947#(<= ~counter~0 2)} assume !(0 == ~cond); {8947#(<= ~counter~0 2)} is VALID [2022-04-27 12:51:10,714 INFO L290 TraceCheckUtils]: 51: Hoare triple {8947#(<= ~counter~0 2)} assume true; {8947#(<= ~counter~0 2)} is VALID [2022-04-27 12:51:10,716 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {8947#(<= ~counter~0 2)} {8947#(<= ~counter~0 2)} #72#return; {8947#(<= ~counter~0 2)} is VALID [2022-04-27 12:51:10,716 INFO L290 TraceCheckUtils]: 53: Hoare triple {8947#(<= ~counter~0 2)} assume !!(~a~0 != ~b~0); {8947#(<= ~counter~0 2)} is VALID [2022-04-27 12:51:10,717 INFO L290 TraceCheckUtils]: 54: Hoare triple {8947#(<= ~counter~0 2)} assume ~a~0 > ~b~0;~a~0 := ~a~0 - ~b~0;~p~0 := ~p~0 - ~q~0;~r~0 := ~r~0 - ~s~0; {8947#(<= ~counter~0 2)} is VALID [2022-04-27 12:51:10,717 INFO L290 TraceCheckUtils]: 55: Hoare triple {8947#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9005#(<= ~counter~0 3)} is VALID [2022-04-27 12:51:10,718 INFO L290 TraceCheckUtils]: 56: Hoare triple {9005#(<= ~counter~0 3)} assume !!(#t~post6 < 50);havoc #t~post6; {9005#(<= ~counter~0 3)} is VALID [2022-04-27 12:51:10,719 INFO L272 TraceCheckUtils]: 57: Hoare triple {9005#(<= ~counter~0 3)} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {9005#(<= ~counter~0 3)} is VALID [2022-04-27 12:51:10,719 INFO L290 TraceCheckUtils]: 58: Hoare triple {9005#(<= ~counter~0 3)} ~cond := #in~cond; {9005#(<= ~counter~0 3)} is VALID [2022-04-27 12:51:10,720 INFO L290 TraceCheckUtils]: 59: Hoare triple {9005#(<= ~counter~0 3)} assume !(0 == ~cond); {9005#(<= ~counter~0 3)} is VALID [2022-04-27 12:51:10,720 INFO L290 TraceCheckUtils]: 60: Hoare triple {9005#(<= ~counter~0 3)} assume true; {9005#(<= ~counter~0 3)} is VALID [2022-04-27 12:51:10,721 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {9005#(<= ~counter~0 3)} {9005#(<= ~counter~0 3)} #68#return; {9005#(<= ~counter~0 3)} is VALID [2022-04-27 12:51:10,721 INFO L272 TraceCheckUtils]: 62: Hoare triple {9005#(<= ~counter~0 3)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {9005#(<= ~counter~0 3)} is VALID [2022-04-27 12:51:10,722 INFO L290 TraceCheckUtils]: 63: Hoare triple {9005#(<= ~counter~0 3)} ~cond := #in~cond; {9005#(<= ~counter~0 3)} is VALID [2022-04-27 12:51:10,722 INFO L290 TraceCheckUtils]: 64: Hoare triple {9005#(<= ~counter~0 3)} assume !(0 == ~cond); {9005#(<= ~counter~0 3)} is VALID [2022-04-27 12:51:10,722 INFO L290 TraceCheckUtils]: 65: Hoare triple {9005#(<= ~counter~0 3)} assume true; {9005#(<= ~counter~0 3)} is VALID [2022-04-27 12:51:10,723 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {9005#(<= ~counter~0 3)} {9005#(<= ~counter~0 3)} #70#return; {9005#(<= ~counter~0 3)} is VALID [2022-04-27 12:51:10,724 INFO L272 TraceCheckUtils]: 67: Hoare triple {9005#(<= ~counter~0 3)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {9005#(<= ~counter~0 3)} is VALID [2022-04-27 12:51:10,724 INFO L290 TraceCheckUtils]: 68: Hoare triple {9005#(<= ~counter~0 3)} ~cond := #in~cond; {9005#(<= ~counter~0 3)} is VALID [2022-04-27 12:51:10,724 INFO L290 TraceCheckUtils]: 69: Hoare triple {9005#(<= ~counter~0 3)} assume !(0 == ~cond); {9005#(<= ~counter~0 3)} is VALID [2022-04-27 12:51:10,725 INFO L290 TraceCheckUtils]: 70: Hoare triple {9005#(<= ~counter~0 3)} assume true; {9005#(<= ~counter~0 3)} is VALID [2022-04-27 12:51:10,725 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {9005#(<= ~counter~0 3)} {9005#(<= ~counter~0 3)} #72#return; {9005#(<= ~counter~0 3)} is VALID [2022-04-27 12:51:10,726 INFO L290 TraceCheckUtils]: 72: Hoare triple {9005#(<= ~counter~0 3)} assume !!(~a~0 != ~b~0); {9005#(<= ~counter~0 3)} is VALID [2022-04-27 12:51:10,726 INFO L290 TraceCheckUtils]: 73: Hoare triple {9005#(<= ~counter~0 3)} assume ~a~0 > ~b~0;~a~0 := ~a~0 - ~b~0;~p~0 := ~p~0 - ~q~0;~r~0 := ~r~0 - ~s~0; {9005#(<= ~counter~0 3)} is VALID [2022-04-27 12:51:10,727 INFO L290 TraceCheckUtils]: 74: Hoare triple {9005#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9063#(<= ~counter~0 4)} is VALID [2022-04-27 12:51:10,727 INFO L290 TraceCheckUtils]: 75: Hoare triple {9063#(<= ~counter~0 4)} assume !!(#t~post6 < 50);havoc #t~post6; {9063#(<= ~counter~0 4)} is VALID [2022-04-27 12:51:10,728 INFO L272 TraceCheckUtils]: 76: Hoare triple {9063#(<= ~counter~0 4)} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {9063#(<= ~counter~0 4)} is VALID [2022-04-27 12:51:10,728 INFO L290 TraceCheckUtils]: 77: Hoare triple {9063#(<= ~counter~0 4)} ~cond := #in~cond; {9063#(<= ~counter~0 4)} is VALID [2022-04-27 12:51:10,728 INFO L290 TraceCheckUtils]: 78: Hoare triple {9063#(<= ~counter~0 4)} assume !(0 == ~cond); {9063#(<= ~counter~0 4)} is VALID [2022-04-27 12:51:10,729 INFO L290 TraceCheckUtils]: 79: Hoare triple {9063#(<= ~counter~0 4)} assume true; {9063#(<= ~counter~0 4)} is VALID [2022-04-27 12:51:10,729 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {9063#(<= ~counter~0 4)} {9063#(<= ~counter~0 4)} #68#return; {9063#(<= ~counter~0 4)} is VALID [2022-04-27 12:51:10,730 INFO L272 TraceCheckUtils]: 81: Hoare triple {9063#(<= ~counter~0 4)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {9063#(<= ~counter~0 4)} is VALID [2022-04-27 12:51:10,730 INFO L290 TraceCheckUtils]: 82: Hoare triple {9063#(<= ~counter~0 4)} ~cond := #in~cond; {9063#(<= ~counter~0 4)} is VALID [2022-04-27 12:51:10,731 INFO L290 TraceCheckUtils]: 83: Hoare triple {9063#(<= ~counter~0 4)} assume !(0 == ~cond); {9063#(<= ~counter~0 4)} is VALID [2022-04-27 12:51:10,731 INFO L290 TraceCheckUtils]: 84: Hoare triple {9063#(<= ~counter~0 4)} assume true; {9063#(<= ~counter~0 4)} is VALID [2022-04-27 12:51:10,732 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {9063#(<= ~counter~0 4)} {9063#(<= ~counter~0 4)} #70#return; {9063#(<= ~counter~0 4)} is VALID [2022-04-27 12:51:10,732 INFO L272 TraceCheckUtils]: 86: Hoare triple {9063#(<= ~counter~0 4)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {9063#(<= ~counter~0 4)} is VALID [2022-04-27 12:51:10,733 INFO L290 TraceCheckUtils]: 87: Hoare triple {9063#(<= ~counter~0 4)} ~cond := #in~cond; {9063#(<= ~counter~0 4)} is VALID [2022-04-27 12:51:10,733 INFO L290 TraceCheckUtils]: 88: Hoare triple {9063#(<= ~counter~0 4)} assume !(0 == ~cond); {9063#(<= ~counter~0 4)} is VALID [2022-04-27 12:51:10,733 INFO L290 TraceCheckUtils]: 89: Hoare triple {9063#(<= ~counter~0 4)} assume true; {9063#(<= ~counter~0 4)} is VALID [2022-04-27 12:51:10,734 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {9063#(<= ~counter~0 4)} {9063#(<= ~counter~0 4)} #72#return; {9063#(<= ~counter~0 4)} is VALID [2022-04-27 12:51:10,734 INFO L290 TraceCheckUtils]: 91: Hoare triple {9063#(<= ~counter~0 4)} assume !!(~a~0 != ~b~0); {9063#(<= ~counter~0 4)} is VALID [2022-04-27 12:51:10,735 INFO L290 TraceCheckUtils]: 92: Hoare triple {9063#(<= ~counter~0 4)} assume ~a~0 > ~b~0;~a~0 := ~a~0 - ~b~0;~p~0 := ~p~0 - ~q~0;~r~0 := ~r~0 - ~s~0; {9063#(<= ~counter~0 4)} is VALID [2022-04-27 12:51:10,735 INFO L290 TraceCheckUtils]: 93: Hoare triple {9063#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9121#(<= |main_#t~post6| 4)} is VALID [2022-04-27 12:51:10,736 INFO L290 TraceCheckUtils]: 94: Hoare triple {9121#(<= |main_#t~post6| 4)} assume !(#t~post6 < 50);havoc #t~post6; {8833#false} is VALID [2022-04-27 12:51:10,736 INFO L272 TraceCheckUtils]: 95: Hoare triple {8833#false} call __VERIFIER_assert((if 0 == ~a~0 - ~b~0 then 1 else 0)); {8833#false} is VALID [2022-04-27 12:51:10,736 INFO L290 TraceCheckUtils]: 96: Hoare triple {8833#false} ~cond := #in~cond; {8833#false} is VALID [2022-04-27 12:51:10,736 INFO L290 TraceCheckUtils]: 97: Hoare triple {8833#false} assume 0 == ~cond; {8833#false} is VALID [2022-04-27 12:51:10,736 INFO L290 TraceCheckUtils]: 98: Hoare triple {8833#false} assume !false; {8833#false} is VALID [2022-04-27 12:51:10,737 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 24 proven. 266 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2022-04-27 12:51:10,737 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:51:11,251 INFO L290 TraceCheckUtils]: 98: Hoare triple {8833#false} assume !false; {8833#false} is VALID [2022-04-27 12:51:11,251 INFO L290 TraceCheckUtils]: 97: Hoare triple {8833#false} assume 0 == ~cond; {8833#false} is VALID [2022-04-27 12:51:11,251 INFO L290 TraceCheckUtils]: 96: Hoare triple {8833#false} ~cond := #in~cond; {8833#false} is VALID [2022-04-27 12:51:11,251 INFO L272 TraceCheckUtils]: 95: Hoare triple {8833#false} call __VERIFIER_assert((if 0 == ~a~0 - ~b~0 then 1 else 0)); {8833#false} is VALID [2022-04-27 12:51:11,252 INFO L290 TraceCheckUtils]: 94: Hoare triple {9149#(< |main_#t~post6| 50)} assume !(#t~post6 < 50);havoc #t~post6; {8833#false} is VALID [2022-04-27 12:51:11,252 INFO L290 TraceCheckUtils]: 93: Hoare triple {9153#(< ~counter~0 50)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9149#(< |main_#t~post6| 50)} is VALID [2022-04-27 12:51:11,255 INFO L290 TraceCheckUtils]: 92: Hoare triple {9153#(< ~counter~0 50)} assume ~a~0 > ~b~0;~a~0 := ~a~0 - ~b~0;~p~0 := ~p~0 - ~q~0;~r~0 := ~r~0 - ~s~0; {9153#(< ~counter~0 50)} is VALID [2022-04-27 12:51:11,255 INFO L290 TraceCheckUtils]: 91: Hoare triple {9153#(< ~counter~0 50)} assume !!(~a~0 != ~b~0); {9153#(< ~counter~0 50)} is VALID [2022-04-27 12:51:11,256 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {8832#true} {9153#(< ~counter~0 50)} #72#return; {9153#(< ~counter~0 50)} is VALID [2022-04-27 12:51:11,256 INFO L290 TraceCheckUtils]: 89: Hoare triple {8832#true} assume true; {8832#true} is VALID [2022-04-27 12:51:11,256 INFO L290 TraceCheckUtils]: 88: Hoare triple {8832#true} assume !(0 == ~cond); {8832#true} is VALID [2022-04-27 12:51:11,257 INFO L290 TraceCheckUtils]: 87: Hoare triple {8832#true} ~cond := #in~cond; {8832#true} is VALID [2022-04-27 12:51:11,257 INFO L272 TraceCheckUtils]: 86: Hoare triple {9153#(< ~counter~0 50)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {8832#true} is VALID [2022-04-27 12:51:11,257 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {8832#true} {9153#(< ~counter~0 50)} #70#return; {9153#(< ~counter~0 50)} is VALID [2022-04-27 12:51:11,258 INFO L290 TraceCheckUtils]: 84: Hoare triple {8832#true} assume true; {8832#true} is VALID [2022-04-27 12:51:11,258 INFO L290 TraceCheckUtils]: 83: Hoare triple {8832#true} assume !(0 == ~cond); {8832#true} is VALID [2022-04-27 12:51:11,258 INFO L290 TraceCheckUtils]: 82: Hoare triple {8832#true} ~cond := #in~cond; {8832#true} is VALID [2022-04-27 12:51:11,258 INFO L272 TraceCheckUtils]: 81: Hoare triple {9153#(< ~counter~0 50)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {8832#true} is VALID [2022-04-27 12:51:11,259 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {8832#true} {9153#(< ~counter~0 50)} #68#return; {9153#(< ~counter~0 50)} is VALID [2022-04-27 12:51:11,259 INFO L290 TraceCheckUtils]: 79: Hoare triple {8832#true} assume true; {8832#true} is VALID [2022-04-27 12:51:11,259 INFO L290 TraceCheckUtils]: 78: Hoare triple {8832#true} assume !(0 == ~cond); {8832#true} is VALID [2022-04-27 12:51:11,259 INFO L290 TraceCheckUtils]: 77: Hoare triple {8832#true} ~cond := #in~cond; {8832#true} is VALID [2022-04-27 12:51:11,259 INFO L272 TraceCheckUtils]: 76: Hoare triple {9153#(< ~counter~0 50)} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {8832#true} is VALID [2022-04-27 12:51:11,259 INFO L290 TraceCheckUtils]: 75: Hoare triple {9153#(< ~counter~0 50)} assume !!(#t~post6 < 50);havoc #t~post6; {9153#(< ~counter~0 50)} is VALID [2022-04-27 12:51:11,260 INFO L290 TraceCheckUtils]: 74: Hoare triple {9211#(< ~counter~0 49)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9153#(< ~counter~0 50)} is VALID [2022-04-27 12:51:11,260 INFO L290 TraceCheckUtils]: 73: Hoare triple {9211#(< ~counter~0 49)} assume ~a~0 > ~b~0;~a~0 := ~a~0 - ~b~0;~p~0 := ~p~0 - ~q~0;~r~0 := ~r~0 - ~s~0; {9211#(< ~counter~0 49)} is VALID [2022-04-27 12:51:11,261 INFO L290 TraceCheckUtils]: 72: Hoare triple {9211#(< ~counter~0 49)} assume !!(~a~0 != ~b~0); {9211#(< ~counter~0 49)} is VALID [2022-04-27 12:51:11,261 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {8832#true} {9211#(< ~counter~0 49)} #72#return; {9211#(< ~counter~0 49)} is VALID [2022-04-27 12:51:11,262 INFO L290 TraceCheckUtils]: 70: Hoare triple {8832#true} assume true; {8832#true} is VALID [2022-04-27 12:51:11,262 INFO L290 TraceCheckUtils]: 69: Hoare triple {8832#true} assume !(0 == ~cond); {8832#true} is VALID [2022-04-27 12:51:11,262 INFO L290 TraceCheckUtils]: 68: Hoare triple {8832#true} ~cond := #in~cond; {8832#true} is VALID [2022-04-27 12:51:11,262 INFO L272 TraceCheckUtils]: 67: Hoare triple {9211#(< ~counter~0 49)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {8832#true} is VALID [2022-04-27 12:51:11,263 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {8832#true} {9211#(< ~counter~0 49)} #70#return; {9211#(< ~counter~0 49)} is VALID [2022-04-27 12:51:11,263 INFO L290 TraceCheckUtils]: 65: Hoare triple {8832#true} assume true; {8832#true} is VALID [2022-04-27 12:51:11,263 INFO L290 TraceCheckUtils]: 64: Hoare triple {8832#true} assume !(0 == ~cond); {8832#true} is VALID [2022-04-27 12:51:11,263 INFO L290 TraceCheckUtils]: 63: Hoare triple {8832#true} ~cond := #in~cond; {8832#true} is VALID [2022-04-27 12:51:11,263 INFO L272 TraceCheckUtils]: 62: Hoare triple {9211#(< ~counter~0 49)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {8832#true} is VALID [2022-04-27 12:51:11,264 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {8832#true} {9211#(< ~counter~0 49)} #68#return; {9211#(< ~counter~0 49)} is VALID [2022-04-27 12:51:11,264 INFO L290 TraceCheckUtils]: 60: Hoare triple {8832#true} assume true; {8832#true} is VALID [2022-04-27 12:51:11,264 INFO L290 TraceCheckUtils]: 59: Hoare triple {8832#true} assume !(0 == ~cond); {8832#true} is VALID [2022-04-27 12:51:11,264 INFO L290 TraceCheckUtils]: 58: Hoare triple {8832#true} ~cond := #in~cond; {8832#true} is VALID [2022-04-27 12:51:11,264 INFO L272 TraceCheckUtils]: 57: Hoare triple {9211#(< ~counter~0 49)} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {8832#true} is VALID [2022-04-27 12:51:11,264 INFO L290 TraceCheckUtils]: 56: Hoare triple {9211#(< ~counter~0 49)} assume !!(#t~post6 < 50);havoc #t~post6; {9211#(< ~counter~0 49)} is VALID [2022-04-27 12:51:11,265 INFO L290 TraceCheckUtils]: 55: Hoare triple {9269#(< ~counter~0 48)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9211#(< ~counter~0 49)} is VALID [2022-04-27 12:51:11,265 INFO L290 TraceCheckUtils]: 54: Hoare triple {9269#(< ~counter~0 48)} assume ~a~0 > ~b~0;~a~0 := ~a~0 - ~b~0;~p~0 := ~p~0 - ~q~0;~r~0 := ~r~0 - ~s~0; {9269#(< ~counter~0 48)} is VALID [2022-04-27 12:51:11,266 INFO L290 TraceCheckUtils]: 53: Hoare triple {9269#(< ~counter~0 48)} assume !!(~a~0 != ~b~0); {9269#(< ~counter~0 48)} is VALID [2022-04-27 12:51:11,266 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {8832#true} {9269#(< ~counter~0 48)} #72#return; {9269#(< ~counter~0 48)} is VALID [2022-04-27 12:51:11,267 INFO L290 TraceCheckUtils]: 51: Hoare triple {8832#true} assume true; {8832#true} is VALID [2022-04-27 12:51:11,267 INFO L290 TraceCheckUtils]: 50: Hoare triple {8832#true} assume !(0 == ~cond); {8832#true} is VALID [2022-04-27 12:51:11,267 INFO L290 TraceCheckUtils]: 49: Hoare triple {8832#true} ~cond := #in~cond; {8832#true} is VALID [2022-04-27 12:51:11,267 INFO L272 TraceCheckUtils]: 48: Hoare triple {9269#(< ~counter~0 48)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {8832#true} is VALID [2022-04-27 12:51:11,268 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {8832#true} {9269#(< ~counter~0 48)} #70#return; {9269#(< ~counter~0 48)} is VALID [2022-04-27 12:51:11,268 INFO L290 TraceCheckUtils]: 46: Hoare triple {8832#true} assume true; {8832#true} is VALID [2022-04-27 12:51:11,268 INFO L290 TraceCheckUtils]: 45: Hoare triple {8832#true} assume !(0 == ~cond); {8832#true} is VALID [2022-04-27 12:51:11,268 INFO L290 TraceCheckUtils]: 44: Hoare triple {8832#true} ~cond := #in~cond; {8832#true} is VALID [2022-04-27 12:51:11,268 INFO L272 TraceCheckUtils]: 43: Hoare triple {9269#(< ~counter~0 48)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {8832#true} is VALID [2022-04-27 12:51:11,268 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {8832#true} {9269#(< ~counter~0 48)} #68#return; {9269#(< ~counter~0 48)} is VALID [2022-04-27 12:51:11,269 INFO L290 TraceCheckUtils]: 41: Hoare triple {8832#true} assume true; {8832#true} is VALID [2022-04-27 12:51:11,269 INFO L290 TraceCheckUtils]: 40: Hoare triple {8832#true} assume !(0 == ~cond); {8832#true} is VALID [2022-04-27 12:51:11,269 INFO L290 TraceCheckUtils]: 39: Hoare triple {8832#true} ~cond := #in~cond; {8832#true} is VALID [2022-04-27 12:51:11,269 INFO L272 TraceCheckUtils]: 38: Hoare triple {9269#(< ~counter~0 48)} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {8832#true} is VALID [2022-04-27 12:51:11,269 INFO L290 TraceCheckUtils]: 37: Hoare triple {9269#(< ~counter~0 48)} assume !!(#t~post6 < 50);havoc #t~post6; {9269#(< ~counter~0 48)} is VALID [2022-04-27 12:51:11,270 INFO L290 TraceCheckUtils]: 36: Hoare triple {9327#(< ~counter~0 47)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9269#(< ~counter~0 48)} is VALID [2022-04-27 12:51:11,270 INFO L290 TraceCheckUtils]: 35: Hoare triple {9327#(< ~counter~0 47)} assume ~a~0 > ~b~0;~a~0 := ~a~0 - ~b~0;~p~0 := ~p~0 - ~q~0;~r~0 := ~r~0 - ~s~0; {9327#(< ~counter~0 47)} is VALID [2022-04-27 12:51:11,270 INFO L290 TraceCheckUtils]: 34: Hoare triple {9327#(< ~counter~0 47)} assume !!(~a~0 != ~b~0); {9327#(< ~counter~0 47)} is VALID [2022-04-27 12:51:11,271 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {8832#true} {9327#(< ~counter~0 47)} #72#return; {9327#(< ~counter~0 47)} is VALID [2022-04-27 12:51:11,271 INFO L290 TraceCheckUtils]: 32: Hoare triple {8832#true} assume true; {8832#true} is VALID [2022-04-27 12:51:11,271 INFO L290 TraceCheckUtils]: 31: Hoare triple {8832#true} assume !(0 == ~cond); {8832#true} is VALID [2022-04-27 12:51:11,271 INFO L290 TraceCheckUtils]: 30: Hoare triple {8832#true} ~cond := #in~cond; {8832#true} is VALID [2022-04-27 12:51:11,271 INFO L272 TraceCheckUtils]: 29: Hoare triple {9327#(< ~counter~0 47)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {8832#true} is VALID [2022-04-27 12:51:11,272 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {8832#true} {9327#(< ~counter~0 47)} #70#return; {9327#(< ~counter~0 47)} is VALID [2022-04-27 12:51:11,272 INFO L290 TraceCheckUtils]: 27: Hoare triple {8832#true} assume true; {8832#true} is VALID [2022-04-27 12:51:11,272 INFO L290 TraceCheckUtils]: 26: Hoare triple {8832#true} assume !(0 == ~cond); {8832#true} is VALID [2022-04-27 12:51:11,272 INFO L290 TraceCheckUtils]: 25: Hoare triple {8832#true} ~cond := #in~cond; {8832#true} is VALID [2022-04-27 12:51:11,272 INFO L272 TraceCheckUtils]: 24: Hoare triple {9327#(< ~counter~0 47)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {8832#true} is VALID [2022-04-27 12:51:11,273 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {8832#true} {9327#(< ~counter~0 47)} #68#return; {9327#(< ~counter~0 47)} is VALID [2022-04-27 12:51:11,273 INFO L290 TraceCheckUtils]: 22: Hoare triple {8832#true} assume true; {8832#true} is VALID [2022-04-27 12:51:11,273 INFO L290 TraceCheckUtils]: 21: Hoare triple {8832#true} assume !(0 == ~cond); {8832#true} is VALID [2022-04-27 12:51:11,273 INFO L290 TraceCheckUtils]: 20: Hoare triple {8832#true} ~cond := #in~cond; {8832#true} is VALID [2022-04-27 12:51:11,273 INFO L272 TraceCheckUtils]: 19: Hoare triple {9327#(< ~counter~0 47)} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {8832#true} is VALID [2022-04-27 12:51:11,274 INFO L290 TraceCheckUtils]: 18: Hoare triple {9327#(< ~counter~0 47)} assume !!(#t~post6 < 50);havoc #t~post6; {9327#(< ~counter~0 47)} is VALID [2022-04-27 12:51:11,274 INFO L290 TraceCheckUtils]: 17: Hoare triple {9385#(< ~counter~0 46)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9327#(< ~counter~0 47)} is VALID [2022-04-27 12:51:11,275 INFO L290 TraceCheckUtils]: 16: Hoare triple {9385#(< ~counter~0 46)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {9385#(< ~counter~0 46)} is VALID [2022-04-27 12:51:11,275 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {8832#true} {9385#(< ~counter~0 46)} #66#return; {9385#(< ~counter~0 46)} is VALID [2022-04-27 12:51:11,275 INFO L290 TraceCheckUtils]: 14: Hoare triple {8832#true} assume true; {8832#true} is VALID [2022-04-27 12:51:11,275 INFO L290 TraceCheckUtils]: 13: Hoare triple {8832#true} assume !(0 == ~cond); {8832#true} is VALID [2022-04-27 12:51:11,275 INFO L290 TraceCheckUtils]: 12: Hoare triple {8832#true} ~cond := #in~cond; {8832#true} is VALID [2022-04-27 12:51:11,276 INFO L272 TraceCheckUtils]: 11: Hoare triple {9385#(< ~counter~0 46)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {8832#true} is VALID [2022-04-27 12:51:11,276 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8832#true} {9385#(< ~counter~0 46)} #64#return; {9385#(< ~counter~0 46)} is VALID [2022-04-27 12:51:11,276 INFO L290 TraceCheckUtils]: 9: Hoare triple {8832#true} assume true; {8832#true} is VALID [2022-04-27 12:51:11,276 INFO L290 TraceCheckUtils]: 8: Hoare triple {8832#true} assume !(0 == ~cond); {8832#true} is VALID [2022-04-27 12:51:11,276 INFO L290 TraceCheckUtils]: 7: Hoare triple {8832#true} ~cond := #in~cond; {8832#true} is VALID [2022-04-27 12:51:11,276 INFO L272 TraceCheckUtils]: 6: Hoare triple {9385#(< ~counter~0 46)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {8832#true} is VALID [2022-04-27 12:51:11,277 INFO L290 TraceCheckUtils]: 5: Hoare triple {9385#(< ~counter~0 46)} havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~x~0;havoc ~y~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {9385#(< ~counter~0 46)} is VALID [2022-04-27 12:51:11,277 INFO L272 TraceCheckUtils]: 4: Hoare triple {9385#(< ~counter~0 46)} call #t~ret7 := main(); {9385#(< ~counter~0 46)} is VALID [2022-04-27 12:51:11,277 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9385#(< ~counter~0 46)} {8832#true} #82#return; {9385#(< ~counter~0 46)} is VALID [2022-04-27 12:51:11,278 INFO L290 TraceCheckUtils]: 2: Hoare triple {9385#(< ~counter~0 46)} assume true; {9385#(< ~counter~0 46)} is VALID [2022-04-27 12:51:11,278 INFO L290 TraceCheckUtils]: 1: Hoare triple {8832#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {9385#(< ~counter~0 46)} is VALID [2022-04-27 12:51:11,278 INFO L272 TraceCheckUtils]: 0: Hoare triple {8832#true} call ULTIMATE.init(); {8832#true} is VALID [2022-04-27 12:51:11,279 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 24 proven. 50 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2022-04-27 12:51:11,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:51:11,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989946270] [2022-04-27 12:51:11,279 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:51:11,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [780484437] [2022-04-27 12:51:11,279 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [780484437] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 12:51:11,279 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 12:51:11,279 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-04-27 12:51:11,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208180040] [2022-04-27 12:51:11,280 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 12:51:11,280 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 states have internal predecessors, (68), 12 states have call successors, (32), 8 states have call predecessors, (32), 7 states have return successors, (30), 10 states have call predecessors, (30), 11 states have call successors, (30) Word has length 99 [2022-04-27 12:51:11,281 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:51:11,281 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 states have internal predecessors, (68), 12 states have call successors, (32), 8 states have call predecessors, (32), 7 states have return successors, (30), 10 states have call predecessors, (30), 11 states have call successors, (30) [2022-04-27 12:51:11,377 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 130 edges. 130 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:51:11,377 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-27 12:51:11,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:51:11,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-27 12:51:11,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-27 12:51:11,378 INFO L87 Difference]: Start difference. First operand 189 states and 212 transitions. Second operand has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 states have internal predecessors, (68), 12 states have call successors, (32), 8 states have call predecessors, (32), 7 states have return successors, (30), 10 states have call predecessors, (30), 11 states have call successors, (30) [2022-04-27 12:51:12,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:51:12,159 INFO L93 Difference]: Finished difference Result 516 states and 605 transitions. [2022-04-27 12:51:12,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-27 12:51:12,160 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 states have internal predecessors, (68), 12 states have call successors, (32), 8 states have call predecessors, (32), 7 states have return successors, (30), 10 states have call predecessors, (30), 11 states have call successors, (30) Word has length 99 [2022-04-27 12:51:12,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:51:12,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 states have internal predecessors, (68), 12 states have call successors, (32), 8 states have call predecessors, (32), 7 states have return successors, (30), 10 states have call predecessors, (30), 11 states have call successors, (30) [2022-04-27 12:51:12,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 176 transitions. [2022-04-27 12:51:12,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 states have internal predecessors, (68), 12 states have call successors, (32), 8 states have call predecessors, (32), 7 states have return successors, (30), 10 states have call predecessors, (30), 11 states have call successors, (30) [2022-04-27 12:51:12,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 176 transitions. [2022-04-27 12:51:12,167 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 176 transitions. [2022-04-27 12:51:12,320 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 176 edges. 176 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:51:12,339 INFO L225 Difference]: With dead ends: 516 [2022-04-27 12:51:12,339 INFO L226 Difference]: Without dead ends: 507 [2022-04-27 12:51:12,339 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=184, Invalid=322, Unknown=0, NotChecked=0, Total=506 [2022-04-27 12:51:12,340 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 88 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 12:51:12,340 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 220 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 12:51:12,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2022-04-27 12:51:12,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 507. [2022-04-27 12:51:12,560 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:51:12,561 INFO L82 GeneralOperation]: Start isEquivalent. First operand 507 states. Second operand has 507 states, 335 states have (on average 1.0955223880597016) internal successors, (367), 345 states have internal predecessors, (367), 104 states have call successors, (104), 68 states have call predecessors, (104), 67 states have return successors, (101), 93 states have call predecessors, (101), 101 states have call successors, (101) [2022-04-27 12:51:12,562 INFO L74 IsIncluded]: Start isIncluded. First operand 507 states. Second operand has 507 states, 335 states have (on average 1.0955223880597016) internal successors, (367), 345 states have internal predecessors, (367), 104 states have call successors, (104), 68 states have call predecessors, (104), 67 states have return successors, (101), 93 states have call predecessors, (101), 101 states have call successors, (101) [2022-04-27 12:51:12,562 INFO L87 Difference]: Start difference. First operand 507 states. Second operand has 507 states, 335 states have (on average 1.0955223880597016) internal successors, (367), 345 states have internal predecessors, (367), 104 states have call successors, (104), 68 states have call predecessors, (104), 67 states have return successors, (101), 93 states have call predecessors, (101), 101 states have call successors, (101) [2022-04-27 12:51:12,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:51:12,579 INFO L93 Difference]: Finished difference Result 507 states and 572 transitions. [2022-04-27 12:51:12,579 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 572 transitions. [2022-04-27 12:51:12,580 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:51:12,580 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:51:12,581 INFO L74 IsIncluded]: Start isIncluded. First operand has 507 states, 335 states have (on average 1.0955223880597016) internal successors, (367), 345 states have internal predecessors, (367), 104 states have call successors, (104), 68 states have call predecessors, (104), 67 states have return successors, (101), 93 states have call predecessors, (101), 101 states have call successors, (101) Second operand 507 states. [2022-04-27 12:51:12,582 INFO L87 Difference]: Start difference. First operand has 507 states, 335 states have (on average 1.0955223880597016) internal successors, (367), 345 states have internal predecessors, (367), 104 states have call successors, (104), 68 states have call predecessors, (104), 67 states have return successors, (101), 93 states have call predecessors, (101), 101 states have call successors, (101) Second operand 507 states. [2022-04-27 12:51:12,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:51:12,598 INFO L93 Difference]: Finished difference Result 507 states and 572 transitions. [2022-04-27 12:51:12,598 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 572 transitions. [2022-04-27 12:51:12,600 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:51:12,600 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:51:12,600 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:51:12,600 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:51:12,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 507 states, 335 states have (on average 1.0955223880597016) internal successors, (367), 345 states have internal predecessors, (367), 104 states have call successors, (104), 68 states have call predecessors, (104), 67 states have return successors, (101), 93 states have call predecessors, (101), 101 states have call successors, (101) [2022-04-27 12:51:12,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 572 transitions. [2022-04-27 12:51:12,620 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 572 transitions. Word has length 99 [2022-04-27 12:51:12,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:51:12,621 INFO L495 AbstractCegarLoop]: Abstraction has 507 states and 572 transitions. [2022-04-27 12:51:12,621 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 states have internal predecessors, (68), 12 states have call successors, (32), 8 states have call predecessors, (32), 7 states have return successors, (30), 10 states have call predecessors, (30), 11 states have call successors, (30) [2022-04-27 12:51:12,621 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 572 transitions. [2022-04-27 12:51:12,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2022-04-27 12:51:12,624 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:51:12,624 INFO L195 NwaCegarLoop]: trace histogram [31, 30, 30, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:51:12,649 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-04-27 12:51:12,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-04-27 12:51:12,847 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:51:12,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:51:12,848 INFO L85 PathProgramCache]: Analyzing trace with hash -1980311871, now seen corresponding path program 3 times [2022-04-27 12:51:12,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:51:12,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582248200] [2022-04-27 12:51:12,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:51:12,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:51:12,871 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:51:12,871 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [26090370] [2022-04-27 12:51:12,871 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 12:51:12,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:51:12,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:51:12,872 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) [2022-04-27 12:51:12,885 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-04-27 12:51:13,013 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2022-04-27 12:51:13,013 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 12:51:13,015 INFO L263 TraceCheckSpWp]: Trace formula consists of 472 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-27 12:51:13,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:51:13,054 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:51:13,924 INFO L272 TraceCheckUtils]: 0: Hoare triple {11920#true} call ULTIMATE.init(); {11920#true} is VALID [2022-04-27 12:51:13,924 INFO L290 TraceCheckUtils]: 1: Hoare triple {11920#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {11928#(<= ~counter~0 0)} is VALID [2022-04-27 12:51:13,924 INFO L290 TraceCheckUtils]: 2: Hoare triple {11928#(<= ~counter~0 0)} assume true; {11928#(<= ~counter~0 0)} is VALID [2022-04-27 12:51:13,925 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11928#(<= ~counter~0 0)} {11920#true} #82#return; {11928#(<= ~counter~0 0)} is VALID [2022-04-27 12:51:13,925 INFO L272 TraceCheckUtils]: 4: Hoare triple {11928#(<= ~counter~0 0)} call #t~ret7 := main(); {11928#(<= ~counter~0 0)} is VALID [2022-04-27 12:51:13,925 INFO L290 TraceCheckUtils]: 5: Hoare triple {11928#(<= ~counter~0 0)} havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~x~0;havoc ~y~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {11928#(<= ~counter~0 0)} is VALID [2022-04-27 12:51:13,926 INFO L272 TraceCheckUtils]: 6: Hoare triple {11928#(<= ~counter~0 0)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {11928#(<= ~counter~0 0)} is VALID [2022-04-27 12:51:13,926 INFO L290 TraceCheckUtils]: 7: Hoare triple {11928#(<= ~counter~0 0)} ~cond := #in~cond; {11928#(<= ~counter~0 0)} is VALID [2022-04-27 12:51:13,926 INFO L290 TraceCheckUtils]: 8: Hoare triple {11928#(<= ~counter~0 0)} assume !(0 == ~cond); {11928#(<= ~counter~0 0)} is VALID [2022-04-27 12:51:13,927 INFO L290 TraceCheckUtils]: 9: Hoare triple {11928#(<= ~counter~0 0)} assume true; {11928#(<= ~counter~0 0)} is VALID [2022-04-27 12:51:13,927 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {11928#(<= ~counter~0 0)} {11928#(<= ~counter~0 0)} #64#return; {11928#(<= ~counter~0 0)} is VALID [2022-04-27 12:51:13,927 INFO L272 TraceCheckUtils]: 11: Hoare triple {11928#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {11928#(<= ~counter~0 0)} is VALID [2022-04-27 12:51:13,928 INFO L290 TraceCheckUtils]: 12: Hoare triple {11928#(<= ~counter~0 0)} ~cond := #in~cond; {11928#(<= ~counter~0 0)} is VALID [2022-04-27 12:51:13,928 INFO L290 TraceCheckUtils]: 13: Hoare triple {11928#(<= ~counter~0 0)} assume !(0 == ~cond); {11928#(<= ~counter~0 0)} is VALID [2022-04-27 12:51:13,928 INFO L290 TraceCheckUtils]: 14: Hoare triple {11928#(<= ~counter~0 0)} assume true; {11928#(<= ~counter~0 0)} is VALID [2022-04-27 12:51:13,928 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {11928#(<= ~counter~0 0)} {11928#(<= ~counter~0 0)} #66#return; {11928#(<= ~counter~0 0)} is VALID [2022-04-27 12:51:13,929 INFO L290 TraceCheckUtils]: 16: Hoare triple {11928#(<= ~counter~0 0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {11928#(<= ~counter~0 0)} is VALID [2022-04-27 12:51:13,930 INFO L290 TraceCheckUtils]: 17: Hoare triple {11928#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {11977#(<= ~counter~0 1)} is VALID [2022-04-27 12:51:13,931 INFO L290 TraceCheckUtils]: 18: Hoare triple {11977#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {11977#(<= ~counter~0 1)} is VALID [2022-04-27 12:51:13,932 INFO L272 TraceCheckUtils]: 19: Hoare triple {11977#(<= ~counter~0 1)} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {11977#(<= ~counter~0 1)} is VALID [2022-04-27 12:51:13,932 INFO L290 TraceCheckUtils]: 20: Hoare triple {11977#(<= ~counter~0 1)} ~cond := #in~cond; {11977#(<= ~counter~0 1)} is VALID [2022-04-27 12:51:13,932 INFO L290 TraceCheckUtils]: 21: Hoare triple {11977#(<= ~counter~0 1)} assume !(0 == ~cond); {11977#(<= ~counter~0 1)} is VALID [2022-04-27 12:51:13,933 INFO L290 TraceCheckUtils]: 22: Hoare triple {11977#(<= ~counter~0 1)} assume true; {11977#(<= ~counter~0 1)} is VALID [2022-04-27 12:51:13,933 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {11977#(<= ~counter~0 1)} {11977#(<= ~counter~0 1)} #68#return; {11977#(<= ~counter~0 1)} is VALID [2022-04-27 12:51:13,934 INFO L272 TraceCheckUtils]: 24: Hoare triple {11977#(<= ~counter~0 1)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {11977#(<= ~counter~0 1)} is VALID [2022-04-27 12:51:13,934 INFO L290 TraceCheckUtils]: 25: Hoare triple {11977#(<= ~counter~0 1)} ~cond := #in~cond; {11977#(<= ~counter~0 1)} is VALID [2022-04-27 12:51:13,935 INFO L290 TraceCheckUtils]: 26: Hoare triple {11977#(<= ~counter~0 1)} assume !(0 == ~cond); {11977#(<= ~counter~0 1)} is VALID [2022-04-27 12:51:13,935 INFO L290 TraceCheckUtils]: 27: Hoare triple {11977#(<= ~counter~0 1)} assume true; {11977#(<= ~counter~0 1)} is VALID [2022-04-27 12:51:13,936 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {11977#(<= ~counter~0 1)} {11977#(<= ~counter~0 1)} #70#return; {11977#(<= ~counter~0 1)} is VALID [2022-04-27 12:51:13,936 INFO L272 TraceCheckUtils]: 29: Hoare triple {11977#(<= ~counter~0 1)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {11977#(<= ~counter~0 1)} is VALID [2022-04-27 12:51:13,937 INFO L290 TraceCheckUtils]: 30: Hoare triple {11977#(<= ~counter~0 1)} ~cond := #in~cond; {11977#(<= ~counter~0 1)} is VALID [2022-04-27 12:51:13,937 INFO L290 TraceCheckUtils]: 31: Hoare triple {11977#(<= ~counter~0 1)} assume !(0 == ~cond); {11977#(<= ~counter~0 1)} is VALID [2022-04-27 12:51:13,937 INFO L290 TraceCheckUtils]: 32: Hoare triple {11977#(<= ~counter~0 1)} assume true; {11977#(<= ~counter~0 1)} is VALID [2022-04-27 12:51:13,938 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {11977#(<= ~counter~0 1)} {11977#(<= ~counter~0 1)} #72#return; {11977#(<= ~counter~0 1)} is VALID [2022-04-27 12:51:13,938 INFO L290 TraceCheckUtils]: 34: Hoare triple {11977#(<= ~counter~0 1)} assume !!(~a~0 != ~b~0); {11977#(<= ~counter~0 1)} is VALID [2022-04-27 12:51:13,939 INFO L290 TraceCheckUtils]: 35: Hoare triple {11977#(<= ~counter~0 1)} assume ~a~0 > ~b~0;~a~0 := ~a~0 - ~b~0;~p~0 := ~p~0 - ~q~0;~r~0 := ~r~0 - ~s~0; {11977#(<= ~counter~0 1)} is VALID [2022-04-27 12:51:13,939 INFO L290 TraceCheckUtils]: 36: Hoare triple {11977#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12035#(<= ~counter~0 2)} is VALID [2022-04-27 12:51:13,940 INFO L290 TraceCheckUtils]: 37: Hoare triple {12035#(<= ~counter~0 2)} assume !!(#t~post6 < 50);havoc #t~post6; {12035#(<= ~counter~0 2)} is VALID [2022-04-27 12:51:13,940 INFO L272 TraceCheckUtils]: 38: Hoare triple {12035#(<= ~counter~0 2)} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {12035#(<= ~counter~0 2)} is VALID [2022-04-27 12:51:13,941 INFO L290 TraceCheckUtils]: 39: Hoare triple {12035#(<= ~counter~0 2)} ~cond := #in~cond; {12035#(<= ~counter~0 2)} is VALID [2022-04-27 12:51:13,941 INFO L290 TraceCheckUtils]: 40: Hoare triple {12035#(<= ~counter~0 2)} assume !(0 == ~cond); {12035#(<= ~counter~0 2)} is VALID [2022-04-27 12:51:13,941 INFO L290 TraceCheckUtils]: 41: Hoare triple {12035#(<= ~counter~0 2)} assume true; {12035#(<= ~counter~0 2)} is VALID [2022-04-27 12:51:13,942 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {12035#(<= ~counter~0 2)} {12035#(<= ~counter~0 2)} #68#return; {12035#(<= ~counter~0 2)} is VALID [2022-04-27 12:51:13,943 INFO L272 TraceCheckUtils]: 43: Hoare triple {12035#(<= ~counter~0 2)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {12035#(<= ~counter~0 2)} is VALID [2022-04-27 12:51:13,943 INFO L290 TraceCheckUtils]: 44: Hoare triple {12035#(<= ~counter~0 2)} ~cond := #in~cond; {12035#(<= ~counter~0 2)} is VALID [2022-04-27 12:51:13,943 INFO L290 TraceCheckUtils]: 45: Hoare triple {12035#(<= ~counter~0 2)} assume !(0 == ~cond); {12035#(<= ~counter~0 2)} is VALID [2022-04-27 12:51:13,944 INFO L290 TraceCheckUtils]: 46: Hoare triple {12035#(<= ~counter~0 2)} assume true; {12035#(<= ~counter~0 2)} is VALID [2022-04-27 12:51:13,944 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {12035#(<= ~counter~0 2)} {12035#(<= ~counter~0 2)} #70#return; {12035#(<= ~counter~0 2)} is VALID [2022-04-27 12:51:13,945 INFO L272 TraceCheckUtils]: 48: Hoare triple {12035#(<= ~counter~0 2)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {12035#(<= ~counter~0 2)} is VALID [2022-04-27 12:51:13,945 INFO L290 TraceCheckUtils]: 49: Hoare triple {12035#(<= ~counter~0 2)} ~cond := #in~cond; {12035#(<= ~counter~0 2)} is VALID [2022-04-27 12:51:13,946 INFO L290 TraceCheckUtils]: 50: Hoare triple {12035#(<= ~counter~0 2)} assume !(0 == ~cond); {12035#(<= ~counter~0 2)} is VALID [2022-04-27 12:51:13,946 INFO L290 TraceCheckUtils]: 51: Hoare triple {12035#(<= ~counter~0 2)} assume true; {12035#(<= ~counter~0 2)} is VALID [2022-04-27 12:51:13,947 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {12035#(<= ~counter~0 2)} {12035#(<= ~counter~0 2)} #72#return; {12035#(<= ~counter~0 2)} is VALID [2022-04-27 12:51:13,947 INFO L290 TraceCheckUtils]: 53: Hoare triple {12035#(<= ~counter~0 2)} assume !!(~a~0 != ~b~0); {12035#(<= ~counter~0 2)} is VALID [2022-04-27 12:51:13,947 INFO L290 TraceCheckUtils]: 54: Hoare triple {12035#(<= ~counter~0 2)} assume ~a~0 > ~b~0;~a~0 := ~a~0 - ~b~0;~p~0 := ~p~0 - ~q~0;~r~0 := ~r~0 - ~s~0; {12035#(<= ~counter~0 2)} is VALID [2022-04-27 12:51:13,948 INFO L290 TraceCheckUtils]: 55: Hoare triple {12035#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12093#(<= ~counter~0 3)} is VALID [2022-04-27 12:51:13,948 INFO L290 TraceCheckUtils]: 56: Hoare triple {12093#(<= ~counter~0 3)} assume !!(#t~post6 < 50);havoc #t~post6; {12093#(<= ~counter~0 3)} is VALID [2022-04-27 12:51:13,949 INFO L272 TraceCheckUtils]: 57: Hoare triple {12093#(<= ~counter~0 3)} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {12093#(<= ~counter~0 3)} is VALID [2022-04-27 12:51:13,949 INFO L290 TraceCheckUtils]: 58: Hoare triple {12093#(<= ~counter~0 3)} ~cond := #in~cond; {12093#(<= ~counter~0 3)} is VALID [2022-04-27 12:51:13,949 INFO L290 TraceCheckUtils]: 59: Hoare triple {12093#(<= ~counter~0 3)} assume !(0 == ~cond); {12093#(<= ~counter~0 3)} is VALID [2022-04-27 12:51:13,950 INFO L290 TraceCheckUtils]: 60: Hoare triple {12093#(<= ~counter~0 3)} assume true; {12093#(<= ~counter~0 3)} is VALID [2022-04-27 12:51:13,950 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {12093#(<= ~counter~0 3)} {12093#(<= ~counter~0 3)} #68#return; {12093#(<= ~counter~0 3)} is VALID [2022-04-27 12:51:13,951 INFO L272 TraceCheckUtils]: 62: Hoare triple {12093#(<= ~counter~0 3)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {12093#(<= ~counter~0 3)} is VALID [2022-04-27 12:51:13,951 INFO L290 TraceCheckUtils]: 63: Hoare triple {12093#(<= ~counter~0 3)} ~cond := #in~cond; {12093#(<= ~counter~0 3)} is VALID [2022-04-27 12:51:13,951 INFO L290 TraceCheckUtils]: 64: Hoare triple {12093#(<= ~counter~0 3)} assume !(0 == ~cond); {12093#(<= ~counter~0 3)} is VALID [2022-04-27 12:51:13,952 INFO L290 TraceCheckUtils]: 65: Hoare triple {12093#(<= ~counter~0 3)} assume true; {12093#(<= ~counter~0 3)} is VALID [2022-04-27 12:51:13,952 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {12093#(<= ~counter~0 3)} {12093#(<= ~counter~0 3)} #70#return; {12093#(<= ~counter~0 3)} is VALID [2022-04-27 12:51:13,953 INFO L272 TraceCheckUtils]: 67: Hoare triple {12093#(<= ~counter~0 3)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {12093#(<= ~counter~0 3)} is VALID [2022-04-27 12:51:13,953 INFO L290 TraceCheckUtils]: 68: Hoare triple {12093#(<= ~counter~0 3)} ~cond := #in~cond; {12093#(<= ~counter~0 3)} is VALID [2022-04-27 12:51:13,954 INFO L290 TraceCheckUtils]: 69: Hoare triple {12093#(<= ~counter~0 3)} assume !(0 == ~cond); {12093#(<= ~counter~0 3)} is VALID [2022-04-27 12:51:13,954 INFO L290 TraceCheckUtils]: 70: Hoare triple {12093#(<= ~counter~0 3)} assume true; {12093#(<= ~counter~0 3)} is VALID [2022-04-27 12:51:13,955 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {12093#(<= ~counter~0 3)} {12093#(<= ~counter~0 3)} #72#return; {12093#(<= ~counter~0 3)} is VALID [2022-04-27 12:51:13,955 INFO L290 TraceCheckUtils]: 72: Hoare triple {12093#(<= ~counter~0 3)} assume !!(~a~0 != ~b~0); {12093#(<= ~counter~0 3)} is VALID [2022-04-27 12:51:13,955 INFO L290 TraceCheckUtils]: 73: Hoare triple {12093#(<= ~counter~0 3)} assume ~a~0 > ~b~0;~a~0 := ~a~0 - ~b~0;~p~0 := ~p~0 - ~q~0;~r~0 := ~r~0 - ~s~0; {12093#(<= ~counter~0 3)} is VALID [2022-04-27 12:51:13,956 INFO L290 TraceCheckUtils]: 74: Hoare triple {12093#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12151#(<= ~counter~0 4)} is VALID [2022-04-27 12:51:13,956 INFO L290 TraceCheckUtils]: 75: Hoare triple {12151#(<= ~counter~0 4)} assume !!(#t~post6 < 50);havoc #t~post6; {12151#(<= ~counter~0 4)} is VALID [2022-04-27 12:51:13,957 INFO L272 TraceCheckUtils]: 76: Hoare triple {12151#(<= ~counter~0 4)} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {12151#(<= ~counter~0 4)} is VALID [2022-04-27 12:51:13,957 INFO L290 TraceCheckUtils]: 77: Hoare triple {12151#(<= ~counter~0 4)} ~cond := #in~cond; {12151#(<= ~counter~0 4)} is VALID [2022-04-27 12:51:13,957 INFO L290 TraceCheckUtils]: 78: Hoare triple {12151#(<= ~counter~0 4)} assume !(0 == ~cond); {12151#(<= ~counter~0 4)} is VALID [2022-04-27 12:51:13,958 INFO L290 TraceCheckUtils]: 79: Hoare triple {12151#(<= ~counter~0 4)} assume true; {12151#(<= ~counter~0 4)} is VALID [2022-04-27 12:51:13,958 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {12151#(<= ~counter~0 4)} {12151#(<= ~counter~0 4)} #68#return; {12151#(<= ~counter~0 4)} is VALID [2022-04-27 12:51:13,959 INFO L272 TraceCheckUtils]: 81: Hoare triple {12151#(<= ~counter~0 4)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {12151#(<= ~counter~0 4)} is VALID [2022-04-27 12:51:13,959 INFO L290 TraceCheckUtils]: 82: Hoare triple {12151#(<= ~counter~0 4)} ~cond := #in~cond; {12151#(<= ~counter~0 4)} is VALID [2022-04-27 12:51:13,959 INFO L290 TraceCheckUtils]: 83: Hoare triple {12151#(<= ~counter~0 4)} assume !(0 == ~cond); {12151#(<= ~counter~0 4)} is VALID [2022-04-27 12:51:13,960 INFO L290 TraceCheckUtils]: 84: Hoare triple {12151#(<= ~counter~0 4)} assume true; {12151#(<= ~counter~0 4)} is VALID [2022-04-27 12:51:13,960 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {12151#(<= ~counter~0 4)} {12151#(<= ~counter~0 4)} #70#return; {12151#(<= ~counter~0 4)} is VALID [2022-04-27 12:51:13,961 INFO L272 TraceCheckUtils]: 86: Hoare triple {12151#(<= ~counter~0 4)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {12151#(<= ~counter~0 4)} is VALID [2022-04-27 12:51:13,961 INFO L290 TraceCheckUtils]: 87: Hoare triple {12151#(<= ~counter~0 4)} ~cond := #in~cond; {12151#(<= ~counter~0 4)} is VALID [2022-04-27 12:51:13,961 INFO L290 TraceCheckUtils]: 88: Hoare triple {12151#(<= ~counter~0 4)} assume !(0 == ~cond); {12151#(<= ~counter~0 4)} is VALID [2022-04-27 12:51:13,961 INFO L290 TraceCheckUtils]: 89: Hoare triple {12151#(<= ~counter~0 4)} assume true; {12151#(<= ~counter~0 4)} is VALID [2022-04-27 12:51:13,962 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {12151#(<= ~counter~0 4)} {12151#(<= ~counter~0 4)} #72#return; {12151#(<= ~counter~0 4)} is VALID [2022-04-27 12:51:13,962 INFO L290 TraceCheckUtils]: 91: Hoare triple {12151#(<= ~counter~0 4)} assume !!(~a~0 != ~b~0); {12151#(<= ~counter~0 4)} is VALID [2022-04-27 12:51:13,963 INFO L290 TraceCheckUtils]: 92: Hoare triple {12151#(<= ~counter~0 4)} assume ~a~0 > ~b~0;~a~0 := ~a~0 - ~b~0;~p~0 := ~p~0 - ~q~0;~r~0 := ~r~0 - ~s~0; {12151#(<= ~counter~0 4)} is VALID [2022-04-27 12:51:13,963 INFO L290 TraceCheckUtils]: 93: Hoare triple {12151#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12209#(<= ~counter~0 5)} is VALID [2022-04-27 12:51:13,963 INFO L290 TraceCheckUtils]: 94: Hoare triple {12209#(<= ~counter~0 5)} assume !!(#t~post6 < 50);havoc #t~post6; {12209#(<= ~counter~0 5)} is VALID [2022-04-27 12:51:13,964 INFO L272 TraceCheckUtils]: 95: Hoare triple {12209#(<= ~counter~0 5)} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {12209#(<= ~counter~0 5)} is VALID [2022-04-27 12:51:13,964 INFO L290 TraceCheckUtils]: 96: Hoare triple {12209#(<= ~counter~0 5)} ~cond := #in~cond; {12209#(<= ~counter~0 5)} is VALID [2022-04-27 12:51:13,965 INFO L290 TraceCheckUtils]: 97: Hoare triple {12209#(<= ~counter~0 5)} assume !(0 == ~cond); {12209#(<= ~counter~0 5)} is VALID [2022-04-27 12:51:13,966 INFO L290 TraceCheckUtils]: 98: Hoare triple {12209#(<= ~counter~0 5)} assume true; {12209#(<= ~counter~0 5)} is VALID [2022-04-27 12:51:13,966 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {12209#(<= ~counter~0 5)} {12209#(<= ~counter~0 5)} #68#return; {12209#(<= ~counter~0 5)} is VALID [2022-04-27 12:51:13,967 INFO L272 TraceCheckUtils]: 100: Hoare triple {12209#(<= ~counter~0 5)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {12209#(<= ~counter~0 5)} is VALID [2022-04-27 12:51:13,967 INFO L290 TraceCheckUtils]: 101: Hoare triple {12209#(<= ~counter~0 5)} ~cond := #in~cond; {12209#(<= ~counter~0 5)} is VALID [2022-04-27 12:51:13,967 INFO L290 TraceCheckUtils]: 102: Hoare triple {12209#(<= ~counter~0 5)} assume !(0 == ~cond); {12209#(<= ~counter~0 5)} is VALID [2022-04-27 12:51:13,968 INFO L290 TraceCheckUtils]: 103: Hoare triple {12209#(<= ~counter~0 5)} assume true; {12209#(<= ~counter~0 5)} is VALID [2022-04-27 12:51:13,968 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {12209#(<= ~counter~0 5)} {12209#(<= ~counter~0 5)} #70#return; {12209#(<= ~counter~0 5)} is VALID [2022-04-27 12:51:13,969 INFO L272 TraceCheckUtils]: 105: Hoare triple {12209#(<= ~counter~0 5)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {12209#(<= ~counter~0 5)} is VALID [2022-04-27 12:51:13,969 INFO L290 TraceCheckUtils]: 106: Hoare triple {12209#(<= ~counter~0 5)} ~cond := #in~cond; {12209#(<= ~counter~0 5)} is VALID [2022-04-27 12:51:13,969 INFO L290 TraceCheckUtils]: 107: Hoare triple {12209#(<= ~counter~0 5)} assume !(0 == ~cond); {12209#(<= ~counter~0 5)} is VALID [2022-04-27 12:51:13,969 INFO L290 TraceCheckUtils]: 108: Hoare triple {12209#(<= ~counter~0 5)} assume true; {12209#(<= ~counter~0 5)} is VALID [2022-04-27 12:51:13,970 INFO L284 TraceCheckUtils]: 109: Hoare quadruple {12209#(<= ~counter~0 5)} {12209#(<= ~counter~0 5)} #72#return; {12209#(<= ~counter~0 5)} is VALID [2022-04-27 12:51:13,970 INFO L290 TraceCheckUtils]: 110: Hoare triple {12209#(<= ~counter~0 5)} assume !!(~a~0 != ~b~0); {12209#(<= ~counter~0 5)} is VALID [2022-04-27 12:51:13,971 INFO L290 TraceCheckUtils]: 111: Hoare triple {12209#(<= ~counter~0 5)} assume ~a~0 > ~b~0;~a~0 := ~a~0 - ~b~0;~p~0 := ~p~0 - ~q~0;~r~0 := ~r~0 - ~s~0; {12209#(<= ~counter~0 5)} is VALID [2022-04-27 12:51:13,971 INFO L290 TraceCheckUtils]: 112: Hoare triple {12209#(<= ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12267#(<= ~counter~0 6)} is VALID [2022-04-27 12:51:13,971 INFO L290 TraceCheckUtils]: 113: Hoare triple {12267#(<= ~counter~0 6)} assume !!(#t~post6 < 50);havoc #t~post6; {12267#(<= ~counter~0 6)} is VALID [2022-04-27 12:51:13,972 INFO L272 TraceCheckUtils]: 114: Hoare triple {12267#(<= ~counter~0 6)} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {12267#(<= ~counter~0 6)} is VALID [2022-04-27 12:51:13,972 INFO L290 TraceCheckUtils]: 115: Hoare triple {12267#(<= ~counter~0 6)} ~cond := #in~cond; {12267#(<= ~counter~0 6)} is VALID [2022-04-27 12:51:13,972 INFO L290 TraceCheckUtils]: 116: Hoare triple {12267#(<= ~counter~0 6)} assume !(0 == ~cond); {12267#(<= ~counter~0 6)} is VALID [2022-04-27 12:51:13,972 INFO L290 TraceCheckUtils]: 117: Hoare triple {12267#(<= ~counter~0 6)} assume true; {12267#(<= ~counter~0 6)} is VALID [2022-04-27 12:51:13,973 INFO L284 TraceCheckUtils]: 118: Hoare quadruple {12267#(<= ~counter~0 6)} {12267#(<= ~counter~0 6)} #68#return; {12267#(<= ~counter~0 6)} is VALID [2022-04-27 12:51:13,974 INFO L272 TraceCheckUtils]: 119: Hoare triple {12267#(<= ~counter~0 6)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {12267#(<= ~counter~0 6)} is VALID [2022-04-27 12:51:13,974 INFO L290 TraceCheckUtils]: 120: Hoare triple {12267#(<= ~counter~0 6)} ~cond := #in~cond; {12267#(<= ~counter~0 6)} is VALID [2022-04-27 12:51:13,974 INFO L290 TraceCheckUtils]: 121: Hoare triple {12267#(<= ~counter~0 6)} assume !(0 == ~cond); {12267#(<= ~counter~0 6)} is VALID [2022-04-27 12:51:13,974 INFO L290 TraceCheckUtils]: 122: Hoare triple {12267#(<= ~counter~0 6)} assume true; {12267#(<= ~counter~0 6)} is VALID [2022-04-27 12:51:13,975 INFO L284 TraceCheckUtils]: 123: Hoare quadruple {12267#(<= ~counter~0 6)} {12267#(<= ~counter~0 6)} #70#return; {12267#(<= ~counter~0 6)} is VALID [2022-04-27 12:51:13,975 INFO L272 TraceCheckUtils]: 124: Hoare triple {12267#(<= ~counter~0 6)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {12267#(<= ~counter~0 6)} is VALID [2022-04-27 12:51:13,976 INFO L290 TraceCheckUtils]: 125: Hoare triple {12267#(<= ~counter~0 6)} ~cond := #in~cond; {12267#(<= ~counter~0 6)} is VALID [2022-04-27 12:51:13,976 INFO L290 TraceCheckUtils]: 126: Hoare triple {12267#(<= ~counter~0 6)} assume !(0 == ~cond); {12267#(<= ~counter~0 6)} is VALID [2022-04-27 12:51:13,976 INFO L290 TraceCheckUtils]: 127: Hoare triple {12267#(<= ~counter~0 6)} assume true; {12267#(<= ~counter~0 6)} is VALID [2022-04-27 12:51:13,977 INFO L284 TraceCheckUtils]: 128: Hoare quadruple {12267#(<= ~counter~0 6)} {12267#(<= ~counter~0 6)} #72#return; {12267#(<= ~counter~0 6)} is VALID [2022-04-27 12:51:13,977 INFO L290 TraceCheckUtils]: 129: Hoare triple {12267#(<= ~counter~0 6)} assume !!(~a~0 != ~b~0); {12267#(<= ~counter~0 6)} is VALID [2022-04-27 12:51:13,977 INFO L290 TraceCheckUtils]: 130: Hoare triple {12267#(<= ~counter~0 6)} assume ~a~0 > ~b~0;~a~0 := ~a~0 - ~b~0;~p~0 := ~p~0 - ~q~0;~r~0 := ~r~0 - ~s~0; {12267#(<= ~counter~0 6)} is VALID [2022-04-27 12:51:13,978 INFO L290 TraceCheckUtils]: 131: Hoare triple {12267#(<= ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12325#(<= ~counter~0 7)} is VALID [2022-04-27 12:51:13,978 INFO L290 TraceCheckUtils]: 132: Hoare triple {12325#(<= ~counter~0 7)} assume !!(#t~post6 < 50);havoc #t~post6; {12325#(<= ~counter~0 7)} is VALID [2022-04-27 12:51:13,978 INFO L272 TraceCheckUtils]: 133: Hoare triple {12325#(<= ~counter~0 7)} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {12325#(<= ~counter~0 7)} is VALID [2022-04-27 12:51:13,979 INFO L290 TraceCheckUtils]: 134: Hoare triple {12325#(<= ~counter~0 7)} ~cond := #in~cond; {12325#(<= ~counter~0 7)} is VALID [2022-04-27 12:51:13,979 INFO L290 TraceCheckUtils]: 135: Hoare triple {12325#(<= ~counter~0 7)} assume !(0 == ~cond); {12325#(<= ~counter~0 7)} is VALID [2022-04-27 12:51:13,979 INFO L290 TraceCheckUtils]: 136: Hoare triple {12325#(<= ~counter~0 7)} assume true; {12325#(<= ~counter~0 7)} is VALID [2022-04-27 12:51:13,980 INFO L284 TraceCheckUtils]: 137: Hoare quadruple {12325#(<= ~counter~0 7)} {12325#(<= ~counter~0 7)} #68#return; {12325#(<= ~counter~0 7)} is VALID [2022-04-27 12:51:13,980 INFO L272 TraceCheckUtils]: 138: Hoare triple {12325#(<= ~counter~0 7)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {12325#(<= ~counter~0 7)} is VALID [2022-04-27 12:51:13,980 INFO L290 TraceCheckUtils]: 139: Hoare triple {12325#(<= ~counter~0 7)} ~cond := #in~cond; {12325#(<= ~counter~0 7)} is VALID [2022-04-27 12:51:13,981 INFO L290 TraceCheckUtils]: 140: Hoare triple {12325#(<= ~counter~0 7)} assume !(0 == ~cond); {12325#(<= ~counter~0 7)} is VALID [2022-04-27 12:51:13,981 INFO L290 TraceCheckUtils]: 141: Hoare triple {12325#(<= ~counter~0 7)} assume true; {12325#(<= ~counter~0 7)} is VALID [2022-04-27 12:51:13,981 INFO L284 TraceCheckUtils]: 142: Hoare quadruple {12325#(<= ~counter~0 7)} {12325#(<= ~counter~0 7)} #70#return; {12325#(<= ~counter~0 7)} is VALID [2022-04-27 12:51:13,982 INFO L272 TraceCheckUtils]: 143: Hoare triple {12325#(<= ~counter~0 7)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {12325#(<= ~counter~0 7)} is VALID [2022-04-27 12:51:13,982 INFO L290 TraceCheckUtils]: 144: Hoare triple {12325#(<= ~counter~0 7)} ~cond := #in~cond; {12325#(<= ~counter~0 7)} is VALID [2022-04-27 12:51:13,982 INFO L290 TraceCheckUtils]: 145: Hoare triple {12325#(<= ~counter~0 7)} assume !(0 == ~cond); {12325#(<= ~counter~0 7)} is VALID [2022-04-27 12:51:13,983 INFO L290 TraceCheckUtils]: 146: Hoare triple {12325#(<= ~counter~0 7)} assume true; {12325#(<= ~counter~0 7)} is VALID [2022-04-27 12:51:13,983 INFO L284 TraceCheckUtils]: 147: Hoare quadruple {12325#(<= ~counter~0 7)} {12325#(<= ~counter~0 7)} #72#return; {12325#(<= ~counter~0 7)} is VALID [2022-04-27 12:51:13,986 INFO L290 TraceCheckUtils]: 148: Hoare triple {12325#(<= ~counter~0 7)} assume !!(~a~0 != ~b~0); {12325#(<= ~counter~0 7)} is VALID [2022-04-27 12:51:13,987 INFO L290 TraceCheckUtils]: 149: Hoare triple {12325#(<= ~counter~0 7)} assume ~a~0 > ~b~0;~a~0 := ~a~0 - ~b~0;~p~0 := ~p~0 - ~q~0;~r~0 := ~r~0 - ~s~0; {12325#(<= ~counter~0 7)} is VALID [2022-04-27 12:51:13,987 INFO L290 TraceCheckUtils]: 150: Hoare triple {12325#(<= ~counter~0 7)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12383#(<= ~counter~0 8)} is VALID [2022-04-27 12:51:13,987 INFO L290 TraceCheckUtils]: 151: Hoare triple {12383#(<= ~counter~0 8)} assume !!(#t~post6 < 50);havoc #t~post6; {12383#(<= ~counter~0 8)} is VALID [2022-04-27 12:51:13,988 INFO L272 TraceCheckUtils]: 152: Hoare triple {12383#(<= ~counter~0 8)} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {12383#(<= ~counter~0 8)} is VALID [2022-04-27 12:51:13,988 INFO L290 TraceCheckUtils]: 153: Hoare triple {12383#(<= ~counter~0 8)} ~cond := #in~cond; {12383#(<= ~counter~0 8)} is VALID [2022-04-27 12:51:13,988 INFO L290 TraceCheckUtils]: 154: Hoare triple {12383#(<= ~counter~0 8)} assume !(0 == ~cond); {12383#(<= ~counter~0 8)} is VALID [2022-04-27 12:51:13,989 INFO L290 TraceCheckUtils]: 155: Hoare triple {12383#(<= ~counter~0 8)} assume true; {12383#(<= ~counter~0 8)} is VALID [2022-04-27 12:51:13,989 INFO L284 TraceCheckUtils]: 156: Hoare quadruple {12383#(<= ~counter~0 8)} {12383#(<= ~counter~0 8)} #68#return; {12383#(<= ~counter~0 8)} is VALID [2022-04-27 12:51:13,990 INFO L272 TraceCheckUtils]: 157: Hoare triple {12383#(<= ~counter~0 8)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {12383#(<= ~counter~0 8)} is VALID [2022-04-27 12:51:13,991 INFO L290 TraceCheckUtils]: 158: Hoare triple {12383#(<= ~counter~0 8)} ~cond := #in~cond; {12383#(<= ~counter~0 8)} is VALID [2022-04-27 12:51:13,991 INFO L290 TraceCheckUtils]: 159: Hoare triple {12383#(<= ~counter~0 8)} assume !(0 == ~cond); {12383#(<= ~counter~0 8)} is VALID [2022-04-27 12:51:13,992 INFO L290 TraceCheckUtils]: 160: Hoare triple {12383#(<= ~counter~0 8)} assume true; {12383#(<= ~counter~0 8)} is VALID [2022-04-27 12:51:13,993 INFO L284 TraceCheckUtils]: 161: Hoare quadruple {12383#(<= ~counter~0 8)} {12383#(<= ~counter~0 8)} #70#return; {12383#(<= ~counter~0 8)} is VALID [2022-04-27 12:51:13,993 INFO L272 TraceCheckUtils]: 162: Hoare triple {12383#(<= ~counter~0 8)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {12383#(<= ~counter~0 8)} is VALID [2022-04-27 12:51:13,996 INFO L290 TraceCheckUtils]: 163: Hoare triple {12383#(<= ~counter~0 8)} ~cond := #in~cond; {12383#(<= ~counter~0 8)} is VALID [2022-04-27 12:51:13,996 INFO L290 TraceCheckUtils]: 164: Hoare triple {12383#(<= ~counter~0 8)} assume !(0 == ~cond); {12383#(<= ~counter~0 8)} is VALID [2022-04-27 12:51:13,996 INFO L290 TraceCheckUtils]: 165: Hoare triple {12383#(<= ~counter~0 8)} assume true; {12383#(<= ~counter~0 8)} is VALID [2022-04-27 12:51:13,997 INFO L284 TraceCheckUtils]: 166: Hoare quadruple {12383#(<= ~counter~0 8)} {12383#(<= ~counter~0 8)} #72#return; {12383#(<= ~counter~0 8)} is VALID [2022-04-27 12:51:13,997 INFO L290 TraceCheckUtils]: 167: Hoare triple {12383#(<= ~counter~0 8)} assume !!(~a~0 != ~b~0); {12383#(<= ~counter~0 8)} is VALID [2022-04-27 12:51:13,997 INFO L290 TraceCheckUtils]: 168: Hoare triple {12383#(<= ~counter~0 8)} assume ~a~0 > ~b~0;~a~0 := ~a~0 - ~b~0;~p~0 := ~p~0 - ~q~0;~r~0 := ~r~0 - ~s~0; {12383#(<= ~counter~0 8)} is VALID [2022-04-27 12:51:13,998 INFO L290 TraceCheckUtils]: 169: Hoare triple {12383#(<= ~counter~0 8)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12441#(<= ~counter~0 9)} is VALID [2022-04-27 12:51:13,998 INFO L290 TraceCheckUtils]: 170: Hoare triple {12441#(<= ~counter~0 9)} assume !!(#t~post6 < 50);havoc #t~post6; {12441#(<= ~counter~0 9)} is VALID [2022-04-27 12:51:13,999 INFO L272 TraceCheckUtils]: 171: Hoare triple {12441#(<= ~counter~0 9)} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {12441#(<= ~counter~0 9)} is VALID [2022-04-27 12:51:13,999 INFO L290 TraceCheckUtils]: 172: Hoare triple {12441#(<= ~counter~0 9)} ~cond := #in~cond; {12441#(<= ~counter~0 9)} is VALID [2022-04-27 12:51:13,999 INFO L290 TraceCheckUtils]: 173: Hoare triple {12441#(<= ~counter~0 9)} assume !(0 == ~cond); {12441#(<= ~counter~0 9)} is VALID [2022-04-27 12:51:13,999 INFO L290 TraceCheckUtils]: 174: Hoare triple {12441#(<= ~counter~0 9)} assume true; {12441#(<= ~counter~0 9)} is VALID [2022-04-27 12:51:14,000 INFO L284 TraceCheckUtils]: 175: Hoare quadruple {12441#(<= ~counter~0 9)} {12441#(<= ~counter~0 9)} #68#return; {12441#(<= ~counter~0 9)} is VALID [2022-04-27 12:51:14,000 INFO L272 TraceCheckUtils]: 176: Hoare triple {12441#(<= ~counter~0 9)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {12441#(<= ~counter~0 9)} is VALID [2022-04-27 12:51:14,001 INFO L290 TraceCheckUtils]: 177: Hoare triple {12441#(<= ~counter~0 9)} ~cond := #in~cond; {12441#(<= ~counter~0 9)} is VALID [2022-04-27 12:51:14,001 INFO L290 TraceCheckUtils]: 178: Hoare triple {12441#(<= ~counter~0 9)} assume !(0 == ~cond); {12441#(<= ~counter~0 9)} is VALID [2022-04-27 12:51:14,002 INFO L290 TraceCheckUtils]: 179: Hoare triple {12441#(<= ~counter~0 9)} assume true; {12441#(<= ~counter~0 9)} is VALID [2022-04-27 12:51:14,002 INFO L284 TraceCheckUtils]: 180: Hoare quadruple {12441#(<= ~counter~0 9)} {12441#(<= ~counter~0 9)} #70#return; {12441#(<= ~counter~0 9)} is VALID [2022-04-27 12:51:14,003 INFO L272 TraceCheckUtils]: 181: Hoare triple {12441#(<= ~counter~0 9)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {12441#(<= ~counter~0 9)} is VALID [2022-04-27 12:51:14,003 INFO L290 TraceCheckUtils]: 182: Hoare triple {12441#(<= ~counter~0 9)} ~cond := #in~cond; {12441#(<= ~counter~0 9)} is VALID [2022-04-27 12:51:14,003 INFO L290 TraceCheckUtils]: 183: Hoare triple {12441#(<= ~counter~0 9)} assume !(0 == ~cond); {12441#(<= ~counter~0 9)} is VALID [2022-04-27 12:51:14,003 INFO L290 TraceCheckUtils]: 184: Hoare triple {12441#(<= ~counter~0 9)} assume true; {12441#(<= ~counter~0 9)} is VALID [2022-04-27 12:51:14,004 INFO L284 TraceCheckUtils]: 185: Hoare quadruple {12441#(<= ~counter~0 9)} {12441#(<= ~counter~0 9)} #72#return; {12441#(<= ~counter~0 9)} is VALID [2022-04-27 12:51:14,004 INFO L290 TraceCheckUtils]: 186: Hoare triple {12441#(<= ~counter~0 9)} assume !!(~a~0 != ~b~0); {12441#(<= ~counter~0 9)} is VALID [2022-04-27 12:51:14,005 INFO L290 TraceCheckUtils]: 187: Hoare triple {12441#(<= ~counter~0 9)} assume ~a~0 > ~b~0;~a~0 := ~a~0 - ~b~0;~p~0 := ~p~0 - ~q~0;~r~0 := ~r~0 - ~s~0; {12441#(<= ~counter~0 9)} is VALID [2022-04-27 12:51:14,005 INFO L290 TraceCheckUtils]: 188: Hoare triple {12441#(<= ~counter~0 9)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12499#(<= ~counter~0 10)} is VALID [2022-04-27 12:51:14,005 INFO L290 TraceCheckUtils]: 189: Hoare triple {12499#(<= ~counter~0 10)} assume !!(#t~post6 < 50);havoc #t~post6; {12499#(<= ~counter~0 10)} is VALID [2022-04-27 12:51:14,006 INFO L272 TraceCheckUtils]: 190: Hoare triple {12499#(<= ~counter~0 10)} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {12499#(<= ~counter~0 10)} is VALID [2022-04-27 12:51:14,015 INFO L290 TraceCheckUtils]: 191: Hoare triple {12499#(<= ~counter~0 10)} ~cond := #in~cond; {12499#(<= ~counter~0 10)} is VALID [2022-04-27 12:51:14,015 INFO L290 TraceCheckUtils]: 192: Hoare triple {12499#(<= ~counter~0 10)} assume !(0 == ~cond); {12499#(<= ~counter~0 10)} is VALID [2022-04-27 12:51:14,016 INFO L290 TraceCheckUtils]: 193: Hoare triple {12499#(<= ~counter~0 10)} assume true; {12499#(<= ~counter~0 10)} is VALID [2022-04-27 12:51:14,017 INFO L284 TraceCheckUtils]: 194: Hoare quadruple {12499#(<= ~counter~0 10)} {12499#(<= ~counter~0 10)} #68#return; {12499#(<= ~counter~0 10)} is VALID [2022-04-27 12:51:14,017 INFO L272 TraceCheckUtils]: 195: Hoare triple {12499#(<= ~counter~0 10)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {12499#(<= ~counter~0 10)} is VALID [2022-04-27 12:51:14,018 INFO L290 TraceCheckUtils]: 196: Hoare triple {12499#(<= ~counter~0 10)} ~cond := #in~cond; {12499#(<= ~counter~0 10)} is VALID [2022-04-27 12:51:14,018 INFO L290 TraceCheckUtils]: 197: Hoare triple {12499#(<= ~counter~0 10)} assume !(0 == ~cond); {12499#(<= ~counter~0 10)} is VALID [2022-04-27 12:51:14,018 INFO L290 TraceCheckUtils]: 198: Hoare triple {12499#(<= ~counter~0 10)} assume true; {12499#(<= ~counter~0 10)} is VALID [2022-04-27 12:51:14,019 INFO L284 TraceCheckUtils]: 199: Hoare quadruple {12499#(<= ~counter~0 10)} {12499#(<= ~counter~0 10)} #70#return; {12499#(<= ~counter~0 10)} is VALID [2022-04-27 12:51:14,020 INFO L272 TraceCheckUtils]: 200: Hoare triple {12499#(<= ~counter~0 10)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {12499#(<= ~counter~0 10)} is VALID [2022-04-27 12:51:14,020 INFO L290 TraceCheckUtils]: 201: Hoare triple {12499#(<= ~counter~0 10)} ~cond := #in~cond; {12499#(<= ~counter~0 10)} is VALID [2022-04-27 12:51:14,021 INFO L290 TraceCheckUtils]: 202: Hoare triple {12499#(<= ~counter~0 10)} assume !(0 == ~cond); {12499#(<= ~counter~0 10)} is VALID [2022-04-27 12:51:14,021 INFO L290 TraceCheckUtils]: 203: Hoare triple {12499#(<= ~counter~0 10)} assume true; {12499#(<= ~counter~0 10)} is VALID [2022-04-27 12:51:14,022 INFO L284 TraceCheckUtils]: 204: Hoare quadruple {12499#(<= ~counter~0 10)} {12499#(<= ~counter~0 10)} #72#return; {12499#(<= ~counter~0 10)} is VALID [2022-04-27 12:51:14,022 INFO L290 TraceCheckUtils]: 205: Hoare triple {12499#(<= ~counter~0 10)} assume !!(~a~0 != ~b~0); {12499#(<= ~counter~0 10)} is VALID [2022-04-27 12:51:14,023 INFO L290 TraceCheckUtils]: 206: Hoare triple {12499#(<= ~counter~0 10)} assume ~a~0 > ~b~0;~a~0 := ~a~0 - ~b~0;~p~0 := ~p~0 - ~q~0;~r~0 := ~r~0 - ~s~0; {12499#(<= ~counter~0 10)} is VALID [2022-04-27 12:51:14,023 INFO L290 TraceCheckUtils]: 207: Hoare triple {12499#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12557#(<= |main_#t~post6| 10)} is VALID [2022-04-27 12:51:14,024 INFO L290 TraceCheckUtils]: 208: Hoare triple {12557#(<= |main_#t~post6| 10)} assume !(#t~post6 < 50);havoc #t~post6; {11921#false} is VALID [2022-04-27 12:51:14,024 INFO L272 TraceCheckUtils]: 209: Hoare triple {11921#false} call __VERIFIER_assert((if 0 == ~a~0 - ~b~0 then 1 else 0)); {11921#false} is VALID [2022-04-27 12:51:14,024 INFO L290 TraceCheckUtils]: 210: Hoare triple {11921#false} ~cond := #in~cond; {11921#false} is VALID [2022-04-27 12:51:14,024 INFO L290 TraceCheckUtils]: 211: Hoare triple {11921#false} assume 0 == ~cond; {11921#false} is VALID [2022-04-27 12:51:14,024 INFO L290 TraceCheckUtils]: 212: Hoare triple {11921#false} assume !false; {11921#false} is VALID [2022-04-27 12:51:14,025 INFO L134 CoverageAnalysis]: Checked inductivity of 2139 backedges. 60 proven. 1955 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2022-04-27 12:51:14,025 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:51:14,966 INFO L290 TraceCheckUtils]: 212: Hoare triple {11921#false} assume !false; {11921#false} is VALID [2022-04-27 12:51:14,966 INFO L290 TraceCheckUtils]: 211: Hoare triple {11921#false} assume 0 == ~cond; {11921#false} is VALID [2022-04-27 12:51:14,966 INFO L290 TraceCheckUtils]: 210: Hoare triple {11921#false} ~cond := #in~cond; {11921#false} is VALID [2022-04-27 12:51:14,966 INFO L272 TraceCheckUtils]: 209: Hoare triple {11921#false} call __VERIFIER_assert((if 0 == ~a~0 - ~b~0 then 1 else 0)); {11921#false} is VALID [2022-04-27 12:51:14,966 INFO L290 TraceCheckUtils]: 208: Hoare triple {12585#(< |main_#t~post6| 50)} assume !(#t~post6 < 50);havoc #t~post6; {11921#false} is VALID [2022-04-27 12:51:14,967 INFO L290 TraceCheckUtils]: 207: Hoare triple {12589#(< ~counter~0 50)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12585#(< |main_#t~post6| 50)} is VALID [2022-04-27 12:51:14,967 INFO L290 TraceCheckUtils]: 206: Hoare triple {12589#(< ~counter~0 50)} assume ~a~0 > ~b~0;~a~0 := ~a~0 - ~b~0;~p~0 := ~p~0 - ~q~0;~r~0 := ~r~0 - ~s~0; {12589#(< ~counter~0 50)} is VALID [2022-04-27 12:51:14,967 INFO L290 TraceCheckUtils]: 205: Hoare triple {12589#(< ~counter~0 50)} assume !!(~a~0 != ~b~0); {12589#(< ~counter~0 50)} is VALID [2022-04-27 12:51:14,968 INFO L284 TraceCheckUtils]: 204: Hoare quadruple {11920#true} {12589#(< ~counter~0 50)} #72#return; {12589#(< ~counter~0 50)} is VALID [2022-04-27 12:51:14,968 INFO L290 TraceCheckUtils]: 203: Hoare triple {11920#true} assume true; {11920#true} is VALID [2022-04-27 12:51:14,968 INFO L290 TraceCheckUtils]: 202: Hoare triple {11920#true} assume !(0 == ~cond); {11920#true} is VALID [2022-04-27 12:51:14,968 INFO L290 TraceCheckUtils]: 201: Hoare triple {11920#true} ~cond := #in~cond; {11920#true} is VALID [2022-04-27 12:51:14,968 INFO L272 TraceCheckUtils]: 200: Hoare triple {12589#(< ~counter~0 50)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {11920#true} is VALID [2022-04-27 12:51:14,969 INFO L284 TraceCheckUtils]: 199: Hoare quadruple {11920#true} {12589#(< ~counter~0 50)} #70#return; {12589#(< ~counter~0 50)} is VALID [2022-04-27 12:51:14,969 INFO L290 TraceCheckUtils]: 198: Hoare triple {11920#true} assume true; {11920#true} is VALID [2022-04-27 12:51:14,969 INFO L290 TraceCheckUtils]: 197: Hoare triple {11920#true} assume !(0 == ~cond); {11920#true} is VALID [2022-04-27 12:51:14,969 INFO L290 TraceCheckUtils]: 196: Hoare triple {11920#true} ~cond := #in~cond; {11920#true} is VALID [2022-04-27 12:51:14,969 INFO L272 TraceCheckUtils]: 195: Hoare triple {12589#(< ~counter~0 50)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {11920#true} is VALID [2022-04-27 12:51:14,969 INFO L284 TraceCheckUtils]: 194: Hoare quadruple {11920#true} {12589#(< ~counter~0 50)} #68#return; {12589#(< ~counter~0 50)} is VALID [2022-04-27 12:51:14,970 INFO L290 TraceCheckUtils]: 193: Hoare triple {11920#true} assume true; {11920#true} is VALID [2022-04-27 12:51:14,970 INFO L290 TraceCheckUtils]: 192: Hoare triple {11920#true} assume !(0 == ~cond); {11920#true} is VALID [2022-04-27 12:51:14,970 INFO L290 TraceCheckUtils]: 191: Hoare triple {11920#true} ~cond := #in~cond; {11920#true} is VALID [2022-04-27 12:51:14,970 INFO L272 TraceCheckUtils]: 190: Hoare triple {12589#(< ~counter~0 50)} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {11920#true} is VALID [2022-04-27 12:51:14,970 INFO L290 TraceCheckUtils]: 189: Hoare triple {12589#(< ~counter~0 50)} assume !!(#t~post6 < 50);havoc #t~post6; {12589#(< ~counter~0 50)} is VALID [2022-04-27 12:51:14,970 INFO L290 TraceCheckUtils]: 188: Hoare triple {12647#(< ~counter~0 49)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12589#(< ~counter~0 50)} is VALID [2022-04-27 12:51:14,971 INFO L290 TraceCheckUtils]: 187: Hoare triple {12647#(< ~counter~0 49)} assume ~a~0 > ~b~0;~a~0 := ~a~0 - ~b~0;~p~0 := ~p~0 - ~q~0;~r~0 := ~r~0 - ~s~0; {12647#(< ~counter~0 49)} is VALID [2022-04-27 12:51:14,972 INFO L290 TraceCheckUtils]: 186: Hoare triple {12647#(< ~counter~0 49)} assume !!(~a~0 != ~b~0); {12647#(< ~counter~0 49)} is VALID [2022-04-27 12:51:14,972 INFO L284 TraceCheckUtils]: 185: Hoare quadruple {11920#true} {12647#(< ~counter~0 49)} #72#return; {12647#(< ~counter~0 49)} is VALID [2022-04-27 12:51:14,972 INFO L290 TraceCheckUtils]: 184: Hoare triple {11920#true} assume true; {11920#true} is VALID [2022-04-27 12:51:14,972 INFO L290 TraceCheckUtils]: 183: Hoare triple {11920#true} assume !(0 == ~cond); {11920#true} is VALID [2022-04-27 12:51:14,972 INFO L290 TraceCheckUtils]: 182: Hoare triple {11920#true} ~cond := #in~cond; {11920#true} is VALID [2022-04-27 12:51:14,972 INFO L272 TraceCheckUtils]: 181: Hoare triple {12647#(< ~counter~0 49)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {11920#true} is VALID [2022-04-27 12:51:14,973 INFO L284 TraceCheckUtils]: 180: Hoare quadruple {11920#true} {12647#(< ~counter~0 49)} #70#return; {12647#(< ~counter~0 49)} is VALID [2022-04-27 12:51:14,973 INFO L290 TraceCheckUtils]: 179: Hoare triple {11920#true} assume true; {11920#true} is VALID [2022-04-27 12:51:14,973 INFO L290 TraceCheckUtils]: 178: Hoare triple {11920#true} assume !(0 == ~cond); {11920#true} is VALID [2022-04-27 12:51:14,973 INFO L290 TraceCheckUtils]: 177: Hoare triple {11920#true} ~cond := #in~cond; {11920#true} is VALID [2022-04-27 12:51:14,973 INFO L272 TraceCheckUtils]: 176: Hoare triple {12647#(< ~counter~0 49)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {11920#true} is VALID [2022-04-27 12:51:14,974 INFO L284 TraceCheckUtils]: 175: Hoare quadruple {11920#true} {12647#(< ~counter~0 49)} #68#return; {12647#(< ~counter~0 49)} is VALID [2022-04-27 12:51:14,974 INFO L290 TraceCheckUtils]: 174: Hoare triple {11920#true} assume true; {11920#true} is VALID [2022-04-27 12:51:14,974 INFO L290 TraceCheckUtils]: 173: Hoare triple {11920#true} assume !(0 == ~cond); {11920#true} is VALID [2022-04-27 12:51:14,974 INFO L290 TraceCheckUtils]: 172: Hoare triple {11920#true} ~cond := #in~cond; {11920#true} is VALID [2022-04-27 12:51:14,974 INFO L272 TraceCheckUtils]: 171: Hoare triple {12647#(< ~counter~0 49)} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {11920#true} is VALID [2022-04-27 12:51:14,974 INFO L290 TraceCheckUtils]: 170: Hoare triple {12647#(< ~counter~0 49)} assume !!(#t~post6 < 50);havoc #t~post6; {12647#(< ~counter~0 49)} is VALID [2022-04-27 12:51:14,975 INFO L290 TraceCheckUtils]: 169: Hoare triple {12705#(< ~counter~0 48)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12647#(< ~counter~0 49)} is VALID [2022-04-27 12:51:14,975 INFO L290 TraceCheckUtils]: 168: Hoare triple {12705#(< ~counter~0 48)} assume ~a~0 > ~b~0;~a~0 := ~a~0 - ~b~0;~p~0 := ~p~0 - ~q~0;~r~0 := ~r~0 - ~s~0; {12705#(< ~counter~0 48)} is VALID [2022-04-27 12:51:14,975 INFO L290 TraceCheckUtils]: 167: Hoare triple {12705#(< ~counter~0 48)} assume !!(~a~0 != ~b~0); {12705#(< ~counter~0 48)} is VALID [2022-04-27 12:51:14,976 INFO L284 TraceCheckUtils]: 166: Hoare quadruple {11920#true} {12705#(< ~counter~0 48)} #72#return; {12705#(< ~counter~0 48)} is VALID [2022-04-27 12:51:14,976 INFO L290 TraceCheckUtils]: 165: Hoare triple {11920#true} assume true; {11920#true} is VALID [2022-04-27 12:51:14,976 INFO L290 TraceCheckUtils]: 164: Hoare triple {11920#true} assume !(0 == ~cond); {11920#true} is VALID [2022-04-27 12:51:14,976 INFO L290 TraceCheckUtils]: 163: Hoare triple {11920#true} ~cond := #in~cond; {11920#true} is VALID [2022-04-27 12:51:14,976 INFO L272 TraceCheckUtils]: 162: Hoare triple {12705#(< ~counter~0 48)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {11920#true} is VALID [2022-04-27 12:51:14,976 INFO L284 TraceCheckUtils]: 161: Hoare quadruple {11920#true} {12705#(< ~counter~0 48)} #70#return; {12705#(< ~counter~0 48)} is VALID [2022-04-27 12:51:14,976 INFO L290 TraceCheckUtils]: 160: Hoare triple {11920#true} assume true; {11920#true} is VALID [2022-04-27 12:51:14,976 INFO L290 TraceCheckUtils]: 159: Hoare triple {11920#true} assume !(0 == ~cond); {11920#true} is VALID [2022-04-27 12:51:14,977 INFO L290 TraceCheckUtils]: 158: Hoare triple {11920#true} ~cond := #in~cond; {11920#true} is VALID [2022-04-27 12:51:14,977 INFO L272 TraceCheckUtils]: 157: Hoare triple {12705#(< ~counter~0 48)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {11920#true} is VALID [2022-04-27 12:51:14,977 INFO L284 TraceCheckUtils]: 156: Hoare quadruple {11920#true} {12705#(< ~counter~0 48)} #68#return; {12705#(< ~counter~0 48)} is VALID [2022-04-27 12:51:14,977 INFO L290 TraceCheckUtils]: 155: Hoare triple {11920#true} assume true; {11920#true} is VALID [2022-04-27 12:51:14,977 INFO L290 TraceCheckUtils]: 154: Hoare triple {11920#true} assume !(0 == ~cond); {11920#true} is VALID [2022-04-27 12:51:14,977 INFO L290 TraceCheckUtils]: 153: Hoare triple {11920#true} ~cond := #in~cond; {11920#true} is VALID [2022-04-27 12:51:14,977 INFO L272 TraceCheckUtils]: 152: Hoare triple {12705#(< ~counter~0 48)} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {11920#true} is VALID [2022-04-27 12:51:14,978 INFO L290 TraceCheckUtils]: 151: Hoare triple {12705#(< ~counter~0 48)} assume !!(#t~post6 < 50);havoc #t~post6; {12705#(< ~counter~0 48)} is VALID [2022-04-27 12:51:14,978 INFO L290 TraceCheckUtils]: 150: Hoare triple {12763#(< ~counter~0 47)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12705#(< ~counter~0 48)} is VALID [2022-04-27 12:51:14,978 INFO L290 TraceCheckUtils]: 149: Hoare triple {12763#(< ~counter~0 47)} assume ~a~0 > ~b~0;~a~0 := ~a~0 - ~b~0;~p~0 := ~p~0 - ~q~0;~r~0 := ~r~0 - ~s~0; {12763#(< ~counter~0 47)} is VALID [2022-04-27 12:51:14,979 INFO L290 TraceCheckUtils]: 148: Hoare triple {12763#(< ~counter~0 47)} assume !!(~a~0 != ~b~0); {12763#(< ~counter~0 47)} is VALID [2022-04-27 12:51:14,979 INFO L284 TraceCheckUtils]: 147: Hoare quadruple {11920#true} {12763#(< ~counter~0 47)} #72#return; {12763#(< ~counter~0 47)} is VALID [2022-04-27 12:51:14,979 INFO L290 TraceCheckUtils]: 146: Hoare triple {11920#true} assume true; {11920#true} is VALID [2022-04-27 12:51:14,979 INFO L290 TraceCheckUtils]: 145: Hoare triple {11920#true} assume !(0 == ~cond); {11920#true} is VALID [2022-04-27 12:51:14,979 INFO L290 TraceCheckUtils]: 144: Hoare triple {11920#true} ~cond := #in~cond; {11920#true} is VALID [2022-04-27 12:51:14,979 INFO L272 TraceCheckUtils]: 143: Hoare triple {12763#(< ~counter~0 47)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {11920#true} is VALID [2022-04-27 12:51:14,980 INFO L284 TraceCheckUtils]: 142: Hoare quadruple {11920#true} {12763#(< ~counter~0 47)} #70#return; {12763#(< ~counter~0 47)} is VALID [2022-04-27 12:51:14,980 INFO L290 TraceCheckUtils]: 141: Hoare triple {11920#true} assume true; {11920#true} is VALID [2022-04-27 12:51:14,980 INFO L290 TraceCheckUtils]: 140: Hoare triple {11920#true} assume !(0 == ~cond); {11920#true} is VALID [2022-04-27 12:51:14,980 INFO L290 TraceCheckUtils]: 139: Hoare triple {11920#true} ~cond := #in~cond; {11920#true} is VALID [2022-04-27 12:51:14,980 INFO L272 TraceCheckUtils]: 138: Hoare triple {12763#(< ~counter~0 47)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {11920#true} is VALID [2022-04-27 12:51:14,981 INFO L284 TraceCheckUtils]: 137: Hoare quadruple {11920#true} {12763#(< ~counter~0 47)} #68#return; {12763#(< ~counter~0 47)} is VALID [2022-04-27 12:51:14,981 INFO L290 TraceCheckUtils]: 136: Hoare triple {11920#true} assume true; {11920#true} is VALID [2022-04-27 12:51:14,981 INFO L290 TraceCheckUtils]: 135: Hoare triple {11920#true} assume !(0 == ~cond); {11920#true} is VALID [2022-04-27 12:51:14,981 INFO L290 TraceCheckUtils]: 134: Hoare triple {11920#true} ~cond := #in~cond; {11920#true} is VALID [2022-04-27 12:51:14,981 INFO L272 TraceCheckUtils]: 133: Hoare triple {12763#(< ~counter~0 47)} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {11920#true} is VALID [2022-04-27 12:51:14,981 INFO L290 TraceCheckUtils]: 132: Hoare triple {12763#(< ~counter~0 47)} assume !!(#t~post6 < 50);havoc #t~post6; {12763#(< ~counter~0 47)} is VALID [2022-04-27 12:51:14,982 INFO L290 TraceCheckUtils]: 131: Hoare triple {12821#(< ~counter~0 46)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12763#(< ~counter~0 47)} is VALID [2022-04-27 12:51:14,982 INFO L290 TraceCheckUtils]: 130: Hoare triple {12821#(< ~counter~0 46)} assume ~a~0 > ~b~0;~a~0 := ~a~0 - ~b~0;~p~0 := ~p~0 - ~q~0;~r~0 := ~r~0 - ~s~0; {12821#(< ~counter~0 46)} is VALID [2022-04-27 12:51:14,982 INFO L290 TraceCheckUtils]: 129: Hoare triple {12821#(< ~counter~0 46)} assume !!(~a~0 != ~b~0); {12821#(< ~counter~0 46)} is VALID [2022-04-27 12:51:14,983 INFO L284 TraceCheckUtils]: 128: Hoare quadruple {11920#true} {12821#(< ~counter~0 46)} #72#return; {12821#(< ~counter~0 46)} is VALID [2022-04-27 12:51:14,983 INFO L290 TraceCheckUtils]: 127: Hoare triple {11920#true} assume true; {11920#true} is VALID [2022-04-27 12:51:14,983 INFO L290 TraceCheckUtils]: 126: Hoare triple {11920#true} assume !(0 == ~cond); {11920#true} is VALID [2022-04-27 12:51:14,983 INFO L290 TraceCheckUtils]: 125: Hoare triple {11920#true} ~cond := #in~cond; {11920#true} is VALID [2022-04-27 12:51:14,983 INFO L272 TraceCheckUtils]: 124: Hoare triple {12821#(< ~counter~0 46)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {11920#true} is VALID [2022-04-27 12:51:14,983 INFO L284 TraceCheckUtils]: 123: Hoare quadruple {11920#true} {12821#(< ~counter~0 46)} #70#return; {12821#(< ~counter~0 46)} is VALID [2022-04-27 12:51:14,983 INFO L290 TraceCheckUtils]: 122: Hoare triple {11920#true} assume true; {11920#true} is VALID [2022-04-27 12:51:14,983 INFO L290 TraceCheckUtils]: 121: Hoare triple {11920#true} assume !(0 == ~cond); {11920#true} is VALID [2022-04-27 12:51:14,984 INFO L290 TraceCheckUtils]: 120: Hoare triple {11920#true} ~cond := #in~cond; {11920#true} is VALID [2022-04-27 12:51:14,984 INFO L272 TraceCheckUtils]: 119: Hoare triple {12821#(< ~counter~0 46)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {11920#true} is VALID [2022-04-27 12:51:14,984 INFO L284 TraceCheckUtils]: 118: Hoare quadruple {11920#true} {12821#(< ~counter~0 46)} #68#return; {12821#(< ~counter~0 46)} is VALID [2022-04-27 12:51:14,984 INFO L290 TraceCheckUtils]: 117: Hoare triple {11920#true} assume true; {11920#true} is VALID [2022-04-27 12:51:14,984 INFO L290 TraceCheckUtils]: 116: Hoare triple {11920#true} assume !(0 == ~cond); {11920#true} is VALID [2022-04-27 12:51:14,984 INFO L290 TraceCheckUtils]: 115: Hoare triple {11920#true} ~cond := #in~cond; {11920#true} is VALID [2022-04-27 12:51:14,984 INFO L272 TraceCheckUtils]: 114: Hoare triple {12821#(< ~counter~0 46)} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {11920#true} is VALID [2022-04-27 12:51:14,985 INFO L290 TraceCheckUtils]: 113: Hoare triple {12821#(< ~counter~0 46)} assume !!(#t~post6 < 50);havoc #t~post6; {12821#(< ~counter~0 46)} is VALID [2022-04-27 12:51:14,985 INFO L290 TraceCheckUtils]: 112: Hoare triple {12879#(< ~counter~0 45)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12821#(< ~counter~0 46)} is VALID [2022-04-27 12:51:14,985 INFO L290 TraceCheckUtils]: 111: Hoare triple {12879#(< ~counter~0 45)} assume ~a~0 > ~b~0;~a~0 := ~a~0 - ~b~0;~p~0 := ~p~0 - ~q~0;~r~0 := ~r~0 - ~s~0; {12879#(< ~counter~0 45)} is VALID [2022-04-27 12:51:14,986 INFO L290 TraceCheckUtils]: 110: Hoare triple {12879#(< ~counter~0 45)} assume !!(~a~0 != ~b~0); {12879#(< ~counter~0 45)} is VALID [2022-04-27 12:51:14,986 INFO L284 TraceCheckUtils]: 109: Hoare quadruple {11920#true} {12879#(< ~counter~0 45)} #72#return; {12879#(< ~counter~0 45)} is VALID [2022-04-27 12:51:14,986 INFO L290 TraceCheckUtils]: 108: Hoare triple {11920#true} assume true; {11920#true} is VALID [2022-04-27 12:51:14,986 INFO L290 TraceCheckUtils]: 107: Hoare triple {11920#true} assume !(0 == ~cond); {11920#true} is VALID [2022-04-27 12:51:14,986 INFO L290 TraceCheckUtils]: 106: Hoare triple {11920#true} ~cond := #in~cond; {11920#true} is VALID [2022-04-27 12:51:14,986 INFO L272 TraceCheckUtils]: 105: Hoare triple {12879#(< ~counter~0 45)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {11920#true} is VALID [2022-04-27 12:51:14,987 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {11920#true} {12879#(< ~counter~0 45)} #70#return; {12879#(< ~counter~0 45)} is VALID [2022-04-27 12:51:14,987 INFO L290 TraceCheckUtils]: 103: Hoare triple {11920#true} assume true; {11920#true} is VALID [2022-04-27 12:51:14,987 INFO L290 TraceCheckUtils]: 102: Hoare triple {11920#true} assume !(0 == ~cond); {11920#true} is VALID [2022-04-27 12:51:14,987 INFO L290 TraceCheckUtils]: 101: Hoare triple {11920#true} ~cond := #in~cond; {11920#true} is VALID [2022-04-27 12:51:14,987 INFO L272 TraceCheckUtils]: 100: Hoare triple {12879#(< ~counter~0 45)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {11920#true} is VALID [2022-04-27 12:51:14,988 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {11920#true} {12879#(< ~counter~0 45)} #68#return; {12879#(< ~counter~0 45)} is VALID [2022-04-27 12:51:14,988 INFO L290 TraceCheckUtils]: 98: Hoare triple {11920#true} assume true; {11920#true} is VALID [2022-04-27 12:51:14,988 INFO L290 TraceCheckUtils]: 97: Hoare triple {11920#true} assume !(0 == ~cond); {11920#true} is VALID [2022-04-27 12:51:14,988 INFO L290 TraceCheckUtils]: 96: Hoare triple {11920#true} ~cond := #in~cond; {11920#true} is VALID [2022-04-27 12:51:14,988 INFO L272 TraceCheckUtils]: 95: Hoare triple {12879#(< ~counter~0 45)} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {11920#true} is VALID [2022-04-27 12:51:14,988 INFO L290 TraceCheckUtils]: 94: Hoare triple {12879#(< ~counter~0 45)} assume !!(#t~post6 < 50);havoc #t~post6; {12879#(< ~counter~0 45)} is VALID [2022-04-27 12:51:14,988 INFO L290 TraceCheckUtils]: 93: Hoare triple {12937#(< ~counter~0 44)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12879#(< ~counter~0 45)} is VALID [2022-04-27 12:51:14,989 INFO L290 TraceCheckUtils]: 92: Hoare triple {12937#(< ~counter~0 44)} assume ~a~0 > ~b~0;~a~0 := ~a~0 - ~b~0;~p~0 := ~p~0 - ~q~0;~r~0 := ~r~0 - ~s~0; {12937#(< ~counter~0 44)} is VALID [2022-04-27 12:51:14,989 INFO L290 TraceCheckUtils]: 91: Hoare triple {12937#(< ~counter~0 44)} assume !!(~a~0 != ~b~0); {12937#(< ~counter~0 44)} is VALID [2022-04-27 12:51:14,990 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {11920#true} {12937#(< ~counter~0 44)} #72#return; {12937#(< ~counter~0 44)} is VALID [2022-04-27 12:51:14,990 INFO L290 TraceCheckUtils]: 89: Hoare triple {11920#true} assume true; {11920#true} is VALID [2022-04-27 12:51:14,990 INFO L290 TraceCheckUtils]: 88: Hoare triple {11920#true} assume !(0 == ~cond); {11920#true} is VALID [2022-04-27 12:51:14,990 INFO L290 TraceCheckUtils]: 87: Hoare triple {11920#true} ~cond := #in~cond; {11920#true} is VALID [2022-04-27 12:51:14,990 INFO L272 TraceCheckUtils]: 86: Hoare triple {12937#(< ~counter~0 44)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {11920#true} is VALID [2022-04-27 12:51:14,990 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {11920#true} {12937#(< ~counter~0 44)} #70#return; {12937#(< ~counter~0 44)} is VALID [2022-04-27 12:51:14,990 INFO L290 TraceCheckUtils]: 84: Hoare triple {11920#true} assume true; {11920#true} is VALID [2022-04-27 12:51:14,990 INFO L290 TraceCheckUtils]: 83: Hoare triple {11920#true} assume !(0 == ~cond); {11920#true} is VALID [2022-04-27 12:51:14,991 INFO L290 TraceCheckUtils]: 82: Hoare triple {11920#true} ~cond := #in~cond; {11920#true} is VALID [2022-04-27 12:51:14,991 INFO L272 TraceCheckUtils]: 81: Hoare triple {12937#(< ~counter~0 44)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {11920#true} is VALID [2022-04-27 12:51:14,991 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {11920#true} {12937#(< ~counter~0 44)} #68#return; {12937#(< ~counter~0 44)} is VALID [2022-04-27 12:51:14,991 INFO L290 TraceCheckUtils]: 79: Hoare triple {11920#true} assume true; {11920#true} is VALID [2022-04-27 12:51:14,991 INFO L290 TraceCheckUtils]: 78: Hoare triple {11920#true} assume !(0 == ~cond); {11920#true} is VALID [2022-04-27 12:51:14,991 INFO L290 TraceCheckUtils]: 77: Hoare triple {11920#true} ~cond := #in~cond; {11920#true} is VALID [2022-04-27 12:51:14,991 INFO L272 TraceCheckUtils]: 76: Hoare triple {12937#(< ~counter~0 44)} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {11920#true} is VALID [2022-04-27 12:51:14,992 INFO L290 TraceCheckUtils]: 75: Hoare triple {12937#(< ~counter~0 44)} assume !!(#t~post6 < 50);havoc #t~post6; {12937#(< ~counter~0 44)} is VALID [2022-04-27 12:51:14,992 INFO L290 TraceCheckUtils]: 74: Hoare triple {12995#(< ~counter~0 43)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12937#(< ~counter~0 44)} is VALID [2022-04-27 12:51:14,992 INFO L290 TraceCheckUtils]: 73: Hoare triple {12995#(< ~counter~0 43)} assume ~a~0 > ~b~0;~a~0 := ~a~0 - ~b~0;~p~0 := ~p~0 - ~q~0;~r~0 := ~r~0 - ~s~0; {12995#(< ~counter~0 43)} is VALID [2022-04-27 12:51:14,992 INFO L290 TraceCheckUtils]: 72: Hoare triple {12995#(< ~counter~0 43)} assume !!(~a~0 != ~b~0); {12995#(< ~counter~0 43)} is VALID [2022-04-27 12:51:14,993 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {11920#true} {12995#(< ~counter~0 43)} #72#return; {12995#(< ~counter~0 43)} is VALID [2022-04-27 12:51:14,993 INFO L290 TraceCheckUtils]: 70: Hoare triple {11920#true} assume true; {11920#true} is VALID [2022-04-27 12:51:14,993 INFO L290 TraceCheckUtils]: 69: Hoare triple {11920#true} assume !(0 == ~cond); {11920#true} is VALID [2022-04-27 12:51:14,993 INFO L290 TraceCheckUtils]: 68: Hoare triple {11920#true} ~cond := #in~cond; {11920#true} is VALID [2022-04-27 12:51:14,993 INFO L272 TraceCheckUtils]: 67: Hoare triple {12995#(< ~counter~0 43)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {11920#true} is VALID [2022-04-27 12:51:14,994 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {11920#true} {12995#(< ~counter~0 43)} #70#return; {12995#(< ~counter~0 43)} is VALID [2022-04-27 12:51:14,994 INFO L290 TraceCheckUtils]: 65: Hoare triple {11920#true} assume true; {11920#true} is VALID [2022-04-27 12:51:14,994 INFO L290 TraceCheckUtils]: 64: Hoare triple {11920#true} assume !(0 == ~cond); {11920#true} is VALID [2022-04-27 12:51:14,994 INFO L290 TraceCheckUtils]: 63: Hoare triple {11920#true} ~cond := #in~cond; {11920#true} is VALID [2022-04-27 12:51:14,994 INFO L272 TraceCheckUtils]: 62: Hoare triple {12995#(< ~counter~0 43)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {11920#true} is VALID [2022-04-27 12:51:14,995 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {11920#true} {12995#(< ~counter~0 43)} #68#return; {12995#(< ~counter~0 43)} is VALID [2022-04-27 12:51:14,995 INFO L290 TraceCheckUtils]: 60: Hoare triple {11920#true} assume true; {11920#true} is VALID [2022-04-27 12:51:14,995 INFO L290 TraceCheckUtils]: 59: Hoare triple {11920#true} assume !(0 == ~cond); {11920#true} is VALID [2022-04-27 12:51:14,995 INFO L290 TraceCheckUtils]: 58: Hoare triple {11920#true} ~cond := #in~cond; {11920#true} is VALID [2022-04-27 12:51:14,995 INFO L272 TraceCheckUtils]: 57: Hoare triple {12995#(< ~counter~0 43)} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {11920#true} is VALID [2022-04-27 12:51:14,995 INFO L290 TraceCheckUtils]: 56: Hoare triple {12995#(< ~counter~0 43)} assume !!(#t~post6 < 50);havoc #t~post6; {12995#(< ~counter~0 43)} is VALID [2022-04-27 12:51:14,995 INFO L290 TraceCheckUtils]: 55: Hoare triple {13053#(< ~counter~0 42)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12995#(< ~counter~0 43)} is VALID [2022-04-27 12:51:14,996 INFO L290 TraceCheckUtils]: 54: Hoare triple {13053#(< ~counter~0 42)} assume ~a~0 > ~b~0;~a~0 := ~a~0 - ~b~0;~p~0 := ~p~0 - ~q~0;~r~0 := ~r~0 - ~s~0; {13053#(< ~counter~0 42)} is VALID [2022-04-27 12:51:14,996 INFO L290 TraceCheckUtils]: 53: Hoare triple {13053#(< ~counter~0 42)} assume !!(~a~0 != ~b~0); {13053#(< ~counter~0 42)} is VALID [2022-04-27 12:51:14,997 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {11920#true} {13053#(< ~counter~0 42)} #72#return; {13053#(< ~counter~0 42)} is VALID [2022-04-27 12:51:14,997 INFO L290 TraceCheckUtils]: 51: Hoare triple {11920#true} assume true; {11920#true} is VALID [2022-04-27 12:51:14,997 INFO L290 TraceCheckUtils]: 50: Hoare triple {11920#true} assume !(0 == ~cond); {11920#true} is VALID [2022-04-27 12:51:14,997 INFO L290 TraceCheckUtils]: 49: Hoare triple {11920#true} ~cond := #in~cond; {11920#true} is VALID [2022-04-27 12:51:14,997 INFO L272 TraceCheckUtils]: 48: Hoare triple {13053#(< ~counter~0 42)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {11920#true} is VALID [2022-04-27 12:51:14,997 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {11920#true} {13053#(< ~counter~0 42)} #70#return; {13053#(< ~counter~0 42)} is VALID [2022-04-27 12:51:14,997 INFO L290 TraceCheckUtils]: 46: Hoare triple {11920#true} assume true; {11920#true} is VALID [2022-04-27 12:51:14,997 INFO L290 TraceCheckUtils]: 45: Hoare triple {11920#true} assume !(0 == ~cond); {11920#true} is VALID [2022-04-27 12:51:14,998 INFO L290 TraceCheckUtils]: 44: Hoare triple {11920#true} ~cond := #in~cond; {11920#true} is VALID [2022-04-27 12:51:14,998 INFO L272 TraceCheckUtils]: 43: Hoare triple {13053#(< ~counter~0 42)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {11920#true} is VALID [2022-04-27 12:51:14,998 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {11920#true} {13053#(< ~counter~0 42)} #68#return; {13053#(< ~counter~0 42)} is VALID [2022-04-27 12:51:14,998 INFO L290 TraceCheckUtils]: 41: Hoare triple {11920#true} assume true; {11920#true} is VALID [2022-04-27 12:51:14,998 INFO L290 TraceCheckUtils]: 40: Hoare triple {11920#true} assume !(0 == ~cond); {11920#true} is VALID [2022-04-27 12:51:14,998 INFO L290 TraceCheckUtils]: 39: Hoare triple {11920#true} ~cond := #in~cond; {11920#true} is VALID [2022-04-27 12:51:14,998 INFO L272 TraceCheckUtils]: 38: Hoare triple {13053#(< ~counter~0 42)} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {11920#true} is VALID [2022-04-27 12:51:14,999 INFO L290 TraceCheckUtils]: 37: Hoare triple {13053#(< ~counter~0 42)} assume !!(#t~post6 < 50);havoc #t~post6; {13053#(< ~counter~0 42)} is VALID [2022-04-27 12:51:14,999 INFO L290 TraceCheckUtils]: 36: Hoare triple {13111#(< ~counter~0 41)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {13053#(< ~counter~0 42)} is VALID [2022-04-27 12:51:14,999 INFO L290 TraceCheckUtils]: 35: Hoare triple {13111#(< ~counter~0 41)} assume ~a~0 > ~b~0;~a~0 := ~a~0 - ~b~0;~p~0 := ~p~0 - ~q~0;~r~0 := ~r~0 - ~s~0; {13111#(< ~counter~0 41)} is VALID [2022-04-27 12:51:15,000 INFO L290 TraceCheckUtils]: 34: Hoare triple {13111#(< ~counter~0 41)} assume !!(~a~0 != ~b~0); {13111#(< ~counter~0 41)} is VALID [2022-04-27 12:51:15,000 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {11920#true} {13111#(< ~counter~0 41)} #72#return; {13111#(< ~counter~0 41)} is VALID [2022-04-27 12:51:15,000 INFO L290 TraceCheckUtils]: 32: Hoare triple {11920#true} assume true; {11920#true} is VALID [2022-04-27 12:51:15,000 INFO L290 TraceCheckUtils]: 31: Hoare triple {11920#true} assume !(0 == ~cond); {11920#true} is VALID [2022-04-27 12:51:15,000 INFO L290 TraceCheckUtils]: 30: Hoare triple {11920#true} ~cond := #in~cond; {11920#true} is VALID [2022-04-27 12:51:15,000 INFO L272 TraceCheckUtils]: 29: Hoare triple {13111#(< ~counter~0 41)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {11920#true} is VALID [2022-04-27 12:51:15,001 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {11920#true} {13111#(< ~counter~0 41)} #70#return; {13111#(< ~counter~0 41)} is VALID [2022-04-27 12:51:15,001 INFO L290 TraceCheckUtils]: 27: Hoare triple {11920#true} assume true; {11920#true} is VALID [2022-04-27 12:51:15,001 INFO L290 TraceCheckUtils]: 26: Hoare triple {11920#true} assume !(0 == ~cond); {11920#true} is VALID [2022-04-27 12:51:15,001 INFO L290 TraceCheckUtils]: 25: Hoare triple {11920#true} ~cond := #in~cond; {11920#true} is VALID [2022-04-27 12:51:15,001 INFO L272 TraceCheckUtils]: 24: Hoare triple {13111#(< ~counter~0 41)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {11920#true} is VALID [2022-04-27 12:51:15,002 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {11920#true} {13111#(< ~counter~0 41)} #68#return; {13111#(< ~counter~0 41)} is VALID [2022-04-27 12:51:15,002 INFO L290 TraceCheckUtils]: 22: Hoare triple {11920#true} assume true; {11920#true} is VALID [2022-04-27 12:51:15,002 INFO L290 TraceCheckUtils]: 21: Hoare triple {11920#true} assume !(0 == ~cond); {11920#true} is VALID [2022-04-27 12:51:15,002 INFO L290 TraceCheckUtils]: 20: Hoare triple {11920#true} ~cond := #in~cond; {11920#true} is VALID [2022-04-27 12:51:15,002 INFO L272 TraceCheckUtils]: 19: Hoare triple {13111#(< ~counter~0 41)} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {11920#true} is VALID [2022-04-27 12:51:15,002 INFO L290 TraceCheckUtils]: 18: Hoare triple {13111#(< ~counter~0 41)} assume !!(#t~post6 < 50);havoc #t~post6; {13111#(< ~counter~0 41)} is VALID [2022-04-27 12:51:15,003 INFO L290 TraceCheckUtils]: 17: Hoare triple {13169#(< ~counter~0 40)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {13111#(< ~counter~0 41)} is VALID [2022-04-27 12:51:15,003 INFO L290 TraceCheckUtils]: 16: Hoare triple {13169#(< ~counter~0 40)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {13169#(< ~counter~0 40)} is VALID [2022-04-27 12:51:15,003 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {11920#true} {13169#(< ~counter~0 40)} #66#return; {13169#(< ~counter~0 40)} is VALID [2022-04-27 12:51:15,003 INFO L290 TraceCheckUtils]: 14: Hoare triple {11920#true} assume true; {11920#true} is VALID [2022-04-27 12:51:15,004 INFO L290 TraceCheckUtils]: 13: Hoare triple {11920#true} assume !(0 == ~cond); {11920#true} is VALID [2022-04-27 12:51:15,004 INFO L290 TraceCheckUtils]: 12: Hoare triple {11920#true} ~cond := #in~cond; {11920#true} is VALID [2022-04-27 12:51:15,004 INFO L272 TraceCheckUtils]: 11: Hoare triple {13169#(< ~counter~0 40)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {11920#true} is VALID [2022-04-27 12:51:15,004 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {11920#true} {13169#(< ~counter~0 40)} #64#return; {13169#(< ~counter~0 40)} is VALID [2022-04-27 12:51:15,004 INFO L290 TraceCheckUtils]: 9: Hoare triple {11920#true} assume true; {11920#true} is VALID [2022-04-27 12:51:15,004 INFO L290 TraceCheckUtils]: 8: Hoare triple {11920#true} assume !(0 == ~cond); {11920#true} is VALID [2022-04-27 12:51:15,004 INFO L290 TraceCheckUtils]: 7: Hoare triple {11920#true} ~cond := #in~cond; {11920#true} is VALID [2022-04-27 12:51:15,004 INFO L272 TraceCheckUtils]: 6: Hoare triple {13169#(< ~counter~0 40)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {11920#true} is VALID [2022-04-27 12:51:15,005 INFO L290 TraceCheckUtils]: 5: Hoare triple {13169#(< ~counter~0 40)} havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~x~0;havoc ~y~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {13169#(< ~counter~0 40)} is VALID [2022-04-27 12:51:15,005 INFO L272 TraceCheckUtils]: 4: Hoare triple {13169#(< ~counter~0 40)} call #t~ret7 := main(); {13169#(< ~counter~0 40)} is VALID [2022-04-27 12:51:15,005 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13169#(< ~counter~0 40)} {11920#true} #82#return; {13169#(< ~counter~0 40)} is VALID [2022-04-27 12:51:15,005 INFO L290 TraceCheckUtils]: 2: Hoare triple {13169#(< ~counter~0 40)} assume true; {13169#(< ~counter~0 40)} is VALID [2022-04-27 12:51:15,006 INFO L290 TraceCheckUtils]: 1: Hoare triple {11920#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {13169#(< ~counter~0 40)} is VALID [2022-04-27 12:51:15,006 INFO L272 TraceCheckUtils]: 0: Hoare triple {11920#true} call ULTIMATE.init(); {11920#true} is VALID [2022-04-27 12:51:15,007 INFO L134 CoverageAnalysis]: Checked inductivity of 2139 backedges. 60 proven. 335 refuted. 0 times theorem prover too weak. 1744 trivial. 0 not checked. [2022-04-27 12:51:15,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:51:15,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582248200] [2022-04-27 12:51:15,007 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:51:15,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [26090370] [2022-04-27 12:51:15,007 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [26090370] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 12:51:15,007 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 12:51:15,007 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2022-04-27 12:51:15,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679225151] [2022-04-27 12:51:15,008 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 12:51:15,009 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 5.153846153846154) internal successors, (134), 26 states have internal predecessors, (134), 24 states have call successors, (68), 14 states have call predecessors, (68), 13 states have return successors, (66), 22 states have call predecessors, (66), 23 states have call successors, (66) Word has length 213 [2022-04-27 12:51:15,013 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:51:15,013 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 26 states, 26 states have (on average 5.153846153846154) internal successors, (134), 26 states have internal predecessors, (134), 24 states have call successors, (68), 14 states have call predecessors, (68), 13 states have return successors, (66), 22 states have call predecessors, (66), 23 states have call successors, (66) [2022-04-27 12:51:15,219 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 268 edges. 268 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:51:15,219 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-27 12:51:15,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:51:15,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-27 12:51:15,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=369, Unknown=0, NotChecked=0, Total=650 [2022-04-27 12:51:15,220 INFO L87 Difference]: Start difference. First operand 507 states and 572 transitions. Second operand has 26 states, 26 states have (on average 5.153846153846154) internal successors, (134), 26 states have internal predecessors, (134), 24 states have call successors, (68), 14 states have call predecessors, (68), 13 states have return successors, (66), 22 states have call predecessors, (66), 23 states have call successors, (66) [2022-04-27 12:51:17,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:51:17,481 INFO L93 Difference]: Finished difference Result 1152 states and 1349 transitions. [2022-04-27 12:51:17,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-04-27 12:51:17,481 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 5.153846153846154) internal successors, (134), 26 states have internal predecessors, (134), 24 states have call successors, (68), 14 states have call predecessors, (68), 13 states have return successors, (66), 22 states have call predecessors, (66), 23 states have call successors, (66) Word has length 213 [2022-04-27 12:51:17,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:51:17,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 5.153846153846154) internal successors, (134), 26 states have internal predecessors, (134), 24 states have call successors, (68), 14 states have call predecessors, (68), 13 states have return successors, (66), 22 states have call predecessors, (66), 23 states have call successors, (66) [2022-04-27 12:51:17,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 350 transitions. [2022-04-27 12:51:17,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 5.153846153846154) internal successors, (134), 26 states have internal predecessors, (134), 24 states have call successors, (68), 14 states have call predecessors, (68), 13 states have return successors, (66), 22 states have call predecessors, (66), 23 states have call successors, (66) [2022-04-27 12:51:17,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 350 transitions. [2022-04-27 12:51:17,502 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 46 states and 350 transitions. [2022-04-27 12:51:17,828 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 350 edges. 350 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:51:17,907 INFO L225 Difference]: With dead ends: 1152 [2022-04-27 12:51:17,908 INFO L226 Difference]: Without dead ends: 1143 [2022-04-27 12:51:17,909 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 446 GetRequests, 401 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=796, Invalid=1366, Unknown=0, NotChecked=0, Total=2162 [2022-04-27 12:51:17,910 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 239 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 159 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 159 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-27 12:51:17,910 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 394 Invalid, 500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [159 Valid, 341 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-27 12:51:17,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1143 states. [2022-04-27 12:51:18,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1143 to 1143. [2022-04-27 12:51:18,466 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:51:18,468 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1143 states. Second operand has 1143 states, 755 states have (on average 1.0900662251655628) internal successors, (823), 777 states have internal predecessors, (823), 236 states have call successors, (236), 152 states have call predecessors, (236), 151 states have return successors, (233), 213 states have call predecessors, (233), 233 states have call successors, (233) [2022-04-27 12:51:18,469 INFO L74 IsIncluded]: Start isIncluded. First operand 1143 states. Second operand has 1143 states, 755 states have (on average 1.0900662251655628) internal successors, (823), 777 states have internal predecessors, (823), 236 states have call successors, (236), 152 states have call predecessors, (236), 151 states have return successors, (233), 213 states have call predecessors, (233), 233 states have call successors, (233) [2022-04-27 12:51:18,471 INFO L87 Difference]: Start difference. First operand 1143 states. Second operand has 1143 states, 755 states have (on average 1.0900662251655628) internal successors, (823), 777 states have internal predecessors, (823), 236 states have call successors, (236), 152 states have call predecessors, (236), 151 states have return successors, (233), 213 states have call predecessors, (233), 233 states have call successors, (233) [2022-04-27 12:51:18,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:51:18,532 INFO L93 Difference]: Finished difference Result 1143 states and 1292 transitions. [2022-04-27 12:51:18,532 INFO L276 IsEmpty]: Start isEmpty. Operand 1143 states and 1292 transitions. [2022-04-27 12:51:18,536 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:51:18,536 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:51:18,538 INFO L74 IsIncluded]: Start isIncluded. First operand has 1143 states, 755 states have (on average 1.0900662251655628) internal successors, (823), 777 states have internal predecessors, (823), 236 states have call successors, (236), 152 states have call predecessors, (236), 151 states have return successors, (233), 213 states have call predecessors, (233), 233 states have call successors, (233) Second operand 1143 states. [2022-04-27 12:51:18,539 INFO L87 Difference]: Start difference. First operand has 1143 states, 755 states have (on average 1.0900662251655628) internal successors, (823), 777 states have internal predecessors, (823), 236 states have call successors, (236), 152 states have call predecessors, (236), 151 states have return successors, (233), 213 states have call predecessors, (233), 233 states have call successors, (233) Second operand 1143 states. [2022-04-27 12:51:18,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:51:18,603 INFO L93 Difference]: Finished difference Result 1143 states and 1292 transitions. [2022-04-27 12:51:18,603 INFO L276 IsEmpty]: Start isEmpty. Operand 1143 states and 1292 transitions. [2022-04-27 12:51:18,606 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:51:18,606 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:51:18,606 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:51:18,606 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:51:18,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1143 states, 755 states have (on average 1.0900662251655628) internal successors, (823), 777 states have internal predecessors, (823), 236 states have call successors, (236), 152 states have call predecessors, (236), 151 states have return successors, (233), 213 states have call predecessors, (233), 233 states have call successors, (233) [2022-04-27 12:51:18,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1143 states to 1143 states and 1292 transitions. [2022-04-27 12:51:18,688 INFO L78 Accepts]: Start accepts. Automaton has 1143 states and 1292 transitions. Word has length 213 [2022-04-27 12:51:18,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:51:18,688 INFO L495 AbstractCegarLoop]: Abstraction has 1143 states and 1292 transitions. [2022-04-27 12:51:18,689 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 5.153846153846154) internal successors, (134), 26 states have internal predecessors, (134), 24 states have call successors, (68), 14 states have call predecessors, (68), 13 states have return successors, (66), 22 states have call predecessors, (66), 23 states have call successors, (66) [2022-04-27 12:51:18,689 INFO L276 IsEmpty]: Start isEmpty. Operand 1143 states and 1292 transitions. [2022-04-27 12:51:18,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 442 [2022-04-27 12:51:18,698 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:51:18,698 INFO L195 NwaCegarLoop]: trace histogram [67, 66, 66, 23, 22, 22, 22, 22, 22, 22, 22, 22, 22, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:51:18,721 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-04-27 12:51:18,911 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-04-27 12:51:18,911 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:51:18,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:51:18,912 INFO L85 PathProgramCache]: Analyzing trace with hash -1767137023, now seen corresponding path program 4 times [2022-04-27 12:51:18,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:51:18,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106542650] [2022-04-27 12:51:18,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:51:18,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:51:18,958 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:51:18,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [144168137] [2022-04-27 12:51:18,959 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-27 12:51:18,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:51:18,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:51:18,962 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) [2022-04-27 12:51:18,991 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-04-27 12:51:19,159 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-27 12:51:19,159 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 12:51:19,164 INFO L263 TraceCheckSpWp]: Trace formula consists of 979 conjuncts, 49 conjunts are in the unsatisfiable core [2022-04-27 12:51:19,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:51:19,237 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:51:21,158 INFO L272 TraceCheckUtils]: 0: Hoare triple {18800#true} call ULTIMATE.init(); {18800#true} is VALID [2022-04-27 12:51:21,159 INFO L290 TraceCheckUtils]: 1: Hoare triple {18800#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {18808#(<= ~counter~0 0)} is VALID [2022-04-27 12:51:21,159 INFO L290 TraceCheckUtils]: 2: Hoare triple {18808#(<= ~counter~0 0)} assume true; {18808#(<= ~counter~0 0)} is VALID [2022-04-27 12:51:21,159 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18808#(<= ~counter~0 0)} {18800#true} #82#return; {18808#(<= ~counter~0 0)} is VALID [2022-04-27 12:51:21,160 INFO L272 TraceCheckUtils]: 4: Hoare triple {18808#(<= ~counter~0 0)} call #t~ret7 := main(); {18808#(<= ~counter~0 0)} is VALID [2022-04-27 12:51:21,160 INFO L290 TraceCheckUtils]: 5: Hoare triple {18808#(<= ~counter~0 0)} havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~x~0;havoc ~y~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {18808#(<= ~counter~0 0)} is VALID [2022-04-27 12:51:21,160 INFO L272 TraceCheckUtils]: 6: Hoare triple {18808#(<= ~counter~0 0)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {18808#(<= ~counter~0 0)} is VALID [2022-04-27 12:51:21,161 INFO L290 TraceCheckUtils]: 7: Hoare triple {18808#(<= ~counter~0 0)} ~cond := #in~cond; {18808#(<= ~counter~0 0)} is VALID [2022-04-27 12:51:21,161 INFO L290 TraceCheckUtils]: 8: Hoare triple {18808#(<= ~counter~0 0)} assume !(0 == ~cond); {18808#(<= ~counter~0 0)} is VALID [2022-04-27 12:51:21,161 INFO L290 TraceCheckUtils]: 9: Hoare triple {18808#(<= ~counter~0 0)} assume true; {18808#(<= ~counter~0 0)} is VALID [2022-04-27 12:51:21,162 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {18808#(<= ~counter~0 0)} {18808#(<= ~counter~0 0)} #64#return; {18808#(<= ~counter~0 0)} is VALID [2022-04-27 12:51:21,162 INFO L272 TraceCheckUtils]: 11: Hoare triple {18808#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {18808#(<= ~counter~0 0)} is VALID [2022-04-27 12:51:21,162 INFO L290 TraceCheckUtils]: 12: Hoare triple {18808#(<= ~counter~0 0)} ~cond := #in~cond; {18808#(<= ~counter~0 0)} is VALID [2022-04-27 12:51:21,162 INFO L290 TraceCheckUtils]: 13: Hoare triple {18808#(<= ~counter~0 0)} assume !(0 == ~cond); {18808#(<= ~counter~0 0)} is VALID [2022-04-27 12:51:21,163 INFO L290 TraceCheckUtils]: 14: Hoare triple {18808#(<= ~counter~0 0)} assume true; {18808#(<= ~counter~0 0)} is VALID [2022-04-27 12:51:21,163 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {18808#(<= ~counter~0 0)} {18808#(<= ~counter~0 0)} #66#return; {18808#(<= ~counter~0 0)} is VALID [2022-04-27 12:51:21,163 INFO L290 TraceCheckUtils]: 16: Hoare triple {18808#(<= ~counter~0 0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {18808#(<= ~counter~0 0)} is VALID [2022-04-27 12:51:21,164 INFO L290 TraceCheckUtils]: 17: Hoare triple {18808#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {18857#(<= ~counter~0 1)} is VALID [2022-04-27 12:51:21,164 INFO L290 TraceCheckUtils]: 18: Hoare triple {18857#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {18857#(<= ~counter~0 1)} is VALID [2022-04-27 12:51:21,165 INFO L272 TraceCheckUtils]: 19: Hoare triple {18857#(<= ~counter~0 1)} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {18857#(<= ~counter~0 1)} is VALID [2022-04-27 12:51:21,165 INFO L290 TraceCheckUtils]: 20: Hoare triple {18857#(<= ~counter~0 1)} ~cond := #in~cond; {18857#(<= ~counter~0 1)} is VALID [2022-04-27 12:51:21,165 INFO L290 TraceCheckUtils]: 21: Hoare triple {18857#(<= ~counter~0 1)} assume !(0 == ~cond); {18857#(<= ~counter~0 1)} is VALID [2022-04-27 12:51:21,166 INFO L290 TraceCheckUtils]: 22: Hoare triple {18857#(<= ~counter~0 1)} assume true; {18857#(<= ~counter~0 1)} is VALID [2022-04-27 12:51:21,166 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {18857#(<= ~counter~0 1)} {18857#(<= ~counter~0 1)} #68#return; {18857#(<= ~counter~0 1)} is VALID [2022-04-27 12:51:21,167 INFO L272 TraceCheckUtils]: 24: Hoare triple {18857#(<= ~counter~0 1)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {18857#(<= ~counter~0 1)} is VALID [2022-04-27 12:51:21,167 INFO L290 TraceCheckUtils]: 25: Hoare triple {18857#(<= ~counter~0 1)} ~cond := #in~cond; {18857#(<= ~counter~0 1)} is VALID [2022-04-27 12:51:21,168 INFO L290 TraceCheckUtils]: 26: Hoare triple {18857#(<= ~counter~0 1)} assume !(0 == ~cond); {18857#(<= ~counter~0 1)} is VALID [2022-04-27 12:51:21,168 INFO L290 TraceCheckUtils]: 27: Hoare triple {18857#(<= ~counter~0 1)} assume true; {18857#(<= ~counter~0 1)} is VALID [2022-04-27 12:51:21,169 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {18857#(<= ~counter~0 1)} {18857#(<= ~counter~0 1)} #70#return; {18857#(<= ~counter~0 1)} is VALID [2022-04-27 12:51:21,169 INFO L272 TraceCheckUtils]: 29: Hoare triple {18857#(<= ~counter~0 1)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {18857#(<= ~counter~0 1)} is VALID [2022-04-27 12:51:21,170 INFO L290 TraceCheckUtils]: 30: Hoare triple {18857#(<= ~counter~0 1)} ~cond := #in~cond; {18857#(<= ~counter~0 1)} is VALID [2022-04-27 12:51:21,170 INFO L290 TraceCheckUtils]: 31: Hoare triple {18857#(<= ~counter~0 1)} assume !(0 == ~cond); {18857#(<= ~counter~0 1)} is VALID [2022-04-27 12:51:21,170 INFO L290 TraceCheckUtils]: 32: Hoare triple {18857#(<= ~counter~0 1)} assume true; {18857#(<= ~counter~0 1)} is VALID [2022-04-27 12:51:21,171 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {18857#(<= ~counter~0 1)} {18857#(<= ~counter~0 1)} #72#return; {18857#(<= ~counter~0 1)} is VALID [2022-04-27 12:51:21,171 INFO L290 TraceCheckUtils]: 34: Hoare triple {18857#(<= ~counter~0 1)} assume !!(~a~0 != ~b~0); {18857#(<= ~counter~0 1)} is VALID [2022-04-27 12:51:21,171 INFO L290 TraceCheckUtils]: 35: Hoare triple {18857#(<= ~counter~0 1)} assume ~a~0 > ~b~0;~a~0 := ~a~0 - ~b~0;~p~0 := ~p~0 - ~q~0;~r~0 := ~r~0 - ~s~0; {18857#(<= ~counter~0 1)} is VALID [2022-04-27 12:51:21,172 INFO L290 TraceCheckUtils]: 36: Hoare triple {18857#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {18915#(<= ~counter~0 2)} is VALID [2022-04-27 12:51:21,172 INFO L290 TraceCheckUtils]: 37: Hoare triple {18915#(<= ~counter~0 2)} assume !!(#t~post6 < 50);havoc #t~post6; {18915#(<= ~counter~0 2)} is VALID [2022-04-27 12:51:21,173 INFO L272 TraceCheckUtils]: 38: Hoare triple {18915#(<= ~counter~0 2)} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {18915#(<= ~counter~0 2)} is VALID [2022-04-27 12:51:21,173 INFO L290 TraceCheckUtils]: 39: Hoare triple {18915#(<= ~counter~0 2)} ~cond := #in~cond; {18915#(<= ~counter~0 2)} is VALID [2022-04-27 12:51:21,173 INFO L290 TraceCheckUtils]: 40: Hoare triple {18915#(<= ~counter~0 2)} assume !(0 == ~cond); {18915#(<= ~counter~0 2)} is VALID [2022-04-27 12:51:21,173 INFO L290 TraceCheckUtils]: 41: Hoare triple {18915#(<= ~counter~0 2)} assume true; {18915#(<= ~counter~0 2)} is VALID [2022-04-27 12:51:21,174 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {18915#(<= ~counter~0 2)} {18915#(<= ~counter~0 2)} #68#return; {18915#(<= ~counter~0 2)} is VALID [2022-04-27 12:51:21,175 INFO L272 TraceCheckUtils]: 43: Hoare triple {18915#(<= ~counter~0 2)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {18915#(<= ~counter~0 2)} is VALID [2022-04-27 12:51:21,175 INFO L290 TraceCheckUtils]: 44: Hoare triple {18915#(<= ~counter~0 2)} ~cond := #in~cond; {18915#(<= ~counter~0 2)} is VALID [2022-04-27 12:51:21,175 INFO L290 TraceCheckUtils]: 45: Hoare triple {18915#(<= ~counter~0 2)} assume !(0 == ~cond); {18915#(<= ~counter~0 2)} is VALID [2022-04-27 12:51:21,175 INFO L290 TraceCheckUtils]: 46: Hoare triple {18915#(<= ~counter~0 2)} assume true; {18915#(<= ~counter~0 2)} is VALID [2022-04-27 12:51:21,176 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {18915#(<= ~counter~0 2)} {18915#(<= ~counter~0 2)} #70#return; {18915#(<= ~counter~0 2)} is VALID [2022-04-27 12:51:21,177 INFO L272 TraceCheckUtils]: 48: Hoare triple {18915#(<= ~counter~0 2)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {18915#(<= ~counter~0 2)} is VALID [2022-04-27 12:51:21,177 INFO L290 TraceCheckUtils]: 49: Hoare triple {18915#(<= ~counter~0 2)} ~cond := #in~cond; {18915#(<= ~counter~0 2)} is VALID [2022-04-27 12:51:21,178 INFO L290 TraceCheckUtils]: 50: Hoare triple {18915#(<= ~counter~0 2)} assume !(0 == ~cond); {18915#(<= ~counter~0 2)} is VALID [2022-04-27 12:51:21,178 INFO L290 TraceCheckUtils]: 51: Hoare triple {18915#(<= ~counter~0 2)} assume true; {18915#(<= ~counter~0 2)} is VALID [2022-04-27 12:51:21,179 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {18915#(<= ~counter~0 2)} {18915#(<= ~counter~0 2)} #72#return; {18915#(<= ~counter~0 2)} is VALID [2022-04-27 12:51:21,179 INFO L290 TraceCheckUtils]: 53: Hoare triple {18915#(<= ~counter~0 2)} assume !!(~a~0 != ~b~0); {18915#(<= ~counter~0 2)} is VALID [2022-04-27 12:51:21,179 INFO L290 TraceCheckUtils]: 54: Hoare triple {18915#(<= ~counter~0 2)} assume ~a~0 > ~b~0;~a~0 := ~a~0 - ~b~0;~p~0 := ~p~0 - ~q~0;~r~0 := ~r~0 - ~s~0; {18915#(<= ~counter~0 2)} is VALID [2022-04-27 12:51:21,180 INFO L290 TraceCheckUtils]: 55: Hoare triple {18915#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {18973#(<= ~counter~0 3)} is VALID [2022-04-27 12:51:21,180 INFO L290 TraceCheckUtils]: 56: Hoare triple {18973#(<= ~counter~0 3)} assume !!(#t~post6 < 50);havoc #t~post6; {18973#(<= ~counter~0 3)} is VALID [2022-04-27 12:51:21,180 INFO L272 TraceCheckUtils]: 57: Hoare triple {18973#(<= ~counter~0 3)} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {18973#(<= ~counter~0 3)} is VALID [2022-04-27 12:51:21,181 INFO L290 TraceCheckUtils]: 58: Hoare triple {18973#(<= ~counter~0 3)} ~cond := #in~cond; {18973#(<= ~counter~0 3)} is VALID [2022-04-27 12:51:21,181 INFO L290 TraceCheckUtils]: 59: Hoare triple {18973#(<= ~counter~0 3)} assume !(0 == ~cond); {18973#(<= ~counter~0 3)} is VALID [2022-04-27 12:51:21,181 INFO L290 TraceCheckUtils]: 60: Hoare triple {18973#(<= ~counter~0 3)} assume true; {18973#(<= ~counter~0 3)} is VALID [2022-04-27 12:51:21,182 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {18973#(<= ~counter~0 3)} {18973#(<= ~counter~0 3)} #68#return; {18973#(<= ~counter~0 3)} is VALID [2022-04-27 12:51:21,182 INFO L272 TraceCheckUtils]: 62: Hoare triple {18973#(<= ~counter~0 3)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {18973#(<= ~counter~0 3)} is VALID [2022-04-27 12:51:21,182 INFO L290 TraceCheckUtils]: 63: Hoare triple {18973#(<= ~counter~0 3)} ~cond := #in~cond; {18973#(<= ~counter~0 3)} is VALID [2022-04-27 12:51:21,183 INFO L290 TraceCheckUtils]: 64: Hoare triple {18973#(<= ~counter~0 3)} assume !(0 == ~cond); {18973#(<= ~counter~0 3)} is VALID [2022-04-27 12:51:21,183 INFO L290 TraceCheckUtils]: 65: Hoare triple {18973#(<= ~counter~0 3)} assume true; {18973#(<= ~counter~0 3)} is VALID [2022-04-27 12:51:21,183 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {18973#(<= ~counter~0 3)} {18973#(<= ~counter~0 3)} #70#return; {18973#(<= ~counter~0 3)} is VALID [2022-04-27 12:51:21,184 INFO L272 TraceCheckUtils]: 67: Hoare triple {18973#(<= ~counter~0 3)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {18973#(<= ~counter~0 3)} is VALID [2022-04-27 12:51:21,184 INFO L290 TraceCheckUtils]: 68: Hoare triple {18973#(<= ~counter~0 3)} ~cond := #in~cond; {18973#(<= ~counter~0 3)} is VALID [2022-04-27 12:51:21,185 INFO L290 TraceCheckUtils]: 69: Hoare triple {18973#(<= ~counter~0 3)} assume !(0 == ~cond); {18973#(<= ~counter~0 3)} is VALID [2022-04-27 12:51:21,185 INFO L290 TraceCheckUtils]: 70: Hoare triple {18973#(<= ~counter~0 3)} assume true; {18973#(<= ~counter~0 3)} is VALID [2022-04-27 12:51:21,185 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {18973#(<= ~counter~0 3)} {18973#(<= ~counter~0 3)} #72#return; {18973#(<= ~counter~0 3)} is VALID [2022-04-27 12:51:21,186 INFO L290 TraceCheckUtils]: 72: Hoare triple {18973#(<= ~counter~0 3)} assume !!(~a~0 != ~b~0); {18973#(<= ~counter~0 3)} is VALID [2022-04-27 12:51:21,186 INFO L290 TraceCheckUtils]: 73: Hoare triple {18973#(<= ~counter~0 3)} assume ~a~0 > ~b~0;~a~0 := ~a~0 - ~b~0;~p~0 := ~p~0 - ~q~0;~r~0 := ~r~0 - ~s~0; {18973#(<= ~counter~0 3)} is VALID [2022-04-27 12:51:21,186 INFO L290 TraceCheckUtils]: 74: Hoare triple {18973#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {19031#(<= ~counter~0 4)} is VALID [2022-04-27 12:51:21,187 INFO L290 TraceCheckUtils]: 75: Hoare triple {19031#(<= ~counter~0 4)} assume !!(#t~post6 < 50);havoc #t~post6; {19031#(<= ~counter~0 4)} is VALID [2022-04-27 12:51:21,187 INFO L272 TraceCheckUtils]: 76: Hoare triple {19031#(<= ~counter~0 4)} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {19031#(<= ~counter~0 4)} is VALID [2022-04-27 12:51:21,187 INFO L290 TraceCheckUtils]: 77: Hoare triple {19031#(<= ~counter~0 4)} ~cond := #in~cond; {19031#(<= ~counter~0 4)} is VALID [2022-04-27 12:51:21,188 INFO L290 TraceCheckUtils]: 78: Hoare triple {19031#(<= ~counter~0 4)} assume !(0 == ~cond); {19031#(<= ~counter~0 4)} is VALID [2022-04-27 12:51:21,188 INFO L290 TraceCheckUtils]: 79: Hoare triple {19031#(<= ~counter~0 4)} assume true; {19031#(<= ~counter~0 4)} is VALID [2022-04-27 12:51:21,188 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {19031#(<= ~counter~0 4)} {19031#(<= ~counter~0 4)} #68#return; {19031#(<= ~counter~0 4)} is VALID [2022-04-27 12:51:21,189 INFO L272 TraceCheckUtils]: 81: Hoare triple {19031#(<= ~counter~0 4)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {19031#(<= ~counter~0 4)} is VALID [2022-04-27 12:51:21,189 INFO L290 TraceCheckUtils]: 82: Hoare triple {19031#(<= ~counter~0 4)} ~cond := #in~cond; {19031#(<= ~counter~0 4)} is VALID [2022-04-27 12:51:21,189 INFO L290 TraceCheckUtils]: 83: Hoare triple {19031#(<= ~counter~0 4)} assume !(0 == ~cond); {19031#(<= ~counter~0 4)} is VALID [2022-04-27 12:51:21,190 INFO L290 TraceCheckUtils]: 84: Hoare triple {19031#(<= ~counter~0 4)} assume true; {19031#(<= ~counter~0 4)} is VALID [2022-04-27 12:51:21,190 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {19031#(<= ~counter~0 4)} {19031#(<= ~counter~0 4)} #70#return; {19031#(<= ~counter~0 4)} is VALID [2022-04-27 12:51:21,191 INFO L272 TraceCheckUtils]: 86: Hoare triple {19031#(<= ~counter~0 4)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {19031#(<= ~counter~0 4)} is VALID [2022-04-27 12:51:21,191 INFO L290 TraceCheckUtils]: 87: Hoare triple {19031#(<= ~counter~0 4)} ~cond := #in~cond; {19031#(<= ~counter~0 4)} is VALID [2022-04-27 12:51:21,195 INFO L290 TraceCheckUtils]: 88: Hoare triple {19031#(<= ~counter~0 4)} assume !(0 == ~cond); {19031#(<= ~counter~0 4)} is VALID [2022-04-27 12:51:21,195 INFO L290 TraceCheckUtils]: 89: Hoare triple {19031#(<= ~counter~0 4)} assume true; {19031#(<= ~counter~0 4)} is VALID [2022-04-27 12:51:21,196 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {19031#(<= ~counter~0 4)} {19031#(<= ~counter~0 4)} #72#return; {19031#(<= ~counter~0 4)} is VALID [2022-04-27 12:51:21,196 INFO L290 TraceCheckUtils]: 91: Hoare triple {19031#(<= ~counter~0 4)} assume !!(~a~0 != ~b~0); {19031#(<= ~counter~0 4)} is VALID [2022-04-27 12:51:21,197 INFO L290 TraceCheckUtils]: 92: Hoare triple {19031#(<= ~counter~0 4)} assume ~a~0 > ~b~0;~a~0 := ~a~0 - ~b~0;~p~0 := ~p~0 - ~q~0;~r~0 := ~r~0 - ~s~0; {19031#(<= ~counter~0 4)} is VALID [2022-04-27 12:51:21,197 INFO L290 TraceCheckUtils]: 93: Hoare triple {19031#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {19089#(<= ~counter~0 5)} is VALID [2022-04-27 12:51:21,198 INFO L290 TraceCheckUtils]: 94: Hoare triple {19089#(<= ~counter~0 5)} assume !!(#t~post6 < 50);havoc #t~post6; {19089#(<= ~counter~0 5)} is VALID [2022-04-27 12:51:21,198 INFO L272 TraceCheckUtils]: 95: Hoare triple {19089#(<= ~counter~0 5)} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {19089#(<= ~counter~0 5)} is VALID [2022-04-27 12:51:21,199 INFO L290 TraceCheckUtils]: 96: Hoare triple {19089#(<= ~counter~0 5)} ~cond := #in~cond; {19089#(<= ~counter~0 5)} is VALID [2022-04-27 12:51:21,199 INFO L290 TraceCheckUtils]: 97: Hoare triple {19089#(<= ~counter~0 5)} assume !(0 == ~cond); {19089#(<= ~counter~0 5)} is VALID [2022-04-27 12:51:21,199 INFO L290 TraceCheckUtils]: 98: Hoare triple {19089#(<= ~counter~0 5)} assume true; {19089#(<= ~counter~0 5)} is VALID [2022-04-27 12:51:21,200 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {19089#(<= ~counter~0 5)} {19089#(<= ~counter~0 5)} #68#return; {19089#(<= ~counter~0 5)} is VALID [2022-04-27 12:51:21,201 INFO L272 TraceCheckUtils]: 100: Hoare triple {19089#(<= ~counter~0 5)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {19089#(<= ~counter~0 5)} is VALID [2022-04-27 12:51:21,201 INFO L290 TraceCheckUtils]: 101: Hoare triple {19089#(<= ~counter~0 5)} ~cond := #in~cond; {19089#(<= ~counter~0 5)} is VALID [2022-04-27 12:51:21,201 INFO L290 TraceCheckUtils]: 102: Hoare triple {19089#(<= ~counter~0 5)} assume !(0 == ~cond); {19089#(<= ~counter~0 5)} is VALID [2022-04-27 12:51:21,202 INFO L290 TraceCheckUtils]: 103: Hoare triple {19089#(<= ~counter~0 5)} assume true; {19089#(<= ~counter~0 5)} is VALID [2022-04-27 12:51:21,202 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {19089#(<= ~counter~0 5)} {19089#(<= ~counter~0 5)} #70#return; {19089#(<= ~counter~0 5)} is VALID [2022-04-27 12:51:21,203 INFO L272 TraceCheckUtils]: 105: Hoare triple {19089#(<= ~counter~0 5)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {19089#(<= ~counter~0 5)} is VALID [2022-04-27 12:51:21,203 INFO L290 TraceCheckUtils]: 106: Hoare triple {19089#(<= ~counter~0 5)} ~cond := #in~cond; {19089#(<= ~counter~0 5)} is VALID [2022-04-27 12:51:21,204 INFO L290 TraceCheckUtils]: 107: Hoare triple {19089#(<= ~counter~0 5)} assume !(0 == ~cond); {19089#(<= ~counter~0 5)} is VALID [2022-04-27 12:51:21,204 INFO L290 TraceCheckUtils]: 108: Hoare triple {19089#(<= ~counter~0 5)} assume true; {19089#(<= ~counter~0 5)} is VALID [2022-04-27 12:51:21,205 INFO L284 TraceCheckUtils]: 109: Hoare quadruple {19089#(<= ~counter~0 5)} {19089#(<= ~counter~0 5)} #72#return; {19089#(<= ~counter~0 5)} is VALID [2022-04-27 12:51:21,205 INFO L290 TraceCheckUtils]: 110: Hoare triple {19089#(<= ~counter~0 5)} assume !!(~a~0 != ~b~0); {19089#(<= ~counter~0 5)} is VALID [2022-04-27 12:51:21,205 INFO L290 TraceCheckUtils]: 111: Hoare triple {19089#(<= ~counter~0 5)} assume ~a~0 > ~b~0;~a~0 := ~a~0 - ~b~0;~p~0 := ~p~0 - ~q~0;~r~0 := ~r~0 - ~s~0; {19089#(<= ~counter~0 5)} is VALID [2022-04-27 12:51:21,206 INFO L290 TraceCheckUtils]: 112: Hoare triple {19089#(<= ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {19147#(<= ~counter~0 6)} is VALID [2022-04-27 12:51:21,206 INFO L290 TraceCheckUtils]: 113: Hoare triple {19147#(<= ~counter~0 6)} assume !!(#t~post6 < 50);havoc #t~post6; {19147#(<= ~counter~0 6)} is VALID [2022-04-27 12:51:21,207 INFO L272 TraceCheckUtils]: 114: Hoare triple {19147#(<= ~counter~0 6)} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {19147#(<= ~counter~0 6)} is VALID [2022-04-27 12:51:21,207 INFO L290 TraceCheckUtils]: 115: Hoare triple {19147#(<= ~counter~0 6)} ~cond := #in~cond; {19147#(<= ~counter~0 6)} is VALID [2022-04-27 12:51:21,208 INFO L290 TraceCheckUtils]: 116: Hoare triple {19147#(<= ~counter~0 6)} assume !(0 == ~cond); {19147#(<= ~counter~0 6)} is VALID [2022-04-27 12:51:21,208 INFO L290 TraceCheckUtils]: 117: Hoare triple {19147#(<= ~counter~0 6)} assume true; {19147#(<= ~counter~0 6)} is VALID [2022-04-27 12:51:21,209 INFO L284 TraceCheckUtils]: 118: Hoare quadruple {19147#(<= ~counter~0 6)} {19147#(<= ~counter~0 6)} #68#return; {19147#(<= ~counter~0 6)} is VALID [2022-04-27 12:51:21,209 INFO L272 TraceCheckUtils]: 119: Hoare triple {19147#(<= ~counter~0 6)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {19147#(<= ~counter~0 6)} is VALID [2022-04-27 12:51:21,209 INFO L290 TraceCheckUtils]: 120: Hoare triple {19147#(<= ~counter~0 6)} ~cond := #in~cond; {19147#(<= ~counter~0 6)} is VALID [2022-04-27 12:51:21,210 INFO L290 TraceCheckUtils]: 121: Hoare triple {19147#(<= ~counter~0 6)} assume !(0 == ~cond); {19147#(<= ~counter~0 6)} is VALID [2022-04-27 12:51:21,210 INFO L290 TraceCheckUtils]: 122: Hoare triple {19147#(<= ~counter~0 6)} assume true; {19147#(<= ~counter~0 6)} is VALID [2022-04-27 12:51:21,211 INFO L284 TraceCheckUtils]: 123: Hoare quadruple {19147#(<= ~counter~0 6)} {19147#(<= ~counter~0 6)} #70#return; {19147#(<= ~counter~0 6)} is VALID [2022-04-27 12:51:21,211 INFO L272 TraceCheckUtils]: 124: Hoare triple {19147#(<= ~counter~0 6)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {19147#(<= ~counter~0 6)} is VALID [2022-04-27 12:51:21,211 INFO L290 TraceCheckUtils]: 125: Hoare triple {19147#(<= ~counter~0 6)} ~cond := #in~cond; {19147#(<= ~counter~0 6)} is VALID [2022-04-27 12:51:21,212 INFO L290 TraceCheckUtils]: 126: Hoare triple {19147#(<= ~counter~0 6)} assume !(0 == ~cond); {19147#(<= ~counter~0 6)} is VALID [2022-04-27 12:51:21,212 INFO L290 TraceCheckUtils]: 127: Hoare triple {19147#(<= ~counter~0 6)} assume true; {19147#(<= ~counter~0 6)} is VALID [2022-04-27 12:51:21,212 INFO L284 TraceCheckUtils]: 128: Hoare quadruple {19147#(<= ~counter~0 6)} {19147#(<= ~counter~0 6)} #72#return; {19147#(<= ~counter~0 6)} is VALID [2022-04-27 12:51:21,213 INFO L290 TraceCheckUtils]: 129: Hoare triple {19147#(<= ~counter~0 6)} assume !!(~a~0 != ~b~0); {19147#(<= ~counter~0 6)} is VALID [2022-04-27 12:51:21,213 INFO L290 TraceCheckUtils]: 130: Hoare triple {19147#(<= ~counter~0 6)} assume ~a~0 > ~b~0;~a~0 := ~a~0 - ~b~0;~p~0 := ~p~0 - ~q~0;~r~0 := ~r~0 - ~s~0; {19147#(<= ~counter~0 6)} is VALID [2022-04-27 12:51:21,213 INFO L290 TraceCheckUtils]: 131: Hoare triple {19147#(<= ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {19205#(<= ~counter~0 7)} is VALID [2022-04-27 12:51:21,214 INFO L290 TraceCheckUtils]: 132: Hoare triple {19205#(<= ~counter~0 7)} assume !!(#t~post6 < 50);havoc #t~post6; {19205#(<= ~counter~0 7)} is VALID [2022-04-27 12:51:21,214 INFO L272 TraceCheckUtils]: 133: Hoare triple {19205#(<= ~counter~0 7)} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {19205#(<= ~counter~0 7)} is VALID [2022-04-27 12:51:21,214 INFO L290 TraceCheckUtils]: 134: Hoare triple {19205#(<= ~counter~0 7)} ~cond := #in~cond; {19205#(<= ~counter~0 7)} is VALID [2022-04-27 12:51:21,215 INFO L290 TraceCheckUtils]: 135: Hoare triple {19205#(<= ~counter~0 7)} assume !(0 == ~cond); {19205#(<= ~counter~0 7)} is VALID [2022-04-27 12:51:21,215 INFO L290 TraceCheckUtils]: 136: Hoare triple {19205#(<= ~counter~0 7)} assume true; {19205#(<= ~counter~0 7)} is VALID [2022-04-27 12:51:21,216 INFO L284 TraceCheckUtils]: 137: Hoare quadruple {19205#(<= ~counter~0 7)} {19205#(<= ~counter~0 7)} #68#return; {19205#(<= ~counter~0 7)} is VALID [2022-04-27 12:51:21,226 INFO L272 TraceCheckUtils]: 138: Hoare triple {19205#(<= ~counter~0 7)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {19205#(<= ~counter~0 7)} is VALID [2022-04-27 12:51:21,226 INFO L290 TraceCheckUtils]: 139: Hoare triple {19205#(<= ~counter~0 7)} ~cond := #in~cond; {19205#(<= ~counter~0 7)} is VALID [2022-04-27 12:51:21,226 INFO L290 TraceCheckUtils]: 140: Hoare triple {19205#(<= ~counter~0 7)} assume !(0 == ~cond); {19205#(<= ~counter~0 7)} is VALID [2022-04-27 12:51:21,226 INFO L290 TraceCheckUtils]: 141: Hoare triple {19205#(<= ~counter~0 7)} assume true; {19205#(<= ~counter~0 7)} is VALID [2022-04-27 12:51:21,227 INFO L284 TraceCheckUtils]: 142: Hoare quadruple {19205#(<= ~counter~0 7)} {19205#(<= ~counter~0 7)} #70#return; {19205#(<= ~counter~0 7)} is VALID [2022-04-27 12:51:21,228 INFO L272 TraceCheckUtils]: 143: Hoare triple {19205#(<= ~counter~0 7)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {19205#(<= ~counter~0 7)} is VALID [2022-04-27 12:51:21,228 INFO L290 TraceCheckUtils]: 144: Hoare triple {19205#(<= ~counter~0 7)} ~cond := #in~cond; {19205#(<= ~counter~0 7)} is VALID [2022-04-27 12:51:21,228 INFO L290 TraceCheckUtils]: 145: Hoare triple {19205#(<= ~counter~0 7)} assume !(0 == ~cond); {19205#(<= ~counter~0 7)} is VALID [2022-04-27 12:51:21,228 INFO L290 TraceCheckUtils]: 146: Hoare triple {19205#(<= ~counter~0 7)} assume true; {19205#(<= ~counter~0 7)} is VALID [2022-04-27 12:51:21,229 INFO L284 TraceCheckUtils]: 147: Hoare quadruple {19205#(<= ~counter~0 7)} {19205#(<= ~counter~0 7)} #72#return; {19205#(<= ~counter~0 7)} is VALID [2022-04-27 12:51:21,229 INFO L290 TraceCheckUtils]: 148: Hoare triple {19205#(<= ~counter~0 7)} assume !!(~a~0 != ~b~0); {19205#(<= ~counter~0 7)} is VALID [2022-04-27 12:51:21,229 INFO L290 TraceCheckUtils]: 149: Hoare triple {19205#(<= ~counter~0 7)} assume ~a~0 > ~b~0;~a~0 := ~a~0 - ~b~0;~p~0 := ~p~0 - ~q~0;~r~0 := ~r~0 - ~s~0; {19205#(<= ~counter~0 7)} is VALID [2022-04-27 12:51:21,230 INFO L290 TraceCheckUtils]: 150: Hoare triple {19205#(<= ~counter~0 7)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {19263#(<= ~counter~0 8)} is VALID [2022-04-27 12:51:21,230 INFO L290 TraceCheckUtils]: 151: Hoare triple {19263#(<= ~counter~0 8)} assume !!(#t~post6 < 50);havoc #t~post6; {19263#(<= ~counter~0 8)} is VALID [2022-04-27 12:51:21,231 INFO L272 TraceCheckUtils]: 152: Hoare triple {19263#(<= ~counter~0 8)} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {19263#(<= ~counter~0 8)} is VALID [2022-04-27 12:51:21,231 INFO L290 TraceCheckUtils]: 153: Hoare triple {19263#(<= ~counter~0 8)} ~cond := #in~cond; {19263#(<= ~counter~0 8)} is VALID [2022-04-27 12:51:21,231 INFO L290 TraceCheckUtils]: 154: Hoare triple {19263#(<= ~counter~0 8)} assume !(0 == ~cond); {19263#(<= ~counter~0 8)} is VALID [2022-04-27 12:51:21,232 INFO L290 TraceCheckUtils]: 155: Hoare triple {19263#(<= ~counter~0 8)} assume true; {19263#(<= ~counter~0 8)} is VALID [2022-04-27 12:51:21,232 INFO L284 TraceCheckUtils]: 156: Hoare quadruple {19263#(<= ~counter~0 8)} {19263#(<= ~counter~0 8)} #68#return; {19263#(<= ~counter~0 8)} is VALID [2022-04-27 12:51:21,233 INFO L272 TraceCheckUtils]: 157: Hoare triple {19263#(<= ~counter~0 8)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {19263#(<= ~counter~0 8)} is VALID [2022-04-27 12:51:21,233 INFO L290 TraceCheckUtils]: 158: Hoare triple {19263#(<= ~counter~0 8)} ~cond := #in~cond; {19263#(<= ~counter~0 8)} is VALID [2022-04-27 12:51:21,234 INFO L290 TraceCheckUtils]: 159: Hoare triple {19263#(<= ~counter~0 8)} assume !(0 == ~cond); {19263#(<= ~counter~0 8)} is VALID [2022-04-27 12:51:21,234 INFO L290 TraceCheckUtils]: 160: Hoare triple {19263#(<= ~counter~0 8)} assume true; {19263#(<= ~counter~0 8)} is VALID [2022-04-27 12:51:21,234 INFO L284 TraceCheckUtils]: 161: Hoare quadruple {19263#(<= ~counter~0 8)} {19263#(<= ~counter~0 8)} #70#return; {19263#(<= ~counter~0 8)} is VALID [2022-04-27 12:51:21,235 INFO L272 TraceCheckUtils]: 162: Hoare triple {19263#(<= ~counter~0 8)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {19263#(<= ~counter~0 8)} is VALID [2022-04-27 12:51:21,235 INFO L290 TraceCheckUtils]: 163: Hoare triple {19263#(<= ~counter~0 8)} ~cond := #in~cond; {19263#(<= ~counter~0 8)} is VALID [2022-04-27 12:51:21,236 INFO L290 TraceCheckUtils]: 164: Hoare triple {19263#(<= ~counter~0 8)} assume !(0 == ~cond); {19263#(<= ~counter~0 8)} is VALID [2022-04-27 12:51:21,236 INFO L290 TraceCheckUtils]: 165: Hoare triple {19263#(<= ~counter~0 8)} assume true; {19263#(<= ~counter~0 8)} is VALID [2022-04-27 12:51:21,236 INFO L284 TraceCheckUtils]: 166: Hoare quadruple {19263#(<= ~counter~0 8)} {19263#(<= ~counter~0 8)} #72#return; {19263#(<= ~counter~0 8)} is VALID [2022-04-27 12:51:21,237 INFO L290 TraceCheckUtils]: 167: Hoare triple {19263#(<= ~counter~0 8)} assume !!(~a~0 != ~b~0); {19263#(<= ~counter~0 8)} is VALID [2022-04-27 12:51:21,237 INFO L290 TraceCheckUtils]: 168: Hoare triple {19263#(<= ~counter~0 8)} assume ~a~0 > ~b~0;~a~0 := ~a~0 - ~b~0;~p~0 := ~p~0 - ~q~0;~r~0 := ~r~0 - ~s~0; {19263#(<= ~counter~0 8)} is VALID [2022-04-27 12:51:21,237 INFO L290 TraceCheckUtils]: 169: Hoare triple {19263#(<= ~counter~0 8)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {19321#(<= ~counter~0 9)} is VALID [2022-04-27 12:51:21,238 INFO L290 TraceCheckUtils]: 170: Hoare triple {19321#(<= ~counter~0 9)} assume !!(#t~post6 < 50);havoc #t~post6; {19321#(<= ~counter~0 9)} is VALID [2022-04-27 12:51:21,238 INFO L272 TraceCheckUtils]: 171: Hoare triple {19321#(<= ~counter~0 9)} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {19321#(<= ~counter~0 9)} is VALID [2022-04-27 12:51:21,238 INFO L290 TraceCheckUtils]: 172: Hoare triple {19321#(<= ~counter~0 9)} ~cond := #in~cond; {19321#(<= ~counter~0 9)} is VALID [2022-04-27 12:51:21,239 INFO L290 TraceCheckUtils]: 173: Hoare triple {19321#(<= ~counter~0 9)} assume !(0 == ~cond); {19321#(<= ~counter~0 9)} is VALID [2022-04-27 12:51:21,239 INFO L290 TraceCheckUtils]: 174: Hoare triple {19321#(<= ~counter~0 9)} assume true; {19321#(<= ~counter~0 9)} is VALID [2022-04-27 12:51:21,239 INFO L284 TraceCheckUtils]: 175: Hoare quadruple {19321#(<= ~counter~0 9)} {19321#(<= ~counter~0 9)} #68#return; {19321#(<= ~counter~0 9)} is VALID [2022-04-27 12:51:21,240 INFO L272 TraceCheckUtils]: 176: Hoare triple {19321#(<= ~counter~0 9)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {19321#(<= ~counter~0 9)} is VALID [2022-04-27 12:51:21,240 INFO L290 TraceCheckUtils]: 177: Hoare triple {19321#(<= ~counter~0 9)} ~cond := #in~cond; {19321#(<= ~counter~0 9)} is VALID [2022-04-27 12:51:21,241 INFO L290 TraceCheckUtils]: 178: Hoare triple {19321#(<= ~counter~0 9)} assume !(0 == ~cond); {19321#(<= ~counter~0 9)} is VALID [2022-04-27 12:51:21,241 INFO L290 TraceCheckUtils]: 179: Hoare triple {19321#(<= ~counter~0 9)} assume true; {19321#(<= ~counter~0 9)} is VALID [2022-04-27 12:51:21,241 INFO L284 TraceCheckUtils]: 180: Hoare quadruple {19321#(<= ~counter~0 9)} {19321#(<= ~counter~0 9)} #70#return; {19321#(<= ~counter~0 9)} is VALID [2022-04-27 12:51:21,242 INFO L272 TraceCheckUtils]: 181: Hoare triple {19321#(<= ~counter~0 9)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {19321#(<= ~counter~0 9)} is VALID [2022-04-27 12:51:21,242 INFO L290 TraceCheckUtils]: 182: Hoare triple {19321#(<= ~counter~0 9)} ~cond := #in~cond; {19321#(<= ~counter~0 9)} is VALID [2022-04-27 12:51:21,242 INFO L290 TraceCheckUtils]: 183: Hoare triple {19321#(<= ~counter~0 9)} assume !(0 == ~cond); {19321#(<= ~counter~0 9)} is VALID [2022-04-27 12:51:21,243 INFO L290 TraceCheckUtils]: 184: Hoare triple {19321#(<= ~counter~0 9)} assume true; {19321#(<= ~counter~0 9)} is VALID [2022-04-27 12:51:21,243 INFO L284 TraceCheckUtils]: 185: Hoare quadruple {19321#(<= ~counter~0 9)} {19321#(<= ~counter~0 9)} #72#return; {19321#(<= ~counter~0 9)} is VALID [2022-04-27 12:51:21,244 INFO L290 TraceCheckUtils]: 186: Hoare triple {19321#(<= ~counter~0 9)} assume !!(~a~0 != ~b~0); {19321#(<= ~counter~0 9)} is VALID [2022-04-27 12:51:21,244 INFO L290 TraceCheckUtils]: 187: Hoare triple {19321#(<= ~counter~0 9)} assume ~a~0 > ~b~0;~a~0 := ~a~0 - ~b~0;~p~0 := ~p~0 - ~q~0;~r~0 := ~r~0 - ~s~0; {19321#(<= ~counter~0 9)} is VALID [2022-04-27 12:51:21,244 INFO L290 TraceCheckUtils]: 188: Hoare triple {19321#(<= ~counter~0 9)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {19379#(<= ~counter~0 10)} is VALID [2022-04-27 12:51:21,244 INFO L290 TraceCheckUtils]: 189: Hoare triple {19379#(<= ~counter~0 10)} assume !!(#t~post6 < 50);havoc #t~post6; {19379#(<= ~counter~0 10)} is VALID [2022-04-27 12:51:21,245 INFO L272 TraceCheckUtils]: 190: Hoare triple {19379#(<= ~counter~0 10)} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {19379#(<= ~counter~0 10)} is VALID [2022-04-27 12:51:21,245 INFO L290 TraceCheckUtils]: 191: Hoare triple {19379#(<= ~counter~0 10)} ~cond := #in~cond; {19379#(<= ~counter~0 10)} is VALID [2022-04-27 12:51:21,246 INFO L290 TraceCheckUtils]: 192: Hoare triple {19379#(<= ~counter~0 10)} assume !(0 == ~cond); {19379#(<= ~counter~0 10)} is VALID [2022-04-27 12:51:21,246 INFO L290 TraceCheckUtils]: 193: Hoare triple {19379#(<= ~counter~0 10)} assume true; {19379#(<= ~counter~0 10)} is VALID [2022-04-27 12:51:21,246 INFO L284 TraceCheckUtils]: 194: Hoare quadruple {19379#(<= ~counter~0 10)} {19379#(<= ~counter~0 10)} #68#return; {19379#(<= ~counter~0 10)} is VALID [2022-04-27 12:51:21,247 INFO L272 TraceCheckUtils]: 195: Hoare triple {19379#(<= ~counter~0 10)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {19379#(<= ~counter~0 10)} is VALID [2022-04-27 12:51:21,247 INFO L290 TraceCheckUtils]: 196: Hoare triple {19379#(<= ~counter~0 10)} ~cond := #in~cond; {19379#(<= ~counter~0 10)} is VALID [2022-04-27 12:51:21,247 INFO L290 TraceCheckUtils]: 197: Hoare triple {19379#(<= ~counter~0 10)} assume !(0 == ~cond); {19379#(<= ~counter~0 10)} is VALID [2022-04-27 12:51:21,248 INFO L290 TraceCheckUtils]: 198: Hoare triple {19379#(<= ~counter~0 10)} assume true; {19379#(<= ~counter~0 10)} is VALID [2022-04-27 12:51:21,248 INFO L284 TraceCheckUtils]: 199: Hoare quadruple {19379#(<= ~counter~0 10)} {19379#(<= ~counter~0 10)} #70#return; {19379#(<= ~counter~0 10)} is VALID [2022-04-27 12:51:21,249 INFO L272 TraceCheckUtils]: 200: Hoare triple {19379#(<= ~counter~0 10)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {19379#(<= ~counter~0 10)} is VALID [2022-04-27 12:51:21,249 INFO L290 TraceCheckUtils]: 201: Hoare triple {19379#(<= ~counter~0 10)} ~cond := #in~cond; {19379#(<= ~counter~0 10)} is VALID [2022-04-27 12:51:21,249 INFO L290 TraceCheckUtils]: 202: Hoare triple {19379#(<= ~counter~0 10)} assume !(0 == ~cond); {19379#(<= ~counter~0 10)} is VALID [2022-04-27 12:51:21,250 INFO L290 TraceCheckUtils]: 203: Hoare triple {19379#(<= ~counter~0 10)} assume true; {19379#(<= ~counter~0 10)} is VALID [2022-04-27 12:51:21,250 INFO L284 TraceCheckUtils]: 204: Hoare quadruple {19379#(<= ~counter~0 10)} {19379#(<= ~counter~0 10)} #72#return; {19379#(<= ~counter~0 10)} is VALID [2022-04-27 12:51:21,250 INFO L290 TraceCheckUtils]: 205: Hoare triple {19379#(<= ~counter~0 10)} assume !!(~a~0 != ~b~0); {19379#(<= ~counter~0 10)} is VALID [2022-04-27 12:51:21,251 INFO L290 TraceCheckUtils]: 206: Hoare triple {19379#(<= ~counter~0 10)} assume ~a~0 > ~b~0;~a~0 := ~a~0 - ~b~0;~p~0 := ~p~0 - ~q~0;~r~0 := ~r~0 - ~s~0; {19379#(<= ~counter~0 10)} is VALID [2022-04-27 12:51:21,251 INFO L290 TraceCheckUtils]: 207: Hoare triple {19379#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {19437#(<= ~counter~0 11)} is VALID [2022-04-27 12:51:21,251 INFO L290 TraceCheckUtils]: 208: Hoare triple {19437#(<= ~counter~0 11)} assume !!(#t~post6 < 50);havoc #t~post6; {19437#(<= ~counter~0 11)} is VALID [2022-04-27 12:51:21,252 INFO L272 TraceCheckUtils]: 209: Hoare triple {19437#(<= ~counter~0 11)} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {19437#(<= ~counter~0 11)} is VALID [2022-04-27 12:51:21,252 INFO L290 TraceCheckUtils]: 210: Hoare triple {19437#(<= ~counter~0 11)} ~cond := #in~cond; {19437#(<= ~counter~0 11)} is VALID [2022-04-27 12:51:21,252 INFO L290 TraceCheckUtils]: 211: Hoare triple {19437#(<= ~counter~0 11)} assume !(0 == ~cond); {19437#(<= ~counter~0 11)} is VALID [2022-04-27 12:51:21,253 INFO L290 TraceCheckUtils]: 212: Hoare triple {19437#(<= ~counter~0 11)} assume true; {19437#(<= ~counter~0 11)} is VALID [2022-04-27 12:51:21,253 INFO L284 TraceCheckUtils]: 213: Hoare quadruple {19437#(<= ~counter~0 11)} {19437#(<= ~counter~0 11)} #68#return; {19437#(<= ~counter~0 11)} is VALID [2022-04-27 12:51:21,254 INFO L272 TraceCheckUtils]: 214: Hoare triple {19437#(<= ~counter~0 11)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {19437#(<= ~counter~0 11)} is VALID [2022-04-27 12:51:21,254 INFO L290 TraceCheckUtils]: 215: Hoare triple {19437#(<= ~counter~0 11)} ~cond := #in~cond; {19437#(<= ~counter~0 11)} is VALID [2022-04-27 12:51:21,254 INFO L290 TraceCheckUtils]: 216: Hoare triple {19437#(<= ~counter~0 11)} assume !(0 == ~cond); {19437#(<= ~counter~0 11)} is VALID [2022-04-27 12:51:21,255 INFO L290 TraceCheckUtils]: 217: Hoare triple {19437#(<= ~counter~0 11)} assume true; {19437#(<= ~counter~0 11)} is VALID [2022-04-27 12:51:21,255 INFO L284 TraceCheckUtils]: 218: Hoare quadruple {19437#(<= ~counter~0 11)} {19437#(<= ~counter~0 11)} #70#return; {19437#(<= ~counter~0 11)} is VALID [2022-04-27 12:51:21,256 INFO L272 TraceCheckUtils]: 219: Hoare triple {19437#(<= ~counter~0 11)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {19437#(<= ~counter~0 11)} is VALID [2022-04-27 12:51:21,256 INFO L290 TraceCheckUtils]: 220: Hoare triple {19437#(<= ~counter~0 11)} ~cond := #in~cond; {19437#(<= ~counter~0 11)} is VALID [2022-04-27 12:51:21,256 INFO L290 TraceCheckUtils]: 221: Hoare triple {19437#(<= ~counter~0 11)} assume !(0 == ~cond); {19437#(<= ~counter~0 11)} is VALID [2022-04-27 12:51:21,256 INFO L290 TraceCheckUtils]: 222: Hoare triple {19437#(<= ~counter~0 11)} assume true; {19437#(<= ~counter~0 11)} is VALID [2022-04-27 12:51:21,257 INFO L284 TraceCheckUtils]: 223: Hoare quadruple {19437#(<= ~counter~0 11)} {19437#(<= ~counter~0 11)} #72#return; {19437#(<= ~counter~0 11)} is VALID [2022-04-27 12:51:21,257 INFO L290 TraceCheckUtils]: 224: Hoare triple {19437#(<= ~counter~0 11)} assume !!(~a~0 != ~b~0); {19437#(<= ~counter~0 11)} is VALID [2022-04-27 12:51:21,258 INFO L290 TraceCheckUtils]: 225: Hoare triple {19437#(<= ~counter~0 11)} assume ~a~0 > ~b~0;~a~0 := ~a~0 - ~b~0;~p~0 := ~p~0 - ~q~0;~r~0 := ~r~0 - ~s~0; {19437#(<= ~counter~0 11)} is VALID [2022-04-27 12:51:21,258 INFO L290 TraceCheckUtils]: 226: Hoare triple {19437#(<= ~counter~0 11)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {19495#(<= ~counter~0 12)} is VALID [2022-04-27 12:51:21,258 INFO L290 TraceCheckUtils]: 227: Hoare triple {19495#(<= ~counter~0 12)} assume !!(#t~post6 < 50);havoc #t~post6; {19495#(<= ~counter~0 12)} is VALID [2022-04-27 12:51:21,259 INFO L272 TraceCheckUtils]: 228: Hoare triple {19495#(<= ~counter~0 12)} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {19495#(<= ~counter~0 12)} is VALID [2022-04-27 12:51:21,259 INFO L290 TraceCheckUtils]: 229: Hoare triple {19495#(<= ~counter~0 12)} ~cond := #in~cond; {19495#(<= ~counter~0 12)} is VALID [2022-04-27 12:51:21,259 INFO L290 TraceCheckUtils]: 230: Hoare triple {19495#(<= ~counter~0 12)} assume !(0 == ~cond); {19495#(<= ~counter~0 12)} is VALID [2022-04-27 12:51:21,260 INFO L290 TraceCheckUtils]: 231: Hoare triple {19495#(<= ~counter~0 12)} assume true; {19495#(<= ~counter~0 12)} is VALID [2022-04-27 12:51:21,260 INFO L284 TraceCheckUtils]: 232: Hoare quadruple {19495#(<= ~counter~0 12)} {19495#(<= ~counter~0 12)} #68#return; {19495#(<= ~counter~0 12)} is VALID [2022-04-27 12:51:21,261 INFO L272 TraceCheckUtils]: 233: Hoare triple {19495#(<= ~counter~0 12)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {19495#(<= ~counter~0 12)} is VALID [2022-04-27 12:51:21,261 INFO L290 TraceCheckUtils]: 234: Hoare triple {19495#(<= ~counter~0 12)} ~cond := #in~cond; {19495#(<= ~counter~0 12)} is VALID [2022-04-27 12:51:21,261 INFO L290 TraceCheckUtils]: 235: Hoare triple {19495#(<= ~counter~0 12)} assume !(0 == ~cond); {19495#(<= ~counter~0 12)} is VALID [2022-04-27 12:51:21,261 INFO L290 TraceCheckUtils]: 236: Hoare triple {19495#(<= ~counter~0 12)} assume true; {19495#(<= ~counter~0 12)} is VALID [2022-04-27 12:51:21,262 INFO L284 TraceCheckUtils]: 237: Hoare quadruple {19495#(<= ~counter~0 12)} {19495#(<= ~counter~0 12)} #70#return; {19495#(<= ~counter~0 12)} is VALID [2022-04-27 12:51:21,262 INFO L272 TraceCheckUtils]: 238: Hoare triple {19495#(<= ~counter~0 12)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {19495#(<= ~counter~0 12)} is VALID [2022-04-27 12:51:21,263 INFO L290 TraceCheckUtils]: 239: Hoare triple {19495#(<= ~counter~0 12)} ~cond := #in~cond; {19495#(<= ~counter~0 12)} is VALID [2022-04-27 12:51:21,263 INFO L290 TraceCheckUtils]: 240: Hoare triple {19495#(<= ~counter~0 12)} assume !(0 == ~cond); {19495#(<= ~counter~0 12)} is VALID [2022-04-27 12:51:21,263 INFO L290 TraceCheckUtils]: 241: Hoare triple {19495#(<= ~counter~0 12)} assume true; {19495#(<= ~counter~0 12)} is VALID [2022-04-27 12:51:21,264 INFO L284 TraceCheckUtils]: 242: Hoare quadruple {19495#(<= ~counter~0 12)} {19495#(<= ~counter~0 12)} #72#return; {19495#(<= ~counter~0 12)} is VALID [2022-04-27 12:51:21,264 INFO L290 TraceCheckUtils]: 243: Hoare triple {19495#(<= ~counter~0 12)} assume !!(~a~0 != ~b~0); {19495#(<= ~counter~0 12)} is VALID [2022-04-27 12:51:21,264 INFO L290 TraceCheckUtils]: 244: Hoare triple {19495#(<= ~counter~0 12)} assume ~a~0 > ~b~0;~a~0 := ~a~0 - ~b~0;~p~0 := ~p~0 - ~q~0;~r~0 := ~r~0 - ~s~0; {19495#(<= ~counter~0 12)} is VALID [2022-04-27 12:51:21,265 INFO L290 TraceCheckUtils]: 245: Hoare triple {19495#(<= ~counter~0 12)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {19553#(<= ~counter~0 13)} is VALID [2022-04-27 12:51:21,265 INFO L290 TraceCheckUtils]: 246: Hoare triple {19553#(<= ~counter~0 13)} assume !!(#t~post6 < 50);havoc #t~post6; {19553#(<= ~counter~0 13)} is VALID [2022-04-27 12:51:21,266 INFO L272 TraceCheckUtils]: 247: Hoare triple {19553#(<= ~counter~0 13)} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {19553#(<= ~counter~0 13)} is VALID [2022-04-27 12:51:21,266 INFO L290 TraceCheckUtils]: 248: Hoare triple {19553#(<= ~counter~0 13)} ~cond := #in~cond; {19553#(<= ~counter~0 13)} is VALID [2022-04-27 12:51:21,266 INFO L290 TraceCheckUtils]: 249: Hoare triple {19553#(<= ~counter~0 13)} assume !(0 == ~cond); {19553#(<= ~counter~0 13)} is VALID [2022-04-27 12:51:21,266 INFO L290 TraceCheckUtils]: 250: Hoare triple {19553#(<= ~counter~0 13)} assume true; {19553#(<= ~counter~0 13)} is VALID [2022-04-27 12:51:21,267 INFO L284 TraceCheckUtils]: 251: Hoare quadruple {19553#(<= ~counter~0 13)} {19553#(<= ~counter~0 13)} #68#return; {19553#(<= ~counter~0 13)} is VALID [2022-04-27 12:51:21,267 INFO L272 TraceCheckUtils]: 252: Hoare triple {19553#(<= ~counter~0 13)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {19553#(<= ~counter~0 13)} is VALID [2022-04-27 12:51:21,268 INFO L290 TraceCheckUtils]: 253: Hoare triple {19553#(<= ~counter~0 13)} ~cond := #in~cond; {19553#(<= ~counter~0 13)} is VALID [2022-04-27 12:51:21,268 INFO L290 TraceCheckUtils]: 254: Hoare triple {19553#(<= ~counter~0 13)} assume !(0 == ~cond); {19553#(<= ~counter~0 13)} is VALID [2022-04-27 12:51:21,269 INFO L290 TraceCheckUtils]: 255: Hoare triple {19553#(<= ~counter~0 13)} assume true; {19553#(<= ~counter~0 13)} is VALID [2022-04-27 12:51:21,269 INFO L284 TraceCheckUtils]: 256: Hoare quadruple {19553#(<= ~counter~0 13)} {19553#(<= ~counter~0 13)} #70#return; {19553#(<= ~counter~0 13)} is VALID [2022-04-27 12:51:21,270 INFO L272 TraceCheckUtils]: 257: Hoare triple {19553#(<= ~counter~0 13)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {19553#(<= ~counter~0 13)} is VALID [2022-04-27 12:51:21,270 INFO L290 TraceCheckUtils]: 258: Hoare triple {19553#(<= ~counter~0 13)} ~cond := #in~cond; {19553#(<= ~counter~0 13)} is VALID [2022-04-27 12:51:21,270 INFO L290 TraceCheckUtils]: 259: Hoare triple {19553#(<= ~counter~0 13)} assume !(0 == ~cond); {19553#(<= ~counter~0 13)} is VALID [2022-04-27 12:51:21,270 INFO L290 TraceCheckUtils]: 260: Hoare triple {19553#(<= ~counter~0 13)} assume true; {19553#(<= ~counter~0 13)} is VALID [2022-04-27 12:51:21,271 INFO L284 TraceCheckUtils]: 261: Hoare quadruple {19553#(<= ~counter~0 13)} {19553#(<= ~counter~0 13)} #72#return; {19553#(<= ~counter~0 13)} is VALID [2022-04-27 12:51:21,271 INFO L290 TraceCheckUtils]: 262: Hoare triple {19553#(<= ~counter~0 13)} assume !!(~a~0 != ~b~0); {19553#(<= ~counter~0 13)} is VALID [2022-04-27 12:51:21,271 INFO L290 TraceCheckUtils]: 263: Hoare triple {19553#(<= ~counter~0 13)} assume ~a~0 > ~b~0;~a~0 := ~a~0 - ~b~0;~p~0 := ~p~0 - ~q~0;~r~0 := ~r~0 - ~s~0; {19553#(<= ~counter~0 13)} is VALID [2022-04-27 12:51:21,272 INFO L290 TraceCheckUtils]: 264: Hoare triple {19553#(<= ~counter~0 13)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {19611#(<= ~counter~0 14)} is VALID [2022-04-27 12:51:21,272 INFO L290 TraceCheckUtils]: 265: Hoare triple {19611#(<= ~counter~0 14)} assume !!(#t~post6 < 50);havoc #t~post6; {19611#(<= ~counter~0 14)} is VALID [2022-04-27 12:51:21,273 INFO L272 TraceCheckUtils]: 266: Hoare triple {19611#(<= ~counter~0 14)} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {19611#(<= ~counter~0 14)} is VALID [2022-04-27 12:51:21,273 INFO L290 TraceCheckUtils]: 267: Hoare triple {19611#(<= ~counter~0 14)} ~cond := #in~cond; {19611#(<= ~counter~0 14)} is VALID [2022-04-27 12:51:21,273 INFO L290 TraceCheckUtils]: 268: Hoare triple {19611#(<= ~counter~0 14)} assume !(0 == ~cond); {19611#(<= ~counter~0 14)} is VALID [2022-04-27 12:51:21,273 INFO L290 TraceCheckUtils]: 269: Hoare triple {19611#(<= ~counter~0 14)} assume true; {19611#(<= ~counter~0 14)} is VALID [2022-04-27 12:51:21,274 INFO L284 TraceCheckUtils]: 270: Hoare quadruple {19611#(<= ~counter~0 14)} {19611#(<= ~counter~0 14)} #68#return; {19611#(<= ~counter~0 14)} is VALID [2022-04-27 12:51:21,274 INFO L272 TraceCheckUtils]: 271: Hoare triple {19611#(<= ~counter~0 14)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {19611#(<= ~counter~0 14)} is VALID [2022-04-27 12:51:21,275 INFO L290 TraceCheckUtils]: 272: Hoare triple {19611#(<= ~counter~0 14)} ~cond := #in~cond; {19611#(<= ~counter~0 14)} is VALID [2022-04-27 12:51:21,275 INFO L290 TraceCheckUtils]: 273: Hoare triple {19611#(<= ~counter~0 14)} assume !(0 == ~cond); {19611#(<= ~counter~0 14)} is VALID [2022-04-27 12:51:21,275 INFO L290 TraceCheckUtils]: 274: Hoare triple {19611#(<= ~counter~0 14)} assume true; {19611#(<= ~counter~0 14)} is VALID [2022-04-27 12:51:21,276 INFO L284 TraceCheckUtils]: 275: Hoare quadruple {19611#(<= ~counter~0 14)} {19611#(<= ~counter~0 14)} #70#return; {19611#(<= ~counter~0 14)} is VALID [2022-04-27 12:51:21,276 INFO L272 TraceCheckUtils]: 276: Hoare triple {19611#(<= ~counter~0 14)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {19611#(<= ~counter~0 14)} is VALID [2022-04-27 12:51:21,277 INFO L290 TraceCheckUtils]: 277: Hoare triple {19611#(<= ~counter~0 14)} ~cond := #in~cond; {19611#(<= ~counter~0 14)} is VALID [2022-04-27 12:51:21,277 INFO L290 TraceCheckUtils]: 278: Hoare triple {19611#(<= ~counter~0 14)} assume !(0 == ~cond); {19611#(<= ~counter~0 14)} is VALID [2022-04-27 12:51:21,277 INFO L290 TraceCheckUtils]: 279: Hoare triple {19611#(<= ~counter~0 14)} assume true; {19611#(<= ~counter~0 14)} is VALID [2022-04-27 12:51:21,278 INFO L284 TraceCheckUtils]: 280: Hoare quadruple {19611#(<= ~counter~0 14)} {19611#(<= ~counter~0 14)} #72#return; {19611#(<= ~counter~0 14)} is VALID [2022-04-27 12:51:21,278 INFO L290 TraceCheckUtils]: 281: Hoare triple {19611#(<= ~counter~0 14)} assume !!(~a~0 != ~b~0); {19611#(<= ~counter~0 14)} is VALID [2022-04-27 12:51:21,278 INFO L290 TraceCheckUtils]: 282: Hoare triple {19611#(<= ~counter~0 14)} assume ~a~0 > ~b~0;~a~0 := ~a~0 - ~b~0;~p~0 := ~p~0 - ~q~0;~r~0 := ~r~0 - ~s~0; {19611#(<= ~counter~0 14)} is VALID [2022-04-27 12:51:21,279 INFO L290 TraceCheckUtils]: 283: Hoare triple {19611#(<= ~counter~0 14)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {19669#(<= ~counter~0 15)} is VALID [2022-04-27 12:51:21,279 INFO L290 TraceCheckUtils]: 284: Hoare triple {19669#(<= ~counter~0 15)} assume !!(#t~post6 < 50);havoc #t~post6; {19669#(<= ~counter~0 15)} is VALID [2022-04-27 12:51:21,279 INFO L272 TraceCheckUtils]: 285: Hoare triple {19669#(<= ~counter~0 15)} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {19669#(<= ~counter~0 15)} is VALID [2022-04-27 12:51:21,280 INFO L290 TraceCheckUtils]: 286: Hoare triple {19669#(<= ~counter~0 15)} ~cond := #in~cond; {19669#(<= ~counter~0 15)} is VALID [2022-04-27 12:51:21,280 INFO L290 TraceCheckUtils]: 287: Hoare triple {19669#(<= ~counter~0 15)} assume !(0 == ~cond); {19669#(<= ~counter~0 15)} is VALID [2022-04-27 12:51:21,280 INFO L290 TraceCheckUtils]: 288: Hoare triple {19669#(<= ~counter~0 15)} assume true; {19669#(<= ~counter~0 15)} is VALID [2022-04-27 12:51:21,281 INFO L284 TraceCheckUtils]: 289: Hoare quadruple {19669#(<= ~counter~0 15)} {19669#(<= ~counter~0 15)} #68#return; {19669#(<= ~counter~0 15)} is VALID [2022-04-27 12:51:21,281 INFO L272 TraceCheckUtils]: 290: Hoare triple {19669#(<= ~counter~0 15)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {19669#(<= ~counter~0 15)} is VALID [2022-04-27 12:51:21,282 INFO L290 TraceCheckUtils]: 291: Hoare triple {19669#(<= ~counter~0 15)} ~cond := #in~cond; {19669#(<= ~counter~0 15)} is VALID [2022-04-27 12:51:21,282 INFO L290 TraceCheckUtils]: 292: Hoare triple {19669#(<= ~counter~0 15)} assume !(0 == ~cond); {19669#(<= ~counter~0 15)} is VALID [2022-04-27 12:51:21,282 INFO L290 TraceCheckUtils]: 293: Hoare triple {19669#(<= ~counter~0 15)} assume true; {19669#(<= ~counter~0 15)} is VALID [2022-04-27 12:51:21,283 INFO L284 TraceCheckUtils]: 294: Hoare quadruple {19669#(<= ~counter~0 15)} {19669#(<= ~counter~0 15)} #70#return; {19669#(<= ~counter~0 15)} is VALID [2022-04-27 12:51:21,283 INFO L272 TraceCheckUtils]: 295: Hoare triple {19669#(<= ~counter~0 15)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {19669#(<= ~counter~0 15)} is VALID [2022-04-27 12:51:21,284 INFO L290 TraceCheckUtils]: 296: Hoare triple {19669#(<= ~counter~0 15)} ~cond := #in~cond; {19669#(<= ~counter~0 15)} is VALID [2022-04-27 12:51:21,284 INFO L290 TraceCheckUtils]: 297: Hoare triple {19669#(<= ~counter~0 15)} assume !(0 == ~cond); {19669#(<= ~counter~0 15)} is VALID [2022-04-27 12:51:21,284 INFO L290 TraceCheckUtils]: 298: Hoare triple {19669#(<= ~counter~0 15)} assume true; {19669#(<= ~counter~0 15)} is VALID [2022-04-27 12:51:21,285 INFO L284 TraceCheckUtils]: 299: Hoare quadruple {19669#(<= ~counter~0 15)} {19669#(<= ~counter~0 15)} #72#return; {19669#(<= ~counter~0 15)} is VALID [2022-04-27 12:51:21,285 INFO L290 TraceCheckUtils]: 300: Hoare triple {19669#(<= ~counter~0 15)} assume !!(~a~0 != ~b~0); {19669#(<= ~counter~0 15)} is VALID [2022-04-27 12:51:21,285 INFO L290 TraceCheckUtils]: 301: Hoare triple {19669#(<= ~counter~0 15)} assume ~a~0 > ~b~0;~a~0 := ~a~0 - ~b~0;~p~0 := ~p~0 - ~q~0;~r~0 := ~r~0 - ~s~0; {19669#(<= ~counter~0 15)} is VALID [2022-04-27 12:51:21,286 INFO L290 TraceCheckUtils]: 302: Hoare triple {19669#(<= ~counter~0 15)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {19727#(<= ~counter~0 16)} is VALID [2022-04-27 12:51:21,286 INFO L290 TraceCheckUtils]: 303: Hoare triple {19727#(<= ~counter~0 16)} assume !!(#t~post6 < 50);havoc #t~post6; {19727#(<= ~counter~0 16)} is VALID [2022-04-27 12:51:21,286 INFO L272 TraceCheckUtils]: 304: Hoare triple {19727#(<= ~counter~0 16)} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {19727#(<= ~counter~0 16)} is VALID [2022-04-27 12:51:21,287 INFO L290 TraceCheckUtils]: 305: Hoare triple {19727#(<= ~counter~0 16)} ~cond := #in~cond; {19727#(<= ~counter~0 16)} is VALID [2022-04-27 12:51:21,287 INFO L290 TraceCheckUtils]: 306: Hoare triple {19727#(<= ~counter~0 16)} assume !(0 == ~cond); {19727#(<= ~counter~0 16)} is VALID [2022-04-27 12:51:21,287 INFO L290 TraceCheckUtils]: 307: Hoare triple {19727#(<= ~counter~0 16)} assume true; {19727#(<= ~counter~0 16)} is VALID [2022-04-27 12:51:21,288 INFO L284 TraceCheckUtils]: 308: Hoare quadruple {19727#(<= ~counter~0 16)} {19727#(<= ~counter~0 16)} #68#return; {19727#(<= ~counter~0 16)} is VALID [2022-04-27 12:51:21,288 INFO L272 TraceCheckUtils]: 309: Hoare triple {19727#(<= ~counter~0 16)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {19727#(<= ~counter~0 16)} is VALID [2022-04-27 12:51:21,289 INFO L290 TraceCheckUtils]: 310: Hoare triple {19727#(<= ~counter~0 16)} ~cond := #in~cond; {19727#(<= ~counter~0 16)} is VALID [2022-04-27 12:51:21,289 INFO L290 TraceCheckUtils]: 311: Hoare triple {19727#(<= ~counter~0 16)} assume !(0 == ~cond); {19727#(<= ~counter~0 16)} is VALID [2022-04-27 12:51:21,289 INFO L290 TraceCheckUtils]: 312: Hoare triple {19727#(<= ~counter~0 16)} assume true; {19727#(<= ~counter~0 16)} is VALID [2022-04-27 12:51:21,290 INFO L284 TraceCheckUtils]: 313: Hoare quadruple {19727#(<= ~counter~0 16)} {19727#(<= ~counter~0 16)} #70#return; {19727#(<= ~counter~0 16)} is VALID [2022-04-27 12:51:21,290 INFO L272 TraceCheckUtils]: 314: Hoare triple {19727#(<= ~counter~0 16)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {19727#(<= ~counter~0 16)} is VALID [2022-04-27 12:51:21,290 INFO L290 TraceCheckUtils]: 315: Hoare triple {19727#(<= ~counter~0 16)} ~cond := #in~cond; {19727#(<= ~counter~0 16)} is VALID [2022-04-27 12:51:21,291 INFO L290 TraceCheckUtils]: 316: Hoare triple {19727#(<= ~counter~0 16)} assume !(0 == ~cond); {19727#(<= ~counter~0 16)} is VALID [2022-04-27 12:51:21,291 INFO L290 TraceCheckUtils]: 317: Hoare triple {19727#(<= ~counter~0 16)} assume true; {19727#(<= ~counter~0 16)} is VALID [2022-04-27 12:51:21,292 INFO L284 TraceCheckUtils]: 318: Hoare quadruple {19727#(<= ~counter~0 16)} {19727#(<= ~counter~0 16)} #72#return; {19727#(<= ~counter~0 16)} is VALID [2022-04-27 12:51:21,292 INFO L290 TraceCheckUtils]: 319: Hoare triple {19727#(<= ~counter~0 16)} assume !!(~a~0 != ~b~0); {19727#(<= ~counter~0 16)} is VALID [2022-04-27 12:51:21,292 INFO L290 TraceCheckUtils]: 320: Hoare triple {19727#(<= ~counter~0 16)} assume ~a~0 > ~b~0;~a~0 := ~a~0 - ~b~0;~p~0 := ~p~0 - ~q~0;~r~0 := ~r~0 - ~s~0; {19727#(<= ~counter~0 16)} is VALID [2022-04-27 12:51:21,293 INFO L290 TraceCheckUtils]: 321: Hoare triple {19727#(<= ~counter~0 16)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {19785#(<= ~counter~0 17)} is VALID [2022-04-27 12:51:21,293 INFO L290 TraceCheckUtils]: 322: Hoare triple {19785#(<= ~counter~0 17)} assume !!(#t~post6 < 50);havoc #t~post6; {19785#(<= ~counter~0 17)} is VALID [2022-04-27 12:51:21,293 INFO L272 TraceCheckUtils]: 323: Hoare triple {19785#(<= ~counter~0 17)} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {19785#(<= ~counter~0 17)} is VALID [2022-04-27 12:51:21,294 INFO L290 TraceCheckUtils]: 324: Hoare triple {19785#(<= ~counter~0 17)} ~cond := #in~cond; {19785#(<= ~counter~0 17)} is VALID [2022-04-27 12:51:21,294 INFO L290 TraceCheckUtils]: 325: Hoare triple {19785#(<= ~counter~0 17)} assume !(0 == ~cond); {19785#(<= ~counter~0 17)} is VALID [2022-04-27 12:51:21,294 INFO L290 TraceCheckUtils]: 326: Hoare triple {19785#(<= ~counter~0 17)} assume true; {19785#(<= ~counter~0 17)} is VALID [2022-04-27 12:51:21,295 INFO L284 TraceCheckUtils]: 327: Hoare quadruple {19785#(<= ~counter~0 17)} {19785#(<= ~counter~0 17)} #68#return; {19785#(<= ~counter~0 17)} is VALID [2022-04-27 12:51:21,295 INFO L272 TraceCheckUtils]: 328: Hoare triple {19785#(<= ~counter~0 17)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {19785#(<= ~counter~0 17)} is VALID [2022-04-27 12:51:21,295 INFO L290 TraceCheckUtils]: 329: Hoare triple {19785#(<= ~counter~0 17)} ~cond := #in~cond; {19785#(<= ~counter~0 17)} is VALID [2022-04-27 12:51:21,296 INFO L290 TraceCheckUtils]: 330: Hoare triple {19785#(<= ~counter~0 17)} assume !(0 == ~cond); {19785#(<= ~counter~0 17)} is VALID [2022-04-27 12:51:21,296 INFO L290 TraceCheckUtils]: 331: Hoare triple {19785#(<= ~counter~0 17)} assume true; {19785#(<= ~counter~0 17)} is VALID [2022-04-27 12:51:21,297 INFO L284 TraceCheckUtils]: 332: Hoare quadruple {19785#(<= ~counter~0 17)} {19785#(<= ~counter~0 17)} #70#return; {19785#(<= ~counter~0 17)} is VALID [2022-04-27 12:51:21,297 INFO L272 TraceCheckUtils]: 333: Hoare triple {19785#(<= ~counter~0 17)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {19785#(<= ~counter~0 17)} is VALID [2022-04-27 12:51:21,297 INFO L290 TraceCheckUtils]: 334: Hoare triple {19785#(<= ~counter~0 17)} ~cond := #in~cond; {19785#(<= ~counter~0 17)} is VALID [2022-04-27 12:51:21,298 INFO L290 TraceCheckUtils]: 335: Hoare triple {19785#(<= ~counter~0 17)} assume !(0 == ~cond); {19785#(<= ~counter~0 17)} is VALID [2022-04-27 12:51:21,298 INFO L290 TraceCheckUtils]: 336: Hoare triple {19785#(<= ~counter~0 17)} assume true; {19785#(<= ~counter~0 17)} is VALID [2022-04-27 12:51:21,298 INFO L284 TraceCheckUtils]: 337: Hoare quadruple {19785#(<= ~counter~0 17)} {19785#(<= ~counter~0 17)} #72#return; {19785#(<= ~counter~0 17)} is VALID [2022-04-27 12:51:21,299 INFO L290 TraceCheckUtils]: 338: Hoare triple {19785#(<= ~counter~0 17)} assume !!(~a~0 != ~b~0); {19785#(<= ~counter~0 17)} is VALID [2022-04-27 12:51:21,299 INFO L290 TraceCheckUtils]: 339: Hoare triple {19785#(<= ~counter~0 17)} assume ~a~0 > ~b~0;~a~0 := ~a~0 - ~b~0;~p~0 := ~p~0 - ~q~0;~r~0 := ~r~0 - ~s~0; {19785#(<= ~counter~0 17)} is VALID [2022-04-27 12:51:21,299 INFO L290 TraceCheckUtils]: 340: Hoare triple {19785#(<= ~counter~0 17)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {19843#(<= ~counter~0 18)} is VALID [2022-04-27 12:51:21,300 INFO L290 TraceCheckUtils]: 341: Hoare triple {19843#(<= ~counter~0 18)} assume !!(#t~post6 < 50);havoc #t~post6; {19843#(<= ~counter~0 18)} is VALID [2022-04-27 12:51:21,300 INFO L272 TraceCheckUtils]: 342: Hoare triple {19843#(<= ~counter~0 18)} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {19843#(<= ~counter~0 18)} is VALID [2022-04-27 12:51:21,300 INFO L290 TraceCheckUtils]: 343: Hoare triple {19843#(<= ~counter~0 18)} ~cond := #in~cond; {19843#(<= ~counter~0 18)} is VALID [2022-04-27 12:51:21,301 INFO L290 TraceCheckUtils]: 344: Hoare triple {19843#(<= ~counter~0 18)} assume !(0 == ~cond); {19843#(<= ~counter~0 18)} is VALID [2022-04-27 12:51:21,301 INFO L290 TraceCheckUtils]: 345: Hoare triple {19843#(<= ~counter~0 18)} assume true; {19843#(<= ~counter~0 18)} is VALID [2022-04-27 12:51:21,302 INFO L284 TraceCheckUtils]: 346: Hoare quadruple {19843#(<= ~counter~0 18)} {19843#(<= ~counter~0 18)} #68#return; {19843#(<= ~counter~0 18)} is VALID [2022-04-27 12:51:21,302 INFO L272 TraceCheckUtils]: 347: Hoare triple {19843#(<= ~counter~0 18)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {19843#(<= ~counter~0 18)} is VALID [2022-04-27 12:51:21,302 INFO L290 TraceCheckUtils]: 348: Hoare triple {19843#(<= ~counter~0 18)} ~cond := #in~cond; {19843#(<= ~counter~0 18)} is VALID [2022-04-27 12:51:21,303 INFO L290 TraceCheckUtils]: 349: Hoare triple {19843#(<= ~counter~0 18)} assume !(0 == ~cond); {19843#(<= ~counter~0 18)} is VALID [2022-04-27 12:51:21,303 INFO L290 TraceCheckUtils]: 350: Hoare triple {19843#(<= ~counter~0 18)} assume true; {19843#(<= ~counter~0 18)} is VALID [2022-04-27 12:51:21,304 INFO L284 TraceCheckUtils]: 351: Hoare quadruple {19843#(<= ~counter~0 18)} {19843#(<= ~counter~0 18)} #70#return; {19843#(<= ~counter~0 18)} is VALID [2022-04-27 12:51:21,304 INFO L272 TraceCheckUtils]: 352: Hoare triple {19843#(<= ~counter~0 18)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {19843#(<= ~counter~0 18)} is VALID [2022-04-27 12:51:21,305 INFO L290 TraceCheckUtils]: 353: Hoare triple {19843#(<= ~counter~0 18)} ~cond := #in~cond; {19843#(<= ~counter~0 18)} is VALID [2022-04-27 12:51:21,305 INFO L290 TraceCheckUtils]: 354: Hoare triple {19843#(<= ~counter~0 18)} assume !(0 == ~cond); {19843#(<= ~counter~0 18)} is VALID [2022-04-27 12:51:21,305 INFO L290 TraceCheckUtils]: 355: Hoare triple {19843#(<= ~counter~0 18)} assume true; {19843#(<= ~counter~0 18)} is VALID [2022-04-27 12:51:21,306 INFO L284 TraceCheckUtils]: 356: Hoare quadruple {19843#(<= ~counter~0 18)} {19843#(<= ~counter~0 18)} #72#return; {19843#(<= ~counter~0 18)} is VALID [2022-04-27 12:51:21,306 INFO L290 TraceCheckUtils]: 357: Hoare triple {19843#(<= ~counter~0 18)} assume !!(~a~0 != ~b~0); {19843#(<= ~counter~0 18)} is VALID [2022-04-27 12:51:21,306 INFO L290 TraceCheckUtils]: 358: Hoare triple {19843#(<= ~counter~0 18)} assume ~a~0 > ~b~0;~a~0 := ~a~0 - ~b~0;~p~0 := ~p~0 - ~q~0;~r~0 := ~r~0 - ~s~0; {19843#(<= ~counter~0 18)} is VALID [2022-04-27 12:51:21,307 INFO L290 TraceCheckUtils]: 359: Hoare triple {19843#(<= ~counter~0 18)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {19901#(<= ~counter~0 19)} is VALID [2022-04-27 12:51:21,307 INFO L290 TraceCheckUtils]: 360: Hoare triple {19901#(<= ~counter~0 19)} assume !!(#t~post6 < 50);havoc #t~post6; {19901#(<= ~counter~0 19)} is VALID [2022-04-27 12:51:21,307 INFO L272 TraceCheckUtils]: 361: Hoare triple {19901#(<= ~counter~0 19)} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {19901#(<= ~counter~0 19)} is VALID [2022-04-27 12:51:21,308 INFO L290 TraceCheckUtils]: 362: Hoare triple {19901#(<= ~counter~0 19)} ~cond := #in~cond; {19901#(<= ~counter~0 19)} is VALID [2022-04-27 12:51:21,308 INFO L290 TraceCheckUtils]: 363: Hoare triple {19901#(<= ~counter~0 19)} assume !(0 == ~cond); {19901#(<= ~counter~0 19)} is VALID [2022-04-27 12:51:21,308 INFO L290 TraceCheckUtils]: 364: Hoare triple {19901#(<= ~counter~0 19)} assume true; {19901#(<= ~counter~0 19)} is VALID [2022-04-27 12:51:21,309 INFO L284 TraceCheckUtils]: 365: Hoare quadruple {19901#(<= ~counter~0 19)} {19901#(<= ~counter~0 19)} #68#return; {19901#(<= ~counter~0 19)} is VALID [2022-04-27 12:51:21,309 INFO L272 TraceCheckUtils]: 366: Hoare triple {19901#(<= ~counter~0 19)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {19901#(<= ~counter~0 19)} is VALID [2022-04-27 12:51:21,310 INFO L290 TraceCheckUtils]: 367: Hoare triple {19901#(<= ~counter~0 19)} ~cond := #in~cond; {19901#(<= ~counter~0 19)} is VALID [2022-04-27 12:51:21,310 INFO L290 TraceCheckUtils]: 368: Hoare triple {19901#(<= ~counter~0 19)} assume !(0 == ~cond); {19901#(<= ~counter~0 19)} is VALID [2022-04-27 12:51:21,310 INFO L290 TraceCheckUtils]: 369: Hoare triple {19901#(<= ~counter~0 19)} assume true; {19901#(<= ~counter~0 19)} is VALID [2022-04-27 12:51:21,311 INFO L284 TraceCheckUtils]: 370: Hoare quadruple {19901#(<= ~counter~0 19)} {19901#(<= ~counter~0 19)} #70#return; {19901#(<= ~counter~0 19)} is VALID [2022-04-27 12:51:21,311 INFO L272 TraceCheckUtils]: 371: Hoare triple {19901#(<= ~counter~0 19)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {19901#(<= ~counter~0 19)} is VALID [2022-04-27 12:51:21,311 INFO L290 TraceCheckUtils]: 372: Hoare triple {19901#(<= ~counter~0 19)} ~cond := #in~cond; {19901#(<= ~counter~0 19)} is VALID [2022-04-27 12:51:21,312 INFO L290 TraceCheckUtils]: 373: Hoare triple {19901#(<= ~counter~0 19)} assume !(0 == ~cond); {19901#(<= ~counter~0 19)} is VALID [2022-04-27 12:51:21,312 INFO L290 TraceCheckUtils]: 374: Hoare triple {19901#(<= ~counter~0 19)} assume true; {19901#(<= ~counter~0 19)} is VALID [2022-04-27 12:51:21,313 INFO L284 TraceCheckUtils]: 375: Hoare quadruple {19901#(<= ~counter~0 19)} {19901#(<= ~counter~0 19)} #72#return; {19901#(<= ~counter~0 19)} is VALID [2022-04-27 12:51:21,313 INFO L290 TraceCheckUtils]: 376: Hoare triple {19901#(<= ~counter~0 19)} assume !!(~a~0 != ~b~0); {19901#(<= ~counter~0 19)} is VALID [2022-04-27 12:51:21,313 INFO L290 TraceCheckUtils]: 377: Hoare triple {19901#(<= ~counter~0 19)} assume ~a~0 > ~b~0;~a~0 := ~a~0 - ~b~0;~p~0 := ~p~0 - ~q~0;~r~0 := ~r~0 - ~s~0; {19901#(<= ~counter~0 19)} is VALID [2022-04-27 12:51:21,314 INFO L290 TraceCheckUtils]: 378: Hoare triple {19901#(<= ~counter~0 19)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {19959#(<= ~counter~0 20)} is VALID [2022-04-27 12:51:21,314 INFO L290 TraceCheckUtils]: 379: Hoare triple {19959#(<= ~counter~0 20)} assume !!(#t~post6 < 50);havoc #t~post6; {19959#(<= ~counter~0 20)} is VALID [2022-04-27 12:51:21,314 INFO L272 TraceCheckUtils]: 380: Hoare triple {19959#(<= ~counter~0 20)} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {19959#(<= ~counter~0 20)} is VALID [2022-04-27 12:51:21,315 INFO L290 TraceCheckUtils]: 381: Hoare triple {19959#(<= ~counter~0 20)} ~cond := #in~cond; {19959#(<= ~counter~0 20)} is VALID [2022-04-27 12:51:21,315 INFO L290 TraceCheckUtils]: 382: Hoare triple {19959#(<= ~counter~0 20)} assume !(0 == ~cond); {19959#(<= ~counter~0 20)} is VALID [2022-04-27 12:51:21,315 INFO L290 TraceCheckUtils]: 383: Hoare triple {19959#(<= ~counter~0 20)} assume true; {19959#(<= ~counter~0 20)} is VALID [2022-04-27 12:51:21,316 INFO L284 TraceCheckUtils]: 384: Hoare quadruple {19959#(<= ~counter~0 20)} {19959#(<= ~counter~0 20)} #68#return; {19959#(<= ~counter~0 20)} is VALID [2022-04-27 12:51:21,317 INFO L272 TraceCheckUtils]: 385: Hoare triple {19959#(<= ~counter~0 20)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {19959#(<= ~counter~0 20)} is VALID [2022-04-27 12:51:21,317 INFO L290 TraceCheckUtils]: 386: Hoare triple {19959#(<= ~counter~0 20)} ~cond := #in~cond; {19959#(<= ~counter~0 20)} is VALID [2022-04-27 12:51:21,317 INFO L290 TraceCheckUtils]: 387: Hoare triple {19959#(<= ~counter~0 20)} assume !(0 == ~cond); {19959#(<= ~counter~0 20)} is VALID [2022-04-27 12:51:21,318 INFO L290 TraceCheckUtils]: 388: Hoare triple {19959#(<= ~counter~0 20)} assume true; {19959#(<= ~counter~0 20)} is VALID [2022-04-27 12:51:21,318 INFO L284 TraceCheckUtils]: 389: Hoare quadruple {19959#(<= ~counter~0 20)} {19959#(<= ~counter~0 20)} #70#return; {19959#(<= ~counter~0 20)} is VALID [2022-04-27 12:51:21,319 INFO L272 TraceCheckUtils]: 390: Hoare triple {19959#(<= ~counter~0 20)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {19959#(<= ~counter~0 20)} is VALID [2022-04-27 12:51:21,319 INFO L290 TraceCheckUtils]: 391: Hoare triple {19959#(<= ~counter~0 20)} ~cond := #in~cond; {19959#(<= ~counter~0 20)} is VALID [2022-04-27 12:51:21,319 INFO L290 TraceCheckUtils]: 392: Hoare triple {19959#(<= ~counter~0 20)} assume !(0 == ~cond); {19959#(<= ~counter~0 20)} is VALID [2022-04-27 12:51:21,320 INFO L290 TraceCheckUtils]: 393: Hoare triple {19959#(<= ~counter~0 20)} assume true; {19959#(<= ~counter~0 20)} is VALID [2022-04-27 12:51:21,320 INFO L284 TraceCheckUtils]: 394: Hoare quadruple {19959#(<= ~counter~0 20)} {19959#(<= ~counter~0 20)} #72#return; {19959#(<= ~counter~0 20)} is VALID [2022-04-27 12:51:21,321 INFO L290 TraceCheckUtils]: 395: Hoare triple {19959#(<= ~counter~0 20)} assume !!(~a~0 != ~b~0); {19959#(<= ~counter~0 20)} is VALID [2022-04-27 12:51:21,321 INFO L290 TraceCheckUtils]: 396: Hoare triple {19959#(<= ~counter~0 20)} assume ~a~0 > ~b~0;~a~0 := ~a~0 - ~b~0;~p~0 := ~p~0 - ~q~0;~r~0 := ~r~0 - ~s~0; {19959#(<= ~counter~0 20)} is VALID [2022-04-27 12:51:21,321 INFO L290 TraceCheckUtils]: 397: Hoare triple {19959#(<= ~counter~0 20)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {20017#(<= ~counter~0 21)} is VALID [2022-04-27 12:51:21,322 INFO L290 TraceCheckUtils]: 398: Hoare triple {20017#(<= ~counter~0 21)} assume !!(#t~post6 < 50);havoc #t~post6; {20017#(<= ~counter~0 21)} is VALID [2022-04-27 12:51:21,322 INFO L272 TraceCheckUtils]: 399: Hoare triple {20017#(<= ~counter~0 21)} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {20017#(<= ~counter~0 21)} is VALID [2022-04-27 12:51:21,323 INFO L290 TraceCheckUtils]: 400: Hoare triple {20017#(<= ~counter~0 21)} ~cond := #in~cond; {20017#(<= ~counter~0 21)} is VALID [2022-04-27 12:51:21,323 INFO L290 TraceCheckUtils]: 401: Hoare triple {20017#(<= ~counter~0 21)} assume !(0 == ~cond); {20017#(<= ~counter~0 21)} is VALID [2022-04-27 12:51:21,323 INFO L290 TraceCheckUtils]: 402: Hoare triple {20017#(<= ~counter~0 21)} assume true; {20017#(<= ~counter~0 21)} is VALID [2022-04-27 12:51:21,324 INFO L284 TraceCheckUtils]: 403: Hoare quadruple {20017#(<= ~counter~0 21)} {20017#(<= ~counter~0 21)} #68#return; {20017#(<= ~counter~0 21)} is VALID [2022-04-27 12:51:21,324 INFO L272 TraceCheckUtils]: 404: Hoare triple {20017#(<= ~counter~0 21)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {20017#(<= ~counter~0 21)} is VALID [2022-04-27 12:51:21,324 INFO L290 TraceCheckUtils]: 405: Hoare triple {20017#(<= ~counter~0 21)} ~cond := #in~cond; {20017#(<= ~counter~0 21)} is VALID [2022-04-27 12:51:21,325 INFO L290 TraceCheckUtils]: 406: Hoare triple {20017#(<= ~counter~0 21)} assume !(0 == ~cond); {20017#(<= ~counter~0 21)} is VALID [2022-04-27 12:51:21,325 INFO L290 TraceCheckUtils]: 407: Hoare triple {20017#(<= ~counter~0 21)} assume true; {20017#(<= ~counter~0 21)} is VALID [2022-04-27 12:51:21,326 INFO L284 TraceCheckUtils]: 408: Hoare quadruple {20017#(<= ~counter~0 21)} {20017#(<= ~counter~0 21)} #70#return; {20017#(<= ~counter~0 21)} is VALID [2022-04-27 12:51:21,326 INFO L272 TraceCheckUtils]: 409: Hoare triple {20017#(<= ~counter~0 21)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {20017#(<= ~counter~0 21)} is VALID [2022-04-27 12:51:21,326 INFO L290 TraceCheckUtils]: 410: Hoare triple {20017#(<= ~counter~0 21)} ~cond := #in~cond; {20017#(<= ~counter~0 21)} is VALID [2022-04-27 12:51:21,327 INFO L290 TraceCheckUtils]: 411: Hoare triple {20017#(<= ~counter~0 21)} assume !(0 == ~cond); {20017#(<= ~counter~0 21)} is VALID [2022-04-27 12:51:21,327 INFO L290 TraceCheckUtils]: 412: Hoare triple {20017#(<= ~counter~0 21)} assume true; {20017#(<= ~counter~0 21)} is VALID [2022-04-27 12:51:21,328 INFO L284 TraceCheckUtils]: 413: Hoare quadruple {20017#(<= ~counter~0 21)} {20017#(<= ~counter~0 21)} #72#return; {20017#(<= ~counter~0 21)} is VALID [2022-04-27 12:51:21,328 INFO L290 TraceCheckUtils]: 414: Hoare triple {20017#(<= ~counter~0 21)} assume !!(~a~0 != ~b~0); {20017#(<= ~counter~0 21)} is VALID [2022-04-27 12:51:21,328 INFO L290 TraceCheckUtils]: 415: Hoare triple {20017#(<= ~counter~0 21)} assume ~a~0 > ~b~0;~a~0 := ~a~0 - ~b~0;~p~0 := ~p~0 - ~q~0;~r~0 := ~r~0 - ~s~0; {20017#(<= ~counter~0 21)} is VALID [2022-04-27 12:51:21,329 INFO L290 TraceCheckUtils]: 416: Hoare triple {20017#(<= ~counter~0 21)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {20075#(<= ~counter~0 22)} is VALID [2022-04-27 12:51:21,329 INFO L290 TraceCheckUtils]: 417: Hoare triple {20075#(<= ~counter~0 22)} assume !!(#t~post6 < 50);havoc #t~post6; {20075#(<= ~counter~0 22)} is VALID [2022-04-27 12:51:21,329 INFO L272 TraceCheckUtils]: 418: Hoare triple {20075#(<= ~counter~0 22)} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {20075#(<= ~counter~0 22)} is VALID [2022-04-27 12:51:21,330 INFO L290 TraceCheckUtils]: 419: Hoare triple {20075#(<= ~counter~0 22)} ~cond := #in~cond; {20075#(<= ~counter~0 22)} is VALID [2022-04-27 12:51:21,330 INFO L290 TraceCheckUtils]: 420: Hoare triple {20075#(<= ~counter~0 22)} assume !(0 == ~cond); {20075#(<= ~counter~0 22)} is VALID [2022-04-27 12:51:21,330 INFO L290 TraceCheckUtils]: 421: Hoare triple {20075#(<= ~counter~0 22)} assume true; {20075#(<= ~counter~0 22)} is VALID [2022-04-27 12:51:21,331 INFO L284 TraceCheckUtils]: 422: Hoare quadruple {20075#(<= ~counter~0 22)} {20075#(<= ~counter~0 22)} #68#return; {20075#(<= ~counter~0 22)} is VALID [2022-04-27 12:51:21,331 INFO L272 TraceCheckUtils]: 423: Hoare triple {20075#(<= ~counter~0 22)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {20075#(<= ~counter~0 22)} is VALID [2022-04-27 12:51:21,332 INFO L290 TraceCheckUtils]: 424: Hoare triple {20075#(<= ~counter~0 22)} ~cond := #in~cond; {20075#(<= ~counter~0 22)} is VALID [2022-04-27 12:51:21,332 INFO L290 TraceCheckUtils]: 425: Hoare triple {20075#(<= ~counter~0 22)} assume !(0 == ~cond); {20075#(<= ~counter~0 22)} is VALID [2022-04-27 12:51:21,332 INFO L290 TraceCheckUtils]: 426: Hoare triple {20075#(<= ~counter~0 22)} assume true; {20075#(<= ~counter~0 22)} is VALID [2022-04-27 12:51:21,333 INFO L284 TraceCheckUtils]: 427: Hoare quadruple {20075#(<= ~counter~0 22)} {20075#(<= ~counter~0 22)} #70#return; {20075#(<= ~counter~0 22)} is VALID [2022-04-27 12:51:21,333 INFO L272 TraceCheckUtils]: 428: Hoare triple {20075#(<= ~counter~0 22)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {20075#(<= ~counter~0 22)} is VALID [2022-04-27 12:51:21,334 INFO L290 TraceCheckUtils]: 429: Hoare triple {20075#(<= ~counter~0 22)} ~cond := #in~cond; {20075#(<= ~counter~0 22)} is VALID [2022-04-27 12:51:21,334 INFO L290 TraceCheckUtils]: 430: Hoare triple {20075#(<= ~counter~0 22)} assume !(0 == ~cond); {20075#(<= ~counter~0 22)} is VALID [2022-04-27 12:51:21,334 INFO L290 TraceCheckUtils]: 431: Hoare triple {20075#(<= ~counter~0 22)} assume true; {20075#(<= ~counter~0 22)} is VALID [2022-04-27 12:51:21,335 INFO L284 TraceCheckUtils]: 432: Hoare quadruple {20075#(<= ~counter~0 22)} {20075#(<= ~counter~0 22)} #72#return; {20075#(<= ~counter~0 22)} is VALID [2022-04-27 12:51:21,335 INFO L290 TraceCheckUtils]: 433: Hoare triple {20075#(<= ~counter~0 22)} assume !!(~a~0 != ~b~0); {20075#(<= ~counter~0 22)} is VALID [2022-04-27 12:51:21,335 INFO L290 TraceCheckUtils]: 434: Hoare triple {20075#(<= ~counter~0 22)} assume ~a~0 > ~b~0;~a~0 := ~a~0 - ~b~0;~p~0 := ~p~0 - ~q~0;~r~0 := ~r~0 - ~s~0; {20075#(<= ~counter~0 22)} is VALID [2022-04-27 12:51:21,336 INFO L290 TraceCheckUtils]: 435: Hoare triple {20075#(<= ~counter~0 22)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {20133#(<= |main_#t~post6| 22)} is VALID [2022-04-27 12:51:21,336 INFO L290 TraceCheckUtils]: 436: Hoare triple {20133#(<= |main_#t~post6| 22)} assume !(#t~post6 < 50);havoc #t~post6; {18801#false} is VALID [2022-04-27 12:51:21,336 INFO L272 TraceCheckUtils]: 437: Hoare triple {18801#false} call __VERIFIER_assert((if 0 == ~a~0 - ~b~0 then 1 else 0)); {18801#false} is VALID [2022-04-27 12:51:21,336 INFO L290 TraceCheckUtils]: 438: Hoare triple {18801#false} ~cond := #in~cond; {18801#false} is VALID [2022-04-27 12:51:21,336 INFO L290 TraceCheckUtils]: 439: Hoare triple {18801#false} assume 0 == ~cond; {18801#false} is VALID [2022-04-27 12:51:21,336 INFO L290 TraceCheckUtils]: 440: Hoare triple {18801#false} assume !false; {18801#false} is VALID [2022-04-27 12:51:21,340 INFO L134 CoverageAnalysis]: Checked inductivity of 10377 backedges. 132 proven. 9977 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2022-04-27 12:51:21,340 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:51:23,386 INFO L290 TraceCheckUtils]: 440: Hoare triple {18801#false} assume !false; {18801#false} is VALID [2022-04-27 12:51:23,386 INFO L290 TraceCheckUtils]: 439: Hoare triple {18801#false} assume 0 == ~cond; {18801#false} is VALID [2022-04-27 12:51:23,387 INFO L290 TraceCheckUtils]: 438: Hoare triple {18801#false} ~cond := #in~cond; {18801#false} is VALID [2022-04-27 12:51:23,387 INFO L272 TraceCheckUtils]: 437: Hoare triple {18801#false} call __VERIFIER_assert((if 0 == ~a~0 - ~b~0 then 1 else 0)); {18801#false} is VALID [2022-04-27 12:51:23,387 INFO L290 TraceCheckUtils]: 436: Hoare triple {20161#(< |main_#t~post6| 50)} assume !(#t~post6 < 50);havoc #t~post6; {18801#false} is VALID [2022-04-27 12:51:23,387 INFO L290 TraceCheckUtils]: 435: Hoare triple {20165#(< ~counter~0 50)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {20161#(< |main_#t~post6| 50)} is VALID [2022-04-27 12:51:23,387 INFO L290 TraceCheckUtils]: 434: Hoare triple {20165#(< ~counter~0 50)} assume ~a~0 > ~b~0;~a~0 := ~a~0 - ~b~0;~p~0 := ~p~0 - ~q~0;~r~0 := ~r~0 - ~s~0; {20165#(< ~counter~0 50)} is VALID [2022-04-27 12:51:23,388 INFO L290 TraceCheckUtils]: 433: Hoare triple {20165#(< ~counter~0 50)} assume !!(~a~0 != ~b~0); {20165#(< ~counter~0 50)} is VALID [2022-04-27 12:51:23,388 INFO L284 TraceCheckUtils]: 432: Hoare quadruple {18800#true} {20165#(< ~counter~0 50)} #72#return; {20165#(< ~counter~0 50)} is VALID [2022-04-27 12:51:23,388 INFO L290 TraceCheckUtils]: 431: Hoare triple {18800#true} assume true; {18800#true} is VALID [2022-04-27 12:51:23,388 INFO L290 TraceCheckUtils]: 430: Hoare triple {18800#true} assume !(0 == ~cond); {18800#true} is VALID [2022-04-27 12:51:23,389 INFO L290 TraceCheckUtils]: 429: Hoare triple {18800#true} ~cond := #in~cond; {18800#true} is VALID [2022-04-27 12:51:23,389 INFO L272 TraceCheckUtils]: 428: Hoare triple {20165#(< ~counter~0 50)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {18800#true} is VALID [2022-04-27 12:51:23,389 INFO L284 TraceCheckUtils]: 427: Hoare quadruple {18800#true} {20165#(< ~counter~0 50)} #70#return; {20165#(< ~counter~0 50)} is VALID [2022-04-27 12:51:23,389 INFO L290 TraceCheckUtils]: 426: Hoare triple {18800#true} assume true; {18800#true} is VALID [2022-04-27 12:51:23,389 INFO L290 TraceCheckUtils]: 425: Hoare triple {18800#true} assume !(0 == ~cond); {18800#true} is VALID [2022-04-27 12:51:23,389 INFO L290 TraceCheckUtils]: 424: Hoare triple {18800#true} ~cond := #in~cond; {18800#true} is VALID [2022-04-27 12:51:23,389 INFO L272 TraceCheckUtils]: 423: Hoare triple {20165#(< ~counter~0 50)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {18800#true} is VALID [2022-04-27 12:51:23,390 INFO L284 TraceCheckUtils]: 422: Hoare quadruple {18800#true} {20165#(< ~counter~0 50)} #68#return; {20165#(< ~counter~0 50)} is VALID [2022-04-27 12:51:23,390 INFO L290 TraceCheckUtils]: 421: Hoare triple {18800#true} assume true; {18800#true} is VALID [2022-04-27 12:51:23,390 INFO L290 TraceCheckUtils]: 420: Hoare triple {18800#true} assume !(0 == ~cond); {18800#true} is VALID [2022-04-27 12:51:23,390 INFO L290 TraceCheckUtils]: 419: Hoare triple {18800#true} ~cond := #in~cond; {18800#true} is VALID [2022-04-27 12:51:23,390 INFO L272 TraceCheckUtils]: 418: Hoare triple {20165#(< ~counter~0 50)} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {18800#true} is VALID [2022-04-27 12:51:23,390 INFO L290 TraceCheckUtils]: 417: Hoare triple {20165#(< ~counter~0 50)} assume !!(#t~post6 < 50);havoc #t~post6; {20165#(< ~counter~0 50)} is VALID [2022-04-27 12:51:23,391 INFO L290 TraceCheckUtils]: 416: Hoare triple {20223#(< ~counter~0 49)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {20165#(< ~counter~0 50)} is VALID [2022-04-27 12:51:23,391 INFO L290 TraceCheckUtils]: 415: Hoare triple {20223#(< ~counter~0 49)} assume ~a~0 > ~b~0;~a~0 := ~a~0 - ~b~0;~p~0 := ~p~0 - ~q~0;~r~0 := ~r~0 - ~s~0; {20223#(< ~counter~0 49)} is VALID [2022-04-27 12:51:23,392 INFO L290 TraceCheckUtils]: 414: Hoare triple {20223#(< ~counter~0 49)} assume !!(~a~0 != ~b~0); {20223#(< ~counter~0 49)} is VALID [2022-04-27 12:51:23,392 INFO L284 TraceCheckUtils]: 413: Hoare quadruple {18800#true} {20223#(< ~counter~0 49)} #72#return; {20223#(< ~counter~0 49)} is VALID [2022-04-27 12:51:23,392 INFO L290 TraceCheckUtils]: 412: Hoare triple {18800#true} assume true; {18800#true} is VALID [2022-04-27 12:51:23,392 INFO L290 TraceCheckUtils]: 411: Hoare triple {18800#true} assume !(0 == ~cond); {18800#true} is VALID [2022-04-27 12:51:23,392 INFO L290 TraceCheckUtils]: 410: Hoare triple {18800#true} ~cond := #in~cond; {18800#true} is VALID [2022-04-27 12:51:23,392 INFO L272 TraceCheckUtils]: 409: Hoare triple {20223#(< ~counter~0 49)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {18800#true} is VALID [2022-04-27 12:51:23,393 INFO L284 TraceCheckUtils]: 408: Hoare quadruple {18800#true} {20223#(< ~counter~0 49)} #70#return; {20223#(< ~counter~0 49)} is VALID [2022-04-27 12:51:23,393 INFO L290 TraceCheckUtils]: 407: Hoare triple {18800#true} assume true; {18800#true} is VALID [2022-04-27 12:51:23,393 INFO L290 TraceCheckUtils]: 406: Hoare triple {18800#true} assume !(0 == ~cond); {18800#true} is VALID [2022-04-27 12:51:23,393 INFO L290 TraceCheckUtils]: 405: Hoare triple {18800#true} ~cond := #in~cond; {18800#true} is VALID [2022-04-27 12:51:23,393 INFO L272 TraceCheckUtils]: 404: Hoare triple {20223#(< ~counter~0 49)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {18800#true} is VALID [2022-04-27 12:51:23,394 INFO L284 TraceCheckUtils]: 403: Hoare quadruple {18800#true} {20223#(< ~counter~0 49)} #68#return; {20223#(< ~counter~0 49)} is VALID [2022-04-27 12:51:23,394 INFO L290 TraceCheckUtils]: 402: Hoare triple {18800#true} assume true; {18800#true} is VALID [2022-04-27 12:51:23,394 INFO L290 TraceCheckUtils]: 401: Hoare triple {18800#true} assume !(0 == ~cond); {18800#true} is VALID [2022-04-27 12:51:23,394 INFO L290 TraceCheckUtils]: 400: Hoare triple {18800#true} ~cond := #in~cond; {18800#true} is VALID [2022-04-27 12:51:23,394 INFO L272 TraceCheckUtils]: 399: Hoare triple {20223#(< ~counter~0 49)} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {18800#true} is VALID [2022-04-27 12:51:23,394 INFO L290 TraceCheckUtils]: 398: Hoare triple {20223#(< ~counter~0 49)} assume !!(#t~post6 < 50);havoc #t~post6; {20223#(< ~counter~0 49)} is VALID [2022-04-27 12:51:23,395 INFO L290 TraceCheckUtils]: 397: Hoare triple {20281#(< ~counter~0 48)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {20223#(< ~counter~0 49)} is VALID [2022-04-27 12:51:23,395 INFO L290 TraceCheckUtils]: 396: Hoare triple {20281#(< ~counter~0 48)} assume ~a~0 > ~b~0;~a~0 := ~a~0 - ~b~0;~p~0 := ~p~0 - ~q~0;~r~0 := ~r~0 - ~s~0; {20281#(< ~counter~0 48)} is VALID [2022-04-27 12:51:23,395 INFO L290 TraceCheckUtils]: 395: Hoare triple {20281#(< ~counter~0 48)} assume !!(~a~0 != ~b~0); {20281#(< ~counter~0 48)} is VALID [2022-04-27 12:51:23,396 INFO L284 TraceCheckUtils]: 394: Hoare quadruple {18800#true} {20281#(< ~counter~0 48)} #72#return; {20281#(< ~counter~0 48)} is VALID [2022-04-27 12:51:23,396 INFO L290 TraceCheckUtils]: 393: Hoare triple {18800#true} assume true; {18800#true} is VALID [2022-04-27 12:51:23,396 INFO L290 TraceCheckUtils]: 392: Hoare triple {18800#true} assume !(0 == ~cond); {18800#true} is VALID [2022-04-27 12:51:23,396 INFO L290 TraceCheckUtils]: 391: Hoare triple {18800#true} ~cond := #in~cond; {18800#true} is VALID [2022-04-27 12:51:23,396 INFO L272 TraceCheckUtils]: 390: Hoare triple {20281#(< ~counter~0 48)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {18800#true} is VALID [2022-04-27 12:51:23,397 INFO L284 TraceCheckUtils]: 389: Hoare quadruple {18800#true} {20281#(< ~counter~0 48)} #70#return; {20281#(< ~counter~0 48)} is VALID [2022-04-27 12:51:23,397 INFO L290 TraceCheckUtils]: 388: Hoare triple {18800#true} assume true; {18800#true} is VALID [2022-04-27 12:51:23,397 INFO L290 TraceCheckUtils]: 387: Hoare triple {18800#true} assume !(0 == ~cond); {18800#true} is VALID [2022-04-27 12:51:23,397 INFO L290 TraceCheckUtils]: 386: Hoare triple {18800#true} ~cond := #in~cond; {18800#true} is VALID [2022-04-27 12:51:23,397 INFO L272 TraceCheckUtils]: 385: Hoare triple {20281#(< ~counter~0 48)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {18800#true} is VALID [2022-04-27 12:51:23,397 INFO L284 TraceCheckUtils]: 384: Hoare quadruple {18800#true} {20281#(< ~counter~0 48)} #68#return; {20281#(< ~counter~0 48)} is VALID [2022-04-27 12:51:23,398 INFO L290 TraceCheckUtils]: 383: Hoare triple {18800#true} assume true; {18800#true} is VALID [2022-04-27 12:51:23,398 INFO L290 TraceCheckUtils]: 382: Hoare triple {18800#true} assume !(0 == ~cond); {18800#true} is VALID [2022-04-27 12:51:23,398 INFO L290 TraceCheckUtils]: 381: Hoare triple {18800#true} ~cond := #in~cond; {18800#true} is VALID [2022-04-27 12:51:23,398 INFO L272 TraceCheckUtils]: 380: Hoare triple {20281#(< ~counter~0 48)} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {18800#true} is VALID [2022-04-27 12:51:23,398 INFO L290 TraceCheckUtils]: 379: Hoare triple {20281#(< ~counter~0 48)} assume !!(#t~post6 < 50);havoc #t~post6; {20281#(< ~counter~0 48)} is VALID [2022-04-27 12:51:23,398 INFO L290 TraceCheckUtils]: 378: Hoare triple {20339#(< ~counter~0 47)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {20281#(< ~counter~0 48)} is VALID [2022-04-27 12:51:23,399 INFO L290 TraceCheckUtils]: 377: Hoare triple {20339#(< ~counter~0 47)} assume ~a~0 > ~b~0;~a~0 := ~a~0 - ~b~0;~p~0 := ~p~0 - ~q~0;~r~0 := ~r~0 - ~s~0; {20339#(< ~counter~0 47)} is VALID [2022-04-27 12:51:23,399 INFO L290 TraceCheckUtils]: 376: Hoare triple {20339#(< ~counter~0 47)} assume !!(~a~0 != ~b~0); {20339#(< ~counter~0 47)} is VALID [2022-04-27 12:51:23,400 INFO L284 TraceCheckUtils]: 375: Hoare quadruple {18800#true} {20339#(< ~counter~0 47)} #72#return; {20339#(< ~counter~0 47)} is VALID [2022-04-27 12:51:23,400 INFO L290 TraceCheckUtils]: 374: Hoare triple {18800#true} assume true; {18800#true} is VALID [2022-04-27 12:51:23,400 INFO L290 TraceCheckUtils]: 373: Hoare triple {18800#true} assume !(0 == ~cond); {18800#true} is VALID [2022-04-27 12:51:23,400 INFO L290 TraceCheckUtils]: 372: Hoare triple {18800#true} ~cond := #in~cond; {18800#true} is VALID [2022-04-27 12:51:23,401 INFO L272 TraceCheckUtils]: 371: Hoare triple {20339#(< ~counter~0 47)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {18800#true} is VALID [2022-04-27 12:51:23,401 INFO L284 TraceCheckUtils]: 370: Hoare quadruple {18800#true} {20339#(< ~counter~0 47)} #70#return; {20339#(< ~counter~0 47)} is VALID [2022-04-27 12:51:23,401 INFO L290 TraceCheckUtils]: 369: Hoare triple {18800#true} assume true; {18800#true} is VALID [2022-04-27 12:51:23,401 INFO L290 TraceCheckUtils]: 368: Hoare triple {18800#true} assume !(0 == ~cond); {18800#true} is VALID [2022-04-27 12:51:23,401 INFO L290 TraceCheckUtils]: 367: Hoare triple {18800#true} ~cond := #in~cond; {18800#true} is VALID [2022-04-27 12:51:23,401 INFO L272 TraceCheckUtils]: 366: Hoare triple {20339#(< ~counter~0 47)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {18800#true} is VALID [2022-04-27 12:51:23,402 INFO L284 TraceCheckUtils]: 365: Hoare quadruple {18800#true} {20339#(< ~counter~0 47)} #68#return; {20339#(< ~counter~0 47)} is VALID [2022-04-27 12:51:23,402 INFO L290 TraceCheckUtils]: 364: Hoare triple {18800#true} assume true; {18800#true} is VALID [2022-04-27 12:51:23,402 INFO L290 TraceCheckUtils]: 363: Hoare triple {18800#true} assume !(0 == ~cond); {18800#true} is VALID [2022-04-27 12:51:23,402 INFO L290 TraceCheckUtils]: 362: Hoare triple {18800#true} ~cond := #in~cond; {18800#true} is VALID [2022-04-27 12:51:23,402 INFO L272 TraceCheckUtils]: 361: Hoare triple {20339#(< ~counter~0 47)} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {18800#true} is VALID [2022-04-27 12:51:23,402 INFO L290 TraceCheckUtils]: 360: Hoare triple {20339#(< ~counter~0 47)} assume !!(#t~post6 < 50);havoc #t~post6; {20339#(< ~counter~0 47)} is VALID [2022-04-27 12:51:23,403 INFO L290 TraceCheckUtils]: 359: Hoare triple {20397#(< ~counter~0 46)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {20339#(< ~counter~0 47)} is VALID [2022-04-27 12:51:23,403 INFO L290 TraceCheckUtils]: 358: Hoare triple {20397#(< ~counter~0 46)} assume ~a~0 > ~b~0;~a~0 := ~a~0 - ~b~0;~p~0 := ~p~0 - ~q~0;~r~0 := ~r~0 - ~s~0; {20397#(< ~counter~0 46)} is VALID [2022-04-27 12:51:23,403 INFO L290 TraceCheckUtils]: 357: Hoare triple {20397#(< ~counter~0 46)} assume !!(~a~0 != ~b~0); {20397#(< ~counter~0 46)} is VALID [2022-04-27 12:51:23,404 INFO L284 TraceCheckUtils]: 356: Hoare quadruple {18800#true} {20397#(< ~counter~0 46)} #72#return; {20397#(< ~counter~0 46)} is VALID [2022-04-27 12:51:23,404 INFO L290 TraceCheckUtils]: 355: Hoare triple {18800#true} assume true; {18800#true} is VALID [2022-04-27 12:51:23,404 INFO L290 TraceCheckUtils]: 354: Hoare triple {18800#true} assume !(0 == ~cond); {18800#true} is VALID [2022-04-27 12:51:23,404 INFO L290 TraceCheckUtils]: 353: Hoare triple {18800#true} ~cond := #in~cond; {18800#true} is VALID [2022-04-27 12:51:23,404 INFO L272 TraceCheckUtils]: 352: Hoare triple {20397#(< ~counter~0 46)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {18800#true} is VALID [2022-04-27 12:51:23,405 INFO L284 TraceCheckUtils]: 351: Hoare quadruple {18800#true} {20397#(< ~counter~0 46)} #70#return; {20397#(< ~counter~0 46)} is VALID [2022-04-27 12:51:23,405 INFO L290 TraceCheckUtils]: 350: Hoare triple {18800#true} assume true; {18800#true} is VALID [2022-04-27 12:51:23,405 INFO L290 TraceCheckUtils]: 349: Hoare triple {18800#true} assume !(0 == ~cond); {18800#true} is VALID [2022-04-27 12:51:23,405 INFO L290 TraceCheckUtils]: 348: Hoare triple {18800#true} ~cond := #in~cond; {18800#true} is VALID [2022-04-27 12:51:23,405 INFO L272 TraceCheckUtils]: 347: Hoare triple {20397#(< ~counter~0 46)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {18800#true} is VALID [2022-04-27 12:51:23,405 INFO L284 TraceCheckUtils]: 346: Hoare quadruple {18800#true} {20397#(< ~counter~0 46)} #68#return; {20397#(< ~counter~0 46)} is VALID [2022-04-27 12:51:23,406 INFO L290 TraceCheckUtils]: 345: Hoare triple {18800#true} assume true; {18800#true} is VALID [2022-04-27 12:51:23,406 INFO L290 TraceCheckUtils]: 344: Hoare triple {18800#true} assume !(0 == ~cond); {18800#true} is VALID [2022-04-27 12:51:23,406 INFO L290 TraceCheckUtils]: 343: Hoare triple {18800#true} ~cond := #in~cond; {18800#true} is VALID [2022-04-27 12:51:23,406 INFO L272 TraceCheckUtils]: 342: Hoare triple {20397#(< ~counter~0 46)} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {18800#true} is VALID [2022-04-27 12:51:23,406 INFO L290 TraceCheckUtils]: 341: Hoare triple {20397#(< ~counter~0 46)} assume !!(#t~post6 < 50);havoc #t~post6; {20397#(< ~counter~0 46)} is VALID [2022-04-27 12:51:23,406 INFO L290 TraceCheckUtils]: 340: Hoare triple {20455#(< ~counter~0 45)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {20397#(< ~counter~0 46)} is VALID [2022-04-27 12:51:23,407 INFO L290 TraceCheckUtils]: 339: Hoare triple {20455#(< ~counter~0 45)} assume ~a~0 > ~b~0;~a~0 := ~a~0 - ~b~0;~p~0 := ~p~0 - ~q~0;~r~0 := ~r~0 - ~s~0; {20455#(< ~counter~0 45)} is VALID [2022-04-27 12:51:23,407 INFO L290 TraceCheckUtils]: 338: Hoare triple {20455#(< ~counter~0 45)} assume !!(~a~0 != ~b~0); {20455#(< ~counter~0 45)} is VALID [2022-04-27 12:51:23,407 INFO L284 TraceCheckUtils]: 337: Hoare quadruple {18800#true} {20455#(< ~counter~0 45)} #72#return; {20455#(< ~counter~0 45)} is VALID [2022-04-27 12:51:23,408 INFO L290 TraceCheckUtils]: 336: Hoare triple {18800#true} assume true; {18800#true} is VALID [2022-04-27 12:51:23,408 INFO L290 TraceCheckUtils]: 335: Hoare triple {18800#true} assume !(0 == ~cond); {18800#true} is VALID [2022-04-27 12:51:23,408 INFO L290 TraceCheckUtils]: 334: Hoare triple {18800#true} ~cond := #in~cond; {18800#true} is VALID [2022-04-27 12:51:23,408 INFO L272 TraceCheckUtils]: 333: Hoare triple {20455#(< ~counter~0 45)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {18800#true} is VALID [2022-04-27 12:51:23,408 INFO L284 TraceCheckUtils]: 332: Hoare quadruple {18800#true} {20455#(< ~counter~0 45)} #70#return; {20455#(< ~counter~0 45)} is VALID [2022-04-27 12:51:23,408 INFO L290 TraceCheckUtils]: 331: Hoare triple {18800#true} assume true; {18800#true} is VALID [2022-04-27 12:51:23,408 INFO L290 TraceCheckUtils]: 330: Hoare triple {18800#true} assume !(0 == ~cond); {18800#true} is VALID [2022-04-27 12:51:23,408 INFO L290 TraceCheckUtils]: 329: Hoare triple {18800#true} ~cond := #in~cond; {18800#true} is VALID [2022-04-27 12:51:23,408 INFO L272 TraceCheckUtils]: 328: Hoare triple {20455#(< ~counter~0 45)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {18800#true} is VALID [2022-04-27 12:51:23,409 INFO L284 TraceCheckUtils]: 327: Hoare quadruple {18800#true} {20455#(< ~counter~0 45)} #68#return; {20455#(< ~counter~0 45)} is VALID [2022-04-27 12:51:23,409 INFO L290 TraceCheckUtils]: 326: Hoare triple {18800#true} assume true; {18800#true} is VALID [2022-04-27 12:51:23,409 INFO L290 TraceCheckUtils]: 325: Hoare triple {18800#true} assume !(0 == ~cond); {18800#true} is VALID [2022-04-27 12:51:23,409 INFO L290 TraceCheckUtils]: 324: Hoare triple {18800#true} ~cond := #in~cond; {18800#true} is VALID [2022-04-27 12:51:23,409 INFO L272 TraceCheckUtils]: 323: Hoare triple {20455#(< ~counter~0 45)} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {18800#true} is VALID [2022-04-27 12:51:23,409 INFO L290 TraceCheckUtils]: 322: Hoare triple {20455#(< ~counter~0 45)} assume !!(#t~post6 < 50);havoc #t~post6; {20455#(< ~counter~0 45)} is VALID [2022-04-27 12:51:23,410 INFO L290 TraceCheckUtils]: 321: Hoare triple {20513#(< ~counter~0 44)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {20455#(< ~counter~0 45)} is VALID [2022-04-27 12:51:23,410 INFO L290 TraceCheckUtils]: 320: Hoare triple {20513#(< ~counter~0 44)} assume ~a~0 > ~b~0;~a~0 := ~a~0 - ~b~0;~p~0 := ~p~0 - ~q~0;~r~0 := ~r~0 - ~s~0; {20513#(< ~counter~0 44)} is VALID [2022-04-27 12:51:23,410 INFO L290 TraceCheckUtils]: 319: Hoare triple {20513#(< ~counter~0 44)} assume !!(~a~0 != ~b~0); {20513#(< ~counter~0 44)} is VALID [2022-04-27 12:51:23,411 INFO L284 TraceCheckUtils]: 318: Hoare quadruple {18800#true} {20513#(< ~counter~0 44)} #72#return; {20513#(< ~counter~0 44)} is VALID [2022-04-27 12:51:23,411 INFO L290 TraceCheckUtils]: 317: Hoare triple {18800#true} assume true; {18800#true} is VALID [2022-04-27 12:51:23,411 INFO L290 TraceCheckUtils]: 316: Hoare triple {18800#true} assume !(0 == ~cond); {18800#true} is VALID [2022-04-27 12:51:23,411 INFO L290 TraceCheckUtils]: 315: Hoare triple {18800#true} ~cond := #in~cond; {18800#true} is VALID [2022-04-27 12:51:23,411 INFO L272 TraceCheckUtils]: 314: Hoare triple {20513#(< ~counter~0 44)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {18800#true} is VALID [2022-04-27 12:51:23,412 INFO L284 TraceCheckUtils]: 313: Hoare quadruple {18800#true} {20513#(< ~counter~0 44)} #70#return; {20513#(< ~counter~0 44)} is VALID [2022-04-27 12:51:23,412 INFO L290 TraceCheckUtils]: 312: Hoare triple {18800#true} assume true; {18800#true} is VALID [2022-04-27 12:51:23,412 INFO L290 TraceCheckUtils]: 311: Hoare triple {18800#true} assume !(0 == ~cond); {18800#true} is VALID [2022-04-27 12:51:23,412 INFO L290 TraceCheckUtils]: 310: Hoare triple {18800#true} ~cond := #in~cond; {18800#true} is VALID [2022-04-27 12:51:23,412 INFO L272 TraceCheckUtils]: 309: Hoare triple {20513#(< ~counter~0 44)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {18800#true} is VALID [2022-04-27 12:51:23,413 INFO L284 TraceCheckUtils]: 308: Hoare quadruple {18800#true} {20513#(< ~counter~0 44)} #68#return; {20513#(< ~counter~0 44)} is VALID [2022-04-27 12:51:23,413 INFO L290 TraceCheckUtils]: 307: Hoare triple {18800#true} assume true; {18800#true} is VALID [2022-04-27 12:51:23,413 INFO L290 TraceCheckUtils]: 306: Hoare triple {18800#true} assume !(0 == ~cond); {18800#true} is VALID [2022-04-27 12:51:23,413 INFO L290 TraceCheckUtils]: 305: Hoare triple {18800#true} ~cond := #in~cond; {18800#true} is VALID [2022-04-27 12:51:23,413 INFO L272 TraceCheckUtils]: 304: Hoare triple {20513#(< ~counter~0 44)} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {18800#true} is VALID [2022-04-27 12:51:23,413 INFO L290 TraceCheckUtils]: 303: Hoare triple {20513#(< ~counter~0 44)} assume !!(#t~post6 < 50);havoc #t~post6; {20513#(< ~counter~0 44)} is VALID [2022-04-27 12:51:23,414 INFO L290 TraceCheckUtils]: 302: Hoare triple {20571#(< ~counter~0 43)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {20513#(< ~counter~0 44)} is VALID [2022-04-27 12:51:23,414 INFO L290 TraceCheckUtils]: 301: Hoare triple {20571#(< ~counter~0 43)} assume ~a~0 > ~b~0;~a~0 := ~a~0 - ~b~0;~p~0 := ~p~0 - ~q~0;~r~0 := ~r~0 - ~s~0; {20571#(< ~counter~0 43)} is VALID [2022-04-27 12:51:23,414 INFO L290 TraceCheckUtils]: 300: Hoare triple {20571#(< ~counter~0 43)} assume !!(~a~0 != ~b~0); {20571#(< ~counter~0 43)} is VALID [2022-04-27 12:51:23,415 INFO L284 TraceCheckUtils]: 299: Hoare quadruple {18800#true} {20571#(< ~counter~0 43)} #72#return; {20571#(< ~counter~0 43)} is VALID [2022-04-27 12:51:23,415 INFO L290 TraceCheckUtils]: 298: Hoare triple {18800#true} assume true; {18800#true} is VALID [2022-04-27 12:51:23,415 INFO L290 TraceCheckUtils]: 297: Hoare triple {18800#true} assume !(0 == ~cond); {18800#true} is VALID [2022-04-27 12:51:23,415 INFO L290 TraceCheckUtils]: 296: Hoare triple {18800#true} ~cond := #in~cond; {18800#true} is VALID [2022-04-27 12:51:23,415 INFO L272 TraceCheckUtils]: 295: Hoare triple {20571#(< ~counter~0 43)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {18800#true} is VALID [2022-04-27 12:51:23,416 INFO L284 TraceCheckUtils]: 294: Hoare quadruple {18800#true} {20571#(< ~counter~0 43)} #70#return; {20571#(< ~counter~0 43)} is VALID [2022-04-27 12:51:23,416 INFO L290 TraceCheckUtils]: 293: Hoare triple {18800#true} assume true; {18800#true} is VALID [2022-04-27 12:51:23,416 INFO L290 TraceCheckUtils]: 292: Hoare triple {18800#true} assume !(0 == ~cond); {18800#true} is VALID [2022-04-27 12:51:23,416 INFO L290 TraceCheckUtils]: 291: Hoare triple {18800#true} ~cond := #in~cond; {18800#true} is VALID [2022-04-27 12:51:23,416 INFO L272 TraceCheckUtils]: 290: Hoare triple {20571#(< ~counter~0 43)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {18800#true} is VALID [2022-04-27 12:51:23,416 INFO L284 TraceCheckUtils]: 289: Hoare quadruple {18800#true} {20571#(< ~counter~0 43)} #68#return; {20571#(< ~counter~0 43)} is VALID [2022-04-27 12:51:23,416 INFO L290 TraceCheckUtils]: 288: Hoare triple {18800#true} assume true; {18800#true} is VALID [2022-04-27 12:51:23,417 INFO L290 TraceCheckUtils]: 287: Hoare triple {18800#true} assume !(0 == ~cond); {18800#true} is VALID [2022-04-27 12:51:23,417 INFO L290 TraceCheckUtils]: 286: Hoare triple {18800#true} ~cond := #in~cond; {18800#true} is VALID [2022-04-27 12:51:23,417 INFO L272 TraceCheckUtils]: 285: Hoare triple {20571#(< ~counter~0 43)} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {18800#true} is VALID [2022-04-27 12:51:23,417 INFO L290 TraceCheckUtils]: 284: Hoare triple {20571#(< ~counter~0 43)} assume !!(#t~post6 < 50);havoc #t~post6; {20571#(< ~counter~0 43)} is VALID [2022-04-27 12:51:23,417 INFO L290 TraceCheckUtils]: 283: Hoare triple {20629#(< ~counter~0 42)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {20571#(< ~counter~0 43)} is VALID [2022-04-27 12:51:23,418 INFO L290 TraceCheckUtils]: 282: Hoare triple {20629#(< ~counter~0 42)} assume ~a~0 > ~b~0;~a~0 := ~a~0 - ~b~0;~p~0 := ~p~0 - ~q~0;~r~0 := ~r~0 - ~s~0; {20629#(< ~counter~0 42)} is VALID [2022-04-27 12:51:23,418 INFO L290 TraceCheckUtils]: 281: Hoare triple {20629#(< ~counter~0 42)} assume !!(~a~0 != ~b~0); {20629#(< ~counter~0 42)} is VALID [2022-04-27 12:51:23,418 INFO L284 TraceCheckUtils]: 280: Hoare quadruple {18800#true} {20629#(< ~counter~0 42)} #72#return; {20629#(< ~counter~0 42)} is VALID [2022-04-27 12:51:23,419 INFO L290 TraceCheckUtils]: 279: Hoare triple {18800#true} assume true; {18800#true} is VALID [2022-04-27 12:51:23,419 INFO L290 TraceCheckUtils]: 278: Hoare triple {18800#true} assume !(0 == ~cond); {18800#true} is VALID [2022-04-27 12:51:23,419 INFO L290 TraceCheckUtils]: 277: Hoare triple {18800#true} ~cond := #in~cond; {18800#true} is VALID [2022-04-27 12:51:23,419 INFO L272 TraceCheckUtils]: 276: Hoare triple {20629#(< ~counter~0 42)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {18800#true} is VALID [2022-04-27 12:51:23,419 INFO L284 TraceCheckUtils]: 275: Hoare quadruple {18800#true} {20629#(< ~counter~0 42)} #70#return; {20629#(< ~counter~0 42)} is VALID [2022-04-27 12:51:23,419 INFO L290 TraceCheckUtils]: 274: Hoare triple {18800#true} assume true; {18800#true} is VALID [2022-04-27 12:51:23,419 INFO L290 TraceCheckUtils]: 273: Hoare triple {18800#true} assume !(0 == ~cond); {18800#true} is VALID [2022-04-27 12:51:23,419 INFO L290 TraceCheckUtils]: 272: Hoare triple {18800#true} ~cond := #in~cond; {18800#true} is VALID [2022-04-27 12:51:23,420 INFO L272 TraceCheckUtils]: 271: Hoare triple {20629#(< ~counter~0 42)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {18800#true} is VALID [2022-04-27 12:51:23,420 INFO L284 TraceCheckUtils]: 270: Hoare quadruple {18800#true} {20629#(< ~counter~0 42)} #68#return; {20629#(< ~counter~0 42)} is VALID [2022-04-27 12:51:23,420 INFO L290 TraceCheckUtils]: 269: Hoare triple {18800#true} assume true; {18800#true} is VALID [2022-04-27 12:51:23,420 INFO L290 TraceCheckUtils]: 268: Hoare triple {18800#true} assume !(0 == ~cond); {18800#true} is VALID [2022-04-27 12:51:23,420 INFO L290 TraceCheckUtils]: 267: Hoare triple {18800#true} ~cond := #in~cond; {18800#true} is VALID [2022-04-27 12:51:23,420 INFO L272 TraceCheckUtils]: 266: Hoare triple {20629#(< ~counter~0 42)} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {18800#true} is VALID [2022-04-27 12:51:23,421 INFO L290 TraceCheckUtils]: 265: Hoare triple {20629#(< ~counter~0 42)} assume !!(#t~post6 < 50);havoc #t~post6; {20629#(< ~counter~0 42)} is VALID [2022-04-27 12:51:23,421 INFO L290 TraceCheckUtils]: 264: Hoare triple {20687#(< ~counter~0 41)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {20629#(< ~counter~0 42)} is VALID [2022-04-27 12:51:23,421 INFO L290 TraceCheckUtils]: 263: Hoare triple {20687#(< ~counter~0 41)} assume ~a~0 > ~b~0;~a~0 := ~a~0 - ~b~0;~p~0 := ~p~0 - ~q~0;~r~0 := ~r~0 - ~s~0; {20687#(< ~counter~0 41)} is VALID [2022-04-27 12:51:23,421 INFO L290 TraceCheckUtils]: 262: Hoare triple {20687#(< ~counter~0 41)} assume !!(~a~0 != ~b~0); {20687#(< ~counter~0 41)} is VALID [2022-04-27 12:51:23,422 INFO L284 TraceCheckUtils]: 261: Hoare quadruple {18800#true} {20687#(< ~counter~0 41)} #72#return; {20687#(< ~counter~0 41)} is VALID [2022-04-27 12:51:23,422 INFO L290 TraceCheckUtils]: 260: Hoare triple {18800#true} assume true; {18800#true} is VALID [2022-04-27 12:51:23,422 INFO L290 TraceCheckUtils]: 259: Hoare triple {18800#true} assume !(0 == ~cond); {18800#true} is VALID [2022-04-27 12:51:23,422 INFO L290 TraceCheckUtils]: 258: Hoare triple {18800#true} ~cond := #in~cond; {18800#true} is VALID [2022-04-27 12:51:23,422 INFO L272 TraceCheckUtils]: 257: Hoare triple {20687#(< ~counter~0 41)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {18800#true} is VALID [2022-04-27 12:51:23,423 INFO L284 TraceCheckUtils]: 256: Hoare quadruple {18800#true} {20687#(< ~counter~0 41)} #70#return; {20687#(< ~counter~0 41)} is VALID [2022-04-27 12:51:23,423 INFO L290 TraceCheckUtils]: 255: Hoare triple {18800#true} assume true; {18800#true} is VALID [2022-04-27 12:51:23,423 INFO L290 TraceCheckUtils]: 254: Hoare triple {18800#true} assume !(0 == ~cond); {18800#true} is VALID [2022-04-27 12:51:23,423 INFO L290 TraceCheckUtils]: 253: Hoare triple {18800#true} ~cond := #in~cond; {18800#true} is VALID [2022-04-27 12:51:23,423 INFO L272 TraceCheckUtils]: 252: Hoare triple {20687#(< ~counter~0 41)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {18800#true} is VALID [2022-04-27 12:51:23,424 INFO L284 TraceCheckUtils]: 251: Hoare quadruple {18800#true} {20687#(< ~counter~0 41)} #68#return; {20687#(< ~counter~0 41)} is VALID [2022-04-27 12:51:23,424 INFO L290 TraceCheckUtils]: 250: Hoare triple {18800#true} assume true; {18800#true} is VALID [2022-04-27 12:51:23,424 INFO L290 TraceCheckUtils]: 249: Hoare triple {18800#true} assume !(0 == ~cond); {18800#true} is VALID [2022-04-27 12:51:23,424 INFO L290 TraceCheckUtils]: 248: Hoare triple {18800#true} ~cond := #in~cond; {18800#true} is VALID [2022-04-27 12:51:23,424 INFO L272 TraceCheckUtils]: 247: Hoare triple {20687#(< ~counter~0 41)} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {18800#true} is VALID [2022-04-27 12:51:23,424 INFO L290 TraceCheckUtils]: 246: Hoare triple {20687#(< ~counter~0 41)} assume !!(#t~post6 < 50);havoc #t~post6; {20687#(< ~counter~0 41)} is VALID [2022-04-27 12:51:23,424 INFO L290 TraceCheckUtils]: 245: Hoare triple {20745#(< ~counter~0 40)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {20687#(< ~counter~0 41)} is VALID [2022-04-27 12:51:23,425 INFO L290 TraceCheckUtils]: 244: Hoare triple {20745#(< ~counter~0 40)} assume ~a~0 > ~b~0;~a~0 := ~a~0 - ~b~0;~p~0 := ~p~0 - ~q~0;~r~0 := ~r~0 - ~s~0; {20745#(< ~counter~0 40)} is VALID [2022-04-27 12:51:23,425 INFO L290 TraceCheckUtils]: 243: Hoare triple {20745#(< ~counter~0 40)} assume !!(~a~0 != ~b~0); {20745#(< ~counter~0 40)} is VALID [2022-04-27 12:51:23,426 INFO L284 TraceCheckUtils]: 242: Hoare quadruple {18800#true} {20745#(< ~counter~0 40)} #72#return; {20745#(< ~counter~0 40)} is VALID [2022-04-27 12:51:23,426 INFO L290 TraceCheckUtils]: 241: Hoare triple {18800#true} assume true; {18800#true} is VALID [2022-04-27 12:51:23,426 INFO L290 TraceCheckUtils]: 240: Hoare triple {18800#true} assume !(0 == ~cond); {18800#true} is VALID [2022-04-27 12:51:23,426 INFO L290 TraceCheckUtils]: 239: Hoare triple {18800#true} ~cond := #in~cond; {18800#true} is VALID [2022-04-27 12:51:23,426 INFO L272 TraceCheckUtils]: 238: Hoare triple {20745#(< ~counter~0 40)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {18800#true} is VALID [2022-04-27 12:51:23,426 INFO L284 TraceCheckUtils]: 237: Hoare quadruple {18800#true} {20745#(< ~counter~0 40)} #70#return; {20745#(< ~counter~0 40)} is VALID [2022-04-27 12:51:23,426 INFO L290 TraceCheckUtils]: 236: Hoare triple {18800#true} assume true; {18800#true} is VALID [2022-04-27 12:51:23,426 INFO L290 TraceCheckUtils]: 235: Hoare triple {18800#true} assume !(0 == ~cond); {18800#true} is VALID [2022-04-27 12:51:23,426 INFO L290 TraceCheckUtils]: 234: Hoare triple {18800#true} ~cond := #in~cond; {18800#true} is VALID [2022-04-27 12:51:23,427 INFO L272 TraceCheckUtils]: 233: Hoare triple {20745#(< ~counter~0 40)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {18800#true} is VALID [2022-04-27 12:51:23,427 INFO L284 TraceCheckUtils]: 232: Hoare quadruple {18800#true} {20745#(< ~counter~0 40)} #68#return; {20745#(< ~counter~0 40)} is VALID [2022-04-27 12:51:23,427 INFO L290 TraceCheckUtils]: 231: Hoare triple {18800#true} assume true; {18800#true} is VALID [2022-04-27 12:51:23,427 INFO L290 TraceCheckUtils]: 230: Hoare triple {18800#true} assume !(0 == ~cond); {18800#true} is VALID [2022-04-27 12:51:23,427 INFO L290 TraceCheckUtils]: 229: Hoare triple {18800#true} ~cond := #in~cond; {18800#true} is VALID [2022-04-27 12:51:23,427 INFO L272 TraceCheckUtils]: 228: Hoare triple {20745#(< ~counter~0 40)} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {18800#true} is VALID [2022-04-27 12:51:23,428 INFO L290 TraceCheckUtils]: 227: Hoare triple {20745#(< ~counter~0 40)} assume !!(#t~post6 < 50);havoc #t~post6; {20745#(< ~counter~0 40)} is VALID [2022-04-27 12:51:23,428 INFO L290 TraceCheckUtils]: 226: Hoare triple {20803#(< ~counter~0 39)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {20745#(< ~counter~0 40)} is VALID [2022-04-27 12:51:23,428 INFO L290 TraceCheckUtils]: 225: Hoare triple {20803#(< ~counter~0 39)} assume ~a~0 > ~b~0;~a~0 := ~a~0 - ~b~0;~p~0 := ~p~0 - ~q~0;~r~0 := ~r~0 - ~s~0; {20803#(< ~counter~0 39)} is VALID [2022-04-27 12:51:23,429 INFO L290 TraceCheckUtils]: 224: Hoare triple {20803#(< ~counter~0 39)} assume !!(~a~0 != ~b~0); {20803#(< ~counter~0 39)} is VALID [2022-04-27 12:51:23,429 INFO L284 TraceCheckUtils]: 223: Hoare quadruple {18800#true} {20803#(< ~counter~0 39)} #72#return; {20803#(< ~counter~0 39)} is VALID [2022-04-27 12:51:23,429 INFO L290 TraceCheckUtils]: 222: Hoare triple {18800#true} assume true; {18800#true} is VALID [2022-04-27 12:51:23,429 INFO L290 TraceCheckUtils]: 221: Hoare triple {18800#true} assume !(0 == ~cond); {18800#true} is VALID [2022-04-27 12:51:23,429 INFO L290 TraceCheckUtils]: 220: Hoare triple {18800#true} ~cond := #in~cond; {18800#true} is VALID [2022-04-27 12:51:23,429 INFO L272 TraceCheckUtils]: 219: Hoare triple {20803#(< ~counter~0 39)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {18800#true} is VALID [2022-04-27 12:51:23,430 INFO L284 TraceCheckUtils]: 218: Hoare quadruple {18800#true} {20803#(< ~counter~0 39)} #70#return; {20803#(< ~counter~0 39)} is VALID [2022-04-27 12:51:23,430 INFO L290 TraceCheckUtils]: 217: Hoare triple {18800#true} assume true; {18800#true} is VALID [2022-04-27 12:51:23,430 INFO L290 TraceCheckUtils]: 216: Hoare triple {18800#true} assume !(0 == ~cond); {18800#true} is VALID [2022-04-27 12:51:23,430 INFO L290 TraceCheckUtils]: 215: Hoare triple {18800#true} ~cond := #in~cond; {18800#true} is VALID [2022-04-27 12:51:23,430 INFO L272 TraceCheckUtils]: 214: Hoare triple {20803#(< ~counter~0 39)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {18800#true} is VALID [2022-04-27 12:51:23,431 INFO L284 TraceCheckUtils]: 213: Hoare quadruple {18800#true} {20803#(< ~counter~0 39)} #68#return; {20803#(< ~counter~0 39)} is VALID [2022-04-27 12:51:23,431 INFO L290 TraceCheckUtils]: 212: Hoare triple {18800#true} assume true; {18800#true} is VALID [2022-04-27 12:51:23,431 INFO L290 TraceCheckUtils]: 211: Hoare triple {18800#true} assume !(0 == ~cond); {18800#true} is VALID [2022-04-27 12:51:23,431 INFO L290 TraceCheckUtils]: 210: Hoare triple {18800#true} ~cond := #in~cond; {18800#true} is VALID [2022-04-27 12:51:23,431 INFO L272 TraceCheckUtils]: 209: Hoare triple {20803#(< ~counter~0 39)} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {18800#true} is VALID [2022-04-27 12:51:23,431 INFO L290 TraceCheckUtils]: 208: Hoare triple {20803#(< ~counter~0 39)} assume !!(#t~post6 < 50);havoc #t~post6; {20803#(< ~counter~0 39)} is VALID [2022-04-27 12:51:23,432 INFO L290 TraceCheckUtils]: 207: Hoare triple {20861#(< ~counter~0 38)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {20803#(< ~counter~0 39)} is VALID [2022-04-27 12:51:23,432 INFO L290 TraceCheckUtils]: 206: Hoare triple {20861#(< ~counter~0 38)} assume ~a~0 > ~b~0;~a~0 := ~a~0 - ~b~0;~p~0 := ~p~0 - ~q~0;~r~0 := ~r~0 - ~s~0; {20861#(< ~counter~0 38)} is VALID [2022-04-27 12:51:23,432 INFO L290 TraceCheckUtils]: 205: Hoare triple {20861#(< ~counter~0 38)} assume !!(~a~0 != ~b~0); {20861#(< ~counter~0 38)} is VALID [2022-04-27 12:51:23,433 INFO L284 TraceCheckUtils]: 204: Hoare quadruple {18800#true} {20861#(< ~counter~0 38)} #72#return; {20861#(< ~counter~0 38)} is VALID [2022-04-27 12:51:23,433 INFO L290 TraceCheckUtils]: 203: Hoare triple {18800#true} assume true; {18800#true} is VALID [2022-04-27 12:51:23,433 INFO L290 TraceCheckUtils]: 202: Hoare triple {18800#true} assume !(0 == ~cond); {18800#true} is VALID [2022-04-27 12:51:23,433 INFO L290 TraceCheckUtils]: 201: Hoare triple {18800#true} ~cond := #in~cond; {18800#true} is VALID [2022-04-27 12:51:23,433 INFO L272 TraceCheckUtils]: 200: Hoare triple {20861#(< ~counter~0 38)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {18800#true} is VALID [2022-04-27 12:51:23,433 INFO L284 TraceCheckUtils]: 199: Hoare quadruple {18800#true} {20861#(< ~counter~0 38)} #70#return; {20861#(< ~counter~0 38)} is VALID [2022-04-27 12:51:23,434 INFO L290 TraceCheckUtils]: 198: Hoare triple {18800#true} assume true; {18800#true} is VALID [2022-04-27 12:51:23,434 INFO L290 TraceCheckUtils]: 197: Hoare triple {18800#true} assume !(0 == ~cond); {18800#true} is VALID [2022-04-27 12:51:23,434 INFO L290 TraceCheckUtils]: 196: Hoare triple {18800#true} ~cond := #in~cond; {18800#true} is VALID [2022-04-27 12:51:23,434 INFO L272 TraceCheckUtils]: 195: Hoare triple {20861#(< ~counter~0 38)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {18800#true} is VALID [2022-04-27 12:51:23,434 INFO L284 TraceCheckUtils]: 194: Hoare quadruple {18800#true} {20861#(< ~counter~0 38)} #68#return; {20861#(< ~counter~0 38)} is VALID [2022-04-27 12:51:23,434 INFO L290 TraceCheckUtils]: 193: Hoare triple {18800#true} assume true; {18800#true} is VALID [2022-04-27 12:51:23,434 INFO L290 TraceCheckUtils]: 192: Hoare triple {18800#true} assume !(0 == ~cond); {18800#true} is VALID [2022-04-27 12:51:23,434 INFO L290 TraceCheckUtils]: 191: Hoare triple {18800#true} ~cond := #in~cond; {18800#true} is VALID [2022-04-27 12:51:23,434 INFO L272 TraceCheckUtils]: 190: Hoare triple {20861#(< ~counter~0 38)} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {18800#true} is VALID [2022-04-27 12:51:23,435 INFO L290 TraceCheckUtils]: 189: Hoare triple {20861#(< ~counter~0 38)} assume !!(#t~post6 < 50);havoc #t~post6; {20861#(< ~counter~0 38)} is VALID [2022-04-27 12:51:23,435 INFO L290 TraceCheckUtils]: 188: Hoare triple {20919#(< ~counter~0 37)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {20861#(< ~counter~0 38)} is VALID [2022-04-27 12:51:23,435 INFO L290 TraceCheckUtils]: 187: Hoare triple {20919#(< ~counter~0 37)} assume ~a~0 > ~b~0;~a~0 := ~a~0 - ~b~0;~p~0 := ~p~0 - ~q~0;~r~0 := ~r~0 - ~s~0; {20919#(< ~counter~0 37)} is VALID [2022-04-27 12:51:23,436 INFO L290 TraceCheckUtils]: 186: Hoare triple {20919#(< ~counter~0 37)} assume !!(~a~0 != ~b~0); {20919#(< ~counter~0 37)} is VALID [2022-04-27 12:51:23,436 INFO L284 TraceCheckUtils]: 185: Hoare quadruple {18800#true} {20919#(< ~counter~0 37)} #72#return; {20919#(< ~counter~0 37)} is VALID [2022-04-27 12:51:23,436 INFO L290 TraceCheckUtils]: 184: Hoare triple {18800#true} assume true; {18800#true} is VALID [2022-04-27 12:51:23,436 INFO L290 TraceCheckUtils]: 183: Hoare triple {18800#true} assume !(0 == ~cond); {18800#true} is VALID [2022-04-27 12:51:23,436 INFO L290 TraceCheckUtils]: 182: Hoare triple {18800#true} ~cond := #in~cond; {18800#true} is VALID [2022-04-27 12:51:23,437 INFO L272 TraceCheckUtils]: 181: Hoare triple {20919#(< ~counter~0 37)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {18800#true} is VALID [2022-04-27 12:51:23,437 INFO L284 TraceCheckUtils]: 180: Hoare quadruple {18800#true} {20919#(< ~counter~0 37)} #70#return; {20919#(< ~counter~0 37)} is VALID [2022-04-27 12:51:23,437 INFO L290 TraceCheckUtils]: 179: Hoare triple {18800#true} assume true; {18800#true} is VALID [2022-04-27 12:51:23,437 INFO L290 TraceCheckUtils]: 178: Hoare triple {18800#true} assume !(0 == ~cond); {18800#true} is VALID [2022-04-27 12:51:23,437 INFO L290 TraceCheckUtils]: 177: Hoare triple {18800#true} ~cond := #in~cond; {18800#true} is VALID [2022-04-27 12:51:23,437 INFO L272 TraceCheckUtils]: 176: Hoare triple {20919#(< ~counter~0 37)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {18800#true} is VALID [2022-04-27 12:51:23,438 INFO L284 TraceCheckUtils]: 175: Hoare quadruple {18800#true} {20919#(< ~counter~0 37)} #68#return; {20919#(< ~counter~0 37)} is VALID [2022-04-27 12:51:23,438 INFO L290 TraceCheckUtils]: 174: Hoare triple {18800#true} assume true; {18800#true} is VALID [2022-04-27 12:51:23,438 INFO L290 TraceCheckUtils]: 173: Hoare triple {18800#true} assume !(0 == ~cond); {18800#true} is VALID [2022-04-27 12:51:23,438 INFO L290 TraceCheckUtils]: 172: Hoare triple {18800#true} ~cond := #in~cond; {18800#true} is VALID [2022-04-27 12:51:23,438 INFO L272 TraceCheckUtils]: 171: Hoare triple {20919#(< ~counter~0 37)} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {18800#true} is VALID [2022-04-27 12:51:23,438 INFO L290 TraceCheckUtils]: 170: Hoare triple {20919#(< ~counter~0 37)} assume !!(#t~post6 < 50);havoc #t~post6; {20919#(< ~counter~0 37)} is VALID [2022-04-27 12:51:23,439 INFO L290 TraceCheckUtils]: 169: Hoare triple {20977#(< ~counter~0 36)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {20919#(< ~counter~0 37)} is VALID [2022-04-27 12:51:23,439 INFO L290 TraceCheckUtils]: 168: Hoare triple {20977#(< ~counter~0 36)} assume ~a~0 > ~b~0;~a~0 := ~a~0 - ~b~0;~p~0 := ~p~0 - ~q~0;~r~0 := ~r~0 - ~s~0; {20977#(< ~counter~0 36)} is VALID [2022-04-27 12:51:23,439 INFO L290 TraceCheckUtils]: 167: Hoare triple {20977#(< ~counter~0 36)} assume !!(~a~0 != ~b~0); {20977#(< ~counter~0 36)} is VALID [2022-04-27 12:51:23,450 INFO L284 TraceCheckUtils]: 166: Hoare quadruple {18800#true} {20977#(< ~counter~0 36)} #72#return; {20977#(< ~counter~0 36)} is VALID [2022-04-27 12:51:23,450 INFO L290 TraceCheckUtils]: 165: Hoare triple {18800#true} assume true; {18800#true} is VALID [2022-04-27 12:51:23,450 INFO L290 TraceCheckUtils]: 164: Hoare triple {18800#true} assume !(0 == ~cond); {18800#true} is VALID [2022-04-27 12:51:23,450 INFO L290 TraceCheckUtils]: 163: Hoare triple {18800#true} ~cond := #in~cond; {18800#true} is VALID [2022-04-27 12:51:23,450 INFO L272 TraceCheckUtils]: 162: Hoare triple {20977#(< ~counter~0 36)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {18800#true} is VALID [2022-04-27 12:51:23,451 INFO L284 TraceCheckUtils]: 161: Hoare quadruple {18800#true} {20977#(< ~counter~0 36)} #70#return; {20977#(< ~counter~0 36)} is VALID [2022-04-27 12:51:23,451 INFO L290 TraceCheckUtils]: 160: Hoare triple {18800#true} assume true; {18800#true} is VALID [2022-04-27 12:51:23,451 INFO L290 TraceCheckUtils]: 159: Hoare triple {18800#true} assume !(0 == ~cond); {18800#true} is VALID [2022-04-27 12:51:23,451 INFO L290 TraceCheckUtils]: 158: Hoare triple {18800#true} ~cond := #in~cond; {18800#true} is VALID [2022-04-27 12:51:23,451 INFO L272 TraceCheckUtils]: 157: Hoare triple {20977#(< ~counter~0 36)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {18800#true} is VALID [2022-04-27 12:51:23,451 INFO L284 TraceCheckUtils]: 156: Hoare quadruple {18800#true} {20977#(< ~counter~0 36)} #68#return; {20977#(< ~counter~0 36)} is VALID [2022-04-27 12:51:23,451 INFO L290 TraceCheckUtils]: 155: Hoare triple {18800#true} assume true; {18800#true} is VALID [2022-04-27 12:51:23,452 INFO L290 TraceCheckUtils]: 154: Hoare triple {18800#true} assume !(0 == ~cond); {18800#true} is VALID [2022-04-27 12:51:23,452 INFO L290 TraceCheckUtils]: 153: Hoare triple {18800#true} ~cond := #in~cond; {18800#true} is VALID [2022-04-27 12:51:23,452 INFO L272 TraceCheckUtils]: 152: Hoare triple {20977#(< ~counter~0 36)} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {18800#true} is VALID [2022-04-27 12:51:23,452 INFO L290 TraceCheckUtils]: 151: Hoare triple {20977#(< ~counter~0 36)} assume !!(#t~post6 < 50);havoc #t~post6; {20977#(< ~counter~0 36)} is VALID [2022-04-27 12:51:23,453 INFO L290 TraceCheckUtils]: 150: Hoare triple {21035#(< ~counter~0 35)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {20977#(< ~counter~0 36)} is VALID [2022-04-27 12:51:23,453 INFO L290 TraceCheckUtils]: 149: Hoare triple {21035#(< ~counter~0 35)} assume ~a~0 > ~b~0;~a~0 := ~a~0 - ~b~0;~p~0 := ~p~0 - ~q~0;~r~0 := ~r~0 - ~s~0; {21035#(< ~counter~0 35)} is VALID [2022-04-27 12:51:23,453 INFO L290 TraceCheckUtils]: 148: Hoare triple {21035#(< ~counter~0 35)} assume !!(~a~0 != ~b~0); {21035#(< ~counter~0 35)} is VALID [2022-04-27 12:51:23,454 INFO L284 TraceCheckUtils]: 147: Hoare quadruple {18800#true} {21035#(< ~counter~0 35)} #72#return; {21035#(< ~counter~0 35)} is VALID [2022-04-27 12:51:23,454 INFO L290 TraceCheckUtils]: 146: Hoare triple {18800#true} assume true; {18800#true} is VALID [2022-04-27 12:51:23,454 INFO L290 TraceCheckUtils]: 145: Hoare triple {18800#true} assume !(0 == ~cond); {18800#true} is VALID [2022-04-27 12:51:23,454 INFO L290 TraceCheckUtils]: 144: Hoare triple {18800#true} ~cond := #in~cond; {18800#true} is VALID [2022-04-27 12:51:23,454 INFO L272 TraceCheckUtils]: 143: Hoare triple {21035#(< ~counter~0 35)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {18800#true} is VALID [2022-04-27 12:51:23,455 INFO L284 TraceCheckUtils]: 142: Hoare quadruple {18800#true} {21035#(< ~counter~0 35)} #70#return; {21035#(< ~counter~0 35)} is VALID [2022-04-27 12:51:23,455 INFO L290 TraceCheckUtils]: 141: Hoare triple {18800#true} assume true; {18800#true} is VALID [2022-04-27 12:51:23,455 INFO L290 TraceCheckUtils]: 140: Hoare triple {18800#true} assume !(0 == ~cond); {18800#true} is VALID [2022-04-27 12:51:23,455 INFO L290 TraceCheckUtils]: 139: Hoare triple {18800#true} ~cond := #in~cond; {18800#true} is VALID [2022-04-27 12:51:23,455 INFO L272 TraceCheckUtils]: 138: Hoare triple {21035#(< ~counter~0 35)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {18800#true} is VALID [2022-04-27 12:51:23,455 INFO L284 TraceCheckUtils]: 137: Hoare quadruple {18800#true} {21035#(< ~counter~0 35)} #68#return; {21035#(< ~counter~0 35)} is VALID [2022-04-27 12:51:23,455 INFO L290 TraceCheckUtils]: 136: Hoare triple {18800#true} assume true; {18800#true} is VALID [2022-04-27 12:51:23,456 INFO L290 TraceCheckUtils]: 135: Hoare triple {18800#true} assume !(0 == ~cond); {18800#true} is VALID [2022-04-27 12:51:23,456 INFO L290 TraceCheckUtils]: 134: Hoare triple {18800#true} ~cond := #in~cond; {18800#true} is VALID [2022-04-27 12:51:23,456 INFO L272 TraceCheckUtils]: 133: Hoare triple {21035#(< ~counter~0 35)} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {18800#true} is VALID [2022-04-27 12:51:23,456 INFO L290 TraceCheckUtils]: 132: Hoare triple {21035#(< ~counter~0 35)} assume !!(#t~post6 < 50);havoc #t~post6; {21035#(< ~counter~0 35)} is VALID [2022-04-27 12:51:23,456 INFO L290 TraceCheckUtils]: 131: Hoare triple {21093#(< ~counter~0 34)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {21035#(< ~counter~0 35)} is VALID [2022-04-27 12:51:23,457 INFO L290 TraceCheckUtils]: 130: Hoare triple {21093#(< ~counter~0 34)} assume ~a~0 > ~b~0;~a~0 := ~a~0 - ~b~0;~p~0 := ~p~0 - ~q~0;~r~0 := ~r~0 - ~s~0; {21093#(< ~counter~0 34)} is VALID [2022-04-27 12:51:23,457 INFO L290 TraceCheckUtils]: 129: Hoare triple {21093#(< ~counter~0 34)} assume !!(~a~0 != ~b~0); {21093#(< ~counter~0 34)} is VALID [2022-04-27 12:51:23,457 INFO L284 TraceCheckUtils]: 128: Hoare quadruple {18800#true} {21093#(< ~counter~0 34)} #72#return; {21093#(< ~counter~0 34)} is VALID [2022-04-27 12:51:23,457 INFO L290 TraceCheckUtils]: 127: Hoare triple {18800#true} assume true; {18800#true} is VALID [2022-04-27 12:51:23,458 INFO L290 TraceCheckUtils]: 126: Hoare triple {18800#true} assume !(0 == ~cond); {18800#true} is VALID [2022-04-27 12:51:23,458 INFO L290 TraceCheckUtils]: 125: Hoare triple {18800#true} ~cond := #in~cond; {18800#true} is VALID [2022-04-27 12:51:23,458 INFO L272 TraceCheckUtils]: 124: Hoare triple {21093#(< ~counter~0 34)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {18800#true} is VALID [2022-04-27 12:51:23,458 INFO L284 TraceCheckUtils]: 123: Hoare quadruple {18800#true} {21093#(< ~counter~0 34)} #70#return; {21093#(< ~counter~0 34)} is VALID [2022-04-27 12:51:23,458 INFO L290 TraceCheckUtils]: 122: Hoare triple {18800#true} assume true; {18800#true} is VALID [2022-04-27 12:51:23,458 INFO L290 TraceCheckUtils]: 121: Hoare triple {18800#true} assume !(0 == ~cond); {18800#true} is VALID [2022-04-27 12:51:23,458 INFO L290 TraceCheckUtils]: 120: Hoare triple {18800#true} ~cond := #in~cond; {18800#true} is VALID [2022-04-27 12:51:23,458 INFO L272 TraceCheckUtils]: 119: Hoare triple {21093#(< ~counter~0 34)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {18800#true} is VALID [2022-04-27 12:51:23,459 INFO L284 TraceCheckUtils]: 118: Hoare quadruple {18800#true} {21093#(< ~counter~0 34)} #68#return; {21093#(< ~counter~0 34)} is VALID [2022-04-27 12:51:23,459 INFO L290 TraceCheckUtils]: 117: Hoare triple {18800#true} assume true; {18800#true} is VALID [2022-04-27 12:51:23,459 INFO L290 TraceCheckUtils]: 116: Hoare triple {18800#true} assume !(0 == ~cond); {18800#true} is VALID [2022-04-27 12:51:23,459 INFO L290 TraceCheckUtils]: 115: Hoare triple {18800#true} ~cond := #in~cond; {18800#true} is VALID [2022-04-27 12:51:23,459 INFO L272 TraceCheckUtils]: 114: Hoare triple {21093#(< ~counter~0 34)} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {18800#true} is VALID [2022-04-27 12:51:23,459 INFO L290 TraceCheckUtils]: 113: Hoare triple {21093#(< ~counter~0 34)} assume !!(#t~post6 < 50);havoc #t~post6; {21093#(< ~counter~0 34)} is VALID [2022-04-27 12:51:23,460 INFO L290 TraceCheckUtils]: 112: Hoare triple {21151#(< ~counter~0 33)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {21093#(< ~counter~0 34)} is VALID [2022-04-27 12:51:23,460 INFO L290 TraceCheckUtils]: 111: Hoare triple {21151#(< ~counter~0 33)} assume ~a~0 > ~b~0;~a~0 := ~a~0 - ~b~0;~p~0 := ~p~0 - ~q~0;~r~0 := ~r~0 - ~s~0; {21151#(< ~counter~0 33)} is VALID [2022-04-27 12:51:23,460 INFO L290 TraceCheckUtils]: 110: Hoare triple {21151#(< ~counter~0 33)} assume !!(~a~0 != ~b~0); {21151#(< ~counter~0 33)} is VALID [2022-04-27 12:51:23,461 INFO L284 TraceCheckUtils]: 109: Hoare quadruple {18800#true} {21151#(< ~counter~0 33)} #72#return; {21151#(< ~counter~0 33)} is VALID [2022-04-27 12:51:23,461 INFO L290 TraceCheckUtils]: 108: Hoare triple {18800#true} assume true; {18800#true} is VALID [2022-04-27 12:51:23,461 INFO L290 TraceCheckUtils]: 107: Hoare triple {18800#true} assume !(0 == ~cond); {18800#true} is VALID [2022-04-27 12:51:23,461 INFO L290 TraceCheckUtils]: 106: Hoare triple {18800#true} ~cond := #in~cond; {18800#true} is VALID [2022-04-27 12:51:23,461 INFO L272 TraceCheckUtils]: 105: Hoare triple {21151#(< ~counter~0 33)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {18800#true} is VALID [2022-04-27 12:51:23,462 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {18800#true} {21151#(< ~counter~0 33)} #70#return; {21151#(< ~counter~0 33)} is VALID [2022-04-27 12:51:23,462 INFO L290 TraceCheckUtils]: 103: Hoare triple {18800#true} assume true; {18800#true} is VALID [2022-04-27 12:51:23,462 INFO L290 TraceCheckUtils]: 102: Hoare triple {18800#true} assume !(0 == ~cond); {18800#true} is VALID [2022-04-27 12:51:23,462 INFO L290 TraceCheckUtils]: 101: Hoare triple {18800#true} ~cond := #in~cond; {18800#true} is VALID [2022-04-27 12:51:23,462 INFO L272 TraceCheckUtils]: 100: Hoare triple {21151#(< ~counter~0 33)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {18800#true} is VALID [2022-04-27 12:51:23,462 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {18800#true} {21151#(< ~counter~0 33)} #68#return; {21151#(< ~counter~0 33)} is VALID [2022-04-27 12:51:23,463 INFO L290 TraceCheckUtils]: 98: Hoare triple {18800#true} assume true; {18800#true} is VALID [2022-04-27 12:51:23,463 INFO L290 TraceCheckUtils]: 97: Hoare triple {18800#true} assume !(0 == ~cond); {18800#true} is VALID [2022-04-27 12:51:23,463 INFO L290 TraceCheckUtils]: 96: Hoare triple {18800#true} ~cond := #in~cond; {18800#true} is VALID [2022-04-27 12:51:23,463 INFO L272 TraceCheckUtils]: 95: Hoare triple {21151#(< ~counter~0 33)} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {18800#true} is VALID [2022-04-27 12:51:23,463 INFO L290 TraceCheckUtils]: 94: Hoare triple {21151#(< ~counter~0 33)} assume !!(#t~post6 < 50);havoc #t~post6; {21151#(< ~counter~0 33)} is VALID [2022-04-27 12:51:23,463 INFO L290 TraceCheckUtils]: 93: Hoare triple {21209#(< ~counter~0 32)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {21151#(< ~counter~0 33)} is VALID [2022-04-27 12:51:23,464 INFO L290 TraceCheckUtils]: 92: Hoare triple {21209#(< ~counter~0 32)} assume ~a~0 > ~b~0;~a~0 := ~a~0 - ~b~0;~p~0 := ~p~0 - ~q~0;~r~0 := ~r~0 - ~s~0; {21209#(< ~counter~0 32)} is VALID [2022-04-27 12:51:23,464 INFO L290 TraceCheckUtils]: 91: Hoare triple {21209#(< ~counter~0 32)} assume !!(~a~0 != ~b~0); {21209#(< ~counter~0 32)} is VALID [2022-04-27 12:51:23,464 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {18800#true} {21209#(< ~counter~0 32)} #72#return; {21209#(< ~counter~0 32)} is VALID [2022-04-27 12:51:23,465 INFO L290 TraceCheckUtils]: 89: Hoare triple {18800#true} assume true; {18800#true} is VALID [2022-04-27 12:51:23,465 INFO L290 TraceCheckUtils]: 88: Hoare triple {18800#true} assume !(0 == ~cond); {18800#true} is VALID [2022-04-27 12:51:23,465 INFO L290 TraceCheckUtils]: 87: Hoare triple {18800#true} ~cond := #in~cond; {18800#true} is VALID [2022-04-27 12:51:23,465 INFO L272 TraceCheckUtils]: 86: Hoare triple {21209#(< ~counter~0 32)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {18800#true} is VALID [2022-04-27 12:51:23,465 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {18800#true} {21209#(< ~counter~0 32)} #70#return; {21209#(< ~counter~0 32)} is VALID [2022-04-27 12:51:23,465 INFO L290 TraceCheckUtils]: 84: Hoare triple {18800#true} assume true; {18800#true} is VALID [2022-04-27 12:51:23,465 INFO L290 TraceCheckUtils]: 83: Hoare triple {18800#true} assume !(0 == ~cond); {18800#true} is VALID [2022-04-27 12:51:23,465 INFO L290 TraceCheckUtils]: 82: Hoare triple {18800#true} ~cond := #in~cond; {18800#true} is VALID [2022-04-27 12:51:23,466 INFO L272 TraceCheckUtils]: 81: Hoare triple {21209#(< ~counter~0 32)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {18800#true} is VALID [2022-04-27 12:51:23,466 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {18800#true} {21209#(< ~counter~0 32)} #68#return; {21209#(< ~counter~0 32)} is VALID [2022-04-27 12:51:23,466 INFO L290 TraceCheckUtils]: 79: Hoare triple {18800#true} assume true; {18800#true} is VALID [2022-04-27 12:51:23,466 INFO L290 TraceCheckUtils]: 78: Hoare triple {18800#true} assume !(0 == ~cond); {18800#true} is VALID [2022-04-27 12:51:23,466 INFO L290 TraceCheckUtils]: 77: Hoare triple {18800#true} ~cond := #in~cond; {18800#true} is VALID [2022-04-27 12:51:23,466 INFO L272 TraceCheckUtils]: 76: Hoare triple {21209#(< ~counter~0 32)} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {18800#true} is VALID [2022-04-27 12:51:23,467 INFO L290 TraceCheckUtils]: 75: Hoare triple {21209#(< ~counter~0 32)} assume !!(#t~post6 < 50);havoc #t~post6; {21209#(< ~counter~0 32)} is VALID [2022-04-27 12:51:23,467 INFO L290 TraceCheckUtils]: 74: Hoare triple {21267#(< ~counter~0 31)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {21209#(< ~counter~0 32)} is VALID [2022-04-27 12:51:23,467 INFO L290 TraceCheckUtils]: 73: Hoare triple {21267#(< ~counter~0 31)} assume ~a~0 > ~b~0;~a~0 := ~a~0 - ~b~0;~p~0 := ~p~0 - ~q~0;~r~0 := ~r~0 - ~s~0; {21267#(< ~counter~0 31)} is VALID [2022-04-27 12:51:23,468 INFO L290 TraceCheckUtils]: 72: Hoare triple {21267#(< ~counter~0 31)} assume !!(~a~0 != ~b~0); {21267#(< ~counter~0 31)} is VALID [2022-04-27 12:51:23,468 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {18800#true} {21267#(< ~counter~0 31)} #72#return; {21267#(< ~counter~0 31)} is VALID [2022-04-27 12:51:23,468 INFO L290 TraceCheckUtils]: 70: Hoare triple {18800#true} assume true; {18800#true} is VALID [2022-04-27 12:51:23,468 INFO L290 TraceCheckUtils]: 69: Hoare triple {18800#true} assume !(0 == ~cond); {18800#true} is VALID [2022-04-27 12:51:23,468 INFO L290 TraceCheckUtils]: 68: Hoare triple {18800#true} ~cond := #in~cond; {18800#true} is VALID [2022-04-27 12:51:23,468 INFO L272 TraceCheckUtils]: 67: Hoare triple {21267#(< ~counter~0 31)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {18800#true} is VALID [2022-04-27 12:51:23,469 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {18800#true} {21267#(< ~counter~0 31)} #70#return; {21267#(< ~counter~0 31)} is VALID [2022-04-27 12:51:23,469 INFO L290 TraceCheckUtils]: 65: Hoare triple {18800#true} assume true; {18800#true} is VALID [2022-04-27 12:51:23,469 INFO L290 TraceCheckUtils]: 64: Hoare triple {18800#true} assume !(0 == ~cond); {18800#true} is VALID [2022-04-27 12:51:23,469 INFO L290 TraceCheckUtils]: 63: Hoare triple {18800#true} ~cond := #in~cond; {18800#true} is VALID [2022-04-27 12:51:23,469 INFO L272 TraceCheckUtils]: 62: Hoare triple {21267#(< ~counter~0 31)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {18800#true} is VALID [2022-04-27 12:51:23,470 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {18800#true} {21267#(< ~counter~0 31)} #68#return; {21267#(< ~counter~0 31)} is VALID [2022-04-27 12:51:23,470 INFO L290 TraceCheckUtils]: 60: Hoare triple {18800#true} assume true; {18800#true} is VALID [2022-04-27 12:51:23,470 INFO L290 TraceCheckUtils]: 59: Hoare triple {18800#true} assume !(0 == ~cond); {18800#true} is VALID [2022-04-27 12:51:23,470 INFO L290 TraceCheckUtils]: 58: Hoare triple {18800#true} ~cond := #in~cond; {18800#true} is VALID [2022-04-27 12:51:23,470 INFO L272 TraceCheckUtils]: 57: Hoare triple {21267#(< ~counter~0 31)} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {18800#true} is VALID [2022-04-27 12:51:23,470 INFO L290 TraceCheckUtils]: 56: Hoare triple {21267#(< ~counter~0 31)} assume !!(#t~post6 < 50);havoc #t~post6; {21267#(< ~counter~0 31)} is VALID [2022-04-27 12:51:23,471 INFO L290 TraceCheckUtils]: 55: Hoare triple {21325#(< ~counter~0 30)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {21267#(< ~counter~0 31)} is VALID [2022-04-27 12:51:23,471 INFO L290 TraceCheckUtils]: 54: Hoare triple {21325#(< ~counter~0 30)} assume ~a~0 > ~b~0;~a~0 := ~a~0 - ~b~0;~p~0 := ~p~0 - ~q~0;~r~0 := ~r~0 - ~s~0; {21325#(< ~counter~0 30)} is VALID [2022-04-27 12:51:23,471 INFO L290 TraceCheckUtils]: 53: Hoare triple {21325#(< ~counter~0 30)} assume !!(~a~0 != ~b~0); {21325#(< ~counter~0 30)} is VALID [2022-04-27 12:51:23,472 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {18800#true} {21325#(< ~counter~0 30)} #72#return; {21325#(< ~counter~0 30)} is VALID [2022-04-27 12:51:23,472 INFO L290 TraceCheckUtils]: 51: Hoare triple {18800#true} assume true; {18800#true} is VALID [2022-04-27 12:51:23,472 INFO L290 TraceCheckUtils]: 50: Hoare triple {18800#true} assume !(0 == ~cond); {18800#true} is VALID [2022-04-27 12:51:23,472 INFO L290 TraceCheckUtils]: 49: Hoare triple {18800#true} ~cond := #in~cond; {18800#true} is VALID [2022-04-27 12:51:23,472 INFO L272 TraceCheckUtils]: 48: Hoare triple {21325#(< ~counter~0 30)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {18800#true} is VALID [2022-04-27 12:51:23,472 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {18800#true} {21325#(< ~counter~0 30)} #70#return; {21325#(< ~counter~0 30)} is VALID [2022-04-27 12:51:23,473 INFO L290 TraceCheckUtils]: 46: Hoare triple {18800#true} assume true; {18800#true} is VALID [2022-04-27 12:51:23,473 INFO L290 TraceCheckUtils]: 45: Hoare triple {18800#true} assume !(0 == ~cond); {18800#true} is VALID [2022-04-27 12:51:23,473 INFO L290 TraceCheckUtils]: 44: Hoare triple {18800#true} ~cond := #in~cond; {18800#true} is VALID [2022-04-27 12:51:23,473 INFO L272 TraceCheckUtils]: 43: Hoare triple {21325#(< ~counter~0 30)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {18800#true} is VALID [2022-04-27 12:51:23,473 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {18800#true} {21325#(< ~counter~0 30)} #68#return; {21325#(< ~counter~0 30)} is VALID [2022-04-27 12:51:23,473 INFO L290 TraceCheckUtils]: 41: Hoare triple {18800#true} assume true; {18800#true} is VALID [2022-04-27 12:51:23,473 INFO L290 TraceCheckUtils]: 40: Hoare triple {18800#true} assume !(0 == ~cond); {18800#true} is VALID [2022-04-27 12:51:23,473 INFO L290 TraceCheckUtils]: 39: Hoare triple {18800#true} ~cond := #in~cond; {18800#true} is VALID [2022-04-27 12:51:23,473 INFO L272 TraceCheckUtils]: 38: Hoare triple {21325#(< ~counter~0 30)} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {18800#true} is VALID [2022-04-27 12:51:23,474 INFO L290 TraceCheckUtils]: 37: Hoare triple {21325#(< ~counter~0 30)} assume !!(#t~post6 < 50);havoc #t~post6; {21325#(< ~counter~0 30)} is VALID [2022-04-27 12:51:23,474 INFO L290 TraceCheckUtils]: 36: Hoare triple {21383#(< ~counter~0 29)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {21325#(< ~counter~0 30)} is VALID [2022-04-27 12:51:23,474 INFO L290 TraceCheckUtils]: 35: Hoare triple {21383#(< ~counter~0 29)} assume ~a~0 > ~b~0;~a~0 := ~a~0 - ~b~0;~p~0 := ~p~0 - ~q~0;~r~0 := ~r~0 - ~s~0; {21383#(< ~counter~0 29)} is VALID [2022-04-27 12:51:23,475 INFO L290 TraceCheckUtils]: 34: Hoare triple {21383#(< ~counter~0 29)} assume !!(~a~0 != ~b~0); {21383#(< ~counter~0 29)} is VALID [2022-04-27 12:51:23,476 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {18800#true} {21383#(< ~counter~0 29)} #72#return; {21383#(< ~counter~0 29)} is VALID [2022-04-27 12:51:23,476 INFO L290 TraceCheckUtils]: 32: Hoare triple {18800#true} assume true; {18800#true} is VALID [2022-04-27 12:51:23,476 INFO L290 TraceCheckUtils]: 31: Hoare triple {18800#true} assume !(0 == ~cond); {18800#true} is VALID [2022-04-27 12:51:23,477 INFO L290 TraceCheckUtils]: 30: Hoare triple {18800#true} ~cond := #in~cond; {18800#true} is VALID [2022-04-27 12:51:23,477 INFO L272 TraceCheckUtils]: 29: Hoare triple {21383#(< ~counter~0 29)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {18800#true} is VALID [2022-04-27 12:51:23,484 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {18800#true} {21383#(< ~counter~0 29)} #70#return; {21383#(< ~counter~0 29)} is VALID [2022-04-27 12:51:23,484 INFO L290 TraceCheckUtils]: 27: Hoare triple {18800#true} assume true; {18800#true} is VALID [2022-04-27 12:51:23,484 INFO L290 TraceCheckUtils]: 26: Hoare triple {18800#true} assume !(0 == ~cond); {18800#true} is VALID [2022-04-27 12:51:23,484 INFO L290 TraceCheckUtils]: 25: Hoare triple {18800#true} ~cond := #in~cond; {18800#true} is VALID [2022-04-27 12:51:23,484 INFO L272 TraceCheckUtils]: 24: Hoare triple {21383#(< ~counter~0 29)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {18800#true} is VALID [2022-04-27 12:51:23,485 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {18800#true} {21383#(< ~counter~0 29)} #68#return; {21383#(< ~counter~0 29)} is VALID [2022-04-27 12:51:23,485 INFO L290 TraceCheckUtils]: 22: Hoare triple {18800#true} assume true; {18800#true} is VALID [2022-04-27 12:51:23,485 INFO L290 TraceCheckUtils]: 21: Hoare triple {18800#true} assume !(0 == ~cond); {18800#true} is VALID [2022-04-27 12:51:23,485 INFO L290 TraceCheckUtils]: 20: Hoare triple {18800#true} ~cond := #in~cond; {18800#true} is VALID [2022-04-27 12:51:23,485 INFO L272 TraceCheckUtils]: 19: Hoare triple {21383#(< ~counter~0 29)} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {18800#true} is VALID [2022-04-27 12:51:23,485 INFO L290 TraceCheckUtils]: 18: Hoare triple {21383#(< ~counter~0 29)} assume !!(#t~post6 < 50);havoc #t~post6; {21383#(< ~counter~0 29)} is VALID [2022-04-27 12:51:23,486 INFO L290 TraceCheckUtils]: 17: Hoare triple {21441#(< ~counter~0 28)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {21383#(< ~counter~0 29)} is VALID [2022-04-27 12:51:23,486 INFO L290 TraceCheckUtils]: 16: Hoare triple {21441#(< ~counter~0 28)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {21441#(< ~counter~0 28)} is VALID [2022-04-27 12:51:23,487 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {18800#true} {21441#(< ~counter~0 28)} #66#return; {21441#(< ~counter~0 28)} is VALID [2022-04-27 12:51:23,487 INFO L290 TraceCheckUtils]: 14: Hoare triple {18800#true} assume true; {18800#true} is VALID [2022-04-27 12:51:23,487 INFO L290 TraceCheckUtils]: 13: Hoare triple {18800#true} assume !(0 == ~cond); {18800#true} is VALID [2022-04-27 12:51:23,487 INFO L290 TraceCheckUtils]: 12: Hoare triple {18800#true} ~cond := #in~cond; {18800#true} is VALID [2022-04-27 12:51:23,487 INFO L272 TraceCheckUtils]: 11: Hoare triple {21441#(< ~counter~0 28)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {18800#true} is VALID [2022-04-27 12:51:23,488 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {18800#true} {21441#(< ~counter~0 28)} #64#return; {21441#(< ~counter~0 28)} is VALID [2022-04-27 12:51:23,488 INFO L290 TraceCheckUtils]: 9: Hoare triple {18800#true} assume true; {18800#true} is VALID [2022-04-27 12:51:23,488 INFO L290 TraceCheckUtils]: 8: Hoare triple {18800#true} assume !(0 == ~cond); {18800#true} is VALID [2022-04-27 12:51:23,488 INFO L290 TraceCheckUtils]: 7: Hoare triple {18800#true} ~cond := #in~cond; {18800#true} is VALID [2022-04-27 12:51:23,488 INFO L272 TraceCheckUtils]: 6: Hoare triple {21441#(< ~counter~0 28)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {18800#true} is VALID [2022-04-27 12:51:23,489 INFO L290 TraceCheckUtils]: 5: Hoare triple {21441#(< ~counter~0 28)} havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~x~0;havoc ~y~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {21441#(< ~counter~0 28)} is VALID [2022-04-27 12:51:23,489 INFO L272 TraceCheckUtils]: 4: Hoare triple {21441#(< ~counter~0 28)} call #t~ret7 := main(); {21441#(< ~counter~0 28)} is VALID [2022-04-27 12:51:23,489 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21441#(< ~counter~0 28)} {18800#true} #82#return; {21441#(< ~counter~0 28)} is VALID [2022-04-27 12:51:23,490 INFO L290 TraceCheckUtils]: 2: Hoare triple {21441#(< ~counter~0 28)} assume true; {21441#(< ~counter~0 28)} is VALID [2022-04-27 12:51:23,490 INFO L290 TraceCheckUtils]: 1: Hoare triple {18800#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {21441#(< ~counter~0 28)} is VALID [2022-04-27 12:51:23,490 INFO L272 TraceCheckUtils]: 0: Hoare triple {18800#true} call ULTIMATE.init(); {18800#true} is VALID [2022-04-27 12:51:23,494 INFO L134 CoverageAnalysis]: Checked inductivity of 10377 backedges. 132 proven. 1661 refuted. 0 times theorem prover too weak. 8584 trivial. 0 not checked. [2022-04-27 12:51:23,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:51:23,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106542650] [2022-04-27 12:51:23,494 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:51:23,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [144168137] [2022-04-27 12:51:23,494 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [144168137] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 12:51:23,494 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 12:51:23,494 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2022-04-27 12:51:23,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310162286] [2022-04-27 12:51:23,495 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 12:51:23,499 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 5.32) internal successors, (266), 50 states have internal predecessors, (266), 48 states have call successors, (140), 26 states have call predecessors, (140), 25 states have return successors, (138), 46 states have call predecessors, (138), 47 states have call successors, (138) Word has length 441 [2022-04-27 12:51:23,500 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:51:23,500 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 50 states, 50 states have (on average 5.32) internal successors, (266), 50 states have internal predecessors, (266), 48 states have call successors, (140), 26 states have call predecessors, (140), 25 states have return successors, (138), 46 states have call predecessors, (138), 47 states have call successors, (138) [2022-04-27 12:51:23,966 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 544 edges. 544 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:51:23,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-04-27 12:51:23,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:51:23,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-04-27 12:51:23,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1133, Invalid=1317, Unknown=0, NotChecked=0, Total=2450 [2022-04-27 12:51:23,969 INFO L87 Difference]: Start difference. First operand 1143 states and 1292 transitions. Second operand has 50 states, 50 states have (on average 5.32) internal successors, (266), 50 states have internal predecessors, (266), 48 states have call successors, (140), 26 states have call predecessors, (140), 25 states have return successors, (138), 46 states have call predecessors, (138), 47 states have call successors, (138) [2022-04-27 12:51:29,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:51:29,169 INFO L93 Difference]: Finished difference Result 2424 states and 2837 transitions. [2022-04-27 12:51:29,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2022-04-27 12:51:29,170 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 5.32) internal successors, (266), 50 states have internal predecessors, (266), 48 states have call successors, (140), 26 states have call predecessors, (140), 25 states have return successors, (138), 46 states have call predecessors, (138), 47 states have call successors, (138) Word has length 441 [2022-04-27 12:51:29,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:51:29,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 50 states have (on average 5.32) internal successors, (266), 50 states have internal predecessors, (266), 48 states have call successors, (140), 26 states have call predecessors, (140), 25 states have return successors, (138), 46 states have call predecessors, (138), 47 states have call successors, (138) [2022-04-27 12:51:29,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 698 transitions. [2022-04-27 12:51:29,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 50 states have (on average 5.32) internal successors, (266), 50 states have internal predecessors, (266), 48 states have call successors, (140), 26 states have call predecessors, (140), 25 states have return successors, (138), 46 states have call predecessors, (138), 47 states have call successors, (138) [2022-04-27 12:51:29,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 698 transitions. [2022-04-27 12:51:29,217 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 94 states and 698 transitions. [2022-04-27 12:51:29,814 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 698 edges. 698 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:51:30,137 INFO L225 Difference]: With dead ends: 2424 [2022-04-27 12:51:30,138 INFO L226 Difference]: Without dead ends: 2415 [2022-04-27 12:51:30,141 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 926 GetRequests, 833 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1288 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=3316, Invalid=5614, Unknown=0, NotChecked=0, Total=8930 [2022-04-27 12:51:30,141 INFO L413 NwaCegarLoop]: 167 mSDtfsCounter, 532 mSDsluCounter, 495 mSDsCounter, 0 mSdLazyCounter, 707 mSolverCounterSat, 326 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 532 SdHoareTripleChecker+Valid, 662 SdHoareTripleChecker+Invalid, 1033 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 326 IncrementalHoareTripleChecker+Valid, 707 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-04-27 12:51:30,141 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [532 Valid, 662 Invalid, 1033 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [326 Valid, 707 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-04-27 12:51:30,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2415 states. [2022-04-27 12:51:31,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2415 to 2415. [2022-04-27 12:51:31,306 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:51:31,309 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2415 states. Second operand has 2415 states, 1595 states have (on average 1.0877742946708464) internal successors, (1735), 1641 states have internal predecessors, (1735), 500 states have call successors, (500), 320 states have call predecessors, (500), 319 states have return successors, (497), 453 states have call predecessors, (497), 497 states have call successors, (497) [2022-04-27 12:51:31,312 INFO L74 IsIncluded]: Start isIncluded. First operand 2415 states. Second operand has 2415 states, 1595 states have (on average 1.0877742946708464) internal successors, (1735), 1641 states have internal predecessors, (1735), 500 states have call successors, (500), 320 states have call predecessors, (500), 319 states have return successors, (497), 453 states have call predecessors, (497), 497 states have call successors, (497) [2022-04-27 12:51:31,314 INFO L87 Difference]: Start difference. First operand 2415 states. Second operand has 2415 states, 1595 states have (on average 1.0877742946708464) internal successors, (1735), 1641 states have internal predecessors, (1735), 500 states have call successors, (500), 320 states have call predecessors, (500), 319 states have return successors, (497), 453 states have call predecessors, (497), 497 states have call successors, (497) [2022-04-27 12:51:31,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:51:31,570 INFO L93 Difference]: Finished difference Result 2415 states and 2732 transitions. [2022-04-27 12:51:31,570 INFO L276 IsEmpty]: Start isEmpty. Operand 2415 states and 2732 transitions. [2022-04-27 12:51:31,576 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:51:31,576 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:51:31,580 INFO L74 IsIncluded]: Start isIncluded. First operand has 2415 states, 1595 states have (on average 1.0877742946708464) internal successors, (1735), 1641 states have internal predecessors, (1735), 500 states have call successors, (500), 320 states have call predecessors, (500), 319 states have return successors, (497), 453 states have call predecessors, (497), 497 states have call successors, (497) Second operand 2415 states. [2022-04-27 12:51:31,582 INFO L87 Difference]: Start difference. First operand has 2415 states, 1595 states have (on average 1.0877742946708464) internal successors, (1735), 1641 states have internal predecessors, (1735), 500 states have call successors, (500), 320 states have call predecessors, (500), 319 states have return successors, (497), 453 states have call predecessors, (497), 497 states have call successors, (497) Second operand 2415 states. [2022-04-27 12:51:31,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:51:31,820 INFO L93 Difference]: Finished difference Result 2415 states and 2732 transitions. [2022-04-27 12:51:31,820 INFO L276 IsEmpty]: Start isEmpty. Operand 2415 states and 2732 transitions. [2022-04-27 12:51:31,825 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:51:31,825 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:51:31,825 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:51:31,825 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:51:31,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2415 states, 1595 states have (on average 1.0877742946708464) internal successors, (1735), 1641 states have internal predecessors, (1735), 500 states have call successors, (500), 320 states have call predecessors, (500), 319 states have return successors, (497), 453 states have call predecessors, (497), 497 states have call successors, (497) [2022-04-27 12:51:32,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2415 states to 2415 states and 2732 transitions. [2022-04-27 12:51:32,201 INFO L78 Accepts]: Start accepts. Automaton has 2415 states and 2732 transitions. Word has length 441 [2022-04-27 12:51:32,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:51:32,202 INFO L495 AbstractCegarLoop]: Abstraction has 2415 states and 2732 transitions. [2022-04-27 12:51:32,203 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 5.32) internal successors, (266), 50 states have internal predecessors, (266), 48 states have call successors, (140), 26 states have call predecessors, (140), 25 states have return successors, (138), 46 states have call predecessors, (138), 47 states have call successors, (138) [2022-04-27 12:51:32,203 INFO L276 IsEmpty]: Start isEmpty. Operand 2415 states and 2732 transitions. [2022-04-27 12:51:32,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 898 [2022-04-27 12:51:32,229 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:51:32,229 INFO L195 NwaCegarLoop]: trace histogram [139, 138, 138, 47, 46, 46, 46, 46, 46, 46, 46, 46, 46, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:51:32,257 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-04-27 12:51:32,453 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-04-27 12:51:32,454 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:51:32,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:51:32,454 INFO L85 PathProgramCache]: Analyzing trace with hash 942331265, now seen corresponding path program 5 times [2022-04-27 12:51:32,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:51:32,454 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631818697] [2022-04-27 12:51:32,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:51:32,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:51:32,524 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:51:32,525 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1463265070] [2022-04-27 12:51:32,525 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-04-27 12:51:32,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:51:32,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:51:32,528 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) [2022-04-27 12:51:32,529 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process