/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/egcd3-ll_valuebound10.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 13:07:17,607 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 13:07:17,609 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 13:07:17,648 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 13:07:17,648 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 13:07:17,649 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 13:07:17,651 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 13:07:17,653 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 13:07:17,655 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 13:07:17,659 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 13:07:17,659 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 13:07:17,660 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 13:07:17,660 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 13:07:17,664 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 13:07:17,664 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 13:07:17,667 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 13:07:17,667 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 13:07:17,668 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 13:07:17,669 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 13:07:17,673 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 13:07:17,675 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 13:07:17,675 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 13:07:17,676 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 13:07:17,677 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 13:07:17,678 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 13:07:17,682 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 13:07:17,682 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 13:07:17,683 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 13:07:17,683 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 13:07:17,683 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 13:07:17,684 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 13:07:17,684 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 13:07:17,684 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 13:07:17,685 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 13:07:17,685 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 13:07:17,686 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 13:07:17,686 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 13:07:17,686 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 13:07:17,687 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 13:07:17,687 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 13:07:17,687 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 13:07:17,690 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 13:07:17,690 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-04-27 13:07:17,711 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 13:07:17,711 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 13:07:17,712 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 13:07:17,712 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 13:07:17,712 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 13:07:17,712 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 13:07:17,713 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 13:07:17,713 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 13:07:17,713 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 13:07:17,713 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 13:07:17,714 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 13:07:17,714 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 13:07:17,714 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 13:07:17,714 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 13:07:17,714 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 13:07:17,714 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 13:07:17,714 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 13:07:17,714 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 13:07:17,714 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 13:07:17,715 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 13:07:17,715 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 13:07:17,715 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 13:07:17,715 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 13:07:17,715 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 13:07:17,715 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 13:07:17,715 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 13:07:17,715 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 13:07:17,716 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 13:07:17,716 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 13:07:17,716 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 13:07:17,716 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 13:07:17,716 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 13:07:17,716 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 13:07:17,716 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-27 13:07:17,895 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 13:07:17,918 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 13:07:17,920 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 13:07:17,920 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 13:07:17,921 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 13:07:17,922 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/egcd3-ll_valuebound10.c [2022-04-27 13:07:17,967 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b65946bf/b3225ea75772424bb3dfd28325d407f3/FLAG892f3474b [2022-04-27 13:07:18,347 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 13:07:18,348 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/egcd3-ll_valuebound10.c [2022-04-27 13:07:18,356 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b65946bf/b3225ea75772424bb3dfd28325d407f3/FLAG892f3474b [2022-04-27 13:07:18,367 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b65946bf/b3225ea75772424bb3dfd28325d407f3 [2022-04-27 13:07:18,369 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 13:07:18,369 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 13:07:18,383 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 13:07:18,383 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 13:07:18,385 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 13:07:18,386 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 01:07:18" (1/1) ... [2022-04-27 13:07:18,386 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@745b9178 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:07:18, skipping insertion in model container [2022-04-27 13:07:18,387 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 01:07:18" (1/1) ... [2022-04-27 13:07:18,391 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 13:07:18,400 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 13:07:18,528 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/egcd3-ll_valuebound10.c[490,503] [2022-04-27 13:07:18,552 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 13:07:18,557 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 13:07:18,567 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/egcd3-ll_valuebound10.c[490,503] [2022-04-27 13:07:18,573 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 13:07:18,583 INFO L208 MainTranslator]: Completed translation [2022-04-27 13:07:18,583 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:07:18 WrapperNode [2022-04-27 13:07:18,583 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 13:07:18,584 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 13:07:18,584 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 13:07:18,584 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 13:07:18,591 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:07:18" (1/1) ... [2022-04-27 13:07:18,591 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:07:18" (1/1) ... [2022-04-27 13:07:18,595 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:07:18" (1/1) ... [2022-04-27 13:07:18,595 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:07:18" (1/1) ... [2022-04-27 13:07:18,599 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:07:18" (1/1) ... [2022-04-27 13:07:18,602 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:07:18" (1/1) ... [2022-04-27 13:07:18,603 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:07:18" (1/1) ... [2022-04-27 13:07:18,604 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 13:07:18,605 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 13:07:18,605 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 13:07:18,605 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 13:07:18,606 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:07:18" (1/1) ... [2022-04-27 13:07:18,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 13:07:18,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:07:18,626 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-27 13:07:18,630 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-27 13:07:18,651 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 13:07:18,652 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 13:07:18,652 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 13:07:18,652 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 13:07:18,652 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 13:07:18,652 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 13:07:18,652 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 13:07:18,652 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 13:07:18,653 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 13:07:18,653 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 13:07:18,653 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 13:07:18,653 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 13:07:18,653 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 13:07:18,653 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 13:07:18,653 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 13:07:18,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 13:07:18,653 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 13:07:18,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 13:07:18,654 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 13:07:18,654 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 13:07:18,694 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 13:07:18,696 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 13:07:18,833 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 13:07:18,838 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 13:07:18,839 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-04-27 13:07:18,843 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 01:07:18 BoogieIcfgContainer [2022-04-27 13:07:18,844 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 13:07:18,849 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 13:07:18,849 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 13:07:18,852 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 13:07:18,852 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 01:07:18" (1/3) ... [2022-04-27 13:07:18,853 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2574d25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 01:07:18, skipping insertion in model container [2022-04-27 13:07:18,853 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:07:18" (2/3) ... [2022-04-27 13:07:18,853 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2574d25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 01:07:18, skipping insertion in model container [2022-04-27 13:07:18,853 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 01:07:18" (3/3) ... [2022-04-27 13:07:18,854 INFO L111 eAbstractionObserver]: Analyzing ICFG egcd3-ll_valuebound10.c [2022-04-27 13:07:18,863 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 13:07:18,863 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 13:07:18,898 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 13:07:18,903 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@40a441cf, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@61211d6d [2022-04-27 13:07:18,904 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 13:07:18,909 INFO L276 IsEmpty]: Start isEmpty. Operand has 40 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 24 states have internal predecessors, (35), 11 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 13:07:18,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-27 13:07:18,916 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:07:18,916 INFO L195 NwaCegarLoop]: 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-27 13:07:18,916 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:07:18,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:07:18,920 INFO L85 PathProgramCache]: Analyzing trace with hash 1237885594, now seen corresponding path program 1 times [2022-04-27 13:07:18,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:07:18,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930170032] [2022-04-27 13:07:18,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:07:18,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:07:18,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:07:19,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 13:07:19,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:07:19,051 INFO L290 TraceCheckUtils]: 0: Hoare triple {64#(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); {43#true} is VALID [2022-04-27 13:07:19,051 INFO L290 TraceCheckUtils]: 1: Hoare triple {43#true} assume true; {43#true} is VALID [2022-04-27 13:07:19,051 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {43#true} {43#true} #112#return; {43#true} is VALID [2022-04-27 13:07:19,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 13:07:19,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:07:19,060 INFO L290 TraceCheckUtils]: 0: Hoare triple {43#true} ~cond := #in~cond; {43#true} is VALID [2022-04-27 13:07:19,061 INFO L290 TraceCheckUtils]: 1: Hoare triple {43#true} assume 0 == ~cond;assume false; {44#false} is VALID [2022-04-27 13:07:19,061 INFO L290 TraceCheckUtils]: 2: Hoare triple {44#false} assume true; {44#false} is VALID [2022-04-27 13:07:19,061 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44#false} {43#true} #94#return; {44#false} is VALID [2022-04-27 13:07:19,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-27 13:07:19,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:07:19,068 INFO L290 TraceCheckUtils]: 0: Hoare triple {43#true} ~cond := #in~cond; {43#true} is VALID [2022-04-27 13:07:19,068 INFO L290 TraceCheckUtils]: 1: Hoare triple {43#true} assume 0 == ~cond;assume false; {44#false} is VALID [2022-04-27 13:07:19,068 INFO L290 TraceCheckUtils]: 2: Hoare triple {44#false} assume true; {44#false} is VALID [2022-04-27 13:07:19,069 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44#false} {44#false} #96#return; {44#false} is VALID [2022-04-27 13:07:19,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-27 13:07:19,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:07:19,076 INFO L290 TraceCheckUtils]: 0: Hoare triple {43#true} ~cond := #in~cond; {43#true} is VALID [2022-04-27 13:07:19,076 INFO L290 TraceCheckUtils]: 1: Hoare triple {43#true} assume 0 == ~cond;assume false; {44#false} is VALID [2022-04-27 13:07:19,076 INFO L290 TraceCheckUtils]: 2: Hoare triple {44#false} assume true; {44#false} is VALID [2022-04-27 13:07:19,076 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44#false} {44#false} #98#return; {44#false} is VALID [2022-04-27 13:07:19,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-04-27 13:07:19,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:07:19,083 INFO L290 TraceCheckUtils]: 0: Hoare triple {43#true} ~cond := #in~cond; {43#true} is VALID [2022-04-27 13:07:19,083 INFO L290 TraceCheckUtils]: 1: Hoare triple {43#true} assume 0 == ~cond;assume false; {44#false} is VALID [2022-04-27 13:07:19,083 INFO L290 TraceCheckUtils]: 2: Hoare triple {44#false} assume true; {44#false} is VALID [2022-04-27 13:07:19,083 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44#false} {44#false} #100#return; {44#false} is VALID [2022-04-27 13:07:19,084 INFO L272 TraceCheckUtils]: 0: Hoare triple {43#true} call ULTIMATE.init(); {64#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 13:07:19,084 INFO L290 TraceCheckUtils]: 1: Hoare triple {64#(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); {43#true} is VALID [2022-04-27 13:07:19,085 INFO L290 TraceCheckUtils]: 2: Hoare triple {43#true} assume true; {43#true} is VALID [2022-04-27 13:07:19,085 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43#true} {43#true} #112#return; {43#true} is VALID [2022-04-27 13:07:19,085 INFO L272 TraceCheckUtils]: 4: Hoare triple {43#true} call #t~ret6 := main(); {43#true} is VALID [2022-04-27 13:07:19,085 INFO L290 TraceCheckUtils]: 5: Hoare triple {43#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;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {43#true} is VALID [2022-04-27 13:07:19,085 INFO L272 TraceCheckUtils]: 6: Hoare triple {43#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 10 then 1 else 0)); {43#true} is VALID [2022-04-27 13:07:19,085 INFO L290 TraceCheckUtils]: 7: Hoare triple {43#true} ~cond := #in~cond; {43#true} is VALID [2022-04-27 13:07:19,086 INFO L290 TraceCheckUtils]: 8: Hoare triple {43#true} assume 0 == ~cond;assume false; {44#false} is VALID [2022-04-27 13:07:19,086 INFO L290 TraceCheckUtils]: 9: Hoare triple {44#false} assume true; {44#false} is VALID [2022-04-27 13:07:19,086 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {44#false} {43#true} #94#return; {44#false} is VALID [2022-04-27 13:07:19,086 INFO L290 TraceCheckUtils]: 11: Hoare triple {44#false} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {44#false} is VALID [2022-04-27 13:07:19,086 INFO L272 TraceCheckUtils]: 12: Hoare triple {44#false} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 10 then 1 else 0)); {43#true} is VALID [2022-04-27 13:07:19,086 INFO L290 TraceCheckUtils]: 13: Hoare triple {43#true} ~cond := #in~cond; {43#true} is VALID [2022-04-27 13:07:19,087 INFO L290 TraceCheckUtils]: 14: Hoare triple {43#true} assume 0 == ~cond;assume false; {44#false} is VALID [2022-04-27 13:07:19,087 INFO L290 TraceCheckUtils]: 15: Hoare triple {44#false} assume true; {44#false} is VALID [2022-04-27 13:07:19,087 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {44#false} {44#false} #96#return; {44#false} is VALID [2022-04-27 13:07:19,087 INFO L272 TraceCheckUtils]: 17: Hoare triple {44#false} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {43#true} is VALID [2022-04-27 13:07:19,087 INFO L290 TraceCheckUtils]: 18: Hoare triple {43#true} ~cond := #in~cond; {43#true} is VALID [2022-04-27 13:07:19,088 INFO L290 TraceCheckUtils]: 19: Hoare triple {43#true} assume 0 == ~cond;assume false; {44#false} is VALID [2022-04-27 13:07:19,088 INFO L290 TraceCheckUtils]: 20: Hoare triple {44#false} assume true; {44#false} is VALID [2022-04-27 13:07:19,088 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {44#false} {44#false} #98#return; {44#false} is VALID [2022-04-27 13:07:19,088 INFO L272 TraceCheckUtils]: 22: Hoare triple {44#false} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {43#true} is VALID [2022-04-27 13:07:19,088 INFO L290 TraceCheckUtils]: 23: Hoare triple {43#true} ~cond := #in~cond; {43#true} is VALID [2022-04-27 13:07:19,089 INFO L290 TraceCheckUtils]: 24: Hoare triple {43#true} assume 0 == ~cond;assume false; {44#false} is VALID [2022-04-27 13:07:19,089 INFO L290 TraceCheckUtils]: 25: Hoare triple {44#false} assume true; {44#false} is VALID [2022-04-27 13:07:19,089 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {44#false} {44#false} #100#return; {44#false} is VALID [2022-04-27 13:07:19,089 INFO L290 TraceCheckUtils]: 27: Hoare triple {44#false} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {44#false} is VALID [2022-04-27 13:07:19,089 INFO L290 TraceCheckUtils]: 28: Hoare triple {44#false} assume false; {44#false} is VALID [2022-04-27 13:07:19,089 INFO L272 TraceCheckUtils]: 29: Hoare triple {44#false} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {44#false} is VALID [2022-04-27 13:07:19,090 INFO L290 TraceCheckUtils]: 30: Hoare triple {44#false} ~cond := #in~cond; {44#false} is VALID [2022-04-27 13:07:19,090 INFO L290 TraceCheckUtils]: 31: Hoare triple {44#false} assume 0 == ~cond; {44#false} is VALID [2022-04-27 13:07:19,090 INFO L290 TraceCheckUtils]: 32: Hoare triple {44#false} assume !false; {44#false} is VALID [2022-04-27 13:07:19,090 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-27 13:07:19,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:07:19,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930170032] [2022-04-27 13:07:19,091 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930170032] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:07:19,092 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:07:19,092 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 13:07:19,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044328656] [2022-04-27 13:07:19,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:07:19,096 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 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 33 [2022-04-27 13:07:19,097 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:07:19,099 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 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-27 13:07:19,122 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:07:19,122 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 13:07:19,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:07:19,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 13:07:19,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 13:07:19,138 INFO L87 Difference]: Start difference. First operand has 40 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 24 states have internal predecessors, (35), 11 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 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-27 13:07:19,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:07:19,277 INFO L93 Difference]: Finished difference Result 73 states and 115 transitions. [2022-04-27 13:07:19,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 13:07:19,277 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 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 33 [2022-04-27 13:07:19,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:07:19,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 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-27 13:07:19,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 115 transitions. [2022-04-27 13:07:19,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 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-27 13:07:19,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 115 transitions. [2022-04-27 13:07:19,299 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 115 transitions. [2022-04-27 13:07:19,394 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-27 13:07:19,400 INFO L225 Difference]: With dead ends: 73 [2022-04-27 13:07:19,400 INFO L226 Difference]: Without dead ends: 35 [2022-04-27 13:07:19,402 INFO L412 NwaCegarLoop]: 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-27 13:07:19,404 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 24 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 13:07:19,404 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 43 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 13:07:19,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-27 13:07:19,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2022-04-27 13:07:19,423 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:07:19,423 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 35 states, 20 states have (on average 1.2) internal successors, (24), 21 states have internal predecessors, (24), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 13:07:19,424 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 35 states, 20 states have (on average 1.2) internal successors, (24), 21 states have internal predecessors, (24), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 13:07:19,424 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 35 states, 20 states have (on average 1.2) internal successors, (24), 21 states have internal predecessors, (24), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 13:07:19,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:07:19,428 INFO L93 Difference]: Finished difference Result 35 states and 44 transitions. [2022-04-27 13:07:19,428 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 44 transitions. [2022-04-27 13:07:19,428 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:07:19,428 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:07:19,429 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 20 states have (on average 1.2) internal successors, (24), 21 states have internal predecessors, (24), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 35 states. [2022-04-27 13:07:19,429 INFO L87 Difference]: Start difference. First operand has 35 states, 20 states have (on average 1.2) internal successors, (24), 21 states have internal predecessors, (24), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 35 states. [2022-04-27 13:07:19,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:07:19,432 INFO L93 Difference]: Finished difference Result 35 states and 44 transitions. [2022-04-27 13:07:19,432 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 44 transitions. [2022-04-27 13:07:19,432 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:07:19,432 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:07:19,432 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:07:19,433 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:07:19,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 20 states have (on average 1.2) internal successors, (24), 21 states have internal predecessors, (24), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 13:07:19,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 44 transitions. [2022-04-27 13:07:19,435 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 44 transitions. Word has length 33 [2022-04-27 13:07:19,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:07:19,436 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 44 transitions. [2022-04-27 13:07:19,436 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 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-27 13:07:19,436 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 44 transitions. [2022-04-27 13:07:19,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-27 13:07:19,437 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:07:19,437 INFO L195 NwaCegarLoop]: 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-27 13:07:19,437 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 13:07:19,437 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:07:19,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:07:19,438 INFO L85 PathProgramCache]: Analyzing trace with hash 1569470122, now seen corresponding path program 1 times [2022-04-27 13:07:19,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:07:19,438 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801469968] [2022-04-27 13:07:19,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:07:19,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:07:19,457 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:07:19,457 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [348722562] [2022-04-27 13:07:19,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:07:19,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:07:19,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:07:19,459 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 13:07:19,475 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-27 13:07:19,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:07:19,527 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 13:07:19,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:07:19,538 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:07:19,658 INFO L272 TraceCheckUtils]: 0: Hoare triple {294#true} call ULTIMATE.init(); {294#true} is VALID [2022-04-27 13:07:19,658 INFO L290 TraceCheckUtils]: 1: Hoare triple {294#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); {294#true} is VALID [2022-04-27 13:07:19,658 INFO L290 TraceCheckUtils]: 2: Hoare triple {294#true} assume true; {294#true} is VALID [2022-04-27 13:07:19,658 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {294#true} {294#true} #112#return; {294#true} is VALID [2022-04-27 13:07:19,659 INFO L272 TraceCheckUtils]: 4: Hoare triple {294#true} call #t~ret6 := main(); {294#true} is VALID [2022-04-27 13:07:19,659 INFO L290 TraceCheckUtils]: 5: Hoare triple {294#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;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {294#true} is VALID [2022-04-27 13:07:19,659 INFO L272 TraceCheckUtils]: 6: Hoare triple {294#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 10 then 1 else 0)); {294#true} is VALID [2022-04-27 13:07:19,659 INFO L290 TraceCheckUtils]: 7: Hoare triple {294#true} ~cond := #in~cond; {294#true} is VALID [2022-04-27 13:07:19,659 INFO L290 TraceCheckUtils]: 8: Hoare triple {294#true} assume !(0 == ~cond); {294#true} is VALID [2022-04-27 13:07:19,659 INFO L290 TraceCheckUtils]: 9: Hoare triple {294#true} assume true; {294#true} is VALID [2022-04-27 13:07:19,659 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {294#true} {294#true} #94#return; {294#true} is VALID [2022-04-27 13:07:19,660 INFO L290 TraceCheckUtils]: 11: Hoare triple {294#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {294#true} is VALID [2022-04-27 13:07:19,660 INFO L272 TraceCheckUtils]: 12: Hoare triple {294#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 10 then 1 else 0)); {294#true} is VALID [2022-04-27 13:07:19,660 INFO L290 TraceCheckUtils]: 13: Hoare triple {294#true} ~cond := #in~cond; {294#true} is VALID [2022-04-27 13:07:19,660 INFO L290 TraceCheckUtils]: 14: Hoare triple {294#true} assume !(0 == ~cond); {294#true} is VALID [2022-04-27 13:07:19,660 INFO L290 TraceCheckUtils]: 15: Hoare triple {294#true} assume true; {294#true} is VALID [2022-04-27 13:07:19,660 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {294#true} {294#true} #96#return; {294#true} is VALID [2022-04-27 13:07:19,660 INFO L272 TraceCheckUtils]: 17: Hoare triple {294#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {294#true} is VALID [2022-04-27 13:07:19,660 INFO L290 TraceCheckUtils]: 18: Hoare triple {294#true} ~cond := #in~cond; {294#true} is VALID [2022-04-27 13:07:19,661 INFO L290 TraceCheckUtils]: 19: Hoare triple {294#true} assume !(0 == ~cond); {294#true} is VALID [2022-04-27 13:07:19,661 INFO L290 TraceCheckUtils]: 20: Hoare triple {294#true} assume true; {294#true} is VALID [2022-04-27 13:07:19,661 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {294#true} {294#true} #98#return; {294#true} is VALID [2022-04-27 13:07:19,661 INFO L272 TraceCheckUtils]: 22: Hoare triple {294#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {294#true} is VALID [2022-04-27 13:07:19,661 INFO L290 TraceCheckUtils]: 23: Hoare triple {294#true} ~cond := #in~cond; {368#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 13:07:19,662 INFO L290 TraceCheckUtils]: 24: Hoare triple {368#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {372#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 13:07:19,662 INFO L290 TraceCheckUtils]: 25: Hoare triple {372#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {372#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 13:07:19,663 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {372#(not (= |assume_abort_if_not_#in~cond| 0))} {294#true} #100#return; {379#(<= 1 main_~y~0)} is VALID [2022-04-27 13:07:19,663 INFO L290 TraceCheckUtils]: 27: Hoare triple {379#(<= 1 main_~y~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {383#(<= 1 main_~b~0)} is VALID [2022-04-27 13:07:19,664 INFO L290 TraceCheckUtils]: 28: Hoare triple {383#(<= 1 main_~b~0)} assume !false; {383#(<= 1 main_~b~0)} is VALID [2022-04-27 13:07:19,664 INFO L290 TraceCheckUtils]: 29: Hoare triple {383#(<= 1 main_~b~0)} assume !(0 != ~b~0); {295#false} is VALID [2022-04-27 13:07:19,664 INFO L272 TraceCheckUtils]: 30: Hoare triple {295#false} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {295#false} is VALID [2022-04-27 13:07:19,664 INFO L290 TraceCheckUtils]: 31: Hoare triple {295#false} ~cond := #in~cond; {295#false} is VALID [2022-04-27 13:07:19,664 INFO L290 TraceCheckUtils]: 32: Hoare triple {295#false} assume 0 == ~cond; {295#false} is VALID [2022-04-27 13:07:19,665 INFO L290 TraceCheckUtils]: 33: Hoare triple {295#false} assume !false; {295#false} is VALID [2022-04-27 13:07:19,665 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-27 13:07:19,665 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 13:07:19,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:07:19,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801469968] [2022-04-27 13:07:19,665 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:07:19,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [348722562] [2022-04-27 13:07:19,666 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [348722562] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:07:19,666 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:07:19,666 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 13:07:19,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412902452] [2022-04-27 13:07:19,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:07:19,667 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 34 [2022-04-27 13:07:19,667 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:07:19,668 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-27 13:07:19,686 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:07:19,686 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 13:07:19,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:07:19,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 13:07:19,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 13:07:19,687 INFO L87 Difference]: Start difference. First operand 35 states and 44 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-27 13:07:19,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:07:19,902 INFO L93 Difference]: Finished difference Result 54 states and 69 transitions. [2022-04-27 13:07:19,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 13:07:19,902 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 34 [2022-04-27 13:07:19,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:07:19,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-27 13:07:19,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 69 transitions. [2022-04-27 13:07:19,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-27 13:07:19,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 69 transitions. [2022-04-27 13:07:19,907 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 69 transitions. [2022-04-27 13:07:19,955 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:07:19,957 INFO L225 Difference]: With dead ends: 54 [2022-04-27 13:07:19,957 INFO L226 Difference]: Without dead ends: 47 [2022-04-27 13:07:19,957 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-27 13:07:19,958 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 31 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 13:07:19,958 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 133 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 13:07:19,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-04-27 13:07:19,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 37. [2022-04-27 13:07:19,971 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:07:19,971 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand has 37 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 23 states have internal predecessors, (26), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 13:07:19,971 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand has 37 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 23 states have internal predecessors, (26), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 13:07:19,972 INFO L87 Difference]: Start difference. First operand 47 states. Second operand has 37 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 23 states have internal predecessors, (26), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 13:07:19,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:07:19,974 INFO L93 Difference]: Finished difference Result 47 states and 62 transitions. [2022-04-27 13:07:19,974 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 62 transitions. [2022-04-27 13:07:19,975 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:07:19,975 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:07:19,975 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 23 states have internal predecessors, (26), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 47 states. [2022-04-27 13:07:19,975 INFO L87 Difference]: Start difference. First operand has 37 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 23 states have internal predecessors, (26), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 47 states. [2022-04-27 13:07:19,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:07:19,978 INFO L93 Difference]: Finished difference Result 47 states and 62 transitions. [2022-04-27 13:07:19,978 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 62 transitions. [2022-04-27 13:07:19,978 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:07:19,978 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:07:19,978 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:07:19,978 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:07:19,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 23 states have internal predecessors, (26), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 13:07:19,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 46 transitions. [2022-04-27 13:07:19,980 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 46 transitions. Word has length 34 [2022-04-27 13:07:19,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:07:19,981 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 46 transitions. [2022-04-27 13:07:19,981 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-27 13:07:19,981 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 46 transitions. [2022-04-27 13:07:19,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-27 13:07:19,981 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:07:19,982 INFO L195 NwaCegarLoop]: 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, 1, 1, 1] [2022-04-27 13:07:20,002 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-27 13:07:20,202 WARN L477 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-27 13:07:20,202 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:07:20,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:07:20,203 INFO L85 PathProgramCache]: Analyzing trace with hash 1443363578, now seen corresponding path program 1 times [2022-04-27 13:07:20,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:07:20,203 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251317135] [2022-04-27 13:07:20,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:07:20,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:07:20,221 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:07:20,221 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1115617406] [2022-04-27 13:07:20,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:07:20,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:07:20,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:07:20,233 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 13:07:20,248 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-27 13:07:20,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:07:20,289 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-27 13:07:20,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:07:20,305 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:07:20,589 INFO L272 TraceCheckUtils]: 0: Hoare triple {636#true} call ULTIMATE.init(); {636#true} is VALID [2022-04-27 13:07:20,589 INFO L290 TraceCheckUtils]: 1: Hoare triple {636#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); {636#true} is VALID [2022-04-27 13:07:20,589 INFO L290 TraceCheckUtils]: 2: Hoare triple {636#true} assume true; {636#true} is VALID [2022-04-27 13:07:20,589 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {636#true} {636#true} #112#return; {636#true} is VALID [2022-04-27 13:07:20,590 INFO L272 TraceCheckUtils]: 4: Hoare triple {636#true} call #t~ret6 := main(); {636#true} is VALID [2022-04-27 13:07:20,590 INFO L290 TraceCheckUtils]: 5: Hoare triple {636#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;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {636#true} is VALID [2022-04-27 13:07:20,590 INFO L272 TraceCheckUtils]: 6: Hoare triple {636#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 10 then 1 else 0)); {636#true} is VALID [2022-04-27 13:07:20,590 INFO L290 TraceCheckUtils]: 7: Hoare triple {636#true} ~cond := #in~cond; {636#true} is VALID [2022-04-27 13:07:20,590 INFO L290 TraceCheckUtils]: 8: Hoare triple {636#true} assume !(0 == ~cond); {636#true} is VALID [2022-04-27 13:07:20,590 INFO L290 TraceCheckUtils]: 9: Hoare triple {636#true} assume true; {636#true} is VALID [2022-04-27 13:07:20,590 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {636#true} {636#true} #94#return; {636#true} is VALID [2022-04-27 13:07:20,591 INFO L290 TraceCheckUtils]: 11: Hoare triple {636#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {636#true} is VALID [2022-04-27 13:07:20,591 INFO L272 TraceCheckUtils]: 12: Hoare triple {636#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 10 then 1 else 0)); {636#true} is VALID [2022-04-27 13:07:20,592 INFO L290 TraceCheckUtils]: 13: Hoare triple {636#true} ~cond := #in~cond; {680#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 13:07:20,593 INFO L290 TraceCheckUtils]: 14: Hoare triple {680#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {684#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 13:07:20,593 INFO L290 TraceCheckUtils]: 15: Hoare triple {684#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {684#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 13:07:20,596 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {684#(not (= |assume_abort_if_not_#in~cond| 0))} {636#true} #96#return; {691#(and (<= 0 main_~y~0) (<= main_~y~0 10))} is VALID [2022-04-27 13:07:20,596 INFO L272 TraceCheckUtils]: 17: Hoare triple {691#(and (<= 0 main_~y~0) (<= main_~y~0 10))} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {636#true} is VALID [2022-04-27 13:07:20,596 INFO L290 TraceCheckUtils]: 18: Hoare triple {636#true} ~cond := #in~cond; {636#true} is VALID [2022-04-27 13:07:20,596 INFO L290 TraceCheckUtils]: 19: Hoare triple {636#true} assume !(0 == ~cond); {636#true} is VALID [2022-04-27 13:07:20,596 INFO L290 TraceCheckUtils]: 20: Hoare triple {636#true} assume true; {636#true} is VALID [2022-04-27 13:07:20,615 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {636#true} {691#(and (<= 0 main_~y~0) (<= main_~y~0 10))} #98#return; {691#(and (<= 0 main_~y~0) (<= main_~y~0 10))} is VALID [2022-04-27 13:07:20,615 INFO L272 TraceCheckUtils]: 22: Hoare triple {691#(and (<= 0 main_~y~0) (<= main_~y~0 10))} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {636#true} is VALID [2022-04-27 13:07:20,615 INFO L290 TraceCheckUtils]: 23: Hoare triple {636#true} ~cond := #in~cond; {680#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 13:07:20,616 INFO L290 TraceCheckUtils]: 24: Hoare triple {680#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {684#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 13:07:20,616 INFO L290 TraceCheckUtils]: 25: Hoare triple {684#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {684#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 13:07:20,620 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {684#(not (= |assume_abort_if_not_#in~cond| 0))} {691#(and (<= 0 main_~y~0) (<= main_~y~0 10))} #100#return; {722#(and (<= main_~y~0 10) (<= 1 main_~y~0))} is VALID [2022-04-27 13:07:20,621 INFO L290 TraceCheckUtils]: 27: Hoare triple {722#(and (<= main_~y~0 10) (<= 1 main_~y~0))} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {726#(and (= main_~r~0 0) (<= main_~y~0 10) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:07:20,621 INFO L290 TraceCheckUtils]: 28: Hoare triple {726#(and (= main_~r~0 0) (<= main_~y~0 10) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !false; {726#(and (= main_~r~0 0) (<= main_~y~0 10) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:07:20,622 INFO L290 TraceCheckUtils]: 29: Hoare triple {726#(and (= main_~r~0 0) (<= main_~y~0 10) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {726#(and (= main_~r~0 0) (<= main_~y~0 10) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:07:20,622 INFO L290 TraceCheckUtils]: 30: Hoare triple {726#(and (= main_~r~0 0) (<= main_~y~0 10) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !false; {726#(and (= main_~r~0 0) (<= main_~y~0 10) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:07:20,623 INFO L290 TraceCheckUtils]: 31: Hoare triple {726#(and (= main_~r~0 0) (<= main_~y~0 10) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {726#(and (= main_~r~0 0) (<= main_~y~0 10) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:07:20,623 INFO L290 TraceCheckUtils]: 32: Hoare triple {726#(and (= main_~r~0 0) (<= main_~y~0 10) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !false; {726#(and (= main_~r~0 0) (<= main_~y~0 10) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:07:20,624 INFO L272 TraceCheckUtils]: 33: Hoare triple {726#(and (= main_~r~0 0) (<= main_~y~0 10) (<= 1 main_~y~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)); {745#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:07:20,625 INFO L290 TraceCheckUtils]: 34: Hoare triple {745#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {749#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:07:20,625 INFO L290 TraceCheckUtils]: 35: Hoare triple {749#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {637#false} is VALID [2022-04-27 13:07:20,625 INFO L290 TraceCheckUtils]: 36: Hoare triple {637#false} assume !false; {637#false} is VALID [2022-04-27 13:07:20,625 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-27 13:07:20,626 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:07:20,873 INFO L290 TraceCheckUtils]: 36: Hoare triple {637#false} assume !false; {637#false} is VALID [2022-04-27 13:07:20,873 INFO L290 TraceCheckUtils]: 35: Hoare triple {749#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {637#false} is VALID [2022-04-27 13:07:20,887 INFO L290 TraceCheckUtils]: 34: Hoare triple {745#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {749#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:07:20,888 INFO L272 TraceCheckUtils]: 33: Hoare triple {765#(= 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)); {745#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:07:20,889 INFO L290 TraceCheckUtils]: 32: Hoare triple {765#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !false; {765#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 13:07:20,889 INFO L290 TraceCheckUtils]: 31: Hoare triple {765#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {765#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 13:07:20,890 INFO L290 TraceCheckUtils]: 30: Hoare triple {765#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !false; {765#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 13:07:20,890 INFO L290 TraceCheckUtils]: 29: Hoare triple {765#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {765#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 13:07:20,891 INFO L290 TraceCheckUtils]: 28: Hoare triple {765#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !false; {765#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 13:07:20,891 INFO L290 TraceCheckUtils]: 27: Hoare triple {636#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {765#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 13:07:20,891 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {636#true} {636#true} #100#return; {636#true} is VALID [2022-04-27 13:07:20,891 INFO L290 TraceCheckUtils]: 25: Hoare triple {636#true} assume true; {636#true} is VALID [2022-04-27 13:07:20,891 INFO L290 TraceCheckUtils]: 24: Hoare triple {636#true} assume !(0 == ~cond); {636#true} is VALID [2022-04-27 13:07:20,892 INFO L290 TraceCheckUtils]: 23: Hoare triple {636#true} ~cond := #in~cond; {636#true} is VALID [2022-04-27 13:07:20,892 INFO L272 TraceCheckUtils]: 22: Hoare triple {636#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {636#true} is VALID [2022-04-27 13:07:20,892 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {636#true} {636#true} #98#return; {636#true} is VALID [2022-04-27 13:07:20,892 INFO L290 TraceCheckUtils]: 20: Hoare triple {636#true} assume true; {636#true} is VALID [2022-04-27 13:07:20,892 INFO L290 TraceCheckUtils]: 19: Hoare triple {636#true} assume !(0 == ~cond); {636#true} is VALID [2022-04-27 13:07:20,892 INFO L290 TraceCheckUtils]: 18: Hoare triple {636#true} ~cond := #in~cond; {636#true} is VALID [2022-04-27 13:07:20,892 INFO L272 TraceCheckUtils]: 17: Hoare triple {636#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {636#true} is VALID [2022-04-27 13:07:20,892 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {636#true} {636#true} #96#return; {636#true} is VALID [2022-04-27 13:07:20,892 INFO L290 TraceCheckUtils]: 15: Hoare triple {636#true} assume true; {636#true} is VALID [2022-04-27 13:07:20,892 INFO L290 TraceCheckUtils]: 14: Hoare triple {636#true} assume !(0 == ~cond); {636#true} is VALID [2022-04-27 13:07:20,893 INFO L290 TraceCheckUtils]: 13: Hoare triple {636#true} ~cond := #in~cond; {636#true} is VALID [2022-04-27 13:07:20,893 INFO L272 TraceCheckUtils]: 12: Hoare triple {636#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 10 then 1 else 0)); {636#true} is VALID [2022-04-27 13:07:20,893 INFO L290 TraceCheckUtils]: 11: Hoare triple {636#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {636#true} is VALID [2022-04-27 13:07:20,893 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {636#true} {636#true} #94#return; {636#true} is VALID [2022-04-27 13:07:20,893 INFO L290 TraceCheckUtils]: 9: Hoare triple {636#true} assume true; {636#true} is VALID [2022-04-27 13:07:20,893 INFO L290 TraceCheckUtils]: 8: Hoare triple {636#true} assume !(0 == ~cond); {636#true} is VALID [2022-04-27 13:07:20,893 INFO L290 TraceCheckUtils]: 7: Hoare triple {636#true} ~cond := #in~cond; {636#true} is VALID [2022-04-27 13:07:20,893 INFO L272 TraceCheckUtils]: 6: Hoare triple {636#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 10 then 1 else 0)); {636#true} is VALID [2022-04-27 13:07:20,893 INFO L290 TraceCheckUtils]: 5: Hoare triple {636#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;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {636#true} is VALID [2022-04-27 13:07:20,894 INFO L272 TraceCheckUtils]: 4: Hoare triple {636#true} call #t~ret6 := main(); {636#true} is VALID [2022-04-27 13:07:20,894 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {636#true} {636#true} #112#return; {636#true} is VALID [2022-04-27 13:07:20,894 INFO L290 TraceCheckUtils]: 2: Hoare triple {636#true} assume true; {636#true} is VALID [2022-04-27 13:07:20,894 INFO L290 TraceCheckUtils]: 1: Hoare triple {636#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); {636#true} is VALID [2022-04-27 13:07:20,894 INFO L272 TraceCheckUtils]: 0: Hoare triple {636#true} call ULTIMATE.init(); {636#true} is VALID [2022-04-27 13:07:20,894 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-27 13:07:20,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:07:20,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251317135] [2022-04-27 13:07:20,895 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:07:20,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1115617406] [2022-04-27 13:07:20,895 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1115617406] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-27 13:07:20,895 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-27 13:07:20,895 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 10 [2022-04-27 13:07:20,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198175853] [2022-04-27 13:07:20,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:07:20,896 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, (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 37 [2022-04-27 13:07:20,896 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:07:20,896 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, (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-27 13:07:20,917 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:07:20,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 13:07:20,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:07:20,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 13:07:20,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-04-27 13:07:20,918 INFO L87 Difference]: Start difference. First operand 37 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, (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-27 13:07:21,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:07:21,096 INFO L93 Difference]: Finished difference Result 53 states and 67 transitions. [2022-04-27 13:07:21,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 13:07:21,097 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, (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 37 [2022-04-27 13:07:21,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:07:21,097 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, (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-27 13:07:21,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-27 13:07:21,099 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, (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-27 13:07:21,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-27 13:07:21,100 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 67 transitions. [2022-04-27 13:07:21,145 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:07:21,146 INFO L225 Difference]: With dead ends: 53 [2022-04-27 13:07:21,146 INFO L226 Difference]: Without dead ends: 51 [2022-04-27 13:07:21,146 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 64 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-04-27 13:07:21,147 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 9 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 150 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-27 13:07:21,147 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 150 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 13:07:21,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-04-27 13:07:21,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2022-04-27 13:07:21,164 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:07:21,165 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand has 50 states, 30 states have (on average 1.2) internal successors, (36), 31 states have internal predecessors, (36), 15 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 13:07:21,165 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand has 50 states, 30 states have (on average 1.2) internal successors, (36), 31 states have internal predecessors, (36), 15 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 13:07:21,165 INFO L87 Difference]: Start difference. First operand 51 states. Second operand has 50 states, 30 states have (on average 1.2) internal successors, (36), 31 states have internal predecessors, (36), 15 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 13:07:21,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:07:21,167 INFO L93 Difference]: Finished difference Result 51 states and 65 transitions. [2022-04-27 13:07:21,167 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 65 transitions. [2022-04-27 13:07:21,168 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:07:21,168 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:07:21,168 INFO L74 IsIncluded]: Start isIncluded. First operand has 50 states, 30 states have (on average 1.2) internal successors, (36), 31 states have internal predecessors, (36), 15 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 51 states. [2022-04-27 13:07:21,168 INFO L87 Difference]: Start difference. First operand has 50 states, 30 states have (on average 1.2) internal successors, (36), 31 states have internal predecessors, (36), 15 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 51 states. [2022-04-27 13:07:21,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:07:21,170 INFO L93 Difference]: Finished difference Result 51 states and 65 transitions. [2022-04-27 13:07:21,170 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 65 transitions. [2022-04-27 13:07:21,171 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:07:21,171 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:07:21,171 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:07:21,171 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:07:21,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 30 states have (on average 1.2) internal successors, (36), 31 states have internal predecessors, (36), 15 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 13:07:21,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 64 transitions. [2022-04-27 13:07:21,173 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 64 transitions. Word has length 37 [2022-04-27 13:07:21,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:07:21,173 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 64 transitions. [2022-04-27 13:07:21,173 INFO L496 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, (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-27 13:07:21,173 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 64 transitions. [2022-04-27 13:07:21,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-27 13:07:21,174 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:07:21,174 INFO L195 NwaCegarLoop]: 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-27 13:07:21,190 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-27 13:07:21,390 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-27 13:07:21,390 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:07:21,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:07:21,391 INFO L85 PathProgramCache]: Analyzing trace with hash 584996456, now seen corresponding path program 1 times [2022-04-27 13:07:21,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:07:21,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339959737] [2022-04-27 13:07:21,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:07:21,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:07:21,409 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:07:21,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1007831206] [2022-04-27 13:07:21,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:07:21,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:07:21,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:07:21,416 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 13:07:21,418 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-27 13:07:21,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:07:21,466 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-27 13:07:21,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:07:21,479 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:07:21,626 INFO L272 TraceCheckUtils]: 0: Hoare triple {1126#true} call ULTIMATE.init(); {1126#true} is VALID [2022-04-27 13:07:21,626 INFO L290 TraceCheckUtils]: 1: Hoare triple {1126#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); {1126#true} is VALID [2022-04-27 13:07:21,626 INFO L290 TraceCheckUtils]: 2: Hoare triple {1126#true} assume true; {1126#true} is VALID [2022-04-27 13:07:21,626 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1126#true} {1126#true} #112#return; {1126#true} is VALID [2022-04-27 13:07:21,626 INFO L272 TraceCheckUtils]: 4: Hoare triple {1126#true} call #t~ret6 := main(); {1126#true} is VALID [2022-04-27 13:07:21,626 INFO L290 TraceCheckUtils]: 5: Hoare triple {1126#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;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {1126#true} is VALID [2022-04-27 13:07:21,626 INFO L272 TraceCheckUtils]: 6: Hoare triple {1126#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 10 then 1 else 0)); {1126#true} is VALID [2022-04-27 13:07:21,626 INFO L290 TraceCheckUtils]: 7: Hoare triple {1126#true} ~cond := #in~cond; {1126#true} is VALID [2022-04-27 13:07:21,627 INFO L290 TraceCheckUtils]: 8: Hoare triple {1126#true} assume !(0 == ~cond); {1126#true} is VALID [2022-04-27 13:07:21,627 INFO L290 TraceCheckUtils]: 9: Hoare triple {1126#true} assume true; {1126#true} is VALID [2022-04-27 13:07:21,627 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1126#true} {1126#true} #94#return; {1126#true} is VALID [2022-04-27 13:07:21,627 INFO L290 TraceCheckUtils]: 11: Hoare triple {1126#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {1126#true} is VALID [2022-04-27 13:07:21,627 INFO L272 TraceCheckUtils]: 12: Hoare triple {1126#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 10 then 1 else 0)); {1126#true} is VALID [2022-04-27 13:07:21,627 INFO L290 TraceCheckUtils]: 13: Hoare triple {1126#true} ~cond := #in~cond; {1126#true} is VALID [2022-04-27 13:07:21,627 INFO L290 TraceCheckUtils]: 14: Hoare triple {1126#true} assume !(0 == ~cond); {1126#true} is VALID [2022-04-27 13:07:21,627 INFO L290 TraceCheckUtils]: 15: Hoare triple {1126#true} assume true; {1126#true} is VALID [2022-04-27 13:07:21,627 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1126#true} {1126#true} #96#return; {1126#true} is VALID [2022-04-27 13:07:21,627 INFO L272 TraceCheckUtils]: 17: Hoare triple {1126#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {1126#true} is VALID [2022-04-27 13:07:21,628 INFO L290 TraceCheckUtils]: 18: Hoare triple {1126#true} ~cond := #in~cond; {1185#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 13:07:21,629 INFO L290 TraceCheckUtils]: 19: Hoare triple {1185#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {1189#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 13:07:21,629 INFO L290 TraceCheckUtils]: 20: Hoare triple {1189#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {1189#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 13:07:21,630 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1189#(not (= |assume_abort_if_not_#in~cond| 0))} {1126#true} #98#return; {1196#(<= 1 main_~x~0)} is VALID [2022-04-27 13:07:21,630 INFO L272 TraceCheckUtils]: 22: Hoare triple {1196#(<= 1 main_~x~0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1126#true} is VALID [2022-04-27 13:07:21,630 INFO L290 TraceCheckUtils]: 23: Hoare triple {1126#true} ~cond := #in~cond; {1126#true} is VALID [2022-04-27 13:07:21,630 INFO L290 TraceCheckUtils]: 24: Hoare triple {1126#true} assume !(0 == ~cond); {1126#true} is VALID [2022-04-27 13:07:21,630 INFO L290 TraceCheckUtils]: 25: Hoare triple {1126#true} assume true; {1126#true} is VALID [2022-04-27 13:07:21,631 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1126#true} {1196#(<= 1 main_~x~0)} #100#return; {1196#(<= 1 main_~x~0)} is VALID [2022-04-27 13:07:21,631 INFO L290 TraceCheckUtils]: 27: Hoare triple {1196#(<= 1 main_~x~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {1215#(<= 1 main_~a~0)} is VALID [2022-04-27 13:07:21,632 INFO L290 TraceCheckUtils]: 28: Hoare triple {1215#(<= 1 main_~a~0)} assume !false; {1215#(<= 1 main_~a~0)} is VALID [2022-04-27 13:07:21,632 INFO L290 TraceCheckUtils]: 29: Hoare triple {1215#(<= 1 main_~a~0)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {1222#(<= 1 main_~c~0)} is VALID [2022-04-27 13:07:21,632 INFO L290 TraceCheckUtils]: 30: Hoare triple {1222#(<= 1 main_~c~0)} assume !false; {1222#(<= 1 main_~c~0)} is VALID [2022-04-27 13:07:21,633 INFO L290 TraceCheckUtils]: 31: Hoare triple {1222#(<= 1 main_~c~0)} assume !(~c~0 >= ~b~0); {1222#(<= 1 main_~c~0)} is VALID [2022-04-27 13:07:21,633 INFO L290 TraceCheckUtils]: 32: Hoare triple {1222#(<= 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; {1232#(<= 1 main_~b~0)} is VALID [2022-04-27 13:07:21,633 INFO L290 TraceCheckUtils]: 33: Hoare triple {1232#(<= 1 main_~b~0)} assume !false; {1232#(<= 1 main_~b~0)} is VALID [2022-04-27 13:07:21,634 INFO L290 TraceCheckUtils]: 34: Hoare triple {1232#(<= 1 main_~b~0)} assume !(0 != ~b~0); {1127#false} is VALID [2022-04-27 13:07:21,634 INFO L272 TraceCheckUtils]: 35: Hoare triple {1127#false} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {1127#false} is VALID [2022-04-27 13:07:21,634 INFO L290 TraceCheckUtils]: 36: Hoare triple {1127#false} ~cond := #in~cond; {1127#false} is VALID [2022-04-27 13:07:21,634 INFO L290 TraceCheckUtils]: 37: Hoare triple {1127#false} assume 0 == ~cond; {1127#false} is VALID [2022-04-27 13:07:21,634 INFO L290 TraceCheckUtils]: 38: Hoare triple {1127#false} assume !false; {1127#false} is VALID [2022-04-27 13:07:21,634 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-27 13:07:21,634 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:07:21,854 INFO L290 TraceCheckUtils]: 38: Hoare triple {1127#false} assume !false; {1127#false} is VALID [2022-04-27 13:07:21,854 INFO L290 TraceCheckUtils]: 37: Hoare triple {1127#false} assume 0 == ~cond; {1127#false} is VALID [2022-04-27 13:07:21,855 INFO L290 TraceCheckUtils]: 36: Hoare triple {1127#false} ~cond := #in~cond; {1127#false} is VALID [2022-04-27 13:07:21,855 INFO L272 TraceCheckUtils]: 35: Hoare triple {1127#false} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {1127#false} is VALID [2022-04-27 13:07:21,855 INFO L290 TraceCheckUtils]: 34: Hoare triple {1232#(<= 1 main_~b~0)} assume !(0 != ~b~0); {1127#false} is VALID [2022-04-27 13:07:21,856 INFO L290 TraceCheckUtils]: 33: Hoare triple {1232#(<= 1 main_~b~0)} assume !false; {1232#(<= 1 main_~b~0)} is VALID [2022-04-27 13:07:21,856 INFO L290 TraceCheckUtils]: 32: Hoare triple {1222#(<= 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; {1232#(<= 1 main_~b~0)} is VALID [2022-04-27 13:07:21,856 INFO L290 TraceCheckUtils]: 31: Hoare triple {1222#(<= 1 main_~c~0)} assume !(~c~0 >= ~b~0); {1222#(<= 1 main_~c~0)} is VALID [2022-04-27 13:07:21,857 INFO L290 TraceCheckUtils]: 30: Hoare triple {1222#(<= 1 main_~c~0)} assume !false; {1222#(<= 1 main_~c~0)} is VALID [2022-04-27 13:07:21,857 INFO L290 TraceCheckUtils]: 29: Hoare triple {1215#(<= 1 main_~a~0)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {1222#(<= 1 main_~c~0)} is VALID [2022-04-27 13:07:21,857 INFO L290 TraceCheckUtils]: 28: Hoare triple {1215#(<= 1 main_~a~0)} assume !false; {1215#(<= 1 main_~a~0)} is VALID [2022-04-27 13:07:21,858 INFO L290 TraceCheckUtils]: 27: Hoare triple {1196#(<= 1 main_~x~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {1215#(<= 1 main_~a~0)} is VALID [2022-04-27 13:07:21,858 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1126#true} {1196#(<= 1 main_~x~0)} #100#return; {1196#(<= 1 main_~x~0)} is VALID [2022-04-27 13:07:21,858 INFO L290 TraceCheckUtils]: 25: Hoare triple {1126#true} assume true; {1126#true} is VALID [2022-04-27 13:07:21,858 INFO L290 TraceCheckUtils]: 24: Hoare triple {1126#true} assume !(0 == ~cond); {1126#true} is VALID [2022-04-27 13:07:21,858 INFO L290 TraceCheckUtils]: 23: Hoare triple {1126#true} ~cond := #in~cond; {1126#true} is VALID [2022-04-27 13:07:21,858 INFO L272 TraceCheckUtils]: 22: Hoare triple {1196#(<= 1 main_~x~0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1126#true} is VALID [2022-04-27 13:07:21,859 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1189#(not (= |assume_abort_if_not_#in~cond| 0))} {1126#true} #98#return; {1196#(<= 1 main_~x~0)} is VALID [2022-04-27 13:07:21,859 INFO L290 TraceCheckUtils]: 20: Hoare triple {1189#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {1189#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 13:07:21,860 INFO L290 TraceCheckUtils]: 19: Hoare triple {1311#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} assume !(0 == ~cond); {1189#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 13:07:21,860 INFO L290 TraceCheckUtils]: 18: Hoare triple {1126#true} ~cond := #in~cond; {1311#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} is VALID [2022-04-27 13:07:21,860 INFO L272 TraceCheckUtils]: 17: Hoare triple {1126#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {1126#true} is VALID [2022-04-27 13:07:21,860 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1126#true} {1126#true} #96#return; {1126#true} is VALID [2022-04-27 13:07:21,860 INFO L290 TraceCheckUtils]: 15: Hoare triple {1126#true} assume true; {1126#true} is VALID [2022-04-27 13:07:21,860 INFO L290 TraceCheckUtils]: 14: Hoare triple {1126#true} assume !(0 == ~cond); {1126#true} is VALID [2022-04-27 13:07:21,860 INFO L290 TraceCheckUtils]: 13: Hoare triple {1126#true} ~cond := #in~cond; {1126#true} is VALID [2022-04-27 13:07:21,860 INFO L272 TraceCheckUtils]: 12: Hoare triple {1126#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 10 then 1 else 0)); {1126#true} is VALID [2022-04-27 13:07:21,860 INFO L290 TraceCheckUtils]: 11: Hoare triple {1126#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {1126#true} is VALID [2022-04-27 13:07:21,861 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1126#true} {1126#true} #94#return; {1126#true} is VALID [2022-04-27 13:07:21,861 INFO L290 TraceCheckUtils]: 9: Hoare triple {1126#true} assume true; {1126#true} is VALID [2022-04-27 13:07:21,861 INFO L290 TraceCheckUtils]: 8: Hoare triple {1126#true} assume !(0 == ~cond); {1126#true} is VALID [2022-04-27 13:07:21,861 INFO L290 TraceCheckUtils]: 7: Hoare triple {1126#true} ~cond := #in~cond; {1126#true} is VALID [2022-04-27 13:07:21,861 INFO L272 TraceCheckUtils]: 6: Hoare triple {1126#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 10 then 1 else 0)); {1126#true} is VALID [2022-04-27 13:07:21,861 INFO L290 TraceCheckUtils]: 5: Hoare triple {1126#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;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {1126#true} is VALID [2022-04-27 13:07:21,861 INFO L272 TraceCheckUtils]: 4: Hoare triple {1126#true} call #t~ret6 := main(); {1126#true} is VALID [2022-04-27 13:07:21,861 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1126#true} {1126#true} #112#return; {1126#true} is VALID [2022-04-27 13:07:21,861 INFO L290 TraceCheckUtils]: 2: Hoare triple {1126#true} assume true; {1126#true} is VALID [2022-04-27 13:07:21,861 INFO L290 TraceCheckUtils]: 1: Hoare triple {1126#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); {1126#true} is VALID [2022-04-27 13:07:21,861 INFO L272 TraceCheckUtils]: 0: Hoare triple {1126#true} call ULTIMATE.init(); {1126#true} is VALID [2022-04-27 13:07:21,861 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-27 13:07:21,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:07:21,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339959737] [2022-04-27 13:07:21,862 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:07:21,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1007831206] [2022-04-27 13:07:21,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1007831206] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 13:07:21,862 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 13:07:21,862 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2022-04-27 13:07:21,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253115569] [2022-04-27 13:07:21,862 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 13:07:21,863 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 3 states have call successors, (7), 2 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 39 [2022-04-27 13:07:21,863 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:07:21,863 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 3 states have call successors, (7), 2 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-27 13:07:21,888 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-27 13:07:21,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-27 13:07:21,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:07:21,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-27 13:07:21,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-04-27 13:07:21,889 INFO L87 Difference]: Start difference. First operand 50 states and 64 transitions. Second operand has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 3 states have call successors, (7), 2 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-27 13:07:22,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:07:22,445 INFO L93 Difference]: Finished difference Result 103 states and 143 transitions. [2022-04-27 13:07:22,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-27 13:07:22,446 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 3 states have call successors, (7), 2 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 39 [2022-04-27 13:07:22,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:07:22,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 3 states have call successors, (7), 2 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-27 13:07:22,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 108 transitions. [2022-04-27 13:07:22,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 3 states have call successors, (7), 2 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-27 13:07:22,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 108 transitions. [2022-04-27 13:07:22,450 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 108 transitions. [2022-04-27 13:07:22,523 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:07:22,525 INFO L225 Difference]: With dead ends: 103 [2022-04-27 13:07:22,525 INFO L226 Difference]: Without dead ends: 96 [2022-04-27 13:07:22,525 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 69 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-27 13:07:22,526 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 60 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 13:07:22,526 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 238 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 13:07:22,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-04-27 13:07:22,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 71. [2022-04-27 13:07:22,606 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:07:22,606 INFO L82 GeneralOperation]: Start isEquivalent. First operand 96 states. Second operand has 71 states, 47 states have (on average 1.2553191489361701) internal successors, (59), 48 states have internal predecessors, (59), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-27 13:07:22,606 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand has 71 states, 47 states have (on average 1.2553191489361701) internal successors, (59), 48 states have internal predecessors, (59), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-27 13:07:22,607 INFO L87 Difference]: Start difference. First operand 96 states. Second operand has 71 states, 47 states have (on average 1.2553191489361701) internal successors, (59), 48 states have internal predecessors, (59), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-27 13:07:22,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:07:22,610 INFO L93 Difference]: Finished difference Result 96 states and 136 transitions. [2022-04-27 13:07:22,610 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 136 transitions. [2022-04-27 13:07:22,611 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:07:22,611 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:07:22,611 INFO L74 IsIncluded]: Start isIncluded. First operand has 71 states, 47 states have (on average 1.2553191489361701) internal successors, (59), 48 states have internal predecessors, (59), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand 96 states. [2022-04-27 13:07:22,611 INFO L87 Difference]: Start difference. First operand has 71 states, 47 states have (on average 1.2553191489361701) internal successors, (59), 48 states have internal predecessors, (59), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand 96 states. [2022-04-27 13:07:22,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:07:22,616 INFO L93 Difference]: Finished difference Result 96 states and 136 transitions. [2022-04-27 13:07:22,616 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 136 transitions. [2022-04-27 13:07:22,616 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:07:22,616 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:07:22,616 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:07:22,616 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:07:22,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 47 states have (on average 1.2553191489361701) internal successors, (59), 48 states have internal predecessors, (59), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-27 13:07:22,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 95 transitions. [2022-04-27 13:07:22,619 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 95 transitions. Word has length 39 [2022-04-27 13:07:22,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:07:22,619 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 95 transitions. [2022-04-27 13:07:22,619 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 3 states have call successors, (7), 2 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-27 13:07:22,619 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 95 transitions. [2022-04-27 13:07:22,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-27 13:07:22,619 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:07:22,620 INFO L195 NwaCegarLoop]: 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, 1, 1, 1] [2022-04-27 13:07:22,643 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-04-27 13:07:22,846 WARN L477 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-27 13:07:22,846 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:07:22,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:07:22,847 INFO L85 PathProgramCache]: Analyzing trace with hash -1286298951, now seen corresponding path program 1 times [2022-04-27 13:07:22,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:07:22,847 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393132618] [2022-04-27 13:07:22,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:07:22,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:07:22,859 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:07:22,859 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [265249643] [2022-04-27 13:07:22,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:07:22,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:07:22,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:07:22,883 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 13:07:22,884 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-27 13:07:22,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:07:22,918 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-27 13:07:22,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:07:22,931 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:07:23,568 INFO L272 TraceCheckUtils]: 0: Hoare triple {1837#true} call ULTIMATE.init(); {1837#true} is VALID [2022-04-27 13:07:23,568 INFO L290 TraceCheckUtils]: 1: Hoare triple {1837#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); {1837#true} is VALID [2022-04-27 13:07:23,568 INFO L290 TraceCheckUtils]: 2: Hoare triple {1837#true} assume true; {1837#true} is VALID [2022-04-27 13:07:23,568 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1837#true} {1837#true} #112#return; {1837#true} is VALID [2022-04-27 13:07:23,568 INFO L272 TraceCheckUtils]: 4: Hoare triple {1837#true} call #t~ret6 := main(); {1837#true} is VALID [2022-04-27 13:07:23,569 INFO L290 TraceCheckUtils]: 5: Hoare triple {1837#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;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {1837#true} is VALID [2022-04-27 13:07:23,569 INFO L272 TraceCheckUtils]: 6: Hoare triple {1837#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 10 then 1 else 0)); {1837#true} is VALID [2022-04-27 13:07:23,569 INFO L290 TraceCheckUtils]: 7: Hoare triple {1837#true} ~cond := #in~cond; {1863#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 13:07:23,569 INFO L290 TraceCheckUtils]: 8: Hoare triple {1863#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {1867#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 13:07:23,570 INFO L290 TraceCheckUtils]: 9: Hoare triple {1867#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {1867#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 13:07:23,570 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1867#(not (= |assume_abort_if_not_#in~cond| 0))} {1837#true} #94#return; {1874#(and (<= main_~x~0 10) (<= 0 main_~x~0))} is VALID [2022-04-27 13:07:23,571 INFO L290 TraceCheckUtils]: 11: Hoare triple {1874#(and (<= main_~x~0 10) (<= 0 main_~x~0))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {1874#(and (<= main_~x~0 10) (<= 0 main_~x~0))} is VALID [2022-04-27 13:07:23,571 INFO L272 TraceCheckUtils]: 12: Hoare triple {1874#(and (<= main_~x~0 10) (<= 0 main_~x~0))} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 10 then 1 else 0)); {1837#true} is VALID [2022-04-27 13:07:23,571 INFO L290 TraceCheckUtils]: 13: Hoare triple {1837#true} ~cond := #in~cond; {1863#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 13:07:23,572 INFO L290 TraceCheckUtils]: 14: Hoare triple {1863#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {1867#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 13:07:23,572 INFO L290 TraceCheckUtils]: 15: Hoare triple {1867#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {1867#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 13:07:23,572 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1867#(not (= |assume_abort_if_not_#in~cond| 0))} {1874#(and (<= main_~x~0 10) (<= 0 main_~x~0))} #96#return; {1893#(and (<= 0 main_~y~0) (<= main_~y~0 10) (<= main_~x~0 10) (<= 0 main_~x~0))} is VALID [2022-04-27 13:07:23,573 INFO L272 TraceCheckUtils]: 17: Hoare triple {1893#(and (<= 0 main_~y~0) (<= main_~y~0 10) (<= main_~x~0 10) (<= 0 main_~x~0))} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {1837#true} is VALID [2022-04-27 13:07:23,573 INFO L290 TraceCheckUtils]: 18: Hoare triple {1837#true} ~cond := #in~cond; {1837#true} is VALID [2022-04-27 13:07:23,573 INFO L290 TraceCheckUtils]: 19: Hoare triple {1837#true} assume !(0 == ~cond); {1837#true} is VALID [2022-04-27 13:07:23,573 INFO L290 TraceCheckUtils]: 20: Hoare triple {1837#true} assume true; {1837#true} is VALID [2022-04-27 13:07:23,573 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1837#true} {1893#(and (<= 0 main_~y~0) (<= main_~y~0 10) (<= main_~x~0 10) (<= 0 main_~x~0))} #98#return; {1893#(and (<= 0 main_~y~0) (<= main_~y~0 10) (<= main_~x~0 10) (<= 0 main_~x~0))} is VALID [2022-04-27 13:07:23,573 INFO L272 TraceCheckUtils]: 22: Hoare triple {1893#(and (<= 0 main_~y~0) (<= main_~y~0 10) (<= main_~x~0 10) (<= 0 main_~x~0))} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1837#true} is VALID [2022-04-27 13:07:23,573 INFO L290 TraceCheckUtils]: 23: Hoare triple {1837#true} ~cond := #in~cond; {1837#true} is VALID [2022-04-27 13:07:23,574 INFO L290 TraceCheckUtils]: 24: Hoare triple {1837#true} assume !(0 == ~cond); {1837#true} is VALID [2022-04-27 13:07:23,574 INFO L290 TraceCheckUtils]: 25: Hoare triple {1837#true} assume true; {1837#true} is VALID [2022-04-27 13:07:23,574 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1837#true} {1893#(and (<= 0 main_~y~0) (<= main_~y~0 10) (<= main_~x~0 10) (<= 0 main_~x~0))} #100#return; {1893#(and (<= 0 main_~y~0) (<= main_~y~0 10) (<= main_~x~0 10) (<= 0 main_~x~0))} is VALID [2022-04-27 13:07:23,575 INFO L290 TraceCheckUtils]: 27: Hoare triple {1893#(and (<= 0 main_~y~0) (<= main_~y~0 10) (<= main_~x~0 10) (<= 0 main_~x~0))} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {1927#(and (<= 0 main_~y~0) (<= main_~y~0 10) (= main_~s~0 1) (<= main_~x~0 10) (<= 0 main_~x~0) (<= main_~a~0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-27 13:07:23,575 INFO L290 TraceCheckUtils]: 28: Hoare triple {1927#(and (<= 0 main_~y~0) (<= main_~y~0 10) (= main_~s~0 1) (<= main_~x~0 10) (<= 0 main_~x~0) (<= main_~a~0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} assume !false; {1927#(and (<= 0 main_~y~0) (<= main_~y~0 10) (= main_~s~0 1) (<= main_~x~0 10) (<= 0 main_~x~0) (<= main_~a~0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-27 13:07:23,576 INFO L290 TraceCheckUtils]: 29: Hoare triple {1927#(and (<= 0 main_~y~0) (<= main_~y~0 10) (= main_~s~0 1) (<= main_~x~0 10) (<= 0 main_~x~0) (<= main_~a~0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {1934#(and (<= 0 main_~y~0) (<= main_~c~0 main_~x~0) (<= main_~y~0 10) (= main_~s~0 1) (<= main_~x~0 10) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (not (= main_~b~0 0)) (= main_~q~0 0))} is VALID [2022-04-27 13:07:23,576 INFO L290 TraceCheckUtils]: 30: Hoare triple {1934#(and (<= 0 main_~y~0) (<= main_~c~0 main_~x~0) (<= main_~y~0 10) (= main_~s~0 1) (<= main_~x~0 10) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (not (= main_~b~0 0)) (= main_~q~0 0))} assume !false; {1934#(and (<= 0 main_~y~0) (<= main_~c~0 main_~x~0) (<= main_~y~0 10) (= main_~s~0 1) (<= main_~x~0 10) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (not (= main_~b~0 0)) (= main_~q~0 0))} is VALID [2022-04-27 13:07:23,583 INFO L290 TraceCheckUtils]: 31: Hoare triple {1934#(and (<= 0 main_~y~0) (<= main_~c~0 main_~x~0) (<= main_~y~0 10) (= main_~s~0 1) (<= main_~x~0 10) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (not (= main_~b~0 0)) (= main_~q~0 0))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {1941#(and (<= 0 main_~y~0) (<= main_~b~0 main_~x~0) (= main_~s~0 1) (<= main_~x~0 10) (= main_~b~0 main_~y~0) (not (= main_~b~0 0)) (= main_~q~0 0))} is VALID [2022-04-27 13:07:23,583 INFO L290 TraceCheckUtils]: 32: Hoare triple {1941#(and (<= 0 main_~y~0) (<= main_~b~0 main_~x~0) (= main_~s~0 1) (<= main_~x~0 10) (= main_~b~0 main_~y~0) (not (= main_~b~0 0)) (= main_~q~0 0))} assume !false; {1941#(and (<= 0 main_~y~0) (<= main_~b~0 main_~x~0) (= main_~s~0 1) (<= main_~x~0 10) (= main_~b~0 main_~y~0) (not (= main_~b~0 0)) (= main_~q~0 0))} is VALID [2022-04-27 13:07:23,583 INFO L272 TraceCheckUtils]: 33: Hoare triple {1941#(and (<= 0 main_~y~0) (<= main_~b~0 main_~x~0) (= main_~s~0 1) (<= main_~x~0 10) (= main_~b~0 main_~y~0) (not (= main_~b~0 0)) (= main_~q~0 0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {1837#true} is VALID [2022-04-27 13:07:23,583 INFO L290 TraceCheckUtils]: 34: Hoare triple {1837#true} ~cond := #in~cond; {1837#true} is VALID [2022-04-27 13:07:23,583 INFO L290 TraceCheckUtils]: 35: Hoare triple {1837#true} assume !(0 == ~cond); {1837#true} is VALID [2022-04-27 13:07:23,584 INFO L290 TraceCheckUtils]: 36: Hoare triple {1837#true} assume true; {1837#true} is VALID [2022-04-27 13:07:23,584 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {1837#true} {1941#(and (<= 0 main_~y~0) (<= main_~b~0 main_~x~0) (= main_~s~0 1) (<= main_~x~0 10) (= main_~b~0 main_~y~0) (not (= main_~b~0 0)) (= main_~q~0 0))} #102#return; {1941#(and (<= 0 main_~y~0) (<= main_~b~0 main_~x~0) (= main_~s~0 1) (<= main_~x~0 10) (= main_~b~0 main_~y~0) (not (= main_~b~0 0)) (= main_~q~0 0))} is VALID [2022-04-27 13:07:23,585 INFO L272 TraceCheckUtils]: 38: Hoare triple {1941#(and (<= 0 main_~y~0) (<= main_~b~0 main_~x~0) (= main_~s~0 1) (<= main_~x~0 10) (= main_~b~0 main_~y~0) (not (= main_~b~0 0)) (= main_~q~0 0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {1963#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:07:23,585 INFO L290 TraceCheckUtils]: 39: Hoare triple {1963#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1967#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:07:23,585 INFO L290 TraceCheckUtils]: 40: Hoare triple {1967#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1838#false} is VALID [2022-04-27 13:07:23,585 INFO L290 TraceCheckUtils]: 41: Hoare triple {1838#false} assume !false; {1838#false} is VALID [2022-04-27 13:07:23,587 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-27 13:07:23,587 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:07:23,849 INFO L290 TraceCheckUtils]: 41: Hoare triple {1838#false} assume !false; {1838#false} is VALID [2022-04-27 13:07:23,849 INFO L290 TraceCheckUtils]: 40: Hoare triple {1967#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1838#false} is VALID [2022-04-27 13:07:23,849 INFO L290 TraceCheckUtils]: 39: Hoare triple {1963#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1967#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:07:23,850 INFO L272 TraceCheckUtils]: 38: Hoare triple {1983#(= 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)); {1963#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:07:23,850 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {1837#true} {1983#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #102#return; {1983#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 13:07:23,850 INFO L290 TraceCheckUtils]: 36: Hoare triple {1837#true} assume true; {1837#true} is VALID [2022-04-27 13:07:23,851 INFO L290 TraceCheckUtils]: 35: Hoare triple {1837#true} assume !(0 == ~cond); {1837#true} is VALID [2022-04-27 13:07:23,851 INFO L290 TraceCheckUtils]: 34: Hoare triple {1837#true} ~cond := #in~cond; {1837#true} is VALID [2022-04-27 13:07:23,851 INFO L272 TraceCheckUtils]: 33: Hoare triple {1983#(= 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)); {1837#true} is VALID [2022-04-27 13:07:23,851 INFO L290 TraceCheckUtils]: 32: Hoare triple {1983#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !false; {1983#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 13:07:23,851 INFO L290 TraceCheckUtils]: 31: Hoare triple {2005#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (<= main_~b~0 main_~c~0)))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {1983#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 13:07:23,852 INFO L290 TraceCheckUtils]: 30: Hoare triple {2005#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (<= main_~b~0 main_~c~0)))} assume !false; {2005#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (<= main_~b~0 main_~c~0)))} is VALID [2022-04-27 13:07:23,852 INFO L290 TraceCheckUtils]: 29: Hoare triple {2012#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~b~0 0) (< main_~a~0 main_~b~0))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {2005#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (<= main_~b~0 main_~c~0)))} is VALID [2022-04-27 13:07:23,852 INFO L290 TraceCheckUtils]: 28: Hoare triple {2012#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~b~0 0) (< main_~a~0 main_~b~0))} assume !false; {2012#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~b~0 0) (< main_~a~0 main_~b~0))} is VALID [2022-04-27 13:07:23,853 INFO L290 TraceCheckUtils]: 27: Hoare triple {1837#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {2012#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~b~0 0) (< main_~a~0 main_~b~0))} is VALID [2022-04-27 13:07:23,853 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1837#true} {1837#true} #100#return; {1837#true} is VALID [2022-04-27 13:07:23,853 INFO L290 TraceCheckUtils]: 25: Hoare triple {1837#true} assume true; {1837#true} is VALID [2022-04-27 13:07:23,853 INFO L290 TraceCheckUtils]: 24: Hoare triple {1837#true} assume !(0 == ~cond); {1837#true} is VALID [2022-04-27 13:07:23,853 INFO L290 TraceCheckUtils]: 23: Hoare triple {1837#true} ~cond := #in~cond; {1837#true} is VALID [2022-04-27 13:07:23,853 INFO L272 TraceCheckUtils]: 22: Hoare triple {1837#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1837#true} is VALID [2022-04-27 13:07:23,853 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1837#true} {1837#true} #98#return; {1837#true} is VALID [2022-04-27 13:07:23,853 INFO L290 TraceCheckUtils]: 20: Hoare triple {1837#true} assume true; {1837#true} is VALID [2022-04-27 13:07:23,853 INFO L290 TraceCheckUtils]: 19: Hoare triple {1837#true} assume !(0 == ~cond); {1837#true} is VALID [2022-04-27 13:07:23,853 INFO L290 TraceCheckUtils]: 18: Hoare triple {1837#true} ~cond := #in~cond; {1837#true} is VALID [2022-04-27 13:07:23,853 INFO L272 TraceCheckUtils]: 17: Hoare triple {1837#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {1837#true} is VALID [2022-04-27 13:07:23,854 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1837#true} {1837#true} #96#return; {1837#true} is VALID [2022-04-27 13:07:23,854 INFO L290 TraceCheckUtils]: 15: Hoare triple {1837#true} assume true; {1837#true} is VALID [2022-04-27 13:07:23,854 INFO L290 TraceCheckUtils]: 14: Hoare triple {1837#true} assume !(0 == ~cond); {1837#true} is VALID [2022-04-27 13:07:23,854 INFO L290 TraceCheckUtils]: 13: Hoare triple {1837#true} ~cond := #in~cond; {1837#true} is VALID [2022-04-27 13:07:23,854 INFO L272 TraceCheckUtils]: 12: Hoare triple {1837#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 10 then 1 else 0)); {1837#true} is VALID [2022-04-27 13:07:23,854 INFO L290 TraceCheckUtils]: 11: Hoare triple {1837#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {1837#true} is VALID [2022-04-27 13:07:23,854 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1837#true} {1837#true} #94#return; {1837#true} is VALID [2022-04-27 13:07:23,854 INFO L290 TraceCheckUtils]: 9: Hoare triple {1837#true} assume true; {1837#true} is VALID [2022-04-27 13:07:23,854 INFO L290 TraceCheckUtils]: 8: Hoare triple {1837#true} assume !(0 == ~cond); {1837#true} is VALID [2022-04-27 13:07:23,854 INFO L290 TraceCheckUtils]: 7: Hoare triple {1837#true} ~cond := #in~cond; {1837#true} is VALID [2022-04-27 13:07:23,854 INFO L272 TraceCheckUtils]: 6: Hoare triple {1837#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 10 then 1 else 0)); {1837#true} is VALID [2022-04-27 13:07:23,854 INFO L290 TraceCheckUtils]: 5: Hoare triple {1837#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;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {1837#true} is VALID [2022-04-27 13:07:23,854 INFO L272 TraceCheckUtils]: 4: Hoare triple {1837#true} call #t~ret6 := main(); {1837#true} is VALID [2022-04-27 13:07:23,854 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1837#true} {1837#true} #112#return; {1837#true} is VALID [2022-04-27 13:07:23,855 INFO L290 TraceCheckUtils]: 2: Hoare triple {1837#true} assume true; {1837#true} is VALID [2022-04-27 13:07:23,855 INFO L290 TraceCheckUtils]: 1: Hoare triple {1837#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); {1837#true} is VALID [2022-04-27 13:07:23,855 INFO L272 TraceCheckUtils]: 0: Hoare triple {1837#true} call ULTIMATE.init(); {1837#true} is VALID [2022-04-27 13:07:23,855 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-27 13:07:23,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:07:23,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393132618] [2022-04-27 13:07:23,855 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:07:23,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [265249643] [2022-04-27 13:07:23,855 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [265249643] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-27 13:07:23,855 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-27 13:07:23,855 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [11] total 14 [2022-04-27 13:07:23,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694486580] [2022-04-27 13:07:23,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:07:23,856 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, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 42 [2022-04-27 13:07:23,856 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:07:23,856 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, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-27 13:07:23,875 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:07:23,875 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-27 13:07:23,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:07:23,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-27 13:07:23,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2022-04-27 13:07:23,876 INFO L87 Difference]: Start difference. First operand 71 states and 95 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, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-27 13:07:24,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:07:24,143 INFO L93 Difference]: Finished difference Result 79 states and 102 transitions. [2022-04-27 13:07:24,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 13:07:24,143 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, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 42 [2022-04-27 13:07:24,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:07:24,143 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, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-27 13:07:24,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 67 transitions. [2022-04-27 13:07:24,144 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, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-27 13:07:24,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 67 transitions. [2022-04-27 13:07:24,145 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 67 transitions. [2022-04-27 13:07:24,212 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:07:24,214 INFO L225 Difference]: With dead ends: 79 [2022-04-27 13:07:24,214 INFO L226 Difference]: Without dead ends: 77 [2022-04-27 13:07:24,215 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2022-04-27 13:07:24,216 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 27 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 13:07:24,216 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 169 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 13:07:24,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-04-27 13:07:24,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 75. [2022-04-27 13:07:24,281 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:07:24,282 INFO L82 GeneralOperation]: Start isEquivalent. First operand 77 states. Second operand has 75 states, 50 states have (on average 1.24) internal successors, (62), 51 states have internal predecessors, (62), 19 states have call successors, (19), 6 states have call predecessors, (19), 5 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-27 13:07:24,283 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand has 75 states, 50 states have (on average 1.24) internal successors, (62), 51 states have internal predecessors, (62), 19 states have call successors, (19), 6 states have call predecessors, (19), 5 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-27 13:07:24,283 INFO L87 Difference]: Start difference. First operand 77 states. Second operand has 75 states, 50 states have (on average 1.24) internal successors, (62), 51 states have internal predecessors, (62), 19 states have call successors, (19), 6 states have call predecessors, (19), 5 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-27 13:07:24,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:07:24,288 INFO L93 Difference]: Finished difference Result 77 states and 100 transitions. [2022-04-27 13:07:24,288 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 100 transitions. [2022-04-27 13:07:24,288 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:07:24,288 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:07:24,288 INFO L74 IsIncluded]: Start isIncluded. First operand has 75 states, 50 states have (on average 1.24) internal successors, (62), 51 states have internal predecessors, (62), 19 states have call successors, (19), 6 states have call predecessors, (19), 5 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand 77 states. [2022-04-27 13:07:24,289 INFO L87 Difference]: Start difference. First operand has 75 states, 50 states have (on average 1.24) internal successors, (62), 51 states have internal predecessors, (62), 19 states have call successors, (19), 6 states have call predecessors, (19), 5 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand 77 states. [2022-04-27 13:07:24,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:07:24,292 INFO L93 Difference]: Finished difference Result 77 states and 100 transitions. [2022-04-27 13:07:24,292 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 100 transitions. [2022-04-27 13:07:24,292 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:07:24,292 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:07:24,292 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:07:24,292 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:07:24,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 50 states have (on average 1.24) internal successors, (62), 51 states have internal predecessors, (62), 19 states have call successors, (19), 6 states have call predecessors, (19), 5 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-27 13:07:24,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 98 transitions. [2022-04-27 13:07:24,295 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 98 transitions. Word has length 42 [2022-04-27 13:07:24,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:07:24,295 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 98 transitions. [2022-04-27 13:07:24,295 INFO L496 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, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-27 13:07:24,295 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 98 transitions. [2022-04-27 13:07:24,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-27 13:07:24,296 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:07:24,296 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:07:24,312 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-27 13:07:24,511 WARN L477 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-27 13:07:24,511 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:07:24,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:07:24,512 INFO L85 PathProgramCache]: Analyzing trace with hash -974923140, now seen corresponding path program 1 times [2022-04-27 13:07:24,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:07:24,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924276643] [2022-04-27 13:07:24,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:07:24,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:07:24,526 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:07:24,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [20126822] [2022-04-27 13:07:24,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:07:24,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:07:24,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:07:24,527 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 13:07:24,528 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-27 13:07:24,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:07:24,561 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 30 conjunts are in the unsatisfiable core [2022-04-27 13:07:24,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:07:24,575 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:07:25,093 INFO L272 TraceCheckUtils]: 0: Hoare triple {2488#true} call ULTIMATE.init(); {2488#true} is VALID [2022-04-27 13:07:25,093 INFO L290 TraceCheckUtils]: 1: Hoare triple {2488#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); {2488#true} is VALID [2022-04-27 13:07:25,093 INFO L290 TraceCheckUtils]: 2: Hoare triple {2488#true} assume true; {2488#true} is VALID [2022-04-27 13:07:25,093 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2488#true} {2488#true} #112#return; {2488#true} is VALID [2022-04-27 13:07:25,094 INFO L272 TraceCheckUtils]: 4: Hoare triple {2488#true} call #t~ret6 := main(); {2488#true} is VALID [2022-04-27 13:07:25,094 INFO L290 TraceCheckUtils]: 5: Hoare triple {2488#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;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {2488#true} is VALID [2022-04-27 13:07:25,094 INFO L272 TraceCheckUtils]: 6: Hoare triple {2488#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 10 then 1 else 0)); {2488#true} is VALID [2022-04-27 13:07:25,094 INFO L290 TraceCheckUtils]: 7: Hoare triple {2488#true} ~cond := #in~cond; {2488#true} is VALID [2022-04-27 13:07:25,094 INFO L290 TraceCheckUtils]: 8: Hoare triple {2488#true} assume !(0 == ~cond); {2488#true} is VALID [2022-04-27 13:07:25,094 INFO L290 TraceCheckUtils]: 9: Hoare triple {2488#true} assume true; {2488#true} is VALID [2022-04-27 13:07:25,094 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2488#true} {2488#true} #94#return; {2488#true} is VALID [2022-04-27 13:07:25,094 INFO L290 TraceCheckUtils]: 11: Hoare triple {2488#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {2488#true} is VALID [2022-04-27 13:07:25,094 INFO L272 TraceCheckUtils]: 12: Hoare triple {2488#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 10 then 1 else 0)); {2488#true} is VALID [2022-04-27 13:07:25,095 INFO L290 TraceCheckUtils]: 13: Hoare triple {2488#true} ~cond := #in~cond; {2532#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 13:07:25,095 INFO L290 TraceCheckUtils]: 14: Hoare triple {2532#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {2536#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 13:07:25,095 INFO L290 TraceCheckUtils]: 15: Hoare triple {2536#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {2536#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 13:07:25,096 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2536#(not (= |assume_abort_if_not_#in~cond| 0))} {2488#true} #96#return; {2543#(and (<= 0 main_~y~0) (<= main_~y~0 10))} is VALID [2022-04-27 13:07:25,096 INFO L272 TraceCheckUtils]: 17: Hoare triple {2543#(and (<= 0 main_~y~0) (<= main_~y~0 10))} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {2488#true} is VALID [2022-04-27 13:07:25,096 INFO L290 TraceCheckUtils]: 18: Hoare triple {2488#true} ~cond := #in~cond; {2532#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 13:07:25,096 INFO L290 TraceCheckUtils]: 19: Hoare triple {2532#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {2536#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 13:07:25,097 INFO L290 TraceCheckUtils]: 20: Hoare triple {2536#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {2536#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 13:07:25,097 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2536#(not (= |assume_abort_if_not_#in~cond| 0))} {2543#(and (<= 0 main_~y~0) (<= main_~y~0 10))} #98#return; {2559#(and (<= 0 main_~y~0) (<= 1 main_~x~0) (<= main_~y~0 10))} is VALID [2022-04-27 13:07:25,097 INFO L272 TraceCheckUtils]: 22: Hoare triple {2559#(and (<= 0 main_~y~0) (<= 1 main_~x~0) (<= main_~y~0 10))} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {2488#true} is VALID [2022-04-27 13:07:25,097 INFO L290 TraceCheckUtils]: 23: Hoare triple {2488#true} ~cond := #in~cond; {2488#true} is VALID [2022-04-27 13:07:25,097 INFO L290 TraceCheckUtils]: 24: Hoare triple {2488#true} assume !(0 == ~cond); {2488#true} is VALID [2022-04-27 13:07:25,097 INFO L290 TraceCheckUtils]: 25: Hoare triple {2488#true} assume true; {2488#true} is VALID [2022-04-27 13:07:25,098 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {2488#true} {2559#(and (<= 0 main_~y~0) (<= 1 main_~x~0) (<= main_~y~0 10))} #100#return; {2559#(and (<= 0 main_~y~0) (<= 1 main_~x~0) (<= main_~y~0 10))} is VALID [2022-04-27 13:07:25,098 INFO L290 TraceCheckUtils]: 27: Hoare triple {2559#(and (<= 0 main_~y~0) (<= 1 main_~x~0) (<= main_~y~0 10))} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {2578#(and (<= 0 main_~y~0) (<= 1 main_~x~0) (<= main_~y~0 10) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= main_~x~0 main_~a~0))} is VALID [2022-04-27 13:07:25,098 INFO L290 TraceCheckUtils]: 28: Hoare triple {2578#(and (<= 0 main_~y~0) (<= 1 main_~x~0) (<= main_~y~0 10) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= main_~x~0 main_~a~0))} assume !false; {2578#(and (<= 0 main_~y~0) (<= 1 main_~x~0) (<= main_~y~0 10) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= main_~x~0 main_~a~0))} is VALID [2022-04-27 13:07:25,099 INFO L290 TraceCheckUtils]: 29: Hoare triple {2578#(and (<= 0 main_~y~0) (<= 1 main_~x~0) (<= main_~y~0 10) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= main_~x~0 main_~a~0))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {2585#(and (<= 0 main_~y~0) (<= 1 main_~x~0) (<= main_~y~0 10) (= main_~s~0 1) (<= main_~x~0 main_~c~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-27 13:07:25,099 INFO L290 TraceCheckUtils]: 30: Hoare triple {2585#(and (<= 0 main_~y~0) (<= 1 main_~x~0) (<= main_~y~0 10) (= main_~s~0 1) (<= main_~x~0 main_~c~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} assume !false; {2585#(and (<= 0 main_~y~0) (<= 1 main_~x~0) (<= main_~y~0 10) (= main_~s~0 1) (<= main_~x~0 main_~c~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-27 13:07:25,100 INFO L290 TraceCheckUtils]: 31: Hoare triple {2585#(and (<= 0 main_~y~0) (<= 1 main_~x~0) (<= main_~y~0 10) (= main_~s~0 1) (<= main_~x~0 main_~c~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} assume !(~c~0 >= ~b~0); {2592#(and (<= 1 main_~x~0) (<= main_~y~0 10) (< main_~x~0 main_~b~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-27 13:07:25,100 INFO L290 TraceCheckUtils]: 32: Hoare triple {2592#(and (<= 1 main_~x~0) (<= main_~y~0 10) (< main_~x~0 main_~b~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~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; {2596#(and (<= 1 main_~x~0) (<= main_~y~0 10) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (< main_~x~0 main_~a~0))} is VALID [2022-04-27 13:07:25,101 INFO L290 TraceCheckUtils]: 33: Hoare triple {2596#(and (<= 1 main_~x~0) (<= main_~y~0 10) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (< main_~x~0 main_~a~0))} assume !false; {2596#(and (<= 1 main_~x~0) (<= main_~y~0 10) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (< main_~x~0 main_~a~0))} is VALID [2022-04-27 13:07:25,101 INFO L290 TraceCheckUtils]: 34: Hoare triple {2596#(and (<= 1 main_~x~0) (<= main_~y~0 10) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (< main_~x~0 main_~a~0))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {2596#(and (<= 1 main_~x~0) (<= main_~y~0 10) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (< main_~x~0 main_~a~0))} is VALID [2022-04-27 13:07:25,101 INFO L290 TraceCheckUtils]: 35: Hoare triple {2596#(and (<= 1 main_~x~0) (<= main_~y~0 10) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (< main_~x~0 main_~a~0))} assume !false; {2596#(and (<= 1 main_~x~0) (<= main_~y~0 10) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (< main_~x~0 main_~a~0))} is VALID [2022-04-27 13:07:25,102 INFO L290 TraceCheckUtils]: 36: Hoare triple {2596#(and (<= 1 main_~x~0) (<= main_~y~0 10) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (< main_~x~0 main_~a~0))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {2596#(and (<= 1 main_~x~0) (<= main_~y~0 10) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (< main_~x~0 main_~a~0))} is VALID [2022-04-27 13:07:25,102 INFO L290 TraceCheckUtils]: 37: Hoare triple {2596#(and (<= 1 main_~x~0) (<= main_~y~0 10) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (< main_~x~0 main_~a~0))} assume !false; {2596#(and (<= 1 main_~x~0) (<= main_~y~0 10) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (< main_~x~0 main_~a~0))} is VALID [2022-04-27 13:07:25,103 INFO L272 TraceCheckUtils]: 38: Hoare triple {2596#(and (<= 1 main_~x~0) (<= main_~y~0 10) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (< main_~x~0 main_~a~0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {2615#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:07:25,103 INFO L290 TraceCheckUtils]: 39: Hoare triple {2615#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2619#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:07:25,103 INFO L290 TraceCheckUtils]: 40: Hoare triple {2619#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2489#false} is VALID [2022-04-27 13:07:25,103 INFO L290 TraceCheckUtils]: 41: Hoare triple {2489#false} assume !false; {2489#false} is VALID [2022-04-27 13:07:25,103 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-27 13:07:25,104 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:07:25,433 INFO L290 TraceCheckUtils]: 41: Hoare triple {2489#false} assume !false; {2489#false} is VALID [2022-04-27 13:07:25,434 INFO L290 TraceCheckUtils]: 40: Hoare triple {2619#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2489#false} is VALID [2022-04-27 13:07:25,434 INFO L290 TraceCheckUtils]: 39: Hoare triple {2615#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2619#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:07:25,435 INFO L272 TraceCheckUtils]: 38: Hoare triple {2635#(= 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)); {2615#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:07:25,435 INFO L290 TraceCheckUtils]: 37: Hoare triple {2635#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !false; {2635#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 13:07:25,435 INFO L290 TraceCheckUtils]: 36: Hoare triple {2635#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {2635#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 13:07:25,436 INFO L290 TraceCheckUtils]: 35: Hoare triple {2635#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !false; {2635#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 13:07:25,436 INFO L290 TraceCheckUtils]: 34: Hoare triple {2635#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {2635#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 13:07:25,436 INFO L290 TraceCheckUtils]: 33: Hoare triple {2635#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !false; {2635#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 13:07:25,438 INFO L290 TraceCheckUtils]: 32: Hoare triple {2654#(= 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; {2635#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 13:07:25,439 INFO L290 TraceCheckUtils]: 31: Hoare triple {2658#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (<= main_~b~0 main_~c~0))} assume !(~c~0 >= ~b~0); {2654#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 13:07:25,443 INFO L290 TraceCheckUtils]: 30: Hoare triple {2658#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (<= main_~b~0 main_~c~0))} assume !false; {2658#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (<= main_~b~0 main_~c~0))} is VALID [2022-04-27 13:07:25,445 INFO L290 TraceCheckUtils]: 29: Hoare triple {2665#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (<= main_~b~0 main_~a~0))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {2658#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (<= main_~b~0 main_~c~0))} is VALID [2022-04-27 13:07:25,445 INFO L290 TraceCheckUtils]: 28: Hoare triple {2665#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (<= main_~b~0 main_~a~0))} assume !false; {2665#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (<= main_~b~0 main_~a~0))} is VALID [2022-04-27 13:07:25,445 INFO L290 TraceCheckUtils]: 27: Hoare triple {2488#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {2665#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (<= main_~b~0 main_~a~0))} is VALID [2022-04-27 13:07:25,445 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {2488#true} {2488#true} #100#return; {2488#true} is VALID [2022-04-27 13:07:25,445 INFO L290 TraceCheckUtils]: 25: Hoare triple {2488#true} assume true; {2488#true} is VALID [2022-04-27 13:07:25,446 INFO L290 TraceCheckUtils]: 24: Hoare triple {2488#true} assume !(0 == ~cond); {2488#true} is VALID [2022-04-27 13:07:25,446 INFO L290 TraceCheckUtils]: 23: Hoare triple {2488#true} ~cond := #in~cond; {2488#true} is VALID [2022-04-27 13:07:25,446 INFO L272 TraceCheckUtils]: 22: Hoare triple {2488#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {2488#true} is VALID [2022-04-27 13:07:25,446 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2488#true} {2488#true} #98#return; {2488#true} is VALID [2022-04-27 13:07:25,446 INFO L290 TraceCheckUtils]: 20: Hoare triple {2488#true} assume true; {2488#true} is VALID [2022-04-27 13:07:25,446 INFO L290 TraceCheckUtils]: 19: Hoare triple {2488#true} assume !(0 == ~cond); {2488#true} is VALID [2022-04-27 13:07:25,446 INFO L290 TraceCheckUtils]: 18: Hoare triple {2488#true} ~cond := #in~cond; {2488#true} is VALID [2022-04-27 13:07:25,446 INFO L272 TraceCheckUtils]: 17: Hoare triple {2488#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {2488#true} is VALID [2022-04-27 13:07:25,446 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2488#true} {2488#true} #96#return; {2488#true} is VALID [2022-04-27 13:07:25,446 INFO L290 TraceCheckUtils]: 15: Hoare triple {2488#true} assume true; {2488#true} is VALID [2022-04-27 13:07:25,446 INFO L290 TraceCheckUtils]: 14: Hoare triple {2488#true} assume !(0 == ~cond); {2488#true} is VALID [2022-04-27 13:07:25,446 INFO L290 TraceCheckUtils]: 13: Hoare triple {2488#true} ~cond := #in~cond; {2488#true} is VALID [2022-04-27 13:07:25,446 INFO L272 TraceCheckUtils]: 12: Hoare triple {2488#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 10 then 1 else 0)); {2488#true} is VALID [2022-04-27 13:07:25,446 INFO L290 TraceCheckUtils]: 11: Hoare triple {2488#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {2488#true} is VALID [2022-04-27 13:07:25,446 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2488#true} {2488#true} #94#return; {2488#true} is VALID [2022-04-27 13:07:25,446 INFO L290 TraceCheckUtils]: 9: Hoare triple {2488#true} assume true; {2488#true} is VALID [2022-04-27 13:07:25,447 INFO L290 TraceCheckUtils]: 8: Hoare triple {2488#true} assume !(0 == ~cond); {2488#true} is VALID [2022-04-27 13:07:25,447 INFO L290 TraceCheckUtils]: 7: Hoare triple {2488#true} ~cond := #in~cond; {2488#true} is VALID [2022-04-27 13:07:25,447 INFO L272 TraceCheckUtils]: 6: Hoare triple {2488#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 10 then 1 else 0)); {2488#true} is VALID [2022-04-27 13:07:25,447 INFO L290 TraceCheckUtils]: 5: Hoare triple {2488#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;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {2488#true} is VALID [2022-04-27 13:07:25,447 INFO L272 TraceCheckUtils]: 4: Hoare triple {2488#true} call #t~ret6 := main(); {2488#true} is VALID [2022-04-27 13:07:25,447 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2488#true} {2488#true} #112#return; {2488#true} is VALID [2022-04-27 13:07:25,447 INFO L290 TraceCheckUtils]: 2: Hoare triple {2488#true} assume true; {2488#true} is VALID [2022-04-27 13:07:25,447 INFO L290 TraceCheckUtils]: 1: Hoare triple {2488#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); {2488#true} is VALID [2022-04-27 13:07:25,447 INFO L272 TraceCheckUtils]: 0: Hoare triple {2488#true} call ULTIMATE.init(); {2488#true} is VALID [2022-04-27 13:07:25,447 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-27 13:07:25,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:07:25,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924276643] [2022-04-27 13:07:25,447 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:07:25,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [20126822] [2022-04-27 13:07:25,447 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [20126822] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 13:07:25,447 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 13:07:25,448 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 16 [2022-04-27 13:07:25,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78775397] [2022-04-27 13:07:25,448 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 13:07:25,448 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 13 states have internal predecessors, (35), 5 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 42 [2022-04-27 13:07:25,448 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:07:25,448 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 13 states have internal predecessors, (35), 5 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-27 13:07:25,501 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:07:25,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-27 13:07:25,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:07:25,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-27 13:07:25,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2022-04-27 13:07:25,502 INFO L87 Difference]: Start difference. First operand 75 states and 98 transitions. Second operand has 16 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 13 states have internal predecessors, (35), 5 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-27 13:07:31,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:07:31,108 INFO L93 Difference]: Finished difference Result 118 states and 159 transitions. [2022-04-27 13:07:31,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-27 13:07:31,109 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 13 states have internal predecessors, (35), 5 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 42 [2022-04-27 13:07:31,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:07:31,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 13 states have internal predecessors, (35), 5 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-27 13:07:31,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 121 transitions. [2022-04-27 13:07:31,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 13 states have internal predecessors, (35), 5 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-27 13:07:31,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 121 transitions. [2022-04-27 13:07:31,113 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 121 transitions. [2022-04-27 13:07:31,213 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 121 edges. 121 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:07:31,215 INFO L225 Difference]: With dead ends: 118 [2022-04-27 13:07:31,215 INFO L226 Difference]: Without dead ends: 116 [2022-04-27 13:07:31,215 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=132, Invalid=468, Unknown=0, NotChecked=0, Total=600 [2022-04-27 13:07:31,216 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 95 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-04-27 13:07:31,216 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 258 Invalid, 479 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 385 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-04-27 13:07:31,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-04-27 13:07:31,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 105. [2022-04-27 13:07:31,354 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:07:31,355 INFO L82 GeneralOperation]: Start isEquivalent. First operand 116 states. Second operand has 105 states, 71 states have (on average 1.2535211267605635) internal successors, (89), 72 states have internal predecessors, (89), 27 states have call successors, (27), 7 states have call predecessors, (27), 6 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-27 13:07:31,355 INFO L74 IsIncluded]: Start isIncluded. First operand 116 states. Second operand has 105 states, 71 states have (on average 1.2535211267605635) internal successors, (89), 72 states have internal predecessors, (89), 27 states have call successors, (27), 7 states have call predecessors, (27), 6 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-27 13:07:31,355 INFO L87 Difference]: Start difference. First operand 116 states. Second operand has 105 states, 71 states have (on average 1.2535211267605635) internal successors, (89), 72 states have internal predecessors, (89), 27 states have call successors, (27), 7 states have call predecessors, (27), 6 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-27 13:07:31,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:07:31,358 INFO L93 Difference]: Finished difference Result 116 states and 157 transitions. [2022-04-27 13:07:31,358 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 157 transitions. [2022-04-27 13:07:31,359 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:07:31,359 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:07:31,359 INFO L74 IsIncluded]: Start isIncluded. First operand has 105 states, 71 states have (on average 1.2535211267605635) internal successors, (89), 72 states have internal predecessors, (89), 27 states have call successors, (27), 7 states have call predecessors, (27), 6 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand 116 states. [2022-04-27 13:07:31,359 INFO L87 Difference]: Start difference. First operand has 105 states, 71 states have (on average 1.2535211267605635) internal successors, (89), 72 states have internal predecessors, (89), 27 states have call successors, (27), 7 states have call predecessors, (27), 6 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand 116 states. [2022-04-27 13:07:31,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:07:31,362 INFO L93 Difference]: Finished difference Result 116 states and 157 transitions. [2022-04-27 13:07:31,362 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 157 transitions. [2022-04-27 13:07:31,363 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:07:31,363 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:07:31,363 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:07:31,363 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:07:31,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 71 states have (on average 1.2535211267605635) internal successors, (89), 72 states have internal predecessors, (89), 27 states have call successors, (27), 7 states have call predecessors, (27), 6 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-27 13:07:31,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 141 transitions. [2022-04-27 13:07:31,366 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 141 transitions. Word has length 42 [2022-04-27 13:07:31,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:07:31,366 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 141 transitions. [2022-04-27 13:07:31,366 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 13 states have internal predecessors, (35), 5 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-27 13:07:31,366 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 141 transitions. [2022-04-27 13:07:31,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-27 13:07:31,366 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:07:31,366 INFO L195 NwaCegarLoop]: 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, 1, 1, 1] [2022-04-27 13:07:31,403 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-27 13:07:31,567 WARN L477 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-27 13:07:31,567 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:07:31,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:07:31,568 INFO L85 PathProgramCache]: Analyzing trace with hash 81990170, now seen corresponding path program 1 times [2022-04-27 13:07:31,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:07:31,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149014997] [2022-04-27 13:07:31,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:07:31,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:07:31,579 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:07:31,579 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [324359272] [2022-04-27 13:07:31,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:07:31,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:07:31,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:07:31,584 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 13:07:31,585 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-27 13:07:31,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:07:31,619 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 13:07:31,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:07:31,626 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:07:33,799 INFO L272 TraceCheckUtils]: 0: Hoare triple {3342#true} call ULTIMATE.init(); {3342#true} is VALID [2022-04-27 13:07:33,800 INFO L290 TraceCheckUtils]: 1: Hoare triple {3342#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); {3342#true} is VALID [2022-04-27 13:07:33,800 INFO L290 TraceCheckUtils]: 2: Hoare triple {3342#true} assume true; {3342#true} is VALID [2022-04-27 13:07:33,800 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3342#true} {3342#true} #112#return; {3342#true} is VALID [2022-04-27 13:07:33,800 INFO L272 TraceCheckUtils]: 4: Hoare triple {3342#true} call #t~ret6 := main(); {3342#true} is VALID [2022-04-27 13:07:33,800 INFO L290 TraceCheckUtils]: 5: Hoare triple {3342#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;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {3342#true} is VALID [2022-04-27 13:07:33,800 INFO L272 TraceCheckUtils]: 6: Hoare triple {3342#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 10 then 1 else 0)); {3342#true} is VALID [2022-04-27 13:07:33,800 INFO L290 TraceCheckUtils]: 7: Hoare triple {3342#true} ~cond := #in~cond; {3342#true} is VALID [2022-04-27 13:07:33,800 INFO L290 TraceCheckUtils]: 8: Hoare triple {3342#true} assume !(0 == ~cond); {3342#true} is VALID [2022-04-27 13:07:33,800 INFO L290 TraceCheckUtils]: 9: Hoare triple {3342#true} assume true; {3342#true} is VALID [2022-04-27 13:07:33,800 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3342#true} {3342#true} #94#return; {3342#true} is VALID [2022-04-27 13:07:33,801 INFO L290 TraceCheckUtils]: 11: Hoare triple {3342#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {3342#true} is VALID [2022-04-27 13:07:33,801 INFO L272 TraceCheckUtils]: 12: Hoare triple {3342#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 10 then 1 else 0)); {3342#true} is VALID [2022-04-27 13:07:33,801 INFO L290 TraceCheckUtils]: 13: Hoare triple {3342#true} ~cond := #in~cond; {3342#true} is VALID [2022-04-27 13:07:33,801 INFO L290 TraceCheckUtils]: 14: Hoare triple {3342#true} assume !(0 == ~cond); {3342#true} is VALID [2022-04-27 13:07:33,801 INFO L290 TraceCheckUtils]: 15: Hoare triple {3342#true} assume true; {3342#true} is VALID [2022-04-27 13:07:33,801 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3342#true} {3342#true} #96#return; {3342#true} is VALID [2022-04-27 13:07:33,801 INFO L272 TraceCheckUtils]: 17: Hoare triple {3342#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {3342#true} is VALID [2022-04-27 13:07:33,801 INFO L290 TraceCheckUtils]: 18: Hoare triple {3342#true} ~cond := #in~cond; {3342#true} is VALID [2022-04-27 13:07:33,801 INFO L290 TraceCheckUtils]: 19: Hoare triple {3342#true} assume !(0 == ~cond); {3342#true} is VALID [2022-04-27 13:07:33,801 INFO L290 TraceCheckUtils]: 20: Hoare triple {3342#true} assume true; {3342#true} is VALID [2022-04-27 13:07:33,801 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {3342#true} {3342#true} #98#return; {3342#true} is VALID [2022-04-27 13:07:33,801 INFO L272 TraceCheckUtils]: 22: Hoare triple {3342#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {3342#true} is VALID [2022-04-27 13:07:33,801 INFO L290 TraceCheckUtils]: 23: Hoare triple {3342#true} ~cond := #in~cond; {3342#true} is VALID [2022-04-27 13:07:33,801 INFO L290 TraceCheckUtils]: 24: Hoare triple {3342#true} assume !(0 == ~cond); {3342#true} is VALID [2022-04-27 13:07:33,802 INFO L290 TraceCheckUtils]: 25: Hoare triple {3342#true} assume true; {3342#true} is VALID [2022-04-27 13:07:33,802 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {3342#true} {3342#true} #100#return; {3342#true} is VALID [2022-04-27 13:07:33,802 INFO L290 TraceCheckUtils]: 27: Hoare triple {3342#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {3342#true} is VALID [2022-04-27 13:07:33,802 INFO L290 TraceCheckUtils]: 28: Hoare triple {3342#true} assume !false; {3342#true} is VALID [2022-04-27 13:07:33,802 INFO L290 TraceCheckUtils]: 29: Hoare triple {3342#true} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {3434#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} is VALID [2022-04-27 13:07:33,802 INFO L290 TraceCheckUtils]: 30: Hoare triple {3434#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} assume !false; {3434#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} is VALID [2022-04-27 13:07:33,803 INFO L290 TraceCheckUtils]: 31: Hoare triple {3434#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {3434#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} is VALID [2022-04-27 13:07:33,803 INFO L290 TraceCheckUtils]: 32: Hoare triple {3434#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} assume !false; {3434#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} is VALID [2022-04-27 13:07:33,803 INFO L272 TraceCheckUtils]: 33: Hoare triple {3434#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {3342#true} is VALID [2022-04-27 13:07:33,803 INFO L290 TraceCheckUtils]: 34: Hoare triple {3342#true} ~cond := #in~cond; {3342#true} is VALID [2022-04-27 13:07:33,803 INFO L290 TraceCheckUtils]: 35: Hoare triple {3342#true} assume !(0 == ~cond); {3342#true} is VALID [2022-04-27 13:07:33,803 INFO L290 TraceCheckUtils]: 36: Hoare triple {3342#true} assume true; {3342#true} is VALID [2022-04-27 13:07:33,804 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {3342#true} {3434#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} #102#return; {3434#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} is VALID [2022-04-27 13:07:33,804 INFO L272 TraceCheckUtils]: 38: Hoare triple {3434#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {3342#true} is VALID [2022-04-27 13:07:33,804 INFO L290 TraceCheckUtils]: 39: Hoare triple {3342#true} ~cond := #in~cond; {3342#true} is VALID [2022-04-27 13:07:33,804 INFO L290 TraceCheckUtils]: 40: Hoare triple {3342#true} assume !(0 == ~cond); {3342#true} is VALID [2022-04-27 13:07:33,804 INFO L290 TraceCheckUtils]: 41: Hoare triple {3342#true} assume true; {3342#true} is VALID [2022-04-27 13:07:33,805 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {3342#true} {3434#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} #104#return; {3434#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} is VALID [2022-04-27 13:07:33,806 INFO L272 TraceCheckUtils]: 43: Hoare triple {3434#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {3477#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:07:33,806 INFO L290 TraceCheckUtils]: 44: Hoare triple {3477#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3481#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:07:33,806 INFO L290 TraceCheckUtils]: 45: Hoare triple {3481#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3343#false} is VALID [2022-04-27 13:07:33,806 INFO L290 TraceCheckUtils]: 46: Hoare triple {3343#false} assume !false; {3343#false} is VALID [2022-04-27 13:07:33,807 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-27 13:07:33,807 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 13:07:33,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:07:33,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149014997] [2022-04-27 13:07:33,807 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:07:33,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [324359272] [2022-04-27 13:07:33,807 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [324359272] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:07:33,807 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:07:33,807 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 13:07:33,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814937460] [2022-04-27 13:07:33,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:07:33,808 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 47 [2022-04-27 13:07:33,808 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:07:33,808 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-27 13:07:33,840 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-27 13:07:33,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 13:07:33,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:07:33,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 13:07:33,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 13:07:33,841 INFO L87 Difference]: Start difference. First operand 105 states and 141 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-27 13:07:34,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:07:34,196 INFO L93 Difference]: Finished difference Result 151 states and 213 transitions. [2022-04-27 13:07:34,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 13:07:34,197 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 47 [2022-04-27 13:07:34,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:07:34,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-27 13:07:34,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-04-27 13:07:34,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-27 13:07:34,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-04-27 13:07:34,199 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 65 transitions. [2022-04-27 13:07:34,239 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:07:34,241 INFO L225 Difference]: With dead ends: 151 [2022-04-27 13:07:34,241 INFO L226 Difference]: Without dead ends: 149 [2022-04-27 13:07:34,241 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 13:07:34,242 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 8 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 13:07:34,242 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 146 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 13:07:34,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2022-04-27 13:07:34,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 143. [2022-04-27 13:07:34,463 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:07:34,463 INFO L82 GeneralOperation]: Start isEquivalent. First operand 149 states. Second operand has 143 states, 88 states have (on average 1.2840909090909092) internal successors, (113), 89 states have internal predecessors, (113), 47 states have call successors, (47), 8 states have call predecessors, (47), 7 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2022-04-27 13:07:34,464 INFO L74 IsIncluded]: Start isIncluded. First operand 149 states. Second operand has 143 states, 88 states have (on average 1.2840909090909092) internal successors, (113), 89 states have internal predecessors, (113), 47 states have call successors, (47), 8 states have call predecessors, (47), 7 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2022-04-27 13:07:34,464 INFO L87 Difference]: Start difference. First operand 149 states. Second operand has 143 states, 88 states have (on average 1.2840909090909092) internal successors, (113), 89 states have internal predecessors, (113), 47 states have call successors, (47), 8 states have call predecessors, (47), 7 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2022-04-27 13:07:34,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:07:34,468 INFO L93 Difference]: Finished difference Result 149 states and 211 transitions. [2022-04-27 13:07:34,468 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 211 transitions. [2022-04-27 13:07:34,468 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:07:34,468 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:07:34,469 INFO L74 IsIncluded]: Start isIncluded. First operand has 143 states, 88 states have (on average 1.2840909090909092) internal successors, (113), 89 states have internal predecessors, (113), 47 states have call successors, (47), 8 states have call predecessors, (47), 7 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) Second operand 149 states. [2022-04-27 13:07:34,469 INFO L87 Difference]: Start difference. First operand has 143 states, 88 states have (on average 1.2840909090909092) internal successors, (113), 89 states have internal predecessors, (113), 47 states have call successors, (47), 8 states have call predecessors, (47), 7 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) Second operand 149 states. [2022-04-27 13:07:34,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:07:34,476 INFO L93 Difference]: Finished difference Result 149 states and 211 transitions. [2022-04-27 13:07:34,476 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 211 transitions. [2022-04-27 13:07:34,477 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:07:34,477 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:07:34,477 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:07:34,477 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:07:34,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 88 states have (on average 1.2840909090909092) internal successors, (113), 89 states have internal predecessors, (113), 47 states have call successors, (47), 8 states have call predecessors, (47), 7 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2022-04-27 13:07:34,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 205 transitions. [2022-04-27 13:07:34,482 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 205 transitions. Word has length 47 [2022-04-27 13:07:34,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:07:34,482 INFO L495 AbstractCegarLoop]: Abstraction has 143 states and 205 transitions. [2022-04-27 13:07:34,482 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-27 13:07:34,482 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 205 transitions. [2022-04-27 13:07:34,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-27 13:07:34,483 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:07:34,483 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1] [2022-04-27 13:07:34,501 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-27 13:07:34,696 WARN L477 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-27 13:07:34,696 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:07:34,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:07:34,696 INFO L85 PathProgramCache]: Analyzing trace with hash 1524769911, now seen corresponding path program 1 times [2022-04-27 13:07:34,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:07:34,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874772533] [2022-04-27 13:07:34,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:07:34,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:07:34,708 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:07:34,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [967636968] [2022-04-27 13:07:34,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:07:34,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:07:34,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:07:34,733 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 13:07:34,760 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-27 13:07:34,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:07:34,794 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 37 conjunts are in the unsatisfiable core [2022-04-27 13:07:34,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:07:34,806 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:07:35,231 INFO L272 TraceCheckUtils]: 0: Hoare triple {4245#true} call ULTIMATE.init(); {4245#true} is VALID [2022-04-27 13:07:35,232 INFO L290 TraceCheckUtils]: 1: Hoare triple {4245#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); {4245#true} is VALID [2022-04-27 13:07:35,232 INFO L290 TraceCheckUtils]: 2: Hoare triple {4245#true} assume true; {4245#true} is VALID [2022-04-27 13:07:35,232 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4245#true} {4245#true} #112#return; {4245#true} is VALID [2022-04-27 13:07:35,232 INFO L272 TraceCheckUtils]: 4: Hoare triple {4245#true} call #t~ret6 := main(); {4245#true} is VALID [2022-04-27 13:07:35,232 INFO L290 TraceCheckUtils]: 5: Hoare triple {4245#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;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {4245#true} is VALID [2022-04-27 13:07:35,232 INFO L272 TraceCheckUtils]: 6: Hoare triple {4245#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 10 then 1 else 0)); {4245#true} is VALID [2022-04-27 13:07:35,232 INFO L290 TraceCheckUtils]: 7: Hoare triple {4245#true} ~cond := #in~cond; {4245#true} is VALID [2022-04-27 13:07:35,232 INFO L290 TraceCheckUtils]: 8: Hoare triple {4245#true} assume !(0 == ~cond); {4245#true} is VALID [2022-04-27 13:07:35,232 INFO L290 TraceCheckUtils]: 9: Hoare triple {4245#true} assume true; {4245#true} is VALID [2022-04-27 13:07:35,232 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4245#true} {4245#true} #94#return; {4245#true} is VALID [2022-04-27 13:07:35,232 INFO L290 TraceCheckUtils]: 11: Hoare triple {4245#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {4245#true} is VALID [2022-04-27 13:07:35,232 INFO L272 TraceCheckUtils]: 12: Hoare triple {4245#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 10 then 1 else 0)); {4245#true} is VALID [2022-04-27 13:07:35,232 INFO L290 TraceCheckUtils]: 13: Hoare triple {4245#true} ~cond := #in~cond; {4245#true} is VALID [2022-04-27 13:07:35,232 INFO L290 TraceCheckUtils]: 14: Hoare triple {4245#true} assume !(0 == ~cond); {4245#true} is VALID [2022-04-27 13:07:35,232 INFO L290 TraceCheckUtils]: 15: Hoare triple {4245#true} assume true; {4245#true} is VALID [2022-04-27 13:07:35,232 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {4245#true} {4245#true} #96#return; {4245#true} is VALID [2022-04-27 13:07:35,233 INFO L272 TraceCheckUtils]: 17: Hoare triple {4245#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {4245#true} is VALID [2022-04-27 13:07:35,233 INFO L290 TraceCheckUtils]: 18: Hoare triple {4245#true} ~cond := #in~cond; {4304#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 13:07:35,233 INFO L290 TraceCheckUtils]: 19: Hoare triple {4304#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {4308#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 13:07:35,234 INFO L290 TraceCheckUtils]: 20: Hoare triple {4308#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {4308#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 13:07:35,234 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {4308#(not (= |assume_abort_if_not_#in~cond| 0))} {4245#true} #98#return; {4315#(<= 1 main_~x~0)} is VALID [2022-04-27 13:07:35,234 INFO L272 TraceCheckUtils]: 22: Hoare triple {4315#(<= 1 main_~x~0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {4245#true} is VALID [2022-04-27 13:07:35,234 INFO L290 TraceCheckUtils]: 23: Hoare triple {4245#true} ~cond := #in~cond; {4245#true} is VALID [2022-04-27 13:07:35,234 INFO L290 TraceCheckUtils]: 24: Hoare triple {4245#true} assume !(0 == ~cond); {4245#true} is VALID [2022-04-27 13:07:35,234 INFO L290 TraceCheckUtils]: 25: Hoare triple {4245#true} assume true; {4245#true} is VALID [2022-04-27 13:07:35,235 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {4245#true} {4315#(<= 1 main_~x~0)} #100#return; {4315#(<= 1 main_~x~0)} is VALID [2022-04-27 13:07:35,235 INFO L290 TraceCheckUtils]: 27: Hoare triple {4315#(<= 1 main_~x~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {4334#(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-27 13:07:35,235 INFO L290 TraceCheckUtils]: 28: Hoare triple {4334#(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; {4334#(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-27 13:07:35,236 INFO L290 TraceCheckUtils]: 29: Hoare triple {4334#(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);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {4341#(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-27 13:07:35,236 INFO L290 TraceCheckUtils]: 30: Hoare triple {4341#(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; {4341#(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-27 13:07:35,237 INFO L290 TraceCheckUtils]: 31: Hoare triple {4341#(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); {4348#(and (= main_~r~0 0) (<= 1 main_~x~0) (< main_~c~0 main_~y~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:07:35,237 INFO L290 TraceCheckUtils]: 32: Hoare triple {4348#(and (= main_~r~0 0) (<= 1 main_~x~0) (< main_~c~0 main_~y~0) (= main_~k~0 0) (= main_~s~0 1) (= 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; {4352#(and (= main_~s~0 0) (<= 1 main_~x~0) (< main_~x~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-27 13:07:35,237 INFO L290 TraceCheckUtils]: 33: Hoare triple {4352#(and (= main_~s~0 0) (<= 1 main_~x~0) (< main_~x~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} assume !false; {4352#(and (= main_~s~0 0) (<= 1 main_~x~0) (< main_~x~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-27 13:07:35,238 INFO L290 TraceCheckUtils]: 34: Hoare triple {4352#(and (= main_~s~0 0) (<= 1 main_~x~0) (< main_~x~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {4352#(and (= main_~s~0 0) (<= 1 main_~x~0) (< main_~x~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-27 13:07:35,238 INFO L290 TraceCheckUtils]: 35: Hoare triple {4352#(and (= main_~s~0 0) (<= 1 main_~x~0) (< main_~x~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} assume !false; {4352#(and (= main_~s~0 0) (<= 1 main_~x~0) (< main_~x~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-27 13:07:35,238 INFO L290 TraceCheckUtils]: 36: Hoare triple {4352#(and (= main_~s~0 0) (<= 1 main_~x~0) (< main_~x~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {4352#(and (= main_~s~0 0) (<= 1 main_~x~0) (< main_~x~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-27 13:07:35,239 INFO L290 TraceCheckUtils]: 37: Hoare triple {4352#(and (= main_~s~0 0) (<= 1 main_~x~0) (< main_~x~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} assume !false; {4352#(and (= main_~s~0 0) (<= 1 main_~x~0) (< main_~x~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-27 13:07:35,239 INFO L272 TraceCheckUtils]: 38: Hoare triple {4352#(and (= main_~s~0 0) (<= 1 main_~x~0) (< main_~x~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)); {4245#true} is VALID [2022-04-27 13:07:35,239 INFO L290 TraceCheckUtils]: 39: Hoare triple {4245#true} ~cond := #in~cond; {4374#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:07:35,239 INFO L290 TraceCheckUtils]: 40: Hoare triple {4374#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {4378#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:07:35,240 INFO L290 TraceCheckUtils]: 41: Hoare triple {4378#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {4378#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:07:35,240 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {4378#(not (= |__VERIFIER_assert_#in~cond| 0))} {4352#(and (= main_~s~0 0) (<= 1 main_~x~0) (< main_~x~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} #102#return; {4352#(and (= main_~s~0 0) (<= 1 main_~x~0) (< main_~x~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-27 13:07:35,241 INFO L272 TraceCheckUtils]: 43: Hoare triple {4352#(and (= main_~s~0 0) (<= 1 main_~x~0) (< main_~x~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)); {4388#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:07:35,241 INFO L290 TraceCheckUtils]: 44: Hoare triple {4388#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4392#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:07:35,241 INFO L290 TraceCheckUtils]: 45: Hoare triple {4392#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4246#false} is VALID [2022-04-27 13:07:35,241 INFO L290 TraceCheckUtils]: 46: Hoare triple {4246#false} assume !false; {4246#false} is VALID [2022-04-27 13:07:35,242 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-27 13:07:35,242 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:07:41,385 INFO L290 TraceCheckUtils]: 46: Hoare triple {4246#false} assume !false; {4246#false} is VALID [2022-04-27 13:07:41,385 INFO L290 TraceCheckUtils]: 45: Hoare triple {4392#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4246#false} is VALID [2022-04-27 13:07:41,386 INFO L290 TraceCheckUtils]: 44: Hoare triple {4388#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4392#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:07:41,386 INFO L272 TraceCheckUtils]: 43: Hoare triple {4408#(= 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)); {4388#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:07:41,386 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {4245#true} {4408#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #102#return; {4408#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 13:07:41,387 INFO L290 TraceCheckUtils]: 41: Hoare triple {4245#true} assume true; {4245#true} is VALID [2022-04-27 13:07:41,387 INFO L290 TraceCheckUtils]: 40: Hoare triple {4245#true} assume !(0 == ~cond); {4245#true} is VALID [2022-04-27 13:07:41,387 INFO L290 TraceCheckUtils]: 39: Hoare triple {4245#true} ~cond := #in~cond; {4245#true} is VALID [2022-04-27 13:07:41,388 INFO L272 TraceCheckUtils]: 38: Hoare triple {4408#(= 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)); {4245#true} is VALID [2022-04-27 13:07:41,388 INFO L290 TraceCheckUtils]: 37: Hoare triple {4408#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !false; {4408#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 13:07:41,388 INFO L290 TraceCheckUtils]: 36: Hoare triple {4408#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {4408#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 13:07:41,389 INFO L290 TraceCheckUtils]: 35: Hoare triple {4408#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !false; {4408#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 13:07:41,389 INFO L290 TraceCheckUtils]: 34: Hoare triple {4408#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {4408#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 13:07:41,389 INFO L290 TraceCheckUtils]: 33: Hoare triple {4408#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !false; {4408#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 13:07:43,396 WARN L290 TraceCheckUtils]: 32: Hoare triple {4442#(= (+ (* (+ (* (* 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; {4408#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is UNKNOWN [2022-04-27 13:07:43,397 INFO L290 TraceCheckUtils]: 31: Hoare triple {4446#(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); {4442#(= (+ (* (+ (* (* 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-27 13:07:43,397 INFO L290 TraceCheckUtils]: 30: Hoare triple {4446#(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; {4446#(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-27 13:07:43,397 INFO L290 TraceCheckUtils]: 29: Hoare triple {4453#(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);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {4446#(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-27 13:07:43,398 INFO L290 TraceCheckUtils]: 28: Hoare triple {4453#(or (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (<= main_~b~0 main_~a~0))} assume !false; {4453#(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-27 13:07:43,398 INFO L290 TraceCheckUtils]: 27: Hoare triple {4245#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {4453#(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-27 13:07:43,398 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {4245#true} {4245#true} #100#return; {4245#true} is VALID [2022-04-27 13:07:43,398 INFO L290 TraceCheckUtils]: 25: Hoare triple {4245#true} assume true; {4245#true} is VALID [2022-04-27 13:07:43,398 INFO L290 TraceCheckUtils]: 24: Hoare triple {4245#true} assume !(0 == ~cond); {4245#true} is VALID [2022-04-27 13:07:43,398 INFO L290 TraceCheckUtils]: 23: Hoare triple {4245#true} ~cond := #in~cond; {4245#true} is VALID [2022-04-27 13:07:43,398 INFO L272 TraceCheckUtils]: 22: Hoare triple {4245#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {4245#true} is VALID [2022-04-27 13:07:43,398 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {4245#true} {4245#true} #98#return; {4245#true} is VALID [2022-04-27 13:07:43,398 INFO L290 TraceCheckUtils]: 20: Hoare triple {4245#true} assume true; {4245#true} is VALID [2022-04-27 13:07:43,398 INFO L290 TraceCheckUtils]: 19: Hoare triple {4245#true} assume !(0 == ~cond); {4245#true} is VALID [2022-04-27 13:07:43,398 INFO L290 TraceCheckUtils]: 18: Hoare triple {4245#true} ~cond := #in~cond; {4245#true} is VALID [2022-04-27 13:07:43,398 INFO L272 TraceCheckUtils]: 17: Hoare triple {4245#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {4245#true} is VALID [2022-04-27 13:07:43,398 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {4245#true} {4245#true} #96#return; {4245#true} is VALID [2022-04-27 13:07:43,399 INFO L290 TraceCheckUtils]: 15: Hoare triple {4245#true} assume true; {4245#true} is VALID [2022-04-27 13:07:43,399 INFO L290 TraceCheckUtils]: 14: Hoare triple {4245#true} assume !(0 == ~cond); {4245#true} is VALID [2022-04-27 13:07:43,399 INFO L290 TraceCheckUtils]: 13: Hoare triple {4245#true} ~cond := #in~cond; {4245#true} is VALID [2022-04-27 13:07:43,399 INFO L272 TraceCheckUtils]: 12: Hoare triple {4245#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 10 then 1 else 0)); {4245#true} is VALID [2022-04-27 13:07:43,399 INFO L290 TraceCheckUtils]: 11: Hoare triple {4245#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {4245#true} is VALID [2022-04-27 13:07:43,399 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4245#true} {4245#true} #94#return; {4245#true} is VALID [2022-04-27 13:07:43,399 INFO L290 TraceCheckUtils]: 9: Hoare triple {4245#true} assume true; {4245#true} is VALID [2022-04-27 13:07:43,399 INFO L290 TraceCheckUtils]: 8: Hoare triple {4245#true} assume !(0 == ~cond); {4245#true} is VALID [2022-04-27 13:07:43,399 INFO L290 TraceCheckUtils]: 7: Hoare triple {4245#true} ~cond := #in~cond; {4245#true} is VALID [2022-04-27 13:07:43,399 INFO L272 TraceCheckUtils]: 6: Hoare triple {4245#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 10 then 1 else 0)); {4245#true} is VALID [2022-04-27 13:07:43,399 INFO L290 TraceCheckUtils]: 5: Hoare triple {4245#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;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {4245#true} is VALID [2022-04-27 13:07:43,399 INFO L272 TraceCheckUtils]: 4: Hoare triple {4245#true} call #t~ret6 := main(); {4245#true} is VALID [2022-04-27 13:07:43,399 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4245#true} {4245#true} #112#return; {4245#true} is VALID [2022-04-27 13:07:43,399 INFO L290 TraceCheckUtils]: 2: Hoare triple {4245#true} assume true; {4245#true} is VALID [2022-04-27 13:07:43,399 INFO L290 TraceCheckUtils]: 1: Hoare triple {4245#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); {4245#true} is VALID [2022-04-27 13:07:43,399 INFO L272 TraceCheckUtils]: 0: Hoare triple {4245#true} call ULTIMATE.init(); {4245#true} is VALID [2022-04-27 13:07:43,399 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-27 13:07:43,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:07:43,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874772533] [2022-04-27 13:07:43,400 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:07:43,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [967636968] [2022-04-27 13:07:43,400 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [967636968] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 13:07:43,400 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 13:07:43,400 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8] total 17 [2022-04-27 13:07:43,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298726289] [2022-04-27 13:07:43,400 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 13:07:43,400 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.411764705882353) internal successors, (41), 15 states have internal predecessors, (41), 4 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) Word has length 47 [2022-04-27 13:07:43,401 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:07:43,401 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 2.411764705882353) internal successors, (41), 15 states have internal predecessors, (41), 4 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-04-27 13:07:43,632 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:07:43,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-27 13:07:43,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:07:43,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-27 13:07:43,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2022-04-27 13:07:43,633 INFO L87 Difference]: Start difference. First operand 143 states and 205 transitions. Second operand has 17 states, 17 states have (on average 2.411764705882353) internal successors, (41), 15 states have internal predecessors, (41), 4 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-04-27 13:07:49,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:07:49,630 INFO L93 Difference]: Finished difference Result 190 states and 265 transitions. [2022-04-27 13:07:49,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-04-27 13:07:49,630 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.411764705882353) internal successors, (41), 15 states have internal predecessors, (41), 4 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) Word has length 47 [2022-04-27 13:07:49,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:07:49,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 2.411764705882353) internal successors, (41), 15 states have internal predecessors, (41), 4 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-04-27 13:07:49,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 138 transitions. [2022-04-27 13:07:49,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 2.411764705882353) internal successors, (41), 15 states have internal predecessors, (41), 4 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-04-27 13:07:49,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 138 transitions. [2022-04-27 13:07:49,634 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 138 transitions. [2022-04-27 13:07:50,362 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 138 edges. 138 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:07:50,366 INFO L225 Difference]: With dead ends: 190 [2022-04-27 13:07:50,366 INFO L226 Difference]: Without dead ends: 188 [2022-04-27 13:07:50,366 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 77 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 242 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=226, Invalid=964, Unknown=0, NotChecked=0, Total=1190 [2022-04-27 13:07:50,366 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 123 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 683 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 806 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 683 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-04-27 13:07:50,367 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 229 Invalid, 806 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 683 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-04-27 13:07:50,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2022-04-27 13:07:50,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 179. [2022-04-27 13:07:50,651 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:07:50,657 INFO L82 GeneralOperation]: Start isEquivalent. First operand 188 states. Second operand has 179 states, 113 states have (on average 1.2566371681415929) internal successors, (142), 118 states have internal predecessors, (142), 56 states have call successors, (56), 10 states have call predecessors, (56), 9 states have return successors, (54), 50 states have call predecessors, (54), 54 states have call successors, (54) [2022-04-27 13:07:50,659 INFO L74 IsIncluded]: Start isIncluded. First operand 188 states. Second operand has 179 states, 113 states have (on average 1.2566371681415929) internal successors, (142), 118 states have internal predecessors, (142), 56 states have call successors, (56), 10 states have call predecessors, (56), 9 states have return successors, (54), 50 states have call predecessors, (54), 54 states have call successors, (54) [2022-04-27 13:07:50,661 INFO L87 Difference]: Start difference. First operand 188 states. Second operand has 179 states, 113 states have (on average 1.2566371681415929) internal successors, (142), 118 states have internal predecessors, (142), 56 states have call successors, (56), 10 states have call predecessors, (56), 9 states have return successors, (54), 50 states have call predecessors, (54), 54 states have call successors, (54) [2022-04-27 13:07:50,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:07:50,696 INFO L93 Difference]: Finished difference Result 188 states and 263 transitions. [2022-04-27 13:07:50,696 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 263 transitions. [2022-04-27 13:07:50,697 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:07:50,697 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:07:50,699 INFO L74 IsIncluded]: Start isIncluded. First operand has 179 states, 113 states have (on average 1.2566371681415929) internal successors, (142), 118 states have internal predecessors, (142), 56 states have call successors, (56), 10 states have call predecessors, (56), 9 states have return successors, (54), 50 states have call predecessors, (54), 54 states have call successors, (54) Second operand 188 states. [2022-04-27 13:07:50,699 INFO L87 Difference]: Start difference. First operand has 179 states, 113 states have (on average 1.2566371681415929) internal successors, (142), 118 states have internal predecessors, (142), 56 states have call successors, (56), 10 states have call predecessors, (56), 9 states have return successors, (54), 50 states have call predecessors, (54), 54 states have call successors, (54) Second operand 188 states. [2022-04-27 13:07:50,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:07:50,704 INFO L93 Difference]: Finished difference Result 188 states and 263 transitions. [2022-04-27 13:07:50,705 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 263 transitions. [2022-04-27 13:07:50,705 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:07:50,705 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:07:50,705 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:07:50,705 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:07:50,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 113 states have (on average 1.2566371681415929) internal successors, (142), 118 states have internal predecessors, (142), 56 states have call successors, (56), 10 states have call predecessors, (56), 9 states have return successors, (54), 50 states have call predecessors, (54), 54 states have call successors, (54) [2022-04-27 13:07:50,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 252 transitions. [2022-04-27 13:07:50,723 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 252 transitions. Word has length 47 [2022-04-27 13:07:50,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:07:50,723 INFO L495 AbstractCegarLoop]: Abstraction has 179 states and 252 transitions. [2022-04-27 13:07:50,723 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.411764705882353) internal successors, (41), 15 states have internal predecessors, (41), 4 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-04-27 13:07:50,723 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 252 transitions. [2022-04-27 13:07:50,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-27 13:07:50,724 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:07:50,724 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 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] [2022-04-27 13:07:50,741 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-27 13:07:50,925 WARN L477 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-27 13:07:50,925 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:07:50,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:07:50,925 INFO L85 PathProgramCache]: Analyzing trace with hash 1836145722, now seen corresponding path program 2 times [2022-04-27 13:07:50,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:07:50,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579938600] [2022-04-27 13:07:50,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:07:50,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:07:50,936 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:07:50,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2070215820] [2022-04-27 13:07:50,937 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 13:07:50,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:07:50,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:07:50,953 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 13:07:50,953 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-27 13:07:50,994 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 13:07:50,994 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 13:07:50,995 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-27 13:07:51,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:07:51,023 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:07:51,089 INFO L272 TraceCheckUtils]: 0: Hoare triple {5535#true} call ULTIMATE.init(); {5535#true} is VALID [2022-04-27 13:07:51,089 INFO L290 TraceCheckUtils]: 1: Hoare triple {5535#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); {5535#true} is VALID [2022-04-27 13:07:51,089 INFO L290 TraceCheckUtils]: 2: Hoare triple {5535#true} assume true; {5535#true} is VALID [2022-04-27 13:07:51,089 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5535#true} {5535#true} #112#return; {5535#true} is VALID [2022-04-27 13:07:51,090 INFO L272 TraceCheckUtils]: 4: Hoare triple {5535#true} call #t~ret6 := main(); {5535#true} is VALID [2022-04-27 13:07:51,090 INFO L290 TraceCheckUtils]: 5: Hoare triple {5535#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;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {5535#true} is VALID [2022-04-27 13:07:51,090 INFO L272 TraceCheckUtils]: 6: Hoare triple {5535#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 10 then 1 else 0)); {5535#true} is VALID [2022-04-27 13:07:51,090 INFO L290 TraceCheckUtils]: 7: Hoare triple {5535#true} ~cond := #in~cond; {5535#true} is VALID [2022-04-27 13:07:51,090 INFO L290 TraceCheckUtils]: 8: Hoare triple {5535#true} assume !(0 == ~cond); {5535#true} is VALID [2022-04-27 13:07:51,090 INFO L290 TraceCheckUtils]: 9: Hoare triple {5535#true} assume true; {5535#true} is VALID [2022-04-27 13:07:51,090 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5535#true} {5535#true} #94#return; {5535#true} is VALID [2022-04-27 13:07:51,090 INFO L290 TraceCheckUtils]: 11: Hoare triple {5535#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {5535#true} is VALID [2022-04-27 13:07:51,090 INFO L272 TraceCheckUtils]: 12: Hoare triple {5535#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 10 then 1 else 0)); {5535#true} is VALID [2022-04-27 13:07:51,090 INFO L290 TraceCheckUtils]: 13: Hoare triple {5535#true} ~cond := #in~cond; {5535#true} is VALID [2022-04-27 13:07:51,090 INFO L290 TraceCheckUtils]: 14: Hoare triple {5535#true} assume !(0 == ~cond); {5535#true} is VALID [2022-04-27 13:07:51,090 INFO L290 TraceCheckUtils]: 15: Hoare triple {5535#true} assume true; {5535#true} is VALID [2022-04-27 13:07:51,090 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {5535#true} {5535#true} #96#return; {5535#true} is VALID [2022-04-27 13:07:51,090 INFO L272 TraceCheckUtils]: 17: Hoare triple {5535#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {5535#true} is VALID [2022-04-27 13:07:51,090 INFO L290 TraceCheckUtils]: 18: Hoare triple {5535#true} ~cond := #in~cond; {5535#true} is VALID [2022-04-27 13:07:51,091 INFO L290 TraceCheckUtils]: 19: Hoare triple {5535#true} assume !(0 == ~cond); {5535#true} is VALID [2022-04-27 13:07:51,091 INFO L290 TraceCheckUtils]: 20: Hoare triple {5535#true} assume true; {5535#true} is VALID [2022-04-27 13:07:51,091 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {5535#true} {5535#true} #98#return; {5535#true} is VALID [2022-04-27 13:07:51,091 INFO L272 TraceCheckUtils]: 22: Hoare triple {5535#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {5535#true} is VALID [2022-04-27 13:07:51,091 INFO L290 TraceCheckUtils]: 23: Hoare triple {5535#true} ~cond := #in~cond; {5535#true} is VALID [2022-04-27 13:07:51,091 INFO L290 TraceCheckUtils]: 24: Hoare triple {5535#true} assume !(0 == ~cond); {5535#true} is VALID [2022-04-27 13:07:51,091 INFO L290 TraceCheckUtils]: 25: Hoare triple {5535#true} assume true; {5535#true} is VALID [2022-04-27 13:07:51,091 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {5535#true} {5535#true} #100#return; {5535#true} is VALID [2022-04-27 13:07:51,091 INFO L290 TraceCheckUtils]: 27: Hoare triple {5535#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {5535#true} is VALID [2022-04-27 13:07:51,091 INFO L290 TraceCheckUtils]: 28: Hoare triple {5535#true} assume !false; {5535#true} is VALID [2022-04-27 13:07:51,091 INFO L290 TraceCheckUtils]: 29: Hoare triple {5535#true} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {5535#true} is VALID [2022-04-27 13:07:51,091 INFO L290 TraceCheckUtils]: 30: Hoare triple {5535#true} assume !false; {5535#true} is VALID [2022-04-27 13:07:51,091 INFO L290 TraceCheckUtils]: 31: Hoare triple {5535#true} assume !(~c~0 >= ~b~0); {5633#(not (<= main_~b~0 main_~c~0))} is VALID [2022-04-27 13:07:51,092 INFO L290 TraceCheckUtils]: 32: Hoare triple {5633#(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; {5637#(< main_~b~0 main_~a~0)} is VALID [2022-04-27 13:07:51,092 INFO L290 TraceCheckUtils]: 33: Hoare triple {5637#(< main_~b~0 main_~a~0)} assume !false; {5637#(< main_~b~0 main_~a~0)} is VALID [2022-04-27 13:07:51,092 INFO L290 TraceCheckUtils]: 34: Hoare triple {5637#(< main_~b~0 main_~a~0)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {5644#(< main_~b~0 main_~c~0)} is VALID [2022-04-27 13:07:51,092 INFO L290 TraceCheckUtils]: 35: Hoare triple {5644#(< main_~b~0 main_~c~0)} assume !false; {5644#(< main_~b~0 main_~c~0)} is VALID [2022-04-27 13:07:51,092 INFO L290 TraceCheckUtils]: 36: Hoare triple {5644#(< main_~b~0 main_~c~0)} assume !(~c~0 >= ~b~0); {5536#false} is VALID [2022-04-27 13:07:51,092 INFO L290 TraceCheckUtils]: 37: Hoare triple {5536#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; {5536#false} is VALID [2022-04-27 13:07:51,092 INFO L290 TraceCheckUtils]: 38: Hoare triple {5536#false} assume !false; {5536#false} is VALID [2022-04-27 13:07:51,093 INFO L290 TraceCheckUtils]: 39: Hoare triple {5536#false} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {5536#false} is VALID [2022-04-27 13:07:51,093 INFO L290 TraceCheckUtils]: 40: Hoare triple {5536#false} assume !false; {5536#false} is VALID [2022-04-27 13:07:51,093 INFO L290 TraceCheckUtils]: 41: Hoare triple {5536#false} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {5536#false} is VALID [2022-04-27 13:07:51,093 INFO L290 TraceCheckUtils]: 42: Hoare triple {5536#false} assume !false; {5536#false} is VALID [2022-04-27 13:07:51,093 INFO L272 TraceCheckUtils]: 43: Hoare triple {5536#false} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {5536#false} is VALID [2022-04-27 13:07:51,093 INFO L290 TraceCheckUtils]: 44: Hoare triple {5536#false} ~cond := #in~cond; {5536#false} is VALID [2022-04-27 13:07:51,093 INFO L290 TraceCheckUtils]: 45: Hoare triple {5536#false} assume 0 == ~cond; {5536#false} is VALID [2022-04-27 13:07:51,093 INFO L290 TraceCheckUtils]: 46: Hoare triple {5536#false} assume !false; {5536#false} is VALID [2022-04-27 13:07:51,093 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-27 13:07:51,093 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 13:07:51,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:07:51,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579938600] [2022-04-27 13:07:51,093 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:07:51,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2070215820] [2022-04-27 13:07:51,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2070215820] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:07:51,093 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:07:51,093 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 13:07:51,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132641093] [2022-04-27 13:07:51,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:07:51,094 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 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 47 [2022-04-27 13:07:51,094 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:07:51,094 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 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-27 13:07:51,110 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:07:51,110 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 13:07:51,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:07:51,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 13:07:51,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 13:07:51,111 INFO L87 Difference]: Start difference. First operand 179 states and 252 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 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-27 13:07:51,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:07:51,521 INFO L93 Difference]: Finished difference Result 225 states and 312 transitions. [2022-04-27 13:07:51,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 13:07:51,521 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 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 47 [2022-04-27 13:07:51,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:07:51,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 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-27 13:07:51,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 102 transitions. [2022-04-27 13:07:51,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 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-27 13:07:51,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 102 transitions. [2022-04-27 13:07:51,523 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 102 transitions. [2022-04-27 13:07:51,593 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:07:51,612 INFO L225 Difference]: With dead ends: 225 [2022-04-27 13:07:51,612 INFO L226 Difference]: Without dead ends: 144 [2022-04-27 13:07:51,615 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 44 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-27 13:07:51,616 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 18 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 13:07:51,616 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 155 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 13:07:51,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2022-04-27 13:07:51,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 121. [2022-04-27 13:07:51,846 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:07:51,847 INFO L82 GeneralOperation]: Start isEquivalent. First operand 144 states. Second operand has 121 states, 73 states have (on average 1.178082191780822) internal successors, (86), 77 states have internal predecessors, (86), 38 states have call successors, (38), 10 states have call predecessors, (38), 9 states have return successors, (36), 33 states have call predecessors, (36), 36 states have call successors, (36) [2022-04-27 13:07:51,847 INFO L74 IsIncluded]: Start isIncluded. First operand 144 states. Second operand has 121 states, 73 states have (on average 1.178082191780822) internal successors, (86), 77 states have internal predecessors, (86), 38 states have call successors, (38), 10 states have call predecessors, (38), 9 states have return successors, (36), 33 states have call predecessors, (36), 36 states have call successors, (36) [2022-04-27 13:07:51,847 INFO L87 Difference]: Start difference. First operand 144 states. Second operand has 121 states, 73 states have (on average 1.178082191780822) internal successors, (86), 77 states have internal predecessors, (86), 38 states have call successors, (38), 10 states have call predecessors, (38), 9 states have return successors, (36), 33 states have call predecessors, (36), 36 states have call successors, (36) [2022-04-27 13:07:51,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:07:51,851 INFO L93 Difference]: Finished difference Result 144 states and 195 transitions. [2022-04-27 13:07:51,851 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 195 transitions. [2022-04-27 13:07:51,851 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:07:51,851 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:07:51,851 INFO L74 IsIncluded]: Start isIncluded. First operand has 121 states, 73 states have (on average 1.178082191780822) internal successors, (86), 77 states have internal predecessors, (86), 38 states have call successors, (38), 10 states have call predecessors, (38), 9 states have return successors, (36), 33 states have call predecessors, (36), 36 states have call successors, (36) Second operand 144 states. [2022-04-27 13:07:51,852 INFO L87 Difference]: Start difference. First operand has 121 states, 73 states have (on average 1.178082191780822) internal successors, (86), 77 states have internal predecessors, (86), 38 states have call successors, (38), 10 states have call predecessors, (38), 9 states have return successors, (36), 33 states have call predecessors, (36), 36 states have call successors, (36) Second operand 144 states. [2022-04-27 13:07:51,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:07:51,856 INFO L93 Difference]: Finished difference Result 144 states and 195 transitions. [2022-04-27 13:07:51,856 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 195 transitions. [2022-04-27 13:07:51,856 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:07:51,856 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:07:51,856 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:07:51,856 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:07:51,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 73 states have (on average 1.178082191780822) internal successors, (86), 77 states have internal predecessors, (86), 38 states have call successors, (38), 10 states have call predecessors, (38), 9 states have return successors, (36), 33 states have call predecessors, (36), 36 states have call successors, (36) [2022-04-27 13:07:51,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 160 transitions. [2022-04-27 13:07:51,859 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 160 transitions. Word has length 47 [2022-04-27 13:07:51,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:07:51,859 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 160 transitions. [2022-04-27 13:07:51,859 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 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-27 13:07:51,859 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 160 transitions. [2022-04-27 13:07:51,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-04-27 13:07:51,859 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:07:51,859 INFO L195 NwaCegarLoop]: 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, 1, 1, 1] [2022-04-27 13:07:51,875 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-27 13:07:52,076 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-04-27 13:07:52,076 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:07:52,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:07:52,076 INFO L85 PathProgramCache]: Analyzing trace with hash -1952108775, now seen corresponding path program 1 times [2022-04-27 13:07:52,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:07:52,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944925015] [2022-04-27 13:07:52,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:07:52,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:07:52,089 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:07:52,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [674302673] [2022-04-27 13:07:52,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:07:52,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:07:52,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:07:52,090 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 13:07:52,091 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-04-27 13:07:52,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:07:52,125 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 13:07:52,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:07:52,133 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:07:52,243 INFO L272 TraceCheckUtils]: 0: Hoare triple {6512#true} call ULTIMATE.init(); {6512#true} is VALID [2022-04-27 13:07:52,243 INFO L290 TraceCheckUtils]: 1: Hoare triple {6512#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); {6512#true} is VALID [2022-04-27 13:07:52,243 INFO L290 TraceCheckUtils]: 2: Hoare triple {6512#true} assume true; {6512#true} is VALID [2022-04-27 13:07:52,243 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6512#true} {6512#true} #112#return; {6512#true} is VALID [2022-04-27 13:07:52,243 INFO L272 TraceCheckUtils]: 4: Hoare triple {6512#true} call #t~ret6 := main(); {6512#true} is VALID [2022-04-27 13:07:52,243 INFO L290 TraceCheckUtils]: 5: Hoare triple {6512#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;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {6512#true} is VALID [2022-04-27 13:07:52,243 INFO L272 TraceCheckUtils]: 6: Hoare triple {6512#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 10 then 1 else 0)); {6512#true} is VALID [2022-04-27 13:07:52,243 INFO L290 TraceCheckUtils]: 7: Hoare triple {6512#true} ~cond := #in~cond; {6512#true} is VALID [2022-04-27 13:07:52,243 INFO L290 TraceCheckUtils]: 8: Hoare triple {6512#true} assume !(0 == ~cond); {6512#true} is VALID [2022-04-27 13:07:52,244 INFO L290 TraceCheckUtils]: 9: Hoare triple {6512#true} assume true; {6512#true} is VALID [2022-04-27 13:07:52,244 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6512#true} {6512#true} #94#return; {6512#true} is VALID [2022-04-27 13:07:52,244 INFO L290 TraceCheckUtils]: 11: Hoare triple {6512#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {6512#true} is VALID [2022-04-27 13:07:52,244 INFO L272 TraceCheckUtils]: 12: Hoare triple {6512#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 10 then 1 else 0)); {6512#true} is VALID [2022-04-27 13:07:52,244 INFO L290 TraceCheckUtils]: 13: Hoare triple {6512#true} ~cond := #in~cond; {6512#true} is VALID [2022-04-27 13:07:52,244 INFO L290 TraceCheckUtils]: 14: Hoare triple {6512#true} assume !(0 == ~cond); {6512#true} is VALID [2022-04-27 13:07:52,244 INFO L290 TraceCheckUtils]: 15: Hoare triple {6512#true} assume true; {6512#true} is VALID [2022-04-27 13:07:52,244 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {6512#true} {6512#true} #96#return; {6512#true} is VALID [2022-04-27 13:07:52,244 INFO L272 TraceCheckUtils]: 17: Hoare triple {6512#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {6512#true} is VALID [2022-04-27 13:07:52,244 INFO L290 TraceCheckUtils]: 18: Hoare triple {6512#true} ~cond := #in~cond; {6512#true} is VALID [2022-04-27 13:07:52,244 INFO L290 TraceCheckUtils]: 19: Hoare triple {6512#true} assume !(0 == ~cond); {6512#true} is VALID [2022-04-27 13:07:52,245 INFO L290 TraceCheckUtils]: 20: Hoare triple {6512#true} assume true; {6512#true} is VALID [2022-04-27 13:07:52,245 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {6512#true} {6512#true} #98#return; {6512#true} is VALID [2022-04-27 13:07:52,245 INFO L272 TraceCheckUtils]: 22: Hoare triple {6512#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {6512#true} is VALID [2022-04-27 13:07:52,245 INFO L290 TraceCheckUtils]: 23: Hoare triple {6512#true} ~cond := #in~cond; {6512#true} is VALID [2022-04-27 13:07:52,245 INFO L290 TraceCheckUtils]: 24: Hoare triple {6512#true} assume !(0 == ~cond); {6512#true} is VALID [2022-04-27 13:07:52,245 INFO L290 TraceCheckUtils]: 25: Hoare triple {6512#true} assume true; {6512#true} is VALID [2022-04-27 13:07:52,245 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {6512#true} {6512#true} #100#return; {6512#true} is VALID [2022-04-27 13:07:52,245 INFO L290 TraceCheckUtils]: 27: Hoare triple {6512#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {6512#true} is VALID [2022-04-27 13:07:52,245 INFO L290 TraceCheckUtils]: 28: Hoare triple {6512#true} assume !false; {6512#true} is VALID [2022-04-27 13:07:52,245 INFO L290 TraceCheckUtils]: 29: Hoare triple {6512#true} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {6512#true} is VALID [2022-04-27 13:07:52,245 INFO L290 TraceCheckUtils]: 30: Hoare triple {6512#true} assume !false; {6512#true} is VALID [2022-04-27 13:07:52,245 INFO L290 TraceCheckUtils]: 31: Hoare triple {6512#true} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {6610#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} is VALID [2022-04-27 13:07:52,246 INFO L290 TraceCheckUtils]: 32: Hoare triple {6610#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} assume !false; {6610#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} is VALID [2022-04-27 13:07:52,246 INFO L272 TraceCheckUtils]: 33: Hoare triple {6610#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {6512#true} is VALID [2022-04-27 13:07:52,246 INFO L290 TraceCheckUtils]: 34: Hoare triple {6512#true} ~cond := #in~cond; {6512#true} is VALID [2022-04-27 13:07:52,246 INFO L290 TraceCheckUtils]: 35: Hoare triple {6512#true} assume !(0 == ~cond); {6512#true} is VALID [2022-04-27 13:07:52,246 INFO L290 TraceCheckUtils]: 36: Hoare triple {6512#true} assume true; {6512#true} is VALID [2022-04-27 13:07:52,246 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {6512#true} {6610#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} #102#return; {6610#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} is VALID [2022-04-27 13:07:52,246 INFO L272 TraceCheckUtils]: 38: Hoare triple {6610#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {6512#true} is VALID [2022-04-27 13:07:52,246 INFO L290 TraceCheckUtils]: 39: Hoare triple {6512#true} ~cond := #in~cond; {6512#true} is VALID [2022-04-27 13:07:52,247 INFO L290 TraceCheckUtils]: 40: Hoare triple {6512#true} assume !(0 == ~cond); {6512#true} is VALID [2022-04-27 13:07:52,247 INFO L290 TraceCheckUtils]: 41: Hoare triple {6512#true} assume true; {6512#true} is VALID [2022-04-27 13:07:52,247 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {6512#true} {6610#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} #104#return; {6610#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} is VALID [2022-04-27 13:07:52,247 INFO L272 TraceCheckUtils]: 43: Hoare triple {6610#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {6512#true} is VALID [2022-04-27 13:07:52,247 INFO L290 TraceCheckUtils]: 44: Hoare triple {6512#true} ~cond := #in~cond; {6512#true} is VALID [2022-04-27 13:07:52,247 INFO L290 TraceCheckUtils]: 45: Hoare triple {6512#true} assume !(0 == ~cond); {6512#true} is VALID [2022-04-27 13:07:52,247 INFO L290 TraceCheckUtils]: 46: Hoare triple {6512#true} assume true; {6512#true} is VALID [2022-04-27 13:07:52,248 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {6512#true} {6610#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} #106#return; {6610#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} is VALID [2022-04-27 13:07:52,248 INFO L272 TraceCheckUtils]: 48: Hoare triple {6610#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {6662#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:07:52,248 INFO L290 TraceCheckUtils]: 49: Hoare triple {6662#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6666#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:07:52,248 INFO L290 TraceCheckUtils]: 50: Hoare triple {6666#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6513#false} is VALID [2022-04-27 13:07:52,249 INFO L290 TraceCheckUtils]: 51: Hoare triple {6513#false} assume !false; {6513#false} is VALID [2022-04-27 13:07:52,249 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-27 13:07:52,249 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 13:07:52,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:07:52,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944925015] [2022-04-27 13:07:52,249 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:07:52,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [674302673] [2022-04-27 13:07:52,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [674302673] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:07:52,249 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:07:52,249 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 13:07:52,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233319501] [2022-04-27 13:07:52,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:07:52,250 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 52 [2022-04-27 13:07:52,252 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:07:52,252 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-27 13:07:52,276 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:07:52,276 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 13:07:52,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:07:52,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 13:07:52,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 13:07:52,276 INFO L87 Difference]: Start difference. First operand 121 states and 160 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-27 13:07:52,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:07:52,707 INFO L93 Difference]: Finished difference Result 167 states and 233 transitions. [2022-04-27 13:07:52,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 13:07:52,707 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 52 [2022-04-27 13:07:52,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:07:52,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-27 13:07:52,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-04-27 13:07:52,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-27 13:07:52,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-04-27 13:07:52,709 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 65 transitions. [2022-04-27 13:07:52,746 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:07:52,749 INFO L225 Difference]: With dead ends: 167 [2022-04-27 13:07:52,749 INFO L226 Difference]: Without dead ends: 165 [2022-04-27 13:07:52,750 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 13:07:52,750 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 9 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 13:07:52,751 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 156 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 13:07:52,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2022-04-27 13:07:53,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 148. [2022-04-27 13:07:53,128 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:07:53,129 INFO L82 GeneralOperation]: Start isEquivalent. First operand 165 states. Second operand has 148 states, 80 states have (on average 1.1625) internal successors, (93), 88 states have internal predecessors, (93), 57 states have call successors, (57), 11 states have call predecessors, (57), 10 states have return successors, (55), 48 states have call predecessors, (55), 55 states have call successors, (55) [2022-04-27 13:07:53,129 INFO L74 IsIncluded]: Start isIncluded. First operand 165 states. Second operand has 148 states, 80 states have (on average 1.1625) internal successors, (93), 88 states have internal predecessors, (93), 57 states have call successors, (57), 11 states have call predecessors, (57), 10 states have return successors, (55), 48 states have call predecessors, (55), 55 states have call successors, (55) [2022-04-27 13:07:53,129 INFO L87 Difference]: Start difference. First operand 165 states. Second operand has 148 states, 80 states have (on average 1.1625) internal successors, (93), 88 states have internal predecessors, (93), 57 states have call successors, (57), 11 states have call predecessors, (57), 10 states have return successors, (55), 48 states have call predecessors, (55), 55 states have call successors, (55) [2022-04-27 13:07:53,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:07:53,134 INFO L93 Difference]: Finished difference Result 165 states and 231 transitions. [2022-04-27 13:07:53,134 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 231 transitions. [2022-04-27 13:07:53,134 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:07:53,135 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:07:53,135 INFO L74 IsIncluded]: Start isIncluded. First operand has 148 states, 80 states have (on average 1.1625) internal successors, (93), 88 states have internal predecessors, (93), 57 states have call successors, (57), 11 states have call predecessors, (57), 10 states have return successors, (55), 48 states have call predecessors, (55), 55 states have call successors, (55) Second operand 165 states. [2022-04-27 13:07:53,135 INFO L87 Difference]: Start difference. First operand has 148 states, 80 states have (on average 1.1625) internal successors, (93), 88 states have internal predecessors, (93), 57 states have call successors, (57), 11 states have call predecessors, (57), 10 states have return successors, (55), 48 states have call predecessors, (55), 55 states have call successors, (55) Second operand 165 states. [2022-04-27 13:07:53,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:07:53,138 INFO L93 Difference]: Finished difference Result 165 states and 231 transitions. [2022-04-27 13:07:53,138 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 231 transitions. [2022-04-27 13:07:53,139 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:07:53,139 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:07:53,139 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:07:53,139 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:07:53,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 80 states have (on average 1.1625) internal successors, (93), 88 states have internal predecessors, (93), 57 states have call successors, (57), 11 states have call predecessors, (57), 10 states have return successors, (55), 48 states have call predecessors, (55), 55 states have call successors, (55) [2022-04-27 13:07:53,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 205 transitions. [2022-04-27 13:07:53,142 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 205 transitions. Word has length 52 [2022-04-27 13:07:53,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:07:53,142 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 205 transitions. [2022-04-27 13:07:53,142 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-27 13:07:53,142 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 205 transitions. [2022-04-27 13:07:53,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-04-27 13:07:53,143 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:07:53,143 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:07:53,159 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-04-27 13:07:53,359 WARN L477 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-27 13:07:53,359 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:07:53,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:07:53,359 INFO L85 PathProgramCache]: Analyzing trace with hash 188363668, now seen corresponding path program 1 times [2022-04-27 13:07:53,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:07:53,359 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225268425] [2022-04-27 13:07:53,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:07:53,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:07:53,375 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:07:53,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2025849703] [2022-04-27 13:07:53,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:07:53,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:07:53,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:07:53,377 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 13:07:53,378 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-04-27 13:07:53,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:07:53,419 INFO L263 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 50 conjunts are in the unsatisfiable core [2022-04-27 13:07:53,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:07:53,430 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:07:54,009 INFO L272 TraceCheckUtils]: 0: Hoare triple {7506#true} call ULTIMATE.init(); {7506#true} is VALID [2022-04-27 13:07:54,009 INFO L290 TraceCheckUtils]: 1: Hoare triple {7506#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); {7506#true} is VALID [2022-04-27 13:07:54,009 INFO L290 TraceCheckUtils]: 2: Hoare triple {7506#true} assume true; {7506#true} is VALID [2022-04-27 13:07:54,009 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7506#true} {7506#true} #112#return; {7506#true} is VALID [2022-04-27 13:07:54,009 INFO L272 TraceCheckUtils]: 4: Hoare triple {7506#true} call #t~ret6 := main(); {7506#true} is VALID [2022-04-27 13:07:54,009 INFO L290 TraceCheckUtils]: 5: Hoare triple {7506#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;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {7506#true} is VALID [2022-04-27 13:07:54,009 INFO L272 TraceCheckUtils]: 6: Hoare triple {7506#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 10 then 1 else 0)); {7506#true} is VALID [2022-04-27 13:07:54,009 INFO L290 TraceCheckUtils]: 7: Hoare triple {7506#true} ~cond := #in~cond; {7506#true} is VALID [2022-04-27 13:07:54,009 INFO L290 TraceCheckUtils]: 8: Hoare triple {7506#true} assume !(0 == ~cond); {7506#true} is VALID [2022-04-27 13:07:54,009 INFO L290 TraceCheckUtils]: 9: Hoare triple {7506#true} assume true; {7506#true} is VALID [2022-04-27 13:07:54,009 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7506#true} {7506#true} #94#return; {7506#true} is VALID [2022-04-27 13:07:54,010 INFO L290 TraceCheckUtils]: 11: Hoare triple {7506#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {7506#true} is VALID [2022-04-27 13:07:54,010 INFO L272 TraceCheckUtils]: 12: Hoare triple {7506#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 10 then 1 else 0)); {7506#true} is VALID [2022-04-27 13:07:54,010 INFO L290 TraceCheckUtils]: 13: Hoare triple {7506#true} ~cond := #in~cond; {7506#true} is VALID [2022-04-27 13:07:54,010 INFO L290 TraceCheckUtils]: 14: Hoare triple {7506#true} assume !(0 == ~cond); {7506#true} is VALID [2022-04-27 13:07:54,010 INFO L290 TraceCheckUtils]: 15: Hoare triple {7506#true} assume true; {7506#true} is VALID [2022-04-27 13:07:54,010 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {7506#true} {7506#true} #96#return; {7506#true} is VALID [2022-04-27 13:07:54,010 INFO L272 TraceCheckUtils]: 17: Hoare triple {7506#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {7506#true} is VALID [2022-04-27 13:07:54,010 INFO L290 TraceCheckUtils]: 18: Hoare triple {7506#true} ~cond := #in~cond; {7506#true} is VALID [2022-04-27 13:07:54,010 INFO L290 TraceCheckUtils]: 19: Hoare triple {7506#true} assume !(0 == ~cond); {7506#true} is VALID [2022-04-27 13:07:54,010 INFO L290 TraceCheckUtils]: 20: Hoare triple {7506#true} assume true; {7506#true} is VALID [2022-04-27 13:07:54,010 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {7506#true} {7506#true} #98#return; {7506#true} is VALID [2022-04-27 13:07:54,010 INFO L272 TraceCheckUtils]: 22: Hoare triple {7506#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {7506#true} is VALID [2022-04-27 13:07:54,010 INFO L290 TraceCheckUtils]: 23: Hoare triple {7506#true} ~cond := #in~cond; {7506#true} is VALID [2022-04-27 13:07:54,010 INFO L290 TraceCheckUtils]: 24: Hoare triple {7506#true} assume !(0 == ~cond); {7506#true} is VALID [2022-04-27 13:07:54,010 INFO L290 TraceCheckUtils]: 25: Hoare triple {7506#true} assume true; {7506#true} is VALID [2022-04-27 13:07:54,010 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {7506#true} {7506#true} #100#return; {7506#true} is VALID [2022-04-27 13:07:54,011 INFO L290 TraceCheckUtils]: 27: Hoare triple {7506#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {7592#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:07:54,011 INFO L290 TraceCheckUtils]: 28: Hoare triple {7592#(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; {7592#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:07:54,011 INFO L290 TraceCheckUtils]: 29: Hoare triple {7592#(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);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {7599#(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-27 13:07:54,012 INFO L290 TraceCheckUtils]: 30: Hoare triple {7599#(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; {7599#(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-27 13:07:54,012 INFO L290 TraceCheckUtils]: 31: Hoare triple {7599#(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);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {7606#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:07:54,012 INFO L290 TraceCheckUtils]: 32: Hoare triple {7606#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} assume !false; {7606#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:07:54,013 INFO L272 TraceCheckUtils]: 33: Hoare triple {7606#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= 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)); {7506#true} is VALID [2022-04-27 13:07:54,013 INFO L290 TraceCheckUtils]: 34: Hoare triple {7506#true} ~cond := #in~cond; {7506#true} is VALID [2022-04-27 13:07:54,013 INFO L290 TraceCheckUtils]: 35: Hoare triple {7506#true} assume !(0 == ~cond); {7506#true} is VALID [2022-04-27 13:07:54,013 INFO L290 TraceCheckUtils]: 36: Hoare triple {7506#true} assume true; {7506#true} is VALID [2022-04-27 13:07:54,013 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {7506#true} {7606#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #102#return; {7606#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:07:54,013 INFO L272 TraceCheckUtils]: 38: Hoare triple {7606#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= 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)); {7506#true} is VALID [2022-04-27 13:07:54,014 INFO L290 TraceCheckUtils]: 39: Hoare triple {7506#true} ~cond := #in~cond; {7631#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:07:54,014 INFO L290 TraceCheckUtils]: 40: Hoare triple {7631#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {7635#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:07:54,014 INFO L290 TraceCheckUtils]: 41: Hoare triple {7635#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {7635#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:07:54,015 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {7635#(not (= |__VERIFIER_assert_#in~cond| 0))} {7606#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #104#return; {7606#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:07:54,015 INFO L272 TraceCheckUtils]: 43: Hoare triple {7606#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= 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)); {7506#true} is VALID [2022-04-27 13:07:54,015 INFO L290 TraceCheckUtils]: 44: Hoare triple {7506#true} ~cond := #in~cond; {7506#true} is VALID [2022-04-27 13:07:54,015 INFO L290 TraceCheckUtils]: 45: Hoare triple {7506#true} assume !(0 == ~cond); {7506#true} is VALID [2022-04-27 13:07:54,015 INFO L290 TraceCheckUtils]: 46: Hoare triple {7506#true} assume true; {7506#true} is VALID [2022-04-27 13:07:54,016 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {7506#true} {7606#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #106#return; {7606#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:07:54,016 INFO L272 TraceCheckUtils]: 48: Hoare triple {7606#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {7506#true} is VALID [2022-04-27 13:07:54,016 INFO L290 TraceCheckUtils]: 49: Hoare triple {7506#true} ~cond := #in~cond; {7506#true} is VALID [2022-04-27 13:07:54,016 INFO L290 TraceCheckUtils]: 50: Hoare triple {7506#true} assume !(0 == ~cond); {7506#true} is VALID [2022-04-27 13:07:54,016 INFO L290 TraceCheckUtils]: 51: Hoare triple {7506#true} assume true; {7506#true} is VALID [2022-04-27 13:07:54,017 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {7506#true} {7606#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #108#return; {7606#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:07:54,017 INFO L290 TraceCheckUtils]: 53: Hoare triple {7606#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} assume !(~c~0 >= 2 * ~v~0); {7606#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:07:54,018 INFO L290 TraceCheckUtils]: 54: Hoare triple {7606#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {7678#(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-27 13:07:54,018 INFO L290 TraceCheckUtils]: 55: Hoare triple {7678#(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; {7678#(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-27 13:07:54,018 INFO L290 TraceCheckUtils]: 56: Hoare triple {7678#(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 !(~c~0 >= ~b~0); {7678#(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-27 13:07:54,019 INFO L290 TraceCheckUtils]: 57: Hoare triple {7678#(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))} ~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; {7688#(and (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 (+ (* (- 1) main_~a~0) main_~x~0)) (= main_~q~0 1) (= (+ main_~s~0 1) 0))} is VALID [2022-04-27 13:07:54,019 INFO L290 TraceCheckUtils]: 58: Hoare triple {7688#(and (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 (+ (* (- 1) main_~a~0) main_~x~0)) (= main_~q~0 1) (= (+ main_~s~0 1) 0))} assume !false; {7688#(and (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 (+ (* (- 1) main_~a~0) main_~x~0)) (= main_~q~0 1) (= (+ main_~s~0 1) 0))} is VALID [2022-04-27 13:07:54,020 INFO L290 TraceCheckUtils]: 59: Hoare triple {7688#(and (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 (+ (* (- 1) main_~a~0) main_~x~0)) (= main_~q~0 1) (= (+ main_~s~0 1) 0))} assume !(0 != ~b~0); {7695#(and (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~q~0 1) (= (+ main_~s~0 1) 0) (= (+ (* (- 1) main_~a~0) main_~x~0) 0))} is VALID [2022-04-27 13:07:54,020 INFO L272 TraceCheckUtils]: 60: Hoare triple {7695#(and (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~q~0 1) (= (+ main_~s~0 1) 0) (= (+ (* (- 1) main_~a~0) main_~x~0) 0))} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {7699#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:07:54,021 INFO L290 TraceCheckUtils]: 61: Hoare triple {7699#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7703#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:07:54,021 INFO L290 TraceCheckUtils]: 62: Hoare triple {7703#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7507#false} is VALID [2022-04-27 13:07:54,021 INFO L290 TraceCheckUtils]: 63: Hoare triple {7507#false} assume !false; {7507#false} is VALID [2022-04-27 13:07:54,021 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 10 proven. 11 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-04-27 13:07:54,021 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:08:05,965 INFO L290 TraceCheckUtils]: 63: Hoare triple {7507#false} assume !false; {7507#false} is VALID [2022-04-27 13:08:05,965 INFO L290 TraceCheckUtils]: 62: Hoare triple {7703#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7507#false} is VALID [2022-04-27 13:08:05,966 INFO L290 TraceCheckUtils]: 61: Hoare triple {7699#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7703#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:08:05,966 INFO L272 TraceCheckUtils]: 60: Hoare triple {7719#(= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {7699#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:08:05,967 INFO L290 TraceCheckUtils]: 59: Hoare triple {7723#(or (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 0)))} assume !(0 != ~b~0); {7719#(= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 13:08:05,967 INFO L290 TraceCheckUtils]: 58: Hoare triple {7723#(or (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 0)))} assume !false; {7723#(or (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 0)))} is VALID [2022-04-27 13:08:06,128 INFO L290 TraceCheckUtils]: 57: Hoare triple {7730#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~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; {7723#(or (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 0)))} is VALID [2022-04-27 13:08:06,128 INFO L290 TraceCheckUtils]: 56: Hoare triple {7730#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} assume !(~c~0 >= ~b~0); {7730#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-27 13:08:06,129 INFO L290 TraceCheckUtils]: 55: Hoare triple {7730#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} assume !false; {7730#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-27 13:08:06,180 INFO L290 TraceCheckUtils]: 54: Hoare triple {7740#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {7730#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-27 13:08:06,180 INFO L290 TraceCheckUtils]: 53: Hoare triple {7740#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} assume !(~c~0 >= 2 * ~v~0); {7740#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-27 13:08:06,181 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {7506#true} {7740#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} #108#return; {7740#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-27 13:08:06,181 INFO L290 TraceCheckUtils]: 51: Hoare triple {7506#true} assume true; {7506#true} is VALID [2022-04-27 13:08:06,181 INFO L290 TraceCheckUtils]: 50: Hoare triple {7506#true} assume !(0 == ~cond); {7506#true} is VALID [2022-04-27 13:08:06,181 INFO L290 TraceCheckUtils]: 49: Hoare triple {7506#true} ~cond := #in~cond; {7506#true} is VALID [2022-04-27 13:08:06,181 INFO L272 TraceCheckUtils]: 48: Hoare triple {7740#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {7506#true} is VALID [2022-04-27 13:08:06,182 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {7506#true} {7740#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} #106#return; {7740#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-27 13:08:06,182 INFO L290 TraceCheckUtils]: 46: Hoare triple {7506#true} assume true; {7506#true} is VALID [2022-04-27 13:08:06,182 INFO L290 TraceCheckUtils]: 45: Hoare triple {7506#true} assume !(0 == ~cond); {7506#true} is VALID [2022-04-27 13:08:06,182 INFO L290 TraceCheckUtils]: 44: Hoare triple {7506#true} ~cond := #in~cond; {7506#true} is VALID [2022-04-27 13:08:06,182 INFO L272 TraceCheckUtils]: 43: Hoare triple {7740#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~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)); {7506#true} is VALID [2022-04-27 13:08:06,183 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {7635#(not (= |__VERIFIER_assert_#in~cond| 0))} {7777#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} #104#return; {7740#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-27 13:08:06,183 INFO L290 TraceCheckUtils]: 41: Hoare triple {7635#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {7635#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:08:06,184 INFO L290 TraceCheckUtils]: 40: Hoare triple {7787#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {7635#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:08:06,184 INFO L290 TraceCheckUtils]: 39: Hoare triple {7506#true} ~cond := #in~cond; {7787#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 13:08:06,184 INFO L272 TraceCheckUtils]: 38: Hoare triple {7777#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~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)); {7506#true} is VALID [2022-04-27 13:08:06,185 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {7506#true} {7777#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} #102#return; {7777#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-27 13:08:06,185 INFO L290 TraceCheckUtils]: 36: Hoare triple {7506#true} assume true; {7506#true} is VALID [2022-04-27 13:08:06,185 INFO L290 TraceCheckUtils]: 35: Hoare triple {7506#true} assume !(0 == ~cond); {7506#true} is VALID [2022-04-27 13:08:06,185 INFO L290 TraceCheckUtils]: 34: Hoare triple {7506#true} ~cond := #in~cond; {7506#true} is VALID [2022-04-27 13:08:06,185 INFO L272 TraceCheckUtils]: 33: Hoare triple {7777#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~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)); {7506#true} is VALID [2022-04-27 13:08:06,186 INFO L290 TraceCheckUtils]: 32: Hoare triple {7777#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} assume !false; {7777#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-27 13:08:06,186 INFO L290 TraceCheckUtils]: 31: Hoare triple {7812#(or (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) main_~b~0 (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 0)))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {7777#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-27 13:08:06,188 INFO L290 TraceCheckUtils]: 30: Hoare triple {7812#(or (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) main_~b~0 (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 0)))} assume !false; {7812#(or (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) main_~b~0 (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 0)))} is VALID [2022-04-27 13:08:06,188 INFO L290 TraceCheckUtils]: 29: Hoare triple {7819#(or (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) main_~b~0 (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~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);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {7812#(or (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) main_~b~0 (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 0)))} is VALID [2022-04-27 13:08:06,189 INFO L290 TraceCheckUtils]: 28: Hoare triple {7819#(or (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) main_~b~0 (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= (+ main_~a~0 (* (- 1) main_~b~0)) 0)))} assume !false; {7819#(or (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) main_~b~0 (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~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-27 13:08:06,189 INFO L290 TraceCheckUtils]: 27: Hoare triple {7506#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {7819#(or (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) main_~b~0 (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~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-27 13:08:06,189 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {7506#true} {7506#true} #100#return; {7506#true} is VALID [2022-04-27 13:08:06,189 INFO L290 TraceCheckUtils]: 25: Hoare triple {7506#true} assume true; {7506#true} is VALID [2022-04-27 13:08:06,189 INFO L290 TraceCheckUtils]: 24: Hoare triple {7506#true} assume !(0 == ~cond); {7506#true} is VALID [2022-04-27 13:08:06,189 INFO L290 TraceCheckUtils]: 23: Hoare triple {7506#true} ~cond := #in~cond; {7506#true} is VALID [2022-04-27 13:08:06,189 INFO L272 TraceCheckUtils]: 22: Hoare triple {7506#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {7506#true} is VALID [2022-04-27 13:08:06,189 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {7506#true} {7506#true} #98#return; {7506#true} is VALID [2022-04-27 13:08:06,190 INFO L290 TraceCheckUtils]: 20: Hoare triple {7506#true} assume true; {7506#true} is VALID [2022-04-27 13:08:06,190 INFO L290 TraceCheckUtils]: 19: Hoare triple {7506#true} assume !(0 == ~cond); {7506#true} is VALID [2022-04-27 13:08:06,190 INFO L290 TraceCheckUtils]: 18: Hoare triple {7506#true} ~cond := #in~cond; {7506#true} is VALID [2022-04-27 13:08:06,190 INFO L272 TraceCheckUtils]: 17: Hoare triple {7506#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {7506#true} is VALID [2022-04-27 13:08:06,190 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {7506#true} {7506#true} #96#return; {7506#true} is VALID [2022-04-27 13:08:06,190 INFO L290 TraceCheckUtils]: 15: Hoare triple {7506#true} assume true; {7506#true} is VALID [2022-04-27 13:08:06,190 INFO L290 TraceCheckUtils]: 14: Hoare triple {7506#true} assume !(0 == ~cond); {7506#true} is VALID [2022-04-27 13:08:06,190 INFO L290 TraceCheckUtils]: 13: Hoare triple {7506#true} ~cond := #in~cond; {7506#true} is VALID [2022-04-27 13:08:06,190 INFO L272 TraceCheckUtils]: 12: Hoare triple {7506#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 10 then 1 else 0)); {7506#true} is VALID [2022-04-27 13:08:06,190 INFO L290 TraceCheckUtils]: 11: Hoare triple {7506#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {7506#true} is VALID [2022-04-27 13:08:06,190 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7506#true} {7506#true} #94#return; {7506#true} is VALID [2022-04-27 13:08:06,190 INFO L290 TraceCheckUtils]: 9: Hoare triple {7506#true} assume true; {7506#true} is VALID [2022-04-27 13:08:06,190 INFO L290 TraceCheckUtils]: 8: Hoare triple {7506#true} assume !(0 == ~cond); {7506#true} is VALID [2022-04-27 13:08:06,190 INFO L290 TraceCheckUtils]: 7: Hoare triple {7506#true} ~cond := #in~cond; {7506#true} is VALID [2022-04-27 13:08:06,190 INFO L272 TraceCheckUtils]: 6: Hoare triple {7506#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 10 then 1 else 0)); {7506#true} is VALID [2022-04-27 13:08:06,190 INFO L290 TraceCheckUtils]: 5: Hoare triple {7506#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;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {7506#true} is VALID [2022-04-27 13:08:06,190 INFO L272 TraceCheckUtils]: 4: Hoare triple {7506#true} call #t~ret6 := main(); {7506#true} is VALID [2022-04-27 13:08:06,190 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7506#true} {7506#true} #112#return; {7506#true} is VALID [2022-04-27 13:08:06,190 INFO L290 TraceCheckUtils]: 2: Hoare triple {7506#true} assume true; {7506#true} is VALID [2022-04-27 13:08:06,190 INFO L290 TraceCheckUtils]: 1: Hoare triple {7506#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); {7506#true} is VALID [2022-04-27 13:08:06,191 INFO L272 TraceCheckUtils]: 0: Hoare triple {7506#true} call ULTIMATE.init(); {7506#true} is VALID [2022-04-27 13:08:06,191 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 10 proven. 11 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-04-27 13:08:06,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:08:06,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225268425] [2022-04-27 13:08:06,191 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:08:06,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2025849703] [2022-04-27 13:08:06,191 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2025849703] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 13:08:06,191 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 13:08:06,191 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 20 [2022-04-27 13:08:06,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365857741] [2022-04-27 13:08:06,191 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 13:08:06,192 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 2.4444444444444446) internal successors, (44), 19 states have internal predecessors, (44), 6 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) Word has length 64 [2022-04-27 13:08:06,192 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:08:06,192 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 18 states have (on average 2.4444444444444446) internal successors, (44), 19 states have internal predecessors, (44), 6 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-27 13:08:06,319 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:08:06,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-27 13:08:06,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:08:06,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-27 13:08:06,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2022-04-27 13:08:06,320 INFO L87 Difference]: Start difference. First operand 148 states and 205 transitions. Second operand has 20 states, 18 states have (on average 2.4444444444444446) internal successors, (44), 19 states have internal predecessors, (44), 6 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-27 13:08:18,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:08:18,385 INFO L93 Difference]: Finished difference Result 294 states and 426 transitions. [2022-04-27 13:08:18,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-04-27 13:08:18,385 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 2.4444444444444446) internal successors, (44), 19 states have internal predecessors, (44), 6 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) Word has length 64 [2022-04-27 13:08:18,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:08:18,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 18 states have (on average 2.4444444444444446) internal successors, (44), 19 states have internal predecessors, (44), 6 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-27 13:08:18,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 257 transitions. [2022-04-27 13:08:18,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 18 states have (on average 2.4444444444444446) internal successors, (44), 19 states have internal predecessors, (44), 6 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-27 13:08:18,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 257 transitions. [2022-04-27 13:08:18,412 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 257 transitions. [2022-04-27 13:08:19,754 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 257 edges. 257 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:08:19,760 INFO L225 Difference]: With dead ends: 294 [2022-04-27 13:08:19,760 INFO L226 Difference]: Without dead ends: 290 [2022-04-27 13:08:19,761 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 108 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 291 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=302, Invalid=1420, Unknown=0, NotChecked=0, Total=1722 [2022-04-27 13:08:19,761 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 141 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 1039 mSolverCounterSat, 316 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 1355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 316 IncrementalHoareTripleChecker+Valid, 1039 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2022-04-27 13:08:19,761 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 307 Invalid, 1355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [316 Valid, 1039 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2022-04-27 13:08:19,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2022-04-27 13:08:20,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 243. [2022-04-27 13:08:20,395 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:08:20,396 INFO L82 GeneralOperation]: Start isEquivalent. First operand 290 states. Second operand has 243 states, 143 states have (on average 1.1888111888111887) internal successors, (170), 151 states have internal predecessors, (170), 85 states have call successors, (85), 15 states have call predecessors, (85), 14 states have return successors, (83), 76 states have call predecessors, (83), 83 states have call successors, (83) [2022-04-27 13:08:20,396 INFO L74 IsIncluded]: Start isIncluded. First operand 290 states. Second operand has 243 states, 143 states have (on average 1.1888111888111887) internal successors, (170), 151 states have internal predecessors, (170), 85 states have call successors, (85), 15 states have call predecessors, (85), 14 states have return successors, (83), 76 states have call predecessors, (83), 83 states have call successors, (83) [2022-04-27 13:08:20,396 INFO L87 Difference]: Start difference. First operand 290 states. Second operand has 243 states, 143 states have (on average 1.1888111888111887) internal successors, (170), 151 states have internal predecessors, (170), 85 states have call successors, (85), 15 states have call predecessors, (85), 14 states have return successors, (83), 76 states have call predecessors, (83), 83 states have call successors, (83) [2022-04-27 13:08:20,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:08:20,404 INFO L93 Difference]: Finished difference Result 290 states and 418 transitions. [2022-04-27 13:08:20,404 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 418 transitions. [2022-04-27 13:08:20,405 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:08:20,405 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:08:20,405 INFO L74 IsIncluded]: Start isIncluded. First operand has 243 states, 143 states have (on average 1.1888111888111887) internal successors, (170), 151 states have internal predecessors, (170), 85 states have call successors, (85), 15 states have call predecessors, (85), 14 states have return successors, (83), 76 states have call predecessors, (83), 83 states have call successors, (83) Second operand 290 states. [2022-04-27 13:08:20,405 INFO L87 Difference]: Start difference. First operand has 243 states, 143 states have (on average 1.1888111888111887) internal successors, (170), 151 states have internal predecessors, (170), 85 states have call successors, (85), 15 states have call predecessors, (85), 14 states have return successors, (83), 76 states have call predecessors, (83), 83 states have call successors, (83) Second operand 290 states. [2022-04-27 13:08:20,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:08:20,412 INFO L93 Difference]: Finished difference Result 290 states and 418 transitions. [2022-04-27 13:08:20,412 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 418 transitions. [2022-04-27 13:08:20,413 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:08:20,413 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:08:20,413 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:08:20,413 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:08:20,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 143 states have (on average 1.1888111888111887) internal successors, (170), 151 states have internal predecessors, (170), 85 states have call successors, (85), 15 states have call predecessors, (85), 14 states have return successors, (83), 76 states have call predecessors, (83), 83 states have call successors, (83) [2022-04-27 13:08:20,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 338 transitions. [2022-04-27 13:08:20,419 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 338 transitions. Word has length 64 [2022-04-27 13:08:20,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:08:20,419 INFO L495 AbstractCegarLoop]: Abstraction has 243 states and 338 transitions. [2022-04-27 13:08:20,419 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 2.4444444444444446) internal successors, (44), 19 states have internal predecessors, (44), 6 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-27 13:08:20,419 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 338 transitions. [2022-04-27 13:08:20,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-04-27 13:08:20,420 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:08:20,420 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 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, 1, 1] [2022-04-27 13:08:20,447 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-27 13:08:20,636 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-04-27 13:08:20,637 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:08:20,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:08:20,637 INFO L85 PathProgramCache]: Analyzing trace with hash -298771846, now seen corresponding path program 1 times [2022-04-27 13:08:20,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:08:20,637 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257869973] [2022-04-27 13:08:20,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:08:20,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:08:20,656 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:08:20,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1262756507] [2022-04-27 13:08:20,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:08:20,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:08:20,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:08:20,657 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 13:08:20,658 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-04-27 13:08:20,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:08:20,700 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-27 13:08:20,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:08:20,710 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:08:20,917 INFO L272 TraceCheckUtils]: 0: Hoare triple {9399#true} call ULTIMATE.init(); {9399#true} is VALID [2022-04-27 13:08:20,917 INFO L290 TraceCheckUtils]: 1: Hoare triple {9399#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); {9399#true} is VALID [2022-04-27 13:08:20,917 INFO L290 TraceCheckUtils]: 2: Hoare triple {9399#true} assume true; {9399#true} is VALID [2022-04-27 13:08:20,917 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9399#true} {9399#true} #112#return; {9399#true} is VALID [2022-04-27 13:08:20,917 INFO L272 TraceCheckUtils]: 4: Hoare triple {9399#true} call #t~ret6 := main(); {9399#true} is VALID [2022-04-27 13:08:20,917 INFO L290 TraceCheckUtils]: 5: Hoare triple {9399#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;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {9399#true} is VALID [2022-04-27 13:08:20,917 INFO L272 TraceCheckUtils]: 6: Hoare triple {9399#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 10 then 1 else 0)); {9399#true} is VALID [2022-04-27 13:08:20,917 INFO L290 TraceCheckUtils]: 7: Hoare triple {9399#true} ~cond := #in~cond; {9399#true} is VALID [2022-04-27 13:08:20,917 INFO L290 TraceCheckUtils]: 8: Hoare triple {9399#true} assume !(0 == ~cond); {9399#true} is VALID [2022-04-27 13:08:20,917 INFO L290 TraceCheckUtils]: 9: Hoare triple {9399#true} assume true; {9399#true} is VALID [2022-04-27 13:08:20,917 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {9399#true} {9399#true} #94#return; {9399#true} is VALID [2022-04-27 13:08:20,917 INFO L290 TraceCheckUtils]: 11: Hoare triple {9399#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {9399#true} is VALID [2022-04-27 13:08:20,917 INFO L272 TraceCheckUtils]: 12: Hoare triple {9399#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 10 then 1 else 0)); {9399#true} is VALID [2022-04-27 13:08:20,917 INFO L290 TraceCheckUtils]: 13: Hoare triple {9399#true} ~cond := #in~cond; {9399#true} is VALID [2022-04-27 13:08:20,917 INFO L290 TraceCheckUtils]: 14: Hoare triple {9399#true} assume !(0 == ~cond); {9399#true} is VALID [2022-04-27 13:08:20,918 INFO L290 TraceCheckUtils]: 15: Hoare triple {9399#true} assume true; {9399#true} is VALID [2022-04-27 13:08:20,918 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {9399#true} {9399#true} #96#return; {9399#true} is VALID [2022-04-27 13:08:20,918 INFO L272 TraceCheckUtils]: 17: Hoare triple {9399#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {9399#true} is VALID [2022-04-27 13:08:20,918 INFO L290 TraceCheckUtils]: 18: Hoare triple {9399#true} ~cond := #in~cond; {9399#true} is VALID [2022-04-27 13:08:20,918 INFO L290 TraceCheckUtils]: 19: Hoare triple {9399#true} assume !(0 == ~cond); {9399#true} is VALID [2022-04-27 13:08:20,918 INFO L290 TraceCheckUtils]: 20: Hoare triple {9399#true} assume true; {9399#true} is VALID [2022-04-27 13:08:20,918 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {9399#true} {9399#true} #98#return; {9399#true} is VALID [2022-04-27 13:08:20,918 INFO L272 TraceCheckUtils]: 22: Hoare triple {9399#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {9399#true} is VALID [2022-04-27 13:08:20,918 INFO L290 TraceCheckUtils]: 23: Hoare triple {9399#true} ~cond := #in~cond; {9399#true} is VALID [2022-04-27 13:08:20,918 INFO L290 TraceCheckUtils]: 24: Hoare triple {9399#true} assume !(0 == ~cond); {9399#true} is VALID [2022-04-27 13:08:20,918 INFO L290 TraceCheckUtils]: 25: Hoare triple {9399#true} assume true; {9399#true} is VALID [2022-04-27 13:08:20,918 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {9399#true} {9399#true} #100#return; {9399#true} is VALID [2022-04-27 13:08:20,918 INFO L290 TraceCheckUtils]: 27: Hoare triple {9399#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {9399#true} is VALID [2022-04-27 13:08:20,918 INFO L290 TraceCheckUtils]: 28: Hoare triple {9399#true} assume !false; {9399#true} is VALID [2022-04-27 13:08:20,918 INFO L290 TraceCheckUtils]: 29: Hoare triple {9399#true} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {9399#true} is VALID [2022-04-27 13:08:20,918 INFO L290 TraceCheckUtils]: 30: Hoare triple {9399#true} assume !false; {9399#true} is VALID [2022-04-27 13:08:20,919 INFO L290 TraceCheckUtils]: 31: Hoare triple {9399#true} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {9497#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} is VALID [2022-04-27 13:08:20,919 INFO L290 TraceCheckUtils]: 32: Hoare triple {9497#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} assume !false; {9497#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} is VALID [2022-04-27 13:08:20,919 INFO L272 TraceCheckUtils]: 33: Hoare triple {9497#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {9399#true} is VALID [2022-04-27 13:08:20,919 INFO L290 TraceCheckUtils]: 34: Hoare triple {9399#true} ~cond := #in~cond; {9399#true} is VALID [2022-04-27 13:08:20,919 INFO L290 TraceCheckUtils]: 35: Hoare triple {9399#true} assume !(0 == ~cond); {9399#true} is VALID [2022-04-27 13:08:20,919 INFO L290 TraceCheckUtils]: 36: Hoare triple {9399#true} assume true; {9399#true} is VALID [2022-04-27 13:08:20,920 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {9399#true} {9497#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} #102#return; {9497#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} is VALID [2022-04-27 13:08:20,920 INFO L272 TraceCheckUtils]: 38: Hoare triple {9497#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {9399#true} is VALID [2022-04-27 13:08:20,920 INFO L290 TraceCheckUtils]: 39: Hoare triple {9399#true} ~cond := #in~cond; {9399#true} is VALID [2022-04-27 13:08:20,920 INFO L290 TraceCheckUtils]: 40: Hoare triple {9399#true} assume !(0 == ~cond); {9399#true} is VALID [2022-04-27 13:08:20,920 INFO L290 TraceCheckUtils]: 41: Hoare triple {9399#true} assume true; {9399#true} is VALID [2022-04-27 13:08:20,921 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {9399#true} {9497#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} #104#return; {9497#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} is VALID [2022-04-27 13:08:20,921 INFO L272 TraceCheckUtils]: 43: Hoare triple {9497#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {9399#true} is VALID [2022-04-27 13:08:20,921 INFO L290 TraceCheckUtils]: 44: Hoare triple {9399#true} ~cond := #in~cond; {9399#true} is VALID [2022-04-27 13:08:20,921 INFO L290 TraceCheckUtils]: 45: Hoare triple {9399#true} assume !(0 == ~cond); {9399#true} is VALID [2022-04-27 13:08:20,921 INFO L290 TraceCheckUtils]: 46: Hoare triple {9399#true} assume true; {9399#true} is VALID [2022-04-27 13:08:20,921 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {9399#true} {9497#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} #106#return; {9497#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} is VALID [2022-04-27 13:08:20,921 INFO L272 TraceCheckUtils]: 48: Hoare triple {9497#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {9399#true} is VALID [2022-04-27 13:08:20,921 INFO L290 TraceCheckUtils]: 49: Hoare triple {9399#true} ~cond := #in~cond; {9552#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:08:20,922 INFO L290 TraceCheckUtils]: 50: Hoare triple {9552#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {9556#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:08:20,922 INFO L290 TraceCheckUtils]: 51: Hoare triple {9556#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {9556#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:08:20,922 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {9556#(not (= |__VERIFIER_assert_#in~cond| 0))} {9497#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} #108#return; {9497#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} is VALID [2022-04-27 13:08:20,923 INFO L290 TraceCheckUtils]: 53: Hoare triple {9497#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} assume !!(~c~0 >= 2 * ~v~0);~d~0 := 2 * ~d~0;~v~0 := 2 * ~v~0; {9566#(and (= main_~v~0 (* main_~b~0 2)) (= main_~d~0 2))} is VALID [2022-04-27 13:08:20,923 INFO L290 TraceCheckUtils]: 54: Hoare triple {9566#(and (= main_~v~0 (* main_~b~0 2)) (= main_~d~0 2))} assume !false; {9566#(and (= main_~v~0 (* main_~b~0 2)) (= main_~d~0 2))} is VALID [2022-04-27 13:08:20,923 INFO L272 TraceCheckUtils]: 55: Hoare triple {9566#(and (= main_~v~0 (* main_~b~0 2)) (= main_~d~0 2))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {9399#true} is VALID [2022-04-27 13:08:20,923 INFO L290 TraceCheckUtils]: 56: Hoare triple {9399#true} ~cond := #in~cond; {9399#true} is VALID [2022-04-27 13:08:20,923 INFO L290 TraceCheckUtils]: 57: Hoare triple {9399#true} assume !(0 == ~cond); {9399#true} is VALID [2022-04-27 13:08:20,923 INFO L290 TraceCheckUtils]: 58: Hoare triple {9399#true} assume true; {9399#true} is VALID [2022-04-27 13:08:20,924 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {9399#true} {9566#(and (= main_~v~0 (* main_~b~0 2)) (= main_~d~0 2))} #102#return; {9566#(and (= main_~v~0 (* main_~b~0 2)) (= main_~d~0 2))} is VALID [2022-04-27 13:08:20,924 INFO L272 TraceCheckUtils]: 60: Hoare triple {9566#(and (= main_~v~0 (* main_~b~0 2)) (= main_~d~0 2))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {9399#true} is VALID [2022-04-27 13:08:20,924 INFO L290 TraceCheckUtils]: 61: Hoare triple {9399#true} ~cond := #in~cond; {9399#true} is VALID [2022-04-27 13:08:20,924 INFO L290 TraceCheckUtils]: 62: Hoare triple {9399#true} assume !(0 == ~cond); {9399#true} is VALID [2022-04-27 13:08:20,924 INFO L290 TraceCheckUtils]: 63: Hoare triple {9399#true} assume true; {9399#true} is VALID [2022-04-27 13:08:20,924 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {9399#true} {9566#(and (= main_~v~0 (* main_~b~0 2)) (= main_~d~0 2))} #104#return; {9566#(and (= main_~v~0 (* main_~b~0 2)) (= main_~d~0 2))} is VALID [2022-04-27 13:08:20,924 INFO L272 TraceCheckUtils]: 65: Hoare triple {9566#(and (= main_~v~0 (* main_~b~0 2)) (= main_~d~0 2))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {9399#true} is VALID [2022-04-27 13:08:20,925 INFO L290 TraceCheckUtils]: 66: Hoare triple {9399#true} ~cond := #in~cond; {9399#true} is VALID [2022-04-27 13:08:20,925 INFO L290 TraceCheckUtils]: 67: Hoare triple {9399#true} assume !(0 == ~cond); {9399#true} is VALID [2022-04-27 13:08:20,925 INFO L290 TraceCheckUtils]: 68: Hoare triple {9399#true} assume true; {9399#true} is VALID [2022-04-27 13:08:20,925 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {9399#true} {9566#(and (= main_~v~0 (* main_~b~0 2)) (= main_~d~0 2))} #106#return; {9566#(and (= main_~v~0 (* main_~b~0 2)) (= main_~d~0 2))} is VALID [2022-04-27 13:08:20,926 INFO L272 TraceCheckUtils]: 70: Hoare triple {9566#(and (= main_~v~0 (* main_~b~0 2)) (= main_~d~0 2))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {9618#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:08:20,926 INFO L290 TraceCheckUtils]: 71: Hoare triple {9618#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {9622#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:08:20,926 INFO L290 TraceCheckUtils]: 72: Hoare triple {9622#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {9400#false} is VALID [2022-04-27 13:08:20,926 INFO L290 TraceCheckUtils]: 73: Hoare triple {9400#false} assume !false; {9400#false} is VALID [2022-04-27 13:08:20,927 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 22 proven. 15 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2022-04-27 13:08:20,927 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:08:29,720 INFO L290 TraceCheckUtils]: 73: Hoare triple {9400#false} assume !false; {9400#false} is VALID [2022-04-27 13:08:29,721 INFO L290 TraceCheckUtils]: 72: Hoare triple {9622#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {9400#false} is VALID [2022-04-27 13:08:29,722 INFO L290 TraceCheckUtils]: 71: Hoare triple {9618#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {9622#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:08:29,722 INFO L272 TraceCheckUtils]: 70: Hoare triple {9638#(= main_~v~0 (* main_~d~0 main_~b~0))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {9618#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:08:29,723 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {9399#true} {9638#(= main_~v~0 (* main_~d~0 main_~b~0))} #106#return; {9638#(= main_~v~0 (* main_~d~0 main_~b~0))} is VALID [2022-04-27 13:08:29,723 INFO L290 TraceCheckUtils]: 68: Hoare triple {9399#true} assume true; {9399#true} is VALID [2022-04-27 13:08:29,723 INFO L290 TraceCheckUtils]: 67: Hoare triple {9399#true} assume !(0 == ~cond); {9399#true} is VALID [2022-04-27 13:08:29,723 INFO L290 TraceCheckUtils]: 66: Hoare triple {9399#true} ~cond := #in~cond; {9399#true} is VALID [2022-04-27 13:08:29,723 INFO L272 TraceCheckUtils]: 65: Hoare triple {9638#(= main_~v~0 (* main_~d~0 main_~b~0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {9399#true} is VALID [2022-04-27 13:08:29,723 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {9399#true} {9638#(= main_~v~0 (* main_~d~0 main_~b~0))} #104#return; {9638#(= main_~v~0 (* main_~d~0 main_~b~0))} is VALID [2022-04-27 13:08:29,723 INFO L290 TraceCheckUtils]: 63: Hoare triple {9399#true} assume true; {9399#true} is VALID [2022-04-27 13:08:29,723 INFO L290 TraceCheckUtils]: 62: Hoare triple {9399#true} assume !(0 == ~cond); {9399#true} is VALID [2022-04-27 13:08:29,724 INFO L290 TraceCheckUtils]: 61: Hoare triple {9399#true} ~cond := #in~cond; {9399#true} is VALID [2022-04-27 13:08:29,724 INFO L272 TraceCheckUtils]: 60: Hoare triple {9638#(= main_~v~0 (* main_~d~0 main_~b~0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {9399#true} is VALID [2022-04-27 13:08:29,724 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {9399#true} {9638#(= main_~v~0 (* main_~d~0 main_~b~0))} #102#return; {9638#(= main_~v~0 (* main_~d~0 main_~b~0))} is VALID [2022-04-27 13:08:29,724 INFO L290 TraceCheckUtils]: 58: Hoare triple {9399#true} assume true; {9399#true} is VALID [2022-04-27 13:08:29,724 INFO L290 TraceCheckUtils]: 57: Hoare triple {9399#true} assume !(0 == ~cond); {9399#true} is VALID [2022-04-27 13:08:29,724 INFO L290 TraceCheckUtils]: 56: Hoare triple {9399#true} ~cond := #in~cond; {9399#true} is VALID [2022-04-27 13:08:29,724 INFO L272 TraceCheckUtils]: 55: Hoare triple {9638#(= main_~v~0 (* main_~d~0 main_~b~0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {9399#true} is VALID [2022-04-27 13:08:29,725 INFO L290 TraceCheckUtils]: 54: Hoare triple {9638#(= main_~v~0 (* main_~d~0 main_~b~0))} assume !false; {9638#(= main_~v~0 (* main_~d~0 main_~b~0))} is VALID [2022-04-27 13:08:29,726 INFO L290 TraceCheckUtils]: 53: Hoare triple {9638#(= main_~v~0 (* main_~d~0 main_~b~0))} assume !!(~c~0 >= 2 * ~v~0);~d~0 := 2 * ~d~0;~v~0 := 2 * ~v~0; {9638#(= main_~v~0 (* main_~d~0 main_~b~0))} is VALID [2022-04-27 13:08:29,727 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {9556#(not (= |__VERIFIER_assert_#in~cond| 0))} {9399#true} #108#return; {9638#(= main_~v~0 (* main_~d~0 main_~b~0))} is VALID [2022-04-27 13:08:29,727 INFO L290 TraceCheckUtils]: 51: Hoare triple {9556#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {9556#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:08:29,727 INFO L290 TraceCheckUtils]: 50: Hoare triple {9702#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {9556#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:08:29,728 INFO L290 TraceCheckUtils]: 49: Hoare triple {9399#true} ~cond := #in~cond; {9702#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 13:08:29,728 INFO L272 TraceCheckUtils]: 48: Hoare triple {9399#true} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {9399#true} is VALID [2022-04-27 13:08:29,728 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {9399#true} {9399#true} #106#return; {9399#true} is VALID [2022-04-27 13:08:29,728 INFO L290 TraceCheckUtils]: 46: Hoare triple {9399#true} assume true; {9399#true} is VALID [2022-04-27 13:08:29,728 INFO L290 TraceCheckUtils]: 45: Hoare triple {9399#true} assume !(0 == ~cond); {9399#true} is VALID [2022-04-27 13:08:29,728 INFO L290 TraceCheckUtils]: 44: Hoare triple {9399#true} ~cond := #in~cond; {9399#true} is VALID [2022-04-27 13:08:29,728 INFO L272 TraceCheckUtils]: 43: Hoare triple {9399#true} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {9399#true} is VALID [2022-04-27 13:08:29,728 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {9399#true} {9399#true} #104#return; {9399#true} is VALID [2022-04-27 13:08:29,728 INFO L290 TraceCheckUtils]: 41: Hoare triple {9399#true} assume true; {9399#true} is VALID [2022-04-27 13:08:29,728 INFO L290 TraceCheckUtils]: 40: Hoare triple {9399#true} assume !(0 == ~cond); {9399#true} is VALID [2022-04-27 13:08:29,728 INFO L290 TraceCheckUtils]: 39: Hoare triple {9399#true} ~cond := #in~cond; {9399#true} is VALID [2022-04-27 13:08:29,728 INFO L272 TraceCheckUtils]: 38: Hoare triple {9399#true} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {9399#true} is VALID [2022-04-27 13:08:29,728 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {9399#true} {9399#true} #102#return; {9399#true} is VALID [2022-04-27 13:08:29,728 INFO L290 TraceCheckUtils]: 36: Hoare triple {9399#true} assume true; {9399#true} is VALID [2022-04-27 13:08:29,728 INFO L290 TraceCheckUtils]: 35: Hoare triple {9399#true} assume !(0 == ~cond); {9399#true} is VALID [2022-04-27 13:08:29,728 INFO L290 TraceCheckUtils]: 34: Hoare triple {9399#true} ~cond := #in~cond; {9399#true} is VALID [2022-04-27 13:08:29,728 INFO L272 TraceCheckUtils]: 33: Hoare triple {9399#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {9399#true} is VALID [2022-04-27 13:08:29,729 INFO L290 TraceCheckUtils]: 32: Hoare triple {9399#true} assume !false; {9399#true} is VALID [2022-04-27 13:08:29,729 INFO L290 TraceCheckUtils]: 31: Hoare triple {9399#true} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {9399#true} is VALID [2022-04-27 13:08:29,729 INFO L290 TraceCheckUtils]: 30: Hoare triple {9399#true} assume !false; {9399#true} is VALID [2022-04-27 13:08:29,729 INFO L290 TraceCheckUtils]: 29: Hoare triple {9399#true} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {9399#true} is VALID [2022-04-27 13:08:29,729 INFO L290 TraceCheckUtils]: 28: Hoare triple {9399#true} assume !false; {9399#true} is VALID [2022-04-27 13:08:29,729 INFO L290 TraceCheckUtils]: 27: Hoare triple {9399#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {9399#true} is VALID [2022-04-27 13:08:29,729 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {9399#true} {9399#true} #100#return; {9399#true} is VALID [2022-04-27 13:08:29,729 INFO L290 TraceCheckUtils]: 25: Hoare triple {9399#true} assume true; {9399#true} is VALID [2022-04-27 13:08:29,729 INFO L290 TraceCheckUtils]: 24: Hoare triple {9399#true} assume !(0 == ~cond); {9399#true} is VALID [2022-04-27 13:08:29,729 INFO L290 TraceCheckUtils]: 23: Hoare triple {9399#true} ~cond := #in~cond; {9399#true} is VALID [2022-04-27 13:08:29,729 INFO L272 TraceCheckUtils]: 22: Hoare triple {9399#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {9399#true} is VALID [2022-04-27 13:08:29,729 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {9399#true} {9399#true} #98#return; {9399#true} is VALID [2022-04-27 13:08:29,729 INFO L290 TraceCheckUtils]: 20: Hoare triple {9399#true} assume true; {9399#true} is VALID [2022-04-27 13:08:29,729 INFO L290 TraceCheckUtils]: 19: Hoare triple {9399#true} assume !(0 == ~cond); {9399#true} is VALID [2022-04-27 13:08:29,729 INFO L290 TraceCheckUtils]: 18: Hoare triple {9399#true} ~cond := #in~cond; {9399#true} is VALID [2022-04-27 13:08:29,729 INFO L272 TraceCheckUtils]: 17: Hoare triple {9399#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {9399#true} is VALID [2022-04-27 13:08:29,729 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {9399#true} {9399#true} #96#return; {9399#true} is VALID [2022-04-27 13:08:29,729 INFO L290 TraceCheckUtils]: 15: Hoare triple {9399#true} assume true; {9399#true} is VALID [2022-04-27 13:08:29,729 INFO L290 TraceCheckUtils]: 14: Hoare triple {9399#true} assume !(0 == ~cond); {9399#true} is VALID [2022-04-27 13:08:29,729 INFO L290 TraceCheckUtils]: 13: Hoare triple {9399#true} ~cond := #in~cond; {9399#true} is VALID [2022-04-27 13:08:29,729 INFO L272 TraceCheckUtils]: 12: Hoare triple {9399#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 10 then 1 else 0)); {9399#true} is VALID [2022-04-27 13:08:29,729 INFO L290 TraceCheckUtils]: 11: Hoare triple {9399#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {9399#true} is VALID [2022-04-27 13:08:29,730 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {9399#true} {9399#true} #94#return; {9399#true} is VALID [2022-04-27 13:08:29,730 INFO L290 TraceCheckUtils]: 9: Hoare triple {9399#true} assume true; {9399#true} is VALID [2022-04-27 13:08:29,730 INFO L290 TraceCheckUtils]: 8: Hoare triple {9399#true} assume !(0 == ~cond); {9399#true} is VALID [2022-04-27 13:08:29,730 INFO L290 TraceCheckUtils]: 7: Hoare triple {9399#true} ~cond := #in~cond; {9399#true} is VALID [2022-04-27 13:08:29,730 INFO L272 TraceCheckUtils]: 6: Hoare triple {9399#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 10 then 1 else 0)); {9399#true} is VALID [2022-04-27 13:08:29,730 INFO L290 TraceCheckUtils]: 5: Hoare triple {9399#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;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {9399#true} is VALID [2022-04-27 13:08:29,730 INFO L272 TraceCheckUtils]: 4: Hoare triple {9399#true} call #t~ret6 := main(); {9399#true} is VALID [2022-04-27 13:08:29,730 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9399#true} {9399#true} #112#return; {9399#true} is VALID [2022-04-27 13:08:29,730 INFO L290 TraceCheckUtils]: 2: Hoare triple {9399#true} assume true; {9399#true} is VALID [2022-04-27 13:08:29,730 INFO L290 TraceCheckUtils]: 1: Hoare triple {9399#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); {9399#true} is VALID [2022-04-27 13:08:29,730 INFO L272 TraceCheckUtils]: 0: Hoare triple {9399#true} call ULTIMATE.init(); {9399#true} is VALID [2022-04-27 13:08:29,730 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 27 proven. 10 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2022-04-27 13:08:29,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:08:29,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257869973] [2022-04-27 13:08:29,730 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:08:29,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1262756507] [2022-04-27 13:08:29,730 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1262756507] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 13:08:29,730 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 13:08:29,731 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 10 [2022-04-27 13:08:29,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658317065] [2022-04-27 13:08:29,731 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 13:08:29,731 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 9 states have internal predecessors, (30), 4 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (19), 4 states have call predecessors, (19), 4 states have call successors, (19) Word has length 74 [2022-04-27 13:08:29,731 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:08:29,731 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 3.0) internal successors, (30), 9 states have internal predecessors, (30), 4 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (19), 4 states have call predecessors, (19), 4 states have call successors, (19) [2022-04-27 13:08:29,783 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:08:29,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-27 13:08:29,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:08:29,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-27 13:08:29,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-04-27 13:08:29,784 INFO L87 Difference]: Start difference. First operand 243 states and 338 transitions. Second operand has 10 states, 10 states have (on average 3.0) internal successors, (30), 9 states have internal predecessors, (30), 4 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (19), 4 states have call predecessors, (19), 4 states have call successors, (19) [2022-04-27 13:08:31,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:08:31,124 INFO L93 Difference]: Finished difference Result 347 states and 502 transitions. [2022-04-27 13:08:31,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-27 13:08:31,124 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 9 states have internal predecessors, (30), 4 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (19), 4 states have call predecessors, (19), 4 states have call successors, (19) Word has length 74 [2022-04-27 13:08:31,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:08:31,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.0) internal successors, (30), 9 states have internal predecessors, (30), 4 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (19), 4 states have call predecessors, (19), 4 states have call successors, (19) [2022-04-27 13:08:31,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 85 transitions. [2022-04-27 13:08:31,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.0) internal successors, (30), 9 states have internal predecessors, (30), 4 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (19), 4 states have call predecessors, (19), 4 states have call successors, (19) [2022-04-27 13:08:31,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 85 transitions. [2022-04-27 13:08:31,126 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 85 transitions. [2022-04-27 13:08:31,195 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-27 13:08:31,202 INFO L225 Difference]: With dead ends: 347 [2022-04-27 13:08:31,202 INFO L226 Difference]: Without dead ends: 345 [2022-04-27 13:08:31,202 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 136 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-04-27 13:08:31,203 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 29 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 13:08:31,203 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 197 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 13:08:31,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2022-04-27 13:08:31,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 247. [2022-04-27 13:08:31,706 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:08:31,707 INFO L82 GeneralOperation]: Start isEquivalent. First operand 345 states. Second operand has 247 states, 146 states have (on average 1.1849315068493151) internal successors, (173), 154 states have internal predecessors, (173), 85 states have call successors, (85), 16 states have call predecessors, (85), 15 states have return successors, (83), 76 states have call predecessors, (83), 83 states have call successors, (83) [2022-04-27 13:08:31,707 INFO L74 IsIncluded]: Start isIncluded. First operand 345 states. Second operand has 247 states, 146 states have (on average 1.1849315068493151) internal successors, (173), 154 states have internal predecessors, (173), 85 states have call successors, (85), 16 states have call predecessors, (85), 15 states have return successors, (83), 76 states have call predecessors, (83), 83 states have call successors, (83) [2022-04-27 13:08:31,707 INFO L87 Difference]: Start difference. First operand 345 states. Second operand has 247 states, 146 states have (on average 1.1849315068493151) internal successors, (173), 154 states have internal predecessors, (173), 85 states have call successors, (85), 16 states have call predecessors, (85), 15 states have return successors, (83), 76 states have call predecessors, (83), 83 states have call successors, (83) [2022-04-27 13:08:31,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:08:31,715 INFO L93 Difference]: Finished difference Result 345 states and 500 transitions. [2022-04-27 13:08:31,715 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 500 transitions. [2022-04-27 13:08:31,716 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:08:31,716 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:08:31,716 INFO L74 IsIncluded]: Start isIncluded. First operand has 247 states, 146 states have (on average 1.1849315068493151) internal successors, (173), 154 states have internal predecessors, (173), 85 states have call successors, (85), 16 states have call predecessors, (85), 15 states have return successors, (83), 76 states have call predecessors, (83), 83 states have call successors, (83) Second operand 345 states. [2022-04-27 13:08:31,717 INFO L87 Difference]: Start difference. First operand has 247 states, 146 states have (on average 1.1849315068493151) internal successors, (173), 154 states have internal predecessors, (173), 85 states have call successors, (85), 16 states have call predecessors, (85), 15 states have return successors, (83), 76 states have call predecessors, (83), 83 states have call successors, (83) Second operand 345 states. [2022-04-27 13:08:31,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:08:31,724 INFO L93 Difference]: Finished difference Result 345 states and 500 transitions. [2022-04-27 13:08:31,724 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 500 transitions. [2022-04-27 13:08:31,725 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:08:31,725 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:08:31,725 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:08:31,725 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:08:31,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 146 states have (on average 1.1849315068493151) internal successors, (173), 154 states have internal predecessors, (173), 85 states have call successors, (85), 16 states have call predecessors, (85), 15 states have return successors, (83), 76 states have call predecessors, (83), 83 states have call successors, (83) [2022-04-27 13:08:31,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 341 transitions. [2022-04-27 13:08:31,731 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 341 transitions. Word has length 74 [2022-04-27 13:08:31,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:08:31,731 INFO L495 AbstractCegarLoop]: Abstraction has 247 states and 341 transitions. [2022-04-27 13:08:31,731 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 9 states have internal predecessors, (30), 4 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (19), 4 states have call predecessors, (19), 4 states have call successors, (19) [2022-04-27 13:08:31,731 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 341 transitions. [2022-04-27 13:08:31,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-04-27 13:08:31,731 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:08:31,732 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:08:31,749 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-04-27 13:08:31,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-04-27 13:08:31,947 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:08:31,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:08:31,948 INFO L85 PathProgramCache]: Analyzing trace with hash -2089538094, now seen corresponding path program 1 times [2022-04-27 13:08:31,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:08:31,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754331837] [2022-04-27 13:08:31,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:08:31,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:08:31,959 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:08:31,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [691445977] [2022-04-27 13:08:31,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:08:31,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:08:31,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:08:31,963 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 13:08:31,965 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-04-27 13:08:32,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:08:32,006 INFO L263 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 38 conjunts are in the unsatisfiable core [2022-04-27 13:08:32,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:08:32,019 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:08:36,308 INFO L272 TraceCheckUtils]: 0: Hoare triple {11485#true} call ULTIMATE.init(); {11485#true} is VALID [2022-04-27 13:08:36,309 INFO L290 TraceCheckUtils]: 1: Hoare triple {11485#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); {11485#true} is VALID [2022-04-27 13:08:36,309 INFO L290 TraceCheckUtils]: 2: Hoare triple {11485#true} assume true; {11485#true} is VALID [2022-04-27 13:08:36,309 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11485#true} {11485#true} #112#return; {11485#true} is VALID [2022-04-27 13:08:36,309 INFO L272 TraceCheckUtils]: 4: Hoare triple {11485#true} call #t~ret6 := main(); {11485#true} is VALID [2022-04-27 13:08:36,309 INFO L290 TraceCheckUtils]: 5: Hoare triple {11485#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;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {11485#true} is VALID [2022-04-27 13:08:36,309 INFO L272 TraceCheckUtils]: 6: Hoare triple {11485#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 10 then 1 else 0)); {11485#true} is VALID [2022-04-27 13:08:36,309 INFO L290 TraceCheckUtils]: 7: Hoare triple {11485#true} ~cond := #in~cond; {11485#true} is VALID [2022-04-27 13:08:36,309 INFO L290 TraceCheckUtils]: 8: Hoare triple {11485#true} assume !(0 == ~cond); {11485#true} is VALID [2022-04-27 13:08:36,309 INFO L290 TraceCheckUtils]: 9: Hoare triple {11485#true} assume true; {11485#true} is VALID [2022-04-27 13:08:36,309 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {11485#true} {11485#true} #94#return; {11485#true} is VALID [2022-04-27 13:08:36,309 INFO L290 TraceCheckUtils]: 11: Hoare triple {11485#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {11485#true} is VALID [2022-04-27 13:08:36,309 INFO L272 TraceCheckUtils]: 12: Hoare triple {11485#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 10 then 1 else 0)); {11485#true} is VALID [2022-04-27 13:08:36,309 INFO L290 TraceCheckUtils]: 13: Hoare triple {11485#true} ~cond := #in~cond; {11485#true} is VALID [2022-04-27 13:08:36,309 INFO L290 TraceCheckUtils]: 14: Hoare triple {11485#true} assume !(0 == ~cond); {11485#true} is VALID [2022-04-27 13:08:36,309 INFO L290 TraceCheckUtils]: 15: Hoare triple {11485#true} assume true; {11485#true} is VALID [2022-04-27 13:08:36,309 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {11485#true} {11485#true} #96#return; {11485#true} is VALID [2022-04-27 13:08:36,309 INFO L272 TraceCheckUtils]: 17: Hoare triple {11485#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {11485#true} is VALID [2022-04-27 13:08:36,309 INFO L290 TraceCheckUtils]: 18: Hoare triple {11485#true} ~cond := #in~cond; {11485#true} is VALID [2022-04-27 13:08:36,309 INFO L290 TraceCheckUtils]: 19: Hoare triple {11485#true} assume !(0 == ~cond); {11485#true} is VALID [2022-04-27 13:08:36,309 INFO L290 TraceCheckUtils]: 20: Hoare triple {11485#true} assume true; {11485#true} is VALID [2022-04-27 13:08:36,310 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {11485#true} {11485#true} #98#return; {11485#true} is VALID [2022-04-27 13:08:36,310 INFO L272 TraceCheckUtils]: 22: Hoare triple {11485#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {11485#true} is VALID [2022-04-27 13:08:36,310 INFO L290 TraceCheckUtils]: 23: Hoare triple {11485#true} ~cond := #in~cond; {11485#true} is VALID [2022-04-27 13:08:36,310 INFO L290 TraceCheckUtils]: 24: Hoare triple {11485#true} assume !(0 == ~cond); {11485#true} is VALID [2022-04-27 13:08:36,310 INFO L290 TraceCheckUtils]: 25: Hoare triple {11485#true} assume true; {11485#true} is VALID [2022-04-27 13:08:36,310 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {11485#true} {11485#true} #100#return; {11485#true} is VALID [2022-04-27 13:08:36,310 INFO L290 TraceCheckUtils]: 27: Hoare triple {11485#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {11571#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:08:36,310 INFO L290 TraceCheckUtils]: 28: Hoare triple {11571#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !false; {11571#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:08:36,311 INFO L290 TraceCheckUtils]: 29: Hoare triple {11571#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {11578#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:08:36,312 INFO L290 TraceCheckUtils]: 30: Hoare triple {11578#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} assume !false; {11578#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:08:36,312 INFO L290 TraceCheckUtils]: 31: Hoare triple {11578#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} assume !(~c~0 >= ~b~0); {11578#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:08:36,313 INFO L290 TraceCheckUtils]: 32: Hoare triple {11578#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= 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; {11588#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-27 13:08:36,314 INFO L290 TraceCheckUtils]: 33: Hoare triple {11588#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} assume !false; {11588#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-27 13:08:36,314 INFO L290 TraceCheckUtils]: 34: Hoare triple {11588#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {11588#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-27 13:08:36,315 INFO L290 TraceCheckUtils]: 35: Hoare triple {11588#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} assume !false; {11588#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-27 13:08:36,315 INFO L290 TraceCheckUtils]: 36: Hoare triple {11588#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {11588#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-27 13:08:36,315 INFO L290 TraceCheckUtils]: 37: Hoare triple {11588#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} assume !false; {11588#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-27 13:08:36,315 INFO L272 TraceCheckUtils]: 38: Hoare triple {11588#(and (= main_~s~0 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)); {11485#true} is VALID [2022-04-27 13:08:36,315 INFO L290 TraceCheckUtils]: 39: Hoare triple {11485#true} ~cond := #in~cond; {11485#true} is VALID [2022-04-27 13:08:36,315 INFO L290 TraceCheckUtils]: 40: Hoare triple {11485#true} assume !(0 == ~cond); {11485#true} is VALID [2022-04-27 13:08:36,315 INFO L290 TraceCheckUtils]: 41: Hoare triple {11485#true} assume true; {11485#true} is VALID [2022-04-27 13:08:36,316 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {11485#true} {11588#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} #102#return; {11588#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-27 13:08:36,316 INFO L272 TraceCheckUtils]: 43: Hoare triple {11588#(and (= main_~s~0 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)); {11485#true} is VALID [2022-04-27 13:08:36,316 INFO L290 TraceCheckUtils]: 44: Hoare triple {11485#true} ~cond := #in~cond; {11625#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:08:36,317 INFO L290 TraceCheckUtils]: 45: Hoare triple {11625#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {11629#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:08:36,317 INFO L290 TraceCheckUtils]: 46: Hoare triple {11629#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {11629#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:08:36,317 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {11629#(not (= |__VERIFIER_assert_#in~cond| 0))} {11588#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} #104#return; {11588#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-27 13:08:36,317 INFO L272 TraceCheckUtils]: 48: Hoare triple {11588#(and (= main_~s~0 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)); {11485#true} is VALID [2022-04-27 13:08:36,317 INFO L290 TraceCheckUtils]: 49: Hoare triple {11485#true} ~cond := #in~cond; {11485#true} is VALID [2022-04-27 13:08:36,317 INFO L290 TraceCheckUtils]: 50: Hoare triple {11485#true} assume !(0 == ~cond); {11485#true} is VALID [2022-04-27 13:08:36,318 INFO L290 TraceCheckUtils]: 51: Hoare triple {11485#true} assume true; {11485#true} is VALID [2022-04-27 13:08:36,318 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {11485#true} {11588#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} #106#return; {11588#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-27 13:08:36,318 INFO L272 TraceCheckUtils]: 53: Hoare triple {11588#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {11485#true} is VALID [2022-04-27 13:08:36,318 INFO L290 TraceCheckUtils]: 54: Hoare triple {11485#true} ~cond := #in~cond; {11485#true} is VALID [2022-04-27 13:08:36,318 INFO L290 TraceCheckUtils]: 55: Hoare triple {11485#true} assume !(0 == ~cond); {11485#true} is VALID [2022-04-27 13:08:36,318 INFO L290 TraceCheckUtils]: 56: Hoare triple {11485#true} assume true; {11485#true} is VALID [2022-04-27 13:08:36,319 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {11485#true} {11588#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} #108#return; {11588#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-27 13:08:36,319 INFO L290 TraceCheckUtils]: 58: Hoare triple {11588#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} assume !(~c~0 >= 2 * ~v~0); {11588#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-27 13:08:36,321 INFO L290 TraceCheckUtils]: 59: Hoare triple {11588#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {11588#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-27 13:08:36,321 INFO L290 TraceCheckUtils]: 60: Hoare triple {11588#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} assume !false; {11588#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-27 13:08:36,322 INFO L290 TraceCheckUtils]: 61: Hoare triple {11588#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} assume !(~c~0 >= ~b~0); {11588#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-27 13:08:36,322 INFO L290 TraceCheckUtils]: 62: Hoare triple {11588#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= 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; {11681#(and (= main_~r~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:08:36,322 INFO L290 TraceCheckUtils]: 63: Hoare triple {11681#(and (= main_~r~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !false; {11681#(and (= main_~r~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:08:36,323 INFO L290 TraceCheckUtils]: 64: Hoare triple {11681#(and (= main_~r~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {11681#(and (= main_~r~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:08:36,323 INFO L290 TraceCheckUtils]: 65: Hoare triple {11681#(and (= main_~r~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !false; {11681#(and (= main_~r~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:08:36,323 INFO L290 TraceCheckUtils]: 66: Hoare triple {11681#(and (= main_~r~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {11681#(and (= main_~r~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:08:36,324 INFO L290 TraceCheckUtils]: 67: Hoare triple {11681#(and (= main_~r~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !false; {11681#(and (= main_~r~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:08:36,324 INFO L272 TraceCheckUtils]: 68: Hoare triple {11681#(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)); {11700#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:08:36,324 INFO L290 TraceCheckUtils]: 69: Hoare triple {11700#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {11704#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:08:36,325 INFO L290 TraceCheckUtils]: 70: Hoare triple {11704#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {11486#false} is VALID [2022-04-27 13:08:36,325 INFO L290 TraceCheckUtils]: 71: Hoare triple {11486#false} assume !false; {11486#false} is VALID [2022-04-27 13:08:36,334 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 10 proven. 26 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2022-04-27 13:08:36,334 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:08:48,169 INFO L290 TraceCheckUtils]: 71: Hoare triple {11486#false} assume !false; {11486#false} is VALID [2022-04-27 13:08:48,169 INFO L290 TraceCheckUtils]: 70: Hoare triple {11704#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {11486#false} is VALID [2022-04-27 13:08:48,169 INFO L290 TraceCheckUtils]: 69: Hoare triple {11700#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {11704#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:08:48,170 INFO L272 TraceCheckUtils]: 68: Hoare triple {11720#(= 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)); {11700#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:08:48,170 INFO L290 TraceCheckUtils]: 67: Hoare triple {11720#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !false; {11720#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 13:08:48,171 INFO L290 TraceCheckUtils]: 66: Hoare triple {11720#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {11720#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 13:08:48,171 INFO L290 TraceCheckUtils]: 65: Hoare triple {11720#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !false; {11720#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 13:08:48,171 INFO L290 TraceCheckUtils]: 64: Hoare triple {11720#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {11720#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 13:08:48,172 INFO L290 TraceCheckUtils]: 63: Hoare triple {11720#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !false; {11720#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 13:08:48,172 INFO L290 TraceCheckUtils]: 62: Hoare triple {11739#(= 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; {11720#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 13:08:48,172 INFO L290 TraceCheckUtils]: 61: Hoare triple {11739#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !(~c~0 >= ~b~0); {11739#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 13:08:48,173 INFO L290 TraceCheckUtils]: 60: Hoare triple {11739#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !false; {11739#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 13:08:48,173 INFO L290 TraceCheckUtils]: 59: Hoare triple {11739#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {11739#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 13:08:48,173 INFO L290 TraceCheckUtils]: 58: Hoare triple {11739#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !(~c~0 >= 2 * ~v~0); {11739#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 13:08:48,174 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {11485#true} {11739#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #108#return; {11739#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 13:08:48,174 INFO L290 TraceCheckUtils]: 56: Hoare triple {11485#true} assume true; {11485#true} is VALID [2022-04-27 13:08:48,174 INFO L290 TraceCheckUtils]: 55: Hoare triple {11485#true} assume !(0 == ~cond); {11485#true} is VALID [2022-04-27 13:08:48,174 INFO L290 TraceCheckUtils]: 54: Hoare triple {11485#true} ~cond := #in~cond; {11485#true} is VALID [2022-04-27 13:08:48,174 INFO L272 TraceCheckUtils]: 53: Hoare triple {11739#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {11485#true} is VALID [2022-04-27 13:08:48,175 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {11485#true} {11739#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #106#return; {11739#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 13:08:48,186 INFO L290 TraceCheckUtils]: 51: Hoare triple {11485#true} assume true; {11485#true} is VALID [2022-04-27 13:08:48,186 INFO L290 TraceCheckUtils]: 50: Hoare triple {11485#true} assume !(0 == ~cond); {11485#true} is VALID [2022-04-27 13:08:48,186 INFO L290 TraceCheckUtils]: 49: Hoare triple {11485#true} ~cond := #in~cond; {11485#true} is VALID [2022-04-27 13:08:48,186 INFO L272 TraceCheckUtils]: 48: Hoare triple {11739#(= 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)); {11485#true} is VALID [2022-04-27 13:08:48,188 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {11629#(not (= |__VERIFIER_assert_#in~cond| 0))} {11485#true} #104#return; {11739#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 13:08:48,188 INFO L290 TraceCheckUtils]: 46: Hoare triple {11629#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {11629#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:08:48,189 INFO L290 TraceCheckUtils]: 45: Hoare triple {11794#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {11629#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:08:48,189 INFO L290 TraceCheckUtils]: 44: Hoare triple {11485#true} ~cond := #in~cond; {11794#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 13:08:48,189 INFO L272 TraceCheckUtils]: 43: Hoare triple {11485#true} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {11485#true} is VALID [2022-04-27 13:08:48,189 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {11485#true} {11485#true} #102#return; {11485#true} is VALID [2022-04-27 13:08:48,189 INFO L290 TraceCheckUtils]: 41: Hoare triple {11485#true} assume true; {11485#true} is VALID [2022-04-27 13:08:48,189 INFO L290 TraceCheckUtils]: 40: Hoare triple {11485#true} assume !(0 == ~cond); {11485#true} is VALID [2022-04-27 13:08:48,189 INFO L290 TraceCheckUtils]: 39: Hoare triple {11485#true} ~cond := #in~cond; {11485#true} is VALID [2022-04-27 13:08:48,189 INFO L272 TraceCheckUtils]: 38: Hoare triple {11485#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {11485#true} is VALID [2022-04-27 13:08:48,189 INFO L290 TraceCheckUtils]: 37: Hoare triple {11485#true} assume !false; {11485#true} is VALID [2022-04-27 13:08:48,189 INFO L290 TraceCheckUtils]: 36: Hoare triple {11485#true} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {11485#true} is VALID [2022-04-27 13:08:48,189 INFO L290 TraceCheckUtils]: 35: Hoare triple {11485#true} assume !false; {11485#true} is VALID [2022-04-27 13:08:48,189 INFO L290 TraceCheckUtils]: 34: Hoare triple {11485#true} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {11485#true} is VALID [2022-04-27 13:08:48,189 INFO L290 TraceCheckUtils]: 33: Hoare triple {11485#true} assume !false; {11485#true} is VALID [2022-04-27 13:08:48,189 INFO L290 TraceCheckUtils]: 32: Hoare triple {11485#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; {11485#true} is VALID [2022-04-27 13:08:48,190 INFO L290 TraceCheckUtils]: 31: Hoare triple {11485#true} assume !(~c~0 >= ~b~0); {11485#true} is VALID [2022-04-27 13:08:48,190 INFO L290 TraceCheckUtils]: 30: Hoare triple {11485#true} assume !false; {11485#true} is VALID [2022-04-27 13:08:48,190 INFO L290 TraceCheckUtils]: 29: Hoare triple {11485#true} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {11485#true} is VALID [2022-04-27 13:08:48,190 INFO L290 TraceCheckUtils]: 28: Hoare triple {11485#true} assume !false; {11485#true} is VALID [2022-04-27 13:08:48,190 INFO L290 TraceCheckUtils]: 27: Hoare triple {11485#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {11485#true} is VALID [2022-04-27 13:08:48,190 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {11485#true} {11485#true} #100#return; {11485#true} is VALID [2022-04-27 13:08:48,190 INFO L290 TraceCheckUtils]: 25: Hoare triple {11485#true} assume true; {11485#true} is VALID [2022-04-27 13:08:48,190 INFO L290 TraceCheckUtils]: 24: Hoare triple {11485#true} assume !(0 == ~cond); {11485#true} is VALID [2022-04-27 13:08:48,190 INFO L290 TraceCheckUtils]: 23: Hoare triple {11485#true} ~cond := #in~cond; {11485#true} is VALID [2022-04-27 13:08:48,190 INFO L272 TraceCheckUtils]: 22: Hoare triple {11485#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {11485#true} is VALID [2022-04-27 13:08:48,190 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {11485#true} {11485#true} #98#return; {11485#true} is VALID [2022-04-27 13:08:48,190 INFO L290 TraceCheckUtils]: 20: Hoare triple {11485#true} assume true; {11485#true} is VALID [2022-04-27 13:08:48,190 INFO L290 TraceCheckUtils]: 19: Hoare triple {11485#true} assume !(0 == ~cond); {11485#true} is VALID [2022-04-27 13:08:48,190 INFO L290 TraceCheckUtils]: 18: Hoare triple {11485#true} ~cond := #in~cond; {11485#true} is VALID [2022-04-27 13:08:48,190 INFO L272 TraceCheckUtils]: 17: Hoare triple {11485#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {11485#true} is VALID [2022-04-27 13:08:48,190 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {11485#true} {11485#true} #96#return; {11485#true} is VALID [2022-04-27 13:08:48,190 INFO L290 TraceCheckUtils]: 15: Hoare triple {11485#true} assume true; {11485#true} is VALID [2022-04-27 13:08:48,190 INFO L290 TraceCheckUtils]: 14: Hoare triple {11485#true} assume !(0 == ~cond); {11485#true} is VALID [2022-04-27 13:08:48,190 INFO L290 TraceCheckUtils]: 13: Hoare triple {11485#true} ~cond := #in~cond; {11485#true} is VALID [2022-04-27 13:08:48,190 INFO L272 TraceCheckUtils]: 12: Hoare triple {11485#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 10 then 1 else 0)); {11485#true} is VALID [2022-04-27 13:08:48,190 INFO L290 TraceCheckUtils]: 11: Hoare triple {11485#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {11485#true} is VALID [2022-04-27 13:08:48,190 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {11485#true} {11485#true} #94#return; {11485#true} is VALID [2022-04-27 13:08:48,190 INFO L290 TraceCheckUtils]: 9: Hoare triple {11485#true} assume true; {11485#true} is VALID [2022-04-27 13:08:48,191 INFO L290 TraceCheckUtils]: 8: Hoare triple {11485#true} assume !(0 == ~cond); {11485#true} is VALID [2022-04-27 13:08:48,191 INFO L290 TraceCheckUtils]: 7: Hoare triple {11485#true} ~cond := #in~cond; {11485#true} is VALID [2022-04-27 13:08:48,191 INFO L272 TraceCheckUtils]: 6: Hoare triple {11485#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 10 then 1 else 0)); {11485#true} is VALID [2022-04-27 13:08:48,191 INFO L290 TraceCheckUtils]: 5: Hoare triple {11485#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;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {11485#true} is VALID [2022-04-27 13:08:48,191 INFO L272 TraceCheckUtils]: 4: Hoare triple {11485#true} call #t~ret6 := main(); {11485#true} is VALID [2022-04-27 13:08:48,191 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11485#true} {11485#true} #112#return; {11485#true} is VALID [2022-04-27 13:08:48,191 INFO L290 TraceCheckUtils]: 2: Hoare triple {11485#true} assume true; {11485#true} is VALID [2022-04-27 13:08:48,191 INFO L290 TraceCheckUtils]: 1: Hoare triple {11485#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); {11485#true} is VALID [2022-04-27 13:08:48,191 INFO L272 TraceCheckUtils]: 0: Hoare triple {11485#true} call ULTIMATE.init(); {11485#true} is VALID [2022-04-27 13:08:48,191 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 25 proven. 9 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2022-04-27 13:08:48,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:08:48,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754331837] [2022-04-27 13:08:48,191 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:08:48,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [691445977] [2022-04-27 13:08:48,191 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [691445977] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 13:08:48,191 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 13:08:48,192 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 13 [2022-04-27 13:08:48,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363774556] [2022-04-27 13:08:48,192 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 13:08:48,192 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 12 states have internal predecessors, (56), 5 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 72 [2022-04-27 13:08:48,192 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:08:48,192 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 12 states have internal predecessors, (56), 5 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2022-04-27 13:08:48,260 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-27 13:08:48,261 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-27 13:08:48,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:08:48,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-27 13:08:48,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-04-27 13:08:48,261 INFO L87 Difference]: Start difference. First operand 247 states and 341 transitions. Second operand has 13 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 12 states have internal predecessors, (56), 5 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2022-04-27 13:08:50,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:08:50,100 INFO L93 Difference]: Finished difference Result 323 states and 453 transitions. [2022-04-27 13:08:50,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-27 13:08:50,101 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 12 states have internal predecessors, (56), 5 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 72 [2022-04-27 13:08:50,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:08:50,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 12 states have internal predecessors, (56), 5 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2022-04-27 13:08:50,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 135 transitions. [2022-04-27 13:08:50,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 12 states have internal predecessors, (56), 5 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2022-04-27 13:08:50,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 135 transitions. [2022-04-27 13:08:50,104 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 135 transitions. [2022-04-27 13:08:50,258 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 135 edges. 135 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:08:50,264 INFO L225 Difference]: With dead ends: 323 [2022-04-27 13:08:50,264 INFO L226 Difference]: Without dead ends: 321 [2022-04-27 13:08:50,265 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 136 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=302, Unknown=0, NotChecked=0, Total=380 [2022-04-27 13:08:50,265 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 69 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-27 13:08:50,265 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 203 Invalid, 366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-27 13:08:50,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2022-04-27 13:08:50,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 259. [2022-04-27 13:08:50,921 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:08:50,922 INFO L82 GeneralOperation]: Start isEquivalent. First operand 321 states. Second operand has 259 states, 155 states have (on average 1.1741935483870967) internal successors, (182), 163 states have internal predecessors, (182), 85 states have call successors, (85), 19 states have call predecessors, (85), 18 states have return successors, (83), 76 states have call predecessors, (83), 83 states have call successors, (83) [2022-04-27 13:08:50,922 INFO L74 IsIncluded]: Start isIncluded. First operand 321 states. Second operand has 259 states, 155 states have (on average 1.1741935483870967) internal successors, (182), 163 states have internal predecessors, (182), 85 states have call successors, (85), 19 states have call predecessors, (85), 18 states have return successors, (83), 76 states have call predecessors, (83), 83 states have call successors, (83) [2022-04-27 13:08:50,922 INFO L87 Difference]: Start difference. First operand 321 states. Second operand has 259 states, 155 states have (on average 1.1741935483870967) internal successors, (182), 163 states have internal predecessors, (182), 85 states have call successors, (85), 19 states have call predecessors, (85), 18 states have return successors, (83), 76 states have call predecessors, (83), 83 states have call successors, (83) [2022-04-27 13:08:50,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:08:50,930 INFO L93 Difference]: Finished difference Result 321 states and 451 transitions. [2022-04-27 13:08:50,930 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 451 transitions. [2022-04-27 13:08:50,931 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:08:50,931 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:08:50,931 INFO L74 IsIncluded]: Start isIncluded. First operand has 259 states, 155 states have (on average 1.1741935483870967) internal successors, (182), 163 states have internal predecessors, (182), 85 states have call successors, (85), 19 states have call predecessors, (85), 18 states have return successors, (83), 76 states have call predecessors, (83), 83 states have call successors, (83) Second operand 321 states. [2022-04-27 13:08:50,931 INFO L87 Difference]: Start difference. First operand has 259 states, 155 states have (on average 1.1741935483870967) internal successors, (182), 163 states have internal predecessors, (182), 85 states have call successors, (85), 19 states have call predecessors, (85), 18 states have return successors, (83), 76 states have call predecessors, (83), 83 states have call successors, (83) Second operand 321 states. [2022-04-27 13:08:50,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:08:50,938 INFO L93 Difference]: Finished difference Result 321 states and 451 transitions. [2022-04-27 13:08:50,938 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 451 transitions. [2022-04-27 13:08:50,939 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:08:50,939 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:08:50,939 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:08:50,939 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:08:50,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 155 states have (on average 1.1741935483870967) internal successors, (182), 163 states have internal predecessors, (182), 85 states have call successors, (85), 19 states have call predecessors, (85), 18 states have return successors, (83), 76 states have call predecessors, (83), 83 states have call successors, (83) [2022-04-27 13:08:50,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 350 transitions. [2022-04-27 13:08:50,945 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 350 transitions. Word has length 72 [2022-04-27 13:08:50,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:08:50,945 INFO L495 AbstractCegarLoop]: Abstraction has 259 states and 350 transitions. [2022-04-27 13:08:50,946 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 12 states have internal predecessors, (56), 5 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2022-04-27 13:08:50,946 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 350 transitions. [2022-04-27 13:08:50,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-04-27 13:08:50,947 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:08:50,947 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:08:50,966 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-04-27 13:08:51,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-04-27 13:08:51,164 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:08:51,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:08:51,164 INFO L85 PathProgramCache]: Analyzing trace with hash 1984914564, now seen corresponding path program 2 times [2022-04-27 13:08:51,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:08:51,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619682387] [2022-04-27 13:08:51,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:08:51,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:08:51,179 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:08:51,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1731542181] [2022-04-27 13:08:51,179 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 13:08:51,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:08:51,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:08:51,192 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 13:08:51,192 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-27 13:08:51,235 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 13:08:51,235 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 13:08:51,236 INFO L263 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-27 13:08:51,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:08:51,248 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:08:51,465 INFO L272 TraceCheckUtils]: 0: Hoare triple {13512#true} call ULTIMATE.init(); {13512#true} is VALID [2022-04-27 13:08:51,465 INFO L290 TraceCheckUtils]: 1: Hoare triple {13512#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); {13512#true} is VALID [2022-04-27 13:08:51,465 INFO L290 TraceCheckUtils]: 2: Hoare triple {13512#true} assume true; {13512#true} is VALID [2022-04-27 13:08:51,465 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13512#true} {13512#true} #112#return; {13512#true} is VALID [2022-04-27 13:08:51,465 INFO L272 TraceCheckUtils]: 4: Hoare triple {13512#true} call #t~ret6 := main(); {13512#true} is VALID [2022-04-27 13:08:51,465 INFO L290 TraceCheckUtils]: 5: Hoare triple {13512#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;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {13512#true} is VALID [2022-04-27 13:08:51,465 INFO L272 TraceCheckUtils]: 6: Hoare triple {13512#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 10 then 1 else 0)); {13512#true} is VALID [2022-04-27 13:08:51,465 INFO L290 TraceCheckUtils]: 7: Hoare triple {13512#true} ~cond := #in~cond; {13512#true} is VALID [2022-04-27 13:08:51,465 INFO L290 TraceCheckUtils]: 8: Hoare triple {13512#true} assume !(0 == ~cond); {13512#true} is VALID [2022-04-27 13:08:51,465 INFO L290 TraceCheckUtils]: 9: Hoare triple {13512#true} assume true; {13512#true} is VALID [2022-04-27 13:08:51,465 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {13512#true} {13512#true} #94#return; {13512#true} is VALID [2022-04-27 13:08:51,465 INFO L290 TraceCheckUtils]: 11: Hoare triple {13512#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {13512#true} is VALID [2022-04-27 13:08:51,465 INFO L272 TraceCheckUtils]: 12: Hoare triple {13512#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 10 then 1 else 0)); {13512#true} is VALID [2022-04-27 13:08:51,465 INFO L290 TraceCheckUtils]: 13: Hoare triple {13512#true} ~cond := #in~cond; {13512#true} is VALID [2022-04-27 13:08:51,465 INFO L290 TraceCheckUtils]: 14: Hoare triple {13512#true} assume !(0 == ~cond); {13512#true} is VALID [2022-04-27 13:08:51,465 INFO L290 TraceCheckUtils]: 15: Hoare triple {13512#true} assume true; {13512#true} is VALID [2022-04-27 13:08:51,466 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {13512#true} {13512#true} #96#return; {13512#true} is VALID [2022-04-27 13:08:51,466 INFO L272 TraceCheckUtils]: 17: Hoare triple {13512#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {13512#true} is VALID [2022-04-27 13:08:51,466 INFO L290 TraceCheckUtils]: 18: Hoare triple {13512#true} ~cond := #in~cond; {13512#true} is VALID [2022-04-27 13:08:51,466 INFO L290 TraceCheckUtils]: 19: Hoare triple {13512#true} assume !(0 == ~cond); {13512#true} is VALID [2022-04-27 13:08:51,466 INFO L290 TraceCheckUtils]: 20: Hoare triple {13512#true} assume true; {13512#true} is VALID [2022-04-27 13:08:51,466 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {13512#true} {13512#true} #98#return; {13512#true} is VALID [2022-04-27 13:08:51,466 INFO L272 TraceCheckUtils]: 22: Hoare triple {13512#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {13512#true} is VALID [2022-04-27 13:08:51,466 INFO L290 TraceCheckUtils]: 23: Hoare triple {13512#true} ~cond := #in~cond; {13512#true} is VALID [2022-04-27 13:08:51,466 INFO L290 TraceCheckUtils]: 24: Hoare triple {13512#true} assume !(0 == ~cond); {13512#true} is VALID [2022-04-27 13:08:51,466 INFO L290 TraceCheckUtils]: 25: Hoare triple {13512#true} assume true; {13512#true} is VALID [2022-04-27 13:08:51,466 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {13512#true} {13512#true} #100#return; {13512#true} is VALID [2022-04-27 13:08:51,466 INFO L290 TraceCheckUtils]: 27: Hoare triple {13512#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {13512#true} is VALID [2022-04-27 13:08:51,466 INFO L290 TraceCheckUtils]: 28: Hoare triple {13512#true} assume !false; {13512#true} is VALID [2022-04-27 13:08:51,466 INFO L290 TraceCheckUtils]: 29: Hoare triple {13512#true} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {13512#true} is VALID [2022-04-27 13:08:51,466 INFO L290 TraceCheckUtils]: 30: Hoare triple {13512#true} assume !false; {13512#true} is VALID [2022-04-27 13:08:51,466 INFO L290 TraceCheckUtils]: 31: Hoare triple {13512#true} assume !(~c~0 >= ~b~0); {13512#true} is VALID [2022-04-27 13:08:51,466 INFO L290 TraceCheckUtils]: 32: Hoare triple {13512#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; {13512#true} is VALID [2022-04-27 13:08:51,466 INFO L290 TraceCheckUtils]: 33: Hoare triple {13512#true} assume !false; {13512#true} is VALID [2022-04-27 13:08:51,466 INFO L290 TraceCheckUtils]: 34: Hoare triple {13512#true} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {13512#true} is VALID [2022-04-27 13:08:51,466 INFO L290 TraceCheckUtils]: 35: Hoare triple {13512#true} assume !false; {13512#true} is VALID [2022-04-27 13:08:51,467 INFO L290 TraceCheckUtils]: 36: Hoare triple {13512#true} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {13625#(<= main_~v~0 main_~b~0)} is VALID [2022-04-27 13:08:51,467 INFO L290 TraceCheckUtils]: 37: Hoare triple {13625#(<= main_~v~0 main_~b~0)} assume !false; {13625#(<= main_~v~0 main_~b~0)} is VALID [2022-04-27 13:08:51,467 INFO L272 TraceCheckUtils]: 38: Hoare triple {13625#(<= main_~v~0 main_~b~0)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {13512#true} is VALID [2022-04-27 13:08:51,467 INFO L290 TraceCheckUtils]: 39: Hoare triple {13512#true} ~cond := #in~cond; {13512#true} is VALID [2022-04-27 13:08:51,467 INFO L290 TraceCheckUtils]: 40: Hoare triple {13512#true} assume !(0 == ~cond); {13512#true} is VALID [2022-04-27 13:08:51,467 INFO L290 TraceCheckUtils]: 41: Hoare triple {13512#true} assume true; {13512#true} is VALID [2022-04-27 13:08:51,468 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {13512#true} {13625#(<= main_~v~0 main_~b~0)} #102#return; {13625#(<= main_~v~0 main_~b~0)} is VALID [2022-04-27 13:08:51,468 INFO L272 TraceCheckUtils]: 43: Hoare triple {13625#(<= main_~v~0 main_~b~0)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {13512#true} is VALID [2022-04-27 13:08:51,468 INFO L290 TraceCheckUtils]: 44: Hoare triple {13512#true} ~cond := #in~cond; {13512#true} is VALID [2022-04-27 13:08:51,468 INFO L290 TraceCheckUtils]: 45: Hoare triple {13512#true} assume !(0 == ~cond); {13512#true} is VALID [2022-04-27 13:08:51,468 INFO L290 TraceCheckUtils]: 46: Hoare triple {13512#true} assume true; {13512#true} is VALID [2022-04-27 13:08:51,468 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {13512#true} {13625#(<= main_~v~0 main_~b~0)} #104#return; {13625#(<= main_~v~0 main_~b~0)} is VALID [2022-04-27 13:08:51,468 INFO L272 TraceCheckUtils]: 48: Hoare triple {13625#(<= main_~v~0 main_~b~0)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {13512#true} is VALID [2022-04-27 13:08:51,468 INFO L290 TraceCheckUtils]: 49: Hoare triple {13512#true} ~cond := #in~cond; {13512#true} is VALID [2022-04-27 13:08:51,468 INFO L290 TraceCheckUtils]: 50: Hoare triple {13512#true} assume !(0 == ~cond); {13512#true} is VALID [2022-04-27 13:08:51,468 INFO L290 TraceCheckUtils]: 51: Hoare triple {13512#true} assume true; {13512#true} is VALID [2022-04-27 13:08:51,469 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {13512#true} {13625#(<= main_~v~0 main_~b~0)} #106#return; {13625#(<= main_~v~0 main_~b~0)} is VALID [2022-04-27 13:08:51,469 INFO L272 TraceCheckUtils]: 53: Hoare triple {13625#(<= main_~v~0 main_~b~0)} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {13512#true} is VALID [2022-04-27 13:08:51,469 INFO L290 TraceCheckUtils]: 54: Hoare triple {13512#true} ~cond := #in~cond; {13512#true} is VALID [2022-04-27 13:08:51,469 INFO L290 TraceCheckUtils]: 55: Hoare triple {13512#true} assume !(0 == ~cond); {13512#true} is VALID [2022-04-27 13:08:51,469 INFO L290 TraceCheckUtils]: 56: Hoare triple {13512#true} assume true; {13512#true} is VALID [2022-04-27 13:08:51,469 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {13512#true} {13625#(<= main_~v~0 main_~b~0)} #108#return; {13625#(<= main_~v~0 main_~b~0)} is VALID [2022-04-27 13:08:51,470 INFO L290 TraceCheckUtils]: 58: Hoare triple {13625#(<= main_~v~0 main_~b~0)} assume !(~c~0 >= 2 * ~v~0); {13692#(and (<= main_~v~0 main_~b~0) (not (<= (* main_~v~0 2) main_~c~0)))} is VALID [2022-04-27 13:08:51,470 INFO L290 TraceCheckUtils]: 59: Hoare triple {13692#(and (<= main_~v~0 main_~b~0) (not (<= (* main_~v~0 2) main_~c~0)))} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {13696#(< main_~c~0 main_~b~0)} is VALID [2022-04-27 13:08:51,470 INFO L290 TraceCheckUtils]: 60: Hoare triple {13696#(< main_~c~0 main_~b~0)} assume !false; {13696#(< main_~c~0 main_~b~0)} is VALID [2022-04-27 13:08:51,471 INFO L290 TraceCheckUtils]: 61: Hoare triple {13696#(< main_~c~0 main_~b~0)} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {13513#false} is VALID [2022-04-27 13:08:51,471 INFO L290 TraceCheckUtils]: 62: Hoare triple {13513#false} assume !false; {13513#false} is VALID [2022-04-27 13:08:51,471 INFO L272 TraceCheckUtils]: 63: Hoare triple {13513#false} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {13513#false} is VALID [2022-04-27 13:08:51,471 INFO L290 TraceCheckUtils]: 64: Hoare triple {13513#false} ~cond := #in~cond; {13513#false} is VALID [2022-04-27 13:08:51,471 INFO L290 TraceCheckUtils]: 65: Hoare triple {13513#false} assume !(0 == ~cond); {13513#false} is VALID [2022-04-27 13:08:51,471 INFO L290 TraceCheckUtils]: 66: Hoare triple {13513#false} assume true; {13513#false} is VALID [2022-04-27 13:08:51,471 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {13513#false} {13513#false} #102#return; {13513#false} is VALID [2022-04-27 13:08:51,471 INFO L272 TraceCheckUtils]: 68: Hoare triple {13513#false} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {13513#false} is VALID [2022-04-27 13:08:51,471 INFO L290 TraceCheckUtils]: 69: Hoare triple {13513#false} ~cond := #in~cond; {13513#false} is VALID [2022-04-27 13:08:51,471 INFO L290 TraceCheckUtils]: 70: Hoare triple {13513#false} assume !(0 == ~cond); {13513#false} is VALID [2022-04-27 13:08:51,471 INFO L290 TraceCheckUtils]: 71: Hoare triple {13513#false} assume true; {13513#false} is VALID [2022-04-27 13:08:51,471 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {13513#false} {13513#false} #104#return; {13513#false} is VALID [2022-04-27 13:08:51,471 INFO L272 TraceCheckUtils]: 73: Hoare triple {13513#false} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {13513#false} is VALID [2022-04-27 13:08:51,471 INFO L290 TraceCheckUtils]: 74: Hoare triple {13513#false} ~cond := #in~cond; {13513#false} is VALID [2022-04-27 13:08:51,471 INFO L290 TraceCheckUtils]: 75: Hoare triple {13513#false} assume 0 == ~cond; {13513#false} is VALID [2022-04-27 13:08:51,471 INFO L290 TraceCheckUtils]: 76: Hoare triple {13513#false} assume !false; {13513#false} is VALID [2022-04-27 13:08:51,472 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-27 13:08:51,472 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 13:08:51,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:08:51,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619682387] [2022-04-27 13:08:51,472 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:08:51,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1731542181] [2022-04-27 13:08:51,472 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1731542181] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:08:51,472 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:08:51,472 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 13:08:51,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222733679] [2022-04-27 13:08:51,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:08:51,472 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, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 77 [2022-04-27 13:08:51,473 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:08:51,473 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, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-04-27 13:08:51,515 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:08:51,515 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 13:08:51,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:08:51,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 13:08:51,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-27 13:08:51,516 INFO L87 Difference]: Start difference. First operand 259 states and 350 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, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-04-27 13:08:52,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:08:52,328 INFO L93 Difference]: Finished difference Result 449 states and 606 transitions. [2022-04-27 13:08:52,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 13:08:52,328 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, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 77 [2022-04-27 13:08:52,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:08:52,329 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, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-04-27 13:08:52,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 85 transitions. [2022-04-27 13:08:52,330 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, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-04-27 13:08:52,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 85 transitions. [2022-04-27 13:08:52,330 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 85 transitions. [2022-04-27 13:08:52,393 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-27 13:08:52,398 INFO L225 Difference]: With dead ends: 449 [2022-04-27 13:08:52,398 INFO L226 Difference]: Without dead ends: 264 [2022-04-27 13:08:52,398 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-04-27 13:08:52,399 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 3 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 13:08:52,399 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 139 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 13:08:52,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2022-04-27 13:08:53,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 255. [2022-04-27 13:08:53,045 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:08:53,045 INFO L82 GeneralOperation]: Start isEquivalent. First operand 264 states. Second operand has 255 states, 160 states have (on average 1.16875) internal successors, (187), 162 states have internal predecessors, (187), 77 states have call successors, (77), 18 states have call predecessors, (77), 17 states have return successors, (75), 74 states have call predecessors, (75), 75 states have call successors, (75) [2022-04-27 13:08:53,045 INFO L74 IsIncluded]: Start isIncluded. First operand 264 states. Second operand has 255 states, 160 states have (on average 1.16875) internal successors, (187), 162 states have internal predecessors, (187), 77 states have call successors, (77), 18 states have call predecessors, (77), 17 states have return successors, (75), 74 states have call predecessors, (75), 75 states have call successors, (75) [2022-04-27 13:08:53,046 INFO L87 Difference]: Start difference. First operand 264 states. Second operand has 255 states, 160 states have (on average 1.16875) internal successors, (187), 162 states have internal predecessors, (187), 77 states have call successors, (77), 18 states have call predecessors, (77), 17 states have return successors, (75), 74 states have call predecessors, (75), 75 states have call successors, (75) [2022-04-27 13:08:53,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:08:53,050 INFO L93 Difference]: Finished difference Result 264 states and 348 transitions. [2022-04-27 13:08:53,050 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 348 transitions. [2022-04-27 13:08:53,051 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:08:53,051 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:08:53,051 INFO L74 IsIncluded]: Start isIncluded. First operand has 255 states, 160 states have (on average 1.16875) internal successors, (187), 162 states have internal predecessors, (187), 77 states have call successors, (77), 18 states have call predecessors, (77), 17 states have return successors, (75), 74 states have call predecessors, (75), 75 states have call successors, (75) Second operand 264 states. [2022-04-27 13:08:53,052 INFO L87 Difference]: Start difference. First operand has 255 states, 160 states have (on average 1.16875) internal successors, (187), 162 states have internal predecessors, (187), 77 states have call successors, (77), 18 states have call predecessors, (77), 17 states have return successors, (75), 74 states have call predecessors, (75), 75 states have call successors, (75) Second operand 264 states. [2022-04-27 13:08:53,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:08:53,056 INFO L93 Difference]: Finished difference Result 264 states and 348 transitions. [2022-04-27 13:08:53,056 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 348 transitions. [2022-04-27 13:08:53,057 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:08:53,057 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:08:53,057 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:08:53,057 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:08:53,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 160 states have (on average 1.16875) internal successors, (187), 162 states have internal predecessors, (187), 77 states have call successors, (77), 18 states have call predecessors, (77), 17 states have return successors, (75), 74 states have call predecessors, (75), 75 states have call successors, (75) [2022-04-27 13:08:53,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 339 transitions. [2022-04-27 13:08:53,062 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 339 transitions. Word has length 77 [2022-04-27 13:08:53,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:08:53,063 INFO L495 AbstractCegarLoop]: Abstraction has 255 states and 339 transitions. [2022-04-27 13:08:53,063 INFO L496 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, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-04-27 13:08:53,063 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 339 transitions. [2022-04-27 13:08:53,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-04-27 13:08:53,063 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:08:53,064 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 4, 4, 4, 4, 3, 3, 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, 1, 1] [2022-04-27 13:08:53,099 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-27 13:08:53,279 WARN L477 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-27 13:08:53,280 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:08:53,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:08:53,280 INFO L85 PathProgramCache]: Analyzing trace with hash -867272991, now seen corresponding path program 3 times [2022-04-27 13:08:53,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:08:53,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328367684] [2022-04-27 13:08:53,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:08:53,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:08:53,300 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:08:53,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1879642343] [2022-04-27 13:08:53,300 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 13:08:53,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:08:53,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:08:53,301 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-27 13:08:53,336 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-27 13:08:53,347 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-04-27 13:08:53,347 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 13:08:53,348 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 73 conjunts are in the unsatisfiable core [2022-04-27 13:08:53,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:08:53,363 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:08:54,855 INFO L272 TraceCheckUtils]: 0: Hoare triple {15367#true} call ULTIMATE.init(); {15367#true} is VALID [2022-04-27 13:08:54,856 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-27 13:08:54,856 INFO L290 TraceCheckUtils]: 2: Hoare triple {15367#true} assume true; {15367#true} is VALID [2022-04-27 13:08:54,856 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15367#true} {15367#true} #112#return; {15367#true} is VALID [2022-04-27 13:08:54,856 INFO L272 TraceCheckUtils]: 4: Hoare triple {15367#true} call #t~ret6 := main(); {15367#true} is VALID [2022-04-27 13:08:54,856 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;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {15367#true} is VALID [2022-04-27 13:08:54,856 INFO L272 TraceCheckUtils]: 6: Hoare triple {15367#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 10 then 1 else 0)); {15367#true} is VALID [2022-04-27 13:08:54,856 INFO L290 TraceCheckUtils]: 7: Hoare triple {15367#true} ~cond := #in~cond; {15393#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 13:08:54,856 INFO L290 TraceCheckUtils]: 8: Hoare triple {15393#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {15397#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 13:08:54,857 INFO L290 TraceCheckUtils]: 9: Hoare triple {15397#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {15397#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 13:08:54,857 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {15397#(not (= |assume_abort_if_not_#in~cond| 0))} {15367#true} #94#return; {15404#(and (<= main_~x~0 10) (<= 0 main_~x~0))} is VALID [2022-04-27 13:08:54,857 INFO L290 TraceCheckUtils]: 11: Hoare triple {15404#(and (<= main_~x~0 10) (<= 0 main_~x~0))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {15404#(and (<= main_~x~0 10) (<= 0 main_~x~0))} is VALID [2022-04-27 13:08:54,858 INFO L272 TraceCheckUtils]: 12: Hoare triple {15404#(and (<= main_~x~0 10) (<= 0 main_~x~0))} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 10 then 1 else 0)); {15367#true} is VALID [2022-04-27 13:08:54,858 INFO L290 TraceCheckUtils]: 13: Hoare triple {15367#true} ~cond := #in~cond; {15367#true} is VALID [2022-04-27 13:08:54,858 INFO L290 TraceCheckUtils]: 14: Hoare triple {15367#true} assume !(0 == ~cond); {15367#true} is VALID [2022-04-27 13:08:54,858 INFO L290 TraceCheckUtils]: 15: Hoare triple {15367#true} assume true; {15367#true} is VALID [2022-04-27 13:08:54,858 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {15367#true} {15404#(and (<= main_~x~0 10) (<= 0 main_~x~0))} #96#return; {15404#(and (<= main_~x~0 10) (<= 0 main_~x~0))} is VALID [2022-04-27 13:08:54,858 INFO L272 TraceCheckUtils]: 17: Hoare triple {15404#(and (<= main_~x~0 10) (<= 0 main_~x~0))} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {15367#true} is VALID [2022-04-27 13:08:54,858 INFO L290 TraceCheckUtils]: 18: Hoare triple {15367#true} ~cond := #in~cond; {15367#true} is VALID [2022-04-27 13:08:54,858 INFO L290 TraceCheckUtils]: 19: Hoare triple {15367#true} assume !(0 == ~cond); {15367#true} is VALID [2022-04-27 13:08:54,858 INFO L290 TraceCheckUtils]: 20: Hoare triple {15367#true} assume true; {15367#true} is VALID [2022-04-27 13:08:54,859 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {15367#true} {15404#(and (<= main_~x~0 10) (<= 0 main_~x~0))} #98#return; {15404#(and (<= main_~x~0 10) (<= 0 main_~x~0))} is VALID [2022-04-27 13:08:54,859 INFO L272 TraceCheckUtils]: 22: Hoare triple {15404#(and (<= main_~x~0 10) (<= 0 main_~x~0))} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {15367#true} is VALID [2022-04-27 13:08:54,859 INFO L290 TraceCheckUtils]: 23: Hoare triple {15367#true} ~cond := #in~cond; {15367#true} is VALID [2022-04-27 13:08:54,859 INFO L290 TraceCheckUtils]: 24: Hoare triple {15367#true} assume !(0 == ~cond); {15367#true} is VALID [2022-04-27 13:08:54,859 INFO L290 TraceCheckUtils]: 25: Hoare triple {15367#true} assume true; {15367#true} is VALID [2022-04-27 13:08:54,859 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {15367#true} {15404#(and (<= main_~x~0 10) (<= 0 main_~x~0))} #100#return; {15404#(and (<= main_~x~0 10) (<= 0 main_~x~0))} is VALID [2022-04-27 13:08:54,860 INFO L290 TraceCheckUtils]: 27: Hoare triple {15404#(and (<= main_~x~0 10) (<= 0 main_~x~0))} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {15456#(and (= main_~r~0 0) (= main_~s~0 1) (<= main_~x~0 10) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0))} is VALID [2022-04-27 13:08:54,860 INFO L290 TraceCheckUtils]: 28: Hoare triple {15456#(and (= main_~r~0 0) (= main_~s~0 1) (<= main_~x~0 10) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0))} assume !false; {15456#(and (= main_~r~0 0) (= main_~s~0 1) (<= main_~x~0 10) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0))} is VALID [2022-04-27 13:08:54,860 INFO L290 TraceCheckUtils]: 29: Hoare triple {15456#(and (= main_~r~0 0) (= main_~s~0 1) (<= main_~x~0 10) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {15463#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (<= main_~x~0 10) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0))} is VALID [2022-04-27 13:08:54,861 INFO L290 TraceCheckUtils]: 30: Hoare triple {15463#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (<= main_~x~0 10) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0))} assume !false; {15463#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (<= main_~x~0 10) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0))} is VALID [2022-04-27 13:08:54,861 INFO L290 TraceCheckUtils]: 31: Hoare triple {15463#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (<= main_~x~0 10) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0))} assume !(~c~0 >= ~b~0); {15470#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (<= main_~x~0 10) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (not (<= main_~b~0 main_~c~0)) (= main_~q~0 0) (= main_~c~0 main_~x~0))} is VALID [2022-04-27 13:08:54,862 INFO L290 TraceCheckUtils]: 32: Hoare triple {15470#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (<= main_~x~0 10) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (not (<= main_~b~0 main_~c~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; {15474#(and (= main_~s~0 0) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (<= main_~x~0 10) (<= 0 main_~x~0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} is VALID [2022-04-27 13:08:54,862 INFO L290 TraceCheckUtils]: 33: Hoare triple {15474#(and (= main_~s~0 0) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (<= main_~x~0 10) (<= 0 main_~x~0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} assume !false; {15474#(and (= main_~s~0 0) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (<= main_~x~0 10) (<= 0 main_~x~0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} is VALID [2022-04-27 13:08:54,862 INFO L290 TraceCheckUtils]: 34: Hoare triple {15474#(and (= main_~s~0 0) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (<= main_~x~0 10) (<= 0 main_~x~0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {15481#(and (= main_~s~0 0) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (<= main_~x~0 10) (<= 0 main_~x~0) (= main_~r~0 1) (= main_~b~0 main_~x~0))} is VALID [2022-04-27 13:08:54,863 INFO L290 TraceCheckUtils]: 35: Hoare triple {15481#(and (= main_~s~0 0) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (<= main_~x~0 10) (<= 0 main_~x~0) (= main_~r~0 1) (= main_~b~0 main_~x~0))} assume !false; {15481#(and (= main_~s~0 0) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (<= main_~x~0 10) (<= 0 main_~x~0) (= main_~r~0 1) (= main_~b~0 main_~x~0))} is VALID [2022-04-27 13:08:54,863 INFO L290 TraceCheckUtils]: 36: Hoare triple {15481#(and (= main_~s~0 0) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (<= main_~x~0 10) (<= 0 main_~x~0) (= main_~r~0 1) (= main_~b~0 main_~x~0))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {15488#(and (= main_~b~0 main_~v~0) (= main_~s~0 0) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (<= main_~x~0 10) (<= 0 main_~x~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 1))} is VALID [2022-04-27 13:08:54,864 INFO L290 TraceCheckUtils]: 37: Hoare triple {15488#(and (= main_~b~0 main_~v~0) (= main_~s~0 0) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (<= main_~x~0 10) (<= 0 main_~x~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 1))} assume !false; {15488#(and (= main_~b~0 main_~v~0) (= main_~s~0 0) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (<= main_~x~0 10) (<= 0 main_~x~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 1))} is VALID [2022-04-27 13:08:54,864 INFO L272 TraceCheckUtils]: 38: Hoare triple {15488#(and (= main_~b~0 main_~v~0) (= main_~s~0 0) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (<= main_~x~0 10) (<= 0 main_~x~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {15367#true} is VALID [2022-04-27 13:08:54,864 INFO L290 TraceCheckUtils]: 39: Hoare triple {15367#true} ~cond := #in~cond; {15367#true} is VALID [2022-04-27 13:08:54,864 INFO L290 TraceCheckUtils]: 40: Hoare triple {15367#true} assume !(0 == ~cond); {15367#true} is VALID [2022-04-27 13:08:54,864 INFO L290 TraceCheckUtils]: 41: Hoare triple {15367#true} assume true; {15367#true} is VALID [2022-04-27 13:08:54,864 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {15367#true} {15488#(and (= main_~b~0 main_~v~0) (= main_~s~0 0) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (<= main_~x~0 10) (<= 0 main_~x~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 1))} #102#return; {15488#(and (= main_~b~0 main_~v~0) (= main_~s~0 0) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (<= main_~x~0 10) (<= 0 main_~x~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 1))} is VALID [2022-04-27 13:08:54,864 INFO L272 TraceCheckUtils]: 43: Hoare triple {15488#(and (= main_~b~0 main_~v~0) (= main_~s~0 0) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (<= main_~x~0 10) (<= 0 main_~x~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {15367#true} is VALID [2022-04-27 13:08:54,865 INFO L290 TraceCheckUtils]: 44: Hoare triple {15367#true} ~cond := #in~cond; {15367#true} is VALID [2022-04-27 13:08:54,865 INFO L290 TraceCheckUtils]: 45: Hoare triple {15367#true} assume !(0 == ~cond); {15367#true} is VALID [2022-04-27 13:08:54,865 INFO L290 TraceCheckUtils]: 46: Hoare triple {15367#true} assume true; {15367#true} is VALID [2022-04-27 13:08:54,865 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {15367#true} {15488#(and (= main_~b~0 main_~v~0) (= main_~s~0 0) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (<= main_~x~0 10) (<= 0 main_~x~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 1))} #104#return; {15488#(and (= main_~b~0 main_~v~0) (= main_~s~0 0) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (<= main_~x~0 10) (<= 0 main_~x~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 1))} is VALID [2022-04-27 13:08:54,865 INFO L272 TraceCheckUtils]: 48: Hoare triple {15488#(and (= main_~b~0 main_~v~0) (= main_~s~0 0) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (<= main_~x~0 10) (<= 0 main_~x~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {15367#true} is VALID [2022-04-27 13:08:54,865 INFO L290 TraceCheckUtils]: 49: Hoare triple {15367#true} ~cond := #in~cond; {15367#true} is VALID [2022-04-27 13:08:54,865 INFO L290 TraceCheckUtils]: 50: Hoare triple {15367#true} assume !(0 == ~cond); {15367#true} is VALID [2022-04-27 13:08:54,865 INFO L290 TraceCheckUtils]: 51: Hoare triple {15367#true} assume true; {15367#true} is VALID [2022-04-27 13:08:54,866 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {15367#true} {15488#(and (= main_~b~0 main_~v~0) (= main_~s~0 0) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (<= main_~x~0 10) (<= 0 main_~x~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 1))} #106#return; {15488#(and (= main_~b~0 main_~v~0) (= main_~s~0 0) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (<= main_~x~0 10) (<= 0 main_~x~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 1))} is VALID [2022-04-27 13:08:54,866 INFO L272 TraceCheckUtils]: 53: Hoare triple {15488#(and (= main_~b~0 main_~v~0) (= main_~s~0 0) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (<= main_~x~0 10) (<= 0 main_~x~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 1))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {15367#true} is VALID [2022-04-27 13:08:54,866 INFO L290 TraceCheckUtils]: 54: Hoare triple {15367#true} ~cond := #in~cond; {15367#true} is VALID [2022-04-27 13:08:54,866 INFO L290 TraceCheckUtils]: 55: Hoare triple {15367#true} assume !(0 == ~cond); {15367#true} is VALID [2022-04-27 13:08:54,866 INFO L290 TraceCheckUtils]: 56: Hoare triple {15367#true} assume true; {15367#true} is VALID [2022-04-27 13:08:54,867 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {15367#true} {15488#(and (= main_~b~0 main_~v~0) (= main_~s~0 0) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (<= main_~x~0 10) (<= 0 main_~x~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 1))} #108#return; {15488#(and (= main_~b~0 main_~v~0) (= main_~s~0 0) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (<= main_~x~0 10) (<= 0 main_~x~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 1))} is VALID [2022-04-27 13:08:54,867 INFO L290 TraceCheckUtils]: 58: Hoare triple {15488#(and (= main_~b~0 main_~v~0) (= main_~s~0 0) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (<= main_~x~0 10) (<= 0 main_~x~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 1))} assume !(~c~0 >= 2 * ~v~0); {15488#(and (= main_~b~0 main_~v~0) (= main_~s~0 0) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (<= main_~x~0 10) (<= 0 main_~x~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 1))} is VALID [2022-04-27 13:08:54,868 INFO L290 TraceCheckUtils]: 59: Hoare triple {15488#(and (= main_~b~0 main_~v~0) (= main_~s~0 0) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (<= main_~x~0 10) (<= 0 main_~x~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 1))} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {15558#(and (= main_~s~0 0) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (<= main_~x~0 10) (<= 0 main_~x~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~k~0 1) (= main_~y~0 (+ main_~c~0 main_~b~0)))} is VALID [2022-04-27 13:08:54,868 INFO L290 TraceCheckUtils]: 60: Hoare triple {15558#(and (= main_~s~0 0) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (<= main_~x~0 10) (<= 0 main_~x~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~k~0 1) (= main_~y~0 (+ main_~c~0 main_~b~0)))} assume !false; {15558#(and (= main_~s~0 0) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (<= main_~x~0 10) (<= 0 main_~x~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~k~0 1) (= main_~y~0 (+ main_~c~0 main_~b~0)))} is VALID [2022-04-27 13:08:54,869 INFO L290 TraceCheckUtils]: 61: Hoare triple {15558#(and (= main_~s~0 0) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (<= main_~x~0 10) (<= 0 main_~x~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~k~0 1) (= main_~y~0 (+ main_~c~0 main_~b~0)))} assume !(~c~0 >= ~b~0); {15565#(and (= main_~s~0 0) (= main_~p~0 0) (< main_~x~0 main_~y~0) (<= main_~x~0 10) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~k~0 1) (< main_~c~0 main_~b~0) (= main_~y~0 (+ main_~c~0 main_~b~0)))} is VALID [2022-04-27 13:08:54,870 INFO L290 TraceCheckUtils]: 62: Hoare triple {15565#(and (= main_~s~0 0) (= main_~p~0 0) (< main_~x~0 main_~y~0) (<= main_~x~0 10) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~k~0 1) (< main_~c~0 main_~b~0) (= main_~y~0 (+ main_~c~0 main_~b~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; {15569#(and (= main_~r~0 0) (= (+ main_~s~0 main_~r~0) 1) (< main_~x~0 main_~y~0) (< main_~y~0 (* main_~a~0 2)) (<= main_~x~0 10) (= (+ (* (- 1) main_~a~0) main_~y~0) main_~b~0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0))} is VALID [2022-04-27 13:08:54,870 INFO L290 TraceCheckUtils]: 63: Hoare triple {15569#(and (= main_~r~0 0) (= (+ main_~s~0 main_~r~0) 1) (< main_~x~0 main_~y~0) (< main_~y~0 (* main_~a~0 2)) (<= main_~x~0 10) (= (+ (* (- 1) main_~a~0) main_~y~0) main_~b~0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0))} assume !false; {15569#(and (= main_~r~0 0) (= (+ main_~s~0 main_~r~0) 1) (< main_~x~0 main_~y~0) (< main_~y~0 (* main_~a~0 2)) (<= main_~x~0 10) (= (+ (* (- 1) main_~a~0) main_~y~0) main_~b~0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0))} is VALID [2022-04-27 13:08:54,871 INFO L290 TraceCheckUtils]: 64: Hoare triple {15569#(and (= main_~r~0 0) (= (+ main_~s~0 main_~r~0) 1) (< main_~x~0 main_~y~0) (< main_~y~0 (* main_~a~0 2)) (<= main_~x~0 10) (= (+ (* (- 1) main_~a~0) main_~y~0) main_~b~0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {15569#(and (= main_~r~0 0) (= (+ main_~s~0 main_~r~0) 1) (< main_~x~0 main_~y~0) (< main_~y~0 (* main_~a~0 2)) (<= main_~x~0 10) (= (+ (* (- 1) main_~a~0) main_~y~0) main_~b~0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0))} is VALID [2022-04-27 13:08:54,871 INFO L290 TraceCheckUtils]: 65: Hoare triple {15569#(and (= main_~r~0 0) (= (+ main_~s~0 main_~r~0) 1) (< main_~x~0 main_~y~0) (< main_~y~0 (* main_~a~0 2)) (<= main_~x~0 10) (= (+ (* (- 1) main_~a~0) main_~y~0) main_~b~0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0))} assume !false; {15569#(and (= main_~r~0 0) (= (+ main_~s~0 main_~r~0) 1) (< main_~x~0 main_~y~0) (< main_~y~0 (* main_~a~0 2)) (<= main_~x~0 10) (= (+ (* (- 1) main_~a~0) main_~y~0) main_~b~0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0))} is VALID [2022-04-27 13:08:54,872 INFO L290 TraceCheckUtils]: 66: Hoare triple {15569#(and (= main_~r~0 0) (= (+ main_~s~0 main_~r~0) 1) (< main_~x~0 main_~y~0) (< main_~y~0 (* main_~a~0 2)) (<= main_~x~0 10) (= (+ (* (- 1) main_~a~0) main_~y~0) main_~b~0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {15569#(and (= main_~r~0 0) (= (+ main_~s~0 main_~r~0) 1) (< main_~x~0 main_~y~0) (< main_~y~0 (* main_~a~0 2)) (<= main_~x~0 10) (= (+ (* (- 1) main_~a~0) main_~y~0) main_~b~0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0))} is VALID [2022-04-27 13:08:54,872 INFO L290 TraceCheckUtils]: 67: Hoare triple {15569#(and (= main_~r~0 0) (= (+ main_~s~0 main_~r~0) 1) (< main_~x~0 main_~y~0) (< main_~y~0 (* main_~a~0 2)) (<= main_~x~0 10) (= (+ (* (- 1) main_~a~0) main_~y~0) main_~b~0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0))} assume !false; {15569#(and (= main_~r~0 0) (= (+ main_~s~0 main_~r~0) 1) (< main_~x~0 main_~y~0) (< main_~y~0 (* main_~a~0 2)) (<= main_~x~0 10) (= (+ (* (- 1) main_~a~0) main_~y~0) main_~b~0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0))} is VALID [2022-04-27 13:08:54,872 INFO L272 TraceCheckUtils]: 68: Hoare triple {15569#(and (= main_~r~0 0) (= (+ main_~s~0 main_~r~0) 1) (< main_~x~0 main_~y~0) (< main_~y~0 (* main_~a~0 2)) (<= main_~x~0 10) (= (+ (* (- 1) main_~a~0) main_~y~0) main_~b~0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~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-27 13:08:54,872 INFO L290 TraceCheckUtils]: 69: Hoare triple {15367#true} ~cond := #in~cond; {15591#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:08:54,873 INFO L290 TraceCheckUtils]: 70: Hoare triple {15591#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {15595#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:08:54,873 INFO L290 TraceCheckUtils]: 71: Hoare triple {15595#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {15595#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:08:54,875 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {15595#(not (= |__VERIFIER_assert_#in~cond| 0))} {15569#(and (= main_~r~0 0) (= (+ main_~s~0 main_~r~0) 1) (< main_~x~0 main_~y~0) (< main_~y~0 (* main_~a~0 2)) (<= main_~x~0 10) (= (+ (* (- 1) main_~a~0) main_~y~0) main_~b~0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0))} #102#return; {15602#(and (< (* main_~b~0 2) main_~y~0) (= main_~s~0 1) (= (+ main_~y~0 (* (- 1) main_~b~0)) main_~x~0) (< main_~x~0 main_~y~0) (<= main_~x~0 10) (= (+ main_~y~0 (* (- 1) main_~b~0)) (* main_~x~0 (* (- 1) main_~q~0))))} is VALID [2022-04-27 13:08:54,875 INFO L272 TraceCheckUtils]: 73: Hoare triple {15602#(and (< (* main_~b~0 2) main_~y~0) (= main_~s~0 1) (= (+ main_~y~0 (* (- 1) main_~b~0)) main_~x~0) (< main_~x~0 main_~y~0) (<= main_~x~0 10) (= (+ main_~y~0 (* (- 1) main_~b~0)) (* main_~x~0 (* (- 1) main_~q~0))))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {15606#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:08:54,876 INFO L290 TraceCheckUtils]: 74: Hoare triple {15606#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {15610#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:08:54,876 INFO L290 TraceCheckUtils]: 75: Hoare triple {15610#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {15368#false} is VALID [2022-04-27 13:08:54,876 INFO L290 TraceCheckUtils]: 76: Hoare triple {15368#false} assume !false; {15368#false} is VALID [2022-04-27 13:08:54,876 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 21 proven. 32 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2022-04-27 13:08:54,876 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:09:31,172 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-27 13:09:36,231 INFO L290 TraceCheckUtils]: 76: Hoare triple {15368#false} assume !false; {15368#false} is VALID [2022-04-27 13:09:36,231 INFO L290 TraceCheckUtils]: 75: Hoare triple {15610#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {15368#false} is VALID [2022-04-27 13:09:36,232 INFO L290 TraceCheckUtils]: 74: Hoare triple {15606#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {15610#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:09:36,232 INFO L272 TraceCheckUtils]: 73: Hoare triple {15626#(= 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)); {15606#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:09:36,233 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {15595#(not (= |__VERIFIER_assert_#in~cond| 0))} {15630#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} #102#return; {15626#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 13:09:36,233 INFO L290 TraceCheckUtils]: 71: Hoare triple {15595#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {15595#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:09:36,233 INFO L290 TraceCheckUtils]: 70: Hoare triple {15640#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {15595#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:09:36,234 INFO L290 TraceCheckUtils]: 69: Hoare triple {15367#true} ~cond := #in~cond; {15640#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 13:09:36,234 INFO L272 TraceCheckUtils]: 68: Hoare triple {15630#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= 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)); {15367#true} is VALID [2022-04-27 13:09:36,234 INFO L290 TraceCheckUtils]: 67: Hoare triple {15630#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} assume !false; {15630#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} is VALID [2022-04-27 13:09:36,235 INFO L290 TraceCheckUtils]: 66: Hoare triple {15630#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {15630#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} is VALID [2022-04-27 13:09:36,235 INFO L290 TraceCheckUtils]: 65: Hoare triple {15630#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} assume !false; {15630#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} is VALID [2022-04-27 13:09:36,235 INFO L290 TraceCheckUtils]: 64: Hoare triple {15630#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {15630#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} is VALID [2022-04-27 13:09:36,236 INFO L290 TraceCheckUtils]: 63: Hoare triple {15630#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} assume !false; {15630#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} is VALID [2022-04-27 13:09:36,252 INFO L290 TraceCheckUtils]: 62: Hoare triple {15662#(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)))))} ~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; {15630#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} is VALID [2022-04-27 13:09:36,253 INFO L290 TraceCheckUtils]: 61: Hoare triple {15666#(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)))) (<= main_~b~0 main_~c~0))} assume !(~c~0 >= ~b~0); {15662#(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-27 13:09:36,253 INFO L290 TraceCheckUtils]: 60: Hoare triple {15666#(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)))) (<= main_~b~0 main_~c~0))} assume !false; {15666#(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)))) (<= main_~b~0 main_~c~0))} is VALID [2022-04-27 13:09:36,366 INFO L290 TraceCheckUtils]: 59: Hoare triple {15673#(or (= (+ main_~c~0 (* (- 1) main_~v~0)) (+ (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0))) (<= (+ main_~b~0 main_~v~0) main_~c~0) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {15666#(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)))) (<= main_~b~0 main_~c~0))} is VALID [2022-04-27 13:09:36,367 INFO L290 TraceCheckUtils]: 58: Hoare triple {15673#(or (= (+ main_~c~0 (* (- 1) main_~v~0)) (+ (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0))) (<= (+ main_~b~0 main_~v~0) main_~c~0) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} assume !(~c~0 >= 2 * ~v~0); {15673#(or (= (+ main_~c~0 (* (- 1) main_~v~0)) (+ (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0))) (<= (+ main_~b~0 main_~v~0) main_~c~0) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is VALID [2022-04-27 13:09:36,368 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {15367#true} {15673#(or (= (+ main_~c~0 (* (- 1) main_~v~0)) (+ (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0))) (<= (+ main_~b~0 main_~v~0) main_~c~0) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} #108#return; {15673#(or (= (+ main_~c~0 (* (- 1) main_~v~0)) (+ (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0))) (<= (+ main_~b~0 main_~v~0) main_~c~0) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is VALID [2022-04-27 13:09:36,368 INFO L290 TraceCheckUtils]: 56: Hoare triple {15367#true} assume true; {15367#true} is VALID [2022-04-27 13:09:36,368 INFO L290 TraceCheckUtils]: 55: Hoare triple {15367#true} assume !(0 == ~cond); {15367#true} is VALID [2022-04-27 13:09:36,368 INFO L290 TraceCheckUtils]: 54: Hoare triple {15367#true} ~cond := #in~cond; {15367#true} is VALID [2022-04-27 13:09:36,368 INFO L272 TraceCheckUtils]: 53: Hoare triple {15673#(or (= (+ main_~c~0 (* (- 1) main_~v~0)) (+ (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0))) (<= (+ main_~b~0 main_~v~0) main_~c~0) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {15367#true} is VALID [2022-04-27 13:09:36,369 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {15367#true} {15673#(or (= (+ main_~c~0 (* (- 1) main_~v~0)) (+ (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0))) (<= (+ main_~b~0 main_~v~0) main_~c~0) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} #106#return; {15673#(or (= (+ main_~c~0 (* (- 1) main_~v~0)) (+ (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0))) (<= (+ main_~b~0 main_~v~0) main_~c~0) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is VALID [2022-04-27 13:09:36,369 INFO L290 TraceCheckUtils]: 51: Hoare triple {15367#true} assume true; {15367#true} is VALID [2022-04-27 13:09:36,369 INFO L290 TraceCheckUtils]: 50: Hoare triple {15367#true} assume !(0 == ~cond); {15367#true} is VALID [2022-04-27 13:09:36,369 INFO L290 TraceCheckUtils]: 49: Hoare triple {15367#true} ~cond := #in~cond; {15367#true} is VALID [2022-04-27 13:09:36,369 INFO L272 TraceCheckUtils]: 48: Hoare triple {15673#(or (= (+ main_~c~0 (* (- 1) main_~v~0)) (+ (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0))) (<= (+ main_~b~0 main_~v~0) main_~c~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)); {15367#true} is VALID [2022-04-27 13:09:36,369 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {15367#true} {15673#(or (= (+ main_~c~0 (* (- 1) main_~v~0)) (+ (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0))) (<= (+ main_~b~0 main_~v~0) main_~c~0) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} #104#return; {15673#(or (= (+ main_~c~0 (* (- 1) main_~v~0)) (+ (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0))) (<= (+ main_~b~0 main_~v~0) main_~c~0) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is VALID [2022-04-27 13:09:36,369 INFO L290 TraceCheckUtils]: 46: Hoare triple {15367#true} assume true; {15367#true} is VALID [2022-04-27 13:09:36,370 INFO L290 TraceCheckUtils]: 45: Hoare triple {15367#true} assume !(0 == ~cond); {15367#true} is VALID [2022-04-27 13:09:36,370 INFO L290 TraceCheckUtils]: 44: Hoare triple {15367#true} ~cond := #in~cond; {15367#true} is VALID [2022-04-27 13:09:36,370 INFO L272 TraceCheckUtils]: 43: Hoare triple {15673#(or (= (+ main_~c~0 (* (- 1) main_~v~0)) (+ (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0))) (<= (+ main_~b~0 main_~v~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)); {15367#true} is VALID [2022-04-27 13:09:36,370 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {15367#true} {15673#(or (= (+ main_~c~0 (* (- 1) main_~v~0)) (+ (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0))) (<= (+ main_~b~0 main_~v~0) main_~c~0) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} #102#return; {15673#(or (= (+ main_~c~0 (* (- 1) main_~v~0)) (+ (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0))) (<= (+ main_~b~0 main_~v~0) main_~c~0) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is VALID [2022-04-27 13:09:36,370 INFO L290 TraceCheckUtils]: 41: Hoare triple {15367#true} assume true; {15367#true} is VALID [2022-04-27 13:09:36,370 INFO L290 TraceCheckUtils]: 40: Hoare triple {15367#true} assume !(0 == ~cond); {15367#true} is VALID [2022-04-27 13:09:36,370 INFO L290 TraceCheckUtils]: 39: Hoare triple {15367#true} ~cond := #in~cond; {15367#true} is VALID [2022-04-27 13:09:36,371 INFO L272 TraceCheckUtils]: 38: Hoare triple {15673#(or (= (+ main_~c~0 (* (- 1) main_~v~0)) (+ (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0))) (<= (+ main_~b~0 main_~v~0) main_~c~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)); {15367#true} is VALID [2022-04-27 13:09:36,371 INFO L290 TraceCheckUtils]: 37: Hoare triple {15673#(or (= (+ main_~c~0 (* (- 1) main_~v~0)) (+ (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0))) (<= (+ main_~b~0 main_~v~0) main_~c~0) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} assume !false; {15673#(or (= (+ main_~c~0 (* (- 1) main_~v~0)) (+ (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0))) (<= (+ main_~b~0 main_~v~0) main_~c~0) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is VALID [2022-04-27 13:09:36,372 INFO L290 TraceCheckUtils]: 36: Hoare triple {15743#(or (<= (* main_~b~0 2) main_~c~0) (= (+ (* 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_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {15673#(or (= (+ main_~c~0 (* (- 1) main_~v~0)) (+ (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0))) (<= (+ main_~b~0 main_~v~0) main_~c~0) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is VALID [2022-04-27 13:09:36,372 INFO L290 TraceCheckUtils]: 35: Hoare triple {15743#(or (<= (* main_~b~0 2) main_~c~0) (= (+ (* 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_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} assume !false; {15743#(or (<= (* main_~b~0 2) main_~c~0) (= (+ (* 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_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is VALID [2022-04-27 13:09:36,373 INFO L290 TraceCheckUtils]: 34: Hoare triple {15750#(or (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= (* main_~b~0 2) main_~a~0))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {15743#(or (<= (* main_~b~0 2) main_~c~0) (= (+ (* 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_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is VALID [2022-04-27 13:09:36,373 INFO L290 TraceCheckUtils]: 33: Hoare triple {15750#(or (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= (* main_~b~0 2) main_~a~0))} assume !false; {15750#(or (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= (* main_~b~0 2) main_~a~0))} is VALID [2022-04-27 13:09:38,375 WARN L290 TraceCheckUtils]: 32: Hoare triple {15757#(and (or (= main_~x~0 0) (not (= (mod (+ (* (- 1) main_~y~0 main_~r~0) (* main_~k~0 main_~y~0 main_~s~0) main_~c~0 (* main_~q~0 main_~k~0 main_~x~0)) main_~x~0) 0)) (<= (+ (* 2 (* main_~x~0 (div (+ (* (- 1) main_~y~0 main_~r~0) (* main_~k~0 main_~y~0 main_~s~0) main_~c~0 (* main_~q~0 main_~k~0 main_~x~0)) main_~x~0))) (* (* main_~y~0 main_~r~0) 2)) (+ (* 2 (* main_~q~0 main_~k~0 main_~x~0)) main_~b~0 (* (* main_~k~0 main_~y~0 main_~s~0) 2))) (= (+ (* (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) (div (+ (* (- 1) main_~y~0 main_~r~0) (* main_~k~0 main_~y~0 main_~s~0) main_~c~0 (* main_~q~0 main_~k~0 main_~x~0)) main_~x~0))) main_~x~0) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) (+ main_~b~0 (* (- 1) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0)) (* (- 1) (* (+ (* (- 1) main_~q~0 main_~k~0) (div (+ (* (- 1) main_~y~0 main_~r~0) (* main_~k~0 main_~y~0 main_~s~0) main_~c~0 (* main_~q~0 main_~k~0 main_~x~0)) main_~x~0)) main_~x~0))))) (or (not (= (+ (* (- 1) main_~y~0 main_~r~0) (* main_~k~0 main_~y~0 main_~s~0) main_~c~0 (* main_~q~0 main_~k~0 main_~x~0)) 0)) (forall ((main_~p~0 Int)) (or (<= (+ (* (* main_~y~0 main_~r~0) 2) (* 2 (* main_~p~0 main_~x~0))) (+ (* 2 (* main_~q~0 main_~k~0 main_~x~0)) main_~b~0 (* (* main_~k~0 main_~y~0 main_~s~0) 2))) (= (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) (+ (* (- 1) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~b~0 (* (- 1) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0)))))) (not (= 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; {15750#(or (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= (* main_~b~0 2) main_~a~0))} is UNKNOWN [2022-04-27 13:09:38,376 INFO L290 TraceCheckUtils]: 31: Hoare triple {15761#(or (and (or (= main_~x~0 0) (not (= (mod (+ (* (- 1) main_~y~0 main_~r~0) (* main_~k~0 main_~y~0 main_~s~0) main_~c~0 (* main_~q~0 main_~k~0 main_~x~0)) main_~x~0) 0)) (<= (+ (* 2 (* main_~x~0 (div (+ (* (- 1) main_~y~0 main_~r~0) (* main_~k~0 main_~y~0 main_~s~0) main_~c~0 (* main_~q~0 main_~k~0 main_~x~0)) main_~x~0))) (* (* main_~y~0 main_~r~0) 2)) (+ (* 2 (* main_~q~0 main_~k~0 main_~x~0)) main_~b~0 (* (* main_~k~0 main_~y~0 main_~s~0) 2))) (= (+ (* (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) (div (+ (* (- 1) main_~y~0 main_~r~0) (* main_~k~0 main_~y~0 main_~s~0) main_~c~0 (* main_~q~0 main_~k~0 main_~x~0)) main_~x~0))) main_~x~0) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) (+ main_~b~0 (* (- 1) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0)) (* (- 1) (* (+ (* (- 1) main_~q~0 main_~k~0) (div (+ (* (- 1) main_~y~0 main_~r~0) (* main_~k~0 main_~y~0 main_~s~0) main_~c~0 (* main_~q~0 main_~k~0 main_~x~0)) main_~x~0)) main_~x~0))))) (or (not (= (+ (* (- 1) main_~y~0 main_~r~0) (* main_~k~0 main_~y~0 main_~s~0) main_~c~0 (* main_~q~0 main_~k~0 main_~x~0)) 0)) (forall ((main_~p~0 Int)) (or (<= (+ (* (* main_~y~0 main_~r~0) 2) (* 2 (* main_~p~0 main_~x~0))) (+ (* 2 (* main_~q~0 main_~k~0 main_~x~0)) main_~b~0 (* (* main_~k~0 main_~y~0 main_~s~0) 2))) (= (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) (+ (* (- 1) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~b~0 (* (- 1) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0)))))) (not (= main_~x~0 0)))) (<= main_~b~0 main_~c~0))} assume !(~c~0 >= ~b~0); {15757#(and (or (= main_~x~0 0) (not (= (mod (+ (* (- 1) main_~y~0 main_~r~0) (* main_~k~0 main_~y~0 main_~s~0) main_~c~0 (* main_~q~0 main_~k~0 main_~x~0)) main_~x~0) 0)) (<= (+ (* 2 (* main_~x~0 (div (+ (* (- 1) main_~y~0 main_~r~0) (* main_~k~0 main_~y~0 main_~s~0) main_~c~0 (* main_~q~0 main_~k~0 main_~x~0)) main_~x~0))) (* (* main_~y~0 main_~r~0) 2)) (+ (* 2 (* main_~q~0 main_~k~0 main_~x~0)) main_~b~0 (* (* main_~k~0 main_~y~0 main_~s~0) 2))) (= (+ (* (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) (div (+ (* (- 1) main_~y~0 main_~r~0) (* main_~k~0 main_~y~0 main_~s~0) main_~c~0 (* main_~q~0 main_~k~0 main_~x~0)) main_~x~0))) main_~x~0) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) (+ main_~b~0 (* (- 1) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0)) (* (- 1) (* (+ (* (- 1) main_~q~0 main_~k~0) (div (+ (* (- 1) main_~y~0 main_~r~0) (* main_~k~0 main_~y~0 main_~s~0) main_~c~0 (* main_~q~0 main_~k~0 main_~x~0)) main_~x~0)) main_~x~0))))) (or (not (= (+ (* (- 1) main_~y~0 main_~r~0) (* main_~k~0 main_~y~0 main_~s~0) main_~c~0 (* main_~q~0 main_~k~0 main_~x~0)) 0)) (forall ((main_~p~0 Int)) (or (<= (+ (* (* main_~y~0 main_~r~0) 2) (* 2 (* main_~p~0 main_~x~0))) (+ (* 2 (* main_~q~0 main_~k~0 main_~x~0)) main_~b~0 (* (* main_~k~0 main_~y~0 main_~s~0) 2))) (= (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) (+ (* (- 1) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~b~0 (* (- 1) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0)))))) (not (= main_~x~0 0))))} is VALID [2022-04-27 13:09:38,377 INFO L290 TraceCheckUtils]: 30: Hoare triple {15761#(or (and (or (= main_~x~0 0) (not (= (mod (+ (* (- 1) main_~y~0 main_~r~0) (* main_~k~0 main_~y~0 main_~s~0) main_~c~0 (* main_~q~0 main_~k~0 main_~x~0)) main_~x~0) 0)) (<= (+ (* 2 (* main_~x~0 (div (+ (* (- 1) main_~y~0 main_~r~0) (* main_~k~0 main_~y~0 main_~s~0) main_~c~0 (* main_~q~0 main_~k~0 main_~x~0)) main_~x~0))) (* (* main_~y~0 main_~r~0) 2)) (+ (* 2 (* main_~q~0 main_~k~0 main_~x~0)) main_~b~0 (* (* main_~k~0 main_~y~0 main_~s~0) 2))) (= (+ (* (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) (div (+ (* (- 1) main_~y~0 main_~r~0) (* main_~k~0 main_~y~0 main_~s~0) main_~c~0 (* main_~q~0 main_~k~0 main_~x~0)) main_~x~0))) main_~x~0) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) (+ main_~b~0 (* (- 1) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0)) (* (- 1) (* (+ (* (- 1) main_~q~0 main_~k~0) (div (+ (* (- 1) main_~y~0 main_~r~0) (* main_~k~0 main_~y~0 main_~s~0) main_~c~0 (* main_~q~0 main_~k~0 main_~x~0)) main_~x~0)) main_~x~0))))) (or (not (= (+ (* (- 1) main_~y~0 main_~r~0) (* main_~k~0 main_~y~0 main_~s~0) main_~c~0 (* main_~q~0 main_~k~0 main_~x~0)) 0)) (forall ((main_~p~0 Int)) (or (<= (+ (* (* main_~y~0 main_~r~0) 2) (* 2 (* main_~p~0 main_~x~0))) (+ (* 2 (* main_~q~0 main_~k~0 main_~x~0)) main_~b~0 (* (* main_~k~0 main_~y~0 main_~s~0) 2))) (= (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) (+ (* (- 1) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~b~0 (* (- 1) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0)))))) (not (= main_~x~0 0)))) (<= main_~b~0 main_~c~0))} assume !false; {15761#(or (and (or (= main_~x~0 0) (not (= (mod (+ (* (- 1) main_~y~0 main_~r~0) (* main_~k~0 main_~y~0 main_~s~0) main_~c~0 (* main_~q~0 main_~k~0 main_~x~0)) main_~x~0) 0)) (<= (+ (* 2 (* main_~x~0 (div (+ (* (- 1) main_~y~0 main_~r~0) (* main_~k~0 main_~y~0 main_~s~0) main_~c~0 (* main_~q~0 main_~k~0 main_~x~0)) main_~x~0))) (* (* main_~y~0 main_~r~0) 2)) (+ (* 2 (* main_~q~0 main_~k~0 main_~x~0)) main_~b~0 (* (* main_~k~0 main_~y~0 main_~s~0) 2))) (= (+ (* (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) (div (+ (* (- 1) main_~y~0 main_~r~0) (* main_~k~0 main_~y~0 main_~s~0) main_~c~0 (* main_~q~0 main_~k~0 main_~x~0)) main_~x~0))) main_~x~0) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) (+ main_~b~0 (* (- 1) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0)) (* (- 1) (* (+ (* (- 1) main_~q~0 main_~k~0) (div (+ (* (- 1) main_~y~0 main_~r~0) (* main_~k~0 main_~y~0 main_~s~0) main_~c~0 (* main_~q~0 main_~k~0 main_~x~0)) main_~x~0)) main_~x~0))))) (or (not (= (+ (* (- 1) main_~y~0 main_~r~0) (* main_~k~0 main_~y~0 main_~s~0) main_~c~0 (* main_~q~0 main_~k~0 main_~x~0)) 0)) (forall ((main_~p~0 Int)) (or (<= (+ (* (* main_~y~0 main_~r~0) 2) (* 2 (* main_~p~0 main_~x~0))) (+ (* 2 (* main_~q~0 main_~k~0 main_~x~0)) main_~b~0 (* (* main_~k~0 main_~y~0 main_~s~0) 2))) (= (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) (+ (* (- 1) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~b~0 (* (- 1) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0)))))) (not (= main_~x~0 0)))) (<= main_~b~0 main_~c~0))} is VALID [2022-04-27 13:09:38,379 INFO L290 TraceCheckUtils]: 29: Hoare triple {15768#(or (and (or (<= (+ (* (* main_~y~0 main_~r~0) 2) (* 2 (* main_~x~0 (div (+ (* (- 1) main_~y~0 main_~r~0) main_~a~0) main_~x~0)))) main_~b~0) (not (= (mod (+ (* main_~q~0 main_~x~0 0) (* (- 1) main_~y~0 main_~r~0) main_~a~0 (* main_~y~0 main_~s~0 0)) main_~x~0) 0)) (= main_~x~0 0) (= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* (+ main_~q~0 (* (- 1) (div (+ (* main_~q~0 main_~x~0 0) (* (- 1) main_~y~0 main_~r~0) main_~a~0 (* main_~y~0 main_~s~0 0)) main_~x~0))) main_~x~0)) (+ (* (- 1) (* (div (+ (* main_~q~0 main_~x~0 0) (* (- 1) main_~y~0 main_~r~0) main_~a~0 (* main_~y~0 main_~s~0 0)) main_~x~0) main_~x~0)) main_~b~0 (* (- 1) (* main_~y~0 main_~r~0))))) (or (not (= 0 (+ (* main_~q~0 main_~x~0 0) (* (- 1) main_~y~0 main_~r~0) main_~a~0 (* main_~y~0 main_~s~0 0)))) (forall ((main_~p~0 Int)) (or (<= (+ (* (* main_~y~0 main_~r~0) 2) (* 2 (* main_~p~0 main_~x~0))) main_~b~0) (= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0)))) (+ main_~b~0 (* (- 1) (* main_~p~0 main_~x~0)) (* (- 1) (* main_~y~0 main_~r~0)))))) (not (= main_~x~0 0)))) (<= main_~b~0 main_~a~0))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {15761#(or (and (or (= main_~x~0 0) (not (= (mod (+ (* (- 1) main_~y~0 main_~r~0) (* main_~k~0 main_~y~0 main_~s~0) main_~c~0 (* main_~q~0 main_~k~0 main_~x~0)) main_~x~0) 0)) (<= (+ (* 2 (* main_~x~0 (div (+ (* (- 1) main_~y~0 main_~r~0) (* main_~k~0 main_~y~0 main_~s~0) main_~c~0 (* main_~q~0 main_~k~0 main_~x~0)) main_~x~0))) (* (* main_~y~0 main_~r~0) 2)) (+ (* 2 (* main_~q~0 main_~k~0 main_~x~0)) main_~b~0 (* (* main_~k~0 main_~y~0 main_~s~0) 2))) (= (+ (* (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) (div (+ (* (- 1) main_~y~0 main_~r~0) (* main_~k~0 main_~y~0 main_~s~0) main_~c~0 (* main_~q~0 main_~k~0 main_~x~0)) main_~x~0))) main_~x~0) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) (+ main_~b~0 (* (- 1) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0)) (* (- 1) (* (+ (* (- 1) main_~q~0 main_~k~0) (div (+ (* (- 1) main_~y~0 main_~r~0) (* main_~k~0 main_~y~0 main_~s~0) main_~c~0 (* main_~q~0 main_~k~0 main_~x~0)) main_~x~0)) main_~x~0))))) (or (not (= (+ (* (- 1) main_~y~0 main_~r~0) (* main_~k~0 main_~y~0 main_~s~0) main_~c~0 (* main_~q~0 main_~k~0 main_~x~0)) 0)) (forall ((main_~p~0 Int)) (or (<= (+ (* (* main_~y~0 main_~r~0) 2) (* 2 (* main_~p~0 main_~x~0))) (+ (* 2 (* main_~q~0 main_~k~0 main_~x~0)) main_~b~0 (* (* main_~k~0 main_~y~0 main_~s~0) 2))) (= (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) (+ (* (- 1) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~b~0 (* (- 1) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0)))))) (not (= main_~x~0 0)))) (<= main_~b~0 main_~c~0))} is VALID [2022-04-27 13:09:38,381 INFO L290 TraceCheckUtils]: 28: Hoare triple {15768#(or (and (or (<= (+ (* (* main_~y~0 main_~r~0) 2) (* 2 (* main_~x~0 (div (+ (* (- 1) main_~y~0 main_~r~0) main_~a~0) main_~x~0)))) main_~b~0) (not (= (mod (+ (* main_~q~0 main_~x~0 0) (* (- 1) main_~y~0 main_~r~0) main_~a~0 (* main_~y~0 main_~s~0 0)) main_~x~0) 0)) (= main_~x~0 0) (= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* (+ main_~q~0 (* (- 1) (div (+ (* main_~q~0 main_~x~0 0) (* (- 1) main_~y~0 main_~r~0) main_~a~0 (* main_~y~0 main_~s~0 0)) main_~x~0))) main_~x~0)) (+ (* (- 1) (* (div (+ (* main_~q~0 main_~x~0 0) (* (- 1) main_~y~0 main_~r~0) main_~a~0 (* main_~y~0 main_~s~0 0)) main_~x~0) main_~x~0)) main_~b~0 (* (- 1) (* main_~y~0 main_~r~0))))) (or (not (= 0 (+ (* main_~q~0 main_~x~0 0) (* (- 1) main_~y~0 main_~r~0) main_~a~0 (* main_~y~0 main_~s~0 0)))) (forall ((main_~p~0 Int)) (or (<= (+ (* (* main_~y~0 main_~r~0) 2) (* 2 (* main_~p~0 main_~x~0))) main_~b~0) (= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0)))) (+ main_~b~0 (* (- 1) (* main_~p~0 main_~x~0)) (* (- 1) (* main_~y~0 main_~r~0)))))) (not (= main_~x~0 0)))) (<= main_~b~0 main_~a~0))} assume !false; {15768#(or (and (or (<= (+ (* (* main_~y~0 main_~r~0) 2) (* 2 (* main_~x~0 (div (+ (* (- 1) main_~y~0 main_~r~0) main_~a~0) main_~x~0)))) main_~b~0) (not (= (mod (+ (* main_~q~0 main_~x~0 0) (* (- 1) main_~y~0 main_~r~0) main_~a~0 (* main_~y~0 main_~s~0 0)) main_~x~0) 0)) (= main_~x~0 0) (= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* (+ main_~q~0 (* (- 1) (div (+ (* main_~q~0 main_~x~0 0) (* (- 1) main_~y~0 main_~r~0) main_~a~0 (* main_~y~0 main_~s~0 0)) main_~x~0))) main_~x~0)) (+ (* (- 1) (* (div (+ (* main_~q~0 main_~x~0 0) (* (- 1) main_~y~0 main_~r~0) main_~a~0 (* main_~y~0 main_~s~0 0)) main_~x~0) main_~x~0)) main_~b~0 (* (- 1) (* main_~y~0 main_~r~0))))) (or (not (= 0 (+ (* main_~q~0 main_~x~0 0) (* (- 1) main_~y~0 main_~r~0) main_~a~0 (* main_~y~0 main_~s~0 0)))) (forall ((main_~p~0 Int)) (or (<= (+ (* (* main_~y~0 main_~r~0) 2) (* 2 (* main_~p~0 main_~x~0))) main_~b~0) (= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0)))) (+ main_~b~0 (* (- 1) (* main_~p~0 main_~x~0)) (* (- 1) (* main_~y~0 main_~r~0)))))) (not (= main_~x~0 0)))) (<= main_~b~0 main_~a~0))} is VALID [2022-04-27 13:09:38,381 INFO L290 TraceCheckUtils]: 27: Hoare triple {15367#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {15768#(or (and (or (<= (+ (* (* main_~y~0 main_~r~0) 2) (* 2 (* main_~x~0 (div (+ (* (- 1) main_~y~0 main_~r~0) main_~a~0) main_~x~0)))) main_~b~0) (not (= (mod (+ (* main_~q~0 main_~x~0 0) (* (- 1) main_~y~0 main_~r~0) main_~a~0 (* main_~y~0 main_~s~0 0)) main_~x~0) 0)) (= main_~x~0 0) (= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* (+ main_~q~0 (* (- 1) (div (+ (* main_~q~0 main_~x~0 0) (* (- 1) main_~y~0 main_~r~0) main_~a~0 (* main_~y~0 main_~s~0 0)) main_~x~0))) main_~x~0)) (+ (* (- 1) (* (div (+ (* main_~q~0 main_~x~0 0) (* (- 1) main_~y~0 main_~r~0) main_~a~0 (* main_~y~0 main_~s~0 0)) main_~x~0) main_~x~0)) main_~b~0 (* (- 1) (* main_~y~0 main_~r~0))))) (or (not (= 0 (+ (* main_~q~0 main_~x~0 0) (* (- 1) main_~y~0 main_~r~0) main_~a~0 (* main_~y~0 main_~s~0 0)))) (forall ((main_~p~0 Int)) (or (<= (+ (* (* main_~y~0 main_~r~0) 2) (* 2 (* main_~p~0 main_~x~0))) main_~b~0) (= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0)))) (+ main_~b~0 (* (- 1) (* main_~p~0 main_~x~0)) (* (- 1) (* main_~y~0 main_~r~0)))))) (not (= main_~x~0 0)))) (<= main_~b~0 main_~a~0))} is VALID [2022-04-27 13:09:38,382 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {15367#true} {15367#true} #100#return; {15367#true} is VALID [2022-04-27 13:09:38,382 INFO L290 TraceCheckUtils]: 25: Hoare triple {15367#true} assume true; {15367#true} is VALID [2022-04-27 13:09:38,382 INFO L290 TraceCheckUtils]: 24: Hoare triple {15367#true} assume !(0 == ~cond); {15367#true} is VALID [2022-04-27 13:09:38,382 INFO L290 TraceCheckUtils]: 23: Hoare triple {15367#true} ~cond := #in~cond; {15367#true} is VALID [2022-04-27 13:09:38,382 INFO L272 TraceCheckUtils]: 22: Hoare triple {15367#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {15367#true} is VALID [2022-04-27 13:09:38,382 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {15367#true} {15367#true} #98#return; {15367#true} is VALID [2022-04-27 13:09:38,382 INFO L290 TraceCheckUtils]: 20: Hoare triple {15367#true} assume true; {15367#true} is VALID [2022-04-27 13:09:38,382 INFO L290 TraceCheckUtils]: 19: Hoare triple {15367#true} assume !(0 == ~cond); {15367#true} is VALID [2022-04-27 13:09:38,382 INFO L290 TraceCheckUtils]: 18: Hoare triple {15367#true} ~cond := #in~cond; {15367#true} is VALID [2022-04-27 13:09:38,382 INFO L272 TraceCheckUtils]: 17: Hoare triple {15367#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {15367#true} is VALID [2022-04-27 13:09:38,382 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {15367#true} {15367#true} #96#return; {15367#true} is VALID [2022-04-27 13:09:38,382 INFO L290 TraceCheckUtils]: 15: Hoare triple {15367#true} assume true; {15367#true} is VALID [2022-04-27 13:09:38,382 INFO L290 TraceCheckUtils]: 14: Hoare triple {15367#true} assume !(0 == ~cond); {15367#true} is VALID [2022-04-27 13:09:38,382 INFO L290 TraceCheckUtils]: 13: Hoare triple {15367#true} ~cond := #in~cond; {15367#true} is VALID [2022-04-27 13:09:38,382 INFO L272 TraceCheckUtils]: 12: Hoare triple {15367#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 10 then 1 else 0)); {15367#true} is VALID [2022-04-27 13:09:38,382 INFO L290 TraceCheckUtils]: 11: Hoare triple {15367#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {15367#true} is VALID [2022-04-27 13:09:38,382 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {15367#true} {15367#true} #94#return; {15367#true} is VALID [2022-04-27 13:09:38,382 INFO L290 TraceCheckUtils]: 9: Hoare triple {15367#true} assume true; {15367#true} is VALID [2022-04-27 13:09:38,382 INFO L290 TraceCheckUtils]: 8: Hoare triple {15367#true} assume !(0 == ~cond); {15367#true} is VALID [2022-04-27 13:09:38,382 INFO L290 TraceCheckUtils]: 7: Hoare triple {15367#true} ~cond := #in~cond; {15367#true} is VALID [2022-04-27 13:09:38,383 INFO L272 TraceCheckUtils]: 6: Hoare triple {15367#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 10 then 1 else 0)); {15367#true} is VALID [2022-04-27 13:09:38,383 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;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {15367#true} is VALID [2022-04-27 13:09:38,383 INFO L272 TraceCheckUtils]: 4: Hoare triple {15367#true} call #t~ret6 := main(); {15367#true} is VALID [2022-04-27 13:09:38,383 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15367#true} {15367#true} #112#return; {15367#true} is VALID [2022-04-27 13:09:38,383 INFO L290 TraceCheckUtils]: 2: Hoare triple {15367#true} assume true; {15367#true} is VALID [2022-04-27 13:09:38,383 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-27 13:09:38,383 INFO L272 TraceCheckUtils]: 0: Hoare triple {15367#true} call ULTIMATE.init(); {15367#true} is VALID [2022-04-27 13:09:38,383 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 21 proven. 23 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2022-04-27 13:09:38,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:09:38,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328367684] [2022-04-27 13:09:38,383 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:09:38,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1879642343] [2022-04-27 13:09:38,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1879642343] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 13:09:38,384 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 13:09:38,384 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 16] total 30 [2022-04-27 13:09:38,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257892924] [2022-04-27 13:09:38,384 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 13:09:38,384 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 28 states have (on average 2.2857142857142856) internal successors, (64), 27 states have internal predecessors, (64), 8 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (19), 6 states have call predecessors, (19), 6 states have call successors, (19) Word has length 77 [2022-04-27 13:09:38,384 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:09:38,385 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 30 states, 28 states have (on average 2.2857142857142856) internal successors, (64), 27 states have internal predecessors, (64), 8 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (19), 6 states have call predecessors, (19), 6 states have call successors, (19) [2022-04-27 13:09:40,766 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 103 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-27 13:09:40,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-04-27 13:09:40,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:09:40,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-04-27 13:09:40,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=749, Unknown=0, NotChecked=0, Total=870 [2022-04-27 13:09:40,768 INFO L87 Difference]: Start difference. First operand 255 states and 339 transitions. Second operand has 30 states, 28 states have (on average 2.2857142857142856) internal successors, (64), 27 states have internal predecessors, (64), 8 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (19), 6 states have call predecessors, (19), 6 states have call successors, (19) [2022-04-27 13:10:09,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:10:09,439 INFO L93 Difference]: Finished difference Result 379 states and 508 transitions. [2022-04-27 13:10:09,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-04-27 13:10:09,440 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 28 states have (on average 2.2857142857142856) internal successors, (64), 27 states have internal predecessors, (64), 8 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (19), 6 states have call predecessors, (19), 6 states have call successors, (19) Word has length 77 [2022-04-27 13:10:09,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:10:09,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 28 states have (on average 2.2857142857142856) internal successors, (64), 27 states have internal predecessors, (64), 8 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (19), 6 states have call predecessors, (19), 6 states have call successors, (19) [2022-04-27 13:10:09,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 235 transitions. [2022-04-27 13:10:09,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 28 states have (on average 2.2857142857142856) internal successors, (64), 27 states have internal predecessors, (64), 8 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (19), 6 states have call predecessors, (19), 6 states have call successors, (19) [2022-04-27 13:10:09,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 235 transitions. [2022-04-27 13:10:09,446 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 235 transitions. [2022-04-27 13:10:11,960 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 235 edges. 234 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-27 13:10:11,968 INFO L225 Difference]: With dead ends: 379 [2022-04-27 13:10:11,968 INFO L226 Difference]: Without dead ends: 377 [2022-04-27 13:10:11,969 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 134 SyntacticMatches, 2 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 918 ImplicationChecksByTransitivity, 12.3s TimeCoverageRelationStatistics Valid=706, Invalid=3076, Unknown=0, NotChecked=0, Total=3782 [2022-04-27 13:10:11,969 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 249 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 1510 mSolverCounterSat, 475 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 2122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 475 IncrementalHoareTripleChecker+Valid, 1510 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 137 IncrementalHoareTripleChecker+Unchecked, 8.9s IncrementalHoareTripleChecker+Time [2022-04-27 13:10:11,969 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 379 Invalid, 2122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [475 Valid, 1510 Invalid, 0 Unknown, 137 Unchecked, 8.9s Time] [2022-04-27 13:10:11,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2022-04-27 13:10:13,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 359. [2022-04-27 13:10:13,140 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:10:13,141 INFO L82 GeneralOperation]: Start isEquivalent. First operand 377 states. Second operand has 359 states, 222 states have (on average 1.1711711711711712) internal successors, (260), 226 states have internal predecessors, (260), 113 states have call successors, (113), 24 states have call predecessors, (113), 23 states have return successors, (111), 108 states have call predecessors, (111), 111 states have call successors, (111) [2022-04-27 13:10:13,141 INFO L74 IsIncluded]: Start isIncluded. First operand 377 states. Second operand has 359 states, 222 states have (on average 1.1711711711711712) internal successors, (260), 226 states have internal predecessors, (260), 113 states have call successors, (113), 24 states have call predecessors, (113), 23 states have return successors, (111), 108 states have call predecessors, (111), 111 states have call successors, (111) [2022-04-27 13:10:13,142 INFO L87 Difference]: Start difference. First operand 377 states. Second operand has 359 states, 222 states have (on average 1.1711711711711712) internal successors, (260), 226 states have internal predecessors, (260), 113 states have call successors, (113), 24 states have call predecessors, (113), 23 states have return successors, (111), 108 states have call predecessors, (111), 111 states have call successors, (111) [2022-04-27 13:10:13,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:10:13,149 INFO L93 Difference]: Finished difference Result 377 states and 506 transitions. [2022-04-27 13:10:13,149 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 506 transitions. [2022-04-27 13:10:13,150 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:10:13,150 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:10:13,151 INFO L74 IsIncluded]: Start isIncluded. First operand has 359 states, 222 states have (on average 1.1711711711711712) internal successors, (260), 226 states have internal predecessors, (260), 113 states have call successors, (113), 24 states have call predecessors, (113), 23 states have return successors, (111), 108 states have call predecessors, (111), 111 states have call successors, (111) Second operand 377 states. [2022-04-27 13:10:13,151 INFO L87 Difference]: Start difference. First operand has 359 states, 222 states have (on average 1.1711711711711712) internal successors, (260), 226 states have internal predecessors, (260), 113 states have call successors, (113), 24 states have call predecessors, (113), 23 states have return successors, (111), 108 states have call predecessors, (111), 111 states have call successors, (111) Second operand 377 states. [2022-04-27 13:10:13,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:10:13,158 INFO L93 Difference]: Finished difference Result 377 states and 506 transitions. [2022-04-27 13:10:13,158 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 506 transitions. [2022-04-27 13:10:13,158 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:10:13,158 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:10:13,158 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:10:13,159 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:10:13,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 222 states have (on average 1.1711711711711712) internal successors, (260), 226 states have internal predecessors, (260), 113 states have call successors, (113), 24 states have call predecessors, (113), 23 states have return successors, (111), 108 states have call predecessors, (111), 111 states have call successors, (111) [2022-04-27 13:10:13,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 484 transitions. [2022-04-27 13:10:13,166 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 484 transitions. Word has length 77 [2022-04-27 13:10:13,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:10:13,167 INFO L495 AbstractCegarLoop]: Abstraction has 359 states and 484 transitions. [2022-04-27 13:10:13,167 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 28 states have (on average 2.2857142857142856) internal successors, (64), 27 states have internal predecessors, (64), 8 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (19), 6 states have call predecessors, (19), 6 states have call successors, (19) [2022-04-27 13:10:13,167 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 484 transitions. [2022-04-27 13:10:13,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-04-27 13:10:13,168 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:10:13,168 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:10:13,184 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-27 13:10:13,383 WARN L477 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-27 13:10:13,383 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:10:13,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:10:13,383 INFO L85 PathProgramCache]: Analyzing trace with hash -1455197645, now seen corresponding path program 1 times [2022-04-27 13:10:13,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:10:13,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647194855] [2022-04-27 13:10:13,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:10:13,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:10:13,394 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:10:13,394 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1305537060] [2022-04-27 13:10:13,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:10:13,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:10:13,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:10:13,400 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-27 13:10:13,401 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-27 13:10:13,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:10:13,456 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 89 conjunts are in the unsatisfiable core [2022-04-27 13:10:13,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:10:13,470 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:10:14,538 INFO L272 TraceCheckUtils]: 0: Hoare triple {17835#true} call ULTIMATE.init(); {17835#true} is VALID [2022-04-27 13:10:14,538 INFO L290 TraceCheckUtils]: 1: Hoare triple {17835#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); {17835#true} is VALID [2022-04-27 13:10:14,538 INFO L290 TraceCheckUtils]: 2: Hoare triple {17835#true} assume true; {17835#true} is VALID [2022-04-27 13:10:14,538 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17835#true} {17835#true} #112#return; {17835#true} is VALID [2022-04-27 13:10:14,538 INFO L272 TraceCheckUtils]: 4: Hoare triple {17835#true} call #t~ret6 := main(); {17835#true} is VALID [2022-04-27 13:10:14,538 INFO L290 TraceCheckUtils]: 5: Hoare triple {17835#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;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {17835#true} is VALID [2022-04-27 13:10:14,538 INFO L272 TraceCheckUtils]: 6: Hoare triple {17835#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 10 then 1 else 0)); {17835#true} is VALID [2022-04-27 13:10:14,538 INFO L290 TraceCheckUtils]: 7: Hoare triple {17835#true} ~cond := #in~cond; {17835#true} is VALID [2022-04-27 13:10:14,538 INFO L290 TraceCheckUtils]: 8: Hoare triple {17835#true} assume !(0 == ~cond); {17835#true} is VALID [2022-04-27 13:10:14,538 INFO L290 TraceCheckUtils]: 9: Hoare triple {17835#true} assume true; {17835#true} is VALID [2022-04-27 13:10:14,538 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {17835#true} {17835#true} #94#return; {17835#true} is VALID [2022-04-27 13:10:14,539 INFO L290 TraceCheckUtils]: 11: Hoare triple {17835#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {17835#true} is VALID [2022-04-27 13:10:14,539 INFO L272 TraceCheckUtils]: 12: Hoare triple {17835#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 10 then 1 else 0)); {17835#true} is VALID [2022-04-27 13:10:14,539 INFO L290 TraceCheckUtils]: 13: Hoare triple {17835#true} ~cond := #in~cond; {17835#true} is VALID [2022-04-27 13:10:14,539 INFO L290 TraceCheckUtils]: 14: Hoare triple {17835#true} assume !(0 == ~cond); {17835#true} is VALID [2022-04-27 13:10:14,539 INFO L290 TraceCheckUtils]: 15: Hoare triple {17835#true} assume true; {17835#true} is VALID [2022-04-27 13:10:14,539 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {17835#true} {17835#true} #96#return; {17835#true} is VALID [2022-04-27 13:10:14,539 INFO L272 TraceCheckUtils]: 17: Hoare triple {17835#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {17835#true} is VALID [2022-04-27 13:10:14,539 INFO L290 TraceCheckUtils]: 18: Hoare triple {17835#true} ~cond := #in~cond; {17835#true} is VALID [2022-04-27 13:10:14,539 INFO L290 TraceCheckUtils]: 19: Hoare triple {17835#true} assume !(0 == ~cond); {17835#true} is VALID [2022-04-27 13:10:14,539 INFO L290 TraceCheckUtils]: 20: Hoare triple {17835#true} assume true; {17835#true} is VALID [2022-04-27 13:10:14,539 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {17835#true} {17835#true} #98#return; {17835#true} is VALID [2022-04-27 13:10:14,539 INFO L272 TraceCheckUtils]: 22: Hoare triple {17835#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {17835#true} is VALID [2022-04-27 13:10:14,539 INFO L290 TraceCheckUtils]: 23: Hoare triple {17835#true} ~cond := #in~cond; {17835#true} is VALID [2022-04-27 13:10:14,539 INFO L290 TraceCheckUtils]: 24: Hoare triple {17835#true} assume !(0 == ~cond); {17835#true} is VALID [2022-04-27 13:10:14,539 INFO L290 TraceCheckUtils]: 25: Hoare triple {17835#true} assume true; {17835#true} is VALID [2022-04-27 13:10:14,539 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {17835#true} {17835#true} #100#return; {17835#true} is VALID [2022-04-27 13:10:14,540 INFO L290 TraceCheckUtils]: 27: Hoare triple {17835#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {17921#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:10:14,540 INFO L290 TraceCheckUtils]: 28: Hoare triple {17921#(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; {17921#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:10:14,540 INFO L290 TraceCheckUtils]: 29: Hoare triple {17921#(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);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {17928#(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-27 13:10:14,541 INFO L290 TraceCheckUtils]: 30: Hoare triple {17928#(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; {17928#(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-27 13:10:14,541 INFO L290 TraceCheckUtils]: 31: Hoare triple {17928#(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); {17928#(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-27 13:10:14,541 INFO L290 TraceCheckUtils]: 32: Hoare triple {17928#(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; {17938#(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-27 13:10:14,542 INFO L290 TraceCheckUtils]: 33: Hoare triple {17938#(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; {17938#(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-27 13:10:14,542 INFO L290 TraceCheckUtils]: 34: Hoare triple {17938#(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);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {17945#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~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-27 13:10:14,543 INFO L290 TraceCheckUtils]: 35: Hoare triple {17945#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} assume !false; {17945#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~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-27 13:10:14,543 INFO L290 TraceCheckUtils]: 36: Hoare triple {17945#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~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);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {17952#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~d~0 1) (= main_~q~0 1))} is VALID [2022-04-27 13:10:14,543 INFO L290 TraceCheckUtils]: 37: Hoare triple {17952#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~d~0 1) (= main_~q~0 1))} assume !false; {17952#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~d~0 1) (= main_~q~0 1))} is VALID [2022-04-27 13:10:14,543 INFO L272 TraceCheckUtils]: 38: Hoare triple {17952#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~d~0 1) (= main_~q~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {17835#true} is VALID [2022-04-27 13:10:14,544 INFO L290 TraceCheckUtils]: 39: Hoare triple {17835#true} ~cond := #in~cond; {17835#true} is VALID [2022-04-27 13:10:14,544 INFO L290 TraceCheckUtils]: 40: Hoare triple {17835#true} assume !(0 == ~cond); {17835#true} is VALID [2022-04-27 13:10:14,544 INFO L290 TraceCheckUtils]: 41: Hoare triple {17835#true} assume true; {17835#true} is VALID [2022-04-27 13:10:14,544 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {17835#true} {17952#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~d~0 1) (= main_~q~0 1))} #102#return; {17952#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~d~0 1) (= main_~q~0 1))} is VALID [2022-04-27 13:10:14,544 INFO L272 TraceCheckUtils]: 43: Hoare triple {17952#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~d~0 1) (= main_~q~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {17835#true} is VALID [2022-04-27 13:10:14,544 INFO L290 TraceCheckUtils]: 44: Hoare triple {17835#true} ~cond := #in~cond; {17835#true} is VALID [2022-04-27 13:10:14,545 INFO L290 TraceCheckUtils]: 45: Hoare triple {17835#true} assume !(0 == ~cond); {17835#true} is VALID [2022-04-27 13:10:14,545 INFO L290 TraceCheckUtils]: 46: Hoare triple {17835#true} assume true; {17835#true} is VALID [2022-04-27 13:10:14,545 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {17835#true} {17952#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~d~0 1) (= main_~q~0 1))} #104#return; {17952#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~d~0 1) (= main_~q~0 1))} is VALID [2022-04-27 13:10:14,545 INFO L272 TraceCheckUtils]: 48: Hoare triple {17952#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~d~0 1) (= main_~q~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {17835#true} is VALID [2022-04-27 13:10:14,545 INFO L290 TraceCheckUtils]: 49: Hoare triple {17835#true} ~cond := #in~cond; {17835#true} is VALID [2022-04-27 13:10:14,545 INFO L290 TraceCheckUtils]: 50: Hoare triple {17835#true} assume !(0 == ~cond); {17835#true} is VALID [2022-04-27 13:10:14,545 INFO L290 TraceCheckUtils]: 51: Hoare triple {17835#true} assume true; {17835#true} is VALID [2022-04-27 13:10:14,546 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {17835#true} {17952#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~d~0 1) (= main_~q~0 1))} #106#return; {17952#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~d~0 1) (= main_~q~0 1))} is VALID [2022-04-27 13:10:14,546 INFO L272 TraceCheckUtils]: 53: Hoare triple {17952#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~d~0 1) (= main_~q~0 1))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {17835#true} is VALID [2022-04-27 13:10:14,546 INFO L290 TraceCheckUtils]: 54: Hoare triple {17835#true} ~cond := #in~cond; {18007#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:10:14,547 INFO L290 TraceCheckUtils]: 55: Hoare triple {18007#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {18011#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:10:14,547 INFO L290 TraceCheckUtils]: 56: Hoare triple {18011#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {18011#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:10:14,548 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {18011#(not (= |__VERIFIER_assert_#in~cond| 0))} {17952#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~d~0 1) (= main_~q~0 1))} #108#return; {17952#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~d~0 1) (= main_~q~0 1))} is VALID [2022-04-27 13:10:14,548 INFO L290 TraceCheckUtils]: 58: Hoare triple {17952#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~d~0 1) (= main_~q~0 1))} assume !!(~c~0 >= 2 * ~v~0);~d~0 := 2 * ~d~0;~v~0 := 2 * ~v~0; {18021#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~v~0 (* main_~b~0 2)) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~d~0 2) (= main_~q~0 1))} is VALID [2022-04-27 13:10:14,549 INFO L290 TraceCheckUtils]: 59: Hoare triple {18021#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~v~0 (* main_~b~0 2)) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~d~0 2) (= main_~q~0 1))} assume !false; {18021#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~v~0 (* main_~b~0 2)) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~d~0 2) (= main_~q~0 1))} is VALID [2022-04-27 13:10:14,549 INFO L272 TraceCheckUtils]: 60: Hoare triple {18021#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~v~0 (* main_~b~0 2)) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~d~0 2) (= main_~q~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {17835#true} is VALID [2022-04-27 13:10:14,549 INFO L290 TraceCheckUtils]: 61: Hoare triple {17835#true} ~cond := #in~cond; {18007#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:10:14,549 INFO L290 TraceCheckUtils]: 62: Hoare triple {18007#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {18011#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:10:14,550 INFO L290 TraceCheckUtils]: 63: Hoare triple {18011#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {18011#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:10:14,551 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {18011#(not (= |__VERIFIER_assert_#in~cond| 0))} {18021#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~v~0 (* main_~b~0 2)) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~d~0 2) (= main_~q~0 1))} #102#return; {18040#(and (= main_~s~0 0) (= main_~v~0 (* main_~b~0 2)) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 2) (= main_~q~0 1) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-27 13:10:14,551 INFO L272 TraceCheckUtils]: 65: Hoare triple {18040#(and (= main_~s~0 0) (= main_~v~0 (* main_~b~0 2)) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 2) (= main_~q~0 1) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {17835#true} is VALID [2022-04-27 13:10:14,551 INFO L290 TraceCheckUtils]: 66: Hoare triple {17835#true} ~cond := #in~cond; {18007#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:10:14,551 INFO L290 TraceCheckUtils]: 67: Hoare triple {18007#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {18011#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:10:14,552 INFO L290 TraceCheckUtils]: 68: Hoare triple {18011#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {18011#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:10:14,552 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {18011#(not (= |__VERIFIER_assert_#in~cond| 0))} {18040#(and (= main_~s~0 0) (= main_~v~0 (* main_~b~0 2)) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 2) (= main_~q~0 1) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} #104#return; {18040#(and (= main_~s~0 0) (= main_~v~0 (* main_~b~0 2)) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 2) (= main_~q~0 1) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-27 13:10:14,552 INFO L272 TraceCheckUtils]: 70: Hoare triple {18040#(and (= main_~s~0 0) (= main_~v~0 (* main_~b~0 2)) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 2) (= main_~q~0 1) (= main_~c~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)); {17835#true} is VALID [2022-04-27 13:10:14,552 INFO L290 TraceCheckUtils]: 71: Hoare triple {17835#true} ~cond := #in~cond; {17835#true} is VALID [2022-04-27 13:10:14,552 INFO L290 TraceCheckUtils]: 72: Hoare triple {17835#true} assume !(0 == ~cond); {17835#true} is VALID [2022-04-27 13:10:14,552 INFO L290 TraceCheckUtils]: 73: Hoare triple {17835#true} assume true; {17835#true} is VALID [2022-04-27 13:10:14,553 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {17835#true} {18040#(and (= main_~s~0 0) (= main_~v~0 (* main_~b~0 2)) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 2) (= main_~q~0 1) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} #106#return; {18040#(and (= main_~s~0 0) (= main_~v~0 (* main_~b~0 2)) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 2) (= main_~q~0 1) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-27 13:10:14,553 INFO L272 TraceCheckUtils]: 75: Hoare triple {18040#(and (= main_~s~0 0) (= main_~v~0 (* main_~b~0 2)) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 2) (= main_~q~0 1) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {17835#true} is VALID [2022-04-27 13:10:14,554 INFO L290 TraceCheckUtils]: 76: Hoare triple {17835#true} ~cond := #in~cond; {18007#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:10:14,554 INFO L290 TraceCheckUtils]: 77: Hoare triple {18007#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {18011#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:10:14,554 INFO L290 TraceCheckUtils]: 78: Hoare triple {18011#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {18011#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:10:14,555 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {18011#(not (= |__VERIFIER_assert_#in~cond| 0))} {18040#(and (= main_~s~0 0) (= main_~v~0 (* main_~b~0 2)) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 2) (= main_~q~0 1) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} #108#return; {18040#(and (= main_~s~0 0) (= main_~v~0 (* main_~b~0 2)) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 2) (= main_~q~0 1) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-27 13:10:14,555 INFO L290 TraceCheckUtils]: 80: Hoare triple {18040#(and (= main_~s~0 0) (= main_~v~0 (* main_~b~0 2)) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 2) (= main_~q~0 1) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} assume !(~c~0 >= 2 * ~v~0); {18040#(and (= main_~s~0 0) (= main_~v~0 (* main_~b~0 2)) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 2) (= main_~q~0 1) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-27 13:10:14,556 INFO L290 TraceCheckUtils]: 81: Hoare triple {18040#(and (= main_~s~0 0) (= main_~v~0 (* main_~b~0 2)) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 2) (= main_~q~0 1) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {18092#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~c~0 (+ (* (- 2) main_~b~0) (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= main_~b~0 main_~x~0) (= main_~k~0 2) (= main_~q~0 1))} is VALID [2022-04-27 13:10:14,557 INFO L290 TraceCheckUtils]: 82: Hoare triple {18092#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~c~0 (+ (* (- 2) main_~b~0) (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= main_~b~0 main_~x~0) (= main_~k~0 2) (= main_~q~0 1))} assume !false; {18092#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~c~0 (+ (* (- 2) main_~b~0) (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= main_~b~0 main_~x~0) (= main_~k~0 2) (= main_~q~0 1))} is VALID [2022-04-27 13:10:14,557 INFO L290 TraceCheckUtils]: 83: Hoare triple {18092#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~c~0 (+ (* (- 2) main_~b~0) (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= main_~b~0 main_~x~0) (= main_~k~0 2) (= main_~q~0 1))} assume !(~c~0 >= ~b~0); {18092#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~c~0 (+ (* (- 2) main_~b~0) (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= main_~b~0 main_~x~0) (= main_~k~0 2) (= main_~q~0 1))} is VALID [2022-04-27 13:10:14,558 INFO L290 TraceCheckUtils]: 84: Hoare triple {18092#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~c~0 (+ (* (- 2) main_~b~0) (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= main_~b~0 main_~x~0) (= main_~k~0 2) (= 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; {18102#(and (= main_~r~0 0) (= main_~b~0 (+ main_~y~0 (* (- 2) main_~a~0))) (= 2 (* (- 1) main_~q~0)) (= (+ (* (- 1) (* main_~r~0 (* (- 1) main_~q~0))) 1) main_~s~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:10:14,558 INFO L290 TraceCheckUtils]: 85: Hoare triple {18102#(and (= main_~r~0 0) (= main_~b~0 (+ main_~y~0 (* (- 2) main_~a~0))) (= 2 (* (- 1) main_~q~0)) (= (+ (* (- 1) (* main_~r~0 (* (- 1) main_~q~0))) 1) main_~s~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !false; {18102#(and (= main_~r~0 0) (= main_~b~0 (+ main_~y~0 (* (- 2) main_~a~0))) (= 2 (* (- 1) main_~q~0)) (= (+ (* (- 1) (* main_~r~0 (* (- 1) main_~q~0))) 1) main_~s~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:10:14,559 INFO L290 TraceCheckUtils]: 86: Hoare triple {18102#(and (= main_~r~0 0) (= main_~b~0 (+ main_~y~0 (* (- 2) main_~a~0))) (= 2 (* (- 1) main_~q~0)) (= (+ (* (- 1) (* main_~r~0 (* (- 1) main_~q~0))) 1) main_~s~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !(0 != ~b~0); {18109#(and (= main_~r~0 0) (= (+ main_~y~0 (* (- 2) main_~a~0)) 0) (= 2 (* (- 1) main_~q~0)) (= (+ (* (- 1) (* main_~r~0 (* (- 1) main_~q~0))) 1) main_~s~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:10:14,559 INFO L272 TraceCheckUtils]: 87: Hoare triple {18109#(and (= main_~r~0 0) (= (+ main_~y~0 (* (- 2) main_~a~0)) 0) (= 2 (* (- 1) main_~q~0)) (= (+ (* (- 1) (* main_~r~0 (* (- 1) main_~q~0))) 1) main_~s~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {18113#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:10:14,560 INFO L290 TraceCheckUtils]: 88: Hoare triple {18113#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {18117#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:10:14,560 INFO L290 TraceCheckUtils]: 89: Hoare triple {18117#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {17836#false} is VALID [2022-04-27 13:10:14,560 INFO L290 TraceCheckUtils]: 90: Hoare triple {17836#false} assume !false; {17836#false} is VALID [2022-04-27 13:10:14,561 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 51 proven. 32 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2022-04-27 13:10:14,561 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:10:56,329 INFO L290 TraceCheckUtils]: 90: Hoare triple {17836#false} assume !false; {17836#false} is VALID [2022-04-27 13:10:56,329 INFO L290 TraceCheckUtils]: 89: Hoare triple {18117#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {17836#false} is VALID [2022-04-27 13:10:56,330 INFO L290 TraceCheckUtils]: 88: Hoare triple {18113#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {18117#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:10:56,330 INFO L272 TraceCheckUtils]: 87: Hoare triple {18133#(= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {18113#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:10:56,331 INFO L290 TraceCheckUtils]: 86: Hoare triple {18137#(or (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 0)))} assume !(0 != ~b~0); {18133#(= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 13:10:56,331 INFO L290 TraceCheckUtils]: 85: Hoare triple {18137#(or (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 0)))} assume !false; {18137#(or (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 0)))} is VALID [2022-04-27 13:10:56,460 INFO L290 TraceCheckUtils]: 84: Hoare triple {18144#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~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; {18137#(or (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 0)))} is VALID [2022-04-27 13:10:56,460 INFO L290 TraceCheckUtils]: 83: Hoare triple {18144#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} assume !(~c~0 >= ~b~0); {18144#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-27 13:10:56,461 INFO L290 TraceCheckUtils]: 82: Hoare triple {18144#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} assume !false; {18144#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-27 13:10:56,592 INFO L290 TraceCheckUtils]: 81: Hoare triple {18154#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {18144#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-27 13:10:56,592 INFO L290 TraceCheckUtils]: 80: Hoare triple {18154#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} assume !(~c~0 >= 2 * ~v~0); {18154#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-27 13:10:56,593 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {18011#(not (= |__VERIFIER_assert_#in~cond| 0))} {18161#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~v~0 (* main_~d~0 main_~b~0))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} #108#return; {18154#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-27 13:10:56,594 INFO L290 TraceCheckUtils]: 78: Hoare triple {18011#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {18011#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:10:56,594 INFO L290 TraceCheckUtils]: 77: Hoare triple {18171#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {18011#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:10:56,594 INFO L290 TraceCheckUtils]: 76: Hoare triple {17835#true} ~cond := #in~cond; {18171#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 13:10:56,594 INFO L272 TraceCheckUtils]: 75: Hoare triple {18161#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~v~0 (* main_~d~0 main_~b~0))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {17835#true} is VALID [2022-04-27 13:10:56,595 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {17835#true} {18161#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~v~0 (* main_~d~0 main_~b~0))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} #106#return; {18161#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~v~0 (* main_~d~0 main_~b~0))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-27 13:10:56,595 INFO L290 TraceCheckUtils]: 73: Hoare triple {17835#true} assume true; {17835#true} is VALID [2022-04-27 13:10:56,595 INFO L290 TraceCheckUtils]: 72: Hoare triple {17835#true} assume !(0 == ~cond); {17835#true} is VALID [2022-04-27 13:10:56,595 INFO L290 TraceCheckUtils]: 71: Hoare triple {17835#true} ~cond := #in~cond; {17835#true} is VALID [2022-04-27 13:10:56,595 INFO L272 TraceCheckUtils]: 70: Hoare triple {18161#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~v~0 (* main_~d~0 main_~b~0))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~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)); {17835#true} is VALID [2022-04-27 13:10:56,596 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {18011#(not (= |__VERIFIER_assert_#in~cond| 0))} {18193#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (not (= main_~v~0 (* main_~d~0 main_~b~0))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} #104#return; {18161#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~v~0 (* main_~d~0 main_~b~0))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-27 13:10:56,596 INFO L290 TraceCheckUtils]: 68: Hoare triple {18011#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {18011#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:10:56,597 INFO L290 TraceCheckUtils]: 67: Hoare triple {18171#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {18011#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:10:56,597 INFO L290 TraceCheckUtils]: 66: Hoare triple {17835#true} ~cond := #in~cond; {18171#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 13:10:56,597 INFO L272 TraceCheckUtils]: 65: Hoare triple {18193#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (not (= main_~v~0 (* main_~d~0 main_~b~0))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~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)); {17835#true} is VALID [2022-04-27 13:10:56,598 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {18011#(not (= |__VERIFIER_assert_#in~cond| 0))} {18209#(or (not (= (+ main_~c~0 (* (- 1) main_~v~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)))) (not (= main_~v~0 (* main_~d~0 main_~b~0))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} #102#return; {18193#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (not (= main_~v~0 (* main_~d~0 main_~b~0))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-27 13:10:56,598 INFO L290 TraceCheckUtils]: 63: Hoare triple {18011#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {18011#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:10:56,599 INFO L290 TraceCheckUtils]: 62: Hoare triple {18171#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {18011#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:10:56,599 INFO L290 TraceCheckUtils]: 61: Hoare triple {17835#true} ~cond := #in~cond; {18171#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 13:10:56,599 INFO L272 TraceCheckUtils]: 60: Hoare triple {18209#(or (not (= (+ main_~c~0 (* (- 1) main_~v~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)))) (not (= main_~v~0 (* main_~d~0 main_~b~0))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~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)); {17835#true} is VALID [2022-04-27 13:10:56,600 INFO L290 TraceCheckUtils]: 59: Hoare triple {18209#(or (not (= (+ main_~c~0 (* (- 1) main_~v~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)))) (not (= main_~v~0 (* main_~d~0 main_~b~0))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} assume !false; {18209#(or (not (= (+ main_~c~0 (* (- 1) main_~v~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)))) (not (= main_~v~0 (* main_~d~0 main_~b~0))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-27 13:10:56,854 INFO L290 TraceCheckUtils]: 58: Hoare triple {18228#(or (not (= (* main_~v~0 2) (* main_~b~0 (* main_~d~0 2)))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= (+ main_~c~0 (* (- 2) main_~v~0)) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~y~0 (+ (* (- 1) (* (+ main_~k~0 (* main_~d~0 2)) main_~s~0)) main_~r~0)) main_~b~0 (* (+ main_~p~0 (* (- 1) (+ main_~k~0 (* main_~d~0 2)) main_~q~0)) main_~x~0))))} assume !!(~c~0 >= 2 * ~v~0);~d~0 := 2 * ~d~0;~v~0 := 2 * ~v~0; {18209#(or (not (= (+ main_~c~0 (* (- 1) main_~v~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)))) (not (= main_~v~0 (* main_~d~0 main_~b~0))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-27 13:10:56,855 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {17835#true} {18228#(or (not (= (* main_~v~0 2) (* main_~b~0 (* main_~d~0 2)))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= (+ main_~c~0 (* (- 2) main_~v~0)) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~y~0 (+ (* (- 1) (* (+ main_~k~0 (* main_~d~0 2)) main_~s~0)) main_~r~0)) main_~b~0 (* (+ main_~p~0 (* (- 1) (+ main_~k~0 (* main_~d~0 2)) main_~q~0)) main_~x~0))))} #108#return; {18228#(or (not (= (* main_~v~0 2) (* main_~b~0 (* main_~d~0 2)))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= (+ main_~c~0 (* (- 2) main_~v~0)) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~y~0 (+ (* (- 1) (* (+ main_~k~0 (* main_~d~0 2)) main_~s~0)) main_~r~0)) main_~b~0 (* (+ main_~p~0 (* (- 1) (+ main_~k~0 (* main_~d~0 2)) main_~q~0)) main_~x~0))))} is VALID [2022-04-27 13:10:56,855 INFO L290 TraceCheckUtils]: 56: Hoare triple {17835#true} assume true; {17835#true} is VALID [2022-04-27 13:10:56,855 INFO L290 TraceCheckUtils]: 55: Hoare triple {17835#true} assume !(0 == ~cond); {17835#true} is VALID [2022-04-27 13:10:56,855 INFO L290 TraceCheckUtils]: 54: Hoare triple {17835#true} ~cond := #in~cond; {17835#true} is VALID [2022-04-27 13:10:56,855 INFO L272 TraceCheckUtils]: 53: Hoare triple {18228#(or (not (= (* main_~v~0 2) (* main_~b~0 (* main_~d~0 2)))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= (+ main_~c~0 (* (- 2) main_~v~0)) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~y~0 (+ (* (- 1) (* (+ main_~k~0 (* main_~d~0 2)) main_~s~0)) main_~r~0)) main_~b~0 (* (+ main_~p~0 (* (- 1) (+ main_~k~0 (* main_~d~0 2)) main_~q~0)) main_~x~0))))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {17835#true} is VALID [2022-04-27 13:10:56,856 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {17835#true} {18228#(or (not (= (* main_~v~0 2) (* main_~b~0 (* main_~d~0 2)))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= (+ main_~c~0 (* (- 2) main_~v~0)) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~y~0 (+ (* (- 1) (* (+ main_~k~0 (* main_~d~0 2)) main_~s~0)) main_~r~0)) main_~b~0 (* (+ main_~p~0 (* (- 1) (+ main_~k~0 (* main_~d~0 2)) main_~q~0)) main_~x~0))))} #106#return; {18228#(or (not (= (* main_~v~0 2) (* main_~b~0 (* main_~d~0 2)))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= (+ main_~c~0 (* (- 2) main_~v~0)) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~y~0 (+ (* (- 1) (* (+ main_~k~0 (* main_~d~0 2)) main_~s~0)) main_~r~0)) main_~b~0 (* (+ main_~p~0 (* (- 1) (+ main_~k~0 (* main_~d~0 2)) main_~q~0)) main_~x~0))))} is VALID [2022-04-27 13:10:56,856 INFO L290 TraceCheckUtils]: 51: Hoare triple {17835#true} assume true; {17835#true} is VALID [2022-04-27 13:10:56,856 INFO L290 TraceCheckUtils]: 50: Hoare triple {17835#true} assume !(0 == ~cond); {17835#true} is VALID [2022-04-27 13:10:56,856 INFO L290 TraceCheckUtils]: 49: Hoare triple {17835#true} ~cond := #in~cond; {17835#true} is VALID [2022-04-27 13:10:56,856 INFO L272 TraceCheckUtils]: 48: Hoare triple {18228#(or (not (= (* main_~v~0 2) (* main_~b~0 (* main_~d~0 2)))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= (+ main_~c~0 (* (- 2) main_~v~0)) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~y~0 (+ (* (- 1) (* (+ main_~k~0 (* main_~d~0 2)) main_~s~0)) main_~r~0)) main_~b~0 (* (+ main_~p~0 (* (- 1) (+ main_~k~0 (* main_~d~0 2)) main_~q~0)) main_~x~0))))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {17835#true} is VALID [2022-04-27 13:10:56,857 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {17835#true} {18228#(or (not (= (* main_~v~0 2) (* main_~b~0 (* main_~d~0 2)))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= (+ main_~c~0 (* (- 2) main_~v~0)) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~y~0 (+ (* (- 1) (* (+ main_~k~0 (* main_~d~0 2)) main_~s~0)) main_~r~0)) main_~b~0 (* (+ main_~p~0 (* (- 1) (+ main_~k~0 (* main_~d~0 2)) main_~q~0)) main_~x~0))))} #104#return; {18228#(or (not (= (* main_~v~0 2) (* main_~b~0 (* main_~d~0 2)))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= (+ main_~c~0 (* (- 2) main_~v~0)) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~y~0 (+ (* (- 1) (* (+ main_~k~0 (* main_~d~0 2)) main_~s~0)) main_~r~0)) main_~b~0 (* (+ main_~p~0 (* (- 1) (+ main_~k~0 (* main_~d~0 2)) main_~q~0)) main_~x~0))))} is VALID [2022-04-27 13:10:56,857 INFO L290 TraceCheckUtils]: 46: Hoare triple {17835#true} assume true; {17835#true} is VALID [2022-04-27 13:10:56,857 INFO L290 TraceCheckUtils]: 45: Hoare triple {17835#true} assume !(0 == ~cond); {17835#true} is VALID [2022-04-27 13:10:56,857 INFO L290 TraceCheckUtils]: 44: Hoare triple {17835#true} ~cond := #in~cond; {17835#true} is VALID [2022-04-27 13:10:56,857 INFO L272 TraceCheckUtils]: 43: Hoare triple {18228#(or (not (= (* main_~v~0 2) (* main_~b~0 (* main_~d~0 2)))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= (+ main_~c~0 (* (- 2) main_~v~0)) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~y~0 (+ (* (- 1) (* (+ main_~k~0 (* main_~d~0 2)) main_~s~0)) main_~r~0)) main_~b~0 (* (+ main_~p~0 (* (- 1) (+ main_~k~0 (* main_~d~0 2)) main_~q~0)) main_~x~0))))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {17835#true} is VALID [2022-04-27 13:10:56,858 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {17835#true} {18228#(or (not (= (* main_~v~0 2) (* main_~b~0 (* main_~d~0 2)))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= (+ main_~c~0 (* (- 2) main_~v~0)) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~y~0 (+ (* (- 1) (* (+ main_~k~0 (* main_~d~0 2)) main_~s~0)) main_~r~0)) main_~b~0 (* (+ main_~p~0 (* (- 1) (+ main_~k~0 (* main_~d~0 2)) main_~q~0)) main_~x~0))))} #102#return; {18228#(or (not (= (* main_~v~0 2) (* main_~b~0 (* main_~d~0 2)))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= (+ main_~c~0 (* (- 2) main_~v~0)) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~y~0 (+ (* (- 1) (* (+ main_~k~0 (* main_~d~0 2)) main_~s~0)) main_~r~0)) main_~b~0 (* (+ main_~p~0 (* (- 1) (+ main_~k~0 (* main_~d~0 2)) main_~q~0)) main_~x~0))))} is VALID [2022-04-27 13:10:56,858 INFO L290 TraceCheckUtils]: 41: Hoare triple {17835#true} assume true; {17835#true} is VALID [2022-04-27 13:10:56,858 INFO L290 TraceCheckUtils]: 40: Hoare triple {17835#true} assume !(0 == ~cond); {17835#true} is VALID [2022-04-27 13:10:56,858 INFO L290 TraceCheckUtils]: 39: Hoare triple {17835#true} ~cond := #in~cond; {17835#true} is VALID [2022-04-27 13:10:56,858 INFO L272 TraceCheckUtils]: 38: Hoare triple {18228#(or (not (= (* main_~v~0 2) (* main_~b~0 (* main_~d~0 2)))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= (+ main_~c~0 (* (- 2) main_~v~0)) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~y~0 (+ (* (- 1) (* (+ main_~k~0 (* main_~d~0 2)) main_~s~0)) main_~r~0)) main_~b~0 (* (+ main_~p~0 (* (- 1) (+ main_~k~0 (* main_~d~0 2)) main_~q~0)) main_~x~0))))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {17835#true} is VALID [2022-04-27 13:10:56,858 INFO L290 TraceCheckUtils]: 37: Hoare triple {18228#(or (not (= (* main_~v~0 2) (* main_~b~0 (* main_~d~0 2)))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= (+ main_~c~0 (* (- 2) main_~v~0)) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~y~0 (+ (* (- 1) (* (+ main_~k~0 (* main_~d~0 2)) main_~s~0)) main_~r~0)) main_~b~0 (* (+ main_~p~0 (* (- 1) (+ main_~k~0 (* main_~d~0 2)) main_~q~0)) main_~x~0))))} assume !false; {18228#(or (not (= (* main_~v~0 2) (* main_~b~0 (* main_~d~0 2)))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= (+ main_~c~0 (* (- 2) main_~v~0)) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~y~0 (+ (* (- 1) (* (+ main_~k~0 (* main_~d~0 2)) main_~s~0)) main_~r~0)) main_~b~0 (* (+ main_~p~0 (* (- 1) (+ main_~k~0 (* main_~d~0 2)) main_~q~0)) main_~x~0))))} is VALID [2022-04-27 13:10:56,859 INFO L290 TraceCheckUtils]: 36: Hoare triple {18295#(or (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)))) (not (= (+ (* (- 2) main_~b~0) main_~c~0) 0)) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ main_~b~0 (* main_~y~0 (+ (* (* (+ main_~k~0 2) main_~s~0) (- 1)) main_~r~0)) (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 2) main_~q~0))))))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {18228#(or (not (= (* main_~v~0 2) (* main_~b~0 (* main_~d~0 2)))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= (+ main_~c~0 (* (- 2) main_~v~0)) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~y~0 (+ (* (- 1) (* (+ main_~k~0 (* main_~d~0 2)) main_~s~0)) main_~r~0)) main_~b~0 (* (+ main_~p~0 (* (- 1) (+ main_~k~0 (* main_~d~0 2)) main_~q~0)) main_~x~0))))} is VALID [2022-04-27 13:10:56,860 INFO L290 TraceCheckUtils]: 35: Hoare triple {18295#(or (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)))) (not (= (+ (* (- 2) main_~b~0) main_~c~0) 0)) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ main_~b~0 (* main_~y~0 (+ (* (* (+ main_~k~0 2) main_~s~0) (- 1)) main_~r~0)) (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 2) main_~q~0))))))} assume !false; {18295#(or (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)))) (not (= (+ (* (- 2) main_~b~0) main_~c~0) 0)) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ main_~b~0 (* main_~y~0 (+ (* (* (+ main_~k~0 2) main_~s~0) (- 1)) main_~r~0)) (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 2) main_~q~0))))))} is VALID [2022-04-27 13:10:56,861 INFO L290 TraceCheckUtils]: 34: Hoare triple {17835#true} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {18295#(or (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)))) (not (= (+ (* (- 2) main_~b~0) main_~c~0) 0)) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ main_~b~0 (* main_~y~0 (+ (* (* (+ main_~k~0 2) main_~s~0) (- 1)) main_~r~0)) (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 2) main_~q~0))))))} is VALID [2022-04-27 13:10:56,861 INFO L290 TraceCheckUtils]: 33: Hoare triple {17835#true} assume !false; {17835#true} is VALID [2022-04-27 13:10:56,861 INFO L290 TraceCheckUtils]: 32: Hoare triple {17835#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; {17835#true} is VALID [2022-04-27 13:10:56,861 INFO L290 TraceCheckUtils]: 31: Hoare triple {17835#true} assume !(~c~0 >= ~b~0); {17835#true} is VALID [2022-04-27 13:10:56,861 INFO L290 TraceCheckUtils]: 30: Hoare triple {17835#true} assume !false; {17835#true} is VALID [2022-04-27 13:10:56,861 INFO L290 TraceCheckUtils]: 29: Hoare triple {17835#true} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {17835#true} is VALID [2022-04-27 13:10:56,861 INFO L290 TraceCheckUtils]: 28: Hoare triple {17835#true} assume !false; {17835#true} is VALID [2022-04-27 13:10:56,861 INFO L290 TraceCheckUtils]: 27: Hoare triple {17835#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {17835#true} is VALID [2022-04-27 13:10:56,861 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {17835#true} {17835#true} #100#return; {17835#true} is VALID [2022-04-27 13:10:56,861 INFO L290 TraceCheckUtils]: 25: Hoare triple {17835#true} assume true; {17835#true} is VALID [2022-04-27 13:10:56,862 INFO L290 TraceCheckUtils]: 24: Hoare triple {17835#true} assume !(0 == ~cond); {17835#true} is VALID [2022-04-27 13:10:56,862 INFO L290 TraceCheckUtils]: 23: Hoare triple {17835#true} ~cond := #in~cond; {17835#true} is VALID [2022-04-27 13:10:56,862 INFO L272 TraceCheckUtils]: 22: Hoare triple {17835#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {17835#true} is VALID [2022-04-27 13:10:56,862 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {17835#true} {17835#true} #98#return; {17835#true} is VALID [2022-04-27 13:10:56,862 INFO L290 TraceCheckUtils]: 20: Hoare triple {17835#true} assume true; {17835#true} is VALID [2022-04-27 13:10:56,862 INFO L290 TraceCheckUtils]: 19: Hoare triple {17835#true} assume !(0 == ~cond); {17835#true} is VALID [2022-04-27 13:10:56,862 INFO L290 TraceCheckUtils]: 18: Hoare triple {17835#true} ~cond := #in~cond; {17835#true} is VALID [2022-04-27 13:10:56,862 INFO L272 TraceCheckUtils]: 17: Hoare triple {17835#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {17835#true} is VALID [2022-04-27 13:10:56,862 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {17835#true} {17835#true} #96#return; {17835#true} is VALID [2022-04-27 13:10:56,862 INFO L290 TraceCheckUtils]: 15: Hoare triple {17835#true} assume true; {17835#true} is VALID [2022-04-27 13:10:56,862 INFO L290 TraceCheckUtils]: 14: Hoare triple {17835#true} assume !(0 == ~cond); {17835#true} is VALID [2022-04-27 13:10:56,862 INFO L290 TraceCheckUtils]: 13: Hoare triple {17835#true} ~cond := #in~cond; {17835#true} is VALID [2022-04-27 13:10:56,862 INFO L272 TraceCheckUtils]: 12: Hoare triple {17835#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 10 then 1 else 0)); {17835#true} is VALID [2022-04-27 13:10:56,862 INFO L290 TraceCheckUtils]: 11: Hoare triple {17835#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {17835#true} is VALID [2022-04-27 13:10:56,862 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {17835#true} {17835#true} #94#return; {17835#true} is VALID [2022-04-27 13:10:56,862 INFO L290 TraceCheckUtils]: 9: Hoare triple {17835#true} assume true; {17835#true} is VALID [2022-04-27 13:10:56,862 INFO L290 TraceCheckUtils]: 8: Hoare triple {17835#true} assume !(0 == ~cond); {17835#true} is VALID [2022-04-27 13:10:56,862 INFO L290 TraceCheckUtils]: 7: Hoare triple {17835#true} ~cond := #in~cond; {17835#true} is VALID [2022-04-27 13:10:56,862 INFO L272 TraceCheckUtils]: 6: Hoare triple {17835#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 10 then 1 else 0)); {17835#true} is VALID [2022-04-27 13:10:56,862 INFO L290 TraceCheckUtils]: 5: Hoare triple {17835#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;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {17835#true} is VALID [2022-04-27 13:10:56,862 INFO L272 TraceCheckUtils]: 4: Hoare triple {17835#true} call #t~ret6 := main(); {17835#true} is VALID [2022-04-27 13:10:56,862 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17835#true} {17835#true} #112#return; {17835#true} is VALID [2022-04-27 13:10:56,862 INFO L290 TraceCheckUtils]: 2: Hoare triple {17835#true} assume true; {17835#true} is VALID [2022-04-27 13:10:56,863 INFO L290 TraceCheckUtils]: 1: Hoare triple {17835#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); {17835#true} is VALID [2022-04-27 13:10:56,863 INFO L272 TraceCheckUtils]: 0: Hoare triple {17835#true} call ULTIMATE.init(); {17835#true} is VALID [2022-04-27 13:10:56,863 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 61 proven. 17 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2022-04-27 13:10:56,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:10:56,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647194855] [2022-04-27 13:10:56,863 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:10:56,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1305537060] [2022-04-27 13:10:56,863 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1305537060] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 13:10:56,863 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 13:10:56,863 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 26 [2022-04-27 13:10:56,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377719584] [2022-04-27 13:10:56,864 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 13:10:56,864 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 22 states have (on average 2.590909090909091) internal successors, (57), 23 states have internal predecessors, (57), 10 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (21), 7 states have call predecessors, (21), 8 states have call successors, (21) Word has length 91 [2022-04-27 13:10:56,865 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:10:56,865 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 26 states, 22 states have (on average 2.590909090909091) internal successors, (57), 23 states have internal predecessors, (57), 10 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (21), 7 states have call predecessors, (21), 8 states have call successors, (21) [2022-04-27 13:10:57,525 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:10:57,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-27 13:10:57,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:10:57,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-27 13:10:57,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=537, Unknown=0, NotChecked=0, Total=650 [2022-04-27 13:10:57,526 INFO L87 Difference]: Start difference. First operand 359 states and 484 transitions. Second operand has 26 states, 22 states have (on average 2.590909090909091) internal successors, (57), 23 states have internal predecessors, (57), 10 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (21), 7 states have call predecessors, (21), 8 states have call successors, (21) [2022-04-27 13:11:10,466 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 13:11:14,393 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-27 13:11:21,280 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-27 13:11:32,769 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 13:11:39,505 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 13:11:44,921 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 13:11:52,967 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-27 13:11:55,076 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-27 13:11:57,089 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-27 13:12:00,189 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-27 13:12:02,740 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-27 13:12:12,035 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-27 13:12:14,049 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-27 13:12:16,700 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-27 13:12:18,714 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-27 13:12:22,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:12:22,550 INFO L93 Difference]: Finished difference Result 590 states and 839 transitions. [2022-04-27 13:12:22,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-04-27 13:12:22,550 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 22 states have (on average 2.590909090909091) internal successors, (57), 23 states have internal predecessors, (57), 10 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (21), 7 states have call predecessors, (21), 8 states have call successors, (21) Word has length 91 [2022-04-27 13:12:22,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:12:22,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 22 states have (on average 2.590909090909091) internal successors, (57), 23 states have internal predecessors, (57), 10 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (21), 7 states have call predecessors, (21), 8 states have call successors, (21) [2022-04-27 13:12:22,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 307 transitions. [2022-04-27 13:12:22,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 22 states have (on average 2.590909090909091) internal successors, (57), 23 states have internal predecessors, (57), 10 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (21), 7 states have call predecessors, (21), 8 states have call successors, (21) [2022-04-27 13:12:22,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 307 transitions. [2022-04-27 13:12:22,574 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 50 states and 307 transitions. [2022-04-27 13:12:43,823 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 307 edges. 305 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-27 13:12:43,839 INFO L225 Difference]: With dead ends: 590 [2022-04-27 13:12:43,839 INFO L226 Difference]: Without dead ends: 586 [2022-04-27 13:12:43,840 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 165 SyntacticMatches, 3 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 981 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=727, Invalid=3305, Unknown=0, NotChecked=0, Total=4032 [2022-04-27 13:12:43,840 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 177 mSDsluCounter, 442 mSDsCounter, 0 mSdLazyCounter, 2054 mSolverCounterSat, 454 mSolverCounterUnsat, 11 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 47.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 2519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 454 IncrementalHoareTripleChecker+Valid, 2054 IncrementalHoareTripleChecker+Invalid, 11 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 47.4s IncrementalHoareTripleChecker+Time [2022-04-27 13:12:43,840 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 503 Invalid, 2519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [454 Valid, 2054 Invalid, 11 Unknown, 0 Unchecked, 47.4s Time] [2022-04-27 13:12:43,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2022-04-27 13:12:45,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 553. [2022-04-27 13:12:45,638 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:12:45,667 INFO L82 GeneralOperation]: Start isEquivalent. First operand 586 states. Second operand has 553 states, 318 states have (on average 1.2075471698113207) internal successors, (384), 322 states have internal predecessors, (384), 205 states have call successors, (205), 30 states have call predecessors, (205), 29 states have return successors, (203), 200 states have call predecessors, (203), 203 states have call successors, (203) [2022-04-27 13:12:45,668 INFO L74 IsIncluded]: Start isIncluded. First operand 586 states. Second operand has 553 states, 318 states have (on average 1.2075471698113207) internal successors, (384), 322 states have internal predecessors, (384), 205 states have call successors, (205), 30 states have call predecessors, (205), 29 states have return successors, (203), 200 states have call predecessors, (203), 203 states have call successors, (203) [2022-04-27 13:12:45,669 INFO L87 Difference]: Start difference. First operand 586 states. Second operand has 553 states, 318 states have (on average 1.2075471698113207) internal successors, (384), 322 states have internal predecessors, (384), 205 states have call successors, (205), 30 states have call predecessors, (205), 29 states have return successors, (203), 200 states have call predecessors, (203), 203 states have call successors, (203) [2022-04-27 13:12:45,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:12:45,684 INFO L93 Difference]: Finished difference Result 586 states and 830 transitions. [2022-04-27 13:12:45,684 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 830 transitions. [2022-04-27 13:12:45,686 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:12:45,686 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:12:45,687 INFO L74 IsIncluded]: Start isIncluded. First operand has 553 states, 318 states have (on average 1.2075471698113207) internal successors, (384), 322 states have internal predecessors, (384), 205 states have call successors, (205), 30 states have call predecessors, (205), 29 states have return successors, (203), 200 states have call predecessors, (203), 203 states have call successors, (203) Second operand 586 states. [2022-04-27 13:12:45,687 INFO L87 Difference]: Start difference. First operand has 553 states, 318 states have (on average 1.2075471698113207) internal successors, (384), 322 states have internal predecessors, (384), 205 states have call successors, (205), 30 states have call predecessors, (205), 29 states have return successors, (203), 200 states have call predecessors, (203), 203 states have call successors, (203) Second operand 586 states. [2022-04-27 13:12:45,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:12:45,703 INFO L93 Difference]: Finished difference Result 586 states and 830 transitions. [2022-04-27 13:12:45,703 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 830 transitions. [2022-04-27 13:12:45,705 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:12:45,705 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:12:45,705 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:12:45,705 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:12:45,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 553 states, 318 states have (on average 1.2075471698113207) internal successors, (384), 322 states have internal predecessors, (384), 205 states have call successors, (205), 30 states have call predecessors, (205), 29 states have return successors, (203), 200 states have call predecessors, (203), 203 states have call successors, (203) [2022-04-27 13:12:45,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 792 transitions. [2022-04-27 13:12:45,731 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 792 transitions. Word has length 91 [2022-04-27 13:12:45,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:12:45,731 INFO L495 AbstractCegarLoop]: Abstraction has 553 states and 792 transitions. [2022-04-27 13:12:45,731 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 22 states have (on average 2.590909090909091) internal successors, (57), 23 states have internal predecessors, (57), 10 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (21), 7 states have call predecessors, (21), 8 states have call successors, (21) [2022-04-27 13:12:45,731 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 792 transitions. [2022-04-27 13:12:45,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-04-27 13:12:45,732 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:12:45,732 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:12:45,768 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-27 13:12:45,970 WARN L477 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-27 13:12:45,970 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:12:45,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:12:45,971 INFO L85 PathProgramCache]: Analyzing trace with hash -801999833, now seen corresponding path program 1 times [2022-04-27 13:12:45,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:12:45,971 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90356109] [2022-04-27 13:12:45,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:12:45,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:12:45,992 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:12:45,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2015251529] [2022-04-27 13:12:45,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:12:45,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:12:45,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:12:45,995 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-27 13:12:45,995 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-27 13:12:46,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:12:46,042 INFO L263 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-27 13:12:46,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:12:46,056 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:12:46,534 INFO L272 TraceCheckUtils]: 0: Hoare triple {21486#true} call ULTIMATE.init(); {21486#true} is VALID [2022-04-27 13:12:46,534 INFO L290 TraceCheckUtils]: 1: Hoare triple {21486#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); {21486#true} is VALID [2022-04-27 13:12:46,534 INFO L290 TraceCheckUtils]: 2: Hoare triple {21486#true} assume true; {21486#true} is VALID [2022-04-27 13:12:46,534 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21486#true} {21486#true} #112#return; {21486#true} is VALID [2022-04-27 13:12:46,534 INFO L272 TraceCheckUtils]: 4: Hoare triple {21486#true} call #t~ret6 := main(); {21486#true} is VALID [2022-04-27 13:12:46,534 INFO L290 TraceCheckUtils]: 5: Hoare triple {21486#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;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {21486#true} is VALID [2022-04-27 13:12:46,534 INFO L272 TraceCheckUtils]: 6: Hoare triple {21486#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 10 then 1 else 0)); {21486#true} is VALID [2022-04-27 13:12:46,534 INFO L290 TraceCheckUtils]: 7: Hoare triple {21486#true} ~cond := #in~cond; {21486#true} is VALID [2022-04-27 13:12:46,534 INFO L290 TraceCheckUtils]: 8: Hoare triple {21486#true} assume !(0 == ~cond); {21486#true} is VALID [2022-04-27 13:12:46,534 INFO L290 TraceCheckUtils]: 9: Hoare triple {21486#true} assume true; {21486#true} is VALID [2022-04-27 13:12:46,535 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {21486#true} {21486#true} #94#return; {21486#true} is VALID [2022-04-27 13:12:46,535 INFO L290 TraceCheckUtils]: 11: Hoare triple {21486#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {21486#true} is VALID [2022-04-27 13:12:46,535 INFO L272 TraceCheckUtils]: 12: Hoare triple {21486#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 10 then 1 else 0)); {21486#true} is VALID [2022-04-27 13:12:46,535 INFO L290 TraceCheckUtils]: 13: Hoare triple {21486#true} ~cond := #in~cond; {21486#true} is VALID [2022-04-27 13:12:46,535 INFO L290 TraceCheckUtils]: 14: Hoare triple {21486#true} assume !(0 == ~cond); {21486#true} is VALID [2022-04-27 13:12:46,535 INFO L290 TraceCheckUtils]: 15: Hoare triple {21486#true} assume true; {21486#true} is VALID [2022-04-27 13:12:46,535 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {21486#true} {21486#true} #96#return; {21486#true} is VALID [2022-04-27 13:12:46,535 INFO L272 TraceCheckUtils]: 17: Hoare triple {21486#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {21486#true} is VALID [2022-04-27 13:12:46,535 INFO L290 TraceCheckUtils]: 18: Hoare triple {21486#true} ~cond := #in~cond; {21486#true} is VALID [2022-04-27 13:12:46,535 INFO L290 TraceCheckUtils]: 19: Hoare triple {21486#true} assume !(0 == ~cond); {21486#true} is VALID [2022-04-27 13:12:46,535 INFO L290 TraceCheckUtils]: 20: Hoare triple {21486#true} assume true; {21486#true} is VALID [2022-04-27 13:12:46,535 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {21486#true} {21486#true} #98#return; {21486#true} is VALID [2022-04-27 13:12:46,535 INFO L272 TraceCheckUtils]: 22: Hoare triple {21486#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {21486#true} is VALID [2022-04-27 13:12:46,535 INFO L290 TraceCheckUtils]: 23: Hoare triple {21486#true} ~cond := #in~cond; {21486#true} is VALID [2022-04-27 13:12:46,535 INFO L290 TraceCheckUtils]: 24: Hoare triple {21486#true} assume !(0 == ~cond); {21486#true} is VALID [2022-04-27 13:12:46,535 INFO L290 TraceCheckUtils]: 25: Hoare triple {21486#true} assume true; {21486#true} is VALID [2022-04-27 13:12:46,535 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {21486#true} {21486#true} #100#return; {21486#true} is VALID [2022-04-27 13:12:46,535 INFO L290 TraceCheckUtils]: 27: Hoare triple {21486#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {21486#true} is VALID [2022-04-27 13:12:46,535 INFO L290 TraceCheckUtils]: 28: Hoare triple {21486#true} assume !false; {21486#true} is VALID [2022-04-27 13:12:46,536 INFO L290 TraceCheckUtils]: 29: Hoare triple {21486#true} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {21578#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} is VALID [2022-04-27 13:12:46,536 INFO L290 TraceCheckUtils]: 30: Hoare triple {21578#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} assume !false; {21578#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} is VALID [2022-04-27 13:12:46,536 INFO L290 TraceCheckUtils]: 31: Hoare triple {21578#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {21585#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~d~0 1))} is VALID [2022-04-27 13:12:46,536 INFO L290 TraceCheckUtils]: 32: Hoare triple {21585#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~d~0 1))} assume !false; {21585#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~d~0 1))} is VALID [2022-04-27 13:12:46,537 INFO L272 TraceCheckUtils]: 33: Hoare triple {21585#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~d~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {21486#true} is VALID [2022-04-27 13:12:46,537 INFO L290 TraceCheckUtils]: 34: Hoare triple {21486#true} ~cond := #in~cond; {21486#true} is VALID [2022-04-27 13:12:46,537 INFO L290 TraceCheckUtils]: 35: Hoare triple {21486#true} assume !(0 == ~cond); {21486#true} is VALID [2022-04-27 13:12:46,537 INFO L290 TraceCheckUtils]: 36: Hoare triple {21486#true} assume true; {21486#true} is VALID [2022-04-27 13:12:46,537 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {21486#true} {21585#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~d~0 1))} #102#return; {21585#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~d~0 1))} is VALID [2022-04-27 13:12:46,537 INFO L272 TraceCheckUtils]: 38: Hoare triple {21585#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~d~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {21486#true} is VALID [2022-04-27 13:12:46,537 INFO L290 TraceCheckUtils]: 39: Hoare triple {21486#true} ~cond := #in~cond; {21486#true} is VALID [2022-04-27 13:12:46,537 INFO L290 TraceCheckUtils]: 40: Hoare triple {21486#true} assume !(0 == ~cond); {21486#true} is VALID [2022-04-27 13:12:46,537 INFO L290 TraceCheckUtils]: 41: Hoare triple {21486#true} assume true; {21486#true} is VALID [2022-04-27 13:12:46,538 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {21486#true} {21585#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~d~0 1))} #104#return; {21585#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~d~0 1))} is VALID [2022-04-27 13:12:46,538 INFO L272 TraceCheckUtils]: 43: Hoare triple {21585#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~d~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {21486#true} is VALID [2022-04-27 13:12:46,538 INFO L290 TraceCheckUtils]: 44: Hoare triple {21486#true} ~cond := #in~cond; {21486#true} is VALID [2022-04-27 13:12:46,538 INFO L290 TraceCheckUtils]: 45: Hoare triple {21486#true} assume !(0 == ~cond); {21486#true} is VALID [2022-04-27 13:12:46,538 INFO L290 TraceCheckUtils]: 46: Hoare triple {21486#true} assume true; {21486#true} is VALID [2022-04-27 13:12:46,538 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {21486#true} {21585#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~d~0 1))} #106#return; {21585#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~d~0 1))} is VALID [2022-04-27 13:12:46,538 INFO L272 TraceCheckUtils]: 48: Hoare triple {21585#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~d~0 1))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {21486#true} is VALID [2022-04-27 13:12:46,538 INFO L290 TraceCheckUtils]: 49: Hoare triple {21486#true} ~cond := #in~cond; {21486#true} is VALID [2022-04-27 13:12:46,538 INFO L290 TraceCheckUtils]: 50: Hoare triple {21486#true} assume !(0 == ~cond); {21486#true} is VALID [2022-04-27 13:12:46,538 INFO L290 TraceCheckUtils]: 51: Hoare triple {21486#true} assume true; {21486#true} is VALID [2022-04-27 13:12:46,539 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {21486#true} {21585#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~d~0 1))} #108#return; {21585#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~d~0 1))} is VALID [2022-04-27 13:12:46,539 INFO L290 TraceCheckUtils]: 53: Hoare triple {21585#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~d~0 1))} assume !!(~c~0 >= 2 * ~v~0);~d~0 := 2 * ~d~0;~v~0 := 2 * ~v~0; {21652#(and (= main_~c~0 main_~a~0) (= main_~v~0 (* main_~b~0 2)) (= main_~k~0 0) (= main_~d~0 2))} is VALID [2022-04-27 13:12:46,540 INFO L290 TraceCheckUtils]: 54: Hoare triple {21652#(and (= main_~c~0 main_~a~0) (= main_~v~0 (* main_~b~0 2)) (= main_~k~0 0) (= main_~d~0 2))} assume !false; {21652#(and (= main_~c~0 main_~a~0) (= main_~v~0 (* main_~b~0 2)) (= main_~k~0 0) (= main_~d~0 2))} is VALID [2022-04-27 13:12:46,540 INFO L272 TraceCheckUtils]: 55: Hoare triple {21652#(and (= main_~c~0 main_~a~0) (= main_~v~0 (* main_~b~0 2)) (= main_~k~0 0) (= main_~d~0 2))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {21486#true} is VALID [2022-04-27 13:12:46,540 INFO L290 TraceCheckUtils]: 56: Hoare triple {21486#true} ~cond := #in~cond; {21486#true} is VALID [2022-04-27 13:12:46,540 INFO L290 TraceCheckUtils]: 57: Hoare triple {21486#true} assume !(0 == ~cond); {21486#true} is VALID [2022-04-27 13:12:46,540 INFO L290 TraceCheckUtils]: 58: Hoare triple {21486#true} assume true; {21486#true} is VALID [2022-04-27 13:12:46,540 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {21486#true} {21652#(and (= main_~c~0 main_~a~0) (= main_~v~0 (* main_~b~0 2)) (= main_~k~0 0) (= main_~d~0 2))} #102#return; {21652#(and (= main_~c~0 main_~a~0) (= main_~v~0 (* main_~b~0 2)) (= main_~k~0 0) (= main_~d~0 2))} is VALID [2022-04-27 13:12:46,540 INFO L272 TraceCheckUtils]: 60: Hoare triple {21652#(and (= main_~c~0 main_~a~0) (= main_~v~0 (* main_~b~0 2)) (= main_~k~0 0) (= main_~d~0 2))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {21486#true} is VALID [2022-04-27 13:12:46,540 INFO L290 TraceCheckUtils]: 61: Hoare triple {21486#true} ~cond := #in~cond; {21486#true} is VALID [2022-04-27 13:12:46,540 INFO L290 TraceCheckUtils]: 62: Hoare triple {21486#true} assume !(0 == ~cond); {21486#true} is VALID [2022-04-27 13:12:46,541 INFO L290 TraceCheckUtils]: 63: Hoare triple {21486#true} assume true; {21486#true} is VALID [2022-04-27 13:12:46,541 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {21486#true} {21652#(and (= main_~c~0 main_~a~0) (= main_~v~0 (* main_~b~0 2)) (= main_~k~0 0) (= main_~d~0 2))} #104#return; {21652#(and (= main_~c~0 main_~a~0) (= main_~v~0 (* main_~b~0 2)) (= main_~k~0 0) (= main_~d~0 2))} is VALID [2022-04-27 13:12:46,541 INFO L272 TraceCheckUtils]: 65: Hoare triple {21652#(and (= main_~c~0 main_~a~0) (= main_~v~0 (* main_~b~0 2)) (= main_~k~0 0) (= main_~d~0 2))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {21486#true} is VALID [2022-04-27 13:12:46,541 INFO L290 TraceCheckUtils]: 66: Hoare triple {21486#true} ~cond := #in~cond; {21486#true} is VALID [2022-04-27 13:12:46,541 INFO L290 TraceCheckUtils]: 67: Hoare triple {21486#true} assume !(0 == ~cond); {21486#true} is VALID [2022-04-27 13:12:46,541 INFO L290 TraceCheckUtils]: 68: Hoare triple {21486#true} assume true; {21486#true} is VALID [2022-04-27 13:12:46,541 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {21486#true} {21652#(and (= main_~c~0 main_~a~0) (= main_~v~0 (* main_~b~0 2)) (= main_~k~0 0) (= main_~d~0 2))} #106#return; {21652#(and (= main_~c~0 main_~a~0) (= main_~v~0 (* main_~b~0 2)) (= main_~k~0 0) (= main_~d~0 2))} is VALID [2022-04-27 13:12:46,541 INFO L272 TraceCheckUtils]: 70: Hoare triple {21652#(and (= main_~c~0 main_~a~0) (= main_~v~0 (* main_~b~0 2)) (= main_~k~0 0) (= main_~d~0 2))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {21486#true} is VALID [2022-04-27 13:12:46,542 INFO L290 TraceCheckUtils]: 71: Hoare triple {21486#true} ~cond := #in~cond; {21486#true} is VALID [2022-04-27 13:12:46,542 INFO L290 TraceCheckUtils]: 72: Hoare triple {21486#true} assume !(0 == ~cond); {21486#true} is VALID [2022-04-27 13:12:46,542 INFO L290 TraceCheckUtils]: 73: Hoare triple {21486#true} assume true; {21486#true} is VALID [2022-04-27 13:12:46,542 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {21486#true} {21652#(and (= main_~c~0 main_~a~0) (= main_~v~0 (* main_~b~0 2)) (= main_~k~0 0) (= main_~d~0 2))} #108#return; {21652#(and (= main_~c~0 main_~a~0) (= main_~v~0 (* main_~b~0 2)) (= main_~k~0 0) (= main_~d~0 2))} is VALID [2022-04-27 13:12:46,542 INFO L290 TraceCheckUtils]: 75: Hoare triple {21652#(and (= main_~c~0 main_~a~0) (= main_~v~0 (* main_~b~0 2)) (= main_~k~0 0) (= main_~d~0 2))} assume !(~c~0 >= 2 * ~v~0); {21719#(and (= main_~c~0 main_~a~0) (= main_~v~0 (* main_~b~0 2)) (= main_~k~0 0) (= main_~d~0 2) (not (<= (* main_~v~0 2) main_~c~0)))} is VALID [2022-04-27 13:12:46,543 INFO L290 TraceCheckUtils]: 76: Hoare triple {21719#(and (= main_~c~0 main_~a~0) (= main_~v~0 (* main_~b~0 2)) (= main_~k~0 0) (= main_~d~0 2) (not (<= (* main_~v~0 2) main_~c~0)))} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {21723#(and (= (+ main_~c~0 (* main_~b~0 2)) main_~a~0) (not (<= (* main_~b~0 2) main_~c~0)) (= main_~k~0 2))} is VALID [2022-04-27 13:12:46,543 INFO L290 TraceCheckUtils]: 77: Hoare triple {21723#(and (= (+ main_~c~0 (* main_~b~0 2)) main_~a~0) (not (<= (* main_~b~0 2) main_~c~0)) (= main_~k~0 2))} assume !false; {21723#(and (= (+ main_~c~0 (* main_~b~0 2)) main_~a~0) (not (<= (* main_~b~0 2) main_~c~0)) (= main_~k~0 2))} is VALID [2022-04-27 13:12:46,544 INFO L290 TraceCheckUtils]: 78: Hoare triple {21723#(and (= (+ main_~c~0 (* main_~b~0 2)) main_~a~0) (not (<= (* main_~b~0 2) main_~c~0)) (= main_~k~0 2))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {21730#(and (<= main_~b~0 main_~c~0) (= (+ main_~c~0 (* main_~b~0 2)) main_~a~0) (not (<= (* main_~b~0 2) main_~c~0)) (= main_~k~0 2))} is VALID [2022-04-27 13:12:46,544 INFO L290 TraceCheckUtils]: 79: Hoare triple {21730#(and (<= main_~b~0 main_~c~0) (= (+ main_~c~0 (* main_~b~0 2)) main_~a~0) (not (<= (* main_~b~0 2) main_~c~0)) (= main_~k~0 2))} assume !false; {21730#(and (<= main_~b~0 main_~c~0) (= (+ main_~c~0 (* main_~b~0 2)) main_~a~0) (not (<= (* main_~b~0 2) main_~c~0)) (= main_~k~0 2))} is VALID [2022-04-27 13:12:46,544 INFO L272 TraceCheckUtils]: 80: Hoare triple {21730#(and (<= main_~b~0 main_~c~0) (= (+ main_~c~0 (* main_~b~0 2)) main_~a~0) (not (<= (* main_~b~0 2) main_~c~0)) (= main_~k~0 2))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {21486#true} is VALID [2022-04-27 13:12:46,544 INFO L290 TraceCheckUtils]: 81: Hoare triple {21486#true} ~cond := #in~cond; {21486#true} is VALID [2022-04-27 13:12:46,544 INFO L290 TraceCheckUtils]: 82: Hoare triple {21486#true} assume !(0 == ~cond); {21486#true} is VALID [2022-04-27 13:12:46,544 INFO L290 TraceCheckUtils]: 83: Hoare triple {21486#true} assume true; {21486#true} is VALID [2022-04-27 13:12:46,545 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {21486#true} {21730#(and (<= main_~b~0 main_~c~0) (= (+ main_~c~0 (* main_~b~0 2)) main_~a~0) (not (<= (* main_~b~0 2) main_~c~0)) (= main_~k~0 2))} #102#return; {21730#(and (<= main_~b~0 main_~c~0) (= (+ main_~c~0 (* main_~b~0 2)) main_~a~0) (not (<= (* main_~b~0 2) main_~c~0)) (= main_~k~0 2))} is VALID [2022-04-27 13:12:46,545 INFO L272 TraceCheckUtils]: 85: Hoare triple {21730#(and (<= main_~b~0 main_~c~0) (= (+ main_~c~0 (* main_~b~0 2)) main_~a~0) (not (<= (* main_~b~0 2) main_~c~0)) (= main_~k~0 2))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {21486#true} is VALID [2022-04-27 13:12:46,545 INFO L290 TraceCheckUtils]: 86: Hoare triple {21486#true} ~cond := #in~cond; {21486#true} is VALID [2022-04-27 13:12:46,545 INFO L290 TraceCheckUtils]: 87: Hoare triple {21486#true} assume !(0 == ~cond); {21486#true} is VALID [2022-04-27 13:12:46,545 INFO L290 TraceCheckUtils]: 88: Hoare triple {21486#true} assume true; {21486#true} is VALID [2022-04-27 13:12:46,545 INFO L284 TraceCheckUtils]: 89: Hoare quadruple {21486#true} {21730#(and (<= main_~b~0 main_~c~0) (= (+ main_~c~0 (* main_~b~0 2)) main_~a~0) (not (<= (* main_~b~0 2) main_~c~0)) (= main_~k~0 2))} #104#return; {21730#(and (<= main_~b~0 main_~c~0) (= (+ main_~c~0 (* main_~b~0 2)) main_~a~0) (not (<= (* main_~b~0 2) main_~c~0)) (= main_~k~0 2))} is VALID [2022-04-27 13:12:46,546 INFO L272 TraceCheckUtils]: 90: Hoare triple {21730#(and (<= main_~b~0 main_~c~0) (= (+ main_~c~0 (* main_~b~0 2)) main_~a~0) (not (<= (* main_~b~0 2) main_~c~0)) (= main_~k~0 2))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {21767#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:12:46,546 INFO L290 TraceCheckUtils]: 91: Hoare triple {21767#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {21771#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:12:46,546 INFO L290 TraceCheckUtils]: 92: Hoare triple {21771#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {21487#false} is VALID [2022-04-27 13:12:46,546 INFO L290 TraceCheckUtils]: 93: Hoare triple {21487#false} assume !false; {21487#false} is VALID [2022-04-27 13:12:46,546 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 20 proven. 16 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2022-04-27 13:12:46,546 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:12:47,200 INFO L290 TraceCheckUtils]: 93: Hoare triple {21487#false} assume !false; {21487#false} is VALID [2022-04-27 13:12:47,200 INFO L290 TraceCheckUtils]: 92: Hoare triple {21771#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {21487#false} is VALID [2022-04-27 13:12:47,200 INFO L290 TraceCheckUtils]: 91: Hoare triple {21767#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {21771#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:12:47,201 INFO L272 TraceCheckUtils]: 90: Hoare triple {21787#(= 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)); {21767#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:12:47,201 INFO L284 TraceCheckUtils]: 89: Hoare quadruple {21486#true} {21787#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} #104#return; {21787#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-27 13:12:47,201 INFO L290 TraceCheckUtils]: 88: Hoare triple {21486#true} assume true; {21486#true} is VALID [2022-04-27 13:12:47,201 INFO L290 TraceCheckUtils]: 87: Hoare triple {21486#true} assume !(0 == ~cond); {21486#true} is VALID [2022-04-27 13:12:47,201 INFO L290 TraceCheckUtils]: 86: Hoare triple {21486#true} ~cond := #in~cond; {21486#true} is VALID [2022-04-27 13:12:47,201 INFO L272 TraceCheckUtils]: 85: Hoare triple {21787#(= main_~a~0 (+ main_~c~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)); {21486#true} is VALID [2022-04-27 13:12:47,202 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {21486#true} {21787#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} #102#return; {21787#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-27 13:12:47,202 INFO L290 TraceCheckUtils]: 83: Hoare triple {21486#true} assume true; {21486#true} is VALID [2022-04-27 13:12:47,202 INFO L290 TraceCheckUtils]: 82: Hoare triple {21486#true} assume !(0 == ~cond); {21486#true} is VALID [2022-04-27 13:12:47,202 INFO L290 TraceCheckUtils]: 81: Hoare triple {21486#true} ~cond := #in~cond; {21486#true} is VALID [2022-04-27 13:12:47,202 INFO L272 TraceCheckUtils]: 80: Hoare triple {21787#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {21486#true} is VALID [2022-04-27 13:12:47,202 INFO L290 TraceCheckUtils]: 79: Hoare triple {21787#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} assume !false; {21787#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-27 13:12:47,202 INFO L290 TraceCheckUtils]: 78: Hoare triple {21824#(or (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (not (<= main_~b~0 main_~c~0)))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {21787#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-27 13:12:47,203 INFO L290 TraceCheckUtils]: 77: Hoare triple {21824#(or (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (not (<= main_~b~0 main_~c~0)))} assume !false; {21824#(or (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (not (<= main_~b~0 main_~c~0)))} is VALID [2022-04-27 13:12:47,205 INFO L290 TraceCheckUtils]: 76: Hoare triple {21831#(or (not (<= (+ main_~b~0 main_~v~0) main_~c~0)) (= main_~a~0 (+ main_~c~0 (* main_~b~0 (+ main_~d~0 main_~k~0)) (* (- 1) main_~v~0))))} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {21824#(or (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (not (<= main_~b~0 main_~c~0)))} is VALID [2022-04-27 13:12:47,205 INFO L290 TraceCheckUtils]: 75: Hoare triple {21835#(or (not (<= (+ main_~b~0 main_~v~0) main_~c~0)) (= main_~a~0 (+ main_~c~0 (* main_~b~0 (+ main_~d~0 main_~k~0)) (* (- 1) main_~v~0))) (<= (* main_~v~0 2) main_~c~0))} assume !(~c~0 >= 2 * ~v~0); {21831#(or (not (<= (+ main_~b~0 main_~v~0) main_~c~0)) (= main_~a~0 (+ main_~c~0 (* main_~b~0 (+ main_~d~0 main_~k~0)) (* (- 1) main_~v~0))))} is VALID [2022-04-27 13:12:47,205 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {21486#true} {21835#(or (not (<= (+ main_~b~0 main_~v~0) main_~c~0)) (= main_~a~0 (+ main_~c~0 (* main_~b~0 (+ main_~d~0 main_~k~0)) (* (- 1) main_~v~0))) (<= (* main_~v~0 2) main_~c~0))} #108#return; {21835#(or (not (<= (+ main_~b~0 main_~v~0) main_~c~0)) (= main_~a~0 (+ main_~c~0 (* main_~b~0 (+ main_~d~0 main_~k~0)) (* (- 1) main_~v~0))) (<= (* main_~v~0 2) main_~c~0))} is VALID [2022-04-27 13:12:47,205 INFO L290 TraceCheckUtils]: 73: Hoare triple {21486#true} assume true; {21486#true} is VALID [2022-04-27 13:12:47,205 INFO L290 TraceCheckUtils]: 72: Hoare triple {21486#true} assume !(0 == ~cond); {21486#true} is VALID [2022-04-27 13:12:47,205 INFO L290 TraceCheckUtils]: 71: Hoare triple {21486#true} ~cond := #in~cond; {21486#true} is VALID [2022-04-27 13:12:47,206 INFO L272 TraceCheckUtils]: 70: Hoare triple {21835#(or (not (<= (+ main_~b~0 main_~v~0) main_~c~0)) (= main_~a~0 (+ main_~c~0 (* main_~b~0 (+ main_~d~0 main_~k~0)) (* (- 1) main_~v~0))) (<= (* main_~v~0 2) main_~c~0))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {21486#true} is VALID [2022-04-27 13:12:47,206 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {21486#true} {21835#(or (not (<= (+ main_~b~0 main_~v~0) main_~c~0)) (= main_~a~0 (+ main_~c~0 (* main_~b~0 (+ main_~d~0 main_~k~0)) (* (- 1) main_~v~0))) (<= (* main_~v~0 2) main_~c~0))} #106#return; {21835#(or (not (<= (+ main_~b~0 main_~v~0) main_~c~0)) (= main_~a~0 (+ main_~c~0 (* main_~b~0 (+ main_~d~0 main_~k~0)) (* (- 1) main_~v~0))) (<= (* main_~v~0 2) main_~c~0))} is VALID [2022-04-27 13:12:47,206 INFO L290 TraceCheckUtils]: 68: Hoare triple {21486#true} assume true; {21486#true} is VALID [2022-04-27 13:12:47,206 INFO L290 TraceCheckUtils]: 67: Hoare triple {21486#true} assume !(0 == ~cond); {21486#true} is VALID [2022-04-27 13:12:47,206 INFO L290 TraceCheckUtils]: 66: Hoare triple {21486#true} ~cond := #in~cond; {21486#true} is VALID [2022-04-27 13:12:47,206 INFO L272 TraceCheckUtils]: 65: Hoare triple {21835#(or (not (<= (+ main_~b~0 main_~v~0) main_~c~0)) (= main_~a~0 (+ main_~c~0 (* main_~b~0 (+ main_~d~0 main_~k~0)) (* (- 1) main_~v~0))) (<= (* main_~v~0 2) main_~c~0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {21486#true} is VALID [2022-04-27 13:12:47,206 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {21486#true} {21835#(or (not (<= (+ main_~b~0 main_~v~0) main_~c~0)) (= main_~a~0 (+ main_~c~0 (* main_~b~0 (+ main_~d~0 main_~k~0)) (* (- 1) main_~v~0))) (<= (* main_~v~0 2) main_~c~0))} #104#return; {21835#(or (not (<= (+ main_~b~0 main_~v~0) main_~c~0)) (= main_~a~0 (+ main_~c~0 (* main_~b~0 (+ main_~d~0 main_~k~0)) (* (- 1) main_~v~0))) (<= (* main_~v~0 2) main_~c~0))} is VALID [2022-04-27 13:12:47,207 INFO L290 TraceCheckUtils]: 63: Hoare triple {21486#true} assume true; {21486#true} is VALID [2022-04-27 13:12:47,207 INFO L290 TraceCheckUtils]: 62: Hoare triple {21486#true} assume !(0 == ~cond); {21486#true} is VALID [2022-04-27 13:12:47,207 INFO L290 TraceCheckUtils]: 61: Hoare triple {21486#true} ~cond := #in~cond; {21486#true} is VALID [2022-04-27 13:12:47,207 INFO L272 TraceCheckUtils]: 60: Hoare triple {21835#(or (not (<= (+ main_~b~0 main_~v~0) main_~c~0)) (= main_~a~0 (+ main_~c~0 (* main_~b~0 (+ main_~d~0 main_~k~0)) (* (- 1) main_~v~0))) (<= (* main_~v~0 2) main_~c~0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {21486#true} is VALID [2022-04-27 13:12:47,207 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {21486#true} {21835#(or (not (<= (+ main_~b~0 main_~v~0) main_~c~0)) (= main_~a~0 (+ main_~c~0 (* main_~b~0 (+ main_~d~0 main_~k~0)) (* (- 1) main_~v~0))) (<= (* main_~v~0 2) main_~c~0))} #102#return; {21835#(or (not (<= (+ main_~b~0 main_~v~0) main_~c~0)) (= main_~a~0 (+ main_~c~0 (* main_~b~0 (+ main_~d~0 main_~k~0)) (* (- 1) main_~v~0))) (<= (* main_~v~0 2) main_~c~0))} is VALID [2022-04-27 13:12:47,207 INFO L290 TraceCheckUtils]: 58: Hoare triple {21486#true} assume true; {21486#true} is VALID [2022-04-27 13:12:47,207 INFO L290 TraceCheckUtils]: 57: Hoare triple {21486#true} assume !(0 == ~cond); {21486#true} is VALID [2022-04-27 13:12:47,207 INFO L290 TraceCheckUtils]: 56: Hoare triple {21486#true} ~cond := #in~cond; {21486#true} is VALID [2022-04-27 13:12:47,207 INFO L272 TraceCheckUtils]: 55: Hoare triple {21835#(or (not (<= (+ main_~b~0 main_~v~0) main_~c~0)) (= main_~a~0 (+ main_~c~0 (* main_~b~0 (+ main_~d~0 main_~k~0)) (* (- 1) main_~v~0))) (<= (* main_~v~0 2) main_~c~0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {21486#true} is VALID [2022-04-27 13:12:47,208 INFO L290 TraceCheckUtils]: 54: Hoare triple {21835#(or (not (<= (+ main_~b~0 main_~v~0) main_~c~0)) (= main_~a~0 (+ main_~c~0 (* main_~b~0 (+ main_~d~0 main_~k~0)) (* (- 1) main_~v~0))) (<= (* main_~v~0 2) main_~c~0))} assume !false; {21835#(or (not (<= (+ main_~b~0 main_~v~0) main_~c~0)) (= main_~a~0 (+ main_~c~0 (* main_~b~0 (+ main_~d~0 main_~k~0)) (* (- 1) main_~v~0))) (<= (* main_~v~0 2) main_~c~0))} is VALID [2022-04-27 13:12:47,210 INFO L290 TraceCheckUtils]: 53: Hoare triple {21902#(or (<= (* main_~v~0 4) main_~c~0) (= main_~a~0 (+ main_~c~0 (* (+ main_~k~0 (* main_~d~0 2)) main_~b~0) (* (- 2) main_~v~0))) (not (<= (+ (* main_~v~0 2) main_~b~0) main_~c~0)))} assume !!(~c~0 >= 2 * ~v~0);~d~0 := 2 * ~d~0;~v~0 := 2 * ~v~0; {21835#(or (not (<= (+ main_~b~0 main_~v~0) main_~c~0)) (= main_~a~0 (+ main_~c~0 (* main_~b~0 (+ main_~d~0 main_~k~0)) (* (- 1) main_~v~0))) (<= (* main_~v~0 2) main_~c~0))} is VALID [2022-04-27 13:12:47,210 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {21486#true} {21902#(or (<= (* main_~v~0 4) main_~c~0) (= main_~a~0 (+ main_~c~0 (* (+ main_~k~0 (* main_~d~0 2)) main_~b~0) (* (- 2) main_~v~0))) (not (<= (+ (* main_~v~0 2) main_~b~0) main_~c~0)))} #108#return; {21902#(or (<= (* main_~v~0 4) main_~c~0) (= main_~a~0 (+ main_~c~0 (* (+ main_~k~0 (* main_~d~0 2)) main_~b~0) (* (- 2) main_~v~0))) (not (<= (+ (* main_~v~0 2) main_~b~0) main_~c~0)))} is VALID [2022-04-27 13:12:47,210 INFO L290 TraceCheckUtils]: 51: Hoare triple {21486#true} assume true; {21486#true} is VALID [2022-04-27 13:12:47,210 INFO L290 TraceCheckUtils]: 50: Hoare triple {21486#true} assume !(0 == ~cond); {21486#true} is VALID [2022-04-27 13:12:47,210 INFO L290 TraceCheckUtils]: 49: Hoare triple {21486#true} ~cond := #in~cond; {21486#true} is VALID [2022-04-27 13:12:47,210 INFO L272 TraceCheckUtils]: 48: Hoare triple {21902#(or (<= (* main_~v~0 4) main_~c~0) (= main_~a~0 (+ main_~c~0 (* (+ main_~k~0 (* main_~d~0 2)) main_~b~0) (* (- 2) main_~v~0))) (not (<= (+ (* main_~v~0 2) main_~b~0) main_~c~0)))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {21486#true} is VALID [2022-04-27 13:12:47,210 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {21486#true} {21902#(or (<= (* main_~v~0 4) main_~c~0) (= main_~a~0 (+ main_~c~0 (* (+ main_~k~0 (* main_~d~0 2)) main_~b~0) (* (- 2) main_~v~0))) (not (<= (+ (* main_~v~0 2) main_~b~0) main_~c~0)))} #106#return; {21902#(or (<= (* main_~v~0 4) main_~c~0) (= main_~a~0 (+ main_~c~0 (* (+ main_~k~0 (* main_~d~0 2)) main_~b~0) (* (- 2) main_~v~0))) (not (<= (+ (* main_~v~0 2) main_~b~0) main_~c~0)))} is VALID [2022-04-27 13:12:47,210 INFO L290 TraceCheckUtils]: 46: Hoare triple {21486#true} assume true; {21486#true} is VALID [2022-04-27 13:12:47,211 INFO L290 TraceCheckUtils]: 45: Hoare triple {21486#true} assume !(0 == ~cond); {21486#true} is VALID [2022-04-27 13:12:47,211 INFO L290 TraceCheckUtils]: 44: Hoare triple {21486#true} ~cond := #in~cond; {21486#true} is VALID [2022-04-27 13:12:47,211 INFO L272 TraceCheckUtils]: 43: Hoare triple {21902#(or (<= (* main_~v~0 4) main_~c~0) (= main_~a~0 (+ main_~c~0 (* (+ main_~k~0 (* main_~d~0 2)) main_~b~0) (* (- 2) main_~v~0))) (not (<= (+ (* main_~v~0 2) main_~b~0) main_~c~0)))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {21486#true} is VALID [2022-04-27 13:12:47,211 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {21486#true} {21902#(or (<= (* main_~v~0 4) main_~c~0) (= main_~a~0 (+ main_~c~0 (* (+ main_~k~0 (* main_~d~0 2)) main_~b~0) (* (- 2) main_~v~0))) (not (<= (+ (* main_~v~0 2) main_~b~0) main_~c~0)))} #104#return; {21902#(or (<= (* main_~v~0 4) main_~c~0) (= main_~a~0 (+ main_~c~0 (* (+ main_~k~0 (* main_~d~0 2)) main_~b~0) (* (- 2) main_~v~0))) (not (<= (+ (* main_~v~0 2) main_~b~0) main_~c~0)))} is VALID [2022-04-27 13:12:47,211 INFO L290 TraceCheckUtils]: 41: Hoare triple {21486#true} assume true; {21486#true} is VALID [2022-04-27 13:12:47,211 INFO L290 TraceCheckUtils]: 40: Hoare triple {21486#true} assume !(0 == ~cond); {21486#true} is VALID [2022-04-27 13:12:47,211 INFO L290 TraceCheckUtils]: 39: Hoare triple {21486#true} ~cond := #in~cond; {21486#true} is VALID [2022-04-27 13:12:47,211 INFO L272 TraceCheckUtils]: 38: Hoare triple {21902#(or (<= (* main_~v~0 4) main_~c~0) (= main_~a~0 (+ main_~c~0 (* (+ main_~k~0 (* main_~d~0 2)) main_~b~0) (* (- 2) main_~v~0))) (not (<= (+ (* main_~v~0 2) main_~b~0) main_~c~0)))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {21486#true} is VALID [2022-04-27 13:12:47,212 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {21486#true} {21902#(or (<= (* main_~v~0 4) main_~c~0) (= main_~a~0 (+ main_~c~0 (* (+ main_~k~0 (* main_~d~0 2)) main_~b~0) (* (- 2) main_~v~0))) (not (<= (+ (* main_~v~0 2) main_~b~0) main_~c~0)))} #102#return; {21902#(or (<= (* main_~v~0 4) main_~c~0) (= main_~a~0 (+ main_~c~0 (* (+ main_~k~0 (* main_~d~0 2)) main_~b~0) (* (- 2) main_~v~0))) (not (<= (+ (* main_~v~0 2) main_~b~0) main_~c~0)))} is VALID [2022-04-27 13:12:47,212 INFO L290 TraceCheckUtils]: 36: Hoare triple {21486#true} assume true; {21486#true} is VALID [2022-04-27 13:12:47,212 INFO L290 TraceCheckUtils]: 35: Hoare triple {21486#true} assume !(0 == ~cond); {21486#true} is VALID [2022-04-27 13:12:47,212 INFO L290 TraceCheckUtils]: 34: Hoare triple {21486#true} ~cond := #in~cond; {21486#true} is VALID [2022-04-27 13:12:47,212 INFO L272 TraceCheckUtils]: 33: Hoare triple {21902#(or (<= (* main_~v~0 4) main_~c~0) (= main_~a~0 (+ main_~c~0 (* (+ main_~k~0 (* main_~d~0 2)) main_~b~0) (* (- 2) main_~v~0))) (not (<= (+ (* main_~v~0 2) main_~b~0) main_~c~0)))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {21486#true} is VALID [2022-04-27 13:12:47,212 INFO L290 TraceCheckUtils]: 32: Hoare triple {21902#(or (<= (* main_~v~0 4) main_~c~0) (= main_~a~0 (+ main_~c~0 (* (+ main_~k~0 (* main_~d~0 2)) main_~b~0) (* (- 2) main_~v~0))) (not (<= (+ (* main_~v~0 2) main_~b~0) main_~c~0)))} assume !false; {21902#(or (<= (* main_~v~0 4) main_~c~0) (= main_~a~0 (+ main_~c~0 (* (+ main_~k~0 (* main_~d~0 2)) main_~b~0) (* (- 2) main_~v~0))) (not (<= (+ (* main_~v~0 2) main_~b~0) main_~c~0)))} is VALID [2022-04-27 13:12:47,213 INFO L290 TraceCheckUtils]: 31: Hoare triple {21969#(or (not (<= (* main_~b~0 3) main_~c~0)) (= main_~a~0 (+ (* (- 2) main_~b~0) main_~c~0 (* (+ main_~k~0 2) main_~b~0))) (<= (* main_~b~0 4) main_~c~0))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {21902#(or (<= (* main_~v~0 4) main_~c~0) (= main_~a~0 (+ main_~c~0 (* (+ main_~k~0 (* main_~d~0 2)) main_~b~0) (* (- 2) main_~v~0))) (not (<= (+ (* main_~v~0 2) main_~b~0) main_~c~0)))} is VALID [2022-04-27 13:12:47,213 INFO L290 TraceCheckUtils]: 30: Hoare triple {21969#(or (not (<= (* main_~b~0 3) main_~c~0)) (= main_~a~0 (+ (* (- 2) main_~b~0) main_~c~0 (* (+ main_~k~0 2) main_~b~0))) (<= (* main_~b~0 4) main_~c~0))} assume !false; {21969#(or (not (<= (* main_~b~0 3) main_~c~0)) (= main_~a~0 (+ (* (- 2) main_~b~0) main_~c~0 (* (+ main_~k~0 2) main_~b~0))) (<= (* main_~b~0 4) main_~c~0))} is VALID [2022-04-27 13:12:47,213 INFO L290 TraceCheckUtils]: 29: Hoare triple {21486#true} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {21969#(or (not (<= (* main_~b~0 3) main_~c~0)) (= main_~a~0 (+ (* (- 2) main_~b~0) main_~c~0 (* (+ main_~k~0 2) main_~b~0))) (<= (* main_~b~0 4) main_~c~0))} is VALID [2022-04-27 13:12:47,213 INFO L290 TraceCheckUtils]: 28: Hoare triple {21486#true} assume !false; {21486#true} is VALID [2022-04-27 13:12:47,213 INFO L290 TraceCheckUtils]: 27: Hoare triple {21486#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {21486#true} is VALID [2022-04-27 13:12:47,213 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {21486#true} {21486#true} #100#return; {21486#true} is VALID [2022-04-27 13:12:47,213 INFO L290 TraceCheckUtils]: 25: Hoare triple {21486#true} assume true; {21486#true} is VALID [2022-04-27 13:12:47,213 INFO L290 TraceCheckUtils]: 24: Hoare triple {21486#true} assume !(0 == ~cond); {21486#true} is VALID [2022-04-27 13:12:47,213 INFO L290 TraceCheckUtils]: 23: Hoare triple {21486#true} ~cond := #in~cond; {21486#true} is VALID [2022-04-27 13:12:47,213 INFO L272 TraceCheckUtils]: 22: Hoare triple {21486#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {21486#true} is VALID [2022-04-27 13:12:47,214 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {21486#true} {21486#true} #98#return; {21486#true} is VALID [2022-04-27 13:12:47,214 INFO L290 TraceCheckUtils]: 20: Hoare triple {21486#true} assume true; {21486#true} is VALID [2022-04-27 13:12:47,214 INFO L290 TraceCheckUtils]: 19: Hoare triple {21486#true} assume !(0 == ~cond); {21486#true} is VALID [2022-04-27 13:12:47,214 INFO L290 TraceCheckUtils]: 18: Hoare triple {21486#true} ~cond := #in~cond; {21486#true} is VALID [2022-04-27 13:12:47,214 INFO L272 TraceCheckUtils]: 17: Hoare triple {21486#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {21486#true} is VALID [2022-04-27 13:12:47,214 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {21486#true} {21486#true} #96#return; {21486#true} is VALID [2022-04-27 13:12:47,214 INFO L290 TraceCheckUtils]: 15: Hoare triple {21486#true} assume true; {21486#true} is VALID [2022-04-27 13:12:47,214 INFO L290 TraceCheckUtils]: 14: Hoare triple {21486#true} assume !(0 == ~cond); {21486#true} is VALID [2022-04-27 13:12:47,214 INFO L290 TraceCheckUtils]: 13: Hoare triple {21486#true} ~cond := #in~cond; {21486#true} is VALID [2022-04-27 13:12:47,214 INFO L272 TraceCheckUtils]: 12: Hoare triple {21486#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 10 then 1 else 0)); {21486#true} is VALID [2022-04-27 13:12:47,214 INFO L290 TraceCheckUtils]: 11: Hoare triple {21486#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {21486#true} is VALID [2022-04-27 13:12:47,214 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {21486#true} {21486#true} #94#return; {21486#true} is VALID [2022-04-27 13:12:47,214 INFO L290 TraceCheckUtils]: 9: Hoare triple {21486#true} assume true; {21486#true} is VALID [2022-04-27 13:12:47,214 INFO L290 TraceCheckUtils]: 8: Hoare triple {21486#true} assume !(0 == ~cond); {21486#true} is VALID [2022-04-27 13:12:47,214 INFO L290 TraceCheckUtils]: 7: Hoare triple {21486#true} ~cond := #in~cond; {21486#true} is VALID [2022-04-27 13:12:47,214 INFO L272 TraceCheckUtils]: 6: Hoare triple {21486#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 10 then 1 else 0)); {21486#true} is VALID [2022-04-27 13:12:47,214 INFO L290 TraceCheckUtils]: 5: Hoare triple {21486#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;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {21486#true} is VALID [2022-04-27 13:12:47,214 INFO L272 TraceCheckUtils]: 4: Hoare triple {21486#true} call #t~ret6 := main(); {21486#true} is VALID [2022-04-27 13:12:47,214 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21486#true} {21486#true} #112#return; {21486#true} is VALID [2022-04-27 13:12:47,214 INFO L290 TraceCheckUtils]: 2: Hoare triple {21486#true} assume true; {21486#true} is VALID [2022-04-27 13:12:47,214 INFO L290 TraceCheckUtils]: 1: Hoare triple {21486#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); {21486#true} is VALID [2022-04-27 13:12:47,214 INFO L272 TraceCheckUtils]: 0: Hoare triple {21486#true} call ULTIMATE.init(); {21486#true} is VALID [2022-04-27 13:12:47,215 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 22 proven. 14 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2022-04-27 13:12:47,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:12:47,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90356109] [2022-04-27 13:12:47,215 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:12:47,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2015251529] [2022-04-27 13:12:47,215 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2015251529] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 13:12:47,215 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 13:12:47,215 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2022-04-27 13:12:47,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057802387] [2022-04-27 13:12:47,215 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 13:12:47,216 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 7 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (25), 7 states have call predecessors, (25), 7 states have call successors, (25) Word has length 94 [2022-04-27 13:12:47,216 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:12:47,216 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 7 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (25), 7 states have call predecessors, (25), 7 states have call successors, (25) [2022-04-27 13:12:47,299 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:12:47,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-27 13:12:47,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:12:47,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-27 13:12:47,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2022-04-27 13:12:47,299 INFO L87 Difference]: Start difference. First operand 553 states and 792 transitions. Second operand has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 7 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (25), 7 states have call predecessors, (25), 7 states have call successors, (25) [2022-04-27 13:12:55,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:12:55,988 INFO L93 Difference]: Finished difference Result 1263 states and 1956 transitions. [2022-04-27 13:12:55,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-04-27 13:12:55,988 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 7 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (25), 7 states have call predecessors, (25), 7 states have call successors, (25) Word has length 94 [2022-04-27 13:12:55,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:12:55,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 7 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (25), 7 states have call predecessors, (25), 7 states have call successors, (25) [2022-04-27 13:12:55,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 211 transitions. [2022-04-27 13:12:55,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 7 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (25), 7 states have call predecessors, (25), 7 states have call successors, (25) [2022-04-27 13:12:55,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 211 transitions. [2022-04-27 13:12:55,993 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 211 transitions. [2022-04-27 13:12:56,247 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 211 edges. 211 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:12:56,316 INFO L225 Difference]: With dead ends: 1263 [2022-04-27 13:12:56,316 INFO L226 Difference]: Without dead ends: 1261 [2022-04-27 13:12:56,317 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 172 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=222, Invalid=534, Unknown=0, NotChecked=0, Total=756 [2022-04-27 13:12:56,317 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 88 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 434 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 571 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-04-27 13:12:56,317 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 365 Invalid, 571 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 434 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-04-27 13:12:56,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1261 states. [2022-04-27 13:13:02,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1261 to 1153. [2022-04-27 13:13:02,260 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:13:02,262 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1261 states. Second operand has 1153 states, 564 states have (on average 1.303191489361702) internal successors, (735), 568 states have internal predecessors, (735), 553 states have call successors, (553), 36 states have call predecessors, (553), 35 states have return successors, (551), 548 states have call predecessors, (551), 551 states have call successors, (551) [2022-04-27 13:13:02,263 INFO L74 IsIncluded]: Start isIncluded. First operand 1261 states. Second operand has 1153 states, 564 states have (on average 1.303191489361702) internal successors, (735), 568 states have internal predecessors, (735), 553 states have call successors, (553), 36 states have call predecessors, (553), 35 states have return successors, (551), 548 states have call predecessors, (551), 551 states have call successors, (551) [2022-04-27 13:13:02,264 INFO L87 Difference]: Start difference. First operand 1261 states. Second operand has 1153 states, 564 states have (on average 1.303191489361702) internal successors, (735), 568 states have internal predecessors, (735), 553 states have call successors, (553), 36 states have call predecessors, (553), 35 states have return successors, (551), 548 states have call predecessors, (551), 551 states have call successors, (551) [2022-04-27 13:13:02,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:13:02,341 INFO L93 Difference]: Finished difference Result 1261 states and 1954 transitions. [2022-04-27 13:13:02,341 INFO L276 IsEmpty]: Start isEmpty. Operand 1261 states and 1954 transitions. [2022-04-27 13:13:02,346 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:13:02,346 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:13:02,347 INFO L74 IsIncluded]: Start isIncluded. First operand has 1153 states, 564 states have (on average 1.303191489361702) internal successors, (735), 568 states have internal predecessors, (735), 553 states have call successors, (553), 36 states have call predecessors, (553), 35 states have return successors, (551), 548 states have call predecessors, (551), 551 states have call successors, (551) Second operand 1261 states. [2022-04-27 13:13:02,348 INFO L87 Difference]: Start difference. First operand has 1153 states, 564 states have (on average 1.303191489361702) internal successors, (735), 568 states have internal predecessors, (735), 553 states have call successors, (553), 36 states have call predecessors, (553), 35 states have return successors, (551), 548 states have call predecessors, (551), 551 states have call successors, (551) Second operand 1261 states. [2022-04-27 13:13:02,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:13:02,406 INFO L93 Difference]: Finished difference Result 1261 states and 1954 transitions. [2022-04-27 13:13:02,406 INFO L276 IsEmpty]: Start isEmpty. Operand 1261 states and 1954 transitions. [2022-04-27 13:13:02,409 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:13:02,409 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:13:02,409 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:13:02,410 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:13:02,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1153 states, 564 states have (on average 1.303191489361702) internal successors, (735), 568 states have internal predecessors, (735), 553 states have call successors, (553), 36 states have call predecessors, (553), 35 states have return successors, (551), 548 states have call predecessors, (551), 551 states have call successors, (551) [2022-04-27 13:13:02,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1153 states to 1153 states and 1839 transitions. [2022-04-27 13:13:02,486 INFO L78 Accepts]: Start accepts. Automaton has 1153 states and 1839 transitions. Word has length 94 [2022-04-27 13:13:02,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:13:02,487 INFO L495 AbstractCegarLoop]: Abstraction has 1153 states and 1839 transitions. [2022-04-27 13:13:02,487 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 7 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (25), 7 states have call predecessors, (25), 7 states have call successors, (25) [2022-04-27 13:13:02,487 INFO L276 IsEmpty]: Start isEmpty. Operand 1153 states and 1839 transitions. [2022-04-27 13:13:02,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-04-27 13:13:02,488 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:13:02,488 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 5, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:13:02,504 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-04-27 13:13:02,704 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-04-27 13:13:02,704 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:13:02,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:13:02,705 INFO L85 PathProgramCache]: Analyzing trace with hash -568526404, now seen corresponding path program 2 times [2022-04-27 13:13:02,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:13:02,705 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302661500] [2022-04-27 13:13:02,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:13:02,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:13:02,717 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:13:02,718 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1192181308] [2022-04-27 13:13:02,718 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 13:13:02,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:13:02,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:13:02,719 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 13:13:02,720 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-04-27 13:13:02,771 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 13:13:02,771 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 13:13:02,771 INFO L263 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-27 13:13:02,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:13:02,786 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:13:03,151 INFO L272 TraceCheckUtils]: 0: Hoare triple {28626#true} call ULTIMATE.init(); {28626#true} is VALID [2022-04-27 13:13:03,151 INFO L290 TraceCheckUtils]: 1: Hoare triple {28626#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); {28626#true} is VALID [2022-04-27 13:13:03,151 INFO L290 TraceCheckUtils]: 2: Hoare triple {28626#true} assume true; {28626#true} is VALID [2022-04-27 13:13:03,152 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28626#true} {28626#true} #112#return; {28626#true} is VALID [2022-04-27 13:13:03,152 INFO L272 TraceCheckUtils]: 4: Hoare triple {28626#true} call #t~ret6 := main(); {28626#true} is VALID [2022-04-27 13:13:03,152 INFO L290 TraceCheckUtils]: 5: Hoare triple {28626#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;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {28626#true} is VALID [2022-04-27 13:13:03,152 INFO L272 TraceCheckUtils]: 6: Hoare triple {28626#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 10 then 1 else 0)); {28626#true} is VALID [2022-04-27 13:13:03,152 INFO L290 TraceCheckUtils]: 7: Hoare triple {28626#true} ~cond := #in~cond; {28626#true} is VALID [2022-04-27 13:13:03,152 INFO L290 TraceCheckUtils]: 8: Hoare triple {28626#true} assume !(0 == ~cond); {28626#true} is VALID [2022-04-27 13:13:03,152 INFO L290 TraceCheckUtils]: 9: Hoare triple {28626#true} assume true; {28626#true} is VALID [2022-04-27 13:13:03,152 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {28626#true} {28626#true} #94#return; {28626#true} is VALID [2022-04-27 13:13:03,152 INFO L290 TraceCheckUtils]: 11: Hoare triple {28626#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {28626#true} is VALID [2022-04-27 13:13:03,152 INFO L272 TraceCheckUtils]: 12: Hoare triple {28626#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 10 then 1 else 0)); {28626#true} is VALID [2022-04-27 13:13:03,152 INFO L290 TraceCheckUtils]: 13: Hoare triple {28626#true} ~cond := #in~cond; {28626#true} is VALID [2022-04-27 13:13:03,152 INFO L290 TraceCheckUtils]: 14: Hoare triple {28626#true} assume !(0 == ~cond); {28626#true} is VALID [2022-04-27 13:13:03,152 INFO L290 TraceCheckUtils]: 15: Hoare triple {28626#true} assume true; {28626#true} is VALID [2022-04-27 13:13:03,152 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {28626#true} {28626#true} #96#return; {28626#true} is VALID [2022-04-27 13:13:03,152 INFO L272 TraceCheckUtils]: 17: Hoare triple {28626#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {28626#true} is VALID [2022-04-27 13:13:03,152 INFO L290 TraceCheckUtils]: 18: Hoare triple {28626#true} ~cond := #in~cond; {28626#true} is VALID [2022-04-27 13:13:03,152 INFO L290 TraceCheckUtils]: 19: Hoare triple {28626#true} assume !(0 == ~cond); {28626#true} is VALID [2022-04-27 13:13:03,152 INFO L290 TraceCheckUtils]: 20: Hoare triple {28626#true} assume true; {28626#true} is VALID [2022-04-27 13:13:03,152 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {28626#true} {28626#true} #98#return; {28626#true} is VALID [2022-04-27 13:13:03,152 INFO L272 TraceCheckUtils]: 22: Hoare triple {28626#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {28626#true} is VALID [2022-04-27 13:13:03,152 INFO L290 TraceCheckUtils]: 23: Hoare triple {28626#true} ~cond := #in~cond; {28626#true} is VALID [2022-04-27 13:13:03,153 INFO L290 TraceCheckUtils]: 24: Hoare triple {28626#true} assume !(0 == ~cond); {28626#true} is VALID [2022-04-27 13:13:03,153 INFO L290 TraceCheckUtils]: 25: Hoare triple {28626#true} assume true; {28626#true} is VALID [2022-04-27 13:13:03,153 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {28626#true} {28626#true} #100#return; {28626#true} is VALID [2022-04-27 13:13:03,153 INFO L290 TraceCheckUtils]: 27: Hoare triple {28626#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {28626#true} is VALID [2022-04-27 13:13:03,153 INFO L290 TraceCheckUtils]: 28: Hoare triple {28626#true} assume !false; {28626#true} is VALID [2022-04-27 13:13:03,153 INFO L290 TraceCheckUtils]: 29: Hoare triple {28626#true} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {28626#true} is VALID [2022-04-27 13:13:03,153 INFO L290 TraceCheckUtils]: 30: Hoare triple {28626#true} assume !false; {28626#true} is VALID [2022-04-27 13:13:03,153 INFO L290 TraceCheckUtils]: 31: Hoare triple {28626#true} assume !(~c~0 >= ~b~0); {28626#true} is VALID [2022-04-27 13:13:03,153 INFO L290 TraceCheckUtils]: 32: Hoare triple {28626#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; {28626#true} is VALID [2022-04-27 13:13:03,153 INFO L290 TraceCheckUtils]: 33: Hoare triple {28626#true} assume !false; {28626#true} is VALID [2022-04-27 13:13:03,153 INFO L290 TraceCheckUtils]: 34: Hoare triple {28626#true} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {28626#true} is VALID [2022-04-27 13:13:03,153 INFO L290 TraceCheckUtils]: 35: Hoare triple {28626#true} assume !false; {28626#true} is VALID [2022-04-27 13:13:03,153 INFO L290 TraceCheckUtils]: 36: Hoare triple {28626#true} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {28739#(<= main_~v~0 main_~b~0)} is VALID [2022-04-27 13:13:03,154 INFO L290 TraceCheckUtils]: 37: Hoare triple {28739#(<= main_~v~0 main_~b~0)} assume !false; {28739#(<= main_~v~0 main_~b~0)} is VALID [2022-04-27 13:13:03,154 INFO L272 TraceCheckUtils]: 38: Hoare triple {28739#(<= main_~v~0 main_~b~0)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {28626#true} is VALID [2022-04-27 13:13:03,154 INFO L290 TraceCheckUtils]: 39: Hoare triple {28626#true} ~cond := #in~cond; {28626#true} is VALID [2022-04-27 13:13:03,154 INFO L290 TraceCheckUtils]: 40: Hoare triple {28626#true} assume !(0 == ~cond); {28626#true} is VALID [2022-04-27 13:13:03,154 INFO L290 TraceCheckUtils]: 41: Hoare triple {28626#true} assume true; {28626#true} is VALID [2022-04-27 13:13:03,154 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {28626#true} {28739#(<= main_~v~0 main_~b~0)} #102#return; {28739#(<= main_~v~0 main_~b~0)} is VALID [2022-04-27 13:13:03,154 INFO L272 TraceCheckUtils]: 43: Hoare triple {28739#(<= main_~v~0 main_~b~0)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {28626#true} is VALID [2022-04-27 13:13:03,154 INFO L290 TraceCheckUtils]: 44: Hoare triple {28626#true} ~cond := #in~cond; {28626#true} is VALID [2022-04-27 13:13:03,154 INFO L290 TraceCheckUtils]: 45: Hoare triple {28626#true} assume !(0 == ~cond); {28626#true} is VALID [2022-04-27 13:13:03,155 INFO L290 TraceCheckUtils]: 46: Hoare triple {28626#true} assume true; {28626#true} is VALID [2022-04-27 13:13:03,155 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {28626#true} {28739#(<= main_~v~0 main_~b~0)} #104#return; {28739#(<= main_~v~0 main_~b~0)} is VALID [2022-04-27 13:13:03,155 INFO L272 TraceCheckUtils]: 48: Hoare triple {28739#(<= main_~v~0 main_~b~0)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {28626#true} is VALID [2022-04-27 13:13:03,155 INFO L290 TraceCheckUtils]: 49: Hoare triple {28626#true} ~cond := #in~cond; {28626#true} is VALID [2022-04-27 13:13:03,155 INFO L290 TraceCheckUtils]: 50: Hoare triple {28626#true} assume !(0 == ~cond); {28626#true} is VALID [2022-04-27 13:13:03,155 INFO L290 TraceCheckUtils]: 51: Hoare triple {28626#true} assume true; {28626#true} is VALID [2022-04-27 13:13:03,156 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {28626#true} {28739#(<= main_~v~0 main_~b~0)} #106#return; {28739#(<= main_~v~0 main_~b~0)} is VALID [2022-04-27 13:13:03,156 INFO L272 TraceCheckUtils]: 53: Hoare triple {28739#(<= main_~v~0 main_~b~0)} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {28626#true} is VALID [2022-04-27 13:13:03,156 INFO L290 TraceCheckUtils]: 54: Hoare triple {28626#true} ~cond := #in~cond; {28626#true} is VALID [2022-04-27 13:13:03,156 INFO L290 TraceCheckUtils]: 55: Hoare triple {28626#true} assume !(0 == ~cond); {28626#true} is VALID [2022-04-27 13:13:03,156 INFO L290 TraceCheckUtils]: 56: Hoare triple {28626#true} assume true; {28626#true} is VALID [2022-04-27 13:13:03,156 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {28626#true} {28739#(<= main_~v~0 main_~b~0)} #108#return; {28739#(<= main_~v~0 main_~b~0)} is VALID [2022-04-27 13:13:03,157 INFO L290 TraceCheckUtils]: 58: Hoare triple {28739#(<= main_~v~0 main_~b~0)} assume !(~c~0 >= 2 * ~v~0); {28806#(and (<= main_~v~0 main_~b~0) (not (<= (* main_~v~0 2) main_~c~0)))} is VALID [2022-04-27 13:13:03,157 INFO L290 TraceCheckUtils]: 59: Hoare triple {28806#(and (<= main_~v~0 main_~b~0) (not (<= (* main_~v~0 2) main_~c~0)))} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {28810#(< main_~c~0 main_~b~0)} is VALID [2022-04-27 13:13:03,158 INFO L290 TraceCheckUtils]: 60: Hoare triple {28810#(< main_~c~0 main_~b~0)} assume !false; {28810#(< main_~c~0 main_~b~0)} is VALID [2022-04-27 13:13:03,158 INFO L290 TraceCheckUtils]: 61: Hoare triple {28810#(< main_~c~0 main_~b~0)} assume !(~c~0 >= ~b~0); {28810#(< main_~c~0 main_~b~0)} is VALID [2022-04-27 13:13:03,158 INFO L290 TraceCheckUtils]: 62: Hoare triple {28810#(< main_~c~0 main_~b~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; {28820#(< main_~b~0 main_~a~0)} is VALID [2022-04-27 13:13:03,159 INFO L290 TraceCheckUtils]: 63: Hoare triple {28820#(< main_~b~0 main_~a~0)} assume !false; {28820#(< main_~b~0 main_~a~0)} is VALID [2022-04-27 13:13:03,159 INFO L290 TraceCheckUtils]: 64: Hoare triple {28820#(< main_~b~0 main_~a~0)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {28827#(< main_~b~0 main_~c~0)} is VALID [2022-04-27 13:13:03,159 INFO L290 TraceCheckUtils]: 65: Hoare triple {28827#(< main_~b~0 main_~c~0)} assume !false; {28827#(< main_~b~0 main_~c~0)} is VALID [2022-04-27 13:13:03,159 INFO L290 TraceCheckUtils]: 66: Hoare triple {28827#(< main_~b~0 main_~c~0)} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {28834#(< main_~v~0 main_~c~0)} is VALID [2022-04-27 13:13:03,160 INFO L290 TraceCheckUtils]: 67: Hoare triple {28834#(< main_~v~0 main_~c~0)} assume !false; {28834#(< main_~v~0 main_~c~0)} is VALID [2022-04-27 13:13:03,160 INFO L272 TraceCheckUtils]: 68: Hoare triple {28834#(< main_~v~0 main_~c~0)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {28626#true} is VALID [2022-04-27 13:13:03,160 INFO L290 TraceCheckUtils]: 69: Hoare triple {28626#true} ~cond := #in~cond; {28626#true} is VALID [2022-04-27 13:13:03,160 INFO L290 TraceCheckUtils]: 70: Hoare triple {28626#true} assume !(0 == ~cond); {28626#true} is VALID [2022-04-27 13:13:03,160 INFO L290 TraceCheckUtils]: 71: Hoare triple {28626#true} assume true; {28626#true} is VALID [2022-04-27 13:13:03,160 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {28626#true} {28834#(< main_~v~0 main_~c~0)} #102#return; {28834#(< main_~v~0 main_~c~0)} is VALID [2022-04-27 13:13:03,161 INFO L272 TraceCheckUtils]: 73: Hoare triple {28834#(< main_~v~0 main_~c~0)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {28626#true} is VALID [2022-04-27 13:13:03,161 INFO L290 TraceCheckUtils]: 74: Hoare triple {28626#true} ~cond := #in~cond; {28626#true} is VALID [2022-04-27 13:13:03,161 INFO L290 TraceCheckUtils]: 75: Hoare triple {28626#true} assume !(0 == ~cond); {28626#true} is VALID [2022-04-27 13:13:03,161 INFO L290 TraceCheckUtils]: 76: Hoare triple {28626#true} assume true; {28626#true} is VALID [2022-04-27 13:13:03,161 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {28626#true} {28834#(< main_~v~0 main_~c~0)} #104#return; {28834#(< main_~v~0 main_~c~0)} is VALID [2022-04-27 13:13:03,161 INFO L272 TraceCheckUtils]: 78: Hoare triple {28834#(< main_~v~0 main_~c~0)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {28626#true} is VALID [2022-04-27 13:13:03,161 INFO L290 TraceCheckUtils]: 79: Hoare triple {28626#true} ~cond := #in~cond; {28626#true} is VALID [2022-04-27 13:13:03,161 INFO L290 TraceCheckUtils]: 80: Hoare triple {28626#true} assume !(0 == ~cond); {28626#true} is VALID [2022-04-27 13:13:03,161 INFO L290 TraceCheckUtils]: 81: Hoare triple {28626#true} assume true; {28626#true} is VALID [2022-04-27 13:13:03,162 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {28626#true} {28834#(< main_~v~0 main_~c~0)} #106#return; {28834#(< main_~v~0 main_~c~0)} is VALID [2022-04-27 13:13:03,162 INFO L272 TraceCheckUtils]: 83: Hoare triple {28834#(< main_~v~0 main_~c~0)} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {28626#true} is VALID [2022-04-27 13:13:03,162 INFO L290 TraceCheckUtils]: 84: Hoare triple {28626#true} ~cond := #in~cond; {28626#true} is VALID [2022-04-27 13:13:03,162 INFO L290 TraceCheckUtils]: 85: Hoare triple {28626#true} assume !(0 == ~cond); {28626#true} is VALID [2022-04-27 13:13:03,162 INFO L290 TraceCheckUtils]: 86: Hoare triple {28626#true} assume true; {28626#true} is VALID [2022-04-27 13:13:03,162 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {28626#true} {28834#(< main_~v~0 main_~c~0)} #108#return; {28834#(< main_~v~0 main_~c~0)} is VALID [2022-04-27 13:13:03,163 INFO L290 TraceCheckUtils]: 88: Hoare triple {28834#(< main_~v~0 main_~c~0)} assume !(~c~0 >= 2 * ~v~0); {28834#(< main_~v~0 main_~c~0)} is VALID [2022-04-27 13:13:03,163 INFO L290 TraceCheckUtils]: 89: Hoare triple {28834#(< main_~v~0 main_~c~0)} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {28904#(< 0 main_~c~0)} is VALID [2022-04-27 13:13:03,163 INFO L290 TraceCheckUtils]: 90: Hoare triple {28904#(< 0 main_~c~0)} assume !false; {28904#(< 0 main_~c~0)} is VALID [2022-04-27 13:13:03,164 INFO L290 TraceCheckUtils]: 91: Hoare triple {28904#(< 0 main_~c~0)} assume !(~c~0 >= ~b~0); {28904#(< 0 main_~c~0)} is VALID [2022-04-27 13:13:03,164 INFO L290 TraceCheckUtils]: 92: Hoare triple {28904#(< 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; {28914#(< 0 main_~b~0)} is VALID [2022-04-27 13:13:03,164 INFO L290 TraceCheckUtils]: 93: Hoare triple {28914#(< 0 main_~b~0)} assume !false; {28914#(< 0 main_~b~0)} is VALID [2022-04-27 13:13:03,165 INFO L290 TraceCheckUtils]: 94: Hoare triple {28914#(< 0 main_~b~0)} assume !(0 != ~b~0); {28627#false} is VALID [2022-04-27 13:13:03,165 INFO L272 TraceCheckUtils]: 95: Hoare triple {28627#false} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {28627#false} is VALID [2022-04-27 13:13:03,165 INFO L290 TraceCheckUtils]: 96: Hoare triple {28627#false} ~cond := #in~cond; {28627#false} is VALID [2022-04-27 13:13:03,165 INFO L290 TraceCheckUtils]: 97: Hoare triple {28627#false} assume 0 == ~cond; {28627#false} is VALID [2022-04-27 13:13:03,165 INFO L290 TraceCheckUtils]: 98: Hoare triple {28627#false} assume !false; {28627#false} is VALID [2022-04-27 13:13:03,165 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 38 proven. 16 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2022-04-27 13:13:03,165 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:13:03,477 INFO L290 TraceCheckUtils]: 98: Hoare triple {28627#false} assume !false; {28627#false} is VALID [2022-04-27 13:13:03,478 INFO L290 TraceCheckUtils]: 97: Hoare triple {28627#false} assume 0 == ~cond; {28627#false} is VALID [2022-04-27 13:13:03,478 INFO L290 TraceCheckUtils]: 96: Hoare triple {28627#false} ~cond := #in~cond; {28627#false} is VALID [2022-04-27 13:13:03,478 INFO L272 TraceCheckUtils]: 95: Hoare triple {28627#false} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {28627#false} is VALID [2022-04-27 13:13:03,478 INFO L290 TraceCheckUtils]: 94: Hoare triple {28914#(< 0 main_~b~0)} assume !(0 != ~b~0); {28627#false} is VALID [2022-04-27 13:13:03,478 INFO L290 TraceCheckUtils]: 93: Hoare triple {28914#(< 0 main_~b~0)} assume !false; {28914#(< 0 main_~b~0)} is VALID [2022-04-27 13:13:03,479 INFO L290 TraceCheckUtils]: 92: Hoare triple {28904#(< 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; {28914#(< 0 main_~b~0)} is VALID [2022-04-27 13:13:03,479 INFO L290 TraceCheckUtils]: 91: Hoare triple {28904#(< 0 main_~c~0)} assume !(~c~0 >= ~b~0); {28904#(< 0 main_~c~0)} is VALID [2022-04-27 13:13:03,479 INFO L290 TraceCheckUtils]: 90: Hoare triple {28904#(< 0 main_~c~0)} assume !false; {28904#(< 0 main_~c~0)} is VALID [2022-04-27 13:13:03,480 INFO L290 TraceCheckUtils]: 89: Hoare triple {28834#(< main_~v~0 main_~c~0)} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {28904#(< 0 main_~c~0)} is VALID [2022-04-27 13:13:03,480 INFO L290 TraceCheckUtils]: 88: Hoare triple {28834#(< main_~v~0 main_~c~0)} assume !(~c~0 >= 2 * ~v~0); {28834#(< main_~v~0 main_~c~0)} is VALID [2022-04-27 13:13:03,480 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {28626#true} {28834#(< main_~v~0 main_~c~0)} #108#return; {28834#(< main_~v~0 main_~c~0)} is VALID [2022-04-27 13:13:03,481 INFO L290 TraceCheckUtils]: 86: Hoare triple {28626#true} assume true; {28626#true} is VALID [2022-04-27 13:13:03,481 INFO L290 TraceCheckUtils]: 85: Hoare triple {28626#true} assume !(0 == ~cond); {28626#true} is VALID [2022-04-27 13:13:03,481 INFO L290 TraceCheckUtils]: 84: Hoare triple {28626#true} ~cond := #in~cond; {28626#true} is VALID [2022-04-27 13:13:03,481 INFO L272 TraceCheckUtils]: 83: Hoare triple {28834#(< main_~v~0 main_~c~0)} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {28626#true} is VALID [2022-04-27 13:13:03,481 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {28626#true} {28834#(< main_~v~0 main_~c~0)} #106#return; {28834#(< main_~v~0 main_~c~0)} is VALID [2022-04-27 13:13:03,481 INFO L290 TraceCheckUtils]: 81: Hoare triple {28626#true} assume true; {28626#true} is VALID [2022-04-27 13:13:03,481 INFO L290 TraceCheckUtils]: 80: Hoare triple {28626#true} assume !(0 == ~cond); {28626#true} is VALID [2022-04-27 13:13:03,481 INFO L290 TraceCheckUtils]: 79: Hoare triple {28626#true} ~cond := #in~cond; {28626#true} is VALID [2022-04-27 13:13:03,481 INFO L272 TraceCheckUtils]: 78: Hoare triple {28834#(< main_~v~0 main_~c~0)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {28626#true} is VALID [2022-04-27 13:13:03,482 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {28626#true} {28834#(< main_~v~0 main_~c~0)} #104#return; {28834#(< main_~v~0 main_~c~0)} is VALID [2022-04-27 13:13:03,482 INFO L290 TraceCheckUtils]: 76: Hoare triple {28626#true} assume true; {28626#true} is VALID [2022-04-27 13:13:03,482 INFO L290 TraceCheckUtils]: 75: Hoare triple {28626#true} assume !(0 == ~cond); {28626#true} is VALID [2022-04-27 13:13:03,482 INFO L290 TraceCheckUtils]: 74: Hoare triple {28626#true} ~cond := #in~cond; {28626#true} is VALID [2022-04-27 13:13:03,482 INFO L272 TraceCheckUtils]: 73: Hoare triple {28834#(< main_~v~0 main_~c~0)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {28626#true} is VALID [2022-04-27 13:13:03,482 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {28626#true} {28834#(< main_~v~0 main_~c~0)} #102#return; {28834#(< main_~v~0 main_~c~0)} is VALID [2022-04-27 13:13:03,482 INFO L290 TraceCheckUtils]: 71: Hoare triple {28626#true} assume true; {28626#true} is VALID [2022-04-27 13:13:03,482 INFO L290 TraceCheckUtils]: 70: Hoare triple {28626#true} assume !(0 == ~cond); {28626#true} is VALID [2022-04-27 13:13:03,483 INFO L290 TraceCheckUtils]: 69: Hoare triple {28626#true} ~cond := #in~cond; {28626#true} is VALID [2022-04-27 13:13:03,483 INFO L272 TraceCheckUtils]: 68: Hoare triple {28834#(< main_~v~0 main_~c~0)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {28626#true} is VALID [2022-04-27 13:13:03,483 INFO L290 TraceCheckUtils]: 67: Hoare triple {28834#(< main_~v~0 main_~c~0)} assume !false; {28834#(< main_~v~0 main_~c~0)} is VALID [2022-04-27 13:13:03,483 INFO L290 TraceCheckUtils]: 66: Hoare triple {28827#(< main_~b~0 main_~c~0)} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {28834#(< main_~v~0 main_~c~0)} is VALID [2022-04-27 13:13:03,483 INFO L290 TraceCheckUtils]: 65: Hoare triple {28827#(< main_~b~0 main_~c~0)} assume !false; {28827#(< main_~b~0 main_~c~0)} is VALID [2022-04-27 13:13:03,484 INFO L290 TraceCheckUtils]: 64: Hoare triple {28820#(< main_~b~0 main_~a~0)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {28827#(< main_~b~0 main_~c~0)} is VALID [2022-04-27 13:13:03,484 INFO L290 TraceCheckUtils]: 63: Hoare triple {28820#(< main_~b~0 main_~a~0)} assume !false; {28820#(< main_~b~0 main_~a~0)} is VALID [2022-04-27 13:13:03,484 INFO L290 TraceCheckUtils]: 62: Hoare triple {28810#(< main_~c~0 main_~b~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; {28820#(< main_~b~0 main_~a~0)} is VALID [2022-04-27 13:13:03,485 INFO L290 TraceCheckUtils]: 61: Hoare triple {28810#(< main_~c~0 main_~b~0)} assume !(~c~0 >= ~b~0); {28810#(< main_~c~0 main_~b~0)} is VALID [2022-04-27 13:13:03,485 INFO L290 TraceCheckUtils]: 60: Hoare triple {28810#(< main_~c~0 main_~b~0)} assume !false; {28810#(< main_~c~0 main_~b~0)} is VALID [2022-04-27 13:13:03,485 INFO L290 TraceCheckUtils]: 59: Hoare triple {29050#(< main_~c~0 (+ main_~b~0 main_~v~0))} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {28810#(< main_~c~0 main_~b~0)} is VALID [2022-04-27 13:13:03,487 INFO L290 TraceCheckUtils]: 58: Hoare triple {28739#(<= main_~v~0 main_~b~0)} assume !(~c~0 >= 2 * ~v~0); {29050#(< main_~c~0 (+ main_~b~0 main_~v~0))} is VALID [2022-04-27 13:13:03,487 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {28626#true} {28739#(<= main_~v~0 main_~b~0)} #108#return; {28739#(<= main_~v~0 main_~b~0)} is VALID [2022-04-27 13:13:03,487 INFO L290 TraceCheckUtils]: 56: Hoare triple {28626#true} assume true; {28626#true} is VALID [2022-04-27 13:13:03,487 INFO L290 TraceCheckUtils]: 55: Hoare triple {28626#true} assume !(0 == ~cond); {28626#true} is VALID [2022-04-27 13:13:03,487 INFO L290 TraceCheckUtils]: 54: Hoare triple {28626#true} ~cond := #in~cond; {28626#true} is VALID [2022-04-27 13:13:03,487 INFO L272 TraceCheckUtils]: 53: Hoare triple {28739#(<= main_~v~0 main_~b~0)} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {28626#true} is VALID [2022-04-27 13:13:03,488 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {28626#true} {28739#(<= main_~v~0 main_~b~0)} #106#return; {28739#(<= main_~v~0 main_~b~0)} is VALID [2022-04-27 13:13:03,488 INFO L290 TraceCheckUtils]: 51: Hoare triple {28626#true} assume true; {28626#true} is VALID [2022-04-27 13:13:03,488 INFO L290 TraceCheckUtils]: 50: Hoare triple {28626#true} assume !(0 == ~cond); {28626#true} is VALID [2022-04-27 13:13:03,488 INFO L290 TraceCheckUtils]: 49: Hoare triple {28626#true} ~cond := #in~cond; {28626#true} is VALID [2022-04-27 13:13:03,488 INFO L272 TraceCheckUtils]: 48: Hoare triple {28739#(<= main_~v~0 main_~b~0)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {28626#true} is VALID [2022-04-27 13:13:03,489 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {28626#true} {28739#(<= main_~v~0 main_~b~0)} #104#return; {28739#(<= main_~v~0 main_~b~0)} is VALID [2022-04-27 13:13:03,489 INFO L290 TraceCheckUtils]: 46: Hoare triple {28626#true} assume true; {28626#true} is VALID [2022-04-27 13:13:03,489 INFO L290 TraceCheckUtils]: 45: Hoare triple {28626#true} assume !(0 == ~cond); {28626#true} is VALID [2022-04-27 13:13:03,489 INFO L290 TraceCheckUtils]: 44: Hoare triple {28626#true} ~cond := #in~cond; {28626#true} is VALID [2022-04-27 13:13:03,489 INFO L272 TraceCheckUtils]: 43: Hoare triple {28739#(<= main_~v~0 main_~b~0)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {28626#true} is VALID [2022-04-27 13:13:03,489 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {28626#true} {28739#(<= main_~v~0 main_~b~0)} #102#return; {28739#(<= main_~v~0 main_~b~0)} is VALID [2022-04-27 13:13:03,489 INFO L290 TraceCheckUtils]: 41: Hoare triple {28626#true} assume true; {28626#true} is VALID [2022-04-27 13:13:03,489 INFO L290 TraceCheckUtils]: 40: Hoare triple {28626#true} assume !(0 == ~cond); {28626#true} is VALID [2022-04-27 13:13:03,489 INFO L290 TraceCheckUtils]: 39: Hoare triple {28626#true} ~cond := #in~cond; {28626#true} is VALID [2022-04-27 13:13:03,489 INFO L272 TraceCheckUtils]: 38: Hoare triple {28739#(<= main_~v~0 main_~b~0)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {28626#true} is VALID [2022-04-27 13:13:03,490 INFO L290 TraceCheckUtils]: 37: Hoare triple {28739#(<= main_~v~0 main_~b~0)} assume !false; {28739#(<= main_~v~0 main_~b~0)} is VALID [2022-04-27 13:13:03,490 INFO L290 TraceCheckUtils]: 36: Hoare triple {28626#true} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {28739#(<= main_~v~0 main_~b~0)} is VALID [2022-04-27 13:13:03,490 INFO L290 TraceCheckUtils]: 35: Hoare triple {28626#true} assume !false; {28626#true} is VALID [2022-04-27 13:13:03,490 INFO L290 TraceCheckUtils]: 34: Hoare triple {28626#true} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {28626#true} is VALID [2022-04-27 13:13:03,490 INFO L290 TraceCheckUtils]: 33: Hoare triple {28626#true} assume !false; {28626#true} is VALID [2022-04-27 13:13:03,490 INFO L290 TraceCheckUtils]: 32: Hoare triple {28626#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; {28626#true} is VALID [2022-04-27 13:13:03,490 INFO L290 TraceCheckUtils]: 31: Hoare triple {28626#true} assume !(~c~0 >= ~b~0); {28626#true} is VALID [2022-04-27 13:13:03,490 INFO L290 TraceCheckUtils]: 30: Hoare triple {28626#true} assume !false; {28626#true} is VALID [2022-04-27 13:13:03,490 INFO L290 TraceCheckUtils]: 29: Hoare triple {28626#true} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {28626#true} is VALID [2022-04-27 13:13:03,490 INFO L290 TraceCheckUtils]: 28: Hoare triple {28626#true} assume !false; {28626#true} is VALID [2022-04-27 13:13:03,490 INFO L290 TraceCheckUtils]: 27: Hoare triple {28626#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {28626#true} is VALID [2022-04-27 13:13:03,490 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {28626#true} {28626#true} #100#return; {28626#true} is VALID [2022-04-27 13:13:03,490 INFO L290 TraceCheckUtils]: 25: Hoare triple {28626#true} assume true; {28626#true} is VALID [2022-04-27 13:13:03,490 INFO L290 TraceCheckUtils]: 24: Hoare triple {28626#true} assume !(0 == ~cond); {28626#true} is VALID [2022-04-27 13:13:03,490 INFO L290 TraceCheckUtils]: 23: Hoare triple {28626#true} ~cond := #in~cond; {28626#true} is VALID [2022-04-27 13:13:03,491 INFO L272 TraceCheckUtils]: 22: Hoare triple {28626#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {28626#true} is VALID [2022-04-27 13:13:03,491 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {28626#true} {28626#true} #98#return; {28626#true} is VALID [2022-04-27 13:13:03,491 INFO L290 TraceCheckUtils]: 20: Hoare triple {28626#true} assume true; {28626#true} is VALID [2022-04-27 13:13:03,491 INFO L290 TraceCheckUtils]: 19: Hoare triple {28626#true} assume !(0 == ~cond); {28626#true} is VALID [2022-04-27 13:13:03,491 INFO L290 TraceCheckUtils]: 18: Hoare triple {28626#true} ~cond := #in~cond; {28626#true} is VALID [2022-04-27 13:13:03,491 INFO L272 TraceCheckUtils]: 17: Hoare triple {28626#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {28626#true} is VALID [2022-04-27 13:13:03,491 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {28626#true} {28626#true} #96#return; {28626#true} is VALID [2022-04-27 13:13:03,491 INFO L290 TraceCheckUtils]: 15: Hoare triple {28626#true} assume true; {28626#true} is VALID [2022-04-27 13:13:03,491 INFO L290 TraceCheckUtils]: 14: Hoare triple {28626#true} assume !(0 == ~cond); {28626#true} is VALID [2022-04-27 13:13:03,491 INFO L290 TraceCheckUtils]: 13: Hoare triple {28626#true} ~cond := #in~cond; {28626#true} is VALID [2022-04-27 13:13:03,491 INFO L272 TraceCheckUtils]: 12: Hoare triple {28626#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 10 then 1 else 0)); {28626#true} is VALID [2022-04-27 13:13:03,491 INFO L290 TraceCheckUtils]: 11: Hoare triple {28626#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {28626#true} is VALID [2022-04-27 13:13:03,491 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {28626#true} {28626#true} #94#return; {28626#true} is VALID [2022-04-27 13:13:03,491 INFO L290 TraceCheckUtils]: 9: Hoare triple {28626#true} assume true; {28626#true} is VALID [2022-04-27 13:13:03,491 INFO L290 TraceCheckUtils]: 8: Hoare triple {28626#true} assume !(0 == ~cond); {28626#true} is VALID [2022-04-27 13:13:03,491 INFO L290 TraceCheckUtils]: 7: Hoare triple {28626#true} ~cond := #in~cond; {28626#true} is VALID [2022-04-27 13:13:03,491 INFO L272 TraceCheckUtils]: 6: Hoare triple {28626#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 10 then 1 else 0)); {28626#true} is VALID [2022-04-27 13:13:03,491 INFO L290 TraceCheckUtils]: 5: Hoare triple {28626#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;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {28626#true} is VALID [2022-04-27 13:13:03,491 INFO L272 TraceCheckUtils]: 4: Hoare triple {28626#true} call #t~ret6 := main(); {28626#true} is VALID [2022-04-27 13:13:03,491 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28626#true} {28626#true} #112#return; {28626#true} is VALID [2022-04-27 13:13:03,491 INFO L290 TraceCheckUtils]: 2: Hoare triple {28626#true} assume true; {28626#true} is VALID [2022-04-27 13:13:03,491 INFO L290 TraceCheckUtils]: 1: Hoare triple {28626#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); {28626#true} is VALID [2022-04-27 13:13:03,492 INFO L272 TraceCheckUtils]: 0: Hoare triple {28626#true} call ULTIMATE.init(); {28626#true} is VALID [2022-04-27 13:13:03,492 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 38 proven. 16 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2022-04-27 13:13:03,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:13:03,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302661500] [2022-04-27 13:13:03,492 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:13:03,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1192181308] [2022-04-27 13:13:03,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1192181308] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 13:13:03,492 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 13:13:03,492 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2022-04-27 13:13:03,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364237997] [2022-04-27 13:13:03,492 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 13:13:03,493 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 11 states have internal predecessors, (40), 4 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 99 [2022-04-27 13:13:03,493 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:13:03,493 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 11 states have internal predecessors, (40), 4 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2022-04-27 13:13:03,566 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:13:03,566 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-27 13:13:03,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:13:03,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-27 13:13:03,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-04-27 13:13:03,567 INFO L87 Difference]: Start difference. First operand 1153 states and 1839 transitions. Second operand has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 11 states have internal predecessors, (40), 4 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2022-04-27 13:13:09,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:13:09,593 INFO L93 Difference]: Finished difference Result 1367 states and 2176 transitions. [2022-04-27 13:13:09,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-04-27 13:13:09,593 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 11 states have internal predecessors, (40), 4 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 99 [2022-04-27 13:13:09,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:13:09,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 11 states have internal predecessors, (40), 4 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2022-04-27 13:13:09,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 186 transitions. [2022-04-27 13:13:09,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 11 states have internal predecessors, (40), 4 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2022-04-27 13:13:09,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 186 transitions. [2022-04-27 13:13:09,597 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 186 transitions. [2022-04-27 13:13:09,821 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 186 edges. 186 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:13:09,902 INFO L225 Difference]: With dead ends: 1367 [2022-04-27 13:13:09,902 INFO L226 Difference]: Without dead ends: 1360 [2022-04-27 13:13:09,903 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 194 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=189, Invalid=623, Unknown=0, NotChecked=0, Total=812 [2022-04-27 13:13:09,903 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 61 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 531 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 632 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-27 13:13:09,904 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 436 Invalid, 632 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 531 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-27 13:13:09,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1360 states. [2022-04-27 13:13:13,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1360 to 952. [2022-04-27 13:13:13,457 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:13:13,458 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1360 states. Second operand has 952 states, 464 states have (on average 1.3038793103448276) internal successors, (605), 466 states have internal predecessors, (605), 453 states have call successors, (453), 35 states have call predecessors, (453), 34 states have return successors, (451), 450 states have call predecessors, (451), 451 states have call successors, (451) [2022-04-27 13:13:13,459 INFO L74 IsIncluded]: Start isIncluded. First operand 1360 states. Second operand has 952 states, 464 states have (on average 1.3038793103448276) internal successors, (605), 466 states have internal predecessors, (605), 453 states have call successors, (453), 35 states have call predecessors, (453), 34 states have return successors, (451), 450 states have call predecessors, (451), 451 states have call successors, (451) [2022-04-27 13:13:13,460 INFO L87 Difference]: Start difference. First operand 1360 states. Second operand has 952 states, 464 states have (on average 1.3038793103448276) internal successors, (605), 466 states have internal predecessors, (605), 453 states have call successors, (453), 35 states have call predecessors, (453), 34 states have return successors, (451), 450 states have call predecessors, (451), 451 states have call successors, (451) [2022-04-27 13:13:13,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:13:13,529 INFO L93 Difference]: Finished difference Result 1360 states and 2169 transitions. [2022-04-27 13:13:13,529 INFO L276 IsEmpty]: Start isEmpty. Operand 1360 states and 2169 transitions. [2022-04-27 13:13:13,533 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:13:13,533 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:13:13,535 INFO L74 IsIncluded]: Start isIncluded. First operand has 952 states, 464 states have (on average 1.3038793103448276) internal successors, (605), 466 states have internal predecessors, (605), 453 states have call successors, (453), 35 states have call predecessors, (453), 34 states have return successors, (451), 450 states have call predecessors, (451), 451 states have call successors, (451) Second operand 1360 states. [2022-04-27 13:13:13,536 INFO L87 Difference]: Start difference. First operand has 952 states, 464 states have (on average 1.3038793103448276) internal successors, (605), 466 states have internal predecessors, (605), 453 states have call successors, (453), 35 states have call predecessors, (453), 34 states have return successors, (451), 450 states have call predecessors, (451), 451 states have call successors, (451) Second operand 1360 states. [2022-04-27 13:13:13,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:13:13,612 INFO L93 Difference]: Finished difference Result 1360 states and 2169 transitions. [2022-04-27 13:13:13,613 INFO L276 IsEmpty]: Start isEmpty. Operand 1360 states and 2169 transitions. [2022-04-27 13:13:13,617 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:13:13,617 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:13:13,617 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:13:13,617 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:13:13,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 952 states, 464 states have (on average 1.3038793103448276) internal successors, (605), 466 states have internal predecessors, (605), 453 states have call successors, (453), 35 states have call predecessors, (453), 34 states have return successors, (451), 450 states have call predecessors, (451), 451 states have call successors, (451) [2022-04-27 13:13:13,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 952 states to 952 states and 1509 transitions. [2022-04-27 13:13:13,665 INFO L78 Accepts]: Start accepts. Automaton has 952 states and 1509 transitions. Word has length 99 [2022-04-27 13:13:13,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:13:13,666 INFO L495 AbstractCegarLoop]: Abstraction has 952 states and 1509 transitions. [2022-04-27 13:13:13,666 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 11 states have internal predecessors, (40), 4 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2022-04-27 13:13:13,666 INFO L276 IsEmpty]: Start isEmpty. Operand 952 states and 1509 transitions. [2022-04-27 13:13:13,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-04-27 13:13:13,667 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:13:13,667 INFO L195 NwaCegarLoop]: trace histogram [14, 13, 13, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:13:13,686 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-04-27 13:13:13,883 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-04-27 13:13:13,884 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:13:13,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:13:13,884 INFO L85 PathProgramCache]: Analyzing trace with hash -851432394, now seen corresponding path program 1 times [2022-04-27 13:13:13,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:13:13,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135458388] [2022-04-27 13:13:13,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:13:13,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:13:13,897 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:13:13,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [600722409] [2022-04-27 13:13:13,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:13:13,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:13:13,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:13:13,916 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 13:13:13,919 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-04-27 13:13:13,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:13:13,974 INFO L263 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 64 conjunts are in the unsatisfiable core [2022-04-27 13:13:13,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:13:13,993 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:13:15,801 INFO L272 TraceCheckUtils]: 0: Hoare triple {35882#true} call ULTIMATE.init(); {35882#true} is VALID [2022-04-27 13:13:15,801 INFO L290 TraceCheckUtils]: 1: Hoare triple {35882#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); {35882#true} is VALID [2022-04-27 13:13:15,801 INFO L290 TraceCheckUtils]: 2: Hoare triple {35882#true} assume true; {35882#true} is VALID [2022-04-27 13:13:15,801 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35882#true} {35882#true} #112#return; {35882#true} is VALID [2022-04-27 13:13:15,801 INFO L272 TraceCheckUtils]: 4: Hoare triple {35882#true} call #t~ret6 := main(); {35882#true} is VALID [2022-04-27 13:13:15,801 INFO L290 TraceCheckUtils]: 5: Hoare triple {35882#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;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {35882#true} is VALID [2022-04-27 13:13:15,801 INFO L272 TraceCheckUtils]: 6: Hoare triple {35882#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 10 then 1 else 0)); {35882#true} is VALID [2022-04-27 13:13:15,801 INFO L290 TraceCheckUtils]: 7: Hoare triple {35882#true} ~cond := #in~cond; {35882#true} is VALID [2022-04-27 13:13:15,801 INFO L290 TraceCheckUtils]: 8: Hoare triple {35882#true} assume !(0 == ~cond); {35882#true} is VALID [2022-04-27 13:13:15,801 INFO L290 TraceCheckUtils]: 9: Hoare triple {35882#true} assume true; {35882#true} is VALID [2022-04-27 13:13:15,801 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {35882#true} {35882#true} #94#return; {35882#true} is VALID [2022-04-27 13:13:15,801 INFO L290 TraceCheckUtils]: 11: Hoare triple {35882#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {35882#true} is VALID [2022-04-27 13:13:15,801 INFO L272 TraceCheckUtils]: 12: Hoare triple {35882#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 10 then 1 else 0)); {35882#true} is VALID [2022-04-27 13:13:15,801 INFO L290 TraceCheckUtils]: 13: Hoare triple {35882#true} ~cond := #in~cond; {35882#true} is VALID [2022-04-27 13:13:15,801 INFO L290 TraceCheckUtils]: 14: Hoare triple {35882#true} assume !(0 == ~cond); {35882#true} is VALID [2022-04-27 13:13:15,802 INFO L290 TraceCheckUtils]: 15: Hoare triple {35882#true} assume true; {35882#true} is VALID [2022-04-27 13:13:15,802 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {35882#true} {35882#true} #96#return; {35882#true} is VALID [2022-04-27 13:13:15,802 INFO L272 TraceCheckUtils]: 17: Hoare triple {35882#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {35882#true} is VALID [2022-04-27 13:13:15,802 INFO L290 TraceCheckUtils]: 18: Hoare triple {35882#true} ~cond := #in~cond; {35882#true} is VALID [2022-04-27 13:13:15,802 INFO L290 TraceCheckUtils]: 19: Hoare triple {35882#true} assume !(0 == ~cond); {35882#true} is VALID [2022-04-27 13:13:15,802 INFO L290 TraceCheckUtils]: 20: Hoare triple {35882#true} assume true; {35882#true} is VALID [2022-04-27 13:13:15,802 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {35882#true} {35882#true} #98#return; {35882#true} is VALID [2022-04-27 13:13:15,802 INFO L272 TraceCheckUtils]: 22: Hoare triple {35882#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {35882#true} is VALID [2022-04-27 13:13:15,802 INFO L290 TraceCheckUtils]: 23: Hoare triple {35882#true} ~cond := #in~cond; {35882#true} is VALID [2022-04-27 13:13:15,802 INFO L290 TraceCheckUtils]: 24: Hoare triple {35882#true} assume !(0 == ~cond); {35882#true} is VALID [2022-04-27 13:13:15,802 INFO L290 TraceCheckUtils]: 25: Hoare triple {35882#true} assume true; {35882#true} is VALID [2022-04-27 13:13:15,802 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {35882#true} {35882#true} #100#return; {35882#true} is VALID [2022-04-27 13:13:15,802 INFO L290 TraceCheckUtils]: 27: Hoare triple {35882#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {35968#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:13:15,803 INFO L290 TraceCheckUtils]: 28: Hoare triple {35968#(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; {35968#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:13:15,803 INFO L290 TraceCheckUtils]: 29: Hoare triple {35968#(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);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {35975#(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-27 13:13:15,803 INFO L290 TraceCheckUtils]: 30: Hoare triple {35975#(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; {35975#(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-27 13:13:15,804 INFO L290 TraceCheckUtils]: 31: Hoare triple {35975#(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);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {35982#(and (= main_~b~0 main_~v~0) (= 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-27 13:13:15,804 INFO L290 TraceCheckUtils]: 32: Hoare triple {35982#(and (= main_~b~0 main_~v~0) (= 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; {35982#(and (= main_~b~0 main_~v~0) (= 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-27 13:13:15,804 INFO L272 TraceCheckUtils]: 33: Hoare triple {35982#(and (= main_~b~0 main_~v~0) (= 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)); {35882#true} is VALID [2022-04-27 13:13:15,804 INFO L290 TraceCheckUtils]: 34: Hoare triple {35882#true} ~cond := #in~cond; {35882#true} is VALID [2022-04-27 13:13:15,804 INFO L290 TraceCheckUtils]: 35: Hoare triple {35882#true} assume !(0 == ~cond); {35882#true} is VALID [2022-04-27 13:13:15,804 INFO L290 TraceCheckUtils]: 36: Hoare triple {35882#true} assume true; {35882#true} is VALID [2022-04-27 13:13:15,805 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {35882#true} {35982#(and (= main_~b~0 main_~v~0) (= 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))} #102#return; {35982#(and (= main_~b~0 main_~v~0) (= 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-27 13:13:15,805 INFO L272 TraceCheckUtils]: 38: Hoare triple {35982#(and (= main_~b~0 main_~v~0) (= 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)); {35882#true} is VALID [2022-04-27 13:13:15,805 INFO L290 TraceCheckUtils]: 39: Hoare triple {35882#true} ~cond := #in~cond; {36007#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:13:15,806 INFO L290 TraceCheckUtils]: 40: Hoare triple {36007#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {36011#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:13:15,806 INFO L290 TraceCheckUtils]: 41: Hoare triple {36011#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {36011#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:13:15,807 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {36011#(not (= |__VERIFIER_assert_#in~cond| 0))} {35982#(and (= main_~b~0 main_~v~0) (= 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))} #104#return; {35982#(and (= main_~b~0 main_~v~0) (= 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-27 13:13:15,807 INFO L272 TraceCheckUtils]: 43: Hoare triple {35982#(and (= main_~b~0 main_~v~0) (= 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)); {35882#true} is VALID [2022-04-27 13:13:15,807 INFO L290 TraceCheckUtils]: 44: Hoare triple {35882#true} ~cond := #in~cond; {35882#true} is VALID [2022-04-27 13:13:15,807 INFO L290 TraceCheckUtils]: 45: Hoare triple {35882#true} assume !(0 == ~cond); {35882#true} is VALID [2022-04-27 13:13:15,807 INFO L290 TraceCheckUtils]: 46: Hoare triple {35882#true} assume true; {35882#true} is VALID [2022-04-27 13:13:15,807 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {35882#true} {35982#(and (= main_~b~0 main_~v~0) (= 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))} #106#return; {35982#(and (= main_~b~0 main_~v~0) (= 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-27 13:13:15,808 INFO L272 TraceCheckUtils]: 48: Hoare triple {35982#(and (= main_~b~0 main_~v~0) (= 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 ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {35882#true} is VALID [2022-04-27 13:13:15,808 INFO L290 TraceCheckUtils]: 49: Hoare triple {35882#true} ~cond := #in~cond; {35882#true} is VALID [2022-04-27 13:13:15,808 INFO L290 TraceCheckUtils]: 50: Hoare triple {35882#true} assume !(0 == ~cond); {35882#true} is VALID [2022-04-27 13:13:15,808 INFO L290 TraceCheckUtils]: 51: Hoare triple {35882#true} assume true; {35882#true} is VALID [2022-04-27 13:13:15,808 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {35882#true} {35982#(and (= main_~b~0 main_~v~0) (= 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))} #108#return; {35982#(and (= main_~b~0 main_~v~0) (= 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-27 13:13:15,809 INFO L290 TraceCheckUtils]: 53: Hoare triple {35982#(and (= main_~b~0 main_~v~0) (= 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 >= 2 * ~v~0);~d~0 := 2 * ~d~0;~v~0 := 2 * ~v~0; {36051#(and (= main_~r~0 0) (= main_~v~0 (* main_~b~0 2)) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:13:15,810 INFO L290 TraceCheckUtils]: 54: Hoare triple {36051#(and (= main_~r~0 0) (= main_~v~0 (* main_~b~0 2)) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} assume !false; {36051#(and (= main_~r~0 0) (= main_~v~0 (* main_~b~0 2)) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:13:15,810 INFO L272 TraceCheckUtils]: 55: Hoare triple {36051#(and (= main_~r~0 0) (= main_~v~0 (* main_~b~0 2)) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= (mod main_~d~0 2) 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)); {35882#true} is VALID [2022-04-27 13:13:15,810 INFO L290 TraceCheckUtils]: 56: Hoare triple {35882#true} ~cond := #in~cond; {35882#true} is VALID [2022-04-27 13:13:15,810 INFO L290 TraceCheckUtils]: 57: Hoare triple {35882#true} assume !(0 == ~cond); {35882#true} is VALID [2022-04-27 13:13:15,810 INFO L290 TraceCheckUtils]: 58: Hoare triple {35882#true} assume true; {35882#true} is VALID [2022-04-27 13:13:15,811 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {35882#true} {36051#(and (= main_~r~0 0) (= main_~v~0 (* main_~b~0 2)) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #102#return; {36051#(and (= main_~r~0 0) (= main_~v~0 (* main_~b~0 2)) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:13:15,811 INFO L272 TraceCheckUtils]: 60: Hoare triple {36051#(and (= main_~r~0 0) (= main_~v~0 (* main_~b~0 2)) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= (mod main_~d~0 2) 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)); {35882#true} is VALID [2022-04-27 13:13:15,811 INFO L290 TraceCheckUtils]: 61: Hoare triple {35882#true} ~cond := #in~cond; {35882#true} is VALID [2022-04-27 13:13:15,811 INFO L290 TraceCheckUtils]: 62: Hoare triple {35882#true} assume !(0 == ~cond); {35882#true} is VALID [2022-04-27 13:13:15,811 INFO L290 TraceCheckUtils]: 63: Hoare triple {35882#true} assume true; {35882#true} is VALID [2022-04-27 13:13:15,811 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {35882#true} {36051#(and (= main_~r~0 0) (= main_~v~0 (* main_~b~0 2)) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #104#return; {36051#(and (= main_~r~0 0) (= main_~v~0 (* main_~b~0 2)) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:13:15,812 INFO L272 TraceCheckUtils]: 65: Hoare triple {36051#(and (= main_~r~0 0) (= main_~v~0 (* main_~b~0 2)) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= (mod main_~d~0 2) 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)); {35882#true} is VALID [2022-04-27 13:13:15,812 INFO L290 TraceCheckUtils]: 66: Hoare triple {35882#true} ~cond := #in~cond; {35882#true} is VALID [2022-04-27 13:13:15,812 INFO L290 TraceCheckUtils]: 67: Hoare triple {35882#true} assume !(0 == ~cond); {35882#true} is VALID [2022-04-27 13:13:15,812 INFO L290 TraceCheckUtils]: 68: Hoare triple {35882#true} assume true; {35882#true} is VALID [2022-04-27 13:13:15,812 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {35882#true} {36051#(and (= main_~r~0 0) (= main_~v~0 (* main_~b~0 2)) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #106#return; {36051#(and (= main_~r~0 0) (= main_~v~0 (* main_~b~0 2)) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:13:15,812 INFO L272 TraceCheckUtils]: 70: Hoare triple {36051#(and (= main_~r~0 0) (= main_~v~0 (* main_~b~0 2)) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {35882#true} is VALID [2022-04-27 13:13:15,813 INFO L290 TraceCheckUtils]: 71: Hoare triple {35882#true} ~cond := #in~cond; {36007#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:13:15,813 INFO L290 TraceCheckUtils]: 72: Hoare triple {36007#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {36011#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:13:15,813 INFO L290 TraceCheckUtils]: 73: Hoare triple {36011#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {36011#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:13:15,814 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {36011#(not (= |__VERIFIER_assert_#in~cond| 0))} {36051#(and (= main_~r~0 0) (= main_~v~0 (* main_~b~0 2)) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #108#return; {36115#(and (= main_~v~0 (* main_~d~0 main_~b~0)) (= main_~r~0 0) (= main_~v~0 (* main_~b~0 2)) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:13:15,815 INFO L290 TraceCheckUtils]: 75: Hoare triple {36115#(and (= main_~v~0 (* main_~d~0 main_~b~0)) (= main_~r~0 0) (= main_~v~0 (* main_~b~0 2)) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} assume !(~c~0 >= 2 * ~v~0); {36115#(and (= main_~v~0 (* main_~d~0 main_~b~0)) (= main_~r~0 0) (= main_~v~0 (* main_~b~0 2)) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:13:15,817 INFO L290 TraceCheckUtils]: 76: Hoare triple {36115#(and (= main_~v~0 (* main_~d~0 main_~b~0)) (= main_~r~0 0) (= main_~v~0 (* main_~b~0 2)) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {36122#(and (= (+ main_~c~0 (* main_~b~0 2)) main_~x~0) (= main_~r~0 0) (= main_~s~0 1) (= (mod main_~k~0 2) 0) (= main_~b~0 main_~y~0) (= (* main_~b~0 main_~k~0) (* main_~b~0 2)) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-27 13:13:15,817 INFO L290 TraceCheckUtils]: 77: Hoare triple {36122#(and (= (+ main_~c~0 (* main_~b~0 2)) main_~x~0) (= main_~r~0 0) (= main_~s~0 1) (= (mod main_~k~0 2) 0) (= main_~b~0 main_~y~0) (= (* main_~b~0 main_~k~0) (* main_~b~0 2)) (= main_~q~0 0) (= main_~p~0 1))} assume !false; {36122#(and (= (+ main_~c~0 (* main_~b~0 2)) main_~x~0) (= main_~r~0 0) (= main_~s~0 1) (= (mod main_~k~0 2) 0) (= main_~b~0 main_~y~0) (= (* main_~b~0 main_~k~0) (* main_~b~0 2)) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-27 13:13:15,818 INFO L290 TraceCheckUtils]: 78: Hoare triple {36122#(and (= (+ main_~c~0 (* main_~b~0 2)) main_~x~0) (= main_~r~0 0) (= main_~s~0 1) (= (mod main_~k~0 2) 0) (= main_~b~0 main_~y~0) (= (* main_~b~0 main_~k~0) (* main_~b~0 2)) (= main_~q~0 0) (= main_~p~0 1))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {36129#(and (= main_~b~0 main_~v~0) (= (+ main_~c~0 (* main_~b~0 2)) main_~x~0) (= main_~r~0 0) (= main_~s~0 1) (= (mod main_~k~0 2) 0) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= (* main_~b~0 main_~k~0) (* main_~b~0 2)) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-27 13:13:15,818 INFO L290 TraceCheckUtils]: 79: Hoare triple {36129#(and (= main_~b~0 main_~v~0) (= (+ main_~c~0 (* main_~b~0 2)) main_~x~0) (= main_~r~0 0) (= main_~s~0 1) (= (mod main_~k~0 2) 0) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= (* main_~b~0 main_~k~0) (* main_~b~0 2)) (= main_~q~0 0) (= main_~p~0 1))} assume !false; {36129#(and (= main_~b~0 main_~v~0) (= (+ main_~c~0 (* main_~b~0 2)) main_~x~0) (= main_~r~0 0) (= main_~s~0 1) (= (mod main_~k~0 2) 0) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= (* main_~b~0 main_~k~0) (* main_~b~0 2)) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-27 13:13:15,818 INFO L272 TraceCheckUtils]: 80: Hoare triple {36129#(and (= main_~b~0 main_~v~0) (= (+ main_~c~0 (* main_~b~0 2)) main_~x~0) (= main_~r~0 0) (= main_~s~0 1) (= (mod main_~k~0 2) 0) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= (* main_~b~0 main_~k~0) (* main_~b~0 2)) (= 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)); {35882#true} is VALID [2022-04-27 13:13:15,818 INFO L290 TraceCheckUtils]: 81: Hoare triple {35882#true} ~cond := #in~cond; {35882#true} is VALID [2022-04-27 13:13:15,818 INFO L290 TraceCheckUtils]: 82: Hoare triple {35882#true} assume !(0 == ~cond); {35882#true} is VALID [2022-04-27 13:13:15,818 INFO L290 TraceCheckUtils]: 83: Hoare triple {35882#true} assume true; {35882#true} is VALID [2022-04-27 13:13:15,819 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {35882#true} {36129#(and (= main_~b~0 main_~v~0) (= (+ main_~c~0 (* main_~b~0 2)) main_~x~0) (= main_~r~0 0) (= main_~s~0 1) (= (mod main_~k~0 2) 0) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= (* main_~b~0 main_~k~0) (* main_~b~0 2)) (= main_~q~0 0) (= main_~p~0 1))} #102#return; {36129#(and (= main_~b~0 main_~v~0) (= (+ main_~c~0 (* main_~b~0 2)) main_~x~0) (= main_~r~0 0) (= main_~s~0 1) (= (mod main_~k~0 2) 0) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= (* main_~b~0 main_~k~0) (* main_~b~0 2)) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-27 13:13:15,819 INFO L272 TraceCheckUtils]: 85: Hoare triple {36129#(and (= main_~b~0 main_~v~0) (= (+ main_~c~0 (* main_~b~0 2)) main_~x~0) (= main_~r~0 0) (= main_~s~0 1) (= (mod main_~k~0 2) 0) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= (* main_~b~0 main_~k~0) (* main_~b~0 2)) (= 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)); {35882#true} is VALID [2022-04-27 13:13:15,819 INFO L290 TraceCheckUtils]: 86: Hoare triple {35882#true} ~cond := #in~cond; {35882#true} is VALID [2022-04-27 13:13:15,819 INFO L290 TraceCheckUtils]: 87: Hoare triple {35882#true} assume !(0 == ~cond); {35882#true} is VALID [2022-04-27 13:13:15,819 INFO L290 TraceCheckUtils]: 88: Hoare triple {35882#true} assume true; {35882#true} is VALID [2022-04-27 13:13:15,820 INFO L284 TraceCheckUtils]: 89: Hoare quadruple {35882#true} {36129#(and (= main_~b~0 main_~v~0) (= (+ main_~c~0 (* main_~b~0 2)) main_~x~0) (= main_~r~0 0) (= main_~s~0 1) (= (mod main_~k~0 2) 0) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= (* main_~b~0 main_~k~0) (* main_~b~0 2)) (= main_~q~0 0) (= main_~p~0 1))} #104#return; {36129#(and (= main_~b~0 main_~v~0) (= (+ main_~c~0 (* main_~b~0 2)) main_~x~0) (= main_~r~0 0) (= main_~s~0 1) (= (mod main_~k~0 2) 0) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= (* main_~b~0 main_~k~0) (* main_~b~0 2)) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-27 13:13:15,820 INFO L272 TraceCheckUtils]: 90: Hoare triple {36129#(and (= main_~b~0 main_~v~0) (= (+ main_~c~0 (* main_~b~0 2)) main_~x~0) (= main_~r~0 0) (= main_~s~0 1) (= (mod main_~k~0 2) 0) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= (* main_~b~0 main_~k~0) (* main_~b~0 2)) (= main_~q~0 0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {35882#true} is VALID [2022-04-27 13:13:15,820 INFO L290 TraceCheckUtils]: 91: Hoare triple {35882#true} ~cond := #in~cond; {35882#true} is VALID [2022-04-27 13:13:15,820 INFO L290 TraceCheckUtils]: 92: Hoare triple {35882#true} assume !(0 == ~cond); {35882#true} is VALID [2022-04-27 13:13:15,820 INFO L290 TraceCheckUtils]: 93: Hoare triple {35882#true} assume true; {35882#true} is VALID [2022-04-27 13:13:15,821 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {35882#true} {36129#(and (= main_~b~0 main_~v~0) (= (+ main_~c~0 (* main_~b~0 2)) main_~x~0) (= main_~r~0 0) (= main_~s~0 1) (= (mod main_~k~0 2) 0) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= (* main_~b~0 main_~k~0) (* main_~b~0 2)) (= main_~q~0 0) (= main_~p~0 1))} #106#return; {36129#(and (= main_~b~0 main_~v~0) (= (+ main_~c~0 (* main_~b~0 2)) main_~x~0) (= main_~r~0 0) (= main_~s~0 1) (= (mod main_~k~0 2) 0) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= (* main_~b~0 main_~k~0) (* main_~b~0 2)) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-27 13:13:15,821 INFO L272 TraceCheckUtils]: 95: Hoare triple {36129#(and (= main_~b~0 main_~v~0) (= (+ main_~c~0 (* main_~b~0 2)) main_~x~0) (= main_~r~0 0) (= main_~s~0 1) (= (mod main_~k~0 2) 0) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= (* main_~b~0 main_~k~0) (* main_~b~0 2)) (= main_~q~0 0) (= main_~p~0 1))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {35882#true} is VALID [2022-04-27 13:13:15,821 INFO L290 TraceCheckUtils]: 96: Hoare triple {35882#true} ~cond := #in~cond; {36007#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:13:15,821 INFO L290 TraceCheckUtils]: 97: Hoare triple {36007#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {36011#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:13:15,822 INFO L290 TraceCheckUtils]: 98: Hoare triple {36011#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {36011#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:13:15,823 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {36011#(not (= |__VERIFIER_assert_#in~cond| 0))} {36129#(and (= main_~b~0 main_~v~0) (= (+ main_~c~0 (* main_~b~0 2)) main_~x~0) (= main_~r~0 0) (= main_~s~0 1) (= (mod main_~k~0 2) 0) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= (* main_~b~0 main_~k~0) (* main_~b~0 2)) (= main_~q~0 0) (= main_~p~0 1))} #108#return; {36193#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~y~0 main_~v~0) (= (+ (* main_~v~0 2) main_~c~0) main_~x~0) (= (mod main_~k~0 2) 0) (= main_~d~0 1) (= (* main_~v~0 2) (* main_~k~0 main_~v~0)) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-27 13:13:15,823 INFO L290 TraceCheckUtils]: 100: Hoare triple {36193#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~y~0 main_~v~0) (= (+ (* main_~v~0 2) main_~c~0) main_~x~0) (= (mod main_~k~0 2) 0) (= main_~d~0 1) (= (* main_~v~0 2) (* main_~k~0 main_~v~0)) (= main_~q~0 0) (= main_~p~0 1))} assume !(~c~0 >= 2 * ~v~0); {36193#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~y~0 main_~v~0) (= (+ (* main_~v~0 2) main_~c~0) main_~x~0) (= (mod main_~k~0 2) 0) (= main_~d~0 1) (= (* main_~v~0 2) (* main_~k~0 main_~v~0)) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-27 13:13:15,825 INFO L290 TraceCheckUtils]: 101: Hoare triple {36193#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~y~0 main_~v~0) (= (+ (* main_~v~0 2) main_~c~0) main_~x~0) (= (mod main_~k~0 2) 0) (= main_~d~0 1) (= (* main_~v~0 2) (* main_~k~0 main_~v~0)) (= main_~q~0 0) (= main_~p~0 1))} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {36200#(and (= main_~r~0 0) (= main_~s~0 1) (= (* (+ (- 1) main_~k~0) main_~y~0) (* main_~y~0 2)) (= (mod (+ main_~k~0 1) 2) 0) (= main_~q~0 0) (= main_~p~0 1) (= (+ main_~x~0 (* main_~y~0 (- 3))) main_~c~0))} is VALID [2022-04-27 13:13:15,826 INFO L290 TraceCheckUtils]: 102: Hoare triple {36200#(and (= main_~r~0 0) (= main_~s~0 1) (= (* (+ (- 1) main_~k~0) main_~y~0) (* main_~y~0 2)) (= (mod (+ main_~k~0 1) 2) 0) (= main_~q~0 0) (= main_~p~0 1) (= (+ main_~x~0 (* main_~y~0 (- 3))) main_~c~0))} assume !false; {36200#(and (= main_~r~0 0) (= main_~s~0 1) (= (* (+ (- 1) main_~k~0) main_~y~0) (* main_~y~0 2)) (= (mod (+ main_~k~0 1) 2) 0) (= main_~q~0 0) (= main_~p~0 1) (= (+ main_~x~0 (* main_~y~0 (- 3))) main_~c~0))} is VALID [2022-04-27 13:13:15,826 INFO L290 TraceCheckUtils]: 103: Hoare triple {36200#(and (= main_~r~0 0) (= main_~s~0 1) (= (* (+ (- 1) main_~k~0) main_~y~0) (* main_~y~0 2)) (= (mod (+ main_~k~0 1) 2) 0) (= main_~q~0 0) (= main_~p~0 1) (= (+ main_~x~0 (* main_~y~0 (- 3))) main_~c~0))} assume !(~c~0 >= ~b~0); {36200#(and (= main_~r~0 0) (= main_~s~0 1) (= (* (+ (- 1) main_~k~0) main_~y~0) (* main_~y~0 2)) (= (mod (+ main_~k~0 1) 2) 0) (= main_~q~0 0) (= main_~p~0 1) (= (+ main_~x~0 (* main_~y~0 (- 3))) main_~c~0))} is VALID [2022-04-27 13:13:15,828 INFO L290 TraceCheckUtils]: 104: Hoare triple {36200#(and (= main_~r~0 0) (= main_~s~0 1) (= (* (+ (- 1) main_~k~0) main_~y~0) (* main_~y~0 2)) (= (mod (+ main_~k~0 1) 2) 0) (= main_~q~0 0) (= main_~p~0 1) (= (+ main_~x~0 (* main_~y~0 (- 3))) 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; {36210#(and (= (* main_~y~0 2) (* main_~y~0 (+ (- 1) (* (- 1) main_~s~0)))) (= (mod (+ main_~s~0 1) 2) 0) (= (+ main_~x~0 (* main_~y~0 (- 3))) main_~b~0) (= main_~q~0 1))} is VALID [2022-04-27 13:13:15,828 INFO L290 TraceCheckUtils]: 105: Hoare triple {36210#(and (= (* main_~y~0 2) (* main_~y~0 (+ (- 1) (* (- 1) main_~s~0)))) (= (mod (+ main_~s~0 1) 2) 0) (= (+ main_~x~0 (* main_~y~0 (- 3))) main_~b~0) (= main_~q~0 1))} assume !false; {36210#(and (= (* main_~y~0 2) (* main_~y~0 (+ (- 1) (* (- 1) main_~s~0)))) (= (mod (+ main_~s~0 1) 2) 0) (= (+ main_~x~0 (* main_~y~0 (- 3))) main_~b~0) (= main_~q~0 1))} is VALID [2022-04-27 13:13:15,829 INFO L290 TraceCheckUtils]: 106: Hoare triple {36210#(and (= (* main_~y~0 2) (* main_~y~0 (+ (- 1) (* (- 1) main_~s~0)))) (= (mod (+ main_~s~0 1) 2) 0) (= (+ main_~x~0 (* main_~y~0 (- 3))) main_~b~0) (= main_~q~0 1))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {36210#(and (= (* main_~y~0 2) (* main_~y~0 (+ (- 1) (* (- 1) main_~s~0)))) (= (mod (+ main_~s~0 1) 2) 0) (= (+ main_~x~0 (* main_~y~0 (- 3))) main_~b~0) (= main_~q~0 1))} is VALID [2022-04-27 13:13:15,829 INFO L290 TraceCheckUtils]: 107: Hoare triple {36210#(and (= (* main_~y~0 2) (* main_~y~0 (+ (- 1) (* (- 1) main_~s~0)))) (= (mod (+ main_~s~0 1) 2) 0) (= (+ main_~x~0 (* main_~y~0 (- 3))) main_~b~0) (= main_~q~0 1))} assume !false; {36210#(and (= (* main_~y~0 2) (* main_~y~0 (+ (- 1) (* (- 1) main_~s~0)))) (= (mod (+ main_~s~0 1) 2) 0) (= (+ main_~x~0 (* main_~y~0 (- 3))) main_~b~0) (= main_~q~0 1))} is VALID [2022-04-27 13:13:15,830 INFO L290 TraceCheckUtils]: 108: Hoare triple {36210#(and (= (* main_~y~0 2) (* main_~y~0 (+ (- 1) (* (- 1) main_~s~0)))) (= (mod (+ main_~s~0 1) 2) 0) (= (+ main_~x~0 (* main_~y~0 (- 3))) main_~b~0) (= main_~q~0 1))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {36210#(and (= (* main_~y~0 2) (* main_~y~0 (+ (- 1) (* (- 1) main_~s~0)))) (= (mod (+ main_~s~0 1) 2) 0) (= (+ main_~x~0 (* main_~y~0 (- 3))) main_~b~0) (= main_~q~0 1))} is VALID [2022-04-27 13:13:15,830 INFO L290 TraceCheckUtils]: 109: Hoare triple {36210#(and (= (* main_~y~0 2) (* main_~y~0 (+ (- 1) (* (- 1) main_~s~0)))) (= (mod (+ main_~s~0 1) 2) 0) (= (+ main_~x~0 (* main_~y~0 (- 3))) main_~b~0) (= main_~q~0 1))} assume !false; {36210#(and (= (* main_~y~0 2) (* main_~y~0 (+ (- 1) (* (- 1) main_~s~0)))) (= (mod (+ main_~s~0 1) 2) 0) (= (+ main_~x~0 (* main_~y~0 (- 3))) main_~b~0) (= main_~q~0 1))} is VALID [2022-04-27 13:13:15,830 INFO L272 TraceCheckUtils]: 110: Hoare triple {36210#(and (= (* main_~y~0 2) (* main_~y~0 (+ (- 1) (* (- 1) main_~s~0)))) (= (mod (+ main_~s~0 1) 2) 0) (= (+ main_~x~0 (* main_~y~0 (- 3))) main_~b~0) (= main_~q~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {35882#true} is VALID [2022-04-27 13:13:15,830 INFO L290 TraceCheckUtils]: 111: Hoare triple {35882#true} ~cond := #in~cond; {35882#true} is VALID [2022-04-27 13:13:15,830 INFO L290 TraceCheckUtils]: 112: Hoare triple {35882#true} assume !(0 == ~cond); {35882#true} is VALID [2022-04-27 13:13:15,830 INFO L290 TraceCheckUtils]: 113: Hoare triple {35882#true} assume true; {35882#true} is VALID [2022-04-27 13:13:15,831 INFO L284 TraceCheckUtils]: 114: Hoare quadruple {35882#true} {36210#(and (= (* main_~y~0 2) (* main_~y~0 (+ (- 1) (* (- 1) main_~s~0)))) (= (mod (+ main_~s~0 1) 2) 0) (= (+ main_~x~0 (* main_~y~0 (- 3))) main_~b~0) (= main_~q~0 1))} #102#return; {36210#(and (= (* main_~y~0 2) (* main_~y~0 (+ (- 1) (* (- 1) main_~s~0)))) (= (mod (+ main_~s~0 1) 2) 0) (= (+ main_~x~0 (* main_~y~0 (- 3))) main_~b~0) (= main_~q~0 1))} is VALID [2022-04-27 13:13:15,832 INFO L272 TraceCheckUtils]: 115: Hoare triple {36210#(and (= (* main_~y~0 2) (* main_~y~0 (+ (- 1) (* (- 1) main_~s~0)))) (= (mod (+ main_~s~0 1) 2) 0) (= (+ main_~x~0 (* main_~y~0 (- 3))) main_~b~0) (= main_~q~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {36244#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:13:15,832 INFO L290 TraceCheckUtils]: 116: Hoare triple {36244#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {36248#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:13:15,832 INFO L290 TraceCheckUtils]: 117: Hoare triple {36248#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {35883#false} is VALID [2022-04-27 13:13:15,832 INFO L290 TraceCheckUtils]: 118: Hoare triple {35883#false} assume !false; {35883#false} is VALID [2022-04-27 13:13:15,833 INFO L134 CoverageAnalysis]: Checked inductivity of 404 backedges. 71 proven. 87 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [2022-04-27 13:13:15,833 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:13:46,430 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-27 13:13:50,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:13:50,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135458388] [2022-04-27 13:13:50,651 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:13:50,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [600722409] [2022-04-27 13:13:50,651 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [600722409] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 13:13:50,651 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 13:13:50,651 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2022-04-27 13:13:50,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327851172] [2022-04-27 13:13:50,651 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 13:13:50,651 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.4375) internal successors, (39), 15 states have internal predecessors, (39), 5 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 7 states have call predecessors, (18), 5 states have call successors, (18) Word has length 119 [2022-04-27 13:13:50,652 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:13:50,652 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 2.4375) internal successors, (39), 15 states have internal predecessors, (39), 5 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 7 states have call predecessors, (18), 5 states have call successors, (18) [2022-04-27 13:13:50,755 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-27 13:13:50,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-27 13:13:50,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:13:50,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-27 13:13:50,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=492, Unknown=2, NotChecked=0, Total=600 [2022-04-27 13:13:50,756 INFO L87 Difference]: Start difference. First operand 952 states and 1509 transitions. Second operand has 16 states, 16 states have (on average 2.4375) internal successors, (39), 15 states have internal predecessors, (39), 5 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 7 states have call predecessors, (18), 5 states have call successors, (18) [2022-04-27 13:14:00,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:14:00,283 INFO L93 Difference]: Finished difference Result 1151 states and 1823 transitions. [2022-04-27 13:14:00,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-27 13:14:00,283 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.4375) internal successors, (39), 15 states have internal predecessors, (39), 5 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 7 states have call predecessors, (18), 5 states have call successors, (18) Word has length 119 [2022-04-27 13:14:00,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:14:00,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 2.4375) internal successors, (39), 15 states have internal predecessors, (39), 5 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 7 states have call predecessors, (18), 5 states have call successors, (18) [2022-04-27 13:14:00,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 156 transitions. [2022-04-27 13:14:00,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 2.4375) internal successors, (39), 15 states have internal predecessors, (39), 5 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 7 states have call predecessors, (18), 5 states have call successors, (18) [2022-04-27 13:14:00,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 156 transitions. [2022-04-27 13:14:00,303 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 156 transitions. [2022-04-27 13:14:00,516 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 156 edges. 156 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:14:00,607 INFO L225 Difference]: With dead ends: 1151 [2022-04-27 13:14:00,608 INFO L226 Difference]: Without dead ends: 1149 [2022-04-27 13:14:00,608 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 161 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=204, Invalid=916, Unknown=2, NotChecked=0, Total=1122 [2022-04-27 13:14:00,609 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 58 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 937 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 1030 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 937 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-04-27 13:14:00,609 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 369 Invalid, 1030 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 937 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-04-27 13:14:00,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1149 states. [2022-04-27 13:14:06,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1149 to 1133. [2022-04-27 13:14:06,393 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:14:06,394 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1149 states. Second operand has 1133 states, 548 states have (on average 1.3083941605839415) internal successors, (717), 550 states have internal predecessors, (717), 545 states have call successors, (545), 40 states have call predecessors, (545), 39 states have return successors, (543), 542 states have call predecessors, (543), 543 states have call successors, (543) [2022-04-27 13:14:06,395 INFO L74 IsIncluded]: Start isIncluded. First operand 1149 states. Second operand has 1133 states, 548 states have (on average 1.3083941605839415) internal successors, (717), 550 states have internal predecessors, (717), 545 states have call successors, (545), 40 states have call predecessors, (545), 39 states have return successors, (543), 542 states have call predecessors, (543), 543 states have call successors, (543) [2022-04-27 13:14:06,396 INFO L87 Difference]: Start difference. First operand 1149 states. Second operand has 1133 states, 548 states have (on average 1.3083941605839415) internal successors, (717), 550 states have internal predecessors, (717), 545 states have call successors, (545), 40 states have call predecessors, (545), 39 states have return successors, (543), 542 states have call predecessors, (543), 543 states have call successors, (543) [2022-04-27 13:14:06,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:14:06,445 INFO L93 Difference]: Finished difference Result 1149 states and 1821 transitions. [2022-04-27 13:14:06,445 INFO L276 IsEmpty]: Start isEmpty. Operand 1149 states and 1821 transitions. [2022-04-27 13:14:06,448 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:14:06,448 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:14:06,450 INFO L74 IsIncluded]: Start isIncluded. First operand has 1133 states, 548 states have (on average 1.3083941605839415) internal successors, (717), 550 states have internal predecessors, (717), 545 states have call successors, (545), 40 states have call predecessors, (545), 39 states have return successors, (543), 542 states have call predecessors, (543), 543 states have call successors, (543) Second operand 1149 states. [2022-04-27 13:14:06,450 INFO L87 Difference]: Start difference. First operand has 1133 states, 548 states have (on average 1.3083941605839415) internal successors, (717), 550 states have internal predecessors, (717), 545 states have call successors, (545), 40 states have call predecessors, (545), 39 states have return successors, (543), 542 states have call predecessors, (543), 543 states have call successors, (543) Second operand 1149 states. [2022-04-27 13:14:06,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:14:06,542 INFO L93 Difference]: Finished difference Result 1149 states and 1821 transitions. [2022-04-27 13:14:06,543 INFO L276 IsEmpty]: Start isEmpty. Operand 1149 states and 1821 transitions. [2022-04-27 13:14:06,545 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:14:06,546 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:14:06,546 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:14:06,546 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:14:06,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1133 states, 548 states have (on average 1.3083941605839415) internal successors, (717), 550 states have internal predecessors, (717), 545 states have call successors, (545), 40 states have call predecessors, (545), 39 states have return successors, (543), 542 states have call predecessors, (543), 543 states have call successors, (543) [2022-04-27 13:14:06,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1133 states to 1133 states and 1805 transitions. [2022-04-27 13:14:06,614 INFO L78 Accepts]: Start accepts. Automaton has 1133 states and 1805 transitions. Word has length 119 [2022-04-27 13:14:06,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:14:06,614 INFO L495 AbstractCegarLoop]: Abstraction has 1133 states and 1805 transitions. [2022-04-27 13:14:06,614 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.4375) internal successors, (39), 15 states have internal predecessors, (39), 5 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 7 states have call predecessors, (18), 5 states have call successors, (18) [2022-04-27 13:14:06,614 INFO L276 IsEmpty]: Start isEmpty. Operand 1133 states and 1805 transitions. [2022-04-27 13:14:06,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-04-27 13:14:06,615 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:14:06,616 INFO L195 NwaCegarLoop]: trace histogram [14, 13, 13, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:14:06,653 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-04-27 13:14:06,831 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:14:06,832 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:14:06,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:14:06,832 INFO L85 PathProgramCache]: Analyzing trace with hash 65157230, now seen corresponding path program 2 times [2022-04-27 13:14:06,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:14:06,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750519096] [2022-04-27 13:14:06,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:14:06,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:14:06,851 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:14:06,851 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [366988300] [2022-04-27 13:14:06,851 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 13:14:06,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:14:06,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:14:06,857 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 13:14:06,859 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-04-27 13:14:06,923 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 13:14:06,923 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 13:14:06,925 INFO L263 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 100 conjunts are in the unsatisfiable core [2022-04-27 13:14:06,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:14:06,945 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:14:29,557 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-27 13:14:38,761 INFO L272 TraceCheckUtils]: 0: Hoare triple {42619#true} call ULTIMATE.init(); {42619#true} is VALID [2022-04-27 13:14:38,761 INFO L290 TraceCheckUtils]: 1: Hoare triple {42619#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); {42619#true} is VALID [2022-04-27 13:14:38,761 INFO L290 TraceCheckUtils]: 2: Hoare triple {42619#true} assume true; {42619#true} is VALID [2022-04-27 13:14:38,761 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42619#true} {42619#true} #112#return; {42619#true} is VALID [2022-04-27 13:14:38,761 INFO L272 TraceCheckUtils]: 4: Hoare triple {42619#true} call #t~ret6 := main(); {42619#true} is VALID [2022-04-27 13:14:38,762 INFO L290 TraceCheckUtils]: 5: Hoare triple {42619#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;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {42619#true} is VALID [2022-04-27 13:14:38,762 INFO L272 TraceCheckUtils]: 6: Hoare triple {42619#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 10 then 1 else 0)); {42619#true} is VALID [2022-04-27 13:14:38,762 INFO L290 TraceCheckUtils]: 7: Hoare triple {42619#true} ~cond := #in~cond; {42619#true} is VALID [2022-04-27 13:14:38,762 INFO L290 TraceCheckUtils]: 8: Hoare triple {42619#true} assume !(0 == ~cond); {42619#true} is VALID [2022-04-27 13:14:38,762 INFO L290 TraceCheckUtils]: 9: Hoare triple {42619#true} assume true; {42619#true} is VALID [2022-04-27 13:14:38,762 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {42619#true} {42619#true} #94#return; {42619#true} is VALID [2022-04-27 13:14:38,762 INFO L290 TraceCheckUtils]: 11: Hoare triple {42619#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {42619#true} is VALID [2022-04-27 13:14:38,762 INFO L272 TraceCheckUtils]: 12: Hoare triple {42619#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 10 then 1 else 0)); {42619#true} is VALID [2022-04-27 13:14:38,762 INFO L290 TraceCheckUtils]: 13: Hoare triple {42619#true} ~cond := #in~cond; {42619#true} is VALID [2022-04-27 13:14:38,762 INFO L290 TraceCheckUtils]: 14: Hoare triple {42619#true} assume !(0 == ~cond); {42619#true} is VALID [2022-04-27 13:14:38,762 INFO L290 TraceCheckUtils]: 15: Hoare triple {42619#true} assume true; {42619#true} is VALID [2022-04-27 13:14:38,762 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {42619#true} {42619#true} #96#return; {42619#true} is VALID [2022-04-27 13:14:38,762 INFO L272 TraceCheckUtils]: 17: Hoare triple {42619#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {42619#true} is VALID [2022-04-27 13:14:38,762 INFO L290 TraceCheckUtils]: 18: Hoare triple {42619#true} ~cond := #in~cond; {42619#true} is VALID [2022-04-27 13:14:38,762 INFO L290 TraceCheckUtils]: 19: Hoare triple {42619#true} assume !(0 == ~cond); {42619#true} is VALID [2022-04-27 13:14:38,762 INFO L290 TraceCheckUtils]: 20: Hoare triple {42619#true} assume true; {42619#true} is VALID [2022-04-27 13:14:38,762 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {42619#true} {42619#true} #98#return; {42619#true} is VALID [2022-04-27 13:14:38,762 INFO L272 TraceCheckUtils]: 22: Hoare triple {42619#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {42619#true} is VALID [2022-04-27 13:14:38,762 INFO L290 TraceCheckUtils]: 23: Hoare triple {42619#true} ~cond := #in~cond; {42619#true} is VALID [2022-04-27 13:14:38,762 INFO L290 TraceCheckUtils]: 24: Hoare triple {42619#true} assume !(0 == ~cond); {42619#true} is VALID [2022-04-27 13:14:38,762 INFO L290 TraceCheckUtils]: 25: Hoare triple {42619#true} assume true; {42619#true} is VALID [2022-04-27 13:14:38,763 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {42619#true} {42619#true} #100#return; {42619#true} is VALID [2022-04-27 13:14:38,763 INFO L290 TraceCheckUtils]: 27: Hoare triple {42619#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {42705#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:14:38,763 INFO L290 TraceCheckUtils]: 28: Hoare triple {42705#(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; {42705#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:14:38,764 INFO L290 TraceCheckUtils]: 29: Hoare triple {42705#(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);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {42712#(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-27 13:14:38,764 INFO L290 TraceCheckUtils]: 30: Hoare triple {42712#(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; {42712#(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-27 13:14:38,764 INFO L290 TraceCheckUtils]: 31: Hoare triple {42712#(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 !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {42719#(and (= main_~b~0 main_~v~0) (= 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-27 13:14:38,765 INFO L290 TraceCheckUtils]: 32: Hoare triple {42719#(and (= main_~b~0 main_~v~0) (= 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; {42719#(and (= main_~b~0 main_~v~0) (= 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-27 13:14:38,765 INFO L272 TraceCheckUtils]: 33: Hoare triple {42719#(and (= main_~b~0 main_~v~0) (= 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)); {42619#true} is VALID [2022-04-27 13:14:38,765 INFO L290 TraceCheckUtils]: 34: Hoare triple {42619#true} ~cond := #in~cond; {42729#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:14:38,765 INFO L290 TraceCheckUtils]: 35: Hoare triple {42729#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {42733#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:14:38,766 INFO L290 TraceCheckUtils]: 36: Hoare triple {42733#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {42733#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:14:38,767 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {42733#(not (= |__VERIFIER_assert_#in~cond| 0))} {42719#(and (= main_~b~0 main_~v~0) (= 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))} #102#return; {42740#(and (= main_~b~0 main_~v~0) (= 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-27 13:14:38,767 INFO L272 TraceCheckUtils]: 38: Hoare triple {42740#(and (= main_~b~0 main_~v~0) (= 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)); {42619#true} is VALID [2022-04-27 13:14:38,767 INFO L290 TraceCheckUtils]: 39: Hoare triple {42619#true} ~cond := #in~cond; {42619#true} is VALID [2022-04-27 13:14:38,767 INFO L290 TraceCheckUtils]: 40: Hoare triple {42619#true} assume !(0 == ~cond); {42619#true} is VALID [2022-04-27 13:14:38,767 INFO L290 TraceCheckUtils]: 41: Hoare triple {42619#true} assume true; {42619#true} is VALID [2022-04-27 13:14:38,767 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {42619#true} {42740#(and (= main_~b~0 main_~v~0) (= 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))} #104#return; {42740#(and (= main_~b~0 main_~v~0) (= 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-27 13:14:38,767 INFO L272 TraceCheckUtils]: 43: Hoare triple {42740#(and (= main_~b~0 main_~v~0) (= 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)); {42619#true} is VALID [2022-04-27 13:14:38,768 INFO L290 TraceCheckUtils]: 44: Hoare triple {42619#true} ~cond := #in~cond; {42619#true} is VALID [2022-04-27 13:14:38,768 INFO L290 TraceCheckUtils]: 45: Hoare triple {42619#true} assume !(0 == ~cond); {42619#true} is VALID [2022-04-27 13:14:38,768 INFO L290 TraceCheckUtils]: 46: Hoare triple {42619#true} assume true; {42619#true} is VALID [2022-04-27 13:14:38,768 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {42619#true} {42740#(and (= main_~b~0 main_~v~0) (= 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))} #106#return; {42740#(and (= main_~b~0 main_~v~0) (= 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-27 13:14:38,768 INFO L272 TraceCheckUtils]: 48: Hoare triple {42740#(and (= main_~b~0 main_~v~0) (= 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 ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {42619#true} is VALID [2022-04-27 13:14:38,768 INFO L290 TraceCheckUtils]: 49: Hoare triple {42619#true} ~cond := #in~cond; {42619#true} is VALID [2022-04-27 13:14:38,768 INFO L290 TraceCheckUtils]: 50: Hoare triple {42619#true} assume !(0 == ~cond); {42619#true} is VALID [2022-04-27 13:14:38,769 INFO L290 TraceCheckUtils]: 51: Hoare triple {42619#true} assume true; {42619#true} is VALID [2022-04-27 13:14:38,769 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {42619#true} {42740#(and (= main_~b~0 main_~v~0) (= 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))} #108#return; {42740#(and (= main_~b~0 main_~v~0) (= 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-27 13:14:38,770 INFO L290 TraceCheckUtils]: 53: Hoare triple {42740#(and (= main_~b~0 main_~v~0) (= 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 >= 2 * ~v~0); {42740#(and (= main_~b~0 main_~v~0) (= 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-27 13:14:38,770 INFO L290 TraceCheckUtils]: 54: Hoare triple {42740#(and (= main_~b~0 main_~v~0) (= 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))} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {42792#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 main_~b~0)) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-27 13:14:38,770 INFO L290 TraceCheckUtils]: 55: Hoare triple {42792#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 main_~b~0)) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~p~0 1))} assume !false; {42792#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 main_~b~0)) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-27 13:14:38,771 INFO L290 TraceCheckUtils]: 56: Hoare triple {42792#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 main_~b~0)) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~p~0 1))} assume !(~c~0 >= ~b~0); {42792#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 main_~b~0)) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-27 13:14:38,771 INFO L290 TraceCheckUtils]: 57: Hoare triple {42792#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 main_~b~0)) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 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; {42802#(and (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~x~0 (+ main_~b~0 main_~y~0)) (= main_~q~0 1))} is VALID [2022-04-27 13:14:38,772 INFO L290 TraceCheckUtils]: 58: Hoare triple {42802#(and (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~x~0 (+ main_~b~0 main_~y~0)) (= main_~q~0 1))} assume !false; {42802#(and (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~x~0 (+ main_~b~0 main_~y~0)) (= main_~q~0 1))} is VALID [2022-04-27 13:14:38,772 INFO L290 TraceCheckUtils]: 59: Hoare triple {42802#(and (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~x~0 (+ main_~b~0 main_~y~0)) (= main_~q~0 1))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {42809#(and (= main_~c~0 main_~a~0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~x~0 (+ main_~b~0 main_~y~0)) (= main_~q~0 1))} is VALID [2022-04-27 13:14:38,772 INFO L290 TraceCheckUtils]: 60: Hoare triple {42809#(and (= main_~c~0 main_~a~0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~x~0 (+ main_~b~0 main_~y~0)) (= main_~q~0 1))} assume !false; {42809#(and (= main_~c~0 main_~a~0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~x~0 (+ main_~b~0 main_~y~0)) (= main_~q~0 1))} is VALID [2022-04-27 13:14:38,773 INFO L290 TraceCheckUtils]: 61: Hoare triple {42809#(and (= main_~c~0 main_~a~0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~x~0 (+ main_~b~0 main_~y~0)) (= main_~q~0 1))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {42816#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~d~0 1) (= main_~x~0 (+ main_~b~0 main_~y~0)) (= main_~q~0 1))} is VALID [2022-04-27 13:14:38,773 INFO L290 TraceCheckUtils]: 62: Hoare triple {42816#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~d~0 1) (= main_~x~0 (+ main_~b~0 main_~y~0)) (= main_~q~0 1))} assume !false; {42816#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~d~0 1) (= main_~x~0 (+ main_~b~0 main_~y~0)) (= main_~q~0 1))} is VALID [2022-04-27 13:14:38,773 INFO L272 TraceCheckUtils]: 63: Hoare triple {42816#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~d~0 1) (= main_~x~0 (+ main_~b~0 main_~y~0)) (= main_~q~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {42619#true} is VALID [2022-04-27 13:14:38,773 INFO L290 TraceCheckUtils]: 64: Hoare triple {42619#true} ~cond := #in~cond; {42619#true} is VALID [2022-04-27 13:14:38,773 INFO L290 TraceCheckUtils]: 65: Hoare triple {42619#true} assume !(0 == ~cond); {42619#true} is VALID [2022-04-27 13:14:38,773 INFO L290 TraceCheckUtils]: 66: Hoare triple {42619#true} assume true; {42619#true} is VALID [2022-04-27 13:14:38,774 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {42619#true} {42816#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~d~0 1) (= main_~x~0 (+ main_~b~0 main_~y~0)) (= main_~q~0 1))} #102#return; {42816#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~d~0 1) (= main_~x~0 (+ main_~b~0 main_~y~0)) (= main_~q~0 1))} is VALID [2022-04-27 13:14:38,774 INFO L272 TraceCheckUtils]: 68: Hoare triple {42816#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~d~0 1) (= main_~x~0 (+ main_~b~0 main_~y~0)) (= main_~q~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {42619#true} is VALID [2022-04-27 13:14:38,774 INFO L290 TraceCheckUtils]: 69: Hoare triple {42619#true} ~cond := #in~cond; {42619#true} is VALID [2022-04-27 13:14:38,774 INFO L290 TraceCheckUtils]: 70: Hoare triple {42619#true} assume !(0 == ~cond); {42619#true} is VALID [2022-04-27 13:14:38,774 INFO L290 TraceCheckUtils]: 71: Hoare triple {42619#true} assume true; {42619#true} is VALID [2022-04-27 13:14:38,775 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {42619#true} {42816#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~d~0 1) (= main_~x~0 (+ main_~b~0 main_~y~0)) (= main_~q~0 1))} #104#return; {42816#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~d~0 1) (= main_~x~0 (+ main_~b~0 main_~y~0)) (= main_~q~0 1))} is VALID [2022-04-27 13:14:38,775 INFO L272 TraceCheckUtils]: 73: Hoare triple {42816#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~d~0 1) (= main_~x~0 (+ main_~b~0 main_~y~0)) (= main_~q~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {42619#true} is VALID [2022-04-27 13:14:38,775 INFO L290 TraceCheckUtils]: 74: Hoare triple {42619#true} ~cond := #in~cond; {42619#true} is VALID [2022-04-27 13:14:38,775 INFO L290 TraceCheckUtils]: 75: Hoare triple {42619#true} assume !(0 == ~cond); {42619#true} is VALID [2022-04-27 13:14:38,775 INFO L290 TraceCheckUtils]: 76: Hoare triple {42619#true} assume true; {42619#true} is VALID [2022-04-27 13:14:38,776 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {42619#true} {42816#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~d~0 1) (= main_~x~0 (+ main_~b~0 main_~y~0)) (= main_~q~0 1))} #106#return; {42816#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~d~0 1) (= main_~x~0 (+ main_~b~0 main_~y~0)) (= main_~q~0 1))} is VALID [2022-04-27 13:14:38,776 INFO L272 TraceCheckUtils]: 78: Hoare triple {42816#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~d~0 1) (= main_~x~0 (+ main_~b~0 main_~y~0)) (= main_~q~0 1))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {42619#true} is VALID [2022-04-27 13:14:38,776 INFO L290 TraceCheckUtils]: 79: Hoare triple {42619#true} ~cond := #in~cond; {42619#true} is VALID [2022-04-27 13:14:38,776 INFO L290 TraceCheckUtils]: 80: Hoare triple {42619#true} assume !(0 == ~cond); {42619#true} is VALID [2022-04-27 13:14:38,776 INFO L290 TraceCheckUtils]: 81: Hoare triple {42619#true} assume true; {42619#true} is VALID [2022-04-27 13:14:38,777 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {42619#true} {42816#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~d~0 1) (= main_~x~0 (+ main_~b~0 main_~y~0)) (= main_~q~0 1))} #108#return; {42816#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~d~0 1) (= main_~x~0 (+ main_~b~0 main_~y~0)) (= main_~q~0 1))} is VALID [2022-04-27 13:14:38,777 INFO L290 TraceCheckUtils]: 83: Hoare triple {42816#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~d~0 1) (= main_~x~0 (+ main_~b~0 main_~y~0)) (= main_~q~0 1))} assume !!(~c~0 >= 2 * ~v~0);~d~0 := 2 * ~d~0;~v~0 := 2 * ~v~0; {42883#(and (= main_~c~0 main_~a~0) (= main_~v~0 (* main_~b~0 2)) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~d~0 2) (= main_~x~0 (+ main_~b~0 main_~y~0)) (= main_~q~0 1))} is VALID [2022-04-27 13:14:38,778 INFO L290 TraceCheckUtils]: 84: Hoare triple {42883#(and (= main_~c~0 main_~a~0) (= main_~v~0 (* main_~b~0 2)) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~d~0 2) (= main_~x~0 (+ main_~b~0 main_~y~0)) (= main_~q~0 1))} assume !false; {42883#(and (= main_~c~0 main_~a~0) (= main_~v~0 (* main_~b~0 2)) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~d~0 2) (= main_~x~0 (+ main_~b~0 main_~y~0)) (= main_~q~0 1))} is VALID [2022-04-27 13:14:38,778 INFO L272 TraceCheckUtils]: 85: Hoare triple {42883#(and (= main_~c~0 main_~a~0) (= main_~v~0 (* main_~b~0 2)) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~d~0 2) (= main_~x~0 (+ main_~b~0 main_~y~0)) (= main_~q~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {42619#true} is VALID [2022-04-27 13:14:38,778 INFO L290 TraceCheckUtils]: 86: Hoare triple {42619#true} ~cond := #in~cond; {42729#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:14:38,778 INFO L290 TraceCheckUtils]: 87: Hoare triple {42729#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {42733#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:14:38,779 INFO L290 TraceCheckUtils]: 88: Hoare triple {42733#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {42733#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:14:38,780 INFO L284 TraceCheckUtils]: 89: Hoare quadruple {42733#(not (= |__VERIFIER_assert_#in~cond| 0))} {42883#(and (= main_~c~0 main_~a~0) (= main_~v~0 (* main_~b~0 2)) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~d~0 2) (= main_~x~0 (+ main_~b~0 main_~y~0)) (= main_~q~0 1))} #102#return; {42902#(and (= main_~v~0 (* main_~b~0 2)) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~d~0 2) (= main_~x~0 (+ main_~b~0 main_~y~0)) (= main_~q~0 1) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-27 13:14:38,780 INFO L272 TraceCheckUtils]: 90: Hoare triple {42902#(and (= main_~v~0 (* main_~b~0 2)) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~d~0 2) (= main_~x~0 (+ main_~b~0 main_~y~0)) (= main_~q~0 1) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {42619#true} is VALID [2022-04-27 13:14:38,780 INFO L290 TraceCheckUtils]: 91: Hoare triple {42619#true} ~cond := #in~cond; {42729#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:14:38,780 INFO L290 TraceCheckUtils]: 92: Hoare triple {42729#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {42733#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:14:38,780 INFO L290 TraceCheckUtils]: 93: Hoare triple {42733#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {42733#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:14:38,781 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {42733#(not (= |__VERIFIER_assert_#in~cond| 0))} {42902#(and (= main_~v~0 (* main_~b~0 2)) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~d~0 2) (= main_~x~0 (+ main_~b~0 main_~y~0)) (= main_~q~0 1) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} #104#return; {42918#(and (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~v~0 (* main_~b~0 2)) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~d~0 2) (= main_~x~0 (+ main_~b~0 main_~y~0)) (= main_~q~0 1) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-27 13:14:38,781 INFO L272 TraceCheckUtils]: 95: Hoare triple {42918#(and (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~v~0 (* main_~b~0 2)) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~d~0 2) (= main_~x~0 (+ main_~b~0 main_~y~0)) (= main_~q~0 1) (= main_~c~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)); {42619#true} is VALID [2022-04-27 13:14:38,782 INFO L290 TraceCheckUtils]: 96: Hoare triple {42619#true} ~cond := #in~cond; {42619#true} is VALID [2022-04-27 13:14:38,782 INFO L290 TraceCheckUtils]: 97: Hoare triple {42619#true} assume !(0 == ~cond); {42619#true} is VALID [2022-04-27 13:14:38,782 INFO L290 TraceCheckUtils]: 98: Hoare triple {42619#true} assume true; {42619#true} is VALID [2022-04-27 13:14:38,782 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {42619#true} {42918#(and (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~v~0 (* main_~b~0 2)) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~d~0 2) (= main_~x~0 (+ main_~b~0 main_~y~0)) (= main_~q~0 1) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} #106#return; {42918#(and (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~v~0 (* main_~b~0 2)) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~d~0 2) (= main_~x~0 (+ main_~b~0 main_~y~0)) (= main_~q~0 1) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-27 13:14:38,782 INFO L272 TraceCheckUtils]: 100: Hoare triple {42918#(and (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~v~0 (* main_~b~0 2)) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~d~0 2) (= main_~x~0 (+ main_~b~0 main_~y~0)) (= main_~q~0 1) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {42619#true} is VALID [2022-04-27 13:14:38,783 INFO L290 TraceCheckUtils]: 101: Hoare triple {42619#true} ~cond := #in~cond; {42729#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:14:38,783 INFO L290 TraceCheckUtils]: 102: Hoare triple {42729#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {42733#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:14:38,783 INFO L290 TraceCheckUtils]: 103: Hoare triple {42733#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {42733#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:14:38,784 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {42733#(not (= |__VERIFIER_assert_#in~cond| 0))} {42918#(and (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~v~0 (* main_~b~0 2)) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~d~0 2) (= main_~x~0 (+ main_~b~0 main_~y~0)) (= main_~q~0 1) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} #108#return; {42918#(and (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~v~0 (* main_~b~0 2)) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~d~0 2) (= main_~x~0 (+ main_~b~0 main_~y~0)) (= main_~q~0 1) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-27 13:14:38,785 INFO L290 TraceCheckUtils]: 105: Hoare triple {42918#(and (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~v~0 (* main_~b~0 2)) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~d~0 2) (= main_~x~0 (+ main_~b~0 main_~y~0)) (= main_~q~0 1) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} assume !(~c~0 >= 2 * ~v~0); {42918#(and (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~v~0 (* main_~b~0 2)) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~d~0 2) (= main_~x~0 (+ main_~b~0 main_~y~0)) (= main_~q~0 1) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-27 13:14:38,786 INFO L290 TraceCheckUtils]: 106: Hoare triple {42918#(and (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~v~0 (* main_~b~0 2)) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~d~0 2) (= main_~x~0 (+ main_~b~0 main_~y~0)) (= main_~q~0 1) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {42955#(and (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~p~0 0) (= main_~r~0 1) (= main_~c~0 (+ (* (- 2) main_~b~0) (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= main_~k~0 2) (= main_~x~0 (+ main_~b~0 main_~y~0)) (= main_~q~0 1))} is VALID [2022-04-27 13:14:38,786 INFO L290 TraceCheckUtils]: 107: Hoare triple {42955#(and (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~p~0 0) (= main_~r~0 1) (= main_~c~0 (+ (* (- 2) main_~b~0) (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= main_~k~0 2) (= main_~x~0 (+ main_~b~0 main_~y~0)) (= main_~q~0 1))} assume !false; {42955#(and (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~p~0 0) (= main_~r~0 1) (= main_~c~0 (+ (* (- 2) main_~b~0) (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= main_~k~0 2) (= main_~x~0 (+ main_~b~0 main_~y~0)) (= main_~q~0 1))} is VALID [2022-04-27 13:14:38,787 INFO L290 TraceCheckUtils]: 108: Hoare triple {42955#(and (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~p~0 0) (= main_~r~0 1) (= main_~c~0 (+ (* (- 2) main_~b~0) (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= main_~k~0 2) (= main_~x~0 (+ main_~b~0 main_~y~0)) (= main_~q~0 1))} assume !(~c~0 >= ~b~0); {42955#(and (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~p~0 0) (= main_~r~0 1) (= main_~c~0 (+ (* (- 2) main_~b~0) (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= main_~k~0 2) (= main_~x~0 (+ main_~b~0 main_~y~0)) (= main_~q~0 1))} is VALID [2022-04-27 13:14:38,787 INFO L290 TraceCheckUtils]: 109: Hoare triple {42955#(and (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~p~0 0) (= main_~r~0 1) (= main_~c~0 (+ (* (- 2) main_~b~0) (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= main_~k~0 2) (= main_~x~0 (+ main_~b~0 main_~y~0)) (= 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; {42965#(and (= (+ main_~a~0 main_~y~0) main_~x~0) (= main_~s~0 (+ (* (- 2) main_~r~0) 1)) (= main_~b~0 (+ main_~y~0 (* (- 2) main_~a~0))) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= (+ (* main_~p~0 2) main_~q~0) 0) (= main_~p~0 1))} is VALID [2022-04-27 13:14:38,788 INFO L290 TraceCheckUtils]: 110: Hoare triple {42965#(and (= (+ main_~a~0 main_~y~0) main_~x~0) (= main_~s~0 (+ (* (- 2) main_~r~0) 1)) (= main_~b~0 (+ main_~y~0 (* (- 2) main_~a~0))) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= (+ (* main_~p~0 2) main_~q~0) 0) (= main_~p~0 1))} assume !false; {42965#(and (= (+ main_~a~0 main_~y~0) main_~x~0) (= main_~s~0 (+ (* (- 2) main_~r~0) 1)) (= main_~b~0 (+ main_~y~0 (* (- 2) main_~a~0))) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= (+ (* main_~p~0 2) main_~q~0) 0) (= main_~p~0 1))} is VALID [2022-04-27 13:14:38,788 INFO L290 TraceCheckUtils]: 111: Hoare triple {42965#(and (= (+ main_~a~0 main_~y~0) main_~x~0) (= main_~s~0 (+ (* (- 2) main_~r~0) 1)) (= main_~b~0 (+ main_~y~0 (* (- 2) main_~a~0))) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= (+ (* main_~p~0 2) main_~q~0) 0) (= main_~p~0 1))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {42965#(and (= (+ main_~a~0 main_~y~0) main_~x~0) (= main_~s~0 (+ (* (- 2) main_~r~0) 1)) (= main_~b~0 (+ main_~y~0 (* (- 2) main_~a~0))) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= (+ (* main_~p~0 2) main_~q~0) 0) (= main_~p~0 1))} is VALID [2022-04-27 13:14:38,789 INFO L290 TraceCheckUtils]: 112: Hoare triple {42965#(and (= (+ main_~a~0 main_~y~0) main_~x~0) (= main_~s~0 (+ (* (- 2) main_~r~0) 1)) (= main_~b~0 (+ main_~y~0 (* (- 2) main_~a~0))) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= (+ (* main_~p~0 2) main_~q~0) 0) (= main_~p~0 1))} assume !false; {42965#(and (= (+ main_~a~0 main_~y~0) main_~x~0) (= main_~s~0 (+ (* (- 2) main_~r~0) 1)) (= main_~b~0 (+ main_~y~0 (* (- 2) main_~a~0))) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= (+ (* main_~p~0 2) main_~q~0) 0) (= main_~p~0 1))} is VALID [2022-04-27 13:14:38,789 INFO L290 TraceCheckUtils]: 113: Hoare triple {42965#(and (= (+ main_~a~0 main_~y~0) main_~x~0) (= main_~s~0 (+ (* (- 2) main_~r~0) 1)) (= main_~b~0 (+ main_~y~0 (* (- 2) main_~a~0))) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= (+ (* main_~p~0 2) main_~q~0) 0) (= main_~p~0 1))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {42965#(and (= (+ main_~a~0 main_~y~0) main_~x~0) (= main_~s~0 (+ (* (- 2) main_~r~0) 1)) (= main_~b~0 (+ main_~y~0 (* (- 2) main_~a~0))) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= (+ (* main_~p~0 2) main_~q~0) 0) (= main_~p~0 1))} is VALID [2022-04-27 13:14:38,789 INFO L290 TraceCheckUtils]: 114: Hoare triple {42965#(and (= (+ main_~a~0 main_~y~0) main_~x~0) (= main_~s~0 (+ (* (- 2) main_~r~0) 1)) (= main_~b~0 (+ main_~y~0 (* (- 2) main_~a~0))) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= (+ (* main_~p~0 2) main_~q~0) 0) (= main_~p~0 1))} assume !false; {42965#(and (= (+ main_~a~0 main_~y~0) main_~x~0) (= main_~s~0 (+ (* (- 2) main_~r~0) 1)) (= main_~b~0 (+ main_~y~0 (* (- 2) main_~a~0))) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= (+ (* main_~p~0 2) main_~q~0) 0) (= main_~p~0 1))} is VALID [2022-04-27 13:14:38,790 INFO L272 TraceCheckUtils]: 115: Hoare triple {42965#(and (= (+ main_~a~0 main_~y~0) main_~x~0) (= main_~s~0 (+ (* (- 2) main_~r~0) 1)) (= main_~b~0 (+ main_~y~0 (* (- 2) main_~a~0))) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= (+ (* main_~p~0 2) 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)); {42619#true} is VALID [2022-04-27 13:14:38,790 INFO L290 TraceCheckUtils]: 116: Hoare triple {42619#true} ~cond := #in~cond; {42729#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:14:38,790 INFO L290 TraceCheckUtils]: 117: Hoare triple {42729#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {42733#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:14:38,790 INFO L290 TraceCheckUtils]: 118: Hoare triple {42733#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {42733#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:14:38,794 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {42733#(not (= |__VERIFIER_assert_#in~cond| 0))} {42965#(and (= (+ main_~a~0 main_~y~0) main_~x~0) (= main_~s~0 (+ (* (- 2) main_~r~0) 1)) (= main_~b~0 (+ main_~y~0 (* (- 2) main_~a~0))) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= (+ (* main_~p~0 2) main_~q~0) 0) (= main_~p~0 1))} #102#return; {42996#(and (= main_~y~0 (+ (* main_~x~0 2) main_~b~0 (* 2 (* (div (+ (* (- 1) main_~s~0) 1) 2) main_~y~0)))) (= (+ main_~y~0 main_~x~0 (* (div (+ (* (- 1) main_~s~0) 1) 2) main_~y~0)) main_~x~0) (= (mod (+ main_~s~0 1) 2) 0) (= (+ main_~q~0 2) 0))} is VALID [2022-04-27 13:14:38,797 INFO L272 TraceCheckUtils]: 120: Hoare triple {42996#(and (= main_~y~0 (+ (* main_~x~0 2) main_~b~0 (* 2 (* (div (+ (* (- 1) main_~s~0) 1) 2) main_~y~0)))) (= (+ main_~y~0 main_~x~0 (* (div (+ (* (- 1) main_~s~0) 1) 2) main_~y~0)) main_~x~0) (= (mod (+ main_~s~0 1) 2) 0) (= (+ main_~q~0 2) 0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {43000#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:14:38,798 INFO L290 TraceCheckUtils]: 121: Hoare triple {43000#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {43004#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:14:38,798 INFO L290 TraceCheckUtils]: 122: Hoare triple {43004#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {42620#false} is VALID [2022-04-27 13:14:38,798 INFO L290 TraceCheckUtils]: 123: Hoare triple {42620#false} assume !false; {42620#false} is VALID [2022-04-27 13:14:38,799 INFO L134 CoverageAnalysis]: Checked inductivity of 417 backedges. 111 proven. 90 refuted. 0 times theorem prover too weak. 216 trivial. 0 not checked. [2022-04-27 13:14:38,799 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:15:52,234 INFO L290 TraceCheckUtils]: 123: Hoare triple {42620#false} assume !false; {42620#false} is VALID [2022-04-27 13:15:52,234 INFO L290 TraceCheckUtils]: 122: Hoare triple {43004#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {42620#false} is VALID [2022-04-27 13:15:52,235 INFO L290 TraceCheckUtils]: 121: Hoare triple {43000#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {43004#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:15:52,235 INFO L272 TraceCheckUtils]: 120: Hoare triple {43020#(= 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)); {43000#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:15:52,236 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {42733#(not (= |__VERIFIER_assert_#in~cond| 0))} {43024#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} #102#return; {43020#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 13:15:52,236 INFO L290 TraceCheckUtils]: 118: Hoare triple {42733#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {42733#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:15:52,236 INFO L290 TraceCheckUtils]: 117: Hoare triple {43034#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {42733#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:15:52,237 INFO L290 TraceCheckUtils]: 116: Hoare triple {42619#true} ~cond := #in~cond; {43034#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 13:15:52,237 INFO L272 TraceCheckUtils]: 115: Hoare triple {43024#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= 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)); {42619#true} is VALID [2022-04-27 13:15:52,237 INFO L290 TraceCheckUtils]: 114: Hoare triple {43024#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} assume !false; {43024#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} is VALID [2022-04-27 13:15:52,238 INFO L290 TraceCheckUtils]: 113: Hoare triple {43024#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {43024#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} is VALID [2022-04-27 13:15:52,238 INFO L290 TraceCheckUtils]: 112: Hoare triple {43024#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} assume !false; {43024#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} is VALID [2022-04-27 13:15:52,239 INFO L290 TraceCheckUtils]: 111: Hoare triple {43024#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {43024#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} is VALID [2022-04-27 13:15:52,239 INFO L290 TraceCheckUtils]: 110: Hoare triple {43024#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} assume !false; {43024#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} is VALID [2022-04-27 13:15:52,257 INFO L290 TraceCheckUtils]: 109: Hoare triple {43056#(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)))))} ~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; {43024#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} is VALID [2022-04-27 13:15:52,257 INFO L290 TraceCheckUtils]: 108: Hoare triple {43056#(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)))))} assume !(~c~0 >= ~b~0); {43056#(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-27 13:15:52,258 INFO L290 TraceCheckUtils]: 107: Hoare triple {43056#(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)))))} assume !false; {43056#(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-27 13:15:52,262 INFO L290 TraceCheckUtils]: 106: Hoare triple {43066#(or (= (+ main_~c~0 (* (- 1) main_~v~0)) (+ (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {43056#(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-27 13:15:52,263 INFO L290 TraceCheckUtils]: 105: Hoare triple {43066#(or (= (+ main_~c~0 (* (- 1) main_~v~0)) (+ (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} assume !(~c~0 >= 2 * ~v~0); {43066#(or (= (+ main_~c~0 (* (- 1) main_~v~0)) (+ (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is VALID [2022-04-27 13:15:52,264 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {42733#(not (= |__VERIFIER_assert_#in~cond| 0))} {43073#(or (= (+ main_~c~0 (* (- 1) main_~v~0)) (+ (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (not (= main_~v~0 (* main_~d~0 main_~b~0))))} #108#return; {43066#(or (= (+ main_~c~0 (* (- 1) main_~v~0)) (+ (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is VALID [2022-04-27 13:15:52,264 INFO L290 TraceCheckUtils]: 103: Hoare triple {42733#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {42733#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:15:52,264 INFO L290 TraceCheckUtils]: 102: Hoare triple {43034#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {42733#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:15:52,265 INFO L290 TraceCheckUtils]: 101: Hoare triple {42619#true} ~cond := #in~cond; {43034#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 13:15:52,265 INFO L272 TraceCheckUtils]: 100: Hoare triple {43073#(or (= (+ main_~c~0 (* (- 1) main_~v~0)) (+ (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (not (= main_~v~0 (* main_~d~0 main_~b~0))))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {42619#true} is VALID [2022-04-27 13:15:52,266 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {42619#true} {43073#(or (= (+ main_~c~0 (* (- 1) main_~v~0)) (+ (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (not (= main_~v~0 (* main_~d~0 main_~b~0))))} #106#return; {43073#(or (= (+ main_~c~0 (* (- 1) main_~v~0)) (+ (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (not (= main_~v~0 (* main_~d~0 main_~b~0))))} is VALID [2022-04-27 13:15:52,266 INFO L290 TraceCheckUtils]: 98: Hoare triple {42619#true} assume true; {42619#true} is VALID [2022-04-27 13:15:52,266 INFO L290 TraceCheckUtils]: 97: Hoare triple {42619#true} assume !(0 == ~cond); {42619#true} is VALID [2022-04-27 13:15:52,266 INFO L290 TraceCheckUtils]: 96: Hoare triple {42619#true} ~cond := #in~cond; {42619#true} is VALID [2022-04-27 13:15:52,266 INFO L272 TraceCheckUtils]: 95: Hoare triple {43073#(or (= (+ main_~c~0 (* (- 1) main_~v~0)) (+ (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (not (= main_~v~0 (* main_~d~0 main_~b~0))))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {42619#true} is VALID [2022-04-27 13:15:52,266 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {42619#true} {43073#(or (= (+ main_~c~0 (* (- 1) main_~v~0)) (+ (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (not (= main_~v~0 (* main_~d~0 main_~b~0))))} #104#return; {43073#(or (= (+ main_~c~0 (* (- 1) main_~v~0)) (+ (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (not (= main_~v~0 (* main_~d~0 main_~b~0))))} is VALID [2022-04-27 13:15:52,266 INFO L290 TraceCheckUtils]: 93: Hoare triple {42619#true} assume true; {42619#true} is VALID [2022-04-27 13:15:52,267 INFO L290 TraceCheckUtils]: 92: Hoare triple {42619#true} assume !(0 == ~cond); {42619#true} is VALID [2022-04-27 13:15:52,267 INFO L290 TraceCheckUtils]: 91: Hoare triple {42619#true} ~cond := #in~cond; {42619#true} is VALID [2022-04-27 13:15:52,267 INFO L272 TraceCheckUtils]: 90: Hoare triple {43073#(or (= (+ main_~c~0 (* (- 1) main_~v~0)) (+ (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (not (= main_~v~0 (* main_~d~0 main_~b~0))))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {42619#true} is VALID [2022-04-27 13:15:52,268 INFO L284 TraceCheckUtils]: 89: Hoare quadruple {42733#(not (= |__VERIFIER_assert_#in~cond| 0))} {43119#(or (= (+ main_~c~0 (* (- 1) main_~v~0)) (+ (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~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)))) (not (= main_~v~0 (* main_~d~0 main_~b~0))))} #102#return; {43073#(or (= (+ main_~c~0 (* (- 1) main_~v~0)) (+ (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (not (= main_~v~0 (* main_~d~0 main_~b~0))))} is VALID [2022-04-27 13:15:52,268 INFO L290 TraceCheckUtils]: 88: Hoare triple {42733#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {42733#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:15:52,268 INFO L290 TraceCheckUtils]: 87: Hoare triple {43034#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {42733#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:15:52,268 INFO L290 TraceCheckUtils]: 86: Hoare triple {42619#true} ~cond := #in~cond; {43034#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 13:15:52,269 INFO L272 TraceCheckUtils]: 85: Hoare triple {43119#(or (= (+ main_~c~0 (* (- 1) main_~v~0)) (+ (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~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)))) (not (= main_~v~0 (* main_~d~0 main_~b~0))))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {42619#true} is VALID [2022-04-27 13:15:52,269 INFO L290 TraceCheckUtils]: 84: Hoare triple {43119#(or (= (+ main_~c~0 (* (- 1) main_~v~0)) (+ (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~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)))) (not (= main_~v~0 (* main_~d~0 main_~b~0))))} assume !false; {43119#(or (= (+ main_~c~0 (* (- 1) main_~v~0)) (+ (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~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)))) (not (= main_~v~0 (* main_~d~0 main_~b~0))))} is VALID [2022-04-27 13:15:52,454 INFO L290 TraceCheckUtils]: 83: Hoare triple {43119#(or (= (+ main_~c~0 (* (- 1) main_~v~0)) (+ (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~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)))) (not (= main_~v~0 (* main_~d~0 main_~b~0))))} assume !!(~c~0 >= 2 * ~v~0);~d~0 := 2 * ~d~0;~v~0 := 2 * ~v~0; {43119#(or (= (+ main_~c~0 (* (- 1) main_~v~0)) (+ (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~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)))) (not (= main_~v~0 (* main_~d~0 main_~b~0))))} is VALID [2022-04-27 13:15:52,455 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {42619#true} {43119#(or (= (+ main_~c~0 (* (- 1) main_~v~0)) (+ (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~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)))) (not (= main_~v~0 (* main_~d~0 main_~b~0))))} #108#return; {43119#(or (= (+ main_~c~0 (* (- 1) main_~v~0)) (+ (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~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)))) (not (= main_~v~0 (* main_~d~0 main_~b~0))))} is VALID [2022-04-27 13:15:52,455 INFO L290 TraceCheckUtils]: 81: Hoare triple {42619#true} assume true; {42619#true} is VALID [2022-04-27 13:15:52,455 INFO L290 TraceCheckUtils]: 80: Hoare triple {42619#true} assume !(0 == ~cond); {42619#true} is VALID [2022-04-27 13:15:52,455 INFO L290 TraceCheckUtils]: 79: Hoare triple {42619#true} ~cond := #in~cond; {42619#true} is VALID [2022-04-27 13:15:52,455 INFO L272 TraceCheckUtils]: 78: Hoare triple {43119#(or (= (+ main_~c~0 (* (- 1) main_~v~0)) (+ (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~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)))) (not (= main_~v~0 (* main_~d~0 main_~b~0))))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {42619#true} is VALID [2022-04-27 13:15:52,456 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {42619#true} {43119#(or (= (+ main_~c~0 (* (- 1) main_~v~0)) (+ (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~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)))) (not (= main_~v~0 (* main_~d~0 main_~b~0))))} #106#return; {43119#(or (= (+ main_~c~0 (* (- 1) main_~v~0)) (+ (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~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)))) (not (= main_~v~0 (* main_~d~0 main_~b~0))))} is VALID [2022-04-27 13:15:52,456 INFO L290 TraceCheckUtils]: 76: Hoare triple {42619#true} assume true; {42619#true} is VALID [2022-04-27 13:15:52,456 INFO L290 TraceCheckUtils]: 75: Hoare triple {42619#true} assume !(0 == ~cond); {42619#true} is VALID [2022-04-27 13:15:52,456 INFO L290 TraceCheckUtils]: 74: Hoare triple {42619#true} ~cond := #in~cond; {42619#true} is VALID [2022-04-27 13:15:52,456 INFO L272 TraceCheckUtils]: 73: Hoare triple {43119#(or (= (+ main_~c~0 (* (- 1) main_~v~0)) (+ (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~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)))) (not (= main_~v~0 (* main_~d~0 main_~b~0))))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {42619#true} is VALID [2022-04-27 13:15:52,456 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {42619#true} {43119#(or (= (+ main_~c~0 (* (- 1) main_~v~0)) (+ (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~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)))) (not (= main_~v~0 (* main_~d~0 main_~b~0))))} #104#return; {43119#(or (= (+ main_~c~0 (* (- 1) main_~v~0)) (+ (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~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)))) (not (= main_~v~0 (* main_~d~0 main_~b~0))))} is VALID [2022-04-27 13:15:52,457 INFO L290 TraceCheckUtils]: 71: Hoare triple {42619#true} assume true; {42619#true} is VALID [2022-04-27 13:15:52,457 INFO L290 TraceCheckUtils]: 70: Hoare triple {42619#true} assume !(0 == ~cond); {42619#true} is VALID [2022-04-27 13:15:52,457 INFO L290 TraceCheckUtils]: 69: Hoare triple {42619#true} ~cond := #in~cond; {42619#true} is VALID [2022-04-27 13:15:52,457 INFO L272 TraceCheckUtils]: 68: Hoare triple {43119#(or (= (+ main_~c~0 (* (- 1) main_~v~0)) (+ (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~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)))) (not (= main_~v~0 (* main_~d~0 main_~b~0))))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {42619#true} is VALID [2022-04-27 13:15:52,457 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {42619#true} {43119#(or (= (+ main_~c~0 (* (- 1) main_~v~0)) (+ (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~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)))) (not (= main_~v~0 (* main_~d~0 main_~b~0))))} #102#return; {43119#(or (= (+ main_~c~0 (* (- 1) main_~v~0)) (+ (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~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)))) (not (= main_~v~0 (* main_~d~0 main_~b~0))))} is VALID [2022-04-27 13:15:52,457 INFO L290 TraceCheckUtils]: 66: Hoare triple {42619#true} assume true; {42619#true} is VALID [2022-04-27 13:15:52,458 INFO L290 TraceCheckUtils]: 65: Hoare triple {42619#true} assume !(0 == ~cond); {42619#true} is VALID [2022-04-27 13:15:52,458 INFO L290 TraceCheckUtils]: 64: Hoare triple {42619#true} ~cond := #in~cond; {42619#true} is VALID [2022-04-27 13:15:52,458 INFO L272 TraceCheckUtils]: 63: Hoare triple {43119#(or (= (+ main_~c~0 (* (- 1) main_~v~0)) (+ (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~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)))) (not (= main_~v~0 (* main_~d~0 main_~b~0))))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {42619#true} is VALID [2022-04-27 13:15:52,458 INFO L290 TraceCheckUtils]: 62: Hoare triple {43119#(or (= (+ main_~c~0 (* (- 1) main_~v~0)) (+ (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~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)))) (not (= main_~v~0 (* main_~d~0 main_~b~0))))} assume !false; {43119#(or (= (+ main_~c~0 (* (- 1) main_~v~0)) (+ (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~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)))) (not (= main_~v~0 (* main_~d~0 main_~b~0))))} is VALID [2022-04-27 13:15:52,459 INFO L290 TraceCheckUtils]: 61: Hoare triple {43204#(or (= (+ (* 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)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {43119#(or (= (+ main_~c~0 (* (- 1) main_~v~0)) (+ (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~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)))) (not (= main_~v~0 (* main_~d~0 main_~b~0))))} is VALID [2022-04-27 13:15:52,459 INFO L290 TraceCheckUtils]: 60: Hoare triple {43204#(or (= (+ (* 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)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} assume !false; {43204#(or (= (+ (* 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)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is VALID [2022-04-27 13:15:52,461 INFO L290 TraceCheckUtils]: 59: Hoare triple {42619#true} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {43204#(or (= (+ (* 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)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is VALID [2022-04-27 13:15:52,461 INFO L290 TraceCheckUtils]: 58: Hoare triple {42619#true} assume !false; {42619#true} is VALID [2022-04-27 13:15:52,461 INFO L290 TraceCheckUtils]: 57: Hoare triple {42619#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; {42619#true} is VALID [2022-04-27 13:15:52,461 INFO L290 TraceCheckUtils]: 56: Hoare triple {42619#true} assume !(~c~0 >= ~b~0); {42619#true} is VALID [2022-04-27 13:15:52,461 INFO L290 TraceCheckUtils]: 55: Hoare triple {42619#true} assume !false; {42619#true} is VALID [2022-04-27 13:15:52,461 INFO L290 TraceCheckUtils]: 54: Hoare triple {42619#true} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {42619#true} is VALID [2022-04-27 13:15:52,461 INFO L290 TraceCheckUtils]: 53: Hoare triple {42619#true} assume !(~c~0 >= 2 * ~v~0); {42619#true} is VALID [2022-04-27 13:15:52,462 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {42619#true} {42619#true} #108#return; {42619#true} is VALID [2022-04-27 13:15:52,462 INFO L290 TraceCheckUtils]: 51: Hoare triple {42619#true} assume true; {42619#true} is VALID [2022-04-27 13:15:52,462 INFO L290 TraceCheckUtils]: 50: Hoare triple {42619#true} assume !(0 == ~cond); {42619#true} is VALID [2022-04-27 13:15:52,462 INFO L290 TraceCheckUtils]: 49: Hoare triple {42619#true} ~cond := #in~cond; {42619#true} is VALID [2022-04-27 13:15:52,462 INFO L272 TraceCheckUtils]: 48: Hoare triple {42619#true} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {42619#true} is VALID [2022-04-27 13:15:52,462 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {42619#true} {42619#true} #106#return; {42619#true} is VALID [2022-04-27 13:15:52,462 INFO L290 TraceCheckUtils]: 46: Hoare triple {42619#true} assume true; {42619#true} is VALID [2022-04-27 13:15:52,462 INFO L290 TraceCheckUtils]: 45: Hoare triple {42619#true} assume !(0 == ~cond); {42619#true} is VALID [2022-04-27 13:15:52,462 INFO L290 TraceCheckUtils]: 44: Hoare triple {42619#true} ~cond := #in~cond; {42619#true} is VALID [2022-04-27 13:15:52,462 INFO L272 TraceCheckUtils]: 43: Hoare triple {42619#true} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {42619#true} is VALID [2022-04-27 13:15:52,462 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {42619#true} {42619#true} #104#return; {42619#true} is VALID [2022-04-27 13:15:52,462 INFO L290 TraceCheckUtils]: 41: Hoare triple {42619#true} assume true; {42619#true} is VALID [2022-04-27 13:15:52,462 INFO L290 TraceCheckUtils]: 40: Hoare triple {42619#true} assume !(0 == ~cond); {42619#true} is VALID [2022-04-27 13:15:52,462 INFO L290 TraceCheckUtils]: 39: Hoare triple {42619#true} ~cond := #in~cond; {42619#true} is VALID [2022-04-27 13:15:52,462 INFO L272 TraceCheckUtils]: 38: Hoare triple {42619#true} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {42619#true} is VALID [2022-04-27 13:15:52,462 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {42619#true} {42619#true} #102#return; {42619#true} is VALID [2022-04-27 13:15:52,462 INFO L290 TraceCheckUtils]: 36: Hoare triple {42619#true} assume true; {42619#true} is VALID [2022-04-27 13:15:52,462 INFO L290 TraceCheckUtils]: 35: Hoare triple {42619#true} assume !(0 == ~cond); {42619#true} is VALID [2022-04-27 13:15:52,462 INFO L290 TraceCheckUtils]: 34: Hoare triple {42619#true} ~cond := #in~cond; {42619#true} is VALID [2022-04-27 13:15:52,462 INFO L272 TraceCheckUtils]: 33: Hoare triple {42619#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {42619#true} is VALID [2022-04-27 13:15:52,462 INFO L290 TraceCheckUtils]: 32: Hoare triple {42619#true} assume !false; {42619#true} is VALID [2022-04-27 13:15:52,462 INFO L290 TraceCheckUtils]: 31: Hoare triple {42619#true} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {42619#true} is VALID [2022-04-27 13:15:52,462 INFO L290 TraceCheckUtils]: 30: Hoare triple {42619#true} assume !false; {42619#true} is VALID [2022-04-27 13:15:52,463 INFO L290 TraceCheckUtils]: 29: Hoare triple {42619#true} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {42619#true} is VALID [2022-04-27 13:15:52,463 INFO L290 TraceCheckUtils]: 28: Hoare triple {42619#true} assume !false; {42619#true} is VALID [2022-04-27 13:15:52,463 INFO L290 TraceCheckUtils]: 27: Hoare triple {42619#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {42619#true} is VALID [2022-04-27 13:15:52,463 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {42619#true} {42619#true} #100#return; {42619#true} is VALID [2022-04-27 13:15:52,463 INFO L290 TraceCheckUtils]: 25: Hoare triple {42619#true} assume true; {42619#true} is VALID [2022-04-27 13:15:52,463 INFO L290 TraceCheckUtils]: 24: Hoare triple {42619#true} assume !(0 == ~cond); {42619#true} is VALID [2022-04-27 13:15:52,463 INFO L290 TraceCheckUtils]: 23: Hoare triple {42619#true} ~cond := #in~cond; {42619#true} is VALID [2022-04-27 13:15:52,463 INFO L272 TraceCheckUtils]: 22: Hoare triple {42619#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {42619#true} is VALID [2022-04-27 13:15:52,463 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {42619#true} {42619#true} #98#return; {42619#true} is VALID [2022-04-27 13:15:52,463 INFO L290 TraceCheckUtils]: 20: Hoare triple {42619#true} assume true; {42619#true} is VALID [2022-04-27 13:15:52,463 INFO L290 TraceCheckUtils]: 19: Hoare triple {42619#true} assume !(0 == ~cond); {42619#true} is VALID [2022-04-27 13:15:52,463 INFO L290 TraceCheckUtils]: 18: Hoare triple {42619#true} ~cond := #in~cond; {42619#true} is VALID [2022-04-27 13:15:52,463 INFO L272 TraceCheckUtils]: 17: Hoare triple {42619#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {42619#true} is VALID [2022-04-27 13:15:52,463 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {42619#true} {42619#true} #96#return; {42619#true} is VALID [2022-04-27 13:15:52,463 INFO L290 TraceCheckUtils]: 15: Hoare triple {42619#true} assume true; {42619#true} is VALID [2022-04-27 13:15:52,463 INFO L290 TraceCheckUtils]: 14: Hoare triple {42619#true} assume !(0 == ~cond); {42619#true} is VALID [2022-04-27 13:15:52,463 INFO L290 TraceCheckUtils]: 13: Hoare triple {42619#true} ~cond := #in~cond; {42619#true} is VALID [2022-04-27 13:15:52,463 INFO L272 TraceCheckUtils]: 12: Hoare triple {42619#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 10 then 1 else 0)); {42619#true} is VALID [2022-04-27 13:15:52,463 INFO L290 TraceCheckUtils]: 11: Hoare triple {42619#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {42619#true} is VALID [2022-04-27 13:15:52,463 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {42619#true} {42619#true} #94#return; {42619#true} is VALID [2022-04-27 13:15:52,463 INFO L290 TraceCheckUtils]: 9: Hoare triple {42619#true} assume true; {42619#true} is VALID [2022-04-27 13:15:52,464 INFO L290 TraceCheckUtils]: 8: Hoare triple {42619#true} assume !(0 == ~cond); {42619#true} is VALID [2022-04-27 13:15:52,464 INFO L290 TraceCheckUtils]: 7: Hoare triple {42619#true} ~cond := #in~cond; {42619#true} is VALID [2022-04-27 13:15:52,464 INFO L272 TraceCheckUtils]: 6: Hoare triple {42619#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 10 then 1 else 0)); {42619#true} is VALID [2022-04-27 13:15:52,464 INFO L290 TraceCheckUtils]: 5: Hoare triple {42619#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;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {42619#true} is VALID [2022-04-27 13:15:52,464 INFO L272 TraceCheckUtils]: 4: Hoare triple {42619#true} call #t~ret6 := main(); {42619#true} is VALID [2022-04-27 13:15:52,464 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42619#true} {42619#true} #112#return; {42619#true} is VALID [2022-04-27 13:15:52,464 INFO L290 TraceCheckUtils]: 2: Hoare triple {42619#true} assume true; {42619#true} is VALID [2022-04-27 13:15:52,464 INFO L290 TraceCheckUtils]: 1: Hoare triple {42619#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); {42619#true} is VALID [2022-04-27 13:15:52,464 INFO L272 TraceCheckUtils]: 0: Hoare triple {42619#true} call ULTIMATE.init(); {42619#true} is VALID [2022-04-27 13:15:52,464 INFO L134 CoverageAnalysis]: Checked inductivity of 417 backedges. 146 proven. 19 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2022-04-27 13:15:52,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:15:52,465 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750519096] [2022-04-27 13:15:52,465 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:15:52,465 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [366988300] [2022-04-27 13:15:52,465 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [366988300] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 13:15:52,465 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 13:15:52,465 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 13] total 28 [2022-04-27 13:15:52,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026667753] [2022-04-27 13:15:52,465 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 13:15:52,465 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 24 states have (on average 2.9583333333333335) internal successors, (71), 23 states have internal predecessors, (71), 13 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (31), 10 states have call predecessors, (31), 11 states have call successors, (31) Word has length 124 [2022-04-27 13:15:52,466 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:15:52,466 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 28 states, 24 states have (on average 2.9583333333333335) internal successors, (71), 23 states have internal predecessors, (71), 13 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (31), 10 states have call predecessors, (31), 11 states have call successors, (31) [2022-04-27 13:15:53,063 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 135 edges. 135 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:15:53,063 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-04-27 13:15:53,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:15:53,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-04-27 13:15:53,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=621, Unknown=0, NotChecked=0, Total=756 [2022-04-27 13:15:53,064 INFO L87 Difference]: Start difference. First operand 1133 states and 1805 transitions. Second operand has 28 states, 24 states have (on average 2.9583333333333335) internal successors, (71), 23 states have internal predecessors, (71), 13 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (31), 10 states have call predecessors, (31), 11 states have call successors, (31) [2022-04-27 13:16:00,819 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-27 13:16:02,821 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-27 13:16:04,827 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-27 13:16:12,376 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-27 13:16:30,625 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 13:16:32,630 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-27 13:16:37,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:16:37,439 INFO L93 Difference]: Finished difference Result 1358 states and 2148 transitions. [2022-04-27 13:16:37,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-04-27 13:16:37,439 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 24 states have (on average 2.9583333333333335) internal successors, (71), 23 states have internal predecessors, (71), 13 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (31), 10 states have call predecessors, (31), 11 states have call successors, (31) Word has length 124 [2022-04-27 13:16:37,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:16:37,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 24 states have (on average 2.9583333333333335) internal successors, (71), 23 states have internal predecessors, (71), 13 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (31), 10 states have call predecessors, (31), 11 states have call successors, (31) [2022-04-27 13:16:37,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 205 transitions. [2022-04-27 13:16:37,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 24 states have (on average 2.9583333333333335) internal successors, (71), 23 states have internal predecessors, (71), 13 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (31), 10 states have call predecessors, (31), 11 states have call successors, (31) [2022-04-27 13:16:37,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 205 transitions. [2022-04-27 13:16:37,443 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 205 transitions. [2022-04-27 13:16:43,476 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 205 edges. 205 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:16:43,557 INFO L225 Difference]: With dead ends: 1358 [2022-04-27 13:16:43,558 INFO L226 Difference]: Without dead ends: 1356 [2022-04-27 13:16:43,558 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 226 SyntacticMatches, 4 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 477 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=396, Invalid=1766, Unknown=0, NotChecked=0, Total=2162 [2022-04-27 13:16:43,559 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 106 mSDsluCounter, 409 mSDsCounter, 0 mSdLazyCounter, 1488 mSolverCounterSat, 284 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 23.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 466 SdHoareTripleChecker+Invalid, 1776 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 284 IncrementalHoareTripleChecker+Valid, 1488 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 23.9s IncrementalHoareTripleChecker+Time [2022-04-27 13:16:43,559 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 466 Invalid, 1776 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [284 Valid, 1488 Invalid, 4 Unknown, 0 Unchecked, 23.9s Time] [2022-04-27 13:16:43,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1356 states. [2022-04-27 13:16:49,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1356 to 1315. [2022-04-27 13:16:49,456 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:16:49,457 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1356 states. Second operand has 1315 states, 632 states have (on average 1.3117088607594938) internal successors, (829), 634 states have internal predecessors, (829), 637 states have call successors, (637), 46 states have call predecessors, (637), 45 states have return successors, (635), 634 states have call predecessors, (635), 635 states have call successors, (635) [2022-04-27 13:16:49,458 INFO L74 IsIncluded]: Start isIncluded. First operand 1356 states. Second operand has 1315 states, 632 states have (on average 1.3117088607594938) internal successors, (829), 634 states have internal predecessors, (829), 637 states have call successors, (637), 46 states have call predecessors, (637), 45 states have return successors, (635), 634 states have call predecessors, (635), 635 states have call successors, (635) [2022-04-27 13:16:49,459 INFO L87 Difference]: Start difference. First operand 1356 states. Second operand has 1315 states, 632 states have (on average 1.3117088607594938) internal successors, (829), 634 states have internal predecessors, (829), 637 states have call successors, (637), 46 states have call predecessors, (637), 45 states have return successors, (635), 634 states have call predecessors, (635), 635 states have call successors, (635) [2022-04-27 13:16:49,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:16:49,528 INFO L93 Difference]: Finished difference Result 1356 states and 2146 transitions. [2022-04-27 13:16:49,528 INFO L276 IsEmpty]: Start isEmpty. Operand 1356 states and 2146 transitions. [2022-04-27 13:16:49,532 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:16:49,532 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:16:49,533 INFO L74 IsIncluded]: Start isIncluded. First operand has 1315 states, 632 states have (on average 1.3117088607594938) internal successors, (829), 634 states have internal predecessors, (829), 637 states have call successors, (637), 46 states have call predecessors, (637), 45 states have return successors, (635), 634 states have call predecessors, (635), 635 states have call successors, (635) Second operand 1356 states. [2022-04-27 13:16:49,534 INFO L87 Difference]: Start difference. First operand has 1315 states, 632 states have (on average 1.3117088607594938) internal successors, (829), 634 states have internal predecessors, (829), 637 states have call successors, (637), 46 states have call predecessors, (637), 45 states have return successors, (635), 634 states have call predecessors, (635), 635 states have call successors, (635) Second operand 1356 states. [2022-04-27 13:16:49,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:16:49,599 INFO L93 Difference]: Finished difference Result 1356 states and 2146 transitions. [2022-04-27 13:16:49,599 INFO L276 IsEmpty]: Start isEmpty. Operand 1356 states and 2146 transitions. [2022-04-27 13:16:49,602 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:16:49,602 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:16:49,602 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:16:49,602 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:16:49,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1315 states, 632 states have (on average 1.3117088607594938) internal successors, (829), 634 states have internal predecessors, (829), 637 states have call successors, (637), 46 states have call predecessors, (637), 45 states have return successors, (635), 634 states have call predecessors, (635), 635 states have call successors, (635) [2022-04-27 13:16:49,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1315 states to 1315 states and 2101 transitions. [2022-04-27 13:16:49,688 INFO L78 Accepts]: Start accepts. Automaton has 1315 states and 2101 transitions. Word has length 124 [2022-04-27 13:16:49,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:16:49,688 INFO L495 AbstractCegarLoop]: Abstraction has 1315 states and 2101 transitions. [2022-04-27 13:16:49,688 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 24 states have (on average 2.9583333333333335) internal successors, (71), 23 states have internal predecessors, (71), 13 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (31), 10 states have call predecessors, (31), 11 states have call successors, (31) [2022-04-27 13:16:49,688 INFO L276 IsEmpty]: Start isEmpty. Operand 1315 states and 2101 transitions. [2022-04-27 13:16:49,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-04-27 13:16:49,689 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:16:49,690 INFO L195 NwaCegarLoop]: trace histogram [17, 16, 16, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 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-27 13:16:49,709 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-04-27 13:16:49,904 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:16:49,904 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:16:49,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:16:49,904 INFO L85 PathProgramCache]: Analyzing trace with hash -1937049344, now seen corresponding path program 2 times [2022-04-27 13:16:49,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:16:49,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959512275] [2022-04-27 13:16:49,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:16:49,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:16:49,919 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:16:49,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1515045960] [2022-04-27 13:16:49,919 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 13:16:49,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:16:49,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:16:49,923 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 13:16:49,924 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-04-27 13:16:50,012 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 13:16:50,012 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 13:16:50,014 INFO L263 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 104 conjunts are in the unsatisfiable core [2022-04-27 13:16:50,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:16:50,043 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:17:10,579 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-27 13:17:18,001 INFO L272 TraceCheckUtils]: 0: Hoare triple {50640#true} call ULTIMATE.init(); {50640#true} is VALID [2022-04-27 13:17:18,001 INFO L290 TraceCheckUtils]: 1: Hoare triple {50640#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); {50640#true} is VALID [2022-04-27 13:17:18,001 INFO L290 TraceCheckUtils]: 2: Hoare triple {50640#true} assume true; {50640#true} is VALID [2022-04-27 13:17:18,001 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {50640#true} {50640#true} #112#return; {50640#true} is VALID [2022-04-27 13:17:18,002 INFO L272 TraceCheckUtils]: 4: Hoare triple {50640#true} call #t~ret6 := main(); {50640#true} is VALID [2022-04-27 13:17:18,002 INFO L290 TraceCheckUtils]: 5: Hoare triple {50640#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;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {50640#true} is VALID [2022-04-27 13:17:18,002 INFO L272 TraceCheckUtils]: 6: Hoare triple {50640#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 10 then 1 else 0)); {50640#true} is VALID [2022-04-27 13:17:18,002 INFO L290 TraceCheckUtils]: 7: Hoare triple {50640#true} ~cond := #in~cond; {50640#true} is VALID [2022-04-27 13:17:18,002 INFO L290 TraceCheckUtils]: 8: Hoare triple {50640#true} assume !(0 == ~cond); {50640#true} is VALID [2022-04-27 13:17:18,002 INFO L290 TraceCheckUtils]: 9: Hoare triple {50640#true} assume true; {50640#true} is VALID [2022-04-27 13:17:18,002 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {50640#true} {50640#true} #94#return; {50640#true} is VALID [2022-04-27 13:17:18,002 INFO L290 TraceCheckUtils]: 11: Hoare triple {50640#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {50640#true} is VALID [2022-04-27 13:17:18,002 INFO L272 TraceCheckUtils]: 12: Hoare triple {50640#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 10 then 1 else 0)); {50640#true} is VALID [2022-04-27 13:17:18,002 INFO L290 TraceCheckUtils]: 13: Hoare triple {50640#true} ~cond := #in~cond; {50640#true} is VALID [2022-04-27 13:17:18,002 INFO L290 TraceCheckUtils]: 14: Hoare triple {50640#true} assume !(0 == ~cond); {50640#true} is VALID [2022-04-27 13:17:18,002 INFO L290 TraceCheckUtils]: 15: Hoare triple {50640#true} assume true; {50640#true} is VALID [2022-04-27 13:17:18,002 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {50640#true} {50640#true} #96#return; {50640#true} is VALID [2022-04-27 13:17:18,002 INFO L272 TraceCheckUtils]: 17: Hoare triple {50640#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {50640#true} is VALID [2022-04-27 13:17:18,002 INFO L290 TraceCheckUtils]: 18: Hoare triple {50640#true} ~cond := #in~cond; {50640#true} is VALID [2022-04-27 13:17:18,002 INFO L290 TraceCheckUtils]: 19: Hoare triple {50640#true} assume !(0 == ~cond); {50640#true} is VALID [2022-04-27 13:17:18,002 INFO L290 TraceCheckUtils]: 20: Hoare triple {50640#true} assume true; {50640#true} is VALID [2022-04-27 13:17:18,002 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {50640#true} {50640#true} #98#return; {50640#true} is VALID [2022-04-27 13:17:18,002 INFO L272 TraceCheckUtils]: 22: Hoare triple {50640#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {50640#true} is VALID [2022-04-27 13:17:18,002 INFO L290 TraceCheckUtils]: 23: Hoare triple {50640#true} ~cond := #in~cond; {50640#true} is VALID [2022-04-27 13:17:18,002 INFO L290 TraceCheckUtils]: 24: Hoare triple {50640#true} assume !(0 == ~cond); {50640#true} is VALID [2022-04-27 13:17:18,002 INFO L290 TraceCheckUtils]: 25: Hoare triple {50640#true} assume true; {50640#true} is VALID [2022-04-27 13:17:18,003 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {50640#true} {50640#true} #100#return; {50640#true} is VALID [2022-04-27 13:17:18,003 INFO L290 TraceCheckUtils]: 27: Hoare triple {50640#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {50726#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:17:18,003 INFO L290 TraceCheckUtils]: 28: Hoare triple {50726#(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; {50726#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:17:18,003 INFO L290 TraceCheckUtils]: 29: Hoare triple {50726#(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);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {50733#(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-27 13:17:18,004 INFO L290 TraceCheckUtils]: 30: Hoare triple {50733#(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; {50733#(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-27 13:17:18,004 INFO L290 TraceCheckUtils]: 31: Hoare triple {50733#(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 !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {50740#(and (= main_~b~0 main_~v~0) (= 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-27 13:17:18,004 INFO L290 TraceCheckUtils]: 32: Hoare triple {50740#(and (= main_~b~0 main_~v~0) (= 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; {50740#(and (= main_~b~0 main_~v~0) (= 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-27 13:17:18,004 INFO L272 TraceCheckUtils]: 33: Hoare triple {50740#(and (= main_~b~0 main_~v~0) (= 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)); {50640#true} is VALID [2022-04-27 13:17:18,004 INFO L290 TraceCheckUtils]: 34: Hoare triple {50640#true} ~cond := #in~cond; {50750#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:17:18,005 INFO L290 TraceCheckUtils]: 35: Hoare triple {50750#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {50754#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:17:18,005 INFO L290 TraceCheckUtils]: 36: Hoare triple {50754#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {50754#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:17:18,005 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {50754#(not (= |__VERIFIER_assert_#in~cond| 0))} {50740#(and (= main_~b~0 main_~v~0) (= 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))} #102#return; {50761#(and (= main_~b~0 main_~v~0) (= 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-27 13:17:18,005 INFO L272 TraceCheckUtils]: 38: Hoare triple {50761#(and (= main_~b~0 main_~v~0) (= 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)); {50640#true} is VALID [2022-04-27 13:17:18,006 INFO L290 TraceCheckUtils]: 39: Hoare triple {50640#true} ~cond := #in~cond; {50640#true} is VALID [2022-04-27 13:17:18,006 INFO L290 TraceCheckUtils]: 40: Hoare triple {50640#true} assume !(0 == ~cond); {50640#true} is VALID [2022-04-27 13:17:18,006 INFO L290 TraceCheckUtils]: 41: Hoare triple {50640#true} assume true; {50640#true} is VALID [2022-04-27 13:17:18,006 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {50640#true} {50761#(and (= main_~b~0 main_~v~0) (= 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))} #104#return; {50761#(and (= main_~b~0 main_~v~0) (= 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-27 13:17:18,006 INFO L272 TraceCheckUtils]: 43: Hoare triple {50761#(and (= main_~b~0 main_~v~0) (= 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)); {50640#true} is VALID [2022-04-27 13:17:18,006 INFO L290 TraceCheckUtils]: 44: Hoare triple {50640#true} ~cond := #in~cond; {50640#true} is VALID [2022-04-27 13:17:18,006 INFO L290 TraceCheckUtils]: 45: Hoare triple {50640#true} assume !(0 == ~cond); {50640#true} is VALID [2022-04-27 13:17:18,006 INFO L290 TraceCheckUtils]: 46: Hoare triple {50640#true} assume true; {50640#true} is VALID [2022-04-27 13:17:18,007 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {50640#true} {50761#(and (= main_~b~0 main_~v~0) (= 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))} #106#return; {50761#(and (= main_~b~0 main_~v~0) (= 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-27 13:17:18,007 INFO L272 TraceCheckUtils]: 48: Hoare triple {50761#(and (= main_~b~0 main_~v~0) (= 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 ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {50640#true} is VALID [2022-04-27 13:17:18,007 INFO L290 TraceCheckUtils]: 49: Hoare triple {50640#true} ~cond := #in~cond; {50640#true} is VALID [2022-04-27 13:17:18,007 INFO L290 TraceCheckUtils]: 50: Hoare triple {50640#true} assume !(0 == ~cond); {50640#true} is VALID [2022-04-27 13:17:18,007 INFO L290 TraceCheckUtils]: 51: Hoare triple {50640#true} assume true; {50640#true} is VALID [2022-04-27 13:17:18,007 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {50640#true} {50761#(and (= main_~b~0 main_~v~0) (= 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))} #108#return; {50761#(and (= main_~b~0 main_~v~0) (= 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-27 13:17:18,008 INFO L290 TraceCheckUtils]: 53: Hoare triple {50761#(and (= main_~b~0 main_~v~0) (= 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 >= 2 * ~v~0); {50761#(and (= main_~b~0 main_~v~0) (= 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-27 13:17:18,008 INFO L290 TraceCheckUtils]: 54: Hoare triple {50761#(and (= main_~b~0 main_~v~0) (= 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))} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {50813#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 main_~b~0)) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-27 13:17:18,008 INFO L290 TraceCheckUtils]: 55: Hoare triple {50813#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 main_~b~0)) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~p~0 1))} assume !false; {50813#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 main_~b~0)) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-27 13:17:18,008 INFO L290 TraceCheckUtils]: 56: Hoare triple {50813#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 main_~b~0)) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~p~0 1))} assume !(~c~0 >= ~b~0); {50813#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 main_~b~0)) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-27 13:17:18,009 INFO L290 TraceCheckUtils]: 57: Hoare triple {50813#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 main_~b~0)) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 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; {50823#(and (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~x~0 (+ main_~b~0 main_~y~0)) (= main_~q~0 1))} is VALID [2022-04-27 13:17:18,009 INFO L290 TraceCheckUtils]: 58: Hoare triple {50823#(and (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~x~0 (+ main_~b~0 main_~y~0)) (= main_~q~0 1))} assume !false; {50823#(and (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~x~0 (+ main_~b~0 main_~y~0)) (= main_~q~0 1))} is VALID [2022-04-27 13:17:18,009 INFO L290 TraceCheckUtils]: 59: Hoare triple {50823#(and (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~x~0 (+ main_~b~0 main_~y~0)) (= main_~q~0 1))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {50830#(and (= main_~c~0 main_~a~0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~x~0 (+ main_~b~0 main_~y~0)) (= main_~q~0 1))} is VALID [2022-04-27 13:17:18,010 INFO L290 TraceCheckUtils]: 60: Hoare triple {50830#(and (= main_~c~0 main_~a~0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~x~0 (+ main_~b~0 main_~y~0)) (= main_~q~0 1))} assume !false; {50830#(and (= main_~c~0 main_~a~0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~x~0 (+ main_~b~0 main_~y~0)) (= main_~q~0 1))} is VALID [2022-04-27 13:17:18,010 INFO L290 TraceCheckUtils]: 61: Hoare triple {50830#(and (= main_~c~0 main_~a~0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~x~0 (+ main_~b~0 main_~y~0)) (= main_~q~0 1))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {50837#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~d~0 1) (= main_~x~0 (+ main_~b~0 main_~y~0)) (= main_~q~0 1))} is VALID [2022-04-27 13:17:18,010 INFO L290 TraceCheckUtils]: 62: Hoare triple {50837#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~d~0 1) (= main_~x~0 (+ main_~b~0 main_~y~0)) (= main_~q~0 1))} assume !false; {50837#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~d~0 1) (= main_~x~0 (+ main_~b~0 main_~y~0)) (= main_~q~0 1))} is VALID [2022-04-27 13:17:18,010 INFO L272 TraceCheckUtils]: 63: Hoare triple {50837#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~d~0 1) (= main_~x~0 (+ main_~b~0 main_~y~0)) (= main_~q~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {50640#true} is VALID [2022-04-27 13:17:18,010 INFO L290 TraceCheckUtils]: 64: Hoare triple {50640#true} ~cond := #in~cond; {50640#true} is VALID [2022-04-27 13:17:18,010 INFO L290 TraceCheckUtils]: 65: Hoare triple {50640#true} assume !(0 == ~cond); {50640#true} is VALID [2022-04-27 13:17:18,010 INFO L290 TraceCheckUtils]: 66: Hoare triple {50640#true} assume true; {50640#true} is VALID [2022-04-27 13:17:18,011 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {50640#true} {50837#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~d~0 1) (= main_~x~0 (+ main_~b~0 main_~y~0)) (= main_~q~0 1))} #102#return; {50837#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~d~0 1) (= main_~x~0 (+ main_~b~0 main_~y~0)) (= main_~q~0 1))} is VALID [2022-04-27 13:17:18,011 INFO L272 TraceCheckUtils]: 68: Hoare triple {50837#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~d~0 1) (= main_~x~0 (+ main_~b~0 main_~y~0)) (= main_~q~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {50640#true} is VALID [2022-04-27 13:17:18,011 INFO L290 TraceCheckUtils]: 69: Hoare triple {50640#true} ~cond := #in~cond; {50640#true} is VALID [2022-04-27 13:17:18,011 INFO L290 TraceCheckUtils]: 70: Hoare triple {50640#true} assume !(0 == ~cond); {50640#true} is VALID [2022-04-27 13:17:18,011 INFO L290 TraceCheckUtils]: 71: Hoare triple {50640#true} assume true; {50640#true} is VALID [2022-04-27 13:17:18,011 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {50640#true} {50837#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~d~0 1) (= main_~x~0 (+ main_~b~0 main_~y~0)) (= main_~q~0 1))} #104#return; {50837#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~d~0 1) (= main_~x~0 (+ main_~b~0 main_~y~0)) (= main_~q~0 1))} is VALID [2022-04-27 13:17:18,012 INFO L272 TraceCheckUtils]: 73: Hoare triple {50837#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~d~0 1) (= main_~x~0 (+ main_~b~0 main_~y~0)) (= main_~q~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {50640#true} is VALID [2022-04-27 13:17:18,012 INFO L290 TraceCheckUtils]: 74: Hoare triple {50640#true} ~cond := #in~cond; {50640#true} is VALID [2022-04-27 13:17:18,012 INFO L290 TraceCheckUtils]: 75: Hoare triple {50640#true} assume !(0 == ~cond); {50640#true} is VALID [2022-04-27 13:17:18,012 INFO L290 TraceCheckUtils]: 76: Hoare triple {50640#true} assume true; {50640#true} is VALID [2022-04-27 13:17:18,012 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {50640#true} {50837#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~d~0 1) (= main_~x~0 (+ main_~b~0 main_~y~0)) (= main_~q~0 1))} #106#return; {50837#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~d~0 1) (= main_~x~0 (+ main_~b~0 main_~y~0)) (= main_~q~0 1))} is VALID [2022-04-27 13:17:18,012 INFO L272 TraceCheckUtils]: 78: Hoare triple {50837#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~d~0 1) (= main_~x~0 (+ main_~b~0 main_~y~0)) (= main_~q~0 1))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {50640#true} is VALID [2022-04-27 13:17:18,012 INFO L290 TraceCheckUtils]: 79: Hoare triple {50640#true} ~cond := #in~cond; {50750#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:17:18,012 INFO L290 TraceCheckUtils]: 80: Hoare triple {50750#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {50754#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:17:18,013 INFO L290 TraceCheckUtils]: 81: Hoare triple {50754#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {50754#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:17:18,013 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {50754#(not (= |__VERIFIER_assert_#in~cond| 0))} {50837#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~d~0 1) (= main_~x~0 (+ main_~b~0 main_~y~0)) (= main_~q~0 1))} #108#return; {50837#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~d~0 1) (= main_~x~0 (+ main_~b~0 main_~y~0)) (= main_~q~0 1))} is VALID [2022-04-27 13:17:18,013 INFO L290 TraceCheckUtils]: 83: Hoare triple {50837#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~d~0 1) (= main_~x~0 (+ main_~b~0 main_~y~0)) (= main_~q~0 1))} assume !!(~c~0 >= 2 * ~v~0);~d~0 := 2 * ~d~0;~v~0 := 2 * ~v~0; {50904#(and (= main_~c~0 main_~a~0) (= main_~v~0 (* main_~b~0 2)) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~d~0 2) (= main_~x~0 (+ main_~b~0 main_~y~0)) (= main_~q~0 1))} is VALID [2022-04-27 13:17:18,014 INFO L290 TraceCheckUtils]: 84: Hoare triple {50904#(and (= main_~c~0 main_~a~0) (= main_~v~0 (* main_~b~0 2)) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~d~0 2) (= main_~x~0 (+ main_~b~0 main_~y~0)) (= main_~q~0 1))} assume !false; {50904#(and (= main_~c~0 main_~a~0) (= main_~v~0 (* main_~b~0 2)) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~d~0 2) (= main_~x~0 (+ main_~b~0 main_~y~0)) (= main_~q~0 1))} is VALID [2022-04-27 13:17:18,014 INFO L272 TraceCheckUtils]: 85: Hoare triple {50904#(and (= main_~c~0 main_~a~0) (= main_~v~0 (* main_~b~0 2)) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~d~0 2) (= main_~x~0 (+ main_~b~0 main_~y~0)) (= main_~q~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {50640#true} is VALID [2022-04-27 13:17:18,014 INFO L290 TraceCheckUtils]: 86: Hoare triple {50640#true} ~cond := #in~cond; {50640#true} is VALID [2022-04-27 13:17:18,014 INFO L290 TraceCheckUtils]: 87: Hoare triple {50640#true} assume !(0 == ~cond); {50640#true} is VALID [2022-04-27 13:17:18,014 INFO L290 TraceCheckUtils]: 88: Hoare triple {50640#true} assume true; {50640#true} is VALID [2022-04-27 13:17:18,014 INFO L284 TraceCheckUtils]: 89: Hoare quadruple {50640#true} {50904#(and (= main_~c~0 main_~a~0) (= main_~v~0 (* main_~b~0 2)) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~d~0 2) (= main_~x~0 (+ main_~b~0 main_~y~0)) (= main_~q~0 1))} #102#return; {50904#(and (= main_~c~0 main_~a~0) (= main_~v~0 (* main_~b~0 2)) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~d~0 2) (= main_~x~0 (+ main_~b~0 main_~y~0)) (= main_~q~0 1))} is VALID [2022-04-27 13:17:18,014 INFO L272 TraceCheckUtils]: 90: Hoare triple {50904#(and (= main_~c~0 main_~a~0) (= main_~v~0 (* main_~b~0 2)) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~d~0 2) (= main_~x~0 (+ main_~b~0 main_~y~0)) (= main_~q~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {50640#true} is VALID [2022-04-27 13:17:18,014 INFO L290 TraceCheckUtils]: 91: Hoare triple {50640#true} ~cond := #in~cond; {50640#true} is VALID [2022-04-27 13:17:18,015 INFO L290 TraceCheckUtils]: 92: Hoare triple {50640#true} assume !(0 == ~cond); {50640#true} is VALID [2022-04-27 13:17:18,015 INFO L290 TraceCheckUtils]: 93: Hoare triple {50640#true} assume true; {50640#true} is VALID [2022-04-27 13:17:18,015 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {50640#true} {50904#(and (= main_~c~0 main_~a~0) (= main_~v~0 (* main_~b~0 2)) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~d~0 2) (= main_~x~0 (+ main_~b~0 main_~y~0)) (= main_~q~0 1))} #104#return; {50904#(and (= main_~c~0 main_~a~0) (= main_~v~0 (* main_~b~0 2)) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~d~0 2) (= main_~x~0 (+ main_~b~0 main_~y~0)) (= main_~q~0 1))} is VALID [2022-04-27 13:17:18,015 INFO L272 TraceCheckUtils]: 95: Hoare triple {50904#(and (= main_~c~0 main_~a~0) (= main_~v~0 (* main_~b~0 2)) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~d~0 2) (= main_~x~0 (+ main_~b~0 main_~y~0)) (= main_~q~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {50640#true} is VALID [2022-04-27 13:17:18,015 INFO L290 TraceCheckUtils]: 96: Hoare triple {50640#true} ~cond := #in~cond; {50640#true} is VALID [2022-04-27 13:17:18,015 INFO L290 TraceCheckUtils]: 97: Hoare triple {50640#true} assume !(0 == ~cond); {50640#true} is VALID [2022-04-27 13:17:18,015 INFO L290 TraceCheckUtils]: 98: Hoare triple {50640#true} assume true; {50640#true} is VALID [2022-04-27 13:17:18,016 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {50640#true} {50904#(and (= main_~c~0 main_~a~0) (= main_~v~0 (* main_~b~0 2)) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~d~0 2) (= main_~x~0 (+ main_~b~0 main_~y~0)) (= main_~q~0 1))} #106#return; {50904#(and (= main_~c~0 main_~a~0) (= main_~v~0 (* main_~b~0 2)) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~d~0 2) (= main_~x~0 (+ main_~b~0 main_~y~0)) (= main_~q~0 1))} is VALID [2022-04-27 13:17:18,016 INFO L272 TraceCheckUtils]: 100: Hoare triple {50904#(and (= main_~c~0 main_~a~0) (= main_~v~0 (* main_~b~0 2)) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~d~0 2) (= main_~x~0 (+ main_~b~0 main_~y~0)) (= main_~q~0 1))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {50640#true} is VALID [2022-04-27 13:17:18,016 INFO L290 TraceCheckUtils]: 101: Hoare triple {50640#true} ~cond := #in~cond; {50750#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:17:18,016 INFO L290 TraceCheckUtils]: 102: Hoare triple {50750#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {50754#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:17:18,016 INFO L290 TraceCheckUtils]: 103: Hoare triple {50754#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {50754#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:17:18,017 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {50754#(not (= |__VERIFIER_assert_#in~cond| 0))} {50904#(and (= main_~c~0 main_~a~0) (= main_~v~0 (* main_~b~0 2)) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~d~0 2) (= main_~x~0 (+ main_~b~0 main_~y~0)) (= main_~q~0 1))} #108#return; {50904#(and (= main_~c~0 main_~a~0) (= main_~v~0 (* main_~b~0 2)) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~d~0 2) (= main_~x~0 (+ main_~b~0 main_~y~0)) (= main_~q~0 1))} is VALID [2022-04-27 13:17:18,017 INFO L290 TraceCheckUtils]: 105: Hoare triple {50904#(and (= main_~c~0 main_~a~0) (= main_~v~0 (* main_~b~0 2)) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~d~0 2) (= main_~x~0 (+ main_~b~0 main_~y~0)) (= main_~q~0 1))} assume !!(~c~0 >= 2 * ~v~0);~d~0 := 2 * ~d~0;~v~0 := 2 * ~v~0; {50971#(and (= main_~c~0 main_~a~0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~d~0 4) (= main_~a~0 main_~y~0) (= main_~x~0 (+ main_~b~0 main_~y~0)) (= main_~v~0 (* main_~b~0 4)) (= main_~q~0 1))} is VALID [2022-04-27 13:17:18,018 INFO L290 TraceCheckUtils]: 106: Hoare triple {50971#(and (= main_~c~0 main_~a~0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~d~0 4) (= main_~a~0 main_~y~0) (= main_~x~0 (+ main_~b~0 main_~y~0)) (= main_~v~0 (* main_~b~0 4)) (= main_~q~0 1))} assume !false; {50971#(and (= main_~c~0 main_~a~0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~d~0 4) (= main_~a~0 main_~y~0) (= main_~x~0 (+ main_~b~0 main_~y~0)) (= main_~v~0 (* main_~b~0 4)) (= main_~q~0 1))} is VALID [2022-04-27 13:17:18,018 INFO L272 TraceCheckUtils]: 107: Hoare triple {50971#(and (= main_~c~0 main_~a~0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~d~0 4) (= main_~a~0 main_~y~0) (= main_~x~0 (+ main_~b~0 main_~y~0)) (= main_~v~0 (* main_~b~0 4)) (= main_~q~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {50640#true} is VALID [2022-04-27 13:17:18,018 INFO L290 TraceCheckUtils]: 108: Hoare triple {50640#true} ~cond := #in~cond; {50750#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:17:18,018 INFO L290 TraceCheckUtils]: 109: Hoare triple {50750#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {50754#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:17:18,018 INFO L290 TraceCheckUtils]: 110: Hoare triple {50754#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {50754#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:17:18,019 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {50754#(not (= |__VERIFIER_assert_#in~cond| 0))} {50971#(and (= main_~c~0 main_~a~0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~d~0 4) (= main_~a~0 main_~y~0) (= main_~x~0 (+ main_~b~0 main_~y~0)) (= main_~v~0 (* main_~b~0 4)) (= main_~q~0 1))} #102#return; {50990#(and (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~d~0 4) (= main_~x~0 (+ main_~b~0 main_~y~0)) (= main_~v~0 (* main_~b~0 4)) (= main_~q~0 1) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-27 13:17:18,019 INFO L272 TraceCheckUtils]: 112: Hoare triple {50990#(and (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~d~0 4) (= main_~x~0 (+ main_~b~0 main_~y~0)) (= main_~v~0 (* main_~b~0 4)) (= main_~q~0 1) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {50640#true} is VALID [2022-04-27 13:17:18,019 INFO L290 TraceCheckUtils]: 113: Hoare triple {50640#true} ~cond := #in~cond; {50750#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:17:18,019 INFO L290 TraceCheckUtils]: 114: Hoare triple {50750#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {50754#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:17:18,019 INFO L290 TraceCheckUtils]: 115: Hoare triple {50754#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {50754#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:17:18,020 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {50754#(not (= |__VERIFIER_assert_#in~cond| 0))} {50990#(and (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~d~0 4) (= main_~x~0 (+ main_~b~0 main_~y~0)) (= main_~v~0 (* main_~b~0 4)) (= main_~q~0 1) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} #104#return; {51006#(and (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~d~0 4) (= main_~x~0 (+ main_~b~0 main_~y~0)) (= main_~v~0 (* main_~b~0 4)) (= main_~q~0 1) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-27 13:17:18,020 INFO L272 TraceCheckUtils]: 117: Hoare triple {51006#(and (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~d~0 4) (= main_~x~0 (+ main_~b~0 main_~y~0)) (= main_~v~0 (* main_~b~0 4)) (= main_~q~0 1) (= main_~c~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)); {50640#true} is VALID [2022-04-27 13:17:18,020 INFO L290 TraceCheckUtils]: 118: Hoare triple {50640#true} ~cond := #in~cond; {50640#true} is VALID [2022-04-27 13:17:18,020 INFO L290 TraceCheckUtils]: 119: Hoare triple {50640#true} assume !(0 == ~cond); {50640#true} is VALID [2022-04-27 13:17:18,020 INFO L290 TraceCheckUtils]: 120: Hoare triple {50640#true} assume true; {50640#true} is VALID [2022-04-27 13:17:18,021 INFO L284 TraceCheckUtils]: 121: Hoare quadruple {50640#true} {51006#(and (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~d~0 4) (= main_~x~0 (+ main_~b~0 main_~y~0)) (= main_~v~0 (* main_~b~0 4)) (= main_~q~0 1) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} #106#return; {51006#(and (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~d~0 4) (= main_~x~0 (+ main_~b~0 main_~y~0)) (= main_~v~0 (* main_~b~0 4)) (= main_~q~0 1) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-27 13:17:18,021 INFO L272 TraceCheckUtils]: 122: Hoare triple {51006#(and (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~d~0 4) (= main_~x~0 (+ main_~b~0 main_~y~0)) (= main_~v~0 (* main_~b~0 4)) (= main_~q~0 1) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {50640#true} is VALID [2022-04-27 13:17:18,021 INFO L290 TraceCheckUtils]: 123: Hoare triple {50640#true} ~cond := #in~cond; {50640#true} is VALID [2022-04-27 13:17:18,021 INFO L290 TraceCheckUtils]: 124: Hoare triple {50640#true} assume !(0 == ~cond); {50640#true} is VALID [2022-04-27 13:17:18,021 INFO L290 TraceCheckUtils]: 125: Hoare triple {50640#true} assume true; {50640#true} is VALID [2022-04-27 13:17:18,021 INFO L284 TraceCheckUtils]: 126: Hoare quadruple {50640#true} {51006#(and (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~d~0 4) (= main_~x~0 (+ main_~b~0 main_~y~0)) (= main_~v~0 (* main_~b~0 4)) (= main_~q~0 1) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} #108#return; {51006#(and (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~d~0 4) (= main_~x~0 (+ main_~b~0 main_~y~0)) (= main_~v~0 (* main_~b~0 4)) (= main_~q~0 1) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-27 13:17:18,022 INFO L290 TraceCheckUtils]: 127: Hoare triple {51006#(and (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~d~0 4) (= main_~x~0 (+ main_~b~0 main_~y~0)) (= main_~v~0 (* main_~b~0 4)) (= main_~q~0 1) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} assume !(~c~0 >= 2 * ~v~0); {51006#(and (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~d~0 4) (= main_~x~0 (+ main_~b~0 main_~y~0)) (= main_~v~0 (* main_~b~0 4)) (= main_~q~0 1) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-27 13:17:18,022 INFO L290 TraceCheckUtils]: 128: Hoare triple {51006#(and (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~d~0 4) (= main_~x~0 (+ main_~b~0 main_~y~0)) (= main_~v~0 (* main_~b~0 4)) (= main_~q~0 1) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {51043#(and (= (+ (* (- 1) main_~c~0) (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (* main_~b~0 4)) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~p~0 0) (= main_~r~0 1) (= main_~x~0 (+ main_~b~0 main_~y~0)) (= main_~k~0 4) (= main_~q~0 1))} is VALID [2022-04-27 13:17:18,023 INFO L290 TraceCheckUtils]: 129: Hoare triple {51043#(and (= (+ (* (- 1) main_~c~0) (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (* main_~b~0 4)) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~p~0 0) (= main_~r~0 1) (= main_~x~0 (+ main_~b~0 main_~y~0)) (= main_~k~0 4) (= main_~q~0 1))} assume !false; {51043#(and (= (+ (* (- 1) main_~c~0) (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (* main_~b~0 4)) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~p~0 0) (= main_~r~0 1) (= main_~x~0 (+ main_~b~0 main_~y~0)) (= main_~k~0 4) (= main_~q~0 1))} is VALID [2022-04-27 13:17:18,023 INFO L290 TraceCheckUtils]: 130: Hoare triple {51043#(and (= (+ (* (- 1) main_~c~0) (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (* main_~b~0 4)) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~p~0 0) (= main_~r~0 1) (= main_~x~0 (+ main_~b~0 main_~y~0)) (= main_~k~0 4) (= main_~q~0 1))} assume !(~c~0 >= ~b~0); {51043#(and (= (+ (* (- 1) main_~c~0) (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (* main_~b~0 4)) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~p~0 0) (= main_~r~0 1) (= main_~x~0 (+ main_~b~0 main_~y~0)) (= main_~k~0 4) (= main_~q~0 1))} is VALID [2022-04-27 13:17:18,025 INFO L290 TraceCheckUtils]: 131: Hoare triple {51043#(and (= (+ (* (- 1) main_~c~0) (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (* main_~b~0 4)) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~p~0 0) (= main_~r~0 1) (= main_~x~0 (+ main_~b~0 main_~y~0)) (= main_~k~0 4) (= 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; {51053#(and (= main_~b~0 (+ (* main_~p~0 main_~x~0 (- 4)) (* main_~y~0 main_~s~0))) (= (+ (* main_~y~0 main_~r~0) main_~y~0 (* main_~p~0 main_~x~0)) main_~x~0) (= (+ main_~q~0 (* main_~p~0 4)) 0) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= (+ main_~s~0 (* main_~r~0 4)) 1) (= main_~p~0 1))} is VALID [2022-04-27 13:17:18,025 INFO L290 TraceCheckUtils]: 132: Hoare triple {51053#(and (= main_~b~0 (+ (* main_~p~0 main_~x~0 (- 4)) (* main_~y~0 main_~s~0))) (= (+ (* main_~y~0 main_~r~0) main_~y~0 (* main_~p~0 main_~x~0)) main_~x~0) (= (+ main_~q~0 (* main_~p~0 4)) 0) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= (+ main_~s~0 (* main_~r~0 4)) 1) (= main_~p~0 1))} assume !false; {51053#(and (= main_~b~0 (+ (* main_~p~0 main_~x~0 (- 4)) (* main_~y~0 main_~s~0))) (= (+ (* main_~y~0 main_~r~0) main_~y~0 (* main_~p~0 main_~x~0)) main_~x~0) (= (+ main_~q~0 (* main_~p~0 4)) 0) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= (+ main_~s~0 (* main_~r~0 4)) 1) (= main_~p~0 1))} is VALID [2022-04-27 13:17:18,026 INFO L290 TraceCheckUtils]: 133: Hoare triple {51053#(and (= main_~b~0 (+ (* main_~p~0 main_~x~0 (- 4)) (* main_~y~0 main_~s~0))) (= (+ (* main_~y~0 main_~r~0) main_~y~0 (* main_~p~0 main_~x~0)) main_~x~0) (= (+ main_~q~0 (* main_~p~0 4)) 0) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= (+ main_~s~0 (* main_~r~0 4)) 1) (= main_~p~0 1))} assume !(0 != ~b~0); {51060#(and (= (+ (* main_~y~0 main_~r~0) main_~y~0 (* main_~p~0 main_~x~0)) main_~x~0) (= (+ main_~q~0 (* main_~p~0 4)) 0) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= (+ main_~s~0 (* main_~r~0 4)) 1) (= 0 (+ (* main_~p~0 main_~x~0 (- 4)) (* main_~y~0 main_~s~0))) (= main_~p~0 1))} is VALID [2022-04-27 13:17:18,029 INFO L272 TraceCheckUtils]: 134: Hoare triple {51060#(and (= (+ (* main_~y~0 main_~r~0) main_~y~0 (* main_~p~0 main_~x~0)) main_~x~0) (= (+ main_~q~0 (* main_~p~0 4)) 0) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= (+ main_~s~0 (* main_~r~0 4)) 1) (= 0 (+ (* main_~p~0 main_~x~0 (- 4)) (* main_~y~0 main_~s~0))) (= main_~p~0 1))} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {51064#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:17:18,030 INFO L290 TraceCheckUtils]: 135: Hoare triple {51064#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {51068#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:17:18,030 INFO L290 TraceCheckUtils]: 136: Hoare triple {51068#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {50641#false} is VALID [2022-04-27 13:17:18,030 INFO L290 TraceCheckUtils]: 137: Hoare triple {50641#false} assume !false; {50641#false} is VALID [2022-04-27 13:17:18,031 INFO L134 CoverageAnalysis]: Checked inductivity of 592 backedges. 126 proven. 127 refuted. 0 times theorem prover too weak. 339 trivial. 0 not checked. [2022-04-27 13:17:18,031 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:18:33,819 INFO L290 TraceCheckUtils]: 137: Hoare triple {50641#false} assume !false; {50641#false} is VALID [2022-04-27 13:18:33,820 INFO L290 TraceCheckUtils]: 136: Hoare triple {51068#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {50641#false} is VALID [2022-04-27 13:18:33,820 INFO L290 TraceCheckUtils]: 135: Hoare triple {51064#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {51068#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:18:33,821 INFO L272 TraceCheckUtils]: 134: Hoare triple {51084#(= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {51064#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:18:33,821 INFO L290 TraceCheckUtils]: 133: Hoare triple {51088#(or (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 0)))} assume !(0 != ~b~0); {51084#(= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 13:18:33,821 INFO L290 TraceCheckUtils]: 132: Hoare triple {51088#(or (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 0)))} assume !false; {51088#(or (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 0)))} is VALID [2022-04-27 13:18:34,240 INFO L290 TraceCheckUtils]: 131: Hoare triple {51095#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~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; {51088#(or (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 0)))} is VALID [2022-04-27 13:18:34,241 INFO L290 TraceCheckUtils]: 130: Hoare triple {51095#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} assume !(~c~0 >= ~b~0); {51095#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-27 13:18:34,241 INFO L290 TraceCheckUtils]: 129: Hoare triple {51095#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} assume !false; {51095#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-27 13:18:34,268 INFO L290 TraceCheckUtils]: 128: Hoare triple {51105#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {51095#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-27 13:18:34,269 INFO L290 TraceCheckUtils]: 127: Hoare triple {51105#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} assume !(~c~0 >= 2 * ~v~0); {51105#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-27 13:18:34,270 INFO L284 TraceCheckUtils]: 126: Hoare quadruple {50640#true} {51105#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} #108#return; {51105#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-27 13:18:34,270 INFO L290 TraceCheckUtils]: 125: Hoare triple {50640#true} assume true; {50640#true} is VALID [2022-04-27 13:18:34,270 INFO L290 TraceCheckUtils]: 124: Hoare triple {50640#true} assume !(0 == ~cond); {50640#true} is VALID [2022-04-27 13:18:34,270 INFO L290 TraceCheckUtils]: 123: Hoare triple {50640#true} ~cond := #in~cond; {50640#true} is VALID [2022-04-27 13:18:34,270 INFO L272 TraceCheckUtils]: 122: Hoare triple {51105#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {50640#true} is VALID [2022-04-27 13:18:34,271 INFO L284 TraceCheckUtils]: 121: Hoare quadruple {50640#true} {51105#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} #106#return; {51105#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-27 13:18:34,271 INFO L290 TraceCheckUtils]: 120: Hoare triple {50640#true} assume true; {50640#true} is VALID [2022-04-27 13:18:34,271 INFO L290 TraceCheckUtils]: 119: Hoare triple {50640#true} assume !(0 == ~cond); {50640#true} is VALID [2022-04-27 13:18:34,271 INFO L290 TraceCheckUtils]: 118: Hoare triple {50640#true} ~cond := #in~cond; {50640#true} is VALID [2022-04-27 13:18:34,271 INFO L272 TraceCheckUtils]: 117: Hoare triple {51105#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~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)); {50640#true} is VALID [2022-04-27 13:18:34,272 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {50754#(not (= |__VERIFIER_assert_#in~cond| 0))} {51142#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} #104#return; {51105#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-27 13:18:34,272 INFO L290 TraceCheckUtils]: 115: Hoare triple {50754#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {50754#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:18:34,272 INFO L290 TraceCheckUtils]: 114: Hoare triple {51152#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {50754#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:18:34,273 INFO L290 TraceCheckUtils]: 113: Hoare triple {50640#true} ~cond := #in~cond; {51152#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 13:18:34,273 INFO L272 TraceCheckUtils]: 112: Hoare triple {51142#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~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)); {50640#true} is VALID [2022-04-27 13:18:34,274 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {50754#(not (= |__VERIFIER_assert_#in~cond| 0))} {51159#(or (not (= (+ main_~c~0 (* (- 1) main_~v~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_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} #102#return; {51142#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-27 13:18:34,274 INFO L290 TraceCheckUtils]: 110: Hoare triple {50754#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {50754#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:18:34,274 INFO L290 TraceCheckUtils]: 109: Hoare triple {51152#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {50754#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:18:34,275 INFO L290 TraceCheckUtils]: 108: Hoare triple {50640#true} ~cond := #in~cond; {51152#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 13:18:34,275 INFO L272 TraceCheckUtils]: 107: Hoare triple {51159#(or (not (= (+ main_~c~0 (* (- 1) main_~v~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_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~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)); {50640#true} is VALID [2022-04-27 13:18:34,275 INFO L290 TraceCheckUtils]: 106: Hoare triple {51159#(or (not (= (+ main_~c~0 (* (- 1) main_~v~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_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} assume !false; {51159#(or (not (= (+ main_~c~0 (* (- 1) main_~v~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_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-27 13:18:34,856 INFO L290 TraceCheckUtils]: 105: Hoare triple {51178#(or (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= (+ main_~c~0 (* (- 2) main_~v~0)) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~y~0 (+ (* (- 1) (* (+ main_~k~0 (* main_~d~0 2)) main_~s~0)) main_~r~0)) main_~b~0 (* (+ main_~p~0 (* (- 1) (+ main_~k~0 (* main_~d~0 2)) main_~q~0)) main_~x~0))))} assume !!(~c~0 >= 2 * ~v~0);~d~0 := 2 * ~d~0;~v~0 := 2 * ~v~0; {51159#(or (not (= (+ main_~c~0 (* (- 1) main_~v~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_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-27 13:18:34,857 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {50754#(not (= |__VERIFIER_assert_#in~cond| 0))} {51182#(or (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= (+ main_~c~0 (* (- 2) main_~v~0)) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~y~0 (+ (* (- 1) (* (+ main_~k~0 (* main_~d~0 2)) main_~s~0)) main_~r~0)) main_~b~0 (* (+ main_~p~0 (* (- 1) (+ main_~k~0 (* main_~d~0 2)) main_~q~0)) main_~x~0))) (not (= main_~v~0 (* main_~d~0 main_~b~0))))} #108#return; {51178#(or (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= (+ main_~c~0 (* (- 2) main_~v~0)) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~y~0 (+ (* (- 1) (* (+ main_~k~0 (* main_~d~0 2)) main_~s~0)) main_~r~0)) main_~b~0 (* (+ main_~p~0 (* (- 1) (+ main_~k~0 (* main_~d~0 2)) main_~q~0)) main_~x~0))))} is VALID [2022-04-27 13:18:34,857 INFO L290 TraceCheckUtils]: 103: Hoare triple {50754#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {50754#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:18:34,858 INFO L290 TraceCheckUtils]: 102: Hoare triple {51152#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {50754#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:18:34,858 INFO L290 TraceCheckUtils]: 101: Hoare triple {50640#true} ~cond := #in~cond; {51152#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 13:18:34,858 INFO L272 TraceCheckUtils]: 100: Hoare triple {51182#(or (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= (+ main_~c~0 (* (- 2) main_~v~0)) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~y~0 (+ (* (- 1) (* (+ main_~k~0 (* main_~d~0 2)) main_~s~0)) main_~r~0)) main_~b~0 (* (+ main_~p~0 (* (- 1) (+ main_~k~0 (* main_~d~0 2)) main_~q~0)) main_~x~0))) (not (= main_~v~0 (* main_~d~0 main_~b~0))))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {50640#true} is VALID [2022-04-27 13:18:34,859 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {50640#true} {51182#(or (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= (+ main_~c~0 (* (- 2) main_~v~0)) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~y~0 (+ (* (- 1) (* (+ main_~k~0 (* main_~d~0 2)) main_~s~0)) main_~r~0)) main_~b~0 (* (+ main_~p~0 (* (- 1) (+ main_~k~0 (* main_~d~0 2)) main_~q~0)) main_~x~0))) (not (= main_~v~0 (* main_~d~0 main_~b~0))))} #106#return; {51182#(or (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= (+ main_~c~0 (* (- 2) main_~v~0)) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~y~0 (+ (* (- 1) (* (+ main_~k~0 (* main_~d~0 2)) main_~s~0)) main_~r~0)) main_~b~0 (* (+ main_~p~0 (* (- 1) (+ main_~k~0 (* main_~d~0 2)) main_~q~0)) main_~x~0))) (not (= main_~v~0 (* main_~d~0 main_~b~0))))} is VALID [2022-04-27 13:18:34,859 INFO L290 TraceCheckUtils]: 98: Hoare triple {50640#true} assume true; {50640#true} is VALID [2022-04-27 13:18:34,859 INFO L290 TraceCheckUtils]: 97: Hoare triple {50640#true} assume !(0 == ~cond); {50640#true} is VALID [2022-04-27 13:18:34,859 INFO L290 TraceCheckUtils]: 96: Hoare triple {50640#true} ~cond := #in~cond; {50640#true} is VALID [2022-04-27 13:18:34,859 INFO L272 TraceCheckUtils]: 95: Hoare triple {51182#(or (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= (+ main_~c~0 (* (- 2) main_~v~0)) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~y~0 (+ (* (- 1) (* (+ main_~k~0 (* main_~d~0 2)) main_~s~0)) main_~r~0)) main_~b~0 (* (+ main_~p~0 (* (- 1) (+ main_~k~0 (* main_~d~0 2)) main_~q~0)) main_~x~0))) (not (= main_~v~0 (* main_~d~0 main_~b~0))))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {50640#true} is VALID [2022-04-27 13:18:34,860 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {50640#true} {51182#(or (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= (+ main_~c~0 (* (- 2) main_~v~0)) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~y~0 (+ (* (- 1) (* (+ main_~k~0 (* main_~d~0 2)) main_~s~0)) main_~r~0)) main_~b~0 (* (+ main_~p~0 (* (- 1) (+ main_~k~0 (* main_~d~0 2)) main_~q~0)) main_~x~0))) (not (= main_~v~0 (* main_~d~0 main_~b~0))))} #104#return; {51182#(or (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= (+ main_~c~0 (* (- 2) main_~v~0)) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~y~0 (+ (* (- 1) (* (+ main_~k~0 (* main_~d~0 2)) main_~s~0)) main_~r~0)) main_~b~0 (* (+ main_~p~0 (* (- 1) (+ main_~k~0 (* main_~d~0 2)) main_~q~0)) main_~x~0))) (not (= main_~v~0 (* main_~d~0 main_~b~0))))} is VALID [2022-04-27 13:18:34,860 INFO L290 TraceCheckUtils]: 93: Hoare triple {50640#true} assume true; {50640#true} is VALID [2022-04-27 13:18:34,860 INFO L290 TraceCheckUtils]: 92: Hoare triple {50640#true} assume !(0 == ~cond); {50640#true} is VALID [2022-04-27 13:18:34,860 INFO L290 TraceCheckUtils]: 91: Hoare triple {50640#true} ~cond := #in~cond; {50640#true} is VALID [2022-04-27 13:18:34,860 INFO L272 TraceCheckUtils]: 90: Hoare triple {51182#(or (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= (+ main_~c~0 (* (- 2) main_~v~0)) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~y~0 (+ (* (- 1) (* (+ main_~k~0 (* main_~d~0 2)) main_~s~0)) main_~r~0)) main_~b~0 (* (+ main_~p~0 (* (- 1) (+ main_~k~0 (* main_~d~0 2)) main_~q~0)) main_~x~0))) (not (= main_~v~0 (* main_~d~0 main_~b~0))))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {50640#true} is VALID [2022-04-27 13:18:34,861 INFO L284 TraceCheckUtils]: 89: Hoare quadruple {50640#true} {51182#(or (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= (+ main_~c~0 (* (- 2) main_~v~0)) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~y~0 (+ (* (- 1) (* (+ main_~k~0 (* main_~d~0 2)) main_~s~0)) main_~r~0)) main_~b~0 (* (+ main_~p~0 (* (- 1) (+ main_~k~0 (* main_~d~0 2)) main_~q~0)) main_~x~0))) (not (= main_~v~0 (* main_~d~0 main_~b~0))))} #102#return; {51182#(or (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= (+ main_~c~0 (* (- 2) main_~v~0)) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~y~0 (+ (* (- 1) (* (+ main_~k~0 (* main_~d~0 2)) main_~s~0)) main_~r~0)) main_~b~0 (* (+ main_~p~0 (* (- 1) (+ main_~k~0 (* main_~d~0 2)) main_~q~0)) main_~x~0))) (not (= main_~v~0 (* main_~d~0 main_~b~0))))} is VALID [2022-04-27 13:18:34,861 INFO L290 TraceCheckUtils]: 88: Hoare triple {50640#true} assume true; {50640#true} is VALID [2022-04-27 13:18:34,861 INFO L290 TraceCheckUtils]: 87: Hoare triple {50640#true} assume !(0 == ~cond); {50640#true} is VALID [2022-04-27 13:18:34,861 INFO L290 TraceCheckUtils]: 86: Hoare triple {50640#true} ~cond := #in~cond; {50640#true} is VALID [2022-04-27 13:18:34,861 INFO L272 TraceCheckUtils]: 85: Hoare triple {51182#(or (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= (+ main_~c~0 (* (- 2) main_~v~0)) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~y~0 (+ (* (- 1) (* (+ main_~k~0 (* main_~d~0 2)) main_~s~0)) main_~r~0)) main_~b~0 (* (+ main_~p~0 (* (- 1) (+ main_~k~0 (* main_~d~0 2)) main_~q~0)) main_~x~0))) (not (= main_~v~0 (* main_~d~0 main_~b~0))))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {50640#true} is VALID [2022-04-27 13:18:34,861 INFO L290 TraceCheckUtils]: 84: Hoare triple {51182#(or (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= (+ main_~c~0 (* (- 2) main_~v~0)) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~y~0 (+ (* (- 1) (* (+ main_~k~0 (* main_~d~0 2)) main_~s~0)) main_~r~0)) main_~b~0 (* (+ main_~p~0 (* (- 1) (+ main_~k~0 (* main_~d~0 2)) main_~q~0)) main_~x~0))) (not (= main_~v~0 (* main_~d~0 main_~b~0))))} assume !false; {51182#(or (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= (+ main_~c~0 (* (- 2) main_~v~0)) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~y~0 (+ (* (- 1) (* (+ main_~k~0 (* main_~d~0 2)) main_~s~0)) main_~r~0)) main_~b~0 (* (+ main_~p~0 (* (- 1) (+ main_~k~0 (* main_~d~0 2)) main_~q~0)) main_~x~0))) (not (= main_~v~0 (* main_~d~0 main_~b~0))))} is VALID [2022-04-27 13:18:35,378 INFO L290 TraceCheckUtils]: 83: Hoare triple {51246#(or (not (= (* main_~v~0 2) (* main_~b~0 (* main_~d~0 2)))) (not (= (+ (* (- 2) (* main_~b~0 (* main_~d~0 2))) 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_~x~0 (+ main_~p~0 (* (- 1) (+ (* main_~d~0 4) main_~k~0) main_~q~0))) (* (+ main_~r~0 (* (- 1) (* (+ (* main_~d~0 4) main_~k~0) main_~s~0))) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} assume !!(~c~0 >= 2 * ~v~0);~d~0 := 2 * ~d~0;~v~0 := 2 * ~v~0; {51182#(or (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= (+ main_~c~0 (* (- 2) main_~v~0)) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~y~0 (+ (* (- 1) (* (+ main_~k~0 (* main_~d~0 2)) main_~s~0)) main_~r~0)) main_~b~0 (* (+ main_~p~0 (* (- 1) (+ main_~k~0 (* main_~d~0 2)) main_~q~0)) main_~x~0))) (not (= main_~v~0 (* main_~d~0 main_~b~0))))} is VALID [2022-04-27 13:18:35,379 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {50640#true} {51246#(or (not (= (* main_~v~0 2) (* main_~b~0 (* main_~d~0 2)))) (not (= (+ (* (- 2) (* main_~b~0 (* main_~d~0 2))) 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_~x~0 (+ main_~p~0 (* (- 1) (+ (* main_~d~0 4) main_~k~0) main_~q~0))) (* (+ main_~r~0 (* (- 1) (* (+ (* main_~d~0 4) main_~k~0) main_~s~0))) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} #108#return; {51246#(or (not (= (* main_~v~0 2) (* main_~b~0 (* main_~d~0 2)))) (not (= (+ (* (- 2) (* main_~b~0 (* main_~d~0 2))) 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_~x~0 (+ main_~p~0 (* (- 1) (+ (* main_~d~0 4) main_~k~0) main_~q~0))) (* (+ main_~r~0 (* (- 1) (* (+ (* main_~d~0 4) main_~k~0) main_~s~0))) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-27 13:18:35,379 INFO L290 TraceCheckUtils]: 81: Hoare triple {50640#true} assume true; {50640#true} is VALID [2022-04-27 13:18:35,379 INFO L290 TraceCheckUtils]: 80: Hoare triple {50640#true} assume !(0 == ~cond); {50640#true} is VALID [2022-04-27 13:18:35,379 INFO L290 TraceCheckUtils]: 79: Hoare triple {50640#true} ~cond := #in~cond; {50640#true} is VALID [2022-04-27 13:18:35,379 INFO L272 TraceCheckUtils]: 78: Hoare triple {51246#(or (not (= (* main_~v~0 2) (* main_~b~0 (* main_~d~0 2)))) (not (= (+ (* (- 2) (* main_~b~0 (* main_~d~0 2))) 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_~x~0 (+ main_~p~0 (* (- 1) (+ (* main_~d~0 4) main_~k~0) main_~q~0))) (* (+ main_~r~0 (* (- 1) (* (+ (* main_~d~0 4) main_~k~0) main_~s~0))) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {50640#true} is VALID [2022-04-27 13:18:35,380 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {50640#true} {51246#(or (not (= (* main_~v~0 2) (* main_~b~0 (* main_~d~0 2)))) (not (= (+ (* (- 2) (* main_~b~0 (* main_~d~0 2))) 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_~x~0 (+ main_~p~0 (* (- 1) (+ (* main_~d~0 4) main_~k~0) main_~q~0))) (* (+ main_~r~0 (* (- 1) (* (+ (* main_~d~0 4) main_~k~0) main_~s~0))) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} #106#return; {51246#(or (not (= (* main_~v~0 2) (* main_~b~0 (* main_~d~0 2)))) (not (= (+ (* (- 2) (* main_~b~0 (* main_~d~0 2))) 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_~x~0 (+ main_~p~0 (* (- 1) (+ (* main_~d~0 4) main_~k~0) main_~q~0))) (* (+ main_~r~0 (* (- 1) (* (+ (* main_~d~0 4) main_~k~0) main_~s~0))) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-27 13:18:35,380 INFO L290 TraceCheckUtils]: 76: Hoare triple {50640#true} assume true; {50640#true} is VALID [2022-04-27 13:18:35,380 INFO L290 TraceCheckUtils]: 75: Hoare triple {50640#true} assume !(0 == ~cond); {50640#true} is VALID [2022-04-27 13:18:35,380 INFO L290 TraceCheckUtils]: 74: Hoare triple {50640#true} ~cond := #in~cond; {50640#true} is VALID [2022-04-27 13:18:35,380 INFO L272 TraceCheckUtils]: 73: Hoare triple {51246#(or (not (= (* main_~v~0 2) (* main_~b~0 (* main_~d~0 2)))) (not (= (+ (* (- 2) (* main_~b~0 (* main_~d~0 2))) 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_~x~0 (+ main_~p~0 (* (- 1) (+ (* main_~d~0 4) main_~k~0) main_~q~0))) (* (+ main_~r~0 (* (- 1) (* (+ (* main_~d~0 4) main_~k~0) main_~s~0))) main_~y~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)); {50640#true} is VALID [2022-04-27 13:18:35,381 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {50640#true} {51246#(or (not (= (* main_~v~0 2) (* main_~b~0 (* main_~d~0 2)))) (not (= (+ (* (- 2) (* main_~b~0 (* main_~d~0 2))) 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_~x~0 (+ main_~p~0 (* (- 1) (+ (* main_~d~0 4) main_~k~0) main_~q~0))) (* (+ main_~r~0 (* (- 1) (* (+ (* main_~d~0 4) main_~k~0) main_~s~0))) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} #104#return; {51246#(or (not (= (* main_~v~0 2) (* main_~b~0 (* main_~d~0 2)))) (not (= (+ (* (- 2) (* main_~b~0 (* main_~d~0 2))) 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_~x~0 (+ main_~p~0 (* (- 1) (+ (* main_~d~0 4) main_~k~0) main_~q~0))) (* (+ main_~r~0 (* (- 1) (* (+ (* main_~d~0 4) main_~k~0) main_~s~0))) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-27 13:18:35,381 INFO L290 TraceCheckUtils]: 71: Hoare triple {50640#true} assume true; {50640#true} is VALID [2022-04-27 13:18:35,381 INFO L290 TraceCheckUtils]: 70: Hoare triple {50640#true} assume !(0 == ~cond); {50640#true} is VALID [2022-04-27 13:18:35,381 INFO L290 TraceCheckUtils]: 69: Hoare triple {50640#true} ~cond := #in~cond; {50640#true} is VALID [2022-04-27 13:18:35,381 INFO L272 TraceCheckUtils]: 68: Hoare triple {51246#(or (not (= (* main_~v~0 2) (* main_~b~0 (* main_~d~0 2)))) (not (= (+ (* (- 2) (* main_~b~0 (* main_~d~0 2))) 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_~x~0 (+ main_~p~0 (* (- 1) (+ (* main_~d~0 4) main_~k~0) main_~q~0))) (* (+ main_~r~0 (* (- 1) (* (+ (* main_~d~0 4) main_~k~0) main_~s~0))) main_~y~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)); {50640#true} is VALID [2022-04-27 13:18:35,382 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {50640#true} {51246#(or (not (= (* main_~v~0 2) (* main_~b~0 (* main_~d~0 2)))) (not (= (+ (* (- 2) (* main_~b~0 (* main_~d~0 2))) 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_~x~0 (+ main_~p~0 (* (- 1) (+ (* main_~d~0 4) main_~k~0) main_~q~0))) (* (+ main_~r~0 (* (- 1) (* (+ (* main_~d~0 4) main_~k~0) main_~s~0))) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} #102#return; {51246#(or (not (= (* main_~v~0 2) (* main_~b~0 (* main_~d~0 2)))) (not (= (+ (* (- 2) (* main_~b~0 (* main_~d~0 2))) 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_~x~0 (+ main_~p~0 (* (- 1) (+ (* main_~d~0 4) main_~k~0) main_~q~0))) (* (+ main_~r~0 (* (- 1) (* (+ (* main_~d~0 4) main_~k~0) main_~s~0))) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-27 13:18:35,382 INFO L290 TraceCheckUtils]: 66: Hoare triple {50640#true} assume true; {50640#true} is VALID [2022-04-27 13:18:35,382 INFO L290 TraceCheckUtils]: 65: Hoare triple {50640#true} assume !(0 == ~cond); {50640#true} is VALID [2022-04-27 13:18:35,382 INFO L290 TraceCheckUtils]: 64: Hoare triple {50640#true} ~cond := #in~cond; {50640#true} is VALID [2022-04-27 13:18:35,382 INFO L272 TraceCheckUtils]: 63: Hoare triple {51246#(or (not (= (* main_~v~0 2) (* main_~b~0 (* main_~d~0 2)))) (not (= (+ (* (- 2) (* main_~b~0 (* main_~d~0 2))) 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_~x~0 (+ main_~p~0 (* (- 1) (+ (* main_~d~0 4) main_~k~0) main_~q~0))) (* (+ main_~r~0 (* (- 1) (* (+ (* main_~d~0 4) main_~k~0) main_~s~0))) main_~y~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)); {50640#true} is VALID [2022-04-27 13:18:35,383 INFO L290 TraceCheckUtils]: 62: Hoare triple {51246#(or (not (= (* main_~v~0 2) (* main_~b~0 (* main_~d~0 2)))) (not (= (+ (* (- 2) (* main_~b~0 (* main_~d~0 2))) 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_~x~0 (+ main_~p~0 (* (- 1) (+ (* main_~d~0 4) main_~k~0) main_~q~0))) (* (+ main_~r~0 (* (- 1) (* (+ (* main_~d~0 4) main_~k~0) main_~s~0))) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} assume !false; {51246#(or (not (= (* main_~v~0 2) (* main_~b~0 (* main_~d~0 2)))) (not (= (+ (* (- 2) (* main_~b~0 (* main_~d~0 2))) 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_~x~0 (+ main_~p~0 (* (- 1) (+ (* main_~d~0 4) main_~k~0) main_~q~0))) (* (+ main_~r~0 (* (- 1) (* (+ (* main_~d~0 4) main_~k~0) main_~s~0))) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-27 13:18:35,383 INFO L290 TraceCheckUtils]: 61: Hoare triple {51313#(or (= (+ (* main_~y~0 (+ main_~r~0 (* (- 1) (* main_~s~0 (+ main_~k~0 4))))) (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~k~0 4))) main_~x~0) main_~b~0) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~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)))) (not (= 0 (+ (* main_~b~0 (- 4)) main_~c~0))))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {51246#(or (not (= (* main_~v~0 2) (* main_~b~0 (* main_~d~0 2)))) (not (= (+ (* (- 2) (* main_~b~0 (* main_~d~0 2))) 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_~x~0 (+ main_~p~0 (* (- 1) (+ (* main_~d~0 4) main_~k~0) main_~q~0))) (* (+ main_~r~0 (* (- 1) (* (+ (* main_~d~0 4) main_~k~0) main_~s~0))) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-27 13:18:35,384 INFO L290 TraceCheckUtils]: 60: Hoare triple {51313#(or (= (+ (* main_~y~0 (+ main_~r~0 (* (- 1) (* main_~s~0 (+ main_~k~0 4))))) (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~k~0 4))) main_~x~0) main_~b~0) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~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)))) (not (= 0 (+ (* main_~b~0 (- 4)) main_~c~0))))} assume !false; {51313#(or (= (+ (* main_~y~0 (+ main_~r~0 (* (- 1) (* main_~s~0 (+ main_~k~0 4))))) (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~k~0 4))) main_~x~0) main_~b~0) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~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)))) (not (= 0 (+ (* main_~b~0 (- 4)) main_~c~0))))} is VALID [2022-04-27 13:18:35,386 INFO L290 TraceCheckUtils]: 59: Hoare triple {50640#true} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {51313#(or (= (+ (* main_~y~0 (+ main_~r~0 (* (- 1) (* main_~s~0 (+ main_~k~0 4))))) (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~k~0 4))) main_~x~0) main_~b~0) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~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)))) (not (= 0 (+ (* main_~b~0 (- 4)) main_~c~0))))} is VALID [2022-04-27 13:18:35,386 INFO L290 TraceCheckUtils]: 58: Hoare triple {50640#true} assume !false; {50640#true} is VALID [2022-04-27 13:18:35,386 INFO L290 TraceCheckUtils]: 57: Hoare triple {50640#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; {50640#true} is VALID [2022-04-27 13:18:35,386 INFO L290 TraceCheckUtils]: 56: Hoare triple {50640#true} assume !(~c~0 >= ~b~0); {50640#true} is VALID [2022-04-27 13:18:35,386 INFO L290 TraceCheckUtils]: 55: Hoare triple {50640#true} assume !false; {50640#true} is VALID [2022-04-27 13:18:35,386 INFO L290 TraceCheckUtils]: 54: Hoare triple {50640#true} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {50640#true} is VALID [2022-04-27 13:18:35,386 INFO L290 TraceCheckUtils]: 53: Hoare triple {50640#true} assume !(~c~0 >= 2 * ~v~0); {50640#true} is VALID [2022-04-27 13:18:35,386 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {50640#true} {50640#true} #108#return; {50640#true} is VALID [2022-04-27 13:18:35,386 INFO L290 TraceCheckUtils]: 51: Hoare triple {50640#true} assume true; {50640#true} is VALID [2022-04-27 13:18:35,387 INFO L290 TraceCheckUtils]: 50: Hoare triple {50640#true} assume !(0 == ~cond); {50640#true} is VALID [2022-04-27 13:18:35,387 INFO L290 TraceCheckUtils]: 49: Hoare triple {50640#true} ~cond := #in~cond; {50640#true} is VALID [2022-04-27 13:18:35,387 INFO L272 TraceCheckUtils]: 48: Hoare triple {50640#true} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {50640#true} is VALID [2022-04-27 13:18:35,387 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {50640#true} {50640#true} #106#return; {50640#true} is VALID [2022-04-27 13:18:35,387 INFO L290 TraceCheckUtils]: 46: Hoare triple {50640#true} assume true; {50640#true} is VALID [2022-04-27 13:18:35,387 INFO L290 TraceCheckUtils]: 45: Hoare triple {50640#true} assume !(0 == ~cond); {50640#true} is VALID [2022-04-27 13:18:35,387 INFO L290 TraceCheckUtils]: 44: Hoare triple {50640#true} ~cond := #in~cond; {50640#true} is VALID [2022-04-27 13:18:35,387 INFO L272 TraceCheckUtils]: 43: Hoare triple {50640#true} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {50640#true} is VALID [2022-04-27 13:18:35,387 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {50640#true} {50640#true} #104#return; {50640#true} is VALID [2022-04-27 13:18:35,387 INFO L290 TraceCheckUtils]: 41: Hoare triple {50640#true} assume true; {50640#true} is VALID [2022-04-27 13:18:35,387 INFO L290 TraceCheckUtils]: 40: Hoare triple {50640#true} assume !(0 == ~cond); {50640#true} is VALID [2022-04-27 13:18:35,387 INFO L290 TraceCheckUtils]: 39: Hoare triple {50640#true} ~cond := #in~cond; {50640#true} is VALID [2022-04-27 13:18:35,387 INFO L272 TraceCheckUtils]: 38: Hoare triple {50640#true} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {50640#true} is VALID [2022-04-27 13:18:35,387 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {50640#true} {50640#true} #102#return; {50640#true} is VALID [2022-04-27 13:18:35,387 INFO L290 TraceCheckUtils]: 36: Hoare triple {50640#true} assume true; {50640#true} is VALID [2022-04-27 13:18:35,387 INFO L290 TraceCheckUtils]: 35: Hoare triple {50640#true} assume !(0 == ~cond); {50640#true} is VALID [2022-04-27 13:18:35,387 INFO L290 TraceCheckUtils]: 34: Hoare triple {50640#true} ~cond := #in~cond; {50640#true} is VALID [2022-04-27 13:18:35,387 INFO L272 TraceCheckUtils]: 33: Hoare triple {50640#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {50640#true} is VALID [2022-04-27 13:18:35,387 INFO L290 TraceCheckUtils]: 32: Hoare triple {50640#true} assume !false; {50640#true} is VALID [2022-04-27 13:18:35,387 INFO L290 TraceCheckUtils]: 31: Hoare triple {50640#true} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {50640#true} is VALID [2022-04-27 13:18:35,387 INFO L290 TraceCheckUtils]: 30: Hoare triple {50640#true} assume !false; {50640#true} is VALID [2022-04-27 13:18:35,387 INFO L290 TraceCheckUtils]: 29: Hoare triple {50640#true} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {50640#true} is VALID [2022-04-27 13:18:35,387 INFO L290 TraceCheckUtils]: 28: Hoare triple {50640#true} assume !false; {50640#true} is VALID [2022-04-27 13:18:35,388 INFO L290 TraceCheckUtils]: 27: Hoare triple {50640#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {50640#true} is VALID [2022-04-27 13:18:35,388 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {50640#true} {50640#true} #100#return; {50640#true} is VALID [2022-04-27 13:18:35,388 INFO L290 TraceCheckUtils]: 25: Hoare triple {50640#true} assume true; {50640#true} is VALID [2022-04-27 13:18:35,388 INFO L290 TraceCheckUtils]: 24: Hoare triple {50640#true} assume !(0 == ~cond); {50640#true} is VALID [2022-04-27 13:18:35,388 INFO L290 TraceCheckUtils]: 23: Hoare triple {50640#true} ~cond := #in~cond; {50640#true} is VALID [2022-04-27 13:18:35,388 INFO L272 TraceCheckUtils]: 22: Hoare triple {50640#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {50640#true} is VALID [2022-04-27 13:18:35,388 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {50640#true} {50640#true} #98#return; {50640#true} is VALID [2022-04-27 13:18:35,388 INFO L290 TraceCheckUtils]: 20: Hoare triple {50640#true} assume true; {50640#true} is VALID [2022-04-27 13:18:35,388 INFO L290 TraceCheckUtils]: 19: Hoare triple {50640#true} assume !(0 == ~cond); {50640#true} is VALID [2022-04-27 13:18:35,388 INFO L290 TraceCheckUtils]: 18: Hoare triple {50640#true} ~cond := #in~cond; {50640#true} is VALID [2022-04-27 13:18:35,388 INFO L272 TraceCheckUtils]: 17: Hoare triple {50640#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {50640#true} is VALID [2022-04-27 13:18:35,388 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {50640#true} {50640#true} #96#return; {50640#true} is VALID [2022-04-27 13:18:35,388 INFO L290 TraceCheckUtils]: 15: Hoare triple {50640#true} assume true; {50640#true} is VALID [2022-04-27 13:18:35,388 INFO L290 TraceCheckUtils]: 14: Hoare triple {50640#true} assume !(0 == ~cond); {50640#true} is VALID [2022-04-27 13:18:35,388 INFO L290 TraceCheckUtils]: 13: Hoare triple {50640#true} ~cond := #in~cond; {50640#true} is VALID [2022-04-27 13:18:35,388 INFO L272 TraceCheckUtils]: 12: Hoare triple {50640#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 10 then 1 else 0)); {50640#true} is VALID [2022-04-27 13:18:35,388 INFO L290 TraceCheckUtils]: 11: Hoare triple {50640#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {50640#true} is VALID [2022-04-27 13:18:35,388 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {50640#true} {50640#true} #94#return; {50640#true} is VALID [2022-04-27 13:18:35,388 INFO L290 TraceCheckUtils]: 9: Hoare triple {50640#true} assume true; {50640#true} is VALID [2022-04-27 13:18:35,388 INFO L290 TraceCheckUtils]: 8: Hoare triple {50640#true} assume !(0 == ~cond); {50640#true} is VALID [2022-04-27 13:18:35,388 INFO L290 TraceCheckUtils]: 7: Hoare triple {50640#true} ~cond := #in~cond; {50640#true} is VALID [2022-04-27 13:18:35,388 INFO L272 TraceCheckUtils]: 6: Hoare triple {50640#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 10 then 1 else 0)); {50640#true} is VALID [2022-04-27 13:18:35,389 INFO L290 TraceCheckUtils]: 5: Hoare triple {50640#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;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {50640#true} is VALID [2022-04-27 13:18:35,389 INFO L272 TraceCheckUtils]: 4: Hoare triple {50640#true} call #t~ret6 := main(); {50640#true} is VALID [2022-04-27 13:18:35,389 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {50640#true} {50640#true} #112#return; {50640#true} is VALID [2022-04-27 13:18:35,389 INFO L290 TraceCheckUtils]: 2: Hoare triple {50640#true} assume true; {50640#true} is VALID [2022-04-27 13:18:35,389 INFO L290 TraceCheckUtils]: 1: Hoare triple {50640#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); {50640#true} is VALID [2022-04-27 13:18:35,389 INFO L272 TraceCheckUtils]: 0: Hoare triple {50640#true} call ULTIMATE.init(); {50640#true} is VALID [2022-04-27 13:18:35,389 INFO L134 CoverageAnalysis]: Checked inductivity of 592 backedges. 160 proven. 41 refuted. 0 times theorem prover too weak. 391 trivial. 0 not checked. [2022-04-27 13:18:35,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:18:35,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959512275] [2022-04-27 13:18:35,390 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:18:35,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1515045960] [2022-04-27 13:18:35,390 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1515045960] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 13:18:35,390 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 13:18:35,390 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 16] total 32 [2022-04-27 13:18:35,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572666936] [2022-04-27 13:18:35,390 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 13:18:35,390 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 28 states have (on average 2.5) internal successors, (70), 28 states have internal predecessors, (70), 15 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (37), 11 states have call predecessors, (37), 13 states have call successors, (37) Word has length 138 [2022-04-27 13:18:35,417 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:18:35,417 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 32 states, 28 states have (on average 2.5) internal successors, (70), 28 states have internal predecessors, (70), 15 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (37), 11 states have call predecessors, (37), 13 states have call successors, (37) [2022-04-27 13:18:36,628 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 147 edges. 147 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:18:36,628 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-04-27 13:18:36,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:18:36,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-04-27 13:18:36,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=847, Unknown=0, NotChecked=0, Total=992 [2022-04-27 13:18:36,629 INFO L87 Difference]: Start difference. First operand 1315 states and 2101 transitions. Second operand has 32 states, 28 states have (on average 2.5) internal successors, (70), 28 states have internal predecessors, (70), 15 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (37), 11 states have call predecessors, (37), 13 states have call successors, (37) [2022-04-27 13:18:41,348 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.00s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 13:18:48,004 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-27 13:18:53,097 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-27 13:19:07,615 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-27 13:19:24,592 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-27 13:19:28,600 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 13:19:30,647 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-27 13:19:37,075 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 13:19:39,096 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-27 13:20:07,107 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-27 13:20:10,458 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 13:20:16,210 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.72s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 13:20:18,923 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.35s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 13:20:27,569 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-27 13:20:34,745 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 13:20:37,151 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-27 13:20:47,721 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-27 13:21:12,900 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-27 13:21:15,800 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 13:21:19,226 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 13:21:29,012 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 13:21:30,732 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 13:21:35,360 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 []