/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/egcd2-ll_valuebound20.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 13:02:22,137 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 13:02:22,138 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 13:02:22,164 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 13:02:22,164 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 13:02:22,164 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 13:02:22,165 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 13:02:22,166 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 13:02:22,168 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 13:02:22,168 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 13:02:22,169 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 13:02:22,172 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 13:02:22,173 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 13:02:22,188 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 13:02:22,189 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 13:02:22,191 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 13:02:22,191 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 13:02:22,193 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 13:02:22,196 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 13:02:22,197 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 13:02:22,198 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 13:02:22,202 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 13:02:22,202 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 13:02:22,203 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 13:02:22,203 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 13:02:22,205 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 13:02:22,205 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 13:02:22,205 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 13:02:22,206 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 13:02:22,206 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 13:02:22,206 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 13:02:22,206 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 13:02:22,207 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 13:02:22,207 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 13:02:22,208 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 13:02:22,208 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 13:02:22,208 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 13:02:22,209 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 13:02:22,209 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 13:02:22,209 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 13:02:22,209 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 13:02:22,215 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 13:02:22,215 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:02:22,233 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 13:02:22,233 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 13:02:22,233 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 13:02:22,233 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 13:02:22,234 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 13:02:22,234 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 13:02:22,234 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 13:02:22,234 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 13:02:22,234 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 13:02:22,234 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 13:02:22,235 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 13:02:22,235 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 13:02:22,235 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 13:02:22,235 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 13:02:22,238 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 13:02:22,238 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 13:02:22,238 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 13:02:22,238 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 13:02:22,238 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 13:02:22,238 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 13:02:22,238 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 13:02:22,238 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 13:02:22,239 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 13:02:22,239 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 13:02:22,239 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 13:02:22,239 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 13:02:22,239 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 13:02:22,239 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 13:02:22,239 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 13:02:22,240 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 13:02:22,240 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 13:02:22,240 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 13:02:22,240 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 13:02:22,240 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:02:22,416 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 13:02:22,427 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 13:02:22,429 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 13:02:22,429 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 13:02:22,430 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 13:02:22,430 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/egcd2-ll_valuebound20.c [2022-04-27 13:02:22,475 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e36e18cf/474e180bf7714cedb228cf5a2ff1ccfc/FLAG862364f59 [2022-04-27 13:02:22,825 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 13:02:22,825 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/egcd2-ll_valuebound20.c [2022-04-27 13:02:22,829 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e36e18cf/474e180bf7714cedb228cf5a2ff1ccfc/FLAG862364f59 [2022-04-27 13:02:22,837 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e36e18cf/474e180bf7714cedb228cf5a2ff1ccfc [2022-04-27 13:02:22,839 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 13:02:22,840 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 13:02:22,841 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 13:02:22,841 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 13:02:22,845 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 13:02:22,848 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 01:02:22" (1/1) ... [2022-04-27 13:02:22,849 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a14c5d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:02:22, skipping insertion in model container [2022-04-27 13:02:22,849 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 01:02:22" (1/1) ... [2022-04-27 13:02:22,854 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 13:02:22,866 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 13:02:22,975 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/egcd2-ll_valuebound20.c[490,503] [2022-04-27 13:02:23,004 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 13:02:23,010 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 13:02:23,017 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/egcd2-ll_valuebound20.c[490,503] [2022-04-27 13:02:23,024 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 13:02:23,032 INFO L208 MainTranslator]: Completed translation [2022-04-27 13:02:23,033 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:02:23 WrapperNode [2022-04-27 13:02:23,033 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 13:02:23,033 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 13:02:23,034 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 13:02:23,034 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 13:02:23,040 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:02:23" (1/1) ... [2022-04-27 13:02:23,041 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:02:23" (1/1) ... [2022-04-27 13:02:23,044 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:02:23" (1/1) ... [2022-04-27 13:02:23,045 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:02:23" (1/1) ... [2022-04-27 13:02:23,049 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:02:23" (1/1) ... [2022-04-27 13:02:23,051 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:02:23" (1/1) ... [2022-04-27 13:02:23,052 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:02:23" (1/1) ... [2022-04-27 13:02:23,053 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 13:02:23,054 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 13:02:23,054 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 13:02:23,054 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 13:02:23,055 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:02:23" (1/1) ... [2022-04-27 13:02:23,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 13:02:23,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:02:23,082 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:02:23,086 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:02:23,106 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 13:02:23,107 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 13:02:23,107 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 13:02:23,107 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 13:02:23,108 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 13:02:23,108 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 13:02:23,108 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 13:02:23,108 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 13:02:23,108 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 13:02:23,108 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 13:02:23,108 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 13:02:23,108 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 13:02:23,108 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 13:02:23,108 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 13:02:23,109 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 13:02:23,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 13:02:23,109 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 13:02:23,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 13:02:23,109 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 13:02:23,109 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 13:02:23,154 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 13:02:23,155 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 13:02:23,346 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 13:02:23,350 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 13:02:23,351 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-27 13:02:23,352 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 01:02:23 BoogieIcfgContainer [2022-04-27 13:02:23,352 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 13:02:23,353 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 13:02:23,353 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 13:02:23,355 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 13:02:23,355 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 01:02:22" (1/3) ... [2022-04-27 13:02:23,356 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27c7876c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 01:02:23, skipping insertion in model container [2022-04-27 13:02:23,356 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:02:23" (2/3) ... [2022-04-27 13:02:23,356 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27c7876c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 01:02:23, skipping insertion in model container [2022-04-27 13:02:23,356 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 01:02:23" (3/3) ... [2022-04-27 13:02:23,357 INFO L111 eAbstractionObserver]: Analyzing ICFG egcd2-ll_valuebound20.c [2022-04-27 13:02:23,366 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 13:02:23,366 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 13:02:23,400 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 13:02:23,404 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@62e692d4, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@4119d80c [2022-04-27 13:02:23,404 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 13:02:23,416 INFO L276 IsEmpty]: Start isEmpty. Operand has 40 states, 20 states have (on average 1.45) internal successors, (29), 22 states have internal predecessors, (29), 14 states have call successors, (14), 4 states have call predecessors, (14), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-27 13:02:23,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-27 13:02:23,421 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:02:23,422 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 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:02:23,422 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:02:23,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:02:23,425 INFO L85 PathProgramCache]: Analyzing trace with hash -587582002, now seen corresponding path program 1 times [2022-04-27 13:02:23,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:02:23,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111294935] [2022-04-27 13:02:23,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:02:23,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:02:23,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:02:23,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 13:02:23,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:02:23,592 INFO L290 TraceCheckUtils]: 0: Hoare triple {72#(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:02:23,592 INFO L290 TraceCheckUtils]: 1: Hoare triple {43#true} assume true; {43#true} is VALID [2022-04-27 13:02:23,592 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {43#true} {43#true} #103#return; {43#true} is VALID [2022-04-27 13:02:23,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 13:02:23,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:02:23,603 INFO L290 TraceCheckUtils]: 0: Hoare triple {43#true} ~cond := #in~cond; {43#true} is VALID [2022-04-27 13:02:23,604 INFO L290 TraceCheckUtils]: 1: Hoare triple {43#true} assume 0 == ~cond;assume false; {44#false} is VALID [2022-04-27 13:02:23,605 INFO L290 TraceCheckUtils]: 2: Hoare triple {44#false} assume true; {44#false} is VALID [2022-04-27 13:02:23,605 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44#false} {43#true} #79#return; {44#false} is VALID [2022-04-27 13:02:23,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-27 13:02:23,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:02:23,619 INFO L290 TraceCheckUtils]: 0: Hoare triple {43#true} ~cond := #in~cond; {43#true} is VALID [2022-04-27 13:02:23,620 INFO L290 TraceCheckUtils]: 1: Hoare triple {43#true} assume 0 == ~cond;assume false; {44#false} is VALID [2022-04-27 13:02:23,620 INFO L290 TraceCheckUtils]: 2: Hoare triple {44#false} assume true; {44#false} is VALID [2022-04-27 13:02:23,620 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44#false} {44#false} #81#return; {44#false} is VALID [2022-04-27 13:02:23,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-27 13:02:23,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:02:23,626 INFO L290 TraceCheckUtils]: 0: Hoare triple {43#true} ~cond := #in~cond; {43#true} is VALID [2022-04-27 13:02:23,627 INFO L290 TraceCheckUtils]: 1: Hoare triple {43#true} assume 0 == ~cond;assume false; {44#false} is VALID [2022-04-27 13:02:23,627 INFO L290 TraceCheckUtils]: 2: Hoare triple {44#false} assume true; {44#false} is VALID [2022-04-27 13:02:23,627 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44#false} {44#false} #83#return; {44#false} is VALID [2022-04-27 13:02:23,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-04-27 13:02:23,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:02:23,633 INFO L290 TraceCheckUtils]: 0: Hoare triple {43#true} ~cond := #in~cond; {43#true} is VALID [2022-04-27 13:02:23,634 INFO L290 TraceCheckUtils]: 1: Hoare triple {43#true} assume 0 == ~cond;assume false; {44#false} is VALID [2022-04-27 13:02:23,634 INFO L290 TraceCheckUtils]: 2: Hoare triple {44#false} assume true; {44#false} is VALID [2022-04-27 13:02:23,634 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44#false} {44#false} #85#return; {44#false} is VALID [2022-04-27 13:02:23,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-04-27 13:02:23,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:02:23,640 INFO L290 TraceCheckUtils]: 0: Hoare triple {43#true} ~cond := #in~cond; {43#true} is VALID [2022-04-27 13:02:23,641 INFO L290 TraceCheckUtils]: 1: Hoare triple {43#true} assume 0 == ~cond;assume false; {44#false} is VALID [2022-04-27 13:02:23,641 INFO L290 TraceCheckUtils]: 2: Hoare triple {44#false} assume true; {44#false} is VALID [2022-04-27 13:02:23,641 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44#false} {44#false} #87#return; {44#false} is VALID [2022-04-27 13:02:23,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-04-27 13:02:23,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:02:23,648 INFO L290 TraceCheckUtils]: 0: Hoare triple {43#true} ~cond := #in~cond; {43#true} is VALID [2022-04-27 13:02:23,649 INFO L290 TraceCheckUtils]: 1: Hoare triple {43#true} assume 0 == ~cond;assume false; {44#false} is VALID [2022-04-27 13:02:23,649 INFO L290 TraceCheckUtils]: 2: Hoare triple {44#false} assume true; {44#false} is VALID [2022-04-27 13:02:23,649 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44#false} {44#false} #89#return; {44#false} is VALID [2022-04-27 13:02:23,650 INFO L272 TraceCheckUtils]: 0: Hoare triple {43#true} call ULTIMATE.init(); {72#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 13:02:23,650 INFO L290 TraceCheckUtils]: 1: Hoare triple {72#(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:02:23,650 INFO L290 TraceCheckUtils]: 2: Hoare triple {43#true} assume true; {43#true} is VALID [2022-04-27 13:02:23,650 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43#true} {43#true} #103#return; {43#true} is VALID [2022-04-27 13:02:23,650 INFO L272 TraceCheckUtils]: 4: Hoare triple {43#true} call #t~ret6 := main(); {43#true} is VALID [2022-04-27 13:02:23,650 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;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {43#true} is VALID [2022-04-27 13:02:23,651 INFO L272 TraceCheckUtils]: 6: Hoare triple {43#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 20 then 1 else 0)); {43#true} is VALID [2022-04-27 13:02:23,651 INFO L290 TraceCheckUtils]: 7: Hoare triple {43#true} ~cond := #in~cond; {43#true} is VALID [2022-04-27 13:02:23,651 INFO L290 TraceCheckUtils]: 8: Hoare triple {43#true} assume 0 == ~cond;assume false; {44#false} is VALID [2022-04-27 13:02:23,651 INFO L290 TraceCheckUtils]: 9: Hoare triple {44#false} assume true; {44#false} is VALID [2022-04-27 13:02:23,651 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {44#false} {43#true} #79#return; {44#false} is VALID [2022-04-27 13:02:23,652 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:02:23,652 INFO L272 TraceCheckUtils]: 12: Hoare triple {44#false} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 20 then 1 else 0)); {43#true} is VALID [2022-04-27 13:02:23,652 INFO L290 TraceCheckUtils]: 13: Hoare triple {43#true} ~cond := #in~cond; {43#true} is VALID [2022-04-27 13:02:23,652 INFO L290 TraceCheckUtils]: 14: Hoare triple {43#true} assume 0 == ~cond;assume false; {44#false} is VALID [2022-04-27 13:02:23,652 INFO L290 TraceCheckUtils]: 15: Hoare triple {44#false} assume true; {44#false} is VALID [2022-04-27 13:02:23,652 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {44#false} {44#false} #81#return; {44#false} is VALID [2022-04-27 13:02:23,653 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:02:23,653 INFO L290 TraceCheckUtils]: 18: Hoare triple {43#true} ~cond := #in~cond; {43#true} is VALID [2022-04-27 13:02:23,653 INFO L290 TraceCheckUtils]: 19: Hoare triple {43#true} assume 0 == ~cond;assume false; {44#false} is VALID [2022-04-27 13:02:23,653 INFO L290 TraceCheckUtils]: 20: Hoare triple {44#false} assume true; {44#false} is VALID [2022-04-27 13:02:23,653 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {44#false} {44#false} #83#return; {44#false} is VALID [2022-04-27 13:02:23,653 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:02:23,654 INFO L290 TraceCheckUtils]: 23: Hoare triple {43#true} ~cond := #in~cond; {43#true} is VALID [2022-04-27 13:02:23,654 INFO L290 TraceCheckUtils]: 24: Hoare triple {43#true} assume 0 == ~cond;assume false; {44#false} is VALID [2022-04-27 13:02:23,654 INFO L290 TraceCheckUtils]: 25: Hoare triple {44#false} assume true; {44#false} is VALID [2022-04-27 13:02:23,654 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {44#false} {44#false} #85#return; {44#false} is VALID [2022-04-27 13:02:23,654 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;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {44#false} is VALID [2022-04-27 13:02:23,655 INFO L272 TraceCheckUtils]: 28: Hoare triple {44#false} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {43#true} is VALID [2022-04-27 13:02:23,655 INFO L290 TraceCheckUtils]: 29: Hoare triple {43#true} ~cond := #in~cond; {43#true} is VALID [2022-04-27 13:02:23,655 INFO L290 TraceCheckUtils]: 30: Hoare triple {43#true} assume 0 == ~cond;assume false; {44#false} is VALID [2022-04-27 13:02:23,655 INFO L290 TraceCheckUtils]: 31: Hoare triple {44#false} assume true; {44#false} is VALID [2022-04-27 13:02:23,655 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {44#false} {44#false} #87#return; {44#false} is VALID [2022-04-27 13:02:23,655 INFO L272 TraceCheckUtils]: 33: Hoare triple {44#false} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {43#true} is VALID [2022-04-27 13:02:23,656 INFO L290 TraceCheckUtils]: 34: Hoare triple {43#true} ~cond := #in~cond; {43#true} is VALID [2022-04-27 13:02:23,656 INFO L290 TraceCheckUtils]: 35: Hoare triple {43#true} assume 0 == ~cond;assume false; {44#false} is VALID [2022-04-27 13:02:23,656 INFO L290 TraceCheckUtils]: 36: Hoare triple {44#false} assume true; {44#false} is VALID [2022-04-27 13:02:23,656 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {44#false} {44#false} #89#return; {44#false} is VALID [2022-04-27 13:02:23,656 INFO L290 TraceCheckUtils]: 38: Hoare triple {44#false} assume !true; {44#false} is VALID [2022-04-27 13:02:23,657 INFO L272 TraceCheckUtils]: 39: Hoare triple {44#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {44#false} is VALID [2022-04-27 13:02:23,657 INFO L290 TraceCheckUtils]: 40: Hoare triple {44#false} ~cond := #in~cond; {44#false} is VALID [2022-04-27 13:02:23,657 INFO L290 TraceCheckUtils]: 41: Hoare triple {44#false} assume 0 == ~cond; {44#false} is VALID [2022-04-27 13:02:23,657 INFO L290 TraceCheckUtils]: 42: Hoare triple {44#false} assume !false; {44#false} is VALID [2022-04-27 13:02:23,657 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-27 13:02:23,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:02:23,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111294935] [2022-04-27 13:02:23,658 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111294935] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:02:23,658 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:02:23,659 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 13:02:23,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223276964] [2022-04-27 13:02:23,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:02:23,663 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, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 43 [2022-04-27 13:02:23,664 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:02:23,666 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, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-27 13:02:23,706 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:02:23,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 13:02:23,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:02:23,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 13:02:23,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 13:02:23,733 INFO L87 Difference]: Start difference. First operand has 40 states, 20 states have (on average 1.45) internal successors, (29), 22 states have internal predecessors, (29), 14 states have call successors, (14), 4 states have call predecessors, (14), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) 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, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-27 13:02:23,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:02:23,906 INFO L93 Difference]: Finished difference Result 73 states and 118 transitions. [2022-04-27 13:02:23,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 13:02:23,907 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, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 43 [2022-04-27 13:02:23,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:02:23,908 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, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-27 13:02:23,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 118 transitions. [2022-04-27 13:02:23,924 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, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-27 13:02:23,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 118 transitions. [2022-04-27 13:02:23,934 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 118 transitions. [2022-04-27 13:02:24,063 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 118 edges. 118 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:02:24,070 INFO L225 Difference]: With dead ends: 73 [2022-04-27 13:02:24,070 INFO L226 Difference]: Without dead ends: 35 [2022-04-27 13:02:24,072 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 21 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:02:24,074 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 20 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 13:02:24,075 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 42 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 13:02:24,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-27 13:02:24,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2022-04-27 13:02:24,102 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:02:24,102 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 35 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 19 states have internal predecessors, (20), 14 states have call successors, (14), 4 states have call predecessors, (14), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 13:02:24,104 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 35 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 19 states have internal predecessors, (20), 14 states have call successors, (14), 4 states have call predecessors, (14), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 13:02:24,104 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 35 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 19 states have internal predecessors, (20), 14 states have call successors, (14), 4 states have call predecessors, (14), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 13:02:24,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:02:24,117 INFO L93 Difference]: Finished difference Result 35 states and 46 transitions. [2022-04-27 13:02:24,117 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 46 transitions. [2022-04-27 13:02:24,118 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:02:24,118 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:02:24,118 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 19 states have internal predecessors, (20), 14 states have call successors, (14), 4 states have call predecessors, (14), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 35 states. [2022-04-27 13:02:24,118 INFO L87 Difference]: Start difference. First operand has 35 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 19 states have internal predecessors, (20), 14 states have call successors, (14), 4 states have call predecessors, (14), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 35 states. [2022-04-27 13:02:24,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:02:24,121 INFO L93 Difference]: Finished difference Result 35 states and 46 transitions. [2022-04-27 13:02:24,121 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 46 transitions. [2022-04-27 13:02:24,122 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:02:24,122 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:02:24,122 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:02:24,122 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:02:24,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 19 states have internal predecessors, (20), 14 states have call successors, (14), 4 states have call predecessors, (14), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 13:02:24,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 46 transitions. [2022-04-27 13:02:24,125 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 46 transitions. Word has length 43 [2022-04-27 13:02:24,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:02:24,126 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 46 transitions. [2022-04-27 13:02:24,126 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, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-27 13:02:24,126 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 46 transitions. [2022-04-27 13:02:24,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-27 13:02:24,127 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:02:24,127 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 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:02:24,128 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 13:02:24,128 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:02:24,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:02:24,129 INFO L85 PathProgramCache]: Analyzing trace with hash 987777007, now seen corresponding path program 1 times [2022-04-27 13:02:24,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:02:24,129 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876410746] [2022-04-27 13:02:24,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:02:24,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:02:24,173 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:02:24,173 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [296234270] [2022-04-27 13:02:24,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:02:24,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:02:24,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:02:24,177 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:02:24,178 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:02:24,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:02:24,227 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 13:02:24,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:02:24,251 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:02:24,439 INFO L272 TraceCheckUtils]: 0: Hoare triple {308#true} call ULTIMATE.init(); {308#true} is VALID [2022-04-27 13:02:24,439 INFO L290 TraceCheckUtils]: 1: Hoare triple {308#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); {308#true} is VALID [2022-04-27 13:02:24,439 INFO L290 TraceCheckUtils]: 2: Hoare triple {308#true} assume true; {308#true} is VALID [2022-04-27 13:02:24,439 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {308#true} {308#true} #103#return; {308#true} is VALID [2022-04-27 13:02:24,439 INFO L272 TraceCheckUtils]: 4: Hoare triple {308#true} call #t~ret6 := main(); {308#true} is VALID [2022-04-27 13:02:24,439 INFO L290 TraceCheckUtils]: 5: Hoare triple {308#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {308#true} is VALID [2022-04-27 13:02:24,440 INFO L272 TraceCheckUtils]: 6: Hoare triple {308#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 20 then 1 else 0)); {308#true} is VALID [2022-04-27 13:02:24,440 INFO L290 TraceCheckUtils]: 7: Hoare triple {308#true} ~cond := #in~cond; {308#true} is VALID [2022-04-27 13:02:24,440 INFO L290 TraceCheckUtils]: 8: Hoare triple {308#true} assume !(0 == ~cond); {308#true} is VALID [2022-04-27 13:02:24,440 INFO L290 TraceCheckUtils]: 9: Hoare triple {308#true} assume true; {308#true} is VALID [2022-04-27 13:02:24,440 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {308#true} {308#true} #79#return; {308#true} is VALID [2022-04-27 13:02:24,440 INFO L290 TraceCheckUtils]: 11: Hoare triple {308#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {308#true} is VALID [2022-04-27 13:02:24,440 INFO L272 TraceCheckUtils]: 12: Hoare triple {308#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 20 then 1 else 0)); {308#true} is VALID [2022-04-27 13:02:24,440 INFO L290 TraceCheckUtils]: 13: Hoare triple {308#true} ~cond := #in~cond; {308#true} is VALID [2022-04-27 13:02:24,441 INFO L290 TraceCheckUtils]: 14: Hoare triple {308#true} assume !(0 == ~cond); {308#true} is VALID [2022-04-27 13:02:24,441 INFO L290 TraceCheckUtils]: 15: Hoare triple {308#true} assume true; {308#true} is VALID [2022-04-27 13:02:24,441 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {308#true} {308#true} #81#return; {308#true} is VALID [2022-04-27 13:02:24,441 INFO L272 TraceCheckUtils]: 17: Hoare triple {308#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {308#true} is VALID [2022-04-27 13:02:24,441 INFO L290 TraceCheckUtils]: 18: Hoare triple {308#true} ~cond := #in~cond; {308#true} is VALID [2022-04-27 13:02:24,441 INFO L290 TraceCheckUtils]: 19: Hoare triple {308#true} assume !(0 == ~cond); {308#true} is VALID [2022-04-27 13:02:24,441 INFO L290 TraceCheckUtils]: 20: Hoare triple {308#true} assume true; {308#true} is VALID [2022-04-27 13:02:24,441 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {308#true} {308#true} #83#return; {308#true} is VALID [2022-04-27 13:02:24,442 INFO L272 TraceCheckUtils]: 22: Hoare triple {308#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {308#true} is VALID [2022-04-27 13:02:24,442 INFO L290 TraceCheckUtils]: 23: Hoare triple {308#true} ~cond := #in~cond; {382#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 13:02:24,442 INFO L290 TraceCheckUtils]: 24: Hoare triple {382#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {386#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 13:02:24,443 INFO L290 TraceCheckUtils]: 25: Hoare triple {386#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {386#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 13:02:24,443 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {386#(not (= |assume_abort_if_not_#in~cond| 0))} {308#true} #85#return; {393#(<= 1 main_~y~0)} is VALID [2022-04-27 13:02:24,444 INFO L290 TraceCheckUtils]: 27: Hoare triple {393#(<= 1 main_~y~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {397#(<= 1 main_~b~0)} is VALID [2022-04-27 13:02:24,444 INFO L272 TraceCheckUtils]: 28: Hoare triple {397#(<= 1 main_~b~0)} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {308#true} is VALID [2022-04-27 13:02:24,444 INFO L290 TraceCheckUtils]: 29: Hoare triple {308#true} ~cond := #in~cond; {308#true} is VALID [2022-04-27 13:02:24,444 INFO L290 TraceCheckUtils]: 30: Hoare triple {308#true} assume !(0 == ~cond); {308#true} is VALID [2022-04-27 13:02:24,444 INFO L290 TraceCheckUtils]: 31: Hoare triple {308#true} assume true; {308#true} is VALID [2022-04-27 13:02:24,445 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {308#true} {397#(<= 1 main_~b~0)} #87#return; {397#(<= 1 main_~b~0)} is VALID [2022-04-27 13:02:24,445 INFO L272 TraceCheckUtils]: 33: Hoare triple {397#(<= 1 main_~b~0)} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {308#true} is VALID [2022-04-27 13:02:24,445 INFO L290 TraceCheckUtils]: 34: Hoare triple {308#true} ~cond := #in~cond; {308#true} is VALID [2022-04-27 13:02:24,445 INFO L290 TraceCheckUtils]: 35: Hoare triple {308#true} assume !(0 == ~cond); {308#true} is VALID [2022-04-27 13:02:24,445 INFO L290 TraceCheckUtils]: 36: Hoare triple {308#true} assume true; {308#true} is VALID [2022-04-27 13:02:24,446 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {308#true} {397#(<= 1 main_~b~0)} #89#return; {397#(<= 1 main_~b~0)} is VALID [2022-04-27 13:02:24,450 INFO L290 TraceCheckUtils]: 38: Hoare triple {397#(<= 1 main_~b~0)} assume !false; {397#(<= 1 main_~b~0)} is VALID [2022-04-27 13:02:24,450 INFO L290 TraceCheckUtils]: 39: Hoare triple {397#(<= 1 main_~b~0)} assume !(0 != ~b~0); {309#false} is VALID [2022-04-27 13:02:24,451 INFO L272 TraceCheckUtils]: 40: Hoare triple {309#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {309#false} is VALID [2022-04-27 13:02:24,451 INFO L290 TraceCheckUtils]: 41: Hoare triple {309#false} ~cond := #in~cond; {309#false} is VALID [2022-04-27 13:02:24,451 INFO L290 TraceCheckUtils]: 42: Hoare triple {309#false} assume 0 == ~cond; {309#false} is VALID [2022-04-27 13:02:24,451 INFO L290 TraceCheckUtils]: 43: Hoare triple {309#false} assume !false; {309#false} is VALID [2022-04-27 13:02:24,451 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-04-27 13:02:24,451 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:02:24,714 INFO L290 TraceCheckUtils]: 43: Hoare triple {309#false} assume !false; {309#false} is VALID [2022-04-27 13:02:24,715 INFO L290 TraceCheckUtils]: 42: Hoare triple {309#false} assume 0 == ~cond; {309#false} is VALID [2022-04-27 13:02:24,715 INFO L290 TraceCheckUtils]: 41: Hoare triple {309#false} ~cond := #in~cond; {309#false} is VALID [2022-04-27 13:02:24,717 INFO L272 TraceCheckUtils]: 40: Hoare triple {309#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {309#false} is VALID [2022-04-27 13:02:24,717 INFO L290 TraceCheckUtils]: 39: Hoare triple {397#(<= 1 main_~b~0)} assume !(0 != ~b~0); {309#false} is VALID [2022-04-27 13:02:24,727 INFO L290 TraceCheckUtils]: 38: Hoare triple {397#(<= 1 main_~b~0)} assume !false; {397#(<= 1 main_~b~0)} is VALID [2022-04-27 13:02:24,730 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {308#true} {397#(<= 1 main_~b~0)} #89#return; {397#(<= 1 main_~b~0)} is VALID [2022-04-27 13:02:24,730 INFO L290 TraceCheckUtils]: 36: Hoare triple {308#true} assume true; {308#true} is VALID [2022-04-27 13:02:24,730 INFO L290 TraceCheckUtils]: 35: Hoare triple {308#true} assume !(0 == ~cond); {308#true} is VALID [2022-04-27 13:02:24,730 INFO L290 TraceCheckUtils]: 34: Hoare triple {308#true} ~cond := #in~cond; {308#true} is VALID [2022-04-27 13:02:24,730 INFO L272 TraceCheckUtils]: 33: Hoare triple {397#(<= 1 main_~b~0)} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {308#true} is VALID [2022-04-27 13:02:24,735 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {308#true} {397#(<= 1 main_~b~0)} #87#return; {397#(<= 1 main_~b~0)} is VALID [2022-04-27 13:02:24,735 INFO L290 TraceCheckUtils]: 31: Hoare triple {308#true} assume true; {308#true} is VALID [2022-04-27 13:02:24,736 INFO L290 TraceCheckUtils]: 30: Hoare triple {308#true} assume !(0 == ~cond); {308#true} is VALID [2022-04-27 13:02:24,736 INFO L290 TraceCheckUtils]: 29: Hoare triple {308#true} ~cond := #in~cond; {308#true} is VALID [2022-04-27 13:02:24,736 INFO L272 TraceCheckUtils]: 28: Hoare triple {397#(<= 1 main_~b~0)} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {308#true} is VALID [2022-04-27 13:02:24,736 INFO L290 TraceCheckUtils]: 27: Hoare triple {393#(<= 1 main_~y~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {397#(<= 1 main_~b~0)} is VALID [2022-04-27 13:02:24,737 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {386#(not (= |assume_abort_if_not_#in~cond| 0))} {308#true} #85#return; {393#(<= 1 main_~y~0)} is VALID [2022-04-27 13:02:24,737 INFO L290 TraceCheckUtils]: 25: Hoare triple {386#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {386#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 13:02:24,738 INFO L290 TraceCheckUtils]: 24: Hoare triple {506#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} assume !(0 == ~cond); {386#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 13:02:24,738 INFO L290 TraceCheckUtils]: 23: Hoare triple {308#true} ~cond := #in~cond; {506#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} is VALID [2022-04-27 13:02:24,738 INFO L272 TraceCheckUtils]: 22: Hoare triple {308#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {308#true} is VALID [2022-04-27 13:02:24,738 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {308#true} {308#true} #83#return; {308#true} is VALID [2022-04-27 13:02:24,738 INFO L290 TraceCheckUtils]: 20: Hoare triple {308#true} assume true; {308#true} is VALID [2022-04-27 13:02:24,738 INFO L290 TraceCheckUtils]: 19: Hoare triple {308#true} assume !(0 == ~cond); {308#true} is VALID [2022-04-27 13:02:24,739 INFO L290 TraceCheckUtils]: 18: Hoare triple {308#true} ~cond := #in~cond; {308#true} is VALID [2022-04-27 13:02:24,739 INFO L272 TraceCheckUtils]: 17: Hoare triple {308#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {308#true} is VALID [2022-04-27 13:02:24,739 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {308#true} {308#true} #81#return; {308#true} is VALID [2022-04-27 13:02:24,739 INFO L290 TraceCheckUtils]: 15: Hoare triple {308#true} assume true; {308#true} is VALID [2022-04-27 13:02:24,739 INFO L290 TraceCheckUtils]: 14: Hoare triple {308#true} assume !(0 == ~cond); {308#true} is VALID [2022-04-27 13:02:24,739 INFO L290 TraceCheckUtils]: 13: Hoare triple {308#true} ~cond := #in~cond; {308#true} is VALID [2022-04-27 13:02:24,739 INFO L272 TraceCheckUtils]: 12: Hoare triple {308#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 20 then 1 else 0)); {308#true} is VALID [2022-04-27 13:02:24,739 INFO L290 TraceCheckUtils]: 11: Hoare triple {308#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {308#true} is VALID [2022-04-27 13:02:24,739 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {308#true} {308#true} #79#return; {308#true} is VALID [2022-04-27 13:02:24,740 INFO L290 TraceCheckUtils]: 9: Hoare triple {308#true} assume true; {308#true} is VALID [2022-04-27 13:02:24,740 INFO L290 TraceCheckUtils]: 8: Hoare triple {308#true} assume !(0 == ~cond); {308#true} is VALID [2022-04-27 13:02:24,740 INFO L290 TraceCheckUtils]: 7: Hoare triple {308#true} ~cond := #in~cond; {308#true} is VALID [2022-04-27 13:02:24,740 INFO L272 TraceCheckUtils]: 6: Hoare triple {308#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 20 then 1 else 0)); {308#true} is VALID [2022-04-27 13:02:24,740 INFO L290 TraceCheckUtils]: 5: Hoare triple {308#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {308#true} is VALID [2022-04-27 13:02:24,740 INFO L272 TraceCheckUtils]: 4: Hoare triple {308#true} call #t~ret6 := main(); {308#true} is VALID [2022-04-27 13:02:24,740 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {308#true} {308#true} #103#return; {308#true} is VALID [2022-04-27 13:02:24,740 INFO L290 TraceCheckUtils]: 2: Hoare triple {308#true} assume true; {308#true} is VALID [2022-04-27 13:02:24,740 INFO L290 TraceCheckUtils]: 1: Hoare triple {308#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); {308#true} is VALID [2022-04-27 13:02:24,740 INFO L272 TraceCheckUtils]: 0: Hoare triple {308#true} call ULTIMATE.init(); {308#true} is VALID [2022-04-27 13:02:24,741 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-04-27 13:02:24,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:02:24,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876410746] [2022-04-27 13:02:24,741 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:02:24,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [296234270] [2022-04-27 13:02:24,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [296234270] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 13:02:24,742 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 13:02:24,742 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2022-04-27 13:02:24,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38516773] [2022-04-27 13:02:24,742 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 13:02:24,743 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 44 [2022-04-27 13:02:24,744 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:02:24,744 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-27 13:02:24,768 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:02:24,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-27 13:02:24,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:02:24,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-27 13:02:24,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-27 13:02:24,770 INFO L87 Difference]: Start difference. First operand 35 states and 46 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-27 13:02:25,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:02:25,038 INFO L93 Difference]: Finished difference Result 52 states and 69 transitions. [2022-04-27 13:02:25,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 13:02:25,039 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 44 [2022-04-27 13:02:25,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:02:25,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-27 13:02:25,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 69 transitions. [2022-04-27 13:02:25,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-27 13:02:25,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 69 transitions. [2022-04-27 13:02:25,044 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 69 transitions. [2022-04-27 13:02:25,088 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:02:25,089 INFO L225 Difference]: With dead ends: 52 [2022-04-27 13:02:25,089 INFO L226 Difference]: Without dead ends: 44 [2022-04-27 13:02:25,090 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 81 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-04-27 13:02:25,090 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 19 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 13:02:25,091 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 128 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 13:02:25,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-04-27 13:02:25,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 37. [2022-04-27 13:02:25,103 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:02:25,103 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand has 37 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 20 states have internal predecessors, (22), 14 states have call successors, (14), 4 states have call predecessors, (14), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 13:02:25,103 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand has 37 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 20 states have internal predecessors, (22), 14 states have call successors, (14), 4 states have call predecessors, (14), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 13:02:25,104 INFO L87 Difference]: Start difference. First operand 44 states. Second operand has 37 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 20 states have internal predecessors, (22), 14 states have call successors, (14), 4 states have call predecessors, (14), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 13:02:25,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:02:25,106 INFO L93 Difference]: Finished difference Result 44 states and 60 transitions. [2022-04-27 13:02:25,106 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 60 transitions. [2022-04-27 13:02:25,107 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:02:25,107 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:02:25,107 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 20 states have internal predecessors, (22), 14 states have call successors, (14), 4 states have call predecessors, (14), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 44 states. [2022-04-27 13:02:25,107 INFO L87 Difference]: Start difference. First operand has 37 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 20 states have internal predecessors, (22), 14 states have call successors, (14), 4 states have call predecessors, (14), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 44 states. [2022-04-27 13:02:25,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:02:25,110 INFO L93 Difference]: Finished difference Result 44 states and 60 transitions. [2022-04-27 13:02:25,110 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 60 transitions. [2022-04-27 13:02:25,110 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:02:25,110 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:02:25,110 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:02:25,110 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:02:25,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 20 states have internal predecessors, (22), 14 states have call successors, (14), 4 states have call predecessors, (14), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 13:02:25,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 48 transitions. [2022-04-27 13:02:25,112 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 48 transitions. Word has length 44 [2022-04-27 13:02:25,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:02:25,113 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 48 transitions. [2022-04-27 13:02:25,113 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-27 13:02:25,113 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 48 transitions. [2022-04-27 13:02:25,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-27 13:02:25,114 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:02:25,114 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 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:02:25,131 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:02:25,331 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:02:25,331 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:02:25,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:02:25,331 INFO L85 PathProgramCache]: Analyzing trace with hash 561616070, now seen corresponding path program 1 times [2022-04-27 13:02:25,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:02:25,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400327746] [2022-04-27 13:02:25,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:02:25,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:02:25,347 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:02:25,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [34989309] [2022-04-27 13:02:25,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:02:25,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:02:25,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:02:25,348 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:02:25,349 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:02:25,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:02:25,384 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-27 13:02:25,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:02:25,393 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:02:25,539 INFO L272 TraceCheckUtils]: 0: Hoare triple {809#true} call ULTIMATE.init(); {809#true} is VALID [2022-04-27 13:02:25,539 INFO L290 TraceCheckUtils]: 1: Hoare triple {809#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); {809#true} is VALID [2022-04-27 13:02:25,539 INFO L290 TraceCheckUtils]: 2: Hoare triple {809#true} assume true; {809#true} is VALID [2022-04-27 13:02:25,539 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {809#true} {809#true} #103#return; {809#true} is VALID [2022-04-27 13:02:25,539 INFO L272 TraceCheckUtils]: 4: Hoare triple {809#true} call #t~ret6 := main(); {809#true} is VALID [2022-04-27 13:02:25,539 INFO L290 TraceCheckUtils]: 5: Hoare triple {809#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {809#true} is VALID [2022-04-27 13:02:25,540 INFO L272 TraceCheckUtils]: 6: Hoare triple {809#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 20 then 1 else 0)); {809#true} is VALID [2022-04-27 13:02:25,540 INFO L290 TraceCheckUtils]: 7: Hoare triple {809#true} ~cond := #in~cond; {809#true} is VALID [2022-04-27 13:02:25,540 INFO L290 TraceCheckUtils]: 8: Hoare triple {809#true} assume !(0 == ~cond); {809#true} is VALID [2022-04-27 13:02:25,540 INFO L290 TraceCheckUtils]: 9: Hoare triple {809#true} assume true; {809#true} is VALID [2022-04-27 13:02:25,540 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {809#true} {809#true} #79#return; {809#true} is VALID [2022-04-27 13:02:25,540 INFO L290 TraceCheckUtils]: 11: Hoare triple {809#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {809#true} is VALID [2022-04-27 13:02:25,540 INFO L272 TraceCheckUtils]: 12: Hoare triple {809#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 20 then 1 else 0)); {809#true} is VALID [2022-04-27 13:02:25,540 INFO L290 TraceCheckUtils]: 13: Hoare triple {809#true} ~cond := #in~cond; {809#true} is VALID [2022-04-27 13:02:25,540 INFO L290 TraceCheckUtils]: 14: Hoare triple {809#true} assume !(0 == ~cond); {809#true} is VALID [2022-04-27 13:02:25,540 INFO L290 TraceCheckUtils]: 15: Hoare triple {809#true} assume true; {809#true} is VALID [2022-04-27 13:02:25,540 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {809#true} {809#true} #81#return; {809#true} is VALID [2022-04-27 13:02:25,540 INFO L272 TraceCheckUtils]: 17: Hoare triple {809#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {809#true} is VALID [2022-04-27 13:02:25,541 INFO L290 TraceCheckUtils]: 18: Hoare triple {809#true} ~cond := #in~cond; {809#true} is VALID [2022-04-27 13:02:25,541 INFO L290 TraceCheckUtils]: 19: Hoare triple {809#true} assume !(0 == ~cond); {809#true} is VALID [2022-04-27 13:02:25,541 INFO L290 TraceCheckUtils]: 20: Hoare triple {809#true} assume true; {809#true} is VALID [2022-04-27 13:02:25,541 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {809#true} {809#true} #83#return; {809#true} is VALID [2022-04-27 13:02:25,541 INFO L272 TraceCheckUtils]: 22: Hoare triple {809#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {809#true} is VALID [2022-04-27 13:02:25,541 INFO L290 TraceCheckUtils]: 23: Hoare triple {809#true} ~cond := #in~cond; {883#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 13:02:25,542 INFO L290 TraceCheckUtils]: 24: Hoare triple {883#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {887#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 13:02:25,542 INFO L290 TraceCheckUtils]: 25: Hoare triple {887#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {887#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 13:02:25,543 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {887#(not (= |assume_abort_if_not_#in~cond| 0))} {809#true} #85#return; {894#(<= 1 main_~y~0)} is VALID [2022-04-27 13:02:25,543 INFO L290 TraceCheckUtils]: 27: Hoare triple {894#(<= 1 main_~y~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {898#(<= 1 main_~b~0)} is VALID [2022-04-27 13:02:25,543 INFO L272 TraceCheckUtils]: 28: Hoare triple {898#(<= 1 main_~b~0)} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {809#true} is VALID [2022-04-27 13:02:25,543 INFO L290 TraceCheckUtils]: 29: Hoare triple {809#true} ~cond := #in~cond; {809#true} is VALID [2022-04-27 13:02:25,543 INFO L290 TraceCheckUtils]: 30: Hoare triple {809#true} assume !(0 == ~cond); {809#true} is VALID [2022-04-27 13:02:25,543 INFO L290 TraceCheckUtils]: 31: Hoare triple {809#true} assume true; {809#true} is VALID [2022-04-27 13:02:25,544 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {809#true} {898#(<= 1 main_~b~0)} #87#return; {898#(<= 1 main_~b~0)} is VALID [2022-04-27 13:02:25,544 INFO L272 TraceCheckUtils]: 33: Hoare triple {898#(<= 1 main_~b~0)} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {809#true} is VALID [2022-04-27 13:02:25,544 INFO L290 TraceCheckUtils]: 34: Hoare triple {809#true} ~cond := #in~cond; {809#true} is VALID [2022-04-27 13:02:25,544 INFO L290 TraceCheckUtils]: 35: Hoare triple {809#true} assume !(0 == ~cond); {809#true} is VALID [2022-04-27 13:02:25,544 INFO L290 TraceCheckUtils]: 36: Hoare triple {809#true} assume true; {809#true} is VALID [2022-04-27 13:02:25,545 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {809#true} {898#(<= 1 main_~b~0)} #89#return; {898#(<= 1 main_~b~0)} is VALID [2022-04-27 13:02:25,545 INFO L290 TraceCheckUtils]: 38: Hoare triple {898#(<= 1 main_~b~0)} assume !false; {898#(<= 1 main_~b~0)} is VALID [2022-04-27 13:02:25,545 INFO L290 TraceCheckUtils]: 39: Hoare triple {898#(<= 1 main_~b~0)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {935#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (<= 1 main_~b~0))} is VALID [2022-04-27 13:02:25,546 INFO L290 TraceCheckUtils]: 40: Hoare triple {935#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (<= 1 main_~b~0))} assume !false; {935#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (<= 1 main_~b~0))} is VALID [2022-04-27 13:02:25,547 INFO L272 TraceCheckUtils]: 41: Hoare triple {935#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (<= 1 main_~b~0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {942#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:02:25,547 INFO L290 TraceCheckUtils]: 42: Hoare triple {942#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {946#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:02:25,547 INFO L290 TraceCheckUtils]: 43: Hoare triple {946#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {810#false} is VALID [2022-04-27 13:02:25,547 INFO L290 TraceCheckUtils]: 44: Hoare triple {810#false} assume !false; {810#false} is VALID [2022-04-27 13:02:25,548 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-04-27 13:02:25,548 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:02:25,731 INFO L290 TraceCheckUtils]: 44: Hoare triple {810#false} assume !false; {810#false} is VALID [2022-04-27 13:02:25,732 INFO L290 TraceCheckUtils]: 43: Hoare triple {946#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {810#false} is VALID [2022-04-27 13:02:25,732 INFO L290 TraceCheckUtils]: 42: Hoare triple {942#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {946#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:02:25,733 INFO L272 TraceCheckUtils]: 41: Hoare triple {962#(= 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)); {942#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:02:25,733 INFO L290 TraceCheckUtils]: 40: Hoare triple {962#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} assume !false; {962#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-27 13:02:25,733 INFO L290 TraceCheckUtils]: 39: Hoare triple {809#true} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {962#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-27 13:02:25,734 INFO L290 TraceCheckUtils]: 38: Hoare triple {809#true} assume !false; {809#true} is VALID [2022-04-27 13:02:25,734 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {809#true} {809#true} #89#return; {809#true} is VALID [2022-04-27 13:02:25,734 INFO L290 TraceCheckUtils]: 36: Hoare triple {809#true} assume true; {809#true} is VALID [2022-04-27 13:02:25,734 INFO L290 TraceCheckUtils]: 35: Hoare triple {809#true} assume !(0 == ~cond); {809#true} is VALID [2022-04-27 13:02:25,734 INFO L290 TraceCheckUtils]: 34: Hoare triple {809#true} ~cond := #in~cond; {809#true} is VALID [2022-04-27 13:02:25,734 INFO L272 TraceCheckUtils]: 33: Hoare triple {809#true} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {809#true} is VALID [2022-04-27 13:02:25,734 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {809#true} {809#true} #87#return; {809#true} is VALID [2022-04-27 13:02:25,734 INFO L290 TraceCheckUtils]: 31: Hoare triple {809#true} assume true; {809#true} is VALID [2022-04-27 13:02:25,734 INFO L290 TraceCheckUtils]: 30: Hoare triple {809#true} assume !(0 == ~cond); {809#true} is VALID [2022-04-27 13:02:25,734 INFO L290 TraceCheckUtils]: 29: Hoare triple {809#true} ~cond := #in~cond; {809#true} is VALID [2022-04-27 13:02:25,734 INFO L272 TraceCheckUtils]: 28: Hoare triple {809#true} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {809#true} is VALID [2022-04-27 13:02:25,735 INFO L290 TraceCheckUtils]: 27: Hoare triple {809#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {809#true} is VALID [2022-04-27 13:02:25,735 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {809#true} {809#true} #85#return; {809#true} is VALID [2022-04-27 13:02:25,735 INFO L290 TraceCheckUtils]: 25: Hoare triple {809#true} assume true; {809#true} is VALID [2022-04-27 13:02:25,735 INFO L290 TraceCheckUtils]: 24: Hoare triple {809#true} assume !(0 == ~cond); {809#true} is VALID [2022-04-27 13:02:25,735 INFO L290 TraceCheckUtils]: 23: Hoare triple {809#true} ~cond := #in~cond; {809#true} is VALID [2022-04-27 13:02:25,735 INFO L272 TraceCheckUtils]: 22: Hoare triple {809#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {809#true} is VALID [2022-04-27 13:02:25,735 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {809#true} {809#true} #83#return; {809#true} is VALID [2022-04-27 13:02:25,735 INFO L290 TraceCheckUtils]: 20: Hoare triple {809#true} assume true; {809#true} is VALID [2022-04-27 13:02:25,735 INFO L290 TraceCheckUtils]: 19: Hoare triple {809#true} assume !(0 == ~cond); {809#true} is VALID [2022-04-27 13:02:25,735 INFO L290 TraceCheckUtils]: 18: Hoare triple {809#true} ~cond := #in~cond; {809#true} is VALID [2022-04-27 13:02:25,735 INFO L272 TraceCheckUtils]: 17: Hoare triple {809#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {809#true} is VALID [2022-04-27 13:02:25,736 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {809#true} {809#true} #81#return; {809#true} is VALID [2022-04-27 13:02:25,736 INFO L290 TraceCheckUtils]: 15: Hoare triple {809#true} assume true; {809#true} is VALID [2022-04-27 13:02:25,736 INFO L290 TraceCheckUtils]: 14: Hoare triple {809#true} assume !(0 == ~cond); {809#true} is VALID [2022-04-27 13:02:25,736 INFO L290 TraceCheckUtils]: 13: Hoare triple {809#true} ~cond := #in~cond; {809#true} is VALID [2022-04-27 13:02:25,738 INFO L272 TraceCheckUtils]: 12: Hoare triple {809#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 20 then 1 else 0)); {809#true} is VALID [2022-04-27 13:02:25,738 INFO L290 TraceCheckUtils]: 11: Hoare triple {809#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {809#true} is VALID [2022-04-27 13:02:25,738 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {809#true} {809#true} #79#return; {809#true} is VALID [2022-04-27 13:02:25,738 INFO L290 TraceCheckUtils]: 9: Hoare triple {809#true} assume true; {809#true} is VALID [2022-04-27 13:02:25,738 INFO L290 TraceCheckUtils]: 8: Hoare triple {809#true} assume !(0 == ~cond); {809#true} is VALID [2022-04-27 13:02:25,738 INFO L290 TraceCheckUtils]: 7: Hoare triple {809#true} ~cond := #in~cond; {809#true} is VALID [2022-04-27 13:02:25,739 INFO L272 TraceCheckUtils]: 6: Hoare triple {809#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 20 then 1 else 0)); {809#true} is VALID [2022-04-27 13:02:25,747 INFO L290 TraceCheckUtils]: 5: Hoare triple {809#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {809#true} is VALID [2022-04-27 13:02:25,747 INFO L272 TraceCheckUtils]: 4: Hoare triple {809#true} call #t~ret6 := main(); {809#true} is VALID [2022-04-27 13:02:25,747 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {809#true} {809#true} #103#return; {809#true} is VALID [2022-04-27 13:02:25,747 INFO L290 TraceCheckUtils]: 2: Hoare triple {809#true} assume true; {809#true} is VALID [2022-04-27 13:02:25,747 INFO L290 TraceCheckUtils]: 1: Hoare triple {809#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); {809#true} is VALID [2022-04-27 13:02:25,747 INFO L272 TraceCheckUtils]: 0: Hoare triple {809#true} call ULTIMATE.init(); {809#true} is VALID [2022-04-27 13:02:25,748 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-27 13:02:25,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:02:25,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400327746] [2022-04-27 13:02:25,748 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:02:25,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [34989309] [2022-04-27 13:02:25,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [34989309] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-27 13:02:25,748 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-27 13:02:25,748 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 10 [2022-04-27 13:02:25,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235483616] [2022-04-27 13:02:25,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:02:25,749 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 45 [2022-04-27 13:02:25,749 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:02:25,749 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-04-27 13:02:25,767 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:02:25,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 13:02:25,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:02:25,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 13:02:25,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-04-27 13:02:25,768 INFO L87 Difference]: Start difference. First operand 37 states and 48 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-04-27 13:02:25,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:02:25,949 INFO L93 Difference]: Finished difference Result 43 states and 53 transitions. [2022-04-27 13:02:25,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 13:02:25,950 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 45 [2022-04-27 13:02:25,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:02:25,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-04-27 13:02:25,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 51 transitions. [2022-04-27 13:02:25,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-04-27 13:02:25,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 51 transitions. [2022-04-27 13:02:25,952 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 51 transitions. [2022-04-27 13:02:25,991 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:02:25,992 INFO L225 Difference]: With dead ends: 43 [2022-04-27 13:02:25,993 INFO L226 Difference]: Without dead ends: 41 [2022-04-27 13:02:25,993 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 80 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-04-27 13:02:25,994 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 6 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 13:02:25,994 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 137 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 13:02:25,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-04-27 13:02:26,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2022-04-27 13:02:26,006 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:02:26,006 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand has 41 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 14 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 13:02:26,007 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand has 41 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 14 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 13:02:26,007 INFO L87 Difference]: Start difference. First operand 41 states. Second operand has 41 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 14 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 13:02:26,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:02:26,009 INFO L93 Difference]: Finished difference Result 41 states and 51 transitions. [2022-04-27 13:02:26,009 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 51 transitions. [2022-04-27 13:02:26,009 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:02:26,009 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:02:26,009 INFO L74 IsIncluded]: Start isIncluded. First operand has 41 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 14 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 41 states. [2022-04-27 13:02:26,010 INFO L87 Difference]: Start difference. First operand has 41 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 14 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 41 states. [2022-04-27 13:02:26,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:02:26,011 INFO L93 Difference]: Finished difference Result 41 states and 51 transitions. [2022-04-27 13:02:26,011 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 51 transitions. [2022-04-27 13:02:26,011 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:02:26,012 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:02:26,012 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:02:26,012 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:02:26,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 14 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 13:02:26,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 51 transitions. [2022-04-27 13:02:26,013 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 51 transitions. Word has length 45 [2022-04-27 13:02:26,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:02:26,013 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 51 transitions. [2022-04-27 13:02:26,014 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-04-27 13:02:26,014 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 51 transitions. [2022-04-27 13:02:26,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-27 13:02:26,032 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:02:26,032 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 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] [2022-04-27 13:02:26,050 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:02:26,240 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:02:26,240 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:02:26,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:02:26,241 INFO L85 PathProgramCache]: Analyzing trace with hash -680064098, now seen corresponding path program 1 times [2022-04-27 13:02:26,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:02:26,241 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316210138] [2022-04-27 13:02:26,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:02:26,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:02:26,260 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:02:26,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [851474752] [2022-04-27 13:02:26,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:02:26,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:02:26,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:02:26,261 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:02:26,262 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:02:26,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:02:26,300 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-27 13:02:26,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:02:26,310 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:02:29,431 INFO L272 TraceCheckUtils]: 0: Hoare triple {1300#true} call ULTIMATE.init(); {1300#true} is VALID [2022-04-27 13:02:29,431 INFO L290 TraceCheckUtils]: 1: Hoare triple {1300#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); {1300#true} is VALID [2022-04-27 13:02:29,431 INFO L290 TraceCheckUtils]: 2: Hoare triple {1300#true} assume true; {1300#true} is VALID [2022-04-27 13:02:29,431 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1300#true} {1300#true} #103#return; {1300#true} is VALID [2022-04-27 13:02:29,431 INFO L272 TraceCheckUtils]: 4: Hoare triple {1300#true} call #t~ret6 := main(); {1300#true} is VALID [2022-04-27 13:02:29,431 INFO L290 TraceCheckUtils]: 5: Hoare triple {1300#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {1300#true} is VALID [2022-04-27 13:02:29,431 INFO L272 TraceCheckUtils]: 6: Hoare triple {1300#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 20 then 1 else 0)); {1300#true} is VALID [2022-04-27 13:02:29,432 INFO L290 TraceCheckUtils]: 7: Hoare triple {1300#true} ~cond := #in~cond; {1300#true} is VALID [2022-04-27 13:02:29,432 INFO L290 TraceCheckUtils]: 8: Hoare triple {1300#true} assume !(0 == ~cond); {1300#true} is VALID [2022-04-27 13:02:29,432 INFO L290 TraceCheckUtils]: 9: Hoare triple {1300#true} assume true; {1300#true} is VALID [2022-04-27 13:02:29,432 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1300#true} {1300#true} #79#return; {1300#true} is VALID [2022-04-27 13:02:29,432 INFO L290 TraceCheckUtils]: 11: Hoare triple {1300#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {1300#true} is VALID [2022-04-27 13:02:29,432 INFO L272 TraceCheckUtils]: 12: Hoare triple {1300#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 20 then 1 else 0)); {1300#true} is VALID [2022-04-27 13:02:29,432 INFO L290 TraceCheckUtils]: 13: Hoare triple {1300#true} ~cond := #in~cond; {1300#true} is VALID [2022-04-27 13:02:29,432 INFO L290 TraceCheckUtils]: 14: Hoare triple {1300#true} assume !(0 == ~cond); {1300#true} is VALID [2022-04-27 13:02:29,432 INFO L290 TraceCheckUtils]: 15: Hoare triple {1300#true} assume true; {1300#true} is VALID [2022-04-27 13:02:29,432 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1300#true} {1300#true} #81#return; {1300#true} is VALID [2022-04-27 13:02:29,432 INFO L272 TraceCheckUtils]: 17: Hoare triple {1300#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {1300#true} is VALID [2022-04-27 13:02:29,433 INFO L290 TraceCheckUtils]: 18: Hoare triple {1300#true} ~cond := #in~cond; {1359#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 13:02:29,433 INFO L290 TraceCheckUtils]: 19: Hoare triple {1359#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {1363#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 13:02:29,433 INFO L290 TraceCheckUtils]: 20: Hoare triple {1363#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {1363#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 13:02:29,434 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1363#(not (= |assume_abort_if_not_#in~cond| 0))} {1300#true} #83#return; {1370#(<= 1 main_~x~0)} is VALID [2022-04-27 13:02:29,434 INFO L272 TraceCheckUtils]: 22: Hoare triple {1370#(<= 1 main_~x~0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1300#true} is VALID [2022-04-27 13:02:29,434 INFO L290 TraceCheckUtils]: 23: Hoare triple {1300#true} ~cond := #in~cond; {1300#true} is VALID [2022-04-27 13:02:29,434 INFO L290 TraceCheckUtils]: 24: Hoare triple {1300#true} assume !(0 == ~cond); {1300#true} is VALID [2022-04-27 13:02:29,434 INFO L290 TraceCheckUtils]: 25: Hoare triple {1300#true} assume true; {1300#true} is VALID [2022-04-27 13:02:29,435 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1300#true} {1370#(<= 1 main_~x~0)} #85#return; {1370#(<= 1 main_~x~0)} is VALID [2022-04-27 13:02:29,435 INFO L290 TraceCheckUtils]: 27: Hoare triple {1370#(<= 1 main_~x~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {1389#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:02:29,435 INFO L272 TraceCheckUtils]: 28: Hoare triple {1389#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {1300#true} is VALID [2022-04-27 13:02:29,435 INFO L290 TraceCheckUtils]: 29: Hoare triple {1300#true} ~cond := #in~cond; {1300#true} is VALID [2022-04-27 13:02:29,435 INFO L290 TraceCheckUtils]: 30: Hoare triple {1300#true} assume !(0 == ~cond); {1300#true} is VALID [2022-04-27 13:02:29,435 INFO L290 TraceCheckUtils]: 31: Hoare triple {1300#true} assume true; {1300#true} is VALID [2022-04-27 13:02:29,436 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1300#true} {1389#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #87#return; {1389#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:02:29,436 INFO L272 TraceCheckUtils]: 33: Hoare triple {1389#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {1300#true} is VALID [2022-04-27 13:02:29,436 INFO L290 TraceCheckUtils]: 34: Hoare triple {1300#true} ~cond := #in~cond; {1300#true} is VALID [2022-04-27 13:02:29,436 INFO L290 TraceCheckUtils]: 35: Hoare triple {1300#true} assume !(0 == ~cond); {1300#true} is VALID [2022-04-27 13:02:29,436 INFO L290 TraceCheckUtils]: 36: Hoare triple {1300#true} assume true; {1300#true} is VALID [2022-04-27 13:02:29,437 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {1300#true} {1389#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #89#return; {1389#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:02:29,437 INFO L290 TraceCheckUtils]: 38: Hoare triple {1389#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !false; {1389#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:02:29,438 INFO L290 TraceCheckUtils]: 39: Hoare triple {1389#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {1389#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:02:29,438 INFO L290 TraceCheckUtils]: 40: Hoare triple {1389#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !false; {1389#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:02:29,438 INFO L272 TraceCheckUtils]: 41: Hoare triple {1389#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {1300#true} is VALID [2022-04-27 13:02:29,438 INFO L290 TraceCheckUtils]: 42: Hoare triple {1300#true} ~cond := #in~cond; {1435#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:02:29,439 INFO L290 TraceCheckUtils]: 43: Hoare triple {1435#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {1439#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:02:29,439 INFO L290 TraceCheckUtils]: 44: Hoare triple {1439#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1439#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:02:29,440 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {1439#(not (= |__VERIFIER_assert_#in~cond| 0))} {1389#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #91#return; {1389#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:02:29,440 INFO L272 TraceCheckUtils]: 46: Hoare triple {1389#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {1449#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:02:29,441 INFO L290 TraceCheckUtils]: 47: Hoare triple {1449#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1453#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:02:29,441 INFO L290 TraceCheckUtils]: 48: Hoare triple {1453#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1301#false} is VALID [2022-04-27 13:02:29,441 INFO L290 TraceCheckUtils]: 49: Hoare triple {1301#false} assume !false; {1301#false} is VALID [2022-04-27 13:02:29,441 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-04-27 13:02:29,441 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:03:02,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:03:02,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316210138] [2022-04-27 13:03:02,642 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:03:02,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [851474752] [2022-04-27 13:03:02,642 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [851474752] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 13:03:02,642 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 13:03:02,642 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2022-04-27 13:03:02,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786399002] [2022-04-27 13:03:02,643 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 13:03:02,643 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 8 states have internal predecessors, (20), 3 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 50 [2022-04-27 13:03:02,643 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:03:02,644 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 2.0) internal successors, (20), 8 states have internal predecessors, (20), 3 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-27 13:03:02,669 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:03:02,669 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-27 13:03:02,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:03:02,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-27 13:03:02,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-04-27 13:03:02,671 INFO L87 Difference]: Start difference. First operand 41 states and 51 transitions. Second operand has 10 states, 10 states have (on average 2.0) internal successors, (20), 8 states have internal predecessors, (20), 3 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-27 13:03:03,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:03:03,190 INFO L93 Difference]: Finished difference Result 54 states and 68 transitions. [2022-04-27 13:03:03,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-27 13:03:03,190 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 8 states have internal predecessors, (20), 3 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 50 [2022-04-27 13:03:03,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:03:03,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.0) internal successors, (20), 8 states have internal predecessors, (20), 3 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-27 13:03:03,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 65 transitions. [2022-04-27 13:03:03,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.0) internal successors, (20), 8 states have internal predecessors, (20), 3 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-27 13:03:03,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 65 transitions. [2022-04-27 13:03:03,194 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 65 transitions. [2022-04-27 13:03:03,244 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:03:03,245 INFO L225 Difference]: With dead ends: 54 [2022-04-27 13:03:03,245 INFO L226 Difference]: Without dead ends: 52 [2022-04-27 13:03:03,246 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2022-04-27 13:03:03,246 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 25 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 13:03:03,246 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 163 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 13:03:03,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-27 13:03:03,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2022-04-27 13:03:03,275 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:03:03,275 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand has 51 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 28 states have internal predecessors, (31), 18 states have call successors, (18), 6 states have call predecessors, (18), 5 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-27 13:03:03,275 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand has 51 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 28 states have internal predecessors, (31), 18 states have call successors, (18), 6 states have call predecessors, (18), 5 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-27 13:03:03,276 INFO L87 Difference]: Start difference. First operand 52 states. Second operand has 51 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 28 states have internal predecessors, (31), 18 states have call successors, (18), 6 states have call predecessors, (18), 5 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-27 13:03:03,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:03:03,277 INFO L93 Difference]: Finished difference Result 52 states and 66 transitions. [2022-04-27 13:03:03,278 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 66 transitions. [2022-04-27 13:03:03,278 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:03:03,278 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:03:03,278 INFO L74 IsIncluded]: Start isIncluded. First operand has 51 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 28 states have internal predecessors, (31), 18 states have call successors, (18), 6 states have call predecessors, (18), 5 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 52 states. [2022-04-27 13:03:03,278 INFO L87 Difference]: Start difference. First operand has 51 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 28 states have internal predecessors, (31), 18 states have call successors, (18), 6 states have call predecessors, (18), 5 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 52 states. [2022-04-27 13:03:03,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:03:03,280 INFO L93 Difference]: Finished difference Result 52 states and 66 transitions. [2022-04-27 13:03:03,280 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 66 transitions. [2022-04-27 13:03:03,280 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:03:03,280 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:03:03,280 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:03:03,280 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:03:03,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 28 states have internal predecessors, (31), 18 states have call successors, (18), 6 states have call predecessors, (18), 5 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-27 13:03:03,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 65 transitions. [2022-04-27 13:03:03,282 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 65 transitions. Word has length 50 [2022-04-27 13:03:03,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:03:03,282 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 65 transitions. [2022-04-27 13:03:03,282 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 8 states have internal predecessors, (20), 3 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-27 13:03:03,283 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 65 transitions. [2022-04-27 13:03:03,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-04-27 13:03:03,283 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:03:03,283 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 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, 1, 1] [2022-04-27 13:03:03,302 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-27 13:03:03,502 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:03:03,502 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:03:03,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:03:03,502 INFO L85 PathProgramCache]: Analyzing trace with hash 606548870, now seen corresponding path program 1 times [2022-04-27 13:03:03,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:03:03,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612647361] [2022-04-27 13:03:03,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:03:03,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:03:03,514 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:03:03,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [381571012] [2022-04-27 13:03:03,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:03:03,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:03:03,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:03:03,519 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:03:03,520 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:03:03,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:03:03,567 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-27 13:03:03,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:03:03,585 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:03:03,970 INFO L272 TraceCheckUtils]: 0: Hoare triple {1746#true} call ULTIMATE.init(); {1746#true} is VALID [2022-04-27 13:03:03,970 INFO L290 TraceCheckUtils]: 1: Hoare triple {1746#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); {1746#true} is VALID [2022-04-27 13:03:03,970 INFO L290 TraceCheckUtils]: 2: Hoare triple {1746#true} assume true; {1746#true} is VALID [2022-04-27 13:03:03,970 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1746#true} {1746#true} #103#return; {1746#true} is VALID [2022-04-27 13:03:03,970 INFO L272 TraceCheckUtils]: 4: Hoare triple {1746#true} call #t~ret6 := main(); {1746#true} is VALID [2022-04-27 13:03:03,970 INFO L290 TraceCheckUtils]: 5: Hoare triple {1746#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {1746#true} is VALID [2022-04-27 13:03:03,970 INFO L272 TraceCheckUtils]: 6: Hoare triple {1746#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 20 then 1 else 0)); {1746#true} is VALID [2022-04-27 13:03:03,970 INFO L290 TraceCheckUtils]: 7: Hoare triple {1746#true} ~cond := #in~cond; {1772#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 13:03:03,971 INFO L290 TraceCheckUtils]: 8: Hoare triple {1772#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {1776#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 13:03:03,971 INFO L290 TraceCheckUtils]: 9: Hoare triple {1776#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {1776#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 13:03:03,971 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1776#(not (= |assume_abort_if_not_#in~cond| 0))} {1746#true} #79#return; {1783#(and (<= main_~x~0 20) (<= 0 main_~x~0))} is VALID [2022-04-27 13:03:03,972 INFO L290 TraceCheckUtils]: 11: Hoare triple {1783#(and (<= main_~x~0 20) (<= 0 main_~x~0))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {1783#(and (<= main_~x~0 20) (<= 0 main_~x~0))} is VALID [2022-04-27 13:03:03,972 INFO L272 TraceCheckUtils]: 12: Hoare triple {1783#(and (<= main_~x~0 20) (<= 0 main_~x~0))} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 20 then 1 else 0)); {1746#true} is VALID [2022-04-27 13:03:03,972 INFO L290 TraceCheckUtils]: 13: Hoare triple {1746#true} ~cond := #in~cond; {1746#true} is VALID [2022-04-27 13:03:03,972 INFO L290 TraceCheckUtils]: 14: Hoare triple {1746#true} assume !(0 == ~cond); {1746#true} is VALID [2022-04-27 13:03:03,972 INFO L290 TraceCheckUtils]: 15: Hoare triple {1746#true} assume true; {1746#true} is VALID [2022-04-27 13:03:03,972 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1746#true} {1783#(and (<= main_~x~0 20) (<= 0 main_~x~0))} #81#return; {1783#(and (<= main_~x~0 20) (<= 0 main_~x~0))} is VALID [2022-04-27 13:03:03,972 INFO L272 TraceCheckUtils]: 17: Hoare triple {1783#(and (<= main_~x~0 20) (<= 0 main_~x~0))} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {1746#true} is VALID [2022-04-27 13:03:03,973 INFO L290 TraceCheckUtils]: 18: Hoare triple {1746#true} ~cond := #in~cond; {1772#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 13:03:03,973 INFO L290 TraceCheckUtils]: 19: Hoare triple {1772#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {1776#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 13:03:03,973 INFO L290 TraceCheckUtils]: 20: Hoare triple {1776#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {1776#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 13:03:03,974 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1776#(not (= |assume_abort_if_not_#in~cond| 0))} {1783#(and (<= main_~x~0 20) (<= 0 main_~x~0))} #83#return; {1817#(and (<= main_~x~0 20) (<= 1 main_~x~0))} is VALID [2022-04-27 13:03:03,974 INFO L272 TraceCheckUtils]: 22: Hoare triple {1817#(and (<= main_~x~0 20) (<= 1 main_~x~0))} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1746#true} is VALID [2022-04-27 13:03:03,974 INFO L290 TraceCheckUtils]: 23: Hoare triple {1746#true} ~cond := #in~cond; {1746#true} is VALID [2022-04-27 13:03:03,974 INFO L290 TraceCheckUtils]: 24: Hoare triple {1746#true} assume !(0 == ~cond); {1746#true} is VALID [2022-04-27 13:03:03,974 INFO L290 TraceCheckUtils]: 25: Hoare triple {1746#true} assume true; {1746#true} is VALID [2022-04-27 13:03:03,974 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1746#true} {1817#(and (<= main_~x~0 20) (<= 1 main_~x~0))} #85#return; {1817#(and (<= main_~x~0 20) (<= 1 main_~x~0))} is VALID [2022-04-27 13:03:03,975 INFO L290 TraceCheckUtils]: 27: Hoare triple {1817#(and (<= main_~x~0 20) (<= 1 main_~x~0))} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {1836#(and (<= main_~x~0 20) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-27 13:03:03,975 INFO L272 TraceCheckUtils]: 28: Hoare triple {1836#(and (<= main_~x~0 20) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {1746#true} is VALID [2022-04-27 13:03:03,975 INFO L290 TraceCheckUtils]: 29: Hoare triple {1746#true} ~cond := #in~cond; {1746#true} is VALID [2022-04-27 13:03:03,975 INFO L290 TraceCheckUtils]: 30: Hoare triple {1746#true} assume !(0 == ~cond); {1746#true} is VALID [2022-04-27 13:03:03,975 INFO L290 TraceCheckUtils]: 31: Hoare triple {1746#true} assume true; {1746#true} is VALID [2022-04-27 13:03:03,976 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1746#true} {1836#(and (<= main_~x~0 20) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #87#return; {1836#(and (<= main_~x~0 20) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-27 13:03:03,976 INFO L272 TraceCheckUtils]: 33: Hoare triple {1836#(and (<= main_~x~0 20) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {1746#true} is VALID [2022-04-27 13:03:03,976 INFO L290 TraceCheckUtils]: 34: Hoare triple {1746#true} ~cond := #in~cond; {1746#true} is VALID [2022-04-27 13:03:03,976 INFO L290 TraceCheckUtils]: 35: Hoare triple {1746#true} assume !(0 == ~cond); {1746#true} is VALID [2022-04-27 13:03:03,976 INFO L290 TraceCheckUtils]: 36: Hoare triple {1746#true} assume true; {1746#true} is VALID [2022-04-27 13:03:03,977 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {1746#true} {1836#(and (<= main_~x~0 20) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #89#return; {1836#(and (<= main_~x~0 20) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-27 13:03:03,977 INFO L290 TraceCheckUtils]: 38: Hoare triple {1836#(and (<= main_~x~0 20) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} assume !false; {1836#(and (<= main_~x~0 20) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-27 13:03:03,977 INFO L290 TraceCheckUtils]: 39: Hoare triple {1836#(and (<= main_~x~0 20) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {1836#(and (<= main_~x~0 20) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-27 13:03:03,978 INFO L290 TraceCheckUtils]: 40: Hoare triple {1836#(and (<= main_~x~0 20) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} assume !false; {1836#(and (<= main_~x~0 20) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-27 13:03:03,978 INFO L272 TraceCheckUtils]: 41: Hoare triple {1836#(and (<= main_~x~0 20) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {1746#true} is VALID [2022-04-27 13:03:03,978 INFO L290 TraceCheckUtils]: 42: Hoare triple {1746#true} ~cond := #in~cond; {1746#true} is VALID [2022-04-27 13:03:03,978 INFO L290 TraceCheckUtils]: 43: Hoare triple {1746#true} assume !(0 == ~cond); {1746#true} is VALID [2022-04-27 13:03:03,978 INFO L290 TraceCheckUtils]: 44: Hoare triple {1746#true} assume true; {1746#true} is VALID [2022-04-27 13:03:03,978 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {1746#true} {1836#(and (<= main_~x~0 20) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #91#return; {1836#(and (<= main_~x~0 20) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-27 13:03:03,978 INFO L272 TraceCheckUtils]: 46: Hoare triple {1836#(and (<= main_~x~0 20) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {1746#true} is VALID [2022-04-27 13:03:03,979 INFO L290 TraceCheckUtils]: 47: Hoare triple {1746#true} ~cond := #in~cond; {1746#true} is VALID [2022-04-27 13:03:03,979 INFO L290 TraceCheckUtils]: 48: Hoare triple {1746#true} assume !(0 == ~cond); {1746#true} is VALID [2022-04-27 13:03:03,979 INFO L290 TraceCheckUtils]: 49: Hoare triple {1746#true} assume true; {1746#true} is VALID [2022-04-27 13:03:03,979 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {1746#true} {1836#(and (<= main_~x~0 20) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #93#return; {1836#(and (<= main_~x~0 20) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-27 13:03:03,980 INFO L272 TraceCheckUtils]: 51: Hoare triple {1836#(and (<= main_~x~0 20) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {1909#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:03:03,980 INFO L290 TraceCheckUtils]: 52: Hoare triple {1909#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1913#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:03:03,980 INFO L290 TraceCheckUtils]: 53: Hoare triple {1913#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1747#false} is VALID [2022-04-27 13:03:03,980 INFO L290 TraceCheckUtils]: 54: Hoare triple {1747#false} assume !false; {1747#false} is VALID [2022-04-27 13:03:03,981 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 7 proven. 21 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-04-27 13:03:03,981 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:03:04,268 INFO L290 TraceCheckUtils]: 54: Hoare triple {1747#false} assume !false; {1747#false} is VALID [2022-04-27 13:03:04,268 INFO L290 TraceCheckUtils]: 53: Hoare triple {1913#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1747#false} is VALID [2022-04-27 13:03:04,269 INFO L290 TraceCheckUtils]: 52: Hoare triple {1909#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1913#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:03:04,269 INFO L272 TraceCheckUtils]: 51: Hoare triple {1929#(= 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)); {1909#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:03:04,270 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {1746#true} {1929#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #93#return; {1929#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 13:03:04,270 INFO L290 TraceCheckUtils]: 49: Hoare triple {1746#true} assume true; {1746#true} is VALID [2022-04-27 13:03:04,270 INFO L290 TraceCheckUtils]: 48: Hoare triple {1746#true} assume !(0 == ~cond); {1746#true} is VALID [2022-04-27 13:03:04,270 INFO L290 TraceCheckUtils]: 47: Hoare triple {1746#true} ~cond := #in~cond; {1746#true} is VALID [2022-04-27 13:03:04,270 INFO L272 TraceCheckUtils]: 46: Hoare triple {1929#(= 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)); {1746#true} is VALID [2022-04-27 13:03:04,271 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {1746#true} {1929#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #91#return; {1929#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 13:03:04,271 INFO L290 TraceCheckUtils]: 44: Hoare triple {1746#true} assume true; {1746#true} is VALID [2022-04-27 13:03:04,271 INFO L290 TraceCheckUtils]: 43: Hoare triple {1746#true} assume !(0 == ~cond); {1746#true} is VALID [2022-04-27 13:03:04,271 INFO L290 TraceCheckUtils]: 42: Hoare triple {1746#true} ~cond := #in~cond; {1746#true} is VALID [2022-04-27 13:03:04,271 INFO L272 TraceCheckUtils]: 41: Hoare triple {1929#(= 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)); {1746#true} is VALID [2022-04-27 13:03:04,271 INFO L290 TraceCheckUtils]: 40: Hoare triple {1929#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !false; {1929#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 13:03:04,272 INFO L290 TraceCheckUtils]: 39: Hoare triple {1929#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {1929#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 13:03:04,272 INFO L290 TraceCheckUtils]: 38: Hoare triple {1929#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !false; {1929#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 13:03:04,273 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {1746#true} {1929#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #89#return; {1929#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 13:03:04,273 INFO L290 TraceCheckUtils]: 36: Hoare triple {1746#true} assume true; {1746#true} is VALID [2022-04-27 13:03:04,273 INFO L290 TraceCheckUtils]: 35: Hoare triple {1746#true} assume !(0 == ~cond); {1746#true} is VALID [2022-04-27 13:03:04,273 INFO L290 TraceCheckUtils]: 34: Hoare triple {1746#true} ~cond := #in~cond; {1746#true} is VALID [2022-04-27 13:03:04,273 INFO L272 TraceCheckUtils]: 33: Hoare triple {1929#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {1746#true} is VALID [2022-04-27 13:03:04,277 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1746#true} {1929#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #87#return; {1929#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 13:03:04,277 INFO L290 TraceCheckUtils]: 31: Hoare triple {1746#true} assume true; {1746#true} is VALID [2022-04-27 13:03:04,277 INFO L290 TraceCheckUtils]: 30: Hoare triple {1746#true} assume !(0 == ~cond); {1746#true} is VALID [2022-04-27 13:03:04,277 INFO L290 TraceCheckUtils]: 29: Hoare triple {1746#true} ~cond := #in~cond; {1746#true} is VALID [2022-04-27 13:03:04,277 INFO L272 TraceCheckUtils]: 28: Hoare triple {1929#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {1746#true} is VALID [2022-04-27 13:03:04,278 INFO L290 TraceCheckUtils]: 27: Hoare triple {1746#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {1929#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 13:03:04,278 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1746#true} {1746#true} #85#return; {1746#true} is VALID [2022-04-27 13:03:04,278 INFO L290 TraceCheckUtils]: 25: Hoare triple {1746#true} assume true; {1746#true} is VALID [2022-04-27 13:03:04,278 INFO L290 TraceCheckUtils]: 24: Hoare triple {1746#true} assume !(0 == ~cond); {1746#true} is VALID [2022-04-27 13:03:04,278 INFO L290 TraceCheckUtils]: 23: Hoare triple {1746#true} ~cond := #in~cond; {1746#true} is VALID [2022-04-27 13:03:04,278 INFO L272 TraceCheckUtils]: 22: Hoare triple {1746#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1746#true} is VALID [2022-04-27 13:03:04,278 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1746#true} {1746#true} #83#return; {1746#true} is VALID [2022-04-27 13:03:04,278 INFO L290 TraceCheckUtils]: 20: Hoare triple {1746#true} assume true; {1746#true} is VALID [2022-04-27 13:03:04,278 INFO L290 TraceCheckUtils]: 19: Hoare triple {1746#true} assume !(0 == ~cond); {1746#true} is VALID [2022-04-27 13:03:04,278 INFO L290 TraceCheckUtils]: 18: Hoare triple {1746#true} ~cond := #in~cond; {1746#true} is VALID [2022-04-27 13:03:04,278 INFO L272 TraceCheckUtils]: 17: Hoare triple {1746#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {1746#true} is VALID [2022-04-27 13:03:04,278 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1746#true} {1746#true} #81#return; {1746#true} is VALID [2022-04-27 13:03:04,279 INFO L290 TraceCheckUtils]: 15: Hoare triple {1746#true} assume true; {1746#true} is VALID [2022-04-27 13:03:04,279 INFO L290 TraceCheckUtils]: 14: Hoare triple {1746#true} assume !(0 == ~cond); {1746#true} is VALID [2022-04-27 13:03:04,279 INFO L290 TraceCheckUtils]: 13: Hoare triple {1746#true} ~cond := #in~cond; {1746#true} is VALID [2022-04-27 13:03:04,279 INFO L272 TraceCheckUtils]: 12: Hoare triple {1746#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 20 then 1 else 0)); {1746#true} is VALID [2022-04-27 13:03:04,279 INFO L290 TraceCheckUtils]: 11: Hoare triple {1746#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {1746#true} is VALID [2022-04-27 13:03:04,279 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1746#true} {1746#true} #79#return; {1746#true} is VALID [2022-04-27 13:03:04,279 INFO L290 TraceCheckUtils]: 9: Hoare triple {1746#true} assume true; {1746#true} is VALID [2022-04-27 13:03:04,279 INFO L290 TraceCheckUtils]: 8: Hoare triple {1746#true} assume !(0 == ~cond); {1746#true} is VALID [2022-04-27 13:03:04,279 INFO L290 TraceCheckUtils]: 7: Hoare triple {1746#true} ~cond := #in~cond; {1746#true} is VALID [2022-04-27 13:03:04,279 INFO L272 TraceCheckUtils]: 6: Hoare triple {1746#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 20 then 1 else 0)); {1746#true} is VALID [2022-04-27 13:03:04,279 INFO L290 TraceCheckUtils]: 5: Hoare triple {1746#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {1746#true} is VALID [2022-04-27 13:03:04,279 INFO L272 TraceCheckUtils]: 4: Hoare triple {1746#true} call #t~ret6 := main(); {1746#true} is VALID [2022-04-27 13:03:04,279 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1746#true} {1746#true} #103#return; {1746#true} is VALID [2022-04-27 13:03:04,279 INFO L290 TraceCheckUtils]: 2: Hoare triple {1746#true} assume true; {1746#true} is VALID [2022-04-27 13:03:04,279 INFO L290 TraceCheckUtils]: 1: Hoare triple {1746#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); {1746#true} is VALID [2022-04-27 13:03:04,279 INFO L272 TraceCheckUtils]: 0: Hoare triple {1746#true} call ULTIMATE.init(); {1746#true} is VALID [2022-04-27 13:03:04,280 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-04-27 13:03:04,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:03:04,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612647361] [2022-04-27 13:03:04,280 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:03:04,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [381571012] [2022-04-27 13:03:04,280 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [381571012] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-27 13:03:04,280 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-27 13:03:04,280 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 10 [2022-04-27 13:03:04,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465233197] [2022-04-27 13:03:04,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:03:04,281 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 55 [2022-04-27 13:03:04,281 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:03:04,281 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-04-27 13:03:04,309 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:03:04,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 13:03:04,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:03:04,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 13:03:04,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-04-27 13:03:04,310 INFO L87 Difference]: Start difference. First operand 51 states and 65 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-04-27 13:03:04,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:03:04,500 INFO L93 Difference]: Finished difference Result 58 states and 71 transitions. [2022-04-27 13:03:04,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 13:03:04,500 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 55 [2022-04-27 13:03:04,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:03:04,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-04-27 13:03:04,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-04-27 13:03:04,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-04-27 13:03:04,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-04-27 13:03:04,503 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 65 transitions. [2022-04-27 13:03:04,557 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:03:04,558 INFO L225 Difference]: With dead ends: 58 [2022-04-27 13:03:04,558 INFO L226 Difference]: Without dead ends: 56 [2022-04-27 13:03:04,558 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 100 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-04-27 13:03:04,559 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 7 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 149 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:03:04,559 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 149 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 13:03:04,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-04-27 13:03:04,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 55. [2022-04-27 13:03:04,592 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:03:04,592 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand has 55 states, 30 states have (on average 1.1333333333333333) internal successors, (34), 31 states have internal predecessors, (34), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-27 13:03:04,593 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand has 55 states, 30 states have (on average 1.1333333333333333) internal successors, (34), 31 states have internal predecessors, (34), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-27 13:03:04,593 INFO L87 Difference]: Start difference. First operand 56 states. Second operand has 55 states, 30 states have (on average 1.1333333333333333) internal successors, (34), 31 states have internal predecessors, (34), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-27 13:03:04,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:03:04,594 INFO L93 Difference]: Finished difference Result 56 states and 69 transitions. [2022-04-27 13:03:04,594 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 69 transitions. [2022-04-27 13:03:04,595 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:03:04,595 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:03:04,595 INFO L74 IsIncluded]: Start isIncluded. First operand has 55 states, 30 states have (on average 1.1333333333333333) internal successors, (34), 31 states have internal predecessors, (34), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 56 states. [2022-04-27 13:03:04,595 INFO L87 Difference]: Start difference. First operand has 55 states, 30 states have (on average 1.1333333333333333) internal successors, (34), 31 states have internal predecessors, (34), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 56 states. [2022-04-27 13:03:04,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:03:04,597 INFO L93 Difference]: Finished difference Result 56 states and 69 transitions. [2022-04-27 13:03:04,597 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 69 transitions. [2022-04-27 13:03:04,597 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:03:04,597 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:03:04,597 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:03:04,597 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:03:04,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 30 states have (on average 1.1333333333333333) internal successors, (34), 31 states have internal predecessors, (34), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-27 13:03:04,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 68 transitions. [2022-04-27 13:03:04,599 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 68 transitions. Word has length 55 [2022-04-27 13:03:04,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:03:04,599 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 68 transitions. [2022-04-27 13:03:04,599 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-04-27 13:03:04,599 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 68 transitions. [2022-04-27 13:03:04,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-04-27 13:03:04,599 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:03:04,599 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 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, 1, 1] [2022-04-27 13:03:04,616 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:03:04,807 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:03:04,807 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:03:04,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:03:04,808 INFO L85 PathProgramCache]: Analyzing trace with hash 1584976990, now seen corresponding path program 1 times [2022-04-27 13:03:04,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:03:04,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154566420] [2022-04-27 13:03:04,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:03:04,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:03:04,819 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:03:04,819 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [867158800] [2022-04-27 13:03:04,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:03:04,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:03:04,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:03:04,822 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:03:04,824 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:03:04,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:03:04,862 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-27 13:03:04,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:03:04,873 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:03:08,469 INFO L272 TraceCheckUtils]: 0: Hoare triple {2370#true} call ULTIMATE.init(); {2370#true} is VALID [2022-04-27 13:03:08,469 INFO L290 TraceCheckUtils]: 1: Hoare triple {2370#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); {2370#true} is VALID [2022-04-27 13:03:08,469 INFO L290 TraceCheckUtils]: 2: Hoare triple {2370#true} assume true; {2370#true} is VALID [2022-04-27 13:03:08,469 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2370#true} {2370#true} #103#return; {2370#true} is VALID [2022-04-27 13:03:08,469 INFO L272 TraceCheckUtils]: 4: Hoare triple {2370#true} call #t~ret6 := main(); {2370#true} is VALID [2022-04-27 13:03:08,469 INFO L290 TraceCheckUtils]: 5: Hoare triple {2370#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {2370#true} is VALID [2022-04-27 13:03:08,469 INFO L272 TraceCheckUtils]: 6: Hoare triple {2370#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 20 then 1 else 0)); {2370#true} is VALID [2022-04-27 13:03:08,469 INFO L290 TraceCheckUtils]: 7: Hoare triple {2370#true} ~cond := #in~cond; {2370#true} is VALID [2022-04-27 13:03:08,469 INFO L290 TraceCheckUtils]: 8: Hoare triple {2370#true} assume !(0 == ~cond); {2370#true} is VALID [2022-04-27 13:03:08,470 INFO L290 TraceCheckUtils]: 9: Hoare triple {2370#true} assume true; {2370#true} is VALID [2022-04-27 13:03:08,470 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2370#true} {2370#true} #79#return; {2370#true} is VALID [2022-04-27 13:03:08,470 INFO L290 TraceCheckUtils]: 11: Hoare triple {2370#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {2370#true} is VALID [2022-04-27 13:03:08,470 INFO L272 TraceCheckUtils]: 12: Hoare triple {2370#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 20 then 1 else 0)); {2370#true} is VALID [2022-04-27 13:03:08,470 INFO L290 TraceCheckUtils]: 13: Hoare triple {2370#true} ~cond := #in~cond; {2370#true} is VALID [2022-04-27 13:03:08,470 INFO L290 TraceCheckUtils]: 14: Hoare triple {2370#true} assume !(0 == ~cond); {2370#true} is VALID [2022-04-27 13:03:08,470 INFO L290 TraceCheckUtils]: 15: Hoare triple {2370#true} assume true; {2370#true} is VALID [2022-04-27 13:03:08,470 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2370#true} {2370#true} #81#return; {2370#true} is VALID [2022-04-27 13:03:08,470 INFO L272 TraceCheckUtils]: 17: Hoare triple {2370#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {2370#true} is VALID [2022-04-27 13:03:08,470 INFO L290 TraceCheckUtils]: 18: Hoare triple {2370#true} ~cond := #in~cond; {2370#true} is VALID [2022-04-27 13:03:08,470 INFO L290 TraceCheckUtils]: 19: Hoare triple {2370#true} assume !(0 == ~cond); {2370#true} is VALID [2022-04-27 13:03:08,470 INFO L290 TraceCheckUtils]: 20: Hoare triple {2370#true} assume true; {2370#true} is VALID [2022-04-27 13:03:08,470 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2370#true} {2370#true} #83#return; {2370#true} is VALID [2022-04-27 13:03:08,470 INFO L272 TraceCheckUtils]: 22: Hoare triple {2370#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {2370#true} is VALID [2022-04-27 13:03:08,470 INFO L290 TraceCheckUtils]: 23: Hoare triple {2370#true} ~cond := #in~cond; {2370#true} is VALID [2022-04-27 13:03:08,470 INFO L290 TraceCheckUtils]: 24: Hoare triple {2370#true} assume !(0 == ~cond); {2370#true} is VALID [2022-04-27 13:03:08,470 INFO L290 TraceCheckUtils]: 25: Hoare triple {2370#true} assume true; {2370#true} is VALID [2022-04-27 13:03:08,470 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {2370#true} {2370#true} #85#return; {2370#true} is VALID [2022-04-27 13:03:08,471 INFO L290 TraceCheckUtils]: 27: Hoare triple {2370#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {2456#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0))} is VALID [2022-04-27 13:03:08,471 INFO L272 TraceCheckUtils]: 28: Hoare triple {2456#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0))} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {2370#true} is VALID [2022-04-27 13:03:08,471 INFO L290 TraceCheckUtils]: 29: Hoare triple {2370#true} ~cond := #in~cond; {2370#true} is VALID [2022-04-27 13:03:08,471 INFO L290 TraceCheckUtils]: 30: Hoare triple {2370#true} assume !(0 == ~cond); {2370#true} is VALID [2022-04-27 13:03:08,471 INFO L290 TraceCheckUtils]: 31: Hoare triple {2370#true} assume true; {2370#true} is VALID [2022-04-27 13:03:08,472 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2370#true} {2456#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0))} #87#return; {2456#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0))} is VALID [2022-04-27 13:03:08,472 INFO L272 TraceCheckUtils]: 33: Hoare triple {2456#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0))} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {2370#true} is VALID [2022-04-27 13:03:08,472 INFO L290 TraceCheckUtils]: 34: Hoare triple {2370#true} ~cond := #in~cond; {2370#true} is VALID [2022-04-27 13:03:08,472 INFO L290 TraceCheckUtils]: 35: Hoare triple {2370#true} assume !(0 == ~cond); {2370#true} is VALID [2022-04-27 13:03:08,473 INFO L290 TraceCheckUtils]: 36: Hoare triple {2370#true} assume true; {2370#true} is VALID [2022-04-27 13:03:08,473 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {2370#true} {2456#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0))} #89#return; {2456#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0))} is VALID [2022-04-27 13:03:08,473 INFO L290 TraceCheckUtils]: 38: Hoare triple {2456#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0))} assume !false; {2456#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0))} is VALID [2022-04-27 13:03:08,474 INFO L290 TraceCheckUtils]: 39: Hoare triple {2456#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {2456#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0))} is VALID [2022-04-27 13:03:08,474 INFO L290 TraceCheckUtils]: 40: Hoare triple {2456#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0))} assume !false; {2456#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0))} is VALID [2022-04-27 13:03:08,474 INFO L272 TraceCheckUtils]: 41: Hoare triple {2456#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {2370#true} is VALID [2022-04-27 13:03:08,474 INFO L290 TraceCheckUtils]: 42: Hoare triple {2370#true} ~cond := #in~cond; {2370#true} is VALID [2022-04-27 13:03:08,474 INFO L290 TraceCheckUtils]: 43: Hoare triple {2370#true} assume !(0 == ~cond); {2370#true} is VALID [2022-04-27 13:03:08,474 INFO L290 TraceCheckUtils]: 44: Hoare triple {2370#true} assume true; {2370#true} is VALID [2022-04-27 13:03:08,475 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {2370#true} {2456#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0))} #91#return; {2456#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0))} is VALID [2022-04-27 13:03:08,475 INFO L272 TraceCheckUtils]: 46: Hoare triple {2456#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {2370#true} is VALID [2022-04-27 13:03:08,475 INFO L290 TraceCheckUtils]: 47: Hoare triple {2370#true} ~cond := #in~cond; {2517#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:03:08,478 INFO L290 TraceCheckUtils]: 48: Hoare triple {2517#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {2521#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:03:08,479 INFO L290 TraceCheckUtils]: 49: Hoare triple {2521#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2521#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:03:08,479 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {2521#(not (= |__VERIFIER_assert_#in~cond| 0))} {2456#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0))} #93#return; {2456#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0))} is VALID [2022-04-27 13:03:08,479 INFO L272 TraceCheckUtils]: 51: Hoare triple {2456#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {2370#true} is VALID [2022-04-27 13:03:08,480 INFO L290 TraceCheckUtils]: 52: Hoare triple {2370#true} ~cond := #in~cond; {2517#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:03:08,480 INFO L290 TraceCheckUtils]: 53: Hoare triple {2517#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {2521#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:03:08,480 INFO L290 TraceCheckUtils]: 54: Hoare triple {2521#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2521#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:03:08,481 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {2521#(not (= |__VERIFIER_assert_#in~cond| 0))} {2456#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0))} #95#return; {2456#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0))} is VALID [2022-04-27 13:03:08,482 INFO L272 TraceCheckUtils]: 56: Hoare triple {2456#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {2546#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:03:08,482 INFO L290 TraceCheckUtils]: 57: Hoare triple {2546#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2550#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:03:08,482 INFO L290 TraceCheckUtils]: 58: Hoare triple {2550#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2371#false} is VALID [2022-04-27 13:03:08,482 INFO L290 TraceCheckUtils]: 59: Hoare triple {2371#false} assume !false; {2371#false} is VALID [2022-04-27 13:03:08,482 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-04-27 13:03:08,482 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:03:58,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:03:58,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154566420] [2022-04-27 13:03:58,331 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:03:58,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [867158800] [2022-04-27 13:03:58,331 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [867158800] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 13:03:58,331 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 13:03:58,331 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2022-04-27 13:03:58,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18780663] [2022-04-27 13:03:58,331 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 13:03:58,332 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 60 [2022-04-27 13:03:58,332 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:03:58,332 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-04-27 13:03:58,365 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:03:58,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-27 13:03:58,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:03:58,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-27 13:03:58,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-04-27 13:03:58,366 INFO L87 Difference]: Start difference. First operand 55 states and 68 transitions. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-04-27 13:03:58,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:03:58,676 INFO L93 Difference]: Finished difference Result 62 states and 74 transitions. [2022-04-27 13:03:58,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 13:03:58,676 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 60 [2022-04-27 13:03:58,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:03:58,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-04-27 13:03:58,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 65 transitions. [2022-04-27 13:03:58,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-04-27 13:03:58,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 65 transitions. [2022-04-27 13:03:58,679 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 65 transitions. [2022-04-27 13:03:58,724 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:03:58,726 INFO L225 Difference]: With dead ends: 62 [2022-04-27 13:03:58,726 INFO L226 Difference]: Without dead ends: 60 [2022-04-27 13:03:58,726 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2022-04-27 13:03:58,727 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 12 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 13:03:58,727 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 138 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 13:03:58,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-04-27 13:03:58,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 59. [2022-04-27 13:03:58,765 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:03:58,765 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand has 59 states, 33 states have (on average 1.121212121212121) internal successors, (37), 34 states have internal predecessors, (37), 18 states have call successors, (18), 8 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-27 13:03:58,765 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand has 59 states, 33 states have (on average 1.121212121212121) internal successors, (37), 34 states have internal predecessors, (37), 18 states have call successors, (18), 8 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-27 13:03:58,765 INFO L87 Difference]: Start difference. First operand 60 states. Second operand has 59 states, 33 states have (on average 1.121212121212121) internal successors, (37), 34 states have internal predecessors, (37), 18 states have call successors, (18), 8 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-27 13:03:58,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:03:58,767 INFO L93 Difference]: Finished difference Result 60 states and 72 transitions. [2022-04-27 13:03:58,767 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 72 transitions. [2022-04-27 13:03:58,767 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:03:58,767 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:03:58,767 INFO L74 IsIncluded]: Start isIncluded. First operand has 59 states, 33 states have (on average 1.121212121212121) internal successors, (37), 34 states have internal predecessors, (37), 18 states have call successors, (18), 8 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 60 states. [2022-04-27 13:03:58,768 INFO L87 Difference]: Start difference. First operand has 59 states, 33 states have (on average 1.121212121212121) internal successors, (37), 34 states have internal predecessors, (37), 18 states have call successors, (18), 8 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 60 states. [2022-04-27 13:03:58,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:03:58,769 INFO L93 Difference]: Finished difference Result 60 states and 72 transitions. [2022-04-27 13:03:58,769 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 72 transitions. [2022-04-27 13:03:58,769 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:03:58,769 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:03:58,769 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:03:58,769 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:03:58,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 33 states have (on average 1.121212121212121) internal successors, (37), 34 states have internal predecessors, (37), 18 states have call successors, (18), 8 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-27 13:03:58,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 71 transitions. [2022-04-27 13:03:58,771 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 71 transitions. Word has length 60 [2022-04-27 13:03:58,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:03:58,771 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 71 transitions. [2022-04-27 13:03:58,771 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-04-27 13:03:58,771 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 71 transitions. [2022-04-27 13:03:58,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-04-27 13:03:58,772 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:03:58,772 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:03:58,795 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:03:58,987 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:03:58,987 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:03:58,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:03:58,988 INFO L85 PathProgramCache]: Analyzing trace with hash -1682830289, now seen corresponding path program 1 times [2022-04-27 13:03:58,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:03:58,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046544927] [2022-04-27 13:03:58,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:03:58,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:03:58,999 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:03:58,999 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [968755204] [2022-04-27 13:03:58,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:03:58,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:03:58,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:03:59,000 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:03:59,001 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:03:59,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:03:59,043 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-27 13:03:59,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:03:59,053 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:03:59,233 INFO L272 TraceCheckUtils]: 0: Hoare triple {2878#true} call ULTIMATE.init(); {2878#true} is VALID [2022-04-27 13:03:59,233 INFO L290 TraceCheckUtils]: 1: Hoare triple {2878#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); {2878#true} is VALID [2022-04-27 13:03:59,233 INFO L290 TraceCheckUtils]: 2: Hoare triple {2878#true} assume true; {2878#true} is VALID [2022-04-27 13:03:59,233 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2878#true} {2878#true} #103#return; {2878#true} is VALID [2022-04-27 13:03:59,233 INFO L272 TraceCheckUtils]: 4: Hoare triple {2878#true} call #t~ret6 := main(); {2878#true} is VALID [2022-04-27 13:03:59,233 INFO L290 TraceCheckUtils]: 5: Hoare triple {2878#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {2878#true} is VALID [2022-04-27 13:03:59,233 INFO L272 TraceCheckUtils]: 6: Hoare triple {2878#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 20 then 1 else 0)); {2878#true} is VALID [2022-04-27 13:03:59,233 INFO L290 TraceCheckUtils]: 7: Hoare triple {2878#true} ~cond := #in~cond; {2878#true} is VALID [2022-04-27 13:03:59,233 INFO L290 TraceCheckUtils]: 8: Hoare triple {2878#true} assume !(0 == ~cond); {2878#true} is VALID [2022-04-27 13:03:59,233 INFO L290 TraceCheckUtils]: 9: Hoare triple {2878#true} assume true; {2878#true} is VALID [2022-04-27 13:03:59,233 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2878#true} {2878#true} #79#return; {2878#true} is VALID [2022-04-27 13:03:59,234 INFO L290 TraceCheckUtils]: 11: Hoare triple {2878#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {2878#true} is VALID [2022-04-27 13:03:59,234 INFO L272 TraceCheckUtils]: 12: Hoare triple {2878#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 20 then 1 else 0)); {2878#true} is VALID [2022-04-27 13:03:59,234 INFO L290 TraceCheckUtils]: 13: Hoare triple {2878#true} ~cond := #in~cond; {2878#true} is VALID [2022-04-27 13:03:59,234 INFO L290 TraceCheckUtils]: 14: Hoare triple {2878#true} assume !(0 == ~cond); {2878#true} is VALID [2022-04-27 13:03:59,234 INFO L290 TraceCheckUtils]: 15: Hoare triple {2878#true} assume true; {2878#true} is VALID [2022-04-27 13:03:59,234 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2878#true} {2878#true} #81#return; {2878#true} is VALID [2022-04-27 13:03:59,234 INFO L272 TraceCheckUtils]: 17: Hoare triple {2878#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {2878#true} is VALID [2022-04-27 13:03:59,234 INFO L290 TraceCheckUtils]: 18: Hoare triple {2878#true} ~cond := #in~cond; {2937#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 13:03:59,235 INFO L290 TraceCheckUtils]: 19: Hoare triple {2937#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {2941#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 13:03:59,235 INFO L290 TraceCheckUtils]: 20: Hoare triple {2941#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {2941#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 13:03:59,235 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2941#(not (= |assume_abort_if_not_#in~cond| 0))} {2878#true} #83#return; {2948#(<= 1 main_~x~0)} is VALID [2022-04-27 13:03:59,235 INFO L272 TraceCheckUtils]: 22: Hoare triple {2948#(<= 1 main_~x~0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {2878#true} is VALID [2022-04-27 13:03:59,235 INFO L290 TraceCheckUtils]: 23: Hoare triple {2878#true} ~cond := #in~cond; {2878#true} is VALID [2022-04-27 13:03:59,235 INFO L290 TraceCheckUtils]: 24: Hoare triple {2878#true} assume !(0 == ~cond); {2878#true} is VALID [2022-04-27 13:03:59,236 INFO L290 TraceCheckUtils]: 25: Hoare triple {2878#true} assume true; {2878#true} is VALID [2022-04-27 13:03:59,236 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {2878#true} {2948#(<= 1 main_~x~0)} #85#return; {2948#(<= 1 main_~x~0)} is VALID [2022-04-27 13:03:59,236 INFO L290 TraceCheckUtils]: 27: Hoare triple {2948#(<= 1 main_~x~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {2967#(<= 1 main_~a~0)} is VALID [2022-04-27 13:03:59,236 INFO L272 TraceCheckUtils]: 28: Hoare triple {2967#(<= 1 main_~a~0)} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {2878#true} is VALID [2022-04-27 13:03:59,237 INFO L290 TraceCheckUtils]: 29: Hoare triple {2878#true} ~cond := #in~cond; {2878#true} is VALID [2022-04-27 13:03:59,237 INFO L290 TraceCheckUtils]: 30: Hoare triple {2878#true} assume !(0 == ~cond); {2878#true} is VALID [2022-04-27 13:03:59,237 INFO L290 TraceCheckUtils]: 31: Hoare triple {2878#true} assume true; {2878#true} is VALID [2022-04-27 13:03:59,237 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2878#true} {2967#(<= 1 main_~a~0)} #87#return; {2967#(<= 1 main_~a~0)} is VALID [2022-04-27 13:03:59,237 INFO L272 TraceCheckUtils]: 33: Hoare triple {2967#(<= 1 main_~a~0)} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {2878#true} is VALID [2022-04-27 13:03:59,239 INFO L290 TraceCheckUtils]: 34: Hoare triple {2878#true} ~cond := #in~cond; {2878#true} is VALID [2022-04-27 13:03:59,240 INFO L290 TraceCheckUtils]: 35: Hoare triple {2878#true} assume !(0 == ~cond); {2878#true} is VALID [2022-04-27 13:03:59,240 INFO L290 TraceCheckUtils]: 36: Hoare triple {2878#true} assume true; {2878#true} is VALID [2022-04-27 13:03:59,241 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {2878#true} {2967#(<= 1 main_~a~0)} #89#return; {2967#(<= 1 main_~a~0)} is VALID [2022-04-27 13:03:59,241 INFO L290 TraceCheckUtils]: 38: Hoare triple {2967#(<= 1 main_~a~0)} assume !false; {2967#(<= 1 main_~a~0)} is VALID [2022-04-27 13:03:59,241 INFO L290 TraceCheckUtils]: 39: Hoare triple {2967#(<= 1 main_~a~0)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {3004#(<= 1 main_~c~0)} is VALID [2022-04-27 13:03:59,242 INFO L290 TraceCheckUtils]: 40: Hoare triple {3004#(<= 1 main_~c~0)} assume !false; {3004#(<= 1 main_~c~0)} is VALID [2022-04-27 13:03:59,242 INFO L272 TraceCheckUtils]: 41: Hoare triple {3004#(<= 1 main_~c~0)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {2878#true} is VALID [2022-04-27 13:03:59,242 INFO L290 TraceCheckUtils]: 42: Hoare triple {2878#true} ~cond := #in~cond; {2878#true} is VALID [2022-04-27 13:03:59,242 INFO L290 TraceCheckUtils]: 43: Hoare triple {2878#true} assume !(0 == ~cond); {2878#true} is VALID [2022-04-27 13:03:59,242 INFO L290 TraceCheckUtils]: 44: Hoare triple {2878#true} assume true; {2878#true} is VALID [2022-04-27 13:03:59,242 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {2878#true} {3004#(<= 1 main_~c~0)} #91#return; {3004#(<= 1 main_~c~0)} is VALID [2022-04-27 13:03:59,242 INFO L272 TraceCheckUtils]: 46: Hoare triple {3004#(<= 1 main_~c~0)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {2878#true} is VALID [2022-04-27 13:03:59,243 INFO L290 TraceCheckUtils]: 47: Hoare triple {2878#true} ~cond := #in~cond; {2878#true} is VALID [2022-04-27 13:03:59,243 INFO L290 TraceCheckUtils]: 48: Hoare triple {2878#true} assume !(0 == ~cond); {2878#true} is VALID [2022-04-27 13:03:59,243 INFO L290 TraceCheckUtils]: 49: Hoare triple {2878#true} assume true; {2878#true} is VALID [2022-04-27 13:03:59,243 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {2878#true} {3004#(<= 1 main_~c~0)} #93#return; {3004#(<= 1 main_~c~0)} is VALID [2022-04-27 13:03:59,243 INFO L272 TraceCheckUtils]: 51: Hoare triple {3004#(<= 1 main_~c~0)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {2878#true} is VALID [2022-04-27 13:03:59,243 INFO L290 TraceCheckUtils]: 52: Hoare triple {2878#true} ~cond := #in~cond; {2878#true} is VALID [2022-04-27 13:03:59,243 INFO L290 TraceCheckUtils]: 53: Hoare triple {2878#true} assume !(0 == ~cond); {2878#true} is VALID [2022-04-27 13:03:59,243 INFO L290 TraceCheckUtils]: 54: Hoare triple {2878#true} assume true; {2878#true} is VALID [2022-04-27 13:03:59,244 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {2878#true} {3004#(<= 1 main_~c~0)} #95#return; {3004#(<= 1 main_~c~0)} is VALID [2022-04-27 13:03:59,244 INFO L272 TraceCheckUtils]: 56: Hoare triple {3004#(<= 1 main_~c~0)} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {2878#true} is VALID [2022-04-27 13:03:59,244 INFO L290 TraceCheckUtils]: 57: Hoare triple {2878#true} ~cond := #in~cond; {2878#true} is VALID [2022-04-27 13:03:59,244 INFO L290 TraceCheckUtils]: 58: Hoare triple {2878#true} assume !(0 == ~cond); {2878#true} is VALID [2022-04-27 13:03:59,244 INFO L290 TraceCheckUtils]: 59: Hoare triple {2878#true} assume true; {2878#true} is VALID [2022-04-27 13:03:59,245 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {2878#true} {3004#(<= 1 main_~c~0)} #97#return; {3004#(<= 1 main_~c~0)} is VALID [2022-04-27 13:03:59,245 INFO L290 TraceCheckUtils]: 61: Hoare triple {3004#(<= 1 main_~c~0)} assume !(~c~0 >= ~b~0); {3004#(<= 1 main_~c~0)} is VALID [2022-04-27 13:03:59,246 INFO L290 TraceCheckUtils]: 62: Hoare triple {3004#(<= 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; {3074#(<= 1 main_~b~0)} is VALID [2022-04-27 13:03:59,246 INFO L290 TraceCheckUtils]: 63: Hoare triple {3074#(<= 1 main_~b~0)} assume !false; {3074#(<= 1 main_~b~0)} is VALID [2022-04-27 13:03:59,246 INFO L290 TraceCheckUtils]: 64: Hoare triple {3074#(<= 1 main_~b~0)} assume !(0 != ~b~0); {2879#false} is VALID [2022-04-27 13:03:59,246 INFO L272 TraceCheckUtils]: 65: Hoare triple {2879#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {2879#false} is VALID [2022-04-27 13:03:59,246 INFO L290 TraceCheckUtils]: 66: Hoare triple {2879#false} ~cond := #in~cond; {2879#false} is VALID [2022-04-27 13:03:59,246 INFO L290 TraceCheckUtils]: 67: Hoare triple {2879#false} assume 0 == ~cond; {2879#false} is VALID [2022-04-27 13:03:59,247 INFO L290 TraceCheckUtils]: 68: Hoare triple {2879#false} assume !false; {2879#false} is VALID [2022-04-27 13:03:59,247 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 14 proven. 11 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2022-04-27 13:03:59,247 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:03:59,524 INFO L290 TraceCheckUtils]: 68: Hoare triple {2879#false} assume !false; {2879#false} is VALID [2022-04-27 13:03:59,524 INFO L290 TraceCheckUtils]: 67: Hoare triple {2879#false} assume 0 == ~cond; {2879#false} is VALID [2022-04-27 13:03:59,524 INFO L290 TraceCheckUtils]: 66: Hoare triple {2879#false} ~cond := #in~cond; {2879#false} is VALID [2022-04-27 13:03:59,524 INFO L272 TraceCheckUtils]: 65: Hoare triple {2879#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {2879#false} is VALID [2022-04-27 13:03:59,524 INFO L290 TraceCheckUtils]: 64: Hoare triple {3074#(<= 1 main_~b~0)} assume !(0 != ~b~0); {2879#false} is VALID [2022-04-27 13:03:59,525 INFO L290 TraceCheckUtils]: 63: Hoare triple {3074#(<= 1 main_~b~0)} assume !false; {3074#(<= 1 main_~b~0)} is VALID [2022-04-27 13:03:59,525 INFO L290 TraceCheckUtils]: 62: Hoare triple {3004#(<= 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; {3074#(<= 1 main_~b~0)} is VALID [2022-04-27 13:03:59,525 INFO L290 TraceCheckUtils]: 61: Hoare triple {3004#(<= 1 main_~c~0)} assume !(~c~0 >= ~b~0); {3004#(<= 1 main_~c~0)} is VALID [2022-04-27 13:03:59,526 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {2878#true} {3004#(<= 1 main_~c~0)} #97#return; {3004#(<= 1 main_~c~0)} is VALID [2022-04-27 13:03:59,526 INFO L290 TraceCheckUtils]: 59: Hoare triple {2878#true} assume true; {2878#true} is VALID [2022-04-27 13:03:59,526 INFO L290 TraceCheckUtils]: 58: Hoare triple {2878#true} assume !(0 == ~cond); {2878#true} is VALID [2022-04-27 13:03:59,526 INFO L290 TraceCheckUtils]: 57: Hoare triple {2878#true} ~cond := #in~cond; {2878#true} is VALID [2022-04-27 13:03:59,526 INFO L272 TraceCheckUtils]: 56: Hoare triple {3004#(<= 1 main_~c~0)} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {2878#true} is VALID [2022-04-27 13:03:59,527 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {2878#true} {3004#(<= 1 main_~c~0)} #95#return; {3004#(<= 1 main_~c~0)} is VALID [2022-04-27 13:03:59,527 INFO L290 TraceCheckUtils]: 54: Hoare triple {2878#true} assume true; {2878#true} is VALID [2022-04-27 13:03:59,527 INFO L290 TraceCheckUtils]: 53: Hoare triple {2878#true} assume !(0 == ~cond); {2878#true} is VALID [2022-04-27 13:03:59,527 INFO L290 TraceCheckUtils]: 52: Hoare triple {2878#true} ~cond := #in~cond; {2878#true} is VALID [2022-04-27 13:03:59,527 INFO L272 TraceCheckUtils]: 51: Hoare triple {3004#(<= 1 main_~c~0)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {2878#true} is VALID [2022-04-27 13:03:59,527 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {2878#true} {3004#(<= 1 main_~c~0)} #93#return; {3004#(<= 1 main_~c~0)} is VALID [2022-04-27 13:03:59,527 INFO L290 TraceCheckUtils]: 49: Hoare triple {2878#true} assume true; {2878#true} is VALID [2022-04-27 13:03:59,527 INFO L290 TraceCheckUtils]: 48: Hoare triple {2878#true} assume !(0 == ~cond); {2878#true} is VALID [2022-04-27 13:03:59,527 INFO L290 TraceCheckUtils]: 47: Hoare triple {2878#true} ~cond := #in~cond; {2878#true} is VALID [2022-04-27 13:03:59,527 INFO L272 TraceCheckUtils]: 46: Hoare triple {3004#(<= 1 main_~c~0)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {2878#true} is VALID [2022-04-27 13:03:59,528 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {2878#true} {3004#(<= 1 main_~c~0)} #91#return; {3004#(<= 1 main_~c~0)} is VALID [2022-04-27 13:03:59,528 INFO L290 TraceCheckUtils]: 44: Hoare triple {2878#true} assume true; {2878#true} is VALID [2022-04-27 13:03:59,528 INFO L290 TraceCheckUtils]: 43: Hoare triple {2878#true} assume !(0 == ~cond); {2878#true} is VALID [2022-04-27 13:03:59,528 INFO L290 TraceCheckUtils]: 42: Hoare triple {2878#true} ~cond := #in~cond; {2878#true} is VALID [2022-04-27 13:03:59,528 INFO L272 TraceCheckUtils]: 41: Hoare triple {3004#(<= 1 main_~c~0)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {2878#true} is VALID [2022-04-27 13:03:59,528 INFO L290 TraceCheckUtils]: 40: Hoare triple {3004#(<= 1 main_~c~0)} assume !false; {3004#(<= 1 main_~c~0)} is VALID [2022-04-27 13:03:59,529 INFO L290 TraceCheckUtils]: 39: Hoare triple {2967#(<= 1 main_~a~0)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {3004#(<= 1 main_~c~0)} is VALID [2022-04-27 13:03:59,529 INFO L290 TraceCheckUtils]: 38: Hoare triple {2967#(<= 1 main_~a~0)} assume !false; {2967#(<= 1 main_~a~0)} is VALID [2022-04-27 13:03:59,529 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {2878#true} {2967#(<= 1 main_~a~0)} #89#return; {2967#(<= 1 main_~a~0)} is VALID [2022-04-27 13:03:59,529 INFO L290 TraceCheckUtils]: 36: Hoare triple {2878#true} assume true; {2878#true} is VALID [2022-04-27 13:03:59,529 INFO L290 TraceCheckUtils]: 35: Hoare triple {2878#true} assume !(0 == ~cond); {2878#true} is VALID [2022-04-27 13:03:59,529 INFO L290 TraceCheckUtils]: 34: Hoare triple {2878#true} ~cond := #in~cond; {2878#true} is VALID [2022-04-27 13:03:59,529 INFO L272 TraceCheckUtils]: 33: Hoare triple {2967#(<= 1 main_~a~0)} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {2878#true} is VALID [2022-04-27 13:03:59,530 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2878#true} {2967#(<= 1 main_~a~0)} #87#return; {2967#(<= 1 main_~a~0)} is VALID [2022-04-27 13:03:59,530 INFO L290 TraceCheckUtils]: 31: Hoare triple {2878#true} assume true; {2878#true} is VALID [2022-04-27 13:03:59,530 INFO L290 TraceCheckUtils]: 30: Hoare triple {2878#true} assume !(0 == ~cond); {2878#true} is VALID [2022-04-27 13:03:59,530 INFO L290 TraceCheckUtils]: 29: Hoare triple {2878#true} ~cond := #in~cond; {2878#true} is VALID [2022-04-27 13:03:59,530 INFO L272 TraceCheckUtils]: 28: Hoare triple {2967#(<= 1 main_~a~0)} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {2878#true} is VALID [2022-04-27 13:03:59,530 INFO L290 TraceCheckUtils]: 27: Hoare triple {2948#(<= 1 main_~x~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {2967#(<= 1 main_~a~0)} is VALID [2022-04-27 13:03:59,531 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {2878#true} {2948#(<= 1 main_~x~0)} #85#return; {2948#(<= 1 main_~x~0)} is VALID [2022-04-27 13:03:59,531 INFO L290 TraceCheckUtils]: 25: Hoare triple {2878#true} assume true; {2878#true} is VALID [2022-04-27 13:03:59,531 INFO L290 TraceCheckUtils]: 24: Hoare triple {2878#true} assume !(0 == ~cond); {2878#true} is VALID [2022-04-27 13:03:59,531 INFO L290 TraceCheckUtils]: 23: Hoare triple {2878#true} ~cond := #in~cond; {2878#true} is VALID [2022-04-27 13:03:59,531 INFO L272 TraceCheckUtils]: 22: Hoare triple {2948#(<= 1 main_~x~0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {2878#true} is VALID [2022-04-27 13:03:59,531 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2941#(not (= |assume_abort_if_not_#in~cond| 0))} {2878#true} #83#return; {2948#(<= 1 main_~x~0)} is VALID [2022-04-27 13:03:59,532 INFO L290 TraceCheckUtils]: 20: Hoare triple {2941#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {2941#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 13:03:59,532 INFO L290 TraceCheckUtils]: 19: Hoare triple {3243#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} assume !(0 == ~cond); {2941#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 13:03:59,532 INFO L290 TraceCheckUtils]: 18: Hoare triple {2878#true} ~cond := #in~cond; {3243#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} is VALID [2022-04-27 13:03:59,532 INFO L272 TraceCheckUtils]: 17: Hoare triple {2878#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {2878#true} is VALID [2022-04-27 13:03:59,532 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2878#true} {2878#true} #81#return; {2878#true} is VALID [2022-04-27 13:03:59,532 INFO L290 TraceCheckUtils]: 15: Hoare triple {2878#true} assume true; {2878#true} is VALID [2022-04-27 13:03:59,532 INFO L290 TraceCheckUtils]: 14: Hoare triple {2878#true} assume !(0 == ~cond); {2878#true} is VALID [2022-04-27 13:03:59,533 INFO L290 TraceCheckUtils]: 13: Hoare triple {2878#true} ~cond := #in~cond; {2878#true} is VALID [2022-04-27 13:03:59,533 INFO L272 TraceCheckUtils]: 12: Hoare triple {2878#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 20 then 1 else 0)); {2878#true} is VALID [2022-04-27 13:03:59,533 INFO L290 TraceCheckUtils]: 11: Hoare triple {2878#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {2878#true} is VALID [2022-04-27 13:03:59,533 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2878#true} {2878#true} #79#return; {2878#true} is VALID [2022-04-27 13:03:59,533 INFO L290 TraceCheckUtils]: 9: Hoare triple {2878#true} assume true; {2878#true} is VALID [2022-04-27 13:03:59,533 INFO L290 TraceCheckUtils]: 8: Hoare triple {2878#true} assume !(0 == ~cond); {2878#true} is VALID [2022-04-27 13:03:59,533 INFO L290 TraceCheckUtils]: 7: Hoare triple {2878#true} ~cond := #in~cond; {2878#true} is VALID [2022-04-27 13:03:59,533 INFO L272 TraceCheckUtils]: 6: Hoare triple {2878#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 20 then 1 else 0)); {2878#true} is VALID [2022-04-27 13:03:59,533 INFO L290 TraceCheckUtils]: 5: Hoare triple {2878#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {2878#true} is VALID [2022-04-27 13:03:59,533 INFO L272 TraceCheckUtils]: 4: Hoare triple {2878#true} call #t~ret6 := main(); {2878#true} is VALID [2022-04-27 13:03:59,533 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2878#true} {2878#true} #103#return; {2878#true} is VALID [2022-04-27 13:03:59,533 INFO L290 TraceCheckUtils]: 2: Hoare triple {2878#true} assume true; {2878#true} is VALID [2022-04-27 13:03:59,533 INFO L290 TraceCheckUtils]: 1: Hoare triple {2878#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); {2878#true} is VALID [2022-04-27 13:03:59,533 INFO L272 TraceCheckUtils]: 0: Hoare triple {2878#true} call ULTIMATE.init(); {2878#true} is VALID [2022-04-27 13:03:59,533 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 14 proven. 11 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2022-04-27 13:03:59,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:03:59,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046544927] [2022-04-27 13:03:59,534 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:03:59,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [968755204] [2022-04-27 13:03:59,534 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [968755204] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 13:03:59,534 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 13:03:59,534 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2022-04-27 13:03:59,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547641916] [2022-04-27 13:03:59,534 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 13:03:59,534 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 5 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) Word has length 69 [2022-04-27 13:03:59,535 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:03:59,535 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 5 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2022-04-27 13:03:59,566 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:03:59,566 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-27 13:03:59,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:03:59,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-27 13:03:59,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-04-27 13:03:59,566 INFO L87 Difference]: Start difference. First operand 59 states and 71 transitions. Second operand has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 5 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2022-04-27 13:04:00,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:04:00,162 INFO L93 Difference]: Finished difference Result 106 states and 146 transitions. [2022-04-27 13:04:00,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-27 13:04:00,162 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 5 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) Word has length 69 [2022-04-27 13:04:00,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:04:00,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 5 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2022-04-27 13:04:00,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 110 transitions. [2022-04-27 13:04:00,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 5 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2022-04-27 13:04:00,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 110 transitions. [2022-04-27 13:04:00,168 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 110 transitions. [2022-04-27 13:04:00,244 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:04:00,246 INFO L225 Difference]: With dead ends: 106 [2022-04-27 13:04:00,246 INFO L226 Difference]: Without dead ends: 98 [2022-04-27 13:04:00,247 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 129 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:04:00,247 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 30 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 13:04:00,248 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 259 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 13:04:00,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-04-27 13:04:00,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 89. [2022-04-27 13:04:00,328 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:04:00,328 INFO L82 GeneralOperation]: Start isEquivalent. First operand 98 states. Second operand has 89 states, 47 states have (on average 1.1914893617021276) internal successors, (56), 48 states have internal predecessors, (56), 34 states have call successors, (34), 8 states have call predecessors, (34), 7 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2022-04-27 13:04:00,328 INFO L74 IsIncluded]: Start isIncluded. First operand 98 states. Second operand has 89 states, 47 states have (on average 1.1914893617021276) internal successors, (56), 48 states have internal predecessors, (56), 34 states have call successors, (34), 8 states have call predecessors, (34), 7 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2022-04-27 13:04:00,329 INFO L87 Difference]: Start difference. First operand 98 states. Second operand has 89 states, 47 states have (on average 1.1914893617021276) internal successors, (56), 48 states have internal predecessors, (56), 34 states have call successors, (34), 8 states have call predecessors, (34), 7 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2022-04-27 13:04:00,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:04:00,332 INFO L93 Difference]: Finished difference Result 98 states and 137 transitions. [2022-04-27 13:04:00,332 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 137 transitions. [2022-04-27 13:04:00,332 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:04:00,332 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:04:00,332 INFO L74 IsIncluded]: Start isIncluded. First operand has 89 states, 47 states have (on average 1.1914893617021276) internal successors, (56), 48 states have internal predecessors, (56), 34 states have call successors, (34), 8 states have call predecessors, (34), 7 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) Second operand 98 states. [2022-04-27 13:04:00,333 INFO L87 Difference]: Start difference. First operand has 89 states, 47 states have (on average 1.1914893617021276) internal successors, (56), 48 states have internal predecessors, (56), 34 states have call successors, (34), 8 states have call predecessors, (34), 7 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) Second operand 98 states. [2022-04-27 13:04:00,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:04:00,335 INFO L93 Difference]: Finished difference Result 98 states and 137 transitions. [2022-04-27 13:04:00,335 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 137 transitions. [2022-04-27 13:04:00,336 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:04:00,336 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:04:00,336 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:04:00,336 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:04:00,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 47 states have (on average 1.1914893617021276) internal successors, (56), 48 states have internal predecessors, (56), 34 states have call successors, (34), 8 states have call predecessors, (34), 7 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2022-04-27 13:04:00,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 122 transitions. [2022-04-27 13:04:00,339 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 122 transitions. Word has length 69 [2022-04-27 13:04:00,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:04:00,339 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 122 transitions. [2022-04-27 13:04:00,339 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 5 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2022-04-27 13:04:00,340 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 122 transitions. [2022-04-27 13:04:00,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-04-27 13:04:00,340 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:04:00,362 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 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, 1, 1, 1, 1] [2022-04-27 13:04:00,381 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:04:00,575 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:04:00,575 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:04:00,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:04:00,576 INFO L85 PathProgramCache]: Analyzing trace with hash 376741854, now seen corresponding path program 1 times [2022-04-27 13:04:00,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:04:00,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602390125] [2022-04-27 13:04:00,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:04:00,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:04:00,587 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:04:00,587 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1877604687] [2022-04-27 13:04:00,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:04:00,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:04:00,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:04:00,588 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:04:00,589 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:04:00,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:04:00,632 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-27 13:04:00,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:04:00,643 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:04:00,863 INFO L272 TraceCheckUtils]: 0: Hoare triple {3815#true} call ULTIMATE.init(); {3815#true} is VALID [2022-04-27 13:04:00,863 INFO L290 TraceCheckUtils]: 1: Hoare triple {3815#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); {3815#true} is VALID [2022-04-27 13:04:00,863 INFO L290 TraceCheckUtils]: 2: Hoare triple {3815#true} assume true; {3815#true} is VALID [2022-04-27 13:04:00,863 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3815#true} {3815#true} #103#return; {3815#true} is VALID [2022-04-27 13:04:00,863 INFO L272 TraceCheckUtils]: 4: Hoare triple {3815#true} call #t~ret6 := main(); {3815#true} is VALID [2022-04-27 13:04:00,863 INFO L290 TraceCheckUtils]: 5: Hoare triple {3815#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {3815#true} is VALID [2022-04-27 13:04:00,863 INFO L272 TraceCheckUtils]: 6: Hoare triple {3815#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 20 then 1 else 0)); {3815#true} is VALID [2022-04-27 13:04:00,863 INFO L290 TraceCheckUtils]: 7: Hoare triple {3815#true} ~cond := #in~cond; {3815#true} is VALID [2022-04-27 13:04:00,863 INFO L290 TraceCheckUtils]: 8: Hoare triple {3815#true} assume !(0 == ~cond); {3815#true} is VALID [2022-04-27 13:04:00,863 INFO L290 TraceCheckUtils]: 9: Hoare triple {3815#true} assume true; {3815#true} is VALID [2022-04-27 13:04:00,864 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3815#true} {3815#true} #79#return; {3815#true} is VALID [2022-04-27 13:04:00,864 INFO L290 TraceCheckUtils]: 11: Hoare triple {3815#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {3815#true} is VALID [2022-04-27 13:04:00,864 INFO L272 TraceCheckUtils]: 12: Hoare triple {3815#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 20 then 1 else 0)); {3815#true} is VALID [2022-04-27 13:04:00,864 INFO L290 TraceCheckUtils]: 13: Hoare triple {3815#true} ~cond := #in~cond; {3815#true} is VALID [2022-04-27 13:04:00,864 INFO L290 TraceCheckUtils]: 14: Hoare triple {3815#true} assume !(0 == ~cond); {3815#true} is VALID [2022-04-27 13:04:00,864 INFO L290 TraceCheckUtils]: 15: Hoare triple {3815#true} assume true; {3815#true} is VALID [2022-04-27 13:04:00,864 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3815#true} {3815#true} #81#return; {3815#true} is VALID [2022-04-27 13:04:00,864 INFO L272 TraceCheckUtils]: 17: Hoare triple {3815#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {3815#true} is VALID [2022-04-27 13:04:00,864 INFO L290 TraceCheckUtils]: 18: Hoare triple {3815#true} ~cond := #in~cond; {3815#true} is VALID [2022-04-27 13:04:00,864 INFO L290 TraceCheckUtils]: 19: Hoare triple {3815#true} assume !(0 == ~cond); {3815#true} is VALID [2022-04-27 13:04:00,864 INFO L290 TraceCheckUtils]: 20: Hoare triple {3815#true} assume true; {3815#true} is VALID [2022-04-27 13:04:00,864 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {3815#true} {3815#true} #83#return; {3815#true} is VALID [2022-04-27 13:04:00,864 INFO L272 TraceCheckUtils]: 22: Hoare triple {3815#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {3815#true} is VALID [2022-04-27 13:04:00,864 INFO L290 TraceCheckUtils]: 23: Hoare triple {3815#true} ~cond := #in~cond; {3815#true} is VALID [2022-04-27 13:04:00,864 INFO L290 TraceCheckUtils]: 24: Hoare triple {3815#true} assume !(0 == ~cond); {3815#true} is VALID [2022-04-27 13:04:00,864 INFO L290 TraceCheckUtils]: 25: Hoare triple {3815#true} assume true; {3815#true} is VALID [2022-04-27 13:04:00,864 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {3815#true} {3815#true} #85#return; {3815#true} is VALID [2022-04-27 13:04:00,865 INFO L290 TraceCheckUtils]: 27: Hoare triple {3815#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {3901#(= main_~q~0 0)} is VALID [2022-04-27 13:04:00,865 INFO L272 TraceCheckUtils]: 28: Hoare triple {3901#(= main_~q~0 0)} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {3815#true} is VALID [2022-04-27 13:04:00,865 INFO L290 TraceCheckUtils]: 29: Hoare triple {3815#true} ~cond := #in~cond; {3815#true} is VALID [2022-04-27 13:04:00,865 INFO L290 TraceCheckUtils]: 30: Hoare triple {3815#true} assume !(0 == ~cond); {3815#true} is VALID [2022-04-27 13:04:00,865 INFO L290 TraceCheckUtils]: 31: Hoare triple {3815#true} assume true; {3815#true} is VALID [2022-04-27 13:04:00,865 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {3815#true} {3901#(= main_~q~0 0)} #87#return; {3901#(= main_~q~0 0)} is VALID [2022-04-27 13:04:00,865 INFO L272 TraceCheckUtils]: 33: Hoare triple {3901#(= main_~q~0 0)} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {3815#true} is VALID [2022-04-27 13:04:00,865 INFO L290 TraceCheckUtils]: 34: Hoare triple {3815#true} ~cond := #in~cond; {3815#true} is VALID [2022-04-27 13:04:00,865 INFO L290 TraceCheckUtils]: 35: Hoare triple {3815#true} assume !(0 == ~cond); {3815#true} is VALID [2022-04-27 13:04:00,865 INFO L290 TraceCheckUtils]: 36: Hoare triple {3815#true} assume true; {3815#true} is VALID [2022-04-27 13:04:00,866 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {3815#true} {3901#(= main_~q~0 0)} #89#return; {3901#(= main_~q~0 0)} is VALID [2022-04-27 13:04:00,866 INFO L290 TraceCheckUtils]: 38: Hoare triple {3901#(= main_~q~0 0)} assume !false; {3901#(= main_~q~0 0)} is VALID [2022-04-27 13:04:00,866 INFO L290 TraceCheckUtils]: 39: Hoare triple {3901#(= main_~q~0 0)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {3901#(= main_~q~0 0)} is VALID [2022-04-27 13:04:00,866 INFO L290 TraceCheckUtils]: 40: Hoare triple {3901#(= main_~q~0 0)} assume !false; {3901#(= main_~q~0 0)} is VALID [2022-04-27 13:04:00,866 INFO L272 TraceCheckUtils]: 41: Hoare triple {3901#(= main_~q~0 0)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {3815#true} is VALID [2022-04-27 13:04:00,867 INFO L290 TraceCheckUtils]: 42: Hoare triple {3815#true} ~cond := #in~cond; {3815#true} is VALID [2022-04-27 13:04:00,867 INFO L290 TraceCheckUtils]: 43: Hoare triple {3815#true} assume !(0 == ~cond); {3815#true} is VALID [2022-04-27 13:04:00,867 INFO L290 TraceCheckUtils]: 44: Hoare triple {3815#true} assume true; {3815#true} is VALID [2022-04-27 13:04:00,867 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {3815#true} {3901#(= main_~q~0 0)} #91#return; {3901#(= main_~q~0 0)} is VALID [2022-04-27 13:04:00,867 INFO L272 TraceCheckUtils]: 46: Hoare triple {3901#(= main_~q~0 0)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {3815#true} is VALID [2022-04-27 13:04:00,867 INFO L290 TraceCheckUtils]: 47: Hoare triple {3815#true} ~cond := #in~cond; {3815#true} is VALID [2022-04-27 13:04:00,867 INFO L290 TraceCheckUtils]: 48: Hoare triple {3815#true} assume !(0 == ~cond); {3815#true} is VALID [2022-04-27 13:04:00,867 INFO L290 TraceCheckUtils]: 49: Hoare triple {3815#true} assume true; {3815#true} is VALID [2022-04-27 13:04:00,868 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {3815#true} {3901#(= main_~q~0 0)} #93#return; {3901#(= main_~q~0 0)} is VALID [2022-04-27 13:04:00,868 INFO L272 TraceCheckUtils]: 51: Hoare triple {3901#(= main_~q~0 0)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {3815#true} is VALID [2022-04-27 13:04:00,868 INFO L290 TraceCheckUtils]: 52: Hoare triple {3815#true} ~cond := #in~cond; {3977#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:04:00,868 INFO L290 TraceCheckUtils]: 53: Hoare triple {3977#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {3981#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:04:00,869 INFO L290 TraceCheckUtils]: 54: Hoare triple {3981#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3981#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:04:00,869 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {3981#(not (= |__VERIFIER_assert_#in~cond| 0))} {3901#(= main_~q~0 0)} #95#return; {3988#(and (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~q~0 0))} is VALID [2022-04-27 13:04:00,869 INFO L272 TraceCheckUtils]: 56: Hoare triple {3988#(and (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~q~0 0))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {3815#true} is VALID [2022-04-27 13:04:00,869 INFO L290 TraceCheckUtils]: 57: Hoare triple {3815#true} ~cond := #in~cond; {3815#true} is VALID [2022-04-27 13:04:00,869 INFO L290 TraceCheckUtils]: 58: Hoare triple {3815#true} assume !(0 == ~cond); {3815#true} is VALID [2022-04-27 13:04:00,869 INFO L290 TraceCheckUtils]: 59: Hoare triple {3815#true} assume true; {3815#true} is VALID [2022-04-27 13:04:00,870 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {3815#true} {3988#(and (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~q~0 0))} #97#return; {3988#(and (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~q~0 0))} is VALID [2022-04-27 13:04:00,870 INFO L290 TraceCheckUtils]: 61: Hoare triple {3988#(and (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~q~0 0))} assume !(~c~0 >= ~b~0); {3988#(and (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~q~0 0))} is VALID [2022-04-27 13:04:00,871 INFO L290 TraceCheckUtils]: 62: Hoare triple {3988#(and (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~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; {4010#(and (= main_~p~0 0) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-27 13:04:00,871 INFO L290 TraceCheckUtils]: 63: Hoare triple {4010#(and (= main_~p~0 0) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} assume !false; {4010#(and (= main_~p~0 0) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-27 13:04:00,871 INFO L290 TraceCheckUtils]: 64: Hoare triple {4010#(and (= main_~p~0 0) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {4010#(and (= main_~p~0 0) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-27 13:04:00,872 INFO L290 TraceCheckUtils]: 65: Hoare triple {4010#(and (= main_~p~0 0) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} assume !false; {4010#(and (= main_~p~0 0) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-27 13:04:00,872 INFO L272 TraceCheckUtils]: 66: Hoare triple {4010#(and (= main_~p~0 0) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {3815#true} is VALID [2022-04-27 13:04:00,872 INFO L290 TraceCheckUtils]: 67: Hoare triple {3815#true} ~cond := #in~cond; {3815#true} is VALID [2022-04-27 13:04:00,872 INFO L290 TraceCheckUtils]: 68: Hoare triple {3815#true} assume !(0 == ~cond); {3815#true} is VALID [2022-04-27 13:04:00,872 INFO L290 TraceCheckUtils]: 69: Hoare triple {3815#true} assume true; {3815#true} is VALID [2022-04-27 13:04:00,872 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {3815#true} {4010#(and (= main_~p~0 0) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} #91#return; {4010#(and (= main_~p~0 0) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-27 13:04:00,873 INFO L272 TraceCheckUtils]: 71: Hoare triple {4010#(and (= main_~p~0 0) (= 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)); {4038#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:04:00,873 INFO L290 TraceCheckUtils]: 72: Hoare triple {4038#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4042#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:04:00,873 INFO L290 TraceCheckUtils]: 73: Hoare triple {4042#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3816#false} is VALID [2022-04-27 13:04:00,874 INFO L290 TraceCheckUtils]: 74: Hoare triple {3816#false} assume !false; {3816#false} is VALID [2022-04-27 13:04:00,874 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 15 proven. 12 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2022-04-27 13:04:00,874 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:04:13,229 INFO L290 TraceCheckUtils]: 74: Hoare triple {3816#false} assume !false; {3816#false} is VALID [2022-04-27 13:04:13,230 INFO L290 TraceCheckUtils]: 73: Hoare triple {4042#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3816#false} is VALID [2022-04-27 13:04:13,230 INFO L290 TraceCheckUtils]: 72: Hoare triple {4038#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4042#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:04:13,231 INFO L272 TraceCheckUtils]: 71: Hoare triple {4058#(= 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)); {4038#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:04:13,231 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {3815#true} {4058#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #91#return; {4058#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 13:04:13,231 INFO L290 TraceCheckUtils]: 69: Hoare triple {3815#true} assume true; {3815#true} is VALID [2022-04-27 13:04:13,231 INFO L290 TraceCheckUtils]: 68: Hoare triple {3815#true} assume !(0 == ~cond); {3815#true} is VALID [2022-04-27 13:04:13,231 INFO L290 TraceCheckUtils]: 67: Hoare triple {3815#true} ~cond := #in~cond; {3815#true} is VALID [2022-04-27 13:04:13,231 INFO L272 TraceCheckUtils]: 66: Hoare triple {4058#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {3815#true} is VALID [2022-04-27 13:04:13,232 INFO L290 TraceCheckUtils]: 65: Hoare triple {4058#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !false; {4058#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 13:04:13,232 INFO L290 TraceCheckUtils]: 64: Hoare triple {4058#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {4058#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 13:04:13,232 INFO L290 TraceCheckUtils]: 63: Hoare triple {4058#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !false; {4058#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 13:04:13,233 INFO L290 TraceCheckUtils]: 62: Hoare triple {4086#(= 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; {4058#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 13:04:13,233 INFO L290 TraceCheckUtils]: 61: Hoare triple {4086#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !(~c~0 >= ~b~0); {4086#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 13:04:13,234 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {3815#true} {4086#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #97#return; {4086#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 13:04:13,234 INFO L290 TraceCheckUtils]: 59: Hoare triple {3815#true} assume true; {3815#true} is VALID [2022-04-27 13:04:13,234 INFO L290 TraceCheckUtils]: 58: Hoare triple {3815#true} assume !(0 == ~cond); {3815#true} is VALID [2022-04-27 13:04:13,234 INFO L290 TraceCheckUtils]: 57: Hoare triple {3815#true} ~cond := #in~cond; {3815#true} is VALID [2022-04-27 13:04:13,234 INFO L272 TraceCheckUtils]: 56: Hoare triple {4086#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {3815#true} is VALID [2022-04-27 13:04:13,235 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {3981#(not (= |__VERIFIER_assert_#in~cond| 0))} {3815#true} #95#return; {4086#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 13:04:13,235 INFO L290 TraceCheckUtils]: 54: Hoare triple {3981#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3981#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:04:13,235 INFO L290 TraceCheckUtils]: 53: Hoare triple {4117#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {3981#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:04:13,236 INFO L290 TraceCheckUtils]: 52: Hoare triple {3815#true} ~cond := #in~cond; {4117#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 13:04:13,236 INFO L272 TraceCheckUtils]: 51: Hoare triple {3815#true} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {3815#true} is VALID [2022-04-27 13:04:13,236 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {3815#true} {3815#true} #93#return; {3815#true} is VALID [2022-04-27 13:04:13,236 INFO L290 TraceCheckUtils]: 49: Hoare triple {3815#true} assume true; {3815#true} is VALID [2022-04-27 13:04:13,236 INFO L290 TraceCheckUtils]: 48: Hoare triple {3815#true} assume !(0 == ~cond); {3815#true} is VALID [2022-04-27 13:04:13,236 INFO L290 TraceCheckUtils]: 47: Hoare triple {3815#true} ~cond := #in~cond; {3815#true} is VALID [2022-04-27 13:04:13,236 INFO L272 TraceCheckUtils]: 46: Hoare triple {3815#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {3815#true} is VALID [2022-04-27 13:04:13,236 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {3815#true} {3815#true} #91#return; {3815#true} is VALID [2022-04-27 13:04:13,236 INFO L290 TraceCheckUtils]: 44: Hoare triple {3815#true} assume true; {3815#true} is VALID [2022-04-27 13:04:13,236 INFO L290 TraceCheckUtils]: 43: Hoare triple {3815#true} assume !(0 == ~cond); {3815#true} is VALID [2022-04-27 13:04:13,236 INFO L290 TraceCheckUtils]: 42: Hoare triple {3815#true} ~cond := #in~cond; {3815#true} is VALID [2022-04-27 13:04:13,236 INFO L272 TraceCheckUtils]: 41: Hoare triple {3815#true} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {3815#true} is VALID [2022-04-27 13:04:13,236 INFO L290 TraceCheckUtils]: 40: Hoare triple {3815#true} assume !false; {3815#true} is VALID [2022-04-27 13:04:13,236 INFO L290 TraceCheckUtils]: 39: Hoare triple {3815#true} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {3815#true} is VALID [2022-04-27 13:04:13,236 INFO L290 TraceCheckUtils]: 38: Hoare triple {3815#true} assume !false; {3815#true} is VALID [2022-04-27 13:04:13,237 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {3815#true} {3815#true} #89#return; {3815#true} is VALID [2022-04-27 13:04:13,237 INFO L290 TraceCheckUtils]: 36: Hoare triple {3815#true} assume true; {3815#true} is VALID [2022-04-27 13:04:13,237 INFO L290 TraceCheckUtils]: 35: Hoare triple {3815#true} assume !(0 == ~cond); {3815#true} is VALID [2022-04-27 13:04:13,237 INFO L290 TraceCheckUtils]: 34: Hoare triple {3815#true} ~cond := #in~cond; {3815#true} is VALID [2022-04-27 13:04:13,237 INFO L272 TraceCheckUtils]: 33: Hoare triple {3815#true} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {3815#true} is VALID [2022-04-27 13:04:13,237 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {3815#true} {3815#true} #87#return; {3815#true} is VALID [2022-04-27 13:04:13,237 INFO L290 TraceCheckUtils]: 31: Hoare triple {3815#true} assume true; {3815#true} is VALID [2022-04-27 13:04:13,237 INFO L290 TraceCheckUtils]: 30: Hoare triple {3815#true} assume !(0 == ~cond); {3815#true} is VALID [2022-04-27 13:04:13,237 INFO L290 TraceCheckUtils]: 29: Hoare triple {3815#true} ~cond := #in~cond; {3815#true} is VALID [2022-04-27 13:04:13,237 INFO L272 TraceCheckUtils]: 28: Hoare triple {3815#true} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {3815#true} is VALID [2022-04-27 13:04:13,237 INFO L290 TraceCheckUtils]: 27: Hoare triple {3815#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {3815#true} is VALID [2022-04-27 13:04:13,237 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {3815#true} {3815#true} #85#return; {3815#true} is VALID [2022-04-27 13:04:13,237 INFO L290 TraceCheckUtils]: 25: Hoare triple {3815#true} assume true; {3815#true} is VALID [2022-04-27 13:04:13,237 INFO L290 TraceCheckUtils]: 24: Hoare triple {3815#true} assume !(0 == ~cond); {3815#true} is VALID [2022-04-27 13:04:13,237 INFO L290 TraceCheckUtils]: 23: Hoare triple {3815#true} ~cond := #in~cond; {3815#true} is VALID [2022-04-27 13:04:13,237 INFO L272 TraceCheckUtils]: 22: Hoare triple {3815#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {3815#true} is VALID [2022-04-27 13:04:13,237 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {3815#true} {3815#true} #83#return; {3815#true} is VALID [2022-04-27 13:04:13,237 INFO L290 TraceCheckUtils]: 20: Hoare triple {3815#true} assume true; {3815#true} is VALID [2022-04-27 13:04:13,237 INFO L290 TraceCheckUtils]: 19: Hoare triple {3815#true} assume !(0 == ~cond); {3815#true} is VALID [2022-04-27 13:04:13,237 INFO L290 TraceCheckUtils]: 18: Hoare triple {3815#true} ~cond := #in~cond; {3815#true} is VALID [2022-04-27 13:04:13,237 INFO L272 TraceCheckUtils]: 17: Hoare triple {3815#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {3815#true} is VALID [2022-04-27 13:04:13,238 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3815#true} {3815#true} #81#return; {3815#true} is VALID [2022-04-27 13:04:13,238 INFO L290 TraceCheckUtils]: 15: Hoare triple {3815#true} assume true; {3815#true} is VALID [2022-04-27 13:04:13,238 INFO L290 TraceCheckUtils]: 14: Hoare triple {3815#true} assume !(0 == ~cond); {3815#true} is VALID [2022-04-27 13:04:13,238 INFO L290 TraceCheckUtils]: 13: Hoare triple {3815#true} ~cond := #in~cond; {3815#true} is VALID [2022-04-27 13:04:13,238 INFO L272 TraceCheckUtils]: 12: Hoare triple {3815#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 20 then 1 else 0)); {3815#true} is VALID [2022-04-27 13:04:13,238 INFO L290 TraceCheckUtils]: 11: Hoare triple {3815#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {3815#true} is VALID [2022-04-27 13:04:13,238 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3815#true} {3815#true} #79#return; {3815#true} is VALID [2022-04-27 13:04:13,238 INFO L290 TraceCheckUtils]: 9: Hoare triple {3815#true} assume true; {3815#true} is VALID [2022-04-27 13:04:13,238 INFO L290 TraceCheckUtils]: 8: Hoare triple {3815#true} assume !(0 == ~cond); {3815#true} is VALID [2022-04-27 13:04:13,238 INFO L290 TraceCheckUtils]: 7: Hoare triple {3815#true} ~cond := #in~cond; {3815#true} is VALID [2022-04-27 13:04:13,238 INFO L272 TraceCheckUtils]: 6: Hoare triple {3815#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 20 then 1 else 0)); {3815#true} is VALID [2022-04-27 13:04:13,238 INFO L290 TraceCheckUtils]: 5: Hoare triple {3815#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {3815#true} is VALID [2022-04-27 13:04:13,238 INFO L272 TraceCheckUtils]: 4: Hoare triple {3815#true} call #t~ret6 := main(); {3815#true} is VALID [2022-04-27 13:04:13,238 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3815#true} {3815#true} #103#return; {3815#true} is VALID [2022-04-27 13:04:13,238 INFO L290 TraceCheckUtils]: 2: Hoare triple {3815#true} assume true; {3815#true} is VALID [2022-04-27 13:04:13,238 INFO L290 TraceCheckUtils]: 1: Hoare triple {3815#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); {3815#true} is VALID [2022-04-27 13:04:13,238 INFO L272 TraceCheckUtils]: 0: Hoare triple {3815#true} call ULTIMATE.init(); {3815#true} is VALID [2022-04-27 13:04:13,238 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 20 proven. 7 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2022-04-27 13:04:13,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:04:13,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602390125] [2022-04-27 13:04:13,239 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:04:13,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1877604687] [2022-04-27 13:04:13,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1877604687] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 13:04:13,239 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 13:04:13,239 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 12 [2022-04-27 13:04:13,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885429964] [2022-04-27 13:04:13,239 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 13:04:13,240 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.0) internal successors, (36), 11 states have internal predecessors, (36), 6 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (19), 6 states have call predecessors, (19), 6 states have call successors, (19) Word has length 75 [2022-04-27 13:04:13,240 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:04:13,240 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 3.0) internal successors, (36), 11 states have internal predecessors, (36), 6 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (19), 6 states have call predecessors, (19), 6 states have call successors, (19) [2022-04-27 13:04:13,292 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:04:13,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-27 13:04:13,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:04:13,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-27 13:04:13,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-04-27 13:04:13,293 INFO L87 Difference]: Start difference. First operand 89 states and 122 transitions. Second operand has 12 states, 12 states have (on average 3.0) internal successors, (36), 11 states have internal predecessors, (36), 6 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (19), 6 states have call predecessors, (19), 6 states have call successors, (19) [2022-04-27 13:04:14,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:04:14,597 INFO L93 Difference]: Finished difference Result 132 states and 187 transitions. [2022-04-27 13:04:14,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-27 13:04:14,597 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.0) internal successors, (36), 11 states have internal predecessors, (36), 6 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (19), 6 states have call predecessors, (19), 6 states have call successors, (19) Word has length 75 [2022-04-27 13:04:14,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:04:14,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 3.0) internal successors, (36), 11 states have internal predecessors, (36), 6 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (19), 6 states have call predecessors, (19), 6 states have call successors, (19) [2022-04-27 13:04:14,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 97 transitions. [2022-04-27 13:04:14,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 3.0) internal successors, (36), 11 states have internal predecessors, (36), 6 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (19), 6 states have call predecessors, (19), 6 states have call successors, (19) [2022-04-27 13:04:14,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 97 transitions. [2022-04-27 13:04:14,601 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 97 transitions. [2022-04-27 13:04:14,682 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:04:14,684 INFO L225 Difference]: With dead ends: 132 [2022-04-27 13:04:14,684 INFO L226 Difference]: Without dead ends: 128 [2022-04-27 13:04:14,684 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 141 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2022-04-27 13:04:14,684 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 30 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 349 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-27 13:04:14,685 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 255 Invalid, 391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 349 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-27 13:04:14,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2022-04-27 13:04:14,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 96. [2022-04-27 13:04:14,779 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:04:14,780 INFO L82 GeneralOperation]: Start isEquivalent. First operand 128 states. Second operand has 96 states, 51 states have (on average 1.1764705882352942) internal successors, (60), 53 states have internal predecessors, (60), 36 states have call successors, (36), 9 states have call predecessors, (36), 8 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2022-04-27 13:04:14,780 INFO L74 IsIncluded]: Start isIncluded. First operand 128 states. Second operand has 96 states, 51 states have (on average 1.1764705882352942) internal successors, (60), 53 states have internal predecessors, (60), 36 states have call successors, (36), 9 states have call predecessors, (36), 8 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2022-04-27 13:04:14,780 INFO L87 Difference]: Start difference. First operand 128 states. Second operand has 96 states, 51 states have (on average 1.1764705882352942) internal successors, (60), 53 states have internal predecessors, (60), 36 states have call successors, (36), 9 states have call predecessors, (36), 8 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2022-04-27 13:04:14,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:04:14,784 INFO L93 Difference]: Finished difference Result 128 states and 181 transitions. [2022-04-27 13:04:14,784 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 181 transitions. [2022-04-27 13:04:14,784 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:04:14,784 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:04:14,784 INFO L74 IsIncluded]: Start isIncluded. First operand has 96 states, 51 states have (on average 1.1764705882352942) internal successors, (60), 53 states have internal predecessors, (60), 36 states have call successors, (36), 9 states have call predecessors, (36), 8 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) Second operand 128 states. [2022-04-27 13:04:14,785 INFO L87 Difference]: Start difference. First operand has 96 states, 51 states have (on average 1.1764705882352942) internal successors, (60), 53 states have internal predecessors, (60), 36 states have call successors, (36), 9 states have call predecessors, (36), 8 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) Second operand 128 states. [2022-04-27 13:04:14,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:04:14,788 INFO L93 Difference]: Finished difference Result 128 states and 181 transitions. [2022-04-27 13:04:14,788 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 181 transitions. [2022-04-27 13:04:14,788 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:04:14,788 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:04:14,789 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:04:14,789 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:04:14,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 51 states have (on average 1.1764705882352942) internal successors, (60), 53 states have internal predecessors, (60), 36 states have call successors, (36), 9 states have call predecessors, (36), 8 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2022-04-27 13:04:14,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 130 transitions. [2022-04-27 13:04:14,791 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 130 transitions. Word has length 75 [2022-04-27 13:04:14,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:04:14,791 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 130 transitions. [2022-04-27 13:04:14,792 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.0) internal successors, (36), 11 states have internal predecessors, (36), 6 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (19), 6 states have call predecessors, (19), 6 states have call successors, (19) [2022-04-27 13:04:14,792 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 130 transitions. [2022-04-27 13:04:14,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-04-27 13:04:14,792 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:04:14,792 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 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, 1, 1] [2022-04-27 13:04:14,808 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:04:15,001 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:04:15,002 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:04:15,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:04:15,002 INFO L85 PathProgramCache]: Analyzing trace with hash -1245952186, now seen corresponding path program 2 times [2022-04-27 13:04:15,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:04:15,002 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514042912] [2022-04-27 13:04:15,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:04:15,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:04:15,013 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:04:15,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [363118858] [2022-04-27 13:04:15,013 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 13:04:15,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:04:15,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:04:15,018 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:04:15,018 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:04:15,061 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 13:04:15,061 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 13:04:15,062 INFO L263 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-27 13:04:15,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:04:15,074 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:04:16,014 INFO L272 TraceCheckUtils]: 0: Hoare triple {4909#true} call ULTIMATE.init(); {4909#true} is VALID [2022-04-27 13:04:16,014 INFO L290 TraceCheckUtils]: 1: Hoare triple {4909#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); {4909#true} is VALID [2022-04-27 13:04:16,014 INFO L290 TraceCheckUtils]: 2: Hoare triple {4909#true} assume true; {4909#true} is VALID [2022-04-27 13:04:16,014 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4909#true} {4909#true} #103#return; {4909#true} is VALID [2022-04-27 13:04:16,015 INFO L272 TraceCheckUtils]: 4: Hoare triple {4909#true} call #t~ret6 := main(); {4909#true} is VALID [2022-04-27 13:04:16,015 INFO L290 TraceCheckUtils]: 5: Hoare triple {4909#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {4909#true} is VALID [2022-04-27 13:04:16,015 INFO L272 TraceCheckUtils]: 6: Hoare triple {4909#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 20 then 1 else 0)); {4909#true} is VALID [2022-04-27 13:04:16,015 INFO L290 TraceCheckUtils]: 7: Hoare triple {4909#true} ~cond := #in~cond; {4909#true} is VALID [2022-04-27 13:04:16,015 INFO L290 TraceCheckUtils]: 8: Hoare triple {4909#true} assume !(0 == ~cond); {4909#true} is VALID [2022-04-27 13:04:16,015 INFO L290 TraceCheckUtils]: 9: Hoare triple {4909#true} assume true; {4909#true} is VALID [2022-04-27 13:04:16,015 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4909#true} {4909#true} #79#return; {4909#true} is VALID [2022-04-27 13:04:16,015 INFO L290 TraceCheckUtils]: 11: Hoare triple {4909#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {4909#true} is VALID [2022-04-27 13:04:16,015 INFO L272 TraceCheckUtils]: 12: Hoare triple {4909#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 20 then 1 else 0)); {4909#true} is VALID [2022-04-27 13:04:16,015 INFO L290 TraceCheckUtils]: 13: Hoare triple {4909#true} ~cond := #in~cond; {4953#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 13:04:16,015 INFO L290 TraceCheckUtils]: 14: Hoare triple {4953#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {4957#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 13:04:16,016 INFO L290 TraceCheckUtils]: 15: Hoare triple {4957#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {4957#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 13:04:16,016 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {4957#(not (= |assume_abort_if_not_#in~cond| 0))} {4909#true} #81#return; {4964#(and (<= 0 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-27 13:04:16,016 INFO L272 TraceCheckUtils]: 17: Hoare triple {4964#(and (<= 0 main_~y~0) (<= main_~y~0 20))} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {4909#true} is VALID [2022-04-27 13:04:16,016 INFO L290 TraceCheckUtils]: 18: Hoare triple {4909#true} ~cond := #in~cond; {4909#true} is VALID [2022-04-27 13:04:16,016 INFO L290 TraceCheckUtils]: 19: Hoare triple {4909#true} assume !(0 == ~cond); {4909#true} is VALID [2022-04-27 13:04:16,016 INFO L290 TraceCheckUtils]: 20: Hoare triple {4909#true} assume true; {4909#true} is VALID [2022-04-27 13:04:16,017 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {4909#true} {4964#(and (<= 0 main_~y~0) (<= main_~y~0 20))} #83#return; {4964#(and (<= 0 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-27 13:04:16,017 INFO L272 TraceCheckUtils]: 22: Hoare triple {4964#(and (<= 0 main_~y~0) (<= main_~y~0 20))} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {4909#true} is VALID [2022-04-27 13:04:16,017 INFO L290 TraceCheckUtils]: 23: Hoare triple {4909#true} ~cond := #in~cond; {4909#true} is VALID [2022-04-27 13:04:16,017 INFO L290 TraceCheckUtils]: 24: Hoare triple {4909#true} assume !(0 == ~cond); {4909#true} is VALID [2022-04-27 13:04:16,017 INFO L290 TraceCheckUtils]: 25: Hoare triple {4909#true} assume true; {4909#true} is VALID [2022-04-27 13:04:16,031 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {4909#true} {4964#(and (<= 0 main_~y~0) (<= main_~y~0 20))} #85#return; {4964#(and (<= 0 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-27 13:04:16,032 INFO L290 TraceCheckUtils]: 27: Hoare triple {4964#(and (<= 0 main_~y~0) (<= main_~y~0 20))} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {4998#(and (<= 0 main_~y~0) (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= main_~y~0 20) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:04:16,032 INFO L272 TraceCheckUtils]: 28: Hoare triple {4998#(and (<= 0 main_~y~0) (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= main_~y~0 20) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {4909#true} is VALID [2022-04-27 13:04:16,032 INFO L290 TraceCheckUtils]: 29: Hoare triple {4909#true} ~cond := #in~cond; {4909#true} is VALID [2022-04-27 13:04:16,032 INFO L290 TraceCheckUtils]: 30: Hoare triple {4909#true} assume !(0 == ~cond); {4909#true} is VALID [2022-04-27 13:04:16,032 INFO L290 TraceCheckUtils]: 31: Hoare triple {4909#true} assume true; {4909#true} is VALID [2022-04-27 13:04:16,032 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {4909#true} {4998#(and (<= 0 main_~y~0) (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= main_~y~0 20) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #87#return; {4998#(and (<= 0 main_~y~0) (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= main_~y~0 20) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:04:16,032 INFO L272 TraceCheckUtils]: 33: Hoare triple {4998#(and (<= 0 main_~y~0) (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= main_~y~0 20) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {4909#true} is VALID [2022-04-27 13:04:16,033 INFO L290 TraceCheckUtils]: 34: Hoare triple {4909#true} ~cond := #in~cond; {4909#true} is VALID [2022-04-27 13:04:16,033 INFO L290 TraceCheckUtils]: 35: Hoare triple {4909#true} assume !(0 == ~cond); {4909#true} is VALID [2022-04-27 13:04:16,033 INFO L290 TraceCheckUtils]: 36: Hoare triple {4909#true} assume true; {4909#true} is VALID [2022-04-27 13:04:16,033 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {4909#true} {4998#(and (<= 0 main_~y~0) (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= main_~y~0 20) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #89#return; {4998#(and (<= 0 main_~y~0) (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= main_~y~0 20) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:04:16,034 INFO L290 TraceCheckUtils]: 38: Hoare triple {4998#(and (<= 0 main_~y~0) (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= main_~y~0 20) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !false; {4998#(and (<= 0 main_~y~0) (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= main_~y~0 20) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:04:16,034 INFO L290 TraceCheckUtils]: 39: Hoare triple {4998#(and (<= 0 main_~y~0) (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= main_~y~0 20) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {5035#(and (<= 0 main_~y~0) (= main_~r~0 0) (not (= main_~y~0 0)) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (<= main_~y~0 20) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:04:16,034 INFO L290 TraceCheckUtils]: 40: Hoare triple {5035#(and (<= 0 main_~y~0) (= main_~r~0 0) (not (= main_~y~0 0)) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (<= main_~y~0 20) (= main_~c~0 main_~x~0) (= main_~p~0 1))} assume !false; {5035#(and (<= 0 main_~y~0) (= main_~r~0 0) (not (= main_~y~0 0)) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (<= main_~y~0 20) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:04:16,034 INFO L272 TraceCheckUtils]: 41: Hoare triple {5035#(and (<= 0 main_~y~0) (= main_~r~0 0) (not (= main_~y~0 0)) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (<= main_~y~0 20) (= 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)); {4909#true} is VALID [2022-04-27 13:04:16,035 INFO L290 TraceCheckUtils]: 42: Hoare triple {4909#true} ~cond := #in~cond; {4909#true} is VALID [2022-04-27 13:04:16,035 INFO L290 TraceCheckUtils]: 43: Hoare triple {4909#true} assume !(0 == ~cond); {4909#true} is VALID [2022-04-27 13:04:16,035 INFO L290 TraceCheckUtils]: 44: Hoare triple {4909#true} assume true; {4909#true} is VALID [2022-04-27 13:04:16,035 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {4909#true} {5035#(and (<= 0 main_~y~0) (= main_~r~0 0) (not (= main_~y~0 0)) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (<= main_~y~0 20) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #91#return; {5035#(and (<= 0 main_~y~0) (= main_~r~0 0) (not (= main_~y~0 0)) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (<= main_~y~0 20) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:04:16,035 INFO L272 TraceCheckUtils]: 46: Hoare triple {5035#(and (<= 0 main_~y~0) (= main_~r~0 0) (not (= main_~y~0 0)) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (<= main_~y~0 20) (= 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)); {4909#true} is VALID [2022-04-27 13:04:16,035 INFO L290 TraceCheckUtils]: 47: Hoare triple {4909#true} ~cond := #in~cond; {4909#true} is VALID [2022-04-27 13:04:16,035 INFO L290 TraceCheckUtils]: 48: Hoare triple {4909#true} assume !(0 == ~cond); {4909#true} is VALID [2022-04-27 13:04:16,035 INFO L290 TraceCheckUtils]: 49: Hoare triple {4909#true} assume true; {4909#true} is VALID [2022-04-27 13:04:16,036 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {4909#true} {5035#(and (<= 0 main_~y~0) (= main_~r~0 0) (not (= main_~y~0 0)) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (<= main_~y~0 20) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #93#return; {5035#(and (<= 0 main_~y~0) (= main_~r~0 0) (not (= main_~y~0 0)) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (<= main_~y~0 20) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:04:16,036 INFO L272 TraceCheckUtils]: 51: Hoare triple {5035#(and (<= 0 main_~y~0) (= main_~r~0 0) (not (= main_~y~0 0)) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (<= main_~y~0 20) (= 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)); {4909#true} is VALID [2022-04-27 13:04:16,036 INFO L290 TraceCheckUtils]: 52: Hoare triple {4909#true} ~cond := #in~cond; {4909#true} is VALID [2022-04-27 13:04:16,036 INFO L290 TraceCheckUtils]: 53: Hoare triple {4909#true} assume !(0 == ~cond); {4909#true} is VALID [2022-04-27 13:04:16,036 INFO L290 TraceCheckUtils]: 54: Hoare triple {4909#true} assume true; {4909#true} is VALID [2022-04-27 13:04:16,037 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {4909#true} {5035#(and (<= 0 main_~y~0) (= main_~r~0 0) (not (= main_~y~0 0)) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (<= main_~y~0 20) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #95#return; {5035#(and (<= 0 main_~y~0) (= main_~r~0 0) (not (= main_~y~0 0)) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (<= main_~y~0 20) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:04:16,037 INFO L272 TraceCheckUtils]: 56: Hoare triple {5035#(and (<= 0 main_~y~0) (= main_~r~0 0) (not (= main_~y~0 0)) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (<= main_~y~0 20) (= main_~c~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {4909#true} is VALID [2022-04-27 13:04:16,037 INFO L290 TraceCheckUtils]: 57: Hoare triple {4909#true} ~cond := #in~cond; {4909#true} is VALID [2022-04-27 13:04:16,037 INFO L290 TraceCheckUtils]: 58: Hoare triple {4909#true} assume !(0 == ~cond); {4909#true} is VALID [2022-04-27 13:04:16,037 INFO L290 TraceCheckUtils]: 59: Hoare triple {4909#true} assume true; {4909#true} is VALID [2022-04-27 13:04:16,038 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {4909#true} {5035#(and (<= 0 main_~y~0) (= main_~r~0 0) (not (= main_~y~0 0)) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (<= main_~y~0 20) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #97#return; {5035#(and (<= 0 main_~y~0) (= main_~r~0 0) (not (= main_~y~0 0)) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (<= main_~y~0 20) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:04:16,038 INFO L290 TraceCheckUtils]: 61: Hoare triple {5035#(and (<= 0 main_~y~0) (= main_~r~0 0) (not (= main_~y~0 0)) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (<= main_~y~0 20) (= main_~c~0 main_~x~0) (= main_~p~0 1))} assume !(~c~0 >= ~b~0); {5035#(and (<= 0 main_~y~0) (= main_~r~0 0) (not (= main_~y~0 0)) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (<= main_~y~0 20) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:04:16,039 INFO L290 TraceCheckUtils]: 62: Hoare triple {5035#(and (<= 0 main_~y~0) (= main_~r~0 0) (not (= main_~y~0 0)) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (<= main_~y~0 20) (= 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; {5105#(and (<= 0 main_~y~0) (not (= main_~y~0 0)) (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (<= main_~y~0 20))} is VALID [2022-04-27 13:04:16,039 INFO L290 TraceCheckUtils]: 63: Hoare triple {5105#(and (<= 0 main_~y~0) (not (= main_~y~0 0)) (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (<= main_~y~0 20))} assume !false; {5105#(and (<= 0 main_~y~0) (not (= main_~y~0 0)) (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (<= main_~y~0 20))} is VALID [2022-04-27 13:04:16,039 INFO L290 TraceCheckUtils]: 64: Hoare triple {5105#(and (<= 0 main_~y~0) (not (= main_~y~0 0)) (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (<= main_~y~0 20))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {5105#(and (<= 0 main_~y~0) (not (= main_~y~0 0)) (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (<= main_~y~0 20))} is VALID [2022-04-27 13:04:16,040 INFO L290 TraceCheckUtils]: 65: Hoare triple {5105#(and (<= 0 main_~y~0) (not (= main_~y~0 0)) (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (<= main_~y~0 20))} assume !false; {5105#(and (<= 0 main_~y~0) (not (= main_~y~0 0)) (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (<= main_~y~0 20))} is VALID [2022-04-27 13:04:16,040 INFO L272 TraceCheckUtils]: 66: Hoare triple {5105#(and (<= 0 main_~y~0) (not (= main_~y~0 0)) (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (<= main_~y~0 20))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {4909#true} is VALID [2022-04-27 13:04:16,040 INFO L290 TraceCheckUtils]: 67: Hoare triple {4909#true} ~cond := #in~cond; {4909#true} is VALID [2022-04-27 13:04:16,040 INFO L290 TraceCheckUtils]: 68: Hoare triple {4909#true} assume !(0 == ~cond); {4909#true} is VALID [2022-04-27 13:04:16,040 INFO L290 TraceCheckUtils]: 69: Hoare triple {4909#true} assume true; {4909#true} is VALID [2022-04-27 13:04:16,040 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {4909#true} {5105#(and (<= 0 main_~y~0) (not (= main_~y~0 0)) (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (<= main_~y~0 20))} #91#return; {5105#(and (<= 0 main_~y~0) (not (= main_~y~0 0)) (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (<= main_~y~0 20))} is VALID [2022-04-27 13:04:16,041 INFO L272 TraceCheckUtils]: 71: Hoare triple {5105#(and (<= 0 main_~y~0) (not (= main_~y~0 0)) (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (<= main_~y~0 20))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {4909#true} is VALID [2022-04-27 13:04:16,041 INFO L290 TraceCheckUtils]: 72: Hoare triple {4909#true} ~cond := #in~cond; {4909#true} is VALID [2022-04-27 13:04:16,041 INFO L290 TraceCheckUtils]: 73: Hoare triple {4909#true} assume !(0 == ~cond); {4909#true} is VALID [2022-04-27 13:04:16,041 INFO L290 TraceCheckUtils]: 74: Hoare triple {4909#true} assume true; {4909#true} is VALID [2022-04-27 13:04:16,041 INFO L284 TraceCheckUtils]: 75: Hoare quadruple {4909#true} {5105#(and (<= 0 main_~y~0) (not (= main_~y~0 0)) (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (<= main_~y~0 20))} #93#return; {5105#(and (<= 0 main_~y~0) (not (= main_~y~0 0)) (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (<= main_~y~0 20))} is VALID [2022-04-27 13:04:16,042 INFO L272 TraceCheckUtils]: 76: Hoare triple {5105#(and (<= 0 main_~y~0) (not (= main_~y~0 0)) (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (<= main_~y~0 20))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {5148#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:04:16,042 INFO L290 TraceCheckUtils]: 77: Hoare triple {5148#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5152#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:04:16,042 INFO L290 TraceCheckUtils]: 78: Hoare triple {5152#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4910#false} is VALID [2022-04-27 13:04:16,042 INFO L290 TraceCheckUtils]: 79: Hoare triple {4910#false} assume !false; {4910#false} is VALID [2022-04-27 13:04:16,043 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 15 proven. 18 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2022-04-27 13:04:16,043 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:04:16,424 INFO L290 TraceCheckUtils]: 79: Hoare triple {4910#false} assume !false; {4910#false} is VALID [2022-04-27 13:04:16,424 INFO L290 TraceCheckUtils]: 78: Hoare triple {5152#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4910#false} is VALID [2022-04-27 13:04:16,424 INFO L290 TraceCheckUtils]: 77: Hoare triple {5148#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5152#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:04:16,425 INFO L272 TraceCheckUtils]: 76: Hoare triple {5168#(= 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)); {5148#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:04:16,426 INFO L284 TraceCheckUtils]: 75: Hoare quadruple {4909#true} {5168#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #93#return; {5168#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 13:04:16,426 INFO L290 TraceCheckUtils]: 74: Hoare triple {4909#true} assume true; {4909#true} is VALID [2022-04-27 13:04:16,426 INFO L290 TraceCheckUtils]: 73: Hoare triple {4909#true} assume !(0 == ~cond); {4909#true} is VALID [2022-04-27 13:04:16,426 INFO L290 TraceCheckUtils]: 72: Hoare triple {4909#true} ~cond := #in~cond; {4909#true} is VALID [2022-04-27 13:04:16,426 INFO L272 TraceCheckUtils]: 71: Hoare triple {5168#(= 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)); {4909#true} is VALID [2022-04-27 13:04:16,426 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {4909#true} {5168#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #91#return; {5168#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 13:04:16,426 INFO L290 TraceCheckUtils]: 69: Hoare triple {4909#true} assume true; {4909#true} is VALID [2022-04-27 13:04:16,426 INFO L290 TraceCheckUtils]: 68: Hoare triple {4909#true} assume !(0 == ~cond); {4909#true} is VALID [2022-04-27 13:04:16,426 INFO L290 TraceCheckUtils]: 67: Hoare triple {4909#true} ~cond := #in~cond; {4909#true} is VALID [2022-04-27 13:04:16,427 INFO L272 TraceCheckUtils]: 66: Hoare triple {5168#(= 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)); {4909#true} is VALID [2022-04-27 13:04:16,427 INFO L290 TraceCheckUtils]: 65: Hoare triple {5168#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !false; {5168#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 13:04:16,427 INFO L290 TraceCheckUtils]: 64: Hoare triple {5168#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {5168#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 13:04:16,427 INFO L290 TraceCheckUtils]: 63: Hoare triple {5168#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !false; {5168#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 13:04:18,429 WARN L290 TraceCheckUtils]: 62: Hoare triple {5211#(= (+ (* (+ (* (* 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; {5168#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is UNKNOWN [2022-04-27 13:04:18,429 INFO L290 TraceCheckUtils]: 61: Hoare triple {5211#(= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)} assume !(~c~0 >= ~b~0); {5211#(= (+ (* (+ (* (* 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:04:18,430 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {4909#true} {5211#(= (+ (* (+ (* (* 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)} #97#return; {5211#(= (+ (* (+ (* (* 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:04:18,430 INFO L290 TraceCheckUtils]: 59: Hoare triple {4909#true} assume true; {4909#true} is VALID [2022-04-27 13:04:18,430 INFO L290 TraceCheckUtils]: 58: Hoare triple {4909#true} assume !(0 == ~cond); {4909#true} is VALID [2022-04-27 13:04:18,430 INFO L290 TraceCheckUtils]: 57: Hoare triple {4909#true} ~cond := #in~cond; {4909#true} is VALID [2022-04-27 13:04:18,430 INFO L272 TraceCheckUtils]: 56: Hoare triple {5211#(= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {4909#true} is VALID [2022-04-27 13:04:18,431 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {4909#true} {5211#(= (+ (* (+ (* (* 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)} #95#return; {5211#(= (+ (* (+ (* (* 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:04:18,431 INFO L290 TraceCheckUtils]: 54: Hoare triple {4909#true} assume true; {4909#true} is VALID [2022-04-27 13:04:18,431 INFO L290 TraceCheckUtils]: 53: Hoare triple {4909#true} assume !(0 == ~cond); {4909#true} is VALID [2022-04-27 13:04:18,431 INFO L290 TraceCheckUtils]: 52: Hoare triple {4909#true} ~cond := #in~cond; {4909#true} is VALID [2022-04-27 13:04:18,431 INFO L272 TraceCheckUtils]: 51: Hoare triple {5211#(= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {4909#true} is VALID [2022-04-27 13:04:18,431 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {4909#true} {5211#(= (+ (* (+ (* (* 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)} #93#return; {5211#(= (+ (* (+ (* (* 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:04:18,431 INFO L290 TraceCheckUtils]: 49: Hoare triple {4909#true} assume true; {4909#true} is VALID [2022-04-27 13:04:18,432 INFO L290 TraceCheckUtils]: 48: Hoare triple {4909#true} assume !(0 == ~cond); {4909#true} is VALID [2022-04-27 13:04:18,432 INFO L290 TraceCheckUtils]: 47: Hoare triple {4909#true} ~cond := #in~cond; {4909#true} is VALID [2022-04-27 13:04:18,432 INFO L272 TraceCheckUtils]: 46: Hoare triple {5211#(= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {4909#true} is VALID [2022-04-27 13:04:18,432 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {4909#true} {5211#(= (+ (* (+ (* (* 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)} #91#return; {5211#(= (+ (* (+ (* (* 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:04:18,432 INFO L290 TraceCheckUtils]: 44: Hoare triple {4909#true} assume true; {4909#true} is VALID [2022-04-27 13:04:18,432 INFO L290 TraceCheckUtils]: 43: Hoare triple {4909#true} assume !(0 == ~cond); {4909#true} is VALID [2022-04-27 13:04:18,432 INFO L290 TraceCheckUtils]: 42: Hoare triple {4909#true} ~cond := #in~cond; {4909#true} is VALID [2022-04-27 13:04:18,432 INFO L272 TraceCheckUtils]: 41: Hoare triple {5211#(= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {4909#true} is VALID [2022-04-27 13:04:18,433 INFO L290 TraceCheckUtils]: 40: Hoare triple {5211#(= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)} assume !false; {5211#(= (+ (* (+ (* (* 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:04:18,433 INFO L290 TraceCheckUtils]: 39: Hoare triple {5281#(or (= main_~b~0 0) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {5211#(= (+ (* (+ (* (* 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:04:18,433 INFO L290 TraceCheckUtils]: 38: Hoare triple {5281#(or (= main_~b~0 0) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} assume !false; {5281#(or (= main_~b~0 0) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-27 13:04:18,434 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {4909#true} {5281#(or (= main_~b~0 0) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} #89#return; {5281#(or (= main_~b~0 0) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-27 13:04:18,434 INFO L290 TraceCheckUtils]: 36: Hoare triple {4909#true} assume true; {4909#true} is VALID [2022-04-27 13:04:18,434 INFO L290 TraceCheckUtils]: 35: Hoare triple {4909#true} assume !(0 == ~cond); {4909#true} is VALID [2022-04-27 13:04:18,434 INFO L290 TraceCheckUtils]: 34: Hoare triple {4909#true} ~cond := #in~cond; {4909#true} is VALID [2022-04-27 13:04:18,434 INFO L272 TraceCheckUtils]: 33: Hoare triple {5281#(or (= main_~b~0 0) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {4909#true} is VALID [2022-04-27 13:04:18,435 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {4909#true} {5281#(or (= main_~b~0 0) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} #87#return; {5281#(or (= main_~b~0 0) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-27 13:04:18,435 INFO L290 TraceCheckUtils]: 31: Hoare triple {4909#true} assume true; {4909#true} is VALID [2022-04-27 13:04:18,435 INFO L290 TraceCheckUtils]: 30: Hoare triple {4909#true} assume !(0 == ~cond); {4909#true} is VALID [2022-04-27 13:04:18,435 INFO L290 TraceCheckUtils]: 29: Hoare triple {4909#true} ~cond := #in~cond; {4909#true} is VALID [2022-04-27 13:04:18,435 INFO L272 TraceCheckUtils]: 28: Hoare triple {5281#(or (= main_~b~0 0) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {4909#true} is VALID [2022-04-27 13:04:18,435 INFO L290 TraceCheckUtils]: 27: Hoare triple {4909#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {5281#(or (= main_~b~0 0) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-27 13:04:18,435 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {4909#true} {4909#true} #85#return; {4909#true} is VALID [2022-04-27 13:04:18,435 INFO L290 TraceCheckUtils]: 25: Hoare triple {4909#true} assume true; {4909#true} is VALID [2022-04-27 13:04:18,435 INFO L290 TraceCheckUtils]: 24: Hoare triple {4909#true} assume !(0 == ~cond); {4909#true} is VALID [2022-04-27 13:04:18,435 INFO L290 TraceCheckUtils]: 23: Hoare triple {4909#true} ~cond := #in~cond; {4909#true} is VALID [2022-04-27 13:04:18,435 INFO L272 TraceCheckUtils]: 22: Hoare triple {4909#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {4909#true} is VALID [2022-04-27 13:04:18,435 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {4909#true} {4909#true} #83#return; {4909#true} is VALID [2022-04-27 13:04:18,436 INFO L290 TraceCheckUtils]: 20: Hoare triple {4909#true} assume true; {4909#true} is VALID [2022-04-27 13:04:18,436 INFO L290 TraceCheckUtils]: 19: Hoare triple {4909#true} assume !(0 == ~cond); {4909#true} is VALID [2022-04-27 13:04:18,436 INFO L290 TraceCheckUtils]: 18: Hoare triple {4909#true} ~cond := #in~cond; {4909#true} is VALID [2022-04-27 13:04:18,436 INFO L272 TraceCheckUtils]: 17: Hoare triple {4909#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {4909#true} is VALID [2022-04-27 13:04:18,436 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {4909#true} {4909#true} #81#return; {4909#true} is VALID [2022-04-27 13:04:18,436 INFO L290 TraceCheckUtils]: 15: Hoare triple {4909#true} assume true; {4909#true} is VALID [2022-04-27 13:04:18,436 INFO L290 TraceCheckUtils]: 14: Hoare triple {4909#true} assume !(0 == ~cond); {4909#true} is VALID [2022-04-27 13:04:18,436 INFO L290 TraceCheckUtils]: 13: Hoare triple {4909#true} ~cond := #in~cond; {4909#true} is VALID [2022-04-27 13:04:18,436 INFO L272 TraceCheckUtils]: 12: Hoare triple {4909#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 20 then 1 else 0)); {4909#true} is VALID [2022-04-27 13:04:18,436 INFO L290 TraceCheckUtils]: 11: Hoare triple {4909#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {4909#true} is VALID [2022-04-27 13:04:18,436 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4909#true} {4909#true} #79#return; {4909#true} is VALID [2022-04-27 13:04:18,436 INFO L290 TraceCheckUtils]: 9: Hoare triple {4909#true} assume true; {4909#true} is VALID [2022-04-27 13:04:18,436 INFO L290 TraceCheckUtils]: 8: Hoare triple {4909#true} assume !(0 == ~cond); {4909#true} is VALID [2022-04-27 13:04:18,436 INFO L290 TraceCheckUtils]: 7: Hoare triple {4909#true} ~cond := #in~cond; {4909#true} is VALID [2022-04-27 13:04:18,436 INFO L272 TraceCheckUtils]: 6: Hoare triple {4909#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 20 then 1 else 0)); {4909#true} is VALID [2022-04-27 13:04:18,436 INFO L290 TraceCheckUtils]: 5: Hoare triple {4909#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {4909#true} is VALID [2022-04-27 13:04:18,436 INFO L272 TraceCheckUtils]: 4: Hoare triple {4909#true} call #t~ret6 := main(); {4909#true} is VALID [2022-04-27 13:04:18,436 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4909#true} {4909#true} #103#return; {4909#true} is VALID [2022-04-27 13:04:18,436 INFO L290 TraceCheckUtils]: 2: Hoare triple {4909#true} assume true; {4909#true} is VALID [2022-04-27 13:04:18,436 INFO L290 TraceCheckUtils]: 1: Hoare triple {4909#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); {4909#true} is VALID [2022-04-27 13:04:18,436 INFO L272 TraceCheckUtils]: 0: Hoare triple {4909#true} call ULTIMATE.init(); {4909#true} is VALID [2022-04-27 13:04:18,437 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2022-04-27 13:04:18,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:04:18,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514042912] [2022-04-27 13:04:18,437 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:04:18,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [363118858] [2022-04-27 13:04:18,437 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [363118858] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 13:04:18,437 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 13:04:18,437 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 13 [2022-04-27 13:04:18,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170649945] [2022-04-27 13:04:18,437 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 13:04:18,438 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 11 states have internal predecessors, (34), 8 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (24), 8 states have call predecessors, (24), 8 states have call successors, (24) Word has length 80 [2022-04-27 13:04:18,438 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:04:18,438 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 11 states have internal predecessors, (34), 8 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (24), 8 states have call predecessors, (24), 8 states have call successors, (24) [2022-04-27 13:04:18,780 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:04:18,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-27 13:04:18,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:04:18,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-27 13:04:18,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2022-04-27 13:04:18,781 INFO L87 Difference]: Start difference. First operand 96 states and 130 transitions. Second operand has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 11 states have internal predecessors, (34), 8 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (24), 8 states have call predecessors, (24), 8 states have call successors, (24) [2022-04-27 13:04:24,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:04:24,206 INFO L93 Difference]: Finished difference Result 128 states and 169 transitions. [2022-04-27 13:04:24,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-27 13:04:24,206 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 11 states have internal predecessors, (34), 8 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (24), 8 states have call predecessors, (24), 8 states have call successors, (24) Word has length 80 [2022-04-27 13:04:24,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:04:24,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 11 states have internal predecessors, (34), 8 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (24), 8 states have call predecessors, (24), 8 states have call successors, (24) [2022-04-27 13:04:24,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 89 transitions. [2022-04-27 13:04:24,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 11 states have internal predecessors, (34), 8 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (24), 8 states have call predecessors, (24), 8 states have call successors, (24) [2022-04-27 13:04:24,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 89 transitions. [2022-04-27 13:04:24,210 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 89 transitions. [2022-04-27 13:04:24,571 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:04:24,573 INFO L225 Difference]: With dead ends: 128 [2022-04-27 13:04:24,574 INFO L226 Difference]: Without dead ends: 126 [2022-04-27 13:04:24,574 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 147 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=88, Invalid=332, Unknown=0, NotChecked=0, Total=420 [2022-04-27 13:04:24,574 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 46 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-04-27 13:04:24,574 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 199 Invalid, 407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 321 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-04-27 13:04:24,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2022-04-27 13:04:24,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 108. [2022-04-27 13:04:24,706 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:04:24,709 INFO L82 GeneralOperation]: Start isEquivalent. First operand 126 states. Second operand has 108 states, 60 states have (on average 1.15) internal successors, (69), 62 states have internal predecessors, (69), 36 states have call successors, (36), 12 states have call predecessors, (36), 11 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2022-04-27 13:04:24,710 INFO L74 IsIncluded]: Start isIncluded. First operand 126 states. Second operand has 108 states, 60 states have (on average 1.15) internal successors, (69), 62 states have internal predecessors, (69), 36 states have call successors, (36), 12 states have call predecessors, (36), 11 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2022-04-27 13:04:24,710 INFO L87 Difference]: Start difference. First operand 126 states. Second operand has 108 states, 60 states have (on average 1.15) internal successors, (69), 62 states have internal predecessors, (69), 36 states have call successors, (36), 12 states have call predecessors, (36), 11 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2022-04-27 13:04:24,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:04:24,719 INFO L93 Difference]: Finished difference Result 126 states and 167 transitions. [2022-04-27 13:04:24,719 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 167 transitions. [2022-04-27 13:04:24,719 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:04:24,719 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:04:24,719 INFO L74 IsIncluded]: Start isIncluded. First operand has 108 states, 60 states have (on average 1.15) internal successors, (69), 62 states have internal predecessors, (69), 36 states have call successors, (36), 12 states have call predecessors, (36), 11 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) Second operand 126 states. [2022-04-27 13:04:24,720 INFO L87 Difference]: Start difference. First operand has 108 states, 60 states have (on average 1.15) internal successors, (69), 62 states have internal predecessors, (69), 36 states have call successors, (36), 12 states have call predecessors, (36), 11 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) Second operand 126 states. [2022-04-27 13:04:24,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:04:24,722 INFO L93 Difference]: Finished difference Result 126 states and 167 transitions. [2022-04-27 13:04:24,723 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 167 transitions. [2022-04-27 13:04:24,723 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:04:24,723 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:04:24,723 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:04:24,723 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:04:24,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 60 states have (on average 1.15) internal successors, (69), 62 states have internal predecessors, (69), 36 states have call successors, (36), 12 states have call predecessors, (36), 11 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2022-04-27 13:04:24,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 139 transitions. [2022-04-27 13:04:24,725 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 139 transitions. Word has length 80 [2022-04-27 13:04:24,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:04:24,725 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 139 transitions. [2022-04-27 13:04:24,725 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 11 states have internal predecessors, (34), 8 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (24), 8 states have call predecessors, (24), 8 states have call successors, (24) [2022-04-27 13:04:24,725 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 139 transitions. [2022-04-27 13:04:24,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-04-27 13:04:24,729 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:04:24,729 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 6, 6, 6, 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, 1] [2022-04-27 13:04:24,747 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:04:24,939 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:04:24,939 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:04:24,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:04:24,940 INFO L85 PathProgramCache]: Analyzing trace with hash 901388446, now seen corresponding path program 3 times [2022-04-27 13:04:24,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:04:24,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352400882] [2022-04-27 13:04:24,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:04:24,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:04:24,950 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:04:24,950 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [173320324] [2022-04-27 13:04:24,950 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 13:04:24,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:04:24,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:04:24,951 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:04:24,952 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:04:24,991 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-04-27 13:04:24,991 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 13:04:24,992 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 36 conjunts are in the unsatisfiable core [2022-04-27 13:04:25,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:04:25,003 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:04:28,685 INFO L272 TraceCheckUtils]: 0: Hoare triple {6034#true} call ULTIMATE.init(); {6034#true} is VALID [2022-04-27 13:04:28,685 INFO L290 TraceCheckUtils]: 1: Hoare triple {6034#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); {6034#true} is VALID [2022-04-27 13:04:28,685 INFO L290 TraceCheckUtils]: 2: Hoare triple {6034#true} assume true; {6034#true} is VALID [2022-04-27 13:04:28,685 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6034#true} {6034#true} #103#return; {6034#true} is VALID [2022-04-27 13:04:28,685 INFO L272 TraceCheckUtils]: 4: Hoare triple {6034#true} call #t~ret6 := main(); {6034#true} is VALID [2022-04-27 13:04:28,685 INFO L290 TraceCheckUtils]: 5: Hoare triple {6034#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {6034#true} is VALID [2022-04-27 13:04:28,685 INFO L272 TraceCheckUtils]: 6: Hoare triple {6034#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 20 then 1 else 0)); {6034#true} is VALID [2022-04-27 13:04:28,685 INFO L290 TraceCheckUtils]: 7: Hoare triple {6034#true} ~cond := #in~cond; {6034#true} is VALID [2022-04-27 13:04:28,685 INFO L290 TraceCheckUtils]: 8: Hoare triple {6034#true} assume !(0 == ~cond); {6034#true} is VALID [2022-04-27 13:04:28,685 INFO L290 TraceCheckUtils]: 9: Hoare triple {6034#true} assume true; {6034#true} is VALID [2022-04-27 13:04:28,685 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6034#true} {6034#true} #79#return; {6034#true} is VALID [2022-04-27 13:04:28,685 INFO L290 TraceCheckUtils]: 11: Hoare triple {6034#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {6034#true} is VALID [2022-04-27 13:04:28,685 INFO L272 TraceCheckUtils]: 12: Hoare triple {6034#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 20 then 1 else 0)); {6034#true} is VALID [2022-04-27 13:04:28,685 INFO L290 TraceCheckUtils]: 13: Hoare triple {6034#true} ~cond := #in~cond; {6034#true} is VALID [2022-04-27 13:04:28,686 INFO L290 TraceCheckUtils]: 14: Hoare triple {6034#true} assume !(0 == ~cond); {6034#true} is VALID [2022-04-27 13:04:28,686 INFO L290 TraceCheckUtils]: 15: Hoare triple {6034#true} assume true; {6034#true} is VALID [2022-04-27 13:04:28,686 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {6034#true} {6034#true} #81#return; {6034#true} is VALID [2022-04-27 13:04:28,686 INFO L272 TraceCheckUtils]: 17: Hoare triple {6034#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {6034#true} is VALID [2022-04-27 13:04:28,686 INFO L290 TraceCheckUtils]: 18: Hoare triple {6034#true} ~cond := #in~cond; {6034#true} is VALID [2022-04-27 13:04:28,686 INFO L290 TraceCheckUtils]: 19: Hoare triple {6034#true} assume !(0 == ~cond); {6034#true} is VALID [2022-04-27 13:04:28,686 INFO L290 TraceCheckUtils]: 20: Hoare triple {6034#true} assume true; {6034#true} is VALID [2022-04-27 13:04:28,686 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {6034#true} {6034#true} #83#return; {6034#true} is VALID [2022-04-27 13:04:28,686 INFO L272 TraceCheckUtils]: 22: Hoare triple {6034#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {6034#true} is VALID [2022-04-27 13:04:28,686 INFO L290 TraceCheckUtils]: 23: Hoare triple {6034#true} ~cond := #in~cond; {6034#true} is VALID [2022-04-27 13:04:28,686 INFO L290 TraceCheckUtils]: 24: Hoare triple {6034#true} assume !(0 == ~cond); {6034#true} is VALID [2022-04-27 13:04:28,686 INFO L290 TraceCheckUtils]: 25: Hoare triple {6034#true} assume true; {6034#true} is VALID [2022-04-27 13:04:28,686 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {6034#true} {6034#true} #85#return; {6034#true} is VALID [2022-04-27 13:04:28,687 INFO L290 TraceCheckUtils]: 27: Hoare triple {6034#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {6120#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:04:28,687 INFO L272 TraceCheckUtils]: 28: Hoare triple {6120#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {6034#true} is VALID [2022-04-27 13:04:28,687 INFO L290 TraceCheckUtils]: 29: Hoare triple {6034#true} ~cond := #in~cond; {6034#true} is VALID [2022-04-27 13:04:28,687 INFO L290 TraceCheckUtils]: 30: Hoare triple {6034#true} assume !(0 == ~cond); {6034#true} is VALID [2022-04-27 13:04:28,687 INFO L290 TraceCheckUtils]: 31: Hoare triple {6034#true} assume true; {6034#true} is VALID [2022-04-27 13:04:28,687 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {6034#true} {6120#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #87#return; {6120#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:04:28,687 INFO L272 TraceCheckUtils]: 33: Hoare triple {6120#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {6034#true} is VALID [2022-04-27 13:04:28,688 INFO L290 TraceCheckUtils]: 34: Hoare triple {6034#true} ~cond := #in~cond; {6034#true} is VALID [2022-04-27 13:04:28,688 INFO L290 TraceCheckUtils]: 35: Hoare triple {6034#true} assume !(0 == ~cond); {6034#true} is VALID [2022-04-27 13:04:28,688 INFO L290 TraceCheckUtils]: 36: Hoare triple {6034#true} assume true; {6034#true} is VALID [2022-04-27 13:04:28,688 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {6034#true} {6120#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #89#return; {6120#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:04:28,689 INFO L290 TraceCheckUtils]: 38: Hoare triple {6120#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !false; {6120#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:04:28,689 INFO L290 TraceCheckUtils]: 39: Hoare triple {6120#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {6157#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:04:28,689 INFO L290 TraceCheckUtils]: 40: Hoare triple {6157#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} assume !false; {6157#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:04:28,689 INFO L272 TraceCheckUtils]: 41: Hoare triple {6157#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {6034#true} is VALID [2022-04-27 13:04:28,689 INFO L290 TraceCheckUtils]: 42: Hoare triple {6034#true} ~cond := #in~cond; {6034#true} is VALID [2022-04-27 13:04:28,690 INFO L290 TraceCheckUtils]: 43: Hoare triple {6034#true} assume !(0 == ~cond); {6034#true} is VALID [2022-04-27 13:04:28,690 INFO L290 TraceCheckUtils]: 44: Hoare triple {6034#true} assume true; {6034#true} is VALID [2022-04-27 13:04:28,690 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {6034#true} {6157#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #91#return; {6157#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:04:28,690 INFO L272 TraceCheckUtils]: 46: Hoare triple {6157#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {6034#true} is VALID [2022-04-27 13:04:28,690 INFO L290 TraceCheckUtils]: 47: Hoare triple {6034#true} ~cond := #in~cond; {6034#true} is VALID [2022-04-27 13:04:28,690 INFO L290 TraceCheckUtils]: 48: Hoare triple {6034#true} assume !(0 == ~cond); {6034#true} is VALID [2022-04-27 13:04:28,690 INFO L290 TraceCheckUtils]: 49: Hoare triple {6034#true} assume true; {6034#true} is VALID [2022-04-27 13:04:28,691 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {6034#true} {6157#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #93#return; {6157#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:04:28,691 INFO L272 TraceCheckUtils]: 51: Hoare triple {6157#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {6034#true} is VALID [2022-04-27 13:04:28,691 INFO L290 TraceCheckUtils]: 52: Hoare triple {6034#true} ~cond := #in~cond; {6034#true} is VALID [2022-04-27 13:04:28,691 INFO L290 TraceCheckUtils]: 53: Hoare triple {6034#true} assume !(0 == ~cond); {6034#true} is VALID [2022-04-27 13:04:28,691 INFO L290 TraceCheckUtils]: 54: Hoare triple {6034#true} assume true; {6034#true} is VALID [2022-04-27 13:04:28,692 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {6034#true} {6157#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #95#return; {6157#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:04:28,692 INFO L272 TraceCheckUtils]: 56: Hoare triple {6157#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {6034#true} is VALID [2022-04-27 13:04:28,692 INFO L290 TraceCheckUtils]: 57: Hoare triple {6034#true} ~cond := #in~cond; {6034#true} is VALID [2022-04-27 13:04:28,692 INFO L290 TraceCheckUtils]: 58: Hoare triple {6034#true} assume !(0 == ~cond); {6034#true} is VALID [2022-04-27 13:04:28,692 INFO L290 TraceCheckUtils]: 59: Hoare triple {6034#true} assume true; {6034#true} is VALID [2022-04-27 13:04:28,693 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {6034#true} {6157#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #97#return; {6157#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:04:28,693 INFO L290 TraceCheckUtils]: 61: Hoare triple {6157#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} assume !(~c~0 >= ~b~0); {6157#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:04:28,694 INFO L290 TraceCheckUtils]: 62: Hoare triple {6157#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {6227#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-27 13:04:28,694 INFO L290 TraceCheckUtils]: 63: Hoare triple {6227#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} assume !false; {6227#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-27 13:04:28,694 INFO L290 TraceCheckUtils]: 64: Hoare triple {6227#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {6227#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-27 13:04:28,695 INFO L290 TraceCheckUtils]: 65: Hoare triple {6227#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} assume !false; {6227#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-27 13:04:28,695 INFO L272 TraceCheckUtils]: 66: Hoare triple {6227#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {6034#true} is VALID [2022-04-27 13:04:28,695 INFO L290 TraceCheckUtils]: 67: Hoare triple {6034#true} ~cond := #in~cond; {6034#true} is VALID [2022-04-27 13:04:28,695 INFO L290 TraceCheckUtils]: 68: Hoare triple {6034#true} assume !(0 == ~cond); {6034#true} is VALID [2022-04-27 13:04:28,695 INFO L290 TraceCheckUtils]: 69: Hoare triple {6034#true} assume true; {6034#true} is VALID [2022-04-27 13:04:28,696 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {6034#true} {6227#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #91#return; {6227#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-27 13:04:28,696 INFO L272 TraceCheckUtils]: 71: Hoare triple {6227#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {6034#true} is VALID [2022-04-27 13:04:28,696 INFO L290 TraceCheckUtils]: 72: Hoare triple {6034#true} ~cond := #in~cond; {6034#true} is VALID [2022-04-27 13:04:28,696 INFO L290 TraceCheckUtils]: 73: Hoare triple {6034#true} assume !(0 == ~cond); {6034#true} is VALID [2022-04-27 13:04:28,696 INFO L290 TraceCheckUtils]: 74: Hoare triple {6034#true} assume true; {6034#true} is VALID [2022-04-27 13:04:28,696 INFO L284 TraceCheckUtils]: 75: Hoare quadruple {6034#true} {6227#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #93#return; {6227#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-27 13:04:28,696 INFO L272 TraceCheckUtils]: 76: Hoare triple {6227#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {6034#true} is VALID [2022-04-27 13:04:28,697 INFO L290 TraceCheckUtils]: 77: Hoare triple {6034#true} ~cond := #in~cond; {6273#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:04:28,697 INFO L290 TraceCheckUtils]: 78: Hoare triple {6273#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {6277#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:04:28,697 INFO L290 TraceCheckUtils]: 79: Hoare triple {6277#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {6277#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:04:28,698 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {6277#(not (= |__VERIFIER_assert_#in~cond| 0))} {6227#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #95#return; {6227#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-27 13:04:28,698 INFO L272 TraceCheckUtils]: 81: Hoare triple {6227#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {6287#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:04:28,699 INFO L290 TraceCheckUtils]: 82: Hoare triple {6287#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6291#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:04:28,699 INFO L290 TraceCheckUtils]: 83: Hoare triple {6291#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6035#false} is VALID [2022-04-27 13:04:28,699 INFO L290 TraceCheckUtils]: 84: Hoare triple {6035#false} assume !false; {6035#false} is VALID [2022-04-27 13:04:28,699 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 31 proven. 8 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2022-04-27 13:04:28,699 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:05:10,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:05:10,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352400882] [2022-04-27 13:05:10,079 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:05:10,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [173320324] [2022-04-27 13:05:10,079 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [173320324] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 13:05:10,079 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 13:05:10,091 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2022-04-27 13:05:10,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267476649] [2022-04-27 13:05:10,091 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 13:05:10,091 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 4 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) Word has length 85 [2022-04-27 13:05:10,092 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:05:10,092 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 4 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) [2022-04-27 13:05:10,135 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:05:10,135 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-27 13:05:10,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:05:10,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-27 13:05:10,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-04-27 13:05:10,136 INFO L87 Difference]: Start difference. First operand 108 states and 139 transitions. Second operand has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 4 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) [2022-04-27 13:05:10,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:05:10,957 INFO L93 Difference]: Finished difference Result 144 states and 181 transitions. [2022-04-27 13:05:10,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-27 13:05:10,958 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 4 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) Word has length 85 [2022-04-27 13:05:10,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:05:10,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 4 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) [2022-04-27 13:05:10,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 89 transitions. [2022-04-27 13:05:10,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 4 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) [2022-04-27 13:05:10,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 89 transitions. [2022-04-27 13:05:10,961 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 89 transitions. [2022-04-27 13:05:11,044 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:05:11,046 INFO L225 Difference]: With dead ends: 144 [2022-04-27 13:05:11,046 INFO L226 Difference]: Without dead ends: 142 [2022-04-27 13:05:11,047 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 79 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2022-04-27 13:05:11,047 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 19 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-27 13:05:11,047 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 208 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-27 13:05:11,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2022-04-27 13:05:11,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 139. [2022-04-27 13:05:11,189 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:05:11,190 INFO L82 GeneralOperation]: Start isEquivalent. First operand 142 states. Second operand has 139 states, 79 states have (on average 1.139240506329114) internal successors, (90), 81 states have internal predecessors, (90), 44 states have call successors, (44), 16 states have call predecessors, (44), 15 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2022-04-27 13:05:11,190 INFO L74 IsIncluded]: Start isIncluded. First operand 142 states. Second operand has 139 states, 79 states have (on average 1.139240506329114) internal successors, (90), 81 states have internal predecessors, (90), 44 states have call successors, (44), 16 states have call predecessors, (44), 15 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2022-04-27 13:05:11,190 INFO L87 Difference]: Start difference. First operand 142 states. Second operand has 139 states, 79 states have (on average 1.139240506329114) internal successors, (90), 81 states have internal predecessors, (90), 44 states have call successors, (44), 16 states have call predecessors, (44), 15 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2022-04-27 13:05:11,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:05:11,192 INFO L93 Difference]: Finished difference Result 142 states and 179 transitions. [2022-04-27 13:05:11,193 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 179 transitions. [2022-04-27 13:05:11,193 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:05:11,193 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:05:11,193 INFO L74 IsIncluded]: Start isIncluded. First operand has 139 states, 79 states have (on average 1.139240506329114) internal successors, (90), 81 states have internal predecessors, (90), 44 states have call successors, (44), 16 states have call predecessors, (44), 15 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) Second operand 142 states. [2022-04-27 13:05:11,193 INFO L87 Difference]: Start difference. First operand has 139 states, 79 states have (on average 1.139240506329114) internal successors, (90), 81 states have internal predecessors, (90), 44 states have call successors, (44), 16 states have call predecessors, (44), 15 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) Second operand 142 states. [2022-04-27 13:05:11,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:05:11,196 INFO L93 Difference]: Finished difference Result 142 states and 179 transitions. [2022-04-27 13:05:11,196 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 179 transitions. [2022-04-27 13:05:11,196 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:05:11,196 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:05:11,196 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:05:11,196 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:05:11,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 79 states have (on average 1.139240506329114) internal successors, (90), 81 states have internal predecessors, (90), 44 states have call successors, (44), 16 states have call predecessors, (44), 15 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2022-04-27 13:05:11,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 176 transitions. [2022-04-27 13:05:11,199 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 176 transitions. Word has length 85 [2022-04-27 13:05:11,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:05:11,199 INFO L495 AbstractCegarLoop]: Abstraction has 139 states and 176 transitions. [2022-04-27 13:05:11,199 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 4 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) [2022-04-27 13:05:11,199 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 176 transitions. [2022-04-27 13:05:11,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-04-27 13:05:11,200 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:05:11,200 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 6, 6, 6, 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, 1, 1, 1, 1] [2022-04-27 13:05:11,219 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:05:11,409 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:05:11,409 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:05:11,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:05:11,410 INFO L85 PathProgramCache]: Analyzing trace with hash -686534738, now seen corresponding path program 1 times [2022-04-27 13:05:11,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:05:11,410 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368470707] [2022-04-27 13:05:11,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:05:11,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:05:11,427 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:05:11,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1304892550] [2022-04-27 13:05:11,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:05:11,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:05:11,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:05:11,428 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:05:11,431 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:05:11,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:05:11,476 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 37 conjunts are in the unsatisfiable core [2022-04-27 13:05:11,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:05:11,489 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:05:12,001 INFO L272 TraceCheckUtils]: 0: Hoare triple {7035#true} call ULTIMATE.init(); {7035#true} is VALID [2022-04-27 13:05:12,001 INFO L290 TraceCheckUtils]: 1: Hoare triple {7035#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); {7035#true} is VALID [2022-04-27 13:05:12,001 INFO L290 TraceCheckUtils]: 2: Hoare triple {7035#true} assume true; {7035#true} is VALID [2022-04-27 13:05:12,002 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7035#true} {7035#true} #103#return; {7035#true} is VALID [2022-04-27 13:05:12,002 INFO L272 TraceCheckUtils]: 4: Hoare triple {7035#true} call #t~ret6 := main(); {7035#true} is VALID [2022-04-27 13:05:12,002 INFO L290 TraceCheckUtils]: 5: Hoare triple {7035#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {7035#true} is VALID [2022-04-27 13:05:12,002 INFO L272 TraceCheckUtils]: 6: Hoare triple {7035#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 20 then 1 else 0)); {7035#true} is VALID [2022-04-27 13:05:12,002 INFO L290 TraceCheckUtils]: 7: Hoare triple {7035#true} ~cond := #in~cond; {7035#true} is VALID [2022-04-27 13:05:12,002 INFO L290 TraceCheckUtils]: 8: Hoare triple {7035#true} assume !(0 == ~cond); {7035#true} is VALID [2022-04-27 13:05:12,002 INFO L290 TraceCheckUtils]: 9: Hoare triple {7035#true} assume true; {7035#true} is VALID [2022-04-27 13:05:12,002 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7035#true} {7035#true} #79#return; {7035#true} is VALID [2022-04-27 13:05:12,002 INFO L290 TraceCheckUtils]: 11: Hoare triple {7035#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {7035#true} is VALID [2022-04-27 13:05:12,002 INFO L272 TraceCheckUtils]: 12: Hoare triple {7035#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 20 then 1 else 0)); {7035#true} is VALID [2022-04-27 13:05:12,002 INFO L290 TraceCheckUtils]: 13: Hoare triple {7035#true} ~cond := #in~cond; {7035#true} is VALID [2022-04-27 13:05:12,002 INFO L290 TraceCheckUtils]: 14: Hoare triple {7035#true} assume !(0 == ~cond); {7035#true} is VALID [2022-04-27 13:05:12,002 INFO L290 TraceCheckUtils]: 15: Hoare triple {7035#true} assume true; {7035#true} is VALID [2022-04-27 13:05:12,002 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {7035#true} {7035#true} #81#return; {7035#true} is VALID [2022-04-27 13:05:12,002 INFO L272 TraceCheckUtils]: 17: Hoare triple {7035#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {7035#true} is VALID [2022-04-27 13:05:12,002 INFO L290 TraceCheckUtils]: 18: Hoare triple {7035#true} ~cond := #in~cond; {7035#true} is VALID [2022-04-27 13:05:12,002 INFO L290 TraceCheckUtils]: 19: Hoare triple {7035#true} assume !(0 == ~cond); {7035#true} is VALID [2022-04-27 13:05:12,002 INFO L290 TraceCheckUtils]: 20: Hoare triple {7035#true} assume true; {7035#true} is VALID [2022-04-27 13:05:12,002 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {7035#true} {7035#true} #83#return; {7035#true} is VALID [2022-04-27 13:05:12,002 INFO L272 TraceCheckUtils]: 22: Hoare triple {7035#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {7035#true} is VALID [2022-04-27 13:05:12,002 INFO L290 TraceCheckUtils]: 23: Hoare triple {7035#true} ~cond := #in~cond; {7035#true} is VALID [2022-04-27 13:05:12,003 INFO L290 TraceCheckUtils]: 24: Hoare triple {7035#true} assume !(0 == ~cond); {7035#true} is VALID [2022-04-27 13:05:12,003 INFO L290 TraceCheckUtils]: 25: Hoare triple {7035#true} assume true; {7035#true} is VALID [2022-04-27 13:05:12,003 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {7035#true} {7035#true} #85#return; {7035#true} is VALID [2022-04-27 13:05:12,003 INFO L290 TraceCheckUtils]: 27: Hoare triple {7035#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {7121#(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:05:12,003 INFO L272 TraceCheckUtils]: 28: Hoare triple {7121#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {7035#true} is VALID [2022-04-27 13:05:12,003 INFO L290 TraceCheckUtils]: 29: Hoare triple {7035#true} ~cond := #in~cond; {7035#true} is VALID [2022-04-27 13:05:12,003 INFO L290 TraceCheckUtils]: 30: Hoare triple {7035#true} assume !(0 == ~cond); {7035#true} is VALID [2022-04-27 13:05:12,003 INFO L290 TraceCheckUtils]: 31: Hoare triple {7035#true} assume true; {7035#true} is VALID [2022-04-27 13:05:12,004 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {7035#true} {7121#(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))} #87#return; {7121#(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:05:12,004 INFO L272 TraceCheckUtils]: 33: Hoare triple {7121#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {7035#true} is VALID [2022-04-27 13:05:12,004 INFO L290 TraceCheckUtils]: 34: Hoare triple {7035#true} ~cond := #in~cond; {7035#true} is VALID [2022-04-27 13:05:12,004 INFO L290 TraceCheckUtils]: 35: Hoare triple {7035#true} assume !(0 == ~cond); {7035#true} is VALID [2022-04-27 13:05:12,004 INFO L290 TraceCheckUtils]: 36: Hoare triple {7035#true} assume true; {7035#true} is VALID [2022-04-27 13:05:12,005 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {7035#true} {7121#(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))} #89#return; {7121#(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:05:12,005 INFO L290 TraceCheckUtils]: 38: Hoare triple {7121#(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; {7121#(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:05:12,005 INFO L290 TraceCheckUtils]: 39: Hoare triple {7121#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {7158#(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:05:12,006 INFO L290 TraceCheckUtils]: 40: Hoare triple {7158#(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; {7158#(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:05:12,006 INFO L272 TraceCheckUtils]: 41: Hoare triple {7158#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {7035#true} is VALID [2022-04-27 13:05:12,006 INFO L290 TraceCheckUtils]: 42: Hoare triple {7035#true} ~cond := #in~cond; {7035#true} is VALID [2022-04-27 13:05:12,006 INFO L290 TraceCheckUtils]: 43: Hoare triple {7035#true} assume !(0 == ~cond); {7035#true} is VALID [2022-04-27 13:05:12,006 INFO L290 TraceCheckUtils]: 44: Hoare triple {7035#true} assume true; {7035#true} is VALID [2022-04-27 13:05:12,006 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {7035#true} {7158#(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))} #91#return; {7158#(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:05:12,006 INFO L272 TraceCheckUtils]: 46: Hoare triple {7158#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {7035#true} is VALID [2022-04-27 13:05:12,006 INFO L290 TraceCheckUtils]: 47: Hoare triple {7035#true} ~cond := #in~cond; {7035#true} is VALID [2022-04-27 13:05:12,007 INFO L290 TraceCheckUtils]: 48: Hoare triple {7035#true} assume !(0 == ~cond); {7035#true} is VALID [2022-04-27 13:05:12,007 INFO L290 TraceCheckUtils]: 49: Hoare triple {7035#true} assume true; {7035#true} is VALID [2022-04-27 13:05:12,007 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {7035#true} {7158#(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))} #93#return; {7158#(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:05:12,007 INFO L272 TraceCheckUtils]: 51: Hoare triple {7158#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {7035#true} is VALID [2022-04-27 13:05:12,007 INFO L290 TraceCheckUtils]: 52: Hoare triple {7035#true} ~cond := #in~cond; {7035#true} is VALID [2022-04-27 13:05:12,007 INFO L290 TraceCheckUtils]: 53: Hoare triple {7035#true} assume !(0 == ~cond); {7035#true} is VALID [2022-04-27 13:05:12,007 INFO L290 TraceCheckUtils]: 54: Hoare triple {7035#true} assume true; {7035#true} is VALID [2022-04-27 13:05:12,008 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {7035#true} {7158#(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))} #95#return; {7158#(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:05:12,008 INFO L272 TraceCheckUtils]: 56: Hoare triple {7158#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {7035#true} is VALID [2022-04-27 13:05:12,008 INFO L290 TraceCheckUtils]: 57: Hoare triple {7035#true} ~cond := #in~cond; {7035#true} is VALID [2022-04-27 13:05:12,008 INFO L290 TraceCheckUtils]: 58: Hoare triple {7035#true} assume !(0 == ~cond); {7035#true} is VALID [2022-04-27 13:05:12,008 INFO L290 TraceCheckUtils]: 59: Hoare triple {7035#true} assume true; {7035#true} is VALID [2022-04-27 13:05:12,009 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {7035#true} {7158#(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))} #97#return; {7158#(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:05:12,009 INFO L290 TraceCheckUtils]: 61: Hoare triple {7158#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {7225#(and (= main_~r~0 0) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~x~0)) (= main_~s~0 1) (= (+ (- 1) main_~k~0) 0) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-27 13:05:12,010 INFO L290 TraceCheckUtils]: 62: Hoare triple {7225#(and (= main_~r~0 0) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~x~0)) (= main_~s~0 1) (= (+ (- 1) main_~k~0) 0) (= main_~q~0 0) (= main_~p~0 1))} assume !false; {7225#(and (= main_~r~0 0) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~x~0)) (= main_~s~0 1) (= (+ (- 1) main_~k~0) 0) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-27 13:05:12,010 INFO L272 TraceCheckUtils]: 63: Hoare triple {7225#(and (= main_~r~0 0) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~x~0)) (= main_~s~0 1) (= (+ (- 1) main_~k~0) 0) (= main_~q~0 0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {7035#true} is VALID [2022-04-27 13:05:12,010 INFO L290 TraceCheckUtils]: 64: Hoare triple {7035#true} ~cond := #in~cond; {7035#true} is VALID [2022-04-27 13:05:12,010 INFO L290 TraceCheckUtils]: 65: Hoare triple {7035#true} assume !(0 == ~cond); {7035#true} is VALID [2022-04-27 13:05:12,010 INFO L290 TraceCheckUtils]: 66: Hoare triple {7035#true} assume true; {7035#true} is VALID [2022-04-27 13:05:12,010 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {7035#true} {7225#(and (= main_~r~0 0) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~x~0)) (= main_~s~0 1) (= (+ (- 1) main_~k~0) 0) (= main_~q~0 0) (= main_~p~0 1))} #91#return; {7225#(and (= main_~r~0 0) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~x~0)) (= main_~s~0 1) (= (+ (- 1) main_~k~0) 0) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-27 13:05:12,010 INFO L272 TraceCheckUtils]: 68: Hoare triple {7225#(and (= main_~r~0 0) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~x~0)) (= main_~s~0 1) (= (+ (- 1) main_~k~0) 0) (= 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)); {7035#true} is VALID [2022-04-27 13:05:12,011 INFO L290 TraceCheckUtils]: 69: Hoare triple {7035#true} ~cond := #in~cond; {7035#true} is VALID [2022-04-27 13:05:12,011 INFO L290 TraceCheckUtils]: 70: Hoare triple {7035#true} assume !(0 == ~cond); {7035#true} is VALID [2022-04-27 13:05:12,011 INFO L290 TraceCheckUtils]: 71: Hoare triple {7035#true} assume true; {7035#true} is VALID [2022-04-27 13:05:12,011 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {7035#true} {7225#(and (= main_~r~0 0) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~x~0)) (= main_~s~0 1) (= (+ (- 1) main_~k~0) 0) (= main_~q~0 0) (= main_~p~0 1))} #93#return; {7225#(and (= main_~r~0 0) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~x~0)) (= main_~s~0 1) (= (+ (- 1) main_~k~0) 0) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-27 13:05:12,011 INFO L272 TraceCheckUtils]: 73: Hoare triple {7225#(and (= main_~r~0 0) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~x~0)) (= main_~s~0 1) (= (+ (- 1) main_~k~0) 0) (= 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)); {7035#true} is VALID [2022-04-27 13:05:12,011 INFO L290 TraceCheckUtils]: 74: Hoare triple {7035#true} ~cond := #in~cond; {7035#true} is VALID [2022-04-27 13:05:12,011 INFO L290 TraceCheckUtils]: 75: Hoare triple {7035#true} assume !(0 == ~cond); {7035#true} is VALID [2022-04-27 13:05:12,011 INFO L290 TraceCheckUtils]: 76: Hoare triple {7035#true} assume true; {7035#true} is VALID [2022-04-27 13:05:12,012 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {7035#true} {7225#(and (= main_~r~0 0) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~x~0)) (= main_~s~0 1) (= (+ (- 1) main_~k~0) 0) (= main_~q~0 0) (= main_~p~0 1))} #95#return; {7225#(and (= main_~r~0 0) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~x~0)) (= main_~s~0 1) (= (+ (- 1) main_~k~0) 0) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-27 13:05:12,012 INFO L272 TraceCheckUtils]: 78: Hoare triple {7225#(and (= main_~r~0 0) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~x~0)) (= main_~s~0 1) (= (+ (- 1) main_~k~0) 0) (= main_~q~0 0) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {7035#true} is VALID [2022-04-27 13:05:12,012 INFO L290 TraceCheckUtils]: 79: Hoare triple {7035#true} ~cond := #in~cond; {7035#true} is VALID [2022-04-27 13:05:12,012 INFO L290 TraceCheckUtils]: 80: Hoare triple {7035#true} assume !(0 == ~cond); {7035#true} is VALID [2022-04-27 13:05:12,012 INFO L290 TraceCheckUtils]: 81: Hoare triple {7035#true} assume true; {7035#true} is VALID [2022-04-27 13:05:12,013 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {7035#true} {7225#(and (= main_~r~0 0) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~x~0)) (= main_~s~0 1) (= (+ (- 1) main_~k~0) 0) (= main_~q~0 0) (= main_~p~0 1))} #97#return; {7225#(and (= main_~r~0 0) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~x~0)) (= main_~s~0 1) (= (+ (- 1) main_~k~0) 0) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-27 13:05:12,013 INFO L290 TraceCheckUtils]: 83: Hoare triple {7225#(and (= main_~r~0 0) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~x~0)) (= main_~s~0 1) (= (+ (- 1) main_~k~0) 0) (= main_~q~0 0) (= main_~p~0 1))} assume !(~c~0 >= ~b~0); {7225#(and (= main_~r~0 0) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~x~0)) (= main_~s~0 1) (= (+ (- 1) main_~k~0) 0) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-27 13:05:12,014 INFO L290 TraceCheckUtils]: 84: Hoare triple {7225#(and (= main_~r~0 0) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~x~0)) (= main_~s~0 1) (= (+ (- 1) main_~k~0) 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; {7295#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~q~0 1) (= (+ main_~s~0 1) 0))} is VALID [2022-04-27 13:05:12,014 INFO L290 TraceCheckUtils]: 85: Hoare triple {7295#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~q~0 1) (= (+ main_~s~0 1) 0))} assume !false; {7295#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~q~0 1) (= (+ main_~s~0 1) 0))} is VALID [2022-04-27 13:05:12,014 INFO L290 TraceCheckUtils]: 86: Hoare triple {7295#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~q~0 1) (= (+ main_~s~0 1) 0))} assume !(0 != ~b~0); {7302#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) 0) (= main_~q~0 1) (= (+ main_~s~0 1) 0))} is VALID [2022-04-27 13:05:12,015 INFO L272 TraceCheckUtils]: 87: Hoare triple {7302#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) 0) (= main_~q~0 1) (= (+ main_~s~0 1) 0))} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {7306#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:05:12,015 INFO L290 TraceCheckUtils]: 88: Hoare triple {7306#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7310#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:05:12,015 INFO L290 TraceCheckUtils]: 89: Hoare triple {7310#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7036#false} is VALID [2022-04-27 13:05:12,015 INFO L290 TraceCheckUtils]: 90: Hoare triple {7036#false} assume !false; {7036#false} is VALID [2022-04-27 13:05:12,016 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 16 proven. 8 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2022-04-27 13:05:12,016 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:05:12,475 INFO L290 TraceCheckUtils]: 90: Hoare triple {7036#false} assume !false; {7036#false} is VALID [2022-04-27 13:05:12,475 INFO L290 TraceCheckUtils]: 89: Hoare triple {7310#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7036#false} is VALID [2022-04-27 13:05:12,476 INFO L290 TraceCheckUtils]: 88: Hoare triple {7306#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7310#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:05:12,476 INFO L272 TraceCheckUtils]: 87: Hoare triple {7326#(= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) 0)} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {7306#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:05:12,476 INFO L290 TraceCheckUtils]: 86: Hoare triple {7330#(or (not (= main_~b~0 0)) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) 0))} assume !(0 != ~b~0); {7326#(= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) 0)} is VALID [2022-04-27 13:05:12,477 INFO L290 TraceCheckUtils]: 85: Hoare triple {7330#(or (not (= main_~b~0 0)) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) 0))} assume !false; {7330#(or (not (= main_~b~0 0)) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) 0))} is VALID [2022-04-27 13:05:12,890 INFO L290 TraceCheckUtils]: 84: Hoare triple {7337#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* 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)) 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; {7330#(or (not (= main_~b~0 0)) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) 0))} is VALID [2022-04-27 13:05:12,890 INFO L290 TraceCheckUtils]: 83: Hoare triple {7337#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* 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)) 0))} assume !(~c~0 >= ~b~0); {7337#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* 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)) 0))} is VALID [2022-04-27 13:05:12,891 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {7035#true} {7337#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* 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)) 0))} #97#return; {7337#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* 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)) 0))} is VALID [2022-04-27 13:05:12,891 INFO L290 TraceCheckUtils]: 81: Hoare triple {7035#true} assume true; {7035#true} is VALID [2022-04-27 13:05:12,891 INFO L290 TraceCheckUtils]: 80: Hoare triple {7035#true} assume !(0 == ~cond); {7035#true} is VALID [2022-04-27 13:05:12,891 INFO L290 TraceCheckUtils]: 79: Hoare triple {7035#true} ~cond := #in~cond; {7035#true} is VALID [2022-04-27 13:05:12,891 INFO L272 TraceCheckUtils]: 78: Hoare triple {7337#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* 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)) 0))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {7035#true} is VALID [2022-04-27 13:05:12,892 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {7035#true} {7337#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* 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)) 0))} #95#return; {7337#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* 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)) 0))} is VALID [2022-04-27 13:05:12,892 INFO L290 TraceCheckUtils]: 76: Hoare triple {7035#true} assume true; {7035#true} is VALID [2022-04-27 13:05:12,892 INFO L290 TraceCheckUtils]: 75: Hoare triple {7035#true} assume !(0 == ~cond); {7035#true} is VALID [2022-04-27 13:05:12,892 INFO L290 TraceCheckUtils]: 74: Hoare triple {7035#true} ~cond := #in~cond; {7035#true} is VALID [2022-04-27 13:05:12,892 INFO L272 TraceCheckUtils]: 73: Hoare triple {7337#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* 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)) 0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {7035#true} is VALID [2022-04-27 13:05:12,893 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {7035#true} {7337#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* 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)) 0))} #93#return; {7337#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* 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)) 0))} is VALID [2022-04-27 13:05:12,893 INFO L290 TraceCheckUtils]: 71: Hoare triple {7035#true} assume true; {7035#true} is VALID [2022-04-27 13:05:12,893 INFO L290 TraceCheckUtils]: 70: Hoare triple {7035#true} assume !(0 == ~cond); {7035#true} is VALID [2022-04-27 13:05:12,893 INFO L290 TraceCheckUtils]: 69: Hoare triple {7035#true} ~cond := #in~cond; {7035#true} is VALID [2022-04-27 13:05:12,893 INFO L272 TraceCheckUtils]: 68: Hoare triple {7337#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* 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)) 0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {7035#true} is VALID [2022-04-27 13:05:12,894 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {7035#true} {7337#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* 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)) 0))} #91#return; {7337#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* 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)) 0))} is VALID [2022-04-27 13:05:12,894 INFO L290 TraceCheckUtils]: 66: Hoare triple {7035#true} assume true; {7035#true} is VALID [2022-04-27 13:05:12,894 INFO L290 TraceCheckUtils]: 65: Hoare triple {7035#true} assume !(0 == ~cond); {7035#true} is VALID [2022-04-27 13:05:12,894 INFO L290 TraceCheckUtils]: 64: Hoare triple {7035#true} ~cond := #in~cond; {7035#true} is VALID [2022-04-27 13:05:12,894 INFO L272 TraceCheckUtils]: 63: Hoare triple {7337#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* 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)) 0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {7035#true} is VALID [2022-04-27 13:05:12,894 INFO L290 TraceCheckUtils]: 62: Hoare triple {7337#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* 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)) 0))} assume !false; {7337#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* 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)) 0))} is VALID [2022-04-27 13:05:13,099 INFO L290 TraceCheckUtils]: 61: Hoare triple {7407#(or (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 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))))) 0))} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {7337#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* 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)) 0))} is VALID [2022-04-27 13:05:13,101 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {7035#true} {7407#(or (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 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))))) 0))} #97#return; {7407#(or (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 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))))) 0))} is VALID [2022-04-27 13:05:13,101 INFO L290 TraceCheckUtils]: 59: Hoare triple {7035#true} assume true; {7035#true} is VALID [2022-04-27 13:05:13,102 INFO L290 TraceCheckUtils]: 58: Hoare triple {7035#true} assume !(0 == ~cond); {7035#true} is VALID [2022-04-27 13:05:13,102 INFO L290 TraceCheckUtils]: 57: Hoare triple {7035#true} ~cond := #in~cond; {7035#true} is VALID [2022-04-27 13:05:13,102 INFO L272 TraceCheckUtils]: 56: Hoare triple {7407#(or (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 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))))) 0))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {7035#true} is VALID [2022-04-27 13:05:13,102 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {7035#true} {7407#(or (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 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))))) 0))} #95#return; {7407#(or (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 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))))) 0))} is VALID [2022-04-27 13:05:13,102 INFO L290 TraceCheckUtils]: 54: Hoare triple {7035#true} assume true; {7035#true} is VALID [2022-04-27 13:05:13,102 INFO L290 TraceCheckUtils]: 53: Hoare triple {7035#true} assume !(0 == ~cond); {7035#true} is VALID [2022-04-27 13:05:13,102 INFO L290 TraceCheckUtils]: 52: Hoare triple {7035#true} ~cond := #in~cond; {7035#true} is VALID [2022-04-27 13:05:13,102 INFO L272 TraceCheckUtils]: 51: Hoare triple {7407#(or (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 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))))) 0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {7035#true} is VALID [2022-04-27 13:05:13,105 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {7035#true} {7407#(or (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 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))))) 0))} #93#return; {7407#(or (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 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))))) 0))} is VALID [2022-04-27 13:05:13,105 INFO L290 TraceCheckUtils]: 49: Hoare triple {7035#true} assume true; {7035#true} is VALID [2022-04-27 13:05:13,105 INFO L290 TraceCheckUtils]: 48: Hoare triple {7035#true} assume !(0 == ~cond); {7035#true} is VALID [2022-04-27 13:05:13,105 INFO L290 TraceCheckUtils]: 47: Hoare triple {7035#true} ~cond := #in~cond; {7035#true} is VALID [2022-04-27 13:05:13,105 INFO L272 TraceCheckUtils]: 46: Hoare triple {7407#(or (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 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))))) 0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {7035#true} is VALID [2022-04-27 13:05:13,106 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {7035#true} {7407#(or (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 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))))) 0))} #91#return; {7407#(or (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 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))))) 0))} is VALID [2022-04-27 13:05:13,106 INFO L290 TraceCheckUtils]: 44: Hoare triple {7035#true} assume true; {7035#true} is VALID [2022-04-27 13:05:13,106 INFO L290 TraceCheckUtils]: 43: Hoare triple {7035#true} assume !(0 == ~cond); {7035#true} is VALID [2022-04-27 13:05:13,106 INFO L290 TraceCheckUtils]: 42: Hoare triple {7035#true} ~cond := #in~cond; {7035#true} is VALID [2022-04-27 13:05:13,106 INFO L272 TraceCheckUtils]: 41: Hoare triple {7407#(or (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 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))))) 0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {7035#true} is VALID [2022-04-27 13:05:13,109 INFO L290 TraceCheckUtils]: 40: Hoare triple {7407#(or (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 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))))) 0))} assume !false; {7407#(or (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 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))))) 0))} is VALID [2022-04-27 13:05:13,110 INFO L290 TraceCheckUtils]: 39: Hoare triple {7474#(or (= (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))) 0) (not (= main_~b~0 main_~a~0)))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {7407#(or (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 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))))) 0))} is VALID [2022-04-27 13:05:13,110 INFO L290 TraceCheckUtils]: 38: Hoare triple {7474#(or (= (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))) 0) (not (= main_~b~0 main_~a~0)))} assume !false; {7474#(or (= (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))) 0) (not (= main_~b~0 main_~a~0)))} is VALID [2022-04-27 13:05:13,111 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {7035#true} {7474#(or (= (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))) 0) (not (= main_~b~0 main_~a~0)))} #89#return; {7474#(or (= (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))) 0) (not (= main_~b~0 main_~a~0)))} is VALID [2022-04-27 13:05:13,111 INFO L290 TraceCheckUtils]: 36: Hoare triple {7035#true} assume true; {7035#true} is VALID [2022-04-27 13:05:13,111 INFO L290 TraceCheckUtils]: 35: Hoare triple {7035#true} assume !(0 == ~cond); {7035#true} is VALID [2022-04-27 13:05:13,111 INFO L290 TraceCheckUtils]: 34: Hoare triple {7035#true} ~cond := #in~cond; {7035#true} is VALID [2022-04-27 13:05:13,111 INFO L272 TraceCheckUtils]: 33: Hoare triple {7474#(or (= (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))) 0) (not (= main_~b~0 main_~a~0)))} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {7035#true} is VALID [2022-04-27 13:05:13,112 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {7035#true} {7474#(or (= (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))) 0) (not (= main_~b~0 main_~a~0)))} #87#return; {7474#(or (= (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))) 0) (not (= main_~b~0 main_~a~0)))} is VALID [2022-04-27 13:05:13,112 INFO L290 TraceCheckUtils]: 31: Hoare triple {7035#true} assume true; {7035#true} is VALID [2022-04-27 13:05:13,112 INFO L290 TraceCheckUtils]: 30: Hoare triple {7035#true} assume !(0 == ~cond); {7035#true} is VALID [2022-04-27 13:05:13,112 INFO L290 TraceCheckUtils]: 29: Hoare triple {7035#true} ~cond := #in~cond; {7035#true} is VALID [2022-04-27 13:05:13,112 INFO L272 TraceCheckUtils]: 28: Hoare triple {7474#(or (= (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))) 0) (not (= main_~b~0 main_~a~0)))} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {7035#true} is VALID [2022-04-27 13:05:13,112 INFO L290 TraceCheckUtils]: 27: Hoare triple {7035#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {7474#(or (= (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))) 0) (not (= main_~b~0 main_~a~0)))} is VALID [2022-04-27 13:05:13,113 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {7035#true} {7035#true} #85#return; {7035#true} is VALID [2022-04-27 13:05:13,113 INFO L290 TraceCheckUtils]: 25: Hoare triple {7035#true} assume true; {7035#true} is VALID [2022-04-27 13:05:13,113 INFO L290 TraceCheckUtils]: 24: Hoare triple {7035#true} assume !(0 == ~cond); {7035#true} is VALID [2022-04-27 13:05:13,113 INFO L290 TraceCheckUtils]: 23: Hoare triple {7035#true} ~cond := #in~cond; {7035#true} is VALID [2022-04-27 13:05:13,113 INFO L272 TraceCheckUtils]: 22: Hoare triple {7035#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {7035#true} is VALID [2022-04-27 13:05:13,113 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {7035#true} {7035#true} #83#return; {7035#true} is VALID [2022-04-27 13:05:13,113 INFO L290 TraceCheckUtils]: 20: Hoare triple {7035#true} assume true; {7035#true} is VALID [2022-04-27 13:05:13,113 INFO L290 TraceCheckUtils]: 19: Hoare triple {7035#true} assume !(0 == ~cond); {7035#true} is VALID [2022-04-27 13:05:13,113 INFO L290 TraceCheckUtils]: 18: Hoare triple {7035#true} ~cond := #in~cond; {7035#true} is VALID [2022-04-27 13:05:13,113 INFO L272 TraceCheckUtils]: 17: Hoare triple {7035#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {7035#true} is VALID [2022-04-27 13:05:13,113 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {7035#true} {7035#true} #81#return; {7035#true} is VALID [2022-04-27 13:05:13,113 INFO L290 TraceCheckUtils]: 15: Hoare triple {7035#true} assume true; {7035#true} is VALID [2022-04-27 13:05:13,113 INFO L290 TraceCheckUtils]: 14: Hoare triple {7035#true} assume !(0 == ~cond); {7035#true} is VALID [2022-04-27 13:05:13,113 INFO L290 TraceCheckUtils]: 13: Hoare triple {7035#true} ~cond := #in~cond; {7035#true} is VALID [2022-04-27 13:05:13,113 INFO L272 TraceCheckUtils]: 12: Hoare triple {7035#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 20 then 1 else 0)); {7035#true} is VALID [2022-04-27 13:05:13,113 INFO L290 TraceCheckUtils]: 11: Hoare triple {7035#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {7035#true} is VALID [2022-04-27 13:05:13,113 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7035#true} {7035#true} #79#return; {7035#true} is VALID [2022-04-27 13:05:13,113 INFO L290 TraceCheckUtils]: 9: Hoare triple {7035#true} assume true; {7035#true} is VALID [2022-04-27 13:05:13,113 INFO L290 TraceCheckUtils]: 8: Hoare triple {7035#true} assume !(0 == ~cond); {7035#true} is VALID [2022-04-27 13:05:13,113 INFO L290 TraceCheckUtils]: 7: Hoare triple {7035#true} ~cond := #in~cond; {7035#true} is VALID [2022-04-27 13:05:13,113 INFO L272 TraceCheckUtils]: 6: Hoare triple {7035#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 20 then 1 else 0)); {7035#true} is VALID [2022-04-27 13:05:13,113 INFO L290 TraceCheckUtils]: 5: Hoare triple {7035#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {7035#true} is VALID [2022-04-27 13:05:13,114 INFO L272 TraceCheckUtils]: 4: Hoare triple {7035#true} call #t~ret6 := main(); {7035#true} is VALID [2022-04-27 13:05:13,114 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7035#true} {7035#true} #103#return; {7035#true} is VALID [2022-04-27 13:05:13,114 INFO L290 TraceCheckUtils]: 2: Hoare triple {7035#true} assume true; {7035#true} is VALID [2022-04-27 13:05:13,114 INFO L290 TraceCheckUtils]: 1: Hoare triple {7035#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); {7035#true} is VALID [2022-04-27 13:05:13,114 INFO L272 TraceCheckUtils]: 0: Hoare triple {7035#true} call ULTIMATE.init(); {7035#true} is VALID [2022-04-27 13:05:13,114 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 16 proven. 8 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2022-04-27 13:05:13,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:05:13,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368470707] [2022-04-27 13:05:13,114 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:05:13,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1304892550] [2022-04-27 13:05:13,114 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1304892550] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 13:05:13,114 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 13:05:13,114 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2022-04-27 13:05:13,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932119172] [2022-04-27 13:05:13,115 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 13:05:13,115 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 2.75) internal successors, (33), 13 states have internal predecessors, (33), 9 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 91 [2022-04-27 13:05:13,115 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:05:13,115 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 12 states have (on average 2.75) internal successors, (33), 13 states have internal predecessors, (33), 9 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:05:13,526 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:05:13,526 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-27 13:05:13,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:05:13,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-27 13:05:13,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-04-27 13:05:13,531 INFO L87 Difference]: Start difference. First operand 139 states and 176 transitions. Second operand has 14 states, 12 states have (on average 2.75) internal successors, (33), 13 states have internal predecessors, (33), 9 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:05:18,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:05:18,654 INFO L93 Difference]: Finished difference Result 228 states and 311 transitions. [2022-04-27 13:05:18,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-27 13:05:18,654 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 2.75) internal successors, (33), 13 states have internal predecessors, (33), 9 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 91 [2022-04-27 13:05:18,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:05:18,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 12 states have (on average 2.75) internal successors, (33), 13 states have internal predecessors, (33), 9 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:05:18,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 176 transitions. [2022-04-27 13:05:18,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 12 states have (on average 2.75) internal successors, (33), 13 states have internal predecessors, (33), 9 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:05:18,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 176 transitions. [2022-04-27 13:05:18,659 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 176 transitions. [2022-04-27 13:05:21,160 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 176 edges. 176 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:05:21,164 INFO L225 Difference]: With dead ends: 228 [2022-04-27 13:05:21,164 INFO L226 Difference]: Without dead ends: 220 [2022-04-27 13:05:21,164 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 168 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=178, Invalid=692, Unknown=0, NotChecked=0, Total=870 [2022-04-27 13:05:21,164 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 50 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 598 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 698 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 598 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-27 13:05:21,165 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 337 Invalid, 698 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 598 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-04-27 13:05:21,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2022-04-27 13:05:21,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 216. [2022-04-27 13:05:21,454 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:05:21,455 INFO L82 GeneralOperation]: Start isEquivalent. First operand 220 states. Second operand has 216 states, 116 states have (on average 1.1810344827586208) internal successors, (137), 117 states have internal predecessors, (137), 81 states have call successors, (81), 19 states have call predecessors, (81), 18 states have return successors, (79), 79 states have call predecessors, (79), 79 states have call successors, (79) [2022-04-27 13:05:21,455 INFO L74 IsIncluded]: Start isIncluded. First operand 220 states. Second operand has 216 states, 116 states have (on average 1.1810344827586208) internal successors, (137), 117 states have internal predecessors, (137), 81 states have call successors, (81), 19 states have call predecessors, (81), 18 states have return successors, (79), 79 states have call predecessors, (79), 79 states have call successors, (79) [2022-04-27 13:05:21,455 INFO L87 Difference]: Start difference. First operand 220 states. Second operand has 216 states, 116 states have (on average 1.1810344827586208) internal successors, (137), 117 states have internal predecessors, (137), 81 states have call successors, (81), 19 states have call predecessors, (81), 18 states have return successors, (79), 79 states have call predecessors, (79), 79 states have call successors, (79) [2022-04-27 13:05:21,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:05:21,460 INFO L93 Difference]: Finished difference Result 220 states and 301 transitions. [2022-04-27 13:05:21,460 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 301 transitions. [2022-04-27 13:05:21,461 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:05:21,461 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:05:21,461 INFO L74 IsIncluded]: Start isIncluded. First operand has 216 states, 116 states have (on average 1.1810344827586208) internal successors, (137), 117 states have internal predecessors, (137), 81 states have call successors, (81), 19 states have call predecessors, (81), 18 states have return successors, (79), 79 states have call predecessors, (79), 79 states have call successors, (79) Second operand 220 states. [2022-04-27 13:05:21,461 INFO L87 Difference]: Start difference. First operand has 216 states, 116 states have (on average 1.1810344827586208) internal successors, (137), 117 states have internal predecessors, (137), 81 states have call successors, (81), 19 states have call predecessors, (81), 18 states have return successors, (79), 79 states have call predecessors, (79), 79 states have call successors, (79) Second operand 220 states. [2022-04-27 13:05:21,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:05:21,466 INFO L93 Difference]: Finished difference Result 220 states and 301 transitions. [2022-04-27 13:05:21,466 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 301 transitions. [2022-04-27 13:05:21,466 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:05:21,467 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:05:21,467 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:05:21,467 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:05:21,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 116 states have (on average 1.1810344827586208) internal successors, (137), 117 states have internal predecessors, (137), 81 states have call successors, (81), 19 states have call predecessors, (81), 18 states have return successors, (79), 79 states have call predecessors, (79), 79 states have call successors, (79) [2022-04-27 13:05:21,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 297 transitions. [2022-04-27 13:05:21,472 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 297 transitions. Word has length 91 [2022-04-27 13:05:21,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:05:21,472 INFO L495 AbstractCegarLoop]: Abstraction has 216 states and 297 transitions. [2022-04-27 13:05:21,472 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 2.75) internal successors, (33), 13 states have internal predecessors, (33), 9 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:05:21,472 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 297 transitions. [2022-04-27 13:05:21,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-04-27 13:05:21,473 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:05:21,473 INFO L195 NwaCegarLoop]: trace histogram [12, 11, 11, 6, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:05:21,491 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:05:21,687 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:05:21,688 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:05:21,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:05:21,688 INFO L85 PathProgramCache]: Analyzing trace with hash -428114403, now seen corresponding path program 1 times [2022-04-27 13:05:21,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:05:21,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339462980] [2022-04-27 13:05:21,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:05:21,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:05:21,699 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:05:21,699 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1121299342] [2022-04-27 13:05:21,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:05:21,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:05:21,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:05:21,700 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:05:21,701 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:05:21,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:05:21,771 INFO L263 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 54 conjunts are in the unsatisfiable core [2022-04-27 13:05:21,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:05:21,788 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:05:22,680 INFO L272 TraceCheckUtils]: 0: Hoare triple {8765#true} call ULTIMATE.init(); {8765#true} is VALID [2022-04-27 13:05:22,681 INFO L290 TraceCheckUtils]: 1: Hoare triple {8765#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); {8765#true} is VALID [2022-04-27 13:05:22,681 INFO L290 TraceCheckUtils]: 2: Hoare triple {8765#true} assume true; {8765#true} is VALID [2022-04-27 13:05:22,681 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8765#true} {8765#true} #103#return; {8765#true} is VALID [2022-04-27 13:05:22,681 INFO L272 TraceCheckUtils]: 4: Hoare triple {8765#true} call #t~ret6 := main(); {8765#true} is VALID [2022-04-27 13:05:22,681 INFO L290 TraceCheckUtils]: 5: Hoare triple {8765#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {8765#true} is VALID [2022-04-27 13:05:22,681 INFO L272 TraceCheckUtils]: 6: Hoare triple {8765#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 20 then 1 else 0)); {8765#true} is VALID [2022-04-27 13:05:22,681 INFO L290 TraceCheckUtils]: 7: Hoare triple {8765#true} ~cond := #in~cond; {8765#true} is VALID [2022-04-27 13:05:22,681 INFO L290 TraceCheckUtils]: 8: Hoare triple {8765#true} assume !(0 == ~cond); {8765#true} is VALID [2022-04-27 13:05:22,681 INFO L290 TraceCheckUtils]: 9: Hoare triple {8765#true} assume true; {8765#true} is VALID [2022-04-27 13:05:22,681 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8765#true} {8765#true} #79#return; {8765#true} is VALID [2022-04-27 13:05:22,681 INFO L290 TraceCheckUtils]: 11: Hoare triple {8765#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {8765#true} is VALID [2022-04-27 13:05:22,681 INFO L272 TraceCheckUtils]: 12: Hoare triple {8765#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 20 then 1 else 0)); {8765#true} is VALID [2022-04-27 13:05:22,681 INFO L290 TraceCheckUtils]: 13: Hoare triple {8765#true} ~cond := #in~cond; {8765#true} is VALID [2022-04-27 13:05:22,681 INFO L290 TraceCheckUtils]: 14: Hoare triple {8765#true} assume !(0 == ~cond); {8765#true} is VALID [2022-04-27 13:05:22,681 INFO L290 TraceCheckUtils]: 15: Hoare triple {8765#true} assume true; {8765#true} is VALID [2022-04-27 13:05:22,681 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {8765#true} {8765#true} #81#return; {8765#true} is VALID [2022-04-27 13:05:22,681 INFO L272 TraceCheckUtils]: 17: Hoare triple {8765#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {8765#true} is VALID [2022-04-27 13:05:22,681 INFO L290 TraceCheckUtils]: 18: Hoare triple {8765#true} ~cond := #in~cond; {8765#true} is VALID [2022-04-27 13:05:22,681 INFO L290 TraceCheckUtils]: 19: Hoare triple {8765#true} assume !(0 == ~cond); {8765#true} is VALID [2022-04-27 13:05:22,681 INFO L290 TraceCheckUtils]: 20: Hoare triple {8765#true} assume true; {8765#true} is VALID [2022-04-27 13:05:22,681 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {8765#true} {8765#true} #83#return; {8765#true} is VALID [2022-04-27 13:05:22,682 INFO L272 TraceCheckUtils]: 22: Hoare triple {8765#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {8765#true} is VALID [2022-04-27 13:05:22,682 INFO L290 TraceCheckUtils]: 23: Hoare triple {8765#true} ~cond := #in~cond; {8765#true} is VALID [2022-04-27 13:05:22,682 INFO L290 TraceCheckUtils]: 24: Hoare triple {8765#true} assume !(0 == ~cond); {8765#true} is VALID [2022-04-27 13:05:22,682 INFO L290 TraceCheckUtils]: 25: Hoare triple {8765#true} assume true; {8765#true} is VALID [2022-04-27 13:05:22,682 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {8765#true} {8765#true} #85#return; {8765#true} is VALID [2022-04-27 13:05:22,682 INFO L290 TraceCheckUtils]: 27: Hoare triple {8765#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {8851#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:05:22,682 INFO L272 TraceCheckUtils]: 28: Hoare triple {8851#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {8765#true} is VALID [2022-04-27 13:05:22,682 INFO L290 TraceCheckUtils]: 29: Hoare triple {8765#true} ~cond := #in~cond; {8765#true} is VALID [2022-04-27 13:05:22,682 INFO L290 TraceCheckUtils]: 30: Hoare triple {8765#true} assume !(0 == ~cond); {8765#true} is VALID [2022-04-27 13:05:22,682 INFO L290 TraceCheckUtils]: 31: Hoare triple {8765#true} assume true; {8765#true} is VALID [2022-04-27 13:05:22,683 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {8765#true} {8851#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #87#return; {8851#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:05:22,683 INFO L272 TraceCheckUtils]: 33: Hoare triple {8851#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {8765#true} is VALID [2022-04-27 13:05:22,683 INFO L290 TraceCheckUtils]: 34: Hoare triple {8765#true} ~cond := #in~cond; {8765#true} is VALID [2022-04-27 13:05:22,683 INFO L290 TraceCheckUtils]: 35: Hoare triple {8765#true} assume !(0 == ~cond); {8765#true} is VALID [2022-04-27 13:05:22,683 INFO L290 TraceCheckUtils]: 36: Hoare triple {8765#true} assume true; {8765#true} is VALID [2022-04-27 13:05:22,684 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {8765#true} {8851#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #89#return; {8851#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:05:22,684 INFO L290 TraceCheckUtils]: 38: Hoare triple {8851#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !false; {8851#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:05:22,685 INFO L290 TraceCheckUtils]: 39: Hoare triple {8851#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {8888#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:05:22,685 INFO L290 TraceCheckUtils]: 40: Hoare triple {8888#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} assume !false; {8888#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:05:22,685 INFO L272 TraceCheckUtils]: 41: Hoare triple {8888#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {8765#true} is VALID [2022-04-27 13:05:22,685 INFO L290 TraceCheckUtils]: 42: Hoare triple {8765#true} ~cond := #in~cond; {8765#true} is VALID [2022-04-27 13:05:22,685 INFO L290 TraceCheckUtils]: 43: Hoare triple {8765#true} assume !(0 == ~cond); {8765#true} is VALID [2022-04-27 13:05:22,685 INFO L290 TraceCheckUtils]: 44: Hoare triple {8765#true} assume true; {8765#true} is VALID [2022-04-27 13:05:22,686 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {8765#true} {8888#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #91#return; {8888#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:05:22,686 INFO L272 TraceCheckUtils]: 46: Hoare triple {8888#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {8765#true} is VALID [2022-04-27 13:05:22,686 INFO L290 TraceCheckUtils]: 47: Hoare triple {8765#true} ~cond := #in~cond; {8765#true} is VALID [2022-04-27 13:05:22,686 INFO L290 TraceCheckUtils]: 48: Hoare triple {8765#true} assume !(0 == ~cond); {8765#true} is VALID [2022-04-27 13:05:22,686 INFO L290 TraceCheckUtils]: 49: Hoare triple {8765#true} assume true; {8765#true} is VALID [2022-04-27 13:05:22,686 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {8765#true} {8888#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #93#return; {8888#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:05:22,687 INFO L272 TraceCheckUtils]: 51: Hoare triple {8888#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {8765#true} is VALID [2022-04-27 13:05:22,687 INFO L290 TraceCheckUtils]: 52: Hoare triple {8765#true} ~cond := #in~cond; {8765#true} is VALID [2022-04-27 13:05:22,687 INFO L290 TraceCheckUtils]: 53: Hoare triple {8765#true} assume !(0 == ~cond); {8765#true} is VALID [2022-04-27 13:05:22,687 INFO L290 TraceCheckUtils]: 54: Hoare triple {8765#true} assume true; {8765#true} is VALID [2022-04-27 13:05:22,687 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {8765#true} {8888#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #95#return; {8888#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:05:22,687 INFO L272 TraceCheckUtils]: 56: Hoare triple {8888#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {8765#true} is VALID [2022-04-27 13:05:22,687 INFO L290 TraceCheckUtils]: 57: Hoare triple {8765#true} ~cond := #in~cond; {8765#true} is VALID [2022-04-27 13:05:22,687 INFO L290 TraceCheckUtils]: 58: Hoare triple {8765#true} assume !(0 == ~cond); {8765#true} is VALID [2022-04-27 13:05:22,687 INFO L290 TraceCheckUtils]: 59: Hoare triple {8765#true} assume true; {8765#true} is VALID [2022-04-27 13:05:22,688 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {8765#true} {8888#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #97#return; {8888#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:05:22,688 INFO L290 TraceCheckUtils]: 61: Hoare triple {8888#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {8955#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 main_~b~0)) (= main_~s~0 1) (= (+ (- 1) main_~k~0) 0) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~p~0 1))} is VALID [2022-04-27 13:05:22,689 INFO L290 TraceCheckUtils]: 62: Hoare triple {8955#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 main_~b~0)) (= main_~s~0 1) (= (+ (- 1) main_~k~0) 0) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~p~0 1))} assume !false; {8955#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 main_~b~0)) (= main_~s~0 1) (= (+ (- 1) main_~k~0) 0) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~p~0 1))} is VALID [2022-04-27 13:05:22,689 INFO L272 TraceCheckUtils]: 63: Hoare triple {8955#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 main_~b~0)) (= main_~s~0 1) (= (+ (- 1) main_~k~0) 0) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {8765#true} is VALID [2022-04-27 13:05:22,689 INFO L290 TraceCheckUtils]: 64: Hoare triple {8765#true} ~cond := #in~cond; {8765#true} is VALID [2022-04-27 13:05:22,689 INFO L290 TraceCheckUtils]: 65: Hoare triple {8765#true} assume !(0 == ~cond); {8765#true} is VALID [2022-04-27 13:05:22,689 INFO L290 TraceCheckUtils]: 66: Hoare triple {8765#true} assume true; {8765#true} is VALID [2022-04-27 13:05:22,690 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {8765#true} {8955#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 main_~b~0)) (= main_~s~0 1) (= (+ (- 1) main_~k~0) 0) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~p~0 1))} #91#return; {8955#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 main_~b~0)) (= main_~s~0 1) (= (+ (- 1) main_~k~0) 0) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~p~0 1))} is VALID [2022-04-27 13:05:22,690 INFO L272 TraceCheckUtils]: 68: Hoare triple {8955#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 main_~b~0)) (= main_~s~0 1) (= (+ (- 1) main_~k~0) 0) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {8765#true} is VALID [2022-04-27 13:05:22,690 INFO L290 TraceCheckUtils]: 69: Hoare triple {8765#true} ~cond := #in~cond; {8765#true} is VALID [2022-04-27 13:05:22,690 INFO L290 TraceCheckUtils]: 70: Hoare triple {8765#true} assume !(0 == ~cond); {8765#true} is VALID [2022-04-27 13:05:22,690 INFO L290 TraceCheckUtils]: 71: Hoare triple {8765#true} assume true; {8765#true} is VALID [2022-04-27 13:05:22,690 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {8765#true} {8955#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 main_~b~0)) (= main_~s~0 1) (= (+ (- 1) main_~k~0) 0) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~p~0 1))} #93#return; {8955#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 main_~b~0)) (= main_~s~0 1) (= (+ (- 1) main_~k~0) 0) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~p~0 1))} is VALID [2022-04-27 13:05:22,690 INFO L272 TraceCheckUtils]: 73: Hoare triple {8955#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 main_~b~0)) (= main_~s~0 1) (= (+ (- 1) main_~k~0) 0) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~p~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {8765#true} is VALID [2022-04-27 13:05:22,691 INFO L290 TraceCheckUtils]: 74: Hoare triple {8765#true} ~cond := #in~cond; {8995#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:05:22,691 INFO L290 TraceCheckUtils]: 75: Hoare triple {8995#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {8999#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:05:22,691 INFO L290 TraceCheckUtils]: 76: Hoare triple {8999#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {8999#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:05:22,692 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {8999#(not (= |__VERIFIER_assert_#in~cond| 0))} {8955#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 main_~b~0)) (= main_~s~0 1) (= (+ (- 1) main_~k~0) 0) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~p~0 1))} #95#return; {8955#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 main_~b~0)) (= main_~s~0 1) (= (+ (- 1) main_~k~0) 0) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~p~0 1))} is VALID [2022-04-27 13:05:22,692 INFO L272 TraceCheckUtils]: 78: Hoare triple {8955#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 main_~b~0)) (= main_~s~0 1) (= (+ (- 1) main_~k~0) 0) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {8765#true} is VALID [2022-04-27 13:05:22,692 INFO L290 TraceCheckUtils]: 79: Hoare triple {8765#true} ~cond := #in~cond; {8995#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:05:22,692 INFO L290 TraceCheckUtils]: 80: Hoare triple {8995#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {8999#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:05:22,692 INFO L290 TraceCheckUtils]: 81: Hoare triple {8999#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {8999#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:05:22,693 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {8999#(not (= |__VERIFIER_assert_#in~cond| 0))} {8955#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 main_~b~0)) (= main_~s~0 1) (= (+ (- 1) main_~k~0) 0) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~p~0 1))} #97#return; {9021#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~k~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~x~0 (+ main_~c~0 main_~y~0)) (= main_~p~0 1))} is VALID [2022-04-27 13:05:22,694 INFO L290 TraceCheckUtils]: 83: Hoare triple {9021#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~k~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~x~0 (+ main_~c~0 main_~y~0)) (= main_~p~0 1))} assume !(~c~0 >= ~b~0); {9021#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~k~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~x~0 (+ main_~c~0 main_~y~0)) (= main_~p~0 1))} is VALID [2022-04-27 13:05:22,694 INFO L290 TraceCheckUtils]: 84: Hoare triple {9021#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~k~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~x~0 (+ main_~c~0 main_~y~0)) (= main_~p~0 1))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {9028#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= (+ main_~s~0 1) 0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-27 13:05:22,694 INFO L290 TraceCheckUtils]: 85: Hoare triple {9028#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= (+ main_~s~0 1) 0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} assume !false; {9028#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= (+ main_~s~0 1) 0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-27 13:05:22,695 INFO L290 TraceCheckUtils]: 86: Hoare triple {9028#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= (+ main_~s~0 1) 0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {9028#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= (+ main_~s~0 1) 0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-27 13:05:22,695 INFO L290 TraceCheckUtils]: 87: Hoare triple {9028#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= (+ main_~s~0 1) 0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} assume !false; {9028#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= (+ main_~s~0 1) 0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-27 13:05:22,695 INFO L272 TraceCheckUtils]: 88: Hoare triple {9028#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= (+ main_~s~0 1) 0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {8765#true} is VALID [2022-04-27 13:05:22,695 INFO L290 TraceCheckUtils]: 89: Hoare triple {8765#true} ~cond := #in~cond; {8765#true} is VALID [2022-04-27 13:05:22,695 INFO L290 TraceCheckUtils]: 90: Hoare triple {8765#true} assume !(0 == ~cond); {8765#true} is VALID [2022-04-27 13:05:22,695 INFO L290 TraceCheckUtils]: 91: Hoare triple {8765#true} assume true; {8765#true} is VALID [2022-04-27 13:05:22,696 INFO L284 TraceCheckUtils]: 92: Hoare quadruple {8765#true} {9028#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= (+ main_~s~0 1) 0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #91#return; {9028#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= (+ main_~s~0 1) 0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-27 13:05:22,696 INFO L272 TraceCheckUtils]: 93: Hoare triple {9028#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= (+ main_~s~0 1) 0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {8765#true} is VALID [2022-04-27 13:05:22,696 INFO L290 TraceCheckUtils]: 94: Hoare triple {8765#true} ~cond := #in~cond; {8765#true} is VALID [2022-04-27 13:05:22,696 INFO L290 TraceCheckUtils]: 95: Hoare triple {8765#true} assume !(0 == ~cond); {8765#true} is VALID [2022-04-27 13:05:22,696 INFO L290 TraceCheckUtils]: 96: Hoare triple {8765#true} assume true; {8765#true} is VALID [2022-04-27 13:05:22,697 INFO L284 TraceCheckUtils]: 97: Hoare quadruple {8765#true} {9028#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= (+ main_~s~0 1) 0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #93#return; {9028#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= (+ main_~s~0 1) 0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-27 13:05:22,697 INFO L272 TraceCheckUtils]: 98: Hoare triple {9028#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= (+ main_~s~0 1) 0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {8765#true} is VALID [2022-04-27 13:05:22,697 INFO L290 TraceCheckUtils]: 99: Hoare triple {8765#true} ~cond := #in~cond; {8995#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:05:22,697 INFO L290 TraceCheckUtils]: 100: Hoare triple {8995#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {8999#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:05:22,697 INFO L290 TraceCheckUtils]: 101: Hoare triple {8999#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {8999#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:05:22,698 INFO L284 TraceCheckUtils]: 102: Hoare quadruple {8999#(not (= |__VERIFIER_assert_#in~cond| 0))} {9028#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= (+ main_~s~0 1) 0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #95#return; {9028#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= (+ main_~s~0 1) 0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-27 13:05:22,699 INFO L272 TraceCheckUtils]: 103: Hoare triple {9028#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= (+ main_~s~0 1) 0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {9086#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:05:22,700 INFO L290 TraceCheckUtils]: 104: Hoare triple {9086#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {9090#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:05:22,700 INFO L290 TraceCheckUtils]: 105: Hoare triple {9090#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8766#false} is VALID [2022-04-27 13:05:22,700 INFO L290 TraceCheckUtils]: 106: Hoare triple {8766#false} assume !false; {8766#false} is VALID [2022-04-27 13:05:22,700 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 79 proven. 33 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2022-04-27 13:05:22,701 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:06:43,977 INFO L290 TraceCheckUtils]: 106: Hoare triple {8766#false} assume !false; {8766#false} is VALID [2022-04-27 13:06:43,977 INFO L290 TraceCheckUtils]: 105: Hoare triple {9090#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8766#false} is VALID [2022-04-27 13:06:43,977 INFO L290 TraceCheckUtils]: 104: Hoare triple {9086#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {9090#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:06:43,978 INFO L272 TraceCheckUtils]: 103: Hoare triple {9106#(= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {9086#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:06:43,979 INFO L284 TraceCheckUtils]: 102: Hoare quadruple {8999#(not (= |__VERIFIER_assert_#in~cond| 0))} {9110#(or (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} #95#return; {9106#(= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))} is VALID [2022-04-27 13:06:43,979 INFO L290 TraceCheckUtils]: 101: Hoare triple {8999#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {8999#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:06:43,979 INFO L290 TraceCheckUtils]: 100: Hoare triple {9120#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {8999#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:06:43,980 INFO L290 TraceCheckUtils]: 99: Hoare triple {8765#true} ~cond := #in~cond; {9120#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 13:06:43,980 INFO L272 TraceCheckUtils]: 98: Hoare triple {9110#(or (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {8765#true} is VALID [2022-04-27 13:06:43,980 INFO L284 TraceCheckUtils]: 97: Hoare quadruple {8765#true} {9110#(or (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} #93#return; {9110#(or (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is VALID [2022-04-27 13:06:43,980 INFO L290 TraceCheckUtils]: 96: Hoare triple {8765#true} assume true; {8765#true} is VALID [2022-04-27 13:06:43,980 INFO L290 TraceCheckUtils]: 95: Hoare triple {8765#true} assume !(0 == ~cond); {8765#true} is VALID [2022-04-27 13:06:43,980 INFO L290 TraceCheckUtils]: 94: Hoare triple {8765#true} ~cond := #in~cond; {8765#true} is VALID [2022-04-27 13:06:43,980 INFO L272 TraceCheckUtils]: 93: Hoare triple {9110#(or (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {8765#true} is VALID [2022-04-27 13:06:43,981 INFO L284 TraceCheckUtils]: 92: Hoare quadruple {8765#true} {9110#(or (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} #91#return; {9110#(or (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is VALID [2022-04-27 13:06:43,981 INFO L290 TraceCheckUtils]: 91: Hoare triple {8765#true} assume true; {8765#true} is VALID [2022-04-27 13:06:43,981 INFO L290 TraceCheckUtils]: 90: Hoare triple {8765#true} assume !(0 == ~cond); {8765#true} is VALID [2022-04-27 13:06:43,981 INFO L290 TraceCheckUtils]: 89: Hoare triple {8765#true} ~cond := #in~cond; {8765#true} is VALID [2022-04-27 13:06:43,981 INFO L272 TraceCheckUtils]: 88: Hoare triple {9110#(or (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {8765#true} is VALID [2022-04-27 13:06:43,982 INFO L290 TraceCheckUtils]: 87: Hoare triple {9110#(or (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} assume !false; {9110#(or (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is VALID [2022-04-27 13:06:43,982 INFO L290 TraceCheckUtils]: 86: Hoare triple {9110#(or (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {9110#(or (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is VALID [2022-04-27 13:06:43,982 INFO L290 TraceCheckUtils]: 85: Hoare triple {9110#(or (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} assume !false; {9110#(or (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is VALID [2022-04-27 13:06:45,984 WARN L290 TraceCheckUtils]: 84: Hoare triple {9166#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* (+ (* (+ (* (* 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_~y~0) (* (+ (* (* 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))) (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {9110#(or (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is UNKNOWN [2022-04-27 13:06:45,985 INFO L290 TraceCheckUtils]: 83: Hoare triple {9166#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* (+ (* (+ (* (* 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_~y~0) (* (+ (* (* 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))) (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)))} assume !(~c~0 >= ~b~0); {9166#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* (+ (* (+ (* (* 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_~y~0) (* (+ (* (* 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))) (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)))} is VALID [2022-04-27 13:06:45,986 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {8999#(not (= |__VERIFIER_assert_#in~cond| 0))} {9173#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* (+ (* (+ (* (* 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_~y~0) (* (+ (* (* 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))) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= (+ (* (+ (* (* main_~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)))} #97#return; {9166#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* (+ (* (+ (* (* 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_~y~0) (* (+ (* (* 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))) (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)))} is VALID [2022-04-27 13:06:45,986 INFO L290 TraceCheckUtils]: 81: Hoare triple {8999#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {8999#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:06:45,986 INFO L290 TraceCheckUtils]: 80: Hoare triple {9120#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {8999#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:06:45,987 INFO L290 TraceCheckUtils]: 79: Hoare triple {8765#true} ~cond := #in~cond; {9120#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 13:06:45,987 INFO L272 TraceCheckUtils]: 78: Hoare triple {9173#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* (+ (* (+ (* (* 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_~y~0) (* (+ (* (* 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))) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {8765#true} is VALID [2022-04-27 13:06:45,988 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {8999#(not (= |__VERIFIER_assert_#in~cond| 0))} {9189#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* (+ (* (+ (* (* 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_~y~0) (* (+ (* (* 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))) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)))} #95#return; {9173#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* (+ (* (+ (* (* 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_~y~0) (* (+ (* (* 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))) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= (+ (* (+ (* (* main_~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:06:45,988 INFO L290 TraceCheckUtils]: 76: Hoare triple {8999#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {8999#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:06:45,988 INFO L290 TraceCheckUtils]: 75: Hoare triple {9120#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {8999#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:06:45,988 INFO L290 TraceCheckUtils]: 74: Hoare triple {8765#true} ~cond := #in~cond; {9120#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 13:06:45,989 INFO L272 TraceCheckUtils]: 73: Hoare triple {9189#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* (+ (* (+ (* (* 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_~y~0) (* (+ (* (* 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))) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {8765#true} is VALID [2022-04-27 13:06:45,989 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {8765#true} {9189#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* (+ (* (+ (* (* 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_~y~0) (* (+ (* (* 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))) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)))} #93#return; {9189#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* (+ (* (+ (* (* 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_~y~0) (* (+ (* (* 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))) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)))} is VALID [2022-04-27 13:06:45,989 INFO L290 TraceCheckUtils]: 71: Hoare triple {8765#true} assume true; {8765#true} is VALID [2022-04-27 13:06:45,989 INFO L290 TraceCheckUtils]: 70: Hoare triple {8765#true} assume !(0 == ~cond); {8765#true} is VALID [2022-04-27 13:06:45,989 INFO L290 TraceCheckUtils]: 69: Hoare triple {8765#true} ~cond := #in~cond; {8765#true} is VALID [2022-04-27 13:06:45,989 INFO L272 TraceCheckUtils]: 68: Hoare triple {9189#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* (+ (* (+ (* (* 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_~y~0) (* (+ (* (* 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))) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {8765#true} is VALID [2022-04-27 13:06:45,990 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {8765#true} {9189#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* (+ (* (+ (* (* 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_~y~0) (* (+ (* (* 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))) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)))} #91#return; {9189#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* (+ (* (+ (* (* 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_~y~0) (* (+ (* (* 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))) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)))} is VALID [2022-04-27 13:06:45,990 INFO L290 TraceCheckUtils]: 66: Hoare triple {8765#true} assume true; {8765#true} is VALID [2022-04-27 13:06:45,990 INFO L290 TraceCheckUtils]: 65: Hoare triple {8765#true} assume !(0 == ~cond); {8765#true} is VALID [2022-04-27 13:06:45,990 INFO L290 TraceCheckUtils]: 64: Hoare triple {8765#true} ~cond := #in~cond; {8765#true} is VALID [2022-04-27 13:06:45,990 INFO L272 TraceCheckUtils]: 63: Hoare triple {9189#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* (+ (* (+ (* (* 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_~y~0) (* (+ (* (* 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))) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {8765#true} is VALID [2022-04-27 13:06:45,991 INFO L290 TraceCheckUtils]: 62: Hoare triple {9189#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* (+ (* (+ (* (* 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_~y~0) (* (+ (* (* 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))) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)))} assume !false; {9189#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* (+ (* (+ (* (* 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_~y~0) (* (+ (* (* 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))) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)))} is VALID [2022-04-27 13:06:47,993 WARN L290 TraceCheckUtils]: 61: Hoare triple {9189#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* (+ (* (+ (* (* 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_~y~0) (* (+ (* (* 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))) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)))} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {9189#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* (+ (* (+ (* (* 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_~y~0) (* (+ (* (* 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))) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)))} is UNKNOWN [2022-04-27 13:06:47,994 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {8765#true} {9189#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* (+ (* (+ (* (* 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_~y~0) (* (+ (* (* 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))) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)))} #97#return; {9189#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* (+ (* (+ (* (* 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_~y~0) (* (+ (* (* 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))) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)))} is VALID [2022-04-27 13:06:47,994 INFO L290 TraceCheckUtils]: 59: Hoare triple {8765#true} assume true; {8765#true} is VALID [2022-04-27 13:06:47,994 INFO L290 TraceCheckUtils]: 58: Hoare triple {8765#true} assume !(0 == ~cond); {8765#true} is VALID [2022-04-27 13:06:47,994 INFO L290 TraceCheckUtils]: 57: Hoare triple {8765#true} ~cond := #in~cond; {8765#true} is VALID [2022-04-27 13:06:47,994 INFO L272 TraceCheckUtils]: 56: Hoare triple {9189#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* (+ (* (+ (* (* 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_~y~0) (* (+ (* (* 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))) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {8765#true} is VALID [2022-04-27 13:06:47,995 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {8765#true} {9189#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* (+ (* (+ (* (* 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_~y~0) (* (+ (* (* 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))) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)))} #95#return; {9189#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* (+ (* (+ (* (* 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_~y~0) (* (+ (* (* 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))) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)))} is VALID [2022-04-27 13:06:47,995 INFO L290 TraceCheckUtils]: 54: Hoare triple {8765#true} assume true; {8765#true} is VALID [2022-04-27 13:06:47,995 INFO L290 TraceCheckUtils]: 53: Hoare triple {8765#true} assume !(0 == ~cond); {8765#true} is VALID [2022-04-27 13:06:47,995 INFO L290 TraceCheckUtils]: 52: Hoare triple {8765#true} ~cond := #in~cond; {8765#true} is VALID [2022-04-27 13:06:47,995 INFO L272 TraceCheckUtils]: 51: Hoare triple {9189#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* (+ (* (+ (* (* 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_~y~0) (* (+ (* (* 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))) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {8765#true} is VALID [2022-04-27 13:06:47,996 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {8765#true} {9189#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* (+ (* (+ (* (* 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_~y~0) (* (+ (* (* 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))) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)))} #93#return; {9189#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* (+ (* (+ (* (* 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_~y~0) (* (+ (* (* 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))) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)))} is VALID [2022-04-27 13:06:47,996 INFO L290 TraceCheckUtils]: 49: Hoare triple {8765#true} assume true; {8765#true} is VALID [2022-04-27 13:06:47,996 INFO L290 TraceCheckUtils]: 48: Hoare triple {8765#true} assume !(0 == ~cond); {8765#true} is VALID [2022-04-27 13:06:47,996 INFO L290 TraceCheckUtils]: 47: Hoare triple {8765#true} ~cond := #in~cond; {8765#true} is VALID [2022-04-27 13:06:47,996 INFO L272 TraceCheckUtils]: 46: Hoare triple {9189#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* (+ (* (+ (* (* 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_~y~0) (* (+ (* (* 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))) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {8765#true} is VALID [2022-04-27 13:06:47,997 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {8765#true} {9189#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* (+ (* (+ (* (* 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_~y~0) (* (+ (* (* 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))) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)))} #91#return; {9189#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* (+ (* (+ (* (* 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_~y~0) (* (+ (* (* 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))) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)))} is VALID [2022-04-27 13:06:47,997 INFO L290 TraceCheckUtils]: 44: Hoare triple {8765#true} assume true; {8765#true} is VALID [2022-04-27 13:06:47,997 INFO L290 TraceCheckUtils]: 43: Hoare triple {8765#true} assume !(0 == ~cond); {8765#true} is VALID [2022-04-27 13:06:47,997 INFO L290 TraceCheckUtils]: 42: Hoare triple {8765#true} ~cond := #in~cond; {8765#true} is VALID [2022-04-27 13:06:47,997 INFO L272 TraceCheckUtils]: 41: Hoare triple {9189#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* (+ (* (+ (* (* 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_~y~0) (* (+ (* (* 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))) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {8765#true} is VALID [2022-04-27 13:06:47,998 INFO L290 TraceCheckUtils]: 40: Hoare triple {9189#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* (+ (* (+ (* (* 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_~y~0) (* (+ (* (* 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))) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)))} assume !false; {9189#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* (+ (* (+ (* (* 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_~y~0) (* (+ (* (* 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))) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)))} is VALID [2022-04-27 13:06:47,999 INFO L290 TraceCheckUtils]: 39: Hoare triple {9304#(or (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0) (* main_~y~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~xy~0) (* main_~r~0 main_~yy~0) (* main_~p~0 main_~x~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 !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {9189#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* (+ (* (+ (* (* 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_~y~0) (* (+ (* (* 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))) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)))} is VALID [2022-04-27 13:06:47,999 INFO L290 TraceCheckUtils]: 38: Hoare triple {9304#(or (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0) (* main_~y~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~xy~0) (* main_~r~0 main_~yy~0) (* main_~p~0 main_~x~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; {9304#(or (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0) (* main_~y~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~xy~0) (* main_~r~0 main_~yy~0) (* main_~p~0 main_~x~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:06:48,000 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {8765#true} {9304#(or (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0) (* main_~y~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~xy~0) (* main_~r~0 main_~yy~0) (* main_~p~0 main_~x~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)))))} #89#return; {9304#(or (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0) (* main_~y~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~xy~0) (* main_~r~0 main_~yy~0) (* main_~p~0 main_~x~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:06:48,000 INFO L290 TraceCheckUtils]: 36: Hoare triple {8765#true} assume true; {8765#true} is VALID [2022-04-27 13:06:48,000 INFO L290 TraceCheckUtils]: 35: Hoare triple {8765#true} assume !(0 == ~cond); {8765#true} is VALID [2022-04-27 13:06:48,000 INFO L290 TraceCheckUtils]: 34: Hoare triple {8765#true} ~cond := #in~cond; {8765#true} is VALID [2022-04-27 13:06:48,000 INFO L272 TraceCheckUtils]: 33: Hoare triple {9304#(or (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0) (* main_~y~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~xy~0) (* main_~r~0 main_~yy~0) (* main_~p~0 main_~x~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {8765#true} is VALID [2022-04-27 13:06:48,001 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {8765#true} {9304#(or (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0) (* main_~y~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~xy~0) (* main_~r~0 main_~yy~0) (* main_~p~0 main_~x~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)))))} #87#return; {9304#(or (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0) (* main_~y~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~xy~0) (* main_~r~0 main_~yy~0) (* main_~p~0 main_~x~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:06:48,001 INFO L290 TraceCheckUtils]: 31: Hoare triple {8765#true} assume true; {8765#true} is VALID [2022-04-27 13:06:48,001 INFO L290 TraceCheckUtils]: 30: Hoare triple {8765#true} assume !(0 == ~cond); {8765#true} is VALID [2022-04-27 13:06:48,001 INFO L290 TraceCheckUtils]: 29: Hoare triple {8765#true} ~cond := #in~cond; {8765#true} is VALID [2022-04-27 13:06:48,001 INFO L272 TraceCheckUtils]: 28: Hoare triple {9304#(or (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0) (* main_~y~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~xy~0) (* main_~r~0 main_~yy~0) (* main_~p~0 main_~x~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {8765#true} is VALID [2022-04-27 13:06:48,002 INFO L290 TraceCheckUtils]: 27: Hoare triple {8765#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {9304#(or (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0) (* main_~y~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~xy~0) (* main_~r~0 main_~yy~0) (* main_~p~0 main_~x~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:06:48,002 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {8765#true} {8765#true} #85#return; {8765#true} is VALID [2022-04-27 13:06:48,002 INFO L290 TraceCheckUtils]: 25: Hoare triple {8765#true} assume true; {8765#true} is VALID [2022-04-27 13:06:48,002 INFO L290 TraceCheckUtils]: 24: Hoare triple {8765#true} assume !(0 == ~cond); {8765#true} is VALID [2022-04-27 13:06:48,002 INFO L290 TraceCheckUtils]: 23: Hoare triple {8765#true} ~cond := #in~cond; {8765#true} is VALID [2022-04-27 13:06:48,002 INFO L272 TraceCheckUtils]: 22: Hoare triple {8765#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {8765#true} is VALID [2022-04-27 13:06:48,002 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {8765#true} {8765#true} #83#return; {8765#true} is VALID [2022-04-27 13:06:48,002 INFO L290 TraceCheckUtils]: 20: Hoare triple {8765#true} assume true; {8765#true} is VALID [2022-04-27 13:06:48,002 INFO L290 TraceCheckUtils]: 19: Hoare triple {8765#true} assume !(0 == ~cond); {8765#true} is VALID [2022-04-27 13:06:48,002 INFO L290 TraceCheckUtils]: 18: Hoare triple {8765#true} ~cond := #in~cond; {8765#true} is VALID [2022-04-27 13:06:48,002 INFO L272 TraceCheckUtils]: 17: Hoare triple {8765#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {8765#true} is VALID [2022-04-27 13:06:48,002 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {8765#true} {8765#true} #81#return; {8765#true} is VALID [2022-04-27 13:06:48,002 INFO L290 TraceCheckUtils]: 15: Hoare triple {8765#true} assume true; {8765#true} is VALID [2022-04-27 13:06:48,002 INFO L290 TraceCheckUtils]: 14: Hoare triple {8765#true} assume !(0 == ~cond); {8765#true} is VALID [2022-04-27 13:06:48,002 INFO L290 TraceCheckUtils]: 13: Hoare triple {8765#true} ~cond := #in~cond; {8765#true} is VALID [2022-04-27 13:06:48,002 INFO L272 TraceCheckUtils]: 12: Hoare triple {8765#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 20 then 1 else 0)); {8765#true} is VALID [2022-04-27 13:06:48,002 INFO L290 TraceCheckUtils]: 11: Hoare triple {8765#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {8765#true} is VALID [2022-04-27 13:06:48,002 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8765#true} {8765#true} #79#return; {8765#true} is VALID [2022-04-27 13:06:48,002 INFO L290 TraceCheckUtils]: 9: Hoare triple {8765#true} assume true; {8765#true} is VALID [2022-04-27 13:06:48,002 INFO L290 TraceCheckUtils]: 8: Hoare triple {8765#true} assume !(0 == ~cond); {8765#true} is VALID [2022-04-27 13:06:48,002 INFO L290 TraceCheckUtils]: 7: Hoare triple {8765#true} ~cond := #in~cond; {8765#true} is VALID [2022-04-27 13:06:48,003 INFO L272 TraceCheckUtils]: 6: Hoare triple {8765#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 20 then 1 else 0)); {8765#true} is VALID [2022-04-27 13:06:48,003 INFO L290 TraceCheckUtils]: 5: Hoare triple {8765#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {8765#true} is VALID [2022-04-27 13:06:48,003 INFO L272 TraceCheckUtils]: 4: Hoare triple {8765#true} call #t~ret6 := main(); {8765#true} is VALID [2022-04-27 13:06:48,003 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8765#true} {8765#true} #103#return; {8765#true} is VALID [2022-04-27 13:06:48,003 INFO L290 TraceCheckUtils]: 2: Hoare triple {8765#true} assume true; {8765#true} is VALID [2022-04-27 13:06:48,003 INFO L290 TraceCheckUtils]: 1: Hoare triple {8765#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); {8765#true} is VALID [2022-04-27 13:06:48,003 INFO L272 TraceCheckUtils]: 0: Hoare triple {8765#true} call ULTIMATE.init(); {8765#true} is VALID [2022-04-27 13:06:48,003 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 81 proven. 27 refuted. 0 times theorem prover too weak. 212 trivial. 0 not checked. [2022-04-27 13:06:48,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:06:48,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339462980] [2022-04-27 13:06:48,004 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:06:48,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1121299342] [2022-04-27 13:06:48,004 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1121299342] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 13:06:48,004 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 13:06:48,004 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 18 [2022-04-27 13:06:48,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004939029] [2022-04-27 13:06:48,004 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 13:06:48,005 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 2.4375) internal successors, (39), 15 states have internal predecessors, (39), 10 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (29), 12 states have call predecessors, (29), 9 states have call successors, (29) Word has length 107 [2022-04-27 13:06:48,007 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:06:48,007 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 16 states have (on average 2.4375) internal successors, (39), 15 states have internal predecessors, (39), 10 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (29), 12 states have call predecessors, (29), 9 states have call successors, (29) [2022-04-27 13:06:52,113 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 97 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-27 13:06:52,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-27 13:06:52,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:06:52,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-27 13:06:52,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2022-04-27 13:06:52,114 INFO L87 Difference]: Start difference. First operand 216 states and 297 transitions. Second operand has 18 states, 16 states have (on average 2.4375) internal successors, (39), 15 states have internal predecessors, (39), 10 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (29), 12 states have call predecessors, (29), 9 states have call successors, (29) [2022-04-27 13:07:00,925 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:07:02,965 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:07:11,345 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:07:11,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:07:11,444 INFO L93 Difference]: Finished difference Result 231 states and 312 transitions. [2022-04-27 13:07:11,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-27 13:07:11,444 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 2.4375) internal successors, (39), 15 states have internal predecessors, (39), 10 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (29), 12 states have call predecessors, (29), 9 states have call successors, (29) Word has length 107 [2022-04-27 13:07:11,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:07:11,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 16 states have (on average 2.4375) internal successors, (39), 15 states have internal predecessors, (39), 10 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (29), 12 states have call predecessors, (29), 9 states have call successors, (29) [2022-04-27 13:07:11,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 114 transitions. [2022-04-27 13:07:11,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 16 states have (on average 2.4375) internal successors, (39), 15 states have internal predecessors, (39), 10 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (29), 12 states have call predecessors, (29), 9 states have call successors, (29) [2022-04-27 13:07:11,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 114 transitions. [2022-04-27 13:07:11,447 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 114 transitions. [2022-04-27 13:07:15,626 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 112 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-27 13:07:15,630 INFO L225 Difference]: With dead ends: 231 [2022-04-27 13:07:15,630 INFO L226 Difference]: Without dead ends: 227 [2022-04-27 13:07:15,631 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 193 SyntacticMatches, 4 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=177, Invalid=525, Unknown=0, NotChecked=0, Total=702 [2022-04-27 13:07:15,631 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 70 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 378 mSolverCounterSat, 125 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 506 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 378 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.7s IncrementalHoareTripleChecker+Time [2022-04-27 13:07:15,631 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 190 Invalid, 506 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 378 Invalid, 3 Unknown, 0 Unchecked, 10.7s Time] [2022-04-27 13:07:15,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2022-04-27 13:07:15,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 218. [2022-04-27 13:07:15,916 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:07:15,916 INFO L82 GeneralOperation]: Start isEquivalent. First operand 227 states. Second operand has 218 states, 118 states have (on average 1.1694915254237288) internal successors, (138), 118 states have internal predecessors, (138), 81 states have call successors, (81), 20 states have call predecessors, (81), 18 states have return successors, (79), 79 states have call predecessors, (79), 79 states have call successors, (79) [2022-04-27 13:07:15,916 INFO L74 IsIncluded]: Start isIncluded. First operand 227 states. Second operand has 218 states, 118 states have (on average 1.1694915254237288) internal successors, (138), 118 states have internal predecessors, (138), 81 states have call successors, (81), 20 states have call predecessors, (81), 18 states have return successors, (79), 79 states have call predecessors, (79), 79 states have call successors, (79) [2022-04-27 13:07:15,917 INFO L87 Difference]: Start difference. First operand 227 states. Second operand has 218 states, 118 states have (on average 1.1694915254237288) internal successors, (138), 118 states have internal predecessors, (138), 81 states have call successors, (81), 20 states have call predecessors, (81), 18 states have return successors, (79), 79 states have call predecessors, (79), 79 states have call successors, (79) [2022-04-27 13:07:15,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:07:15,921 INFO L93 Difference]: Finished difference Result 227 states and 308 transitions. [2022-04-27 13:07:15,921 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 308 transitions. [2022-04-27 13:07:15,922 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:07:15,922 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:07:15,922 INFO L74 IsIncluded]: Start isIncluded. First operand has 218 states, 118 states have (on average 1.1694915254237288) internal successors, (138), 118 states have internal predecessors, (138), 81 states have call successors, (81), 20 states have call predecessors, (81), 18 states have return successors, (79), 79 states have call predecessors, (79), 79 states have call successors, (79) Second operand 227 states. [2022-04-27 13:07:15,923 INFO L87 Difference]: Start difference. First operand has 218 states, 118 states have (on average 1.1694915254237288) internal successors, (138), 118 states have internal predecessors, (138), 81 states have call successors, (81), 20 states have call predecessors, (81), 18 states have return successors, (79), 79 states have call predecessors, (79), 79 states have call successors, (79) Second operand 227 states. [2022-04-27 13:07:15,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:07:15,928 INFO L93 Difference]: Finished difference Result 227 states and 308 transitions. [2022-04-27 13:07:15,928 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 308 transitions. [2022-04-27 13:07:15,932 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:07:15,932 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:07:15,933 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:07:15,933 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:07:15,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 118 states have (on average 1.1694915254237288) internal successors, (138), 118 states have internal predecessors, (138), 81 states have call successors, (81), 20 states have call predecessors, (81), 18 states have return successors, (79), 79 states have call predecessors, (79), 79 states have call successors, (79) [2022-04-27 13:07:15,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 298 transitions. [2022-04-27 13:07:15,938 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 298 transitions. Word has length 107 [2022-04-27 13:07:15,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:07:15,938 INFO L495 AbstractCegarLoop]: Abstraction has 218 states and 298 transitions. [2022-04-27 13:07:15,938 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 2.4375) internal successors, (39), 15 states have internal predecessors, (39), 10 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (29), 12 states have call predecessors, (29), 9 states have call successors, (29) [2022-04-27 13:07:15,938 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 298 transitions. [2022-04-27 13:07:15,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-04-27 13:07:15,951 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:07:15,951 INFO L195 NwaCegarLoop]: trace histogram [13, 12, 12, 6, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:07:15,970 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:07:16,155 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:07:16,155 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:07:16,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:07:16,156 INFO L85 PathProgramCache]: Analyzing trace with hash -1268192944, now seen corresponding path program 2 times [2022-04-27 13:07:16,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:07:16,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232921597] [2022-04-27 13:07:16,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:07:16,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:07:16,167 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:07:16,167 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1447311541] [2022-04-27 13:07:16,167 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 13:07:16,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:07:16,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:07:16,168 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:07:16,169 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:07:16,218 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 13:07:16,219 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 13:07:16,220 INFO L263 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-27 13:07:16,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:07:16,235 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:07:16,446 INFO L272 TraceCheckUtils]: 0: Hoare triple {10602#true} call ULTIMATE.init(); {10602#true} is VALID [2022-04-27 13:07:16,447 INFO L290 TraceCheckUtils]: 1: Hoare triple {10602#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); {10602#true} is VALID [2022-04-27 13:07:16,447 INFO L290 TraceCheckUtils]: 2: Hoare triple {10602#true} assume true; {10602#true} is VALID [2022-04-27 13:07:16,447 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10602#true} {10602#true} #103#return; {10602#true} is VALID [2022-04-27 13:07:16,447 INFO L272 TraceCheckUtils]: 4: Hoare triple {10602#true} call #t~ret6 := main(); {10602#true} is VALID [2022-04-27 13:07:16,447 INFO L290 TraceCheckUtils]: 5: Hoare triple {10602#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {10602#true} is VALID [2022-04-27 13:07:16,447 INFO L272 TraceCheckUtils]: 6: Hoare triple {10602#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 20 then 1 else 0)); {10602#true} is VALID [2022-04-27 13:07:16,447 INFO L290 TraceCheckUtils]: 7: Hoare triple {10602#true} ~cond := #in~cond; {10602#true} is VALID [2022-04-27 13:07:16,447 INFO L290 TraceCheckUtils]: 8: Hoare triple {10602#true} assume !(0 == ~cond); {10602#true} is VALID [2022-04-27 13:07:16,447 INFO L290 TraceCheckUtils]: 9: Hoare triple {10602#true} assume true; {10602#true} is VALID [2022-04-27 13:07:16,447 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {10602#true} {10602#true} #79#return; {10602#true} is VALID [2022-04-27 13:07:16,447 INFO L290 TraceCheckUtils]: 11: Hoare triple {10602#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {10602#true} is VALID [2022-04-27 13:07:16,447 INFO L272 TraceCheckUtils]: 12: Hoare triple {10602#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 20 then 1 else 0)); {10602#true} is VALID [2022-04-27 13:07:16,447 INFO L290 TraceCheckUtils]: 13: Hoare triple {10602#true} ~cond := #in~cond; {10602#true} is VALID [2022-04-27 13:07:16,447 INFO L290 TraceCheckUtils]: 14: Hoare triple {10602#true} assume !(0 == ~cond); {10602#true} is VALID [2022-04-27 13:07:16,447 INFO L290 TraceCheckUtils]: 15: Hoare triple {10602#true} assume true; {10602#true} is VALID [2022-04-27 13:07:16,447 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {10602#true} {10602#true} #81#return; {10602#true} is VALID [2022-04-27 13:07:16,447 INFO L272 TraceCheckUtils]: 17: Hoare triple {10602#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {10602#true} is VALID [2022-04-27 13:07:16,447 INFO L290 TraceCheckUtils]: 18: Hoare triple {10602#true} ~cond := #in~cond; {10602#true} is VALID [2022-04-27 13:07:16,447 INFO L290 TraceCheckUtils]: 19: Hoare triple {10602#true} assume !(0 == ~cond); {10602#true} is VALID [2022-04-27 13:07:16,448 INFO L290 TraceCheckUtils]: 20: Hoare triple {10602#true} assume true; {10602#true} is VALID [2022-04-27 13:07:16,448 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {10602#true} {10602#true} #83#return; {10602#true} is VALID [2022-04-27 13:07:16,448 INFO L272 TraceCheckUtils]: 22: Hoare triple {10602#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {10602#true} is VALID [2022-04-27 13:07:16,448 INFO L290 TraceCheckUtils]: 23: Hoare triple {10602#true} ~cond := #in~cond; {10602#true} is VALID [2022-04-27 13:07:16,448 INFO L290 TraceCheckUtils]: 24: Hoare triple {10602#true} assume !(0 == ~cond); {10602#true} is VALID [2022-04-27 13:07:16,448 INFO L290 TraceCheckUtils]: 25: Hoare triple {10602#true} assume true; {10602#true} is VALID [2022-04-27 13:07:16,448 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {10602#true} {10602#true} #85#return; {10602#true} is VALID [2022-04-27 13:07:16,448 INFO L290 TraceCheckUtils]: 27: Hoare triple {10602#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {10602#true} is VALID [2022-04-27 13:07:16,448 INFO L272 TraceCheckUtils]: 28: Hoare triple {10602#true} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {10602#true} is VALID [2022-04-27 13:07:16,448 INFO L290 TraceCheckUtils]: 29: Hoare triple {10602#true} ~cond := #in~cond; {10602#true} is VALID [2022-04-27 13:07:16,448 INFO L290 TraceCheckUtils]: 30: Hoare triple {10602#true} assume !(0 == ~cond); {10602#true} is VALID [2022-04-27 13:07:16,448 INFO L290 TraceCheckUtils]: 31: Hoare triple {10602#true} assume true; {10602#true} is VALID [2022-04-27 13:07:16,448 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {10602#true} {10602#true} #87#return; {10602#true} is VALID [2022-04-27 13:07:16,448 INFO L272 TraceCheckUtils]: 33: Hoare triple {10602#true} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {10602#true} is VALID [2022-04-27 13:07:16,448 INFO L290 TraceCheckUtils]: 34: Hoare triple {10602#true} ~cond := #in~cond; {10602#true} is VALID [2022-04-27 13:07:16,448 INFO L290 TraceCheckUtils]: 35: Hoare triple {10602#true} assume !(0 == ~cond); {10602#true} is VALID [2022-04-27 13:07:16,448 INFO L290 TraceCheckUtils]: 36: Hoare triple {10602#true} assume true; {10602#true} is VALID [2022-04-27 13:07:16,448 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {10602#true} {10602#true} #89#return; {10602#true} is VALID [2022-04-27 13:07:16,448 INFO L290 TraceCheckUtils]: 38: Hoare triple {10602#true} assume !false; {10602#true} is VALID [2022-04-27 13:07:16,448 INFO L290 TraceCheckUtils]: 39: Hoare triple {10602#true} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {10602#true} is VALID [2022-04-27 13:07:16,448 INFO L290 TraceCheckUtils]: 40: Hoare triple {10602#true} assume !false; {10602#true} is VALID [2022-04-27 13:07:16,448 INFO L272 TraceCheckUtils]: 41: Hoare triple {10602#true} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {10602#true} is VALID [2022-04-27 13:07:16,449 INFO L290 TraceCheckUtils]: 42: Hoare triple {10602#true} ~cond := #in~cond; {10602#true} is VALID [2022-04-27 13:07:16,449 INFO L290 TraceCheckUtils]: 43: Hoare triple {10602#true} assume !(0 == ~cond); {10602#true} is VALID [2022-04-27 13:07:16,449 INFO L290 TraceCheckUtils]: 44: Hoare triple {10602#true} assume true; {10602#true} is VALID [2022-04-27 13:07:16,449 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {10602#true} {10602#true} #91#return; {10602#true} is VALID [2022-04-27 13:07:16,449 INFO L272 TraceCheckUtils]: 46: Hoare triple {10602#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {10602#true} is VALID [2022-04-27 13:07:16,449 INFO L290 TraceCheckUtils]: 47: Hoare triple {10602#true} ~cond := #in~cond; {10602#true} is VALID [2022-04-27 13:07:16,449 INFO L290 TraceCheckUtils]: 48: Hoare triple {10602#true} assume !(0 == ~cond); {10602#true} is VALID [2022-04-27 13:07:16,449 INFO L290 TraceCheckUtils]: 49: Hoare triple {10602#true} assume true; {10602#true} is VALID [2022-04-27 13:07:16,449 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {10602#true} {10602#true} #93#return; {10602#true} is VALID [2022-04-27 13:07:16,449 INFO L272 TraceCheckUtils]: 51: Hoare triple {10602#true} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {10602#true} is VALID [2022-04-27 13:07:16,449 INFO L290 TraceCheckUtils]: 52: Hoare triple {10602#true} ~cond := #in~cond; {10602#true} is VALID [2022-04-27 13:07:16,449 INFO L290 TraceCheckUtils]: 53: Hoare triple {10602#true} assume !(0 == ~cond); {10602#true} is VALID [2022-04-27 13:07:16,449 INFO L290 TraceCheckUtils]: 54: Hoare triple {10602#true} assume true; {10602#true} is VALID [2022-04-27 13:07:16,449 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {10602#true} {10602#true} #95#return; {10602#true} is VALID [2022-04-27 13:07:16,449 INFO L272 TraceCheckUtils]: 56: Hoare triple {10602#true} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {10602#true} is VALID [2022-04-27 13:07:16,449 INFO L290 TraceCheckUtils]: 57: Hoare triple {10602#true} ~cond := #in~cond; {10602#true} is VALID [2022-04-27 13:07:16,449 INFO L290 TraceCheckUtils]: 58: Hoare triple {10602#true} assume !(0 == ~cond); {10602#true} is VALID [2022-04-27 13:07:16,449 INFO L290 TraceCheckUtils]: 59: Hoare triple {10602#true} assume true; {10602#true} is VALID [2022-04-27 13:07:16,449 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {10602#true} {10602#true} #97#return; {10602#true} is VALID [2022-04-27 13:07:16,449 INFO L290 TraceCheckUtils]: 61: Hoare triple {10602#true} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {10602#true} is VALID [2022-04-27 13:07:16,449 INFO L290 TraceCheckUtils]: 62: Hoare triple {10602#true} assume !false; {10602#true} is VALID [2022-04-27 13:07:16,449 INFO L272 TraceCheckUtils]: 63: Hoare triple {10602#true} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {10602#true} is VALID [2022-04-27 13:07:16,450 INFO L290 TraceCheckUtils]: 64: Hoare triple {10602#true} ~cond := #in~cond; {10602#true} is VALID [2022-04-27 13:07:16,450 INFO L290 TraceCheckUtils]: 65: Hoare triple {10602#true} assume !(0 == ~cond); {10602#true} is VALID [2022-04-27 13:07:16,450 INFO L290 TraceCheckUtils]: 66: Hoare triple {10602#true} assume true; {10602#true} is VALID [2022-04-27 13:07:16,450 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {10602#true} {10602#true} #91#return; {10602#true} is VALID [2022-04-27 13:07:16,450 INFO L272 TraceCheckUtils]: 68: Hoare triple {10602#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {10602#true} is VALID [2022-04-27 13:07:16,450 INFO L290 TraceCheckUtils]: 69: Hoare triple {10602#true} ~cond := #in~cond; {10602#true} is VALID [2022-04-27 13:07:16,450 INFO L290 TraceCheckUtils]: 70: Hoare triple {10602#true} assume !(0 == ~cond); {10602#true} is VALID [2022-04-27 13:07:16,450 INFO L290 TraceCheckUtils]: 71: Hoare triple {10602#true} assume true; {10602#true} is VALID [2022-04-27 13:07:16,450 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {10602#true} {10602#true} #93#return; {10602#true} is VALID [2022-04-27 13:07:16,450 INFO L272 TraceCheckUtils]: 73: Hoare triple {10602#true} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {10602#true} is VALID [2022-04-27 13:07:16,450 INFO L290 TraceCheckUtils]: 74: Hoare triple {10602#true} ~cond := #in~cond; {10602#true} is VALID [2022-04-27 13:07:16,450 INFO L290 TraceCheckUtils]: 75: Hoare triple {10602#true} assume !(0 == ~cond); {10602#true} is VALID [2022-04-27 13:07:16,450 INFO L290 TraceCheckUtils]: 76: Hoare triple {10602#true} assume true; {10602#true} is VALID [2022-04-27 13:07:16,450 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {10602#true} {10602#true} #95#return; {10602#true} is VALID [2022-04-27 13:07:16,450 INFO L272 TraceCheckUtils]: 78: Hoare triple {10602#true} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {10602#true} is VALID [2022-04-27 13:07:16,450 INFO L290 TraceCheckUtils]: 79: Hoare triple {10602#true} ~cond := #in~cond; {10602#true} is VALID [2022-04-27 13:07:16,450 INFO L290 TraceCheckUtils]: 80: Hoare triple {10602#true} assume !(0 == ~cond); {10602#true} is VALID [2022-04-27 13:07:16,450 INFO L290 TraceCheckUtils]: 81: Hoare triple {10602#true} assume true; {10602#true} is VALID [2022-04-27 13:07:16,450 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {10602#true} {10602#true} #97#return; {10602#true} is VALID [2022-04-27 13:07:16,452 INFO L290 TraceCheckUtils]: 83: Hoare triple {10602#true} assume !(~c~0 >= ~b~0); {10856#(not (<= main_~b~0 main_~c~0))} is VALID [2022-04-27 13:07:16,453 INFO L290 TraceCheckUtils]: 84: Hoare triple {10856#(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; {10860#(< main_~b~0 main_~a~0)} is VALID [2022-04-27 13:07:16,454 INFO L290 TraceCheckUtils]: 85: Hoare triple {10860#(< main_~b~0 main_~a~0)} assume !false; {10860#(< main_~b~0 main_~a~0)} is VALID [2022-04-27 13:07:16,455 INFO L290 TraceCheckUtils]: 86: Hoare triple {10860#(< main_~b~0 main_~a~0)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {10867#(< main_~b~0 main_~c~0)} is VALID [2022-04-27 13:07:16,455 INFO L290 TraceCheckUtils]: 87: Hoare triple {10867#(< main_~b~0 main_~c~0)} assume !false; {10867#(< main_~b~0 main_~c~0)} is VALID [2022-04-27 13:07:16,455 INFO L272 TraceCheckUtils]: 88: Hoare triple {10867#(< main_~b~0 main_~c~0)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {10602#true} is VALID [2022-04-27 13:07:16,455 INFO L290 TraceCheckUtils]: 89: Hoare triple {10602#true} ~cond := #in~cond; {10602#true} is VALID [2022-04-27 13:07:16,455 INFO L290 TraceCheckUtils]: 90: Hoare triple {10602#true} assume !(0 == ~cond); {10602#true} is VALID [2022-04-27 13:07:16,455 INFO L290 TraceCheckUtils]: 91: Hoare triple {10602#true} assume true; {10602#true} is VALID [2022-04-27 13:07:16,456 INFO L284 TraceCheckUtils]: 92: Hoare quadruple {10602#true} {10867#(< main_~b~0 main_~c~0)} #91#return; {10867#(< main_~b~0 main_~c~0)} is VALID [2022-04-27 13:07:16,456 INFO L272 TraceCheckUtils]: 93: Hoare triple {10867#(< main_~b~0 main_~c~0)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {10602#true} is VALID [2022-04-27 13:07:16,456 INFO L290 TraceCheckUtils]: 94: Hoare triple {10602#true} ~cond := #in~cond; {10602#true} is VALID [2022-04-27 13:07:16,456 INFO L290 TraceCheckUtils]: 95: Hoare triple {10602#true} assume !(0 == ~cond); {10602#true} is VALID [2022-04-27 13:07:16,456 INFO L290 TraceCheckUtils]: 96: Hoare triple {10602#true} assume true; {10602#true} is VALID [2022-04-27 13:07:16,456 INFO L284 TraceCheckUtils]: 97: Hoare quadruple {10602#true} {10867#(< main_~b~0 main_~c~0)} #93#return; {10867#(< main_~b~0 main_~c~0)} is VALID [2022-04-27 13:07:16,456 INFO L272 TraceCheckUtils]: 98: Hoare triple {10867#(< main_~b~0 main_~c~0)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {10602#true} is VALID [2022-04-27 13:07:16,456 INFO L290 TraceCheckUtils]: 99: Hoare triple {10602#true} ~cond := #in~cond; {10602#true} is VALID [2022-04-27 13:07:16,457 INFO L290 TraceCheckUtils]: 100: Hoare triple {10602#true} assume !(0 == ~cond); {10602#true} is VALID [2022-04-27 13:07:16,457 INFO L290 TraceCheckUtils]: 101: Hoare triple {10602#true} assume true; {10602#true} is VALID [2022-04-27 13:07:16,457 INFO L284 TraceCheckUtils]: 102: Hoare quadruple {10602#true} {10867#(< main_~b~0 main_~c~0)} #95#return; {10867#(< main_~b~0 main_~c~0)} is VALID [2022-04-27 13:07:16,457 INFO L272 TraceCheckUtils]: 103: Hoare triple {10867#(< main_~b~0 main_~c~0)} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {10602#true} is VALID [2022-04-27 13:07:16,457 INFO L290 TraceCheckUtils]: 104: Hoare triple {10602#true} ~cond := #in~cond; {10602#true} is VALID [2022-04-27 13:07:16,457 INFO L290 TraceCheckUtils]: 105: Hoare triple {10602#true} assume !(0 == ~cond); {10602#true} is VALID [2022-04-27 13:07:16,457 INFO L290 TraceCheckUtils]: 106: Hoare triple {10602#true} assume true; {10602#true} is VALID [2022-04-27 13:07:16,458 INFO L284 TraceCheckUtils]: 107: Hoare quadruple {10602#true} {10867#(< main_~b~0 main_~c~0)} #97#return; {10867#(< main_~b~0 main_~c~0)} is VALID [2022-04-27 13:07:16,458 INFO L290 TraceCheckUtils]: 108: Hoare triple {10867#(< main_~b~0 main_~c~0)} assume !(~c~0 >= ~b~0); {10603#false} is VALID [2022-04-27 13:07:16,458 INFO L290 TraceCheckUtils]: 109: Hoare triple {10603#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; {10603#false} is VALID [2022-04-27 13:07:16,458 INFO L290 TraceCheckUtils]: 110: Hoare triple {10603#false} assume !false; {10603#false} is VALID [2022-04-27 13:07:16,458 INFO L290 TraceCheckUtils]: 111: Hoare triple {10603#false} assume !(0 != ~b~0); {10603#false} is VALID [2022-04-27 13:07:16,458 INFO L272 TraceCheckUtils]: 112: Hoare triple {10603#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {10603#false} is VALID [2022-04-27 13:07:16,458 INFO L290 TraceCheckUtils]: 113: Hoare triple {10603#false} ~cond := #in~cond; {10603#false} is VALID [2022-04-27 13:07:16,459 INFO L290 TraceCheckUtils]: 114: Hoare triple {10603#false} assume 0 == ~cond; {10603#false} is VALID [2022-04-27 13:07:16,459 INFO L290 TraceCheckUtils]: 115: Hoare triple {10603#false} assume !false; {10603#false} is VALID [2022-04-27 13:07:16,459 INFO L134 CoverageAnalysis]: Checked inductivity of 373 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2022-04-27 13:07:16,459 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 13:07:16,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:07:16,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232921597] [2022-04-27 13:07:16,459 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:07:16,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1447311541] [2022-04-27 13:07:16,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1447311541] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:07:16,459 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:07:16,459 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 13:07:16,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180589698] [2022-04-27 13:07:16,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:07:16,460 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 3 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 116 [2022-04-27 13:07:16,460 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:07:16,460 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 3 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-04-27 13:07:16,498 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:07:16,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 13:07:16,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:07:16,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 13:07:16,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 13:07:16,499 INFO L87 Difference]: Start difference. First operand 218 states and 298 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 3 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-04-27 13:07:16,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:07:16,973 INFO L93 Difference]: Finished difference Result 281 states and 377 transitions. [2022-04-27 13:07:16,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 13:07:16,973 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 3 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 116 [2022-04-27 13:07:16,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:07:16,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 3 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-04-27 13:07:16,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 90 transitions. [2022-04-27 13:07:16,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 3 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-04-27 13:07:16,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 90 transitions. [2022-04-27 13:07:16,975 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 90 transitions. [2022-04-27 13:07:17,038 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:07:17,042 INFO L225 Difference]: With dead ends: 281 [2022-04-27 13:07:17,042 INFO L226 Difference]: Without dead ends: 199 [2022-04-27 13:07:17,042 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 112 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:17,043 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 6 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 13:07:17,043 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 161 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 13:07:17,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2022-04-27 13:07:17,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 123. [2022-04-27 13:07:17,176 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:07:17,176 INFO L82 GeneralOperation]: Start isEquivalent. First operand 199 states. Second operand has 123 states, 68 states have (on average 1.1176470588235294) internal successors, (76), 68 states have internal predecessors, (76), 41 states have call successors, (41), 15 states have call predecessors, (41), 13 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2022-04-27 13:07:17,176 INFO L74 IsIncluded]: Start isIncluded. First operand 199 states. Second operand has 123 states, 68 states have (on average 1.1176470588235294) internal successors, (76), 68 states have internal predecessors, (76), 41 states have call successors, (41), 15 states have call predecessors, (41), 13 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2022-04-27 13:07:17,177 INFO L87 Difference]: Start difference. First operand 199 states. Second operand has 123 states, 68 states have (on average 1.1176470588235294) internal successors, (76), 68 states have internal predecessors, (76), 41 states have call successors, (41), 15 states have call predecessors, (41), 13 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2022-04-27 13:07:17,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:07:17,180 INFO L93 Difference]: Finished difference Result 199 states and 260 transitions. [2022-04-27 13:07:17,180 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 260 transitions. [2022-04-27 13:07:17,181 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:07:17,181 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:07:17,181 INFO L74 IsIncluded]: Start isIncluded. First operand has 123 states, 68 states have (on average 1.1176470588235294) internal successors, (76), 68 states have internal predecessors, (76), 41 states have call successors, (41), 15 states have call predecessors, (41), 13 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) Second operand 199 states. [2022-04-27 13:07:17,181 INFO L87 Difference]: Start difference. First operand has 123 states, 68 states have (on average 1.1176470588235294) internal successors, (76), 68 states have internal predecessors, (76), 41 states have call successors, (41), 15 states have call predecessors, (41), 13 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) Second operand 199 states. [2022-04-27 13:07:17,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:07:17,185 INFO L93 Difference]: Finished difference Result 199 states and 260 transitions. [2022-04-27 13:07:17,185 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 260 transitions. [2022-04-27 13:07:17,186 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:07:17,186 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:07:17,186 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:07:17,186 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:07:17,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 68 states have (on average 1.1176470588235294) internal successors, (76), 68 states have internal predecessors, (76), 41 states have call successors, (41), 15 states have call predecessors, (41), 13 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2022-04-27 13:07:17,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 156 transitions. [2022-04-27 13:07:17,188 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 156 transitions. Word has length 116 [2022-04-27 13:07:17,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:07:17,188 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 156 transitions. [2022-04-27 13:07:17,189 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 3 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-04-27 13:07:17,189 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 156 transitions. [2022-04-27 13:07:17,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-04-27 13:07:17,189 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:07:17,189 INFO L195 NwaCegarLoop]: trace histogram [17, 16, 16, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:07:17,207 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:07:17,403 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:07:17,403 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:07:17,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:07:17,404 INFO L85 PathProgramCache]: Analyzing trace with hash -896647763, now seen corresponding path program 3 times [2022-04-27 13:07:17,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:07:17,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44088253] [2022-04-27 13:07:17,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:07:17,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:07:17,420 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:07:17,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1919601863] [2022-04-27 13:07:17,420 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 13:07:17,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:07:17,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:07:17,421 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:07:17,422 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:07:17,490 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-04-27 13:07:17,490 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 13:07:17,492 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 60 conjunts are in the unsatisfiable core [2022-04-27 13:07:17,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:07:17,509 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:07:18,833 INFO L272 TraceCheckUtils]: 0: Hoare triple {11985#true} call ULTIMATE.init(); {11985#true} is VALID [2022-04-27 13:07:18,833 INFO L290 TraceCheckUtils]: 1: Hoare triple {11985#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); {11985#true} is VALID [2022-04-27 13:07:18,834 INFO L290 TraceCheckUtils]: 2: Hoare triple {11985#true} assume true; {11985#true} is VALID [2022-04-27 13:07:18,834 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11985#true} {11985#true} #103#return; {11985#true} is VALID [2022-04-27 13:07:18,834 INFO L272 TraceCheckUtils]: 4: Hoare triple {11985#true} call #t~ret6 := main(); {11985#true} is VALID [2022-04-27 13:07:18,834 INFO L290 TraceCheckUtils]: 5: Hoare triple {11985#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {11985#true} is VALID [2022-04-27 13:07:18,834 INFO L272 TraceCheckUtils]: 6: Hoare triple {11985#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 20 then 1 else 0)); {11985#true} is VALID [2022-04-27 13:07:18,834 INFO L290 TraceCheckUtils]: 7: Hoare triple {11985#true} ~cond := #in~cond; {11985#true} is VALID [2022-04-27 13:07:18,834 INFO L290 TraceCheckUtils]: 8: Hoare triple {11985#true} assume !(0 == ~cond); {11985#true} is VALID [2022-04-27 13:07:18,834 INFO L290 TraceCheckUtils]: 9: Hoare triple {11985#true} assume true; {11985#true} is VALID [2022-04-27 13:07:18,834 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {11985#true} {11985#true} #79#return; {11985#true} is VALID [2022-04-27 13:07:18,834 INFO L290 TraceCheckUtils]: 11: Hoare triple {11985#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {11985#true} is VALID [2022-04-27 13:07:18,834 INFO L272 TraceCheckUtils]: 12: Hoare triple {11985#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 20 then 1 else 0)); {11985#true} is VALID [2022-04-27 13:07:18,834 INFO L290 TraceCheckUtils]: 13: Hoare triple {11985#true} ~cond := #in~cond; {11985#true} is VALID [2022-04-27 13:07:18,834 INFO L290 TraceCheckUtils]: 14: Hoare triple {11985#true} assume !(0 == ~cond); {11985#true} is VALID [2022-04-27 13:07:18,834 INFO L290 TraceCheckUtils]: 15: Hoare triple {11985#true} assume true; {11985#true} is VALID [2022-04-27 13:07:18,834 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {11985#true} {11985#true} #81#return; {11985#true} is VALID [2022-04-27 13:07:18,834 INFO L272 TraceCheckUtils]: 17: Hoare triple {11985#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {11985#true} is VALID [2022-04-27 13:07:18,834 INFO L290 TraceCheckUtils]: 18: Hoare triple {11985#true} ~cond := #in~cond; {11985#true} is VALID [2022-04-27 13:07:18,834 INFO L290 TraceCheckUtils]: 19: Hoare triple {11985#true} assume !(0 == ~cond); {11985#true} is VALID [2022-04-27 13:07:18,834 INFO L290 TraceCheckUtils]: 20: Hoare triple {11985#true} assume true; {11985#true} is VALID [2022-04-27 13:07:18,834 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {11985#true} {11985#true} #83#return; {11985#true} is VALID [2022-04-27 13:07:18,834 INFO L272 TraceCheckUtils]: 22: Hoare triple {11985#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {11985#true} is VALID [2022-04-27 13:07:18,834 INFO L290 TraceCheckUtils]: 23: Hoare triple {11985#true} ~cond := #in~cond; {11985#true} is VALID [2022-04-27 13:07:18,835 INFO L290 TraceCheckUtils]: 24: Hoare triple {11985#true} assume !(0 == ~cond); {11985#true} is VALID [2022-04-27 13:07:18,835 INFO L290 TraceCheckUtils]: 25: Hoare triple {11985#true} assume true; {11985#true} is VALID [2022-04-27 13:07:18,835 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {11985#true} {11985#true} #85#return; {11985#true} is VALID [2022-04-27 13:07:18,842 INFO L290 TraceCheckUtils]: 27: Hoare triple {11985#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {12071#(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:18,842 INFO L272 TraceCheckUtils]: 28: Hoare triple {12071#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {11985#true} is VALID [2022-04-27 13:07:18,842 INFO L290 TraceCheckUtils]: 29: Hoare triple {11985#true} ~cond := #in~cond; {11985#true} is VALID [2022-04-27 13:07:18,842 INFO L290 TraceCheckUtils]: 30: Hoare triple {11985#true} assume !(0 == ~cond); {11985#true} is VALID [2022-04-27 13:07:18,842 INFO L290 TraceCheckUtils]: 31: Hoare triple {11985#true} assume true; {11985#true} is VALID [2022-04-27 13:07:18,843 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {11985#true} {12071#(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))} #87#return; {12071#(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:18,843 INFO L272 TraceCheckUtils]: 33: Hoare triple {12071#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {11985#true} is VALID [2022-04-27 13:07:18,843 INFO L290 TraceCheckUtils]: 34: Hoare triple {11985#true} ~cond := #in~cond; {11985#true} is VALID [2022-04-27 13:07:18,843 INFO L290 TraceCheckUtils]: 35: Hoare triple {11985#true} assume !(0 == ~cond); {11985#true} is VALID [2022-04-27 13:07:18,843 INFO L290 TraceCheckUtils]: 36: Hoare triple {11985#true} assume true; {11985#true} is VALID [2022-04-27 13:07:18,844 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {11985#true} {12071#(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))} #89#return; {12071#(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:18,845 INFO L290 TraceCheckUtils]: 38: Hoare triple {12071#(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; {12071#(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:18,845 INFO L290 TraceCheckUtils]: 39: Hoare triple {12071#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {12108#(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:18,845 INFO L290 TraceCheckUtils]: 40: Hoare triple {12108#(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; {12108#(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:18,845 INFO L272 TraceCheckUtils]: 41: Hoare triple {12108#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {11985#true} is VALID [2022-04-27 13:07:18,846 INFO L290 TraceCheckUtils]: 42: Hoare triple {11985#true} ~cond := #in~cond; {11985#true} is VALID [2022-04-27 13:07:18,846 INFO L290 TraceCheckUtils]: 43: Hoare triple {11985#true} assume !(0 == ~cond); {11985#true} is VALID [2022-04-27 13:07:18,846 INFO L290 TraceCheckUtils]: 44: Hoare triple {11985#true} assume true; {11985#true} is VALID [2022-04-27 13:07:18,846 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {11985#true} {12108#(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))} #91#return; {12108#(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:18,846 INFO L272 TraceCheckUtils]: 46: Hoare triple {12108#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {11985#true} is VALID [2022-04-27 13:07:18,846 INFO L290 TraceCheckUtils]: 47: Hoare triple {11985#true} ~cond := #in~cond; {11985#true} is VALID [2022-04-27 13:07:18,846 INFO L290 TraceCheckUtils]: 48: Hoare triple {11985#true} assume !(0 == ~cond); {11985#true} is VALID [2022-04-27 13:07:18,846 INFO L290 TraceCheckUtils]: 49: Hoare triple {11985#true} assume true; {11985#true} is VALID [2022-04-27 13:07:18,847 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {11985#true} {12108#(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))} #93#return; {12108#(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:18,847 INFO L272 TraceCheckUtils]: 51: Hoare triple {12108#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {11985#true} is VALID [2022-04-27 13:07:18,847 INFO L290 TraceCheckUtils]: 52: Hoare triple {11985#true} ~cond := #in~cond; {11985#true} is VALID [2022-04-27 13:07:18,847 INFO L290 TraceCheckUtils]: 53: Hoare triple {11985#true} assume !(0 == ~cond); {11985#true} is VALID [2022-04-27 13:07:18,847 INFO L290 TraceCheckUtils]: 54: Hoare triple {11985#true} assume true; {11985#true} is VALID [2022-04-27 13:07:18,848 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {11985#true} {12108#(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))} #95#return; {12108#(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:18,848 INFO L272 TraceCheckUtils]: 56: Hoare triple {12108#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {11985#true} is VALID [2022-04-27 13:07:18,848 INFO L290 TraceCheckUtils]: 57: Hoare triple {11985#true} ~cond := #in~cond; {11985#true} is VALID [2022-04-27 13:07:18,848 INFO L290 TraceCheckUtils]: 58: Hoare triple {11985#true} assume !(0 == ~cond); {11985#true} is VALID [2022-04-27 13:07:18,848 INFO L290 TraceCheckUtils]: 59: Hoare triple {11985#true} assume true; {11985#true} is VALID [2022-04-27 13:07:18,849 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {11985#true} {12108#(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))} #97#return; {12108#(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:18,849 INFO L290 TraceCheckUtils]: 61: Hoare triple {12108#(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); {12108#(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:18,849 INFO L290 TraceCheckUtils]: 62: Hoare triple {12108#(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; {12178#(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:07:18,850 INFO L290 TraceCheckUtils]: 63: Hoare triple {12178#(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; {12178#(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:07:18,850 INFO L290 TraceCheckUtils]: 64: Hoare triple {12178#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {12185#(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:07:18,850 INFO L290 TraceCheckUtils]: 65: Hoare triple {12185#(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; {12185#(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:07:18,851 INFO L272 TraceCheckUtils]: 66: Hoare triple {12185#(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))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {11985#true} is VALID [2022-04-27 13:07:18,851 INFO L290 TraceCheckUtils]: 67: Hoare triple {11985#true} ~cond := #in~cond; {11985#true} is VALID [2022-04-27 13:07:18,851 INFO L290 TraceCheckUtils]: 68: Hoare triple {11985#true} assume !(0 == ~cond); {11985#true} is VALID [2022-04-27 13:07:18,851 INFO L290 TraceCheckUtils]: 69: Hoare triple {11985#true} assume true; {11985#true} is VALID [2022-04-27 13:07:18,851 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {11985#true} {12185#(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))} #91#return; {12185#(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:07:18,851 INFO L272 TraceCheckUtils]: 71: Hoare triple {12185#(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))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {11985#true} is VALID [2022-04-27 13:07:18,851 INFO L290 TraceCheckUtils]: 72: Hoare triple {11985#true} ~cond := #in~cond; {11985#true} is VALID [2022-04-27 13:07:18,851 INFO L290 TraceCheckUtils]: 73: Hoare triple {11985#true} assume !(0 == ~cond); {11985#true} is VALID [2022-04-27 13:07:18,851 INFO L290 TraceCheckUtils]: 74: Hoare triple {11985#true} assume true; {11985#true} is VALID [2022-04-27 13:07:18,852 INFO L284 TraceCheckUtils]: 75: Hoare quadruple {11985#true} {12185#(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))} #93#return; {12185#(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:07:18,852 INFO L272 TraceCheckUtils]: 76: Hoare triple {12185#(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))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {11985#true} is VALID [2022-04-27 13:07:18,852 INFO L290 TraceCheckUtils]: 77: Hoare triple {11985#true} ~cond := #in~cond; {11985#true} is VALID [2022-04-27 13:07:18,852 INFO L290 TraceCheckUtils]: 78: Hoare triple {11985#true} assume !(0 == ~cond); {11985#true} is VALID [2022-04-27 13:07:18,852 INFO L290 TraceCheckUtils]: 79: Hoare triple {11985#true} assume true; {11985#true} is VALID [2022-04-27 13:07:18,853 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {11985#true} {12185#(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))} #95#return; {12185#(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:07:18,853 INFO L272 TraceCheckUtils]: 81: Hoare triple {12185#(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))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {11985#true} is VALID [2022-04-27 13:07:18,853 INFO L290 TraceCheckUtils]: 82: Hoare triple {11985#true} ~cond := #in~cond; {11985#true} is VALID [2022-04-27 13:07:18,853 INFO L290 TraceCheckUtils]: 83: Hoare triple {11985#true} assume !(0 == ~cond); {11985#true} is VALID [2022-04-27 13:07:18,853 INFO L290 TraceCheckUtils]: 84: Hoare triple {11985#true} assume true; {11985#true} is VALID [2022-04-27 13:07:18,854 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {11985#true} {12185#(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))} #97#return; {12185#(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:07:18,855 INFO L290 TraceCheckUtils]: 86: Hoare triple {12185#(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);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {12252#(and (= main_~s~0 0) (<= 1 main_~k~0) (= main_~p~0 0) (= main_~a~0 (+ main_~c~0 main_~b~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:07:18,855 INFO L290 TraceCheckUtils]: 87: Hoare triple {12252#(and (= main_~s~0 0) (<= 1 main_~k~0) (= main_~p~0 0) (= main_~a~0 (+ main_~c~0 main_~b~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} assume !false; {12252#(and (= main_~s~0 0) (<= 1 main_~k~0) (= main_~p~0 0) (= main_~a~0 (+ main_~c~0 main_~b~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:07:18,855 INFO L272 TraceCheckUtils]: 88: Hoare triple {12252#(and (= main_~s~0 0) (<= 1 main_~k~0) (= main_~p~0 0) (= main_~a~0 (+ main_~c~0 main_~b~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {11985#true} is VALID [2022-04-27 13:07:18,855 INFO L290 TraceCheckUtils]: 89: Hoare triple {11985#true} ~cond := #in~cond; {11985#true} is VALID [2022-04-27 13:07:18,855 INFO L290 TraceCheckUtils]: 90: Hoare triple {11985#true} assume !(0 == ~cond); {11985#true} is VALID [2022-04-27 13:07:18,855 INFO L290 TraceCheckUtils]: 91: Hoare triple {11985#true} assume true; {11985#true} is VALID [2022-04-27 13:07:18,856 INFO L284 TraceCheckUtils]: 92: Hoare quadruple {11985#true} {12252#(and (= main_~s~0 0) (<= 1 main_~k~0) (= main_~p~0 0) (= main_~a~0 (+ main_~c~0 main_~b~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} #91#return; {12252#(and (= main_~s~0 0) (<= 1 main_~k~0) (= main_~p~0 0) (= main_~a~0 (+ main_~c~0 main_~b~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:07:18,856 INFO L272 TraceCheckUtils]: 93: Hoare triple {12252#(and (= main_~s~0 0) (<= 1 main_~k~0) (= main_~p~0 0) (= main_~a~0 (+ main_~c~0 main_~b~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {11985#true} is VALID [2022-04-27 13:07:18,856 INFO L290 TraceCheckUtils]: 94: Hoare triple {11985#true} ~cond := #in~cond; {11985#true} is VALID [2022-04-27 13:07:18,856 INFO L290 TraceCheckUtils]: 95: Hoare triple {11985#true} assume !(0 == ~cond); {11985#true} is VALID [2022-04-27 13:07:18,856 INFO L290 TraceCheckUtils]: 96: Hoare triple {11985#true} assume true; {11985#true} is VALID [2022-04-27 13:07:18,857 INFO L284 TraceCheckUtils]: 97: Hoare quadruple {11985#true} {12252#(and (= main_~s~0 0) (<= 1 main_~k~0) (= main_~p~0 0) (= main_~a~0 (+ main_~c~0 main_~b~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} #93#return; {12252#(and (= main_~s~0 0) (<= 1 main_~k~0) (= main_~p~0 0) (= main_~a~0 (+ main_~c~0 main_~b~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:07:18,857 INFO L272 TraceCheckUtils]: 98: Hoare triple {12252#(and (= main_~s~0 0) (<= 1 main_~k~0) (= main_~p~0 0) (= main_~a~0 (+ main_~c~0 main_~b~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {11985#true} is VALID [2022-04-27 13:07:18,857 INFO L290 TraceCheckUtils]: 99: Hoare triple {11985#true} ~cond := #in~cond; {11985#true} is VALID [2022-04-27 13:07:18,857 INFO L290 TraceCheckUtils]: 100: Hoare triple {11985#true} assume !(0 == ~cond); {11985#true} is VALID [2022-04-27 13:07:18,857 INFO L290 TraceCheckUtils]: 101: Hoare triple {11985#true} assume true; {11985#true} is VALID [2022-04-27 13:07:18,857 INFO L284 TraceCheckUtils]: 102: Hoare quadruple {11985#true} {12252#(and (= main_~s~0 0) (<= 1 main_~k~0) (= main_~p~0 0) (= main_~a~0 (+ main_~c~0 main_~b~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} #95#return; {12252#(and (= main_~s~0 0) (<= 1 main_~k~0) (= main_~p~0 0) (= main_~a~0 (+ main_~c~0 main_~b~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:07:18,857 INFO L272 TraceCheckUtils]: 103: Hoare triple {12252#(and (= main_~s~0 0) (<= 1 main_~k~0) (= main_~p~0 0) (= main_~a~0 (+ main_~c~0 main_~b~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {11985#true} is VALID [2022-04-27 13:07:18,857 INFO L290 TraceCheckUtils]: 104: Hoare triple {11985#true} ~cond := #in~cond; {11985#true} is VALID [2022-04-27 13:07:18,858 INFO L290 TraceCheckUtils]: 105: Hoare triple {11985#true} assume !(0 == ~cond); {11985#true} is VALID [2022-04-27 13:07:18,858 INFO L290 TraceCheckUtils]: 106: Hoare triple {11985#true} assume true; {11985#true} is VALID [2022-04-27 13:07:18,858 INFO L284 TraceCheckUtils]: 107: Hoare quadruple {11985#true} {12252#(and (= main_~s~0 0) (<= 1 main_~k~0) (= main_~p~0 0) (= main_~a~0 (+ main_~c~0 main_~b~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} #97#return; {12252#(and (= main_~s~0 0) (<= 1 main_~k~0) (= main_~p~0 0) (= main_~a~0 (+ main_~c~0 main_~b~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:07:18,859 INFO L290 TraceCheckUtils]: 108: Hoare triple {12252#(and (= main_~s~0 0) (<= 1 main_~k~0) (= main_~p~0 0) (= main_~a~0 (+ main_~c~0 main_~b~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {12319#(and (= main_~s~0 0) (= main_~p~0 0) (<= 2 main_~k~0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= (+ main_~c~0 (* main_~b~0 2)) main_~a~0) (= main_~q~0 1))} is VALID [2022-04-27 13:07:18,860 INFO L290 TraceCheckUtils]: 109: Hoare triple {12319#(and (= main_~s~0 0) (= main_~p~0 0) (<= 2 main_~k~0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= (+ main_~c~0 (* main_~b~0 2)) main_~a~0) (= main_~q~0 1))} assume !false; {12319#(and (= main_~s~0 0) (= main_~p~0 0) (<= 2 main_~k~0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= (+ main_~c~0 (* main_~b~0 2)) main_~a~0) (= main_~q~0 1))} is VALID [2022-04-27 13:07:18,860 INFO L272 TraceCheckUtils]: 110: Hoare triple {12319#(and (= main_~s~0 0) (= main_~p~0 0) (<= 2 main_~k~0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= (+ main_~c~0 (* main_~b~0 2)) main_~a~0) (= main_~q~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {11985#true} is VALID [2022-04-27 13:07:18,860 INFO L290 TraceCheckUtils]: 111: Hoare triple {11985#true} ~cond := #in~cond; {12329#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:07:18,860 INFO L290 TraceCheckUtils]: 112: Hoare triple {12329#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {12333#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:07:18,860 INFO L290 TraceCheckUtils]: 113: Hoare triple {12333#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {12333#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:07:18,861 INFO L284 TraceCheckUtils]: 114: Hoare quadruple {12333#(not (= |__VERIFIER_assert_#in~cond| 0))} {12319#(and (= main_~s~0 0) (= main_~p~0 0) (<= 2 main_~k~0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= (+ main_~c~0 (* main_~b~0 2)) main_~a~0) (= main_~q~0 1))} #91#return; {12340#(and (= main_~s~0 0) (= main_~p~0 0) (<= 2 main_~k~0) (= main_~y~0 (+ (* main_~x~0 2) main_~c~0)) (= main_~r~0 1) (= (+ main_~c~0 (* main_~k~0 main_~x~0)) main_~y~0) (= main_~q~0 1))} is VALID [2022-04-27 13:07:18,861 INFO L272 TraceCheckUtils]: 115: Hoare triple {12340#(and (= main_~s~0 0) (= main_~p~0 0) (<= 2 main_~k~0) (= main_~y~0 (+ (* main_~x~0 2) main_~c~0)) (= main_~r~0 1) (= (+ main_~c~0 (* main_~k~0 main_~x~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)); {11985#true} is VALID [2022-04-27 13:07:18,861 INFO L290 TraceCheckUtils]: 116: Hoare triple {11985#true} ~cond := #in~cond; {11985#true} is VALID [2022-04-27 13:07:18,861 INFO L290 TraceCheckUtils]: 117: Hoare triple {11985#true} assume !(0 == ~cond); {11985#true} is VALID [2022-04-27 13:07:18,861 INFO L290 TraceCheckUtils]: 118: Hoare triple {11985#true} assume true; {11985#true} is VALID [2022-04-27 13:07:18,862 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {11985#true} {12340#(and (= main_~s~0 0) (= main_~p~0 0) (<= 2 main_~k~0) (= main_~y~0 (+ (* main_~x~0 2) main_~c~0)) (= main_~r~0 1) (= (+ main_~c~0 (* main_~k~0 main_~x~0)) main_~y~0) (= main_~q~0 1))} #93#return; {12340#(and (= main_~s~0 0) (= main_~p~0 0) (<= 2 main_~k~0) (= main_~y~0 (+ (* main_~x~0 2) main_~c~0)) (= main_~r~0 1) (= (+ main_~c~0 (* main_~k~0 main_~x~0)) main_~y~0) (= main_~q~0 1))} is VALID [2022-04-27 13:07:18,862 INFO L272 TraceCheckUtils]: 120: Hoare triple {12340#(and (= main_~s~0 0) (= main_~p~0 0) (<= 2 main_~k~0) (= main_~y~0 (+ (* main_~x~0 2) main_~c~0)) (= main_~r~0 1) (= (+ main_~c~0 (* main_~k~0 main_~x~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)); {11985#true} is VALID [2022-04-27 13:07:18,862 INFO L290 TraceCheckUtils]: 121: Hoare triple {11985#true} ~cond := #in~cond; {11985#true} is VALID [2022-04-27 13:07:18,862 INFO L290 TraceCheckUtils]: 122: Hoare triple {11985#true} assume !(0 == ~cond); {11985#true} is VALID [2022-04-27 13:07:18,862 INFO L290 TraceCheckUtils]: 123: Hoare triple {11985#true} assume true; {11985#true} is VALID [2022-04-27 13:07:18,863 INFO L284 TraceCheckUtils]: 124: Hoare quadruple {11985#true} {12340#(and (= main_~s~0 0) (= main_~p~0 0) (<= 2 main_~k~0) (= main_~y~0 (+ (* main_~x~0 2) main_~c~0)) (= main_~r~0 1) (= (+ main_~c~0 (* main_~k~0 main_~x~0)) main_~y~0) (= main_~q~0 1))} #95#return; {12340#(and (= main_~s~0 0) (= main_~p~0 0) (<= 2 main_~k~0) (= main_~y~0 (+ (* main_~x~0 2) main_~c~0)) (= main_~r~0 1) (= (+ main_~c~0 (* main_~k~0 main_~x~0)) main_~y~0) (= main_~q~0 1))} is VALID [2022-04-27 13:07:18,863 INFO L272 TraceCheckUtils]: 125: Hoare triple {12340#(and (= main_~s~0 0) (= main_~p~0 0) (<= 2 main_~k~0) (= main_~y~0 (+ (* main_~x~0 2) main_~c~0)) (= main_~r~0 1) (= (+ main_~c~0 (* main_~k~0 main_~x~0)) main_~y~0) (= main_~q~0 1))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {11985#true} is VALID [2022-04-27 13:07:18,863 INFO L290 TraceCheckUtils]: 126: Hoare triple {11985#true} ~cond := #in~cond; {11985#true} is VALID [2022-04-27 13:07:18,863 INFO L290 TraceCheckUtils]: 127: Hoare triple {11985#true} assume !(0 == ~cond); {11985#true} is VALID [2022-04-27 13:07:18,863 INFO L290 TraceCheckUtils]: 128: Hoare triple {11985#true} assume true; {11985#true} is VALID [2022-04-27 13:07:18,864 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {11985#true} {12340#(and (= main_~s~0 0) (= main_~p~0 0) (<= 2 main_~k~0) (= main_~y~0 (+ (* main_~x~0 2) main_~c~0)) (= main_~r~0 1) (= (+ main_~c~0 (* main_~k~0 main_~x~0)) main_~y~0) (= main_~q~0 1))} #97#return; {12340#(and (= main_~s~0 0) (= main_~p~0 0) (<= 2 main_~k~0) (= main_~y~0 (+ (* main_~x~0 2) main_~c~0)) (= main_~r~0 1) (= (+ main_~c~0 (* main_~k~0 main_~x~0)) main_~y~0) (= main_~q~0 1))} is VALID [2022-04-27 13:07:18,864 INFO L290 TraceCheckUtils]: 130: Hoare triple {12340#(and (= main_~s~0 0) (= main_~p~0 0) (<= 2 main_~k~0) (= main_~y~0 (+ (* main_~x~0 2) main_~c~0)) (= main_~r~0 1) (= (+ main_~c~0 (* main_~k~0 main_~x~0)) main_~y~0) (= main_~q~0 1))} assume !(~c~0 >= ~b~0); {12340#(and (= main_~s~0 0) (= main_~p~0 0) (<= 2 main_~k~0) (= main_~y~0 (+ (* main_~x~0 2) main_~c~0)) (= main_~r~0 1) (= (+ main_~c~0 (* main_~k~0 main_~x~0)) main_~y~0) (= main_~q~0 1))} is VALID [2022-04-27 13:07:18,866 INFO L290 TraceCheckUtils]: 131: Hoare triple {12340#(and (= main_~s~0 0) (= main_~p~0 0) (<= 2 main_~k~0) (= main_~y~0 (+ (* main_~x~0 2) main_~c~0)) (= main_~r~0 1) (= (+ main_~c~0 (* main_~k~0 main_~x~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; {12392#(and (= (+ (* (- 2) main_~x~0) main_~y~0) main_~b~0) (<= (+ main_~q~0 2) 0) (= main_~s~0 1) (= (+ (* (- 2) main_~x~0) main_~y~0 (* main_~x~0 (* (- 1) main_~q~0))) main_~y~0))} is VALID [2022-04-27 13:07:18,866 INFO L290 TraceCheckUtils]: 132: Hoare triple {12392#(and (= (+ (* (- 2) main_~x~0) main_~y~0) main_~b~0) (<= (+ main_~q~0 2) 0) (= main_~s~0 1) (= (+ (* (- 2) main_~x~0) main_~y~0 (* main_~x~0 (* (- 1) main_~q~0))) main_~y~0))} assume !false; {12392#(and (= (+ (* (- 2) main_~x~0) main_~y~0) main_~b~0) (<= (+ main_~q~0 2) 0) (= main_~s~0 1) (= (+ (* (- 2) main_~x~0) main_~y~0 (* main_~x~0 (* (- 1) main_~q~0))) main_~y~0))} is VALID [2022-04-27 13:07:18,867 INFO L290 TraceCheckUtils]: 133: Hoare triple {12392#(and (= (+ (* (- 2) main_~x~0) main_~y~0) main_~b~0) (<= (+ main_~q~0 2) 0) (= main_~s~0 1) (= (+ (* (- 2) main_~x~0) main_~y~0 (* main_~x~0 (* (- 1) main_~q~0))) main_~y~0))} assume !(0 != ~b~0); {12399#(and (<= (+ main_~q~0 2) 0) (= main_~s~0 1) (= (+ (* (- 2) main_~x~0) main_~y~0) 0) (= (+ (* (- 2) main_~x~0) main_~y~0 (* main_~x~0 (* (- 1) main_~q~0))) main_~y~0))} is VALID [2022-04-27 13:07:18,867 INFO L272 TraceCheckUtils]: 134: Hoare triple {12399#(and (<= (+ main_~q~0 2) 0) (= main_~s~0 1) (= (+ (* (- 2) main_~x~0) main_~y~0) 0) (= (+ (* (- 2) main_~x~0) main_~y~0 (* main_~x~0 (* (- 1) main_~q~0))) main_~y~0))} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {12403#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:07:18,868 INFO L290 TraceCheckUtils]: 135: Hoare triple {12403#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {12407#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:07:18,868 INFO L290 TraceCheckUtils]: 136: Hoare triple {12407#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {11986#false} is VALID [2022-04-27 13:07:18,868 INFO L290 TraceCheckUtils]: 137: Hoare triple {11986#false} assume !false; {11986#false} is VALID [2022-04-27 13:07:18,868 INFO L134 CoverageAnalysis]: Checked inductivity of 615 backedges. 67 proven. 53 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2022-04-27 13:07:18,869 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:08:25,901 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-27 13:08:26,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:08:26,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44088253] [2022-04-27 13:08:26,144 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:08:26,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1919601863] [2022-04-27 13:08:26,144 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1919601863] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 13:08:26,144 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 13:08:26,144 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2022-04-27 13:08:26,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986610103] [2022-04-27 13:08:26,145 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 13:08:26,145 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 8 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (23), 6 states have call predecessors, (23), 7 states have call successors, (23) Word has length 138 [2022-04-27 13:08:26,145 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:08:26,145 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 8 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (23), 6 states have call predecessors, (23), 7 states have call successors, (23) [2022-04-27 13:08:26,215 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:08:26,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-27 13:08:26,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:08:26,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-27 13:08:26,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=348, Unknown=0, NotChecked=0, Total=420 [2022-04-27 13:08:26,216 INFO L87 Difference]: Start difference. First operand 123 states and 156 transitions. Second operand has 15 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 8 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (23), 6 states have call predecessors, (23), 7 states have call successors, (23) [2022-04-27 13:08:29,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:08:29,330 INFO L93 Difference]: Finished difference Result 198 states and 260 transitions. [2022-04-27 13:08:29,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-27 13:08:29,330 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 8 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (23), 6 states have call predecessors, (23), 7 states have call successors, (23) Word has length 138 [2022-04-27 13:08:29,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:08:29,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 8 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (23), 6 states have call predecessors, (23), 7 states have call successors, (23) [2022-04-27 13:08:29,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 139 transitions. [2022-04-27 13:08:29,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 8 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (23), 6 states have call predecessors, (23), 7 states have call successors, (23) [2022-04-27 13:08:29,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 139 transitions. [2022-04-27 13:08:29,334 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 139 transitions. [2022-04-27 13:08:29,471 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 139 edges. 139 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:08:29,474 INFO L225 Difference]: With dead ends: 198 [2022-04-27 13:08:29,474 INFO L226 Difference]: Without dead ends: 193 [2022-04-27 13:08:29,475 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 148 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=108, Invalid=542, Unknown=0, NotChecked=0, Total=650 [2022-04-27 13:08:29,475 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 33 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 872 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 911 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 872 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-04-27 13:08:29,475 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 349 Invalid, 911 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 872 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-04-27 13:08:29,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2022-04-27 13:08:29,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 187. [2022-04-27 13:08:29,743 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:08:29,743 INFO L82 GeneralOperation]: Start isEquivalent. First operand 193 states. Second operand has 187 states, 100 states have (on average 1.13) internal successors, (113), 100 states have internal predecessors, (113), 69 states have call successors, (69), 19 states have call predecessors, (69), 17 states have return successors, (67), 67 states have call predecessors, (67), 67 states have call successors, (67) [2022-04-27 13:08:29,744 INFO L74 IsIncluded]: Start isIncluded. First operand 193 states. Second operand has 187 states, 100 states have (on average 1.13) internal successors, (113), 100 states have internal predecessors, (113), 69 states have call successors, (69), 19 states have call predecessors, (69), 17 states have return successors, (67), 67 states have call predecessors, (67), 67 states have call successors, (67) [2022-04-27 13:08:29,749 INFO L87 Difference]: Start difference. First operand 193 states. Second operand has 187 states, 100 states have (on average 1.13) internal successors, (113), 100 states have internal predecessors, (113), 69 states have call successors, (69), 19 states have call predecessors, (69), 17 states have return successors, (67), 67 states have call predecessors, (67), 67 states have call successors, (67) [2022-04-27 13:08:29,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:08:29,752 INFO L93 Difference]: Finished difference Result 193 states and 255 transitions. [2022-04-27 13:08:29,753 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 255 transitions. [2022-04-27 13:08:29,753 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:08:29,753 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:08:29,753 INFO L74 IsIncluded]: Start isIncluded. First operand has 187 states, 100 states have (on average 1.13) internal successors, (113), 100 states have internal predecessors, (113), 69 states have call successors, (69), 19 states have call predecessors, (69), 17 states have return successors, (67), 67 states have call predecessors, (67), 67 states have call successors, (67) Second operand 193 states. [2022-04-27 13:08:29,754 INFO L87 Difference]: Start difference. First operand has 187 states, 100 states have (on average 1.13) internal successors, (113), 100 states have internal predecessors, (113), 69 states have call successors, (69), 19 states have call predecessors, (69), 17 states have return successors, (67), 67 states have call predecessors, (67), 67 states have call successors, (67) Second operand 193 states. [2022-04-27 13:08:29,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:08:29,757 INFO L93 Difference]: Finished difference Result 193 states and 255 transitions. [2022-04-27 13:08:29,757 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 255 transitions. [2022-04-27 13:08:29,757 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:08:29,757 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:08:29,758 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:08:29,758 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:08:29,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 100 states have (on average 1.13) internal successors, (113), 100 states have internal predecessors, (113), 69 states have call successors, (69), 19 states have call predecessors, (69), 17 states have return successors, (67), 67 states have call predecessors, (67), 67 states have call successors, (67) [2022-04-27 13:08:29,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 249 transitions. [2022-04-27 13:08:29,761 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 249 transitions. Word has length 138 [2022-04-27 13:08:29,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:08:29,762 INFO L495 AbstractCegarLoop]: Abstraction has 187 states and 249 transitions. [2022-04-27 13:08:29,762 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 8 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (23), 6 states have call predecessors, (23), 7 states have call successors, (23) [2022-04-27 13:08:29,762 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 249 transitions. [2022-04-27 13:08:29,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2022-04-27 13:08:29,763 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:08:29,763 INFO L195 NwaCegarLoop]: trace histogram [21, 20, 20, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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] [2022-04-27 13:08:29,779 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:29,973 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:29,974 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:08:29,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:08:29,974 INFO L85 PathProgramCache]: Analyzing trace with hash -1023835477, now seen corresponding path program 4 times [2022-04-27 13:08:29,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:08:29,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165046363] [2022-04-27 13:08:29,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:08:29,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:08:29,985 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:08:29,985 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2039299877] [2022-04-27 13:08:29,985 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-27 13:08:29,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:08:29,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:08:29,986 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:29,987 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:30,048 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-27 13:08:30,048 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 13:08:30,049 INFO L263 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 52 conjunts are in the unsatisfiable core [2022-04-27 13:08:30,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:08:30,081 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:08:31,439 INFO L272 TraceCheckUtils]: 0: Hoare triple {13511#true} call ULTIMATE.init(); {13511#true} is VALID [2022-04-27 13:08:31,439 INFO L290 TraceCheckUtils]: 1: Hoare triple {13511#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); {13511#true} is VALID [2022-04-27 13:08:31,439 INFO L290 TraceCheckUtils]: 2: Hoare triple {13511#true} assume true; {13511#true} is VALID [2022-04-27 13:08:31,440 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13511#true} {13511#true} #103#return; {13511#true} is VALID [2022-04-27 13:08:31,440 INFO L272 TraceCheckUtils]: 4: Hoare triple {13511#true} call #t~ret6 := main(); {13511#true} is VALID [2022-04-27 13:08:31,440 INFO L290 TraceCheckUtils]: 5: Hoare triple {13511#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {13511#true} is VALID [2022-04-27 13:08:31,440 INFO L272 TraceCheckUtils]: 6: Hoare triple {13511#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 20 then 1 else 0)); {13511#true} is VALID [2022-04-27 13:08:31,440 INFO L290 TraceCheckUtils]: 7: Hoare triple {13511#true} ~cond := #in~cond; {13511#true} is VALID [2022-04-27 13:08:31,440 INFO L290 TraceCheckUtils]: 8: Hoare triple {13511#true} assume !(0 == ~cond); {13511#true} is VALID [2022-04-27 13:08:31,440 INFO L290 TraceCheckUtils]: 9: Hoare triple {13511#true} assume true; {13511#true} is VALID [2022-04-27 13:08:31,440 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {13511#true} {13511#true} #79#return; {13511#true} is VALID [2022-04-27 13:08:31,440 INFO L290 TraceCheckUtils]: 11: Hoare triple {13511#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {13511#true} is VALID [2022-04-27 13:08:31,440 INFO L272 TraceCheckUtils]: 12: Hoare triple {13511#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 20 then 1 else 0)); {13511#true} is VALID [2022-04-27 13:08:31,440 INFO L290 TraceCheckUtils]: 13: Hoare triple {13511#true} ~cond := #in~cond; {13511#true} is VALID [2022-04-27 13:08:31,440 INFO L290 TraceCheckUtils]: 14: Hoare triple {13511#true} assume !(0 == ~cond); {13511#true} is VALID [2022-04-27 13:08:31,440 INFO L290 TraceCheckUtils]: 15: Hoare triple {13511#true} assume true; {13511#true} is VALID [2022-04-27 13:08:31,440 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {13511#true} {13511#true} #81#return; {13511#true} is VALID [2022-04-27 13:08:31,440 INFO L272 TraceCheckUtils]: 17: Hoare triple {13511#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {13511#true} is VALID [2022-04-27 13:08:31,440 INFO L290 TraceCheckUtils]: 18: Hoare triple {13511#true} ~cond := #in~cond; {13511#true} is VALID [2022-04-27 13:08:31,440 INFO L290 TraceCheckUtils]: 19: Hoare triple {13511#true} assume !(0 == ~cond); {13511#true} is VALID [2022-04-27 13:08:31,440 INFO L290 TraceCheckUtils]: 20: Hoare triple {13511#true} assume true; {13511#true} is VALID [2022-04-27 13:08:31,440 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {13511#true} {13511#true} #83#return; {13511#true} is VALID [2022-04-27 13:08:31,440 INFO L272 TraceCheckUtils]: 22: Hoare triple {13511#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {13511#true} is VALID [2022-04-27 13:08:31,440 INFO L290 TraceCheckUtils]: 23: Hoare triple {13511#true} ~cond := #in~cond; {13511#true} is VALID [2022-04-27 13:08:31,441 INFO L290 TraceCheckUtils]: 24: Hoare triple {13511#true} assume !(0 == ~cond); {13511#true} is VALID [2022-04-27 13:08:31,441 INFO L290 TraceCheckUtils]: 25: Hoare triple {13511#true} assume true; {13511#true} is VALID [2022-04-27 13:08:31,441 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {13511#true} {13511#true} #85#return; {13511#true} is VALID [2022-04-27 13:08:31,441 INFO L290 TraceCheckUtils]: 27: Hoare triple {13511#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {13597#(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:08:31,441 INFO L272 TraceCheckUtils]: 28: Hoare triple {13597#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {13511#true} is VALID [2022-04-27 13:08:31,441 INFO L290 TraceCheckUtils]: 29: Hoare triple {13511#true} ~cond := #in~cond; {13511#true} is VALID [2022-04-27 13:08:31,441 INFO L290 TraceCheckUtils]: 30: Hoare triple {13511#true} assume !(0 == ~cond); {13511#true} is VALID [2022-04-27 13:08:31,441 INFO L290 TraceCheckUtils]: 31: Hoare triple {13511#true} assume true; {13511#true} is VALID [2022-04-27 13:08:31,442 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {13511#true} {13597#(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))} #87#return; {13597#(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:08:31,442 INFO L272 TraceCheckUtils]: 33: Hoare triple {13597#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {13511#true} is VALID [2022-04-27 13:08:31,442 INFO L290 TraceCheckUtils]: 34: Hoare triple {13511#true} ~cond := #in~cond; {13511#true} is VALID [2022-04-27 13:08:31,442 INFO L290 TraceCheckUtils]: 35: Hoare triple {13511#true} assume !(0 == ~cond); {13511#true} is VALID [2022-04-27 13:08:31,442 INFO L290 TraceCheckUtils]: 36: Hoare triple {13511#true} assume true; {13511#true} is VALID [2022-04-27 13:08:31,443 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {13511#true} {13597#(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))} #89#return; {13597#(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:08:31,443 INFO L290 TraceCheckUtils]: 38: Hoare triple {13597#(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; {13597#(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:08:31,443 INFO L290 TraceCheckUtils]: 39: Hoare triple {13597#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {13634#(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:08:31,444 INFO L290 TraceCheckUtils]: 40: Hoare triple {13634#(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; {13634#(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:08:31,444 INFO L272 TraceCheckUtils]: 41: Hoare triple {13634#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {13511#true} is VALID [2022-04-27 13:08:31,444 INFO L290 TraceCheckUtils]: 42: Hoare triple {13511#true} ~cond := #in~cond; {13511#true} is VALID [2022-04-27 13:08:31,444 INFO L290 TraceCheckUtils]: 43: Hoare triple {13511#true} assume !(0 == ~cond); {13511#true} is VALID [2022-04-27 13:08:31,444 INFO L290 TraceCheckUtils]: 44: Hoare triple {13511#true} assume true; {13511#true} is VALID [2022-04-27 13:08:31,444 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {13511#true} {13634#(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))} #91#return; {13634#(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:08:31,444 INFO L272 TraceCheckUtils]: 46: Hoare triple {13634#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {13511#true} is VALID [2022-04-27 13:08:31,444 INFO L290 TraceCheckUtils]: 47: Hoare triple {13511#true} ~cond := #in~cond; {13511#true} is VALID [2022-04-27 13:08:31,445 INFO L290 TraceCheckUtils]: 48: Hoare triple {13511#true} assume !(0 == ~cond); {13511#true} is VALID [2022-04-27 13:08:31,445 INFO L290 TraceCheckUtils]: 49: Hoare triple {13511#true} assume true; {13511#true} is VALID [2022-04-27 13:08:31,445 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {13511#true} {13634#(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))} #93#return; {13634#(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:08:31,445 INFO L272 TraceCheckUtils]: 51: Hoare triple {13634#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {13511#true} is VALID [2022-04-27 13:08:31,445 INFO L290 TraceCheckUtils]: 52: Hoare triple {13511#true} ~cond := #in~cond; {13511#true} is VALID [2022-04-27 13:08:31,445 INFO L290 TraceCheckUtils]: 53: Hoare triple {13511#true} assume !(0 == ~cond); {13511#true} is VALID [2022-04-27 13:08:31,445 INFO L290 TraceCheckUtils]: 54: Hoare triple {13511#true} assume true; {13511#true} is VALID [2022-04-27 13:08:31,446 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {13511#true} {13634#(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))} #95#return; {13634#(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:08:31,446 INFO L272 TraceCheckUtils]: 56: Hoare triple {13634#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {13511#true} is VALID [2022-04-27 13:08:31,446 INFO L290 TraceCheckUtils]: 57: Hoare triple {13511#true} ~cond := #in~cond; {13511#true} is VALID [2022-04-27 13:08:31,446 INFO L290 TraceCheckUtils]: 58: Hoare triple {13511#true} assume !(0 == ~cond); {13511#true} is VALID [2022-04-27 13:08:31,446 INFO L290 TraceCheckUtils]: 59: Hoare triple {13511#true} assume true; {13511#true} is VALID [2022-04-27 13:08:31,447 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {13511#true} {13634#(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))} #97#return; {13634#(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:08:31,447 INFO L290 TraceCheckUtils]: 61: Hoare triple {13634#(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);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {13701#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~b~0 main_~y~0) (= main_~k~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:08:31,448 INFO L290 TraceCheckUtils]: 62: Hoare triple {13701#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~b~0 main_~y~0) (= main_~k~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !false; {13701#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~b~0 main_~y~0) (= main_~k~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:08:31,448 INFO L272 TraceCheckUtils]: 63: Hoare triple {13701#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~b~0 main_~y~0) (= main_~k~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {13511#true} is VALID [2022-04-27 13:08:31,448 INFO L290 TraceCheckUtils]: 64: Hoare triple {13511#true} ~cond := #in~cond; {13511#true} is VALID [2022-04-27 13:08:31,448 INFO L290 TraceCheckUtils]: 65: Hoare triple {13511#true} assume !(0 == ~cond); {13511#true} is VALID [2022-04-27 13:08:31,448 INFO L290 TraceCheckUtils]: 66: Hoare triple {13511#true} assume true; {13511#true} is VALID [2022-04-27 13:08:31,449 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {13511#true} {13701#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~b~0 main_~y~0) (= main_~k~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #91#return; {13701#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~b~0 main_~y~0) (= main_~k~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:08:31,449 INFO L272 TraceCheckUtils]: 68: Hoare triple {13701#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~b~0 main_~y~0) (= main_~k~0 1) (= 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)); {13511#true} is VALID [2022-04-27 13:08:31,449 INFO L290 TraceCheckUtils]: 69: Hoare triple {13511#true} ~cond := #in~cond; {13511#true} is VALID [2022-04-27 13:08:31,449 INFO L290 TraceCheckUtils]: 70: Hoare triple {13511#true} assume !(0 == ~cond); {13511#true} is VALID [2022-04-27 13:08:31,449 INFO L290 TraceCheckUtils]: 71: Hoare triple {13511#true} assume true; {13511#true} is VALID [2022-04-27 13:08:31,454 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {13511#true} {13701#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~b~0 main_~y~0) (= main_~k~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #93#return; {13701#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~b~0 main_~y~0) (= main_~k~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:08:31,454 INFO L272 TraceCheckUtils]: 73: Hoare triple {13701#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~b~0 main_~y~0) (= main_~k~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {13511#true} is VALID [2022-04-27 13:08:31,454 INFO L290 TraceCheckUtils]: 74: Hoare triple {13511#true} ~cond := #in~cond; {13511#true} is VALID [2022-04-27 13:08:31,454 INFO L290 TraceCheckUtils]: 75: Hoare triple {13511#true} assume !(0 == ~cond); {13511#true} is VALID [2022-04-27 13:08:31,454 INFO L290 TraceCheckUtils]: 76: Hoare triple {13511#true} assume true; {13511#true} is VALID [2022-04-27 13:08:31,454 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {13511#true} {13701#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~b~0 main_~y~0) (= main_~k~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #95#return; {13701#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~b~0 main_~y~0) (= main_~k~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:08:31,455 INFO L272 TraceCheckUtils]: 78: Hoare triple {13701#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~b~0 main_~y~0) (= main_~k~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {13511#true} is VALID [2022-04-27 13:08:31,455 INFO L290 TraceCheckUtils]: 79: Hoare triple {13511#true} ~cond := #in~cond; {13511#true} is VALID [2022-04-27 13:08:31,455 INFO L290 TraceCheckUtils]: 80: Hoare triple {13511#true} assume !(0 == ~cond); {13511#true} is VALID [2022-04-27 13:08:31,455 INFO L290 TraceCheckUtils]: 81: Hoare triple {13511#true} assume true; {13511#true} is VALID [2022-04-27 13:08:31,455 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {13511#true} {13701#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~b~0 main_~y~0) (= main_~k~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #97#return; {13701#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~b~0 main_~y~0) (= main_~k~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:08:31,456 INFO L290 TraceCheckUtils]: 83: Hoare triple {13701#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~b~0 main_~y~0) (= main_~k~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {13768#(and (= main_~r~0 0) (= (+ (- 1) main_~k~0) 1) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ main_~c~0 main_~b~0)) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:08:31,457 INFO L290 TraceCheckUtils]: 84: Hoare triple {13768#(and (= main_~r~0 0) (= (+ (- 1) main_~k~0) 1) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ main_~c~0 main_~b~0)) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !false; {13768#(and (= main_~r~0 0) (= (+ (- 1) main_~k~0) 1) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ main_~c~0 main_~b~0)) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:08:31,457 INFO L272 TraceCheckUtils]: 85: Hoare triple {13768#(and (= main_~r~0 0) (= (+ (- 1) main_~k~0) 1) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ main_~c~0 main_~b~0)) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {13511#true} is VALID [2022-04-27 13:08:31,457 INFO L290 TraceCheckUtils]: 86: Hoare triple {13511#true} ~cond := #in~cond; {13511#true} is VALID [2022-04-27 13:08:31,457 INFO L290 TraceCheckUtils]: 87: Hoare triple {13511#true} assume !(0 == ~cond); {13511#true} is VALID [2022-04-27 13:08:31,457 INFO L290 TraceCheckUtils]: 88: Hoare triple {13511#true} assume true; {13511#true} is VALID [2022-04-27 13:08:31,457 INFO L284 TraceCheckUtils]: 89: Hoare quadruple {13511#true} {13768#(and (= main_~r~0 0) (= (+ (- 1) main_~k~0) 1) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ main_~c~0 main_~b~0)) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #91#return; {13768#(and (= main_~r~0 0) (= (+ (- 1) main_~k~0) 1) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ main_~c~0 main_~b~0)) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:08:31,457 INFO L272 TraceCheckUtils]: 90: Hoare triple {13768#(and (= main_~r~0 0) (= (+ (- 1) main_~k~0) 1) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ main_~c~0 main_~b~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)); {13511#true} is VALID [2022-04-27 13:08:31,457 INFO L290 TraceCheckUtils]: 91: Hoare triple {13511#true} ~cond := #in~cond; {13511#true} is VALID [2022-04-27 13:08:31,458 INFO L290 TraceCheckUtils]: 92: Hoare triple {13511#true} assume !(0 == ~cond); {13511#true} is VALID [2022-04-27 13:08:31,458 INFO L290 TraceCheckUtils]: 93: Hoare triple {13511#true} assume true; {13511#true} is VALID [2022-04-27 13:08:31,458 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {13511#true} {13768#(and (= main_~r~0 0) (= (+ (- 1) main_~k~0) 1) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ main_~c~0 main_~b~0)) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #93#return; {13768#(and (= main_~r~0 0) (= (+ (- 1) main_~k~0) 1) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ main_~c~0 main_~b~0)) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:08:31,458 INFO L272 TraceCheckUtils]: 95: Hoare triple {13768#(and (= main_~r~0 0) (= (+ (- 1) main_~k~0) 1) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ main_~c~0 main_~b~0)) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {13511#true} is VALID [2022-04-27 13:08:31,458 INFO L290 TraceCheckUtils]: 96: Hoare triple {13511#true} ~cond := #in~cond; {13511#true} is VALID [2022-04-27 13:08:31,458 INFO L290 TraceCheckUtils]: 97: Hoare triple {13511#true} assume !(0 == ~cond); {13511#true} is VALID [2022-04-27 13:08:31,458 INFO L290 TraceCheckUtils]: 98: Hoare triple {13511#true} assume true; {13511#true} is VALID [2022-04-27 13:08:31,459 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {13511#true} {13768#(and (= main_~r~0 0) (= (+ (- 1) main_~k~0) 1) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ main_~c~0 main_~b~0)) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #95#return; {13768#(and (= main_~r~0 0) (= (+ (- 1) main_~k~0) 1) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ main_~c~0 main_~b~0)) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:08:31,459 INFO L272 TraceCheckUtils]: 100: Hoare triple {13768#(and (= main_~r~0 0) (= (+ (- 1) main_~k~0) 1) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ main_~c~0 main_~b~0)) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {13511#true} is VALID [2022-04-27 13:08:31,459 INFO L290 TraceCheckUtils]: 101: Hoare triple {13511#true} ~cond := #in~cond; {13511#true} is VALID [2022-04-27 13:08:31,459 INFO L290 TraceCheckUtils]: 102: Hoare triple {13511#true} assume !(0 == ~cond); {13511#true} is VALID [2022-04-27 13:08:31,459 INFO L290 TraceCheckUtils]: 103: Hoare triple {13511#true} assume true; {13511#true} is VALID [2022-04-27 13:08:31,460 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {13511#true} {13768#(and (= main_~r~0 0) (= (+ (- 1) main_~k~0) 1) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ main_~c~0 main_~b~0)) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #97#return; {13768#(and (= main_~r~0 0) (= (+ (- 1) main_~k~0) 1) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ main_~c~0 main_~b~0)) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:08:31,460 INFO L290 TraceCheckUtils]: 105: Hoare triple {13768#(and (= main_~r~0 0) (= (+ (- 1) main_~k~0) 1) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ main_~c~0 main_~b~0)) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {13835#(and (= main_~r~0 0) (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ main_~c~0 (* main_~b~0 2))) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= (+ (- 2) main_~k~0) 1) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:08:31,461 INFO L290 TraceCheckUtils]: 106: Hoare triple {13835#(and (= main_~r~0 0) (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ main_~c~0 (* main_~b~0 2))) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= (+ (- 2) main_~k~0) 1) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !false; {13835#(and (= main_~r~0 0) (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ main_~c~0 (* main_~b~0 2))) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= (+ (- 2) main_~k~0) 1) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:08:31,461 INFO L272 TraceCheckUtils]: 107: Hoare triple {13835#(and (= main_~r~0 0) (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ main_~c~0 (* main_~b~0 2))) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= (+ (- 2) main_~k~0) 1) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {13511#true} is VALID [2022-04-27 13:08:31,461 INFO L290 TraceCheckUtils]: 108: Hoare triple {13511#true} ~cond := #in~cond; {13511#true} is VALID [2022-04-27 13:08:31,461 INFO L290 TraceCheckUtils]: 109: Hoare triple {13511#true} assume !(0 == ~cond); {13511#true} is VALID [2022-04-27 13:08:31,461 INFO L290 TraceCheckUtils]: 110: Hoare triple {13511#true} assume true; {13511#true} is VALID [2022-04-27 13:08:31,462 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {13511#true} {13835#(and (= main_~r~0 0) (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ main_~c~0 (* main_~b~0 2))) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= (+ (- 2) main_~k~0) 1) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #91#return; {13835#(and (= main_~r~0 0) (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ main_~c~0 (* main_~b~0 2))) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= (+ (- 2) main_~k~0) 1) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:08:31,462 INFO L272 TraceCheckUtils]: 112: Hoare triple {13835#(and (= main_~r~0 0) (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ main_~c~0 (* main_~b~0 2))) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= (+ (- 2) main_~k~0) 1) (= 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)); {13511#true} is VALID [2022-04-27 13:08:31,462 INFO L290 TraceCheckUtils]: 113: Hoare triple {13511#true} ~cond := #in~cond; {13511#true} is VALID [2022-04-27 13:08:31,462 INFO L290 TraceCheckUtils]: 114: Hoare triple {13511#true} assume !(0 == ~cond); {13511#true} is VALID [2022-04-27 13:08:31,462 INFO L290 TraceCheckUtils]: 115: Hoare triple {13511#true} assume true; {13511#true} is VALID [2022-04-27 13:08:31,462 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {13511#true} {13835#(and (= main_~r~0 0) (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ main_~c~0 (* main_~b~0 2))) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= (+ (- 2) main_~k~0) 1) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #93#return; {13835#(and (= main_~r~0 0) (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ main_~c~0 (* main_~b~0 2))) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= (+ (- 2) main_~k~0) 1) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:08:31,463 INFO L272 TraceCheckUtils]: 117: Hoare triple {13835#(and (= main_~r~0 0) (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ main_~c~0 (* main_~b~0 2))) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= (+ (- 2) main_~k~0) 1) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {13511#true} is VALID [2022-04-27 13:08:31,463 INFO L290 TraceCheckUtils]: 118: Hoare triple {13511#true} ~cond := #in~cond; {13511#true} is VALID [2022-04-27 13:08:31,463 INFO L290 TraceCheckUtils]: 119: Hoare triple {13511#true} assume !(0 == ~cond); {13511#true} is VALID [2022-04-27 13:08:31,463 INFO L290 TraceCheckUtils]: 120: Hoare triple {13511#true} assume true; {13511#true} is VALID [2022-04-27 13:08:31,463 INFO L284 TraceCheckUtils]: 121: Hoare quadruple {13511#true} {13835#(and (= main_~r~0 0) (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ main_~c~0 (* main_~b~0 2))) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= (+ (- 2) main_~k~0) 1) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #95#return; {13835#(and (= main_~r~0 0) (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ main_~c~0 (* main_~b~0 2))) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= (+ (- 2) main_~k~0) 1) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:08:31,463 INFO L272 TraceCheckUtils]: 122: Hoare triple {13835#(and (= main_~r~0 0) (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ main_~c~0 (* main_~b~0 2))) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= (+ (- 2) main_~k~0) 1) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {13511#true} is VALID [2022-04-27 13:08:31,463 INFO L290 TraceCheckUtils]: 123: Hoare triple {13511#true} ~cond := #in~cond; {13511#true} is VALID [2022-04-27 13:08:31,463 INFO L290 TraceCheckUtils]: 124: Hoare triple {13511#true} assume !(0 == ~cond); {13511#true} is VALID [2022-04-27 13:08:31,463 INFO L290 TraceCheckUtils]: 125: Hoare triple {13511#true} assume true; {13511#true} is VALID [2022-04-27 13:08:31,464 INFO L284 TraceCheckUtils]: 126: Hoare quadruple {13511#true} {13835#(and (= main_~r~0 0) (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ main_~c~0 (* main_~b~0 2))) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= (+ (- 2) main_~k~0) 1) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #97#return; {13835#(and (= main_~r~0 0) (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ main_~c~0 (* main_~b~0 2))) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= (+ (- 2) main_~k~0) 1) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:08:31,465 INFO L290 TraceCheckUtils]: 127: Hoare triple {13835#(and (= main_~r~0 0) (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ main_~c~0 (* main_~b~0 2))) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= (+ (- 2) main_~k~0) 1) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {13902#(and (= main_~r~0 0) (= main_~s~0 1) (<= (* main_~b~0 4) main_~a~0) (= main_~c~0 (+ (* main_~b~0 (- 4)) main_~a~0)) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~k~0 4) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:08:31,465 INFO L290 TraceCheckUtils]: 128: Hoare triple {13902#(and (= main_~r~0 0) (= main_~s~0 1) (<= (* main_~b~0 4) main_~a~0) (= main_~c~0 (+ (* main_~b~0 (- 4)) main_~a~0)) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~k~0 4) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !false; {13902#(and (= main_~r~0 0) (= main_~s~0 1) (<= (* main_~b~0 4) main_~a~0) (= main_~c~0 (+ (* main_~b~0 (- 4)) main_~a~0)) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~k~0 4) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:08:31,465 INFO L272 TraceCheckUtils]: 129: Hoare triple {13902#(and (= main_~r~0 0) (= main_~s~0 1) (<= (* main_~b~0 4) main_~a~0) (= main_~c~0 (+ (* main_~b~0 (- 4)) main_~a~0)) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~k~0 4) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {13511#true} is VALID [2022-04-27 13:08:31,466 INFO L290 TraceCheckUtils]: 130: Hoare triple {13511#true} ~cond := #in~cond; {13912#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:08:31,466 INFO L290 TraceCheckUtils]: 131: Hoare triple {13912#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {13916#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:08:31,466 INFO L290 TraceCheckUtils]: 132: Hoare triple {13916#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {13916#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:08:31,467 INFO L284 TraceCheckUtils]: 133: Hoare quadruple {13916#(not (= |__VERIFIER_assert_#in~cond| 0))} {13902#(and (= main_~r~0 0) (= main_~s~0 1) (<= (* main_~b~0 4) main_~a~0) (= main_~c~0 (+ (* main_~b~0 (- 4)) main_~a~0)) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~k~0 4) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #91#return; {13923#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~s~0 1) (= main_~b~0 main_~y~0) (<= (* main_~b~0 4) (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~q~0 0) (= main_~k~0 4) (= main_~p~0 1))} is VALID [2022-04-27 13:08:31,467 INFO L272 TraceCheckUtils]: 134: Hoare triple {13923#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~s~0 1) (= main_~b~0 main_~y~0) (<= (* main_~b~0 4) (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~q~0 0) (= main_~k~0 4) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {13511#true} is VALID [2022-04-27 13:08:31,467 INFO L290 TraceCheckUtils]: 135: Hoare triple {13511#true} ~cond := #in~cond; {13511#true} is VALID [2022-04-27 13:08:31,467 INFO L290 TraceCheckUtils]: 136: Hoare triple {13511#true} assume !(0 == ~cond); {13511#true} is VALID [2022-04-27 13:08:31,467 INFO L290 TraceCheckUtils]: 137: Hoare triple {13511#true} assume true; {13511#true} is VALID [2022-04-27 13:08:31,468 INFO L284 TraceCheckUtils]: 138: Hoare quadruple {13511#true} {13923#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~s~0 1) (= main_~b~0 main_~y~0) (<= (* main_~b~0 4) (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~q~0 0) (= main_~k~0 4) (= main_~p~0 1))} #93#return; {13923#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~s~0 1) (= main_~b~0 main_~y~0) (<= (* main_~b~0 4) (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~q~0 0) (= main_~k~0 4) (= main_~p~0 1))} is VALID [2022-04-27 13:08:31,468 INFO L272 TraceCheckUtils]: 139: Hoare triple {13923#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~s~0 1) (= main_~b~0 main_~y~0) (<= (* main_~b~0 4) (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~q~0 0) (= main_~k~0 4) (= main_~p~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {13511#true} is VALID [2022-04-27 13:08:31,468 INFO L290 TraceCheckUtils]: 140: Hoare triple {13511#true} ~cond := #in~cond; {13511#true} is VALID [2022-04-27 13:08:31,468 INFO L290 TraceCheckUtils]: 141: Hoare triple {13511#true} assume !(0 == ~cond); {13511#true} is VALID [2022-04-27 13:08:31,468 INFO L290 TraceCheckUtils]: 142: Hoare triple {13511#true} assume true; {13511#true} is VALID [2022-04-27 13:08:31,469 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {13511#true} {13923#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~s~0 1) (= main_~b~0 main_~y~0) (<= (* main_~b~0 4) (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~q~0 0) (= main_~k~0 4) (= main_~p~0 1))} #95#return; {13923#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~s~0 1) (= main_~b~0 main_~y~0) (<= (* main_~b~0 4) (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~q~0 0) (= main_~k~0 4) (= main_~p~0 1))} is VALID [2022-04-27 13:08:31,469 INFO L272 TraceCheckUtils]: 144: Hoare triple {13923#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~s~0 1) (= main_~b~0 main_~y~0) (<= (* main_~b~0 4) (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~q~0 0) (= main_~k~0 4) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {13511#true} is VALID [2022-04-27 13:08:31,469 INFO L290 TraceCheckUtils]: 145: Hoare triple {13511#true} ~cond := #in~cond; {13511#true} is VALID [2022-04-27 13:08:31,469 INFO L290 TraceCheckUtils]: 146: Hoare triple {13511#true} assume !(0 == ~cond); {13511#true} is VALID [2022-04-27 13:08:31,469 INFO L290 TraceCheckUtils]: 147: Hoare triple {13511#true} assume true; {13511#true} is VALID [2022-04-27 13:08:31,469 INFO L284 TraceCheckUtils]: 148: Hoare quadruple {13511#true} {13923#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~s~0 1) (= main_~b~0 main_~y~0) (<= (* main_~b~0 4) (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~q~0 0) (= main_~k~0 4) (= main_~p~0 1))} #97#return; {13923#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~s~0 1) (= main_~b~0 main_~y~0) (<= (* main_~b~0 4) (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~q~0 0) (= main_~k~0 4) (= main_~p~0 1))} is VALID [2022-04-27 13:08:31,470 INFO L290 TraceCheckUtils]: 149: Hoare triple {13923#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~s~0 1) (= main_~b~0 main_~y~0) (<= (* main_~b~0 4) (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~q~0 0) (= main_~k~0 4) (= main_~p~0 1))} assume !(~c~0 >= ~b~0); {13972#(and (= main_~r~0 0) (<= (* main_~y~0 4) (+ main_~c~0 (* main_~k~0 main_~y~0))) (= main_~s~0 1) (not (<= main_~y~0 main_~c~0)) (= main_~q~0 0) (= main_~k~0 4) (= main_~x~0 (+ main_~c~0 (* main_~k~0 main_~y~0))) (= main_~p~0 1))} is VALID [2022-04-27 13:08:31,472 INFO L290 TraceCheckUtils]: 150: Hoare triple {13972#(and (= main_~r~0 0) (<= (* main_~y~0 4) (+ main_~c~0 (* main_~k~0 main_~y~0))) (= main_~s~0 1) (not (<= main_~y~0 main_~c~0)) (= main_~q~0 0) (= main_~k~0 4) (= main_~x~0 (+ main_~c~0 (* main_~k~0 main_~y~0))) (= main_~p~0 1))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {13976#(and (not (<= (* 5 main_~y~0) main_~x~0)) (<= (* main_~y~0 4) main_~x~0) (= (+ main_~s~0 4) 0) (= main_~b~0 (+ (* main_~y~0 (- 4)) main_~x~0)) (= main_~q~0 1))} is VALID [2022-04-27 13:08:31,472 INFO L290 TraceCheckUtils]: 151: Hoare triple {13976#(and (not (<= (* 5 main_~y~0) main_~x~0)) (<= (* main_~y~0 4) main_~x~0) (= (+ main_~s~0 4) 0) (= main_~b~0 (+ (* main_~y~0 (- 4)) main_~x~0)) (= main_~q~0 1))} assume !false; {13976#(and (not (<= (* 5 main_~y~0) main_~x~0)) (<= (* main_~y~0 4) main_~x~0) (= (+ main_~s~0 4) 0) (= main_~b~0 (+ (* main_~y~0 (- 4)) main_~x~0)) (= main_~q~0 1))} is VALID [2022-04-27 13:08:31,472 INFO L290 TraceCheckUtils]: 152: Hoare triple {13976#(and (not (<= (* 5 main_~y~0) main_~x~0)) (<= (* main_~y~0 4) main_~x~0) (= (+ main_~s~0 4) 0) (= main_~b~0 (+ (* main_~y~0 (- 4)) main_~x~0)) (= main_~q~0 1))} assume !(0 != ~b~0); {13983#(and (< main_~x~0 (* 5 main_~y~0)) (= (+ main_~s~0 4) 0) (= main_~x~0 (* main_~y~0 4)) (= main_~q~0 1))} is VALID [2022-04-27 13:08:31,473 INFO L272 TraceCheckUtils]: 153: Hoare triple {13983#(and (< main_~x~0 (* 5 main_~y~0)) (= (+ main_~s~0 4) 0) (= main_~x~0 (* main_~y~0 4)) (= main_~q~0 1))} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {13987#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:08:31,473 INFO L290 TraceCheckUtils]: 154: Hoare triple {13987#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {13991#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:08:31,474 INFO L290 TraceCheckUtils]: 155: Hoare triple {13991#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {13512#false} is VALID [2022-04-27 13:08:31,474 INFO L290 TraceCheckUtils]: 156: Hoare triple {13512#false} assume !false; {13512#false} is VALID [2022-04-27 13:08:31,484 INFO L134 CoverageAnalysis]: Checked inductivity of 922 backedges. 87 proven. 72 refuted. 0 times theorem prover too weak. 763 trivial. 0 not checked. [2022-04-27 13:08:31,484 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:09:42,321 INFO L290 TraceCheckUtils]: 156: Hoare triple {13512#false} assume !false; {13512#false} is VALID [2022-04-27 13:09:42,321 INFO L290 TraceCheckUtils]: 155: Hoare triple {13991#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {13512#false} is VALID [2022-04-27 13:09:42,321 INFO L290 TraceCheckUtils]: 154: Hoare triple {13987#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {13991#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:09:42,322 INFO L272 TraceCheckUtils]: 153: Hoare triple {14007#(= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) 0)} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {13987#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:09:42,322 INFO L290 TraceCheckUtils]: 152: Hoare triple {14011#(or (not (= main_~b~0 0)) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) 0))} assume !(0 != ~b~0); {14007#(= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) 0)} is VALID [2022-04-27 13:09:42,322 INFO L290 TraceCheckUtils]: 151: Hoare triple {14011#(or (not (= main_~b~0 0)) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) 0))} assume !false; {14011#(or (not (= main_~b~0 0)) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) 0))} is VALID [2022-04-27 13:09:43,975 INFO L290 TraceCheckUtils]: 150: Hoare triple {14018#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (- 1) main_~k~0 main_~s~0) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) 0))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {14011#(or (not (= main_~b~0 0)) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) 0))} is VALID [2022-04-27 13:09:43,980 INFO L290 TraceCheckUtils]: 149: Hoare triple {14022#(or (not (= main_~c~0 0)) (<= main_~b~0 main_~c~0) (= (+ (* (+ (* (- 1) main_~k~0 main_~s~0) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) 0))} assume !(~c~0 >= ~b~0); {14018#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (- 1) main_~k~0 main_~s~0) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) 0))} is VALID [2022-04-27 13:09:43,981 INFO L284 TraceCheckUtils]: 148: Hoare quadruple {13511#true} {14022#(or (not (= main_~c~0 0)) (<= main_~b~0 main_~c~0) (= (+ (* (+ (* (- 1) main_~k~0 main_~s~0) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) 0))} #97#return; {14022#(or (not (= main_~c~0 0)) (<= main_~b~0 main_~c~0) (= (+ (* (+ (* (- 1) main_~k~0 main_~s~0) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) 0))} is VALID [2022-04-27 13:09:43,981 INFO L290 TraceCheckUtils]: 147: Hoare triple {13511#true} assume true; {13511#true} is VALID [2022-04-27 13:09:43,981 INFO L290 TraceCheckUtils]: 146: Hoare triple {13511#true} assume !(0 == ~cond); {13511#true} is VALID [2022-04-27 13:09:43,981 INFO L290 TraceCheckUtils]: 145: Hoare triple {13511#true} ~cond := #in~cond; {13511#true} is VALID [2022-04-27 13:09:43,981 INFO L272 TraceCheckUtils]: 144: Hoare triple {14022#(or (not (= main_~c~0 0)) (<= main_~b~0 main_~c~0) (= (+ (* (+ (* (- 1) main_~k~0 main_~s~0) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) 0))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {13511#true} is VALID [2022-04-27 13:09:43,981 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {13511#true} {14022#(or (not (= main_~c~0 0)) (<= main_~b~0 main_~c~0) (= (+ (* (+ (* (- 1) main_~k~0 main_~s~0) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) 0))} #95#return; {14022#(or (not (= main_~c~0 0)) (<= main_~b~0 main_~c~0) (= (+ (* (+ (* (- 1) main_~k~0 main_~s~0) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) 0))} is VALID [2022-04-27 13:09:43,981 INFO L290 TraceCheckUtils]: 142: Hoare triple {13511#true} assume true; {13511#true} is VALID [2022-04-27 13:09:43,981 INFO L290 TraceCheckUtils]: 141: Hoare triple {13511#true} assume !(0 == ~cond); {13511#true} is VALID [2022-04-27 13:09:43,981 INFO L290 TraceCheckUtils]: 140: Hoare triple {13511#true} ~cond := #in~cond; {13511#true} is VALID [2022-04-27 13:09:43,981 INFO L272 TraceCheckUtils]: 139: Hoare triple {14022#(or (not (= main_~c~0 0)) (<= main_~b~0 main_~c~0) (= (+ (* (+ (* (- 1) main_~k~0 main_~s~0) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) 0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {13511#true} is VALID [2022-04-27 13:09:43,982 INFO L284 TraceCheckUtils]: 138: Hoare quadruple {13511#true} {14022#(or (not (= main_~c~0 0)) (<= main_~b~0 main_~c~0) (= (+ (* (+ (* (- 1) main_~k~0 main_~s~0) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) 0))} #93#return; {14022#(or (not (= main_~c~0 0)) (<= main_~b~0 main_~c~0) (= (+ (* (+ (* (- 1) main_~k~0 main_~s~0) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) 0))} is VALID [2022-04-27 13:09:43,982 INFO L290 TraceCheckUtils]: 137: Hoare triple {13511#true} assume true; {13511#true} is VALID [2022-04-27 13:09:43,982 INFO L290 TraceCheckUtils]: 136: Hoare triple {13511#true} assume !(0 == ~cond); {13511#true} is VALID [2022-04-27 13:09:43,982 INFO L290 TraceCheckUtils]: 135: Hoare triple {13511#true} ~cond := #in~cond; {13511#true} is VALID [2022-04-27 13:09:43,982 INFO L272 TraceCheckUtils]: 134: Hoare triple {14022#(or (not (= main_~c~0 0)) (<= main_~b~0 main_~c~0) (= (+ (* (+ (* (- 1) main_~k~0 main_~s~0) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) 0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {13511#true} is VALID [2022-04-27 13:09:43,983 INFO L284 TraceCheckUtils]: 133: Hoare quadruple {13916#(not (= |__VERIFIER_assert_#in~cond| 0))} {14071#(or (not (= main_~c~0 0)) (<= main_~b~0 main_~c~0) (= (+ (* (+ (* (- 1) main_~k~0 main_~s~0) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) 0) (not (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))))} #91#return; {14022#(or (not (= main_~c~0 0)) (<= main_~b~0 main_~c~0) (= (+ (* (+ (* (- 1) main_~k~0 main_~s~0) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) 0))} is VALID [2022-04-27 13:09:43,983 INFO L290 TraceCheckUtils]: 132: Hoare triple {13916#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {13916#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:09:43,984 INFO L290 TraceCheckUtils]: 131: Hoare triple {14081#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {13916#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:09:43,984 INFO L290 TraceCheckUtils]: 130: Hoare triple {13511#true} ~cond := #in~cond; {14081#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 13:09:43,984 INFO L272 TraceCheckUtils]: 129: Hoare triple {14071#(or (not (= main_~c~0 0)) (<= main_~b~0 main_~c~0) (= (+ (* (+ (* (- 1) main_~k~0 main_~s~0) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) 0) (not (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {13511#true} is VALID [2022-04-27 13:09:43,984 INFO L290 TraceCheckUtils]: 128: Hoare triple {14071#(or (not (= main_~c~0 0)) (<= main_~b~0 main_~c~0) (= (+ (* (+ (* (- 1) main_~k~0 main_~s~0) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) 0) (not (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))))} assume !false; {14071#(or (not (= main_~c~0 0)) (<= main_~b~0 main_~c~0) (= (+ (* (+ (* (- 1) main_~k~0 main_~s~0) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) 0) (not (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))))} is VALID [2022-04-27 13:09:44,092 INFO L290 TraceCheckUtils]: 127: Hoare triple {14091#(or (<= main_~b~0 0) (= (+ (* main_~q~0 main_~x~0) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~c~0 main_~b~0)) (not (= main_~a~0 (+ main_~b~0 (* main_~b~0 main_~k~0)))))} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {14071#(or (not (= main_~c~0 0)) (<= main_~b~0 main_~c~0) (= (+ (* (+ (* (- 1) main_~k~0 main_~s~0) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) 0) (not (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))))} is VALID [2022-04-27 13:09:44,093 INFO L284 TraceCheckUtils]: 126: Hoare quadruple {13511#true} {14091#(or (<= main_~b~0 0) (= (+ (* main_~q~0 main_~x~0) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~c~0 main_~b~0)) (not (= main_~a~0 (+ main_~b~0 (* main_~b~0 main_~k~0)))))} #97#return; {14091#(or (<= main_~b~0 0) (= (+ (* main_~q~0 main_~x~0) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~c~0 main_~b~0)) (not (= main_~a~0 (+ main_~b~0 (* main_~b~0 main_~k~0)))))} is VALID [2022-04-27 13:09:44,093 INFO L290 TraceCheckUtils]: 125: Hoare triple {13511#true} assume true; {13511#true} is VALID [2022-04-27 13:09:44,093 INFO L290 TraceCheckUtils]: 124: Hoare triple {13511#true} assume !(0 == ~cond); {13511#true} is VALID [2022-04-27 13:09:44,093 INFO L290 TraceCheckUtils]: 123: Hoare triple {13511#true} ~cond := #in~cond; {13511#true} is VALID [2022-04-27 13:09:44,093 INFO L272 TraceCheckUtils]: 122: Hoare triple {14091#(or (<= main_~b~0 0) (= (+ (* main_~q~0 main_~x~0) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~c~0 main_~b~0)) (not (= main_~a~0 (+ main_~b~0 (* main_~b~0 main_~k~0)))))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {13511#true} is VALID [2022-04-27 13:09:44,094 INFO L284 TraceCheckUtils]: 121: Hoare quadruple {13511#true} {14091#(or (<= main_~b~0 0) (= (+ (* main_~q~0 main_~x~0) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~c~0 main_~b~0)) (not (= main_~a~0 (+ main_~b~0 (* main_~b~0 main_~k~0)))))} #95#return; {14091#(or (<= main_~b~0 0) (= (+ (* main_~q~0 main_~x~0) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~c~0 main_~b~0)) (not (= main_~a~0 (+ main_~b~0 (* main_~b~0 main_~k~0)))))} is VALID [2022-04-27 13:09:44,094 INFO L290 TraceCheckUtils]: 120: Hoare triple {13511#true} assume true; {13511#true} is VALID [2022-04-27 13:09:44,094 INFO L290 TraceCheckUtils]: 119: Hoare triple {13511#true} assume !(0 == ~cond); {13511#true} is VALID [2022-04-27 13:09:44,094 INFO L290 TraceCheckUtils]: 118: Hoare triple {13511#true} ~cond := #in~cond; {13511#true} is VALID [2022-04-27 13:09:44,094 INFO L272 TraceCheckUtils]: 117: Hoare triple {14091#(or (<= main_~b~0 0) (= (+ (* main_~q~0 main_~x~0) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~c~0 main_~b~0)) (not (= main_~a~0 (+ main_~b~0 (* main_~b~0 main_~k~0)))))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {13511#true} is VALID [2022-04-27 13:09:44,094 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {13511#true} {14091#(or (<= main_~b~0 0) (= (+ (* main_~q~0 main_~x~0) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~c~0 main_~b~0)) (not (= main_~a~0 (+ main_~b~0 (* main_~b~0 main_~k~0)))))} #93#return; {14091#(or (<= main_~b~0 0) (= (+ (* main_~q~0 main_~x~0) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~c~0 main_~b~0)) (not (= main_~a~0 (+ main_~b~0 (* main_~b~0 main_~k~0)))))} is VALID [2022-04-27 13:09:44,095 INFO L290 TraceCheckUtils]: 115: Hoare triple {13511#true} assume true; {13511#true} is VALID [2022-04-27 13:09:44,095 INFO L290 TraceCheckUtils]: 114: Hoare triple {13511#true} assume !(0 == ~cond); {13511#true} is VALID [2022-04-27 13:09:44,095 INFO L290 TraceCheckUtils]: 113: Hoare triple {13511#true} ~cond := #in~cond; {13511#true} is VALID [2022-04-27 13:09:44,095 INFO L272 TraceCheckUtils]: 112: Hoare triple {14091#(or (<= main_~b~0 0) (= (+ (* main_~q~0 main_~x~0) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~c~0 main_~b~0)) (not (= main_~a~0 (+ main_~b~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)); {13511#true} is VALID [2022-04-27 13:09:44,095 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {13511#true} {14091#(or (<= main_~b~0 0) (= (+ (* main_~q~0 main_~x~0) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~c~0 main_~b~0)) (not (= main_~a~0 (+ main_~b~0 (* main_~b~0 main_~k~0)))))} #91#return; {14091#(or (<= main_~b~0 0) (= (+ (* main_~q~0 main_~x~0) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~c~0 main_~b~0)) (not (= main_~a~0 (+ main_~b~0 (* main_~b~0 main_~k~0)))))} is VALID [2022-04-27 13:09:44,095 INFO L290 TraceCheckUtils]: 110: Hoare triple {13511#true} assume true; {13511#true} is VALID [2022-04-27 13:09:44,095 INFO L290 TraceCheckUtils]: 109: Hoare triple {13511#true} assume !(0 == ~cond); {13511#true} is VALID [2022-04-27 13:09:44,095 INFO L290 TraceCheckUtils]: 108: Hoare triple {13511#true} ~cond := #in~cond; {13511#true} is VALID [2022-04-27 13:09:44,095 INFO L272 TraceCheckUtils]: 107: Hoare triple {14091#(or (<= main_~b~0 0) (= (+ (* main_~q~0 main_~x~0) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~c~0 main_~b~0)) (not (= main_~a~0 (+ main_~b~0 (* main_~b~0 main_~k~0)))))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {13511#true} is VALID [2022-04-27 13:09:44,096 INFO L290 TraceCheckUtils]: 106: Hoare triple {14091#(or (<= main_~b~0 0) (= (+ (* main_~q~0 main_~x~0) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~c~0 main_~b~0)) (not (= main_~a~0 (+ main_~b~0 (* main_~b~0 main_~k~0)))))} assume !false; {14091#(or (<= main_~b~0 0) (= (+ (* main_~q~0 main_~x~0) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~c~0 main_~b~0)) (not (= main_~a~0 (+ main_~b~0 (* main_~b~0 main_~k~0)))))} is VALID [2022-04-27 13:09:44,141 INFO L290 TraceCheckUtils]: 105: Hoare triple {14158#(or (not (= (+ main_~b~0 (* (+ main_~k~0 1) main_~b~0)) main_~a~0)) (not (= main_~b~0 (+ main_~c~0 (* (- 1) main_~b~0)))) (<= main_~b~0 0) (= (+ (* (+ main_~k~0 1) main_~q~0 main_~x~0) (* main_~q~0 main_~x~0) (* (+ main_~k~0 1) main_~y~0 main_~s~0) (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {14091#(or (<= main_~b~0 0) (= (+ (* main_~q~0 main_~x~0) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~c~0 main_~b~0)) (not (= main_~a~0 (+ main_~b~0 (* main_~b~0 main_~k~0)))))} is VALID [2022-04-27 13:09:44,142 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {13511#true} {14158#(or (not (= (+ main_~b~0 (* (+ main_~k~0 1) main_~b~0)) main_~a~0)) (not (= main_~b~0 (+ main_~c~0 (* (- 1) main_~b~0)))) (<= main_~b~0 0) (= (+ (* (+ main_~k~0 1) main_~q~0 main_~x~0) (* main_~q~0 main_~x~0) (* (+ main_~k~0 1) main_~y~0 main_~s~0) (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} #97#return; {14158#(or (not (= (+ main_~b~0 (* (+ main_~k~0 1) main_~b~0)) main_~a~0)) (not (= main_~b~0 (+ main_~c~0 (* (- 1) main_~b~0)))) (<= main_~b~0 0) (= (+ (* (+ main_~k~0 1) main_~q~0 main_~x~0) (* main_~q~0 main_~x~0) (* (+ main_~k~0 1) main_~y~0 main_~s~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:09:44,142 INFO L290 TraceCheckUtils]: 103: Hoare triple {13511#true} assume true; {13511#true} is VALID [2022-04-27 13:09:44,142 INFO L290 TraceCheckUtils]: 102: Hoare triple {13511#true} assume !(0 == ~cond); {13511#true} is VALID [2022-04-27 13:09:44,142 INFO L290 TraceCheckUtils]: 101: Hoare triple {13511#true} ~cond := #in~cond; {13511#true} is VALID [2022-04-27 13:09:44,142 INFO L272 TraceCheckUtils]: 100: Hoare triple {14158#(or (not (= (+ main_~b~0 (* (+ main_~k~0 1) main_~b~0)) main_~a~0)) (not (= main_~b~0 (+ main_~c~0 (* (- 1) main_~b~0)))) (<= main_~b~0 0) (= (+ (* (+ main_~k~0 1) main_~q~0 main_~x~0) (* main_~q~0 main_~x~0) (* (+ main_~k~0 1) main_~y~0 main_~s~0) (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {13511#true} is VALID [2022-04-27 13:09:44,142 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {13511#true} {14158#(or (not (= (+ main_~b~0 (* (+ main_~k~0 1) main_~b~0)) main_~a~0)) (not (= main_~b~0 (+ main_~c~0 (* (- 1) main_~b~0)))) (<= main_~b~0 0) (= (+ (* (+ main_~k~0 1) main_~q~0 main_~x~0) (* main_~q~0 main_~x~0) (* (+ main_~k~0 1) main_~y~0 main_~s~0) (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} #95#return; {14158#(or (not (= (+ main_~b~0 (* (+ main_~k~0 1) main_~b~0)) main_~a~0)) (not (= main_~b~0 (+ main_~c~0 (* (- 1) main_~b~0)))) (<= main_~b~0 0) (= (+ (* (+ main_~k~0 1) main_~q~0 main_~x~0) (* main_~q~0 main_~x~0) (* (+ main_~k~0 1) main_~y~0 main_~s~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:09:44,142 INFO L290 TraceCheckUtils]: 98: Hoare triple {13511#true} assume true; {13511#true} is VALID [2022-04-27 13:09:44,143 INFO L290 TraceCheckUtils]: 97: Hoare triple {13511#true} assume !(0 == ~cond); {13511#true} is VALID [2022-04-27 13:09:44,143 INFO L290 TraceCheckUtils]: 96: Hoare triple {13511#true} ~cond := #in~cond; {13511#true} is VALID [2022-04-27 13:09:44,143 INFO L272 TraceCheckUtils]: 95: Hoare triple {14158#(or (not (= (+ main_~b~0 (* (+ main_~k~0 1) main_~b~0)) main_~a~0)) (not (= main_~b~0 (+ main_~c~0 (* (- 1) main_~b~0)))) (<= main_~b~0 0) (= (+ (* (+ main_~k~0 1) main_~q~0 main_~x~0) (* main_~q~0 main_~x~0) (* (+ main_~k~0 1) main_~y~0 main_~s~0) (* main_~y~0 main_~s~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)); {13511#true} is VALID [2022-04-27 13:09:44,143 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {13511#true} {14158#(or (not (= (+ main_~b~0 (* (+ main_~k~0 1) main_~b~0)) main_~a~0)) (not (= main_~b~0 (+ main_~c~0 (* (- 1) main_~b~0)))) (<= main_~b~0 0) (= (+ (* (+ main_~k~0 1) main_~q~0 main_~x~0) (* main_~q~0 main_~x~0) (* (+ main_~k~0 1) main_~y~0 main_~s~0) (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} #93#return; {14158#(or (not (= (+ main_~b~0 (* (+ main_~k~0 1) main_~b~0)) main_~a~0)) (not (= main_~b~0 (+ main_~c~0 (* (- 1) main_~b~0)))) (<= main_~b~0 0) (= (+ (* (+ main_~k~0 1) main_~q~0 main_~x~0) (* main_~q~0 main_~x~0) (* (+ main_~k~0 1) main_~y~0 main_~s~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:09:44,143 INFO L290 TraceCheckUtils]: 93: Hoare triple {13511#true} assume true; {13511#true} is VALID [2022-04-27 13:09:44,143 INFO L290 TraceCheckUtils]: 92: Hoare triple {13511#true} assume !(0 == ~cond); {13511#true} is VALID [2022-04-27 13:09:44,143 INFO L290 TraceCheckUtils]: 91: Hoare triple {13511#true} ~cond := #in~cond; {13511#true} is VALID [2022-04-27 13:09:44,143 INFO L272 TraceCheckUtils]: 90: Hoare triple {14158#(or (not (= (+ main_~b~0 (* (+ main_~k~0 1) main_~b~0)) main_~a~0)) (not (= main_~b~0 (+ main_~c~0 (* (- 1) main_~b~0)))) (<= main_~b~0 0) (= (+ (* (+ main_~k~0 1) main_~q~0 main_~x~0) (* main_~q~0 main_~x~0) (* (+ main_~k~0 1) main_~y~0 main_~s~0) (* main_~y~0 main_~s~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)); {13511#true} is VALID [2022-04-27 13:09:44,144 INFO L284 TraceCheckUtils]: 89: Hoare quadruple {13511#true} {14158#(or (not (= (+ main_~b~0 (* (+ main_~k~0 1) main_~b~0)) main_~a~0)) (not (= main_~b~0 (+ main_~c~0 (* (- 1) main_~b~0)))) (<= main_~b~0 0) (= (+ (* (+ main_~k~0 1) main_~q~0 main_~x~0) (* main_~q~0 main_~x~0) (* (+ main_~k~0 1) main_~y~0 main_~s~0) (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} #91#return; {14158#(or (not (= (+ main_~b~0 (* (+ main_~k~0 1) main_~b~0)) main_~a~0)) (not (= main_~b~0 (+ main_~c~0 (* (- 1) main_~b~0)))) (<= main_~b~0 0) (= (+ (* (+ main_~k~0 1) main_~q~0 main_~x~0) (* main_~q~0 main_~x~0) (* (+ main_~k~0 1) main_~y~0 main_~s~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:09:44,144 INFO L290 TraceCheckUtils]: 88: Hoare triple {13511#true} assume true; {13511#true} is VALID [2022-04-27 13:09:44,144 INFO L290 TraceCheckUtils]: 87: Hoare triple {13511#true} assume !(0 == ~cond); {13511#true} is VALID [2022-04-27 13:09:44,144 INFO L290 TraceCheckUtils]: 86: Hoare triple {13511#true} ~cond := #in~cond; {13511#true} is VALID [2022-04-27 13:09:44,144 INFO L272 TraceCheckUtils]: 85: Hoare triple {14158#(or (not (= (+ main_~b~0 (* (+ main_~k~0 1) main_~b~0)) main_~a~0)) (not (= main_~b~0 (+ main_~c~0 (* (- 1) main_~b~0)))) (<= main_~b~0 0) (= (+ (* (+ main_~k~0 1) main_~q~0 main_~x~0) (* main_~q~0 main_~x~0) (* (+ main_~k~0 1) main_~y~0 main_~s~0) (* main_~y~0 main_~s~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)); {13511#true} is VALID [2022-04-27 13:09:44,145 INFO L290 TraceCheckUtils]: 84: Hoare triple {14158#(or (not (= (+ main_~b~0 (* (+ main_~k~0 1) main_~b~0)) main_~a~0)) (not (= main_~b~0 (+ main_~c~0 (* (- 1) main_~b~0)))) (<= main_~b~0 0) (= (+ (* (+ main_~k~0 1) main_~q~0 main_~x~0) (* main_~q~0 main_~x~0) (* (+ main_~k~0 1) main_~y~0 main_~s~0) (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} assume !false; {14158#(or (not (= (+ main_~b~0 (* (+ main_~k~0 1) main_~b~0)) main_~a~0)) (not (= main_~b~0 (+ main_~c~0 (* (- 1) main_~b~0)))) (<= main_~b~0 0) (= (+ (* (+ main_~k~0 1) main_~q~0 main_~x~0) (* main_~q~0 main_~x~0) (* (+ main_~k~0 1) main_~y~0 main_~s~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:09:44,240 INFO L290 TraceCheckUtils]: 83: Hoare triple {14225#(or (not (= (+ (* (- 2) main_~b~0) main_~c~0) main_~b~0)) (not (= main_~a~0 (+ main_~b~0 (* (+ main_~k~0 2) main_~b~0)))) (<= main_~b~0 0) (= (+ (* (+ main_~k~0 2) main_~y~0 main_~s~0) (* main_~q~0 main_~x~0) (* (+ main_~k~0 2) main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {14158#(or (not (= (+ main_~b~0 (* (+ main_~k~0 1) main_~b~0)) main_~a~0)) (not (= main_~b~0 (+ main_~c~0 (* (- 1) main_~b~0)))) (<= main_~b~0 0) (= (+ (* (+ main_~k~0 1) main_~q~0 main_~x~0) (* main_~q~0 main_~x~0) (* (+ main_~k~0 1) main_~y~0 main_~s~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:09:44,241 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {13511#true} {14225#(or (not (= (+ (* (- 2) main_~b~0) main_~c~0) main_~b~0)) (not (= main_~a~0 (+ main_~b~0 (* (+ main_~k~0 2) main_~b~0)))) (<= main_~b~0 0) (= (+ (* (+ main_~k~0 2) main_~y~0 main_~s~0) (* main_~q~0 main_~x~0) (* (+ main_~k~0 2) main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} #97#return; {14225#(or (not (= (+ (* (- 2) main_~b~0) main_~c~0) main_~b~0)) (not (= main_~a~0 (+ main_~b~0 (* (+ main_~k~0 2) main_~b~0)))) (<= main_~b~0 0) (= (+ (* (+ main_~k~0 2) main_~y~0 main_~s~0) (* main_~q~0 main_~x~0) (* (+ main_~k~0 2) main_~q~0 main_~x~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:09:44,241 INFO L290 TraceCheckUtils]: 81: Hoare triple {13511#true} assume true; {13511#true} is VALID [2022-04-27 13:09:44,241 INFO L290 TraceCheckUtils]: 80: Hoare triple {13511#true} assume !(0 == ~cond); {13511#true} is VALID [2022-04-27 13:09:44,241 INFO L290 TraceCheckUtils]: 79: Hoare triple {13511#true} ~cond := #in~cond; {13511#true} is VALID [2022-04-27 13:09:44,241 INFO L272 TraceCheckUtils]: 78: Hoare triple {14225#(or (not (= (+ (* (- 2) main_~b~0) main_~c~0) main_~b~0)) (not (= main_~a~0 (+ main_~b~0 (* (+ main_~k~0 2) main_~b~0)))) (<= main_~b~0 0) (= (+ (* (+ main_~k~0 2) main_~y~0 main_~s~0) (* main_~q~0 main_~x~0) (* (+ main_~k~0 2) main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {13511#true} is VALID [2022-04-27 13:09:44,242 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {13511#true} {14225#(or (not (= (+ (* (- 2) main_~b~0) main_~c~0) main_~b~0)) (not (= main_~a~0 (+ main_~b~0 (* (+ main_~k~0 2) main_~b~0)))) (<= main_~b~0 0) (= (+ (* (+ main_~k~0 2) main_~y~0 main_~s~0) (* main_~q~0 main_~x~0) (* (+ main_~k~0 2) main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} #95#return; {14225#(or (not (= (+ (* (- 2) main_~b~0) main_~c~0) main_~b~0)) (not (= main_~a~0 (+ main_~b~0 (* (+ main_~k~0 2) main_~b~0)))) (<= main_~b~0 0) (= (+ (* (+ main_~k~0 2) main_~y~0 main_~s~0) (* main_~q~0 main_~x~0) (* (+ main_~k~0 2) main_~q~0 main_~x~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:09:44,242 INFO L290 TraceCheckUtils]: 76: Hoare triple {13511#true} assume true; {13511#true} is VALID [2022-04-27 13:09:44,242 INFO L290 TraceCheckUtils]: 75: Hoare triple {13511#true} assume !(0 == ~cond); {13511#true} is VALID [2022-04-27 13:09:44,242 INFO L290 TraceCheckUtils]: 74: Hoare triple {13511#true} ~cond := #in~cond; {13511#true} is VALID [2022-04-27 13:09:44,242 INFO L272 TraceCheckUtils]: 73: Hoare triple {14225#(or (not (= (+ (* (- 2) main_~b~0) main_~c~0) main_~b~0)) (not (= main_~a~0 (+ main_~b~0 (* (+ main_~k~0 2) main_~b~0)))) (<= main_~b~0 0) (= (+ (* (+ main_~k~0 2) main_~y~0 main_~s~0) (* main_~q~0 main_~x~0) (* (+ main_~k~0 2) main_~q~0 main_~x~0) (* main_~y~0 main_~s~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)); {13511#true} is VALID [2022-04-27 13:09:44,242 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {13511#true} {14225#(or (not (= (+ (* (- 2) main_~b~0) main_~c~0) main_~b~0)) (not (= main_~a~0 (+ main_~b~0 (* (+ main_~k~0 2) main_~b~0)))) (<= main_~b~0 0) (= (+ (* (+ main_~k~0 2) main_~y~0 main_~s~0) (* main_~q~0 main_~x~0) (* (+ main_~k~0 2) main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} #93#return; {14225#(or (not (= (+ (* (- 2) main_~b~0) main_~c~0) main_~b~0)) (not (= main_~a~0 (+ main_~b~0 (* (+ main_~k~0 2) main_~b~0)))) (<= main_~b~0 0) (= (+ (* (+ main_~k~0 2) main_~y~0 main_~s~0) (* main_~q~0 main_~x~0) (* (+ main_~k~0 2) main_~q~0 main_~x~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:09:44,242 INFO L290 TraceCheckUtils]: 71: Hoare triple {13511#true} assume true; {13511#true} is VALID [2022-04-27 13:09:44,242 INFO L290 TraceCheckUtils]: 70: Hoare triple {13511#true} assume !(0 == ~cond); {13511#true} is VALID [2022-04-27 13:09:44,243 INFO L290 TraceCheckUtils]: 69: Hoare triple {13511#true} ~cond := #in~cond; {13511#true} is VALID [2022-04-27 13:09:44,243 INFO L272 TraceCheckUtils]: 68: Hoare triple {14225#(or (not (= (+ (* (- 2) main_~b~0) main_~c~0) main_~b~0)) (not (= main_~a~0 (+ main_~b~0 (* (+ main_~k~0 2) main_~b~0)))) (<= main_~b~0 0) (= (+ (* (+ main_~k~0 2) main_~y~0 main_~s~0) (* main_~q~0 main_~x~0) (* (+ main_~k~0 2) main_~q~0 main_~x~0) (* main_~y~0 main_~s~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)); {13511#true} is VALID [2022-04-27 13:09:44,243 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {13511#true} {14225#(or (not (= (+ (* (- 2) main_~b~0) main_~c~0) main_~b~0)) (not (= main_~a~0 (+ main_~b~0 (* (+ main_~k~0 2) main_~b~0)))) (<= main_~b~0 0) (= (+ (* (+ main_~k~0 2) main_~y~0 main_~s~0) (* main_~q~0 main_~x~0) (* (+ main_~k~0 2) main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} #91#return; {14225#(or (not (= (+ (* (- 2) main_~b~0) main_~c~0) main_~b~0)) (not (= main_~a~0 (+ main_~b~0 (* (+ main_~k~0 2) main_~b~0)))) (<= main_~b~0 0) (= (+ (* (+ main_~k~0 2) main_~y~0 main_~s~0) (* main_~q~0 main_~x~0) (* (+ main_~k~0 2) main_~q~0 main_~x~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:09:44,243 INFO L290 TraceCheckUtils]: 66: Hoare triple {13511#true} assume true; {13511#true} is VALID [2022-04-27 13:09:44,243 INFO L290 TraceCheckUtils]: 65: Hoare triple {13511#true} assume !(0 == ~cond); {13511#true} is VALID [2022-04-27 13:09:44,243 INFO L290 TraceCheckUtils]: 64: Hoare triple {13511#true} ~cond := #in~cond; {13511#true} is VALID [2022-04-27 13:09:44,243 INFO L272 TraceCheckUtils]: 63: Hoare triple {14225#(or (not (= (+ (* (- 2) main_~b~0) main_~c~0) main_~b~0)) (not (= main_~a~0 (+ main_~b~0 (* (+ main_~k~0 2) main_~b~0)))) (<= main_~b~0 0) (= (+ (* (+ main_~k~0 2) main_~y~0 main_~s~0) (* main_~q~0 main_~x~0) (* (+ main_~k~0 2) main_~q~0 main_~x~0) (* main_~y~0 main_~s~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)); {13511#true} is VALID [2022-04-27 13:09:44,244 INFO L290 TraceCheckUtils]: 62: Hoare triple {14225#(or (not (= (+ (* (- 2) main_~b~0) main_~c~0) main_~b~0)) (not (= main_~a~0 (+ main_~b~0 (* (+ main_~k~0 2) main_~b~0)))) (<= main_~b~0 0) (= (+ (* (+ main_~k~0 2) main_~y~0 main_~s~0) (* main_~q~0 main_~x~0) (* (+ main_~k~0 2) main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} assume !false; {14225#(or (not (= (+ (* (- 2) main_~b~0) main_~c~0) main_~b~0)) (not (= main_~a~0 (+ main_~b~0 (* (+ main_~k~0 2) main_~b~0)))) (<= main_~b~0 0) (= (+ (* (+ main_~k~0 2) main_~y~0 main_~s~0) (* main_~q~0 main_~x~0) (* (+ main_~k~0 2) main_~q~0 main_~x~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:09:44,361 INFO L290 TraceCheckUtils]: 61: Hoare triple {14292#(or (= (+ (* main_~q~0 main_~x~0) (* main_~q~0 main_~x~0 (+ main_~k~0 3)) (* main_~y~0 main_~s~0) (* main_~y~0 main_~s~0 (+ main_~k~0 3))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (<= main_~b~0 0) (not (= (+ main_~c~0 (* (- 1) main_~b~0)) (* main_~b~0 3))) (not (= main_~a~0 (+ main_~b~0 (* main_~b~0 (+ main_~k~0 3))))))} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {14225#(or (not (= (+ (* (- 2) main_~b~0) main_~c~0) main_~b~0)) (not (= main_~a~0 (+ main_~b~0 (* (+ main_~k~0 2) main_~b~0)))) (<= main_~b~0 0) (= (+ (* (+ main_~k~0 2) main_~y~0 main_~s~0) (* main_~q~0 main_~x~0) (* (+ main_~k~0 2) main_~q~0 main_~x~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:09:44,362 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {13511#true} {14292#(or (= (+ (* main_~q~0 main_~x~0) (* main_~q~0 main_~x~0 (+ main_~k~0 3)) (* main_~y~0 main_~s~0) (* main_~y~0 main_~s~0 (+ main_~k~0 3))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (<= main_~b~0 0) (not (= (+ main_~c~0 (* (- 1) main_~b~0)) (* main_~b~0 3))) (not (= main_~a~0 (+ main_~b~0 (* main_~b~0 (+ main_~k~0 3))))))} #97#return; {14292#(or (= (+ (* main_~q~0 main_~x~0) (* main_~q~0 main_~x~0 (+ main_~k~0 3)) (* main_~y~0 main_~s~0) (* main_~y~0 main_~s~0 (+ main_~k~0 3))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (<= main_~b~0 0) (not (= (+ main_~c~0 (* (- 1) main_~b~0)) (* main_~b~0 3))) (not (= main_~a~0 (+ main_~b~0 (* main_~b~0 (+ main_~k~0 3))))))} is VALID [2022-04-27 13:09:44,362 INFO L290 TraceCheckUtils]: 59: Hoare triple {13511#true} assume true; {13511#true} is VALID [2022-04-27 13:09:44,362 INFO L290 TraceCheckUtils]: 58: Hoare triple {13511#true} assume !(0 == ~cond); {13511#true} is VALID [2022-04-27 13:09:44,362 INFO L290 TraceCheckUtils]: 57: Hoare triple {13511#true} ~cond := #in~cond; {13511#true} is VALID [2022-04-27 13:09:44,362 INFO L272 TraceCheckUtils]: 56: Hoare triple {14292#(or (= (+ (* main_~q~0 main_~x~0) (* main_~q~0 main_~x~0 (+ main_~k~0 3)) (* main_~y~0 main_~s~0) (* main_~y~0 main_~s~0 (+ main_~k~0 3))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (<= main_~b~0 0) (not (= (+ main_~c~0 (* (- 1) main_~b~0)) (* main_~b~0 3))) (not (= main_~a~0 (+ main_~b~0 (* main_~b~0 (+ main_~k~0 3))))))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {13511#true} is VALID [2022-04-27 13:09:44,363 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {13511#true} {14292#(or (= (+ (* main_~q~0 main_~x~0) (* main_~q~0 main_~x~0 (+ main_~k~0 3)) (* main_~y~0 main_~s~0) (* main_~y~0 main_~s~0 (+ main_~k~0 3))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (<= main_~b~0 0) (not (= (+ main_~c~0 (* (- 1) main_~b~0)) (* main_~b~0 3))) (not (= main_~a~0 (+ main_~b~0 (* main_~b~0 (+ main_~k~0 3))))))} #95#return; {14292#(or (= (+ (* main_~q~0 main_~x~0) (* main_~q~0 main_~x~0 (+ main_~k~0 3)) (* main_~y~0 main_~s~0) (* main_~y~0 main_~s~0 (+ main_~k~0 3))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (<= main_~b~0 0) (not (= (+ main_~c~0 (* (- 1) main_~b~0)) (* main_~b~0 3))) (not (= main_~a~0 (+ main_~b~0 (* main_~b~0 (+ main_~k~0 3))))))} is VALID [2022-04-27 13:09:44,363 INFO L290 TraceCheckUtils]: 54: Hoare triple {13511#true} assume true; {13511#true} is VALID [2022-04-27 13:09:44,363 INFO L290 TraceCheckUtils]: 53: Hoare triple {13511#true} assume !(0 == ~cond); {13511#true} is VALID [2022-04-27 13:09:44,363 INFO L290 TraceCheckUtils]: 52: Hoare triple {13511#true} ~cond := #in~cond; {13511#true} is VALID [2022-04-27 13:09:44,363 INFO L272 TraceCheckUtils]: 51: Hoare triple {14292#(or (= (+ (* main_~q~0 main_~x~0) (* main_~q~0 main_~x~0 (+ main_~k~0 3)) (* main_~y~0 main_~s~0) (* main_~y~0 main_~s~0 (+ main_~k~0 3))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (<= main_~b~0 0) (not (= (+ main_~c~0 (* (- 1) main_~b~0)) (* main_~b~0 3))) (not (= main_~a~0 (+ main_~b~0 (* main_~b~0 (+ main_~k~0 3))))))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {13511#true} is VALID [2022-04-27 13:09:44,364 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {13511#true} {14292#(or (= (+ (* main_~q~0 main_~x~0) (* main_~q~0 main_~x~0 (+ main_~k~0 3)) (* main_~y~0 main_~s~0) (* main_~y~0 main_~s~0 (+ main_~k~0 3))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (<= main_~b~0 0) (not (= (+ main_~c~0 (* (- 1) main_~b~0)) (* main_~b~0 3))) (not (= main_~a~0 (+ main_~b~0 (* main_~b~0 (+ main_~k~0 3))))))} #93#return; {14292#(or (= (+ (* main_~q~0 main_~x~0) (* main_~q~0 main_~x~0 (+ main_~k~0 3)) (* main_~y~0 main_~s~0) (* main_~y~0 main_~s~0 (+ main_~k~0 3))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (<= main_~b~0 0) (not (= (+ main_~c~0 (* (- 1) main_~b~0)) (* main_~b~0 3))) (not (= main_~a~0 (+ main_~b~0 (* main_~b~0 (+ main_~k~0 3))))))} is VALID [2022-04-27 13:09:44,364 INFO L290 TraceCheckUtils]: 49: Hoare triple {13511#true} assume true; {13511#true} is VALID [2022-04-27 13:09:44,364 INFO L290 TraceCheckUtils]: 48: Hoare triple {13511#true} assume !(0 == ~cond); {13511#true} is VALID [2022-04-27 13:09:44,364 INFO L290 TraceCheckUtils]: 47: Hoare triple {13511#true} ~cond := #in~cond; {13511#true} is VALID [2022-04-27 13:09:44,364 INFO L272 TraceCheckUtils]: 46: Hoare triple {14292#(or (= (+ (* main_~q~0 main_~x~0) (* main_~q~0 main_~x~0 (+ main_~k~0 3)) (* main_~y~0 main_~s~0) (* main_~y~0 main_~s~0 (+ main_~k~0 3))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (<= main_~b~0 0) (not (= (+ main_~c~0 (* (- 1) main_~b~0)) (* main_~b~0 3))) (not (= main_~a~0 (+ main_~b~0 (* main_~b~0 (+ main_~k~0 3))))))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {13511#true} is VALID [2022-04-27 13:09:44,364 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {13511#true} {14292#(or (= (+ (* main_~q~0 main_~x~0) (* main_~q~0 main_~x~0 (+ main_~k~0 3)) (* main_~y~0 main_~s~0) (* main_~y~0 main_~s~0 (+ main_~k~0 3))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (<= main_~b~0 0) (not (= (+ main_~c~0 (* (- 1) main_~b~0)) (* main_~b~0 3))) (not (= main_~a~0 (+ main_~b~0 (* main_~b~0 (+ main_~k~0 3))))))} #91#return; {14292#(or (= (+ (* main_~q~0 main_~x~0) (* main_~q~0 main_~x~0 (+ main_~k~0 3)) (* main_~y~0 main_~s~0) (* main_~y~0 main_~s~0 (+ main_~k~0 3))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (<= main_~b~0 0) (not (= (+ main_~c~0 (* (- 1) main_~b~0)) (* main_~b~0 3))) (not (= main_~a~0 (+ main_~b~0 (* main_~b~0 (+ main_~k~0 3))))))} is VALID [2022-04-27 13:09:44,364 INFO L290 TraceCheckUtils]: 44: Hoare triple {13511#true} assume true; {13511#true} is VALID [2022-04-27 13:09:44,364 INFO L290 TraceCheckUtils]: 43: Hoare triple {13511#true} assume !(0 == ~cond); {13511#true} is VALID [2022-04-27 13:09:44,365 INFO L290 TraceCheckUtils]: 42: Hoare triple {13511#true} ~cond := #in~cond; {13511#true} is VALID [2022-04-27 13:09:44,365 INFO L272 TraceCheckUtils]: 41: Hoare triple {14292#(or (= (+ (* main_~q~0 main_~x~0) (* main_~q~0 main_~x~0 (+ main_~k~0 3)) (* main_~y~0 main_~s~0) (* main_~y~0 main_~s~0 (+ main_~k~0 3))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (<= main_~b~0 0) (not (= (+ main_~c~0 (* (- 1) main_~b~0)) (* main_~b~0 3))) (not (= main_~a~0 (+ main_~b~0 (* main_~b~0 (+ main_~k~0 3))))))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {13511#true} is VALID [2022-04-27 13:09:44,365 INFO L290 TraceCheckUtils]: 40: Hoare triple {14292#(or (= (+ (* main_~q~0 main_~x~0) (* main_~q~0 main_~x~0 (+ main_~k~0 3)) (* main_~y~0 main_~s~0) (* main_~y~0 main_~s~0 (+ main_~k~0 3))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (<= main_~b~0 0) (not (= (+ main_~c~0 (* (- 1) main_~b~0)) (* main_~b~0 3))) (not (= main_~a~0 (+ main_~b~0 (* main_~b~0 (+ main_~k~0 3))))))} assume !false; {14292#(or (= (+ (* main_~q~0 main_~x~0) (* main_~q~0 main_~x~0 (+ main_~k~0 3)) (* main_~y~0 main_~s~0) (* main_~y~0 main_~s~0 (+ main_~k~0 3))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (<= main_~b~0 0) (not (= (+ main_~c~0 (* (- 1) main_~b~0)) (* main_~b~0 3))) (not (= main_~a~0 (+ main_~b~0 (* main_~b~0 (+ main_~k~0 3))))))} is VALID [2022-04-27 13:09:44,366 INFO L290 TraceCheckUtils]: 39: Hoare triple {14359#(or (<= main_~b~0 0) (= (+ (* (* main_~q~0 main_~x~0) 4) (* 4 (* main_~y~0 main_~s~0))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~a~0 (* main_~b~0 4))))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {14292#(or (= (+ (* main_~q~0 main_~x~0) (* main_~q~0 main_~x~0 (+ main_~k~0 3)) (* main_~y~0 main_~s~0) (* main_~y~0 main_~s~0 (+ main_~k~0 3))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (<= main_~b~0 0) (not (= (+ main_~c~0 (* (- 1) main_~b~0)) (* main_~b~0 3))) (not (= main_~a~0 (+ main_~b~0 (* main_~b~0 (+ main_~k~0 3))))))} is VALID [2022-04-27 13:09:44,366 INFO L290 TraceCheckUtils]: 38: Hoare triple {14359#(or (<= main_~b~0 0) (= (+ (* (* main_~q~0 main_~x~0) 4) (* 4 (* main_~y~0 main_~s~0))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~a~0 (* main_~b~0 4))))} assume !false; {14359#(or (<= main_~b~0 0) (= (+ (* (* main_~q~0 main_~x~0) 4) (* 4 (* main_~y~0 main_~s~0))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~a~0 (* main_~b~0 4))))} is VALID [2022-04-27 13:09:44,367 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {13511#true} {14359#(or (<= main_~b~0 0) (= (+ (* (* main_~q~0 main_~x~0) 4) (* 4 (* main_~y~0 main_~s~0))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~a~0 (* main_~b~0 4))))} #89#return; {14359#(or (<= main_~b~0 0) (= (+ (* (* main_~q~0 main_~x~0) 4) (* 4 (* main_~y~0 main_~s~0))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~a~0 (* main_~b~0 4))))} is VALID [2022-04-27 13:09:44,367 INFO L290 TraceCheckUtils]: 36: Hoare triple {13511#true} assume true; {13511#true} is VALID [2022-04-27 13:09:44,367 INFO L290 TraceCheckUtils]: 35: Hoare triple {13511#true} assume !(0 == ~cond); {13511#true} is VALID [2022-04-27 13:09:44,367 INFO L290 TraceCheckUtils]: 34: Hoare triple {13511#true} ~cond := #in~cond; {13511#true} is VALID [2022-04-27 13:09:44,367 INFO L272 TraceCheckUtils]: 33: Hoare triple {14359#(or (<= main_~b~0 0) (= (+ (* (* main_~q~0 main_~x~0) 4) (* 4 (* main_~y~0 main_~s~0))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~a~0 (* main_~b~0 4))))} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {13511#true} is VALID [2022-04-27 13:09:44,368 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {13511#true} {14359#(or (<= main_~b~0 0) (= (+ (* (* main_~q~0 main_~x~0) 4) (* 4 (* main_~y~0 main_~s~0))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~a~0 (* main_~b~0 4))))} #87#return; {14359#(or (<= main_~b~0 0) (= (+ (* (* main_~q~0 main_~x~0) 4) (* 4 (* main_~y~0 main_~s~0))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~a~0 (* main_~b~0 4))))} is VALID [2022-04-27 13:09:44,368 INFO L290 TraceCheckUtils]: 31: Hoare triple {13511#true} assume true; {13511#true} is VALID [2022-04-27 13:09:44,368 INFO L290 TraceCheckUtils]: 30: Hoare triple {13511#true} assume !(0 == ~cond); {13511#true} is VALID [2022-04-27 13:09:44,368 INFO L290 TraceCheckUtils]: 29: Hoare triple {13511#true} ~cond := #in~cond; {13511#true} is VALID [2022-04-27 13:09:44,368 INFO L272 TraceCheckUtils]: 28: Hoare triple {14359#(or (<= main_~b~0 0) (= (+ (* (* main_~q~0 main_~x~0) 4) (* 4 (* main_~y~0 main_~s~0))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~a~0 (* main_~b~0 4))))} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {13511#true} is VALID [2022-04-27 13:09:44,368 INFO L290 TraceCheckUtils]: 27: Hoare triple {13511#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {14359#(or (<= main_~b~0 0) (= (+ (* (* main_~q~0 main_~x~0) 4) (* 4 (* main_~y~0 main_~s~0))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~a~0 (* main_~b~0 4))))} is VALID [2022-04-27 13:09:44,369 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {13511#true} {13511#true} #85#return; {13511#true} is VALID [2022-04-27 13:09:44,369 INFO L290 TraceCheckUtils]: 25: Hoare triple {13511#true} assume true; {13511#true} is VALID [2022-04-27 13:09:44,369 INFO L290 TraceCheckUtils]: 24: Hoare triple {13511#true} assume !(0 == ~cond); {13511#true} is VALID [2022-04-27 13:09:44,369 INFO L290 TraceCheckUtils]: 23: Hoare triple {13511#true} ~cond := #in~cond; {13511#true} is VALID [2022-04-27 13:09:44,369 INFO L272 TraceCheckUtils]: 22: Hoare triple {13511#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {13511#true} is VALID [2022-04-27 13:09:44,369 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {13511#true} {13511#true} #83#return; {13511#true} is VALID [2022-04-27 13:09:44,369 INFO L290 TraceCheckUtils]: 20: Hoare triple {13511#true} assume true; {13511#true} is VALID [2022-04-27 13:09:44,369 INFO L290 TraceCheckUtils]: 19: Hoare triple {13511#true} assume !(0 == ~cond); {13511#true} is VALID [2022-04-27 13:09:44,369 INFO L290 TraceCheckUtils]: 18: Hoare triple {13511#true} ~cond := #in~cond; {13511#true} is VALID [2022-04-27 13:09:44,369 INFO L272 TraceCheckUtils]: 17: Hoare triple {13511#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {13511#true} is VALID [2022-04-27 13:09:44,369 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {13511#true} {13511#true} #81#return; {13511#true} is VALID [2022-04-27 13:09:44,369 INFO L290 TraceCheckUtils]: 15: Hoare triple {13511#true} assume true; {13511#true} is VALID [2022-04-27 13:09:44,369 INFO L290 TraceCheckUtils]: 14: Hoare triple {13511#true} assume !(0 == ~cond); {13511#true} is VALID [2022-04-27 13:09:44,369 INFO L290 TraceCheckUtils]: 13: Hoare triple {13511#true} ~cond := #in~cond; {13511#true} is VALID [2022-04-27 13:09:44,369 INFO L272 TraceCheckUtils]: 12: Hoare triple {13511#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 20 then 1 else 0)); {13511#true} is VALID [2022-04-27 13:09:44,369 INFO L290 TraceCheckUtils]: 11: Hoare triple {13511#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {13511#true} is VALID [2022-04-27 13:09:44,369 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {13511#true} {13511#true} #79#return; {13511#true} is VALID [2022-04-27 13:09:44,369 INFO L290 TraceCheckUtils]: 9: Hoare triple {13511#true} assume true; {13511#true} is VALID [2022-04-27 13:09:44,369 INFO L290 TraceCheckUtils]: 8: Hoare triple {13511#true} assume !(0 == ~cond); {13511#true} is VALID [2022-04-27 13:09:44,369 INFO L290 TraceCheckUtils]: 7: Hoare triple {13511#true} ~cond := #in~cond; {13511#true} is VALID [2022-04-27 13:09:44,369 INFO L272 TraceCheckUtils]: 6: Hoare triple {13511#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 20 then 1 else 0)); {13511#true} is VALID [2022-04-27 13:09:44,369 INFO L290 TraceCheckUtils]: 5: Hoare triple {13511#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {13511#true} is VALID [2022-04-27 13:09:44,370 INFO L272 TraceCheckUtils]: 4: Hoare triple {13511#true} call #t~ret6 := main(); {13511#true} is VALID [2022-04-27 13:09:44,370 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13511#true} {13511#true} #103#return; {13511#true} is VALID [2022-04-27 13:09:44,370 INFO L290 TraceCheckUtils]: 2: Hoare triple {13511#true} assume true; {13511#true} is VALID [2022-04-27 13:09:44,370 INFO L290 TraceCheckUtils]: 1: Hoare triple {13511#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); {13511#true} is VALID [2022-04-27 13:09:44,370 INFO L272 TraceCheckUtils]: 0: Hoare triple {13511#true} call ULTIMATE.init(); {13511#true} is VALID [2022-04-27 13:09:44,370 INFO L134 CoverageAnalysis]: Checked inductivity of 922 backedges. 87 proven. 72 refuted. 0 times theorem prover too weak. 763 trivial. 0 not checked. [2022-04-27 13:09:44,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:09:44,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165046363] [2022-04-27 13:09:44,371 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:09:44,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2039299877] [2022-04-27 13:09:44,371 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2039299877] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 13:09:44,371 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 13:09:44,371 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 27 [2022-04-27 13:09:44,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495280731] [2022-04-27 13:09:44,371 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 13:09:44,371 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 25 states have (on average 2.0) internal successors, (50), 24 states have internal predecessors, (50), 17 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (49), 13 states have call predecessors, (49), 15 states have call successors, (49) Word has length 157 [2022-04-27 13:09:44,372 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:09:44,372 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 27 states, 25 states have (on average 2.0) internal successors, (50), 24 states have internal predecessors, (50), 17 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (49), 13 states have call predecessors, (49), 15 states have call successors, (49) [2022-04-27 13:09:45,170 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 151 edges. 151 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:09:45,171 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-04-27 13:09:45,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:09:45,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-04-27 13:09:45,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=571, Unknown=0, NotChecked=0, Total=702 [2022-04-27 13:09:45,171 INFO L87 Difference]: Start difference. First operand 187 states and 249 transitions. Second operand has 27 states, 25 states have (on average 2.0) internal successors, (50), 24 states have internal predecessors, (50), 17 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (49), 13 states have call predecessors, (49), 15 states have call successors, (49) [2022-04-27 13:10:34,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:10:34,294 INFO L93 Difference]: Finished difference Result 297 states and 416 transitions. [2022-04-27 13:10:34,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-04-27 13:10:34,294 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 25 states have (on average 2.0) internal successors, (50), 24 states have internal predecessors, (50), 17 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (49), 13 states have call predecessors, (49), 15 states have call successors, (49) Word has length 157 [2022-04-27 13:10:34,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:10:34,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 25 states have (on average 2.0) internal successors, (50), 24 states have internal predecessors, (50), 17 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (49), 13 states have call predecessors, (49), 15 states have call successors, (49) [2022-04-27 13:10:34,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 225 transitions. [2022-04-27 13:10:34,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 25 states have (on average 2.0) internal successors, (50), 24 states have internal predecessors, (50), 17 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (49), 13 states have call predecessors, (49), 15 states have call successors, (49) [2022-04-27 13:10:34,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 225 transitions. [2022-04-27 13:10:34,311 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 225 transitions. [2022-04-27 13:10:36,256 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 225 edges. 225 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:10:36,261 INFO L225 Difference]: With dead ends: 297 [2022-04-27 13:10:36,261 INFO L226 Difference]: Without dead ends: 291 [2022-04-27 13:10:36,262 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 287 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 680 ImplicationChecksByTransitivity, 21.3s TimeCoverageRelationStatistics Valid=595, Invalid=2160, Unknown=1, NotChecked=0, Total=2756 [2022-04-27 13:10:36,262 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 93 mSDsluCounter, 402 mSDsCounter, 0 mSdLazyCounter, 1708 mSolverCounterSat, 258 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 467 SdHoareTripleChecker+Invalid, 1966 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 258 IncrementalHoareTripleChecker+Valid, 1708 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.5s IncrementalHoareTripleChecker+Time [2022-04-27 13:10:36,262 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 467 Invalid, 1966 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [258 Valid, 1708 Invalid, 0 Unknown, 0 Unchecked, 12.5s Time] [2022-04-27 13:10:36,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2022-04-27 13:10:36,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 259. [2022-04-27 13:10:36,738 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:10:36,739 INFO L82 GeneralOperation]: Start isEquivalent. First operand 291 states. Second operand has 259 states, 133 states have (on average 1.150375939849624) internal successors, (153), 133 states have internal predecessors, (153), 105 states have call successors, (105), 22 states have call predecessors, (105), 20 states have return successors, (103), 103 states have call predecessors, (103), 103 states have call successors, (103) [2022-04-27 13:10:36,740 INFO L74 IsIncluded]: Start isIncluded. First operand 291 states. Second operand has 259 states, 133 states have (on average 1.150375939849624) internal successors, (153), 133 states have internal predecessors, (153), 105 states have call successors, (105), 22 states have call predecessors, (105), 20 states have return successors, (103), 103 states have call predecessors, (103), 103 states have call successors, (103) [2022-04-27 13:10:36,740 INFO L87 Difference]: Start difference. First operand 291 states. Second operand has 259 states, 133 states have (on average 1.150375939849624) internal successors, (153), 133 states have internal predecessors, (153), 105 states have call successors, (105), 22 states have call predecessors, (105), 20 states have return successors, (103), 103 states have call predecessors, (103), 103 states have call successors, (103) [2022-04-27 13:10:36,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:10:36,746 INFO L93 Difference]: Finished difference Result 291 states and 409 transitions. [2022-04-27 13:10:36,747 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 409 transitions. [2022-04-27 13:10:36,747 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:10:36,747 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:10:36,748 INFO L74 IsIncluded]: Start isIncluded. First operand has 259 states, 133 states have (on average 1.150375939849624) internal successors, (153), 133 states have internal predecessors, (153), 105 states have call successors, (105), 22 states have call predecessors, (105), 20 states have return successors, (103), 103 states have call predecessors, (103), 103 states have call successors, (103) Second operand 291 states. [2022-04-27 13:10:36,748 INFO L87 Difference]: Start difference. First operand has 259 states, 133 states have (on average 1.150375939849624) internal successors, (153), 133 states have internal predecessors, (153), 105 states have call successors, (105), 22 states have call predecessors, (105), 20 states have return successors, (103), 103 states have call predecessors, (103), 103 states have call successors, (103) Second operand 291 states. [2022-04-27 13:10:36,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:10:36,754 INFO L93 Difference]: Finished difference Result 291 states and 409 transitions. [2022-04-27 13:10:36,754 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 409 transitions. [2022-04-27 13:10:36,755 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:10:36,755 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:10:36,755 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:10:36,755 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:10:36,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 133 states have (on average 1.150375939849624) internal successors, (153), 133 states have internal predecessors, (153), 105 states have call successors, (105), 22 states have call predecessors, (105), 20 states have return successors, (103), 103 states have call predecessors, (103), 103 states have call successors, (103) [2022-04-27 13:10:36,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 361 transitions. [2022-04-27 13:10:36,765 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 361 transitions. Word has length 157 [2022-04-27 13:10:36,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:10:36,766 INFO L495 AbstractCegarLoop]: Abstraction has 259 states and 361 transitions. [2022-04-27 13:10:36,766 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 25 states have (on average 2.0) internal successors, (50), 24 states have internal predecessors, (50), 17 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (49), 13 states have call predecessors, (49), 15 states have call successors, (49) [2022-04-27 13:10:36,766 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 361 transitions. [2022-04-27 13:10:36,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2022-04-27 13:10:36,767 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:10:36,767 INFO L195 NwaCegarLoop]: trace histogram [21, 20, 20, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:10:36,784 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-04-27 13:10:36,984 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:36,984 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:10:36,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:10:36,984 INFO L85 PathProgramCache]: Analyzing trace with hash 1001336492, now seen corresponding path program 5 times [2022-04-27 13:10:36,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:10:36,985 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582141274] [2022-04-27 13:10:36,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:10:36,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:10:37,005 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:10:37,005 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1893051382] [2022-04-27 13:10:37,005 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-04-27 13:10:37,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:10:37,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:10:37,008 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:37,009 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:37,106 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2022-04-27 13:10:37,106 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 13:10:37,108 INFO L263 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 84 conjunts are in the unsatisfiable core [2022-04-27 13:10:37,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:10:37,145 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:10:51,119 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-27 13:10:51,134 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-27 13:11:09,862 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-27 13:11:13,909 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-27 13:11:19,941 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-27 13:11:21,062 INFO L272 TraceCheckUtils]: 0: Hoare triple {16007#true} call ULTIMATE.init(); {16007#true} is VALID [2022-04-27 13:11:21,062 INFO L290 TraceCheckUtils]: 1: Hoare triple {16007#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); {16007#true} is VALID [2022-04-27 13:11:21,062 INFO L290 TraceCheckUtils]: 2: Hoare triple {16007#true} assume true; {16007#true} is VALID [2022-04-27 13:11:21,062 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16007#true} {16007#true} #103#return; {16007#true} is VALID [2022-04-27 13:11:21,062 INFO L272 TraceCheckUtils]: 4: Hoare triple {16007#true} call #t~ret6 := main(); {16007#true} is VALID [2022-04-27 13:11:21,062 INFO L290 TraceCheckUtils]: 5: Hoare triple {16007#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {16007#true} is VALID [2022-04-27 13:11:21,062 INFO L272 TraceCheckUtils]: 6: Hoare triple {16007#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 20 then 1 else 0)); {16007#true} is VALID [2022-04-27 13:11:21,062 INFO L290 TraceCheckUtils]: 7: Hoare triple {16007#true} ~cond := #in~cond; {16007#true} is VALID [2022-04-27 13:11:21,062 INFO L290 TraceCheckUtils]: 8: Hoare triple {16007#true} assume !(0 == ~cond); {16007#true} is VALID [2022-04-27 13:11:21,062 INFO L290 TraceCheckUtils]: 9: Hoare triple {16007#true} assume true; {16007#true} is VALID [2022-04-27 13:11:21,062 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {16007#true} {16007#true} #79#return; {16007#true} is VALID [2022-04-27 13:11:21,062 INFO L290 TraceCheckUtils]: 11: Hoare triple {16007#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {16007#true} is VALID [2022-04-27 13:11:21,062 INFO L272 TraceCheckUtils]: 12: Hoare triple {16007#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 20 then 1 else 0)); {16007#true} is VALID [2022-04-27 13:11:21,063 INFO L290 TraceCheckUtils]: 13: Hoare triple {16007#true} ~cond := #in~cond; {16051#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 13:11:21,063 INFO L290 TraceCheckUtils]: 14: Hoare triple {16051#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {16055#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 13:11:21,063 INFO L290 TraceCheckUtils]: 15: Hoare triple {16055#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {16055#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 13:11:21,063 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {16055#(not (= |assume_abort_if_not_#in~cond| 0))} {16007#true} #81#return; {16062#(and (<= 0 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-27 13:11:21,064 INFO L272 TraceCheckUtils]: 17: Hoare triple {16062#(and (<= 0 main_~y~0) (<= main_~y~0 20))} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {16007#true} is VALID [2022-04-27 13:11:21,064 INFO L290 TraceCheckUtils]: 18: Hoare triple {16007#true} ~cond := #in~cond; {16007#true} is VALID [2022-04-27 13:11:21,064 INFO L290 TraceCheckUtils]: 19: Hoare triple {16007#true} assume !(0 == ~cond); {16007#true} is VALID [2022-04-27 13:11:21,064 INFO L290 TraceCheckUtils]: 20: Hoare triple {16007#true} assume true; {16007#true} is VALID [2022-04-27 13:11:21,064 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {16007#true} {16062#(and (<= 0 main_~y~0) (<= main_~y~0 20))} #83#return; {16062#(and (<= 0 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-27 13:11:21,064 INFO L272 TraceCheckUtils]: 22: Hoare triple {16062#(and (<= 0 main_~y~0) (<= main_~y~0 20))} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {16007#true} is VALID [2022-04-27 13:11:21,064 INFO L290 TraceCheckUtils]: 23: Hoare triple {16007#true} ~cond := #in~cond; {16051#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 13:11:21,065 INFO L290 TraceCheckUtils]: 24: Hoare triple {16051#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {16055#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 13:11:21,065 INFO L290 TraceCheckUtils]: 25: Hoare triple {16055#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {16055#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 13:11:21,065 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {16055#(not (= |assume_abort_if_not_#in~cond| 0))} {16062#(and (<= 0 main_~y~0) (<= main_~y~0 20))} #85#return; {16093#(and (<= main_~y~0 20) (<= 1 main_~y~0))} is VALID [2022-04-27 13:11:21,066 INFO L290 TraceCheckUtils]: 27: Hoare triple {16093#(and (<= main_~y~0 20) (<= 1 main_~y~0))} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {16097#(and (= main_~r~0 0) (<= 1 main_~p~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= main_~y~0 20) (<= 1 main_~y~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-27 13:11:21,066 INFO L272 TraceCheckUtils]: 28: Hoare triple {16097#(and (= main_~r~0 0) (<= 1 main_~p~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= main_~y~0 20) (<= 1 main_~y~0) (= main_~a~0 main_~x~0))} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {16007#true} is VALID [2022-04-27 13:11:21,066 INFO L290 TraceCheckUtils]: 29: Hoare triple {16007#true} ~cond := #in~cond; {16007#true} is VALID [2022-04-27 13:11:21,066 INFO L290 TraceCheckUtils]: 30: Hoare triple {16007#true} assume !(0 == ~cond); {16007#true} is VALID [2022-04-27 13:11:21,066 INFO L290 TraceCheckUtils]: 31: Hoare triple {16007#true} assume true; {16007#true} is VALID [2022-04-27 13:11:21,066 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {16007#true} {16097#(and (= main_~r~0 0) (<= 1 main_~p~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= main_~y~0 20) (<= 1 main_~y~0) (= main_~a~0 main_~x~0))} #87#return; {16097#(and (= main_~r~0 0) (<= 1 main_~p~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= main_~y~0 20) (<= 1 main_~y~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-27 13:11:21,066 INFO L272 TraceCheckUtils]: 33: Hoare triple {16097#(and (= main_~r~0 0) (<= 1 main_~p~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= main_~y~0 20) (<= 1 main_~y~0) (= main_~a~0 main_~x~0))} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {16007#true} is VALID [2022-04-27 13:11:21,066 INFO L290 TraceCheckUtils]: 34: Hoare triple {16007#true} ~cond := #in~cond; {16007#true} is VALID [2022-04-27 13:11:21,066 INFO L290 TraceCheckUtils]: 35: Hoare triple {16007#true} assume !(0 == ~cond); {16007#true} is VALID [2022-04-27 13:11:21,067 INFO L290 TraceCheckUtils]: 36: Hoare triple {16007#true} assume true; {16007#true} is VALID [2022-04-27 13:11:21,067 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {16007#true} {16097#(and (= main_~r~0 0) (<= 1 main_~p~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= main_~y~0 20) (<= 1 main_~y~0) (= main_~a~0 main_~x~0))} #89#return; {16097#(and (= main_~r~0 0) (<= 1 main_~p~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= main_~y~0 20) (<= 1 main_~y~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-27 13:11:21,067 INFO L290 TraceCheckUtils]: 38: Hoare triple {16097#(and (= main_~r~0 0) (<= 1 main_~p~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= main_~y~0 20) (<= 1 main_~y~0) (= main_~a~0 main_~x~0))} assume !false; {16097#(and (= main_~r~0 0) (<= 1 main_~p~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= main_~y~0 20) (<= 1 main_~y~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-27 13:11:21,068 INFO L290 TraceCheckUtils]: 39: Hoare triple {16097#(and (= main_~r~0 0) (<= 1 main_~p~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= main_~y~0 20) (<= 1 main_~y~0) (= main_~a~0 main_~x~0))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {16134#(and (= main_~r~0 0) (= main_~k~0 0) (<= 1 main_~p~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= main_~y~0 20) (<= 1 main_~y~0) (= main_~c~0 main_~x~0))} is VALID [2022-04-27 13:11:21,068 INFO L290 TraceCheckUtils]: 40: Hoare triple {16134#(and (= main_~r~0 0) (= main_~k~0 0) (<= 1 main_~p~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= main_~y~0 20) (<= 1 main_~y~0) (= main_~c~0 main_~x~0))} assume !false; {16134#(and (= main_~r~0 0) (= main_~k~0 0) (<= 1 main_~p~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= main_~y~0 20) (<= 1 main_~y~0) (= main_~c~0 main_~x~0))} is VALID [2022-04-27 13:11:21,068 INFO L272 TraceCheckUtils]: 41: Hoare triple {16134#(and (= main_~r~0 0) (= main_~k~0 0) (<= 1 main_~p~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= main_~y~0 20) (<= 1 main_~y~0) (= main_~c~0 main_~x~0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {16007#true} is VALID [2022-04-27 13:11:21,068 INFO L290 TraceCheckUtils]: 42: Hoare triple {16007#true} ~cond := #in~cond; {16007#true} is VALID [2022-04-27 13:11:21,068 INFO L290 TraceCheckUtils]: 43: Hoare triple {16007#true} assume !(0 == ~cond); {16007#true} is VALID [2022-04-27 13:11:21,068 INFO L290 TraceCheckUtils]: 44: Hoare triple {16007#true} assume true; {16007#true} is VALID [2022-04-27 13:11:21,069 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {16007#true} {16134#(and (= main_~r~0 0) (= main_~k~0 0) (<= 1 main_~p~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= main_~y~0 20) (<= 1 main_~y~0) (= main_~c~0 main_~x~0))} #91#return; {16134#(and (= main_~r~0 0) (= main_~k~0 0) (<= 1 main_~p~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= main_~y~0 20) (<= 1 main_~y~0) (= main_~c~0 main_~x~0))} is VALID [2022-04-27 13:11:21,069 INFO L272 TraceCheckUtils]: 46: Hoare triple {16134#(and (= main_~r~0 0) (= main_~k~0 0) (<= 1 main_~p~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= main_~y~0 20) (<= 1 main_~y~0) (= main_~c~0 main_~x~0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {16007#true} is VALID [2022-04-27 13:11:21,069 INFO L290 TraceCheckUtils]: 47: Hoare triple {16007#true} ~cond := #in~cond; {16007#true} is VALID [2022-04-27 13:11:21,069 INFO L290 TraceCheckUtils]: 48: Hoare triple {16007#true} assume !(0 == ~cond); {16007#true} is VALID [2022-04-27 13:11:21,069 INFO L290 TraceCheckUtils]: 49: Hoare triple {16007#true} assume true; {16007#true} is VALID [2022-04-27 13:11:21,070 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {16007#true} {16134#(and (= main_~r~0 0) (= main_~k~0 0) (<= 1 main_~p~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= main_~y~0 20) (<= 1 main_~y~0) (= main_~c~0 main_~x~0))} #93#return; {16134#(and (= main_~r~0 0) (= main_~k~0 0) (<= 1 main_~p~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= main_~y~0 20) (<= 1 main_~y~0) (= main_~c~0 main_~x~0))} is VALID [2022-04-27 13:11:21,070 INFO L272 TraceCheckUtils]: 51: Hoare triple {16134#(and (= main_~r~0 0) (= main_~k~0 0) (<= 1 main_~p~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= main_~y~0 20) (<= 1 main_~y~0) (= main_~c~0 main_~x~0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {16007#true} is VALID [2022-04-27 13:11:21,070 INFO L290 TraceCheckUtils]: 52: Hoare triple {16007#true} ~cond := #in~cond; {16007#true} is VALID [2022-04-27 13:11:21,070 INFO L290 TraceCheckUtils]: 53: Hoare triple {16007#true} assume !(0 == ~cond); {16007#true} is VALID [2022-04-27 13:11:21,070 INFO L290 TraceCheckUtils]: 54: Hoare triple {16007#true} assume true; {16007#true} is VALID [2022-04-27 13:11:21,070 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {16007#true} {16134#(and (= main_~r~0 0) (= main_~k~0 0) (<= 1 main_~p~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= main_~y~0 20) (<= 1 main_~y~0) (= main_~c~0 main_~x~0))} #95#return; {16134#(and (= main_~r~0 0) (= main_~k~0 0) (<= 1 main_~p~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= main_~y~0 20) (<= 1 main_~y~0) (= main_~c~0 main_~x~0))} is VALID [2022-04-27 13:11:21,070 INFO L272 TraceCheckUtils]: 56: Hoare triple {16134#(and (= main_~r~0 0) (= main_~k~0 0) (<= 1 main_~p~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= main_~y~0 20) (<= 1 main_~y~0) (= main_~c~0 main_~x~0))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {16007#true} is VALID [2022-04-27 13:11:21,070 INFO L290 TraceCheckUtils]: 57: Hoare triple {16007#true} ~cond := #in~cond; {16007#true} is VALID [2022-04-27 13:11:21,071 INFO L290 TraceCheckUtils]: 58: Hoare triple {16007#true} assume !(0 == ~cond); {16007#true} is VALID [2022-04-27 13:11:21,071 INFO L290 TraceCheckUtils]: 59: Hoare triple {16007#true} assume true; {16007#true} is VALID [2022-04-27 13:11:21,071 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {16007#true} {16134#(and (= main_~r~0 0) (= main_~k~0 0) (<= 1 main_~p~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= main_~y~0 20) (<= 1 main_~y~0) (= main_~c~0 main_~x~0))} #97#return; {16134#(and (= main_~r~0 0) (= main_~k~0 0) (<= 1 main_~p~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= main_~y~0 20) (<= 1 main_~y~0) (= main_~c~0 main_~x~0))} is VALID [2022-04-27 13:11:21,072 INFO L290 TraceCheckUtils]: 61: Hoare triple {16134#(and (= main_~r~0 0) (= main_~k~0 0) (<= 1 main_~p~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= main_~y~0 20) (<= 1 main_~y~0) (= main_~c~0 main_~x~0))} assume !(~c~0 >= ~b~0); {16134#(and (= main_~r~0 0) (= main_~k~0 0) (<= 1 main_~p~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= main_~y~0 20) (<= 1 main_~y~0) (= main_~c~0 main_~x~0))} is VALID [2022-04-27 13:11:21,072 INFO L290 TraceCheckUtils]: 62: Hoare triple {16134#(and (= main_~r~0 0) (= main_~k~0 0) (<= 1 main_~p~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= main_~y~0 20) (<= 1 main_~y~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; {16204#(and (= main_~s~0 0) (= main_~p~0 0) (<= 1 main_~q~0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (<= main_~y~0 20) (<= 1 main_~y~0))} is VALID [2022-04-27 13:11:21,073 INFO L290 TraceCheckUtils]: 63: Hoare triple {16204#(and (= main_~s~0 0) (= main_~p~0 0) (<= 1 main_~q~0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (<= main_~y~0 20) (<= 1 main_~y~0))} assume !false; {16204#(and (= main_~s~0 0) (= main_~p~0 0) (<= 1 main_~q~0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (<= main_~y~0 20) (<= 1 main_~y~0))} is VALID [2022-04-27 13:11:21,073 INFO L290 TraceCheckUtils]: 64: Hoare triple {16204#(and (= main_~s~0 0) (= main_~p~0 0) (<= 1 main_~q~0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (<= main_~y~0 20) (<= 1 main_~y~0))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {16211#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (<= 1 main_~q~0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (<= main_~y~0 20) (<= 1 main_~y~0))} is VALID [2022-04-27 13:11:21,074 INFO L290 TraceCheckUtils]: 65: Hoare triple {16211#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (<= 1 main_~q~0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (<= main_~y~0 20) (<= 1 main_~y~0))} assume !false; {16211#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (<= 1 main_~q~0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (<= main_~y~0 20) (<= 1 main_~y~0))} is VALID [2022-04-27 13:11:21,074 INFO L272 TraceCheckUtils]: 66: Hoare triple {16211#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (<= 1 main_~q~0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (<= main_~y~0 20) (<= 1 main_~y~0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {16007#true} is VALID [2022-04-27 13:11:21,074 INFO L290 TraceCheckUtils]: 67: Hoare triple {16007#true} ~cond := #in~cond; {16007#true} is VALID [2022-04-27 13:11:21,074 INFO L290 TraceCheckUtils]: 68: Hoare triple {16007#true} assume !(0 == ~cond); {16007#true} is VALID [2022-04-27 13:11:21,074 INFO L290 TraceCheckUtils]: 69: Hoare triple {16007#true} assume true; {16007#true} is VALID [2022-04-27 13:11:21,074 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {16007#true} {16211#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (<= 1 main_~q~0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (<= main_~y~0 20) (<= 1 main_~y~0))} #91#return; {16211#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (<= 1 main_~q~0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (<= main_~y~0 20) (<= 1 main_~y~0))} is VALID [2022-04-27 13:11:21,074 INFO L272 TraceCheckUtils]: 71: Hoare triple {16211#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (<= 1 main_~q~0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (<= main_~y~0 20) (<= 1 main_~y~0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {16007#true} is VALID [2022-04-27 13:11:21,074 INFO L290 TraceCheckUtils]: 72: Hoare triple {16007#true} ~cond := #in~cond; {16007#true} is VALID [2022-04-27 13:11:21,074 INFO L290 TraceCheckUtils]: 73: Hoare triple {16007#true} assume !(0 == ~cond); {16007#true} is VALID [2022-04-27 13:11:21,074 INFO L290 TraceCheckUtils]: 74: Hoare triple {16007#true} assume true; {16007#true} is VALID [2022-04-27 13:11:21,075 INFO L284 TraceCheckUtils]: 75: Hoare quadruple {16007#true} {16211#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (<= 1 main_~q~0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (<= main_~y~0 20) (<= 1 main_~y~0))} #93#return; {16211#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (<= 1 main_~q~0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (<= main_~y~0 20) (<= 1 main_~y~0))} is VALID [2022-04-27 13:11:21,075 INFO L272 TraceCheckUtils]: 76: Hoare triple {16211#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (<= 1 main_~q~0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (<= main_~y~0 20) (<= 1 main_~y~0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {16007#true} is VALID [2022-04-27 13:11:21,075 INFO L290 TraceCheckUtils]: 77: Hoare triple {16007#true} ~cond := #in~cond; {16251#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:11:21,076 INFO L290 TraceCheckUtils]: 78: Hoare triple {16251#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {16255#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:11:21,076 INFO L290 TraceCheckUtils]: 79: Hoare triple {16255#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {16255#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:11:21,077 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {16255#(not (= |__VERIFIER_assert_#in~cond| 0))} {16211#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (<= 1 main_~q~0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (<= main_~y~0 20) (<= 1 main_~y~0))} #95#return; {16262#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~p~0 0) (= main_~k~0 0) (<= 1 main_~q~0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (<= main_~y~0 20) (<= 1 main_~y~0))} is VALID [2022-04-27 13:11:21,077 INFO L272 TraceCheckUtils]: 81: Hoare triple {16262#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~p~0 0) (= main_~k~0 0) (<= 1 main_~q~0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (<= main_~y~0 20) (<= 1 main_~y~0))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {16007#true} is VALID [2022-04-27 13:11:21,077 INFO L290 TraceCheckUtils]: 82: Hoare triple {16007#true} ~cond := #in~cond; {16007#true} is VALID [2022-04-27 13:11:21,077 INFO L290 TraceCheckUtils]: 83: Hoare triple {16007#true} assume !(0 == ~cond); {16007#true} is VALID [2022-04-27 13:11:21,077 INFO L290 TraceCheckUtils]: 84: Hoare triple {16007#true} assume true; {16007#true} is VALID [2022-04-27 13:11:21,077 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {16007#true} {16262#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~p~0 0) (= main_~k~0 0) (<= 1 main_~q~0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (<= main_~y~0 20) (<= 1 main_~y~0))} #97#return; {16262#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~p~0 0) (= main_~k~0 0) (<= 1 main_~q~0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (<= main_~y~0 20) (<= 1 main_~y~0))} is VALID [2022-04-27 13:11:21,078 INFO L290 TraceCheckUtils]: 86: Hoare triple {16262#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~p~0 0) (= main_~k~0 0) (<= 1 main_~q~0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (<= main_~y~0 20) (<= 1 main_~y~0))} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {16281#(and (= main_~s~0 0) (<= 1 main_~k~0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~p~0 0) (<= 1 main_~q~0) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (<= main_~y~0 20) (<= 1 main_~y~0))} is VALID [2022-04-27 13:11:21,079 INFO L290 TraceCheckUtils]: 87: Hoare triple {16281#(and (= main_~s~0 0) (<= 1 main_~k~0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~p~0 0) (<= 1 main_~q~0) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (<= main_~y~0 20) (<= 1 main_~y~0))} assume !false; {16281#(and (= main_~s~0 0) (<= 1 main_~k~0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~p~0 0) (<= 1 main_~q~0) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (<= main_~y~0 20) (<= 1 main_~y~0))} is VALID [2022-04-27 13:11:21,079 INFO L272 TraceCheckUtils]: 88: Hoare triple {16281#(and (= main_~s~0 0) (<= 1 main_~k~0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~p~0 0) (<= 1 main_~q~0) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (<= main_~y~0 20) (<= 1 main_~y~0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {16007#true} is VALID [2022-04-27 13:11:21,079 INFO L290 TraceCheckUtils]: 89: Hoare triple {16007#true} ~cond := #in~cond; {16251#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:11:21,079 INFO L290 TraceCheckUtils]: 90: Hoare triple {16251#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {16255#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:11:21,079 INFO L290 TraceCheckUtils]: 91: Hoare triple {16255#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {16255#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:11:21,080 INFO L284 TraceCheckUtils]: 92: Hoare quadruple {16255#(not (= |__VERIFIER_assert_#in~cond| 0))} {16281#(and (= main_~s~0 0) (<= 1 main_~k~0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~p~0 0) (<= 1 main_~q~0) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (<= main_~y~0 20) (<= 1 main_~y~0))} #91#return; {16300#(and (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~s~0 0) (<= 1 main_~k~0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~p~0 0) (<= 1 main_~q~0) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (<= main_~y~0 20) (<= 1 main_~y~0))} is VALID [2022-04-27 13:11:21,080 INFO L272 TraceCheckUtils]: 93: Hoare triple {16300#(and (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~s~0 0) (<= 1 main_~k~0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~p~0 0) (<= 1 main_~q~0) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (<= main_~y~0 20) (<= 1 main_~y~0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {16007#true} is VALID [2022-04-27 13:11:21,080 INFO L290 TraceCheckUtils]: 94: Hoare triple {16007#true} ~cond := #in~cond; {16007#true} is VALID [2022-04-27 13:11:21,081 INFO L290 TraceCheckUtils]: 95: Hoare triple {16007#true} assume !(0 == ~cond); {16007#true} is VALID [2022-04-27 13:11:21,081 INFO L290 TraceCheckUtils]: 96: Hoare triple {16007#true} assume true; {16007#true} is VALID [2022-04-27 13:11:21,081 INFO L284 TraceCheckUtils]: 97: Hoare quadruple {16007#true} {16300#(and (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~s~0 0) (<= 1 main_~k~0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~p~0 0) (<= 1 main_~q~0) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (<= main_~y~0 20) (<= 1 main_~y~0))} #93#return; {16300#(and (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~s~0 0) (<= 1 main_~k~0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~p~0 0) (<= 1 main_~q~0) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (<= main_~y~0 20) (<= 1 main_~y~0))} is VALID [2022-04-27 13:11:21,081 INFO L272 TraceCheckUtils]: 98: Hoare triple {16300#(and (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~s~0 0) (<= 1 main_~k~0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~p~0 0) (<= 1 main_~q~0) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (<= main_~y~0 20) (<= 1 main_~y~0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {16007#true} is VALID [2022-04-27 13:11:21,081 INFO L290 TraceCheckUtils]: 99: Hoare triple {16007#true} ~cond := #in~cond; {16007#true} is VALID [2022-04-27 13:11:21,081 INFO L290 TraceCheckUtils]: 100: Hoare triple {16007#true} assume !(0 == ~cond); {16007#true} is VALID [2022-04-27 13:11:21,081 INFO L290 TraceCheckUtils]: 101: Hoare triple {16007#true} assume true; {16007#true} is VALID [2022-04-27 13:11:21,082 INFO L284 TraceCheckUtils]: 102: Hoare quadruple {16007#true} {16300#(and (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~s~0 0) (<= 1 main_~k~0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~p~0 0) (<= 1 main_~q~0) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (<= main_~y~0 20) (<= 1 main_~y~0))} #95#return; {16300#(and (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~s~0 0) (<= 1 main_~k~0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~p~0 0) (<= 1 main_~q~0) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (<= main_~y~0 20) (<= 1 main_~y~0))} is VALID [2022-04-27 13:11:21,082 INFO L272 TraceCheckUtils]: 103: Hoare triple {16300#(and (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~s~0 0) (<= 1 main_~k~0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~p~0 0) (<= 1 main_~q~0) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (<= main_~y~0 20) (<= 1 main_~y~0))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {16007#true} is VALID [2022-04-27 13:11:21,082 INFO L290 TraceCheckUtils]: 104: Hoare triple {16007#true} ~cond := #in~cond; {16007#true} is VALID [2022-04-27 13:11:21,082 INFO L290 TraceCheckUtils]: 105: Hoare triple {16007#true} assume !(0 == ~cond); {16007#true} is VALID [2022-04-27 13:11:21,082 INFO L290 TraceCheckUtils]: 106: Hoare triple {16007#true} assume true; {16007#true} is VALID [2022-04-27 13:11:21,083 INFO L284 TraceCheckUtils]: 107: Hoare quadruple {16007#true} {16300#(and (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~s~0 0) (<= 1 main_~k~0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~p~0 0) (<= 1 main_~q~0) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (<= main_~y~0 20) (<= 1 main_~y~0))} #97#return; {16300#(and (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~s~0 0) (<= 1 main_~k~0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~p~0 0) (<= 1 main_~q~0) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (<= main_~y~0 20) (<= 1 main_~y~0))} is VALID [2022-04-27 13:11:21,086 INFO L290 TraceCheckUtils]: 108: Hoare triple {16300#(and (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~s~0 0) (<= 1 main_~k~0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~p~0 0) (<= 1 main_~q~0) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (<= main_~y~0 20) (<= 1 main_~y~0))} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {16349#(and (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~p~0 0) (<= 1 main_~q~0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (or (and (= (+ (* (- 1) main_~c~0) main_~a~0 (* (- 1) main_~b~0)) 0) (= main_~b~0 0) (<= 2 main_~k~0)) (and (= (+ (* (- 1) main_~b~0 (div (+ (* (- 1) main_~c~0) main_~a~0 (* (- 1) main_~b~0)) main_~b~0)) main_~a~0) (+ main_~a~0 (* (- 1) main_~b~0))) (= (mod (+ (* (- 1) main_~c~0) main_~a~0 (* (- 1) main_~b~0)) main_~b~0) 0) (not (= main_~b~0 0)) (<= (+ (div (+ (* (- 1) main_~c~0) main_~a~0 (* (- 1) main_~b~0)) main_~b~0) 1) main_~k~0))) (<= main_~y~0 20) (<= 1 main_~y~0))} is VALID [2022-04-27 13:11:21,088 INFO L290 TraceCheckUtils]: 109: Hoare triple {16349#(and (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~p~0 0) (<= 1 main_~q~0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (or (and (= (+ (* (- 1) main_~c~0) main_~a~0 (* (- 1) main_~b~0)) 0) (= main_~b~0 0) (<= 2 main_~k~0)) (and (= (+ (* (- 1) main_~b~0 (div (+ (* (- 1) main_~c~0) main_~a~0 (* (- 1) main_~b~0)) main_~b~0)) main_~a~0) (+ main_~a~0 (* (- 1) main_~b~0))) (= (mod (+ (* (- 1) main_~c~0) main_~a~0 (* (- 1) main_~b~0)) main_~b~0) 0) (not (= main_~b~0 0)) (<= (+ (div (+ (* (- 1) main_~c~0) main_~a~0 (* (- 1) main_~b~0)) main_~b~0) 1) main_~k~0))) (<= main_~y~0 20) (<= 1 main_~y~0))} assume !false; {16349#(and (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~p~0 0) (<= 1 main_~q~0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (or (and (= (+ (* (- 1) main_~c~0) main_~a~0 (* (- 1) main_~b~0)) 0) (= main_~b~0 0) (<= 2 main_~k~0)) (and (= (+ (* (- 1) main_~b~0 (div (+ (* (- 1) main_~c~0) main_~a~0 (* (- 1) main_~b~0)) main_~b~0)) main_~a~0) (+ main_~a~0 (* (- 1) main_~b~0))) (= (mod (+ (* (- 1) main_~c~0) main_~a~0 (* (- 1) main_~b~0)) main_~b~0) 0) (not (= main_~b~0 0)) (<= (+ (div (+ (* (- 1) main_~c~0) main_~a~0 (* (- 1) main_~b~0)) main_~b~0) 1) main_~k~0))) (<= main_~y~0 20) (<= 1 main_~y~0))} is VALID [2022-04-27 13:11:21,088 INFO L272 TraceCheckUtils]: 110: Hoare triple {16349#(and (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~p~0 0) (<= 1 main_~q~0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (or (and (= (+ (* (- 1) main_~c~0) main_~a~0 (* (- 1) main_~b~0)) 0) (= main_~b~0 0) (<= 2 main_~k~0)) (and (= (+ (* (- 1) main_~b~0 (div (+ (* (- 1) main_~c~0) main_~a~0 (* (- 1) main_~b~0)) main_~b~0)) main_~a~0) (+ main_~a~0 (* (- 1) main_~b~0))) (= (mod (+ (* (- 1) main_~c~0) main_~a~0 (* (- 1) main_~b~0)) main_~b~0) 0) (not (= main_~b~0 0)) (<= (+ (div (+ (* (- 1) main_~c~0) main_~a~0 (* (- 1) main_~b~0)) main_~b~0) 1) main_~k~0))) (<= main_~y~0 20) (<= 1 main_~y~0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {16007#true} is VALID [2022-04-27 13:11:21,088 INFO L290 TraceCheckUtils]: 111: Hoare triple {16007#true} ~cond := #in~cond; {16007#true} is VALID [2022-04-27 13:11:21,088 INFO L290 TraceCheckUtils]: 112: Hoare triple {16007#true} assume !(0 == ~cond); {16007#true} is VALID [2022-04-27 13:11:21,088 INFO L290 TraceCheckUtils]: 113: Hoare triple {16007#true} assume true; {16007#true} is VALID [2022-04-27 13:11:21,089 INFO L284 TraceCheckUtils]: 114: Hoare quadruple {16007#true} {16349#(and (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~p~0 0) (<= 1 main_~q~0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (or (and (= (+ (* (- 1) main_~c~0) main_~a~0 (* (- 1) main_~b~0)) 0) (= main_~b~0 0) (<= 2 main_~k~0)) (and (= (+ (* (- 1) main_~b~0 (div (+ (* (- 1) main_~c~0) main_~a~0 (* (- 1) main_~b~0)) main_~b~0)) main_~a~0) (+ main_~a~0 (* (- 1) main_~b~0))) (= (mod (+ (* (- 1) main_~c~0) main_~a~0 (* (- 1) main_~b~0)) main_~b~0) 0) (not (= main_~b~0 0)) (<= (+ (div (+ (* (- 1) main_~c~0) main_~a~0 (* (- 1) main_~b~0)) main_~b~0) 1) main_~k~0))) (<= main_~y~0 20) (<= 1 main_~y~0))} #91#return; {16349#(and (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~p~0 0) (<= 1 main_~q~0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (or (and (= (+ (* (- 1) main_~c~0) main_~a~0 (* (- 1) main_~b~0)) 0) (= main_~b~0 0) (<= 2 main_~k~0)) (and (= (+ (* (- 1) main_~b~0 (div (+ (* (- 1) main_~c~0) main_~a~0 (* (- 1) main_~b~0)) main_~b~0)) main_~a~0) (+ main_~a~0 (* (- 1) main_~b~0))) (= (mod (+ (* (- 1) main_~c~0) main_~a~0 (* (- 1) main_~b~0)) main_~b~0) 0) (not (= main_~b~0 0)) (<= (+ (div (+ (* (- 1) main_~c~0) main_~a~0 (* (- 1) main_~b~0)) main_~b~0) 1) main_~k~0))) (<= main_~y~0 20) (<= 1 main_~y~0))} is VALID [2022-04-27 13:11:21,089 INFO L272 TraceCheckUtils]: 115: Hoare triple {16349#(and (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~p~0 0) (<= 1 main_~q~0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (or (and (= (+ (* (- 1) main_~c~0) main_~a~0 (* (- 1) main_~b~0)) 0) (= main_~b~0 0) (<= 2 main_~k~0)) (and (= (+ (* (- 1) main_~b~0 (div (+ (* (- 1) main_~c~0) main_~a~0 (* (- 1) main_~b~0)) main_~b~0)) main_~a~0) (+ main_~a~0 (* (- 1) main_~b~0))) (= (mod (+ (* (- 1) main_~c~0) main_~a~0 (* (- 1) main_~b~0)) main_~b~0) 0) (not (= main_~b~0 0)) (<= (+ (div (+ (* (- 1) main_~c~0) main_~a~0 (* (- 1) main_~b~0)) main_~b~0) 1) main_~k~0))) (<= main_~y~0 20) (<= 1 main_~y~0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {16007#true} is VALID [2022-04-27 13:11:21,089 INFO L290 TraceCheckUtils]: 116: Hoare triple {16007#true} ~cond := #in~cond; {16007#true} is VALID [2022-04-27 13:11:21,089 INFO L290 TraceCheckUtils]: 117: Hoare triple {16007#true} assume !(0 == ~cond); {16007#true} is VALID [2022-04-27 13:11:21,089 INFO L290 TraceCheckUtils]: 118: Hoare triple {16007#true} assume true; {16007#true} is VALID [2022-04-27 13:11:21,089 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {16007#true} {16349#(and (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~p~0 0) (<= 1 main_~q~0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (or (and (= (+ (* (- 1) main_~c~0) main_~a~0 (* (- 1) main_~b~0)) 0) (= main_~b~0 0) (<= 2 main_~k~0)) (and (= (+ (* (- 1) main_~b~0 (div (+ (* (- 1) main_~c~0) main_~a~0 (* (- 1) main_~b~0)) main_~b~0)) main_~a~0) (+ main_~a~0 (* (- 1) main_~b~0))) (= (mod (+ (* (- 1) main_~c~0) main_~a~0 (* (- 1) main_~b~0)) main_~b~0) 0) (not (= main_~b~0 0)) (<= (+ (div (+ (* (- 1) main_~c~0) main_~a~0 (* (- 1) main_~b~0)) main_~b~0) 1) main_~k~0))) (<= main_~y~0 20) (<= 1 main_~y~0))} #93#return; {16349#(and (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~p~0 0) (<= 1 main_~q~0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (or (and (= (+ (* (- 1) main_~c~0) main_~a~0 (* (- 1) main_~b~0)) 0) (= main_~b~0 0) (<= 2 main_~k~0)) (and (= (+ (* (- 1) main_~b~0 (div (+ (* (- 1) main_~c~0) main_~a~0 (* (- 1) main_~b~0)) main_~b~0)) main_~a~0) (+ main_~a~0 (* (- 1) main_~b~0))) (= (mod (+ (* (- 1) main_~c~0) main_~a~0 (* (- 1) main_~b~0)) main_~b~0) 0) (not (= main_~b~0 0)) (<= (+ (div (+ (* (- 1) main_~c~0) main_~a~0 (* (- 1) main_~b~0)) main_~b~0) 1) main_~k~0))) (<= main_~y~0 20) (<= 1 main_~y~0))} is VALID [2022-04-27 13:11:21,089 INFO L272 TraceCheckUtils]: 120: Hoare triple {16349#(and (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~p~0 0) (<= 1 main_~q~0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (or (and (= (+ (* (- 1) main_~c~0) main_~a~0 (* (- 1) main_~b~0)) 0) (= main_~b~0 0) (<= 2 main_~k~0)) (and (= (+ (* (- 1) main_~b~0 (div (+ (* (- 1) main_~c~0) main_~a~0 (* (- 1) main_~b~0)) main_~b~0)) main_~a~0) (+ main_~a~0 (* (- 1) main_~b~0))) (= (mod (+ (* (- 1) main_~c~0) main_~a~0 (* (- 1) main_~b~0)) main_~b~0) 0) (not (= main_~b~0 0)) (<= (+ (div (+ (* (- 1) main_~c~0) main_~a~0 (* (- 1) main_~b~0)) main_~b~0) 1) main_~k~0))) (<= main_~y~0 20) (<= 1 main_~y~0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {16007#true} is VALID [2022-04-27 13:11:21,089 INFO L290 TraceCheckUtils]: 121: Hoare triple {16007#true} ~cond := #in~cond; {16007#true} is VALID [2022-04-27 13:11:21,089 INFO L290 TraceCheckUtils]: 122: Hoare triple {16007#true} assume !(0 == ~cond); {16007#true} is VALID [2022-04-27 13:11:21,090 INFO L290 TraceCheckUtils]: 123: Hoare triple {16007#true} assume true; {16007#true} is VALID [2022-04-27 13:11:21,090 INFO L284 TraceCheckUtils]: 124: Hoare quadruple {16007#true} {16349#(and (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~p~0 0) (<= 1 main_~q~0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (or (and (= (+ (* (- 1) main_~c~0) main_~a~0 (* (- 1) main_~b~0)) 0) (= main_~b~0 0) (<= 2 main_~k~0)) (and (= (+ (* (- 1) main_~b~0 (div (+ (* (- 1) main_~c~0) main_~a~0 (* (- 1) main_~b~0)) main_~b~0)) main_~a~0) (+ main_~a~0 (* (- 1) main_~b~0))) (= (mod (+ (* (- 1) main_~c~0) main_~a~0 (* (- 1) main_~b~0)) main_~b~0) 0) (not (= main_~b~0 0)) (<= (+ (div (+ (* (- 1) main_~c~0) main_~a~0 (* (- 1) main_~b~0)) main_~b~0) 1) main_~k~0))) (<= main_~y~0 20) (<= 1 main_~y~0))} #95#return; {16349#(and (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~p~0 0) (<= 1 main_~q~0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (or (and (= (+ (* (- 1) main_~c~0) main_~a~0 (* (- 1) main_~b~0)) 0) (= main_~b~0 0) (<= 2 main_~k~0)) (and (= (+ (* (- 1) main_~b~0 (div (+ (* (- 1) main_~c~0) main_~a~0 (* (- 1) main_~b~0)) main_~b~0)) main_~a~0) (+ main_~a~0 (* (- 1) main_~b~0))) (= (mod (+ (* (- 1) main_~c~0) main_~a~0 (* (- 1) main_~b~0)) main_~b~0) 0) (not (= main_~b~0 0)) (<= (+ (div (+ (* (- 1) main_~c~0) main_~a~0 (* (- 1) main_~b~0)) main_~b~0) 1) main_~k~0))) (<= main_~y~0 20) (<= 1 main_~y~0))} is VALID [2022-04-27 13:11:21,090 INFO L272 TraceCheckUtils]: 125: Hoare triple {16349#(and (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~p~0 0) (<= 1 main_~q~0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (or (and (= (+ (* (- 1) main_~c~0) main_~a~0 (* (- 1) main_~b~0)) 0) (= main_~b~0 0) (<= 2 main_~k~0)) (and (= (+ (* (- 1) main_~b~0 (div (+ (* (- 1) main_~c~0) main_~a~0 (* (- 1) main_~b~0)) main_~b~0)) main_~a~0) (+ main_~a~0 (* (- 1) main_~b~0))) (= (mod (+ (* (- 1) main_~c~0) main_~a~0 (* (- 1) main_~b~0)) main_~b~0) 0) (not (= main_~b~0 0)) (<= (+ (div (+ (* (- 1) main_~c~0) main_~a~0 (* (- 1) main_~b~0)) main_~b~0) 1) main_~k~0))) (<= main_~y~0 20) (<= 1 main_~y~0))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {16007#true} is VALID [2022-04-27 13:11:21,090 INFO L290 TraceCheckUtils]: 126: Hoare triple {16007#true} ~cond := #in~cond; {16007#true} is VALID [2022-04-27 13:11:21,090 INFO L290 TraceCheckUtils]: 127: Hoare triple {16007#true} assume !(0 == ~cond); {16007#true} is VALID [2022-04-27 13:11:21,090 INFO L290 TraceCheckUtils]: 128: Hoare triple {16007#true} assume true; {16007#true} is VALID [2022-04-27 13:11:21,091 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {16007#true} {16349#(and (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~p~0 0) (<= 1 main_~q~0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (or (and (= (+ (* (- 1) main_~c~0) main_~a~0 (* (- 1) main_~b~0)) 0) (= main_~b~0 0) (<= 2 main_~k~0)) (and (= (+ (* (- 1) main_~b~0 (div (+ (* (- 1) main_~c~0) main_~a~0 (* (- 1) main_~b~0)) main_~b~0)) main_~a~0) (+ main_~a~0 (* (- 1) main_~b~0))) (= (mod (+ (* (- 1) main_~c~0) main_~a~0 (* (- 1) main_~b~0)) main_~b~0) 0) (not (= main_~b~0 0)) (<= (+ (div (+ (* (- 1) main_~c~0) main_~a~0 (* (- 1) main_~b~0)) main_~b~0) 1) main_~k~0))) (<= main_~y~0 20) (<= 1 main_~y~0))} #97#return; {16349#(and (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~p~0 0) (<= 1 main_~q~0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (or (and (= (+ (* (- 1) main_~c~0) main_~a~0 (* (- 1) main_~b~0)) 0) (= main_~b~0 0) (<= 2 main_~k~0)) (and (= (+ (* (- 1) main_~b~0 (div (+ (* (- 1) main_~c~0) main_~a~0 (* (- 1) main_~b~0)) main_~b~0)) main_~a~0) (+ main_~a~0 (* (- 1) main_~b~0))) (= (mod (+ (* (- 1) main_~c~0) main_~a~0 (* (- 1) main_~b~0)) main_~b~0) 0) (not (= main_~b~0 0)) (<= (+ (div (+ (* (- 1) main_~c~0) main_~a~0 (* (- 1) main_~b~0)) main_~b~0) 1) main_~k~0))) (<= main_~y~0 20) (<= 1 main_~y~0))} is VALID [2022-04-27 13:11:21,093 INFO L290 TraceCheckUtils]: 130: Hoare triple {16349#(and (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~p~0 0) (<= 1 main_~q~0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (or (and (= (+ (* (- 1) main_~c~0) main_~a~0 (* (- 1) main_~b~0)) 0) (= main_~b~0 0) (<= 2 main_~k~0)) (and (= (+ (* (- 1) main_~b~0 (div (+ (* (- 1) main_~c~0) main_~a~0 (* (- 1) main_~b~0)) main_~b~0)) main_~a~0) (+ main_~a~0 (* (- 1) main_~b~0))) (= (mod (+ (* (- 1) main_~c~0) main_~a~0 (* (- 1) main_~b~0)) main_~b~0) 0) (not (= main_~b~0 0)) (<= (+ (div (+ (* (- 1) main_~c~0) main_~a~0 (* (- 1) main_~b~0)) main_~b~0) 1) main_~k~0))) (<= main_~y~0 20) (<= 1 main_~y~0))} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {16416#(and (= main_~s~0 0) (or (and (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ main_~a~0 (* (- 1) main_~b~0 (div (+ (* (- 1) main_~c~0) (* (- 2) main_~b~0) main_~a~0) main_~b~0)))) (= (mod (+ (* (- 1) main_~c~0) (* (- 2) main_~b~0) main_~a~0) main_~b~0) 0) (<= (+ 2 (div (+ (* (- 1) main_~c~0) (* (- 2) main_~b~0) main_~a~0) main_~b~0)) main_~k~0) (not (= main_~b~0 0))) (and (<= 3 main_~k~0) (= (+ (* (- 1) main_~c~0) (* (- 2) main_~b~0) main_~a~0) 0) (= main_~b~0 0))) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~p~0 0) (<= 1 main_~q~0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (<= 0 main_~c~0) (= main_~b~0 main_~x~0) (<= main_~y~0 20) (<= 1 main_~y~0))} is VALID [2022-04-27 13:11:21,094 INFO L290 TraceCheckUtils]: 131: Hoare triple {16416#(and (= main_~s~0 0) (or (and (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ main_~a~0 (* (- 1) main_~b~0 (div (+ (* (- 1) main_~c~0) (* (- 2) main_~b~0) main_~a~0) main_~b~0)))) (= (mod (+ (* (- 1) main_~c~0) (* (- 2) main_~b~0) main_~a~0) main_~b~0) 0) (<= (+ 2 (div (+ (* (- 1) main_~c~0) (* (- 2) main_~b~0) main_~a~0) main_~b~0)) main_~k~0) (not (= main_~b~0 0))) (and (<= 3 main_~k~0) (= (+ (* (- 1) main_~c~0) (* (- 2) main_~b~0) main_~a~0) 0) (= main_~b~0 0))) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~p~0 0) (<= 1 main_~q~0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (<= 0 main_~c~0) (= main_~b~0 main_~x~0) (<= main_~y~0 20) (<= 1 main_~y~0))} assume !false; {16416#(and (= main_~s~0 0) (or (and (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ main_~a~0 (* (- 1) main_~b~0 (div (+ (* (- 1) main_~c~0) (* (- 2) main_~b~0) main_~a~0) main_~b~0)))) (= (mod (+ (* (- 1) main_~c~0) (* (- 2) main_~b~0) main_~a~0) main_~b~0) 0) (<= (+ 2 (div (+ (* (- 1) main_~c~0) (* (- 2) main_~b~0) main_~a~0) main_~b~0)) main_~k~0) (not (= main_~b~0 0))) (and (<= 3 main_~k~0) (= (+ (* (- 1) main_~c~0) (* (- 2) main_~b~0) main_~a~0) 0) (= main_~b~0 0))) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~p~0 0) (<= 1 main_~q~0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (<= 0 main_~c~0) (= main_~b~0 main_~x~0) (<= main_~y~0 20) (<= 1 main_~y~0))} is VALID [2022-04-27 13:11:21,094 INFO L272 TraceCheckUtils]: 132: Hoare triple {16416#(and (= main_~s~0 0) (or (and (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ main_~a~0 (* (- 1) main_~b~0 (div (+ (* (- 1) main_~c~0) (* (- 2) main_~b~0) main_~a~0) main_~b~0)))) (= (mod (+ (* (- 1) main_~c~0) (* (- 2) main_~b~0) main_~a~0) main_~b~0) 0) (<= (+ 2 (div (+ (* (- 1) main_~c~0) (* (- 2) main_~b~0) main_~a~0) main_~b~0)) main_~k~0) (not (= main_~b~0 0))) (and (<= 3 main_~k~0) (= (+ (* (- 1) main_~c~0) (* (- 2) main_~b~0) main_~a~0) 0) (= main_~b~0 0))) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~p~0 0) (<= 1 main_~q~0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (<= 0 main_~c~0) (= main_~b~0 main_~x~0) (<= main_~y~0 20) (<= 1 main_~y~0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {16007#true} is VALID [2022-04-27 13:11:21,095 INFO L290 TraceCheckUtils]: 133: Hoare triple {16007#true} ~cond := #in~cond; {16251#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:11:21,095 INFO L290 TraceCheckUtils]: 134: Hoare triple {16251#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {16255#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:11:21,095 INFO L290 TraceCheckUtils]: 135: Hoare triple {16255#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {16255#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:11:21,098 INFO L284 TraceCheckUtils]: 136: Hoare quadruple {16255#(not (= |__VERIFIER_assert_#in~cond| 0))} {16416#(and (= main_~s~0 0) (or (and (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ main_~a~0 (* (- 1) main_~b~0 (div (+ (* (- 1) main_~c~0) (* (- 2) main_~b~0) main_~a~0) main_~b~0)))) (= (mod (+ (* (- 1) main_~c~0) (* (- 2) main_~b~0) main_~a~0) main_~b~0) 0) (<= (+ 2 (div (+ (* (- 1) main_~c~0) (* (- 2) main_~b~0) main_~a~0) main_~b~0)) main_~k~0) (not (= main_~b~0 0))) (and (<= 3 main_~k~0) (= (+ (* (- 1) main_~c~0) (* (- 2) main_~b~0) main_~a~0) 0) (= main_~b~0 0))) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~p~0 0) (<= 1 main_~q~0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (<= 0 main_~c~0) (= main_~b~0 main_~x~0) (<= main_~y~0 20) (<= 1 main_~y~0))} #91#return; {16435#(and (= main_~s~0 0) (= main_~y~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~p~0 0) (<= 1 main_~q~0) (= main_~r~0 1) (<= 0 main_~c~0) (= main_~b~0 main_~x~0) (<= main_~y~0 20) (<= 1 main_~y~0) (or (and (not (= main_~b~0 0)) (= (* (div (+ (* (- 2) main_~b~0) (* main_~b~0 main_~k~0)) main_~b~0) main_~b~0) main_~b~0)) (and (<= 3 main_~k~0) (= 0 (+ (* (- 2) main_~b~0) (* main_~b~0 main_~k~0))))))} is VALID [2022-04-27 13:11:21,098 INFO L272 TraceCheckUtils]: 137: Hoare triple {16435#(and (= main_~s~0 0) (= main_~y~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~p~0 0) (<= 1 main_~q~0) (= main_~r~0 1) (<= 0 main_~c~0) (= main_~b~0 main_~x~0) (<= main_~y~0 20) (<= 1 main_~y~0) (or (and (not (= main_~b~0 0)) (= (* (div (+ (* (- 2) main_~b~0) (* main_~b~0 main_~k~0)) main_~b~0) main_~b~0) main_~b~0)) (and (<= 3 main_~k~0) (= 0 (+ (* (- 2) main_~b~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)); {16007#true} is VALID [2022-04-27 13:11:21,098 INFO L290 TraceCheckUtils]: 138: Hoare triple {16007#true} ~cond := #in~cond; {16007#true} is VALID [2022-04-27 13:11:21,098 INFO L290 TraceCheckUtils]: 139: Hoare triple {16007#true} assume !(0 == ~cond); {16007#true} is VALID [2022-04-27 13:11:21,098 INFO L290 TraceCheckUtils]: 140: Hoare triple {16007#true} assume true; {16007#true} is VALID [2022-04-27 13:11:21,099 INFO L284 TraceCheckUtils]: 141: Hoare quadruple {16007#true} {16435#(and (= main_~s~0 0) (= main_~y~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~p~0 0) (<= 1 main_~q~0) (= main_~r~0 1) (<= 0 main_~c~0) (= main_~b~0 main_~x~0) (<= main_~y~0 20) (<= 1 main_~y~0) (or (and (not (= main_~b~0 0)) (= (* (div (+ (* (- 2) main_~b~0) (* main_~b~0 main_~k~0)) main_~b~0) main_~b~0) main_~b~0)) (and (<= 3 main_~k~0) (= 0 (+ (* (- 2) main_~b~0) (* main_~b~0 main_~k~0))))))} #93#return; {16435#(and (= main_~s~0 0) (= main_~y~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~p~0 0) (<= 1 main_~q~0) (= main_~r~0 1) (<= 0 main_~c~0) (= main_~b~0 main_~x~0) (<= main_~y~0 20) (<= 1 main_~y~0) (or (and (not (= main_~b~0 0)) (= (* (div (+ (* (- 2) main_~b~0) (* main_~b~0 main_~k~0)) main_~b~0) main_~b~0) main_~b~0)) (and (<= 3 main_~k~0) (= 0 (+ (* (- 2) main_~b~0) (* main_~b~0 main_~k~0))))))} is VALID [2022-04-27 13:11:21,099 INFO L272 TraceCheckUtils]: 142: Hoare triple {16435#(and (= main_~s~0 0) (= main_~y~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~p~0 0) (<= 1 main_~q~0) (= main_~r~0 1) (<= 0 main_~c~0) (= main_~b~0 main_~x~0) (<= main_~y~0 20) (<= 1 main_~y~0) (or (and (not (= main_~b~0 0)) (= (* (div (+ (* (- 2) main_~b~0) (* main_~b~0 main_~k~0)) main_~b~0) main_~b~0) main_~b~0)) (and (<= 3 main_~k~0) (= 0 (+ (* (- 2) main_~b~0) (* main_~b~0 main_~k~0))))))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {16007#true} is VALID [2022-04-27 13:11:21,099 INFO L290 TraceCheckUtils]: 143: Hoare triple {16007#true} ~cond := #in~cond; {16007#true} is VALID [2022-04-27 13:11:21,099 INFO L290 TraceCheckUtils]: 144: Hoare triple {16007#true} assume !(0 == ~cond); {16007#true} is VALID [2022-04-27 13:11:21,099 INFO L290 TraceCheckUtils]: 145: Hoare triple {16007#true} assume true; {16007#true} is VALID [2022-04-27 13:11:21,100 INFO L284 TraceCheckUtils]: 146: Hoare quadruple {16007#true} {16435#(and (= main_~s~0 0) (= main_~y~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~p~0 0) (<= 1 main_~q~0) (= main_~r~0 1) (<= 0 main_~c~0) (= main_~b~0 main_~x~0) (<= main_~y~0 20) (<= 1 main_~y~0) (or (and (not (= main_~b~0 0)) (= (* (div (+ (* (- 2) main_~b~0) (* main_~b~0 main_~k~0)) main_~b~0) main_~b~0) main_~b~0)) (and (<= 3 main_~k~0) (= 0 (+ (* (- 2) main_~b~0) (* main_~b~0 main_~k~0))))))} #95#return; {16435#(and (= main_~s~0 0) (= main_~y~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~p~0 0) (<= 1 main_~q~0) (= main_~r~0 1) (<= 0 main_~c~0) (= main_~b~0 main_~x~0) (<= main_~y~0 20) (<= 1 main_~y~0) (or (and (not (= main_~b~0 0)) (= (* (div (+ (* (- 2) main_~b~0) (* main_~b~0 main_~k~0)) main_~b~0) main_~b~0) main_~b~0)) (and (<= 3 main_~k~0) (= 0 (+ (* (- 2) main_~b~0) (* main_~b~0 main_~k~0))))))} is VALID [2022-04-27 13:11:21,100 INFO L272 TraceCheckUtils]: 147: Hoare triple {16435#(and (= main_~s~0 0) (= main_~y~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~p~0 0) (<= 1 main_~q~0) (= main_~r~0 1) (<= 0 main_~c~0) (= main_~b~0 main_~x~0) (<= main_~y~0 20) (<= 1 main_~y~0) (or (and (not (= main_~b~0 0)) (= (* (div (+ (* (- 2) main_~b~0) (* main_~b~0 main_~k~0)) main_~b~0) main_~b~0) main_~b~0)) (and (<= 3 main_~k~0) (= 0 (+ (* (- 2) main_~b~0) (* main_~b~0 main_~k~0))))))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {16007#true} is VALID [2022-04-27 13:11:21,100 INFO L290 TraceCheckUtils]: 148: Hoare triple {16007#true} ~cond := #in~cond; {16007#true} is VALID [2022-04-27 13:11:21,100 INFO L290 TraceCheckUtils]: 149: Hoare triple {16007#true} assume !(0 == ~cond); {16007#true} is VALID [2022-04-27 13:11:21,100 INFO L290 TraceCheckUtils]: 150: Hoare triple {16007#true} assume true; {16007#true} is VALID [2022-04-27 13:11:21,100 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {16007#true} {16435#(and (= main_~s~0 0) (= main_~y~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~p~0 0) (<= 1 main_~q~0) (= main_~r~0 1) (<= 0 main_~c~0) (= main_~b~0 main_~x~0) (<= main_~y~0 20) (<= 1 main_~y~0) (or (and (not (= main_~b~0 0)) (= (* (div (+ (* (- 2) main_~b~0) (* main_~b~0 main_~k~0)) main_~b~0) main_~b~0) main_~b~0)) (and (<= 3 main_~k~0) (= 0 (+ (* (- 2) main_~b~0) (* main_~b~0 main_~k~0))))))} #97#return; {16435#(and (= main_~s~0 0) (= main_~y~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~p~0 0) (<= 1 main_~q~0) (= main_~r~0 1) (<= 0 main_~c~0) (= main_~b~0 main_~x~0) (<= main_~y~0 20) (<= 1 main_~y~0) (or (and (not (= main_~b~0 0)) (= (* (div (+ (* (- 2) main_~b~0) (* main_~b~0 main_~k~0)) main_~b~0) main_~b~0) main_~b~0)) (and (<= 3 main_~k~0) (= 0 (+ (* (- 2) main_~b~0) (* main_~b~0 main_~k~0))))))} is VALID [2022-04-27 13:11:21,106 INFO L290 TraceCheckUtils]: 152: Hoare triple {16435#(and (= main_~s~0 0) (= main_~y~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~p~0 0) (<= 1 main_~q~0) (= main_~r~0 1) (<= 0 main_~c~0) (= main_~b~0 main_~x~0) (<= main_~y~0 20) (<= 1 main_~y~0) (or (and (not (= main_~b~0 0)) (= (* (div (+ (* (- 2) main_~b~0) (* main_~b~0 main_~k~0)) main_~b~0) main_~b~0) main_~b~0)) (and (<= 3 main_~k~0) (= 0 (+ (* (- 2) main_~b~0) (* main_~b~0 main_~k~0))))))} assume !(~c~0 >= ~b~0); {16484#(and (< main_~c~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~x~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= (+ (* (div (+ (* (- 2) main_~y~0 main_~s~0) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* (- 2) main_~q~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) main_~y~0 main_~s~0) (* (div (+ (* (- 2) main_~y~0 main_~s~0) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* (- 2) main_~q~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) main_~q~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (<= 0 main_~c~0) (= main_~y~0 (+ (* main_~k~0 main_~y~0 main_~s~0) main_~c~0 (* main_~q~0 main_~k~0 main_~x~0))) (<= main_~y~0 20))} is VALID [2022-04-27 13:11:21,324 INFO L290 TraceCheckUtils]: 153: Hoare triple {16484#(and (< main_~c~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~x~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= (+ (* (div (+ (* (- 2) main_~y~0 main_~s~0) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* (- 2) main_~q~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) main_~y~0 main_~s~0) (* (div (+ (* (- 2) main_~y~0 main_~s~0) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* (- 2) main_~q~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) main_~q~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (<= 0 main_~c~0) (= main_~y~0 (+ (* main_~k~0 main_~y~0 main_~s~0) main_~c~0 (* main_~q~0 main_~k~0 main_~x~0))) (<= main_~y~0 20))} ~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; {16488#(and (= main_~s~0 1) (exists ((main_~k~0 Int)) (and (< main_~b~0 (* main_~x~0 (div (* (- 1) main_~q~0) main_~k~0))) (= (mod (* (- 1) main_~q~0) main_~k~0) 0) (= (+ (* main_~x~0 (div (+ (* (- 2) main_~x~0 (div (* (- 1) main_~q~0) main_~k~0)) (* main_~k~0 main_~x~0 (div (* (- 1) main_~q~0) main_~k~0)) (* main_~k~0 main_~y~0 0)) (* main_~x~0 (div (* (- 1) main_~q~0) main_~k~0))) (div (* (- 1) main_~q~0) main_~k~0)) (* main_~y~0 (div (+ (* (- 2) main_~x~0 (div (* (- 1) main_~q~0) main_~k~0)) (* main_~k~0 main_~x~0 (div (* (- 1) main_~q~0) main_~k~0)) (* main_~k~0 main_~y~0 0)) (* main_~x~0 (div (* (- 1) main_~q~0) main_~k~0))) 0)) (* main_~x~0 (div (* (- 1) main_~q~0) main_~k~0))) (= (+ main_~b~0 (* main_~k~0 main_~x~0 (div (* (- 1) main_~q~0) main_~k~0)) (* main_~k~0 main_~y~0 0)) main_~y~0) (= main_~x~0 (* main_~x~0 (div (* (- 1) main_~q~0) main_~k~0))))) (<= 0 main_~b~0) (<= main_~y~0 20))} is VALID [2022-04-27 13:11:21,326 INFO L290 TraceCheckUtils]: 154: Hoare triple {16488#(and (= main_~s~0 1) (exists ((main_~k~0 Int)) (and (< main_~b~0 (* main_~x~0 (div (* (- 1) main_~q~0) main_~k~0))) (= (mod (* (- 1) main_~q~0) main_~k~0) 0) (= (+ (* main_~x~0 (div (+ (* (- 2) main_~x~0 (div (* (- 1) main_~q~0) main_~k~0)) (* main_~k~0 main_~x~0 (div (* (- 1) main_~q~0) main_~k~0)) (* main_~k~0 main_~y~0 0)) (* main_~x~0 (div (* (- 1) main_~q~0) main_~k~0))) (div (* (- 1) main_~q~0) main_~k~0)) (* main_~y~0 (div (+ (* (- 2) main_~x~0 (div (* (- 1) main_~q~0) main_~k~0)) (* main_~k~0 main_~x~0 (div (* (- 1) main_~q~0) main_~k~0)) (* main_~k~0 main_~y~0 0)) (* main_~x~0 (div (* (- 1) main_~q~0) main_~k~0))) 0)) (* main_~x~0 (div (* (- 1) main_~q~0) main_~k~0))) (= (+ main_~b~0 (* main_~k~0 main_~x~0 (div (* (- 1) main_~q~0) main_~k~0)) (* main_~k~0 main_~y~0 0)) main_~y~0) (= main_~x~0 (* main_~x~0 (div (* (- 1) main_~q~0) main_~k~0))))) (<= 0 main_~b~0) (<= main_~y~0 20))} assume !false; {16488#(and (= main_~s~0 1) (exists ((main_~k~0 Int)) (and (< main_~b~0 (* main_~x~0 (div (* (- 1) main_~q~0) main_~k~0))) (= (mod (* (- 1) main_~q~0) main_~k~0) 0) (= (+ (* main_~x~0 (div (+ (* (- 2) main_~x~0 (div (* (- 1) main_~q~0) main_~k~0)) (* main_~k~0 main_~x~0 (div (* (- 1) main_~q~0) main_~k~0)) (* main_~k~0 main_~y~0 0)) (* main_~x~0 (div (* (- 1) main_~q~0) main_~k~0))) (div (* (- 1) main_~q~0) main_~k~0)) (* main_~y~0 (div (+ (* (- 2) main_~x~0 (div (* (- 1) main_~q~0) main_~k~0)) (* main_~k~0 main_~x~0 (div (* (- 1) main_~q~0) main_~k~0)) (* main_~k~0 main_~y~0 0)) (* main_~x~0 (div (* (- 1) main_~q~0) main_~k~0))) 0)) (* main_~x~0 (div (* (- 1) main_~q~0) main_~k~0))) (= (+ main_~b~0 (* main_~k~0 main_~x~0 (div (* (- 1) main_~q~0) main_~k~0)) (* main_~k~0 main_~y~0 0)) main_~y~0) (= main_~x~0 (* main_~x~0 (div (* (- 1) main_~q~0) main_~k~0))))) (<= 0 main_~b~0) (<= main_~y~0 20))} is VALID [2022-04-27 13:11:21,327 INFO L290 TraceCheckUtils]: 155: Hoare triple {16488#(and (= main_~s~0 1) (exists ((main_~k~0 Int)) (and (< main_~b~0 (* main_~x~0 (div (* (- 1) main_~q~0) main_~k~0))) (= (mod (* (- 1) main_~q~0) main_~k~0) 0) (= (+ (* main_~x~0 (div (+ (* (- 2) main_~x~0 (div (* (- 1) main_~q~0) main_~k~0)) (* main_~k~0 main_~x~0 (div (* (- 1) main_~q~0) main_~k~0)) (* main_~k~0 main_~y~0 0)) (* main_~x~0 (div (* (- 1) main_~q~0) main_~k~0))) (div (* (- 1) main_~q~0) main_~k~0)) (* main_~y~0 (div (+ (* (- 2) main_~x~0 (div (* (- 1) main_~q~0) main_~k~0)) (* main_~k~0 main_~x~0 (div (* (- 1) main_~q~0) main_~k~0)) (* main_~k~0 main_~y~0 0)) (* main_~x~0 (div (* (- 1) main_~q~0) main_~k~0))) 0)) (* main_~x~0 (div (* (- 1) main_~q~0) main_~k~0))) (= (+ main_~b~0 (* main_~k~0 main_~x~0 (div (* (- 1) main_~q~0) main_~k~0)) (* main_~k~0 main_~y~0 0)) main_~y~0) (= main_~x~0 (* main_~x~0 (div (* (- 1) main_~q~0) main_~k~0))))) (<= 0 main_~b~0) (<= main_~y~0 20))} assume !(0 != ~b~0); {16495#(and (exists ((main_~k~0 Int)) (and (= (mod (* (- 1) main_~q~0) main_~k~0) 0) (= (+ (* main_~x~0 (div (+ (* (- 2) main_~x~0 (div (* (- 1) main_~q~0) main_~k~0)) (* main_~k~0 main_~x~0 (div (* (- 1) main_~q~0) main_~k~0)) (* main_~k~0 main_~y~0 0)) (* main_~x~0 (div (* (- 1) main_~q~0) main_~k~0))) (div (* (- 1) main_~q~0) main_~k~0)) (* main_~y~0 (div (+ (* (- 2) main_~x~0 (div (* (- 1) main_~q~0) main_~k~0)) (* main_~k~0 main_~x~0 (div (* (- 1) main_~q~0) main_~k~0)) (* main_~k~0 main_~y~0 0)) (* main_~x~0 (div (* (- 1) main_~q~0) main_~k~0))) 0)) (* main_~x~0 (div (* (- 1) main_~q~0) main_~k~0))) (< 0 (* main_~x~0 (div (* (- 1) main_~q~0) main_~k~0))) (= (+ (* main_~k~0 main_~x~0 (div (* (- 1) main_~q~0) main_~k~0)) (* main_~k~0 main_~y~0 0)) main_~y~0) (= main_~x~0 (* main_~x~0 (div (* (- 1) main_~q~0) main_~k~0))))) (= main_~s~0 1) (<= main_~y~0 20))} is VALID [2022-04-27 13:11:21,331 INFO L272 TraceCheckUtils]: 156: Hoare triple {16495#(and (exists ((main_~k~0 Int)) (and (= (mod (* (- 1) main_~q~0) main_~k~0) 0) (= (+ (* main_~x~0 (div (+ (* (- 2) main_~x~0 (div (* (- 1) main_~q~0) main_~k~0)) (* main_~k~0 main_~x~0 (div (* (- 1) main_~q~0) main_~k~0)) (* main_~k~0 main_~y~0 0)) (* main_~x~0 (div (* (- 1) main_~q~0) main_~k~0))) (div (* (- 1) main_~q~0) main_~k~0)) (* main_~y~0 (div (+ (* (- 2) main_~x~0 (div (* (- 1) main_~q~0) main_~k~0)) (* main_~k~0 main_~x~0 (div (* (- 1) main_~q~0) main_~k~0)) (* main_~k~0 main_~y~0 0)) (* main_~x~0 (div (* (- 1) main_~q~0) main_~k~0))) 0)) (* main_~x~0 (div (* (- 1) main_~q~0) main_~k~0))) (< 0 (* main_~x~0 (div (* (- 1) main_~q~0) main_~k~0))) (= (+ (* main_~k~0 main_~x~0 (div (* (- 1) main_~q~0) main_~k~0)) (* main_~k~0 main_~y~0 0)) main_~y~0) (= main_~x~0 (* main_~x~0 (div (* (- 1) main_~q~0) main_~k~0))))) (= main_~s~0 1) (<= main_~y~0 20))} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {16499#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:11:21,331 INFO L290 TraceCheckUtils]: 157: Hoare triple {16499#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {16503#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:11:21,332 INFO L290 TraceCheckUtils]: 158: Hoare triple {16503#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {16008#false} is VALID [2022-04-27 13:11:21,332 INFO L290 TraceCheckUtils]: 159: Hoare triple {16008#false} assume !false; {16008#false} is VALID [2022-04-27 13:11:21,332 INFO L134 CoverageAnalysis]: Checked inductivity of 927 backedges. 127 proven. 157 refuted. 0 times theorem prover too weak. 643 trivial. 0 not checked. [2022-04-27 13:11:21,333 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:12:32,689 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-27 13:13:34,754 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-27 13:14:38,343 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-27 13:14:38,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:14:38,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582141274] [2022-04-27 13:14:38,368 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:14:38,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1893051382] [2022-04-27 13:14:38,368 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-04-27 13:14:38,387 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:14:38,568 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:14:38,569 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Infinite/NaN value at de.uni_freiburg.informatik.ultimate.logic.Theory.constant(Theory.java:467) at de.uni_freiburg.informatik.ultimate.logic.Rational.toTerm(Rational.java:921) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.div(SmtUtils.java:1663) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.termWithLocalSimplification(SmtUtils.java:1448) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.termWithLocalSimplification(SmtUtils.java:1378) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.convertApplicationTerm(SmtUtils.java:1367) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.Substitution.convertApplicationTerm(Substitution.java:53) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$BuildApplicationTerm.walk(TermTransformer.java:352) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:285) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.Substitution.apply(Substitution.java:59) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionDer.doSubstitutions(DualJunctionDer.java:247) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionDer$DerHelperSbr.applyReplacement(DualJunctionDer.java:400) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionDer$DerHelperSbr.applyReplacement(DualJunctionDer.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionDer$IDerHelper.tryToEliminateSbr(DualJunctionDer.java:333) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionDer.tryToEliminateOne(DualJunctionDer.java:234) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionDer.tryExhaustivelyToEliminate(DualJunctionDer.java:201) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionDer.tryToEliminateOne(DualJunctionDer.java:185) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionDer.tryExhaustivelyToEliminate(DualJunctionDer.java:152) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionDer.tryToEliminate(DualJunctionDer.java:130) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:825) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:786) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:704) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:338) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:175) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:264) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:250) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminateLight(PartialQuantifierElimination.java:111) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminateCompat(PartialQuantifierElimination.java:129) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp$LiveVariablesPostprocessorBackward.postprocess(TraceCheckSpWp.java:564) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:399) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:271) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:342) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:248) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:409) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:300) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:260) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:152) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-04-27 13:14:38,572 INFO L158 Benchmark]: Toolchain (without parser) took 735732.65ms. Allocated memory was 213.9MB in the beginning and 292.6MB in the end (delta: 78.6MB). Free memory was 162.1MB in the beginning and 174.0MB in the end (delta: -11.9MB). Peak memory consumption was 67.4MB. Max. memory is 8.0GB. [2022-04-27 13:14:38,572 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 213.9MB. Free memory was 178.3MB in the beginning and 178.2MB in the end (delta: 151.8kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 13:14:38,573 INFO L158 Benchmark]: CACSL2BoogieTranslator took 192.34ms. Allocated memory is still 213.9MB. Free memory was 162.0MB in the beginning and 188.3MB in the end (delta: -26.4MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-27 13:14:38,573 INFO L158 Benchmark]: Boogie Preprocessor took 20.07ms. Allocated memory is still 213.9MB. Free memory was 188.3MB in the beginning and 186.8MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-27 13:14:38,573 INFO L158 Benchmark]: RCFGBuilder took 297.84ms. Allocated memory is still 213.9MB. Free memory was 186.8MB in the beginning and 173.8MB in the end (delta: 13.0MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-27 13:14:38,573 INFO L158 Benchmark]: TraceAbstraction took 735218.81ms. Allocated memory was 213.9MB in the beginning and 292.6MB in the end (delta: 78.6MB). Free memory was 173.2MB in the beginning and 174.0MB in the end (delta: -797.2kB). Peak memory consumption was 79.0MB. Max. memory is 8.0GB. [2022-04-27 13:14:38,574 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 213.9MB. Free memory was 178.3MB in the beginning and 178.2MB in the end (delta: 151.8kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 192.34ms. Allocated memory is still 213.9MB. Free memory was 162.0MB in the beginning and 188.3MB in the end (delta: -26.4MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 20.07ms. Allocated memory is still 213.9MB. Free memory was 188.3MB in the beginning and 186.8MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 297.84ms. Allocated memory is still 213.9MB. Free memory was 186.8MB in the beginning and 173.8MB in the end (delta: 13.0MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 735218.81ms. Allocated memory was 213.9MB in the beginning and 292.6MB in the end (delta: 78.6MB). Free memory was 173.2MB in the beginning and 174.0MB in the end (delta: -797.2kB). Peak memory consumption was 79.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: Infinite/NaN value de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: Infinite/NaN value: de.uni_freiburg.informatik.ultimate.logic.Theory.constant(Theory.java:467) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-04-27 13:14:38,680 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...