/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/egcd2-ll.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-14 14:46:59,278 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-14 14:46:59,280 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-14 14:46:59,346 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-14 14:46:59,347 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-14 14:46:59,348 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-14 14:46:59,351 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-14 14:46:59,356 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-14 14:46:59,358 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-14 14:46:59,362 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-14 14:46:59,363 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-14 14:46:59,365 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-14 14:46:59,365 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-14 14:46:59,368 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-14 14:46:59,369 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-14 14:46:59,371 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-14 14:46:59,372 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-14 14:46:59,372 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-14 14:46:59,375 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-14 14:46:59,380 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-14 14:46:59,382 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-14 14:46:59,383 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-14 14:46:59,383 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-14 14:46:59,384 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-14 14:46:59,385 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-14 14:46:59,391 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-14 14:46:59,391 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-14 14:46:59,392 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-14 14:46:59,393 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-14 14:46:59,393 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-14 14:46:59,394 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-14 14:46:59,394 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-14 14:46:59,396 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-14 14:46:59,396 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-14 14:46:59,397 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-14 14:46:59,398 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-14 14:46:59,398 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-14 14:46:59,398 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-14 14:46:59,399 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-14 14:46:59,399 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-14 14:46:59,399 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-14 14:46:59,401 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-14 14:46:59,402 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-14 14:46:59,438 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-14 14:46:59,438 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-14 14:46:59,438 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-14 14:46:59,439 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-14 14:46:59,439 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-14 14:46:59,439 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-14 14:46:59,440 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-14 14:46:59,440 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-14 14:46:59,440 INFO L138 SettingsManager]: * Use SBE=true [2022-04-14 14:46:59,441 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-14 14:46:59,441 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-14 14:46:59,442 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-14 14:46:59,442 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-14 14:46:59,442 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-14 14:46:59,442 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-14 14:46:59,442 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-14 14:46:59,442 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-14 14:46:59,443 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-14 14:46:59,443 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-14 14:46:59,444 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-14 14:46:59,444 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-14 14:46:59,444 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-14 14:46:59,444 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-14 14:46:59,444 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-14 14:46:59,444 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-14 14:46:59,444 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-14 14:46:59,445 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-14 14:46:59,445 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-14 14:46:59,445 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-14 14:46:59,445 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-14 14:46:59,445 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-04-14 14:46:59,445 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-14 14:46:59,445 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-14 14:46:59,446 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-14 14:46:59,698 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-14 14:46:59,726 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-14 14:46:59,728 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-14 14:46:59,729 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-14 14:46:59,729 INFO L275 PluginConnector]: CDTParser initialized [2022-04-14 14:46:59,730 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench/egcd2-ll.c [2022-04-14 14:46:59,790 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/85dae60c9/cd63cdf930f842f4bcabf729b216e5f7/FLAGe0370efcf [2022-04-14 14:47:00,219 INFO L306 CDTParser]: Found 1 translation units. [2022-04-14 14:47:00,219 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench/egcd2-ll.c [2022-04-14 14:47:00,226 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/85dae60c9/cd63cdf930f842f4bcabf729b216e5f7/FLAGe0370efcf [2022-04-14 14:47:00,236 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/85dae60c9/cd63cdf930f842f4bcabf729b216e5f7 [2022-04-14 14:47:00,238 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-14 14:47:00,239 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-14 14:47:00,245 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-14 14:47:00,245 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-14 14:47:00,251 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-14 14:47:00,252 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 02:47:00" (1/1) ... [2022-04-14 14:47:00,253 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d02a3a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 02:47:00, skipping insertion in model container [2022-04-14 14:47:00,253 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 02:47:00" (1/1) ... [2022-04-14 14:47:00,259 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-14 14:47:00,271 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-14 14:47:00,408 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/egcd2-ll.c[490,503] [2022-04-14 14:47:00,427 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-14 14:47:00,434 INFO L203 MainTranslator]: Completed pre-run [2022-04-14 14:47:00,445 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/egcd2-ll.c[490,503] [2022-04-14 14:47:00,456 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-14 14:47:00,468 INFO L208 MainTranslator]: Completed translation [2022-04-14 14:47:00,468 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 02:47:00 WrapperNode [2022-04-14 14:47:00,469 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-14 14:47:00,470 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-14 14:47:00,470 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-14 14:47:00,470 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-14 14:47:00,479 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 02:47:00" (1/1) ... [2022-04-14 14:47:00,479 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 02:47:00" (1/1) ... [2022-04-14 14:47:00,488 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 02:47:00" (1/1) ... [2022-04-14 14:47:00,489 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 02:47:00" (1/1) ... [2022-04-14 14:47:00,495 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 02:47:00" (1/1) ... [2022-04-14 14:47:00,507 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 02:47:00" (1/1) ... [2022-04-14 14:47:00,512 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 02:47:00" (1/1) ... [2022-04-14 14:47:00,514 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-14 14:47:00,515 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-14 14:47:00,515 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-14 14:47:00,515 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-14 14:47:00,516 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 02:47:00" (1/1) ... [2022-04-14 14:47:00,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-14 14:47:00,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 14:47:00,542 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-14 14:47:00,565 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-14 14:47:00,584 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-14 14:47:00,584 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-14 14:47:00,584 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-14 14:47:00,585 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-14 14:47:00,585 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-14 14:47:00,585 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-14 14:47:00,585 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-14 14:47:00,585 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-14 14:47:00,585 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-14 14:47:00,585 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-14 14:47:00,586 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-14 14:47:00,586 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-14 14:47:00,586 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-14 14:47:00,586 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-14 14:47:00,586 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-14 14:47:00,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-14 14:47:00,586 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-14 14:47:00,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-14 14:47:00,586 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-14 14:47:00,587 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-14 14:47:00,636 INFO L234 CfgBuilder]: Building ICFG [2022-04-14 14:47:00,637 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-14 14:47:00,869 INFO L275 CfgBuilder]: Performing block encoding [2022-04-14 14:47:00,892 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-14 14:47:00,892 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-14 14:47:00,894 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 02:47:00 BoogieIcfgContainer [2022-04-14 14:47:00,894 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-14 14:47:00,895 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-14 14:47:00,895 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-14 14:47:00,914 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-14 14:47:00,915 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 02:47:00" (1/3) ... [2022-04-14 14:47:00,915 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@101ac3f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 02:47:00, skipping insertion in model container [2022-04-14 14:47:00,915 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 02:47:00" (2/3) ... [2022-04-14 14:47:00,916 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@101ac3f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 02:47:00, skipping insertion in model container [2022-04-14 14:47:00,916 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 02:47:00" (3/3) ... [2022-04-14 14:47:00,917 INFO L111 eAbstractionObserver]: Analyzing ICFG egcd2-ll.c [2022-04-14 14:47:00,921 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-14 14:47:00,921 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-14 14:47:00,975 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-14 14:47:00,981 INFO L340 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 [2022-04-14 14:47:00,981 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-14 14:47:00,998 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 21 states have internal predecessors, (28), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-14 14:47:01,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-14 14:47:01,005 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 14:47:01,006 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 14:47:01,007 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 14:47:01,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 14:47:01,016 INFO L85 PathProgramCache]: Analyzing trace with hash 1872307417, now seen corresponding path program 1 times [2022-04-14 14:47:01,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 14:47:01,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126392214] [2022-04-14 14:47:01,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 14:47:01,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 14:47:01,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:47:01,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 14:47:01,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:47:01,271 INFO L290 TraceCheckUtils]: 0: Hoare triple {61#(and (= |#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(11, 2);call #Ultimate.allocInit(12, 3); {40#true} is VALID [2022-04-14 14:47:01,271 INFO L290 TraceCheckUtils]: 1: Hoare triple {40#true} assume true; {40#true} is VALID [2022-04-14 14:47:01,272 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {40#true} {40#true} #96#return; {40#true} is VALID [2022-04-14 14:47:01,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-14 14:47:01,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:47:01,283 INFO L290 TraceCheckUtils]: 0: Hoare triple {40#true} ~cond := #in~cond; {40#true} is VALID [2022-04-14 14:47:01,284 INFO L290 TraceCheckUtils]: 1: Hoare triple {40#true} assume 0 == ~cond;assume false; {41#false} is VALID [2022-04-14 14:47:01,285 INFO L290 TraceCheckUtils]: 2: Hoare triple {41#false} assume true; {41#false} is VALID [2022-04-14 14:47:01,285 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41#false} {40#true} #76#return; {41#false} is VALID [2022-04-14 14:47:01,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-14 14:47:01,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:47:01,298 INFO L290 TraceCheckUtils]: 0: Hoare triple {40#true} ~cond := #in~cond; {40#true} is VALID [2022-04-14 14:47:01,299 INFO L290 TraceCheckUtils]: 1: Hoare triple {40#true} assume 0 == ~cond;assume false; {41#false} is VALID [2022-04-14 14:47:01,301 INFO L290 TraceCheckUtils]: 2: Hoare triple {41#false} assume true; {41#false} is VALID [2022-04-14 14:47:01,301 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41#false} {41#false} #78#return; {41#false} is VALID [2022-04-14 14:47:01,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-14 14:47:01,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:47:01,313 INFO L290 TraceCheckUtils]: 0: Hoare triple {40#true} ~cond := #in~cond; {40#true} is VALID [2022-04-14 14:47:01,314 INFO L290 TraceCheckUtils]: 1: Hoare triple {40#true} assume 0 == ~cond;assume false; {41#false} is VALID [2022-04-14 14:47:01,314 INFO L290 TraceCheckUtils]: 2: Hoare triple {41#false} assume true; {41#false} is VALID [2022-04-14 14:47:01,314 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41#false} {41#false} #80#return; {41#false} is VALID [2022-04-14 14:47:01,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-04-14 14:47:01,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:47:01,334 INFO L290 TraceCheckUtils]: 0: Hoare triple {40#true} ~cond := #in~cond; {40#true} is VALID [2022-04-14 14:47:01,335 INFO L290 TraceCheckUtils]: 1: Hoare triple {40#true} assume 0 == ~cond;assume false; {41#false} is VALID [2022-04-14 14:47:01,335 INFO L290 TraceCheckUtils]: 2: Hoare triple {41#false} assume true; {41#false} is VALID [2022-04-14 14:47:01,335 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41#false} {41#false} #82#return; {41#false} is VALID [2022-04-14 14:47:01,337 INFO L272 TraceCheckUtils]: 0: Hoare triple {40#true} call ULTIMATE.init(); {61#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 14:47:01,337 INFO L290 TraceCheckUtils]: 1: Hoare triple {61#(and (= |#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(11, 2);call #Ultimate.allocInit(12, 3); {40#true} is VALID [2022-04-14 14:47:01,337 INFO L290 TraceCheckUtils]: 2: Hoare triple {40#true} assume true; {40#true} is VALID [2022-04-14 14:47:01,338 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40#true} {40#true} #96#return; {40#true} is VALID [2022-04-14 14:47:01,338 INFO L272 TraceCheckUtils]: 4: Hoare triple {40#true} call #t~ret6 := main(); {40#true} is VALID [2022-04-14 14:47:01,338 INFO L290 TraceCheckUtils]: 5: Hoare triple {40#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~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; {40#true} is VALID [2022-04-14 14:47:01,340 INFO L272 TraceCheckUtils]: 6: Hoare triple {40#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {40#true} is VALID [2022-04-14 14:47:01,341 INFO L290 TraceCheckUtils]: 7: Hoare triple {40#true} ~cond := #in~cond; {40#true} is VALID [2022-04-14 14:47:01,342 INFO L290 TraceCheckUtils]: 8: Hoare triple {40#true} assume 0 == ~cond;assume false; {41#false} is VALID [2022-04-14 14:47:01,342 INFO L290 TraceCheckUtils]: 9: Hoare triple {41#false} assume true; {41#false} is VALID [2022-04-14 14:47:01,342 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {41#false} {40#true} #76#return; {41#false} is VALID [2022-04-14 14:47:01,343 INFO L272 TraceCheckUtils]: 11: Hoare triple {41#false} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {40#true} is VALID [2022-04-14 14:47:01,343 INFO L290 TraceCheckUtils]: 12: Hoare triple {40#true} ~cond := #in~cond; {40#true} is VALID [2022-04-14 14:47:01,343 INFO L290 TraceCheckUtils]: 13: Hoare triple {40#true} assume 0 == ~cond;assume false; {41#false} is VALID [2022-04-14 14:47:01,344 INFO L290 TraceCheckUtils]: 14: Hoare triple {41#false} assume true; {41#false} is VALID [2022-04-14 14:47:01,344 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {41#false} {41#false} #78#return; {41#false} is VALID [2022-04-14 14:47:01,344 INFO L290 TraceCheckUtils]: 16: Hoare triple {41#false} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {41#false} is VALID [2022-04-14 14:47:01,345 INFO L272 TraceCheckUtils]: 17: Hoare triple {41#false} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {40#true} is VALID [2022-04-14 14:47:01,345 INFO L290 TraceCheckUtils]: 18: Hoare triple {40#true} ~cond := #in~cond; {40#true} is VALID [2022-04-14 14:47:01,348 INFO L290 TraceCheckUtils]: 19: Hoare triple {40#true} assume 0 == ~cond;assume false; {41#false} is VALID [2022-04-14 14:47:01,348 INFO L290 TraceCheckUtils]: 20: Hoare triple {41#false} assume true; {41#false} is VALID [2022-04-14 14:47:01,348 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {41#false} {41#false} #80#return; {41#false} is VALID [2022-04-14 14:47:01,349 INFO L272 TraceCheckUtils]: 22: Hoare triple {41#false} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {40#true} is VALID [2022-04-14 14:47:01,349 INFO L290 TraceCheckUtils]: 23: Hoare triple {40#true} ~cond := #in~cond; {40#true} is VALID [2022-04-14 14:47:01,349 INFO L290 TraceCheckUtils]: 24: Hoare triple {40#true} assume 0 == ~cond;assume false; {41#false} is VALID [2022-04-14 14:47:01,350 INFO L290 TraceCheckUtils]: 25: Hoare triple {41#false} assume true; {41#false} is VALID [2022-04-14 14:47:01,350 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {41#false} {41#false} #82#return; {41#false} is VALID [2022-04-14 14:47:01,350 INFO L290 TraceCheckUtils]: 27: Hoare triple {41#false} assume !true; {41#false} is VALID [2022-04-14 14:47:01,350 INFO L272 TraceCheckUtils]: 28: Hoare triple {41#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {41#false} is VALID [2022-04-14 14:47:01,353 INFO L290 TraceCheckUtils]: 29: Hoare triple {41#false} ~cond := #in~cond; {41#false} is VALID [2022-04-14 14:47:01,353 INFO L290 TraceCheckUtils]: 30: Hoare triple {41#false} assume 0 == ~cond; {41#false} is VALID [2022-04-14 14:47:01,354 INFO L290 TraceCheckUtils]: 31: Hoare triple {41#false} assume !false; {41#false} is VALID [2022-04-14 14:47:01,355 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-14 14:47:01,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 14:47:01,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126392214] [2022-04-14 14:47:01,357 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126392214] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 14:47:01,357 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 14:47:01,357 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-14 14:47:01,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235730979] [2022-04-14 14:47:01,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 14:47:01,365 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, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 32 [2022-04-14 14:47:01,367 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 14:47:01,370 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, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-14 14:47:01,409 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 14:47:01,409 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-14 14:47:01,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 14:47:01,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-14 14:47:01,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-14 14:47:01,439 INFO L87 Difference]: Start difference. First operand has 37 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 21 states have internal predecessors, (28), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) 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, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-14 14:47:01,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:47:01,627 INFO L93 Difference]: Finished difference Result 67 states and 106 transitions. [2022-04-14 14:47:01,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-14 14:47:01,627 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, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 32 [2022-04-14 14:47:01,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 14:47:01,629 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, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-14 14:47:01,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 106 transitions. [2022-04-14 14:47:01,638 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, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-14 14:47:01,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 106 transitions. [2022-04-14 14:47:01,644 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 106 transitions. [2022-04-14 14:47:01,792 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 14:47:01,805 INFO L225 Difference]: With dead ends: 67 [2022-04-14 14:47:01,805 INFO L226 Difference]: Without dead ends: 32 [2022-04-14 14:47:01,809 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 15 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-14 14:47:01,813 INFO L913 BasicCegarLoop]: 36 mSDtfsCounter, 19 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 14:47:01,814 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 39 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 14:47:01,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-14 14:47:01,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-14 14:47:01,852 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 14:47:01,853 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 32 states, 16 states have (on average 1.1875) internal successors, (19), 18 states have internal predecessors, (19), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-14 14:47:01,855 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 32 states, 16 states have (on average 1.1875) internal successors, (19), 18 states have internal predecessors, (19), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-14 14:47:01,855 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 32 states, 16 states have (on average 1.1875) internal successors, (19), 18 states have internal predecessors, (19), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-14 14:47:01,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:47:01,862 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2022-04-14 14:47:01,862 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-04-14 14:47:01,863 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 14:47:01,863 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 14:47:01,864 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 16 states have (on average 1.1875) internal successors, (19), 18 states have internal predecessors, (19), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 32 states. [2022-04-14 14:47:01,865 INFO L87 Difference]: Start difference. First operand has 32 states, 16 states have (on average 1.1875) internal successors, (19), 18 states have internal predecessors, (19), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 32 states. [2022-04-14 14:47:01,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:47:01,877 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2022-04-14 14:47:01,877 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-04-14 14:47:01,878 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 14:47:01,879 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 14:47:01,879 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 14:47:01,879 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 14:47:01,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 16 states have (on average 1.1875) internal successors, (19), 18 states have internal predecessors, (19), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-14 14:47:01,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 41 transitions. [2022-04-14 14:47:01,885 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 41 transitions. Word has length 32 [2022-04-14 14:47:01,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 14:47:01,886 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 41 transitions. [2022-04-14 14:47:01,886 INFO L479 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, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-14 14:47:01,887 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-04-14 14:47:01,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-14 14:47:01,889 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 14:47:01,889 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 14:47:01,889 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-14 14:47:01,890 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 14:47:01,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 14:47:01,893 INFO L85 PathProgramCache]: Analyzing trace with hash 310247117, now seen corresponding path program 1 times [2022-04-14 14:47:01,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 14:47:01,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010918971] [2022-04-14 14:47:01,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 14:47:01,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 14:47:01,934 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 14:47:01,934 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1628745586] [2022-04-14 14:47:01,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 14:47:01,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 14:47:01,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 14:47:01,944 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-14 14:47:01,963 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-14 14:47:02,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:47:02,009 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-14 14:47:02,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:47:02,028 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 14:47:02,245 INFO L272 TraceCheckUtils]: 0: Hoare triple {276#true} call ULTIMATE.init(); {276#true} is VALID [2022-04-14 14:47:02,245 INFO L290 TraceCheckUtils]: 1: Hoare triple {276#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(11, 2);call #Ultimate.allocInit(12, 3); {276#true} is VALID [2022-04-14 14:47:02,246 INFO L290 TraceCheckUtils]: 2: Hoare triple {276#true} assume true; {276#true} is VALID [2022-04-14 14:47:02,246 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {276#true} {276#true} #96#return; {276#true} is VALID [2022-04-14 14:47:02,248 INFO L272 TraceCheckUtils]: 4: Hoare triple {276#true} call #t~ret6 := main(); {276#true} is VALID [2022-04-14 14:47:02,248 INFO L290 TraceCheckUtils]: 5: Hoare triple {276#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~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; {276#true} is VALID [2022-04-14 14:47:02,248 INFO L272 TraceCheckUtils]: 6: Hoare triple {276#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {276#true} is VALID [2022-04-14 14:47:02,249 INFO L290 TraceCheckUtils]: 7: Hoare triple {276#true} ~cond := #in~cond; {276#true} is VALID [2022-04-14 14:47:02,249 INFO L290 TraceCheckUtils]: 8: Hoare triple {276#true} assume !(0 == ~cond); {276#true} is VALID [2022-04-14 14:47:02,249 INFO L290 TraceCheckUtils]: 9: Hoare triple {276#true} assume true; {276#true} is VALID [2022-04-14 14:47:02,249 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {276#true} {276#true} #76#return; {276#true} is VALID [2022-04-14 14:47:02,249 INFO L272 TraceCheckUtils]: 11: Hoare triple {276#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {276#true} is VALID [2022-04-14 14:47:02,250 INFO L290 TraceCheckUtils]: 12: Hoare triple {276#true} ~cond := #in~cond; {317#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-14 14:47:02,250 INFO L290 TraceCheckUtils]: 13: Hoare triple {317#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {321#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-14 14:47:02,251 INFO L290 TraceCheckUtils]: 14: Hoare triple {321#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {321#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-14 14:47:02,252 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {321#(not (= |assume_abort_if_not_#in~cond| 0))} {276#true} #78#return; {328#(<= 1 main_~y~0)} is VALID [2022-04-14 14:47:02,253 INFO L290 TraceCheckUtils]: 16: Hoare triple {328#(<= 1 main_~y~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {332#(<= 1 main_~b~0)} is VALID [2022-04-14 14:47:02,253 INFO L272 TraceCheckUtils]: 17: Hoare triple {332#(<= 1 main_~b~0)} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {276#true} is VALID [2022-04-14 14:47:02,253 INFO L290 TraceCheckUtils]: 18: Hoare triple {276#true} ~cond := #in~cond; {276#true} is VALID [2022-04-14 14:47:02,253 INFO L290 TraceCheckUtils]: 19: Hoare triple {276#true} assume !(0 == ~cond); {276#true} is VALID [2022-04-14 14:47:02,253 INFO L290 TraceCheckUtils]: 20: Hoare triple {276#true} assume true; {276#true} is VALID [2022-04-14 14:47:02,254 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {276#true} {332#(<= 1 main_~b~0)} #80#return; {332#(<= 1 main_~b~0)} is VALID [2022-04-14 14:47:02,254 INFO L272 TraceCheckUtils]: 22: Hoare triple {332#(<= 1 main_~b~0)} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {276#true} is VALID [2022-04-14 14:47:02,254 INFO L290 TraceCheckUtils]: 23: Hoare triple {276#true} ~cond := #in~cond; {276#true} is VALID [2022-04-14 14:47:02,255 INFO L290 TraceCheckUtils]: 24: Hoare triple {276#true} assume !(0 == ~cond); {276#true} is VALID [2022-04-14 14:47:02,255 INFO L290 TraceCheckUtils]: 25: Hoare triple {276#true} assume true; {276#true} is VALID [2022-04-14 14:47:02,256 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {276#true} {332#(<= 1 main_~b~0)} #82#return; {332#(<= 1 main_~b~0)} is VALID [2022-04-14 14:47:02,256 INFO L290 TraceCheckUtils]: 27: Hoare triple {332#(<= 1 main_~b~0)} assume !false; {332#(<= 1 main_~b~0)} is VALID [2022-04-14 14:47:02,257 INFO L290 TraceCheckUtils]: 28: Hoare triple {332#(<= 1 main_~b~0)} assume !(0 != ~b~0); {277#false} is VALID [2022-04-14 14:47:02,257 INFO L272 TraceCheckUtils]: 29: Hoare triple {277#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {277#false} is VALID [2022-04-14 14:47:02,257 INFO L290 TraceCheckUtils]: 30: Hoare triple {277#false} ~cond := #in~cond; {277#false} is VALID [2022-04-14 14:47:02,257 INFO L290 TraceCheckUtils]: 31: Hoare triple {277#false} assume 0 == ~cond; {277#false} is VALID [2022-04-14 14:47:02,257 INFO L290 TraceCheckUtils]: 32: Hoare triple {277#false} assume !false; {277#false} is VALID [2022-04-14 14:47:02,258 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-14 14:47:02,258 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 14:47:02,553 INFO L290 TraceCheckUtils]: 32: Hoare triple {277#false} assume !false; {277#false} is VALID [2022-04-14 14:47:02,554 INFO L290 TraceCheckUtils]: 31: Hoare triple {277#false} assume 0 == ~cond; {277#false} is VALID [2022-04-14 14:47:02,554 INFO L290 TraceCheckUtils]: 30: Hoare triple {277#false} ~cond := #in~cond; {277#false} is VALID [2022-04-14 14:47:02,555 INFO L272 TraceCheckUtils]: 29: Hoare triple {277#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {277#false} is VALID [2022-04-14 14:47:02,555 INFO L290 TraceCheckUtils]: 28: Hoare triple {332#(<= 1 main_~b~0)} assume !(0 != ~b~0); {277#false} is VALID [2022-04-14 14:47:02,556 INFO L290 TraceCheckUtils]: 27: Hoare triple {332#(<= 1 main_~b~0)} assume !false; {332#(<= 1 main_~b~0)} is VALID [2022-04-14 14:47:02,556 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {276#true} {332#(<= 1 main_~b~0)} #82#return; {332#(<= 1 main_~b~0)} is VALID [2022-04-14 14:47:02,557 INFO L290 TraceCheckUtils]: 25: Hoare triple {276#true} assume true; {276#true} is VALID [2022-04-14 14:47:02,557 INFO L290 TraceCheckUtils]: 24: Hoare triple {276#true} assume !(0 == ~cond); {276#true} is VALID [2022-04-14 14:47:02,557 INFO L290 TraceCheckUtils]: 23: Hoare triple {276#true} ~cond := #in~cond; {276#true} is VALID [2022-04-14 14:47:02,557 INFO L272 TraceCheckUtils]: 22: Hoare triple {332#(<= 1 main_~b~0)} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {276#true} is VALID [2022-04-14 14:47:02,558 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {276#true} {332#(<= 1 main_~b~0)} #80#return; {332#(<= 1 main_~b~0)} is VALID [2022-04-14 14:47:02,558 INFO L290 TraceCheckUtils]: 20: Hoare triple {276#true} assume true; {276#true} is VALID [2022-04-14 14:47:02,558 INFO L290 TraceCheckUtils]: 19: Hoare triple {276#true} assume !(0 == ~cond); {276#true} is VALID [2022-04-14 14:47:02,558 INFO L290 TraceCheckUtils]: 18: Hoare triple {276#true} ~cond := #in~cond; {276#true} is VALID [2022-04-14 14:47:02,558 INFO L272 TraceCheckUtils]: 17: Hoare triple {332#(<= 1 main_~b~0)} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {276#true} is VALID [2022-04-14 14:47:02,559 INFO L290 TraceCheckUtils]: 16: Hoare triple {328#(<= 1 main_~y~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {332#(<= 1 main_~b~0)} is VALID [2022-04-14 14:47:02,562 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {321#(not (= |assume_abort_if_not_#in~cond| 0))} {276#true} #78#return; {328#(<= 1 main_~y~0)} is VALID [2022-04-14 14:47:02,562 INFO L290 TraceCheckUtils]: 14: Hoare triple {321#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {321#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-14 14:47:02,563 INFO L290 TraceCheckUtils]: 13: Hoare triple {441#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} assume !(0 == ~cond); {321#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-14 14:47:02,564 INFO L290 TraceCheckUtils]: 12: Hoare triple {276#true} ~cond := #in~cond; {441#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} is VALID [2022-04-14 14:47:02,564 INFO L272 TraceCheckUtils]: 11: Hoare triple {276#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {276#true} is VALID [2022-04-14 14:47:02,564 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {276#true} {276#true} #76#return; {276#true} is VALID [2022-04-14 14:47:02,564 INFO L290 TraceCheckUtils]: 9: Hoare triple {276#true} assume true; {276#true} is VALID [2022-04-14 14:47:02,565 INFO L290 TraceCheckUtils]: 8: Hoare triple {276#true} assume !(0 == ~cond); {276#true} is VALID [2022-04-14 14:47:02,565 INFO L290 TraceCheckUtils]: 7: Hoare triple {276#true} ~cond := #in~cond; {276#true} is VALID [2022-04-14 14:47:02,565 INFO L272 TraceCheckUtils]: 6: Hoare triple {276#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {276#true} is VALID [2022-04-14 14:47:02,567 INFO L290 TraceCheckUtils]: 5: Hoare triple {276#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~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; {276#true} is VALID [2022-04-14 14:47:02,568 INFO L272 TraceCheckUtils]: 4: Hoare triple {276#true} call #t~ret6 := main(); {276#true} is VALID [2022-04-14 14:47:02,572 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {276#true} {276#true} #96#return; {276#true} is VALID [2022-04-14 14:47:02,573 INFO L290 TraceCheckUtils]: 2: Hoare triple {276#true} assume true; {276#true} is VALID [2022-04-14 14:47:02,573 INFO L290 TraceCheckUtils]: 1: Hoare triple {276#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(11, 2);call #Ultimate.allocInit(12, 3); {276#true} is VALID [2022-04-14 14:47:02,574 INFO L272 TraceCheckUtils]: 0: Hoare triple {276#true} call ULTIMATE.init(); {276#true} is VALID [2022-04-14 14:47:02,575 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-14 14:47:02,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 14:47:02,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010918971] [2022-04-14 14:47:02,575 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 14:47:02,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1628745586] [2022-04-14 14:47:02,578 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1628745586] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-14 14:47:02,579 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-14 14:47:02,579 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2022-04-14 14:47:02,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175783536] [2022-04-14 14:47:02,580 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-14 14:47:02,581 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 33 [2022-04-14 14:47:02,582 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 14:47:02,582 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-14 14:47:02,606 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 14:47:02,606 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-14 14:47:02,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 14:47:02,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-14 14:47:02,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-14 14:47:02,608 INFO L87 Difference]: Start difference. First operand 32 states and 41 transitions. Second operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-14 14:47:03,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:47:03,009 INFO L93 Difference]: Finished difference Result 49 states and 64 transitions. [2022-04-14 14:47:03,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-14 14:47:03,010 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 33 [2022-04-14 14:47:03,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 14:47:03,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-14 14:47:03,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 64 transitions. [2022-04-14 14:47:03,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-14 14:47:03,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 64 transitions. [2022-04-14 14:47:03,017 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 64 transitions. [2022-04-14 14:47:03,076 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-14 14:47:03,078 INFO L225 Difference]: With dead ends: 49 [2022-04-14 14:47:03,078 INFO L226 Difference]: Without dead ends: 41 [2022-04-14 14:47:03,079 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-04-14 14:47:03,080 INFO L913 BasicCegarLoop]: 35 mSDtfsCounter, 19 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-14 14:47:03,080 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 142 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-14 14:47:03,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-04-14 14:47:03,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 34. [2022-04-14 14:47:03,095 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 14:47:03,095 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand has 34 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-14 14:47:03,096 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand has 34 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-14 14:47:03,096 INFO L87 Difference]: Start difference. First operand 41 states. Second operand has 34 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-14 14:47:03,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:47:03,099 INFO L93 Difference]: Finished difference Result 41 states and 55 transitions. [2022-04-14 14:47:03,099 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 55 transitions. [2022-04-14 14:47:03,100 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 14:47:03,100 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 14:47:03,100 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 41 states. [2022-04-14 14:47:03,101 INFO L87 Difference]: Start difference. First operand has 34 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 41 states. [2022-04-14 14:47:03,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:47:03,104 INFO L93 Difference]: Finished difference Result 41 states and 55 transitions. [2022-04-14 14:47:03,104 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 55 transitions. [2022-04-14 14:47:03,104 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 14:47:03,105 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 14:47:03,105 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 14:47:03,105 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 14:47:03,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-14 14:47:03,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 43 transitions. [2022-04-14 14:47:03,107 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 43 transitions. Word has length 33 [2022-04-14 14:47:03,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 14:47:03,107 INFO L478 AbstractCegarLoop]: Abstraction has 34 states and 43 transitions. [2022-04-14 14:47:03,108 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-14 14:47:03,108 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2022-04-14 14:47:03,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-14 14:47:03,108 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 14:47:03,109 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 14:47:03,136 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-14 14:47:03,327 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 14:47:03,328 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 14:47:03,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 14:47:03,328 INFO L85 PathProgramCache]: Analyzing trace with hash 1036600877, now seen corresponding path program 1 times [2022-04-14 14:47:03,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 14:47:03,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899125950] [2022-04-14 14:47:03,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 14:47:03,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 14:47:03,345 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 14:47:03,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [199512232] [2022-04-14 14:47:03,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 14:47:03,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 14:47:03,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 14:47:03,347 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-14 14:47:03,367 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-14 14:47:03,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:47:03,395 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-14 14:47:03,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:47:03,409 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 14:47:03,608 INFO L272 TraceCheckUtils]: 0: Hoare triple {695#true} call ULTIMATE.init(); {695#true} is VALID [2022-04-14 14:47:03,608 INFO L290 TraceCheckUtils]: 1: Hoare triple {695#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(11, 2);call #Ultimate.allocInit(12, 3); {695#true} is VALID [2022-04-14 14:47:03,609 INFO L290 TraceCheckUtils]: 2: Hoare triple {695#true} assume true; {695#true} is VALID [2022-04-14 14:47:03,609 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {695#true} {695#true} #96#return; {695#true} is VALID [2022-04-14 14:47:03,609 INFO L272 TraceCheckUtils]: 4: Hoare triple {695#true} call #t~ret6 := main(); {695#true} is VALID [2022-04-14 14:47:03,609 INFO L290 TraceCheckUtils]: 5: Hoare triple {695#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~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; {695#true} is VALID [2022-04-14 14:47:03,609 INFO L272 TraceCheckUtils]: 6: Hoare triple {695#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {695#true} is VALID [2022-04-14 14:47:03,609 INFO L290 TraceCheckUtils]: 7: Hoare triple {695#true} ~cond := #in~cond; {695#true} is VALID [2022-04-14 14:47:03,610 INFO L290 TraceCheckUtils]: 8: Hoare triple {695#true} assume !(0 == ~cond); {695#true} is VALID [2022-04-14 14:47:03,610 INFO L290 TraceCheckUtils]: 9: Hoare triple {695#true} assume true; {695#true} is VALID [2022-04-14 14:47:03,610 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {695#true} {695#true} #76#return; {695#true} is VALID [2022-04-14 14:47:03,610 INFO L272 TraceCheckUtils]: 11: Hoare triple {695#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {695#true} is VALID [2022-04-14 14:47:03,610 INFO L290 TraceCheckUtils]: 12: Hoare triple {695#true} ~cond := #in~cond; {736#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-14 14:47:03,611 INFO L290 TraceCheckUtils]: 13: Hoare triple {736#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {740#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-14 14:47:03,611 INFO L290 TraceCheckUtils]: 14: Hoare triple {740#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {740#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-14 14:47:03,612 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {740#(not (= |assume_abort_if_not_#in~cond| 0))} {695#true} #78#return; {747#(<= 1 main_~y~0)} is VALID [2022-04-14 14:47:03,613 INFO L290 TraceCheckUtils]: 16: Hoare triple {747#(<= 1 main_~y~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {751#(<= 1 main_~b~0)} is VALID [2022-04-14 14:47:03,613 INFO L272 TraceCheckUtils]: 17: Hoare triple {751#(<= 1 main_~b~0)} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {695#true} is VALID [2022-04-14 14:47:03,613 INFO L290 TraceCheckUtils]: 18: Hoare triple {695#true} ~cond := #in~cond; {695#true} is VALID [2022-04-14 14:47:03,613 INFO L290 TraceCheckUtils]: 19: Hoare triple {695#true} assume !(0 == ~cond); {695#true} is VALID [2022-04-14 14:47:03,613 INFO L290 TraceCheckUtils]: 20: Hoare triple {695#true} assume true; {695#true} is VALID [2022-04-14 14:47:03,614 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {695#true} {751#(<= 1 main_~b~0)} #80#return; {751#(<= 1 main_~b~0)} is VALID [2022-04-14 14:47:03,614 INFO L272 TraceCheckUtils]: 22: Hoare triple {751#(<= 1 main_~b~0)} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {695#true} is VALID [2022-04-14 14:47:03,614 INFO L290 TraceCheckUtils]: 23: Hoare triple {695#true} ~cond := #in~cond; {695#true} is VALID [2022-04-14 14:47:03,614 INFO L290 TraceCheckUtils]: 24: Hoare triple {695#true} assume !(0 == ~cond); {695#true} is VALID [2022-04-14 14:47:03,615 INFO L290 TraceCheckUtils]: 25: Hoare triple {695#true} assume true; {695#true} is VALID [2022-04-14 14:47:03,615 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {695#true} {751#(<= 1 main_~b~0)} #82#return; {751#(<= 1 main_~b~0)} is VALID [2022-04-14 14:47:03,616 INFO L290 TraceCheckUtils]: 27: Hoare triple {751#(<= 1 main_~b~0)} assume !false; {751#(<= 1 main_~b~0)} is VALID [2022-04-14 14:47:03,616 INFO L290 TraceCheckUtils]: 28: Hoare triple {751#(<= 1 main_~b~0)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {788#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (<= 1 main_~b~0))} is VALID [2022-04-14 14:47:03,617 INFO L290 TraceCheckUtils]: 29: Hoare triple {788#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (<= 1 main_~b~0))} assume !false; {788#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (<= 1 main_~b~0))} is VALID [2022-04-14 14:47:03,618 INFO L272 TraceCheckUtils]: 30: Hoare triple {788#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (<= 1 main_~b~0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {795#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 14:47:03,618 INFO L290 TraceCheckUtils]: 31: Hoare triple {795#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {799#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 14:47:03,618 INFO L290 TraceCheckUtils]: 32: Hoare triple {799#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {696#false} is VALID [2022-04-14 14:47:03,619 INFO L290 TraceCheckUtils]: 33: Hoare triple {696#false} assume !false; {696#false} is VALID [2022-04-14 14:47:03,619 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-14 14:47:03,619 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 14:47:03,814 INFO L290 TraceCheckUtils]: 33: Hoare triple {696#false} assume !false; {696#false} is VALID [2022-04-14 14:47:03,815 INFO L290 TraceCheckUtils]: 32: Hoare triple {799#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {696#false} is VALID [2022-04-14 14:47:03,815 INFO L290 TraceCheckUtils]: 31: Hoare triple {795#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {799#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 14:47:03,816 INFO L272 TraceCheckUtils]: 30: Hoare triple {815#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {795#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 14:47:03,816 INFO L290 TraceCheckUtils]: 29: Hoare triple {815#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} assume !false; {815#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-14 14:47:03,817 INFO L290 TraceCheckUtils]: 28: Hoare triple {695#true} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {815#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-14 14:47:03,817 INFO L290 TraceCheckUtils]: 27: Hoare triple {695#true} assume !false; {695#true} is VALID [2022-04-14 14:47:03,817 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {695#true} {695#true} #82#return; {695#true} is VALID [2022-04-14 14:47:03,817 INFO L290 TraceCheckUtils]: 25: Hoare triple {695#true} assume true; {695#true} is VALID [2022-04-14 14:47:03,817 INFO L290 TraceCheckUtils]: 24: Hoare triple {695#true} assume !(0 == ~cond); {695#true} is VALID [2022-04-14 14:47:03,817 INFO L290 TraceCheckUtils]: 23: Hoare triple {695#true} ~cond := #in~cond; {695#true} is VALID [2022-04-14 14:47:03,818 INFO L272 TraceCheckUtils]: 22: Hoare triple {695#true} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {695#true} is VALID [2022-04-14 14:47:03,818 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {695#true} {695#true} #80#return; {695#true} is VALID [2022-04-14 14:47:03,818 INFO L290 TraceCheckUtils]: 20: Hoare triple {695#true} assume true; {695#true} is VALID [2022-04-14 14:47:03,818 INFO L290 TraceCheckUtils]: 19: Hoare triple {695#true} assume !(0 == ~cond); {695#true} is VALID [2022-04-14 14:47:03,818 INFO L290 TraceCheckUtils]: 18: Hoare triple {695#true} ~cond := #in~cond; {695#true} is VALID [2022-04-14 14:47:03,818 INFO L272 TraceCheckUtils]: 17: Hoare triple {695#true} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {695#true} is VALID [2022-04-14 14:47:03,818 INFO L290 TraceCheckUtils]: 16: Hoare triple {695#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {695#true} is VALID [2022-04-14 14:47:03,818 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {695#true} {695#true} #78#return; {695#true} is VALID [2022-04-14 14:47:03,819 INFO L290 TraceCheckUtils]: 14: Hoare triple {695#true} assume true; {695#true} is VALID [2022-04-14 14:47:03,819 INFO L290 TraceCheckUtils]: 13: Hoare triple {695#true} assume !(0 == ~cond); {695#true} is VALID [2022-04-14 14:47:03,819 INFO L290 TraceCheckUtils]: 12: Hoare triple {695#true} ~cond := #in~cond; {695#true} is VALID [2022-04-14 14:47:03,819 INFO L272 TraceCheckUtils]: 11: Hoare triple {695#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {695#true} is VALID [2022-04-14 14:47:03,819 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {695#true} {695#true} #76#return; {695#true} is VALID [2022-04-14 14:47:03,819 INFO L290 TraceCheckUtils]: 9: Hoare triple {695#true} assume true; {695#true} is VALID [2022-04-14 14:47:03,819 INFO L290 TraceCheckUtils]: 8: Hoare triple {695#true} assume !(0 == ~cond); {695#true} is VALID [2022-04-14 14:47:03,819 INFO L290 TraceCheckUtils]: 7: Hoare triple {695#true} ~cond := #in~cond; {695#true} is VALID [2022-04-14 14:47:03,820 INFO L272 TraceCheckUtils]: 6: Hoare triple {695#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {695#true} is VALID [2022-04-14 14:47:03,820 INFO L290 TraceCheckUtils]: 5: Hoare triple {695#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~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; {695#true} is VALID [2022-04-14 14:47:03,820 INFO L272 TraceCheckUtils]: 4: Hoare triple {695#true} call #t~ret6 := main(); {695#true} is VALID [2022-04-14 14:47:03,820 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {695#true} {695#true} #96#return; {695#true} is VALID [2022-04-14 14:47:03,820 INFO L290 TraceCheckUtils]: 2: Hoare triple {695#true} assume true; {695#true} is VALID [2022-04-14 14:47:03,820 INFO L290 TraceCheckUtils]: 1: Hoare triple {695#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(11, 2);call #Ultimate.allocInit(12, 3); {695#true} is VALID [2022-04-14 14:47:03,820 INFO L272 TraceCheckUtils]: 0: Hoare triple {695#true} call ULTIMATE.init(); {695#true} is VALID [2022-04-14 14:47:03,821 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-14 14:47:03,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 14:47:03,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899125950] [2022-04-14 14:47:03,821 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 14:47:03,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [199512232] [2022-04-14 14:47:03,821 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [199512232] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-14 14:47:03,821 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-14 14:47:03,821 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 10 [2022-04-14 14:47:03,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144256798] [2022-04-14 14:47:03,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 14:47:03,822 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 34 [2022-04-14 14:47:03,823 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 14:47:03,823 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-14 14:47:03,847 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 14:47:03,848 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-14 14:47:03,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 14:47:03,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-14 14:47:03,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-04-14 14:47:03,849 INFO L87 Difference]: Start difference. First operand 34 states and 43 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-14 14:47:04,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:47:04,098 INFO L93 Difference]: Finished difference Result 40 states and 48 transitions. [2022-04-14 14:47:04,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-14 14:47:04,101 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 34 [2022-04-14 14:47:04,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 14:47:04,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-14 14:47:04,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 46 transitions. [2022-04-14 14:47:04,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-14 14:47:04,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 46 transitions. [2022-04-14 14:47:04,107 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 46 transitions. [2022-04-14 14:47:04,153 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 14:47:04,154 INFO L225 Difference]: With dead ends: 40 [2022-04-14 14:47:04,154 INFO L226 Difference]: Without dead ends: 38 [2022-04-14 14:47:04,155 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-04-14 14:47:04,156 INFO L913 BasicCegarLoop]: 35 mSDtfsCounter, 6 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 117 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.1s IncrementalHoareTripleChecker+Time [2022-04-14 14:47:04,156 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 117 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-14 14:47:04,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-04-14 14:47:04,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-04-14 14:47:04,175 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 14:47:04,175 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand has 38 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 22 states have internal predecessors, (24), 12 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-14 14:47:04,175 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand has 38 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 22 states have internal predecessors, (24), 12 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-14 14:47:04,176 INFO L87 Difference]: Start difference. First operand 38 states. Second operand has 38 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 22 states have internal predecessors, (24), 12 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-14 14:47:04,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:47:04,178 INFO L93 Difference]: Finished difference Result 38 states and 46 transitions. [2022-04-14 14:47:04,178 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 46 transitions. [2022-04-14 14:47:04,178 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 14:47:04,178 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 14:47:04,179 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 22 states have internal predecessors, (24), 12 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 38 states. [2022-04-14 14:47:04,179 INFO L87 Difference]: Start difference. First operand has 38 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 22 states have internal predecessors, (24), 12 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 38 states. [2022-04-14 14:47:04,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:47:04,181 INFO L93 Difference]: Finished difference Result 38 states and 46 transitions. [2022-04-14 14:47:04,181 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 46 transitions. [2022-04-14 14:47:04,182 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 14:47:04,182 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 14:47:04,182 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 14:47:04,182 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 14:47:04,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 22 states have internal predecessors, (24), 12 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-14 14:47:04,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 46 transitions. [2022-04-14 14:47:04,184 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 46 transitions. Word has length 34 [2022-04-14 14:47:04,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 14:47:04,184 INFO L478 AbstractCegarLoop]: Abstraction has 38 states and 46 transitions. [2022-04-14 14:47:04,185 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-14 14:47:04,185 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 46 transitions. [2022-04-14 14:47:04,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-14 14:47:04,185 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 14:47:04,186 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 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-14 14:47:04,211 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-14 14:47:04,399 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-14 14:47:04,400 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 14:47:04,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 14:47:04,400 INFO L85 PathProgramCache]: Analyzing trace with hash -844413996, now seen corresponding path program 1 times [2022-04-14 14:47:04,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 14:47:04,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477064108] [2022-04-14 14:47:04,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 14:47:04,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 14:47:04,415 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 14:47:04,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2050329313] [2022-04-14 14:47:04,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 14:47:04,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 14:47:04,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 14:47:04,417 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-14 14:47:04,426 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-14 14:47:04,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:47:04,466 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-14 14:47:04,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:47:04,476 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 14:47:04,654 INFO L272 TraceCheckUtils]: 0: Hoare triple {1104#true} call ULTIMATE.init(); {1104#true} is VALID [2022-04-14 14:47:04,654 INFO L290 TraceCheckUtils]: 1: Hoare triple {1104#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(11, 2);call #Ultimate.allocInit(12, 3); {1104#true} is VALID [2022-04-14 14:47:04,654 INFO L290 TraceCheckUtils]: 2: Hoare triple {1104#true} assume true; {1104#true} is VALID [2022-04-14 14:47:04,655 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1104#true} {1104#true} #96#return; {1104#true} is VALID [2022-04-14 14:47:04,655 INFO L272 TraceCheckUtils]: 4: Hoare triple {1104#true} call #t~ret6 := main(); {1104#true} is VALID [2022-04-14 14:47:04,655 INFO L290 TraceCheckUtils]: 5: Hoare triple {1104#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~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; {1104#true} is VALID [2022-04-14 14:47:04,655 INFO L272 TraceCheckUtils]: 6: Hoare triple {1104#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {1104#true} is VALID [2022-04-14 14:47:04,655 INFO L290 TraceCheckUtils]: 7: Hoare triple {1104#true} ~cond := #in~cond; {1104#true} is VALID [2022-04-14 14:47:04,655 INFO L290 TraceCheckUtils]: 8: Hoare triple {1104#true} assume !(0 == ~cond); {1104#true} is VALID [2022-04-14 14:47:04,655 INFO L290 TraceCheckUtils]: 9: Hoare triple {1104#true} assume true; {1104#true} is VALID [2022-04-14 14:47:04,656 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1104#true} {1104#true} #76#return; {1104#true} is VALID [2022-04-14 14:47:04,656 INFO L272 TraceCheckUtils]: 11: Hoare triple {1104#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1104#true} is VALID [2022-04-14 14:47:04,656 INFO L290 TraceCheckUtils]: 12: Hoare triple {1104#true} ~cond := #in~cond; {1104#true} is VALID [2022-04-14 14:47:04,656 INFO L290 TraceCheckUtils]: 13: Hoare triple {1104#true} assume !(0 == ~cond); {1104#true} is VALID [2022-04-14 14:47:04,656 INFO L290 TraceCheckUtils]: 14: Hoare triple {1104#true} assume true; {1104#true} is VALID [2022-04-14 14:47:04,656 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1104#true} {1104#true} #78#return; {1104#true} is VALID [2022-04-14 14:47:04,659 INFO L290 TraceCheckUtils]: 16: Hoare triple {1104#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {1157#(and (= main_~r~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 14:47:04,660 INFO L272 TraceCheckUtils]: 17: Hoare triple {1157#(and (= main_~r~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {1104#true} is VALID [2022-04-14 14:47:04,660 INFO L290 TraceCheckUtils]: 18: Hoare triple {1104#true} ~cond := #in~cond; {1104#true} is VALID [2022-04-14 14:47:04,660 INFO L290 TraceCheckUtils]: 19: Hoare triple {1104#true} assume !(0 == ~cond); {1104#true} is VALID [2022-04-14 14:47:04,660 INFO L290 TraceCheckUtils]: 20: Hoare triple {1104#true} assume true; {1104#true} is VALID [2022-04-14 14:47:04,661 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1104#true} {1157#(and (= main_~r~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #80#return; {1157#(and (= main_~r~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 14:47:04,661 INFO L272 TraceCheckUtils]: 22: Hoare triple {1157#(and (= main_~r~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {1104#true} is VALID [2022-04-14 14:47:04,661 INFO L290 TraceCheckUtils]: 23: Hoare triple {1104#true} ~cond := #in~cond; {1104#true} is VALID [2022-04-14 14:47:04,661 INFO L290 TraceCheckUtils]: 24: Hoare triple {1104#true} assume !(0 == ~cond); {1104#true} is VALID [2022-04-14 14:47:04,661 INFO L290 TraceCheckUtils]: 25: Hoare triple {1104#true} assume true; {1104#true} is VALID [2022-04-14 14:47:04,662 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1104#true} {1157#(and (= main_~r~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #82#return; {1157#(and (= main_~r~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 14:47:04,662 INFO L290 TraceCheckUtils]: 27: Hoare triple {1157#(and (= main_~r~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !false; {1157#(and (= main_~r~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 14:47:04,663 INFO L290 TraceCheckUtils]: 28: Hoare triple {1157#(and (= main_~r~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {1157#(and (= main_~r~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 14:47:04,663 INFO L290 TraceCheckUtils]: 29: Hoare triple {1157#(and (= main_~r~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !false; {1157#(and (= main_~r~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 14:47:04,663 INFO L272 TraceCheckUtils]: 30: Hoare triple {1157#(and (= main_~r~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {1104#true} is VALID [2022-04-14 14:47:04,663 INFO L290 TraceCheckUtils]: 31: Hoare triple {1104#true} ~cond := #in~cond; {1104#true} is VALID [2022-04-14 14:47:04,664 INFO L290 TraceCheckUtils]: 32: Hoare triple {1104#true} assume !(0 == ~cond); {1104#true} is VALID [2022-04-14 14:47:04,664 INFO L290 TraceCheckUtils]: 33: Hoare triple {1104#true} assume true; {1104#true} is VALID [2022-04-14 14:47:04,664 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {1104#true} {1157#(and (= main_~r~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #84#return; {1157#(and (= main_~r~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 14:47:04,665 INFO L272 TraceCheckUtils]: 35: Hoare triple {1157#(and (= main_~r~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)); {1215#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 14:47:04,665 INFO L290 TraceCheckUtils]: 36: Hoare triple {1215#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1219#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 14:47:04,668 INFO L290 TraceCheckUtils]: 37: Hoare triple {1219#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1105#false} is VALID [2022-04-14 14:47:04,668 INFO L290 TraceCheckUtils]: 38: Hoare triple {1105#false} assume !false; {1105#false} is VALID [2022-04-14 14:47:04,668 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-14 14:47:04,668 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-14 14:47:04,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 14:47:04,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477064108] [2022-04-14 14:47:04,669 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 14:47:04,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2050329313] [2022-04-14 14:47:04,669 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2050329313] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 14:47:04,669 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 14:47:04,669 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-14 14:47:04,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000361576] [2022-04-14 14:47:04,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 14:47:04,670 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) 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), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 39 [2022-04-14 14:47:04,670 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 14:47:04,671 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.2) 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), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-14 14:47:04,692 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-14 14:47:04,692 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-14 14:47:04,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 14:47:04,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-14 14:47:04,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-14 14:47:04,693 INFO L87 Difference]: Start difference. First operand 38 states and 46 transitions. Second operand has 5 states, 5 states have (on average 3.2) 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), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-14 14:47:04,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:47:04,905 INFO L93 Difference]: Finished difference Result 51 states and 63 transitions. [2022-04-14 14:47:04,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-14 14:47:04,906 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) 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), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 39 [2022-04-14 14:47:04,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 14:47:04,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) 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), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-14 14:47:04,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 60 transitions. [2022-04-14 14:47:04,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) 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), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-14 14:47:04,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 60 transitions. [2022-04-14 14:47:04,914 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 60 transitions. [2022-04-14 14:47:04,966 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-14 14:47:04,967 INFO L225 Difference]: With dead ends: 51 [2022-04-14 14:47:04,967 INFO L226 Difference]: Without dead ends: 49 [2022-04-14 14:47:04,968 INFO L912 BasicCegarLoop]: 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-14 14:47:04,968 INFO L913 BasicCegarLoop]: 43 mSDtfsCounter, 7 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 14:47:04,969 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 142 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 14:47:04,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-04-14 14:47:04,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 48. [2022-04-14 14:47:04,990 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 14:47:04,991 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand has 48 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 27 states have internal predecessors, (30), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-14 14:47:04,991 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand has 48 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 27 states have internal predecessors, (30), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-14 14:47:04,993 INFO L87 Difference]: Start difference. First operand 49 states. Second operand has 48 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 27 states have internal predecessors, (30), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-14 14:47:04,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:47:04,996 INFO L93 Difference]: Finished difference Result 49 states and 61 transitions. [2022-04-14 14:47:04,996 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 61 transitions. [2022-04-14 14:47:04,996 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 14:47:04,997 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 14:47:04,997 INFO L74 IsIncluded]: Start isIncluded. First operand has 48 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 27 states have internal predecessors, (30), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 49 states. [2022-04-14 14:47:04,997 INFO L87 Difference]: Start difference. First operand has 48 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 27 states have internal predecessors, (30), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 49 states. [2022-04-14 14:47:05,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:47:05,000 INFO L93 Difference]: Finished difference Result 49 states and 61 transitions. [2022-04-14 14:47:05,000 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 61 transitions. [2022-04-14 14:47:05,001 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 14:47:05,001 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 14:47:05,001 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 14:47:05,001 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 14:47:05,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 27 states have internal predecessors, (30), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-14 14:47:05,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 60 transitions. [2022-04-14 14:47:05,003 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 60 transitions. Word has length 39 [2022-04-14 14:47:05,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 14:47:05,004 INFO L478 AbstractCegarLoop]: Abstraction has 48 states and 60 transitions. [2022-04-14 14:47:05,021 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) 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), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-14 14:47:05,021 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 60 transitions. [2022-04-14 14:47:05,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-14 14:47:05,022 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 14:47:05,022 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 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-14 14:47:05,041 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-14 14:47:05,235 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 14:47:05,236 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 14:47:05,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 14:47:05,236 INFO L85 PathProgramCache]: Analyzing trace with hash -644493747, now seen corresponding path program 1 times [2022-04-14 14:47:05,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 14:47:05,237 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625912336] [2022-04-14 14:47:05,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 14:47:05,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 14:47:05,262 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 14:47:05,262 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1587848259] [2022-04-14 14:47:05,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 14:47:05,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 14:47:05,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 14:47:05,263 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-14 14:47:05,265 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-14 14:47:05,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:47:05,321 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-14 14:47:05,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:47:05,345 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 14:47:05,657 INFO L272 TraceCheckUtils]: 0: Hoare triple {1476#true} call ULTIMATE.init(); {1476#true} is VALID [2022-04-14 14:47:05,657 INFO L290 TraceCheckUtils]: 1: Hoare triple {1476#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(11, 2);call #Ultimate.allocInit(12, 3); {1476#true} is VALID [2022-04-14 14:47:05,657 INFO L290 TraceCheckUtils]: 2: Hoare triple {1476#true} assume true; {1476#true} is VALID [2022-04-14 14:47:05,658 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1476#true} {1476#true} #96#return; {1476#true} is VALID [2022-04-14 14:47:05,658 INFO L272 TraceCheckUtils]: 4: Hoare triple {1476#true} call #t~ret6 := main(); {1476#true} is VALID [2022-04-14 14:47:05,658 INFO L290 TraceCheckUtils]: 5: Hoare triple {1476#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~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; {1476#true} is VALID [2022-04-14 14:47:05,658 INFO L272 TraceCheckUtils]: 6: Hoare triple {1476#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {1476#true} is VALID [2022-04-14 14:47:05,658 INFO L290 TraceCheckUtils]: 7: Hoare triple {1476#true} ~cond := #in~cond; {1476#true} is VALID [2022-04-14 14:47:05,659 INFO L290 TraceCheckUtils]: 8: Hoare triple {1476#true} assume !(0 == ~cond); {1476#true} is VALID [2022-04-14 14:47:05,659 INFO L290 TraceCheckUtils]: 9: Hoare triple {1476#true} assume true; {1476#true} is VALID [2022-04-14 14:47:05,660 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1476#true} {1476#true} #76#return; {1476#true} is VALID [2022-04-14 14:47:05,660 INFO L272 TraceCheckUtils]: 11: Hoare triple {1476#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1476#true} is VALID [2022-04-14 14:47:05,660 INFO L290 TraceCheckUtils]: 12: Hoare triple {1476#true} ~cond := #in~cond; {1517#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-14 14:47:05,661 INFO L290 TraceCheckUtils]: 13: Hoare triple {1517#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {1521#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-14 14:47:05,661 INFO L290 TraceCheckUtils]: 14: Hoare triple {1521#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {1521#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-14 14:47:05,662 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1521#(not (= |assume_abort_if_not_#in~cond| 0))} {1476#true} #78#return; {1528#(<= 1 main_~y~0)} is VALID [2022-04-14 14:47:05,662 INFO L290 TraceCheckUtils]: 16: Hoare triple {1528#(<= 1 main_~y~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {1532#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-14 14:47:05,663 INFO L272 TraceCheckUtils]: 17: Hoare triple {1532#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {1476#true} is VALID [2022-04-14 14:47:05,663 INFO L290 TraceCheckUtils]: 18: Hoare triple {1476#true} ~cond := #in~cond; {1476#true} is VALID [2022-04-14 14:47:05,668 INFO L290 TraceCheckUtils]: 19: Hoare triple {1476#true} assume !(0 == ~cond); {1476#true} is VALID [2022-04-14 14:47:05,669 INFO L290 TraceCheckUtils]: 20: Hoare triple {1476#true} assume true; {1476#true} is VALID [2022-04-14 14:47:05,671 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1476#true} {1532#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} #80#return; {1532#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-14 14:47:05,673 INFO L272 TraceCheckUtils]: 22: Hoare triple {1532#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {1476#true} is VALID [2022-04-14 14:47:05,674 INFO L290 TraceCheckUtils]: 23: Hoare triple {1476#true} ~cond := #in~cond; {1476#true} is VALID [2022-04-14 14:47:05,675 INFO L290 TraceCheckUtils]: 24: Hoare triple {1476#true} assume !(0 == ~cond); {1476#true} is VALID [2022-04-14 14:47:05,675 INFO L290 TraceCheckUtils]: 25: Hoare triple {1476#true} assume true; {1476#true} is VALID [2022-04-14 14:47:05,676 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1476#true} {1532#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} #82#return; {1532#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-14 14:47:05,677 INFO L290 TraceCheckUtils]: 27: Hoare triple {1532#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} assume !false; {1532#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-14 14:47:05,678 INFO L290 TraceCheckUtils]: 28: Hoare triple {1532#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {1532#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-14 14:47:05,679 INFO L290 TraceCheckUtils]: 29: Hoare triple {1532#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} assume !false; {1532#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-14 14:47:05,679 INFO L272 TraceCheckUtils]: 30: Hoare triple {1532#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {1476#true} is VALID [2022-04-14 14:47:05,679 INFO L290 TraceCheckUtils]: 31: Hoare triple {1476#true} ~cond := #in~cond; {1476#true} is VALID [2022-04-14 14:47:05,679 INFO L290 TraceCheckUtils]: 32: Hoare triple {1476#true} assume !(0 == ~cond); {1476#true} is VALID [2022-04-14 14:47:05,680 INFO L290 TraceCheckUtils]: 33: Hoare triple {1476#true} assume true; {1476#true} is VALID [2022-04-14 14:47:05,680 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {1476#true} {1532#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} #84#return; {1532#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-14 14:47:05,681 INFO L272 TraceCheckUtils]: 35: Hoare triple {1532#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {1476#true} is VALID [2022-04-14 14:47:05,681 INFO L290 TraceCheckUtils]: 36: Hoare triple {1476#true} ~cond := #in~cond; {1476#true} is VALID [2022-04-14 14:47:05,681 INFO L290 TraceCheckUtils]: 37: Hoare triple {1476#true} assume !(0 == ~cond); {1476#true} is VALID [2022-04-14 14:47:05,681 INFO L290 TraceCheckUtils]: 38: Hoare triple {1476#true} assume true; {1476#true} is VALID [2022-04-14 14:47:05,682 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {1476#true} {1532#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} #86#return; {1532#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-14 14:47:05,683 INFO L272 TraceCheckUtils]: 40: Hoare triple {1532#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {1605#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 14:47:05,683 INFO L290 TraceCheckUtils]: 41: Hoare triple {1605#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1609#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 14:47:05,683 INFO L290 TraceCheckUtils]: 42: Hoare triple {1609#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1477#false} is VALID [2022-04-14 14:47:05,684 INFO L290 TraceCheckUtils]: 43: Hoare triple {1477#false} assume !false; {1477#false} is VALID [2022-04-14 14:47:05,684 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-04-14 14:47:05,684 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 14:47:39,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 14:47:39,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625912336] [2022-04-14 14:47:39,417 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 14:47:39,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1587848259] [2022-04-14 14:47:39,417 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1587848259] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-14 14:47:39,417 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-14 14:47:39,417 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2022-04-14 14:47:39,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68328745] [2022-04-14 14:47:39,417 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-14 14:47:39,418 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 44 [2022-04-14 14:47:39,418 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 14:47:39,418 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.375) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-14 14:47:39,451 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 14:47:39,451 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-14 14:47:39,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 14:47:39,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-14 14:47:39,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-04-14 14:47:39,452 INFO L87 Difference]: Start difference. First operand 48 states and 60 transitions. Second operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-14 14:47:40,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:47:40,369 INFO L93 Difference]: Finished difference Result 55 states and 66 transitions. [2022-04-14 14:47:40,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-14 14:47:40,369 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 44 [2022-04-14 14:47:40,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 14:47:40,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-14 14:47:40,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 60 transitions. [2022-04-14 14:47:40,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-14 14:47:40,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 60 transitions. [2022-04-14 14:47:40,373 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 60 transitions. [2022-04-14 14:47:40,432 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-14 14:47:40,433 INFO L225 Difference]: With dead ends: 55 [2022-04-14 14:47:40,434 INFO L226 Difference]: Without dead ends: 53 [2022-04-14 14:47:40,434 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 40 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-14 14:47:40,435 INFO L913 BasicCegarLoop]: 35 mSDtfsCounter, 20 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-14 14:47:40,435 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 167 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-14 14:47:40,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-04-14 14:47:40,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2022-04-14 14:47:40,461 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 14:47:40,461 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand has 52 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 30 states have internal predecessors, (33), 16 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-14 14:47:40,462 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand has 52 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 30 states have internal predecessors, (33), 16 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-14 14:47:40,464 INFO L87 Difference]: Start difference. First operand 53 states. Second operand has 52 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 30 states have internal predecessors, (33), 16 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-14 14:47:40,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:47:40,466 INFO L93 Difference]: Finished difference Result 53 states and 64 transitions. [2022-04-14 14:47:40,466 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 64 transitions. [2022-04-14 14:47:40,467 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 14:47:40,467 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 14:47:40,467 INFO L74 IsIncluded]: Start isIncluded. First operand has 52 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 30 states have internal predecessors, (33), 16 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 53 states. [2022-04-14 14:47:40,468 INFO L87 Difference]: Start difference. First operand has 52 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 30 states have internal predecessors, (33), 16 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 53 states. [2022-04-14 14:47:40,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:47:40,472 INFO L93 Difference]: Finished difference Result 53 states and 64 transitions. [2022-04-14 14:47:40,472 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 64 transitions. [2022-04-14 14:47:40,473 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 14:47:40,473 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 14:47:40,473 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 14:47:40,473 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 14:47:40,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 30 states have internal predecessors, (33), 16 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-14 14:47:40,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 63 transitions. [2022-04-14 14:47:40,476 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 63 transitions. Word has length 44 [2022-04-14 14:47:40,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 14:47:40,476 INFO L478 AbstractCegarLoop]: Abstraction has 52 states and 63 transitions. [2022-04-14 14:47:40,478 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-14 14:47:40,478 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 63 transitions. [2022-04-14 14:47:40,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-04-14 14:47:40,479 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 14:47:40,479 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 14:47:40,504 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-14 14:47:40,699 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 14:47:40,699 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 14:47:40,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 14:47:40,700 INFO L85 PathProgramCache]: Analyzing trace with hash -79102156, now seen corresponding path program 1 times [2022-04-14 14:47:40,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 14:47:40,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206715242] [2022-04-14 14:47:40,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 14:47:40,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 14:47:40,716 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 14:47:40,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [661375620] [2022-04-14 14:47:40,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 14:47:40,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 14:47:40,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 14:47:40,721 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-14 14:47:40,723 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-14 14:47:40,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:47:40,777 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-14 14:47:40,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:47:40,798 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 14:47:41,148 INFO L272 TraceCheckUtils]: 0: Hoare triple {1902#true} call ULTIMATE.init(); {1902#true} is VALID [2022-04-14 14:47:41,148 INFO L290 TraceCheckUtils]: 1: Hoare triple {1902#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(11, 2);call #Ultimate.allocInit(12, 3); {1902#true} is VALID [2022-04-14 14:47:41,148 INFO L290 TraceCheckUtils]: 2: Hoare triple {1902#true} assume true; {1902#true} is VALID [2022-04-14 14:47:41,148 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1902#true} {1902#true} #96#return; {1902#true} is VALID [2022-04-14 14:47:41,148 INFO L272 TraceCheckUtils]: 4: Hoare triple {1902#true} call #t~ret6 := main(); {1902#true} is VALID [2022-04-14 14:47:41,149 INFO L290 TraceCheckUtils]: 5: Hoare triple {1902#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~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; {1902#true} is VALID [2022-04-14 14:47:41,149 INFO L272 TraceCheckUtils]: 6: Hoare triple {1902#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {1902#true} is VALID [2022-04-14 14:47:41,149 INFO L290 TraceCheckUtils]: 7: Hoare triple {1902#true} ~cond := #in~cond; {1902#true} is VALID [2022-04-14 14:47:41,149 INFO L290 TraceCheckUtils]: 8: Hoare triple {1902#true} assume !(0 == ~cond); {1902#true} is VALID [2022-04-14 14:47:41,149 INFO L290 TraceCheckUtils]: 9: Hoare triple {1902#true} assume true; {1902#true} is VALID [2022-04-14 14:47:41,149 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1902#true} {1902#true} #76#return; {1902#true} is VALID [2022-04-14 14:47:41,149 INFO L272 TraceCheckUtils]: 11: Hoare triple {1902#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1902#true} is VALID [2022-04-14 14:47:41,150 INFO L290 TraceCheckUtils]: 12: Hoare triple {1902#true} ~cond := #in~cond; {1902#true} is VALID [2022-04-14 14:47:41,150 INFO L290 TraceCheckUtils]: 13: Hoare triple {1902#true} assume !(0 == ~cond); {1902#true} is VALID [2022-04-14 14:47:41,150 INFO L290 TraceCheckUtils]: 14: Hoare triple {1902#true} assume true; {1902#true} is VALID [2022-04-14 14:47:41,151 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1902#true} {1902#true} #78#return; {1902#true} is VALID [2022-04-14 14:47:41,151 INFO L290 TraceCheckUtils]: 16: Hoare triple {1902#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {1955#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0))} is VALID [2022-04-14 14:47:41,151 INFO L272 TraceCheckUtils]: 17: Hoare triple {1955#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0))} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {1902#true} is VALID [2022-04-14 14:47:41,151 INFO L290 TraceCheckUtils]: 18: Hoare triple {1902#true} ~cond := #in~cond; {1902#true} is VALID [2022-04-14 14:47:41,152 INFO L290 TraceCheckUtils]: 19: Hoare triple {1902#true} assume !(0 == ~cond); {1902#true} is VALID [2022-04-14 14:47:41,152 INFO L290 TraceCheckUtils]: 20: Hoare triple {1902#true} assume true; {1902#true} is VALID [2022-04-14 14:47:41,153 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1902#true} {1955#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0))} #80#return; {1955#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0))} is VALID [2022-04-14 14:47:41,153 INFO L272 TraceCheckUtils]: 22: Hoare triple {1955#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0))} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {1902#true} is VALID [2022-04-14 14:47:41,153 INFO L290 TraceCheckUtils]: 23: Hoare triple {1902#true} ~cond := #in~cond; {1902#true} is VALID [2022-04-14 14:47:41,153 INFO L290 TraceCheckUtils]: 24: Hoare triple {1902#true} assume !(0 == ~cond); {1902#true} is VALID [2022-04-14 14:47:41,153 INFO L290 TraceCheckUtils]: 25: Hoare triple {1902#true} assume true; {1902#true} is VALID [2022-04-14 14:47:41,154 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1902#true} {1955#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0))} #82#return; {1955#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0))} is VALID [2022-04-14 14:47:41,154 INFO L290 TraceCheckUtils]: 27: Hoare triple {1955#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0))} assume !false; {1955#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0))} is VALID [2022-04-14 14:47:41,155 INFO L290 TraceCheckUtils]: 28: Hoare triple {1955#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {1955#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0))} is VALID [2022-04-14 14:47:41,155 INFO L290 TraceCheckUtils]: 29: Hoare triple {1955#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0))} assume !false; {1955#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0))} is VALID [2022-04-14 14:47:41,155 INFO L272 TraceCheckUtils]: 30: Hoare triple {1955#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {1902#true} is VALID [2022-04-14 14:47:41,156 INFO L290 TraceCheckUtils]: 31: Hoare triple {1902#true} ~cond := #in~cond; {1902#true} is VALID [2022-04-14 14:47:41,156 INFO L290 TraceCheckUtils]: 32: Hoare triple {1902#true} assume !(0 == ~cond); {1902#true} is VALID [2022-04-14 14:47:41,156 INFO L290 TraceCheckUtils]: 33: Hoare triple {1902#true} assume true; {1902#true} is VALID [2022-04-14 14:47:41,157 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {1902#true} {1955#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0))} #84#return; {1955#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0))} is VALID [2022-04-14 14:47:41,158 INFO L272 TraceCheckUtils]: 35: Hoare triple {1955#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~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)); {1902#true} is VALID [2022-04-14 14:47:41,158 INFO L290 TraceCheckUtils]: 36: Hoare triple {1902#true} ~cond := #in~cond; {2016#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-14 14:47:41,159 INFO L290 TraceCheckUtils]: 37: Hoare triple {2016#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {2020#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 14:47:41,160 INFO L290 TraceCheckUtils]: 38: Hoare triple {2020#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2020#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 14:47:41,161 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {2020#(not (= |__VERIFIER_assert_#in~cond| 0))} {1955#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0))} #86#return; {1955#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0))} is VALID [2022-04-14 14:47:41,161 INFO L272 TraceCheckUtils]: 40: Hoare triple {1955#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~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)); {1902#true} is VALID [2022-04-14 14:47:41,161 INFO L290 TraceCheckUtils]: 41: Hoare triple {1902#true} ~cond := #in~cond; {2016#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-14 14:47:41,162 INFO L290 TraceCheckUtils]: 42: Hoare triple {2016#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {2020#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 14:47:41,162 INFO L290 TraceCheckUtils]: 43: Hoare triple {2020#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2020#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 14:47:41,163 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {2020#(not (= |__VERIFIER_assert_#in~cond| 0))} {1955#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0))} #88#return; {1955#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0))} is VALID [2022-04-14 14:47:41,164 INFO L272 TraceCheckUtils]: 45: Hoare triple {1955#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {2045#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 14:47:41,164 INFO L290 TraceCheckUtils]: 46: Hoare triple {2045#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2049#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 14:47:41,165 INFO L290 TraceCheckUtils]: 47: Hoare triple {2049#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1903#false} is VALID [2022-04-14 14:47:41,165 INFO L290 TraceCheckUtils]: 48: Hoare triple {1903#false} assume !false; {1903#false} is VALID [2022-04-14 14:47:41,166 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-04-14 14:47:41,166 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 14:48:32,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 14:48:32,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206715242] [2022-04-14 14:48:32,052 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 14:48:32,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [661375620] [2022-04-14 14:48:32,052 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [661375620] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-14 14:48:32,052 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-14 14:48:32,052 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2022-04-14 14:48:32,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343953633] [2022-04-14 14:48:32,052 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-14 14:48:32,053 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 49 [2022-04-14 14:48:32,053 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 14:48:32,053 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-14 14:48:32,088 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-14 14:48:32,088 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-14 14:48:32,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 14:48:32,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-14 14:48:32,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-04-14 14:48:32,089 INFO L87 Difference]: Start difference. First operand 52 states and 63 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-14 14:48:32,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:48:32,415 INFO L93 Difference]: Finished difference Result 59 states and 69 transitions. [2022-04-14 14:48:32,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-14 14:48:32,415 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 49 [2022-04-14 14:48:32,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 14:48:32,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-14 14:48:32,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 60 transitions. [2022-04-14 14:48:32,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-14 14:48:32,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 60 transitions. [2022-04-14 14:48:32,419 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 60 transitions. [2022-04-14 14:48:32,478 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-14 14:48:32,479 INFO L225 Difference]: With dead ends: 59 [2022-04-14 14:48:32,479 INFO L226 Difference]: Without dead ends: 57 [2022-04-14 14:48:32,480 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2022-04-14 14:48:32,480 INFO L913 BasicCegarLoop]: 31 mSDtfsCounter, 12 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-14 14:48:32,481 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 115 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-14 14:48:32,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-04-14 14:48:32,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2022-04-14 14:48:32,506 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 14:48:32,506 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand has 56 states, 32 states have (on average 1.125) internal successors, (36), 33 states have internal predecessors, (36), 16 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-14 14:48:32,506 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand has 56 states, 32 states have (on average 1.125) internal successors, (36), 33 states have internal predecessors, (36), 16 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-14 14:48:32,507 INFO L87 Difference]: Start difference. First operand 57 states. Second operand has 56 states, 32 states have (on average 1.125) internal successors, (36), 33 states have internal predecessors, (36), 16 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-14 14:48:32,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:48:32,509 INFO L93 Difference]: Finished difference Result 57 states and 67 transitions. [2022-04-14 14:48:32,509 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 67 transitions. [2022-04-14 14:48:32,509 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 14:48:32,509 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 14:48:32,510 INFO L74 IsIncluded]: Start isIncluded. First operand has 56 states, 32 states have (on average 1.125) internal successors, (36), 33 states have internal predecessors, (36), 16 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 57 states. [2022-04-14 14:48:32,510 INFO L87 Difference]: Start difference. First operand has 56 states, 32 states have (on average 1.125) internal successors, (36), 33 states have internal predecessors, (36), 16 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 57 states. [2022-04-14 14:48:32,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:48:32,512 INFO L93 Difference]: Finished difference Result 57 states and 67 transitions. [2022-04-14 14:48:32,512 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 67 transitions. [2022-04-14 14:48:32,512 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 14:48:32,512 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 14:48:32,512 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 14:48:32,512 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 14:48:32,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 32 states have (on average 1.125) internal successors, (36), 33 states have internal predecessors, (36), 16 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-14 14:48:32,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 66 transitions. [2022-04-14 14:48:32,515 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 66 transitions. Word has length 49 [2022-04-14 14:48:32,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 14:48:32,515 INFO L478 AbstractCegarLoop]: Abstraction has 56 states and 66 transitions. [2022-04-14 14:48:32,515 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-14 14:48:32,515 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 66 transitions. [2022-04-14 14:48:32,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-04-14 14:48:32,516 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 14:48:32,516 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 14:48:32,541 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-14 14:48:32,737 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 14:48:32,737 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 14:48:32,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 14:48:32,738 INFO L85 PathProgramCache]: Analyzing trace with hash -1051433450, now seen corresponding path program 1 times [2022-04-14 14:48:32,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 14:48:32,738 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069768203] [2022-04-14 14:48:32,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 14:48:32,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 14:48:32,749 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 14:48:32,749 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [877800624] [2022-04-14 14:48:32,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 14:48:32,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 14:48:32,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 14:48:32,751 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-14 14:48:32,755 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-14 14:48:32,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:48:32,805 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-14 14:48:32,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:48:32,820 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 14:48:33,055 INFO L272 TraceCheckUtils]: 0: Hoare triple {2361#true} call ULTIMATE.init(); {2361#true} is VALID [2022-04-14 14:48:33,056 INFO L290 TraceCheckUtils]: 1: Hoare triple {2361#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(11, 2);call #Ultimate.allocInit(12, 3); {2361#true} is VALID [2022-04-14 14:48:33,056 INFO L290 TraceCheckUtils]: 2: Hoare triple {2361#true} assume true; {2361#true} is VALID [2022-04-14 14:48:33,056 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2361#true} {2361#true} #96#return; {2361#true} is VALID [2022-04-14 14:48:33,056 INFO L272 TraceCheckUtils]: 4: Hoare triple {2361#true} call #t~ret6 := main(); {2361#true} is VALID [2022-04-14 14:48:33,056 INFO L290 TraceCheckUtils]: 5: Hoare triple {2361#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~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; {2361#true} is VALID [2022-04-14 14:48:33,056 INFO L272 TraceCheckUtils]: 6: Hoare triple {2361#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {2361#true} is VALID [2022-04-14 14:48:33,057 INFO L290 TraceCheckUtils]: 7: Hoare triple {2361#true} ~cond := #in~cond; {2387#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-14 14:48:33,057 INFO L290 TraceCheckUtils]: 8: Hoare triple {2387#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {2391#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-14 14:48:33,057 INFO L290 TraceCheckUtils]: 9: Hoare triple {2391#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {2391#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-14 14:48:33,058 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2391#(not (= |assume_abort_if_not_#in~cond| 0))} {2361#true} #76#return; {2398#(<= 1 main_~x~0)} is VALID [2022-04-14 14:48:33,058 INFO L272 TraceCheckUtils]: 11: Hoare triple {2398#(<= 1 main_~x~0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {2361#true} is VALID [2022-04-14 14:48:33,058 INFO L290 TraceCheckUtils]: 12: Hoare triple {2361#true} ~cond := #in~cond; {2361#true} is VALID [2022-04-14 14:48:33,058 INFO L290 TraceCheckUtils]: 13: Hoare triple {2361#true} assume !(0 == ~cond); {2361#true} is VALID [2022-04-14 14:48:33,059 INFO L290 TraceCheckUtils]: 14: Hoare triple {2361#true} assume true; {2361#true} is VALID [2022-04-14 14:48:33,059 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2361#true} {2398#(<= 1 main_~x~0)} #78#return; {2398#(<= 1 main_~x~0)} is VALID [2022-04-14 14:48:33,060 INFO L290 TraceCheckUtils]: 16: Hoare triple {2398#(<= 1 main_~x~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {2417#(<= 1 main_~a~0)} is VALID [2022-04-14 14:48:33,060 INFO L272 TraceCheckUtils]: 17: Hoare triple {2417#(<= 1 main_~a~0)} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {2361#true} is VALID [2022-04-14 14:48:33,060 INFO L290 TraceCheckUtils]: 18: Hoare triple {2361#true} ~cond := #in~cond; {2361#true} is VALID [2022-04-14 14:48:33,060 INFO L290 TraceCheckUtils]: 19: Hoare triple {2361#true} assume !(0 == ~cond); {2361#true} is VALID [2022-04-14 14:48:33,060 INFO L290 TraceCheckUtils]: 20: Hoare triple {2361#true} assume true; {2361#true} is VALID [2022-04-14 14:48:33,061 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2361#true} {2417#(<= 1 main_~a~0)} #80#return; {2417#(<= 1 main_~a~0)} is VALID [2022-04-14 14:48:33,061 INFO L272 TraceCheckUtils]: 22: Hoare triple {2417#(<= 1 main_~a~0)} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {2361#true} is VALID [2022-04-14 14:48:33,061 INFO L290 TraceCheckUtils]: 23: Hoare triple {2361#true} ~cond := #in~cond; {2361#true} is VALID [2022-04-14 14:48:33,061 INFO L290 TraceCheckUtils]: 24: Hoare triple {2361#true} assume !(0 == ~cond); {2361#true} is VALID [2022-04-14 14:48:33,061 INFO L290 TraceCheckUtils]: 25: Hoare triple {2361#true} assume true; {2361#true} is VALID [2022-04-14 14:48:33,062 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {2361#true} {2417#(<= 1 main_~a~0)} #82#return; {2417#(<= 1 main_~a~0)} is VALID [2022-04-14 14:48:33,062 INFO L290 TraceCheckUtils]: 27: Hoare triple {2417#(<= 1 main_~a~0)} assume !false; {2417#(<= 1 main_~a~0)} is VALID [2022-04-14 14:48:33,062 INFO L290 TraceCheckUtils]: 28: Hoare triple {2417#(<= 1 main_~a~0)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {2454#(<= 1 main_~c~0)} is VALID [2022-04-14 14:48:33,063 INFO L290 TraceCheckUtils]: 29: Hoare triple {2454#(<= 1 main_~c~0)} assume !false; {2454#(<= 1 main_~c~0)} is VALID [2022-04-14 14:48:33,063 INFO L272 TraceCheckUtils]: 30: Hoare triple {2454#(<= 1 main_~c~0)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {2361#true} is VALID [2022-04-14 14:48:33,063 INFO L290 TraceCheckUtils]: 31: Hoare triple {2361#true} ~cond := #in~cond; {2361#true} is VALID [2022-04-14 14:48:33,063 INFO L290 TraceCheckUtils]: 32: Hoare triple {2361#true} assume !(0 == ~cond); {2361#true} is VALID [2022-04-14 14:48:33,063 INFO L290 TraceCheckUtils]: 33: Hoare triple {2361#true} assume true; {2361#true} is VALID [2022-04-14 14:48:33,064 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {2361#true} {2454#(<= 1 main_~c~0)} #84#return; {2454#(<= 1 main_~c~0)} is VALID [2022-04-14 14:48:33,064 INFO L272 TraceCheckUtils]: 35: Hoare triple {2454#(<= 1 main_~c~0)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {2361#true} is VALID [2022-04-14 14:48:33,064 INFO L290 TraceCheckUtils]: 36: Hoare triple {2361#true} ~cond := #in~cond; {2361#true} is VALID [2022-04-14 14:48:33,064 INFO L290 TraceCheckUtils]: 37: Hoare triple {2361#true} assume !(0 == ~cond); {2361#true} is VALID [2022-04-14 14:48:33,064 INFO L290 TraceCheckUtils]: 38: Hoare triple {2361#true} assume true; {2361#true} is VALID [2022-04-14 14:48:33,065 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {2361#true} {2454#(<= 1 main_~c~0)} #86#return; {2454#(<= 1 main_~c~0)} is VALID [2022-04-14 14:48:33,065 INFO L272 TraceCheckUtils]: 40: Hoare triple {2454#(<= 1 main_~c~0)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {2361#true} is VALID [2022-04-14 14:48:33,065 INFO L290 TraceCheckUtils]: 41: Hoare triple {2361#true} ~cond := #in~cond; {2361#true} is VALID [2022-04-14 14:48:33,065 INFO L290 TraceCheckUtils]: 42: Hoare triple {2361#true} assume !(0 == ~cond); {2361#true} is VALID [2022-04-14 14:48:33,065 INFO L290 TraceCheckUtils]: 43: Hoare triple {2361#true} assume true; {2361#true} is VALID [2022-04-14 14:48:33,066 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {2361#true} {2454#(<= 1 main_~c~0)} #88#return; {2454#(<= 1 main_~c~0)} is VALID [2022-04-14 14:48:33,066 INFO L272 TraceCheckUtils]: 45: Hoare triple {2454#(<= 1 main_~c~0)} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {2361#true} is VALID [2022-04-14 14:48:33,066 INFO L290 TraceCheckUtils]: 46: Hoare triple {2361#true} ~cond := #in~cond; {2361#true} is VALID [2022-04-14 14:48:33,066 INFO L290 TraceCheckUtils]: 47: Hoare triple {2361#true} assume !(0 == ~cond); {2361#true} is VALID [2022-04-14 14:48:33,066 INFO L290 TraceCheckUtils]: 48: Hoare triple {2361#true} assume true; {2361#true} is VALID [2022-04-14 14:48:33,067 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {2361#true} {2454#(<= 1 main_~c~0)} #90#return; {2454#(<= 1 main_~c~0)} is VALID [2022-04-14 14:48:33,068 INFO L290 TraceCheckUtils]: 50: Hoare triple {2454#(<= 1 main_~c~0)} assume !(~c~0 >= ~b~0); {2454#(<= 1 main_~c~0)} is VALID [2022-04-14 14:48:33,068 INFO L290 TraceCheckUtils]: 51: Hoare triple {2454#(<= 1 main_~c~0)} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {2524#(<= 1 main_~b~0)} is VALID [2022-04-14 14:48:33,069 INFO L290 TraceCheckUtils]: 52: Hoare triple {2524#(<= 1 main_~b~0)} assume !false; {2524#(<= 1 main_~b~0)} is VALID [2022-04-14 14:48:33,069 INFO L290 TraceCheckUtils]: 53: Hoare triple {2524#(<= 1 main_~b~0)} assume !(0 != ~b~0); {2362#false} is VALID [2022-04-14 14:48:33,069 INFO L272 TraceCheckUtils]: 54: Hoare triple {2362#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {2362#false} is VALID [2022-04-14 14:48:33,069 INFO L290 TraceCheckUtils]: 55: Hoare triple {2362#false} ~cond := #in~cond; {2362#false} is VALID [2022-04-14 14:48:33,069 INFO L290 TraceCheckUtils]: 56: Hoare triple {2362#false} assume 0 == ~cond; {2362#false} is VALID [2022-04-14 14:48:33,070 INFO L290 TraceCheckUtils]: 57: Hoare triple {2362#false} assume !false; {2362#false} is VALID [2022-04-14 14:48:33,070 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 8 proven. 11 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-04-14 14:48:33,070 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 14:48:33,358 INFO L290 TraceCheckUtils]: 57: Hoare triple {2362#false} assume !false; {2362#false} is VALID [2022-04-14 14:48:33,359 INFO L290 TraceCheckUtils]: 56: Hoare triple {2362#false} assume 0 == ~cond; {2362#false} is VALID [2022-04-14 14:48:33,359 INFO L290 TraceCheckUtils]: 55: Hoare triple {2362#false} ~cond := #in~cond; {2362#false} is VALID [2022-04-14 14:48:33,359 INFO L272 TraceCheckUtils]: 54: Hoare triple {2362#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {2362#false} is VALID [2022-04-14 14:48:33,359 INFO L290 TraceCheckUtils]: 53: Hoare triple {2524#(<= 1 main_~b~0)} assume !(0 != ~b~0); {2362#false} is VALID [2022-04-14 14:48:33,360 INFO L290 TraceCheckUtils]: 52: Hoare triple {2524#(<= 1 main_~b~0)} assume !false; {2524#(<= 1 main_~b~0)} is VALID [2022-04-14 14:48:33,360 INFO L290 TraceCheckUtils]: 51: Hoare triple {2454#(<= 1 main_~c~0)} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {2524#(<= 1 main_~b~0)} is VALID [2022-04-14 14:48:33,361 INFO L290 TraceCheckUtils]: 50: Hoare triple {2454#(<= 1 main_~c~0)} assume !(~c~0 >= ~b~0); {2454#(<= 1 main_~c~0)} is VALID [2022-04-14 14:48:33,362 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {2361#true} {2454#(<= 1 main_~c~0)} #90#return; {2454#(<= 1 main_~c~0)} is VALID [2022-04-14 14:48:33,362 INFO L290 TraceCheckUtils]: 48: Hoare triple {2361#true} assume true; {2361#true} is VALID [2022-04-14 14:48:33,362 INFO L290 TraceCheckUtils]: 47: Hoare triple {2361#true} assume !(0 == ~cond); {2361#true} is VALID [2022-04-14 14:48:33,362 INFO L290 TraceCheckUtils]: 46: Hoare triple {2361#true} ~cond := #in~cond; {2361#true} is VALID [2022-04-14 14:48:33,362 INFO L272 TraceCheckUtils]: 45: Hoare triple {2454#(<= 1 main_~c~0)} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {2361#true} is VALID [2022-04-14 14:48:33,363 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {2361#true} {2454#(<= 1 main_~c~0)} #88#return; {2454#(<= 1 main_~c~0)} is VALID [2022-04-14 14:48:33,363 INFO L290 TraceCheckUtils]: 43: Hoare triple {2361#true} assume true; {2361#true} is VALID [2022-04-14 14:48:33,363 INFO L290 TraceCheckUtils]: 42: Hoare triple {2361#true} assume !(0 == ~cond); {2361#true} is VALID [2022-04-14 14:48:33,363 INFO L290 TraceCheckUtils]: 41: Hoare triple {2361#true} ~cond := #in~cond; {2361#true} is VALID [2022-04-14 14:48:33,363 INFO L272 TraceCheckUtils]: 40: Hoare triple {2454#(<= 1 main_~c~0)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {2361#true} is VALID [2022-04-14 14:48:33,364 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {2361#true} {2454#(<= 1 main_~c~0)} #86#return; {2454#(<= 1 main_~c~0)} is VALID [2022-04-14 14:48:33,364 INFO L290 TraceCheckUtils]: 38: Hoare triple {2361#true} assume true; {2361#true} is VALID [2022-04-14 14:48:33,364 INFO L290 TraceCheckUtils]: 37: Hoare triple {2361#true} assume !(0 == ~cond); {2361#true} is VALID [2022-04-14 14:48:33,364 INFO L290 TraceCheckUtils]: 36: Hoare triple {2361#true} ~cond := #in~cond; {2361#true} is VALID [2022-04-14 14:48:33,364 INFO L272 TraceCheckUtils]: 35: Hoare triple {2454#(<= 1 main_~c~0)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {2361#true} is VALID [2022-04-14 14:48:33,365 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {2361#true} {2454#(<= 1 main_~c~0)} #84#return; {2454#(<= 1 main_~c~0)} is VALID [2022-04-14 14:48:33,365 INFO L290 TraceCheckUtils]: 33: Hoare triple {2361#true} assume true; {2361#true} is VALID [2022-04-14 14:48:33,365 INFO L290 TraceCheckUtils]: 32: Hoare triple {2361#true} assume !(0 == ~cond); {2361#true} is VALID [2022-04-14 14:48:33,365 INFO L290 TraceCheckUtils]: 31: Hoare triple {2361#true} ~cond := #in~cond; {2361#true} is VALID [2022-04-14 14:48:33,365 INFO L272 TraceCheckUtils]: 30: Hoare triple {2454#(<= 1 main_~c~0)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {2361#true} is VALID [2022-04-14 14:48:33,366 INFO L290 TraceCheckUtils]: 29: Hoare triple {2454#(<= 1 main_~c~0)} assume !false; {2454#(<= 1 main_~c~0)} is VALID [2022-04-14 14:48:33,366 INFO L290 TraceCheckUtils]: 28: Hoare triple {2417#(<= 1 main_~a~0)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {2454#(<= 1 main_~c~0)} is VALID [2022-04-14 14:48:33,367 INFO L290 TraceCheckUtils]: 27: Hoare triple {2417#(<= 1 main_~a~0)} assume !false; {2417#(<= 1 main_~a~0)} is VALID [2022-04-14 14:48:33,367 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {2361#true} {2417#(<= 1 main_~a~0)} #82#return; {2417#(<= 1 main_~a~0)} is VALID [2022-04-14 14:48:33,367 INFO L290 TraceCheckUtils]: 25: Hoare triple {2361#true} assume true; {2361#true} is VALID [2022-04-14 14:48:33,367 INFO L290 TraceCheckUtils]: 24: Hoare triple {2361#true} assume !(0 == ~cond); {2361#true} is VALID [2022-04-14 14:48:33,367 INFO L290 TraceCheckUtils]: 23: Hoare triple {2361#true} ~cond := #in~cond; {2361#true} is VALID [2022-04-14 14:48:33,368 INFO L272 TraceCheckUtils]: 22: Hoare triple {2417#(<= 1 main_~a~0)} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {2361#true} is VALID [2022-04-14 14:48:33,368 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2361#true} {2417#(<= 1 main_~a~0)} #80#return; {2417#(<= 1 main_~a~0)} is VALID [2022-04-14 14:48:33,368 INFO L290 TraceCheckUtils]: 20: Hoare triple {2361#true} assume true; {2361#true} is VALID [2022-04-14 14:48:33,368 INFO L290 TraceCheckUtils]: 19: Hoare triple {2361#true} assume !(0 == ~cond); {2361#true} is VALID [2022-04-14 14:48:33,368 INFO L290 TraceCheckUtils]: 18: Hoare triple {2361#true} ~cond := #in~cond; {2361#true} is VALID [2022-04-14 14:48:33,368 INFO L272 TraceCheckUtils]: 17: Hoare triple {2417#(<= 1 main_~a~0)} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {2361#true} is VALID [2022-04-14 14:48:33,369 INFO L290 TraceCheckUtils]: 16: Hoare triple {2398#(<= 1 main_~x~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {2417#(<= 1 main_~a~0)} is VALID [2022-04-14 14:48:33,369 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2361#true} {2398#(<= 1 main_~x~0)} #78#return; {2398#(<= 1 main_~x~0)} is VALID [2022-04-14 14:48:33,369 INFO L290 TraceCheckUtils]: 14: Hoare triple {2361#true} assume true; {2361#true} is VALID [2022-04-14 14:48:33,370 INFO L290 TraceCheckUtils]: 13: Hoare triple {2361#true} assume !(0 == ~cond); {2361#true} is VALID [2022-04-14 14:48:33,370 INFO L290 TraceCheckUtils]: 12: Hoare triple {2361#true} ~cond := #in~cond; {2361#true} is VALID [2022-04-14 14:48:33,370 INFO L272 TraceCheckUtils]: 11: Hoare triple {2398#(<= 1 main_~x~0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {2361#true} is VALID [2022-04-14 14:48:33,370 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2391#(not (= |assume_abort_if_not_#in~cond| 0))} {2361#true} #76#return; {2398#(<= 1 main_~x~0)} is VALID [2022-04-14 14:48:33,371 INFO L290 TraceCheckUtils]: 9: Hoare triple {2391#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {2391#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-14 14:48:33,371 INFO L290 TraceCheckUtils]: 8: Hoare triple {2693#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} assume !(0 == ~cond); {2391#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-14 14:48:33,371 INFO L290 TraceCheckUtils]: 7: Hoare triple {2361#true} ~cond := #in~cond; {2693#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} is VALID [2022-04-14 14:48:33,371 INFO L272 TraceCheckUtils]: 6: Hoare triple {2361#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {2361#true} is VALID [2022-04-14 14:48:33,371 INFO L290 TraceCheckUtils]: 5: Hoare triple {2361#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~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; {2361#true} is VALID [2022-04-14 14:48:33,372 INFO L272 TraceCheckUtils]: 4: Hoare triple {2361#true} call #t~ret6 := main(); {2361#true} is VALID [2022-04-14 14:48:33,372 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2361#true} {2361#true} #96#return; {2361#true} is VALID [2022-04-14 14:48:33,372 INFO L290 TraceCheckUtils]: 2: Hoare triple {2361#true} assume true; {2361#true} is VALID [2022-04-14 14:48:33,372 INFO L290 TraceCheckUtils]: 1: Hoare triple {2361#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(11, 2);call #Ultimate.allocInit(12, 3); {2361#true} is VALID [2022-04-14 14:48:33,372 INFO L272 TraceCheckUtils]: 0: Hoare triple {2361#true} call ULTIMATE.init(); {2361#true} is VALID [2022-04-14 14:48:33,372 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 8 proven. 11 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-04-14 14:48:33,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 14:48:33,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069768203] [2022-04-14 14:48:33,373 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 14:48:33,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [877800624] [2022-04-14 14:48:33,373 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [877800624] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-14 14:48:33,373 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-14 14:48:33,373 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2022-04-14 14:48:33,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899557961] [2022-04-14 14:48:33,373 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-14 14:48:33,374 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) Word has length 58 [2022-04-14 14:48:33,374 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 14:48:33,374 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-04-14 14:48:33,417 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 14:48:33,418 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-14 14:48:33,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 14:48:33,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-14 14:48:33,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-04-14 14:48:33,418 INFO L87 Difference]: Start difference. First operand 56 states and 66 transitions. Second operand has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-04-14 14:48:34,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:48:34,064 INFO L93 Difference]: Finished difference Result 103 states and 141 transitions. [2022-04-14 14:48:34,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-14 14:48:34,064 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) Word has length 58 [2022-04-14 14:48:34,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 14:48:34,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-04-14 14:48:34,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 105 transitions. [2022-04-14 14:48:34,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-04-14 14:48:34,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 105 transitions. [2022-04-14 14:48:34,070 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 105 transitions. [2022-04-14 14:48:34,162 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 14:48:34,165 INFO L225 Difference]: With dead ends: 103 [2022-04-14 14:48:34,165 INFO L226 Difference]: Without dead ends: 95 [2022-04-14 14:48:34,165 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 107 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2022-04-14 14:48:34,166 INFO L913 BasicCegarLoop]: 57 mSDtfsCounter, 32 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-14 14:48:34,166 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 204 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-14 14:48:34,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-04-14 14:48:34,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 86. [2022-04-14 14:48:34,249 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 14:48:34,250 INFO L82 GeneralOperation]: Start isEquivalent. First operand 95 states. Second operand has 86 states, 46 states have (on average 1.1956521739130435) internal successors, (55), 47 states have internal predecessors, (55), 32 states have call successors, (32), 8 states have call predecessors, (32), 7 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-14 14:48:34,250 INFO L74 IsIncluded]: Start isIncluded. First operand 95 states. Second operand has 86 states, 46 states have (on average 1.1956521739130435) internal successors, (55), 47 states have internal predecessors, (55), 32 states have call successors, (32), 8 states have call predecessors, (32), 7 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-14 14:48:34,250 INFO L87 Difference]: Start difference. First operand 95 states. Second operand has 86 states, 46 states have (on average 1.1956521739130435) internal successors, (55), 47 states have internal predecessors, (55), 32 states have call successors, (32), 8 states have call predecessors, (32), 7 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-14 14:48:34,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:48:34,255 INFO L93 Difference]: Finished difference Result 95 states and 132 transitions. [2022-04-14 14:48:34,255 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 132 transitions. [2022-04-14 14:48:34,256 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 14:48:34,256 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 14:48:34,256 INFO L74 IsIncluded]: Start isIncluded. First operand has 86 states, 46 states have (on average 1.1956521739130435) internal successors, (55), 47 states have internal predecessors, (55), 32 states have call successors, (32), 8 states have call predecessors, (32), 7 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) Second operand 95 states. [2022-04-14 14:48:34,257 INFO L87 Difference]: Start difference. First operand has 86 states, 46 states have (on average 1.1956521739130435) internal successors, (55), 47 states have internal predecessors, (55), 32 states have call successors, (32), 8 states have call predecessors, (32), 7 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) Second operand 95 states. [2022-04-14 14:48:34,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:48:34,261 INFO L93 Difference]: Finished difference Result 95 states and 132 transitions. [2022-04-14 14:48:34,261 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 132 transitions. [2022-04-14 14:48:34,262 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 14:48:34,262 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 14:48:34,262 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 14:48:34,262 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 14:48:34,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 46 states have (on average 1.1956521739130435) internal successors, (55), 47 states have internal predecessors, (55), 32 states have call successors, (32), 8 states have call predecessors, (32), 7 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-14 14:48:34,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 117 transitions. [2022-04-14 14:48:34,266 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 117 transitions. Word has length 58 [2022-04-14 14:48:34,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 14:48:34,266 INFO L478 AbstractCegarLoop]: Abstraction has 86 states and 117 transitions. [2022-04-14 14:48:34,266 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-04-14 14:48:34,267 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 117 transitions. [2022-04-14 14:48:34,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-04-14 14:48:34,267 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 14:48:34,267 INFO L499 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 4, 4, 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, 1, 1, 1, 1] [2022-04-14 14:48:34,290 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-14 14:48:34,483 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 14:48:34,483 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 14:48:34,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 14:48:34,484 INFO L85 PathProgramCache]: Analyzing trace with hash 998199389, now seen corresponding path program 1 times [2022-04-14 14:48:34,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 14:48:34,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449547224] [2022-04-14 14:48:34,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 14:48:34,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 14:48:34,500 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 14:48:34,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [934000464] [2022-04-14 14:48:34,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 14:48:34,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 14:48:34,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 14:48:34,508 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-14 14:48:34,515 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-14 14:48:34,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:48:34,563 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 30 conjunts are in the unsatisfiable core [2022-04-14 14:48:34,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:48:34,577 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 14:48:34,928 INFO L272 TraceCheckUtils]: 0: Hoare triple {3216#true} call ULTIMATE.init(); {3216#true} is VALID [2022-04-14 14:48:34,929 INFO L290 TraceCheckUtils]: 1: Hoare triple {3216#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(11, 2);call #Ultimate.allocInit(12, 3); {3216#true} is VALID [2022-04-14 14:48:34,929 INFO L290 TraceCheckUtils]: 2: Hoare triple {3216#true} assume true; {3216#true} is VALID [2022-04-14 14:48:34,929 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3216#true} {3216#true} #96#return; {3216#true} is VALID [2022-04-14 14:48:34,929 INFO L272 TraceCheckUtils]: 4: Hoare triple {3216#true} call #t~ret6 := main(); {3216#true} is VALID [2022-04-14 14:48:34,930 INFO L290 TraceCheckUtils]: 5: Hoare triple {3216#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~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; {3216#true} is VALID [2022-04-14 14:48:34,931 INFO L272 TraceCheckUtils]: 6: Hoare triple {3216#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {3216#true} is VALID [2022-04-14 14:48:34,931 INFO L290 TraceCheckUtils]: 7: Hoare triple {3216#true} ~cond := #in~cond; {3216#true} is VALID [2022-04-14 14:48:34,931 INFO L290 TraceCheckUtils]: 8: Hoare triple {3216#true} assume !(0 == ~cond); {3216#true} is VALID [2022-04-14 14:48:34,931 INFO L290 TraceCheckUtils]: 9: Hoare triple {3216#true} assume true; {3216#true} is VALID [2022-04-14 14:48:34,931 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3216#true} {3216#true} #76#return; {3216#true} is VALID [2022-04-14 14:48:34,931 INFO L272 TraceCheckUtils]: 11: Hoare triple {3216#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {3216#true} is VALID [2022-04-14 14:48:34,931 INFO L290 TraceCheckUtils]: 12: Hoare triple {3216#true} ~cond := #in~cond; {3216#true} is VALID [2022-04-14 14:48:34,931 INFO L290 TraceCheckUtils]: 13: Hoare triple {3216#true} assume !(0 == ~cond); {3216#true} is VALID [2022-04-14 14:48:34,931 INFO L290 TraceCheckUtils]: 14: Hoare triple {3216#true} assume true; {3216#true} is VALID [2022-04-14 14:48:34,932 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3216#true} {3216#true} #78#return; {3216#true} is VALID [2022-04-14 14:48:34,932 INFO L290 TraceCheckUtils]: 16: Hoare triple {3216#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {3269#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0))} is VALID [2022-04-14 14:48:34,932 INFO L272 TraceCheckUtils]: 17: Hoare triple {3269#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0))} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {3216#true} is VALID [2022-04-14 14:48:34,932 INFO L290 TraceCheckUtils]: 18: Hoare triple {3216#true} ~cond := #in~cond; {3216#true} is VALID [2022-04-14 14:48:34,932 INFO L290 TraceCheckUtils]: 19: Hoare triple {3216#true} assume !(0 == ~cond); {3216#true} is VALID [2022-04-14 14:48:34,932 INFO L290 TraceCheckUtils]: 20: Hoare triple {3216#true} assume true; {3216#true} is VALID [2022-04-14 14:48:34,933 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {3216#true} {3269#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0))} #80#return; {3269#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0))} is VALID [2022-04-14 14:48:34,933 INFO L272 TraceCheckUtils]: 22: Hoare triple {3269#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0))} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {3216#true} is VALID [2022-04-14 14:48:34,933 INFO L290 TraceCheckUtils]: 23: Hoare triple {3216#true} ~cond := #in~cond; {3216#true} is VALID [2022-04-14 14:48:34,934 INFO L290 TraceCheckUtils]: 24: Hoare triple {3216#true} assume !(0 == ~cond); {3216#true} is VALID [2022-04-14 14:48:34,934 INFO L290 TraceCheckUtils]: 25: Hoare triple {3216#true} assume true; {3216#true} is VALID [2022-04-14 14:48:34,934 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {3216#true} {3269#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0))} #82#return; {3269#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0))} is VALID [2022-04-14 14:48:34,935 INFO L290 TraceCheckUtils]: 27: Hoare triple {3269#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0))} assume !false; {3269#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0))} is VALID [2022-04-14 14:48:34,935 INFO L290 TraceCheckUtils]: 28: Hoare triple {3269#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {3306#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0))} is VALID [2022-04-14 14:48:34,936 INFO L290 TraceCheckUtils]: 29: Hoare triple {3306#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0))} assume !false; {3306#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0))} is VALID [2022-04-14 14:48:34,936 INFO L272 TraceCheckUtils]: 30: Hoare triple {3306#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {3216#true} is VALID [2022-04-14 14:48:34,936 INFO L290 TraceCheckUtils]: 31: Hoare triple {3216#true} ~cond := #in~cond; {3216#true} is VALID [2022-04-14 14:48:34,936 INFO L290 TraceCheckUtils]: 32: Hoare triple {3216#true} assume !(0 == ~cond); {3216#true} is VALID [2022-04-14 14:48:34,936 INFO L290 TraceCheckUtils]: 33: Hoare triple {3216#true} assume true; {3216#true} is VALID [2022-04-14 14:48:34,937 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {3216#true} {3306#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0))} #84#return; {3306#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0))} is VALID [2022-04-14 14:48:34,937 INFO L272 TraceCheckUtils]: 35: Hoare triple {3306#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {3216#true} is VALID [2022-04-14 14:48:34,937 INFO L290 TraceCheckUtils]: 36: Hoare triple {3216#true} ~cond := #in~cond; {3216#true} is VALID [2022-04-14 14:48:34,937 INFO L290 TraceCheckUtils]: 37: Hoare triple {3216#true} assume !(0 == ~cond); {3216#true} is VALID [2022-04-14 14:48:34,937 INFO L290 TraceCheckUtils]: 38: Hoare triple {3216#true} assume true; {3216#true} is VALID [2022-04-14 14:48:34,938 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {3216#true} {3306#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0))} #86#return; {3306#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0))} is VALID [2022-04-14 14:48:34,938 INFO L272 TraceCheckUtils]: 40: Hoare triple {3306#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {3216#true} is VALID [2022-04-14 14:48:34,938 INFO L290 TraceCheckUtils]: 41: Hoare triple {3216#true} ~cond := #in~cond; {3346#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-14 14:48:34,939 INFO L290 TraceCheckUtils]: 42: Hoare triple {3346#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {3350#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 14:48:34,939 INFO L290 TraceCheckUtils]: 43: Hoare triple {3350#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3350#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 14:48:34,939 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {3350#(not (= |__VERIFIER_assert_#in~cond| 0))} {3306#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0))} #88#return; {3306#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0))} is VALID [2022-04-14 14:48:34,940 INFO L272 TraceCheckUtils]: 45: Hoare triple {3306#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {3216#true} is VALID [2022-04-14 14:48:34,940 INFO L290 TraceCheckUtils]: 46: Hoare triple {3216#true} ~cond := #in~cond; {3216#true} is VALID [2022-04-14 14:48:34,940 INFO L290 TraceCheckUtils]: 47: Hoare triple {3216#true} assume !(0 == ~cond); {3216#true} is VALID [2022-04-14 14:48:34,940 INFO L290 TraceCheckUtils]: 48: Hoare triple {3216#true} assume true; {3216#true} is VALID [2022-04-14 14:48:34,941 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {3216#true} {3306#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0))} #90#return; {3306#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0))} is VALID [2022-04-14 14:48:34,941 INFO L290 TraceCheckUtils]: 50: Hoare triple {3306#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0))} assume !(~c~0 >= ~b~0); {3306#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0))} is VALID [2022-04-14 14:48:34,941 INFO L290 TraceCheckUtils]: 51: Hoare triple {3306#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {3378#(and (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} is VALID [2022-04-14 14:48:34,942 INFO L290 TraceCheckUtils]: 52: Hoare triple {3378#(and (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} assume !false; {3378#(and (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} is VALID [2022-04-14 14:48:34,942 INFO L290 TraceCheckUtils]: 53: Hoare triple {3378#(and (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {3378#(and (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} is VALID [2022-04-14 14:48:34,943 INFO L290 TraceCheckUtils]: 54: Hoare triple {3378#(and (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} assume !false; {3378#(and (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} is VALID [2022-04-14 14:48:34,943 INFO L272 TraceCheckUtils]: 55: Hoare triple {3378#(and (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {3216#true} is VALID [2022-04-14 14:48:34,943 INFO L290 TraceCheckUtils]: 56: Hoare triple {3216#true} ~cond := #in~cond; {3216#true} is VALID [2022-04-14 14:48:34,943 INFO L290 TraceCheckUtils]: 57: Hoare triple {3216#true} assume !(0 == ~cond); {3216#true} is VALID [2022-04-14 14:48:34,943 INFO L290 TraceCheckUtils]: 58: Hoare triple {3216#true} assume true; {3216#true} is VALID [2022-04-14 14:48:34,944 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {3216#true} {3378#(and (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} #84#return; {3378#(and (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} is VALID [2022-04-14 14:48:34,944 INFO L272 TraceCheckUtils]: 60: Hoare triple {3378#(and (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {3406#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 14:48:34,945 INFO L290 TraceCheckUtils]: 61: Hoare triple {3406#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3410#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 14:48:34,945 INFO L290 TraceCheckUtils]: 62: Hoare triple {3410#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3217#false} is VALID [2022-04-14 14:48:34,945 INFO L290 TraceCheckUtils]: 63: Hoare triple {3217#false} assume !false; {3217#false} is VALID [2022-04-14 14:48:34,946 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 15 proven. 12 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2022-04-14 14:48:34,946 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 14:48:46,851 INFO L290 TraceCheckUtils]: 63: Hoare triple {3217#false} assume !false; {3217#false} is VALID [2022-04-14 14:48:46,852 INFO L290 TraceCheckUtils]: 62: Hoare triple {3410#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3217#false} is VALID [2022-04-14 14:48:46,852 INFO L290 TraceCheckUtils]: 61: Hoare triple {3406#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3410#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 14:48:46,853 INFO L272 TraceCheckUtils]: 60: Hoare triple {3426#(= 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)); {3406#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 14:48:46,854 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {3216#true} {3426#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #84#return; {3426#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-14 14:48:46,854 INFO L290 TraceCheckUtils]: 58: Hoare triple {3216#true} assume true; {3216#true} is VALID [2022-04-14 14:48:46,854 INFO L290 TraceCheckUtils]: 57: Hoare triple {3216#true} assume !(0 == ~cond); {3216#true} is VALID [2022-04-14 14:48:46,854 INFO L290 TraceCheckUtils]: 56: Hoare triple {3216#true} ~cond := #in~cond; {3216#true} is VALID [2022-04-14 14:48:46,854 INFO L272 TraceCheckUtils]: 55: Hoare triple {3426#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {3216#true} is VALID [2022-04-14 14:48:46,855 INFO L290 TraceCheckUtils]: 54: Hoare triple {3426#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !false; {3426#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-14 14:48:46,855 INFO L290 TraceCheckUtils]: 53: Hoare triple {3426#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {3426#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-14 14:48:46,856 INFO L290 TraceCheckUtils]: 52: Hoare triple {3426#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !false; {3426#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-14 14:48:46,857 INFO L290 TraceCheckUtils]: 51: Hoare triple {3454#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {3426#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-14 14:48:46,857 INFO L290 TraceCheckUtils]: 50: Hoare triple {3454#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !(~c~0 >= ~b~0); {3454#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-14 14:48:46,858 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {3216#true} {3454#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #90#return; {3454#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-14 14:48:46,858 INFO L290 TraceCheckUtils]: 48: Hoare triple {3216#true} assume true; {3216#true} is VALID [2022-04-14 14:48:46,858 INFO L290 TraceCheckUtils]: 47: Hoare triple {3216#true} assume !(0 == ~cond); {3216#true} is VALID [2022-04-14 14:48:46,858 INFO L290 TraceCheckUtils]: 46: Hoare triple {3216#true} ~cond := #in~cond; {3216#true} is VALID [2022-04-14 14:48:46,858 INFO L272 TraceCheckUtils]: 45: Hoare triple {3454#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {3216#true} is VALID [2022-04-14 14:48:46,859 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {3350#(not (= |__VERIFIER_assert_#in~cond| 0))} {3216#true} #88#return; {3454#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-14 14:48:46,860 INFO L290 TraceCheckUtils]: 43: Hoare triple {3350#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3350#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 14:48:46,860 INFO L290 TraceCheckUtils]: 42: Hoare triple {3485#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {3350#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 14:48:46,860 INFO L290 TraceCheckUtils]: 41: Hoare triple {3216#true} ~cond := #in~cond; {3485#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-14 14:48:46,860 INFO L272 TraceCheckUtils]: 40: Hoare triple {3216#true} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {3216#true} is VALID [2022-04-14 14:48:46,861 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {3216#true} {3216#true} #86#return; {3216#true} is VALID [2022-04-14 14:48:46,861 INFO L290 TraceCheckUtils]: 38: Hoare triple {3216#true} assume true; {3216#true} is VALID [2022-04-14 14:48:46,861 INFO L290 TraceCheckUtils]: 37: Hoare triple {3216#true} assume !(0 == ~cond); {3216#true} is VALID [2022-04-14 14:48:46,861 INFO L290 TraceCheckUtils]: 36: Hoare triple {3216#true} ~cond := #in~cond; {3216#true} is VALID [2022-04-14 14:48:46,861 INFO L272 TraceCheckUtils]: 35: Hoare triple {3216#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {3216#true} is VALID [2022-04-14 14:48:46,861 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {3216#true} {3216#true} #84#return; {3216#true} is VALID [2022-04-14 14:48:46,861 INFO L290 TraceCheckUtils]: 33: Hoare triple {3216#true} assume true; {3216#true} is VALID [2022-04-14 14:48:46,861 INFO L290 TraceCheckUtils]: 32: Hoare triple {3216#true} assume !(0 == ~cond); {3216#true} is VALID [2022-04-14 14:48:46,861 INFO L290 TraceCheckUtils]: 31: Hoare triple {3216#true} ~cond := #in~cond; {3216#true} is VALID [2022-04-14 14:48:46,861 INFO L272 TraceCheckUtils]: 30: Hoare triple {3216#true} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {3216#true} is VALID [2022-04-14 14:48:46,861 INFO L290 TraceCheckUtils]: 29: Hoare triple {3216#true} assume !false; {3216#true} is VALID [2022-04-14 14:48:46,862 INFO L290 TraceCheckUtils]: 28: Hoare triple {3216#true} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {3216#true} is VALID [2022-04-14 14:48:46,862 INFO L290 TraceCheckUtils]: 27: Hoare triple {3216#true} assume !false; {3216#true} is VALID [2022-04-14 14:48:46,862 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {3216#true} {3216#true} #82#return; {3216#true} is VALID [2022-04-14 14:48:46,862 INFO L290 TraceCheckUtils]: 25: Hoare triple {3216#true} assume true; {3216#true} is VALID [2022-04-14 14:48:46,862 INFO L290 TraceCheckUtils]: 24: Hoare triple {3216#true} assume !(0 == ~cond); {3216#true} is VALID [2022-04-14 14:48:46,862 INFO L290 TraceCheckUtils]: 23: Hoare triple {3216#true} ~cond := #in~cond; {3216#true} is VALID [2022-04-14 14:48:46,862 INFO L272 TraceCheckUtils]: 22: Hoare triple {3216#true} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {3216#true} is VALID [2022-04-14 14:48:46,862 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {3216#true} {3216#true} #80#return; {3216#true} is VALID [2022-04-14 14:48:46,862 INFO L290 TraceCheckUtils]: 20: Hoare triple {3216#true} assume true; {3216#true} is VALID [2022-04-14 14:48:46,862 INFO L290 TraceCheckUtils]: 19: Hoare triple {3216#true} assume !(0 == ~cond); {3216#true} is VALID [2022-04-14 14:48:46,862 INFO L290 TraceCheckUtils]: 18: Hoare triple {3216#true} ~cond := #in~cond; {3216#true} is VALID [2022-04-14 14:48:46,862 INFO L272 TraceCheckUtils]: 17: Hoare triple {3216#true} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {3216#true} is VALID [2022-04-14 14:48:46,863 INFO L290 TraceCheckUtils]: 16: Hoare triple {3216#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {3216#true} is VALID [2022-04-14 14:48:46,863 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3216#true} {3216#true} #78#return; {3216#true} is VALID [2022-04-14 14:48:46,863 INFO L290 TraceCheckUtils]: 14: Hoare triple {3216#true} assume true; {3216#true} is VALID [2022-04-14 14:48:46,863 INFO L290 TraceCheckUtils]: 13: Hoare triple {3216#true} assume !(0 == ~cond); {3216#true} is VALID [2022-04-14 14:48:46,863 INFO L290 TraceCheckUtils]: 12: Hoare triple {3216#true} ~cond := #in~cond; {3216#true} is VALID [2022-04-14 14:48:46,863 INFO L272 TraceCheckUtils]: 11: Hoare triple {3216#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {3216#true} is VALID [2022-04-14 14:48:46,863 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3216#true} {3216#true} #76#return; {3216#true} is VALID [2022-04-14 14:48:46,863 INFO L290 TraceCheckUtils]: 9: Hoare triple {3216#true} assume true; {3216#true} is VALID [2022-04-14 14:48:46,863 INFO L290 TraceCheckUtils]: 8: Hoare triple {3216#true} assume !(0 == ~cond); {3216#true} is VALID [2022-04-14 14:48:46,863 INFO L290 TraceCheckUtils]: 7: Hoare triple {3216#true} ~cond := #in~cond; {3216#true} is VALID [2022-04-14 14:48:46,863 INFO L272 TraceCheckUtils]: 6: Hoare triple {3216#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {3216#true} is VALID [2022-04-14 14:48:46,864 INFO L290 TraceCheckUtils]: 5: Hoare triple {3216#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~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; {3216#true} is VALID [2022-04-14 14:48:46,864 INFO L272 TraceCheckUtils]: 4: Hoare triple {3216#true} call #t~ret6 := main(); {3216#true} is VALID [2022-04-14 14:48:46,864 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3216#true} {3216#true} #96#return; {3216#true} is VALID [2022-04-14 14:48:46,864 INFO L290 TraceCheckUtils]: 2: Hoare triple {3216#true} assume true; {3216#true} is VALID [2022-04-14 14:48:46,864 INFO L290 TraceCheckUtils]: 1: Hoare triple {3216#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(11, 2);call #Ultimate.allocInit(12, 3); {3216#true} is VALID [2022-04-14 14:48:46,864 INFO L272 TraceCheckUtils]: 0: Hoare triple {3216#true} call ULTIMATE.init(); {3216#true} is VALID [2022-04-14 14:48:46,864 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 20 proven. 7 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2022-04-14 14:48:46,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 14:48:46,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449547224] [2022-04-14 14:48:46,865 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 14:48:46,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [934000464] [2022-04-14 14:48:46,865 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [934000464] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-14 14:48:46,865 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-14 14:48:46,865 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 12 [2022-04-14 14:48:46,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535034777] [2022-04-14 14:48:46,865 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-14 14:48:46,866 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 11 states have internal predecessors, (35), 6 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (17), 6 states have call predecessors, (17), 6 states have call successors, (17) Word has length 64 [2022-04-14 14:48:46,866 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 14:48:46,866 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 11 states have internal predecessors, (35), 6 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (17), 6 states have call predecessors, (17), 6 states have call successors, (17) [2022-04-14 14:48:46,931 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 14:48:46,931 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-14 14:48:46,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 14:48:46,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-14 14:48:46,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-04-14 14:48:46,932 INFO L87 Difference]: Start difference. First operand 86 states and 117 transitions. Second operand has 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 11 states have internal predecessors, (35), 6 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (17), 6 states have call predecessors, (17), 6 states have call successors, (17) [2022-04-14 14:48:48,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:48:48,461 INFO L93 Difference]: Finished difference Result 129 states and 182 transitions. [2022-04-14 14:48:48,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-14 14:48:48,461 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 11 states have internal predecessors, (35), 6 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (17), 6 states have call predecessors, (17), 6 states have call successors, (17) Word has length 64 [2022-04-14 14:48:48,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 14:48:48,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 11 states have internal predecessors, (35), 6 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (17), 6 states have call predecessors, (17), 6 states have call successors, (17) [2022-04-14 14:48:48,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 104 transitions. [2022-04-14 14:48:48,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 11 states have internal predecessors, (35), 6 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (17), 6 states have call predecessors, (17), 6 states have call successors, (17) [2022-04-14 14:48:48,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 104 transitions. [2022-04-14 14:48:48,467 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 104 transitions. [2022-04-14 14:48:48,573 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 14:48:48,576 INFO L225 Difference]: With dead ends: 129 [2022-04-14 14:48:48,577 INFO L226 Difference]: Without dead ends: 125 [2022-04-14 14:48:48,577 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 120 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2022-04-14 14:48:48,578 INFO L913 BasicCegarLoop]: 41 mSDtfsCounter, 30 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 395 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-14 14:48:48,578 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 235 Invalid, 444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 395 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-14 14:48:48,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2022-04-14 14:48:48,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 93. [2022-04-14 14:48:48,672 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 14:48:48,673 INFO L82 GeneralOperation]: Start isEquivalent. First operand 125 states. Second operand has 93 states, 50 states have (on average 1.18) internal successors, (59), 52 states have internal predecessors, (59), 34 states have call successors, (34), 9 states have call predecessors, (34), 8 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2022-04-14 14:48:48,673 INFO L74 IsIncluded]: Start isIncluded. First operand 125 states. Second operand has 93 states, 50 states have (on average 1.18) internal successors, (59), 52 states have internal predecessors, (59), 34 states have call successors, (34), 9 states have call predecessors, (34), 8 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2022-04-14 14:48:48,673 INFO L87 Difference]: Start difference. First operand 125 states. Second operand has 93 states, 50 states have (on average 1.18) internal successors, (59), 52 states have internal predecessors, (59), 34 states have call successors, (34), 9 states have call predecessors, (34), 8 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2022-04-14 14:48:48,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:48:48,679 INFO L93 Difference]: Finished difference Result 125 states and 176 transitions. [2022-04-14 14:48:48,679 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 176 transitions. [2022-04-14 14:48:48,679 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 14:48:48,679 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 14:48:48,680 INFO L74 IsIncluded]: Start isIncluded. First operand has 93 states, 50 states have (on average 1.18) internal successors, (59), 52 states have internal predecessors, (59), 34 states have call successors, (34), 9 states have call predecessors, (34), 8 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) Second operand 125 states. [2022-04-14 14:48:48,681 INFO L87 Difference]: Start difference. First operand has 93 states, 50 states have (on average 1.18) internal successors, (59), 52 states have internal predecessors, (59), 34 states have call successors, (34), 9 states have call predecessors, (34), 8 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) Second operand 125 states. [2022-04-14 14:48:48,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:48:48,686 INFO L93 Difference]: Finished difference Result 125 states and 176 transitions. [2022-04-14 14:48:48,686 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 176 transitions. [2022-04-14 14:48:48,687 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 14:48:48,687 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 14:48:48,687 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 14:48:48,687 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 14:48:48,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 50 states have (on average 1.18) internal successors, (59), 52 states have internal predecessors, (59), 34 states have call successors, (34), 9 states have call predecessors, (34), 8 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2022-04-14 14:48:48,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 125 transitions. [2022-04-14 14:48:48,691 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 125 transitions. Word has length 64 [2022-04-14 14:48:48,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 14:48:48,691 INFO L478 AbstractCegarLoop]: Abstraction has 93 states and 125 transitions. [2022-04-14 14:48:48,691 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 11 states have internal predecessors, (35), 6 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (17), 6 states have call predecessors, (17), 6 states have call successors, (17) [2022-04-14 14:48:48,691 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 125 transitions. [2022-04-14 14:48:48,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-04-14 14:48:48,692 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 14:48:48,692 INFO L499 BasicCegarLoop]: trace histogram [7, 6, 6, 4, 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, 1, 1, 1, 1] [2022-04-14 14:48:48,715 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-14 14:48:48,911 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 14:48:48,912 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 14:48:48,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 14:48:48,912 INFO L85 PathProgramCache]: Analyzing trace with hash 1412509540, now seen corresponding path program 2 times [2022-04-14 14:48:48,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 14:48:48,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737888774] [2022-04-14 14:48:48,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 14:48:48,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 14:48:48,935 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 14:48:48,935 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1120955372] [2022-04-14 14:48:48,935 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-14 14:48:48,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 14:48:48,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 14:48:48,941 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-14 14:48:48,965 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-14 14:48:49,003 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-14 14:48:49,004 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-14 14:48:49,005 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 35 conjunts are in the unsatisfiable core [2022-04-14 14:48:49,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:48:49,020 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 14:48:49,666 INFO L272 TraceCheckUtils]: 0: Hoare triple {4231#true} call ULTIMATE.init(); {4231#true} is VALID [2022-04-14 14:48:49,666 INFO L290 TraceCheckUtils]: 1: Hoare triple {4231#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(11, 2);call #Ultimate.allocInit(12, 3); {4231#true} is VALID [2022-04-14 14:48:49,666 INFO L290 TraceCheckUtils]: 2: Hoare triple {4231#true} assume true; {4231#true} is VALID [2022-04-14 14:48:49,666 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4231#true} {4231#true} #96#return; {4231#true} is VALID [2022-04-14 14:48:49,667 INFO L272 TraceCheckUtils]: 4: Hoare triple {4231#true} call #t~ret6 := main(); {4231#true} is VALID [2022-04-14 14:48:49,667 INFO L290 TraceCheckUtils]: 5: Hoare triple {4231#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~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; {4231#true} is VALID [2022-04-14 14:48:49,667 INFO L272 TraceCheckUtils]: 6: Hoare triple {4231#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {4231#true} is VALID [2022-04-14 14:48:49,667 INFO L290 TraceCheckUtils]: 7: Hoare triple {4231#true} ~cond := #in~cond; {4257#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-14 14:48:49,667 INFO L290 TraceCheckUtils]: 8: Hoare triple {4257#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {4261#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-14 14:48:49,668 INFO L290 TraceCheckUtils]: 9: Hoare triple {4261#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {4261#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-14 14:48:49,668 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4261#(not (= |assume_abort_if_not_#in~cond| 0))} {4231#true} #76#return; {4268#(<= 1 main_~x~0)} is VALID [2022-04-14 14:48:49,668 INFO L272 TraceCheckUtils]: 11: Hoare triple {4268#(<= 1 main_~x~0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {4231#true} is VALID [2022-04-14 14:48:49,668 INFO L290 TraceCheckUtils]: 12: Hoare triple {4231#true} ~cond := #in~cond; {4231#true} is VALID [2022-04-14 14:48:49,668 INFO L290 TraceCheckUtils]: 13: Hoare triple {4231#true} assume !(0 == ~cond); {4231#true} is VALID [2022-04-14 14:48:49,668 INFO L290 TraceCheckUtils]: 14: Hoare triple {4231#true} assume true; {4231#true} is VALID [2022-04-14 14:48:49,669 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {4231#true} {4268#(<= 1 main_~x~0)} #78#return; {4268#(<= 1 main_~x~0)} is VALID [2022-04-14 14:48:49,669 INFO L290 TraceCheckUtils]: 16: Hoare triple {4268#(<= 1 main_~x~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {4287#(and (= main_~r~0 0) (<= 1 main_~x~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-14 14:48:49,669 INFO L272 TraceCheckUtils]: 17: Hoare triple {4287#(and (= main_~r~0 0) (<= 1 main_~x~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 assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {4231#true} is VALID [2022-04-14 14:48:49,669 INFO L290 TraceCheckUtils]: 18: Hoare triple {4231#true} ~cond := #in~cond; {4231#true} is VALID [2022-04-14 14:48:49,669 INFO L290 TraceCheckUtils]: 19: Hoare triple {4231#true} assume !(0 == ~cond); {4231#true} is VALID [2022-04-14 14:48:49,669 INFO L290 TraceCheckUtils]: 20: Hoare triple {4231#true} assume true; {4231#true} is VALID [2022-04-14 14:48:49,670 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {4231#true} {4287#(and (= main_~r~0 0) (<= 1 main_~x~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))} #80#return; {4287#(and (= main_~r~0 0) (<= 1 main_~x~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-14 14:48:49,670 INFO L272 TraceCheckUtils]: 22: Hoare triple {4287#(and (= main_~r~0 0) (<= 1 main_~x~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 assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {4231#true} is VALID [2022-04-14 14:48:49,670 INFO L290 TraceCheckUtils]: 23: Hoare triple {4231#true} ~cond := #in~cond; {4231#true} is VALID [2022-04-14 14:48:49,670 INFO L290 TraceCheckUtils]: 24: Hoare triple {4231#true} assume !(0 == ~cond); {4231#true} is VALID [2022-04-14 14:48:49,670 INFO L290 TraceCheckUtils]: 25: Hoare triple {4231#true} assume true; {4231#true} is VALID [2022-04-14 14:48:49,672 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {4231#true} {4287#(and (= main_~r~0 0) (<= 1 main_~x~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))} #82#return; {4287#(and (= main_~r~0 0) (<= 1 main_~x~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-14 14:48:49,672 INFO L290 TraceCheckUtils]: 27: Hoare triple {4287#(and (= main_~r~0 0) (<= 1 main_~x~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 !false; {4287#(and (= main_~r~0 0) (<= 1 main_~x~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-14 14:48:49,673 INFO L290 TraceCheckUtils]: 28: Hoare triple {4287#(and (= main_~r~0 0) (<= 1 main_~x~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 !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {4324#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 14:48:49,673 INFO L290 TraceCheckUtils]: 29: Hoare triple {4324#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} assume !false; {4324#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 14:48:49,673 INFO L272 TraceCheckUtils]: 30: Hoare triple {4324#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {4231#true} is VALID [2022-04-14 14:48:49,673 INFO L290 TraceCheckUtils]: 31: Hoare triple {4231#true} ~cond := #in~cond; {4231#true} is VALID [2022-04-14 14:48:49,674 INFO L290 TraceCheckUtils]: 32: Hoare triple {4231#true} assume !(0 == ~cond); {4231#true} is VALID [2022-04-14 14:48:49,674 INFO L290 TraceCheckUtils]: 33: Hoare triple {4231#true} assume true; {4231#true} is VALID [2022-04-14 14:48:49,675 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {4231#true} {4324#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #84#return; {4324#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 14:48:49,675 INFO L272 TraceCheckUtils]: 35: Hoare triple {4324#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~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)); {4231#true} is VALID [2022-04-14 14:48:49,675 INFO L290 TraceCheckUtils]: 36: Hoare triple {4231#true} ~cond := #in~cond; {4231#true} is VALID [2022-04-14 14:48:49,675 INFO L290 TraceCheckUtils]: 37: Hoare triple {4231#true} assume !(0 == ~cond); {4231#true} is VALID [2022-04-14 14:48:49,675 INFO L290 TraceCheckUtils]: 38: Hoare triple {4231#true} assume true; {4231#true} is VALID [2022-04-14 14:48:49,676 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {4231#true} {4324#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #86#return; {4324#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 14:48:49,676 INFO L272 TraceCheckUtils]: 40: Hoare triple {4324#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~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)); {4231#true} is VALID [2022-04-14 14:48:49,676 INFO L290 TraceCheckUtils]: 41: Hoare triple {4231#true} ~cond := #in~cond; {4231#true} is VALID [2022-04-14 14:48:49,676 INFO L290 TraceCheckUtils]: 42: Hoare triple {4231#true} assume !(0 == ~cond); {4231#true} is VALID [2022-04-14 14:48:49,677 INFO L290 TraceCheckUtils]: 43: Hoare triple {4231#true} assume true; {4231#true} is VALID [2022-04-14 14:48:49,678 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {4231#true} {4324#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #88#return; {4324#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 14:48:49,678 INFO L272 TraceCheckUtils]: 45: Hoare triple {4324#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {4231#true} is VALID [2022-04-14 14:48:49,678 INFO L290 TraceCheckUtils]: 46: Hoare triple {4231#true} ~cond := #in~cond; {4231#true} is VALID [2022-04-14 14:48:49,678 INFO L290 TraceCheckUtils]: 47: Hoare triple {4231#true} assume !(0 == ~cond); {4231#true} is VALID [2022-04-14 14:48:49,678 INFO L290 TraceCheckUtils]: 48: Hoare triple {4231#true} assume true; {4231#true} is VALID [2022-04-14 14:48:49,679 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {4231#true} {4324#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #90#return; {4324#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 14:48:49,680 INFO L290 TraceCheckUtils]: 50: Hoare triple {4324#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} assume !(~c~0 >= ~b~0); {4391#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (not (<= main_~y~0 main_~c~0)) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 14:48:49,680 INFO L290 TraceCheckUtils]: 51: Hoare triple {4391#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (not (<= main_~y~0 main_~c~0)) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {4395#(and (= main_~s~0 0) (<= 1 main_~x~0) (not (<= main_~y~0 main_~x~0)) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-14 14:48:49,681 INFO L290 TraceCheckUtils]: 52: Hoare triple {4395#(and (= main_~s~0 0) (<= 1 main_~x~0) (not (<= main_~y~0 main_~x~0)) (= main_~b~0 main_~x~0) (= main_~q~0 1))} assume !false; {4395#(and (= main_~s~0 0) (<= 1 main_~x~0) (not (<= main_~y~0 main_~x~0)) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-14 14:48:49,681 INFO L290 TraceCheckUtils]: 53: Hoare triple {4395#(and (= main_~s~0 0) (<= 1 main_~x~0) (not (<= main_~y~0 main_~x~0)) (= main_~b~0 main_~x~0) (= main_~q~0 1))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {4395#(and (= main_~s~0 0) (<= 1 main_~x~0) (not (<= main_~y~0 main_~x~0)) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-14 14:48:49,682 INFO L290 TraceCheckUtils]: 54: Hoare triple {4395#(and (= main_~s~0 0) (<= 1 main_~x~0) (not (<= main_~y~0 main_~x~0)) (= main_~b~0 main_~x~0) (= main_~q~0 1))} assume !false; {4395#(and (= main_~s~0 0) (<= 1 main_~x~0) (not (<= main_~y~0 main_~x~0)) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-14 14:48:49,682 INFO L272 TraceCheckUtils]: 55: Hoare triple {4395#(and (= main_~s~0 0) (<= 1 main_~x~0) (not (<= main_~y~0 main_~x~0)) (= main_~b~0 main_~x~0) (= main_~q~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {4231#true} is VALID [2022-04-14 14:48:49,682 INFO L290 TraceCheckUtils]: 56: Hoare triple {4231#true} ~cond := #in~cond; {4231#true} is VALID [2022-04-14 14:48:49,682 INFO L290 TraceCheckUtils]: 57: Hoare triple {4231#true} assume !(0 == ~cond); {4231#true} is VALID [2022-04-14 14:48:49,682 INFO L290 TraceCheckUtils]: 58: Hoare triple {4231#true} assume true; {4231#true} is VALID [2022-04-14 14:48:49,683 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {4231#true} {4395#(and (= main_~s~0 0) (<= 1 main_~x~0) (not (<= main_~y~0 main_~x~0)) (= main_~b~0 main_~x~0) (= main_~q~0 1))} #84#return; {4395#(and (= main_~s~0 0) (<= 1 main_~x~0) (not (<= main_~y~0 main_~x~0)) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-14 14:48:49,683 INFO L272 TraceCheckUtils]: 60: Hoare triple {4395#(and (= main_~s~0 0) (<= 1 main_~x~0) (not (<= main_~y~0 main_~x~0)) (= main_~b~0 main_~x~0) (= main_~q~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {4231#true} is VALID [2022-04-14 14:48:49,683 INFO L290 TraceCheckUtils]: 61: Hoare triple {4231#true} ~cond := #in~cond; {4231#true} is VALID [2022-04-14 14:48:49,683 INFO L290 TraceCheckUtils]: 62: Hoare triple {4231#true} assume !(0 == ~cond); {4231#true} is VALID [2022-04-14 14:48:49,683 INFO L290 TraceCheckUtils]: 63: Hoare triple {4231#true} assume true; {4231#true} is VALID [2022-04-14 14:48:49,684 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {4231#true} {4395#(and (= main_~s~0 0) (<= 1 main_~x~0) (not (<= main_~y~0 main_~x~0)) (= main_~b~0 main_~x~0) (= main_~q~0 1))} #86#return; {4395#(and (= main_~s~0 0) (<= 1 main_~x~0) (not (<= main_~y~0 main_~x~0)) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-14 14:48:49,685 INFO L272 TraceCheckUtils]: 65: Hoare triple {4395#(and (= main_~s~0 0) (<= 1 main_~x~0) (not (<= main_~y~0 main_~x~0)) (= main_~b~0 main_~x~0) (= main_~q~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {4438#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 14:48:49,685 INFO L290 TraceCheckUtils]: 66: Hoare triple {4438#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4442#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 14:48:49,686 INFO L290 TraceCheckUtils]: 67: Hoare triple {4442#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4232#false} is VALID [2022-04-14 14:48:49,686 INFO L290 TraceCheckUtils]: 68: Hoare triple {4232#false} assume !false; {4232#false} is VALID [2022-04-14 14:48:49,686 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 12 proven. 15 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2022-04-14 14:48:49,686 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 14:48:50,117 INFO L290 TraceCheckUtils]: 68: Hoare triple {4232#false} assume !false; {4232#false} is VALID [2022-04-14 14:48:50,117 INFO L290 TraceCheckUtils]: 67: Hoare triple {4442#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4232#false} is VALID [2022-04-14 14:48:50,118 INFO L290 TraceCheckUtils]: 66: Hoare triple {4438#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4442#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 14:48:50,118 INFO L272 TraceCheckUtils]: 65: Hoare triple {4458#(= 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)); {4438#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 14:48:50,119 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {4231#true} {4458#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #86#return; {4458#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-14 14:48:50,119 INFO L290 TraceCheckUtils]: 63: Hoare triple {4231#true} assume true; {4231#true} is VALID [2022-04-14 14:48:50,119 INFO L290 TraceCheckUtils]: 62: Hoare triple {4231#true} assume !(0 == ~cond); {4231#true} is VALID [2022-04-14 14:48:50,119 INFO L290 TraceCheckUtils]: 61: Hoare triple {4231#true} ~cond := #in~cond; {4231#true} is VALID [2022-04-14 14:48:50,119 INFO L272 TraceCheckUtils]: 60: Hoare triple {4458#(= 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)); {4231#true} is VALID [2022-04-14 14:48:50,120 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {4231#true} {4458#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #84#return; {4458#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-14 14:48:50,120 INFO L290 TraceCheckUtils]: 58: Hoare triple {4231#true} assume true; {4231#true} is VALID [2022-04-14 14:48:50,120 INFO L290 TraceCheckUtils]: 57: Hoare triple {4231#true} assume !(0 == ~cond); {4231#true} is VALID [2022-04-14 14:48:50,120 INFO L290 TraceCheckUtils]: 56: Hoare triple {4231#true} ~cond := #in~cond; {4231#true} is VALID [2022-04-14 14:48:50,120 INFO L272 TraceCheckUtils]: 55: Hoare triple {4458#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {4231#true} is VALID [2022-04-14 14:48:50,120 INFO L290 TraceCheckUtils]: 54: Hoare triple {4458#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !false; {4458#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-14 14:48:50,121 INFO L290 TraceCheckUtils]: 53: Hoare triple {4458#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {4458#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-14 14:48:50,121 INFO L290 TraceCheckUtils]: 52: Hoare triple {4458#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !false; {4458#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-14 14:48:50,661 INFO L290 TraceCheckUtils]: 51: Hoare triple {4501#(= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {4458#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-14 14:48:50,662 INFO L290 TraceCheckUtils]: 50: Hoare triple {4505#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0) (<= main_~b~0 main_~c~0))} assume !(~c~0 >= ~b~0); {4501#(= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)} is VALID [2022-04-14 14:48:50,663 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {4231#true} {4505#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0) (<= main_~b~0 main_~c~0))} #90#return; {4505#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0) (<= main_~b~0 main_~c~0))} is VALID [2022-04-14 14:48:50,663 INFO L290 TraceCheckUtils]: 48: Hoare triple {4231#true} assume true; {4231#true} is VALID [2022-04-14 14:48:50,663 INFO L290 TraceCheckUtils]: 47: Hoare triple {4231#true} assume !(0 == ~cond); {4231#true} is VALID [2022-04-14 14:48:50,663 INFO L290 TraceCheckUtils]: 46: Hoare triple {4231#true} ~cond := #in~cond; {4231#true} is VALID [2022-04-14 14:48:50,663 INFO L272 TraceCheckUtils]: 45: Hoare triple {4505#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0) (<= main_~b~0 main_~c~0))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {4231#true} is VALID [2022-04-14 14:48:50,664 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {4231#true} {4505#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0) (<= main_~b~0 main_~c~0))} #88#return; {4505#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0) (<= main_~b~0 main_~c~0))} is VALID [2022-04-14 14:48:50,664 INFO L290 TraceCheckUtils]: 43: Hoare triple {4231#true} assume true; {4231#true} is VALID [2022-04-14 14:48:50,664 INFO L290 TraceCheckUtils]: 42: Hoare triple {4231#true} assume !(0 == ~cond); {4231#true} is VALID [2022-04-14 14:48:50,664 INFO L290 TraceCheckUtils]: 41: Hoare triple {4231#true} ~cond := #in~cond; {4231#true} is VALID [2022-04-14 14:48:50,664 INFO L272 TraceCheckUtils]: 40: Hoare triple {4505#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0) (<= main_~b~0 main_~c~0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {4231#true} is VALID [2022-04-14 14:48:50,666 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {4231#true} {4505#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0) (<= main_~b~0 main_~c~0))} #86#return; {4505#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0) (<= main_~b~0 main_~c~0))} is VALID [2022-04-14 14:48:50,666 INFO L290 TraceCheckUtils]: 38: Hoare triple {4231#true} assume true; {4231#true} is VALID [2022-04-14 14:48:50,667 INFO L290 TraceCheckUtils]: 37: Hoare triple {4231#true} assume !(0 == ~cond); {4231#true} is VALID [2022-04-14 14:48:50,667 INFO L290 TraceCheckUtils]: 36: Hoare triple {4231#true} ~cond := #in~cond; {4231#true} is VALID [2022-04-14 14:48:50,667 INFO L272 TraceCheckUtils]: 35: Hoare triple {4505#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0) (<= main_~b~0 main_~c~0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {4231#true} is VALID [2022-04-14 14:48:50,672 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {4231#true} {4505#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0) (<= main_~b~0 main_~c~0))} #84#return; {4505#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0) (<= main_~b~0 main_~c~0))} is VALID [2022-04-14 14:48:50,672 INFO L290 TraceCheckUtils]: 33: Hoare triple {4231#true} assume true; {4231#true} is VALID [2022-04-14 14:48:50,672 INFO L290 TraceCheckUtils]: 32: Hoare triple {4231#true} assume !(0 == ~cond); {4231#true} is VALID [2022-04-14 14:48:50,672 INFO L290 TraceCheckUtils]: 31: Hoare triple {4231#true} ~cond := #in~cond; {4231#true} is VALID [2022-04-14 14:48:50,672 INFO L272 TraceCheckUtils]: 30: Hoare triple {4505#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0) (<= main_~b~0 main_~c~0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {4231#true} is VALID [2022-04-14 14:48:50,673 INFO L290 TraceCheckUtils]: 29: Hoare triple {4505#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0) (<= main_~b~0 main_~c~0))} assume !false; {4505#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0) (<= main_~b~0 main_~c~0))} is VALID [2022-04-14 14:48:50,673 INFO L290 TraceCheckUtils]: 28: Hoare triple {4572#(or (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (<= main_~b~0 main_~a~0))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {4505#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0) (<= main_~b~0 main_~c~0))} is VALID [2022-04-14 14:48:50,674 INFO L290 TraceCheckUtils]: 27: Hoare triple {4572#(or (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (<= main_~b~0 main_~a~0))} assume !false; {4572#(or (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (<= main_~b~0 main_~a~0))} is VALID [2022-04-14 14:48:50,674 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {4231#true} {4572#(or (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (<= main_~b~0 main_~a~0))} #82#return; {4572#(or (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (<= main_~b~0 main_~a~0))} is VALID [2022-04-14 14:48:50,674 INFO L290 TraceCheckUtils]: 25: Hoare triple {4231#true} assume true; {4231#true} is VALID [2022-04-14 14:48:50,674 INFO L290 TraceCheckUtils]: 24: Hoare triple {4231#true} assume !(0 == ~cond); {4231#true} is VALID [2022-04-14 14:48:50,675 INFO L290 TraceCheckUtils]: 23: Hoare triple {4231#true} ~cond := #in~cond; {4231#true} is VALID [2022-04-14 14:48:50,675 INFO L272 TraceCheckUtils]: 22: Hoare triple {4572#(or (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (<= main_~b~0 main_~a~0))} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {4231#true} is VALID [2022-04-14 14:48:50,675 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {4231#true} {4572#(or (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (<= main_~b~0 main_~a~0))} #80#return; {4572#(or (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (<= main_~b~0 main_~a~0))} is VALID [2022-04-14 14:48:50,675 INFO L290 TraceCheckUtils]: 20: Hoare triple {4231#true} assume true; {4231#true} is VALID [2022-04-14 14:48:50,675 INFO L290 TraceCheckUtils]: 19: Hoare triple {4231#true} assume !(0 == ~cond); {4231#true} is VALID [2022-04-14 14:48:50,675 INFO L290 TraceCheckUtils]: 18: Hoare triple {4231#true} ~cond := #in~cond; {4231#true} is VALID [2022-04-14 14:48:50,675 INFO L272 TraceCheckUtils]: 17: Hoare triple {4572#(or (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (<= main_~b~0 main_~a~0))} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {4231#true} is VALID [2022-04-14 14:48:50,676 INFO L290 TraceCheckUtils]: 16: Hoare triple {4231#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {4572#(or (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (<= main_~b~0 main_~a~0))} is VALID [2022-04-14 14:48:50,676 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {4231#true} {4231#true} #78#return; {4231#true} is VALID [2022-04-14 14:48:50,676 INFO L290 TraceCheckUtils]: 14: Hoare triple {4231#true} assume true; {4231#true} is VALID [2022-04-14 14:48:50,676 INFO L290 TraceCheckUtils]: 13: Hoare triple {4231#true} assume !(0 == ~cond); {4231#true} is VALID [2022-04-14 14:48:50,676 INFO L290 TraceCheckUtils]: 12: Hoare triple {4231#true} ~cond := #in~cond; {4231#true} is VALID [2022-04-14 14:48:50,676 INFO L272 TraceCheckUtils]: 11: Hoare triple {4231#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {4231#true} is VALID [2022-04-14 14:48:50,676 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4231#true} {4231#true} #76#return; {4231#true} is VALID [2022-04-14 14:48:50,676 INFO L290 TraceCheckUtils]: 9: Hoare triple {4231#true} assume true; {4231#true} is VALID [2022-04-14 14:48:50,676 INFO L290 TraceCheckUtils]: 8: Hoare triple {4231#true} assume !(0 == ~cond); {4231#true} is VALID [2022-04-14 14:48:50,676 INFO L290 TraceCheckUtils]: 7: Hoare triple {4231#true} ~cond := #in~cond; {4231#true} is VALID [2022-04-14 14:48:50,677 INFO L272 TraceCheckUtils]: 6: Hoare triple {4231#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {4231#true} is VALID [2022-04-14 14:48:50,677 INFO L290 TraceCheckUtils]: 5: Hoare triple {4231#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~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; {4231#true} is VALID [2022-04-14 14:48:50,677 INFO L272 TraceCheckUtils]: 4: Hoare triple {4231#true} call #t~ret6 := main(); {4231#true} is VALID [2022-04-14 14:48:50,677 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4231#true} {4231#true} #96#return; {4231#true} is VALID [2022-04-14 14:48:50,677 INFO L290 TraceCheckUtils]: 2: Hoare triple {4231#true} assume true; {4231#true} is VALID [2022-04-14 14:48:50,677 INFO L290 TraceCheckUtils]: 1: Hoare triple {4231#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(11, 2);call #Ultimate.allocInit(12, 3); {4231#true} is VALID [2022-04-14 14:48:50,677 INFO L272 TraceCheckUtils]: 0: Hoare triple {4231#true} call ULTIMATE.init(); {4231#true} is VALID [2022-04-14 14:48:50,677 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-04-14 14:48:50,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 14:48:50,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737888774] [2022-04-14 14:48:50,678 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 14:48:50,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1120955372] [2022-04-14 14:48:50,678 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1120955372] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-14 14:48:50,678 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-14 14:48:50,678 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 15 [2022-04-14 14:48:50,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640010657] [2022-04-14 14:48:50,678 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-14 14:48:50,679 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.2) internal successors, (33), 13 states have internal predecessors, (33), 8 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (21), 8 states have call predecessors, (21), 8 states have call successors, (21) Word has length 69 [2022-04-14 14:48:50,679 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 14:48:50,680 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 2.2) internal successors, (33), 13 states have internal predecessors, (33), 8 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (21), 8 states have call predecessors, (21), 8 states have call successors, (21) [2022-04-14 14:48:50,926 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 14:48:50,926 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-14 14:48:50,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 14:48:50,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-14 14:48:50,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2022-04-14 14:48:50,927 INFO L87 Difference]: Start difference. First operand 93 states and 125 transitions. Second operand has 15 states, 15 states have (on average 2.2) internal successors, (33), 13 states have internal predecessors, (33), 8 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (21), 8 states have call predecessors, (21), 8 states have call successors, (21) [2022-04-14 14:48:58,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:48:58,169 INFO L93 Difference]: Finished difference Result 229 states and 335 transitions. [2022-04-14 14:48:58,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-04-14 14:48:58,169 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.2) internal successors, (33), 13 states have internal predecessors, (33), 8 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (21), 8 states have call predecessors, (21), 8 states have call successors, (21) Word has length 69 [2022-04-14 14:48:58,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 14:48:58,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 2.2) internal successors, (33), 13 states have internal predecessors, (33), 8 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (21), 8 states have call predecessors, (21), 8 states have call successors, (21) [2022-04-14 14:48:58,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 168 transitions. [2022-04-14 14:48:58,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 2.2) internal successors, (33), 13 states have internal predecessors, (33), 8 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (21), 8 states have call predecessors, (21), 8 states have call successors, (21) [2022-04-14 14:48:58,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 168 transitions. [2022-04-14 14:48:58,178 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 168 transitions. [2022-04-14 14:48:58,403 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 168 edges. 168 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 14:48:58,409 INFO L225 Difference]: With dead ends: 229 [2022-04-14 14:48:58,409 INFO L226 Difference]: Without dead ends: 227 [2022-04-14 14:48:58,410 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 123 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=225, Invalid=767, Unknown=0, NotChecked=0, Total=992 [2022-04-14 14:48:58,410 INFO L913 BasicCegarLoop]: 58 mSDtfsCounter, 92 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 422 mSolverCounterSat, 151 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 573 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 151 IncrementalHoareTripleChecker+Valid, 422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-04-14 14:48:58,410 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [96 Valid, 302 Invalid, 573 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [151 Valid, 422 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2022-04-14 14:48:58,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2022-04-14 14:48:58,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 178. [2022-04-14 14:48:58,643 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 14:48:58,643 INFO L82 GeneralOperation]: Start isEquivalent. First operand 227 states. Second operand has 178 states, 97 states have (on average 1.2164948453608246) internal successors, (118), 100 states have internal predecessors, (118), 69 states have call successors, (69), 12 states have call predecessors, (69), 11 states have return successors, (67), 65 states have call predecessors, (67), 67 states have call successors, (67) [2022-04-14 14:48:58,644 INFO L74 IsIncluded]: Start isIncluded. First operand 227 states. Second operand has 178 states, 97 states have (on average 1.2164948453608246) internal successors, (118), 100 states have internal predecessors, (118), 69 states have call successors, (69), 12 states have call predecessors, (69), 11 states have return successors, (67), 65 states have call predecessors, (67), 67 states have call successors, (67) [2022-04-14 14:48:58,644 INFO L87 Difference]: Start difference. First operand 227 states. Second operand has 178 states, 97 states have (on average 1.2164948453608246) internal successors, (118), 100 states have internal predecessors, (118), 69 states have call successors, (69), 12 states have call predecessors, (69), 11 states have return successors, (67), 65 states have call predecessors, (67), 67 states have call successors, (67) [2022-04-14 14:48:58,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:48:58,654 INFO L93 Difference]: Finished difference Result 227 states and 333 transitions. [2022-04-14 14:48:58,654 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 333 transitions. [2022-04-14 14:48:58,655 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 14:48:58,655 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 14:48:58,656 INFO L74 IsIncluded]: Start isIncluded. First operand has 178 states, 97 states have (on average 1.2164948453608246) internal successors, (118), 100 states have internal predecessors, (118), 69 states have call successors, (69), 12 states have call predecessors, (69), 11 states have return successors, (67), 65 states have call predecessors, (67), 67 states have call successors, (67) Second operand 227 states. [2022-04-14 14:48:58,656 INFO L87 Difference]: Start difference. First operand has 178 states, 97 states have (on average 1.2164948453608246) internal successors, (118), 100 states have internal predecessors, (118), 69 states have call successors, (69), 12 states have call predecessors, (69), 11 states have return successors, (67), 65 states have call predecessors, (67), 67 states have call successors, (67) Second operand 227 states. [2022-04-14 14:48:58,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:48:58,667 INFO L93 Difference]: Finished difference Result 227 states and 333 transitions. [2022-04-14 14:48:58,667 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 333 transitions. [2022-04-14 14:48:58,668 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 14:48:58,668 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 14:48:58,668 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 14:48:58,668 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 14:48:58,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 97 states have (on average 1.2164948453608246) internal successors, (118), 100 states have internal predecessors, (118), 69 states have call successors, (69), 12 states have call predecessors, (69), 11 states have return successors, (67), 65 states have call predecessors, (67), 67 states have call successors, (67) [2022-04-14 14:48:58,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 254 transitions. [2022-04-14 14:48:58,676 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 254 transitions. Word has length 69 [2022-04-14 14:48:58,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 14:48:58,677 INFO L478 AbstractCegarLoop]: Abstraction has 178 states and 254 transitions. [2022-04-14 14:48:58,677 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.2) internal successors, (33), 13 states have internal predecessors, (33), 8 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (21), 8 states have call predecessors, (21), 8 states have call successors, (21) [2022-04-14 14:48:58,677 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 254 transitions. [2022-04-14 14:48:58,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-04-14 14:48:58,678 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 14:48:58,678 INFO L499 BasicCegarLoop]: trace histogram [8, 7, 7, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 14:48:58,701 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-14 14:48:58,891 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-04-14 14:48:58,891 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 14:48:58,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 14:48:58,892 INFO L85 PathProgramCache]: Analyzing trace with hash -1763593091, now seen corresponding path program 3 times [2022-04-14 14:48:58,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 14:48:58,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177125726] [2022-04-14 14:48:58,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 14:48:58,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 14:48:58,904 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 14:48:58,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2072970825] [2022-04-14 14:48:58,904 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-14 14:48:58,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 14:48:58,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 14:48:58,907 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-14 14:48:58,927 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-14 14:48:58,969 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-04-14 14:48:58,969 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-14 14:48:58,971 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 38 conjunts are in the unsatisfiable core [2022-04-14 14:48:58,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:48:58,995 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 14:48:59,593 INFO L272 TraceCheckUtils]: 0: Hoare triple {5804#true} call ULTIMATE.init(); {5804#true} is VALID [2022-04-14 14:48:59,593 INFO L290 TraceCheckUtils]: 1: Hoare triple {5804#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(11, 2);call #Ultimate.allocInit(12, 3); {5804#true} is VALID [2022-04-14 14:48:59,593 INFO L290 TraceCheckUtils]: 2: Hoare triple {5804#true} assume true; {5804#true} is VALID [2022-04-14 14:48:59,593 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5804#true} {5804#true} #96#return; {5804#true} is VALID [2022-04-14 14:48:59,593 INFO L272 TraceCheckUtils]: 4: Hoare triple {5804#true} call #t~ret6 := main(); {5804#true} is VALID [2022-04-14 14:48:59,593 INFO L290 TraceCheckUtils]: 5: Hoare triple {5804#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~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; {5804#true} is VALID [2022-04-14 14:48:59,593 INFO L272 TraceCheckUtils]: 6: Hoare triple {5804#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {5804#true} is VALID [2022-04-14 14:48:59,593 INFO L290 TraceCheckUtils]: 7: Hoare triple {5804#true} ~cond := #in~cond; {5804#true} is VALID [2022-04-14 14:48:59,593 INFO L290 TraceCheckUtils]: 8: Hoare triple {5804#true} assume !(0 == ~cond); {5804#true} is VALID [2022-04-14 14:48:59,593 INFO L290 TraceCheckUtils]: 9: Hoare triple {5804#true} assume true; {5804#true} is VALID [2022-04-14 14:48:59,593 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5804#true} {5804#true} #76#return; {5804#true} is VALID [2022-04-14 14:48:59,594 INFO L272 TraceCheckUtils]: 11: Hoare triple {5804#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {5804#true} is VALID [2022-04-14 14:48:59,594 INFO L290 TraceCheckUtils]: 12: Hoare triple {5804#true} ~cond := #in~cond; {5804#true} is VALID [2022-04-14 14:48:59,594 INFO L290 TraceCheckUtils]: 13: Hoare triple {5804#true} assume !(0 == ~cond); {5804#true} is VALID [2022-04-14 14:48:59,594 INFO L290 TraceCheckUtils]: 14: Hoare triple {5804#true} assume true; {5804#true} is VALID [2022-04-14 14:48:59,594 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {5804#true} {5804#true} #78#return; {5804#true} is VALID [2022-04-14 14:48:59,594 INFO L290 TraceCheckUtils]: 16: Hoare triple {5804#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {5857#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} is VALID [2022-04-14 14:48:59,594 INFO L272 TraceCheckUtils]: 17: Hoare triple {5857#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {5804#true} is VALID [2022-04-14 14:48:59,594 INFO L290 TraceCheckUtils]: 18: Hoare triple {5804#true} ~cond := #in~cond; {5804#true} is VALID [2022-04-14 14:48:59,594 INFO L290 TraceCheckUtils]: 19: Hoare triple {5804#true} assume !(0 == ~cond); {5804#true} is VALID [2022-04-14 14:48:59,595 INFO L290 TraceCheckUtils]: 20: Hoare triple {5804#true} assume true; {5804#true} is VALID [2022-04-14 14:48:59,595 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {5804#true} {5857#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} #80#return; {5857#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} is VALID [2022-04-14 14:48:59,595 INFO L272 TraceCheckUtils]: 22: Hoare triple {5857#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {5804#true} is VALID [2022-04-14 14:48:59,595 INFO L290 TraceCheckUtils]: 23: Hoare triple {5804#true} ~cond := #in~cond; {5804#true} is VALID [2022-04-14 14:48:59,595 INFO L290 TraceCheckUtils]: 24: Hoare triple {5804#true} assume !(0 == ~cond); {5804#true} is VALID [2022-04-14 14:48:59,595 INFO L290 TraceCheckUtils]: 25: Hoare triple {5804#true} assume true; {5804#true} is VALID [2022-04-14 14:48:59,596 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {5804#true} {5857#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} #82#return; {5857#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} is VALID [2022-04-14 14:48:59,596 INFO L290 TraceCheckUtils]: 27: Hoare triple {5857#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} assume !false; {5857#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} is VALID [2022-04-14 14:48:59,597 INFO L290 TraceCheckUtils]: 28: Hoare triple {5857#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {5894#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0))} is VALID [2022-04-14 14:48:59,597 INFO L290 TraceCheckUtils]: 29: Hoare triple {5894#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0))} assume !false; {5894#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0))} is VALID [2022-04-14 14:48:59,597 INFO L272 TraceCheckUtils]: 30: Hoare triple {5894#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {5804#true} is VALID [2022-04-14 14:48:59,597 INFO L290 TraceCheckUtils]: 31: Hoare triple {5804#true} ~cond := #in~cond; {5804#true} is VALID [2022-04-14 14:48:59,598 INFO L290 TraceCheckUtils]: 32: Hoare triple {5804#true} assume !(0 == ~cond); {5804#true} is VALID [2022-04-14 14:48:59,598 INFO L290 TraceCheckUtils]: 33: Hoare triple {5804#true} assume true; {5804#true} is VALID [2022-04-14 14:48:59,598 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {5804#true} {5894#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0))} #84#return; {5894#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0))} is VALID [2022-04-14 14:48:59,598 INFO L272 TraceCheckUtils]: 35: Hoare triple {5894#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {5804#true} is VALID [2022-04-14 14:48:59,598 INFO L290 TraceCheckUtils]: 36: Hoare triple {5804#true} ~cond := #in~cond; {5804#true} is VALID [2022-04-14 14:48:59,598 INFO L290 TraceCheckUtils]: 37: Hoare triple {5804#true} assume !(0 == ~cond); {5804#true} is VALID [2022-04-14 14:48:59,599 INFO L290 TraceCheckUtils]: 38: Hoare triple {5804#true} assume true; {5804#true} is VALID [2022-04-14 14:48:59,599 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {5804#true} {5894#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0))} #86#return; {5894#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0))} is VALID [2022-04-14 14:48:59,599 INFO L272 TraceCheckUtils]: 40: Hoare triple {5894#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {5804#true} is VALID [2022-04-14 14:48:59,599 INFO L290 TraceCheckUtils]: 41: Hoare triple {5804#true} ~cond := #in~cond; {5804#true} is VALID [2022-04-14 14:48:59,599 INFO L290 TraceCheckUtils]: 42: Hoare triple {5804#true} assume !(0 == ~cond); {5804#true} is VALID [2022-04-14 14:48:59,600 INFO L290 TraceCheckUtils]: 43: Hoare triple {5804#true} assume true; {5804#true} is VALID [2022-04-14 14:48:59,603 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {5804#true} {5894#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0))} #88#return; {5894#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0))} is VALID [2022-04-14 14:48:59,604 INFO L272 TraceCheckUtils]: 45: Hoare triple {5894#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {5804#true} is VALID [2022-04-14 14:48:59,604 INFO L290 TraceCheckUtils]: 46: Hoare triple {5804#true} ~cond := #in~cond; {5804#true} is VALID [2022-04-14 14:48:59,604 INFO L290 TraceCheckUtils]: 47: Hoare triple {5804#true} assume !(0 == ~cond); {5804#true} is VALID [2022-04-14 14:48:59,604 INFO L290 TraceCheckUtils]: 48: Hoare triple {5804#true} assume true; {5804#true} is VALID [2022-04-14 14:48:59,605 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {5804#true} {5894#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0))} #90#return; {5894#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0))} is VALID [2022-04-14 14:48:59,605 INFO L290 TraceCheckUtils]: 50: Hoare triple {5894#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0))} assume !(~c~0 >= ~b~0); {5894#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0))} is VALID [2022-04-14 14:48:59,606 INFO L290 TraceCheckUtils]: 51: Hoare triple {5894#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {5964#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-14 14:48:59,606 INFO L290 TraceCheckUtils]: 52: Hoare triple {5964#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} assume !false; {5964#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-14 14:48:59,606 INFO L290 TraceCheckUtils]: 53: Hoare triple {5964#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {5964#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-14 14:48:59,607 INFO L290 TraceCheckUtils]: 54: Hoare triple {5964#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} assume !false; {5964#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-14 14:48:59,607 INFO L272 TraceCheckUtils]: 55: Hoare triple {5964#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {5804#true} is VALID [2022-04-14 14:48:59,607 INFO L290 TraceCheckUtils]: 56: Hoare triple {5804#true} ~cond := #in~cond; {5804#true} is VALID [2022-04-14 14:48:59,607 INFO L290 TraceCheckUtils]: 57: Hoare triple {5804#true} assume !(0 == ~cond); {5804#true} is VALID [2022-04-14 14:48:59,607 INFO L290 TraceCheckUtils]: 58: Hoare triple {5804#true} assume true; {5804#true} is VALID [2022-04-14 14:48:59,608 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {5804#true} {5964#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #84#return; {5964#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-14 14:48:59,608 INFO L272 TraceCheckUtils]: 60: Hoare triple {5964#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {5804#true} is VALID [2022-04-14 14:48:59,608 INFO L290 TraceCheckUtils]: 61: Hoare triple {5804#true} ~cond := #in~cond; {5804#true} is VALID [2022-04-14 14:48:59,608 INFO L290 TraceCheckUtils]: 62: Hoare triple {5804#true} assume !(0 == ~cond); {5804#true} is VALID [2022-04-14 14:48:59,608 INFO L290 TraceCheckUtils]: 63: Hoare triple {5804#true} assume true; {5804#true} is VALID [2022-04-14 14:48:59,608 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {5804#true} {5964#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #86#return; {5964#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-14 14:48:59,609 INFO L272 TraceCheckUtils]: 65: Hoare triple {5964#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {5804#true} is VALID [2022-04-14 14:48:59,609 INFO L290 TraceCheckUtils]: 66: Hoare triple {5804#true} ~cond := #in~cond; {6010#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-14 14:48:59,609 INFO L290 TraceCheckUtils]: 67: Hoare triple {6010#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {6014#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 14:48:59,609 INFO L290 TraceCheckUtils]: 68: Hoare triple {6014#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {6014#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 14:48:59,610 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {6014#(not (= |__VERIFIER_assert_#in~cond| 0))} {5964#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #88#return; {6021#(and (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~b~0 main_~x~0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-14 14:48:59,613 INFO L272 TraceCheckUtils]: 70: Hoare triple {6021#(and (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~b~0 main_~x~0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {6025#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 14:48:59,613 INFO L290 TraceCheckUtils]: 71: Hoare triple {6025#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6029#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 14:48:59,613 INFO L290 TraceCheckUtils]: 72: Hoare triple {6029#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5805#false} is VALID [2022-04-14 14:48:59,613 INFO L290 TraceCheckUtils]: 73: Hoare triple {5805#false} assume !false; {5805#false} is VALID [2022-04-14 14:48:59,614 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 31 proven. 8 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2022-04-14 14:48:59,614 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 14:49:56,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 14:49:56,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177125726] [2022-04-14 14:49:56,509 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 14:49:56,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2072970825] [2022-04-14 14:49:56,509 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2072970825] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-14 14:49:56,510 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-14 14:49:56,510 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2022-04-14 14:49:56,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762939341] [2022-04-14 14:49:56,510 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-14 14:49:56,510 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 5 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 5 states have call predecessors, (12), 4 states have call successors, (12) Word has length 74 [2022-04-14 14:49:56,510 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 14:49:56,511 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 5 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 5 states have call predecessors, (12), 4 states have call successors, (12) [2022-04-14 14:49:56,552 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 14:49:56,553 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-14 14:49:56,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 14:49:56,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-14 14:49:56,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2022-04-14 14:49:56,553 INFO L87 Difference]: Start difference. First operand 178 states and 254 transitions. Second operand has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 5 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 5 states have call predecessors, (12), 4 states have call successors, (12) [2022-04-14 14:49:57,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:49:57,786 INFO L93 Difference]: Finished difference Result 210 states and 293 transitions. [2022-04-14 14:49:57,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-14 14:49:57,786 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 5 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 5 states have call predecessors, (12), 4 states have call successors, (12) Word has length 74 [2022-04-14 14:49:57,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 14:49:57,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 5 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 5 states have call predecessors, (12), 4 states have call successors, (12) [2022-04-14 14:49:57,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 91 transitions. [2022-04-14 14:49:57,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 5 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 5 states have call predecessors, (12), 4 states have call successors, (12) [2022-04-14 14:49:57,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 91 transitions. [2022-04-14 14:49:57,790 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 91 transitions. [2022-04-14 14:49:57,902 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 14:49:57,906 INFO L225 Difference]: With dead ends: 210 [2022-04-14 14:49:57,907 INFO L226 Difference]: Without dead ends: 208 [2022-04-14 14:49:57,908 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 67 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2022-04-14 14:49:57,908 INFO L913 BasicCegarLoop]: 38 mSDtfsCounter, 21 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-14 14:49:57,908 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 178 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-14 14:49:57,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2022-04-14 14:49:58,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 205. [2022-04-14 14:49:58,171 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 14:49:58,171 INFO L82 GeneralOperation]: Start isEquivalent. First operand 208 states. Second operand has 205 states, 113 states have (on average 1.2035398230088497) internal successors, (136), 116 states have internal predecessors, (136), 77 states have call successors, (77), 15 states have call predecessors, (77), 14 states have return successors, (75), 73 states have call predecessors, (75), 75 states have call successors, (75) [2022-04-14 14:49:58,172 INFO L74 IsIncluded]: Start isIncluded. First operand 208 states. Second operand has 205 states, 113 states have (on average 1.2035398230088497) internal successors, (136), 116 states have internal predecessors, (136), 77 states have call successors, (77), 15 states have call predecessors, (77), 14 states have return successors, (75), 73 states have call predecessors, (75), 75 states have call successors, (75) [2022-04-14 14:49:58,172 INFO L87 Difference]: Start difference. First operand 208 states. Second operand has 205 states, 113 states have (on average 1.2035398230088497) internal successors, (136), 116 states have internal predecessors, (136), 77 states have call successors, (77), 15 states have call predecessors, (77), 14 states have return successors, (75), 73 states have call predecessors, (75), 75 states have call successors, (75) [2022-04-14 14:49:58,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:49:58,180 INFO L93 Difference]: Finished difference Result 208 states and 291 transitions. [2022-04-14 14:49:58,180 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 291 transitions. [2022-04-14 14:49:58,181 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 14:49:58,181 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 14:49:58,182 INFO L74 IsIncluded]: Start isIncluded. First operand has 205 states, 113 states have (on average 1.2035398230088497) internal successors, (136), 116 states have internal predecessors, (136), 77 states have call successors, (77), 15 states have call predecessors, (77), 14 states have return successors, (75), 73 states have call predecessors, (75), 75 states have call successors, (75) Second operand 208 states. [2022-04-14 14:49:58,182 INFO L87 Difference]: Start difference. First operand has 205 states, 113 states have (on average 1.2035398230088497) internal successors, (136), 116 states have internal predecessors, (136), 77 states have call successors, (77), 15 states have call predecessors, (77), 14 states have return successors, (75), 73 states have call predecessors, (75), 75 states have call successors, (75) Second operand 208 states. [2022-04-14 14:49:58,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:49:58,203 INFO L93 Difference]: Finished difference Result 208 states and 291 transitions. [2022-04-14 14:49:58,203 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 291 transitions. [2022-04-14 14:49:58,204 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 14:49:58,204 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 14:49:58,204 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 14:49:58,204 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 14:49:58,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 113 states have (on average 1.2035398230088497) internal successors, (136), 116 states have internal predecessors, (136), 77 states have call successors, (77), 15 states have call predecessors, (77), 14 states have return successors, (75), 73 states have call predecessors, (75), 75 states have call successors, (75) [2022-04-14 14:49:58,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 288 transitions. [2022-04-14 14:49:58,212 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 288 transitions. Word has length 74 [2022-04-14 14:49:58,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 14:49:58,212 INFO L478 AbstractCegarLoop]: Abstraction has 205 states and 288 transitions. [2022-04-14 14:49:58,212 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 5 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 5 states have call predecessors, (12), 4 states have call successors, (12) [2022-04-14 14:49:58,212 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 288 transitions. [2022-04-14 14:49:58,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-04-14 14:49:58,213 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 14:49:58,213 INFO L499 BasicCegarLoop]: trace histogram [9, 8, 8, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 14:49:58,234 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-14 14:49:58,426 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-04-14 14:49:58,427 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 14:49:58,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 14:49:58,427 INFO L85 PathProgramCache]: Analyzing trace with hash 815826741, now seen corresponding path program 1 times [2022-04-14 14:49:58,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 14:49:58,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717326387] [2022-04-14 14:49:58,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 14:49:58,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 14:49:58,439 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 14:49:58,439 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1375303075] [2022-04-14 14:49:58,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 14:49:58,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 14:49:58,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 14:49:58,440 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-14 14:49:58,447 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-14 14:49:58,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:49:58,502 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 40 conjunts are in the unsatisfiable core [2022-04-14 14:49:58,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:49:58,517 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 14:49:59,150 INFO L272 TraceCheckUtils]: 0: Hoare triple {7133#true} call ULTIMATE.init(); {7133#true} is VALID [2022-04-14 14:49:59,150 INFO L290 TraceCheckUtils]: 1: Hoare triple {7133#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(11, 2);call #Ultimate.allocInit(12, 3); {7133#true} is VALID [2022-04-14 14:49:59,150 INFO L290 TraceCheckUtils]: 2: Hoare triple {7133#true} assume true; {7133#true} is VALID [2022-04-14 14:49:59,150 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7133#true} {7133#true} #96#return; {7133#true} is VALID [2022-04-14 14:49:59,150 INFO L272 TraceCheckUtils]: 4: Hoare triple {7133#true} call #t~ret6 := main(); {7133#true} is VALID [2022-04-14 14:49:59,150 INFO L290 TraceCheckUtils]: 5: Hoare triple {7133#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~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; {7133#true} is VALID [2022-04-14 14:49:59,151 INFO L272 TraceCheckUtils]: 6: Hoare triple {7133#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {7133#true} is VALID [2022-04-14 14:49:59,151 INFO L290 TraceCheckUtils]: 7: Hoare triple {7133#true} ~cond := #in~cond; {7133#true} is VALID [2022-04-14 14:49:59,151 INFO L290 TraceCheckUtils]: 8: Hoare triple {7133#true} assume !(0 == ~cond); {7133#true} is VALID [2022-04-14 14:49:59,151 INFO L290 TraceCheckUtils]: 9: Hoare triple {7133#true} assume true; {7133#true} is VALID [2022-04-14 14:49:59,151 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7133#true} {7133#true} #76#return; {7133#true} is VALID [2022-04-14 14:49:59,151 INFO L272 TraceCheckUtils]: 11: Hoare triple {7133#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {7133#true} is VALID [2022-04-14 14:49:59,151 INFO L290 TraceCheckUtils]: 12: Hoare triple {7133#true} ~cond := #in~cond; {7133#true} is VALID [2022-04-14 14:49:59,151 INFO L290 TraceCheckUtils]: 13: Hoare triple {7133#true} assume !(0 == ~cond); {7133#true} is VALID [2022-04-14 14:49:59,151 INFO L290 TraceCheckUtils]: 14: Hoare triple {7133#true} assume true; {7133#true} is VALID [2022-04-14 14:49:59,151 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {7133#true} {7133#true} #78#return; {7133#true} is VALID [2022-04-14 14:49:59,152 INFO L290 TraceCheckUtils]: 16: Hoare triple {7133#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {7186#(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-14 14:49:59,152 INFO L272 TraceCheckUtils]: 17: Hoare triple {7186#(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 assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {7133#true} is VALID [2022-04-14 14:49:59,152 INFO L290 TraceCheckUtils]: 18: Hoare triple {7133#true} ~cond := #in~cond; {7133#true} is VALID [2022-04-14 14:49:59,152 INFO L290 TraceCheckUtils]: 19: Hoare triple {7133#true} assume !(0 == ~cond); {7133#true} is VALID [2022-04-14 14:49:59,152 INFO L290 TraceCheckUtils]: 20: Hoare triple {7133#true} assume true; {7133#true} is VALID [2022-04-14 14:49:59,153 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {7133#true} {7186#(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))} #80#return; {7186#(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-14 14:49:59,153 INFO L272 TraceCheckUtils]: 22: Hoare triple {7186#(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 assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {7133#true} is VALID [2022-04-14 14:49:59,153 INFO L290 TraceCheckUtils]: 23: Hoare triple {7133#true} ~cond := #in~cond; {7133#true} is VALID [2022-04-14 14:49:59,153 INFO L290 TraceCheckUtils]: 24: Hoare triple {7133#true} assume !(0 == ~cond); {7133#true} is VALID [2022-04-14 14:49:59,153 INFO L290 TraceCheckUtils]: 25: Hoare triple {7133#true} assume true; {7133#true} is VALID [2022-04-14 14:49:59,154 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {7133#true} {7186#(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))} #82#return; {7186#(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-14 14:49:59,155 INFO L290 TraceCheckUtils]: 27: Hoare triple {7186#(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 !false; {7186#(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-14 14:49:59,155 INFO L290 TraceCheckUtils]: 28: Hoare triple {7186#(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 !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {7223#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 14:49:59,155 INFO L290 TraceCheckUtils]: 29: Hoare triple {7223#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} assume !false; {7223#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 14:49:59,156 INFO L272 TraceCheckUtils]: 30: Hoare triple {7223#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {7133#true} is VALID [2022-04-14 14:49:59,156 INFO L290 TraceCheckUtils]: 31: Hoare triple {7133#true} ~cond := #in~cond; {7133#true} is VALID [2022-04-14 14:49:59,156 INFO L290 TraceCheckUtils]: 32: Hoare triple {7133#true} assume !(0 == ~cond); {7133#true} is VALID [2022-04-14 14:49:59,156 INFO L290 TraceCheckUtils]: 33: Hoare triple {7133#true} assume true; {7133#true} is VALID [2022-04-14 14:49:59,157 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {7133#true} {7223#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #84#return; {7223#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 14:49:59,157 INFO L272 TraceCheckUtils]: 35: Hoare triple {7223#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~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)); {7133#true} is VALID [2022-04-14 14:49:59,157 INFO L290 TraceCheckUtils]: 36: Hoare triple {7133#true} ~cond := #in~cond; {7133#true} is VALID [2022-04-14 14:49:59,157 INFO L290 TraceCheckUtils]: 37: Hoare triple {7133#true} assume !(0 == ~cond); {7133#true} is VALID [2022-04-14 14:49:59,157 INFO L290 TraceCheckUtils]: 38: Hoare triple {7133#true} assume true; {7133#true} is VALID [2022-04-14 14:49:59,158 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {7133#true} {7223#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #86#return; {7223#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 14:49:59,158 INFO L272 TraceCheckUtils]: 40: Hoare triple {7223#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~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)); {7133#true} is VALID [2022-04-14 14:49:59,158 INFO L290 TraceCheckUtils]: 41: Hoare triple {7133#true} ~cond := #in~cond; {7133#true} is VALID [2022-04-14 14:49:59,158 INFO L290 TraceCheckUtils]: 42: Hoare triple {7133#true} assume !(0 == ~cond); {7133#true} is VALID [2022-04-14 14:49:59,158 INFO L290 TraceCheckUtils]: 43: Hoare triple {7133#true} assume true; {7133#true} is VALID [2022-04-14 14:49:59,159 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {7133#true} {7223#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #88#return; {7223#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 14:49:59,159 INFO L272 TraceCheckUtils]: 45: Hoare triple {7223#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {7133#true} is VALID [2022-04-14 14:49:59,159 INFO L290 TraceCheckUtils]: 46: Hoare triple {7133#true} ~cond := #in~cond; {7133#true} is VALID [2022-04-14 14:49:59,159 INFO L290 TraceCheckUtils]: 47: Hoare triple {7133#true} assume !(0 == ~cond); {7133#true} is VALID [2022-04-14 14:49:59,159 INFO L290 TraceCheckUtils]: 48: Hoare triple {7133#true} assume true; {7133#true} is VALID [2022-04-14 14:49:59,160 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {7133#true} {7223#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #90#return; {7223#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 14:49:59,160 INFO L290 TraceCheckUtils]: 50: Hoare triple {7223#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {7290#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~b~0 main_~y~0) (= main_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-14 14:49:59,161 INFO L290 TraceCheckUtils]: 51: Hoare triple {7290#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~b~0 main_~y~0) (= main_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} assume !false; {7290#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~b~0 main_~y~0) (= main_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-14 14:49:59,161 INFO L272 TraceCheckUtils]: 52: Hoare triple {7290#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~b~0 main_~y~0) (= main_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {7133#true} is VALID [2022-04-14 14:49:59,161 INFO L290 TraceCheckUtils]: 53: Hoare triple {7133#true} ~cond := #in~cond; {7133#true} is VALID [2022-04-14 14:49:59,161 INFO L290 TraceCheckUtils]: 54: Hoare triple {7133#true} assume !(0 == ~cond); {7133#true} is VALID [2022-04-14 14:49:59,161 INFO L290 TraceCheckUtils]: 55: Hoare triple {7133#true} assume true; {7133#true} is VALID [2022-04-14 14:49:59,162 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {7133#true} {7290#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~b~0 main_~y~0) (= main_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} #84#return; {7290#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~b~0 main_~y~0) (= main_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-14 14:49:59,162 INFO L272 TraceCheckUtils]: 57: Hoare triple {7290#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~b~0 main_~y~0) (= main_~k~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)); {7133#true} is VALID [2022-04-14 14:49:59,162 INFO L290 TraceCheckUtils]: 58: Hoare triple {7133#true} ~cond := #in~cond; {7133#true} is VALID [2022-04-14 14:49:59,162 INFO L290 TraceCheckUtils]: 59: Hoare triple {7133#true} assume !(0 == ~cond); {7133#true} is VALID [2022-04-14 14:49:59,162 INFO L290 TraceCheckUtils]: 60: Hoare triple {7133#true} assume true; {7133#true} is VALID [2022-04-14 14:49:59,163 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {7133#true} {7290#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~b~0 main_~y~0) (= main_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} #86#return; {7290#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~b~0 main_~y~0) (= main_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-14 14:49:59,163 INFO L272 TraceCheckUtils]: 62: Hoare triple {7290#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~b~0 main_~y~0) (= main_~k~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)); {7133#true} is VALID [2022-04-14 14:49:59,164 INFO L290 TraceCheckUtils]: 63: Hoare triple {7133#true} ~cond := #in~cond; {7330#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-14 14:49:59,164 INFO L290 TraceCheckUtils]: 64: Hoare triple {7330#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {7334#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 14:49:59,164 INFO L290 TraceCheckUtils]: 65: Hoare triple {7334#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {7334#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 14:49:59,165 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {7334#(not (= |__VERIFIER_assert_#in~cond| 0))} {7290#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~b~0 main_~y~0) (= main_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} #88#return; {7341#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~k~0 1) (= main_~q~0 0) (= main_~x~0 (+ (* main_~q~0 main_~x~0) main_~c~0 (* main_~y~0 main_~s~0))) (= main_~p~0 1))} is VALID [2022-04-14 14:49:59,165 INFO L272 TraceCheckUtils]: 67: Hoare triple {7341#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~k~0 1) (= main_~q~0 0) (= main_~x~0 (+ (* main_~q~0 main_~x~0) main_~c~0 (* main_~y~0 main_~s~0))) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {7133#true} is VALID [2022-04-14 14:49:59,165 INFO L290 TraceCheckUtils]: 68: Hoare triple {7133#true} ~cond := #in~cond; {7133#true} is VALID [2022-04-14 14:49:59,165 INFO L290 TraceCheckUtils]: 69: Hoare triple {7133#true} assume !(0 == ~cond); {7133#true} is VALID [2022-04-14 14:49:59,166 INFO L290 TraceCheckUtils]: 70: Hoare triple {7133#true} assume true; {7133#true} is VALID [2022-04-14 14:49:59,166 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {7133#true} {7341#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~k~0 1) (= main_~q~0 0) (= main_~x~0 (+ (* main_~q~0 main_~x~0) main_~c~0 (* main_~y~0 main_~s~0))) (= main_~p~0 1))} #90#return; {7341#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~k~0 1) (= main_~q~0 0) (= main_~x~0 (+ (* main_~q~0 main_~x~0) main_~c~0 (* main_~y~0 main_~s~0))) (= main_~p~0 1))} is VALID [2022-04-14 14:49:59,167 INFO L290 TraceCheckUtils]: 72: Hoare triple {7341#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~k~0 1) (= main_~q~0 0) (= main_~x~0 (+ (* main_~q~0 main_~x~0) main_~c~0 (* main_~y~0 main_~s~0))) (= main_~p~0 1))} assume !(~c~0 >= ~b~0); {7341#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~k~0 1) (= main_~q~0 0) (= main_~x~0 (+ (* main_~q~0 main_~x~0) main_~c~0 (* main_~y~0 main_~s~0))) (= main_~p~0 1))} is VALID [2022-04-14 14:49:59,167 INFO L290 TraceCheckUtils]: 73: Hoare triple {7341#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~k~0 1) (= main_~q~0 0) (= main_~x~0 (+ (* main_~q~0 main_~x~0) main_~c~0 (* main_~y~0 main_~s~0))) (= main_~p~0 1))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {7363#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~q~0 1) (= (+ main_~s~0 1) 0))} is VALID [2022-04-14 14:49:59,168 INFO L290 TraceCheckUtils]: 74: Hoare triple {7363#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~q~0 1) (= (+ main_~s~0 1) 0))} assume !false; {7363#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~q~0 1) (= (+ main_~s~0 1) 0))} is VALID [2022-04-14 14:49:59,168 INFO L290 TraceCheckUtils]: 75: Hoare triple {7363#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~q~0 1) (= (+ main_~s~0 1) 0))} assume !(0 != ~b~0); {7370#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) 0) (= main_~q~0 1) (= (+ main_~s~0 1) 0))} is VALID [2022-04-14 14:49:59,169 INFO L272 TraceCheckUtils]: 76: Hoare triple {7370#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) 0) (= main_~q~0 1) (= (+ main_~s~0 1) 0))} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {7374#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 14:49:59,169 INFO L290 TraceCheckUtils]: 77: Hoare triple {7374#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7378#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 14:49:59,169 INFO L290 TraceCheckUtils]: 78: Hoare triple {7378#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7134#false} is VALID [2022-04-14 14:49:59,170 INFO L290 TraceCheckUtils]: 79: Hoare triple {7134#false} assume !false; {7134#false} is VALID [2022-04-14 14:49:59,171 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 33 proven. 12 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2022-04-14 14:49:59,171 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 14:50:49,965 INFO L290 TraceCheckUtils]: 79: Hoare triple {7134#false} assume !false; {7134#false} is VALID [2022-04-14 14:50:49,966 INFO L290 TraceCheckUtils]: 78: Hoare triple {7378#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7134#false} is VALID [2022-04-14 14:50:49,967 INFO L290 TraceCheckUtils]: 77: Hoare triple {7374#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7378#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 14:50:49,967 INFO L272 TraceCheckUtils]: 76: Hoare triple {7394#(= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) 0)} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {7374#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 14:50:49,968 INFO L290 TraceCheckUtils]: 75: Hoare triple {7398#(or (not (= main_~b~0 0)) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) 0))} assume !(0 != ~b~0); {7394#(= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) 0)} is VALID [2022-04-14 14:50:49,968 INFO L290 TraceCheckUtils]: 74: Hoare triple {7398#(or (not (= main_~b~0 0)) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) 0))} assume !false; {7398#(or (not (= main_~b~0 0)) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) 0))} is VALID [2022-04-14 14:50:51,970 WARN L290 TraceCheckUtils]: 73: Hoare triple {7405#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (- 1) main_~k~0 main_~s~0) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) 0))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {7398#(or (not (= main_~b~0 0)) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) 0))} is UNKNOWN [2022-04-14 14:50:51,971 INFO L290 TraceCheckUtils]: 72: Hoare triple {7405#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (- 1) main_~k~0 main_~s~0) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) 0))} assume !(~c~0 >= ~b~0); {7405#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (- 1) main_~k~0 main_~s~0) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) 0))} is VALID [2022-04-14 14:50:51,972 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {7133#true} {7405#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (- 1) main_~k~0 main_~s~0) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) 0))} #90#return; {7405#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (- 1) main_~k~0 main_~s~0) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) 0))} is VALID [2022-04-14 14:50:51,972 INFO L290 TraceCheckUtils]: 70: Hoare triple {7133#true} assume true; {7133#true} is VALID [2022-04-14 14:50:51,972 INFO L290 TraceCheckUtils]: 69: Hoare triple {7133#true} assume !(0 == ~cond); {7133#true} is VALID [2022-04-14 14:50:51,972 INFO L290 TraceCheckUtils]: 68: Hoare triple {7133#true} ~cond := #in~cond; {7133#true} is VALID [2022-04-14 14:50:51,972 INFO L272 TraceCheckUtils]: 67: Hoare triple {7405#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (- 1) main_~k~0 main_~s~0) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) 0))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {7133#true} is VALID [2022-04-14 14:50:51,973 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {7334#(not (= |__VERIFIER_assert_#in~cond| 0))} {7427#(or (not (= main_~c~0 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* (+ (* (- 1) main_~k~0 main_~s~0) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) 0))} #88#return; {7405#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (- 1) main_~k~0 main_~s~0) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) 0))} is VALID [2022-04-14 14:50:51,973 INFO L290 TraceCheckUtils]: 65: Hoare triple {7334#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {7334#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 14:50:51,973 INFO L290 TraceCheckUtils]: 64: Hoare triple {7437#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {7334#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 14:50:51,974 INFO L290 TraceCheckUtils]: 63: Hoare triple {7133#true} ~cond := #in~cond; {7437#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-14 14:50:51,974 INFO L272 TraceCheckUtils]: 62: Hoare triple {7427#(or (not (= main_~c~0 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* (+ (* (- 1) main_~k~0 main_~s~0) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) 0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {7133#true} is VALID [2022-04-14 14:50:51,974 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {7133#true} {7427#(or (not (= main_~c~0 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* (+ (* (- 1) main_~k~0 main_~s~0) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) 0))} #86#return; {7427#(or (not (= main_~c~0 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* (+ (* (- 1) main_~k~0 main_~s~0) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) 0))} is VALID [2022-04-14 14:50:51,975 INFO L290 TraceCheckUtils]: 60: Hoare triple {7133#true} assume true; {7133#true} is VALID [2022-04-14 14:50:51,975 INFO L290 TraceCheckUtils]: 59: Hoare triple {7133#true} assume !(0 == ~cond); {7133#true} is VALID [2022-04-14 14:50:51,975 INFO L290 TraceCheckUtils]: 58: Hoare triple {7133#true} ~cond := #in~cond; {7133#true} is VALID [2022-04-14 14:50:51,975 INFO L272 TraceCheckUtils]: 57: Hoare triple {7427#(or (not (= main_~c~0 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* (+ (* (- 1) main_~k~0 main_~s~0) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) 0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {7133#true} is VALID [2022-04-14 14:50:51,975 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {7133#true} {7427#(or (not (= main_~c~0 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* (+ (* (- 1) main_~k~0 main_~s~0) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) 0))} #84#return; {7427#(or (not (= main_~c~0 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* (+ (* (- 1) main_~k~0 main_~s~0) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) 0))} is VALID [2022-04-14 14:50:51,976 INFO L290 TraceCheckUtils]: 55: Hoare triple {7133#true} assume true; {7133#true} is VALID [2022-04-14 14:50:51,976 INFO L290 TraceCheckUtils]: 54: Hoare triple {7133#true} assume !(0 == ~cond); {7133#true} is VALID [2022-04-14 14:50:51,976 INFO L290 TraceCheckUtils]: 53: Hoare triple {7133#true} ~cond := #in~cond; {7133#true} is VALID [2022-04-14 14:50:51,976 INFO L272 TraceCheckUtils]: 52: Hoare triple {7427#(or (not (= main_~c~0 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* (+ (* (- 1) main_~k~0 main_~s~0) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) 0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {7133#true} is VALID [2022-04-14 14:50:51,976 INFO L290 TraceCheckUtils]: 51: Hoare triple {7427#(or (not (= main_~c~0 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* (+ (* (- 1) main_~k~0 main_~s~0) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) 0))} assume !false; {7427#(or (not (= main_~c~0 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* (+ (* (- 1) main_~k~0 main_~s~0) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) 0))} is VALID [2022-04-14 14:50:53,383 INFO L290 TraceCheckUtils]: 50: Hoare triple {7477#(or (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ (* (- 1) (+ main_~k~0 1) main_~s~0) main_~r~0))) 0) (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 0)))} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {7427#(or (not (= main_~c~0 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* (+ (* (- 1) main_~k~0 main_~s~0) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) 0))} is VALID [2022-04-14 14:50:53,384 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {7133#true} {7477#(or (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ (* (- 1) (+ main_~k~0 1) main_~s~0) main_~r~0))) 0) (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 0)))} #90#return; {7477#(or (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ (* (- 1) (+ main_~k~0 1) main_~s~0) main_~r~0))) 0) (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 0)))} is VALID [2022-04-14 14:50:53,385 INFO L290 TraceCheckUtils]: 48: Hoare triple {7133#true} assume true; {7133#true} is VALID [2022-04-14 14:50:53,385 INFO L290 TraceCheckUtils]: 47: Hoare triple {7133#true} assume !(0 == ~cond); {7133#true} is VALID [2022-04-14 14:50:53,385 INFO L290 TraceCheckUtils]: 46: Hoare triple {7133#true} ~cond := #in~cond; {7133#true} is VALID [2022-04-14 14:50:53,385 INFO L272 TraceCheckUtils]: 45: Hoare triple {7477#(or (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ (* (- 1) (+ main_~k~0 1) main_~s~0) main_~r~0))) 0) (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 0)))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {7133#true} is VALID [2022-04-14 14:50:53,386 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {7133#true} {7477#(or (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ (* (- 1) (+ main_~k~0 1) main_~s~0) main_~r~0))) 0) (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 0)))} #88#return; {7477#(or (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ (* (- 1) (+ main_~k~0 1) main_~s~0) main_~r~0))) 0) (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 0)))} is VALID [2022-04-14 14:50:53,386 INFO L290 TraceCheckUtils]: 43: Hoare triple {7133#true} assume true; {7133#true} is VALID [2022-04-14 14:50:53,386 INFO L290 TraceCheckUtils]: 42: Hoare triple {7133#true} assume !(0 == ~cond); {7133#true} is VALID [2022-04-14 14:50:53,386 INFO L290 TraceCheckUtils]: 41: Hoare triple {7133#true} ~cond := #in~cond; {7133#true} is VALID [2022-04-14 14:50:53,386 INFO L272 TraceCheckUtils]: 40: Hoare triple {7477#(or (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ (* (- 1) (+ main_~k~0 1) main_~s~0) main_~r~0))) 0) (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 0)))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {7133#true} is VALID [2022-04-14 14:50:53,387 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {7133#true} {7477#(or (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ (* (- 1) (+ main_~k~0 1) main_~s~0) main_~r~0))) 0) (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 0)))} #86#return; {7477#(or (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ (* (- 1) (+ main_~k~0 1) main_~s~0) main_~r~0))) 0) (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 0)))} is VALID [2022-04-14 14:50:53,387 INFO L290 TraceCheckUtils]: 38: Hoare triple {7133#true} assume true; {7133#true} is VALID [2022-04-14 14:50:53,387 INFO L290 TraceCheckUtils]: 37: Hoare triple {7133#true} assume !(0 == ~cond); {7133#true} is VALID [2022-04-14 14:50:53,387 INFO L290 TraceCheckUtils]: 36: Hoare triple {7133#true} ~cond := #in~cond; {7133#true} is VALID [2022-04-14 14:50:53,387 INFO L272 TraceCheckUtils]: 35: Hoare triple {7477#(or (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ (* (- 1) (+ main_~k~0 1) main_~s~0) main_~r~0))) 0) (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 0)))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {7133#true} is VALID [2022-04-14 14:50:53,388 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {7133#true} {7477#(or (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ (* (- 1) (+ main_~k~0 1) main_~s~0) main_~r~0))) 0) (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 0)))} #84#return; {7477#(or (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ (* (- 1) (+ main_~k~0 1) main_~s~0) main_~r~0))) 0) (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 0)))} is VALID [2022-04-14 14:50:53,388 INFO L290 TraceCheckUtils]: 33: Hoare triple {7133#true} assume true; {7133#true} is VALID [2022-04-14 14:50:53,388 INFO L290 TraceCheckUtils]: 32: Hoare triple {7133#true} assume !(0 == ~cond); {7133#true} is VALID [2022-04-14 14:50:53,388 INFO L290 TraceCheckUtils]: 31: Hoare triple {7133#true} ~cond := #in~cond; {7133#true} is VALID [2022-04-14 14:50:53,389 INFO L272 TraceCheckUtils]: 30: Hoare triple {7477#(or (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ (* (- 1) (+ main_~k~0 1) main_~s~0) main_~r~0))) 0) (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 0)))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {7133#true} is VALID [2022-04-14 14:50:53,389 INFO L290 TraceCheckUtils]: 29: Hoare triple {7477#(or (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ (* (- 1) (+ main_~k~0 1) main_~s~0) main_~r~0))) 0) (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 0)))} assume !false; {7477#(or (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ (* (- 1) (+ main_~k~0 1) main_~s~0) main_~r~0))) 0) (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 0)))} is VALID [2022-04-14 14:50:53,390 INFO L290 TraceCheckUtils]: 28: Hoare triple {7544#(or (= (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))) 0) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (not (= (+ main_~a~0 (* (- 1) main_~b~0)) 0)))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {7477#(or (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ (* (- 1) (+ main_~k~0 1) main_~s~0) main_~r~0))) 0) (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 0)))} is VALID [2022-04-14 14:50:53,391 INFO L290 TraceCheckUtils]: 27: Hoare triple {7544#(or (= (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))) 0) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (not (= (+ main_~a~0 (* (- 1) main_~b~0)) 0)))} assume !false; {7544#(or (= (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))) 0) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (not (= (+ main_~a~0 (* (- 1) main_~b~0)) 0)))} is VALID [2022-04-14 14:50:53,391 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {7133#true} {7544#(or (= (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))) 0) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (not (= (+ main_~a~0 (* (- 1) main_~b~0)) 0)))} #82#return; {7544#(or (= (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))) 0) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (not (= (+ main_~a~0 (* (- 1) main_~b~0)) 0)))} is VALID [2022-04-14 14:50:53,392 INFO L290 TraceCheckUtils]: 25: Hoare triple {7133#true} assume true; {7133#true} is VALID [2022-04-14 14:50:53,392 INFO L290 TraceCheckUtils]: 24: Hoare triple {7133#true} assume !(0 == ~cond); {7133#true} is VALID [2022-04-14 14:50:53,392 INFO L290 TraceCheckUtils]: 23: Hoare triple {7133#true} ~cond := #in~cond; {7133#true} is VALID [2022-04-14 14:50:53,392 INFO L272 TraceCheckUtils]: 22: Hoare triple {7544#(or (= (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))) 0) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (not (= (+ main_~a~0 (* (- 1) main_~b~0)) 0)))} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {7133#true} is VALID [2022-04-14 14:50:53,393 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {7133#true} {7544#(or (= (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))) 0) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (not (= (+ main_~a~0 (* (- 1) main_~b~0)) 0)))} #80#return; {7544#(or (= (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))) 0) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (not (= (+ main_~a~0 (* (- 1) main_~b~0)) 0)))} is VALID [2022-04-14 14:50:53,393 INFO L290 TraceCheckUtils]: 20: Hoare triple {7133#true} assume true; {7133#true} is VALID [2022-04-14 14:50:53,393 INFO L290 TraceCheckUtils]: 19: Hoare triple {7133#true} assume !(0 == ~cond); {7133#true} is VALID [2022-04-14 14:50:53,393 INFO L290 TraceCheckUtils]: 18: Hoare triple {7133#true} ~cond := #in~cond; {7133#true} is VALID [2022-04-14 14:50:53,393 INFO L272 TraceCheckUtils]: 17: Hoare triple {7544#(or (= (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))) 0) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (not (= (+ main_~a~0 (* (- 1) main_~b~0)) 0)))} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {7133#true} is VALID [2022-04-14 14:50:53,394 INFO L290 TraceCheckUtils]: 16: Hoare triple {7133#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {7544#(or (= (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))) 0) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (not (= (+ main_~a~0 (* (- 1) main_~b~0)) 0)))} is VALID [2022-04-14 14:50:53,394 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {7133#true} {7133#true} #78#return; {7133#true} is VALID [2022-04-14 14:50:53,394 INFO L290 TraceCheckUtils]: 14: Hoare triple {7133#true} assume true; {7133#true} is VALID [2022-04-14 14:50:53,394 INFO L290 TraceCheckUtils]: 13: Hoare triple {7133#true} assume !(0 == ~cond); {7133#true} is VALID [2022-04-14 14:50:53,394 INFO L290 TraceCheckUtils]: 12: Hoare triple {7133#true} ~cond := #in~cond; {7133#true} is VALID [2022-04-14 14:50:53,394 INFO L272 TraceCheckUtils]: 11: Hoare triple {7133#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {7133#true} is VALID [2022-04-14 14:50:53,394 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7133#true} {7133#true} #76#return; {7133#true} is VALID [2022-04-14 14:50:53,394 INFO L290 TraceCheckUtils]: 9: Hoare triple {7133#true} assume true; {7133#true} is VALID [2022-04-14 14:50:53,394 INFO L290 TraceCheckUtils]: 8: Hoare triple {7133#true} assume !(0 == ~cond); {7133#true} is VALID [2022-04-14 14:50:53,395 INFO L290 TraceCheckUtils]: 7: Hoare triple {7133#true} ~cond := #in~cond; {7133#true} is VALID [2022-04-14 14:50:53,395 INFO L272 TraceCheckUtils]: 6: Hoare triple {7133#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {7133#true} is VALID [2022-04-14 14:50:53,395 INFO L290 TraceCheckUtils]: 5: Hoare triple {7133#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~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; {7133#true} is VALID [2022-04-14 14:50:53,395 INFO L272 TraceCheckUtils]: 4: Hoare triple {7133#true} call #t~ret6 := main(); {7133#true} is VALID [2022-04-14 14:50:53,395 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7133#true} {7133#true} #96#return; {7133#true} is VALID [2022-04-14 14:50:53,395 INFO L290 TraceCheckUtils]: 2: Hoare triple {7133#true} assume true; {7133#true} is VALID [2022-04-14 14:50:53,395 INFO L290 TraceCheckUtils]: 1: Hoare triple {7133#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(11, 2);call #Ultimate.allocInit(12, 3); {7133#true} is VALID [2022-04-14 14:50:53,395 INFO L272 TraceCheckUtils]: 0: Hoare triple {7133#true} call ULTIMATE.init(); {7133#true} is VALID [2022-04-14 14:50:53,396 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 33 proven. 12 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2022-04-14 14:50:53,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 14:50:53,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717326387] [2022-04-14 14:50:53,396 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 14:50:53,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1375303075] [2022-04-14 14:50:53,396 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1375303075] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-14 14:50:53,396 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-14 14:50:53,396 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 19 [2022-04-14 14:50:53,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353433462] [2022-04-14 14:50:53,397 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-14 14:50:53,397 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 2.176470588235294) internal successors, (37), 18 states have internal predecessors, (37), 11 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (23), 9 states have call predecessors, (23), 9 states have call successors, (23) Word has length 80 [2022-04-14 14:50:53,398 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 14:50:53,398 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 17 states have (on average 2.176470588235294) internal successors, (37), 18 states have internal predecessors, (37), 11 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (23), 9 states have call predecessors, (23), 9 states have call successors, (23) [2022-04-14 14:50:53,818 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 14:50:53,819 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-14 14:50:53,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 14:50:53,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-14 14:50:53,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2022-04-14 14:50:53,820 INFO L87 Difference]: Start difference. First operand 205 states and 288 transitions. Second operand has 19 states, 17 states have (on average 2.176470588235294) internal successors, (37), 18 states have internal predecessors, (37), 11 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (23), 9 states have call predecessors, (23), 9 states have call successors, (23) [2022-04-14 14:51:01,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:51:01,620 INFO L93 Difference]: Finished difference Result 307 states and 440 transitions. [2022-04-14 14:51:01,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-14 14:51:01,621 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 2.176470588235294) internal successors, (37), 18 states have internal predecessors, (37), 11 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (23), 9 states have call predecessors, (23), 9 states have call successors, (23) Word has length 80 [2022-04-14 14:51:01,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 14:51:01,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 17 states have (on average 2.176470588235294) internal successors, (37), 18 states have internal predecessors, (37), 11 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (23), 9 states have call predecessors, (23), 9 states have call successors, (23) [2022-04-14 14:51:01,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 164 transitions. [2022-04-14 14:51:01,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 17 states have (on average 2.176470588235294) internal successors, (37), 18 states have internal predecessors, (37), 11 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (23), 9 states have call predecessors, (23), 9 states have call successors, (23) [2022-04-14 14:51:01,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 164 transitions. [2022-04-14 14:51:01,630 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 164 transitions. [2022-04-14 14:51:02,149 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 164 edges. 164 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 14:51:02,158 INFO L225 Difference]: With dead ends: 307 [2022-04-14 14:51:02,158 INFO L226 Difference]: Without dead ends: 298 [2022-04-14 14:51:02,159 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 141 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=222, Invalid=1038, Unknown=0, NotChecked=0, Total=1260 [2022-04-14 14:51:02,159 INFO L913 BasicCegarLoop]: 43 mSDtfsCounter, 65 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 904 mSolverCounterSat, 164 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 1068 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 164 IncrementalHoareTripleChecker+Valid, 904 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2022-04-14 14:51:02,160 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [67 Valid, 295 Invalid, 1068 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [164 Valid, 904 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2022-04-14 14:51:02,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2022-04-14 14:51:02,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 295. [2022-04-14 14:51:02,574 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 14:51:02,575 INFO L82 GeneralOperation]: Start isEquivalent. First operand 298 states. Second operand has 295 states, 164 states have (on average 1.2073170731707317) internal successors, (198), 167 states have internal predecessors, (198), 113 states have call successors, (113), 18 states have call predecessors, (113), 17 states have return successors, (111), 109 states have call predecessors, (111), 111 states have call successors, (111) [2022-04-14 14:51:02,576 INFO L74 IsIncluded]: Start isIncluded. First operand 298 states. Second operand has 295 states, 164 states have (on average 1.2073170731707317) internal successors, (198), 167 states have internal predecessors, (198), 113 states have call successors, (113), 18 states have call predecessors, (113), 17 states have return successors, (111), 109 states have call predecessors, (111), 111 states have call successors, (111) [2022-04-14 14:51:02,576 INFO L87 Difference]: Start difference. First operand 298 states. Second operand has 295 states, 164 states have (on average 1.2073170731707317) internal successors, (198), 167 states have internal predecessors, (198), 113 states have call successors, (113), 18 states have call predecessors, (113), 17 states have return successors, (111), 109 states have call predecessors, (111), 111 states have call successors, (111) [2022-04-14 14:51:02,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:51:02,587 INFO L93 Difference]: Finished difference Result 298 states and 426 transitions. [2022-04-14 14:51:02,587 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 426 transitions. [2022-04-14 14:51:02,589 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 14:51:02,589 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 14:51:02,590 INFO L74 IsIncluded]: Start isIncluded. First operand has 295 states, 164 states have (on average 1.2073170731707317) internal successors, (198), 167 states have internal predecessors, (198), 113 states have call successors, (113), 18 states have call predecessors, (113), 17 states have return successors, (111), 109 states have call predecessors, (111), 111 states have call successors, (111) Second operand 298 states. [2022-04-14 14:51:02,590 INFO L87 Difference]: Start difference. First operand has 295 states, 164 states have (on average 1.2073170731707317) internal successors, (198), 167 states have internal predecessors, (198), 113 states have call successors, (113), 18 states have call predecessors, (113), 17 states have return successors, (111), 109 states have call predecessors, (111), 111 states have call successors, (111) Second operand 298 states. [2022-04-14 14:51:02,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:51:02,602 INFO L93 Difference]: Finished difference Result 298 states and 426 transitions. [2022-04-14 14:51:02,602 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 426 transitions. [2022-04-14 14:51:02,603 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 14:51:02,603 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 14:51:02,603 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 14:51:02,603 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 14:51:02,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 164 states have (on average 1.2073170731707317) internal successors, (198), 167 states have internal predecessors, (198), 113 states have call successors, (113), 18 states have call predecessors, (113), 17 states have return successors, (111), 109 states have call predecessors, (111), 111 states have call successors, (111) [2022-04-14 14:51:02,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 422 transitions. [2022-04-14 14:51:02,616 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 422 transitions. Word has length 80 [2022-04-14 14:51:02,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 14:51:02,616 INFO L478 AbstractCegarLoop]: Abstraction has 295 states and 422 transitions. [2022-04-14 14:51:02,616 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 2.176470588235294) internal successors, (37), 18 states have internal predecessors, (37), 11 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (23), 9 states have call predecessors, (23), 9 states have call successors, (23) [2022-04-14 14:51:02,617 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 422 transitions. [2022-04-14 14:51:02,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-04-14 14:51:02,618 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 14:51:02,618 INFO L499 BasicCegarLoop]: trace histogram [12, 11, 11, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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] [2022-04-14 14:51:02,647 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-04-14 14:51:02,839 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-04-14 14:51:02,840 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 14:51:02,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 14:51:02,840 INFO L85 PathProgramCache]: Analyzing trace with hash -1738688612, now seen corresponding path program 1 times [2022-04-14 14:51:02,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 14:51:02,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946639613] [2022-04-14 14:51:02,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 14:51:02,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 14:51:02,857 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 14:51:02,858 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1147962125] [2022-04-14 14:51:02,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 14:51:02,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 14:51:02,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 14:51:02,863 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-14 14:51:02,898 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-14 14:51:02,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:51:02,955 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 54 conjunts are in the unsatisfiable core [2022-04-14 14:51:02,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:51:02,975 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 14:51:04,114 INFO L272 TraceCheckUtils]: 0: Hoare triple {9226#true} call ULTIMATE.init(); {9226#true} is VALID [2022-04-14 14:51:04,114 INFO L290 TraceCheckUtils]: 1: Hoare triple {9226#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(11, 2);call #Ultimate.allocInit(12, 3); {9226#true} is VALID [2022-04-14 14:51:04,115 INFO L290 TraceCheckUtils]: 2: Hoare triple {9226#true} assume true; {9226#true} is VALID [2022-04-14 14:51:04,115 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9226#true} {9226#true} #96#return; {9226#true} is VALID [2022-04-14 14:51:04,115 INFO L272 TraceCheckUtils]: 4: Hoare triple {9226#true} call #t~ret6 := main(); {9226#true} is VALID [2022-04-14 14:51:04,115 INFO L290 TraceCheckUtils]: 5: Hoare triple {9226#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~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; {9226#true} is VALID [2022-04-14 14:51:04,115 INFO L272 TraceCheckUtils]: 6: Hoare triple {9226#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {9226#true} is VALID [2022-04-14 14:51:04,115 INFO L290 TraceCheckUtils]: 7: Hoare triple {9226#true} ~cond := #in~cond; {9226#true} is VALID [2022-04-14 14:51:04,115 INFO L290 TraceCheckUtils]: 8: Hoare triple {9226#true} assume !(0 == ~cond); {9226#true} is VALID [2022-04-14 14:51:04,115 INFO L290 TraceCheckUtils]: 9: Hoare triple {9226#true} assume true; {9226#true} is VALID [2022-04-14 14:51:04,115 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {9226#true} {9226#true} #76#return; {9226#true} is VALID [2022-04-14 14:51:04,115 INFO L272 TraceCheckUtils]: 11: Hoare triple {9226#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {9226#true} is VALID [2022-04-14 14:51:04,116 INFO L290 TraceCheckUtils]: 12: Hoare triple {9226#true} ~cond := #in~cond; {9226#true} is VALID [2022-04-14 14:51:04,116 INFO L290 TraceCheckUtils]: 13: Hoare triple {9226#true} assume !(0 == ~cond); {9226#true} is VALID [2022-04-14 14:51:04,116 INFO L290 TraceCheckUtils]: 14: Hoare triple {9226#true} assume true; {9226#true} is VALID [2022-04-14 14:51:04,116 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {9226#true} {9226#true} #78#return; {9226#true} is VALID [2022-04-14 14:51:04,116 INFO L290 TraceCheckUtils]: 16: Hoare triple {9226#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {9279#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 14:51:04,117 INFO L272 TraceCheckUtils]: 17: Hoare triple {9279#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {9226#true} is VALID [2022-04-14 14:51:04,117 INFO L290 TraceCheckUtils]: 18: Hoare triple {9226#true} ~cond := #in~cond; {9226#true} is VALID [2022-04-14 14:51:04,117 INFO L290 TraceCheckUtils]: 19: Hoare triple {9226#true} assume !(0 == ~cond); {9226#true} is VALID [2022-04-14 14:51:04,117 INFO L290 TraceCheckUtils]: 20: Hoare triple {9226#true} assume true; {9226#true} is VALID [2022-04-14 14:51:04,118 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {9226#true} {9279#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #80#return; {9279#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 14:51:04,118 INFO L272 TraceCheckUtils]: 22: Hoare triple {9279#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {9226#true} is VALID [2022-04-14 14:51:04,118 INFO L290 TraceCheckUtils]: 23: Hoare triple {9226#true} ~cond := #in~cond; {9226#true} is VALID [2022-04-14 14:51:04,118 INFO L290 TraceCheckUtils]: 24: Hoare triple {9226#true} assume !(0 == ~cond); {9226#true} is VALID [2022-04-14 14:51:04,118 INFO L290 TraceCheckUtils]: 25: Hoare triple {9226#true} assume true; {9226#true} is VALID [2022-04-14 14:51:04,119 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {9226#true} {9279#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #82#return; {9279#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 14:51:04,120 INFO L290 TraceCheckUtils]: 27: Hoare triple {9279#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !false; {9279#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 14:51:04,120 INFO L290 TraceCheckUtils]: 28: Hoare triple {9279#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {9316#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 14:51:04,121 INFO L290 TraceCheckUtils]: 29: Hoare triple {9316#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !false; {9316#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 14:51:04,121 INFO L272 TraceCheckUtils]: 30: Hoare triple {9316#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {9226#true} is VALID [2022-04-14 14:51:04,121 INFO L290 TraceCheckUtils]: 31: Hoare triple {9226#true} ~cond := #in~cond; {9226#true} is VALID [2022-04-14 14:51:04,121 INFO L290 TraceCheckUtils]: 32: Hoare triple {9226#true} assume !(0 == ~cond); {9226#true} is VALID [2022-04-14 14:51:04,121 INFO L290 TraceCheckUtils]: 33: Hoare triple {9226#true} assume true; {9226#true} is VALID [2022-04-14 14:51:04,122 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {9226#true} {9316#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #84#return; {9316#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 14:51:04,122 INFO L272 TraceCheckUtils]: 35: Hoare triple {9316#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 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)); {9226#true} is VALID [2022-04-14 14:51:04,123 INFO L290 TraceCheckUtils]: 36: Hoare triple {9226#true} ~cond := #in~cond; {9341#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-14 14:51:04,123 INFO L290 TraceCheckUtils]: 37: Hoare triple {9341#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {9345#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 14:51:04,124 INFO L290 TraceCheckUtils]: 38: Hoare triple {9345#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {9345#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 14:51:04,125 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {9345#(not (= |__VERIFIER_assert_#in~cond| 0))} {9316#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #86#return; {9316#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 14:51:04,125 INFO L272 TraceCheckUtils]: 40: Hoare triple {9316#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~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)); {9226#true} is VALID [2022-04-14 14:51:04,125 INFO L290 TraceCheckUtils]: 41: Hoare triple {9226#true} ~cond := #in~cond; {9226#true} is VALID [2022-04-14 14:51:04,125 INFO L290 TraceCheckUtils]: 42: Hoare triple {9226#true} assume !(0 == ~cond); {9226#true} is VALID [2022-04-14 14:51:04,125 INFO L290 TraceCheckUtils]: 43: Hoare triple {9226#true} assume true; {9226#true} is VALID [2022-04-14 14:51:04,126 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {9226#true} {9316#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #88#return; {9316#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 14:51:04,126 INFO L272 TraceCheckUtils]: 45: Hoare triple {9316#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {9226#true} is VALID [2022-04-14 14:51:04,126 INFO L290 TraceCheckUtils]: 46: Hoare triple {9226#true} ~cond := #in~cond; {9226#true} is VALID [2022-04-14 14:51:04,126 INFO L290 TraceCheckUtils]: 47: Hoare triple {9226#true} assume !(0 == ~cond); {9226#true} is VALID [2022-04-14 14:51:04,127 INFO L290 TraceCheckUtils]: 48: Hoare triple {9226#true} assume true; {9226#true} is VALID [2022-04-14 14:51:04,128 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {9226#true} {9316#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #90#return; {9316#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 14:51:04,129 INFO L290 TraceCheckUtils]: 50: Hoare triple {9316#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {9385#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= (+ (- 1) main_~k~0) 0) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 14:51:04,130 INFO L290 TraceCheckUtils]: 51: Hoare triple {9385#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= (+ (- 1) main_~k~0) 0) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !false; {9385#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= (+ (- 1) main_~k~0) 0) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 14:51:04,130 INFO L272 TraceCheckUtils]: 52: Hoare triple {9385#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= (+ (- 1) main_~k~0) 0) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {9226#true} is VALID [2022-04-14 14:51:04,130 INFO L290 TraceCheckUtils]: 53: Hoare triple {9226#true} ~cond := #in~cond; {9341#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-14 14:51:04,131 INFO L290 TraceCheckUtils]: 54: Hoare triple {9341#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {9345#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 14:51:04,131 INFO L290 TraceCheckUtils]: 55: Hoare triple {9345#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {9345#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 14:51:04,132 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {9345#(not (= |__VERIFIER_assert_#in~cond| 0))} {9385#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= (+ (- 1) main_~k~0) 0) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #84#return; {9404#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~k~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~x~0 (+ main_~c~0 main_~y~0)) (= main_~p~0 1))} is VALID [2022-04-14 14:51:04,133 INFO L272 TraceCheckUtils]: 57: Hoare triple {9404#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~k~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~x~0 (+ main_~c~0 main_~y~0)) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {9226#true} is VALID [2022-04-14 14:51:04,133 INFO L290 TraceCheckUtils]: 58: Hoare triple {9226#true} ~cond := #in~cond; {9226#true} is VALID [2022-04-14 14:51:04,133 INFO L290 TraceCheckUtils]: 59: Hoare triple {9226#true} assume !(0 == ~cond); {9226#true} is VALID [2022-04-14 14:51:04,133 INFO L290 TraceCheckUtils]: 60: Hoare triple {9226#true} assume true; {9226#true} is VALID [2022-04-14 14:51:04,134 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {9226#true} {9404#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~k~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~x~0 (+ main_~c~0 main_~y~0)) (= main_~p~0 1))} #86#return; {9404#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~k~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~x~0 (+ main_~c~0 main_~y~0)) (= main_~p~0 1))} is VALID [2022-04-14 14:51:04,134 INFO L272 TraceCheckUtils]: 62: Hoare triple {9404#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~k~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~x~0 (+ main_~c~0 main_~y~0)) (= main_~p~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {9226#true} is VALID [2022-04-14 14:51:04,134 INFO L290 TraceCheckUtils]: 63: Hoare triple {9226#true} ~cond := #in~cond; {9226#true} is VALID [2022-04-14 14:51:04,134 INFO L290 TraceCheckUtils]: 64: Hoare triple {9226#true} assume !(0 == ~cond); {9226#true} is VALID [2022-04-14 14:51:04,134 INFO L290 TraceCheckUtils]: 65: Hoare triple {9226#true} assume true; {9226#true} is VALID [2022-04-14 14:51:04,135 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {9226#true} {9404#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~k~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~x~0 (+ main_~c~0 main_~y~0)) (= main_~p~0 1))} #88#return; {9404#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~k~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~x~0 (+ main_~c~0 main_~y~0)) (= main_~p~0 1))} is VALID [2022-04-14 14:51:04,135 INFO L272 TraceCheckUtils]: 67: Hoare triple {9404#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~k~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~x~0 (+ main_~c~0 main_~y~0)) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {9226#true} is VALID [2022-04-14 14:51:04,135 INFO L290 TraceCheckUtils]: 68: Hoare triple {9226#true} ~cond := #in~cond; {9226#true} is VALID [2022-04-14 14:51:04,136 INFO L290 TraceCheckUtils]: 69: Hoare triple {9226#true} assume !(0 == ~cond); {9226#true} is VALID [2022-04-14 14:51:04,136 INFO L290 TraceCheckUtils]: 70: Hoare triple {9226#true} assume true; {9226#true} is VALID [2022-04-14 14:51:04,136 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {9226#true} {9404#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~k~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~x~0 (+ main_~c~0 main_~y~0)) (= main_~p~0 1))} #90#return; {9404#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~k~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~x~0 (+ main_~c~0 main_~y~0)) (= main_~p~0 1))} is VALID [2022-04-14 14:51:04,137 INFO L290 TraceCheckUtils]: 72: Hoare triple {9404#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~k~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~x~0 (+ main_~c~0 main_~y~0)) (= main_~p~0 1))} assume !(~c~0 >= ~b~0); {9404#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~k~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~x~0 (+ main_~c~0 main_~y~0)) (= main_~p~0 1))} is VALID [2022-04-14 14:51:04,138 INFO L290 TraceCheckUtils]: 73: Hoare triple {9404#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~k~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~x~0 (+ main_~c~0 main_~y~0)) (= main_~p~0 1))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {9456#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= (+ main_~s~0 1) 0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-14 14:51:04,138 INFO L290 TraceCheckUtils]: 74: Hoare triple {9456#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= (+ main_~s~0 1) 0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} assume !false; {9456#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= (+ main_~s~0 1) 0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-14 14:51:04,139 INFO L290 TraceCheckUtils]: 75: Hoare triple {9456#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= (+ main_~s~0 1) 0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {9456#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= (+ main_~s~0 1) 0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-14 14:51:04,139 INFO L290 TraceCheckUtils]: 76: Hoare triple {9456#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= (+ main_~s~0 1) 0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} assume !false; {9456#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= (+ main_~s~0 1) 0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-14 14:51:04,139 INFO L272 TraceCheckUtils]: 77: Hoare triple {9456#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= (+ main_~s~0 1) 0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {9226#true} is VALID [2022-04-14 14:51:04,140 INFO L290 TraceCheckUtils]: 78: Hoare triple {9226#true} ~cond := #in~cond; {9226#true} is VALID [2022-04-14 14:51:04,140 INFO L290 TraceCheckUtils]: 79: Hoare triple {9226#true} assume !(0 == ~cond); {9226#true} is VALID [2022-04-14 14:51:04,140 INFO L290 TraceCheckUtils]: 80: Hoare triple {9226#true} assume true; {9226#true} is VALID [2022-04-14 14:51:04,141 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {9226#true} {9456#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= (+ main_~s~0 1) 0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #84#return; {9456#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= (+ main_~s~0 1) 0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-14 14:51:04,141 INFO L272 TraceCheckUtils]: 82: Hoare triple {9456#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= (+ main_~s~0 1) 0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {9226#true} is VALID [2022-04-14 14:51:04,141 INFO L290 TraceCheckUtils]: 83: Hoare triple {9226#true} ~cond := #in~cond; {9226#true} is VALID [2022-04-14 14:51:04,141 INFO L290 TraceCheckUtils]: 84: Hoare triple {9226#true} assume !(0 == ~cond); {9226#true} is VALID [2022-04-14 14:51:04,141 INFO L290 TraceCheckUtils]: 85: Hoare triple {9226#true} assume true; {9226#true} is VALID [2022-04-14 14:51:04,142 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {9226#true} {9456#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= (+ main_~s~0 1) 0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #86#return; {9456#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= (+ main_~s~0 1) 0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-14 14:51:04,142 INFO L272 TraceCheckUtils]: 87: Hoare triple {9456#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= (+ main_~s~0 1) 0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {9226#true} is VALID [2022-04-14 14:51:04,142 INFO L290 TraceCheckUtils]: 88: Hoare triple {9226#true} ~cond := #in~cond; {9341#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-14 14:51:04,143 INFO L290 TraceCheckUtils]: 89: Hoare triple {9341#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {9345#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 14:51:04,143 INFO L290 TraceCheckUtils]: 90: Hoare triple {9345#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {9345#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 14:51:04,144 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {9345#(not (= |__VERIFIER_assert_#in~cond| 0))} {9456#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= (+ main_~s~0 1) 0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #88#return; {9456#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= (+ main_~s~0 1) 0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-14 14:51:04,146 INFO L272 TraceCheckUtils]: 92: Hoare triple {9456#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= (+ main_~s~0 1) 0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {9514#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 14:51:04,147 INFO L290 TraceCheckUtils]: 93: Hoare triple {9514#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {9518#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 14:51:04,147 INFO L290 TraceCheckUtils]: 94: Hoare triple {9518#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {9227#false} is VALID [2022-04-14 14:51:04,147 INFO L290 TraceCheckUtils]: 95: Hoare triple {9227#false} assume !false; {9227#false} is VALID [2022-04-14 14:51:04,148 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 55 proven. 57 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2022-04-14 14:51:04,148 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 14:51:42,497 INFO L290 TraceCheckUtils]: 95: Hoare triple {9227#false} assume !false; {9227#false} is VALID [2022-04-14 14:51:42,497 INFO L290 TraceCheckUtils]: 94: Hoare triple {9518#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {9227#false} is VALID [2022-04-14 14:51:42,498 INFO L290 TraceCheckUtils]: 93: Hoare triple {9514#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {9518#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 14:51:42,499 INFO L272 TraceCheckUtils]: 92: Hoare triple {9534#(= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {9514#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 14:51:42,499 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {9345#(not (= |__VERIFIER_assert_#in~cond| 0))} {9538#(or (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} #88#return; {9534#(= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))} is VALID [2022-04-14 14:51:42,500 INFO L290 TraceCheckUtils]: 90: Hoare triple {9345#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {9345#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 14:51:42,500 INFO L290 TraceCheckUtils]: 89: Hoare triple {9548#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {9345#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 14:51:42,501 INFO L290 TraceCheckUtils]: 88: Hoare triple {9226#true} ~cond := #in~cond; {9548#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-14 14:51:42,501 INFO L272 TraceCheckUtils]: 87: Hoare triple {9538#(or (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0))) (not (= 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)); {9226#true} is VALID [2022-04-14 14:51:42,502 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {9226#true} {9538#(or (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} #86#return; {9538#(or (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is VALID [2022-04-14 14:51:42,502 INFO L290 TraceCheckUtils]: 85: Hoare triple {9226#true} assume true; {9226#true} is VALID [2022-04-14 14:51:42,503 INFO L290 TraceCheckUtils]: 84: Hoare triple {9226#true} assume !(0 == ~cond); {9226#true} is VALID [2022-04-14 14:51:42,503 INFO L290 TraceCheckUtils]: 83: Hoare triple {9226#true} ~cond := #in~cond; {9226#true} is VALID [2022-04-14 14:51:42,503 INFO L272 TraceCheckUtils]: 82: Hoare triple {9538#(or (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0))) (not (= 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)); {9226#true} is VALID [2022-04-14 14:51:42,504 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {9226#true} {9538#(or (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} #84#return; {9538#(or (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is VALID [2022-04-14 14:51:42,504 INFO L290 TraceCheckUtils]: 80: Hoare triple {9226#true} assume true; {9226#true} is VALID [2022-04-14 14:51:42,504 INFO L290 TraceCheckUtils]: 79: Hoare triple {9226#true} assume !(0 == ~cond); {9226#true} is VALID [2022-04-14 14:51:42,504 INFO L290 TraceCheckUtils]: 78: Hoare triple {9226#true} ~cond := #in~cond; {9226#true} is VALID [2022-04-14 14:51:42,504 INFO L272 TraceCheckUtils]: 77: Hoare triple {9538#(or (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {9226#true} is VALID [2022-04-14 14:51:42,504 INFO L290 TraceCheckUtils]: 76: Hoare triple {9538#(or (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} assume !false; {9538#(or (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is VALID [2022-04-14 14:51:42,505 INFO L290 TraceCheckUtils]: 75: Hoare triple {9538#(or (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {9538#(or (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is VALID [2022-04-14 14:51:42,505 INFO L290 TraceCheckUtils]: 74: Hoare triple {9538#(or (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} assume !false; {9538#(or (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is VALID [2022-04-14 14:51:44,507 WARN L290 TraceCheckUtils]: 73: Hoare triple {9594#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) main_~c~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0)) (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~c~0 main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0))) (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {9538#(or (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is UNKNOWN [2022-04-14 14:51:44,507 INFO L290 TraceCheckUtils]: 72: Hoare triple {9594#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) main_~c~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0)) (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~c~0 main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0))) (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)))} assume !(~c~0 >= ~b~0); {9594#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) main_~c~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0)) (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~c~0 main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0))) (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)))} is VALID [2022-04-14 14:51:44,508 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {9226#true} {9594#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) main_~c~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0)) (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~c~0 main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0))) (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)))} #90#return; {9594#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) main_~c~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0)) (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~c~0 main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0))) (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)))} is VALID [2022-04-14 14:51:44,508 INFO L290 TraceCheckUtils]: 70: Hoare triple {9226#true} assume true; {9226#true} is VALID [2022-04-14 14:51:44,508 INFO L290 TraceCheckUtils]: 69: Hoare triple {9226#true} assume !(0 == ~cond); {9226#true} is VALID [2022-04-14 14:51:44,508 INFO L290 TraceCheckUtils]: 68: Hoare triple {9226#true} ~cond := #in~cond; {9226#true} is VALID [2022-04-14 14:51:44,508 INFO L272 TraceCheckUtils]: 67: Hoare triple {9594#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) main_~c~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0)) (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~c~0 main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0))) (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {9226#true} is VALID [2022-04-14 14:51:44,509 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {9226#true} {9594#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) main_~c~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0)) (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~c~0 main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0))) (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)))} #88#return; {9594#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) main_~c~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0)) (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~c~0 main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0))) (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)))} is VALID [2022-04-14 14:51:44,509 INFO L290 TraceCheckUtils]: 65: Hoare triple {9226#true} assume true; {9226#true} is VALID [2022-04-14 14:51:44,509 INFO L290 TraceCheckUtils]: 64: Hoare triple {9226#true} assume !(0 == ~cond); {9226#true} is VALID [2022-04-14 14:51:44,509 INFO L290 TraceCheckUtils]: 63: Hoare triple {9226#true} ~cond := #in~cond; {9226#true} is VALID [2022-04-14 14:51:44,509 INFO L272 TraceCheckUtils]: 62: Hoare triple {9594#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) main_~c~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0)) (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~c~0 main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0))) (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {9226#true} is VALID [2022-04-14 14:51:44,510 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {9226#true} {9594#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) main_~c~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0)) (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~c~0 main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0))) (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)))} #86#return; {9594#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) main_~c~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0)) (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~c~0 main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0))) (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)))} is VALID [2022-04-14 14:51:44,510 INFO L290 TraceCheckUtils]: 60: Hoare triple {9226#true} assume true; {9226#true} is VALID [2022-04-14 14:51:44,510 INFO L290 TraceCheckUtils]: 59: Hoare triple {9226#true} assume !(0 == ~cond); {9226#true} is VALID [2022-04-14 14:51:44,510 INFO L290 TraceCheckUtils]: 58: Hoare triple {9226#true} ~cond := #in~cond; {9226#true} is VALID [2022-04-14 14:51:44,510 INFO L272 TraceCheckUtils]: 57: Hoare triple {9594#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) main_~c~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0)) (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~c~0 main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0))) (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {9226#true} is VALID [2022-04-14 14:51:44,511 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {9345#(not (= |__VERIFIER_assert_#in~cond| 0))} {9646#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) main_~c~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0)) (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~c~0 main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0))) (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)) (not (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))))} #84#return; {9594#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) main_~c~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0)) (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~c~0 main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0))) (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)))} is VALID [2022-04-14 14:51:44,512 INFO L290 TraceCheckUtils]: 55: Hoare triple {9345#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {9345#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 14:51:44,512 INFO L290 TraceCheckUtils]: 54: Hoare triple {9548#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {9345#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 14:51:44,512 INFO L290 TraceCheckUtils]: 53: Hoare triple {9226#true} ~cond := #in~cond; {9548#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-14 14:51:44,512 INFO L272 TraceCheckUtils]: 52: Hoare triple {9646#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) main_~c~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0)) (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~c~0 main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0))) (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)) (not (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {9226#true} is VALID [2022-04-14 14:51:44,513 INFO L290 TraceCheckUtils]: 51: Hoare triple {9646#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) main_~c~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0)) (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~c~0 main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0))) (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)) (not (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))))} assume !false; {9646#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) main_~c~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0)) (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~c~0 main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0))) (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)) (not (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))))} is VALID [2022-04-14 14:51:44,613 INFO L290 TraceCheckUtils]: 50: Hoare triple {9665#(or (not (= main_~a~0 (+ main_~c~0 (* (- 1) main_~b~0) (* (+ main_~k~0 1) main_~b~0)))) (not (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0)))) (= (+ (* (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0)) main_~xy~0) main_~c~0 (* (- 1) main_~b~0) (* (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))) main_~yy~0)) (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~c~0 (* (- 1) main_~b~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))))))} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {9646#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) main_~c~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0)) (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~c~0 main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0))) (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)) (not (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))))} is VALID [2022-04-14 14:51:44,614 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {9226#true} {9665#(or (not (= main_~a~0 (+ main_~c~0 (* (- 1) main_~b~0) (* (+ main_~k~0 1) main_~b~0)))) (not (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0)))) (= (+ (* (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0)) main_~xy~0) main_~c~0 (* (- 1) main_~b~0) (* (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))) main_~yy~0)) (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~c~0 (* (- 1) main_~b~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))))))} #90#return; {9665#(or (not (= main_~a~0 (+ main_~c~0 (* (- 1) main_~b~0) (* (+ main_~k~0 1) main_~b~0)))) (not (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0)))) (= (+ (* (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0)) main_~xy~0) main_~c~0 (* (- 1) main_~b~0) (* (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))) main_~yy~0)) (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~c~0 (* (- 1) main_~b~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))))))} is VALID [2022-04-14 14:51:44,614 INFO L290 TraceCheckUtils]: 48: Hoare triple {9226#true} assume true; {9226#true} is VALID [2022-04-14 14:51:44,614 INFO L290 TraceCheckUtils]: 47: Hoare triple {9226#true} assume !(0 == ~cond); {9226#true} is VALID [2022-04-14 14:51:44,614 INFO L290 TraceCheckUtils]: 46: Hoare triple {9226#true} ~cond := #in~cond; {9226#true} is VALID [2022-04-14 14:51:44,614 INFO L272 TraceCheckUtils]: 45: Hoare triple {9665#(or (not (= main_~a~0 (+ main_~c~0 (* (- 1) main_~b~0) (* (+ main_~k~0 1) main_~b~0)))) (not (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0)))) (= (+ (* (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0)) main_~xy~0) main_~c~0 (* (- 1) main_~b~0) (* (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))) main_~yy~0)) (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~c~0 (* (- 1) main_~b~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))))))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {9226#true} is VALID [2022-04-14 14:51:44,615 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {9226#true} {9665#(or (not (= main_~a~0 (+ main_~c~0 (* (- 1) main_~b~0) (* (+ main_~k~0 1) main_~b~0)))) (not (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0)))) (= (+ (* (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0)) main_~xy~0) main_~c~0 (* (- 1) main_~b~0) (* (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))) main_~yy~0)) (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~c~0 (* (- 1) main_~b~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))))))} #88#return; {9665#(or (not (= main_~a~0 (+ main_~c~0 (* (- 1) main_~b~0) (* (+ main_~k~0 1) main_~b~0)))) (not (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0)))) (= (+ (* (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0)) main_~xy~0) main_~c~0 (* (- 1) main_~b~0) (* (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))) main_~yy~0)) (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~c~0 (* (- 1) main_~b~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))))))} is VALID [2022-04-14 14:51:44,615 INFO L290 TraceCheckUtils]: 43: Hoare triple {9226#true} assume true; {9226#true} is VALID [2022-04-14 14:51:44,615 INFO L290 TraceCheckUtils]: 42: Hoare triple {9226#true} assume !(0 == ~cond); {9226#true} is VALID [2022-04-14 14:51:44,615 INFO L290 TraceCheckUtils]: 41: Hoare triple {9226#true} ~cond := #in~cond; {9226#true} is VALID [2022-04-14 14:51:44,615 INFO L272 TraceCheckUtils]: 40: Hoare triple {9665#(or (not (= main_~a~0 (+ main_~c~0 (* (- 1) main_~b~0) (* (+ main_~k~0 1) main_~b~0)))) (not (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0)))) (= (+ (* (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0)) main_~xy~0) main_~c~0 (* (- 1) main_~b~0) (* (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))) main_~yy~0)) (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~c~0 (* (- 1) main_~b~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))))))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {9226#true} is VALID [2022-04-14 14:51:44,616 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {9345#(not (= |__VERIFIER_assert_#in~cond| 0))} {9699#(or (not (= main_~a~0 (+ main_~c~0 (* (- 1) main_~b~0) (* (+ main_~k~0 1) main_~b~0)))) (not (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0)))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (= (+ (* (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0)) main_~xy~0) main_~c~0 (* (- 1) main_~b~0) (* (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))) main_~yy~0)) (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~c~0 (* (- 1) main_~b~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))))))} #86#return; {9665#(or (not (= main_~a~0 (+ main_~c~0 (* (- 1) main_~b~0) (* (+ main_~k~0 1) main_~b~0)))) (not (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0)))) (= (+ (* (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0)) main_~xy~0) main_~c~0 (* (- 1) main_~b~0) (* (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))) main_~yy~0)) (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~c~0 (* (- 1) main_~b~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))))))} is VALID [2022-04-14 14:51:44,616 INFO L290 TraceCheckUtils]: 38: Hoare triple {9345#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {9345#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 14:51:44,617 INFO L290 TraceCheckUtils]: 37: Hoare triple {9548#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {9345#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 14:51:44,617 INFO L290 TraceCheckUtils]: 36: Hoare triple {9226#true} ~cond := #in~cond; {9548#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-14 14:51:44,617 INFO L272 TraceCheckUtils]: 35: Hoare triple {9699#(or (not (= main_~a~0 (+ main_~c~0 (* (- 1) main_~b~0) (* (+ main_~k~0 1) main_~b~0)))) (not (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0)))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (= (+ (* (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0)) main_~xy~0) main_~c~0 (* (- 1) main_~b~0) (* (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))) main_~yy~0)) (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~c~0 (* (- 1) main_~b~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))))))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {9226#true} is VALID [2022-04-14 14:51:44,618 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {9226#true} {9699#(or (not (= main_~a~0 (+ main_~c~0 (* (- 1) main_~b~0) (* (+ main_~k~0 1) main_~b~0)))) (not (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0)))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (= (+ (* (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0)) main_~xy~0) main_~c~0 (* (- 1) main_~b~0) (* (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))) main_~yy~0)) (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~c~0 (* (- 1) main_~b~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))))))} #84#return; {9699#(or (not (= main_~a~0 (+ main_~c~0 (* (- 1) main_~b~0) (* (+ main_~k~0 1) main_~b~0)))) (not (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0)))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (= (+ (* (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0)) main_~xy~0) main_~c~0 (* (- 1) main_~b~0) (* (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))) main_~yy~0)) (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~c~0 (* (- 1) main_~b~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))))))} is VALID [2022-04-14 14:51:44,618 INFO L290 TraceCheckUtils]: 33: Hoare triple {9226#true} assume true; {9226#true} is VALID [2022-04-14 14:51:44,618 INFO L290 TraceCheckUtils]: 32: Hoare triple {9226#true} assume !(0 == ~cond); {9226#true} is VALID [2022-04-14 14:51:44,618 INFO L290 TraceCheckUtils]: 31: Hoare triple {9226#true} ~cond := #in~cond; {9226#true} is VALID [2022-04-14 14:51:44,618 INFO L272 TraceCheckUtils]: 30: Hoare triple {9699#(or (not (= main_~a~0 (+ main_~c~0 (* (- 1) main_~b~0) (* (+ main_~k~0 1) main_~b~0)))) (not (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0)))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (= (+ (* (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0)) main_~xy~0) main_~c~0 (* (- 1) main_~b~0) (* (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))) main_~yy~0)) (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~c~0 (* (- 1) main_~b~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))))))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {9226#true} is VALID [2022-04-14 14:51:44,619 INFO L290 TraceCheckUtils]: 29: Hoare triple {9699#(or (not (= main_~a~0 (+ main_~c~0 (* (- 1) main_~b~0) (* (+ main_~k~0 1) main_~b~0)))) (not (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0)))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (= (+ (* (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0)) main_~xy~0) main_~c~0 (* (- 1) main_~b~0) (* (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))) main_~yy~0)) (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~c~0 (* (- 1) main_~b~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))))))} assume !false; {9699#(or (not (= main_~a~0 (+ main_~c~0 (* (- 1) main_~b~0) (* (+ main_~k~0 1) main_~b~0)))) (not (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0)))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (= (+ (* (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0)) main_~xy~0) main_~c~0 (* (- 1) main_~b~0) (* (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))) main_~yy~0)) (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~c~0 (* (- 1) main_~b~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))))))} is VALID [2022-04-14 14:51:44,675 INFO L290 TraceCheckUtils]: 28: Hoare triple {9733#(or (= (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))) (* main_~y~0 (+ (* (- 1) main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) (* (- 1) main_~q~0 main_~x~0) (* main_~p~0 main_~x~0)))) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~yy~0) (* (- 1) main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) (* (- 1) main_~q~0 main_~x~0) (* main_~xy~0 (+ main_~p~0 (* (- 1) main_~q~0))) (* main_~p~0 main_~x~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= (+ (* (- 1) main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) main_~b~0 (* (- 1) main_~q~0 main_~x~0) (* main_~p~0 main_~x~0)) main_~a~0)))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {9699#(or (not (= main_~a~0 (+ main_~c~0 (* (- 1) main_~b~0) (* (+ main_~k~0 1) main_~b~0)))) (not (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0)))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (= (+ (* (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0)) main_~xy~0) main_~c~0 (* (- 1) main_~b~0) (* (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))) main_~yy~0)) (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~c~0 (* (- 1) main_~b~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))))))} is VALID [2022-04-14 14:51:44,676 INFO L290 TraceCheckUtils]: 27: Hoare triple {9733#(or (= (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))) (* main_~y~0 (+ (* (- 1) main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) (* (- 1) main_~q~0 main_~x~0) (* main_~p~0 main_~x~0)))) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~yy~0) (* (- 1) main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) (* (- 1) main_~q~0 main_~x~0) (* main_~xy~0 (+ main_~p~0 (* (- 1) main_~q~0))) (* main_~p~0 main_~x~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= (+ (* (- 1) main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) main_~b~0 (* (- 1) main_~q~0 main_~x~0) (* main_~p~0 main_~x~0)) main_~a~0)))} assume !false; {9733#(or (= (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))) (* main_~y~0 (+ (* (- 1) main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) (* (- 1) main_~q~0 main_~x~0) (* main_~p~0 main_~x~0)))) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~yy~0) (* (- 1) main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) (* (- 1) main_~q~0 main_~x~0) (* main_~xy~0 (+ main_~p~0 (* (- 1) main_~q~0))) (* main_~p~0 main_~x~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= (+ (* (- 1) main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) main_~b~0 (* (- 1) main_~q~0 main_~x~0) (* main_~p~0 main_~x~0)) main_~a~0)))} is VALID [2022-04-14 14:51:44,677 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {9226#true} {9733#(or (= (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))) (* main_~y~0 (+ (* (- 1) main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) (* (- 1) main_~q~0 main_~x~0) (* main_~p~0 main_~x~0)))) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~yy~0) (* (- 1) main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) (* (- 1) main_~q~0 main_~x~0) (* main_~xy~0 (+ main_~p~0 (* (- 1) main_~q~0))) (* main_~p~0 main_~x~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= (+ (* (- 1) main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) main_~b~0 (* (- 1) main_~q~0 main_~x~0) (* main_~p~0 main_~x~0)) main_~a~0)))} #82#return; {9733#(or (= (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))) (* main_~y~0 (+ (* (- 1) main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) (* (- 1) main_~q~0 main_~x~0) (* main_~p~0 main_~x~0)))) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~yy~0) (* (- 1) main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) (* (- 1) main_~q~0 main_~x~0) (* main_~xy~0 (+ main_~p~0 (* (- 1) main_~q~0))) (* main_~p~0 main_~x~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= (+ (* (- 1) main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) main_~b~0 (* (- 1) main_~q~0 main_~x~0) (* main_~p~0 main_~x~0)) main_~a~0)))} is VALID [2022-04-14 14:51:44,677 INFO L290 TraceCheckUtils]: 25: Hoare triple {9226#true} assume true; {9226#true} is VALID [2022-04-14 14:51:44,677 INFO L290 TraceCheckUtils]: 24: Hoare triple {9226#true} assume !(0 == ~cond); {9226#true} is VALID [2022-04-14 14:51:44,677 INFO L290 TraceCheckUtils]: 23: Hoare triple {9226#true} ~cond := #in~cond; {9226#true} is VALID [2022-04-14 14:51:44,677 INFO L272 TraceCheckUtils]: 22: Hoare triple {9733#(or (= (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))) (* main_~y~0 (+ (* (- 1) main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) (* (- 1) main_~q~0 main_~x~0) (* main_~p~0 main_~x~0)))) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~yy~0) (* (- 1) main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) (* (- 1) main_~q~0 main_~x~0) (* main_~xy~0 (+ main_~p~0 (* (- 1) main_~q~0))) (* main_~p~0 main_~x~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= (+ (* (- 1) main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) main_~b~0 (* (- 1) main_~q~0 main_~x~0) (* main_~p~0 main_~x~0)) main_~a~0)))} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {9226#true} is VALID [2022-04-14 14:51:44,678 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {9226#true} {9733#(or (= (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))) (* main_~y~0 (+ (* (- 1) main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) (* (- 1) main_~q~0 main_~x~0) (* main_~p~0 main_~x~0)))) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~yy~0) (* (- 1) main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) (* (- 1) main_~q~0 main_~x~0) (* main_~xy~0 (+ main_~p~0 (* (- 1) main_~q~0))) (* main_~p~0 main_~x~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= (+ (* (- 1) main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) main_~b~0 (* (- 1) main_~q~0 main_~x~0) (* main_~p~0 main_~x~0)) main_~a~0)))} #80#return; {9733#(or (= (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))) (* main_~y~0 (+ (* (- 1) main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) (* (- 1) main_~q~0 main_~x~0) (* main_~p~0 main_~x~0)))) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~yy~0) (* (- 1) main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) (* (- 1) main_~q~0 main_~x~0) (* main_~xy~0 (+ main_~p~0 (* (- 1) main_~q~0))) (* main_~p~0 main_~x~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= (+ (* (- 1) main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) main_~b~0 (* (- 1) main_~q~0 main_~x~0) (* main_~p~0 main_~x~0)) main_~a~0)))} is VALID [2022-04-14 14:51:44,678 INFO L290 TraceCheckUtils]: 20: Hoare triple {9226#true} assume true; {9226#true} is VALID [2022-04-14 14:51:44,678 INFO L290 TraceCheckUtils]: 19: Hoare triple {9226#true} assume !(0 == ~cond); {9226#true} is VALID [2022-04-14 14:51:44,678 INFO L290 TraceCheckUtils]: 18: Hoare triple {9226#true} ~cond := #in~cond; {9226#true} is VALID [2022-04-14 14:51:44,678 INFO L272 TraceCheckUtils]: 17: Hoare triple {9733#(or (= (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))) (* main_~y~0 (+ (* (- 1) main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) (* (- 1) main_~q~0 main_~x~0) (* main_~p~0 main_~x~0)))) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~yy~0) (* (- 1) main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) (* (- 1) main_~q~0 main_~x~0) (* main_~xy~0 (+ main_~p~0 (* (- 1) main_~q~0))) (* main_~p~0 main_~x~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= (+ (* (- 1) main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) main_~b~0 (* (- 1) main_~q~0 main_~x~0) (* main_~p~0 main_~x~0)) main_~a~0)))} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {9226#true} is VALID [2022-04-14 14:51:44,679 INFO L290 TraceCheckUtils]: 16: Hoare triple {9226#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {9733#(or (= (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))) (* main_~y~0 (+ (* (- 1) main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) (* (- 1) main_~q~0 main_~x~0) (* main_~p~0 main_~x~0)))) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~yy~0) (* (- 1) main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) (* (- 1) main_~q~0 main_~x~0) (* main_~xy~0 (+ main_~p~0 (* (- 1) main_~q~0))) (* main_~p~0 main_~x~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= (+ (* (- 1) main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) main_~b~0 (* (- 1) main_~q~0 main_~x~0) (* main_~p~0 main_~x~0)) main_~a~0)))} is VALID [2022-04-14 14:51:44,679 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {9226#true} {9226#true} #78#return; {9226#true} is VALID [2022-04-14 14:51:44,679 INFO L290 TraceCheckUtils]: 14: Hoare triple {9226#true} assume true; {9226#true} is VALID [2022-04-14 14:51:44,679 INFO L290 TraceCheckUtils]: 13: Hoare triple {9226#true} assume !(0 == ~cond); {9226#true} is VALID [2022-04-14 14:51:44,679 INFO L290 TraceCheckUtils]: 12: Hoare triple {9226#true} ~cond := #in~cond; {9226#true} is VALID [2022-04-14 14:51:44,679 INFO L272 TraceCheckUtils]: 11: Hoare triple {9226#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {9226#true} is VALID [2022-04-14 14:51:44,679 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {9226#true} {9226#true} #76#return; {9226#true} is VALID [2022-04-14 14:51:44,680 INFO L290 TraceCheckUtils]: 9: Hoare triple {9226#true} assume true; {9226#true} is VALID [2022-04-14 14:51:44,680 INFO L290 TraceCheckUtils]: 8: Hoare triple {9226#true} assume !(0 == ~cond); {9226#true} is VALID [2022-04-14 14:51:44,680 INFO L290 TraceCheckUtils]: 7: Hoare triple {9226#true} ~cond := #in~cond; {9226#true} is VALID [2022-04-14 14:51:44,680 INFO L272 TraceCheckUtils]: 6: Hoare triple {9226#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {9226#true} is VALID [2022-04-14 14:51:44,680 INFO L290 TraceCheckUtils]: 5: Hoare triple {9226#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~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; {9226#true} is VALID [2022-04-14 14:51:44,680 INFO L272 TraceCheckUtils]: 4: Hoare triple {9226#true} call #t~ret6 := main(); {9226#true} is VALID [2022-04-14 14:51:44,680 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9226#true} {9226#true} #96#return; {9226#true} is VALID [2022-04-14 14:51:44,680 INFO L290 TraceCheckUtils]: 2: Hoare triple {9226#true} assume true; {9226#true} is VALID [2022-04-14 14:51:44,680 INFO L290 TraceCheckUtils]: 1: Hoare triple {9226#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(11, 2);call #Ultimate.allocInit(12, 3); {9226#true} is VALID [2022-04-14 14:51:44,680 INFO L272 TraceCheckUtils]: 0: Hoare triple {9226#true} call ULTIMATE.init(); {9226#true} is VALID [2022-04-14 14:51:44,681 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 55 proven. 57 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2022-04-14 14:51:44,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 14:51:44,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946639613] [2022-04-14 14:51:44,681 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 14:51:44,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1147962125] [2022-04-14 14:51:44,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1147962125] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-14 14:51:44,682 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-14 14:51:44,682 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13] total 19 [2022-04-14 14:51:44,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613239911] [2022-04-14 14:51:44,682 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-14 14:51:44,683 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.1666666666666665) internal successors, (39), 16 states have internal predecessors, (39), 13 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (29), 11 states have call predecessors, (29), 12 states have call successors, (29) Word has length 96 [2022-04-14 14:51:44,684 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 14:51:44,684 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 18 states have (on average 2.1666666666666665) internal successors, (39), 16 states have internal predecessors, (39), 13 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (29), 11 states have call predecessors, (29), 12 states have call successors, (29) [2022-04-14 14:51:47,109 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 99 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-14 14:51:47,110 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-14 14:51:47,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 14:51:47,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-14 14:51:47,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2022-04-14 14:51:47,110 INFO L87 Difference]: Start difference. First operand 295 states and 422 transitions. Second operand has 19 states, 18 states have (on average 2.1666666666666665) internal successors, (39), 16 states have internal predecessors, (39), 13 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (29), 11 states have call predecessors, (29), 12 states have call successors, (29) [2022-04-14 14:52:12,482 WARN L232 SmtUtils]: Spent 10.23s on a formula simplification that was a NOOP. DAG size: 88 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-14 14:52:21,621 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-14 14:52:23,334 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-14 14:52:42,799 WARN L232 SmtUtils]: Spent 9.46s on a formula simplification that was a NOOP. DAG size: 92 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-14 14:52:58,086 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-14 14:53:04,712 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-14 14:53:12,983 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-14 14:53:14,986 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-14 14:53:16,993 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-14 14:53:19,578 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.89s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-14 14:53:24,193 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-14 14:53:28,436 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-14 14:53:30,438 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-14 14:53:35,408 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.96s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-14 14:53:37,417 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-14 14:53:40,085 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-14 14:53:49,568 WARN L232 SmtUtils]: Spent 7.51s on a formula simplification that was a NOOP. DAG size: 92 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-14 14:53:50,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:53:50,781 INFO L93 Difference]: Finished difference Result 343 states and 495 transitions. [2022-04-14 14:53:50,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-14 14:53:50,781 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.1666666666666665) internal successors, (39), 16 states have internal predecessors, (39), 13 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (29), 11 states have call predecessors, (29), 12 states have call successors, (29) Word has length 96 [2022-04-14 14:53:50,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 14:53:50,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 2.1666666666666665) internal successors, (39), 16 states have internal predecessors, (39), 13 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (29), 11 states have call predecessors, (29), 12 states have call successors, (29) [2022-04-14 14:53:50,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 155 transitions. [2022-04-14 14:53:50,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 2.1666666666666665) internal successors, (39), 16 states have internal predecessors, (39), 13 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (29), 11 states have call predecessors, (29), 12 states have call successors, (29) [2022-04-14 14:53:50,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 155 transitions. [2022-04-14 14:53:50,788 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 155 transitions. [2022-04-14 14:54:03,627 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 155 edges. 150 inductive. 0 not inductive. 5 times theorem prover too weak to decide inductivity. [2022-04-14 14:54:03,637 INFO L225 Difference]: With dead ends: 343 [2022-04-14 14:54:03,637 INFO L226 Difference]: Without dead ends: 341 [2022-04-14 14:54:03,638 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 172 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 51.4s TimeCoverageRelationStatistics Valid=228, Invalid=701, Unknown=1, NotChecked=0, Total=930 [2022-04-14 14:54:03,638 INFO L913 BasicCegarLoop]: 38 mSDtfsCounter, 72 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 777 mSolverCounterSat, 134 mSolverCounterUnsat, 11 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 33.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 922 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 777 IncrementalHoareTripleChecker+Invalid, 11 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 33.8s IncrementalHoareTripleChecker+Time [2022-04-14 14:54:03,639 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [85 Valid, 264 Invalid, 922 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 777 Invalid, 11 Unknown, 0 Unchecked, 33.8s Time] [2022-04-14 14:54:03,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2022-04-14 14:54:04,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 336. [2022-04-14 14:54:04,150 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 14:54:04,151 INFO L82 GeneralOperation]: Start isEquivalent. First operand 341 states. Second operand has 336 states, 183 states have (on average 1.2131147540983607) internal successors, (222), 189 states have internal predecessors, (222), 134 states have call successors, (134), 19 states have call predecessors, (134), 18 states have return successors, (132), 127 states have call predecessors, (132), 132 states have call successors, (132) [2022-04-14 14:54:04,152 INFO L74 IsIncluded]: Start isIncluded. First operand 341 states. Second operand has 336 states, 183 states have (on average 1.2131147540983607) internal successors, (222), 189 states have internal predecessors, (222), 134 states have call successors, (134), 19 states have call predecessors, (134), 18 states have return successors, (132), 127 states have call predecessors, (132), 132 states have call successors, (132) [2022-04-14 14:54:04,152 INFO L87 Difference]: Start difference. First operand 341 states. Second operand has 336 states, 183 states have (on average 1.2131147540983607) internal successors, (222), 189 states have internal predecessors, (222), 134 states have call successors, (134), 19 states have call predecessors, (134), 18 states have return successors, (132), 127 states have call predecessors, (132), 132 states have call successors, (132) [2022-04-14 14:54:04,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:54:04,165 INFO L93 Difference]: Finished difference Result 341 states and 493 transitions. [2022-04-14 14:54:04,165 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 493 transitions. [2022-04-14 14:54:04,167 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 14:54:04,167 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 14:54:04,168 INFO L74 IsIncluded]: Start isIncluded. First operand has 336 states, 183 states have (on average 1.2131147540983607) internal successors, (222), 189 states have internal predecessors, (222), 134 states have call successors, (134), 19 states have call predecessors, (134), 18 states have return successors, (132), 127 states have call predecessors, (132), 132 states have call successors, (132) Second operand 341 states. [2022-04-14 14:54:04,168 INFO L87 Difference]: Start difference. First operand has 336 states, 183 states have (on average 1.2131147540983607) internal successors, (222), 189 states have internal predecessors, (222), 134 states have call successors, (134), 19 states have call predecessors, (134), 18 states have return successors, (132), 127 states have call predecessors, (132), 132 states have call successors, (132) Second operand 341 states. [2022-04-14 14:54:04,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:54:04,181 INFO L93 Difference]: Finished difference Result 341 states and 493 transitions. [2022-04-14 14:54:04,181 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 493 transitions. [2022-04-14 14:54:04,183 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 14:54:04,183 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 14:54:04,183 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 14:54:04,183 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 14:54:04,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 336 states, 183 states have (on average 1.2131147540983607) internal successors, (222), 189 states have internal predecessors, (222), 134 states have call successors, (134), 19 states have call predecessors, (134), 18 states have return successors, (132), 127 states have call predecessors, (132), 132 states have call successors, (132) [2022-04-14 14:54:04,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 488 transitions. [2022-04-14 14:54:04,198 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 488 transitions. Word has length 96 [2022-04-14 14:54:04,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 14:54:04,198 INFO L478 AbstractCegarLoop]: Abstraction has 336 states and 488 transitions. [2022-04-14 14:54:04,198 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.1666666666666665) internal successors, (39), 16 states have internal predecessors, (39), 13 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (29), 11 states have call predecessors, (29), 12 states have call successors, (29) [2022-04-14 14:54:04,198 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 488 transitions. [2022-04-14 14:54:04,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-04-14 14:54:04,199 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 14:54:04,200 INFO L499 BasicCegarLoop]: trace histogram [12, 11, 11, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 14:54:04,224 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-14 14:54:04,424 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-04-14 14:54:04,424 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 14:54:04,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 14:54:04,425 INFO L85 PathProgramCache]: Analyzing trace with hash -452504748, now seen corresponding path program 4 times [2022-04-14 14:54:04,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 14:54:04,425 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089635160] [2022-04-14 14:54:04,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 14:54:04,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 14:54:04,436 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 14:54:04,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1848731347] [2022-04-14 14:54:04,436 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-14 14:54:04,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 14:54:04,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 14:54:04,443 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-14 14:54:04,447 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-14 14:54:04,489 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-14 14:54:04,490 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-14 14:54:04,490 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-14 14:54:04,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:54:04,509 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 14:54:04,740 INFO L272 TraceCheckUtils]: 0: Hoare triple {11623#true} call ULTIMATE.init(); {11623#true} is VALID [2022-04-14 14:54:04,740 INFO L290 TraceCheckUtils]: 1: Hoare triple {11623#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(11, 2);call #Ultimate.allocInit(12, 3); {11623#true} is VALID [2022-04-14 14:54:04,740 INFO L290 TraceCheckUtils]: 2: Hoare triple {11623#true} assume true; {11623#true} is VALID [2022-04-14 14:54:04,740 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11623#true} {11623#true} #96#return; {11623#true} is VALID [2022-04-14 14:54:04,740 INFO L272 TraceCheckUtils]: 4: Hoare triple {11623#true} call #t~ret6 := main(); {11623#true} is VALID [2022-04-14 14:54:04,740 INFO L290 TraceCheckUtils]: 5: Hoare triple {11623#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~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; {11623#true} is VALID [2022-04-14 14:54:04,740 INFO L272 TraceCheckUtils]: 6: Hoare triple {11623#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {11623#true} is VALID [2022-04-14 14:54:04,740 INFO L290 TraceCheckUtils]: 7: Hoare triple {11623#true} ~cond := #in~cond; {11623#true} is VALID [2022-04-14 14:54:04,741 INFO L290 TraceCheckUtils]: 8: Hoare triple {11623#true} assume !(0 == ~cond); {11623#true} is VALID [2022-04-14 14:54:04,741 INFO L290 TraceCheckUtils]: 9: Hoare triple {11623#true} assume true; {11623#true} is VALID [2022-04-14 14:54:04,741 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {11623#true} {11623#true} #76#return; {11623#true} is VALID [2022-04-14 14:54:04,741 INFO L272 TraceCheckUtils]: 11: Hoare triple {11623#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {11623#true} is VALID [2022-04-14 14:54:04,741 INFO L290 TraceCheckUtils]: 12: Hoare triple {11623#true} ~cond := #in~cond; {11623#true} is VALID [2022-04-14 14:54:04,741 INFO L290 TraceCheckUtils]: 13: Hoare triple {11623#true} assume !(0 == ~cond); {11623#true} is VALID [2022-04-14 14:54:04,741 INFO L290 TraceCheckUtils]: 14: Hoare triple {11623#true} assume true; {11623#true} is VALID [2022-04-14 14:54:04,741 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {11623#true} {11623#true} #78#return; {11623#true} is VALID [2022-04-14 14:54:04,741 INFO L290 TraceCheckUtils]: 16: Hoare triple {11623#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {11623#true} is VALID [2022-04-14 14:54:04,741 INFO L272 TraceCheckUtils]: 17: Hoare triple {11623#true} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {11623#true} is VALID [2022-04-14 14:54:04,741 INFO L290 TraceCheckUtils]: 18: Hoare triple {11623#true} ~cond := #in~cond; {11623#true} is VALID [2022-04-14 14:54:04,741 INFO L290 TraceCheckUtils]: 19: Hoare triple {11623#true} assume !(0 == ~cond); {11623#true} is VALID [2022-04-14 14:54:04,741 INFO L290 TraceCheckUtils]: 20: Hoare triple {11623#true} assume true; {11623#true} is VALID [2022-04-14 14:54:04,741 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {11623#true} {11623#true} #80#return; {11623#true} is VALID [2022-04-14 14:54:04,741 INFO L272 TraceCheckUtils]: 22: Hoare triple {11623#true} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {11623#true} is VALID [2022-04-14 14:54:04,742 INFO L290 TraceCheckUtils]: 23: Hoare triple {11623#true} ~cond := #in~cond; {11623#true} is VALID [2022-04-14 14:54:04,742 INFO L290 TraceCheckUtils]: 24: Hoare triple {11623#true} assume !(0 == ~cond); {11623#true} is VALID [2022-04-14 14:54:04,742 INFO L290 TraceCheckUtils]: 25: Hoare triple {11623#true} assume true; {11623#true} is VALID [2022-04-14 14:54:04,742 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {11623#true} {11623#true} #82#return; {11623#true} is VALID [2022-04-14 14:54:04,742 INFO L290 TraceCheckUtils]: 27: Hoare triple {11623#true} assume !false; {11623#true} is VALID [2022-04-14 14:54:04,742 INFO L290 TraceCheckUtils]: 28: Hoare triple {11623#true} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {11623#true} is VALID [2022-04-14 14:54:04,742 INFO L290 TraceCheckUtils]: 29: Hoare triple {11623#true} assume !false; {11623#true} is VALID [2022-04-14 14:54:04,742 INFO L272 TraceCheckUtils]: 30: Hoare triple {11623#true} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {11623#true} is VALID [2022-04-14 14:54:04,742 INFO L290 TraceCheckUtils]: 31: Hoare triple {11623#true} ~cond := #in~cond; {11623#true} is VALID [2022-04-14 14:54:04,742 INFO L290 TraceCheckUtils]: 32: Hoare triple {11623#true} assume !(0 == ~cond); {11623#true} is VALID [2022-04-14 14:54:04,742 INFO L290 TraceCheckUtils]: 33: Hoare triple {11623#true} assume true; {11623#true} is VALID [2022-04-14 14:54:04,743 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {11623#true} {11623#true} #84#return; {11623#true} is VALID [2022-04-14 14:54:04,743 INFO L272 TraceCheckUtils]: 35: Hoare triple {11623#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {11623#true} is VALID [2022-04-14 14:54:04,743 INFO L290 TraceCheckUtils]: 36: Hoare triple {11623#true} ~cond := #in~cond; {11623#true} is VALID [2022-04-14 14:54:04,743 INFO L290 TraceCheckUtils]: 37: Hoare triple {11623#true} assume !(0 == ~cond); {11623#true} is VALID [2022-04-14 14:54:04,743 INFO L290 TraceCheckUtils]: 38: Hoare triple {11623#true} assume true; {11623#true} is VALID [2022-04-14 14:54:04,743 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {11623#true} {11623#true} #86#return; {11623#true} is VALID [2022-04-14 14:54:04,743 INFO L272 TraceCheckUtils]: 40: Hoare triple {11623#true} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {11623#true} is VALID [2022-04-14 14:54:04,743 INFO L290 TraceCheckUtils]: 41: Hoare triple {11623#true} ~cond := #in~cond; {11623#true} is VALID [2022-04-14 14:54:04,743 INFO L290 TraceCheckUtils]: 42: Hoare triple {11623#true} assume !(0 == ~cond); {11623#true} is VALID [2022-04-14 14:54:04,743 INFO L290 TraceCheckUtils]: 43: Hoare triple {11623#true} assume true; {11623#true} is VALID [2022-04-14 14:54:04,744 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {11623#true} {11623#true} #88#return; {11623#true} is VALID [2022-04-14 14:54:04,744 INFO L272 TraceCheckUtils]: 45: Hoare triple {11623#true} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {11623#true} is VALID [2022-04-14 14:54:04,744 INFO L290 TraceCheckUtils]: 46: Hoare triple {11623#true} ~cond := #in~cond; {11623#true} is VALID [2022-04-14 14:54:04,744 INFO L290 TraceCheckUtils]: 47: Hoare triple {11623#true} assume !(0 == ~cond); {11623#true} is VALID [2022-04-14 14:54:04,744 INFO L290 TraceCheckUtils]: 48: Hoare triple {11623#true} assume true; {11623#true} is VALID [2022-04-14 14:54:04,744 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {11623#true} {11623#true} #90#return; {11623#true} is VALID [2022-04-14 14:54:04,751 INFO L290 TraceCheckUtils]: 50: Hoare triple {11623#true} assume !(~c~0 >= ~b~0); {11778#(not (<= main_~b~0 main_~c~0))} is VALID [2022-04-14 14:54:04,752 INFO L290 TraceCheckUtils]: 51: Hoare triple {11778#(not (<= main_~b~0 main_~c~0))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {11782#(< main_~b~0 main_~a~0)} is VALID [2022-04-14 14:54:04,752 INFO L290 TraceCheckUtils]: 52: Hoare triple {11782#(< main_~b~0 main_~a~0)} assume !false; {11782#(< main_~b~0 main_~a~0)} is VALID [2022-04-14 14:54:04,752 INFO L290 TraceCheckUtils]: 53: Hoare triple {11782#(< main_~b~0 main_~a~0)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {11789#(< main_~b~0 main_~c~0)} is VALID [2022-04-14 14:54:04,753 INFO L290 TraceCheckUtils]: 54: Hoare triple {11789#(< main_~b~0 main_~c~0)} assume !false; {11789#(< main_~b~0 main_~c~0)} is VALID [2022-04-14 14:54:04,753 INFO L272 TraceCheckUtils]: 55: Hoare triple {11789#(< main_~b~0 main_~c~0)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {11623#true} is VALID [2022-04-14 14:54:04,753 INFO L290 TraceCheckUtils]: 56: Hoare triple {11623#true} ~cond := #in~cond; {11623#true} is VALID [2022-04-14 14:54:04,753 INFO L290 TraceCheckUtils]: 57: Hoare triple {11623#true} assume !(0 == ~cond); {11623#true} is VALID [2022-04-14 14:54:04,753 INFO L290 TraceCheckUtils]: 58: Hoare triple {11623#true} assume true; {11623#true} is VALID [2022-04-14 14:54:04,754 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {11623#true} {11789#(< main_~b~0 main_~c~0)} #84#return; {11789#(< main_~b~0 main_~c~0)} is VALID [2022-04-14 14:54:04,754 INFO L272 TraceCheckUtils]: 60: Hoare triple {11789#(< main_~b~0 main_~c~0)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {11623#true} is VALID [2022-04-14 14:54:04,754 INFO L290 TraceCheckUtils]: 61: Hoare triple {11623#true} ~cond := #in~cond; {11623#true} is VALID [2022-04-14 14:54:04,754 INFO L290 TraceCheckUtils]: 62: Hoare triple {11623#true} assume !(0 == ~cond); {11623#true} is VALID [2022-04-14 14:54:04,754 INFO L290 TraceCheckUtils]: 63: Hoare triple {11623#true} assume true; {11623#true} is VALID [2022-04-14 14:54:04,755 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {11623#true} {11789#(< main_~b~0 main_~c~0)} #86#return; {11789#(< main_~b~0 main_~c~0)} is VALID [2022-04-14 14:54:04,755 INFO L272 TraceCheckUtils]: 65: Hoare triple {11789#(< main_~b~0 main_~c~0)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {11623#true} is VALID [2022-04-14 14:54:04,755 INFO L290 TraceCheckUtils]: 66: Hoare triple {11623#true} ~cond := #in~cond; {11623#true} is VALID [2022-04-14 14:54:04,755 INFO L290 TraceCheckUtils]: 67: Hoare triple {11623#true} assume !(0 == ~cond); {11623#true} is VALID [2022-04-14 14:54:04,755 INFO L290 TraceCheckUtils]: 68: Hoare triple {11623#true} assume true; {11623#true} is VALID [2022-04-14 14:54:04,756 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {11623#true} {11789#(< main_~b~0 main_~c~0)} #88#return; {11789#(< main_~b~0 main_~c~0)} is VALID [2022-04-14 14:54:04,756 INFO L272 TraceCheckUtils]: 70: Hoare triple {11789#(< main_~b~0 main_~c~0)} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {11623#true} is VALID [2022-04-14 14:54:04,756 INFO L290 TraceCheckUtils]: 71: Hoare triple {11623#true} ~cond := #in~cond; {11623#true} is VALID [2022-04-14 14:54:04,756 INFO L290 TraceCheckUtils]: 72: Hoare triple {11623#true} assume !(0 == ~cond); {11623#true} is VALID [2022-04-14 14:54:04,756 INFO L290 TraceCheckUtils]: 73: Hoare triple {11623#true} assume true; {11623#true} is VALID [2022-04-14 14:54:04,757 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {11623#true} {11789#(< main_~b~0 main_~c~0)} #90#return; {11789#(< main_~b~0 main_~c~0)} is VALID [2022-04-14 14:54:04,758 INFO L290 TraceCheckUtils]: 75: Hoare triple {11789#(< main_~b~0 main_~c~0)} assume !(~c~0 >= ~b~0); {11624#false} is VALID [2022-04-14 14:54:04,758 INFO L290 TraceCheckUtils]: 76: Hoare triple {11624#false} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {11624#false} is VALID [2022-04-14 14:54:04,758 INFO L290 TraceCheckUtils]: 77: Hoare triple {11624#false} assume !false; {11624#false} is VALID [2022-04-14 14:54:04,758 INFO L290 TraceCheckUtils]: 78: Hoare triple {11624#false} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {11624#false} is VALID [2022-04-14 14:54:04,758 INFO L290 TraceCheckUtils]: 79: Hoare triple {11624#false} assume !false; {11624#false} is VALID [2022-04-14 14:54:04,758 INFO L272 TraceCheckUtils]: 80: Hoare triple {11624#false} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {11624#false} is VALID [2022-04-14 14:54:04,758 INFO L290 TraceCheckUtils]: 81: Hoare triple {11624#false} ~cond := #in~cond; {11624#false} is VALID [2022-04-14 14:54:04,758 INFO L290 TraceCheckUtils]: 82: Hoare triple {11624#false} assume !(0 == ~cond); {11624#false} is VALID [2022-04-14 14:54:04,759 INFO L290 TraceCheckUtils]: 83: Hoare triple {11624#false} assume true; {11624#false} is VALID [2022-04-14 14:54:04,759 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {11624#false} {11624#false} #84#return; {11624#false} is VALID [2022-04-14 14:54:04,759 INFO L272 TraceCheckUtils]: 85: Hoare triple {11624#false} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {11624#false} is VALID [2022-04-14 14:54:04,759 INFO L290 TraceCheckUtils]: 86: Hoare triple {11624#false} ~cond := #in~cond; {11624#false} is VALID [2022-04-14 14:54:04,759 INFO L290 TraceCheckUtils]: 87: Hoare triple {11624#false} assume !(0 == ~cond); {11624#false} is VALID [2022-04-14 14:54:04,759 INFO L290 TraceCheckUtils]: 88: Hoare triple {11624#false} assume true; {11624#false} is VALID [2022-04-14 14:54:04,759 INFO L284 TraceCheckUtils]: 89: Hoare quadruple {11624#false} {11624#false} #86#return; {11624#false} is VALID [2022-04-14 14:54:04,759 INFO L272 TraceCheckUtils]: 90: Hoare triple {11624#false} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {11624#false} is VALID [2022-04-14 14:54:04,759 INFO L290 TraceCheckUtils]: 91: Hoare triple {11624#false} ~cond := #in~cond; {11624#false} is VALID [2022-04-14 14:54:04,759 INFO L290 TraceCheckUtils]: 92: Hoare triple {11624#false} assume !(0 == ~cond); {11624#false} is VALID [2022-04-14 14:54:04,759 INFO L290 TraceCheckUtils]: 93: Hoare triple {11624#false} assume true; {11624#false} is VALID [2022-04-14 14:54:04,760 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {11624#false} {11624#false} #88#return; {11624#false} is VALID [2022-04-14 14:54:04,760 INFO L272 TraceCheckUtils]: 95: Hoare triple {11624#false} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {11624#false} is VALID [2022-04-14 14:54:04,760 INFO L290 TraceCheckUtils]: 96: Hoare triple {11624#false} ~cond := #in~cond; {11624#false} is VALID [2022-04-14 14:54:04,760 INFO L290 TraceCheckUtils]: 97: Hoare triple {11624#false} assume 0 == ~cond; {11624#false} is VALID [2022-04-14 14:54:04,760 INFO L290 TraceCheckUtils]: 98: Hoare triple {11624#false} assume !false; {11624#false} is VALID [2022-04-14 14:54:04,760 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 135 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2022-04-14 14:54:04,760 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-14 14:54:04,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 14:54:04,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089635160] [2022-04-14 14:54:04,761 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 14:54:04,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1848731347] [2022-04-14 14:54:04,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1848731347] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 14:54:04,761 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 14:54:04,761 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-14 14:54:04,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476077577] [2022-04-14 14:54:04,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 14:54:04,762 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 3 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) Word has length 99 [2022-04-14 14:54:04,762 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 14:54:04,762 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 3 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2022-04-14 14:54:04,820 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-14 14:54:04,821 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-14 14:54:04,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 14:54:04,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-14 14:54:04,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-14 14:54:04,822 INFO L87 Difference]: Start difference. First operand 336 states and 488 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 3 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2022-04-14 14:54:05,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:54:05,427 INFO L93 Difference]: Finished difference Result 410 states and 590 transitions. [2022-04-14 14:54:05,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-14 14:54:05,427 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 3 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) Word has length 99 [2022-04-14 14:54:05,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 14:54:05,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 3 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2022-04-14 14:54:05,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 85 transitions. [2022-04-14 14:54:05,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 3 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2022-04-14 14:54:05,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 85 transitions. [2022-04-14 14:54:05,430 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 85 transitions. [2022-04-14 14:54:05,495 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 14:54:05,500 INFO L225 Difference]: With dead ends: 410 [2022-04-14 14:54:05,500 INFO L226 Difference]: Without dead ends: 239 [2022-04-14 14:54:05,501 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-04-14 14:54:05,502 INFO L913 BasicCegarLoop]: 51 mSDtfsCounter, 6 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-14 14:54:05,502 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 141 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-14 14:54:05,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2022-04-14 14:54:05,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 215. [2022-04-14 14:54:05,823 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 14:54:05,827 INFO L82 GeneralOperation]: Start isEquivalent. First operand 239 states. Second operand has 215 states, 117 states have (on average 1.1367521367521367) internal successors, (133), 119 states have internal predecessors, (133), 79 states have call successors, (79), 19 states have call predecessors, (79), 18 states have return successors, (77), 76 states have call predecessors, (77), 77 states have call successors, (77) [2022-04-14 14:54:05,828 INFO L74 IsIncluded]: Start isIncluded. First operand 239 states. Second operand has 215 states, 117 states have (on average 1.1367521367521367) internal successors, (133), 119 states have internal predecessors, (133), 79 states have call successors, (79), 19 states have call predecessors, (79), 18 states have return successors, (77), 76 states have call predecessors, (77), 77 states have call successors, (77) [2022-04-14 14:54:05,828 INFO L87 Difference]: Start difference. First operand 239 states. Second operand has 215 states, 117 states have (on average 1.1367521367521367) internal successors, (133), 119 states have internal predecessors, (133), 79 states have call successors, (79), 19 states have call predecessors, (79), 18 states have return successors, (77), 76 states have call predecessors, (77), 77 states have call successors, (77) [2022-04-14 14:54:05,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:54:05,835 INFO L93 Difference]: Finished difference Result 239 states and 323 transitions. [2022-04-14 14:54:05,835 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 323 transitions. [2022-04-14 14:54:05,836 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 14:54:05,836 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 14:54:05,837 INFO L74 IsIncluded]: Start isIncluded. First operand has 215 states, 117 states have (on average 1.1367521367521367) internal successors, (133), 119 states have internal predecessors, (133), 79 states have call successors, (79), 19 states have call predecessors, (79), 18 states have return successors, (77), 76 states have call predecessors, (77), 77 states have call successors, (77) Second operand 239 states. [2022-04-14 14:54:05,837 INFO L87 Difference]: Start difference. First operand has 215 states, 117 states have (on average 1.1367521367521367) internal successors, (133), 119 states have internal predecessors, (133), 79 states have call successors, (79), 19 states have call predecessors, (79), 18 states have return successors, (77), 76 states have call predecessors, (77), 77 states have call successors, (77) Second operand 239 states. [2022-04-14 14:54:05,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:54:05,845 INFO L93 Difference]: Finished difference Result 239 states and 323 transitions. [2022-04-14 14:54:05,845 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 323 transitions. [2022-04-14 14:54:05,846 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 14:54:05,846 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 14:54:05,846 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 14:54:05,846 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 14:54:05,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 117 states have (on average 1.1367521367521367) internal successors, (133), 119 states have internal predecessors, (133), 79 states have call successors, (79), 19 states have call predecessors, (79), 18 states have return successors, (77), 76 states have call predecessors, (77), 77 states have call successors, (77) [2022-04-14 14:54:05,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 289 transitions. [2022-04-14 14:54:05,853 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 289 transitions. Word has length 99 [2022-04-14 14:54:05,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 14:54:05,854 INFO L478 AbstractCegarLoop]: Abstraction has 215 states and 289 transitions. [2022-04-14 14:54:05,854 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 3 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2022-04-14 14:54:05,854 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 289 transitions. [2022-04-14 14:54:05,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-04-14 14:54:05,855 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 14:54:05,855 INFO L499 BasicCegarLoop]: trace histogram [15, 14, 14, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 14:54:05,885 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-14 14:54:06,079 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-04-14 14:54:06,080 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 14:54:06,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 14:54:06,080 INFO L85 PathProgramCache]: Analyzing trace with hash -1295483154, now seen corresponding path program 2 times [2022-04-14 14:54:06,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 14:54:06,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126239471] [2022-04-14 14:54:06,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 14:54:06,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 14:54:06,103 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 14:54:06,103 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2117696336] [2022-04-14 14:54:06,103 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-14 14:54:06,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 14:54:06,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 14:54:06,107 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-14 14:54:06,108 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-04-14 14:54:06,177 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-14 14:54:06,178 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-14 14:54:06,180 INFO L263 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 76 conjunts are in the unsatisfiable core [2022-04-14 14:54:06,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:54:06,202 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 14:54:07,458 INFO L272 TraceCheckUtils]: 0: Hoare triple {13405#true} call ULTIMATE.init(); {13405#true} is VALID [2022-04-14 14:54:07,458 INFO L290 TraceCheckUtils]: 1: Hoare triple {13405#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(11, 2);call #Ultimate.allocInit(12, 3); {13405#true} is VALID [2022-04-14 14:54:07,458 INFO L290 TraceCheckUtils]: 2: Hoare triple {13405#true} assume true; {13405#true} is VALID [2022-04-14 14:54:07,458 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13405#true} {13405#true} #96#return; {13405#true} is VALID [2022-04-14 14:54:07,458 INFO L272 TraceCheckUtils]: 4: Hoare triple {13405#true} call #t~ret6 := main(); {13405#true} is VALID [2022-04-14 14:54:07,458 INFO L290 TraceCheckUtils]: 5: Hoare triple {13405#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~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; {13405#true} is VALID [2022-04-14 14:54:07,458 INFO L272 TraceCheckUtils]: 6: Hoare triple {13405#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {13405#true} is VALID [2022-04-14 14:54:07,458 INFO L290 TraceCheckUtils]: 7: Hoare triple {13405#true} ~cond := #in~cond; {13405#true} is VALID [2022-04-14 14:54:07,458 INFO L290 TraceCheckUtils]: 8: Hoare triple {13405#true} assume !(0 == ~cond); {13405#true} is VALID [2022-04-14 14:54:07,458 INFO L290 TraceCheckUtils]: 9: Hoare triple {13405#true} assume true; {13405#true} is VALID [2022-04-14 14:54:07,458 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {13405#true} {13405#true} #76#return; {13405#true} is VALID [2022-04-14 14:54:07,459 INFO L272 TraceCheckUtils]: 11: Hoare triple {13405#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {13405#true} is VALID [2022-04-14 14:54:07,459 INFO L290 TraceCheckUtils]: 12: Hoare triple {13405#true} ~cond := #in~cond; {13405#true} is VALID [2022-04-14 14:54:07,459 INFO L290 TraceCheckUtils]: 13: Hoare triple {13405#true} assume !(0 == ~cond); {13405#true} is VALID [2022-04-14 14:54:07,459 INFO L290 TraceCheckUtils]: 14: Hoare triple {13405#true} assume true; {13405#true} is VALID [2022-04-14 14:54:07,459 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {13405#true} {13405#true} #78#return; {13405#true} is VALID [2022-04-14 14:54:07,459 INFO L290 TraceCheckUtils]: 16: Hoare triple {13405#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {13458#(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-14 14:54:07,459 INFO L272 TraceCheckUtils]: 17: Hoare triple {13458#(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 assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {13405#true} is VALID [2022-04-14 14:54:07,459 INFO L290 TraceCheckUtils]: 18: Hoare triple {13405#true} ~cond := #in~cond; {13405#true} is VALID [2022-04-14 14:54:07,459 INFO L290 TraceCheckUtils]: 19: Hoare triple {13405#true} assume !(0 == ~cond); {13405#true} is VALID [2022-04-14 14:54:07,459 INFO L290 TraceCheckUtils]: 20: Hoare triple {13405#true} assume true; {13405#true} is VALID [2022-04-14 14:54:07,460 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {13405#true} {13458#(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))} #80#return; {13458#(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-14 14:54:07,460 INFO L272 TraceCheckUtils]: 22: Hoare triple {13458#(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 assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {13405#true} is VALID [2022-04-14 14:54:07,460 INFO L290 TraceCheckUtils]: 23: Hoare triple {13405#true} ~cond := #in~cond; {13405#true} is VALID [2022-04-14 14:54:07,460 INFO L290 TraceCheckUtils]: 24: Hoare triple {13405#true} assume !(0 == ~cond); {13405#true} is VALID [2022-04-14 14:54:07,460 INFO L290 TraceCheckUtils]: 25: Hoare triple {13405#true} assume true; {13405#true} is VALID [2022-04-14 14:54:07,461 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {13405#true} {13458#(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))} #82#return; {13458#(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-14 14:54:07,461 INFO L290 TraceCheckUtils]: 27: Hoare triple {13458#(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 !false; {13458#(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-14 14:54:07,462 INFO L290 TraceCheckUtils]: 28: Hoare triple {13458#(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 !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {13495#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~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-14 14:54:07,462 INFO L290 TraceCheckUtils]: 29: Hoare triple {13495#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~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 !false; {13495#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~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-14 14:54:07,462 INFO L272 TraceCheckUtils]: 30: Hoare triple {13495#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~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 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {13405#true} is VALID [2022-04-14 14:54:07,462 INFO L290 TraceCheckUtils]: 31: Hoare triple {13405#true} ~cond := #in~cond; {13405#true} is VALID [2022-04-14 14:54:07,462 INFO L290 TraceCheckUtils]: 32: Hoare triple {13405#true} assume !(0 == ~cond); {13405#true} is VALID [2022-04-14 14:54:07,462 INFO L290 TraceCheckUtils]: 33: Hoare triple {13405#true} assume true; {13405#true} is VALID [2022-04-14 14:54:07,463 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {13405#true} {13495#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~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))} #84#return; {13495#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~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-14 14:54:07,463 INFO L272 TraceCheckUtils]: 35: Hoare triple {13495#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~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)); {13405#true} is VALID [2022-04-14 14:54:07,463 INFO L290 TraceCheckUtils]: 36: Hoare triple {13405#true} ~cond := #in~cond; {13520#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-14 14:54:07,464 INFO L290 TraceCheckUtils]: 37: Hoare triple {13520#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {13524#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 14:54:07,464 INFO L290 TraceCheckUtils]: 38: Hoare triple {13524#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {13524#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 14:54:07,465 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {13524#(not (= |__VERIFIER_assert_#in~cond| 0))} {13495#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~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))} #86#return; {13531#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 14:54:07,465 INFO L272 TraceCheckUtils]: 40: Hoare triple {13531#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~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)); {13405#true} is VALID [2022-04-14 14:54:07,465 INFO L290 TraceCheckUtils]: 41: Hoare triple {13405#true} ~cond := #in~cond; {13520#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-14 14:54:07,465 INFO L290 TraceCheckUtils]: 42: Hoare triple {13520#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {13524#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 14:54:07,466 INFO L290 TraceCheckUtils]: 43: Hoare triple {13524#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {13524#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 14:54:07,466 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {13524#(not (= |__VERIFIER_assert_#in~cond| 0))} {13531#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #88#return; {13531#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 14:54:07,466 INFO L272 TraceCheckUtils]: 45: Hoare triple {13531#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {13405#true} is VALID [2022-04-14 14:54:07,466 INFO L290 TraceCheckUtils]: 46: Hoare triple {13405#true} ~cond := #in~cond; {13405#true} is VALID [2022-04-14 14:54:07,467 INFO L290 TraceCheckUtils]: 47: Hoare triple {13405#true} assume !(0 == ~cond); {13405#true} is VALID [2022-04-14 14:54:07,467 INFO L290 TraceCheckUtils]: 48: Hoare triple {13405#true} assume true; {13405#true} is VALID [2022-04-14 14:54:07,467 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {13405#true} {13531#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #90#return; {13531#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 14:54:07,468 INFO L290 TraceCheckUtils]: 50: Hoare triple {13531#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} assume !(~c~0 >= ~b~0); {13531#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 14:54:07,468 INFO L290 TraceCheckUtils]: 51: Hoare triple {13531#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {13568#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-14 14:54:07,469 INFO L290 TraceCheckUtils]: 52: Hoare triple {13568#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} assume !false; {13568#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-14 14:54:07,469 INFO L290 TraceCheckUtils]: 53: Hoare triple {13568#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {13575#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-14 14:54:07,470 INFO L290 TraceCheckUtils]: 54: Hoare triple {13575#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} assume !false; {13575#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-14 14:54:07,470 INFO L272 TraceCheckUtils]: 55: Hoare triple {13575#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {13405#true} is VALID [2022-04-14 14:54:07,470 INFO L290 TraceCheckUtils]: 56: Hoare triple {13405#true} ~cond := #in~cond; {13405#true} is VALID [2022-04-14 14:54:07,470 INFO L290 TraceCheckUtils]: 57: Hoare triple {13405#true} assume !(0 == ~cond); {13405#true} is VALID [2022-04-14 14:54:07,470 INFO L290 TraceCheckUtils]: 58: Hoare triple {13405#true} assume true; {13405#true} is VALID [2022-04-14 14:54:07,470 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {13405#true} {13575#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} #84#return; {13575#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-14 14:54:07,471 INFO L272 TraceCheckUtils]: 60: Hoare triple {13575#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {13405#true} is VALID [2022-04-14 14:54:07,471 INFO L290 TraceCheckUtils]: 61: Hoare triple {13405#true} ~cond := #in~cond; {13405#true} is VALID [2022-04-14 14:54:07,471 INFO L290 TraceCheckUtils]: 62: Hoare triple {13405#true} assume !(0 == ~cond); {13405#true} is VALID [2022-04-14 14:54:07,471 INFO L290 TraceCheckUtils]: 63: Hoare triple {13405#true} assume true; {13405#true} is VALID [2022-04-14 14:54:07,471 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {13405#true} {13575#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} #86#return; {13575#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-14 14:54:07,471 INFO L272 TraceCheckUtils]: 65: Hoare triple {13575#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {13405#true} is VALID [2022-04-14 14:54:07,472 INFO L290 TraceCheckUtils]: 66: Hoare triple {13405#true} ~cond := #in~cond; {13405#true} is VALID [2022-04-14 14:54:07,472 INFO L290 TraceCheckUtils]: 67: Hoare triple {13405#true} assume !(0 == ~cond); {13405#true} is VALID [2022-04-14 14:54:07,472 INFO L290 TraceCheckUtils]: 68: Hoare triple {13405#true} assume true; {13405#true} is VALID [2022-04-14 14:54:07,472 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {13405#true} {13575#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} #88#return; {13575#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-14 14:54:07,472 INFO L272 TraceCheckUtils]: 70: Hoare triple {13575#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {13405#true} is VALID [2022-04-14 14:54:07,472 INFO L290 TraceCheckUtils]: 71: Hoare triple {13405#true} ~cond := #in~cond; {13405#true} is VALID [2022-04-14 14:54:07,472 INFO L290 TraceCheckUtils]: 72: Hoare triple {13405#true} assume !(0 == ~cond); {13405#true} is VALID [2022-04-14 14:54:07,473 INFO L290 TraceCheckUtils]: 73: Hoare triple {13405#true} assume true; {13405#true} is VALID [2022-04-14 14:54:07,473 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {13405#true} {13575#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} #90#return; {13575#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-14 14:54:07,474 INFO L290 TraceCheckUtils]: 75: Hoare triple {13575#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {13642#(and (= main_~s~0 0) (= main_~p~0 0) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-14 14:54:07,475 INFO L290 TraceCheckUtils]: 76: Hoare triple {13642#(and (= main_~s~0 0) (= main_~p~0 0) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} assume !false; {13642#(and (= main_~s~0 0) (= main_~p~0 0) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-14 14:54:07,475 INFO L272 TraceCheckUtils]: 77: Hoare triple {13642#(and (= main_~s~0 0) (= main_~p~0 0) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {13405#true} is VALID [2022-04-14 14:54:07,475 INFO L290 TraceCheckUtils]: 78: Hoare triple {13405#true} ~cond := #in~cond; {13520#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-14 14:54:07,475 INFO L290 TraceCheckUtils]: 79: Hoare triple {13520#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {13524#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 14:54:07,476 INFO L290 TraceCheckUtils]: 80: Hoare triple {13524#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {13524#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 14:54:07,476 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {13524#(not (= |__VERIFIER_assert_#in~cond| 0))} {13642#(and (= main_~s~0 0) (= main_~p~0 0) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} #84#return; {13661#(and (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~s~0 0) (= main_~p~0 0) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-14 14:54:07,477 INFO L272 TraceCheckUtils]: 82: Hoare triple {13661#(and (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~s~0 0) (= main_~p~0 0) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {13405#true} is VALID [2022-04-14 14:54:07,477 INFO L290 TraceCheckUtils]: 83: Hoare triple {13405#true} ~cond := #in~cond; {13520#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-14 14:54:07,477 INFO L290 TraceCheckUtils]: 84: Hoare triple {13520#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {13524#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 14:54:07,477 INFO L290 TraceCheckUtils]: 85: Hoare triple {13524#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {13524#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 14:54:07,479 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {13524#(not (= |__VERIFIER_assert_#in~cond| 0))} {13661#(and (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~s~0 0) (= main_~p~0 0) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} #86#return; {13677#(and (= main_~s~0 0) (= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~p~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~q~0 1) (= main_~b~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-14 14:54:07,479 INFO L272 TraceCheckUtils]: 87: Hoare triple {13677#(and (= main_~s~0 0) (= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~p~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~q~0 1) (= main_~b~0 (* main_~b~0 main_~k~0)))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {13405#true} is VALID [2022-04-14 14:54:07,483 INFO L290 TraceCheckUtils]: 88: Hoare triple {13405#true} ~cond := #in~cond; {13520#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-14 14:54:07,484 INFO L290 TraceCheckUtils]: 89: Hoare triple {13520#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {13524#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 14:54:07,484 INFO L290 TraceCheckUtils]: 90: Hoare triple {13524#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {13524#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 14:54:07,487 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {13524#(not (= |__VERIFIER_assert_#in~cond| 0))} {13677#(and (= main_~s~0 0) (= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~p~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~q~0 1) (= main_~b~0 (* main_~b~0 main_~k~0)))} #88#return; {13693#(and (= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ (* main_~k~0 main_~y~0 main_~s~0) main_~c~0 (* main_~q~0 main_~k~0 main_~x~0))) (= main_~s~0 0) (= main_~p~0 0) (= (+ (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~r~0 1) (= main_~q~0 1))} is VALID [2022-04-14 14:54:07,487 INFO L272 TraceCheckUtils]: 92: Hoare triple {13693#(and (= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ (* main_~k~0 main_~y~0 main_~s~0) main_~c~0 (* main_~q~0 main_~k~0 main_~x~0))) (= main_~s~0 0) (= main_~p~0 0) (= (+ (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~r~0 1) (= main_~q~0 1))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {13405#true} is VALID [2022-04-14 14:54:07,487 INFO L290 TraceCheckUtils]: 93: Hoare triple {13405#true} ~cond := #in~cond; {13405#true} is VALID [2022-04-14 14:54:07,487 INFO L290 TraceCheckUtils]: 94: Hoare triple {13405#true} assume !(0 == ~cond); {13405#true} is VALID [2022-04-14 14:54:07,488 INFO L290 TraceCheckUtils]: 95: Hoare triple {13405#true} assume true; {13405#true} is VALID [2022-04-14 14:54:07,488 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {13405#true} {13693#(and (= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ (* main_~k~0 main_~y~0 main_~s~0) main_~c~0 (* main_~q~0 main_~k~0 main_~x~0))) (= main_~s~0 0) (= main_~p~0 0) (= (+ (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~r~0 1) (= main_~q~0 1))} #90#return; {13693#(and (= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ (* main_~k~0 main_~y~0 main_~s~0) main_~c~0 (* main_~q~0 main_~k~0 main_~x~0))) (= main_~s~0 0) (= main_~p~0 0) (= (+ (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~r~0 1) (= main_~q~0 1))} is VALID [2022-04-14 14:54:07,489 INFO L290 TraceCheckUtils]: 97: Hoare triple {13693#(and (= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ (* main_~k~0 main_~y~0 main_~s~0) main_~c~0 (* main_~q~0 main_~k~0 main_~x~0))) (= main_~s~0 0) (= main_~p~0 0) (= (+ (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~r~0 1) (= main_~q~0 1))} assume !(~c~0 >= ~b~0); {13693#(and (= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ (* main_~k~0 main_~y~0 main_~s~0) main_~c~0 (* main_~q~0 main_~k~0 main_~x~0))) (= main_~s~0 0) (= main_~p~0 0) (= (+ (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~r~0 1) (= main_~q~0 1))} is VALID [2022-04-14 14:54:07,491 INFO L290 TraceCheckUtils]: 98: Hoare triple {13693#(and (= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ (* main_~k~0 main_~y~0 main_~s~0) main_~c~0 (* main_~q~0 main_~k~0 main_~x~0))) (= main_~s~0 0) (= main_~p~0 0) (= (+ (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~r~0 1) (= main_~q~0 1))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {13715#(and (= main_~b~0 (+ (* main_~q~0 main_~x~0) main_~y~0)) (= main_~s~0 1) (= (+ (* main_~y~0 (* (- 1) main_~q~0) 0) (* main_~x~0 (* (- 1) main_~q~0) 1)) main_~x~0))} is VALID [2022-04-14 14:54:07,492 INFO L290 TraceCheckUtils]: 99: Hoare triple {13715#(and (= main_~b~0 (+ (* main_~q~0 main_~x~0) main_~y~0)) (= main_~s~0 1) (= (+ (* main_~y~0 (* (- 1) main_~q~0) 0) (* main_~x~0 (* (- 1) main_~q~0) 1)) main_~x~0))} assume !false; {13715#(and (= main_~b~0 (+ (* main_~q~0 main_~x~0) main_~y~0)) (= main_~s~0 1) (= (+ (* main_~y~0 (* (- 1) main_~q~0) 0) (* main_~x~0 (* (- 1) main_~q~0) 1)) main_~x~0))} is VALID [2022-04-14 14:54:07,492 INFO L290 TraceCheckUtils]: 100: Hoare triple {13715#(and (= main_~b~0 (+ (* main_~q~0 main_~x~0) main_~y~0)) (= main_~s~0 1) (= (+ (* main_~y~0 (* (- 1) main_~q~0) 0) (* main_~x~0 (* (- 1) main_~q~0) 1)) main_~x~0))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {13715#(and (= main_~b~0 (+ (* main_~q~0 main_~x~0) main_~y~0)) (= main_~s~0 1) (= (+ (* main_~y~0 (* (- 1) main_~q~0) 0) (* main_~x~0 (* (- 1) main_~q~0) 1)) main_~x~0))} is VALID [2022-04-14 14:54:07,493 INFO L290 TraceCheckUtils]: 101: Hoare triple {13715#(and (= main_~b~0 (+ (* main_~q~0 main_~x~0) main_~y~0)) (= main_~s~0 1) (= (+ (* main_~y~0 (* (- 1) main_~q~0) 0) (* main_~x~0 (* (- 1) main_~q~0) 1)) main_~x~0))} assume !false; {13715#(and (= main_~b~0 (+ (* main_~q~0 main_~x~0) main_~y~0)) (= main_~s~0 1) (= (+ (* main_~y~0 (* (- 1) main_~q~0) 0) (* main_~x~0 (* (- 1) main_~q~0) 1)) main_~x~0))} is VALID [2022-04-14 14:54:07,493 INFO L272 TraceCheckUtils]: 102: Hoare triple {13715#(and (= main_~b~0 (+ (* main_~q~0 main_~x~0) main_~y~0)) (= main_~s~0 1) (= (+ (* main_~y~0 (* (- 1) main_~q~0) 0) (* main_~x~0 (* (- 1) main_~q~0) 1)) main_~x~0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {13405#true} is VALID [2022-04-14 14:54:07,493 INFO L290 TraceCheckUtils]: 103: Hoare triple {13405#true} ~cond := #in~cond; {13405#true} is VALID [2022-04-14 14:54:07,493 INFO L290 TraceCheckUtils]: 104: Hoare triple {13405#true} assume !(0 == ~cond); {13405#true} is VALID [2022-04-14 14:54:07,493 INFO L290 TraceCheckUtils]: 105: Hoare triple {13405#true} assume true; {13405#true} is VALID [2022-04-14 14:54:07,494 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {13405#true} {13715#(and (= main_~b~0 (+ (* main_~q~0 main_~x~0) main_~y~0)) (= main_~s~0 1) (= (+ (* main_~y~0 (* (- 1) main_~q~0) 0) (* main_~x~0 (* (- 1) main_~q~0) 1)) main_~x~0))} #84#return; {13715#(and (= main_~b~0 (+ (* main_~q~0 main_~x~0) main_~y~0)) (= main_~s~0 1) (= (+ (* main_~y~0 (* (- 1) main_~q~0) 0) (* main_~x~0 (* (- 1) main_~q~0) 1)) main_~x~0))} is VALID [2022-04-14 14:54:07,494 INFO L272 TraceCheckUtils]: 107: Hoare triple {13715#(and (= main_~b~0 (+ (* main_~q~0 main_~x~0) main_~y~0)) (= main_~s~0 1) (= (+ (* main_~y~0 (* (- 1) main_~q~0) 0) (* main_~x~0 (* (- 1) main_~q~0) 1)) main_~x~0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {13405#true} is VALID [2022-04-14 14:54:07,494 INFO L290 TraceCheckUtils]: 108: Hoare triple {13405#true} ~cond := #in~cond; {13405#true} is VALID [2022-04-14 14:54:07,494 INFO L290 TraceCheckUtils]: 109: Hoare triple {13405#true} assume !(0 == ~cond); {13405#true} is VALID [2022-04-14 14:54:07,494 INFO L290 TraceCheckUtils]: 110: Hoare triple {13405#true} assume true; {13405#true} is VALID [2022-04-14 14:54:07,495 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {13405#true} {13715#(and (= main_~b~0 (+ (* main_~q~0 main_~x~0) main_~y~0)) (= main_~s~0 1) (= (+ (* main_~y~0 (* (- 1) main_~q~0) 0) (* main_~x~0 (* (- 1) main_~q~0) 1)) main_~x~0))} #86#return; {13715#(and (= main_~b~0 (+ (* main_~q~0 main_~x~0) main_~y~0)) (= main_~s~0 1) (= (+ (* main_~y~0 (* (- 1) main_~q~0) 0) (* main_~x~0 (* (- 1) main_~q~0) 1)) main_~x~0))} is VALID [2022-04-14 14:54:07,496 INFO L272 TraceCheckUtils]: 112: Hoare triple {13715#(and (= main_~b~0 (+ (* main_~q~0 main_~x~0) main_~y~0)) (= main_~s~0 1) (= (+ (* main_~y~0 (* (- 1) main_~q~0) 0) (* main_~x~0 (* (- 1) main_~q~0) 1)) main_~x~0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {13758#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 14:54:07,496 INFO L290 TraceCheckUtils]: 113: Hoare triple {13758#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {13762#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 14:54:07,496 INFO L290 TraceCheckUtils]: 114: Hoare triple {13762#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {13406#false} is VALID [2022-04-14 14:54:07,497 INFO L290 TraceCheckUtils]: 115: Hoare triple {13406#false} assume !false; {13406#false} is VALID [2022-04-14 14:54:07,497 INFO L134 CoverageAnalysis]: Checked inductivity of 453 backedges. 83 proven. 117 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2022-04-14 14:54:07,497 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 14:54:49,618 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-14 14:55:22,289 INFO L290 TraceCheckUtils]: 115: Hoare triple {13406#false} assume !false; {13406#false} is VALID [2022-04-14 14:55:22,289 INFO L290 TraceCheckUtils]: 114: Hoare triple {13762#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {13406#false} is VALID [2022-04-14 14:55:22,290 INFO L290 TraceCheckUtils]: 113: Hoare triple {13758#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {13762#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 14:55:22,290 INFO L272 TraceCheckUtils]: 112: Hoare triple {13778#(= 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)); {13758#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 14:55:22,291 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {13405#true} {13778#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #86#return; {13778#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-14 14:55:22,291 INFO L290 TraceCheckUtils]: 110: Hoare triple {13405#true} assume true; {13405#true} is VALID [2022-04-14 14:55:22,291 INFO L290 TraceCheckUtils]: 109: Hoare triple {13405#true} assume !(0 == ~cond); {13405#true} is VALID [2022-04-14 14:55:22,291 INFO L290 TraceCheckUtils]: 108: Hoare triple {13405#true} ~cond := #in~cond; {13405#true} is VALID [2022-04-14 14:55:22,291 INFO L272 TraceCheckUtils]: 107: Hoare triple {13778#(= 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)); {13405#true} is VALID [2022-04-14 14:55:22,292 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {13405#true} {13778#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #84#return; {13778#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-14 14:55:22,292 INFO L290 TraceCheckUtils]: 105: Hoare triple {13405#true} assume true; {13405#true} is VALID [2022-04-14 14:55:22,292 INFO L290 TraceCheckUtils]: 104: Hoare triple {13405#true} assume !(0 == ~cond); {13405#true} is VALID [2022-04-14 14:55:22,292 INFO L290 TraceCheckUtils]: 103: Hoare triple {13405#true} ~cond := #in~cond; {13405#true} is VALID [2022-04-14 14:55:22,292 INFO L272 TraceCheckUtils]: 102: Hoare triple {13778#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {13405#true} is VALID [2022-04-14 14:55:22,293 INFO L290 TraceCheckUtils]: 101: Hoare triple {13778#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !false; {13778#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-14 14:55:22,293 INFO L290 TraceCheckUtils]: 100: Hoare triple {13778#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {13778#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-14 14:55:22,294 INFO L290 TraceCheckUtils]: 99: Hoare triple {13778#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !false; {13778#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-14 14:55:23,586 INFO L290 TraceCheckUtils]: 98: Hoare triple {13821#(= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {13778#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-14 14:55:23,587 INFO L290 TraceCheckUtils]: 97: Hoare triple {13821#(= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)} assume !(~c~0 >= ~b~0); {13821#(= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)} is VALID [2022-04-14 14:55:23,587 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {13405#true} {13821#(= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)} #90#return; {13821#(= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)} is VALID [2022-04-14 14:55:23,588 INFO L290 TraceCheckUtils]: 95: Hoare triple {13405#true} assume true; {13405#true} is VALID [2022-04-14 14:55:23,588 INFO L290 TraceCheckUtils]: 94: Hoare triple {13405#true} assume !(0 == ~cond); {13405#true} is VALID [2022-04-14 14:55:23,588 INFO L290 TraceCheckUtils]: 93: Hoare triple {13405#true} ~cond := #in~cond; {13405#true} is VALID [2022-04-14 14:55:23,588 INFO L272 TraceCheckUtils]: 92: Hoare triple {13821#(= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {13405#true} is VALID [2022-04-14 14:55:23,589 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {13524#(not (= |__VERIFIER_assert_#in~cond| 0))} {13843#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} #88#return; {13821#(= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)} is VALID [2022-04-14 14:55:23,589 INFO L290 TraceCheckUtils]: 90: Hoare triple {13524#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {13524#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 14:55:23,589 INFO L290 TraceCheckUtils]: 89: Hoare triple {13853#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {13524#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 14:55:23,590 INFO L290 TraceCheckUtils]: 88: Hoare triple {13405#true} ~cond := #in~cond; {13853#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-14 14:55:23,590 INFO L272 TraceCheckUtils]: 87: Hoare triple {13843#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0) (not (= 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)); {13405#true} is VALID [2022-04-14 14:55:23,590 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {13524#(not (= |__VERIFIER_assert_#in~cond| 0))} {13860#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} #86#return; {13843#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is VALID [2022-04-14 14:55:23,591 INFO L290 TraceCheckUtils]: 85: Hoare triple {13524#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {13524#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 14:55:23,591 INFO L290 TraceCheckUtils]: 84: Hoare triple {13853#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {13524#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 14:55:23,591 INFO L290 TraceCheckUtils]: 83: Hoare triple {13405#true} ~cond := #in~cond; {13853#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-14 14:55:23,591 INFO L272 TraceCheckUtils]: 82: Hoare triple {13860#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= 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)); {13405#true} is VALID [2022-04-14 14:55:23,608 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {13524#(not (= |__VERIFIER_assert_#in~cond| 0))} {13405#true} #84#return; {13860#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is VALID [2022-04-14 14:55:23,609 INFO L290 TraceCheckUtils]: 80: Hoare triple {13524#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {13524#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 14:55:23,609 INFO L290 TraceCheckUtils]: 79: Hoare triple {13853#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {13524#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 14:55:23,609 INFO L290 TraceCheckUtils]: 78: Hoare triple {13405#true} ~cond := #in~cond; {13853#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-14 14:55:23,609 INFO L272 TraceCheckUtils]: 77: Hoare triple {13405#true} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {13405#true} is VALID [2022-04-14 14:55:23,609 INFO L290 TraceCheckUtils]: 76: Hoare triple {13405#true} assume !false; {13405#true} is VALID [2022-04-14 14:55:23,609 INFO L290 TraceCheckUtils]: 75: Hoare triple {13405#true} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {13405#true} is VALID [2022-04-14 14:55:23,609 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {13405#true} {13405#true} #90#return; {13405#true} is VALID [2022-04-14 14:55:23,610 INFO L290 TraceCheckUtils]: 73: Hoare triple {13405#true} assume true; {13405#true} is VALID [2022-04-14 14:55:23,610 INFO L290 TraceCheckUtils]: 72: Hoare triple {13405#true} assume !(0 == ~cond); {13405#true} is VALID [2022-04-14 14:55:23,610 INFO L290 TraceCheckUtils]: 71: Hoare triple {13405#true} ~cond := #in~cond; {13405#true} is VALID [2022-04-14 14:55:23,610 INFO L272 TraceCheckUtils]: 70: Hoare triple {13405#true} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {13405#true} is VALID [2022-04-14 14:55:23,610 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {13405#true} {13405#true} #88#return; {13405#true} is VALID [2022-04-14 14:55:23,610 INFO L290 TraceCheckUtils]: 68: Hoare triple {13405#true} assume true; {13405#true} is VALID [2022-04-14 14:55:23,610 INFO L290 TraceCheckUtils]: 67: Hoare triple {13405#true} assume !(0 == ~cond); {13405#true} is VALID [2022-04-14 14:55:23,610 INFO L290 TraceCheckUtils]: 66: Hoare triple {13405#true} ~cond := #in~cond; {13405#true} is VALID [2022-04-14 14:55:23,610 INFO L272 TraceCheckUtils]: 65: Hoare triple {13405#true} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {13405#true} is VALID [2022-04-14 14:55:23,610 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {13405#true} {13405#true} #86#return; {13405#true} is VALID [2022-04-14 14:55:23,610 INFO L290 TraceCheckUtils]: 63: Hoare triple {13405#true} assume true; {13405#true} is VALID [2022-04-14 14:55:23,610 INFO L290 TraceCheckUtils]: 62: Hoare triple {13405#true} assume !(0 == ~cond); {13405#true} is VALID [2022-04-14 14:55:23,610 INFO L290 TraceCheckUtils]: 61: Hoare triple {13405#true} ~cond := #in~cond; {13405#true} is VALID [2022-04-14 14:55:23,610 INFO L272 TraceCheckUtils]: 60: Hoare triple {13405#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {13405#true} is VALID [2022-04-14 14:55:23,610 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {13405#true} {13405#true} #84#return; {13405#true} is VALID [2022-04-14 14:55:23,610 INFO L290 TraceCheckUtils]: 58: Hoare triple {13405#true} assume true; {13405#true} is VALID [2022-04-14 14:55:23,611 INFO L290 TraceCheckUtils]: 57: Hoare triple {13405#true} assume !(0 == ~cond); {13405#true} is VALID [2022-04-14 14:55:23,611 INFO L290 TraceCheckUtils]: 56: Hoare triple {13405#true} ~cond := #in~cond; {13405#true} is VALID [2022-04-14 14:55:23,611 INFO L272 TraceCheckUtils]: 55: Hoare triple {13405#true} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {13405#true} is VALID [2022-04-14 14:55:23,611 INFO L290 TraceCheckUtils]: 54: Hoare triple {13405#true} assume !false; {13405#true} is VALID [2022-04-14 14:55:23,611 INFO L290 TraceCheckUtils]: 53: Hoare triple {13405#true} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {13405#true} is VALID [2022-04-14 14:55:23,611 INFO L290 TraceCheckUtils]: 52: Hoare triple {13405#true} assume !false; {13405#true} is VALID [2022-04-14 14:55:23,611 INFO L290 TraceCheckUtils]: 51: Hoare triple {13405#true} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {13405#true} is VALID [2022-04-14 14:55:23,611 INFO L290 TraceCheckUtils]: 50: Hoare triple {13405#true} assume !(~c~0 >= ~b~0); {13405#true} is VALID [2022-04-14 14:55:23,611 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {13405#true} {13405#true} #90#return; {13405#true} is VALID [2022-04-14 14:55:23,611 INFO L290 TraceCheckUtils]: 48: Hoare triple {13405#true} assume true; {13405#true} is VALID [2022-04-14 14:55:23,611 INFO L290 TraceCheckUtils]: 47: Hoare triple {13405#true} assume !(0 == ~cond); {13405#true} is VALID [2022-04-14 14:55:23,611 INFO L290 TraceCheckUtils]: 46: Hoare triple {13405#true} ~cond := #in~cond; {13405#true} is VALID [2022-04-14 14:55:23,611 INFO L272 TraceCheckUtils]: 45: Hoare triple {13405#true} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {13405#true} is VALID [2022-04-14 14:55:23,611 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {13405#true} {13405#true} #88#return; {13405#true} is VALID [2022-04-14 14:55:23,611 INFO L290 TraceCheckUtils]: 43: Hoare triple {13405#true} assume true; {13405#true} is VALID [2022-04-14 14:55:23,611 INFO L290 TraceCheckUtils]: 42: Hoare triple {13405#true} assume !(0 == ~cond); {13405#true} is VALID [2022-04-14 14:55:23,611 INFO L290 TraceCheckUtils]: 41: Hoare triple {13405#true} ~cond := #in~cond; {13405#true} is VALID [2022-04-14 14:55:23,612 INFO L272 TraceCheckUtils]: 40: Hoare triple {13405#true} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {13405#true} is VALID [2022-04-14 14:55:23,612 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {13405#true} {13405#true} #86#return; {13405#true} is VALID [2022-04-14 14:55:23,612 INFO L290 TraceCheckUtils]: 38: Hoare triple {13405#true} assume true; {13405#true} is VALID [2022-04-14 14:55:23,612 INFO L290 TraceCheckUtils]: 37: Hoare triple {13405#true} assume !(0 == ~cond); {13405#true} is VALID [2022-04-14 14:55:23,612 INFO L290 TraceCheckUtils]: 36: Hoare triple {13405#true} ~cond := #in~cond; {13405#true} is VALID [2022-04-14 14:55:23,612 INFO L272 TraceCheckUtils]: 35: Hoare triple {13405#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {13405#true} is VALID [2022-04-14 14:55:23,612 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {13405#true} {13405#true} #84#return; {13405#true} is VALID [2022-04-14 14:55:23,612 INFO L290 TraceCheckUtils]: 33: Hoare triple {13405#true} assume true; {13405#true} is VALID [2022-04-14 14:55:23,612 INFO L290 TraceCheckUtils]: 32: Hoare triple {13405#true} assume !(0 == ~cond); {13405#true} is VALID [2022-04-14 14:55:23,612 INFO L290 TraceCheckUtils]: 31: Hoare triple {13405#true} ~cond := #in~cond; {13405#true} is VALID [2022-04-14 14:55:23,612 INFO L272 TraceCheckUtils]: 30: Hoare triple {13405#true} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {13405#true} is VALID [2022-04-14 14:55:23,612 INFO L290 TraceCheckUtils]: 29: Hoare triple {13405#true} assume !false; {13405#true} is VALID [2022-04-14 14:55:23,612 INFO L290 TraceCheckUtils]: 28: Hoare triple {13405#true} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {13405#true} is VALID [2022-04-14 14:55:23,612 INFO L290 TraceCheckUtils]: 27: Hoare triple {13405#true} assume !false; {13405#true} is VALID [2022-04-14 14:55:23,612 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {13405#true} {13405#true} #82#return; {13405#true} is VALID [2022-04-14 14:55:23,612 INFO L290 TraceCheckUtils]: 25: Hoare triple {13405#true} assume true; {13405#true} is VALID [2022-04-14 14:55:23,613 INFO L290 TraceCheckUtils]: 24: Hoare triple {13405#true} assume !(0 == ~cond); {13405#true} is VALID [2022-04-14 14:55:23,613 INFO L290 TraceCheckUtils]: 23: Hoare triple {13405#true} ~cond := #in~cond; {13405#true} is VALID [2022-04-14 14:55:23,613 INFO L272 TraceCheckUtils]: 22: Hoare triple {13405#true} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {13405#true} is VALID [2022-04-14 14:55:23,613 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {13405#true} {13405#true} #80#return; {13405#true} is VALID [2022-04-14 14:55:23,613 INFO L290 TraceCheckUtils]: 20: Hoare triple {13405#true} assume true; {13405#true} is VALID [2022-04-14 14:55:23,613 INFO L290 TraceCheckUtils]: 19: Hoare triple {13405#true} assume !(0 == ~cond); {13405#true} is VALID [2022-04-14 14:55:23,613 INFO L290 TraceCheckUtils]: 18: Hoare triple {13405#true} ~cond := #in~cond; {13405#true} is VALID [2022-04-14 14:55:23,613 INFO L272 TraceCheckUtils]: 17: Hoare triple {13405#true} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {13405#true} is VALID [2022-04-14 14:55:23,613 INFO L290 TraceCheckUtils]: 16: Hoare triple {13405#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {13405#true} is VALID [2022-04-14 14:55:23,613 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {13405#true} {13405#true} #78#return; {13405#true} is VALID [2022-04-14 14:55:23,613 INFO L290 TraceCheckUtils]: 14: Hoare triple {13405#true} assume true; {13405#true} is VALID [2022-04-14 14:55:23,613 INFO L290 TraceCheckUtils]: 13: Hoare triple {13405#true} assume !(0 == ~cond); {13405#true} is VALID [2022-04-14 14:55:23,613 INFO L290 TraceCheckUtils]: 12: Hoare triple {13405#true} ~cond := #in~cond; {13405#true} is VALID [2022-04-14 14:55:23,613 INFO L272 TraceCheckUtils]: 11: Hoare triple {13405#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {13405#true} is VALID [2022-04-14 14:55:23,614 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {13405#true} {13405#true} #76#return; {13405#true} is VALID [2022-04-14 14:55:23,614 INFO L290 TraceCheckUtils]: 9: Hoare triple {13405#true} assume true; {13405#true} is VALID [2022-04-14 14:55:23,614 INFO L290 TraceCheckUtils]: 8: Hoare triple {13405#true} assume !(0 == ~cond); {13405#true} is VALID [2022-04-14 14:55:23,614 INFO L290 TraceCheckUtils]: 7: Hoare triple {13405#true} ~cond := #in~cond; {13405#true} is VALID [2022-04-14 14:55:23,614 INFO L272 TraceCheckUtils]: 6: Hoare triple {13405#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {13405#true} is VALID [2022-04-14 14:55:23,614 INFO L290 TraceCheckUtils]: 5: Hoare triple {13405#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~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; {13405#true} is VALID [2022-04-14 14:55:23,614 INFO L272 TraceCheckUtils]: 4: Hoare triple {13405#true} call #t~ret6 := main(); {13405#true} is VALID [2022-04-14 14:55:23,614 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13405#true} {13405#true} #96#return; {13405#true} is VALID [2022-04-14 14:55:23,614 INFO L290 TraceCheckUtils]: 2: Hoare triple {13405#true} assume true; {13405#true} is VALID [2022-04-14 14:55:23,614 INFO L290 TraceCheckUtils]: 1: Hoare triple {13405#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(11, 2);call #Ultimate.allocInit(12, 3); {13405#true} is VALID [2022-04-14 14:55:23,614 INFO L272 TraceCheckUtils]: 0: Hoare triple {13405#true} call ULTIMATE.init(); {13405#true} is VALID [2022-04-14 14:55:23,615 INFO L134 CoverageAnalysis]: Checked inductivity of 453 backedges. 120 proven. 32 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2022-04-14 14:55:23,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 14:55:23,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126239471] [2022-04-14 14:55:23,615 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 14:55:23,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2117696336] [2022-04-14 14:55:23,615 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2117696336] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-14 14:55:23,615 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-14 14:55:23,615 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 10] total 21 [2022-04-14 14:55:23,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884051188] [2022-04-14 14:55:23,615 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-14 14:55:23,616 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 16 states have internal predecessors, (45), 14 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (31), 13 states have call predecessors, (31), 14 states have call successors, (31) Word has length 116 [2022-04-14 14:55:23,619 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 14:55:23,619 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 21 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 16 states have internal predecessors, (45), 14 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (31), 13 states have call predecessors, (31), 14 states have call successors, (31) [2022-04-14 14:55:23,900 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 14:55:23,900 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-14 14:55:23,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 14:55:23,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-14 14:55:23,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2022-04-14 14:55:23,901 INFO L87 Difference]: Start difference. First operand 215 states and 289 transitions. Second operand has 21 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 16 states have internal predecessors, (45), 14 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (31), 13 states have call predecessors, (31), 14 states have call successors, (31) [2022-04-14 14:55:31,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:55:31,033 INFO L93 Difference]: Finished difference Result 246 states and 326 transitions. [2022-04-14 14:55:31,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-14 14:55:31,033 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 16 states have internal predecessors, (45), 14 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (31), 13 states have call predecessors, (31), 14 states have call successors, (31) Word has length 116 [2022-04-14 14:55:31,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 14:55:31,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 16 states have internal predecessors, (45), 14 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (31), 13 states have call predecessors, (31), 14 states have call successors, (31) [2022-04-14 14:55:31,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 130 transitions. [2022-04-14 14:55:31,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 16 states have internal predecessors, (45), 14 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (31), 13 states have call predecessors, (31), 14 states have call successors, (31) [2022-04-14 14:55:31,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 130 transitions. [2022-04-14 14:55:31,038 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 130 transitions. [2022-04-14 14:55:32,077 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-14 14:55:32,083 INFO L225 Difference]: With dead ends: 246 [2022-04-14 14:55:32,083 INFO L226 Difference]: Without dead ends: 244 [2022-04-14 14:55:32,083 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 211 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=158, Invalid=712, Unknown=0, NotChecked=0, Total=870 [2022-04-14 14:55:32,084 INFO L913 BasicCegarLoop]: 47 mSDtfsCounter, 45 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 748 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 873 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 748 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-04-14 14:55:32,084 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [51 Valid, 301 Invalid, 873 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 748 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2022-04-14 14:55:32,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2022-04-14 14:55:32,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 227. [2022-04-14 14:55:32,415 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 14:55:32,416 INFO L82 GeneralOperation]: Start isEquivalent. First operand 244 states. Second operand has 227 states, 126 states have (on average 1.126984126984127) internal successors, (142), 128 states have internal predecessors, (142), 79 states have call successors, (79), 22 states have call predecessors, (79), 21 states have return successors, (77), 76 states have call predecessors, (77), 77 states have call successors, (77) [2022-04-14 14:55:32,416 INFO L74 IsIncluded]: Start isIncluded. First operand 244 states. Second operand has 227 states, 126 states have (on average 1.126984126984127) internal successors, (142), 128 states have internal predecessors, (142), 79 states have call successors, (79), 22 states have call predecessors, (79), 21 states have return successors, (77), 76 states have call predecessors, (77), 77 states have call successors, (77) [2022-04-14 14:55:32,417 INFO L87 Difference]: Start difference. First operand 244 states. Second operand has 227 states, 126 states have (on average 1.126984126984127) internal successors, (142), 128 states have internal predecessors, (142), 79 states have call successors, (79), 22 states have call predecessors, (79), 21 states have return successors, (77), 76 states have call predecessors, (77), 77 states have call successors, (77) [2022-04-14 14:55:32,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:55:32,424 INFO L93 Difference]: Finished difference Result 244 states and 324 transitions. [2022-04-14 14:55:32,424 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 324 transitions. [2022-04-14 14:55:32,425 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 14:55:32,425 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 14:55:32,426 INFO L74 IsIncluded]: Start isIncluded. First operand has 227 states, 126 states have (on average 1.126984126984127) internal successors, (142), 128 states have internal predecessors, (142), 79 states have call successors, (79), 22 states have call predecessors, (79), 21 states have return successors, (77), 76 states have call predecessors, (77), 77 states have call successors, (77) Second operand 244 states. [2022-04-14 14:55:32,426 INFO L87 Difference]: Start difference. First operand has 227 states, 126 states have (on average 1.126984126984127) internal successors, (142), 128 states have internal predecessors, (142), 79 states have call successors, (79), 22 states have call predecessors, (79), 21 states have return successors, (77), 76 states have call predecessors, (77), 77 states have call successors, (77) Second operand 244 states. [2022-04-14 14:55:32,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:55:32,433 INFO L93 Difference]: Finished difference Result 244 states and 324 transitions. [2022-04-14 14:55:32,433 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 324 transitions. [2022-04-14 14:55:32,434 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 14:55:32,434 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 14:55:32,434 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 14:55:32,434 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 14:55:32,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 126 states have (on average 1.126984126984127) internal successors, (142), 128 states have internal predecessors, (142), 79 states have call successors, (79), 22 states have call predecessors, (79), 21 states have return successors, (77), 76 states have call predecessors, (77), 77 states have call successors, (77) [2022-04-14 14:55:32,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 298 transitions. [2022-04-14 14:55:32,441 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 298 transitions. Word has length 116 [2022-04-14 14:55:32,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 14:55:32,441 INFO L478 AbstractCegarLoop]: Abstraction has 227 states and 298 transitions. [2022-04-14 14:55:32,441 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 16 states have internal predecessors, (45), 14 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (31), 13 states have call predecessors, (31), 14 states have call successors, (31) [2022-04-14 14:55:32,441 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 298 transitions. [2022-04-14 14:55:32,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-04-14 14:55:32,443 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 14:55:32,443 INFO L499 BasicCegarLoop]: trace histogram [17, 16, 16, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 14:55:32,467 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-04-14 14:55:32,666 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-04-14 14:55:32,666 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 14:55:32,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 14:55:32,667 INFO L85 PathProgramCache]: Analyzing trace with hash -1787495061, now seen corresponding path program 2 times [2022-04-14 14:55:32,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 14:55:32,667 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315085073] [2022-04-14 14:55:32,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 14:55:32,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 14:55:32,686 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 14:55:32,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [875638293] [2022-04-14 14:55:32,687 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-14 14:55:32,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 14:55:32,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 14:55:32,689 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-14 14:55:32,690 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-04-14 14:55:32,766 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-14 14:55:32,766 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-14 14:55:32,768 INFO L263 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 76 conjunts are in the unsatisfiable core [2022-04-14 14:55:32,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:55:32,792 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 14:55:46,768 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-14 14:55:46,822 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-14 14:55:46,958 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-14 14:55:47,720 INFO L272 TraceCheckUtils]: 0: Hoare triple {15367#true} call ULTIMATE.init(); {15367#true} is VALID [2022-04-14 14:55:47,720 INFO L290 TraceCheckUtils]: 1: Hoare triple {15367#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(11, 2);call #Ultimate.allocInit(12, 3); {15367#true} is VALID [2022-04-14 14:55:47,720 INFO L290 TraceCheckUtils]: 2: Hoare triple {15367#true} assume true; {15367#true} is VALID [2022-04-14 14:55:47,721 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15367#true} {15367#true} #96#return; {15367#true} is VALID [2022-04-14 14:55:47,721 INFO L272 TraceCheckUtils]: 4: Hoare triple {15367#true} call #t~ret6 := main(); {15367#true} is VALID [2022-04-14 14:55:47,721 INFO L290 TraceCheckUtils]: 5: Hoare triple {15367#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~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; {15367#true} is VALID [2022-04-14 14:55:47,721 INFO L272 TraceCheckUtils]: 6: Hoare triple {15367#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {15367#true} is VALID [2022-04-14 14:55:47,721 INFO L290 TraceCheckUtils]: 7: Hoare triple {15367#true} ~cond := #in~cond; {15367#true} is VALID [2022-04-14 14:55:47,721 INFO L290 TraceCheckUtils]: 8: Hoare triple {15367#true} assume !(0 == ~cond); {15367#true} is VALID [2022-04-14 14:55:47,721 INFO L290 TraceCheckUtils]: 9: Hoare triple {15367#true} assume true; {15367#true} is VALID [2022-04-14 14:55:47,721 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {15367#true} {15367#true} #76#return; {15367#true} is VALID [2022-04-14 14:55:47,721 INFO L272 TraceCheckUtils]: 11: Hoare triple {15367#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {15367#true} is VALID [2022-04-14 14:55:47,721 INFO L290 TraceCheckUtils]: 12: Hoare triple {15367#true} ~cond := #in~cond; {15367#true} is VALID [2022-04-14 14:55:47,721 INFO L290 TraceCheckUtils]: 13: Hoare triple {15367#true} assume !(0 == ~cond); {15367#true} is VALID [2022-04-14 14:55:47,721 INFO L290 TraceCheckUtils]: 14: Hoare triple {15367#true} assume true; {15367#true} is VALID [2022-04-14 14:55:47,721 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {15367#true} {15367#true} #78#return; {15367#true} is VALID [2022-04-14 14:55:47,722 INFO L290 TraceCheckUtils]: 16: Hoare triple {15367#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {15420#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (<= main_~p~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0))} is VALID [2022-04-14 14:55:47,722 INFO L272 TraceCheckUtils]: 17: Hoare triple {15420#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (<= main_~p~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0))} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {15367#true} is VALID [2022-04-14 14:55:47,722 INFO L290 TraceCheckUtils]: 18: Hoare triple {15367#true} ~cond := #in~cond; {15367#true} is VALID [2022-04-14 14:55:47,722 INFO L290 TraceCheckUtils]: 19: Hoare triple {15367#true} assume !(0 == ~cond); {15367#true} is VALID [2022-04-14 14:55:47,722 INFO L290 TraceCheckUtils]: 20: Hoare triple {15367#true} assume true; {15367#true} is VALID [2022-04-14 14:55:47,723 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {15367#true} {15420#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (<= main_~p~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0))} #80#return; {15420#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (<= main_~p~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0))} is VALID [2022-04-14 14:55:47,723 INFO L272 TraceCheckUtils]: 22: Hoare triple {15420#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (<= main_~p~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0))} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {15367#true} is VALID [2022-04-14 14:55:47,723 INFO L290 TraceCheckUtils]: 23: Hoare triple {15367#true} ~cond := #in~cond; {15367#true} is VALID [2022-04-14 14:55:47,723 INFO L290 TraceCheckUtils]: 24: Hoare triple {15367#true} assume !(0 == ~cond); {15367#true} is VALID [2022-04-14 14:55:47,723 INFO L290 TraceCheckUtils]: 25: Hoare triple {15367#true} assume true; {15367#true} is VALID [2022-04-14 14:55:47,723 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {15367#true} {15420#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (<= main_~p~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0))} #82#return; {15420#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (<= main_~p~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0))} is VALID [2022-04-14 14:55:47,724 INFO L290 TraceCheckUtils]: 27: Hoare triple {15420#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (<= main_~p~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0))} assume !false; {15420#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (<= main_~p~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0))} is VALID [2022-04-14 14:55:47,724 INFO L290 TraceCheckUtils]: 28: Hoare triple {15420#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (<= main_~p~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {15457#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (<= main_~p~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0))} is VALID [2022-04-14 14:55:47,725 INFO L290 TraceCheckUtils]: 29: Hoare triple {15457#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (<= main_~p~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0))} assume !false; {15457#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (<= main_~p~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0))} is VALID [2022-04-14 14:55:47,725 INFO L272 TraceCheckUtils]: 30: Hoare triple {15457#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (<= main_~p~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {15367#true} is VALID [2022-04-14 14:55:47,725 INFO L290 TraceCheckUtils]: 31: Hoare triple {15367#true} ~cond := #in~cond; {15367#true} is VALID [2022-04-14 14:55:47,725 INFO L290 TraceCheckUtils]: 32: Hoare triple {15367#true} assume !(0 == ~cond); {15367#true} is VALID [2022-04-14 14:55:47,725 INFO L290 TraceCheckUtils]: 33: Hoare triple {15367#true} assume true; {15367#true} is VALID [2022-04-14 14:55:47,725 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {15367#true} {15457#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (<= main_~p~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0))} #84#return; {15457#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (<= main_~p~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0))} is VALID [2022-04-14 14:55:47,726 INFO L272 TraceCheckUtils]: 35: Hoare triple {15457#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (<= main_~p~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {15367#true} is VALID [2022-04-14 14:55:47,726 INFO L290 TraceCheckUtils]: 36: Hoare triple {15367#true} ~cond := #in~cond; {15367#true} is VALID [2022-04-14 14:55:47,726 INFO L290 TraceCheckUtils]: 37: Hoare triple {15367#true} assume !(0 == ~cond); {15367#true} is VALID [2022-04-14 14:55:47,726 INFO L290 TraceCheckUtils]: 38: Hoare triple {15367#true} assume true; {15367#true} is VALID [2022-04-14 14:55:47,726 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {15367#true} {15457#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (<= main_~p~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0))} #86#return; {15457#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (<= main_~p~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0))} is VALID [2022-04-14 14:55:47,726 INFO L272 TraceCheckUtils]: 40: Hoare triple {15457#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (<= main_~p~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {15367#true} is VALID [2022-04-14 14:55:47,727 INFO L290 TraceCheckUtils]: 41: Hoare triple {15367#true} ~cond := #in~cond; {15497#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-14 14:55:47,727 INFO L290 TraceCheckUtils]: 42: Hoare triple {15497#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {15501#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 14:55:47,727 INFO L290 TraceCheckUtils]: 43: Hoare triple {15501#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {15501#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 14:55:47,728 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {15501#(not (= |__VERIFIER_assert_#in~cond| 0))} {15457#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (<= main_~p~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0))} #88#return; {15457#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (<= main_~p~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0))} is VALID [2022-04-14 14:55:47,728 INFO L272 TraceCheckUtils]: 45: Hoare triple {15457#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (<= main_~p~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {15367#true} is VALID [2022-04-14 14:55:47,728 INFO L290 TraceCheckUtils]: 46: Hoare triple {15367#true} ~cond := #in~cond; {15367#true} is VALID [2022-04-14 14:55:47,728 INFO L290 TraceCheckUtils]: 47: Hoare triple {15367#true} assume !(0 == ~cond); {15367#true} is VALID [2022-04-14 14:55:47,728 INFO L290 TraceCheckUtils]: 48: Hoare triple {15367#true} assume true; {15367#true} is VALID [2022-04-14 14:55:47,729 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {15367#true} {15457#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (<= main_~p~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0))} #90#return; {15457#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (<= main_~p~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0))} is VALID [2022-04-14 14:55:47,729 INFO L290 TraceCheckUtils]: 50: Hoare triple {15457#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (<= main_~p~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0))} assume !(~c~0 >= ~b~0); {15526#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (not (<= main_~b~0 main_~c~0)) (<= main_~p~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0))} is VALID [2022-04-14 14:55:47,730 INFO L290 TraceCheckUtils]: 51: Hoare triple {15526#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (not (<= main_~b~0 main_~c~0)) (<= main_~p~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {15530#(and (= main_~s~0 0) (= main_~p~0 0) (not (<= main_~a~0 main_~x~0)) (<= main_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} is VALID [2022-04-14 14:55:47,731 INFO L290 TraceCheckUtils]: 52: Hoare triple {15530#(and (= main_~s~0 0) (= main_~p~0 0) (not (<= main_~a~0 main_~x~0)) (<= main_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} assume !false; {15530#(and (= main_~s~0 0) (= main_~p~0 0) (not (<= main_~a~0 main_~x~0)) (<= main_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} is VALID [2022-04-14 14:55:47,731 INFO L290 TraceCheckUtils]: 53: Hoare triple {15530#(and (= main_~s~0 0) (= main_~p~0 0) (not (<= main_~a~0 main_~x~0)) (<= main_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {15537#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (<= main_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} is VALID [2022-04-14 14:55:47,731 INFO L290 TraceCheckUtils]: 54: Hoare triple {15537#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (<= main_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} assume !false; {15537#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (<= main_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} is VALID [2022-04-14 14:55:47,731 INFO L272 TraceCheckUtils]: 55: Hoare triple {15537#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (<= main_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {15367#true} is VALID [2022-04-14 14:55:47,732 INFO L290 TraceCheckUtils]: 56: Hoare triple {15367#true} ~cond := #in~cond; {15367#true} is VALID [2022-04-14 14:55:47,732 INFO L290 TraceCheckUtils]: 57: Hoare triple {15367#true} assume !(0 == ~cond); {15367#true} is VALID [2022-04-14 14:55:47,732 INFO L290 TraceCheckUtils]: 58: Hoare triple {15367#true} assume true; {15367#true} is VALID [2022-04-14 14:55:47,732 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {15367#true} {15537#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (<= main_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} #84#return; {15537#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (<= main_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} is VALID [2022-04-14 14:55:47,732 INFO L272 TraceCheckUtils]: 60: Hoare triple {15537#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (<= main_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {15367#true} is VALID [2022-04-14 14:55:47,732 INFO L290 TraceCheckUtils]: 61: Hoare triple {15367#true} ~cond := #in~cond; {15367#true} is VALID [2022-04-14 14:55:47,733 INFO L290 TraceCheckUtils]: 62: Hoare triple {15367#true} assume !(0 == ~cond); {15367#true} is VALID [2022-04-14 14:55:47,733 INFO L290 TraceCheckUtils]: 63: Hoare triple {15367#true} assume true; {15367#true} is VALID [2022-04-14 14:55:47,733 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {15367#true} {15537#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (<= main_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} #86#return; {15537#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (<= main_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} is VALID [2022-04-14 14:55:47,733 INFO L272 TraceCheckUtils]: 65: Hoare triple {15537#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (<= main_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {15367#true} is VALID [2022-04-14 14:55:47,733 INFO L290 TraceCheckUtils]: 66: Hoare triple {15367#true} ~cond := #in~cond; {15367#true} is VALID [2022-04-14 14:55:47,733 INFO L290 TraceCheckUtils]: 67: Hoare triple {15367#true} assume !(0 == ~cond); {15367#true} is VALID [2022-04-14 14:55:47,733 INFO L290 TraceCheckUtils]: 68: Hoare triple {15367#true} assume true; {15367#true} is VALID [2022-04-14 14:55:47,734 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {15367#true} {15537#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (<= main_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} #88#return; {15537#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (<= main_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} is VALID [2022-04-14 14:55:47,734 INFO L272 TraceCheckUtils]: 70: Hoare triple {15537#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (<= main_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {15367#true} is VALID [2022-04-14 14:55:47,734 INFO L290 TraceCheckUtils]: 71: Hoare triple {15367#true} ~cond := #in~cond; {15367#true} is VALID [2022-04-14 14:55:47,734 INFO L290 TraceCheckUtils]: 72: Hoare triple {15367#true} assume !(0 == ~cond); {15367#true} is VALID [2022-04-14 14:55:47,734 INFO L290 TraceCheckUtils]: 73: Hoare triple {15367#true} assume true; {15367#true} is VALID [2022-04-14 14:55:47,735 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {15367#true} {15537#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (<= main_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} #90#return; {15537#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (<= main_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} is VALID [2022-04-14 14:55:47,736 INFO L290 TraceCheckUtils]: 75: Hoare triple {15537#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (<= main_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {15604#(and (= main_~s~0 0) (<= 1 main_~k~0) (= main_~p~0 0) (= main_~a~0 (+ main_~c~0 main_~b~0)) (not (<= main_~a~0 main_~x~0)) (<= main_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} is VALID [2022-04-14 14:55:47,736 INFO L290 TraceCheckUtils]: 76: Hoare triple {15604#(and (= main_~s~0 0) (<= 1 main_~k~0) (= main_~p~0 0) (= main_~a~0 (+ main_~c~0 main_~b~0)) (not (<= main_~a~0 main_~x~0)) (<= main_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} assume !false; {15604#(and (= main_~s~0 0) (<= 1 main_~k~0) (= main_~p~0 0) (= main_~a~0 (+ main_~c~0 main_~b~0)) (not (<= main_~a~0 main_~x~0)) (<= main_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} is VALID [2022-04-14 14:55:47,736 INFO L272 TraceCheckUtils]: 77: Hoare triple {15604#(and (= main_~s~0 0) (<= 1 main_~k~0) (= main_~p~0 0) (= main_~a~0 (+ main_~c~0 main_~b~0)) (not (<= main_~a~0 main_~x~0)) (<= main_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {15367#true} is VALID [2022-04-14 14:55:47,737 INFO L290 TraceCheckUtils]: 78: Hoare triple {15367#true} ~cond := #in~cond; {15367#true} is VALID [2022-04-14 14:55:47,737 INFO L290 TraceCheckUtils]: 79: Hoare triple {15367#true} assume !(0 == ~cond); {15367#true} is VALID [2022-04-14 14:55:47,737 INFO L290 TraceCheckUtils]: 80: Hoare triple {15367#true} assume true; {15367#true} is VALID [2022-04-14 14:55:47,737 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {15367#true} {15604#(and (= main_~s~0 0) (<= 1 main_~k~0) (= main_~p~0 0) (= main_~a~0 (+ main_~c~0 main_~b~0)) (not (<= main_~a~0 main_~x~0)) (<= main_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} #84#return; {15604#(and (= main_~s~0 0) (<= 1 main_~k~0) (= main_~p~0 0) (= main_~a~0 (+ main_~c~0 main_~b~0)) (not (<= main_~a~0 main_~x~0)) (<= main_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} is VALID [2022-04-14 14:55:47,737 INFO L272 TraceCheckUtils]: 82: Hoare triple {15604#(and (= main_~s~0 0) (<= 1 main_~k~0) (= main_~p~0 0) (= main_~a~0 (+ main_~c~0 main_~b~0)) (not (<= main_~a~0 main_~x~0)) (<= main_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {15367#true} is VALID [2022-04-14 14:55:47,737 INFO L290 TraceCheckUtils]: 83: Hoare triple {15367#true} ~cond := #in~cond; {15367#true} is VALID [2022-04-14 14:55:47,737 INFO L290 TraceCheckUtils]: 84: Hoare triple {15367#true} assume !(0 == ~cond); {15367#true} is VALID [2022-04-14 14:55:47,738 INFO L290 TraceCheckUtils]: 85: Hoare triple {15367#true} assume true; {15367#true} is VALID [2022-04-14 14:55:47,738 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {15367#true} {15604#(and (= main_~s~0 0) (<= 1 main_~k~0) (= main_~p~0 0) (= main_~a~0 (+ main_~c~0 main_~b~0)) (not (<= main_~a~0 main_~x~0)) (<= main_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} #86#return; {15604#(and (= main_~s~0 0) (<= 1 main_~k~0) (= main_~p~0 0) (= main_~a~0 (+ main_~c~0 main_~b~0)) (not (<= main_~a~0 main_~x~0)) (<= main_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} is VALID [2022-04-14 14:55:47,738 INFO L272 TraceCheckUtils]: 87: Hoare triple {15604#(and (= main_~s~0 0) (<= 1 main_~k~0) (= main_~p~0 0) (= main_~a~0 (+ main_~c~0 main_~b~0)) (not (<= main_~a~0 main_~x~0)) (<= main_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {15367#true} is VALID [2022-04-14 14:55:47,738 INFO L290 TraceCheckUtils]: 88: Hoare triple {15367#true} ~cond := #in~cond; {15367#true} is VALID [2022-04-14 14:55:47,738 INFO L290 TraceCheckUtils]: 89: Hoare triple {15367#true} assume !(0 == ~cond); {15367#true} is VALID [2022-04-14 14:55:47,738 INFO L290 TraceCheckUtils]: 90: Hoare triple {15367#true} assume true; {15367#true} is VALID [2022-04-14 14:55:47,739 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {15367#true} {15604#(and (= main_~s~0 0) (<= 1 main_~k~0) (= main_~p~0 0) (= main_~a~0 (+ main_~c~0 main_~b~0)) (not (<= main_~a~0 main_~x~0)) (<= main_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} #88#return; {15604#(and (= main_~s~0 0) (<= 1 main_~k~0) (= main_~p~0 0) (= main_~a~0 (+ main_~c~0 main_~b~0)) (not (<= main_~a~0 main_~x~0)) (<= main_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} is VALID [2022-04-14 14:55:47,739 INFO L272 TraceCheckUtils]: 92: Hoare triple {15604#(and (= main_~s~0 0) (<= 1 main_~k~0) (= main_~p~0 0) (= main_~a~0 (+ main_~c~0 main_~b~0)) (not (<= main_~a~0 main_~x~0)) (<= main_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {15367#true} is VALID [2022-04-14 14:55:47,739 INFO L290 TraceCheckUtils]: 93: Hoare triple {15367#true} ~cond := #in~cond; {15367#true} is VALID [2022-04-14 14:55:47,739 INFO L290 TraceCheckUtils]: 94: Hoare triple {15367#true} assume !(0 == ~cond); {15367#true} is VALID [2022-04-14 14:55:47,739 INFO L290 TraceCheckUtils]: 95: Hoare triple {15367#true} assume true; {15367#true} is VALID [2022-04-14 14:55:47,740 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {15367#true} {15604#(and (= main_~s~0 0) (<= 1 main_~k~0) (= main_~p~0 0) (= main_~a~0 (+ main_~c~0 main_~b~0)) (not (<= main_~a~0 main_~x~0)) (<= main_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} #90#return; {15604#(and (= main_~s~0 0) (<= 1 main_~k~0) (= main_~p~0 0) (= main_~a~0 (+ main_~c~0 main_~b~0)) (not (<= main_~a~0 main_~x~0)) (<= main_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} is VALID [2022-04-14 14:55:47,741 INFO L290 TraceCheckUtils]: 97: Hoare triple {15604#(and (= main_~s~0 0) (<= 1 main_~k~0) (= main_~p~0 0) (= main_~a~0 (+ main_~c~0 main_~b~0)) (not (<= main_~a~0 main_~x~0)) (<= main_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {15671#(and (= main_~s~0 0) (= main_~p~0 0) (<= 2 main_~k~0) (not (<= main_~a~0 main_~x~0)) (<= main_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= (+ (* (- 2) main_~b~0) main_~a~0) main_~c~0))} is VALID [2022-04-14 14:55:47,741 INFO L290 TraceCheckUtils]: 98: Hoare triple {15671#(and (= main_~s~0 0) (= main_~p~0 0) (<= 2 main_~k~0) (not (<= main_~a~0 main_~x~0)) (<= main_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= (+ (* (- 2) main_~b~0) main_~a~0) main_~c~0))} assume !false; {15671#(and (= main_~s~0 0) (= main_~p~0 0) (<= 2 main_~k~0) (not (<= main_~a~0 main_~x~0)) (<= main_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= (+ (* (- 2) main_~b~0) main_~a~0) main_~c~0))} is VALID [2022-04-14 14:55:47,742 INFO L272 TraceCheckUtils]: 99: Hoare triple {15671#(and (= main_~s~0 0) (= main_~p~0 0) (<= 2 main_~k~0) (not (<= main_~a~0 main_~x~0)) (<= main_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= (+ (* (- 2) main_~b~0) main_~a~0) main_~c~0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {15367#true} is VALID [2022-04-14 14:55:47,742 INFO L290 TraceCheckUtils]: 100: Hoare triple {15367#true} ~cond := #in~cond; {15497#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-14 14:55:47,742 INFO L290 TraceCheckUtils]: 101: Hoare triple {15497#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {15501#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 14:55:47,742 INFO L290 TraceCheckUtils]: 102: Hoare triple {15501#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {15501#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 14:55:47,743 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {15501#(not (= |__VERIFIER_assert_#in~cond| 0))} {15671#(and (= main_~s~0 0) (= main_~p~0 0) (<= 2 main_~k~0) (not (<= main_~a~0 main_~x~0)) (<= main_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= (+ (* (- 2) main_~b~0) main_~a~0) main_~c~0))} #84#return; {15690#(and (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~s~0 0) (= main_~p~0 0) (<= 2 main_~k~0) (not (<= main_~a~0 main_~x~0)) (<= main_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= (+ (* (- 2) main_~b~0) main_~a~0) main_~c~0))} is VALID [2022-04-14 14:55:47,743 INFO L272 TraceCheckUtils]: 104: Hoare triple {15690#(and (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~s~0 0) (= main_~p~0 0) (<= 2 main_~k~0) (not (<= main_~a~0 main_~x~0)) (<= main_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= (+ (* (- 2) main_~b~0) main_~a~0) main_~c~0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {15367#true} is VALID [2022-04-14 14:55:47,744 INFO L290 TraceCheckUtils]: 105: Hoare triple {15367#true} ~cond := #in~cond; {15497#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-14 14:55:47,744 INFO L290 TraceCheckUtils]: 106: Hoare triple {15497#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {15501#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 14:55:47,744 INFO L290 TraceCheckUtils]: 107: Hoare triple {15501#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {15501#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 14:55:47,745 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {15501#(not (= |__VERIFIER_assert_#in~cond| 0))} {15690#(and (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~s~0 0) (= main_~p~0 0) (<= 2 main_~k~0) (not (<= main_~a~0 main_~x~0)) (<= main_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= (+ (* (- 2) main_~b~0) main_~a~0) main_~c~0))} #86#return; {15706#(and (= main_~s~0 0) (= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~p~0 0) (< main_~x~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (<= 2 main_~k~0) (<= main_~q~0 1) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= (* main_~b~0 main_~k~0) (* main_~b~0 2)))} is VALID [2022-04-14 14:55:47,746 INFO L272 TraceCheckUtils]: 109: Hoare triple {15706#(and (= main_~s~0 0) (= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~p~0 0) (< main_~x~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (<= 2 main_~k~0) (<= main_~q~0 1) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= (* main_~b~0 main_~k~0) (* main_~b~0 2)))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {15367#true} is VALID [2022-04-14 14:55:47,746 INFO L290 TraceCheckUtils]: 110: Hoare triple {15367#true} ~cond := #in~cond; {15497#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-14 14:55:47,746 INFO L290 TraceCheckUtils]: 111: Hoare triple {15497#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {15501#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 14:55:47,746 INFO L290 TraceCheckUtils]: 112: Hoare triple {15501#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {15501#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 14:55:47,747 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {15501#(not (= |__VERIFIER_assert_#in~cond| 0))} {15706#(and (= main_~s~0 0) (= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~p~0 0) (< main_~x~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (<= 2 main_~k~0) (<= main_~q~0 1) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= (* main_~b~0 main_~k~0) (* main_~b~0 2)))} #88#return; {15722#(and (= main_~s~0 0) (= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~p~0 0) (< main_~x~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (<= 2 main_~k~0) (<= main_~q~0 1) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= (* main_~b~0 main_~k~0) (* main_~b~0 2)))} is VALID [2022-04-14 14:55:47,747 INFO L272 TraceCheckUtils]: 114: Hoare triple {15722#(and (= main_~s~0 0) (= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~p~0 0) (< main_~x~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (<= 2 main_~k~0) (<= main_~q~0 1) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= (* main_~b~0 main_~k~0) (* main_~b~0 2)))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {15367#true} is VALID [2022-04-14 14:55:47,747 INFO L290 TraceCheckUtils]: 115: Hoare triple {15367#true} ~cond := #in~cond; {15367#true} is VALID [2022-04-14 14:55:47,748 INFO L290 TraceCheckUtils]: 116: Hoare triple {15367#true} assume !(0 == ~cond); {15367#true} is VALID [2022-04-14 14:55:47,748 INFO L290 TraceCheckUtils]: 117: Hoare triple {15367#true} assume true; {15367#true} is VALID [2022-04-14 14:55:47,748 INFO L284 TraceCheckUtils]: 118: Hoare quadruple {15367#true} {15722#(and (= main_~s~0 0) (= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~p~0 0) (< main_~x~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (<= 2 main_~k~0) (<= main_~q~0 1) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= (* main_~b~0 main_~k~0) (* main_~b~0 2)))} #90#return; {15722#(and (= main_~s~0 0) (= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~p~0 0) (< main_~x~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (<= 2 main_~k~0) (<= main_~q~0 1) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= (* main_~b~0 main_~k~0) (* main_~b~0 2)))} is VALID [2022-04-14 14:55:47,750 INFO L290 TraceCheckUtils]: 119: Hoare triple {15722#(and (= main_~s~0 0) (= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~p~0 0) (< main_~x~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (<= 2 main_~k~0) (<= main_~q~0 1) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= (* main_~b~0 main_~k~0) (* main_~b~0 2)))} assume !(~c~0 >= ~b~0); {15741#(and (< main_~c~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~x~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ (* main_~k~0 main_~y~0 main_~s~0) main_~c~0 (* main_~q~0 main_~k~0 main_~x~0))) (= main_~s~0 0) (= main_~p~0 0) (< main_~x~0 (+ (* main_~k~0 main_~y~0 main_~s~0) main_~c~0 (* main_~q~0 main_~k~0 main_~x~0))) (= (+ (* 2 (* main_~y~0 main_~s~0)) (* (* main_~q~0 main_~x~0) 2)) (+ (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0))) (= main_~r~0 1))} is VALID [2022-04-14 14:55:47,788 INFO L290 TraceCheckUtils]: 120: Hoare triple {15741#(and (< main_~c~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~x~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ (* main_~k~0 main_~y~0 main_~s~0) main_~c~0 (* main_~q~0 main_~k~0 main_~x~0))) (= main_~s~0 0) (= main_~p~0 0) (< main_~x~0 (+ (* main_~k~0 main_~y~0 main_~s~0) main_~c~0 (* main_~q~0 main_~k~0 main_~x~0))) (= (+ (* 2 (* main_~y~0 main_~s~0)) (* (* main_~q~0 main_~x~0) 2)) (+ (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0))) (= main_~r~0 1))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {15745#(and (exists ((main_~k~0 Int)) (and (< main_~x~0 (+ main_~b~0 (* main_~k~0 main_~x~0 (div (* (- 1) main_~q~0) main_~k~0)))) (= (* 2 (* main_~x~0 (div (* (- 1) main_~q~0) main_~k~0))) (+ (* main_~k~0 main_~x~0 (div (* (- 1) main_~q~0) main_~k~0)) (* main_~k~0 main_~y~0 0))) (< main_~b~0 (* main_~x~0 (div (* (- 1) main_~q~0) main_~k~0))) (= (mod (* (- 1) main_~q~0) main_~k~0) 0) (= (+ main_~b~0 (* main_~k~0 main_~x~0 (div (* (- 1) main_~q~0) main_~k~0)) (* main_~k~0 main_~y~0 0)) (+ main_~y~0 (* (+ main_~q~0 (* main_~k~0 (div (* (- 1) main_~q~0) main_~k~0))) main_~x~0))) (= main_~x~0 (* main_~x~0 (div (* (- 1) main_~q~0) main_~k~0))))) (= main_~s~0 1))} is VALID [2022-04-14 14:55:47,790 INFO L290 TraceCheckUtils]: 121: Hoare triple {15745#(and (exists ((main_~k~0 Int)) (and (< main_~x~0 (+ main_~b~0 (* main_~k~0 main_~x~0 (div (* (- 1) main_~q~0) main_~k~0)))) (= (* 2 (* main_~x~0 (div (* (- 1) main_~q~0) main_~k~0))) (+ (* main_~k~0 main_~x~0 (div (* (- 1) main_~q~0) main_~k~0)) (* main_~k~0 main_~y~0 0))) (< main_~b~0 (* main_~x~0 (div (* (- 1) main_~q~0) main_~k~0))) (= (mod (* (- 1) main_~q~0) main_~k~0) 0) (= (+ main_~b~0 (* main_~k~0 main_~x~0 (div (* (- 1) main_~q~0) main_~k~0)) (* main_~k~0 main_~y~0 0)) (+ main_~y~0 (* (+ main_~q~0 (* main_~k~0 (div (* (- 1) main_~q~0) main_~k~0))) main_~x~0))) (= main_~x~0 (* main_~x~0 (div (* (- 1) main_~q~0) main_~k~0))))) (= main_~s~0 1))} assume !false; {15745#(and (exists ((main_~k~0 Int)) (and (< main_~x~0 (+ main_~b~0 (* main_~k~0 main_~x~0 (div (* (- 1) main_~q~0) main_~k~0)))) (= (* 2 (* main_~x~0 (div (* (- 1) main_~q~0) main_~k~0))) (+ (* main_~k~0 main_~x~0 (div (* (- 1) main_~q~0) main_~k~0)) (* main_~k~0 main_~y~0 0))) (< main_~b~0 (* main_~x~0 (div (* (- 1) main_~q~0) main_~k~0))) (= (mod (* (- 1) main_~q~0) main_~k~0) 0) (= (+ main_~b~0 (* main_~k~0 main_~x~0 (div (* (- 1) main_~q~0) main_~k~0)) (* main_~k~0 main_~y~0 0)) (+ main_~y~0 (* (+ main_~q~0 (* main_~k~0 (div (* (- 1) main_~q~0) main_~k~0))) main_~x~0))) (= main_~x~0 (* main_~x~0 (div (* (- 1) main_~q~0) main_~k~0))))) (= main_~s~0 1))} is VALID [2022-04-14 14:55:47,791 INFO L290 TraceCheckUtils]: 122: Hoare triple {15745#(and (exists ((main_~k~0 Int)) (and (< main_~x~0 (+ main_~b~0 (* main_~k~0 main_~x~0 (div (* (- 1) main_~q~0) main_~k~0)))) (= (* 2 (* main_~x~0 (div (* (- 1) main_~q~0) main_~k~0))) (+ (* main_~k~0 main_~x~0 (div (* (- 1) main_~q~0) main_~k~0)) (* main_~k~0 main_~y~0 0))) (< main_~b~0 (* main_~x~0 (div (* (- 1) main_~q~0) main_~k~0))) (= (mod (* (- 1) main_~q~0) main_~k~0) 0) (= (+ main_~b~0 (* main_~k~0 main_~x~0 (div (* (- 1) main_~q~0) main_~k~0)) (* main_~k~0 main_~y~0 0)) (+ main_~y~0 (* (+ main_~q~0 (* main_~k~0 (div (* (- 1) main_~q~0) main_~k~0))) main_~x~0))) (= main_~x~0 (* main_~x~0 (div (* (- 1) main_~q~0) main_~k~0))))) (= main_~s~0 1))} assume !(0 != ~b~0); {15752#(and (= main_~s~0 1) (exists ((main_~k~0 Int)) (and (= (* 2 (* main_~x~0 (div (* (- 1) main_~q~0) main_~k~0))) (+ (* main_~k~0 main_~x~0 (div (* (- 1) main_~q~0) main_~k~0)) (* main_~k~0 main_~y~0 0))) (= (mod (* (- 1) main_~q~0) main_~k~0) 0) (< 0 (* main_~x~0 (div (* (- 1) main_~q~0) main_~k~0))) (= (+ (* main_~k~0 main_~x~0 (div (* (- 1) main_~q~0) main_~k~0)) (* main_~k~0 main_~y~0 0)) (+ main_~y~0 (* (+ main_~q~0 (* main_~k~0 (div (* (- 1) main_~q~0) main_~k~0))) main_~x~0))) (= main_~x~0 (* main_~x~0 (div (* (- 1) main_~q~0) main_~k~0))))))} is VALID [2022-04-14 14:55:47,792 INFO L272 TraceCheckUtils]: 123: Hoare triple {15752#(and (= main_~s~0 1) (exists ((main_~k~0 Int)) (and (= (* 2 (* main_~x~0 (div (* (- 1) main_~q~0) main_~k~0))) (+ (* main_~k~0 main_~x~0 (div (* (- 1) main_~q~0) main_~k~0)) (* main_~k~0 main_~y~0 0))) (= (mod (* (- 1) main_~q~0) main_~k~0) 0) (< 0 (* main_~x~0 (div (* (- 1) main_~q~0) main_~k~0))) (= (+ (* main_~k~0 main_~x~0 (div (* (- 1) main_~q~0) main_~k~0)) (* main_~k~0 main_~y~0 0)) (+ main_~y~0 (* (+ main_~q~0 (* main_~k~0 (div (* (- 1) main_~q~0) main_~k~0))) main_~x~0))) (= main_~x~0 (* main_~x~0 (div (* (- 1) main_~q~0) main_~k~0))))))} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {15756#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 14:55:47,793 INFO L290 TraceCheckUtils]: 124: Hoare triple {15756#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {15760#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 14:55:47,793 INFO L290 TraceCheckUtils]: 125: Hoare triple {15760#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {15368#false} is VALID [2022-04-14 14:55:47,793 INFO L290 TraceCheckUtils]: 126: Hoare triple {15368#false} assume !false; {15368#false} is VALID [2022-04-14 14:55:47,794 INFO L134 CoverageAnalysis]: Checked inductivity of 579 backedges. 133 proven. 86 refuted. 0 times theorem prover too weak. 360 trivial. 0 not checked. [2022-04-14 14:55:47,794 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 14:57:25,398 INFO L290 TraceCheckUtils]: 126: Hoare triple {15368#false} assume !false; {15368#false} is VALID [2022-04-14 14:57:25,398 INFO L290 TraceCheckUtils]: 125: Hoare triple {15760#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {15368#false} is VALID [2022-04-14 14:57:25,399 INFO L290 TraceCheckUtils]: 124: Hoare triple {15756#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {15760#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 14:57:25,399 INFO L272 TraceCheckUtils]: 123: Hoare triple {15776#(= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) 0)} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {15756#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 14:57:25,400 INFO L290 TraceCheckUtils]: 122: Hoare triple {15780#(or (not (= main_~b~0 0)) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) 0))} assume !(0 != ~b~0); {15776#(= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) 0)} is VALID [2022-04-14 14:57:25,400 INFO L290 TraceCheckUtils]: 121: Hoare triple {15780#(or (not (= main_~b~0 0)) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) 0))} assume !false; {15780#(or (not (= main_~b~0 0)) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) 0))} is VALID [2022-04-14 14:57:27,301 INFO L290 TraceCheckUtils]: 120: Hoare triple {15787#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (- 1) main_~k~0 main_~s~0) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) 0))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {15780#(or (not (= main_~b~0 0)) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) 0))} is VALID [2022-04-14 14:57:27,302 INFO L290 TraceCheckUtils]: 119: Hoare triple {15791#(or (not (= main_~c~0 0)) (<= main_~b~0 main_~c~0) (= (+ (* (+ (* (- 1) main_~k~0 main_~s~0) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) 0))} assume !(~c~0 >= ~b~0); {15787#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (- 1) main_~k~0 main_~s~0) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) 0))} is VALID [2022-04-14 14:57:27,303 INFO L284 TraceCheckUtils]: 118: Hoare quadruple {15367#true} {15791#(or (not (= main_~c~0 0)) (<= main_~b~0 main_~c~0) (= (+ (* (+ (* (- 1) main_~k~0 main_~s~0) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) 0))} #90#return; {15791#(or (not (= main_~c~0 0)) (<= main_~b~0 main_~c~0) (= (+ (* (+ (* (- 1) main_~k~0 main_~s~0) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) 0))} is VALID [2022-04-14 14:57:27,303 INFO L290 TraceCheckUtils]: 117: Hoare triple {15367#true} assume true; {15367#true} is VALID [2022-04-14 14:57:27,303 INFO L290 TraceCheckUtils]: 116: Hoare triple {15367#true} assume !(0 == ~cond); {15367#true} is VALID [2022-04-14 14:57:27,303 INFO L290 TraceCheckUtils]: 115: Hoare triple {15367#true} ~cond := #in~cond; {15367#true} is VALID [2022-04-14 14:57:27,303 INFO L272 TraceCheckUtils]: 114: Hoare triple {15791#(or (not (= main_~c~0 0)) (<= main_~b~0 main_~c~0) (= (+ (* (+ (* (- 1) main_~k~0 main_~s~0) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) 0))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {15367#true} is VALID [2022-04-14 14:57:27,304 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {15501#(not (= |__VERIFIER_assert_#in~cond| 0))} {15810#(or (not (= main_~c~0 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 main_~c~0) (= (+ (* (+ (* (- 1) main_~k~0 main_~s~0) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) 0))} #88#return; {15791#(or (not (= main_~c~0 0)) (<= main_~b~0 main_~c~0) (= (+ (* (+ (* (- 1) main_~k~0 main_~s~0) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) 0))} is VALID [2022-04-14 14:57:27,304 INFO L290 TraceCheckUtils]: 112: Hoare triple {15501#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {15501#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 14:57:27,305 INFO L290 TraceCheckUtils]: 111: Hoare triple {15820#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {15501#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 14:57:27,305 INFO L290 TraceCheckUtils]: 110: Hoare triple {15367#true} ~cond := #in~cond; {15820#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-14 14:57:27,305 INFO L272 TraceCheckUtils]: 109: Hoare triple {15810#(or (not (= main_~c~0 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 main_~c~0) (= (+ (* (+ (* (- 1) main_~k~0 main_~s~0) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) 0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {15367#true} is VALID [2022-04-14 14:57:27,306 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {15501#(not (= |__VERIFIER_assert_#in~cond| 0))} {15827#(or (not (= main_~c~0 0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 main_~c~0) (= (+ (* (+ (* (- 1) main_~k~0 main_~s~0) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) 0))} #86#return; {15810#(or (not (= main_~c~0 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 main_~c~0) (= (+ (* (+ (* (- 1) main_~k~0 main_~s~0) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) 0))} is VALID [2022-04-14 14:57:27,306 INFO L290 TraceCheckUtils]: 107: Hoare triple {15501#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {15501#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 14:57:27,306 INFO L290 TraceCheckUtils]: 106: Hoare triple {15820#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {15501#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 14:57:27,307 INFO L290 TraceCheckUtils]: 105: Hoare triple {15367#true} ~cond := #in~cond; {15820#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-14 14:57:27,307 INFO L272 TraceCheckUtils]: 104: Hoare triple {15827#(or (not (= main_~c~0 0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 main_~c~0) (= (+ (* (+ (* (- 1) main_~k~0 main_~s~0) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) 0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {15367#true} is VALID [2022-04-14 14:57:27,335 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {15501#(not (= |__VERIFIER_assert_#in~cond| 0))} {15367#true} #84#return; {15827#(or (not (= main_~c~0 0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 main_~c~0) (= (+ (* (+ (* (- 1) main_~k~0 main_~s~0) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) 0))} is VALID [2022-04-14 14:57:27,336 INFO L290 TraceCheckUtils]: 102: Hoare triple {15501#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {15501#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 14:57:27,336 INFO L290 TraceCheckUtils]: 101: Hoare triple {15820#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {15501#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 14:57:27,336 INFO L290 TraceCheckUtils]: 100: Hoare triple {15367#true} ~cond := #in~cond; {15820#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-14 14:57:27,337 INFO L272 TraceCheckUtils]: 99: Hoare triple {15367#true} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {15367#true} is VALID [2022-04-14 14:57:27,337 INFO L290 TraceCheckUtils]: 98: Hoare triple {15367#true} assume !false; {15367#true} is VALID [2022-04-14 14:57:27,337 INFO L290 TraceCheckUtils]: 97: Hoare triple {15367#true} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {15367#true} is VALID [2022-04-14 14:57:27,337 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {15367#true} {15367#true} #90#return; {15367#true} is VALID [2022-04-14 14:57:27,337 INFO L290 TraceCheckUtils]: 95: Hoare triple {15367#true} assume true; {15367#true} is VALID [2022-04-14 14:57:27,337 INFO L290 TraceCheckUtils]: 94: Hoare triple {15367#true} assume !(0 == ~cond); {15367#true} is VALID [2022-04-14 14:57:27,337 INFO L290 TraceCheckUtils]: 93: Hoare triple {15367#true} ~cond := #in~cond; {15367#true} is VALID [2022-04-14 14:57:27,337 INFO L272 TraceCheckUtils]: 92: Hoare triple {15367#true} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {15367#true} is VALID [2022-04-14 14:57:27,337 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {15367#true} {15367#true} #88#return; {15367#true} is VALID [2022-04-14 14:57:27,337 INFO L290 TraceCheckUtils]: 90: Hoare triple {15367#true} assume true; {15367#true} is VALID [2022-04-14 14:57:27,337 INFO L290 TraceCheckUtils]: 89: Hoare triple {15367#true} assume !(0 == ~cond); {15367#true} is VALID [2022-04-14 14:57:27,337 INFO L290 TraceCheckUtils]: 88: Hoare triple {15367#true} ~cond := #in~cond; {15367#true} is VALID [2022-04-14 14:57:27,337 INFO L272 TraceCheckUtils]: 87: Hoare triple {15367#true} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {15367#true} is VALID [2022-04-14 14:57:27,338 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {15367#true} {15367#true} #86#return; {15367#true} is VALID [2022-04-14 14:57:27,338 INFO L290 TraceCheckUtils]: 85: Hoare triple {15367#true} assume true; {15367#true} is VALID [2022-04-14 14:57:27,338 INFO L290 TraceCheckUtils]: 84: Hoare triple {15367#true} assume !(0 == ~cond); {15367#true} is VALID [2022-04-14 14:57:27,338 INFO L290 TraceCheckUtils]: 83: Hoare triple {15367#true} ~cond := #in~cond; {15367#true} is VALID [2022-04-14 14:57:27,338 INFO L272 TraceCheckUtils]: 82: Hoare triple {15367#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {15367#true} is VALID [2022-04-14 14:57:27,338 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {15367#true} {15367#true} #84#return; {15367#true} is VALID [2022-04-14 14:57:27,338 INFO L290 TraceCheckUtils]: 80: Hoare triple {15367#true} assume true; {15367#true} is VALID [2022-04-14 14:57:27,338 INFO L290 TraceCheckUtils]: 79: Hoare triple {15367#true} assume !(0 == ~cond); {15367#true} is VALID [2022-04-14 14:57:27,338 INFO L290 TraceCheckUtils]: 78: Hoare triple {15367#true} ~cond := #in~cond; {15367#true} is VALID [2022-04-14 14:57:27,338 INFO L272 TraceCheckUtils]: 77: Hoare triple {15367#true} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {15367#true} is VALID [2022-04-14 14:57:27,338 INFO L290 TraceCheckUtils]: 76: Hoare triple {15367#true} assume !false; {15367#true} is VALID [2022-04-14 14:57:27,338 INFO L290 TraceCheckUtils]: 75: Hoare triple {15367#true} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {15367#true} is VALID [2022-04-14 14:57:27,338 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {15367#true} {15367#true} #90#return; {15367#true} is VALID [2022-04-14 14:57:27,338 INFO L290 TraceCheckUtils]: 73: Hoare triple {15367#true} assume true; {15367#true} is VALID [2022-04-14 14:57:27,338 INFO L290 TraceCheckUtils]: 72: Hoare triple {15367#true} assume !(0 == ~cond); {15367#true} is VALID [2022-04-14 14:57:27,338 INFO L290 TraceCheckUtils]: 71: Hoare triple {15367#true} ~cond := #in~cond; {15367#true} is VALID [2022-04-14 14:57:27,339 INFO L272 TraceCheckUtils]: 70: Hoare triple {15367#true} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {15367#true} is VALID [2022-04-14 14:57:27,339 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {15367#true} {15367#true} #88#return; {15367#true} is VALID [2022-04-14 14:57:27,339 INFO L290 TraceCheckUtils]: 68: Hoare triple {15367#true} assume true; {15367#true} is VALID [2022-04-14 14:57:27,339 INFO L290 TraceCheckUtils]: 67: Hoare triple {15367#true} assume !(0 == ~cond); {15367#true} is VALID [2022-04-14 14:57:27,339 INFO L290 TraceCheckUtils]: 66: Hoare triple {15367#true} ~cond := #in~cond; {15367#true} is VALID [2022-04-14 14:57:27,339 INFO L272 TraceCheckUtils]: 65: Hoare triple {15367#true} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {15367#true} is VALID [2022-04-14 14:57:27,339 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {15367#true} {15367#true} #86#return; {15367#true} is VALID [2022-04-14 14:57:27,339 INFO L290 TraceCheckUtils]: 63: Hoare triple {15367#true} assume true; {15367#true} is VALID [2022-04-14 14:57:27,339 INFO L290 TraceCheckUtils]: 62: Hoare triple {15367#true} assume !(0 == ~cond); {15367#true} is VALID [2022-04-14 14:57:27,339 INFO L290 TraceCheckUtils]: 61: Hoare triple {15367#true} ~cond := #in~cond; {15367#true} is VALID [2022-04-14 14:57:27,339 INFO L272 TraceCheckUtils]: 60: Hoare triple {15367#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {15367#true} is VALID [2022-04-14 14:57:27,339 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {15367#true} {15367#true} #84#return; {15367#true} is VALID [2022-04-14 14:57:27,339 INFO L290 TraceCheckUtils]: 58: Hoare triple {15367#true} assume true; {15367#true} is VALID [2022-04-14 14:57:27,339 INFO L290 TraceCheckUtils]: 57: Hoare triple {15367#true} assume !(0 == ~cond); {15367#true} is VALID [2022-04-14 14:57:27,339 INFO L290 TraceCheckUtils]: 56: Hoare triple {15367#true} ~cond := #in~cond; {15367#true} is VALID [2022-04-14 14:57:27,339 INFO L272 TraceCheckUtils]: 55: Hoare triple {15367#true} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {15367#true} is VALID [2022-04-14 14:57:27,339 INFO L290 TraceCheckUtils]: 54: Hoare triple {15367#true} assume !false; {15367#true} is VALID [2022-04-14 14:57:27,340 INFO L290 TraceCheckUtils]: 53: Hoare triple {15367#true} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {15367#true} is VALID [2022-04-14 14:57:27,340 INFO L290 TraceCheckUtils]: 52: Hoare triple {15367#true} assume !false; {15367#true} is VALID [2022-04-14 14:57:27,340 INFO L290 TraceCheckUtils]: 51: Hoare triple {15367#true} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {15367#true} is VALID [2022-04-14 14:57:27,340 INFO L290 TraceCheckUtils]: 50: Hoare triple {15367#true} assume !(~c~0 >= ~b~0); {15367#true} is VALID [2022-04-14 14:57:27,340 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {15367#true} {15367#true} #90#return; {15367#true} is VALID [2022-04-14 14:57:27,340 INFO L290 TraceCheckUtils]: 48: Hoare triple {15367#true} assume true; {15367#true} is VALID [2022-04-14 14:57:27,340 INFO L290 TraceCheckUtils]: 47: Hoare triple {15367#true} assume !(0 == ~cond); {15367#true} is VALID [2022-04-14 14:57:27,340 INFO L290 TraceCheckUtils]: 46: Hoare triple {15367#true} ~cond := #in~cond; {15367#true} is VALID [2022-04-14 14:57:27,340 INFO L272 TraceCheckUtils]: 45: Hoare triple {15367#true} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {15367#true} is VALID [2022-04-14 14:57:27,340 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {15367#true} {15367#true} #88#return; {15367#true} is VALID [2022-04-14 14:57:27,340 INFO L290 TraceCheckUtils]: 43: Hoare triple {15367#true} assume true; {15367#true} is VALID [2022-04-14 14:57:27,340 INFO L290 TraceCheckUtils]: 42: Hoare triple {15367#true} assume !(0 == ~cond); {15367#true} is VALID [2022-04-14 14:57:27,340 INFO L290 TraceCheckUtils]: 41: Hoare triple {15367#true} ~cond := #in~cond; {15367#true} is VALID [2022-04-14 14:57:27,340 INFO L272 TraceCheckUtils]: 40: Hoare triple {15367#true} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {15367#true} is VALID [2022-04-14 14:57:27,340 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {15367#true} {15367#true} #86#return; {15367#true} is VALID [2022-04-14 14:57:27,340 INFO L290 TraceCheckUtils]: 38: Hoare triple {15367#true} assume true; {15367#true} is VALID [2022-04-14 14:57:27,341 INFO L290 TraceCheckUtils]: 37: Hoare triple {15367#true} assume !(0 == ~cond); {15367#true} is VALID [2022-04-14 14:57:27,341 INFO L290 TraceCheckUtils]: 36: Hoare triple {15367#true} ~cond := #in~cond; {15367#true} is VALID [2022-04-14 14:57:27,341 INFO L272 TraceCheckUtils]: 35: Hoare triple {15367#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {15367#true} is VALID [2022-04-14 14:57:27,341 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {15367#true} {15367#true} #84#return; {15367#true} is VALID [2022-04-14 14:57:27,341 INFO L290 TraceCheckUtils]: 33: Hoare triple {15367#true} assume true; {15367#true} is VALID [2022-04-14 14:57:27,341 INFO L290 TraceCheckUtils]: 32: Hoare triple {15367#true} assume !(0 == ~cond); {15367#true} is VALID [2022-04-14 14:57:27,341 INFO L290 TraceCheckUtils]: 31: Hoare triple {15367#true} ~cond := #in~cond; {15367#true} is VALID [2022-04-14 14:57:27,341 INFO L272 TraceCheckUtils]: 30: Hoare triple {15367#true} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {15367#true} is VALID [2022-04-14 14:57:27,341 INFO L290 TraceCheckUtils]: 29: Hoare triple {15367#true} assume !false; {15367#true} is VALID [2022-04-14 14:57:27,341 INFO L290 TraceCheckUtils]: 28: Hoare triple {15367#true} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {15367#true} is VALID [2022-04-14 14:57:27,341 INFO L290 TraceCheckUtils]: 27: Hoare triple {15367#true} assume !false; {15367#true} is VALID [2022-04-14 14:57:27,341 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {15367#true} {15367#true} #82#return; {15367#true} is VALID [2022-04-14 14:57:27,341 INFO L290 TraceCheckUtils]: 25: Hoare triple {15367#true} assume true; {15367#true} is VALID [2022-04-14 14:57:27,341 INFO L290 TraceCheckUtils]: 24: Hoare triple {15367#true} assume !(0 == ~cond); {15367#true} is VALID [2022-04-14 14:57:27,341 INFO L290 TraceCheckUtils]: 23: Hoare triple {15367#true} ~cond := #in~cond; {15367#true} is VALID [2022-04-14 14:57:27,341 INFO L272 TraceCheckUtils]: 22: Hoare triple {15367#true} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {15367#true} is VALID [2022-04-14 14:57:27,341 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {15367#true} {15367#true} #80#return; {15367#true} is VALID [2022-04-14 14:57:27,342 INFO L290 TraceCheckUtils]: 20: Hoare triple {15367#true} assume true; {15367#true} is VALID [2022-04-14 14:57:27,342 INFO L290 TraceCheckUtils]: 19: Hoare triple {15367#true} assume !(0 == ~cond); {15367#true} is VALID [2022-04-14 14:57:27,342 INFO L290 TraceCheckUtils]: 18: Hoare triple {15367#true} ~cond := #in~cond; {15367#true} is VALID [2022-04-14 14:57:27,342 INFO L272 TraceCheckUtils]: 17: Hoare triple {15367#true} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {15367#true} is VALID [2022-04-14 14:57:27,342 INFO L290 TraceCheckUtils]: 16: Hoare triple {15367#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {15367#true} is VALID [2022-04-14 14:57:27,342 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {15367#true} {15367#true} #78#return; {15367#true} is VALID [2022-04-14 14:57:27,342 INFO L290 TraceCheckUtils]: 14: Hoare triple {15367#true} assume true; {15367#true} is VALID [2022-04-14 14:57:27,342 INFO L290 TraceCheckUtils]: 13: Hoare triple {15367#true} assume !(0 == ~cond); {15367#true} is VALID [2022-04-14 14:57:27,342 INFO L290 TraceCheckUtils]: 12: Hoare triple {15367#true} ~cond := #in~cond; {15367#true} is VALID [2022-04-14 14:57:27,342 INFO L272 TraceCheckUtils]: 11: Hoare triple {15367#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {15367#true} is VALID [2022-04-14 14:57:27,342 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {15367#true} {15367#true} #76#return; {15367#true} is VALID [2022-04-14 14:57:27,342 INFO L290 TraceCheckUtils]: 9: Hoare triple {15367#true} assume true; {15367#true} is VALID [2022-04-14 14:57:27,342 INFO L290 TraceCheckUtils]: 8: Hoare triple {15367#true} assume !(0 == ~cond); {15367#true} is VALID [2022-04-14 14:57:27,343 INFO L290 TraceCheckUtils]: 7: Hoare triple {15367#true} ~cond := #in~cond; {15367#true} is VALID [2022-04-14 14:57:27,343 INFO L272 TraceCheckUtils]: 6: Hoare triple {15367#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {15367#true} is VALID [2022-04-14 14:57:27,343 INFO L290 TraceCheckUtils]: 5: Hoare triple {15367#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~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; {15367#true} is VALID [2022-04-14 14:57:27,343 INFO L272 TraceCheckUtils]: 4: Hoare triple {15367#true} call #t~ret6 := main(); {15367#true} is VALID [2022-04-14 14:57:27,343 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15367#true} {15367#true} #96#return; {15367#true} is VALID [2022-04-14 14:57:27,343 INFO L290 TraceCheckUtils]: 2: Hoare triple {15367#true} assume true; {15367#true} is VALID [2022-04-14 14:57:27,343 INFO L290 TraceCheckUtils]: 1: Hoare triple {15367#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(11, 2);call #Ultimate.allocInit(12, 3); {15367#true} is VALID [2022-04-14 14:57:27,343 INFO L272 TraceCheckUtils]: 0: Hoare triple {15367#true} call ULTIMATE.init(); {15367#true} is VALID [2022-04-14 14:57:27,344 INFO L134 CoverageAnalysis]: Checked inductivity of 579 backedges. 154 proven. 12 refuted. 0 times theorem prover too weak. 413 trivial. 0 not checked. [2022-04-14 14:57:27,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 14:57:27,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315085073] [2022-04-14 14:57:27,344 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 14:57:27,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [875638293] [2022-04-14 14:57:27,344 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [875638293] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-14 14:57:27,344 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-14 14:57:27,344 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 12] total 26 [2022-04-14 14:57:27,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88214878] [2022-04-14 14:57:27,344 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-14 14:57:27,345 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 20 states have (on average 2.25) internal successors, (45), 19 states have internal predecessors, (45), 14 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (31), 11 states have call predecessors, (31), 12 states have call successors, (31) Word has length 127 [2022-04-14 14:57:27,347 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 14:57:27,347 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 26 states, 20 states have (on average 2.25) internal successors, (45), 19 states have internal predecessors, (45), 14 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (31), 11 states have call predecessors, (31), 12 states have call successors, (31) [2022-04-14 14:57:27,656 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 14:57:27,656 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-14 14:57:27,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 14:57:27,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-14 14:57:27,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=537, Unknown=0, NotChecked=0, Total=650 [2022-04-14 14:57:27,657 INFO L87 Difference]: Start difference. First operand 227 states and 298 transitions. Second operand has 26 states, 20 states have (on average 2.25) internal successors, (45), 19 states have internal predecessors, (45), 14 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (31), 11 states have call predecessors, (31), 12 states have call successors, (31) [2022-04-14 14:57:34,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:57:34,482 INFO L93 Difference]: Finished difference Result 261 states and 340 transitions. [2022-04-14 14:57:34,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-04-14 14:57:34,482 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 20 states have (on average 2.25) internal successors, (45), 19 states have internal predecessors, (45), 14 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (31), 11 states have call predecessors, (31), 12 states have call successors, (31) Word has length 127 [2022-04-14 14:57:34,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 14:57:34,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 20 states have (on average 2.25) internal successors, (45), 19 states have internal predecessors, (45), 14 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (31), 11 states have call predecessors, (31), 12 states have call successors, (31) [2022-04-14 14:57:34,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 141 transitions. [2022-04-14 14:57:34,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 20 states have (on average 2.25) internal successors, (45), 19 states have internal predecessors, (45), 14 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (31), 11 states have call predecessors, (31), 12 states have call successors, (31) [2022-04-14 14:57:34,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 141 transitions. [2022-04-14 14:57:34,488 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 141 transitions. [2022-04-14 14:57:34,815 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 141 edges. 141 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 14:57:34,820 INFO L225 Difference]: With dead ends: 261 [2022-04-14 14:57:34,821 INFO L226 Difference]: Without dead ends: 253 [2022-04-14 14:57:34,821 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 228 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 408 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=359, Invalid=1621, Unknown=0, NotChecked=0, Total=1980 [2022-04-14 14:57:34,822 INFO L913 BasicCegarLoop]: 46 mSDtfsCounter, 72 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 642 mSolverCounterSat, 160 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 867 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 160 IncrementalHoareTripleChecker+Valid, 642 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 65 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-04-14 14:57:34,822 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [78 Valid, 231 Invalid, 867 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [160 Valid, 642 Invalid, 0 Unknown, 65 Unchecked, 1.8s Time] [2022-04-14 14:57:34,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2022-04-14 14:57:35,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 204. [2022-04-14 14:57:35,177 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 14:57:35,178 INFO L82 GeneralOperation]: Start isEquivalent. First operand 253 states. Second operand has 204 states, 118 states have (on average 1.076271186440678) internal successors, (127), 119 states have internal predecessors, (127), 62 states have call successors, (62), 24 states have call predecessors, (62), 23 states have return successors, (61), 60 states have call predecessors, (61), 61 states have call successors, (61) [2022-04-14 14:57:35,178 INFO L74 IsIncluded]: Start isIncluded. First operand 253 states. Second operand has 204 states, 118 states have (on average 1.076271186440678) internal successors, (127), 119 states have internal predecessors, (127), 62 states have call successors, (62), 24 states have call predecessors, (62), 23 states have return successors, (61), 60 states have call predecessors, (61), 61 states have call successors, (61) [2022-04-14 14:57:35,179 INFO L87 Difference]: Start difference. First operand 253 states. Second operand has 204 states, 118 states have (on average 1.076271186440678) internal successors, (127), 119 states have internal predecessors, (127), 62 states have call successors, (62), 24 states have call predecessors, (62), 23 states have return successors, (61), 60 states have call predecessors, (61), 61 states have call successors, (61) [2022-04-14 14:57:35,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:57:35,186 INFO L93 Difference]: Finished difference Result 253 states and 329 transitions. [2022-04-14 14:57:35,186 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 329 transitions. [2022-04-14 14:57:35,187 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 14:57:35,187 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 14:57:35,188 INFO L74 IsIncluded]: Start isIncluded. First operand has 204 states, 118 states have (on average 1.076271186440678) internal successors, (127), 119 states have internal predecessors, (127), 62 states have call successors, (62), 24 states have call predecessors, (62), 23 states have return successors, (61), 60 states have call predecessors, (61), 61 states have call successors, (61) Second operand 253 states. [2022-04-14 14:57:35,188 INFO L87 Difference]: Start difference. First operand has 204 states, 118 states have (on average 1.076271186440678) internal successors, (127), 119 states have internal predecessors, (127), 62 states have call successors, (62), 24 states have call predecessors, (62), 23 states have return successors, (61), 60 states have call predecessors, (61), 61 states have call successors, (61) Second operand 253 states. [2022-04-14 14:57:35,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:57:35,195 INFO L93 Difference]: Finished difference Result 253 states and 329 transitions. [2022-04-14 14:57:35,195 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 329 transitions. [2022-04-14 14:57:35,195 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 14:57:35,196 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 14:57:35,196 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 14:57:35,196 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 14:57:35,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 118 states have (on average 1.076271186440678) internal successors, (127), 119 states have internal predecessors, (127), 62 states have call successors, (62), 24 states have call predecessors, (62), 23 states have return successors, (61), 60 states have call predecessors, (61), 61 states have call successors, (61) [2022-04-14 14:57:35,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 250 transitions. [2022-04-14 14:57:35,208 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 250 transitions. Word has length 127 [2022-04-14 14:57:35,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 14:57:35,208 INFO L478 AbstractCegarLoop]: Abstraction has 204 states and 250 transitions. [2022-04-14 14:57:35,208 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 20 states have (on average 2.25) internal successors, (45), 19 states have internal predecessors, (45), 14 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (31), 11 states have call predecessors, (31), 12 states have call successors, (31) [2022-04-14 14:57:35,209 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 250 transitions. [2022-04-14 14:57:35,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2022-04-14 14:57:35,211 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 14:57:35,211 INFO L499 BasicCegarLoop]: trace histogram [24, 23, 23, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 14:57:35,235 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-04-14 14:57:35,435 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 14:57:35,436 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 14:57:35,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 14:57:35,436 INFO L85 PathProgramCache]: Analyzing trace with hash -931001923, now seen corresponding path program 3 times [2022-04-14 14:57:35,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 14:57:35,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259008745] [2022-04-14 14:57:35,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 14:57:35,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 14:57:35,448 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 14:57:35,449 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [262770261] [2022-04-14 14:57:35,449 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-14 14:57:35,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 14:57:35,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 14:57:35,450 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-14 14:57:35,451 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-04-14 14:57:36,804 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-04-14 14:57:36,805 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-14 14:57:36,807 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 30 conjunts are in the unsatisfiable core [2022-04-14 14:57:36,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:57:36,857 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 14:57:44,381 INFO L272 TraceCheckUtils]: 0: Hoare triple {17414#true} call ULTIMATE.init(); {17414#true} is VALID [2022-04-14 14:57:44,381 INFO L290 TraceCheckUtils]: 1: Hoare triple {17414#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(11, 2);call #Ultimate.allocInit(12, 3); {17414#true} is VALID [2022-04-14 14:57:44,381 INFO L290 TraceCheckUtils]: 2: Hoare triple {17414#true} assume true; {17414#true} is VALID [2022-04-14 14:57:44,381 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17414#true} {17414#true} #96#return; {17414#true} is VALID [2022-04-14 14:57:44,381 INFO L272 TraceCheckUtils]: 4: Hoare triple {17414#true} call #t~ret6 := main(); {17414#true} is VALID [2022-04-14 14:57:44,381 INFO L290 TraceCheckUtils]: 5: Hoare triple {17414#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~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; {17414#true} is VALID [2022-04-14 14:57:44,381 INFO L272 TraceCheckUtils]: 6: Hoare triple {17414#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {17414#true} is VALID [2022-04-14 14:57:44,382 INFO L290 TraceCheckUtils]: 7: Hoare triple {17414#true} ~cond := #in~cond; {17440#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-14 14:57:44,382 INFO L290 TraceCheckUtils]: 8: Hoare triple {17440#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {17444#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-14 14:57:44,382 INFO L290 TraceCheckUtils]: 9: Hoare triple {17444#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {17444#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-14 14:57:44,383 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {17444#(not (= |assume_abort_if_not_#in~cond| 0))} {17414#true} #76#return; {17451#(<= 1 main_~x~0)} is VALID [2022-04-14 14:57:44,383 INFO L272 TraceCheckUtils]: 11: Hoare triple {17451#(<= 1 main_~x~0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {17414#true} is VALID [2022-04-14 14:57:44,383 INFO L290 TraceCheckUtils]: 12: Hoare triple {17414#true} ~cond := #in~cond; {17414#true} is VALID [2022-04-14 14:57:44,383 INFO L290 TraceCheckUtils]: 13: Hoare triple {17414#true} assume !(0 == ~cond); {17414#true} is VALID [2022-04-14 14:57:44,383 INFO L290 TraceCheckUtils]: 14: Hoare triple {17414#true} assume true; {17414#true} is VALID [2022-04-14 14:57:44,384 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {17414#true} {17451#(<= 1 main_~x~0)} #78#return; {17451#(<= 1 main_~x~0)} is VALID [2022-04-14 14:57:44,384 INFO L290 TraceCheckUtils]: 16: Hoare triple {17451#(<= 1 main_~x~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {17470#(and (<= 1 main_~x~0) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-14 14:57:44,385 INFO L272 TraceCheckUtils]: 17: Hoare triple {17470#(and (<= 1 main_~x~0) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {17414#true} is VALID [2022-04-14 14:57:44,385 INFO L290 TraceCheckUtils]: 18: Hoare triple {17414#true} ~cond := #in~cond; {17414#true} is VALID [2022-04-14 14:57:44,385 INFO L290 TraceCheckUtils]: 19: Hoare triple {17414#true} assume !(0 == ~cond); {17414#true} is VALID [2022-04-14 14:57:44,385 INFO L290 TraceCheckUtils]: 20: Hoare triple {17414#true} assume true; {17414#true} is VALID [2022-04-14 14:57:44,386 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {17414#true} {17470#(and (<= 1 main_~x~0) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #80#return; {17470#(and (<= 1 main_~x~0) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-14 14:57:44,386 INFO L272 TraceCheckUtils]: 22: Hoare triple {17470#(and (<= 1 main_~x~0) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {17414#true} is VALID [2022-04-14 14:57:44,386 INFO L290 TraceCheckUtils]: 23: Hoare triple {17414#true} ~cond := #in~cond; {17414#true} is VALID [2022-04-14 14:57:44,386 INFO L290 TraceCheckUtils]: 24: Hoare triple {17414#true} assume !(0 == ~cond); {17414#true} is VALID [2022-04-14 14:57:44,386 INFO L290 TraceCheckUtils]: 25: Hoare triple {17414#true} assume true; {17414#true} is VALID [2022-04-14 14:57:44,387 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {17414#true} {17470#(and (<= 1 main_~x~0) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #82#return; {17470#(and (<= 1 main_~x~0) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-14 14:57:44,387 INFO L290 TraceCheckUtils]: 27: Hoare triple {17470#(and (<= 1 main_~x~0) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} assume !false; {17470#(and (<= 1 main_~x~0) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-14 14:57:44,388 INFO L290 TraceCheckUtils]: 28: Hoare triple {17470#(and (<= 1 main_~x~0) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {17507#(and (not (= main_~y~0 0)) (<= 1 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-14 14:57:44,388 INFO L290 TraceCheckUtils]: 29: Hoare triple {17507#(and (not (= main_~y~0 0)) (<= 1 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} assume !false; {17507#(and (not (= main_~y~0 0)) (<= 1 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-14 14:57:44,388 INFO L272 TraceCheckUtils]: 30: Hoare triple {17507#(and (not (= main_~y~0 0)) (<= 1 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {17414#true} is VALID [2022-04-14 14:57:44,388 INFO L290 TraceCheckUtils]: 31: Hoare triple {17414#true} ~cond := #in~cond; {17414#true} is VALID [2022-04-14 14:57:44,389 INFO L290 TraceCheckUtils]: 32: Hoare triple {17414#true} assume !(0 == ~cond); {17414#true} is VALID [2022-04-14 14:57:44,389 INFO L290 TraceCheckUtils]: 33: Hoare triple {17414#true} assume true; {17414#true} is VALID [2022-04-14 14:57:44,389 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {17414#true} {17507#(and (not (= main_~y~0 0)) (<= 1 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #84#return; {17507#(and (not (= main_~y~0 0)) (<= 1 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-14 14:57:44,389 INFO L272 TraceCheckUtils]: 35: Hoare triple {17507#(and (not (= main_~y~0 0)) (<= 1 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {17414#true} is VALID [2022-04-14 14:57:44,389 INFO L290 TraceCheckUtils]: 36: Hoare triple {17414#true} ~cond := #in~cond; {17414#true} is VALID [2022-04-14 14:57:44,390 INFO L290 TraceCheckUtils]: 37: Hoare triple {17414#true} assume !(0 == ~cond); {17414#true} is VALID [2022-04-14 14:57:44,390 INFO L290 TraceCheckUtils]: 38: Hoare triple {17414#true} assume true; {17414#true} is VALID [2022-04-14 14:57:44,390 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {17414#true} {17507#(and (not (= main_~y~0 0)) (<= 1 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #86#return; {17507#(and (not (= main_~y~0 0)) (<= 1 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-14 14:57:44,390 INFO L272 TraceCheckUtils]: 40: Hoare triple {17507#(and (not (= main_~y~0 0)) (<= 1 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {17414#true} is VALID [2022-04-14 14:57:44,390 INFO L290 TraceCheckUtils]: 41: Hoare triple {17414#true} ~cond := #in~cond; {17414#true} is VALID [2022-04-14 14:57:44,390 INFO L290 TraceCheckUtils]: 42: Hoare triple {17414#true} assume !(0 == ~cond); {17414#true} is VALID [2022-04-14 14:57:44,390 INFO L290 TraceCheckUtils]: 43: Hoare triple {17414#true} assume true; {17414#true} is VALID [2022-04-14 14:57:44,391 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {17414#true} {17507#(and (not (= main_~y~0 0)) (<= 1 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #88#return; {17507#(and (not (= main_~y~0 0)) (<= 1 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-14 14:57:44,391 INFO L272 TraceCheckUtils]: 45: Hoare triple {17507#(and (not (= main_~y~0 0)) (<= 1 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {17414#true} is VALID [2022-04-14 14:57:44,391 INFO L290 TraceCheckUtils]: 46: Hoare triple {17414#true} ~cond := #in~cond; {17414#true} is VALID [2022-04-14 14:57:44,391 INFO L290 TraceCheckUtils]: 47: Hoare triple {17414#true} assume !(0 == ~cond); {17414#true} is VALID [2022-04-14 14:57:44,391 INFO L290 TraceCheckUtils]: 48: Hoare triple {17414#true} assume true; {17414#true} is VALID [2022-04-14 14:57:44,392 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {17414#true} {17507#(and (not (= main_~y~0 0)) (<= 1 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #90#return; {17507#(and (not (= main_~y~0 0)) (<= 1 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-14 14:57:44,392 INFO L290 TraceCheckUtils]: 50: Hoare triple {17507#(and (not (= main_~y~0 0)) (<= 1 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} assume !(~c~0 >= ~b~0); {17507#(and (not (= main_~y~0 0)) (<= 1 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-14 14:57:44,393 INFO L290 TraceCheckUtils]: 51: Hoare triple {17507#(and (not (= main_~y~0 0)) (<= 1 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {17507#(and (not (= main_~y~0 0)) (<= 1 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-14 14:57:44,393 INFO L290 TraceCheckUtils]: 52: Hoare triple {17507#(and (not (= main_~y~0 0)) (<= 1 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} assume !false; {17507#(and (not (= main_~y~0 0)) (<= 1 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-14 14:57:44,393 INFO L290 TraceCheckUtils]: 53: Hoare triple {17507#(and (not (= main_~y~0 0)) (<= 1 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {17507#(and (not (= main_~y~0 0)) (<= 1 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-14 14:57:44,394 INFO L290 TraceCheckUtils]: 54: Hoare triple {17507#(and (not (= main_~y~0 0)) (<= 1 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} assume !false; {17507#(and (not (= main_~y~0 0)) (<= 1 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-14 14:57:44,394 INFO L272 TraceCheckUtils]: 55: Hoare triple {17507#(and (not (= main_~y~0 0)) (<= 1 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {17414#true} is VALID [2022-04-14 14:57:44,394 INFO L290 TraceCheckUtils]: 56: Hoare triple {17414#true} ~cond := #in~cond; {17414#true} is VALID [2022-04-14 14:57:44,394 INFO L290 TraceCheckUtils]: 57: Hoare triple {17414#true} assume !(0 == ~cond); {17414#true} is VALID [2022-04-14 14:57:44,394 INFO L290 TraceCheckUtils]: 58: Hoare triple {17414#true} assume true; {17414#true} is VALID [2022-04-14 14:57:44,395 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {17414#true} {17507#(and (not (= main_~y~0 0)) (<= 1 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #84#return; {17507#(and (not (= main_~y~0 0)) (<= 1 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-14 14:57:44,395 INFO L272 TraceCheckUtils]: 60: Hoare triple {17507#(and (not (= main_~y~0 0)) (<= 1 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {17414#true} is VALID [2022-04-14 14:57:44,395 INFO L290 TraceCheckUtils]: 61: Hoare triple {17414#true} ~cond := #in~cond; {17414#true} is VALID [2022-04-14 14:57:44,395 INFO L290 TraceCheckUtils]: 62: Hoare triple {17414#true} assume !(0 == ~cond); {17414#true} is VALID [2022-04-14 14:57:44,395 INFO L290 TraceCheckUtils]: 63: Hoare triple {17414#true} assume true; {17414#true} is VALID [2022-04-14 14:57:44,395 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {17414#true} {17507#(and (not (= main_~y~0 0)) (<= 1 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #86#return; {17507#(and (not (= main_~y~0 0)) (<= 1 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-14 14:57:44,396 INFO L272 TraceCheckUtils]: 65: Hoare triple {17507#(and (not (= main_~y~0 0)) (<= 1 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {17414#true} is VALID [2022-04-14 14:57:44,396 INFO L290 TraceCheckUtils]: 66: Hoare triple {17414#true} ~cond := #in~cond; {17414#true} is VALID [2022-04-14 14:57:44,396 INFO L290 TraceCheckUtils]: 67: Hoare triple {17414#true} assume !(0 == ~cond); {17414#true} is VALID [2022-04-14 14:57:44,396 INFO L290 TraceCheckUtils]: 68: Hoare triple {17414#true} assume true; {17414#true} is VALID [2022-04-14 14:57:44,396 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {17414#true} {17507#(and (not (= main_~y~0 0)) (<= 1 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #88#return; {17507#(and (not (= main_~y~0 0)) (<= 1 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-14 14:57:44,396 INFO L272 TraceCheckUtils]: 70: Hoare triple {17507#(and (not (= main_~y~0 0)) (<= 1 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {17414#true} is VALID [2022-04-14 14:57:44,396 INFO L290 TraceCheckUtils]: 71: Hoare triple {17414#true} ~cond := #in~cond; {17414#true} is VALID [2022-04-14 14:57:44,396 INFO L290 TraceCheckUtils]: 72: Hoare triple {17414#true} assume !(0 == ~cond); {17414#true} is VALID [2022-04-14 14:57:44,397 INFO L290 TraceCheckUtils]: 73: Hoare triple {17414#true} assume true; {17414#true} is VALID [2022-04-14 14:57:44,397 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {17414#true} {17507#(and (not (= main_~y~0 0)) (<= 1 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #90#return; {17507#(and (not (= main_~y~0 0)) (<= 1 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-14 14:57:44,397 INFO L290 TraceCheckUtils]: 75: Hoare triple {17507#(and (not (= main_~y~0 0)) (<= 1 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {17507#(and (not (= main_~y~0 0)) (<= 1 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-14 14:57:44,398 INFO L290 TraceCheckUtils]: 76: Hoare triple {17507#(and (not (= main_~y~0 0)) (<= 1 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} assume !false; {17507#(and (not (= main_~y~0 0)) (<= 1 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-14 14:57:44,398 INFO L272 TraceCheckUtils]: 77: Hoare triple {17507#(and (not (= main_~y~0 0)) (<= 1 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {17414#true} is VALID [2022-04-14 14:57:44,398 INFO L290 TraceCheckUtils]: 78: Hoare triple {17414#true} ~cond := #in~cond; {17414#true} is VALID [2022-04-14 14:57:44,398 INFO L290 TraceCheckUtils]: 79: Hoare triple {17414#true} assume !(0 == ~cond); {17414#true} is VALID [2022-04-14 14:57:44,398 INFO L290 TraceCheckUtils]: 80: Hoare triple {17414#true} assume true; {17414#true} is VALID [2022-04-14 14:57:44,399 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {17414#true} {17507#(and (not (= main_~y~0 0)) (<= 1 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #84#return; {17507#(and (not (= main_~y~0 0)) (<= 1 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-14 14:57:44,399 INFO L272 TraceCheckUtils]: 82: Hoare triple {17507#(and (not (= main_~y~0 0)) (<= 1 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {17414#true} is VALID [2022-04-14 14:57:44,399 INFO L290 TraceCheckUtils]: 83: Hoare triple {17414#true} ~cond := #in~cond; {17414#true} is VALID [2022-04-14 14:57:44,399 INFO L290 TraceCheckUtils]: 84: Hoare triple {17414#true} assume !(0 == ~cond); {17414#true} is VALID [2022-04-14 14:57:44,399 INFO L290 TraceCheckUtils]: 85: Hoare triple {17414#true} assume true; {17414#true} is VALID [2022-04-14 14:57:44,400 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {17414#true} {17507#(and (not (= main_~y~0 0)) (<= 1 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #86#return; {17507#(and (not (= main_~y~0 0)) (<= 1 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-14 14:57:44,400 INFO L272 TraceCheckUtils]: 87: Hoare triple {17507#(and (not (= main_~y~0 0)) (<= 1 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {17414#true} is VALID [2022-04-14 14:57:44,400 INFO L290 TraceCheckUtils]: 88: Hoare triple {17414#true} ~cond := #in~cond; {17414#true} is VALID [2022-04-14 14:57:44,400 INFO L290 TraceCheckUtils]: 89: Hoare triple {17414#true} assume !(0 == ~cond); {17414#true} is VALID [2022-04-14 14:57:44,400 INFO L290 TraceCheckUtils]: 90: Hoare triple {17414#true} assume true; {17414#true} is VALID [2022-04-14 14:57:44,400 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {17414#true} {17507#(and (not (= main_~y~0 0)) (<= 1 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #88#return; {17507#(and (not (= main_~y~0 0)) (<= 1 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-14 14:57:44,400 INFO L272 TraceCheckUtils]: 92: Hoare triple {17507#(and (not (= main_~y~0 0)) (<= 1 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {17414#true} is VALID [2022-04-14 14:57:44,400 INFO L290 TraceCheckUtils]: 93: Hoare triple {17414#true} ~cond := #in~cond; {17414#true} is VALID [2022-04-14 14:57:44,401 INFO L290 TraceCheckUtils]: 94: Hoare triple {17414#true} assume !(0 == ~cond); {17414#true} is VALID [2022-04-14 14:57:44,401 INFO L290 TraceCheckUtils]: 95: Hoare triple {17414#true} assume true; {17414#true} is VALID [2022-04-14 14:57:44,401 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {17414#true} {17507#(and (not (= main_~y~0 0)) (<= 1 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #90#return; {17507#(and (not (= main_~y~0 0)) (<= 1 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-14 14:57:44,402 INFO L290 TraceCheckUtils]: 97: Hoare triple {17507#(and (not (= main_~y~0 0)) (<= 1 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} assume !(~c~0 >= ~b~0); {17715#(and (not (= main_~y~0 0)) (<= 1 main_~x~0) (not (<= main_~b~0 main_~c~0)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-14 14:57:44,402 INFO L290 TraceCheckUtils]: 98: Hoare triple {17715#(and (not (= main_~y~0 0)) (<= 1 main_~x~0) (not (<= main_~b~0 main_~c~0)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {17719#(and (< main_~b~0 main_~a~0) (not (= main_~y~0 0)) (<= 1 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-14 14:57:44,402 INFO L290 TraceCheckUtils]: 99: Hoare triple {17719#(and (< main_~b~0 main_~a~0) (not (= main_~y~0 0)) (<= 1 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} assume !false; {17719#(and (< main_~b~0 main_~a~0) (not (= main_~y~0 0)) (<= 1 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-14 14:57:44,403 INFO L290 TraceCheckUtils]: 100: Hoare triple {17719#(and (< main_~b~0 main_~a~0) (not (= main_~y~0 0)) (<= 1 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {17726#(and (not (= main_~y~0 0)) (<= 1 main_~x~0) (< main_~b~0 main_~c~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-14 14:57:44,403 INFO L290 TraceCheckUtils]: 101: Hoare triple {17726#(and (not (= main_~y~0 0)) (<= 1 main_~x~0) (< main_~b~0 main_~c~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} assume !false; {17726#(and (not (= main_~y~0 0)) (<= 1 main_~x~0) (< main_~b~0 main_~c~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-14 14:57:44,403 INFO L272 TraceCheckUtils]: 102: Hoare triple {17726#(and (not (= main_~y~0 0)) (<= 1 main_~x~0) (< main_~b~0 main_~c~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {17414#true} is VALID [2022-04-14 14:57:44,403 INFO L290 TraceCheckUtils]: 103: Hoare triple {17414#true} ~cond := #in~cond; {17414#true} is VALID [2022-04-14 14:57:44,403 INFO L290 TraceCheckUtils]: 104: Hoare triple {17414#true} assume !(0 == ~cond); {17414#true} is VALID [2022-04-14 14:57:44,404 INFO L290 TraceCheckUtils]: 105: Hoare triple {17414#true} assume true; {17414#true} is VALID [2022-04-14 14:57:44,404 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {17414#true} {17726#(and (not (= main_~y~0 0)) (<= 1 main_~x~0) (< main_~b~0 main_~c~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #84#return; {17726#(and (not (= main_~y~0 0)) (<= 1 main_~x~0) (< main_~b~0 main_~c~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-14 14:57:44,404 INFO L272 TraceCheckUtils]: 107: Hoare triple {17726#(and (not (= main_~y~0 0)) (<= 1 main_~x~0) (< main_~b~0 main_~c~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {17414#true} is VALID [2022-04-14 14:57:44,404 INFO L290 TraceCheckUtils]: 108: Hoare triple {17414#true} ~cond := #in~cond; {17414#true} is VALID [2022-04-14 14:57:44,404 INFO L290 TraceCheckUtils]: 109: Hoare triple {17414#true} assume !(0 == ~cond); {17414#true} is VALID [2022-04-14 14:57:44,404 INFO L290 TraceCheckUtils]: 110: Hoare triple {17414#true} assume true; {17414#true} is VALID [2022-04-14 14:57:44,405 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {17414#true} {17726#(and (not (= main_~y~0 0)) (<= 1 main_~x~0) (< main_~b~0 main_~c~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #86#return; {17726#(and (not (= main_~y~0 0)) (<= 1 main_~x~0) (< main_~b~0 main_~c~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-14 14:57:44,405 INFO L272 TraceCheckUtils]: 112: Hoare triple {17726#(and (not (= main_~y~0 0)) (<= 1 main_~x~0) (< main_~b~0 main_~c~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {17414#true} is VALID [2022-04-14 14:57:44,405 INFO L290 TraceCheckUtils]: 113: Hoare triple {17414#true} ~cond := #in~cond; {17414#true} is VALID [2022-04-14 14:57:44,405 INFO L290 TraceCheckUtils]: 114: Hoare triple {17414#true} assume !(0 == ~cond); {17414#true} is VALID [2022-04-14 14:57:44,405 INFO L290 TraceCheckUtils]: 115: Hoare triple {17414#true} assume true; {17414#true} is VALID [2022-04-14 14:57:44,406 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {17414#true} {17726#(and (not (= main_~y~0 0)) (<= 1 main_~x~0) (< main_~b~0 main_~c~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #88#return; {17726#(and (not (= main_~y~0 0)) (<= 1 main_~x~0) (< main_~b~0 main_~c~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-14 14:57:44,406 INFO L272 TraceCheckUtils]: 117: Hoare triple {17726#(and (not (= main_~y~0 0)) (<= 1 main_~x~0) (< main_~b~0 main_~c~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {17414#true} is VALID [2022-04-14 14:57:44,406 INFO L290 TraceCheckUtils]: 118: Hoare triple {17414#true} ~cond := #in~cond; {17414#true} is VALID [2022-04-14 14:57:44,406 INFO L290 TraceCheckUtils]: 119: Hoare triple {17414#true} assume !(0 == ~cond); {17414#true} is VALID [2022-04-14 14:57:44,406 INFO L290 TraceCheckUtils]: 120: Hoare triple {17414#true} assume true; {17414#true} is VALID [2022-04-14 14:57:44,407 INFO L284 TraceCheckUtils]: 121: Hoare quadruple {17414#true} {17726#(and (not (= main_~y~0 0)) (<= 1 main_~x~0) (< main_~b~0 main_~c~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #90#return; {17726#(and (not (= main_~y~0 0)) (<= 1 main_~x~0) (< main_~b~0 main_~c~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-14 14:57:44,408 INFO L290 TraceCheckUtils]: 122: Hoare triple {17726#(and (not (= main_~y~0 0)) (<= 1 main_~x~0) (< main_~b~0 main_~c~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {17793#(and (not (= main_~y~0 0)) (< 0 main_~c~0) (<= 1 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-14 14:57:44,409 INFO L290 TraceCheckUtils]: 123: Hoare triple {17793#(and (not (= main_~y~0 0)) (< 0 main_~c~0) (<= 1 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} assume !false; {17793#(and (not (= main_~y~0 0)) (< 0 main_~c~0) (<= 1 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-14 14:57:44,409 INFO L272 TraceCheckUtils]: 124: Hoare triple {17793#(and (not (= main_~y~0 0)) (< 0 main_~c~0) (<= 1 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {17414#true} is VALID [2022-04-14 14:57:44,409 INFO L290 TraceCheckUtils]: 125: Hoare triple {17414#true} ~cond := #in~cond; {17414#true} is VALID [2022-04-14 14:57:44,409 INFO L290 TraceCheckUtils]: 126: Hoare triple {17414#true} assume !(0 == ~cond); {17414#true} is VALID [2022-04-14 14:57:44,409 INFO L290 TraceCheckUtils]: 127: Hoare triple {17414#true} assume true; {17414#true} is VALID [2022-04-14 14:57:44,409 INFO L284 TraceCheckUtils]: 128: Hoare quadruple {17414#true} {17793#(and (not (= main_~y~0 0)) (< 0 main_~c~0) (<= 1 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #84#return; {17793#(and (not (= main_~y~0 0)) (< 0 main_~c~0) (<= 1 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-14 14:57:44,410 INFO L272 TraceCheckUtils]: 129: Hoare triple {17793#(and (not (= main_~y~0 0)) (< 0 main_~c~0) (<= 1 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {17414#true} is VALID [2022-04-14 14:57:44,410 INFO L290 TraceCheckUtils]: 130: Hoare triple {17414#true} ~cond := #in~cond; {17414#true} is VALID [2022-04-14 14:57:44,410 INFO L290 TraceCheckUtils]: 131: Hoare triple {17414#true} assume !(0 == ~cond); {17414#true} is VALID [2022-04-14 14:57:44,410 INFO L290 TraceCheckUtils]: 132: Hoare triple {17414#true} assume true; {17414#true} is VALID [2022-04-14 14:57:44,410 INFO L284 TraceCheckUtils]: 133: Hoare quadruple {17414#true} {17793#(and (not (= main_~y~0 0)) (< 0 main_~c~0) (<= 1 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #86#return; {17793#(and (not (= main_~y~0 0)) (< 0 main_~c~0) (<= 1 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-14 14:57:44,410 INFO L272 TraceCheckUtils]: 134: Hoare triple {17793#(and (not (= main_~y~0 0)) (< 0 main_~c~0) (<= 1 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {17414#true} is VALID [2022-04-14 14:57:44,410 INFO L290 TraceCheckUtils]: 135: Hoare triple {17414#true} ~cond := #in~cond; {17414#true} is VALID [2022-04-14 14:57:44,411 INFO L290 TraceCheckUtils]: 136: Hoare triple {17414#true} assume !(0 == ~cond); {17414#true} is VALID [2022-04-14 14:57:44,411 INFO L290 TraceCheckUtils]: 137: Hoare triple {17414#true} assume true; {17414#true} is VALID [2022-04-14 14:57:44,411 INFO L284 TraceCheckUtils]: 138: Hoare quadruple {17414#true} {17793#(and (not (= main_~y~0 0)) (< 0 main_~c~0) (<= 1 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #88#return; {17793#(and (not (= main_~y~0 0)) (< 0 main_~c~0) (<= 1 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-14 14:57:44,411 INFO L272 TraceCheckUtils]: 139: Hoare triple {17793#(and (not (= main_~y~0 0)) (< 0 main_~c~0) (<= 1 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {17414#true} is VALID [2022-04-14 14:57:44,411 INFO L290 TraceCheckUtils]: 140: Hoare triple {17414#true} ~cond := #in~cond; {17414#true} is VALID [2022-04-14 14:57:44,411 INFO L290 TraceCheckUtils]: 141: Hoare triple {17414#true} assume !(0 == ~cond); {17414#true} is VALID [2022-04-14 14:57:44,411 INFO L290 TraceCheckUtils]: 142: Hoare triple {17414#true} assume true; {17414#true} is VALID [2022-04-14 14:57:44,412 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {17414#true} {17793#(and (not (= main_~y~0 0)) (< 0 main_~c~0) (<= 1 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #90#return; {17793#(and (not (= main_~y~0 0)) (< 0 main_~c~0) (<= 1 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-14 14:57:44,412 INFO L290 TraceCheckUtils]: 144: Hoare triple {17793#(and (not (= main_~y~0 0)) (< 0 main_~c~0) (<= 1 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} assume !(~c~0 >= ~b~0); {17793#(and (not (= main_~y~0 0)) (< 0 main_~c~0) (<= 1 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-14 14:57:44,413 INFO L290 TraceCheckUtils]: 145: Hoare triple {17793#(and (not (= main_~y~0 0)) (< 0 main_~c~0) (<= 1 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {17863#(and (not (= main_~y~0 0)) (<= 1 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (< 0 main_~b~0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-14 14:57:44,413 INFO L290 TraceCheckUtils]: 146: Hoare triple {17863#(and (not (= main_~y~0 0)) (<= 1 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (< 0 main_~b~0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} assume !false; {17863#(and (not (= main_~y~0 0)) (<= 1 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (< 0 main_~b~0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-14 14:57:44,414 INFO L290 TraceCheckUtils]: 147: Hoare triple {17863#(and (not (= main_~y~0 0)) (<= 1 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (< 0 main_~b~0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {17863#(and (not (= main_~y~0 0)) (<= 1 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (< 0 main_~b~0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-14 14:57:44,414 INFO L290 TraceCheckUtils]: 148: Hoare triple {17863#(and (not (= main_~y~0 0)) (<= 1 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (< 0 main_~b~0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} assume !false; {17863#(and (not (= main_~y~0 0)) (<= 1 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (< 0 main_~b~0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-14 14:57:44,414 INFO L272 TraceCheckUtils]: 149: Hoare triple {17863#(and (not (= main_~y~0 0)) (<= 1 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (< 0 main_~b~0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {17414#true} is VALID [2022-04-14 14:57:44,414 INFO L290 TraceCheckUtils]: 150: Hoare triple {17414#true} ~cond := #in~cond; {17414#true} is VALID [2022-04-14 14:57:44,414 INFO L290 TraceCheckUtils]: 151: Hoare triple {17414#true} assume !(0 == ~cond); {17414#true} is VALID [2022-04-14 14:57:44,414 INFO L290 TraceCheckUtils]: 152: Hoare triple {17414#true} assume true; {17414#true} is VALID [2022-04-14 14:57:44,415 INFO L284 TraceCheckUtils]: 153: Hoare quadruple {17414#true} {17863#(and (not (= main_~y~0 0)) (<= 1 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (< 0 main_~b~0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #84#return; {17863#(and (not (= main_~y~0 0)) (<= 1 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (< 0 main_~b~0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-14 14:57:44,415 INFO L272 TraceCheckUtils]: 154: Hoare triple {17863#(and (not (= main_~y~0 0)) (<= 1 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (< 0 main_~b~0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {17414#true} is VALID [2022-04-14 14:57:44,415 INFO L290 TraceCheckUtils]: 155: Hoare triple {17414#true} ~cond := #in~cond; {17414#true} is VALID [2022-04-14 14:57:44,415 INFO L290 TraceCheckUtils]: 156: Hoare triple {17414#true} assume !(0 == ~cond); {17414#true} is VALID [2022-04-14 14:57:44,415 INFO L290 TraceCheckUtils]: 157: Hoare triple {17414#true} assume true; {17414#true} is VALID [2022-04-14 14:57:44,416 INFO L284 TraceCheckUtils]: 158: Hoare quadruple {17414#true} {17863#(and (not (= main_~y~0 0)) (<= 1 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (< 0 main_~b~0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #86#return; {17863#(and (not (= main_~y~0 0)) (<= 1 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (< 0 main_~b~0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-14 14:57:44,416 INFO L272 TraceCheckUtils]: 159: Hoare triple {17863#(and (not (= main_~y~0 0)) (<= 1 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (< 0 main_~b~0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {17414#true} is VALID [2022-04-14 14:57:44,416 INFO L290 TraceCheckUtils]: 160: Hoare triple {17414#true} ~cond := #in~cond; {17909#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-14 14:57:44,416 INFO L290 TraceCheckUtils]: 161: Hoare triple {17909#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {17913#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 14:57:44,417 INFO L290 TraceCheckUtils]: 162: Hoare triple {17913#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {17913#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 14:57:44,417 INFO L284 TraceCheckUtils]: 163: Hoare quadruple {17913#(not (= |__VERIFIER_assert_#in~cond| 0))} {17863#(and (not (= main_~y~0 0)) (<= 1 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (< 0 main_~b~0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #88#return; {17920#(and (not (= main_~y~0 0)) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (<= 1 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (< 0 main_~b~0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-14 14:57:44,461 INFO L272 TraceCheckUtils]: 164: Hoare triple {17920#(and (not (= main_~y~0 0)) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (<= 1 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (< 0 main_~b~0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {17924#(exists ((v_main_~y~0_BEFORE_CALL_190 Int) (v_main_~q~0_BEFORE_CALL_147 Int) (v_main_~s~0_BEFORE_CALL_150 Int) (v_main_~x~0_BEFORE_CALL_187 Int)) (and (< 0 (+ (* v_main_~y~0_BEFORE_CALL_190 v_main_~s~0_BEFORE_CALL_150) (* v_main_~x~0_BEFORE_CALL_187 v_main_~q~0_BEFORE_CALL_147))) (<= 1 |__VERIFIER_assert_#in~cond|) (not (= v_main_~y~0_BEFORE_CALL_190 0)) (<= 1 v_main_~x~0_BEFORE_CALL_187)))} is VALID [2022-04-14 14:57:44,462 INFO L290 TraceCheckUtils]: 165: Hoare triple {17924#(exists ((v_main_~y~0_BEFORE_CALL_190 Int) (v_main_~q~0_BEFORE_CALL_147 Int) (v_main_~s~0_BEFORE_CALL_150 Int) (v_main_~x~0_BEFORE_CALL_187 Int)) (and (< 0 (+ (* v_main_~y~0_BEFORE_CALL_190 v_main_~s~0_BEFORE_CALL_150) (* v_main_~x~0_BEFORE_CALL_187 v_main_~q~0_BEFORE_CALL_147))) (<= 1 |__VERIFIER_assert_#in~cond|) (not (= v_main_~y~0_BEFORE_CALL_190 0)) (<= 1 v_main_~x~0_BEFORE_CALL_187)))} ~cond := #in~cond; {17928#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 14:57:44,462 INFO L290 TraceCheckUtils]: 166: Hoare triple {17928#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {17415#false} is VALID [2022-04-14 14:57:44,462 INFO L290 TraceCheckUtils]: 167: Hoare triple {17415#false} assume !false; {17415#false} is VALID [2022-04-14 14:57:44,463 INFO L134 CoverageAnalysis]: Checked inductivity of 1182 backedges. 168 proven. 35 refuted. 0 times theorem prover too weak. 979 trivial. 0 not checked. [2022-04-14 14:57:44,463 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 14:57:51,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 14:57:51,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259008745] [2022-04-14 14:57:51,277 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 14:57:51,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [262770261] [2022-04-14 14:57:51,277 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [262770261] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-14 14:57:51,278 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-14 14:57:51,278 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2022-04-14 14:57:51,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083577308] [2022-04-14 14:57:51,278 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-14 14:57:51,278 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.4375) internal successors, (39), 14 states have internal predecessors, (39), 8 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (20), 8 states have call predecessors, (20), 7 states have call successors, (20) Word has length 168 [2022-04-14 14:57:51,279 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 14:57:51,279 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 16 states have (on average 2.4375) internal successors, (39), 14 states have internal predecessors, (39), 8 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (20), 8 states have call predecessors, (20), 7 states have call successors, (20) [2022-04-14 14:57:51,484 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 14:57:51,485 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-14 14:57:51,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 14:57:51,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-14 14:57:51,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=315, Unknown=0, NotChecked=0, Total=380 [2022-04-14 14:57:51,485 INFO L87 Difference]: Start difference. First operand 204 states and 250 transitions. Second operand has 17 states, 16 states have (on average 2.4375) internal successors, (39), 14 states have internal predecessors, (39), 8 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (20), 8 states have call predecessors, (20), 7 states have call successors, (20) [2022-04-14 14:58:29,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:58:29,167 INFO L93 Difference]: Finished difference Result 299 states and 400 transitions. [2022-04-14 14:58:29,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-14 14:58:29,168 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.4375) internal successors, (39), 14 states have internal predecessors, (39), 8 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (20), 8 states have call predecessors, (20), 7 states have call successors, (20) Word has length 168 [2022-04-14 14:58:29,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 14:58:29,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 2.4375) internal successors, (39), 14 states have internal predecessors, (39), 8 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (20), 8 states have call predecessors, (20), 7 states have call successors, (20) [2022-04-14 14:58:29,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 115 transitions. [2022-04-14 14:58:29,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 2.4375) internal successors, (39), 14 states have internal predecessors, (39), 8 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (20), 8 states have call predecessors, (20), 7 states have call successors, (20) [2022-04-14 14:58:29,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 115 transitions. [2022-04-14 14:58:29,172 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 115 transitions. [2022-04-14 14:58:29,558 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 115 edges. 115 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 14:58:29,566 INFO L225 Difference]: With dead ends: 299 [2022-04-14 14:58:29,566 INFO L226 Difference]: Without dead ends: 297 [2022-04-14 14:58:29,566 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 153 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 238 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=218, Invalid=1042, Unknown=0, NotChecked=0, Total=1260 [2022-04-14 14:58:29,567 INFO L913 BasicCegarLoop]: 43 mSDtfsCounter, 33 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 793 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 929 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 793 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 81 IncrementalHoareTripleChecker+Unchecked, 11.9s IncrementalHoareTripleChecker+Time [2022-04-14 14:58:29,567 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 268 Invalid, 929 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 793 Invalid, 0 Unknown, 81 Unchecked, 11.9s Time] [2022-04-14 14:58:29,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2022-04-14 14:58:30,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 292. [2022-04-14 14:58:30,131 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 14:58:30,131 INFO L82 GeneralOperation]: Start isEquivalent. First operand 297 states. Second operand has 292 states, 156 states have (on average 1.1153846153846154) internal successors, (174), 158 states have internal predecessors, (174), 110 states have call successors, (110), 26 states have call predecessors, (110), 25 states have return successors, (109), 107 states have call predecessors, (109), 109 states have call successors, (109) [2022-04-14 14:58:30,132 INFO L74 IsIncluded]: Start isIncluded. First operand 297 states. Second operand has 292 states, 156 states have (on average 1.1153846153846154) internal successors, (174), 158 states have internal predecessors, (174), 110 states have call successors, (110), 26 states have call predecessors, (110), 25 states have return successors, (109), 107 states have call predecessors, (109), 109 states have call successors, (109) [2022-04-14 14:58:30,132 INFO L87 Difference]: Start difference. First operand 297 states. Second operand has 292 states, 156 states have (on average 1.1153846153846154) internal successors, (174), 158 states have internal predecessors, (174), 110 states have call successors, (110), 26 states have call predecessors, (110), 25 states have return successors, (109), 107 states have call predecessors, (109), 109 states have call successors, (109) [2022-04-14 14:58:30,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:58:30,141 INFO L93 Difference]: Finished difference Result 297 states and 398 transitions. [2022-04-14 14:58:30,141 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 398 transitions. [2022-04-14 14:58:30,143 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 14:58:30,143 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 14:58:30,144 INFO L74 IsIncluded]: Start isIncluded. First operand has 292 states, 156 states have (on average 1.1153846153846154) internal successors, (174), 158 states have internal predecessors, (174), 110 states have call successors, (110), 26 states have call predecessors, (110), 25 states have return successors, (109), 107 states have call predecessors, (109), 109 states have call successors, (109) Second operand 297 states. [2022-04-14 14:58:30,144 INFO L87 Difference]: Start difference. First operand has 292 states, 156 states have (on average 1.1153846153846154) internal successors, (174), 158 states have internal predecessors, (174), 110 states have call successors, (110), 26 states have call predecessors, (110), 25 states have return successors, (109), 107 states have call predecessors, (109), 109 states have call successors, (109) Second operand 297 states. [2022-04-14 14:58:30,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:58:30,153 INFO L93 Difference]: Finished difference Result 297 states and 398 transitions. [2022-04-14 14:58:30,154 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 398 transitions. [2022-04-14 14:58:30,155 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 14:58:30,155 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 14:58:30,155 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 14:58:30,155 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 14:58:30,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 156 states have (on average 1.1153846153846154) internal successors, (174), 158 states have internal predecessors, (174), 110 states have call successors, (110), 26 states have call predecessors, (110), 25 states have return successors, (109), 107 states have call predecessors, (109), 109 states have call successors, (109) [2022-04-14 14:58:30,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 393 transitions. [2022-04-14 14:58:30,165 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 393 transitions. Word has length 168 [2022-04-14 14:58:30,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 14:58:30,166 INFO L478 AbstractCegarLoop]: Abstraction has 292 states and 393 transitions. [2022-04-14 14:58:30,166 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.4375) internal successors, (39), 14 states have internal predecessors, (39), 8 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (20), 8 states have call predecessors, (20), 7 states have call successors, (20) [2022-04-14 14:58:30,166 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 393 transitions. [2022-04-14 14:58:30,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2022-04-14 14:58:30,169 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 14:58:30,169 INFO L499 BasicCegarLoop]: trace histogram [28, 27, 27, 7, 7, 7, 7, 7, 7, 7, 7, 6, 4, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 14:58:30,183 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-04-14 14:58:30,381 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-04-14 14:58:30,382 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 14:58:30,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 14:58:30,382 INFO L85 PathProgramCache]: Analyzing trace with hash -700015396, now seen corresponding path program 4 times [2022-04-14 14:58:30,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 14:58:30,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629606541] [2022-04-14 14:58:30,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 14:58:30,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 14:58:30,405 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 14:58:30,405 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [637763481] [2022-04-14 14:58:30,405 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-14 14:58:30,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 14:58:30,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 14:58:30,408 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-14 14:58:30,433 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-04-14 14:58:30,876 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-14 14:58:30,876 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-14 14:58:30,879 INFO L263 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 111 conjunts are in the unsatisfiable core [2022-04-14 14:58:30,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:58:30,920 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 14:58:46,289 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-14 14:58:49,248 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-14 15:00:08,765 INFO L272 TraceCheckUtils]: 0: Hoare triple {19514#true} call ULTIMATE.init(); {19514#true} is VALID [2022-04-14 15:00:08,766 INFO L290 TraceCheckUtils]: 1: Hoare triple {19514#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(11, 2);call #Ultimate.allocInit(12, 3); {19514#true} is VALID [2022-04-14 15:00:08,766 INFO L290 TraceCheckUtils]: 2: Hoare triple {19514#true} assume true; {19514#true} is VALID [2022-04-14 15:00:08,766 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19514#true} {19514#true} #96#return; {19514#true} is VALID [2022-04-14 15:00:08,766 INFO L272 TraceCheckUtils]: 4: Hoare triple {19514#true} call #t~ret6 := main(); {19514#true} is VALID [2022-04-14 15:00:08,766 INFO L290 TraceCheckUtils]: 5: Hoare triple {19514#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~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; {19514#true} is VALID [2022-04-14 15:00:08,766 INFO L272 TraceCheckUtils]: 6: Hoare triple {19514#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {19514#true} is VALID [2022-04-14 15:00:08,766 INFO L290 TraceCheckUtils]: 7: Hoare triple {19514#true} ~cond := #in~cond; {19514#true} is VALID [2022-04-14 15:00:08,766 INFO L290 TraceCheckUtils]: 8: Hoare triple {19514#true} assume !(0 == ~cond); {19514#true} is VALID [2022-04-14 15:00:08,766 INFO L290 TraceCheckUtils]: 9: Hoare triple {19514#true} assume true; {19514#true} is VALID [2022-04-14 15:00:08,766 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {19514#true} {19514#true} #76#return; {19514#true} is VALID [2022-04-14 15:00:08,766 INFO L272 TraceCheckUtils]: 11: Hoare triple {19514#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {19514#true} is VALID [2022-04-14 15:00:08,766 INFO L290 TraceCheckUtils]: 12: Hoare triple {19514#true} ~cond := #in~cond; {19514#true} is VALID [2022-04-14 15:00:08,767 INFO L290 TraceCheckUtils]: 13: Hoare triple {19514#true} assume !(0 == ~cond); {19514#true} is VALID [2022-04-14 15:00:08,767 INFO L290 TraceCheckUtils]: 14: Hoare triple {19514#true} assume true; {19514#true} is VALID [2022-04-14 15:00:08,767 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {19514#true} {19514#true} #78#return; {19514#true} is VALID [2022-04-14 15:00:08,767 INFO L290 TraceCheckUtils]: 16: Hoare triple {19514#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {19567#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 15:00:08,767 INFO L272 TraceCheckUtils]: 17: Hoare triple {19567#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {19514#true} is VALID [2022-04-14 15:00:08,767 INFO L290 TraceCheckUtils]: 18: Hoare triple {19514#true} ~cond := #in~cond; {19514#true} is VALID [2022-04-14 15:00:08,767 INFO L290 TraceCheckUtils]: 19: Hoare triple {19514#true} assume !(0 == ~cond); {19514#true} is VALID [2022-04-14 15:00:08,767 INFO L290 TraceCheckUtils]: 20: Hoare triple {19514#true} assume true; {19514#true} is VALID [2022-04-14 15:00:08,768 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {19514#true} {19567#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #80#return; {19567#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 15:00:08,768 INFO L272 TraceCheckUtils]: 22: Hoare triple {19567#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {19514#true} is VALID [2022-04-14 15:00:08,768 INFO L290 TraceCheckUtils]: 23: Hoare triple {19514#true} ~cond := #in~cond; {19514#true} is VALID [2022-04-14 15:00:08,768 INFO L290 TraceCheckUtils]: 24: Hoare triple {19514#true} assume !(0 == ~cond); {19514#true} is VALID [2022-04-14 15:00:08,768 INFO L290 TraceCheckUtils]: 25: Hoare triple {19514#true} assume true; {19514#true} is VALID [2022-04-14 15:00:08,769 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {19514#true} {19567#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #82#return; {19567#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 15:00:08,769 INFO L290 TraceCheckUtils]: 27: Hoare triple {19567#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !false; {19567#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 15:00:08,770 INFO L290 TraceCheckUtils]: 28: Hoare triple {19567#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {19604#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 15:00:08,770 INFO L290 TraceCheckUtils]: 29: Hoare triple {19604#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} assume !false; {19604#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 15:00:08,770 INFO L272 TraceCheckUtils]: 30: Hoare triple {19604#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {19514#true} is VALID [2022-04-14 15:00:08,770 INFO L290 TraceCheckUtils]: 31: Hoare triple {19514#true} ~cond := #in~cond; {19514#true} is VALID [2022-04-14 15:00:08,770 INFO L290 TraceCheckUtils]: 32: Hoare triple {19514#true} assume !(0 == ~cond); {19514#true} is VALID [2022-04-14 15:00:08,771 INFO L290 TraceCheckUtils]: 33: Hoare triple {19514#true} assume true; {19514#true} is VALID [2022-04-14 15:00:08,771 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {19514#true} {19604#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #84#return; {19604#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 15:00:08,771 INFO L272 TraceCheckUtils]: 35: Hoare triple {19604#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~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)); {19514#true} is VALID [2022-04-14 15:00:08,771 INFO L290 TraceCheckUtils]: 36: Hoare triple {19514#true} ~cond := #in~cond; {19514#true} is VALID [2022-04-14 15:00:08,772 INFO L290 TraceCheckUtils]: 37: Hoare triple {19514#true} assume !(0 == ~cond); {19514#true} is VALID [2022-04-14 15:00:08,772 INFO L290 TraceCheckUtils]: 38: Hoare triple {19514#true} assume true; {19514#true} is VALID [2022-04-14 15:00:08,772 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {19514#true} {19604#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #86#return; {19604#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 15:00:08,772 INFO L272 TraceCheckUtils]: 40: Hoare triple {19604#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~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)); {19514#true} is VALID [2022-04-14 15:00:08,772 INFO L290 TraceCheckUtils]: 41: Hoare triple {19514#true} ~cond := #in~cond; {19514#true} is VALID [2022-04-14 15:00:08,772 INFO L290 TraceCheckUtils]: 42: Hoare triple {19514#true} assume !(0 == ~cond); {19514#true} is VALID [2022-04-14 15:00:08,773 INFO L290 TraceCheckUtils]: 43: Hoare triple {19514#true} assume true; {19514#true} is VALID [2022-04-14 15:00:08,773 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {19514#true} {19604#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #88#return; {19604#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 15:00:08,773 INFO L272 TraceCheckUtils]: 45: Hoare triple {19604#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {19514#true} is VALID [2022-04-14 15:00:08,773 INFO L290 TraceCheckUtils]: 46: Hoare triple {19514#true} ~cond := #in~cond; {19514#true} is VALID [2022-04-14 15:00:08,773 INFO L290 TraceCheckUtils]: 47: Hoare triple {19514#true} assume !(0 == ~cond); {19514#true} is VALID [2022-04-14 15:00:08,774 INFO L290 TraceCheckUtils]: 48: Hoare triple {19514#true} assume true; {19514#true} is VALID [2022-04-14 15:00:08,774 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {19514#true} {19604#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #90#return; {19604#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 15:00:08,775 INFO L290 TraceCheckUtils]: 50: Hoare triple {19604#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} assume !(~c~0 >= ~b~0); {19671#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (not (<= main_~b~0 main_~c~0)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 15:00:08,775 INFO L290 TraceCheckUtils]: 51: Hoare triple {19671#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (not (<= main_~b~0 main_~c~0)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {19675#(and (= main_~s~0 0) (<= main_~r~0 1) (= main_~p~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-14 15:00:08,776 INFO L290 TraceCheckUtils]: 52: Hoare triple {19675#(and (= main_~s~0 0) (<= main_~r~0 1) (= main_~p~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} assume !false; {19675#(and (= main_~s~0 0) (<= main_~r~0 1) (= main_~p~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-14 15:00:08,776 INFO L290 TraceCheckUtils]: 53: Hoare triple {19675#(and (= main_~s~0 0) (<= main_~r~0 1) (= main_~p~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {19682#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (<= main_~r~0 1) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-14 15:00:08,777 INFO L290 TraceCheckUtils]: 54: Hoare triple {19682#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (<= main_~r~0 1) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} assume !false; {19682#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (<= main_~r~0 1) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-14 15:00:08,777 INFO L272 TraceCheckUtils]: 55: Hoare triple {19682#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (<= main_~r~0 1) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {19514#true} is VALID [2022-04-14 15:00:08,777 INFO L290 TraceCheckUtils]: 56: Hoare triple {19514#true} ~cond := #in~cond; {19514#true} is VALID [2022-04-14 15:00:08,777 INFO L290 TraceCheckUtils]: 57: Hoare triple {19514#true} assume !(0 == ~cond); {19514#true} is VALID [2022-04-14 15:00:08,777 INFO L290 TraceCheckUtils]: 58: Hoare triple {19514#true} assume true; {19514#true} is VALID [2022-04-14 15:00:08,778 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {19514#true} {19682#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (<= main_~r~0 1) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #84#return; {19682#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (<= main_~r~0 1) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-14 15:00:08,778 INFO L272 TraceCheckUtils]: 60: Hoare triple {19682#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (<= main_~r~0 1) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {19514#true} is VALID [2022-04-14 15:00:08,778 INFO L290 TraceCheckUtils]: 61: Hoare triple {19514#true} ~cond := #in~cond; {19514#true} is VALID [2022-04-14 15:00:08,778 INFO L290 TraceCheckUtils]: 62: Hoare triple {19514#true} assume !(0 == ~cond); {19514#true} is VALID [2022-04-14 15:00:08,778 INFO L290 TraceCheckUtils]: 63: Hoare triple {19514#true} assume true; {19514#true} is VALID [2022-04-14 15:00:08,780 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {19514#true} {19682#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (<= main_~r~0 1) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #86#return; {19682#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (<= main_~r~0 1) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-14 15:00:08,780 INFO L272 TraceCheckUtils]: 65: Hoare triple {19682#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (<= main_~r~0 1) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {19514#true} is VALID [2022-04-14 15:00:08,780 INFO L290 TraceCheckUtils]: 66: Hoare triple {19514#true} ~cond := #in~cond; {19514#true} is VALID [2022-04-14 15:00:08,780 INFO L290 TraceCheckUtils]: 67: Hoare triple {19514#true} assume !(0 == ~cond); {19514#true} is VALID [2022-04-14 15:00:08,780 INFO L290 TraceCheckUtils]: 68: Hoare triple {19514#true} assume true; {19514#true} is VALID [2022-04-14 15:00:08,781 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {19514#true} {19682#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (<= main_~r~0 1) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #88#return; {19682#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (<= main_~r~0 1) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-14 15:00:08,781 INFO L272 TraceCheckUtils]: 70: Hoare triple {19682#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (<= main_~r~0 1) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {19514#true} is VALID [2022-04-14 15:00:08,782 INFO L290 TraceCheckUtils]: 71: Hoare triple {19514#true} ~cond := #in~cond; {19514#true} is VALID [2022-04-14 15:00:08,782 INFO L290 TraceCheckUtils]: 72: Hoare triple {19514#true} assume !(0 == ~cond); {19514#true} is VALID [2022-04-14 15:00:08,782 INFO L290 TraceCheckUtils]: 73: Hoare triple {19514#true} assume true; {19514#true} is VALID [2022-04-14 15:00:08,783 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {19514#true} {19682#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (<= main_~r~0 1) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #90#return; {19682#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (<= main_~r~0 1) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-14 15:00:08,785 INFO L290 TraceCheckUtils]: 75: Hoare triple {19682#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (<= main_~r~0 1) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {19749#(and (= main_~s~0 0) (<= main_~r~0 1) (= main_~p~0 0) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (not (<= main_~a~0 main_~x~0)) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~k~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-14 15:00:08,786 INFO L290 TraceCheckUtils]: 76: Hoare triple {19749#(and (= main_~s~0 0) (<= main_~r~0 1) (= main_~p~0 0) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (not (<= main_~a~0 main_~x~0)) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~k~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} assume !false; {19749#(and (= main_~s~0 0) (<= main_~r~0 1) (= main_~p~0 0) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (not (<= main_~a~0 main_~x~0)) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~k~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-14 15:00:08,786 INFO L272 TraceCheckUtils]: 77: Hoare triple {19749#(and (= main_~s~0 0) (<= main_~r~0 1) (= main_~p~0 0) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (not (<= main_~a~0 main_~x~0)) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~k~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {19514#true} is VALID [2022-04-14 15:00:08,786 INFO L290 TraceCheckUtils]: 78: Hoare triple {19514#true} ~cond := #in~cond; {19759#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-14 15:00:08,787 INFO L290 TraceCheckUtils]: 79: Hoare triple {19759#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {19763#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 15:00:08,787 INFO L290 TraceCheckUtils]: 80: Hoare triple {19763#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {19763#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 15:00:08,790 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {19763#(not (= |__VERIFIER_assert_#in~cond| 0))} {19749#(and (= main_~s~0 0) (<= main_~r~0 1) (= main_~p~0 0) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (not (<= main_~a~0 main_~x~0)) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~k~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #84#return; {19770#(and (= main_~s~0 0) (= main_~y~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (<= main_~r~0 1) (= main_~p~0 0) (< main_~x~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~b~0 main_~x~0) (= main_~k~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-14 15:00:08,790 INFO L272 TraceCheckUtils]: 82: Hoare triple {19770#(and (= main_~s~0 0) (= main_~y~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (<= main_~r~0 1) (= main_~p~0 0) (< main_~x~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~b~0 main_~x~0) (= main_~k~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {19514#true} is VALID [2022-04-14 15:00:08,790 INFO L290 TraceCheckUtils]: 83: Hoare triple {19514#true} ~cond := #in~cond; {19514#true} is VALID [2022-04-14 15:00:08,790 INFO L290 TraceCheckUtils]: 84: Hoare triple {19514#true} assume !(0 == ~cond); {19514#true} is VALID [2022-04-14 15:00:08,790 INFO L290 TraceCheckUtils]: 85: Hoare triple {19514#true} assume true; {19514#true} is VALID [2022-04-14 15:00:08,791 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {19514#true} {19770#(and (= main_~s~0 0) (= main_~y~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (<= main_~r~0 1) (= main_~p~0 0) (< main_~x~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~b~0 main_~x~0) (= main_~k~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #86#return; {19770#(and (= main_~s~0 0) (= main_~y~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (<= main_~r~0 1) (= main_~p~0 0) (< main_~x~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~b~0 main_~x~0) (= main_~k~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-14 15:00:08,791 INFO L272 TraceCheckUtils]: 87: Hoare triple {19770#(and (= main_~s~0 0) (= main_~y~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (<= main_~r~0 1) (= main_~p~0 0) (< main_~x~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~b~0 main_~x~0) (= main_~k~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {19514#true} is VALID [2022-04-14 15:00:08,791 INFO L290 TraceCheckUtils]: 88: Hoare triple {19514#true} ~cond := #in~cond; {19759#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-14 15:00:08,792 INFO L290 TraceCheckUtils]: 89: Hoare triple {19759#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {19763#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 15:00:08,792 INFO L290 TraceCheckUtils]: 90: Hoare triple {19763#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {19763#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 15:00:08,793 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {19763#(not (= |__VERIFIER_assert_#in~cond| 0))} {19770#(and (= main_~s~0 0) (= main_~y~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (<= main_~r~0 1) (= main_~p~0 0) (< main_~x~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~b~0 main_~x~0) (= main_~k~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #88#return; {19770#(and (= main_~s~0 0) (= main_~y~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (<= main_~r~0 1) (= main_~p~0 0) (< main_~x~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~b~0 main_~x~0) (= main_~k~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-14 15:00:08,793 INFO L272 TraceCheckUtils]: 92: Hoare triple {19770#(and (= main_~s~0 0) (= main_~y~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (<= main_~r~0 1) (= main_~p~0 0) (< main_~x~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~b~0 main_~x~0) (= main_~k~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {19514#true} is VALID [2022-04-14 15:00:08,793 INFO L290 TraceCheckUtils]: 93: Hoare triple {19514#true} ~cond := #in~cond; {19759#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-14 15:00:08,793 INFO L290 TraceCheckUtils]: 94: Hoare triple {19759#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {19763#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 15:00:08,793 INFO L290 TraceCheckUtils]: 95: Hoare triple {19763#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {19763#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 15:00:08,794 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {19763#(not (= |__VERIFIER_assert_#in~cond| 0))} {19770#(and (= main_~s~0 0) (= main_~y~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (<= main_~r~0 1) (= main_~p~0 0) (< main_~x~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~b~0 main_~x~0) (= main_~k~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #90#return; {19770#(and (= main_~s~0 0) (= main_~y~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (<= main_~r~0 1) (= main_~p~0 0) (< main_~x~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~b~0 main_~x~0) (= main_~k~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-14 15:00:08,795 INFO L290 TraceCheckUtils]: 97: Hoare triple {19770#(and (= main_~s~0 0) (= main_~y~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (<= main_~r~0 1) (= main_~p~0 0) (< main_~x~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~b~0 main_~x~0) (= main_~k~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} assume !(~c~0 >= ~b~0); {19819#(and (= main_~s~0 0) (= main_~y~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (<= main_~r~0 1) (= main_~p~0 0) (< main_~x~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~b~0 main_~x~0) (= main_~k~0 1) (not (<= main_~b~0 main_~c~0)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-14 15:00:08,797 INFO L290 TraceCheckUtils]: 98: Hoare triple {19819#(and (= main_~s~0 0) (= main_~y~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (<= main_~r~0 1) (= main_~p~0 0) (< main_~x~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~b~0 main_~x~0) (= main_~k~0 1) (not (<= main_~b~0 main_~c~0)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {19823#(and (= main_~r~0 0) (< main_~x~0 main_~y~0) (not (<= main_~a~0 (+ main_~y~0 (* main_~a~0 main_~q~0)))) (= main_~b~0 (+ main_~y~0 (* main_~a~0 main_~q~0))) (<= main_~s~0 (+ (* main_~q~0 main_~r~0) 1)) (= (* (- 1) main_~q~0) 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 15:00:08,798 INFO L290 TraceCheckUtils]: 99: Hoare triple {19823#(and (= main_~r~0 0) (< main_~x~0 main_~y~0) (not (<= main_~a~0 (+ main_~y~0 (* main_~a~0 main_~q~0)))) (= main_~b~0 (+ main_~y~0 (* main_~a~0 main_~q~0))) (<= main_~s~0 (+ (* main_~q~0 main_~r~0) 1)) (= (* (- 1) main_~q~0) 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !false; {19823#(and (= main_~r~0 0) (< main_~x~0 main_~y~0) (not (<= main_~a~0 (+ main_~y~0 (* main_~a~0 main_~q~0)))) (= main_~b~0 (+ main_~y~0 (* main_~a~0 main_~q~0))) (<= main_~s~0 (+ (* main_~q~0 main_~r~0) 1)) (= (* (- 1) main_~q~0) 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 15:00:08,799 INFO L290 TraceCheckUtils]: 100: Hoare triple {19823#(and (= main_~r~0 0) (< main_~x~0 main_~y~0) (not (<= main_~a~0 (+ main_~y~0 (* main_~a~0 main_~q~0)))) (= main_~b~0 (+ main_~y~0 (* main_~a~0 main_~q~0))) (<= main_~s~0 (+ (* main_~q~0 main_~r~0) 1)) (= (* (- 1) main_~q~0) 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {19830#(and (= main_~r~0 0) (= (+ main_~y~0 (* main_~c~0 main_~q~0)) main_~b~0) (= main_~k~0 0) (< main_~x~0 main_~y~0) (not (<= main_~c~0 (+ main_~y~0 (* main_~c~0 main_~q~0)))) (<= main_~s~0 (+ (* main_~q~0 main_~r~0) 1)) (= (* (- 1) main_~q~0) 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 15:00:08,799 INFO L290 TraceCheckUtils]: 101: Hoare triple {19830#(and (= main_~r~0 0) (= (+ main_~y~0 (* main_~c~0 main_~q~0)) main_~b~0) (= main_~k~0 0) (< main_~x~0 main_~y~0) (not (<= main_~c~0 (+ main_~y~0 (* main_~c~0 main_~q~0)))) (<= main_~s~0 (+ (* main_~q~0 main_~r~0) 1)) (= (* (- 1) main_~q~0) 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} assume !false; {19830#(and (= main_~r~0 0) (= (+ main_~y~0 (* main_~c~0 main_~q~0)) main_~b~0) (= main_~k~0 0) (< main_~x~0 main_~y~0) (not (<= main_~c~0 (+ main_~y~0 (* main_~c~0 main_~q~0)))) (<= main_~s~0 (+ (* main_~q~0 main_~r~0) 1)) (= (* (- 1) main_~q~0) 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 15:00:08,799 INFO L272 TraceCheckUtils]: 102: Hoare triple {19830#(and (= main_~r~0 0) (= (+ main_~y~0 (* main_~c~0 main_~q~0)) main_~b~0) (= main_~k~0 0) (< main_~x~0 main_~y~0) (not (<= main_~c~0 (+ main_~y~0 (* main_~c~0 main_~q~0)))) (<= main_~s~0 (+ (* main_~q~0 main_~r~0) 1)) (= (* (- 1) main_~q~0) 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {19514#true} is VALID [2022-04-14 15:00:08,799 INFO L290 TraceCheckUtils]: 103: Hoare triple {19514#true} ~cond := #in~cond; {19514#true} is VALID [2022-04-14 15:00:08,800 INFO L290 TraceCheckUtils]: 104: Hoare triple {19514#true} assume !(0 == ~cond); {19514#true} is VALID [2022-04-14 15:00:08,800 INFO L290 TraceCheckUtils]: 105: Hoare triple {19514#true} assume true; {19514#true} is VALID [2022-04-14 15:00:08,800 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {19514#true} {19830#(and (= main_~r~0 0) (= (+ main_~y~0 (* main_~c~0 main_~q~0)) main_~b~0) (= main_~k~0 0) (< main_~x~0 main_~y~0) (not (<= main_~c~0 (+ main_~y~0 (* main_~c~0 main_~q~0)))) (<= main_~s~0 (+ (* main_~q~0 main_~r~0) 1)) (= (* (- 1) main_~q~0) 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #84#return; {19830#(and (= main_~r~0 0) (= (+ main_~y~0 (* main_~c~0 main_~q~0)) main_~b~0) (= main_~k~0 0) (< main_~x~0 main_~y~0) (not (<= main_~c~0 (+ main_~y~0 (* main_~c~0 main_~q~0)))) (<= main_~s~0 (+ (* main_~q~0 main_~r~0) 1)) (= (* (- 1) main_~q~0) 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 15:00:08,800 INFO L272 TraceCheckUtils]: 107: Hoare triple {19830#(and (= main_~r~0 0) (= (+ main_~y~0 (* main_~c~0 main_~q~0)) main_~b~0) (= main_~k~0 0) (< main_~x~0 main_~y~0) (not (<= main_~c~0 (+ main_~y~0 (* main_~c~0 main_~q~0)))) (<= main_~s~0 (+ (* main_~q~0 main_~r~0) 1)) (= (* (- 1) main_~q~0) 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~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)); {19514#true} is VALID [2022-04-14 15:00:08,801 INFO L290 TraceCheckUtils]: 108: Hoare triple {19514#true} ~cond := #in~cond; {19514#true} is VALID [2022-04-14 15:00:08,802 INFO L290 TraceCheckUtils]: 109: Hoare triple {19514#true} assume !(0 == ~cond); {19514#true} is VALID [2022-04-14 15:00:08,803 INFO L290 TraceCheckUtils]: 110: Hoare triple {19514#true} assume true; {19514#true} is VALID [2022-04-14 15:00:08,803 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {19514#true} {19830#(and (= main_~r~0 0) (= (+ main_~y~0 (* main_~c~0 main_~q~0)) main_~b~0) (= main_~k~0 0) (< main_~x~0 main_~y~0) (not (<= main_~c~0 (+ main_~y~0 (* main_~c~0 main_~q~0)))) (<= main_~s~0 (+ (* main_~q~0 main_~r~0) 1)) (= (* (- 1) main_~q~0) 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #86#return; {19830#(and (= main_~r~0 0) (= (+ main_~y~0 (* main_~c~0 main_~q~0)) main_~b~0) (= main_~k~0 0) (< main_~x~0 main_~y~0) (not (<= main_~c~0 (+ main_~y~0 (* main_~c~0 main_~q~0)))) (<= main_~s~0 (+ (* main_~q~0 main_~r~0) 1)) (= (* (- 1) main_~q~0) 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 15:00:08,803 INFO L272 TraceCheckUtils]: 112: Hoare triple {19830#(and (= main_~r~0 0) (= (+ main_~y~0 (* main_~c~0 main_~q~0)) main_~b~0) (= main_~k~0 0) (< main_~x~0 main_~y~0) (not (<= main_~c~0 (+ main_~y~0 (* main_~c~0 main_~q~0)))) (<= main_~s~0 (+ (* main_~q~0 main_~r~0) 1)) (= (* (- 1) main_~q~0) 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~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)); {19514#true} is VALID [2022-04-14 15:00:08,803 INFO L290 TraceCheckUtils]: 113: Hoare triple {19514#true} ~cond := #in~cond; {19514#true} is VALID [2022-04-14 15:00:08,804 INFO L290 TraceCheckUtils]: 114: Hoare triple {19514#true} assume !(0 == ~cond); {19514#true} is VALID [2022-04-14 15:00:08,804 INFO L290 TraceCheckUtils]: 115: Hoare triple {19514#true} assume true; {19514#true} is VALID [2022-04-14 15:00:08,804 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {19514#true} {19830#(and (= main_~r~0 0) (= (+ main_~y~0 (* main_~c~0 main_~q~0)) main_~b~0) (= main_~k~0 0) (< main_~x~0 main_~y~0) (not (<= main_~c~0 (+ main_~y~0 (* main_~c~0 main_~q~0)))) (<= main_~s~0 (+ (* main_~q~0 main_~r~0) 1)) (= (* (- 1) main_~q~0) 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #88#return; {19830#(and (= main_~r~0 0) (= (+ main_~y~0 (* main_~c~0 main_~q~0)) main_~b~0) (= main_~k~0 0) (< main_~x~0 main_~y~0) (not (<= main_~c~0 (+ main_~y~0 (* main_~c~0 main_~q~0)))) (<= main_~s~0 (+ (* main_~q~0 main_~r~0) 1)) (= (* (- 1) main_~q~0) 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 15:00:08,804 INFO L272 TraceCheckUtils]: 117: Hoare triple {19830#(and (= main_~r~0 0) (= (+ main_~y~0 (* main_~c~0 main_~q~0)) main_~b~0) (= main_~k~0 0) (< main_~x~0 main_~y~0) (not (<= main_~c~0 (+ main_~y~0 (* main_~c~0 main_~q~0)))) (<= main_~s~0 (+ (* main_~q~0 main_~r~0) 1)) (= (* (- 1) main_~q~0) 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {19514#true} is VALID [2022-04-14 15:00:08,804 INFO L290 TraceCheckUtils]: 118: Hoare triple {19514#true} ~cond := #in~cond; {19514#true} is VALID [2022-04-14 15:00:08,805 INFO L290 TraceCheckUtils]: 119: Hoare triple {19514#true} assume !(0 == ~cond); {19514#true} is VALID [2022-04-14 15:00:08,805 INFO L290 TraceCheckUtils]: 120: Hoare triple {19514#true} assume true; {19514#true} is VALID [2022-04-14 15:00:08,805 INFO L284 TraceCheckUtils]: 121: Hoare quadruple {19514#true} {19830#(and (= main_~r~0 0) (= (+ main_~y~0 (* main_~c~0 main_~q~0)) main_~b~0) (= main_~k~0 0) (< main_~x~0 main_~y~0) (not (<= main_~c~0 (+ main_~y~0 (* main_~c~0 main_~q~0)))) (<= main_~s~0 (+ (* main_~q~0 main_~r~0) 1)) (= (* (- 1) main_~q~0) 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #90#return; {19830#(and (= main_~r~0 0) (= (+ main_~y~0 (* main_~c~0 main_~q~0)) main_~b~0) (= main_~k~0 0) (< main_~x~0 main_~y~0) (not (<= main_~c~0 (+ main_~y~0 (* main_~c~0 main_~q~0)))) (<= main_~s~0 (+ (* main_~q~0 main_~r~0) 1)) (= (* (- 1) main_~q~0) 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 15:00:08,806 INFO L290 TraceCheckUtils]: 122: Hoare triple {19830#(and (= main_~r~0 0) (= (+ main_~y~0 (* main_~c~0 main_~q~0)) main_~b~0) (= main_~k~0 0) (< main_~x~0 main_~y~0) (not (<= main_~c~0 (+ main_~y~0 (* main_~c~0 main_~q~0)))) (<= main_~s~0 (+ (* main_~q~0 main_~r~0) 1)) (= (* (- 1) main_~q~0) 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {19897#(and (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) main_~y~0)) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~c~0) (< main_~x~0 main_~y~0) (not (<= main_~x~0 (+ (* main_~q~0 main_~x~0) main_~y~0))) (= main_~k~0 1) (<= main_~s~0 (+ (* main_~q~0 main_~r~0) 1)) (= (* (- 1) main_~q~0) 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~p~0 1))} is VALID [2022-04-14 15:00:08,807 INFO L290 TraceCheckUtils]: 123: Hoare triple {19897#(and (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) main_~y~0)) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~c~0) (< main_~x~0 main_~y~0) (not (<= main_~x~0 (+ (* main_~q~0 main_~x~0) main_~y~0))) (= main_~k~0 1) (<= main_~s~0 (+ (* main_~q~0 main_~r~0) 1)) (= (* (- 1) main_~q~0) 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~p~0 1))} assume !false; {19897#(and (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) main_~y~0)) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~c~0) (< main_~x~0 main_~y~0) (not (<= main_~x~0 (+ (* main_~q~0 main_~x~0) main_~y~0))) (= main_~k~0 1) (<= main_~s~0 (+ (* main_~q~0 main_~r~0) 1)) (= (* (- 1) main_~q~0) 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~p~0 1))} is VALID [2022-04-14 15:00:08,807 INFO L272 TraceCheckUtils]: 124: Hoare triple {19897#(and (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) main_~y~0)) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~c~0) (< main_~x~0 main_~y~0) (not (<= main_~x~0 (+ (* main_~q~0 main_~x~0) main_~y~0))) (= main_~k~0 1) (<= main_~s~0 (+ (* main_~q~0 main_~r~0) 1)) (= (* (- 1) main_~q~0) 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {19514#true} is VALID [2022-04-14 15:00:08,807 INFO L290 TraceCheckUtils]: 125: Hoare triple {19514#true} ~cond := #in~cond; {19514#true} is VALID [2022-04-14 15:00:08,807 INFO L290 TraceCheckUtils]: 126: Hoare triple {19514#true} assume !(0 == ~cond); {19514#true} is VALID [2022-04-14 15:00:08,807 INFO L290 TraceCheckUtils]: 127: Hoare triple {19514#true} assume true; {19514#true} is VALID [2022-04-14 15:00:08,808 INFO L284 TraceCheckUtils]: 128: Hoare quadruple {19514#true} {19897#(and (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) main_~y~0)) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~c~0) (< main_~x~0 main_~y~0) (not (<= main_~x~0 (+ (* main_~q~0 main_~x~0) main_~y~0))) (= main_~k~0 1) (<= main_~s~0 (+ (* main_~q~0 main_~r~0) 1)) (= (* (- 1) main_~q~0) 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~p~0 1))} #84#return; {19897#(and (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) main_~y~0)) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~c~0) (< main_~x~0 main_~y~0) (not (<= main_~x~0 (+ (* main_~q~0 main_~x~0) main_~y~0))) (= main_~k~0 1) (<= main_~s~0 (+ (* main_~q~0 main_~r~0) 1)) (= (* (- 1) main_~q~0) 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~p~0 1))} is VALID [2022-04-14 15:00:08,808 INFO L272 TraceCheckUtils]: 129: Hoare triple {19897#(and (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) main_~y~0)) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~c~0) (< main_~x~0 main_~y~0) (not (<= main_~x~0 (+ (* main_~q~0 main_~x~0) main_~y~0))) (= main_~k~0 1) (<= main_~s~0 (+ (* main_~q~0 main_~r~0) 1)) (= (* (- 1) main_~q~0) 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~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)); {19514#true} is VALID [2022-04-14 15:00:08,808 INFO L290 TraceCheckUtils]: 130: Hoare triple {19514#true} ~cond := #in~cond; {19514#true} is VALID [2022-04-14 15:00:08,808 INFO L290 TraceCheckUtils]: 131: Hoare triple {19514#true} assume !(0 == ~cond); {19514#true} is VALID [2022-04-14 15:00:08,808 INFO L290 TraceCheckUtils]: 132: Hoare triple {19514#true} assume true; {19514#true} is VALID [2022-04-14 15:00:08,809 INFO L284 TraceCheckUtils]: 133: Hoare quadruple {19514#true} {19897#(and (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) main_~y~0)) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~c~0) (< main_~x~0 main_~y~0) (not (<= main_~x~0 (+ (* main_~q~0 main_~x~0) main_~y~0))) (= main_~k~0 1) (<= main_~s~0 (+ (* main_~q~0 main_~r~0) 1)) (= (* (- 1) main_~q~0) 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~p~0 1))} #86#return; {19897#(and (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) main_~y~0)) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~c~0) (< main_~x~0 main_~y~0) (not (<= main_~x~0 (+ (* main_~q~0 main_~x~0) main_~y~0))) (= main_~k~0 1) (<= main_~s~0 (+ (* main_~q~0 main_~r~0) 1)) (= (* (- 1) main_~q~0) 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~p~0 1))} is VALID [2022-04-14 15:00:08,809 INFO L272 TraceCheckUtils]: 134: Hoare triple {19897#(and (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) main_~y~0)) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~c~0) (< main_~x~0 main_~y~0) (not (<= main_~x~0 (+ (* main_~q~0 main_~x~0) main_~y~0))) (= main_~k~0 1) (<= main_~s~0 (+ (* main_~q~0 main_~r~0) 1)) (= (* (- 1) main_~q~0) 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~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)); {19514#true} is VALID [2022-04-14 15:00:08,809 INFO L290 TraceCheckUtils]: 135: Hoare triple {19514#true} ~cond := #in~cond; {19514#true} is VALID [2022-04-14 15:00:08,809 INFO L290 TraceCheckUtils]: 136: Hoare triple {19514#true} assume !(0 == ~cond); {19514#true} is VALID [2022-04-14 15:00:08,809 INFO L290 TraceCheckUtils]: 137: Hoare triple {19514#true} assume true; {19514#true} is VALID [2022-04-14 15:00:08,810 INFO L284 TraceCheckUtils]: 138: Hoare quadruple {19514#true} {19897#(and (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) main_~y~0)) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~c~0) (< main_~x~0 main_~y~0) (not (<= main_~x~0 (+ (* main_~q~0 main_~x~0) main_~y~0))) (= main_~k~0 1) (<= main_~s~0 (+ (* main_~q~0 main_~r~0) 1)) (= (* (- 1) main_~q~0) 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~p~0 1))} #88#return; {19897#(and (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) main_~y~0)) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~c~0) (< main_~x~0 main_~y~0) (not (<= main_~x~0 (+ (* main_~q~0 main_~x~0) main_~y~0))) (= main_~k~0 1) (<= main_~s~0 (+ (* main_~q~0 main_~r~0) 1)) (= (* (- 1) main_~q~0) 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~p~0 1))} is VALID [2022-04-14 15:00:08,810 INFO L272 TraceCheckUtils]: 139: Hoare triple {19897#(and (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) main_~y~0)) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~c~0) (< main_~x~0 main_~y~0) (not (<= main_~x~0 (+ (* main_~q~0 main_~x~0) main_~y~0))) (= main_~k~0 1) (<= main_~s~0 (+ (* main_~q~0 main_~r~0) 1)) (= (* (- 1) main_~q~0) 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {19514#true} is VALID [2022-04-14 15:00:08,810 INFO L290 TraceCheckUtils]: 140: Hoare triple {19514#true} ~cond := #in~cond; {19514#true} is VALID [2022-04-14 15:00:08,810 INFO L290 TraceCheckUtils]: 141: Hoare triple {19514#true} assume !(0 == ~cond); {19514#true} is VALID [2022-04-14 15:00:08,810 INFO L290 TraceCheckUtils]: 142: Hoare triple {19514#true} assume true; {19514#true} is VALID [2022-04-14 15:00:08,810 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {19514#true} {19897#(and (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) main_~y~0)) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~c~0) (< main_~x~0 main_~y~0) (not (<= main_~x~0 (+ (* main_~q~0 main_~x~0) main_~y~0))) (= main_~k~0 1) (<= main_~s~0 (+ (* main_~q~0 main_~r~0) 1)) (= (* (- 1) main_~q~0) 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~p~0 1))} #90#return; {19897#(and (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) main_~y~0)) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~c~0) (< main_~x~0 main_~y~0) (not (<= main_~x~0 (+ (* main_~q~0 main_~x~0) main_~y~0))) (= main_~k~0 1) (<= main_~s~0 (+ (* main_~q~0 main_~r~0) 1)) (= (* (- 1) main_~q~0) 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~p~0 1))} is VALID [2022-04-14 15:00:08,812 INFO L290 TraceCheckUtils]: 144: Hoare triple {19897#(and (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) main_~y~0)) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~c~0) (< main_~x~0 main_~y~0) (not (<= main_~x~0 (+ (* main_~q~0 main_~x~0) main_~y~0))) (= main_~k~0 1) (<= main_~s~0 (+ (* main_~q~0 main_~r~0) 1)) (= (* (- 1) main_~q~0) 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~p~0 1))} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {19964#(and (= (+ main_~c~0 (* main_~b~0 2)) main_~x~0) (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) main_~y~0)) (< main_~x~0 main_~y~0) (<= 0 main_~c~0) (= (+ main_~q~0 1) 0) (<= main_~s~0 (+ (* main_~q~0 main_~r~0) 1)) (= main_~k~0 2) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~p~0 1))} is VALID [2022-04-14 15:00:08,813 INFO L290 TraceCheckUtils]: 145: Hoare triple {19964#(and (= (+ main_~c~0 (* main_~b~0 2)) main_~x~0) (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) main_~y~0)) (< main_~x~0 main_~y~0) (<= 0 main_~c~0) (= (+ main_~q~0 1) 0) (<= main_~s~0 (+ (* main_~q~0 main_~r~0) 1)) (= main_~k~0 2) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~p~0 1))} assume !false; {19964#(and (= (+ main_~c~0 (* main_~b~0 2)) main_~x~0) (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) main_~y~0)) (< main_~x~0 main_~y~0) (<= 0 main_~c~0) (= (+ main_~q~0 1) 0) (<= main_~s~0 (+ (* main_~q~0 main_~r~0) 1)) (= main_~k~0 2) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~p~0 1))} is VALID [2022-04-14 15:00:08,813 INFO L272 TraceCheckUtils]: 146: Hoare triple {19964#(and (= (+ main_~c~0 (* main_~b~0 2)) main_~x~0) (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) main_~y~0)) (< main_~x~0 main_~y~0) (<= 0 main_~c~0) (= (+ main_~q~0 1) 0) (<= main_~s~0 (+ (* main_~q~0 main_~r~0) 1)) (= main_~k~0 2) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {19514#true} is VALID [2022-04-14 15:00:08,813 INFO L290 TraceCheckUtils]: 147: Hoare triple {19514#true} ~cond := #in~cond; {19514#true} is VALID [2022-04-14 15:00:08,813 INFO L290 TraceCheckUtils]: 148: Hoare triple {19514#true} assume !(0 == ~cond); {19514#true} is VALID [2022-04-14 15:00:08,813 INFO L290 TraceCheckUtils]: 149: Hoare triple {19514#true} assume true; {19514#true} is VALID [2022-04-14 15:00:08,814 INFO L284 TraceCheckUtils]: 150: Hoare quadruple {19514#true} {19964#(and (= (+ main_~c~0 (* main_~b~0 2)) main_~x~0) (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) main_~y~0)) (< main_~x~0 main_~y~0) (<= 0 main_~c~0) (= (+ main_~q~0 1) 0) (<= main_~s~0 (+ (* main_~q~0 main_~r~0) 1)) (= main_~k~0 2) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~p~0 1))} #84#return; {19964#(and (= (+ main_~c~0 (* main_~b~0 2)) main_~x~0) (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) main_~y~0)) (< main_~x~0 main_~y~0) (<= 0 main_~c~0) (= (+ main_~q~0 1) 0) (<= main_~s~0 (+ (* main_~q~0 main_~r~0) 1)) (= main_~k~0 2) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~p~0 1))} is VALID [2022-04-14 15:00:08,814 INFO L272 TraceCheckUtils]: 151: Hoare triple {19964#(and (= (+ main_~c~0 (* main_~b~0 2)) main_~x~0) (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) main_~y~0)) (< main_~x~0 main_~y~0) (<= 0 main_~c~0) (= (+ main_~q~0 1) 0) (<= main_~s~0 (+ (* main_~q~0 main_~r~0) 1)) (= main_~k~0 2) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~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)); {19514#true} is VALID [2022-04-14 15:00:08,814 INFO L290 TraceCheckUtils]: 152: Hoare triple {19514#true} ~cond := #in~cond; {19514#true} is VALID [2022-04-14 15:00:08,814 INFO L290 TraceCheckUtils]: 153: Hoare triple {19514#true} assume !(0 == ~cond); {19514#true} is VALID [2022-04-14 15:00:08,814 INFO L290 TraceCheckUtils]: 154: Hoare triple {19514#true} assume true; {19514#true} is VALID [2022-04-14 15:00:08,815 INFO L284 TraceCheckUtils]: 155: Hoare quadruple {19514#true} {19964#(and (= (+ main_~c~0 (* main_~b~0 2)) main_~x~0) (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) main_~y~0)) (< main_~x~0 main_~y~0) (<= 0 main_~c~0) (= (+ main_~q~0 1) 0) (<= main_~s~0 (+ (* main_~q~0 main_~r~0) 1)) (= main_~k~0 2) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~p~0 1))} #86#return; {19964#(and (= (+ main_~c~0 (* main_~b~0 2)) main_~x~0) (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) main_~y~0)) (< main_~x~0 main_~y~0) (<= 0 main_~c~0) (= (+ main_~q~0 1) 0) (<= main_~s~0 (+ (* main_~q~0 main_~r~0) 1)) (= main_~k~0 2) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~p~0 1))} is VALID [2022-04-14 15:00:08,815 INFO L272 TraceCheckUtils]: 156: Hoare triple {19964#(and (= (+ main_~c~0 (* main_~b~0 2)) main_~x~0) (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) main_~y~0)) (< main_~x~0 main_~y~0) (<= 0 main_~c~0) (= (+ main_~q~0 1) 0) (<= main_~s~0 (+ (* main_~q~0 main_~r~0) 1)) (= main_~k~0 2) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~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)); {19514#true} is VALID [2022-04-14 15:00:08,815 INFO L290 TraceCheckUtils]: 157: Hoare triple {19514#true} ~cond := #in~cond; {19759#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-14 15:00:08,816 INFO L290 TraceCheckUtils]: 158: Hoare triple {19759#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {19763#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 15:00:08,816 INFO L290 TraceCheckUtils]: 159: Hoare triple {19763#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {19763#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 15:00:08,817 INFO L284 TraceCheckUtils]: 160: Hoare quadruple {19763#(not (= |__VERIFIER_assert_#in~cond| 0))} {19964#(and (= (+ main_~c~0 (* main_~b~0 2)) main_~x~0) (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) main_~y~0)) (< main_~x~0 main_~y~0) (<= 0 main_~c~0) (= (+ main_~q~0 1) 0) (<= main_~s~0 (+ (* main_~q~0 main_~r~0) 1)) (= main_~k~0 2) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~p~0 1))} #88#return; {20013#(and (= (+ main_~c~0 (* main_~b~0 2)) main_~x~0) (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~b~0 (+ (* main_~q~0 main_~x~0) main_~y~0)) (< main_~x~0 main_~y~0) (<= 0 main_~c~0) (= (+ main_~q~0 1) 0) (= main_~k~0 2) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~p~0 1))} is VALID [2022-04-14 15:00:08,817 INFO L272 TraceCheckUtils]: 161: Hoare triple {20013#(and (= (+ main_~c~0 (* main_~b~0 2)) main_~x~0) (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~b~0 (+ (* main_~q~0 main_~x~0) main_~y~0)) (< main_~x~0 main_~y~0) (<= 0 main_~c~0) (= (+ main_~q~0 1) 0) (= main_~k~0 2) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {19514#true} is VALID [2022-04-14 15:00:08,817 INFO L290 TraceCheckUtils]: 162: Hoare triple {19514#true} ~cond := #in~cond; {19759#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-14 15:00:08,818 INFO L290 TraceCheckUtils]: 163: Hoare triple {19759#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {19763#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 15:00:08,818 INFO L290 TraceCheckUtils]: 164: Hoare triple {19763#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {19763#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 15:00:08,819 INFO L284 TraceCheckUtils]: 165: Hoare quadruple {19763#(not (= |__VERIFIER_assert_#in~cond| 0))} {20013#(and (= (+ main_~c~0 (* main_~b~0 2)) main_~x~0) (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~b~0 (+ (* main_~q~0 main_~x~0) main_~y~0)) (< main_~x~0 main_~y~0) (<= 0 main_~c~0) (= (+ main_~q~0 1) 0) (= main_~k~0 2) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~p~0 1))} #90#return; {20013#(and (= (+ main_~c~0 (* main_~b~0 2)) main_~x~0) (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~b~0 (+ (* main_~q~0 main_~x~0) main_~y~0)) (< main_~x~0 main_~y~0) (<= 0 main_~c~0) (= (+ main_~q~0 1) 0) (= main_~k~0 2) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~p~0 1))} is VALID [2022-04-14 15:00:08,821 INFO L290 TraceCheckUtils]: 166: Hoare triple {20013#(and (= (+ main_~c~0 (* main_~b~0 2)) main_~x~0) (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~b~0 (+ (* main_~q~0 main_~x~0) main_~y~0)) (< main_~x~0 main_~y~0) (<= 0 main_~c~0) (= (+ main_~q~0 1) 0) (= main_~k~0 2) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~p~0 1))} assume !(~c~0 >= ~b~0); {20032#(and (< main_~c~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~r~0 0) (< main_~x~0 main_~y~0) (<= 0 main_~c~0) (= (+ main_~q~0 1) 0) (= main_~x~0 (+ (* 2 (* main_~y~0 main_~s~0)) (* (* main_~q~0 main_~x~0) 2) main_~c~0)) (= main_~k~0 2) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~p~0 1))} is VALID [2022-04-14 15:00:08,826 INFO L290 TraceCheckUtils]: 167: Hoare triple {20032#(and (< main_~c~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~r~0 0) (< main_~x~0 main_~y~0) (<= 0 main_~c~0) (= (+ main_~q~0 1) 0) (= main_~x~0 (+ (* 2 (* main_~y~0 main_~s~0)) (* (* main_~q~0 main_~x~0) 2) main_~c~0)) (= main_~k~0 2) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~p~0 1))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {20036#(and (not (= main_~y~0 0)) (< main_~x~0 main_~y~0) (= (mod (+ main_~b~0 main_~x~0) 2) 0) (< (+ main_~b~0 main_~x~0) (* main_~y~0 (div (div (+ (* main_~x~0 3) (* (- 1) main_~b~0)) 2) main_~y~0))) (= main_~s~0 (* (- 2) (div (div (+ (* main_~x~0 3) (* (- 1) main_~b~0)) 2) main_~y~0))) (= (+ (- 2) main_~q~0) 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (<= 0 main_~b~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= (mod (div (+ (* main_~x~0 3) (* (- 1) main_~b~0)) 2) main_~y~0) 0))} is VALID [2022-04-14 15:00:08,826 INFO L290 TraceCheckUtils]: 168: Hoare triple {20036#(and (not (= main_~y~0 0)) (< main_~x~0 main_~y~0) (= (mod (+ main_~b~0 main_~x~0) 2) 0) (< (+ main_~b~0 main_~x~0) (* main_~y~0 (div (div (+ (* main_~x~0 3) (* (- 1) main_~b~0)) 2) main_~y~0))) (= main_~s~0 (* (- 2) (div (div (+ (* main_~x~0 3) (* (- 1) main_~b~0)) 2) main_~y~0))) (= (+ (- 2) main_~q~0) 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (<= 0 main_~b~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= (mod (div (+ (* main_~x~0 3) (* (- 1) main_~b~0)) 2) main_~y~0) 0))} assume !false; {20036#(and (not (= main_~y~0 0)) (< main_~x~0 main_~y~0) (= (mod (+ main_~b~0 main_~x~0) 2) 0) (< (+ main_~b~0 main_~x~0) (* main_~y~0 (div (div (+ (* main_~x~0 3) (* (- 1) main_~b~0)) 2) main_~y~0))) (= main_~s~0 (* (- 2) (div (div (+ (* main_~x~0 3) (* (- 1) main_~b~0)) 2) main_~y~0))) (= (+ (- 2) main_~q~0) 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (<= 0 main_~b~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= (mod (div (+ (* main_~x~0 3) (* (- 1) main_~b~0)) 2) main_~y~0) 0))} is VALID [2022-04-14 15:00:08,827 INFO L290 TraceCheckUtils]: 169: Hoare triple {20036#(and (not (= main_~y~0 0)) (< main_~x~0 main_~y~0) (= (mod (+ main_~b~0 main_~x~0) 2) 0) (< (+ main_~b~0 main_~x~0) (* main_~y~0 (div (div (+ (* main_~x~0 3) (* (- 1) main_~b~0)) 2) main_~y~0))) (= main_~s~0 (* (- 2) (div (div (+ (* main_~x~0 3) (* (- 1) main_~b~0)) 2) main_~y~0))) (= (+ (- 2) main_~q~0) 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (<= 0 main_~b~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= (mod (div (+ (* main_~x~0 3) (* (- 1) main_~b~0)) 2) main_~y~0) 0))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {20043#(and (not (= main_~y~0 0)) (< main_~x~0 main_~y~0) (= (mod (+ main_~b~0 main_~x~0) 2) 0) (< (+ main_~b~0 main_~x~0) (* main_~y~0 (div (div (+ (* main_~x~0 3) (* (- 1) main_~b~0)) 2) main_~y~0))) (= main_~s~0 (* (- 2) (div (div (+ (* main_~x~0 3) (* (- 1) main_~b~0)) 2) main_~y~0))) (= (+ (- 2) main_~q~0) 1) (not (= main_~b~0 0)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (<= 0 main_~b~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= (mod (div (+ (* main_~x~0 3) (* (- 1) main_~b~0)) 2) main_~y~0) 0))} is VALID [2022-04-14 15:00:08,828 INFO L290 TraceCheckUtils]: 170: Hoare triple {20043#(and (not (= main_~y~0 0)) (< main_~x~0 main_~y~0) (= (mod (+ main_~b~0 main_~x~0) 2) 0) (< (+ main_~b~0 main_~x~0) (* main_~y~0 (div (div (+ (* main_~x~0 3) (* (- 1) main_~b~0)) 2) main_~y~0))) (= main_~s~0 (* (- 2) (div (div (+ (* main_~x~0 3) (* (- 1) main_~b~0)) 2) main_~y~0))) (= (+ (- 2) main_~q~0) 1) (not (= main_~b~0 0)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (<= 0 main_~b~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= (mod (div (+ (* main_~x~0 3) (* (- 1) main_~b~0)) 2) main_~y~0) 0))} assume !false; {20043#(and (not (= main_~y~0 0)) (< main_~x~0 main_~y~0) (= (mod (+ main_~b~0 main_~x~0) 2) 0) (< (+ main_~b~0 main_~x~0) (* main_~y~0 (div (div (+ (* main_~x~0 3) (* (- 1) main_~b~0)) 2) main_~y~0))) (= main_~s~0 (* (- 2) (div (div (+ (* main_~x~0 3) (* (- 1) main_~b~0)) 2) main_~y~0))) (= (+ (- 2) main_~q~0) 1) (not (= main_~b~0 0)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (<= 0 main_~b~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= (mod (div (+ (* main_~x~0 3) (* (- 1) main_~b~0)) 2) main_~y~0) 0))} is VALID [2022-04-14 15:00:08,828 INFO L272 TraceCheckUtils]: 171: Hoare triple {20043#(and (not (= main_~y~0 0)) (< main_~x~0 main_~y~0) (= (mod (+ main_~b~0 main_~x~0) 2) 0) (< (+ main_~b~0 main_~x~0) (* main_~y~0 (div (div (+ (* main_~x~0 3) (* (- 1) main_~b~0)) 2) main_~y~0))) (= main_~s~0 (* (- 2) (div (div (+ (* main_~x~0 3) (* (- 1) main_~b~0)) 2) main_~y~0))) (= (+ (- 2) main_~q~0) 1) (not (= main_~b~0 0)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (<= 0 main_~b~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= (mod (div (+ (* main_~x~0 3) (* (- 1) main_~b~0)) 2) main_~y~0) 0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {19514#true} is VALID [2022-04-14 15:00:08,828 INFO L290 TraceCheckUtils]: 172: Hoare triple {19514#true} ~cond := #in~cond; {19514#true} is VALID [2022-04-14 15:00:08,828 INFO L290 TraceCheckUtils]: 173: Hoare triple {19514#true} assume !(0 == ~cond); {19514#true} is VALID [2022-04-14 15:00:08,828 INFO L290 TraceCheckUtils]: 174: Hoare triple {19514#true} assume true; {19514#true} is VALID [2022-04-14 15:00:08,829 INFO L284 TraceCheckUtils]: 175: Hoare quadruple {19514#true} {20043#(and (not (= main_~y~0 0)) (< main_~x~0 main_~y~0) (= (mod (+ main_~b~0 main_~x~0) 2) 0) (< (+ main_~b~0 main_~x~0) (* main_~y~0 (div (div (+ (* main_~x~0 3) (* (- 1) main_~b~0)) 2) main_~y~0))) (= main_~s~0 (* (- 2) (div (div (+ (* main_~x~0 3) (* (- 1) main_~b~0)) 2) main_~y~0))) (= (+ (- 2) main_~q~0) 1) (not (= main_~b~0 0)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (<= 0 main_~b~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= (mod (div (+ (* main_~x~0 3) (* (- 1) main_~b~0)) 2) main_~y~0) 0))} #84#return; {20043#(and (not (= main_~y~0 0)) (< main_~x~0 main_~y~0) (= (mod (+ main_~b~0 main_~x~0) 2) 0) (< (+ main_~b~0 main_~x~0) (* main_~y~0 (div (div (+ (* main_~x~0 3) (* (- 1) main_~b~0)) 2) main_~y~0))) (= main_~s~0 (* (- 2) (div (div (+ (* main_~x~0 3) (* (- 1) main_~b~0)) 2) main_~y~0))) (= (+ (- 2) main_~q~0) 1) (not (= main_~b~0 0)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (<= 0 main_~b~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= (mod (div (+ (* main_~x~0 3) (* (- 1) main_~b~0)) 2) main_~y~0) 0))} is VALID [2022-04-14 15:00:08,829 INFO L272 TraceCheckUtils]: 176: Hoare triple {20043#(and (not (= main_~y~0 0)) (< main_~x~0 main_~y~0) (= (mod (+ main_~b~0 main_~x~0) 2) 0) (< (+ main_~b~0 main_~x~0) (* main_~y~0 (div (div (+ (* main_~x~0 3) (* (- 1) main_~b~0)) 2) main_~y~0))) (= main_~s~0 (* (- 2) (div (div (+ (* main_~x~0 3) (* (- 1) main_~b~0)) 2) main_~y~0))) (= (+ (- 2) main_~q~0) 1) (not (= main_~b~0 0)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (<= 0 main_~b~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= (mod (div (+ (* main_~x~0 3) (* (- 1) main_~b~0)) 2) main_~y~0) 0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {19514#true} is VALID [2022-04-14 15:00:08,829 INFO L290 TraceCheckUtils]: 177: Hoare triple {19514#true} ~cond := #in~cond; {19514#true} is VALID [2022-04-14 15:00:08,829 INFO L290 TraceCheckUtils]: 178: Hoare triple {19514#true} assume !(0 == ~cond); {19514#true} is VALID [2022-04-14 15:00:08,829 INFO L290 TraceCheckUtils]: 179: Hoare triple {19514#true} assume true; {19514#true} is VALID [2022-04-14 15:00:08,830 INFO L284 TraceCheckUtils]: 180: Hoare quadruple {19514#true} {20043#(and (not (= main_~y~0 0)) (< main_~x~0 main_~y~0) (= (mod (+ main_~b~0 main_~x~0) 2) 0) (< (+ main_~b~0 main_~x~0) (* main_~y~0 (div (div (+ (* main_~x~0 3) (* (- 1) main_~b~0)) 2) main_~y~0))) (= main_~s~0 (* (- 2) (div (div (+ (* main_~x~0 3) (* (- 1) main_~b~0)) 2) main_~y~0))) (= (+ (- 2) main_~q~0) 1) (not (= main_~b~0 0)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (<= 0 main_~b~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= (mod (div (+ (* main_~x~0 3) (* (- 1) main_~b~0)) 2) main_~y~0) 0))} #86#return; {20043#(and (not (= main_~y~0 0)) (< main_~x~0 main_~y~0) (= (mod (+ main_~b~0 main_~x~0) 2) 0) (< (+ main_~b~0 main_~x~0) (* main_~y~0 (div (div (+ (* main_~x~0 3) (* (- 1) main_~b~0)) 2) main_~y~0))) (= main_~s~0 (* (- 2) (div (div (+ (* main_~x~0 3) (* (- 1) main_~b~0)) 2) main_~y~0))) (= (+ (- 2) main_~q~0) 1) (not (= main_~b~0 0)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (<= 0 main_~b~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= (mod (div (+ (* main_~x~0 3) (* (- 1) main_~b~0)) 2) main_~y~0) 0))} is VALID [2022-04-14 15:00:08,830 INFO L272 TraceCheckUtils]: 181: Hoare triple {20043#(and (not (= main_~y~0 0)) (< main_~x~0 main_~y~0) (= (mod (+ main_~b~0 main_~x~0) 2) 0) (< (+ main_~b~0 main_~x~0) (* main_~y~0 (div (div (+ (* main_~x~0 3) (* (- 1) main_~b~0)) 2) main_~y~0))) (= main_~s~0 (* (- 2) (div (div (+ (* main_~x~0 3) (* (- 1) main_~b~0)) 2) main_~y~0))) (= (+ (- 2) main_~q~0) 1) (not (= main_~b~0 0)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (<= 0 main_~b~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= (mod (div (+ (* main_~x~0 3) (* (- 1) main_~b~0)) 2) main_~y~0) 0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {19514#true} is VALID [2022-04-14 15:00:08,830 INFO L290 TraceCheckUtils]: 182: Hoare triple {19514#true} ~cond := #in~cond; {19759#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-14 15:00:08,830 INFO L290 TraceCheckUtils]: 183: Hoare triple {19759#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {19763#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 15:00:08,831 INFO L290 TraceCheckUtils]: 184: Hoare triple {19763#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {19763#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 15:00:08,831 INFO L284 TraceCheckUtils]: 185: Hoare quadruple {19763#(not (= |__VERIFIER_assert_#in~cond| 0))} {20043#(and (not (= main_~y~0 0)) (< main_~x~0 main_~y~0) (= (mod (+ main_~b~0 main_~x~0) 2) 0) (< (+ main_~b~0 main_~x~0) (* main_~y~0 (div (div (+ (* main_~x~0 3) (* (- 1) main_~b~0)) 2) main_~y~0))) (= main_~s~0 (* (- 2) (div (div (+ (* main_~x~0 3) (* (- 1) main_~b~0)) 2) main_~y~0))) (= (+ (- 2) main_~q~0) 1) (not (= main_~b~0 0)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (<= 0 main_~b~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= (mod (div (+ (* main_~x~0 3) (* (- 1) main_~b~0)) 2) main_~y~0) 0))} #88#return; {20043#(and (not (= main_~y~0 0)) (< main_~x~0 main_~y~0) (= (mod (+ main_~b~0 main_~x~0) 2) 0) (< (+ main_~b~0 main_~x~0) (* main_~y~0 (div (div (+ (* main_~x~0 3) (* (- 1) main_~b~0)) 2) main_~y~0))) (= main_~s~0 (* (- 2) (div (div (+ (* main_~x~0 3) (* (- 1) main_~b~0)) 2) main_~y~0))) (= (+ (- 2) main_~q~0) 1) (not (= main_~b~0 0)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (<= 0 main_~b~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= (mod (div (+ (* main_~x~0 3) (* (- 1) main_~b~0)) 2) main_~y~0) 0))} is VALID [2022-04-14 15:00:09,233 INFO L272 TraceCheckUtils]: 186: Hoare triple {20043#(and (not (= main_~y~0 0)) (< main_~x~0 main_~y~0) (= (mod (+ main_~b~0 main_~x~0) 2) 0) (< (+ main_~b~0 main_~x~0) (* main_~y~0 (div (div (+ (* main_~x~0 3) (* (- 1) main_~b~0)) 2) main_~y~0))) (= main_~s~0 (* (- 2) (div (div (+ (* main_~x~0 3) (* (- 1) main_~b~0)) 2) main_~y~0))) (= (+ (- 2) main_~q~0) 1) (not (= main_~b~0 0)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (<= 0 main_~b~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= (mod (div (+ (* main_~x~0 3) (* (- 1) main_~b~0)) 2) main_~y~0) 0))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {20095#(exists ((v_main_~y~0_BEFORE_CALL_221 Int) (v_main_~b~0_BEFORE_CALL_194 Int) (aux_div_v_main_~x~0_BEFORE_CALL_218_67 Int)) (and (= (mod (div (+ (* (- 4) v_main_~b~0_BEFORE_CALL_194) (* 6 aux_div_v_main_~x~0_BEFORE_CALL_218_67)) 2) v_main_~y~0_BEFORE_CALL_221) 0) (not (= v_main_~y~0_BEFORE_CALL_221 0)) (not (= v_main_~b~0_BEFORE_CALL_194 0)) (< (* 2 aux_div_v_main_~x~0_BEFORE_CALL_218_67) (+ v_main_~y~0_BEFORE_CALL_221 v_main_~b~0_BEFORE_CALL_194)) (<= 1 |__VERIFIER_assert_#in~cond|) (< (* 2 aux_div_v_main_~x~0_BEFORE_CALL_218_67) (* v_main_~y~0_BEFORE_CALL_221 (div (+ (* 3 aux_div_v_main_~x~0_BEFORE_CALL_218_67) (* (- 2) v_main_~b~0_BEFORE_CALL_194)) v_main_~y~0_BEFORE_CALL_221))) (<= 0 v_main_~b~0_BEFORE_CALL_194)))} is VALID [2022-04-14 15:00:09,234 INFO L290 TraceCheckUtils]: 187: Hoare triple {20095#(exists ((v_main_~y~0_BEFORE_CALL_221 Int) (v_main_~b~0_BEFORE_CALL_194 Int) (aux_div_v_main_~x~0_BEFORE_CALL_218_67 Int)) (and (= (mod (div (+ (* (- 4) v_main_~b~0_BEFORE_CALL_194) (* 6 aux_div_v_main_~x~0_BEFORE_CALL_218_67)) 2) v_main_~y~0_BEFORE_CALL_221) 0) (not (= v_main_~y~0_BEFORE_CALL_221 0)) (not (= v_main_~b~0_BEFORE_CALL_194 0)) (< (* 2 aux_div_v_main_~x~0_BEFORE_CALL_218_67) (+ v_main_~y~0_BEFORE_CALL_221 v_main_~b~0_BEFORE_CALL_194)) (<= 1 |__VERIFIER_assert_#in~cond|) (< (* 2 aux_div_v_main_~x~0_BEFORE_CALL_218_67) (* v_main_~y~0_BEFORE_CALL_221 (div (+ (* 3 aux_div_v_main_~x~0_BEFORE_CALL_218_67) (* (- 2) v_main_~b~0_BEFORE_CALL_194)) v_main_~y~0_BEFORE_CALL_221))) (<= 0 v_main_~b~0_BEFORE_CALL_194)))} ~cond := #in~cond; {20099#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 15:00:09,234 INFO L290 TraceCheckUtils]: 188: Hoare triple {20099#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {19515#false} is VALID [2022-04-14 15:00:09,235 INFO L290 TraceCheckUtils]: 189: Hoare triple {19515#false} assume !false; {19515#false} is VALID [2022-04-14 15:00:09,236 INFO L134 CoverageAnalysis]: Checked inductivity of 1617 backedges. 303 proven. 264 refuted. 0 times theorem prover too weak. 1050 trivial. 0 not checked. [2022-04-14 15:00:09,236 INFO L328 TraceCheckSpWp]: Computing backward predicates...