/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_unwindbound50.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 12:59:13,413 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 12:59:13,416 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 12:59:13,455 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 12:59:13,456 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 12:59:13,457 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 12:59:13,460 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 12:59:13,464 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 12:59:13,466 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 12:59:13,470 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 12:59:13,470 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 12:59:13,472 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 12:59:13,472 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 12:59:13,474 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 12:59:13,475 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 12:59:13,477 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 12:59:13,478 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 12:59:13,479 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 12:59:13,481 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 12:59:13,486 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 12:59:13,487 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 12:59:13,489 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 12:59:13,489 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 12:59:13,490 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 12:59:13,491 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 12:59:13,498 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 12:59:13,498 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 12:59:13,498 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 12:59:13,499 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 12:59:13,500 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 12:59:13,500 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 12:59:13,501 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 12:59:13,502 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 12:59:13,503 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 12:59:13,503 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 12:59:13,504 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 12:59:13,504 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 12:59:13,505 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 12:59:13,505 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 12:59:13,505 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 12:59:13,506 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 12:59:13,507 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 12:59:13,508 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-04-27 12:59:13,542 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 12:59:13,542 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 12:59:13,543 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 12:59:13,543 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 12:59:13,543 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 12:59:13,544 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 12:59:13,544 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 12:59:13,544 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 12:59:13,544 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 12:59:13,545 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 12:59:13,545 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 12:59:13,545 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 12:59:13,546 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 12:59:13,546 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 12:59:13,546 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 12:59:13,546 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 12:59:13,546 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 12:59:13,546 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 12:59:13,546 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 12:59:13,546 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 12:59:13,547 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 12:59:13,547 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 12:59:13,547 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 12:59:13,547 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 12:59:13,547 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 12:59:13,547 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 12:59:13,548 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 12:59:13,548 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 12:59:13,548 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 12:59:13,548 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 12:59:13,548 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 12:59:13,548 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 12:59:13,548 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 12:59:13,549 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-27 12:59:13,805 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 12:59:13,829 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 12:59:13,831 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 12:59:13,832 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 12:59:13,832 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 12:59:13,833 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/egcd2-ll_unwindbound50.c [2022-04-27 12:59:13,884 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/49847c7cf/4cff55b0e9954f95939c69ea7a4ee7dc/FLAG6c4ebf357 [2022-04-27 12:59:14,244 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 12:59:14,244 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/egcd2-ll_unwindbound50.c [2022-04-27 12:59:14,253 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/49847c7cf/4cff55b0e9954f95939c69ea7a4ee7dc/FLAG6c4ebf357 [2022-04-27 12:59:14,642 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/49847c7cf/4cff55b0e9954f95939c69ea7a4ee7dc [2022-04-27 12:59:14,644 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 12:59:14,646 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 12:59:14,649 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 12:59:14,649 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 12:59:14,652 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 12:59:14,653 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 12:59:14" (1/1) ... [2022-04-27 12:59:14,654 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42665acc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:59:14, skipping insertion in model container [2022-04-27 12:59:14,654 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 12:59:14" (1/1) ... [2022-04-27 12:59:14,660 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 12:59:14,678 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 12:59:14,838 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_unwindbound50.c[490,503] [2022-04-27 12:59:14,863 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 12:59:14,871 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 12:59:14,881 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_unwindbound50.c[490,503] [2022-04-27 12:59:14,891 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 12:59:14,906 INFO L208 MainTranslator]: Completed translation [2022-04-27 12:59:14,906 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:59:14 WrapperNode [2022-04-27 12:59:14,907 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 12:59:14,907 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 12:59:14,907 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 12:59:14,907 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 12:59:14,915 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:59:14" (1/1) ... [2022-04-27 12:59:14,915 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:59:14" (1/1) ... [2022-04-27 12:59:14,920 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:59:14" (1/1) ... [2022-04-27 12:59:14,920 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:59:14" (1/1) ... [2022-04-27 12:59:14,926 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:59:14" (1/1) ... [2022-04-27 12:59:14,930 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:59:14" (1/1) ... [2022-04-27 12:59:14,931 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:59:14" (1/1) ... [2022-04-27 12:59:14,933 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 12:59:14,933 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 12:59:14,933 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 12:59:14,934 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 12:59:14,934 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:59:14" (1/1) ... [2022-04-27 12:59:14,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 12:59:14,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:59:14,961 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-27 12:59:14,979 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-27 12:59:15,012 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 12:59:15,012 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 12:59:15,012 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 12:59:15,012 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 12:59:15,012 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 12:59:15,013 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 12:59:15,013 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 12:59:15,013 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 12:59:15,013 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 12:59:15,013 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 12:59:15,013 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 12:59:15,013 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 12:59:15,013 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 12:59:15,013 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 12:59:15,014 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 12:59:15,014 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 12:59:15,014 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 12:59:15,014 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 12:59:15,014 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 12:59:15,014 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 12:59:15,068 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 12:59:15,070 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 12:59:15,304 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 12:59:15,311 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 12:59:15,311 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-27 12:59:15,312 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 12:59:15 BoogieIcfgContainer [2022-04-27 12:59:15,312 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 12:59:15,314 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 12:59:15,314 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 12:59:15,317 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 12:59:15,317 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 12:59:14" (1/3) ... [2022-04-27 12:59:15,318 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40a2bc68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 12:59:15, skipping insertion in model container [2022-04-27 12:59:15,318 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:59:14" (2/3) ... [2022-04-27 12:59:15,318 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40a2bc68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 12:59:15, skipping insertion in model container [2022-04-27 12:59:15,318 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 12:59:15" (3/3) ... [2022-04-27 12:59:15,319 INFO L111 eAbstractionObserver]: Analyzing ICFG egcd2-ll_unwindbound50.c [2022-04-27 12:59:15,340 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 12:59:15,340 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 12:59:15,395 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 12:59:15,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@57ab7d2d, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@4b944417 [2022-04-27 12:59:15,405 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 12:59:15,415 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 23 states have internal predecessors, (30), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 12:59:15,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-27 12:59:15,421 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:59:15,422 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:59:15,422 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:59:15,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:59:15,427 INFO L85 PathProgramCache]: Analyzing trace with hash 1950618521, now seen corresponding path program 1 times [2022-04-27 12:59:15,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:59:15,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547651934] [2022-04-27 12:59:15,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:59:15,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:59:15,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:59:15,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 12:59:15,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:59:15,671 INFO L290 TraceCheckUtils]: 0: Hoare triple {63#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {42#true} is VALID [2022-04-27 12:59:15,672 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#true} assume true; {42#true} is VALID [2022-04-27 12:59:15,672 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {42#true} {42#true} #98#return; {42#true} is VALID [2022-04-27 12:59:15,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 12:59:15,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:59:15,689 INFO L290 TraceCheckUtils]: 0: Hoare triple {42#true} ~cond := #in~cond; {42#true} is VALID [2022-04-27 12:59:15,690 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#true} assume 0 == ~cond;assume false; {43#false} is VALID [2022-04-27 12:59:15,690 INFO L290 TraceCheckUtils]: 2: Hoare triple {43#false} assume true; {43#false} is VALID [2022-04-27 12:59:15,691 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43#false} {42#true} #78#return; {43#false} is VALID [2022-04-27 12:59:15,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-27 12:59:15,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:59:15,705 INFO L290 TraceCheckUtils]: 0: Hoare triple {42#true} ~cond := #in~cond; {42#true} is VALID [2022-04-27 12:59:15,706 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#true} assume 0 == ~cond;assume false; {43#false} is VALID [2022-04-27 12:59:15,707 INFO L290 TraceCheckUtils]: 2: Hoare triple {43#false} assume true; {43#false} is VALID [2022-04-27 12:59:15,707 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43#false} {43#false} #80#return; {43#false} is VALID [2022-04-27 12:59:15,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-27 12:59:15,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:59:15,715 INFO L290 TraceCheckUtils]: 0: Hoare triple {42#true} ~cond := #in~cond; {42#true} is VALID [2022-04-27 12:59:15,715 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#true} assume 0 == ~cond;assume false; {43#false} is VALID [2022-04-27 12:59:15,716 INFO L290 TraceCheckUtils]: 2: Hoare triple {43#false} assume true; {43#false} is VALID [2022-04-27 12:59:15,716 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43#false} {43#false} #82#return; {43#false} is VALID [2022-04-27 12:59:15,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-04-27 12:59:15,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:59:15,726 INFO L290 TraceCheckUtils]: 0: Hoare triple {42#true} ~cond := #in~cond; {42#true} is VALID [2022-04-27 12:59:15,727 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#true} assume 0 == ~cond;assume false; {43#false} is VALID [2022-04-27 12:59:15,727 INFO L290 TraceCheckUtils]: 2: Hoare triple {43#false} assume true; {43#false} is VALID [2022-04-27 12:59:15,728 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43#false} {43#false} #84#return; {43#false} is VALID [2022-04-27 12:59:15,729 INFO L272 TraceCheckUtils]: 0: Hoare triple {42#true} call ULTIMATE.init(); {63#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 12:59:15,729 INFO L290 TraceCheckUtils]: 1: Hoare triple {63#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {42#true} is VALID [2022-04-27 12:59:15,730 INFO L290 TraceCheckUtils]: 2: Hoare triple {42#true} assume true; {42#true} is VALID [2022-04-27 12:59:15,730 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42#true} {42#true} #98#return; {42#true} is VALID [2022-04-27 12:59:15,730 INFO L272 TraceCheckUtils]: 4: Hoare triple {42#true} call #t~ret8 := main(); {42#true} is VALID [2022-04-27 12:59:15,730 INFO L290 TraceCheckUtils]: 5: Hoare triple {42#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {42#true} is VALID [2022-04-27 12:59:15,730 INFO L272 TraceCheckUtils]: 6: Hoare triple {42#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {42#true} is VALID [2022-04-27 12:59:15,730 INFO L290 TraceCheckUtils]: 7: Hoare triple {42#true} ~cond := #in~cond; {42#true} is VALID [2022-04-27 12:59:15,732 INFO L290 TraceCheckUtils]: 8: Hoare triple {42#true} assume 0 == ~cond;assume false; {43#false} is VALID [2022-04-27 12:59:15,732 INFO L290 TraceCheckUtils]: 9: Hoare triple {43#false} assume true; {43#false} is VALID [2022-04-27 12:59:15,733 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {43#false} {42#true} #78#return; {43#false} is VALID [2022-04-27 12:59:15,733 INFO L272 TraceCheckUtils]: 11: Hoare triple {43#false} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {42#true} is VALID [2022-04-27 12:59:15,733 INFO L290 TraceCheckUtils]: 12: Hoare triple {42#true} ~cond := #in~cond; {42#true} is VALID [2022-04-27 12:59:15,734 INFO L290 TraceCheckUtils]: 13: Hoare triple {42#true} assume 0 == ~cond;assume false; {43#false} is VALID [2022-04-27 12:59:15,734 INFO L290 TraceCheckUtils]: 14: Hoare triple {43#false} assume true; {43#false} is VALID [2022-04-27 12:59:15,735 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {43#false} {43#false} #80#return; {43#false} is VALID [2022-04-27 12:59:15,735 INFO L290 TraceCheckUtils]: 16: Hoare triple {43#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; {43#false} is VALID [2022-04-27 12:59:15,735 INFO L272 TraceCheckUtils]: 17: Hoare triple {43#false} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {42#true} is VALID [2022-04-27 12:59:15,735 INFO L290 TraceCheckUtils]: 18: Hoare triple {42#true} ~cond := #in~cond; {42#true} is VALID [2022-04-27 12:59:15,736 INFO L290 TraceCheckUtils]: 19: Hoare triple {42#true} assume 0 == ~cond;assume false; {43#false} is VALID [2022-04-27 12:59:15,736 INFO L290 TraceCheckUtils]: 20: Hoare triple {43#false} assume true; {43#false} is VALID [2022-04-27 12:59:15,736 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {43#false} {43#false} #82#return; {43#false} is VALID [2022-04-27 12:59:15,737 INFO L272 TraceCheckUtils]: 22: Hoare triple {43#false} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {42#true} is VALID [2022-04-27 12:59:15,737 INFO L290 TraceCheckUtils]: 23: Hoare triple {42#true} ~cond := #in~cond; {42#true} is VALID [2022-04-27 12:59:15,738 INFO L290 TraceCheckUtils]: 24: Hoare triple {42#true} assume 0 == ~cond;assume false; {43#false} is VALID [2022-04-27 12:59:15,738 INFO L290 TraceCheckUtils]: 25: Hoare triple {43#false} assume true; {43#false} is VALID [2022-04-27 12:59:15,738 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {43#false} {43#false} #84#return; {43#false} is VALID [2022-04-27 12:59:15,738 INFO L290 TraceCheckUtils]: 27: Hoare triple {43#false} assume !true; {43#false} is VALID [2022-04-27 12:59:15,738 INFO L272 TraceCheckUtils]: 28: Hoare triple {43#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {43#false} is VALID [2022-04-27 12:59:15,739 INFO L290 TraceCheckUtils]: 29: Hoare triple {43#false} ~cond := #in~cond; {43#false} is VALID [2022-04-27 12:59:15,739 INFO L290 TraceCheckUtils]: 30: Hoare triple {43#false} assume 0 == ~cond; {43#false} is VALID [2022-04-27 12:59:15,739 INFO L290 TraceCheckUtils]: 31: Hoare triple {43#false} assume !false; {43#false} is VALID [2022-04-27 12:59:15,740 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-27 12:59:15,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:59:15,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547651934] [2022-04-27 12:59:15,742 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547651934] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 12:59:15,742 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 12:59:15,742 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 12:59:15,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422925872] [2022-04-27 12:59:15,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:59:15,749 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 32 [2022-04-27 12:59:15,750 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:59:15,756 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 12:59:15,799 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:59:15,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 12:59:15,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:59:15,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 12:59:15,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 12:59:15,832 INFO L87 Difference]: Start difference. First operand has 39 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 23 states have internal predecessors, (30), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 12:59:15,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:59:15,996 INFO L93 Difference]: Finished difference Result 72 states and 112 transitions. [2022-04-27 12:59:15,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 12:59:15,996 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 32 [2022-04-27 12:59:15,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:59:15,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 12:59:16,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 112 transitions. [2022-04-27 12:59:16,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 12:59:16,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 112 transitions. [2022-04-27 12:59:16,013 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 112 transitions. [2022-04-27 12:59:16,125 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:59:16,133 INFO L225 Difference]: With dead ends: 72 [2022-04-27 12:59:16,133 INFO L226 Difference]: Without dead ends: 35 [2022-04-27 12:59:16,136 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 12:59:16,138 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 10 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 12:59:16,139 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 49 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 12:59:16,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-27 12:59:16,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2022-04-27 12:59:16,164 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:59:16,165 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 34 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 20 states have internal predecessors, (23), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 12:59:16,166 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 34 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 20 states have internal predecessors, (23), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 12:59:16,166 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 34 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 20 states have internal predecessors, (23), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 12:59:16,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:59:16,171 INFO L93 Difference]: Finished difference Result 35 states and 46 transitions. [2022-04-27 12:59:16,171 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 46 transitions. [2022-04-27 12:59:16,172 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:59:16,172 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:59:16,173 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 20 states have internal predecessors, (23), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 35 states. [2022-04-27 12:59:16,173 INFO L87 Difference]: Start difference. First operand has 34 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 20 states have internal predecessors, (23), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 35 states. [2022-04-27 12:59:16,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:59:16,177 INFO L93 Difference]: Finished difference Result 35 states and 46 transitions. [2022-04-27 12:59:16,177 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 46 transitions. [2022-04-27 12:59:16,178 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:59:16,178 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:59:16,178 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:59:16,178 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:59:16,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 20 states have internal predecessors, (23), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 12:59:16,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 45 transitions. [2022-04-27 12:59:16,183 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 45 transitions. Word has length 32 [2022-04-27 12:59:16,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:59:16,183 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 45 transitions. [2022-04-27 12:59:16,183 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 12:59:16,184 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 45 transitions. [2022-04-27 12:59:16,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-27 12:59:16,185 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:59:16,185 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:59:16,185 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 12:59:16,185 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:59:16,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:59:16,186 INFO L85 PathProgramCache]: Analyzing trace with hash -1734391985, now seen corresponding path program 1 times [2022-04-27 12:59:16,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:59:16,187 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600883643] [2022-04-27 12:59:16,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:59:16,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:59:16,205 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:59:16,205 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1108381938] [2022-04-27 12:59:16,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:59:16,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:59:16,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:59:16,211 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 12:59:16,251 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-27 12:59:16,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:59:16,339 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-27 12:59:16,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:59:16,376 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:59:16,576 INFO L272 TraceCheckUtils]: 0: Hoare triple {292#true} call ULTIMATE.init(); {292#true} is VALID [2022-04-27 12:59:16,577 INFO L290 TraceCheckUtils]: 1: Hoare triple {292#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);~counter~0 := 0; {300#(<= ~counter~0 0)} is VALID [2022-04-27 12:59:16,577 INFO L290 TraceCheckUtils]: 2: Hoare triple {300#(<= ~counter~0 0)} assume true; {300#(<= ~counter~0 0)} is VALID [2022-04-27 12:59:16,578 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {300#(<= ~counter~0 0)} {292#true} #98#return; {300#(<= ~counter~0 0)} is VALID [2022-04-27 12:59:16,578 INFO L272 TraceCheckUtils]: 4: Hoare triple {300#(<= ~counter~0 0)} call #t~ret8 := main(); {300#(<= ~counter~0 0)} is VALID [2022-04-27 12:59:16,579 INFO L290 TraceCheckUtils]: 5: Hoare triple {300#(<= ~counter~0 0)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {300#(<= ~counter~0 0)} is VALID [2022-04-27 12:59:16,579 INFO L272 TraceCheckUtils]: 6: Hoare triple {300#(<= ~counter~0 0)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {300#(<= ~counter~0 0)} is VALID [2022-04-27 12:59:16,580 INFO L290 TraceCheckUtils]: 7: Hoare triple {300#(<= ~counter~0 0)} ~cond := #in~cond; {300#(<= ~counter~0 0)} is VALID [2022-04-27 12:59:16,580 INFO L290 TraceCheckUtils]: 8: Hoare triple {300#(<= ~counter~0 0)} assume !(0 == ~cond); {300#(<= ~counter~0 0)} is VALID [2022-04-27 12:59:16,581 INFO L290 TraceCheckUtils]: 9: Hoare triple {300#(<= ~counter~0 0)} assume true; {300#(<= ~counter~0 0)} is VALID [2022-04-27 12:59:16,581 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {300#(<= ~counter~0 0)} {300#(<= ~counter~0 0)} #78#return; {300#(<= ~counter~0 0)} is VALID [2022-04-27 12:59:16,582 INFO L272 TraceCheckUtils]: 11: Hoare triple {300#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {300#(<= ~counter~0 0)} is VALID [2022-04-27 12:59:16,583 INFO L290 TraceCheckUtils]: 12: Hoare triple {300#(<= ~counter~0 0)} ~cond := #in~cond; {300#(<= ~counter~0 0)} is VALID [2022-04-27 12:59:16,583 INFO L290 TraceCheckUtils]: 13: Hoare triple {300#(<= ~counter~0 0)} assume !(0 == ~cond); {300#(<= ~counter~0 0)} is VALID [2022-04-27 12:59:16,583 INFO L290 TraceCheckUtils]: 14: Hoare triple {300#(<= ~counter~0 0)} assume true; {300#(<= ~counter~0 0)} is VALID [2022-04-27 12:59:16,584 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {300#(<= ~counter~0 0)} {300#(<= ~counter~0 0)} #80#return; {300#(<= ~counter~0 0)} is VALID [2022-04-27 12:59:16,584 INFO L290 TraceCheckUtils]: 16: Hoare triple {300#(<= ~counter~0 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; {300#(<= ~counter~0 0)} is VALID [2022-04-27 12:59:16,585 INFO L272 TraceCheckUtils]: 17: Hoare triple {300#(<= ~counter~0 0)} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {300#(<= ~counter~0 0)} is VALID [2022-04-27 12:59:16,586 INFO L290 TraceCheckUtils]: 18: Hoare triple {300#(<= ~counter~0 0)} ~cond := #in~cond; {300#(<= ~counter~0 0)} is VALID [2022-04-27 12:59:16,586 INFO L290 TraceCheckUtils]: 19: Hoare triple {300#(<= ~counter~0 0)} assume !(0 == ~cond); {300#(<= ~counter~0 0)} is VALID [2022-04-27 12:59:16,586 INFO L290 TraceCheckUtils]: 20: Hoare triple {300#(<= ~counter~0 0)} assume true; {300#(<= ~counter~0 0)} is VALID [2022-04-27 12:59:16,587 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {300#(<= ~counter~0 0)} {300#(<= ~counter~0 0)} #82#return; {300#(<= ~counter~0 0)} is VALID [2022-04-27 12:59:16,588 INFO L272 TraceCheckUtils]: 22: Hoare triple {300#(<= ~counter~0 0)} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {300#(<= ~counter~0 0)} is VALID [2022-04-27 12:59:16,588 INFO L290 TraceCheckUtils]: 23: Hoare triple {300#(<= ~counter~0 0)} ~cond := #in~cond; {300#(<= ~counter~0 0)} is VALID [2022-04-27 12:59:16,589 INFO L290 TraceCheckUtils]: 24: Hoare triple {300#(<= ~counter~0 0)} assume !(0 == ~cond); {300#(<= ~counter~0 0)} is VALID [2022-04-27 12:59:16,589 INFO L290 TraceCheckUtils]: 25: Hoare triple {300#(<= ~counter~0 0)} assume true; {300#(<= ~counter~0 0)} is VALID [2022-04-27 12:59:16,590 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {300#(<= ~counter~0 0)} {300#(<= ~counter~0 0)} #84#return; {300#(<= ~counter~0 0)} is VALID [2022-04-27 12:59:16,590 INFO L290 TraceCheckUtils]: 27: Hoare triple {300#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {379#(<= |main_#t~post6| 0)} is VALID [2022-04-27 12:59:16,591 INFO L290 TraceCheckUtils]: 28: Hoare triple {379#(<= |main_#t~post6| 0)} assume !(#t~post6 < 50);havoc #t~post6; {293#false} is VALID [2022-04-27 12:59:16,591 INFO L272 TraceCheckUtils]: 29: Hoare triple {293#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {293#false} is VALID [2022-04-27 12:59:16,591 INFO L290 TraceCheckUtils]: 30: Hoare triple {293#false} ~cond := #in~cond; {293#false} is VALID [2022-04-27 12:59:16,591 INFO L290 TraceCheckUtils]: 31: Hoare triple {293#false} assume 0 == ~cond; {293#false} is VALID [2022-04-27 12:59:16,592 INFO L290 TraceCheckUtils]: 32: Hoare triple {293#false} assume !false; {293#false} is VALID [2022-04-27 12:59:16,592 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-27 12:59:16,592 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 12:59:16,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:59:16,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600883643] [2022-04-27 12:59:16,593 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:59:16,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1108381938] [2022-04-27 12:59:16,593 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1108381938] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 12:59:16,593 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 12:59:16,594 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 12:59:16,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309174254] [2022-04-27 12:59:16,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:59:16,595 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 33 [2022-04-27 12:59:16,596 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:59:16,596 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 12:59:16,618 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:59:16,618 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 12:59:16,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:59:16,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 12:59:16,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 12:59:16,619 INFO L87 Difference]: Start difference. First operand 34 states and 45 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 12:59:16,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:59:16,708 INFO L93 Difference]: Finished difference Result 44 states and 56 transitions. [2022-04-27 12:59:16,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 12:59:16,709 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 33 [2022-04-27 12:59:16,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:59:16,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 12:59:16,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 56 transitions. [2022-04-27 12:59:16,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 12:59:16,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 56 transitions. [2022-04-27 12:59:16,714 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 56 transitions. [2022-04-27 12:59:16,763 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:59:16,765 INFO L225 Difference]: With dead ends: 44 [2022-04-27 12:59:16,765 INFO L226 Difference]: Without dead ends: 36 [2022-04-27 12:59:16,766 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 12:59:16,767 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 0 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 12:59:16,767 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 110 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 12:59:16,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-27 12:59:16,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-04-27 12:59:16,777 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:59:16,777 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 36 states, 20 states have (on average 1.25) internal successors, (25), 21 states have internal predecessors, (25), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 12:59:16,778 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 36 states, 20 states have (on average 1.25) internal successors, (25), 21 states have internal predecessors, (25), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 12:59:16,778 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 36 states, 20 states have (on average 1.25) internal successors, (25), 21 states have internal predecessors, (25), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 12:59:16,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:59:16,781 INFO L93 Difference]: Finished difference Result 36 states and 47 transitions. [2022-04-27 12:59:16,781 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 47 transitions. [2022-04-27 12:59:16,781 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:59:16,782 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:59:16,782 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 20 states have (on average 1.25) internal successors, (25), 21 states have internal predecessors, (25), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 36 states. [2022-04-27 12:59:16,782 INFO L87 Difference]: Start difference. First operand has 36 states, 20 states have (on average 1.25) internal successors, (25), 21 states have internal predecessors, (25), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 36 states. [2022-04-27 12:59:16,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:59:16,785 INFO L93 Difference]: Finished difference Result 36 states and 47 transitions. [2022-04-27 12:59:16,785 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 47 transitions. [2022-04-27 12:59:16,786 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:59:16,786 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:59:16,786 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:59:16,786 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:59:16,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 20 states have (on average 1.25) internal successors, (25), 21 states have internal predecessors, (25), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 12:59:16,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 47 transitions. [2022-04-27 12:59:16,789 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 47 transitions. Word has length 33 [2022-04-27 12:59:16,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:59:16,789 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 47 transitions. [2022-04-27 12:59:16,789 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 12:59:16,789 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 47 transitions. [2022-04-27 12:59:16,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-27 12:59:16,790 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:59:16,790 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:59:16,816 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 12:59:16,999 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 12:59:17,000 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:59:17,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:59:17,000 INFO L85 PathProgramCache]: Analyzing trace with hash 2066454233, now seen corresponding path program 1 times [2022-04-27 12:59:17,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:59:17,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687102868] [2022-04-27 12:59:17,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:59:17,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:59:17,020 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:59:17,020 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2123608532] [2022-04-27 12:59:17,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:59:17,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:59:17,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:59:17,022 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 12:59:17,042 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-27 12:59:17,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:59:17,100 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 12:59:17,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:59:17,119 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:59:17,233 INFO L272 TraceCheckUtils]: 0: Hoare triple {587#true} call ULTIMATE.init(); {587#true} is VALID [2022-04-27 12:59:17,233 INFO L290 TraceCheckUtils]: 1: Hoare triple {587#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);~counter~0 := 0; {587#true} is VALID [2022-04-27 12:59:17,233 INFO L290 TraceCheckUtils]: 2: Hoare triple {587#true} assume true; {587#true} is VALID [2022-04-27 12:59:17,233 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {587#true} {587#true} #98#return; {587#true} is VALID [2022-04-27 12:59:17,233 INFO L272 TraceCheckUtils]: 4: Hoare triple {587#true} call #t~ret8 := main(); {587#true} is VALID [2022-04-27 12:59:17,234 INFO L290 TraceCheckUtils]: 5: Hoare triple {587#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {587#true} is VALID [2022-04-27 12:59:17,234 INFO L272 TraceCheckUtils]: 6: Hoare triple {587#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {587#true} is VALID [2022-04-27 12:59:17,234 INFO L290 TraceCheckUtils]: 7: Hoare triple {587#true} ~cond := #in~cond; {587#true} is VALID [2022-04-27 12:59:17,234 INFO L290 TraceCheckUtils]: 8: Hoare triple {587#true} assume !(0 == ~cond); {587#true} is VALID [2022-04-27 12:59:17,234 INFO L290 TraceCheckUtils]: 9: Hoare triple {587#true} assume true; {587#true} is VALID [2022-04-27 12:59:17,234 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {587#true} {587#true} #78#return; {587#true} is VALID [2022-04-27 12:59:17,234 INFO L272 TraceCheckUtils]: 11: Hoare triple {587#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {587#true} is VALID [2022-04-27 12:59:17,235 INFO L290 TraceCheckUtils]: 12: Hoare triple {587#true} ~cond := #in~cond; {628#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 12:59:17,235 INFO L290 TraceCheckUtils]: 13: Hoare triple {628#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {632#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 12:59:17,236 INFO L290 TraceCheckUtils]: 14: Hoare triple {632#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {632#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 12:59:17,236 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {632#(not (= |assume_abort_if_not_#in~cond| 0))} {587#true} #80#return; {639#(<= 1 main_~y~0)} is VALID [2022-04-27 12:59:17,237 INFO L290 TraceCheckUtils]: 16: Hoare triple {639#(<= 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; {643#(<= 1 main_~b~0)} is VALID [2022-04-27 12:59:17,237 INFO L272 TraceCheckUtils]: 17: Hoare triple {643#(<= 1 main_~b~0)} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {587#true} is VALID [2022-04-27 12:59:17,237 INFO L290 TraceCheckUtils]: 18: Hoare triple {587#true} ~cond := #in~cond; {587#true} is VALID [2022-04-27 12:59:17,237 INFO L290 TraceCheckUtils]: 19: Hoare triple {587#true} assume !(0 == ~cond); {587#true} is VALID [2022-04-27 12:59:17,237 INFO L290 TraceCheckUtils]: 20: Hoare triple {587#true} assume true; {587#true} is VALID [2022-04-27 12:59:17,238 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {587#true} {643#(<= 1 main_~b~0)} #82#return; {643#(<= 1 main_~b~0)} is VALID [2022-04-27 12:59:17,238 INFO L272 TraceCheckUtils]: 22: Hoare triple {643#(<= 1 main_~b~0)} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {587#true} is VALID [2022-04-27 12:59:17,238 INFO L290 TraceCheckUtils]: 23: Hoare triple {587#true} ~cond := #in~cond; {587#true} is VALID [2022-04-27 12:59:17,238 INFO L290 TraceCheckUtils]: 24: Hoare triple {587#true} assume !(0 == ~cond); {587#true} is VALID [2022-04-27 12:59:17,238 INFO L290 TraceCheckUtils]: 25: Hoare triple {587#true} assume true; {587#true} is VALID [2022-04-27 12:59:17,239 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {587#true} {643#(<= 1 main_~b~0)} #84#return; {643#(<= 1 main_~b~0)} is VALID [2022-04-27 12:59:17,239 INFO L290 TraceCheckUtils]: 27: Hoare triple {643#(<= 1 main_~b~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {643#(<= 1 main_~b~0)} is VALID [2022-04-27 12:59:17,240 INFO L290 TraceCheckUtils]: 28: Hoare triple {643#(<= 1 main_~b~0)} assume !!(#t~post6 < 50);havoc #t~post6; {643#(<= 1 main_~b~0)} is VALID [2022-04-27 12:59:17,240 INFO L290 TraceCheckUtils]: 29: Hoare triple {643#(<= 1 main_~b~0)} assume !(0 != ~b~0); {588#false} is VALID [2022-04-27 12:59:17,240 INFO L272 TraceCheckUtils]: 30: Hoare triple {588#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {588#false} is VALID [2022-04-27 12:59:17,240 INFO L290 TraceCheckUtils]: 31: Hoare triple {588#false} ~cond := #in~cond; {588#false} is VALID [2022-04-27 12:59:17,241 INFO L290 TraceCheckUtils]: 32: Hoare triple {588#false} assume 0 == ~cond; {588#false} is VALID [2022-04-27 12:59:17,241 INFO L290 TraceCheckUtils]: 33: Hoare triple {588#false} assume !false; {588#false} is VALID [2022-04-27 12:59:17,241 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-27 12:59:17,241 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:59:17,530 INFO L290 TraceCheckUtils]: 33: Hoare triple {588#false} assume !false; {588#false} is VALID [2022-04-27 12:59:17,530 INFO L290 TraceCheckUtils]: 32: Hoare triple {588#false} assume 0 == ~cond; {588#false} is VALID [2022-04-27 12:59:17,530 INFO L290 TraceCheckUtils]: 31: Hoare triple {588#false} ~cond := #in~cond; {588#false} is VALID [2022-04-27 12:59:17,530 INFO L272 TraceCheckUtils]: 30: Hoare triple {588#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {588#false} is VALID [2022-04-27 12:59:17,539 INFO L290 TraceCheckUtils]: 29: Hoare triple {643#(<= 1 main_~b~0)} assume !(0 != ~b~0); {588#false} is VALID [2022-04-27 12:59:17,539 INFO L290 TraceCheckUtils]: 28: Hoare triple {643#(<= 1 main_~b~0)} assume !!(#t~post6 < 50);havoc #t~post6; {643#(<= 1 main_~b~0)} is VALID [2022-04-27 12:59:17,540 INFO L290 TraceCheckUtils]: 27: Hoare triple {643#(<= 1 main_~b~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {643#(<= 1 main_~b~0)} is VALID [2022-04-27 12:59:17,540 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {587#true} {643#(<= 1 main_~b~0)} #84#return; {643#(<= 1 main_~b~0)} is VALID [2022-04-27 12:59:17,540 INFO L290 TraceCheckUtils]: 25: Hoare triple {587#true} assume true; {587#true} is VALID [2022-04-27 12:59:17,540 INFO L290 TraceCheckUtils]: 24: Hoare triple {587#true} assume !(0 == ~cond); {587#true} is VALID [2022-04-27 12:59:17,540 INFO L290 TraceCheckUtils]: 23: Hoare triple {587#true} ~cond := #in~cond; {587#true} is VALID [2022-04-27 12:59:17,541 INFO L272 TraceCheckUtils]: 22: Hoare triple {643#(<= 1 main_~b~0)} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {587#true} is VALID [2022-04-27 12:59:17,541 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {587#true} {643#(<= 1 main_~b~0)} #82#return; {643#(<= 1 main_~b~0)} is VALID [2022-04-27 12:59:17,541 INFO L290 TraceCheckUtils]: 20: Hoare triple {587#true} assume true; {587#true} is VALID [2022-04-27 12:59:17,542 INFO L290 TraceCheckUtils]: 19: Hoare triple {587#true} assume !(0 == ~cond); {587#true} is VALID [2022-04-27 12:59:17,542 INFO L290 TraceCheckUtils]: 18: Hoare triple {587#true} ~cond := #in~cond; {587#true} is VALID [2022-04-27 12:59:17,542 INFO L272 TraceCheckUtils]: 17: Hoare triple {643#(<= 1 main_~b~0)} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {587#true} is VALID [2022-04-27 12:59:17,542 INFO L290 TraceCheckUtils]: 16: Hoare triple {639#(<= 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; {643#(<= 1 main_~b~0)} is VALID [2022-04-27 12:59:17,543 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {632#(not (= |assume_abort_if_not_#in~cond| 0))} {587#true} #80#return; {639#(<= 1 main_~y~0)} is VALID [2022-04-27 12:59:17,544 INFO L290 TraceCheckUtils]: 14: Hoare triple {632#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {632#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 12:59:17,544 INFO L290 TraceCheckUtils]: 13: Hoare triple {758#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} assume !(0 == ~cond); {632#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 12:59:17,545 INFO L290 TraceCheckUtils]: 12: Hoare triple {587#true} ~cond := #in~cond; {758#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} is VALID [2022-04-27 12:59:17,545 INFO L272 TraceCheckUtils]: 11: Hoare triple {587#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {587#true} is VALID [2022-04-27 12:59:17,545 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {587#true} {587#true} #78#return; {587#true} is VALID [2022-04-27 12:59:17,545 INFO L290 TraceCheckUtils]: 9: Hoare triple {587#true} assume true; {587#true} is VALID [2022-04-27 12:59:17,545 INFO L290 TraceCheckUtils]: 8: Hoare triple {587#true} assume !(0 == ~cond); {587#true} is VALID [2022-04-27 12:59:17,545 INFO L290 TraceCheckUtils]: 7: Hoare triple {587#true} ~cond := #in~cond; {587#true} is VALID [2022-04-27 12:59:17,546 INFO L272 TraceCheckUtils]: 6: Hoare triple {587#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {587#true} is VALID [2022-04-27 12:59:17,546 INFO L290 TraceCheckUtils]: 5: Hoare triple {587#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {587#true} is VALID [2022-04-27 12:59:17,546 INFO L272 TraceCheckUtils]: 4: Hoare triple {587#true} call #t~ret8 := main(); {587#true} is VALID [2022-04-27 12:59:17,546 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {587#true} {587#true} #98#return; {587#true} is VALID [2022-04-27 12:59:17,546 INFO L290 TraceCheckUtils]: 2: Hoare triple {587#true} assume true; {587#true} is VALID [2022-04-27 12:59:17,546 INFO L290 TraceCheckUtils]: 1: Hoare triple {587#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);~counter~0 := 0; {587#true} is VALID [2022-04-27 12:59:17,547 INFO L272 TraceCheckUtils]: 0: Hoare triple {587#true} call ULTIMATE.init(); {587#true} is VALID [2022-04-27 12:59:17,547 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-27 12:59:17,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:59:17,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687102868] [2022-04-27 12:59:17,547 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:59:17,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2123608532] [2022-04-27 12:59:17,548 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2123608532] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 12:59:17,548 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 12:59:17,548 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2022-04-27 12:59:17,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897169956] [2022-04-27 12:59:17,548 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 12:59:17,550 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, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 34 [2022-04-27 12:59:17,551 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:59:17,551 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, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 12:59:17,585 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:59:17,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-27 12:59:17,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:59:17,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-27 12:59:17,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-27 12:59:17,587 INFO L87 Difference]: Start difference. First operand 36 states and 47 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, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 12:59:17,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:59:17,897 INFO L93 Difference]: Finished difference Result 53 states and 71 transitions. [2022-04-27 12:59:17,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 12:59:17,898 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, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 34 [2022-04-27 12:59:17,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:59:17,899 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, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 12:59:17,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 71 transitions. [2022-04-27 12:59:17,904 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, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 12:59:17,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 71 transitions. [2022-04-27 12:59:17,910 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 71 transitions. [2022-04-27 12:59:17,977 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:59:17,985 INFO L225 Difference]: With dead ends: 53 [2022-04-27 12:59:17,985 INFO L226 Difference]: Without dead ends: 45 [2022-04-27 12:59:17,986 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 61 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 12:59:17,989 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 30 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 12:59:17,991 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 135 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 12:59:17,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-27 12:59:18,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 37. [2022-04-27 12:59:18,020 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:59:18,021 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 37 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 12:59:18,021 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 37 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 12:59:18,021 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 37 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 12:59:18,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:59:18,024 INFO L93 Difference]: Finished difference Result 45 states and 62 transitions. [2022-04-27 12:59:18,024 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 62 transitions. [2022-04-27 12:59:18,025 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:59:18,025 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:59:18,026 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 45 states. [2022-04-27 12:59:18,026 INFO L87 Difference]: Start difference. First operand has 37 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 45 states. [2022-04-27 12:59:18,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:59:18,029 INFO L93 Difference]: Finished difference Result 45 states and 62 transitions. [2022-04-27 12:59:18,029 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 62 transitions. [2022-04-27 12:59:18,030 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:59:18,030 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:59:18,030 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:59:18,030 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:59:18,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 12:59:18,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 48 transitions. [2022-04-27 12:59:18,032 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 48 transitions. Word has length 34 [2022-04-27 12:59:18,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:59:18,032 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 48 transitions. [2022-04-27 12:59:18,033 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, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 12:59:18,033 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 48 transitions. [2022-04-27 12:59:18,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-27 12:59:18,034 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:59:18,034 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:59:18,056 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-27 12:59:18,251 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 12:59:18,253 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:59:18,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:59:18,253 INFO L85 PathProgramCache]: Analyzing trace with hash 1678606280, now seen corresponding path program 1 times [2022-04-27 12:59:18,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:59:18,253 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553931417] [2022-04-27 12:59:18,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:59:18,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:59:18,281 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:59:18,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [873529710] [2022-04-27 12:59:18,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:59:18,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:59:18,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:59:18,291 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 12:59:18,294 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-27 12:59:18,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:59:18,347 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-27 12:59:18,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:59:18,374 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:59:18,685 INFO L272 TraceCheckUtils]: 0: Hoare triple {1027#true} call ULTIMATE.init(); {1027#true} is VALID [2022-04-27 12:59:18,685 INFO L290 TraceCheckUtils]: 1: Hoare triple {1027#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);~counter~0 := 0; {1027#true} is VALID [2022-04-27 12:59:18,685 INFO L290 TraceCheckUtils]: 2: Hoare triple {1027#true} assume true; {1027#true} is VALID [2022-04-27 12:59:18,685 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1027#true} {1027#true} #98#return; {1027#true} is VALID [2022-04-27 12:59:18,685 INFO L272 TraceCheckUtils]: 4: Hoare triple {1027#true} call #t~ret8 := main(); {1027#true} is VALID [2022-04-27 12:59:18,686 INFO L290 TraceCheckUtils]: 5: Hoare triple {1027#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {1027#true} is VALID [2022-04-27 12:59:18,686 INFO L272 TraceCheckUtils]: 6: Hoare triple {1027#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {1027#true} is VALID [2022-04-27 12:59:18,686 INFO L290 TraceCheckUtils]: 7: Hoare triple {1027#true} ~cond := #in~cond; {1027#true} is VALID [2022-04-27 12:59:18,687 INFO L290 TraceCheckUtils]: 8: Hoare triple {1027#true} assume !(0 == ~cond); {1027#true} is VALID [2022-04-27 12:59:18,687 INFO L290 TraceCheckUtils]: 9: Hoare triple {1027#true} assume true; {1027#true} is VALID [2022-04-27 12:59:18,687 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1027#true} {1027#true} #78#return; {1027#true} is VALID [2022-04-27 12:59:18,687 INFO L272 TraceCheckUtils]: 11: Hoare triple {1027#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1027#true} is VALID [2022-04-27 12:59:18,688 INFO L290 TraceCheckUtils]: 12: Hoare triple {1027#true} ~cond := #in~cond; {1068#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 12:59:18,688 INFO L290 TraceCheckUtils]: 13: Hoare triple {1068#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {1072#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 12:59:18,689 INFO L290 TraceCheckUtils]: 14: Hoare triple {1072#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {1072#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 12:59:18,689 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1072#(not (= |assume_abort_if_not_#in~cond| 0))} {1027#true} #80#return; {1079#(<= 1 main_~y~0)} is VALID [2022-04-27 12:59:18,690 INFO L290 TraceCheckUtils]: 16: Hoare triple {1079#(<= 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; {1083#(<= 1 main_~b~0)} is VALID [2022-04-27 12:59:18,690 INFO L272 TraceCheckUtils]: 17: Hoare triple {1083#(<= 1 main_~b~0)} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {1027#true} is VALID [2022-04-27 12:59:18,690 INFO L290 TraceCheckUtils]: 18: Hoare triple {1027#true} ~cond := #in~cond; {1027#true} is VALID [2022-04-27 12:59:18,690 INFO L290 TraceCheckUtils]: 19: Hoare triple {1027#true} assume !(0 == ~cond); {1027#true} is VALID [2022-04-27 12:59:18,690 INFO L290 TraceCheckUtils]: 20: Hoare triple {1027#true} assume true; {1027#true} is VALID [2022-04-27 12:59:18,691 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1027#true} {1083#(<= 1 main_~b~0)} #82#return; {1083#(<= 1 main_~b~0)} is VALID [2022-04-27 12:59:18,691 INFO L272 TraceCheckUtils]: 22: Hoare triple {1083#(<= 1 main_~b~0)} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {1027#true} is VALID [2022-04-27 12:59:18,691 INFO L290 TraceCheckUtils]: 23: Hoare triple {1027#true} ~cond := #in~cond; {1027#true} is VALID [2022-04-27 12:59:18,691 INFO L290 TraceCheckUtils]: 24: Hoare triple {1027#true} assume !(0 == ~cond); {1027#true} is VALID [2022-04-27 12:59:18,692 INFO L290 TraceCheckUtils]: 25: Hoare triple {1027#true} assume true; {1027#true} is VALID [2022-04-27 12:59:18,693 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1027#true} {1083#(<= 1 main_~b~0)} #84#return; {1083#(<= 1 main_~b~0)} is VALID [2022-04-27 12:59:18,694 INFO L290 TraceCheckUtils]: 27: Hoare triple {1083#(<= 1 main_~b~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1083#(<= 1 main_~b~0)} is VALID [2022-04-27 12:59:18,694 INFO L290 TraceCheckUtils]: 28: Hoare triple {1083#(<= 1 main_~b~0)} assume !!(#t~post6 < 50);havoc #t~post6; {1083#(<= 1 main_~b~0)} is VALID [2022-04-27 12:59:18,696 INFO L290 TraceCheckUtils]: 29: Hoare triple {1083#(<= 1 main_~b~0)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {1123#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (<= 1 main_~b~0))} is VALID [2022-04-27 12:59:18,697 INFO L290 TraceCheckUtils]: 30: Hoare triple {1123#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (<= 1 main_~b~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {1123#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (<= 1 main_~b~0))} is VALID [2022-04-27 12:59:18,697 INFO L290 TraceCheckUtils]: 31: Hoare triple {1123#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (<= 1 main_~b~0))} assume !!(#t~post7 < 50);havoc #t~post7; {1123#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (<= 1 main_~b~0))} is VALID [2022-04-27 12:59:18,698 INFO L272 TraceCheckUtils]: 32: Hoare triple {1123#(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)); {1133#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:59:18,703 INFO L290 TraceCheckUtils]: 33: Hoare triple {1133#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1137#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:59:18,704 INFO L290 TraceCheckUtils]: 34: Hoare triple {1137#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1028#false} is VALID [2022-04-27 12:59:18,704 INFO L290 TraceCheckUtils]: 35: Hoare triple {1028#false} assume !false; {1028#false} is VALID [2022-04-27 12:59:18,705 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-27 12:59:18,705 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:59:18,916 INFO L290 TraceCheckUtils]: 35: Hoare triple {1028#false} assume !false; {1028#false} is VALID [2022-04-27 12:59:18,917 INFO L290 TraceCheckUtils]: 34: Hoare triple {1137#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1028#false} is VALID [2022-04-27 12:59:18,917 INFO L290 TraceCheckUtils]: 33: Hoare triple {1133#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1137#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:59:18,918 INFO L272 TraceCheckUtils]: 32: Hoare triple {1153#(= 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)); {1133#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:59:18,918 INFO L290 TraceCheckUtils]: 31: Hoare triple {1153#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} assume !!(#t~post7 < 50);havoc #t~post7; {1153#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-27 12:59:18,919 INFO L290 TraceCheckUtils]: 30: Hoare triple {1153#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {1153#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-27 12:59:18,924 INFO L290 TraceCheckUtils]: 29: Hoare triple {1027#true} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {1153#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-27 12:59:18,924 INFO L290 TraceCheckUtils]: 28: Hoare triple {1027#true} assume !!(#t~post6 < 50);havoc #t~post6; {1027#true} is VALID [2022-04-27 12:59:18,927 INFO L290 TraceCheckUtils]: 27: Hoare triple {1027#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1027#true} is VALID [2022-04-27 12:59:18,931 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1027#true} {1027#true} #84#return; {1027#true} is VALID [2022-04-27 12:59:18,932 INFO L290 TraceCheckUtils]: 25: Hoare triple {1027#true} assume true; {1027#true} is VALID [2022-04-27 12:59:18,932 INFO L290 TraceCheckUtils]: 24: Hoare triple {1027#true} assume !(0 == ~cond); {1027#true} is VALID [2022-04-27 12:59:18,932 INFO L290 TraceCheckUtils]: 23: Hoare triple {1027#true} ~cond := #in~cond; {1027#true} is VALID [2022-04-27 12:59:18,932 INFO L272 TraceCheckUtils]: 22: Hoare triple {1027#true} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {1027#true} is VALID [2022-04-27 12:59:18,932 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1027#true} {1027#true} #82#return; {1027#true} is VALID [2022-04-27 12:59:18,932 INFO L290 TraceCheckUtils]: 20: Hoare triple {1027#true} assume true; {1027#true} is VALID [2022-04-27 12:59:18,932 INFO L290 TraceCheckUtils]: 19: Hoare triple {1027#true} assume !(0 == ~cond); {1027#true} is VALID [2022-04-27 12:59:18,932 INFO L290 TraceCheckUtils]: 18: Hoare triple {1027#true} ~cond := #in~cond; {1027#true} is VALID [2022-04-27 12:59:18,932 INFO L272 TraceCheckUtils]: 17: Hoare triple {1027#true} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {1027#true} is VALID [2022-04-27 12:59:18,932 INFO L290 TraceCheckUtils]: 16: Hoare triple {1027#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; {1027#true} is VALID [2022-04-27 12:59:18,933 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1027#true} {1027#true} #80#return; {1027#true} is VALID [2022-04-27 12:59:18,933 INFO L290 TraceCheckUtils]: 14: Hoare triple {1027#true} assume true; {1027#true} is VALID [2022-04-27 12:59:18,933 INFO L290 TraceCheckUtils]: 13: Hoare triple {1027#true} assume !(0 == ~cond); {1027#true} is VALID [2022-04-27 12:59:18,933 INFO L290 TraceCheckUtils]: 12: Hoare triple {1027#true} ~cond := #in~cond; {1027#true} is VALID [2022-04-27 12:59:18,933 INFO L272 TraceCheckUtils]: 11: Hoare triple {1027#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1027#true} is VALID [2022-04-27 12:59:18,933 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1027#true} {1027#true} #78#return; {1027#true} is VALID [2022-04-27 12:59:18,933 INFO L290 TraceCheckUtils]: 9: Hoare triple {1027#true} assume true; {1027#true} is VALID [2022-04-27 12:59:18,933 INFO L290 TraceCheckUtils]: 8: Hoare triple {1027#true} assume !(0 == ~cond); {1027#true} is VALID [2022-04-27 12:59:18,933 INFO L290 TraceCheckUtils]: 7: Hoare triple {1027#true} ~cond := #in~cond; {1027#true} is VALID [2022-04-27 12:59:18,933 INFO L272 TraceCheckUtils]: 6: Hoare triple {1027#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {1027#true} is VALID [2022-04-27 12:59:18,934 INFO L290 TraceCheckUtils]: 5: Hoare triple {1027#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {1027#true} is VALID [2022-04-27 12:59:18,934 INFO L272 TraceCheckUtils]: 4: Hoare triple {1027#true} call #t~ret8 := main(); {1027#true} is VALID [2022-04-27 12:59:18,934 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1027#true} {1027#true} #98#return; {1027#true} is VALID [2022-04-27 12:59:18,934 INFO L290 TraceCheckUtils]: 2: Hoare triple {1027#true} assume true; {1027#true} is VALID [2022-04-27 12:59:18,934 INFO L290 TraceCheckUtils]: 1: Hoare triple {1027#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);~counter~0 := 0; {1027#true} is VALID [2022-04-27 12:59:18,934 INFO L272 TraceCheckUtils]: 0: Hoare triple {1027#true} call ULTIMATE.init(); {1027#true} is VALID [2022-04-27 12:59:18,934 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-27 12:59:18,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:59:18,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553931417] [2022-04-27 12:59:18,935 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:59:18,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [873529710] [2022-04-27 12:59:18,935 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [873529710] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-27 12:59:18,935 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-27 12:59:18,935 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 10 [2022-04-27 12:59:18,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841975308] [2022-04-27 12:59:18,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:59:18,936 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 36 [2022-04-27 12:59:18,936 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:59:18,936 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-27 12:59:18,960 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:59:18,960 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 12:59:18,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:59:18,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 12:59:18,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-04-27 12:59:18,962 INFO L87 Difference]: Start difference. First operand 37 states and 48 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-27 12:59:19,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:59:19,228 INFO L93 Difference]: Finished difference Result 43 states and 53 transitions. [2022-04-27 12:59:19,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 12:59:19,228 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 36 [2022-04-27 12:59:19,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:59:19,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-27 12:59:19,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 50 transitions. [2022-04-27 12:59:19,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-27 12:59:19,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 50 transitions. [2022-04-27 12:59:19,233 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 50 transitions. [2022-04-27 12:59:19,281 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 12:59:19,284 INFO L225 Difference]: With dead ends: 43 [2022-04-27 12:59:19,284 INFO L226 Difference]: Without dead ends: 41 [2022-04-27 12:59:19,285 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-04-27 12:59:19,288 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 7 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 131 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 12:59:19,290 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 131 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 12:59:19,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-04-27 12:59:19,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2022-04-27 12:59:19,314 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:59:19,315 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand has 41 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 12 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 12:59:19,316 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand has 41 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 12 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 12:59:19,316 INFO L87 Difference]: Start difference. First operand 41 states. Second operand has 41 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 12 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 12:59:19,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:59:19,320 INFO L93 Difference]: Finished difference Result 41 states and 51 transitions. [2022-04-27 12:59:19,320 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 51 transitions. [2022-04-27 12:59:19,321 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:59:19,321 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:59:19,322 INFO L74 IsIncluded]: Start isIncluded. First operand has 41 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 12 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 41 states. [2022-04-27 12:59:19,325 INFO L87 Difference]: Start difference. First operand has 41 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 12 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 41 states. [2022-04-27 12:59:19,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:59:19,330 INFO L93 Difference]: Finished difference Result 41 states and 51 transitions. [2022-04-27 12:59:19,330 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 51 transitions. [2022-04-27 12:59:19,332 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:59:19,332 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:59:19,332 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:59:19,333 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:59:19,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 12 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 12:59:19,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 51 transitions. [2022-04-27 12:59:19,336 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 51 transitions. Word has length 36 [2022-04-27 12:59:19,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:59:19,336 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 51 transitions. [2022-04-27 12:59:19,336 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-27 12:59:19,336 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 51 transitions. [2022-04-27 12:59:19,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-27 12:59:19,337 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:59:19,337 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:59:19,357 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-27 12:59:19,551 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 12:59:19,552 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:59:19,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:59:19,552 INFO L85 PathProgramCache]: Analyzing trace with hash -2124209112, now seen corresponding path program 1 times [2022-04-27 12:59:19,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:59:19,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205633730] [2022-04-27 12:59:19,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:59:19,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:59:19,588 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:59:19,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [338742655] [2022-04-27 12:59:19,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:59:19,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:59:19,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:59:19,592 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 12:59:19,593 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-27 12:59:19,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:59:19,642 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 12:59:19,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:59:19,655 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:59:19,819 INFO L272 TraceCheckUtils]: 0: Hoare triple {1460#true} call ULTIMATE.init(); {1460#true} is VALID [2022-04-27 12:59:19,820 INFO L290 TraceCheckUtils]: 1: Hoare triple {1460#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);~counter~0 := 0; {1468#(<= ~counter~0 0)} is VALID [2022-04-27 12:59:19,820 INFO L290 TraceCheckUtils]: 2: Hoare triple {1468#(<= ~counter~0 0)} assume true; {1468#(<= ~counter~0 0)} is VALID [2022-04-27 12:59:19,820 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1468#(<= ~counter~0 0)} {1460#true} #98#return; {1468#(<= ~counter~0 0)} is VALID [2022-04-27 12:59:19,821 INFO L272 TraceCheckUtils]: 4: Hoare triple {1468#(<= ~counter~0 0)} call #t~ret8 := main(); {1468#(<= ~counter~0 0)} is VALID [2022-04-27 12:59:19,821 INFO L290 TraceCheckUtils]: 5: Hoare triple {1468#(<= ~counter~0 0)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {1468#(<= ~counter~0 0)} is VALID [2022-04-27 12:59:19,822 INFO L272 TraceCheckUtils]: 6: Hoare triple {1468#(<= ~counter~0 0)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {1468#(<= ~counter~0 0)} is VALID [2022-04-27 12:59:19,822 INFO L290 TraceCheckUtils]: 7: Hoare triple {1468#(<= ~counter~0 0)} ~cond := #in~cond; {1468#(<= ~counter~0 0)} is VALID [2022-04-27 12:59:19,822 INFO L290 TraceCheckUtils]: 8: Hoare triple {1468#(<= ~counter~0 0)} assume !(0 == ~cond); {1468#(<= ~counter~0 0)} is VALID [2022-04-27 12:59:19,823 INFO L290 TraceCheckUtils]: 9: Hoare triple {1468#(<= ~counter~0 0)} assume true; {1468#(<= ~counter~0 0)} is VALID [2022-04-27 12:59:19,823 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1468#(<= ~counter~0 0)} {1468#(<= ~counter~0 0)} #78#return; {1468#(<= ~counter~0 0)} is VALID [2022-04-27 12:59:19,824 INFO L272 TraceCheckUtils]: 11: Hoare triple {1468#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1468#(<= ~counter~0 0)} is VALID [2022-04-27 12:59:19,824 INFO L290 TraceCheckUtils]: 12: Hoare triple {1468#(<= ~counter~0 0)} ~cond := #in~cond; {1468#(<= ~counter~0 0)} is VALID [2022-04-27 12:59:19,824 INFO L290 TraceCheckUtils]: 13: Hoare triple {1468#(<= ~counter~0 0)} assume !(0 == ~cond); {1468#(<= ~counter~0 0)} is VALID [2022-04-27 12:59:19,825 INFO L290 TraceCheckUtils]: 14: Hoare triple {1468#(<= ~counter~0 0)} assume true; {1468#(<= ~counter~0 0)} is VALID [2022-04-27 12:59:19,825 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1468#(<= ~counter~0 0)} {1468#(<= ~counter~0 0)} #80#return; {1468#(<= ~counter~0 0)} is VALID [2022-04-27 12:59:19,826 INFO L290 TraceCheckUtils]: 16: Hoare triple {1468#(<= ~counter~0 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; {1468#(<= ~counter~0 0)} is VALID [2022-04-27 12:59:19,826 INFO L272 TraceCheckUtils]: 17: Hoare triple {1468#(<= ~counter~0 0)} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {1468#(<= ~counter~0 0)} is VALID [2022-04-27 12:59:19,826 INFO L290 TraceCheckUtils]: 18: Hoare triple {1468#(<= ~counter~0 0)} ~cond := #in~cond; {1468#(<= ~counter~0 0)} is VALID [2022-04-27 12:59:19,827 INFO L290 TraceCheckUtils]: 19: Hoare triple {1468#(<= ~counter~0 0)} assume !(0 == ~cond); {1468#(<= ~counter~0 0)} is VALID [2022-04-27 12:59:19,827 INFO L290 TraceCheckUtils]: 20: Hoare triple {1468#(<= ~counter~0 0)} assume true; {1468#(<= ~counter~0 0)} is VALID [2022-04-27 12:59:19,827 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1468#(<= ~counter~0 0)} {1468#(<= ~counter~0 0)} #82#return; {1468#(<= ~counter~0 0)} is VALID [2022-04-27 12:59:19,828 INFO L272 TraceCheckUtils]: 22: Hoare triple {1468#(<= ~counter~0 0)} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {1468#(<= ~counter~0 0)} is VALID [2022-04-27 12:59:19,829 INFO L290 TraceCheckUtils]: 23: Hoare triple {1468#(<= ~counter~0 0)} ~cond := #in~cond; {1468#(<= ~counter~0 0)} is VALID [2022-04-27 12:59:19,831 INFO L290 TraceCheckUtils]: 24: Hoare triple {1468#(<= ~counter~0 0)} assume !(0 == ~cond); {1468#(<= ~counter~0 0)} is VALID [2022-04-27 12:59:19,831 INFO L290 TraceCheckUtils]: 25: Hoare triple {1468#(<= ~counter~0 0)} assume true; {1468#(<= ~counter~0 0)} is VALID [2022-04-27 12:59:19,832 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1468#(<= ~counter~0 0)} {1468#(<= ~counter~0 0)} #84#return; {1468#(<= ~counter~0 0)} is VALID [2022-04-27 12:59:19,833 INFO L290 TraceCheckUtils]: 27: Hoare triple {1468#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1547#(<= ~counter~0 1)} is VALID [2022-04-27 12:59:19,833 INFO L290 TraceCheckUtils]: 28: Hoare triple {1547#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {1547#(<= ~counter~0 1)} is VALID [2022-04-27 12:59:19,833 INFO L290 TraceCheckUtils]: 29: Hoare triple {1547#(<= ~counter~0 1)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {1547#(<= ~counter~0 1)} is VALID [2022-04-27 12:59:19,834 INFO L290 TraceCheckUtils]: 30: Hoare triple {1547#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {1557#(<= |main_#t~post7| 1)} is VALID [2022-04-27 12:59:19,836 INFO L290 TraceCheckUtils]: 31: Hoare triple {1557#(<= |main_#t~post7| 1)} assume !(#t~post7 < 50);havoc #t~post7; {1461#false} is VALID [2022-04-27 12:59:19,837 INFO L290 TraceCheckUtils]: 32: Hoare triple {1461#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; {1461#false} is VALID [2022-04-27 12:59:19,837 INFO L290 TraceCheckUtils]: 33: Hoare triple {1461#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1461#false} is VALID [2022-04-27 12:59:19,837 INFO L290 TraceCheckUtils]: 34: Hoare triple {1461#false} assume !(#t~post6 < 50);havoc #t~post6; {1461#false} is VALID [2022-04-27 12:59:19,837 INFO L272 TraceCheckUtils]: 35: Hoare triple {1461#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {1461#false} is VALID [2022-04-27 12:59:19,837 INFO L290 TraceCheckUtils]: 36: Hoare triple {1461#false} ~cond := #in~cond; {1461#false} is VALID [2022-04-27 12:59:19,837 INFO L290 TraceCheckUtils]: 37: Hoare triple {1461#false} assume 0 == ~cond; {1461#false} is VALID [2022-04-27 12:59:19,837 INFO L290 TraceCheckUtils]: 38: Hoare triple {1461#false} assume !false; {1461#false} is VALID [2022-04-27 12:59:19,837 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-27 12:59:19,837 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 12:59:19,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:59:19,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205633730] [2022-04-27 12:59:19,838 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:59:19,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [338742655] [2022-04-27 12:59:19,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [338742655] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 12:59:19,838 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 12:59:19,838 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 12:59:19,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84931507] [2022-04-27 12:59:19,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:59:19,839 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 39 [2022-04-27 12:59:19,839 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:59:19,839 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 12:59:19,861 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:59:19,861 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 12:59:19,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:59:19,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 12:59:19,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-27 12:59:19,862 INFO L87 Difference]: Start difference. First operand 41 states and 51 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 12:59:20,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:59:20,004 INFO L93 Difference]: Finished difference Result 66 states and 84 transitions. [2022-04-27 12:59:20,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 12:59:20,004 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 39 [2022-04-27 12:59:20,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:59:20,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 12:59:20,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 78 transitions. [2022-04-27 12:59:20,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 12:59:20,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 78 transitions. [2022-04-27 12:59:20,008 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 78 transitions. [2022-04-27 12:59:20,072 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:59:20,074 INFO L225 Difference]: With dead ends: 66 [2022-04-27 12:59:20,074 INFO L226 Difference]: Without dead ends: 43 [2022-04-27 12:59:20,074 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-27 12:59:20,075 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 6 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 12:59:20,075 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 110 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 12:59:20,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-04-27 12:59:20,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2022-04-27 12:59:20,101 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:59:20,101 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand has 43 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 27 states have internal predecessors, (31), 12 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 12:59:20,101 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand has 43 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 27 states have internal predecessors, (31), 12 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 12:59:20,102 INFO L87 Difference]: Start difference. First operand 43 states. Second operand has 43 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 27 states have internal predecessors, (31), 12 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 12:59:20,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:59:20,104 INFO L93 Difference]: Finished difference Result 43 states and 53 transitions. [2022-04-27 12:59:20,104 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 53 transitions. [2022-04-27 12:59:20,104 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:59:20,104 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:59:20,105 INFO L74 IsIncluded]: Start isIncluded. First operand has 43 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 27 states have internal predecessors, (31), 12 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 43 states. [2022-04-27 12:59:20,105 INFO L87 Difference]: Start difference. First operand has 43 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 27 states have internal predecessors, (31), 12 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 43 states. [2022-04-27 12:59:20,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:59:20,107 INFO L93 Difference]: Finished difference Result 43 states and 53 transitions. [2022-04-27 12:59:20,107 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 53 transitions. [2022-04-27 12:59:20,107 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:59:20,107 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:59:20,108 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:59:20,108 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:59:20,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 27 states have internal predecessors, (31), 12 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 12:59:20,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 53 transitions. [2022-04-27 12:59:20,110 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 53 transitions. Word has length 39 [2022-04-27 12:59:20,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:59:20,110 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 53 transitions. [2022-04-27 12:59:20,110 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 12:59:20,110 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 53 transitions. [2022-04-27 12:59:20,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-27 12:59:20,111 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:59:20,111 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:59:20,137 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-27 12:59:20,311 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 12:59:20,312 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:59:20,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:59:20,312 INFO L85 PathProgramCache]: Analyzing trace with hash 1052701339, now seen corresponding path program 1 times [2022-04-27 12:59:20,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:59:20,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221706510] [2022-04-27 12:59:20,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:59:20,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:59:20,326 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:59:20,326 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [661950307] [2022-04-27 12:59:20,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:59:20,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:59:20,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:59:20,327 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 12:59:20,347 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-27 12:59:20,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:59:20,384 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-27 12:59:20,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:59:20,396 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:59:20,686 INFO L272 TraceCheckUtils]: 0: Hoare triple {1828#true} call ULTIMATE.init(); {1828#true} is VALID [2022-04-27 12:59:20,686 INFO L290 TraceCheckUtils]: 1: Hoare triple {1828#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);~counter~0 := 0; {1828#true} is VALID [2022-04-27 12:59:20,686 INFO L290 TraceCheckUtils]: 2: Hoare triple {1828#true} assume true; {1828#true} is VALID [2022-04-27 12:59:20,687 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1828#true} {1828#true} #98#return; {1828#true} is VALID [2022-04-27 12:59:20,687 INFO L272 TraceCheckUtils]: 4: Hoare triple {1828#true} call #t~ret8 := main(); {1828#true} is VALID [2022-04-27 12:59:20,687 INFO L290 TraceCheckUtils]: 5: Hoare triple {1828#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {1828#true} is VALID [2022-04-27 12:59:20,687 INFO L272 TraceCheckUtils]: 6: Hoare triple {1828#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {1828#true} is VALID [2022-04-27 12:59:20,687 INFO L290 TraceCheckUtils]: 7: Hoare triple {1828#true} ~cond := #in~cond; {1828#true} is VALID [2022-04-27 12:59:20,687 INFO L290 TraceCheckUtils]: 8: Hoare triple {1828#true} assume !(0 == ~cond); {1828#true} is VALID [2022-04-27 12:59:20,687 INFO L290 TraceCheckUtils]: 9: Hoare triple {1828#true} assume true; {1828#true} is VALID [2022-04-27 12:59:20,687 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1828#true} {1828#true} #78#return; {1828#true} is VALID [2022-04-27 12:59:20,687 INFO L272 TraceCheckUtils]: 11: Hoare triple {1828#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1828#true} is VALID [2022-04-27 12:59:20,688 INFO L290 TraceCheckUtils]: 12: Hoare triple {1828#true} ~cond := #in~cond; {1869#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 12:59:20,688 INFO L290 TraceCheckUtils]: 13: Hoare triple {1869#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {1873#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 12:59:20,688 INFO L290 TraceCheckUtils]: 14: Hoare triple {1873#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {1873#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 12:59:20,689 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1873#(not (= |assume_abort_if_not_#in~cond| 0))} {1828#true} #80#return; {1880#(<= 1 main_~y~0)} is VALID [2022-04-27 12:59:20,690 INFO L290 TraceCheckUtils]: 16: Hoare triple {1880#(<= 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; {1884#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 12:59:20,690 INFO L272 TraceCheckUtils]: 17: Hoare triple {1884#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {1828#true} is VALID [2022-04-27 12:59:20,690 INFO L290 TraceCheckUtils]: 18: Hoare triple {1828#true} ~cond := #in~cond; {1828#true} is VALID [2022-04-27 12:59:20,690 INFO L290 TraceCheckUtils]: 19: Hoare triple {1828#true} assume !(0 == ~cond); {1828#true} is VALID [2022-04-27 12:59:20,690 INFO L290 TraceCheckUtils]: 20: Hoare triple {1828#true} assume true; {1828#true} is VALID [2022-04-27 12:59:20,692 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1828#true} {1884#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #82#return; {1884#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 12:59:20,692 INFO L272 TraceCheckUtils]: 22: Hoare triple {1884#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {1828#true} is VALID [2022-04-27 12:59:20,692 INFO L290 TraceCheckUtils]: 23: Hoare triple {1828#true} ~cond := #in~cond; {1828#true} is VALID [2022-04-27 12:59:20,692 INFO L290 TraceCheckUtils]: 24: Hoare triple {1828#true} assume !(0 == ~cond); {1828#true} is VALID [2022-04-27 12:59:20,693 INFO L290 TraceCheckUtils]: 25: Hoare triple {1828#true} assume true; {1828#true} is VALID [2022-04-27 12:59:20,693 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1828#true} {1884#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #84#return; {1884#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 12:59:20,694 INFO L290 TraceCheckUtils]: 27: Hoare triple {1884#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1884#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 12:59:20,694 INFO L290 TraceCheckUtils]: 28: Hoare triple {1884#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(#t~post6 < 50);havoc #t~post6; {1884#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 12:59:20,694 INFO L290 TraceCheckUtils]: 29: Hoare triple {1884#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {1884#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 12:59:20,695 INFO L290 TraceCheckUtils]: 30: Hoare triple {1884#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {1884#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 12:59:20,695 INFO L290 TraceCheckUtils]: 31: Hoare triple {1884#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(#t~post7 < 50);havoc #t~post7; {1884#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 12:59:20,696 INFO L272 TraceCheckUtils]: 32: Hoare triple {1884#(and (= main_~r~0 0) (<= 1 main_~y~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)); {1828#true} is VALID [2022-04-27 12:59:20,696 INFO L290 TraceCheckUtils]: 33: Hoare triple {1828#true} ~cond := #in~cond; {1828#true} is VALID [2022-04-27 12:59:20,696 INFO L290 TraceCheckUtils]: 34: Hoare triple {1828#true} assume !(0 == ~cond); {1828#true} is VALID [2022-04-27 12:59:20,696 INFO L290 TraceCheckUtils]: 35: Hoare triple {1828#true} assume true; {1828#true} is VALID [2022-04-27 12:59:20,697 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {1828#true} {1884#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #86#return; {1884#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 12:59:20,697 INFO L272 TraceCheckUtils]: 37: Hoare triple {1884#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {1948#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:59:20,698 INFO L290 TraceCheckUtils]: 38: Hoare triple {1948#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1952#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:59:20,698 INFO L290 TraceCheckUtils]: 39: Hoare triple {1952#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1829#false} is VALID [2022-04-27 12:59:20,698 INFO L290 TraceCheckUtils]: 40: Hoare triple {1829#false} assume !false; {1829#false} is VALID [2022-04-27 12:59:20,698 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-27 12:59:20,698 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:59:20,933 INFO L290 TraceCheckUtils]: 40: Hoare triple {1829#false} assume !false; {1829#false} is VALID [2022-04-27 12:59:20,934 INFO L290 TraceCheckUtils]: 39: Hoare triple {1952#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1829#false} is VALID [2022-04-27 12:59:20,934 INFO L290 TraceCheckUtils]: 38: Hoare triple {1948#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1952#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:59:20,936 INFO L272 TraceCheckUtils]: 37: Hoare triple {1968#(= 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)); {1948#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:59:20,936 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {1828#true} {1968#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #86#return; {1968#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 12:59:20,936 INFO L290 TraceCheckUtils]: 35: Hoare triple {1828#true} assume true; {1828#true} is VALID [2022-04-27 12:59:20,936 INFO L290 TraceCheckUtils]: 34: Hoare triple {1828#true} assume !(0 == ~cond); {1828#true} is VALID [2022-04-27 12:59:20,937 INFO L290 TraceCheckUtils]: 33: Hoare triple {1828#true} ~cond := #in~cond; {1828#true} is VALID [2022-04-27 12:59:20,937 INFO L272 TraceCheckUtils]: 32: Hoare triple {1968#(= 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)); {1828#true} is VALID [2022-04-27 12:59:20,938 INFO L290 TraceCheckUtils]: 31: Hoare triple {1968#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !!(#t~post7 < 50);havoc #t~post7; {1968#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 12:59:20,938 INFO L290 TraceCheckUtils]: 30: Hoare triple {1968#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {1968#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 12:59:20,938 INFO L290 TraceCheckUtils]: 29: Hoare triple {1968#(= 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; {1968#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 12:59:20,939 INFO L290 TraceCheckUtils]: 28: Hoare triple {1968#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !!(#t~post6 < 50);havoc #t~post6; {1968#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 12:59:20,939 INFO L290 TraceCheckUtils]: 27: Hoare triple {1968#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1968#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 12:59:20,940 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1828#true} {1968#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #84#return; {1968#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 12:59:20,940 INFO L290 TraceCheckUtils]: 25: Hoare triple {1828#true} assume true; {1828#true} is VALID [2022-04-27 12:59:20,940 INFO L290 TraceCheckUtils]: 24: Hoare triple {1828#true} assume !(0 == ~cond); {1828#true} is VALID [2022-04-27 12:59:20,940 INFO L290 TraceCheckUtils]: 23: Hoare triple {1828#true} ~cond := #in~cond; {1828#true} is VALID [2022-04-27 12:59:20,940 INFO L272 TraceCheckUtils]: 22: Hoare triple {1968#(= 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)); {1828#true} is VALID [2022-04-27 12:59:20,941 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1828#true} {1968#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #82#return; {1968#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 12:59:20,941 INFO L290 TraceCheckUtils]: 20: Hoare triple {1828#true} assume true; {1828#true} is VALID [2022-04-27 12:59:20,941 INFO L290 TraceCheckUtils]: 19: Hoare triple {1828#true} assume !(0 == ~cond); {1828#true} is VALID [2022-04-27 12:59:20,941 INFO L290 TraceCheckUtils]: 18: Hoare triple {1828#true} ~cond := #in~cond; {1828#true} is VALID [2022-04-27 12:59:20,941 INFO L272 TraceCheckUtils]: 17: Hoare triple {1968#(= 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)); {1828#true} is VALID [2022-04-27 12:59:20,942 INFO L290 TraceCheckUtils]: 16: Hoare triple {1828#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; {1968#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 12:59:20,942 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1828#true} {1828#true} #80#return; {1828#true} is VALID [2022-04-27 12:59:20,942 INFO L290 TraceCheckUtils]: 14: Hoare triple {1828#true} assume true; {1828#true} is VALID [2022-04-27 12:59:20,942 INFO L290 TraceCheckUtils]: 13: Hoare triple {1828#true} assume !(0 == ~cond); {1828#true} is VALID [2022-04-27 12:59:20,942 INFO L290 TraceCheckUtils]: 12: Hoare triple {1828#true} ~cond := #in~cond; {1828#true} is VALID [2022-04-27 12:59:20,942 INFO L272 TraceCheckUtils]: 11: Hoare triple {1828#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1828#true} is VALID [2022-04-27 12:59:20,942 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1828#true} {1828#true} #78#return; {1828#true} is VALID [2022-04-27 12:59:20,942 INFO L290 TraceCheckUtils]: 9: Hoare triple {1828#true} assume true; {1828#true} is VALID [2022-04-27 12:59:20,942 INFO L290 TraceCheckUtils]: 8: Hoare triple {1828#true} assume !(0 == ~cond); {1828#true} is VALID [2022-04-27 12:59:20,943 INFO L290 TraceCheckUtils]: 7: Hoare triple {1828#true} ~cond := #in~cond; {1828#true} is VALID [2022-04-27 12:59:20,943 INFO L272 TraceCheckUtils]: 6: Hoare triple {1828#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {1828#true} is VALID [2022-04-27 12:59:20,943 INFO L290 TraceCheckUtils]: 5: Hoare triple {1828#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {1828#true} is VALID [2022-04-27 12:59:20,943 INFO L272 TraceCheckUtils]: 4: Hoare triple {1828#true} call #t~ret8 := main(); {1828#true} is VALID [2022-04-27 12:59:20,943 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1828#true} {1828#true} #98#return; {1828#true} is VALID [2022-04-27 12:59:20,943 INFO L290 TraceCheckUtils]: 2: Hoare triple {1828#true} assume true; {1828#true} is VALID [2022-04-27 12:59:20,943 INFO L290 TraceCheckUtils]: 1: Hoare triple {1828#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);~counter~0 := 0; {1828#true} is VALID [2022-04-27 12:59:20,943 INFO L272 TraceCheckUtils]: 0: Hoare triple {1828#true} call ULTIMATE.init(); {1828#true} is VALID [2022-04-27 12:59:20,943 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-27 12:59:20,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:59:20,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221706510] [2022-04-27 12:59:20,944 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:59:20,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [661950307] [2022-04-27 12:59:20,944 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [661950307] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-27 12:59:20,944 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-27 12:59:20,944 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 9 [2022-04-27 12:59:20,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981692059] [2022-04-27 12:59:20,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:59:20,945 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 41 [2022-04-27 12:59:20,945 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:59:20,945 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-27 12:59:20,971 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:59:20,971 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 12:59:20,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:59:20,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 12:59:20,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-04-27 12:59:20,972 INFO L87 Difference]: Start difference. First operand 43 states and 53 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-27 12:59:21,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:59:21,265 INFO L93 Difference]: Finished difference Result 57 states and 72 transitions. [2022-04-27 12:59:21,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 12:59:21,265 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 41 [2022-04-27 12:59:21,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:59:21,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-27 12:59:21,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-27 12:59:21,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-27 12:59:21,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-27 12:59:21,269 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 67 transitions. [2022-04-27 12:59:21,322 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:59:21,329 INFO L225 Difference]: With dead ends: 57 [2022-04-27 12:59:21,329 INFO L226 Difference]: Without dead ends: 55 [2022-04-27 12:59:21,329 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 73 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-04-27 12:59:21,331 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 8 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 12:59:21,332 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 157 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 12:59:21,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-04-27 12:59:21,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 54. [2022-04-27 12:59:21,364 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:59:21,364 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand has 54 states, 32 states have (on average 1.21875) internal successors, (39), 33 states have internal predecessors, (39), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-27 12:59:21,365 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand has 54 states, 32 states have (on average 1.21875) internal successors, (39), 33 states have internal predecessors, (39), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-27 12:59:21,365 INFO L87 Difference]: Start difference. First operand 55 states. Second operand has 54 states, 32 states have (on average 1.21875) internal successors, (39), 33 states have internal predecessors, (39), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-27 12:59:21,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:59:21,367 INFO L93 Difference]: Finished difference Result 55 states and 70 transitions. [2022-04-27 12:59:21,368 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 70 transitions. [2022-04-27 12:59:21,368 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:59:21,368 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:59:21,368 INFO L74 IsIncluded]: Start isIncluded. First operand has 54 states, 32 states have (on average 1.21875) internal successors, (39), 33 states have internal predecessors, (39), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 55 states. [2022-04-27 12:59:21,368 INFO L87 Difference]: Start difference. First operand has 54 states, 32 states have (on average 1.21875) internal successors, (39), 33 states have internal predecessors, (39), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 55 states. [2022-04-27 12:59:21,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:59:21,371 INFO L93 Difference]: Finished difference Result 55 states and 70 transitions. [2022-04-27 12:59:21,371 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 70 transitions. [2022-04-27 12:59:21,371 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:59:21,371 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:59:21,371 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:59:21,372 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:59:21,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 32 states have (on average 1.21875) internal successors, (39), 33 states have internal predecessors, (39), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-27 12:59:21,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 69 transitions. [2022-04-27 12:59:21,374 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 69 transitions. Word has length 41 [2022-04-27 12:59:21,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:59:21,374 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 69 transitions. [2022-04-27 12:59:21,374 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-27 12:59:21,375 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 69 transitions. [2022-04-27 12:59:21,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-04-27 12:59:21,375 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:59:21,375 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:59:21,403 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-27 12:59:21,600 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 12:59:21,600 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:59:21,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:59:21,601 INFO L85 PathProgramCache]: Analyzing trace with hash 1531994984, now seen corresponding path program 1 times [2022-04-27 12:59:21,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:59:21,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182527431] [2022-04-27 12:59:21,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:59:21,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:59:21,615 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:59:21,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1204655927] [2022-04-27 12:59:21,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:59:21,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:59:21,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:59:21,617 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 12:59:21,644 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-27 12:59:21,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:59:21,672 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-27 12:59:21,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:59:21,691 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:59:21,964 INFO L272 TraceCheckUtils]: 0: Hoare triple {2359#true} call ULTIMATE.init(); {2359#true} is VALID [2022-04-27 12:59:21,964 INFO L290 TraceCheckUtils]: 1: Hoare triple {2359#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);~counter~0 := 0; {2359#true} is VALID [2022-04-27 12:59:21,964 INFO L290 TraceCheckUtils]: 2: Hoare triple {2359#true} assume true; {2359#true} is VALID [2022-04-27 12:59:21,965 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2359#true} {2359#true} #98#return; {2359#true} is VALID [2022-04-27 12:59:21,965 INFO L272 TraceCheckUtils]: 4: Hoare triple {2359#true} call #t~ret8 := main(); {2359#true} is VALID [2022-04-27 12:59:21,965 INFO L290 TraceCheckUtils]: 5: Hoare triple {2359#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {2359#true} is VALID [2022-04-27 12:59:21,965 INFO L272 TraceCheckUtils]: 6: Hoare triple {2359#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {2359#true} is VALID [2022-04-27 12:59:21,965 INFO L290 TraceCheckUtils]: 7: Hoare triple {2359#true} ~cond := #in~cond; {2385#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 12:59:21,966 INFO L290 TraceCheckUtils]: 8: Hoare triple {2385#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {2389#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 12:59:21,966 INFO L290 TraceCheckUtils]: 9: Hoare triple {2389#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {2389#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 12:59:21,967 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2389#(not (= |assume_abort_if_not_#in~cond| 0))} {2359#true} #78#return; {2396#(<= 1 main_~x~0)} is VALID [2022-04-27 12:59:21,967 INFO L272 TraceCheckUtils]: 11: Hoare triple {2396#(<= 1 main_~x~0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {2359#true} is VALID [2022-04-27 12:59:21,967 INFO L290 TraceCheckUtils]: 12: Hoare triple {2359#true} ~cond := #in~cond; {2359#true} is VALID [2022-04-27 12:59:21,967 INFO L290 TraceCheckUtils]: 13: Hoare triple {2359#true} assume !(0 == ~cond); {2359#true} is VALID [2022-04-27 12:59:21,967 INFO L290 TraceCheckUtils]: 14: Hoare triple {2359#true} assume true; {2359#true} is VALID [2022-04-27 12:59:21,967 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2359#true} {2396#(<= 1 main_~x~0)} #80#return; {2396#(<= 1 main_~x~0)} is VALID [2022-04-27 12:59:21,968 INFO L290 TraceCheckUtils]: 16: Hoare triple {2396#(<= 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; {2415#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-27 12:59:21,968 INFO L272 TraceCheckUtils]: 17: Hoare triple {2415#(and (<= 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)); {2359#true} is VALID [2022-04-27 12:59:21,968 INFO L290 TraceCheckUtils]: 18: Hoare triple {2359#true} ~cond := #in~cond; {2359#true} is VALID [2022-04-27 12:59:21,968 INFO L290 TraceCheckUtils]: 19: Hoare triple {2359#true} assume !(0 == ~cond); {2359#true} is VALID [2022-04-27 12:59:21,968 INFO L290 TraceCheckUtils]: 20: Hoare triple {2359#true} assume true; {2359#true} is VALID [2022-04-27 12:59:21,969 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2359#true} {2415#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #82#return; {2415#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-27 12:59:21,969 INFO L272 TraceCheckUtils]: 22: Hoare triple {2415#(and (<= 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)); {2359#true} is VALID [2022-04-27 12:59:21,969 INFO L290 TraceCheckUtils]: 23: Hoare triple {2359#true} ~cond := #in~cond; {2359#true} is VALID [2022-04-27 12:59:21,969 INFO L290 TraceCheckUtils]: 24: Hoare triple {2359#true} assume !(0 == ~cond); {2359#true} is VALID [2022-04-27 12:59:21,969 INFO L290 TraceCheckUtils]: 25: Hoare triple {2359#true} assume true; {2359#true} is VALID [2022-04-27 12:59:21,970 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {2359#true} {2415#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #84#return; {2415#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-27 12:59:21,970 INFO L290 TraceCheckUtils]: 27: Hoare triple {2415#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2415#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-27 12:59:21,971 INFO L290 TraceCheckUtils]: 28: Hoare triple {2415#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} assume !!(#t~post6 < 50);havoc #t~post6; {2415#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-27 12:59:21,971 INFO L290 TraceCheckUtils]: 29: Hoare triple {2415#(and (<= 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; {2415#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-27 12:59:21,976 INFO L290 TraceCheckUtils]: 30: Hoare triple {2415#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {2415#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-27 12:59:21,977 INFO L290 TraceCheckUtils]: 31: Hoare triple {2415#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} assume !!(#t~post7 < 50);havoc #t~post7; {2415#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-27 12:59:21,977 INFO L272 TraceCheckUtils]: 32: Hoare triple {2415#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {2359#true} is VALID [2022-04-27 12:59:21,977 INFO L290 TraceCheckUtils]: 33: Hoare triple {2359#true} ~cond := #in~cond; {2359#true} is VALID [2022-04-27 12:59:21,977 INFO L290 TraceCheckUtils]: 34: Hoare triple {2359#true} assume !(0 == ~cond); {2359#true} is VALID [2022-04-27 12:59:21,977 INFO L290 TraceCheckUtils]: 35: Hoare triple {2359#true} assume true; {2359#true} is VALID [2022-04-27 12:59:21,978 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {2359#true} {2415#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #86#return; {2415#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-27 12:59:21,978 INFO L272 TraceCheckUtils]: 37: Hoare triple {2415#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {2359#true} is VALID [2022-04-27 12:59:21,978 INFO L290 TraceCheckUtils]: 38: Hoare triple {2359#true} ~cond := #in~cond; {2359#true} is VALID [2022-04-27 12:59:21,978 INFO L290 TraceCheckUtils]: 39: Hoare triple {2359#true} assume !(0 == ~cond); {2359#true} is VALID [2022-04-27 12:59:21,978 INFO L290 TraceCheckUtils]: 40: Hoare triple {2359#true} assume true; {2359#true} is VALID [2022-04-27 12:59:21,979 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {2359#true} {2415#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #88#return; {2415#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-27 12:59:21,980 INFO L272 TraceCheckUtils]: 42: Hoare triple {2415#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {2494#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:59:21,980 INFO L290 TraceCheckUtils]: 43: Hoare triple {2494#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2498#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:59:21,981 INFO L290 TraceCheckUtils]: 44: Hoare triple {2498#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2360#false} is VALID [2022-04-27 12:59:21,981 INFO L290 TraceCheckUtils]: 45: Hoare triple {2360#false} assume !false; {2360#false} is VALID [2022-04-27 12:59:21,981 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-04-27 12:59:21,981 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:59:22,222 INFO L290 TraceCheckUtils]: 45: Hoare triple {2360#false} assume !false; {2360#false} is VALID [2022-04-27 12:59:22,223 INFO L290 TraceCheckUtils]: 44: Hoare triple {2498#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2360#false} is VALID [2022-04-27 12:59:22,223 INFO L290 TraceCheckUtils]: 43: Hoare triple {2494#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2498#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:59:22,224 INFO L272 TraceCheckUtils]: 42: Hoare triple {2514#(= 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)); {2494#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:59:22,224 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {2359#true} {2514#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #88#return; {2514#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 12:59:22,224 INFO L290 TraceCheckUtils]: 40: Hoare triple {2359#true} assume true; {2359#true} is VALID [2022-04-27 12:59:22,225 INFO L290 TraceCheckUtils]: 39: Hoare triple {2359#true} assume !(0 == ~cond); {2359#true} is VALID [2022-04-27 12:59:22,225 INFO L290 TraceCheckUtils]: 38: Hoare triple {2359#true} ~cond := #in~cond; {2359#true} is VALID [2022-04-27 12:59:22,225 INFO L272 TraceCheckUtils]: 37: Hoare triple {2514#(= 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)); {2359#true} is VALID [2022-04-27 12:59:22,225 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {2359#true} {2514#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #86#return; {2514#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 12:59:22,226 INFO L290 TraceCheckUtils]: 35: Hoare triple {2359#true} assume true; {2359#true} is VALID [2022-04-27 12:59:22,226 INFO L290 TraceCheckUtils]: 34: Hoare triple {2359#true} assume !(0 == ~cond); {2359#true} is VALID [2022-04-27 12:59:22,226 INFO L290 TraceCheckUtils]: 33: Hoare triple {2359#true} ~cond := #in~cond; {2359#true} is VALID [2022-04-27 12:59:22,226 INFO L272 TraceCheckUtils]: 32: Hoare triple {2514#(= 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)); {2359#true} is VALID [2022-04-27 12:59:22,231 INFO L290 TraceCheckUtils]: 31: Hoare triple {2514#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !!(#t~post7 < 50);havoc #t~post7; {2514#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 12:59:22,232 INFO L290 TraceCheckUtils]: 30: Hoare triple {2514#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {2514#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 12:59:22,233 INFO L290 TraceCheckUtils]: 29: Hoare triple {2514#(= 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; {2514#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 12:59:22,234 INFO L290 TraceCheckUtils]: 28: Hoare triple {2514#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !!(#t~post6 < 50);havoc #t~post6; {2514#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 12:59:22,234 INFO L290 TraceCheckUtils]: 27: Hoare triple {2514#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2514#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 12:59:22,235 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {2359#true} {2514#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #84#return; {2514#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 12:59:22,235 INFO L290 TraceCheckUtils]: 25: Hoare triple {2359#true} assume true; {2359#true} is VALID [2022-04-27 12:59:22,235 INFO L290 TraceCheckUtils]: 24: Hoare triple {2359#true} assume !(0 == ~cond); {2359#true} is VALID [2022-04-27 12:59:22,235 INFO L290 TraceCheckUtils]: 23: Hoare triple {2359#true} ~cond := #in~cond; {2359#true} is VALID [2022-04-27 12:59:22,235 INFO L272 TraceCheckUtils]: 22: Hoare triple {2514#(= 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)); {2359#true} is VALID [2022-04-27 12:59:22,236 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2359#true} {2514#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #82#return; {2514#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 12:59:22,236 INFO L290 TraceCheckUtils]: 20: Hoare triple {2359#true} assume true; {2359#true} is VALID [2022-04-27 12:59:22,236 INFO L290 TraceCheckUtils]: 19: Hoare triple {2359#true} assume !(0 == ~cond); {2359#true} is VALID [2022-04-27 12:59:22,236 INFO L290 TraceCheckUtils]: 18: Hoare triple {2359#true} ~cond := #in~cond; {2359#true} is VALID [2022-04-27 12:59:22,236 INFO L272 TraceCheckUtils]: 17: Hoare triple {2514#(= 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)); {2359#true} is VALID [2022-04-27 12:59:22,237 INFO L290 TraceCheckUtils]: 16: Hoare triple {2359#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; {2514#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 12:59:22,237 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2359#true} {2359#true} #80#return; {2359#true} is VALID [2022-04-27 12:59:22,237 INFO L290 TraceCheckUtils]: 14: Hoare triple {2359#true} assume true; {2359#true} is VALID [2022-04-27 12:59:22,237 INFO L290 TraceCheckUtils]: 13: Hoare triple {2359#true} assume !(0 == ~cond); {2359#true} is VALID [2022-04-27 12:59:22,237 INFO L290 TraceCheckUtils]: 12: Hoare triple {2359#true} ~cond := #in~cond; {2359#true} is VALID [2022-04-27 12:59:22,237 INFO L272 TraceCheckUtils]: 11: Hoare triple {2359#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {2359#true} is VALID [2022-04-27 12:59:22,237 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2359#true} {2359#true} #78#return; {2359#true} is VALID [2022-04-27 12:59:22,237 INFO L290 TraceCheckUtils]: 9: Hoare triple {2359#true} assume true; {2359#true} is VALID [2022-04-27 12:59:22,237 INFO L290 TraceCheckUtils]: 8: Hoare triple {2359#true} assume !(0 == ~cond); {2359#true} is VALID [2022-04-27 12:59:22,238 INFO L290 TraceCheckUtils]: 7: Hoare triple {2359#true} ~cond := #in~cond; {2359#true} is VALID [2022-04-27 12:59:22,238 INFO L272 TraceCheckUtils]: 6: Hoare triple {2359#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {2359#true} is VALID [2022-04-27 12:59:22,238 INFO L290 TraceCheckUtils]: 5: Hoare triple {2359#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {2359#true} is VALID [2022-04-27 12:59:22,238 INFO L272 TraceCheckUtils]: 4: Hoare triple {2359#true} call #t~ret8 := main(); {2359#true} is VALID [2022-04-27 12:59:22,238 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2359#true} {2359#true} #98#return; {2359#true} is VALID [2022-04-27 12:59:22,238 INFO L290 TraceCheckUtils]: 2: Hoare triple {2359#true} assume true; {2359#true} is VALID [2022-04-27 12:59:22,238 INFO L290 TraceCheckUtils]: 1: Hoare triple {2359#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);~counter~0 := 0; {2359#true} is VALID [2022-04-27 12:59:22,238 INFO L272 TraceCheckUtils]: 0: Hoare triple {2359#true} call ULTIMATE.init(); {2359#true} is VALID [2022-04-27 12:59:22,238 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-27 12:59:22,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:59:22,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182527431] [2022-04-27 12:59:22,239 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:59:22,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1204655927] [2022-04-27 12:59:22,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1204655927] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-27 12:59:22,239 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-27 12:59:22,239 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 9 [2022-04-27 12:59:22,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106255654] [2022-04-27 12:59:22,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:59:22,240 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 46 [2022-04-27 12:59:22,240 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:59:22,240 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-27 12:59:22,265 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 12:59:22,266 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 12:59:22,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:59:22,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 12:59:22,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-04-27 12:59:22,267 INFO L87 Difference]: Start difference. First operand 54 states and 69 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-27 12:59:22,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:59:22,508 INFO L93 Difference]: Finished difference Result 61 states and 75 transitions. [2022-04-27 12:59:22,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 12:59:22,508 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 46 [2022-04-27 12:59:22,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:59:22,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-27 12:59:22,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-27 12:59:22,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-27 12:59:22,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-27 12:59:22,511 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 67 transitions. [2022-04-27 12:59:22,584 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:59:22,586 INFO L225 Difference]: With dead ends: 61 [2022-04-27 12:59:22,586 INFO L226 Difference]: Without dead ends: 59 [2022-04-27 12:59:22,586 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 83 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-04-27 12:59:22,587 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 8 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 12:59:22,587 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 148 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 12:59:22,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-04-27 12:59:22,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2022-04-27 12:59:22,614 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:59:22,614 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand has 58 states, 35 states have (on average 1.2) internal successors, (42), 36 states have internal predecessors, (42), 16 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-27 12:59:22,614 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand has 58 states, 35 states have (on average 1.2) internal successors, (42), 36 states have internal predecessors, (42), 16 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-27 12:59:22,615 INFO L87 Difference]: Start difference. First operand 59 states. Second operand has 58 states, 35 states have (on average 1.2) internal successors, (42), 36 states have internal predecessors, (42), 16 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-27 12:59:22,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:59:22,617 INFO L93 Difference]: Finished difference Result 59 states and 73 transitions. [2022-04-27 12:59:22,617 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 73 transitions. [2022-04-27 12:59:22,617 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:59:22,618 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:59:22,618 INFO L74 IsIncluded]: Start isIncluded. First operand has 58 states, 35 states have (on average 1.2) internal successors, (42), 36 states have internal predecessors, (42), 16 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 59 states. [2022-04-27 12:59:22,618 INFO L87 Difference]: Start difference. First operand has 58 states, 35 states have (on average 1.2) internal successors, (42), 36 states have internal predecessors, (42), 16 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 59 states. [2022-04-27 12:59:22,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:59:22,620 INFO L93 Difference]: Finished difference Result 59 states and 73 transitions. [2022-04-27 12:59:22,620 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 73 transitions. [2022-04-27 12:59:22,621 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:59:22,621 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:59:22,621 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:59:22,621 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:59:22,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 35 states have (on average 1.2) internal successors, (42), 36 states have internal predecessors, (42), 16 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-27 12:59:22,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 72 transitions. [2022-04-27 12:59:22,623 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 72 transitions. Word has length 46 [2022-04-27 12:59:22,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:59:22,624 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 72 transitions. [2022-04-27 12:59:22,624 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-27 12:59:22,624 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 72 transitions. [2022-04-27 12:59:22,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-04-27 12:59:22,624 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:59:22,625 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:59:22,650 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-27 12:59:22,847 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 12:59:22,847 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:59:22,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:59:22,848 INFO L85 PathProgramCache]: Analyzing trace with hash -300711301, now seen corresponding path program 1 times [2022-04-27 12:59:22,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:59:22,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268058436] [2022-04-27 12:59:22,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:59:22,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:59:22,860 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:59:22,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [336783356] [2022-04-27 12:59:22,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:59:22,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:59:22,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:59:22,861 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 12:59:22,869 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-27 12:59:22,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:59:22,920 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-27 12:59:22,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:59:22,933 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:59:27,615 INFO L272 TraceCheckUtils]: 0: Hoare triple {2938#true} call ULTIMATE.init(); {2938#true} is VALID [2022-04-27 12:59:27,615 INFO L290 TraceCheckUtils]: 1: Hoare triple {2938#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);~counter~0 := 0; {2938#true} is VALID [2022-04-27 12:59:27,615 INFO L290 TraceCheckUtils]: 2: Hoare triple {2938#true} assume true; {2938#true} is VALID [2022-04-27 12:59:27,615 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2938#true} {2938#true} #98#return; {2938#true} is VALID [2022-04-27 12:59:27,615 INFO L272 TraceCheckUtils]: 4: Hoare triple {2938#true} call #t~ret8 := main(); {2938#true} is VALID [2022-04-27 12:59:27,615 INFO L290 TraceCheckUtils]: 5: Hoare triple {2938#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {2938#true} is VALID [2022-04-27 12:59:27,615 INFO L272 TraceCheckUtils]: 6: Hoare triple {2938#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {2938#true} is VALID [2022-04-27 12:59:27,615 INFO L290 TraceCheckUtils]: 7: Hoare triple {2938#true} ~cond := #in~cond; {2938#true} is VALID [2022-04-27 12:59:27,615 INFO L290 TraceCheckUtils]: 8: Hoare triple {2938#true} assume !(0 == ~cond); {2938#true} is VALID [2022-04-27 12:59:27,616 INFO L290 TraceCheckUtils]: 9: Hoare triple {2938#true} assume true; {2938#true} is VALID [2022-04-27 12:59:27,616 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2938#true} {2938#true} #78#return; {2938#true} is VALID [2022-04-27 12:59:27,616 INFO L272 TraceCheckUtils]: 11: Hoare triple {2938#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {2938#true} is VALID [2022-04-27 12:59:27,616 INFO L290 TraceCheckUtils]: 12: Hoare triple {2938#true} ~cond := #in~cond; {2979#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 12:59:27,616 INFO L290 TraceCheckUtils]: 13: Hoare triple {2979#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {2983#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 12:59:27,617 INFO L290 TraceCheckUtils]: 14: Hoare triple {2983#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {2983#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 12:59:27,617 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2983#(not (= |assume_abort_if_not_#in~cond| 0))} {2938#true} #80#return; {2990#(<= 1 main_~y~0)} is VALID [2022-04-27 12:59:27,618 INFO L290 TraceCheckUtils]: 16: Hoare triple {2990#(<= 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; {2994#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-27 12:59:27,618 INFO L272 TraceCheckUtils]: 17: Hoare triple {2994#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0))} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {2938#true} is VALID [2022-04-27 12:59:27,618 INFO L290 TraceCheckUtils]: 18: Hoare triple {2938#true} ~cond := #in~cond; {2938#true} is VALID [2022-04-27 12:59:27,618 INFO L290 TraceCheckUtils]: 19: Hoare triple {2938#true} assume !(0 == ~cond); {2938#true} is VALID [2022-04-27 12:59:27,618 INFO L290 TraceCheckUtils]: 20: Hoare triple {2938#true} assume true; {2938#true} is VALID [2022-04-27 12:59:27,619 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2938#true} {2994#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0))} #82#return; {2994#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-27 12:59:27,619 INFO L272 TraceCheckUtils]: 22: Hoare triple {2994#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0))} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {2938#true} is VALID [2022-04-27 12:59:27,619 INFO L290 TraceCheckUtils]: 23: Hoare triple {2938#true} ~cond := #in~cond; {2938#true} is VALID [2022-04-27 12:59:27,619 INFO L290 TraceCheckUtils]: 24: Hoare triple {2938#true} assume !(0 == ~cond); {2938#true} is VALID [2022-04-27 12:59:27,620 INFO L290 TraceCheckUtils]: 25: Hoare triple {2938#true} assume true; {2938#true} is VALID [2022-04-27 12:59:27,620 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {2938#true} {2994#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0))} #84#return; {2994#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-27 12:59:27,621 INFO L290 TraceCheckUtils]: 27: Hoare triple {2994#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2994#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-27 12:59:27,621 INFO L290 TraceCheckUtils]: 28: Hoare triple {2994#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0))} assume !!(#t~post6 < 50);havoc #t~post6; {2994#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-27 12:59:27,622 INFO L290 TraceCheckUtils]: 29: Hoare triple {2994#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {2994#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-27 12:59:27,622 INFO L290 TraceCheckUtils]: 30: Hoare triple {2994#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {2994#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-27 12:59:27,623 INFO L290 TraceCheckUtils]: 31: Hoare triple {2994#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0))} assume !!(#t~post7 < 50);havoc #t~post7; {2994#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-27 12:59:27,623 INFO L272 TraceCheckUtils]: 32: Hoare triple {2994#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {2938#true} is VALID [2022-04-27 12:59:27,623 INFO L290 TraceCheckUtils]: 33: Hoare triple {2938#true} ~cond := #in~cond; {2938#true} is VALID [2022-04-27 12:59:27,623 INFO L290 TraceCheckUtils]: 34: Hoare triple {2938#true} assume !(0 == ~cond); {2938#true} is VALID [2022-04-27 12:59:27,623 INFO L290 TraceCheckUtils]: 35: Hoare triple {2938#true} assume true; {2938#true} is VALID [2022-04-27 12:59:27,624 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {2938#true} {2994#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0))} #86#return; {2994#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-27 12:59:27,624 INFO L272 TraceCheckUtils]: 37: Hoare triple {2994#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {2938#true} is VALID [2022-04-27 12:59:27,624 INFO L290 TraceCheckUtils]: 38: Hoare triple {2938#true} ~cond := #in~cond; {3061#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:59:27,625 INFO L290 TraceCheckUtils]: 39: Hoare triple {3061#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {3065#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:59:27,625 INFO L290 TraceCheckUtils]: 40: Hoare triple {3065#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3065#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:59:27,626 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {3065#(not (= |__VERIFIER_assert_#in~cond| 0))} {2994#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0))} #88#return; {2994#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-27 12:59:27,626 INFO L272 TraceCheckUtils]: 42: Hoare triple {2994#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {2938#true} is VALID [2022-04-27 12:59:27,626 INFO L290 TraceCheckUtils]: 43: Hoare triple {2938#true} ~cond := #in~cond; {3061#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:59:27,627 INFO L290 TraceCheckUtils]: 44: Hoare triple {3061#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {3065#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:59:27,627 INFO L290 TraceCheckUtils]: 45: Hoare triple {3065#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3065#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:59:27,628 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {3065#(not (= |__VERIFIER_assert_#in~cond| 0))} {2994#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0))} #90#return; {2994#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-27 12:59:27,629 INFO L272 TraceCheckUtils]: 47: Hoare triple {2994#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 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)); {3090#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:59:27,629 INFO L290 TraceCheckUtils]: 48: Hoare triple {3090#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3094#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:59:27,629 INFO L290 TraceCheckUtils]: 49: Hoare triple {3094#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2939#false} is VALID [2022-04-27 12:59:27,630 INFO L290 TraceCheckUtils]: 50: Hoare triple {2939#false} assume !false; {2939#false} is VALID [2022-04-27 12:59:27,630 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 13 proven. 8 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-27 12:59:27,630 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:00:16,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:00:16,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268058436] [2022-04-27 13:00:16,408 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:00:16,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [336783356] [2022-04-27 13:00:16,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [336783356] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 13:00:16,408 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 13:00:16,408 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2022-04-27 13:00:16,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262445958] [2022-04-27 13:00:16,408 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 13:00:16,409 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 51 [2022-04-27 13:00:16,409 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:00:16,409 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 2.4) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-27 13:00:16,463 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:00:16,463 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-27 13:00:16,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:00:16,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-27 13:00:16,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2022-04-27 13:00:16,464 INFO L87 Difference]: Start difference. First operand 58 states and 72 transitions. Second operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-27 13:00:18,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:00:18,025 INFO L93 Difference]: Finished difference Result 65 states and 78 transitions. [2022-04-27 13:00:18,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-27 13:00:18,025 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 51 [2022-04-27 13:00:18,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:00:18,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-27 13:00:18,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 67 transitions. [2022-04-27 13:00:18,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-27 13:00:18,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 67 transitions. [2022-04-27 13:00:18,029 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 67 transitions. [2022-04-27 13:00:18,096 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:00:18,097 INFO L225 Difference]: With dead ends: 65 [2022-04-27 13:00:18,097 INFO L226 Difference]: Without dead ends: 63 [2022-04-27 13:00:18,098 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2022-04-27 13:00:18,098 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 32 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-27 13:00:18,099 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 153 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-27 13:00:18,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-04-27 13:00:18,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2022-04-27 13:00:18,132 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:00:18,133 INFO L82 GeneralOperation]: Start isEquivalent. First operand 63 states. Second operand has 62 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 39 states have internal predecessors, (45), 16 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-27 13:00:18,133 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand has 62 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 39 states have internal predecessors, (45), 16 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-27 13:00:18,134 INFO L87 Difference]: Start difference. First operand 63 states. Second operand has 62 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 39 states have internal predecessors, (45), 16 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-27 13:00:18,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:00:18,137 INFO L93 Difference]: Finished difference Result 63 states and 76 transitions. [2022-04-27 13:00:18,137 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 76 transitions. [2022-04-27 13:00:18,138 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:00:18,138 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:00:18,139 INFO L74 IsIncluded]: Start isIncluded. First operand has 62 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 39 states have internal predecessors, (45), 16 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 63 states. [2022-04-27 13:00:18,146 INFO L87 Difference]: Start difference. First operand has 62 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 39 states have internal predecessors, (45), 16 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 63 states. [2022-04-27 13:00:18,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:00:18,149 INFO L93 Difference]: Finished difference Result 63 states and 76 transitions. [2022-04-27 13:00:18,149 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 76 transitions. [2022-04-27 13:00:18,150 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:00:18,150 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:00:18,150 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:00:18,150 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:00:18,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 39 states have internal predecessors, (45), 16 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-27 13:00:18,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 75 transitions. [2022-04-27 13:00:18,153 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 75 transitions. Word has length 51 [2022-04-27 13:00:18,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:00:18,153 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 75 transitions. [2022-04-27 13:00:18,155 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-27 13:00:18,155 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 75 transitions. [2022-04-27 13:00:18,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-04-27 13:00:18,155 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:00:18,156 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:00:18,180 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:00:18,377 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:00:18,377 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:00:18,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:00:18,378 INFO L85 PathProgramCache]: Analyzing trace with hash 35160305, now seen corresponding path program 1 times [2022-04-27 13:00:18,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:00:18,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313677926] [2022-04-27 13:00:18,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:00:18,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:00:18,405 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:00:18,405 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1545095879] [2022-04-27 13:00:18,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:00:18,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:00:18,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:00:18,406 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:00:18,410 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:00:18,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:00:18,471 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-27 13:00:18,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:00:18,485 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:00:18,765 INFO L272 TraceCheckUtils]: 0: Hoare triple {3434#true} call ULTIMATE.init(); {3434#true} is VALID [2022-04-27 13:00:18,766 INFO L290 TraceCheckUtils]: 1: Hoare triple {3434#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);~counter~0 := 0; {3442#(<= ~counter~0 0)} is VALID [2022-04-27 13:00:18,766 INFO L290 TraceCheckUtils]: 2: Hoare triple {3442#(<= ~counter~0 0)} assume true; {3442#(<= ~counter~0 0)} is VALID [2022-04-27 13:00:18,767 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3442#(<= ~counter~0 0)} {3434#true} #98#return; {3442#(<= ~counter~0 0)} is VALID [2022-04-27 13:00:18,767 INFO L272 TraceCheckUtils]: 4: Hoare triple {3442#(<= ~counter~0 0)} call #t~ret8 := main(); {3442#(<= ~counter~0 0)} is VALID [2022-04-27 13:00:18,767 INFO L290 TraceCheckUtils]: 5: Hoare triple {3442#(<= ~counter~0 0)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {3442#(<= ~counter~0 0)} is VALID [2022-04-27 13:00:18,768 INFO L272 TraceCheckUtils]: 6: Hoare triple {3442#(<= ~counter~0 0)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {3442#(<= ~counter~0 0)} is VALID [2022-04-27 13:00:18,768 INFO L290 TraceCheckUtils]: 7: Hoare triple {3442#(<= ~counter~0 0)} ~cond := #in~cond; {3442#(<= ~counter~0 0)} is VALID [2022-04-27 13:00:18,769 INFO L290 TraceCheckUtils]: 8: Hoare triple {3442#(<= ~counter~0 0)} assume !(0 == ~cond); {3442#(<= ~counter~0 0)} is VALID [2022-04-27 13:00:18,769 INFO L290 TraceCheckUtils]: 9: Hoare triple {3442#(<= ~counter~0 0)} assume true; {3442#(<= ~counter~0 0)} is VALID [2022-04-27 13:00:18,769 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3442#(<= ~counter~0 0)} {3442#(<= ~counter~0 0)} #78#return; {3442#(<= ~counter~0 0)} is VALID [2022-04-27 13:00:18,770 INFO L272 TraceCheckUtils]: 11: Hoare triple {3442#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {3442#(<= ~counter~0 0)} is VALID [2022-04-27 13:00:18,770 INFO L290 TraceCheckUtils]: 12: Hoare triple {3442#(<= ~counter~0 0)} ~cond := #in~cond; {3442#(<= ~counter~0 0)} is VALID [2022-04-27 13:00:18,771 INFO L290 TraceCheckUtils]: 13: Hoare triple {3442#(<= ~counter~0 0)} assume !(0 == ~cond); {3442#(<= ~counter~0 0)} is VALID [2022-04-27 13:00:18,771 INFO L290 TraceCheckUtils]: 14: Hoare triple {3442#(<= ~counter~0 0)} assume true; {3442#(<= ~counter~0 0)} is VALID [2022-04-27 13:00:18,771 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3442#(<= ~counter~0 0)} {3442#(<= ~counter~0 0)} #80#return; {3442#(<= ~counter~0 0)} is VALID [2022-04-27 13:00:18,772 INFO L290 TraceCheckUtils]: 16: Hoare triple {3442#(<= ~counter~0 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; {3442#(<= ~counter~0 0)} is VALID [2022-04-27 13:00:18,772 INFO L272 TraceCheckUtils]: 17: Hoare triple {3442#(<= ~counter~0 0)} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {3442#(<= ~counter~0 0)} is VALID [2022-04-27 13:00:18,772 INFO L290 TraceCheckUtils]: 18: Hoare triple {3442#(<= ~counter~0 0)} ~cond := #in~cond; {3442#(<= ~counter~0 0)} is VALID [2022-04-27 13:00:18,773 INFO L290 TraceCheckUtils]: 19: Hoare triple {3442#(<= ~counter~0 0)} assume !(0 == ~cond); {3442#(<= ~counter~0 0)} is VALID [2022-04-27 13:00:18,773 INFO L290 TraceCheckUtils]: 20: Hoare triple {3442#(<= ~counter~0 0)} assume true; {3442#(<= ~counter~0 0)} is VALID [2022-04-27 13:00:18,774 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {3442#(<= ~counter~0 0)} {3442#(<= ~counter~0 0)} #82#return; {3442#(<= ~counter~0 0)} is VALID [2022-04-27 13:00:18,774 INFO L272 TraceCheckUtils]: 22: Hoare triple {3442#(<= ~counter~0 0)} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {3442#(<= ~counter~0 0)} is VALID [2022-04-27 13:00:18,775 INFO L290 TraceCheckUtils]: 23: Hoare triple {3442#(<= ~counter~0 0)} ~cond := #in~cond; {3442#(<= ~counter~0 0)} is VALID [2022-04-27 13:00:18,775 INFO L290 TraceCheckUtils]: 24: Hoare triple {3442#(<= ~counter~0 0)} assume !(0 == ~cond); {3442#(<= ~counter~0 0)} is VALID [2022-04-27 13:00:18,775 INFO L290 TraceCheckUtils]: 25: Hoare triple {3442#(<= ~counter~0 0)} assume true; {3442#(<= ~counter~0 0)} is VALID [2022-04-27 13:00:18,776 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {3442#(<= ~counter~0 0)} {3442#(<= ~counter~0 0)} #84#return; {3442#(<= ~counter~0 0)} is VALID [2022-04-27 13:00:18,777 INFO L290 TraceCheckUtils]: 27: Hoare triple {3442#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3521#(<= ~counter~0 1)} is VALID [2022-04-27 13:00:18,777 INFO L290 TraceCheckUtils]: 28: Hoare triple {3521#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {3521#(<= ~counter~0 1)} is VALID [2022-04-27 13:00:18,777 INFO L290 TraceCheckUtils]: 29: Hoare triple {3521#(<= ~counter~0 1)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {3521#(<= ~counter~0 1)} is VALID [2022-04-27 13:00:18,778 INFO L290 TraceCheckUtils]: 30: Hoare triple {3521#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {3531#(<= ~counter~0 2)} is VALID [2022-04-27 13:00:18,778 INFO L290 TraceCheckUtils]: 31: Hoare triple {3531#(<= ~counter~0 2)} assume !!(#t~post7 < 50);havoc #t~post7; {3531#(<= ~counter~0 2)} is VALID [2022-04-27 13:00:18,779 INFO L272 TraceCheckUtils]: 32: Hoare triple {3531#(<= ~counter~0 2)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {3531#(<= ~counter~0 2)} is VALID [2022-04-27 13:00:18,779 INFO L290 TraceCheckUtils]: 33: Hoare triple {3531#(<= ~counter~0 2)} ~cond := #in~cond; {3531#(<= ~counter~0 2)} is VALID [2022-04-27 13:00:18,780 INFO L290 TraceCheckUtils]: 34: Hoare triple {3531#(<= ~counter~0 2)} assume !(0 == ~cond); {3531#(<= ~counter~0 2)} is VALID [2022-04-27 13:00:18,780 INFO L290 TraceCheckUtils]: 35: Hoare triple {3531#(<= ~counter~0 2)} assume true; {3531#(<= ~counter~0 2)} is VALID [2022-04-27 13:00:18,781 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {3531#(<= ~counter~0 2)} {3531#(<= ~counter~0 2)} #86#return; {3531#(<= ~counter~0 2)} is VALID [2022-04-27 13:00:18,782 INFO L272 TraceCheckUtils]: 37: Hoare triple {3531#(<= ~counter~0 2)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {3531#(<= ~counter~0 2)} is VALID [2022-04-27 13:00:18,782 INFO L290 TraceCheckUtils]: 38: Hoare triple {3531#(<= ~counter~0 2)} ~cond := #in~cond; {3531#(<= ~counter~0 2)} is VALID [2022-04-27 13:00:18,782 INFO L290 TraceCheckUtils]: 39: Hoare triple {3531#(<= ~counter~0 2)} assume !(0 == ~cond); {3531#(<= ~counter~0 2)} is VALID [2022-04-27 13:00:18,783 INFO L290 TraceCheckUtils]: 40: Hoare triple {3531#(<= ~counter~0 2)} assume true; {3531#(<= ~counter~0 2)} is VALID [2022-04-27 13:00:18,784 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {3531#(<= ~counter~0 2)} {3531#(<= ~counter~0 2)} #88#return; {3531#(<= ~counter~0 2)} is VALID [2022-04-27 13:00:18,784 INFO L272 TraceCheckUtils]: 42: Hoare triple {3531#(<= ~counter~0 2)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {3531#(<= ~counter~0 2)} is VALID [2022-04-27 13:00:18,785 INFO L290 TraceCheckUtils]: 43: Hoare triple {3531#(<= ~counter~0 2)} ~cond := #in~cond; {3531#(<= ~counter~0 2)} is VALID [2022-04-27 13:00:18,785 INFO L290 TraceCheckUtils]: 44: Hoare triple {3531#(<= ~counter~0 2)} assume !(0 == ~cond); {3531#(<= ~counter~0 2)} is VALID [2022-04-27 13:00:18,786 INFO L290 TraceCheckUtils]: 45: Hoare triple {3531#(<= ~counter~0 2)} assume true; {3531#(<= ~counter~0 2)} is VALID [2022-04-27 13:00:18,786 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {3531#(<= ~counter~0 2)} {3531#(<= ~counter~0 2)} #90#return; {3531#(<= ~counter~0 2)} is VALID [2022-04-27 13:00:18,787 INFO L272 TraceCheckUtils]: 47: Hoare triple {3531#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {3531#(<= ~counter~0 2)} is VALID [2022-04-27 13:00:18,788 INFO L290 TraceCheckUtils]: 48: Hoare triple {3531#(<= ~counter~0 2)} ~cond := #in~cond; {3531#(<= ~counter~0 2)} is VALID [2022-04-27 13:00:18,788 INFO L290 TraceCheckUtils]: 49: Hoare triple {3531#(<= ~counter~0 2)} assume !(0 == ~cond); {3531#(<= ~counter~0 2)} is VALID [2022-04-27 13:00:18,788 INFO L290 TraceCheckUtils]: 50: Hoare triple {3531#(<= ~counter~0 2)} assume true; {3531#(<= ~counter~0 2)} is VALID [2022-04-27 13:00:18,789 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {3531#(<= ~counter~0 2)} {3531#(<= ~counter~0 2)} #92#return; {3531#(<= ~counter~0 2)} is VALID [2022-04-27 13:00:18,790 INFO L290 TraceCheckUtils]: 52: Hoare triple {3531#(<= ~counter~0 2)} assume !(~c~0 >= ~b~0); {3531#(<= ~counter~0 2)} is VALID [2022-04-27 13:00:18,790 INFO L290 TraceCheckUtils]: 53: Hoare triple {3531#(<= ~counter~0 2)} ~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; {3531#(<= ~counter~0 2)} is VALID [2022-04-27 13:00:18,791 INFO L290 TraceCheckUtils]: 54: Hoare triple {3531#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3604#(<= |main_#t~post6| 2)} is VALID [2022-04-27 13:00:18,791 INFO L290 TraceCheckUtils]: 55: Hoare triple {3604#(<= |main_#t~post6| 2)} assume !(#t~post6 < 50);havoc #t~post6; {3435#false} is VALID [2022-04-27 13:00:18,791 INFO L272 TraceCheckUtils]: 56: Hoare triple {3435#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {3435#false} is VALID [2022-04-27 13:00:18,791 INFO L290 TraceCheckUtils]: 57: Hoare triple {3435#false} ~cond := #in~cond; {3435#false} is VALID [2022-04-27 13:00:18,791 INFO L290 TraceCheckUtils]: 58: Hoare triple {3435#false} assume 0 == ~cond; {3435#false} is VALID [2022-04-27 13:00:18,791 INFO L290 TraceCheckUtils]: 59: Hoare triple {3435#false} assume !false; {3435#false} is VALID [2022-04-27 13:00:18,792 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-04-27 13:00:18,792 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:00:19,118 INFO L290 TraceCheckUtils]: 59: Hoare triple {3435#false} assume !false; {3435#false} is VALID [2022-04-27 13:00:19,119 INFO L290 TraceCheckUtils]: 58: Hoare triple {3435#false} assume 0 == ~cond; {3435#false} is VALID [2022-04-27 13:00:19,119 INFO L290 TraceCheckUtils]: 57: Hoare triple {3435#false} ~cond := #in~cond; {3435#false} is VALID [2022-04-27 13:00:19,119 INFO L272 TraceCheckUtils]: 56: Hoare triple {3435#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {3435#false} is VALID [2022-04-27 13:00:19,119 INFO L290 TraceCheckUtils]: 55: Hoare triple {3632#(< |main_#t~post6| 50)} assume !(#t~post6 < 50);havoc #t~post6; {3435#false} is VALID [2022-04-27 13:00:19,120 INFO L290 TraceCheckUtils]: 54: Hoare triple {3636#(< ~counter~0 50)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3632#(< |main_#t~post6| 50)} is VALID [2022-04-27 13:00:19,120 INFO L290 TraceCheckUtils]: 53: Hoare triple {3636#(< ~counter~0 50)} ~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; {3636#(< ~counter~0 50)} is VALID [2022-04-27 13:00:19,120 INFO L290 TraceCheckUtils]: 52: Hoare triple {3636#(< ~counter~0 50)} assume !(~c~0 >= ~b~0); {3636#(< ~counter~0 50)} is VALID [2022-04-27 13:00:19,121 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {3434#true} {3636#(< ~counter~0 50)} #92#return; {3636#(< ~counter~0 50)} is VALID [2022-04-27 13:00:19,121 INFO L290 TraceCheckUtils]: 50: Hoare triple {3434#true} assume true; {3434#true} is VALID [2022-04-27 13:00:19,121 INFO L290 TraceCheckUtils]: 49: Hoare triple {3434#true} assume !(0 == ~cond); {3434#true} is VALID [2022-04-27 13:00:19,122 INFO L290 TraceCheckUtils]: 48: Hoare triple {3434#true} ~cond := #in~cond; {3434#true} is VALID [2022-04-27 13:00:19,122 INFO L272 TraceCheckUtils]: 47: Hoare triple {3636#(< ~counter~0 50)} 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)); {3434#true} is VALID [2022-04-27 13:00:19,122 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {3434#true} {3636#(< ~counter~0 50)} #90#return; {3636#(< ~counter~0 50)} is VALID [2022-04-27 13:00:19,122 INFO L290 TraceCheckUtils]: 45: Hoare triple {3434#true} assume true; {3434#true} is VALID [2022-04-27 13:00:19,123 INFO L290 TraceCheckUtils]: 44: Hoare triple {3434#true} assume !(0 == ~cond); {3434#true} is VALID [2022-04-27 13:00:19,123 INFO L290 TraceCheckUtils]: 43: Hoare triple {3434#true} ~cond := #in~cond; {3434#true} is VALID [2022-04-27 13:00:19,123 INFO L272 TraceCheckUtils]: 42: Hoare triple {3636#(< ~counter~0 50)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {3434#true} is VALID [2022-04-27 13:00:19,123 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {3434#true} {3636#(< ~counter~0 50)} #88#return; {3636#(< ~counter~0 50)} is VALID [2022-04-27 13:00:19,123 INFO L290 TraceCheckUtils]: 40: Hoare triple {3434#true} assume true; {3434#true} is VALID [2022-04-27 13:00:19,124 INFO L290 TraceCheckUtils]: 39: Hoare triple {3434#true} assume !(0 == ~cond); {3434#true} is VALID [2022-04-27 13:00:19,124 INFO L290 TraceCheckUtils]: 38: Hoare triple {3434#true} ~cond := #in~cond; {3434#true} is VALID [2022-04-27 13:00:19,124 INFO L272 TraceCheckUtils]: 37: Hoare triple {3636#(< ~counter~0 50)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {3434#true} is VALID [2022-04-27 13:00:19,124 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {3434#true} {3636#(< ~counter~0 50)} #86#return; {3636#(< ~counter~0 50)} is VALID [2022-04-27 13:00:19,124 INFO L290 TraceCheckUtils]: 35: Hoare triple {3434#true} assume true; {3434#true} is VALID [2022-04-27 13:00:19,124 INFO L290 TraceCheckUtils]: 34: Hoare triple {3434#true} assume !(0 == ~cond); {3434#true} is VALID [2022-04-27 13:00:19,125 INFO L290 TraceCheckUtils]: 33: Hoare triple {3434#true} ~cond := #in~cond; {3434#true} is VALID [2022-04-27 13:00:19,125 INFO L272 TraceCheckUtils]: 32: Hoare triple {3636#(< ~counter~0 50)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {3434#true} is VALID [2022-04-27 13:00:19,125 INFO L290 TraceCheckUtils]: 31: Hoare triple {3636#(< ~counter~0 50)} assume !!(#t~post7 < 50);havoc #t~post7; {3636#(< ~counter~0 50)} is VALID [2022-04-27 13:00:19,126 INFO L290 TraceCheckUtils]: 30: Hoare triple {3709#(< ~counter~0 49)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {3636#(< ~counter~0 50)} is VALID [2022-04-27 13:00:19,126 INFO L290 TraceCheckUtils]: 29: Hoare triple {3709#(< ~counter~0 49)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {3709#(< ~counter~0 49)} is VALID [2022-04-27 13:00:19,126 INFO L290 TraceCheckUtils]: 28: Hoare triple {3709#(< ~counter~0 49)} assume !!(#t~post6 < 50);havoc #t~post6; {3709#(< ~counter~0 49)} is VALID [2022-04-27 13:00:19,127 INFO L290 TraceCheckUtils]: 27: Hoare triple {3719#(< ~counter~0 48)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3709#(< ~counter~0 49)} is VALID [2022-04-27 13:00:19,127 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {3434#true} {3719#(< ~counter~0 48)} #84#return; {3719#(< ~counter~0 48)} is VALID [2022-04-27 13:00:19,127 INFO L290 TraceCheckUtils]: 25: Hoare triple {3434#true} assume true; {3434#true} is VALID [2022-04-27 13:00:19,127 INFO L290 TraceCheckUtils]: 24: Hoare triple {3434#true} assume !(0 == ~cond); {3434#true} is VALID [2022-04-27 13:00:19,128 INFO L290 TraceCheckUtils]: 23: Hoare triple {3434#true} ~cond := #in~cond; {3434#true} is VALID [2022-04-27 13:00:19,128 INFO L272 TraceCheckUtils]: 22: Hoare triple {3719#(< ~counter~0 48)} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {3434#true} is VALID [2022-04-27 13:00:19,128 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {3434#true} {3719#(< ~counter~0 48)} #82#return; {3719#(< ~counter~0 48)} is VALID [2022-04-27 13:00:19,128 INFO L290 TraceCheckUtils]: 20: Hoare triple {3434#true} assume true; {3434#true} is VALID [2022-04-27 13:00:19,128 INFO L290 TraceCheckUtils]: 19: Hoare triple {3434#true} assume !(0 == ~cond); {3434#true} is VALID [2022-04-27 13:00:19,128 INFO L290 TraceCheckUtils]: 18: Hoare triple {3434#true} ~cond := #in~cond; {3434#true} is VALID [2022-04-27 13:00:19,128 INFO L272 TraceCheckUtils]: 17: Hoare triple {3719#(< ~counter~0 48)} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {3434#true} is VALID [2022-04-27 13:00:19,129 INFO L290 TraceCheckUtils]: 16: Hoare triple {3719#(< ~counter~0 48)} ~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; {3719#(< ~counter~0 48)} is VALID [2022-04-27 13:00:19,129 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3434#true} {3719#(< ~counter~0 48)} #80#return; {3719#(< ~counter~0 48)} is VALID [2022-04-27 13:00:19,129 INFO L290 TraceCheckUtils]: 14: Hoare triple {3434#true} assume true; {3434#true} is VALID [2022-04-27 13:00:19,129 INFO L290 TraceCheckUtils]: 13: Hoare triple {3434#true} assume !(0 == ~cond); {3434#true} is VALID [2022-04-27 13:00:19,129 INFO L290 TraceCheckUtils]: 12: Hoare triple {3434#true} ~cond := #in~cond; {3434#true} is VALID [2022-04-27 13:00:19,130 INFO L272 TraceCheckUtils]: 11: Hoare triple {3719#(< ~counter~0 48)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {3434#true} is VALID [2022-04-27 13:00:19,130 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3434#true} {3719#(< ~counter~0 48)} #78#return; {3719#(< ~counter~0 48)} is VALID [2022-04-27 13:00:19,130 INFO L290 TraceCheckUtils]: 9: Hoare triple {3434#true} assume true; {3434#true} is VALID [2022-04-27 13:00:19,130 INFO L290 TraceCheckUtils]: 8: Hoare triple {3434#true} assume !(0 == ~cond); {3434#true} is VALID [2022-04-27 13:00:19,130 INFO L290 TraceCheckUtils]: 7: Hoare triple {3434#true} ~cond := #in~cond; {3434#true} is VALID [2022-04-27 13:00:19,130 INFO L272 TraceCheckUtils]: 6: Hoare triple {3719#(< ~counter~0 48)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {3434#true} is VALID [2022-04-27 13:00:19,131 INFO L290 TraceCheckUtils]: 5: Hoare triple {3719#(< ~counter~0 48)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {3719#(< ~counter~0 48)} is VALID [2022-04-27 13:00:19,131 INFO L272 TraceCheckUtils]: 4: Hoare triple {3719#(< ~counter~0 48)} call #t~ret8 := main(); {3719#(< ~counter~0 48)} is VALID [2022-04-27 13:00:19,131 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3719#(< ~counter~0 48)} {3434#true} #98#return; {3719#(< ~counter~0 48)} is VALID [2022-04-27 13:00:19,132 INFO L290 TraceCheckUtils]: 2: Hoare triple {3719#(< ~counter~0 48)} assume true; {3719#(< ~counter~0 48)} is VALID [2022-04-27 13:00:19,132 INFO L290 TraceCheckUtils]: 1: Hoare triple {3434#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);~counter~0 := 0; {3719#(< ~counter~0 48)} is VALID [2022-04-27 13:00:19,132 INFO L272 TraceCheckUtils]: 0: Hoare triple {3434#true} call ULTIMATE.init(); {3434#true} is VALID [2022-04-27 13:00:19,132 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-04-27 13:00:19,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:00:19,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313677926] [2022-04-27 13:00:19,133 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:00:19,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1545095879] [2022-04-27 13:00:19,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1545095879] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 13:00:19,133 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 13:00:19,133 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-04-27 13:00:19,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450780941] [2022-04-27 13:00:19,133 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 13:00:19,134 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 6 states have call successors, (20), 5 states have call predecessors, (20), 4 states have return successors, (18), 4 states have call predecessors, (18), 5 states have call successors, (18) Word has length 60 [2022-04-27 13:00:19,134 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:00:19,135 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 6 states have call successors, (20), 5 states have call predecessors, (20), 4 states have return successors, (18), 4 states have call predecessors, (18), 5 states have call successors, (18) [2022-04-27 13:00:19,226 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:00:19,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-27 13:00:19,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:00:19,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-27 13:00:19,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-27 13:00:19,227 INFO L87 Difference]: Start difference. First operand 62 states and 75 transitions. Second operand has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 6 states have call successors, (20), 5 states have call predecessors, (20), 4 states have return successors, (18), 4 states have call predecessors, (18), 5 states have call successors, (18) [2022-04-27 13:00:19,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:00:19,734 INFO L93 Difference]: Finished difference Result 215 states and 254 transitions. [2022-04-27 13:00:19,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-27 13:00:19,735 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 6 states have call successors, (20), 5 states have call predecessors, (20), 4 states have return successors, (18), 4 states have call predecessors, (18), 5 states have call successors, (18) Word has length 60 [2022-04-27 13:00:19,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:00:19,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 6 states have call successors, (20), 5 states have call predecessors, (20), 4 states have return successors, (18), 4 states have call predecessors, (18), 5 states have call successors, (18) [2022-04-27 13:00:19,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 157 transitions. [2022-04-27 13:00:19,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 6 states have call successors, (20), 5 states have call predecessors, (20), 4 states have return successors, (18), 4 states have call predecessors, (18), 5 states have call successors, (18) [2022-04-27 13:00:19,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 157 transitions. [2022-04-27 13:00:19,751 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 157 transitions. [2022-04-27 13:00:19,901 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 157 edges. 157 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:00:19,906 INFO L225 Difference]: With dead ends: 215 [2022-04-27 13:00:19,906 INFO L226 Difference]: Without dead ends: 207 [2022-04-27 13:00:19,906 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2022-04-27 13:00:19,907 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 81 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 13:00:19,907 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 209 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 13:00:19,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2022-04-27 13:00:20,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 199. [2022-04-27 13:00:20,011 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:00:20,011 INFO L82 GeneralOperation]: Start isEquivalent. First operand 207 states. Second operand has 199 states, 126 states have (on average 1.1904761904761905) internal successors, (150), 130 states have internal predecessors, (150), 46 states have call successors, (46), 27 states have call predecessors, (46), 26 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) [2022-04-27 13:00:20,013 INFO L74 IsIncluded]: Start isIncluded. First operand 207 states. Second operand has 199 states, 126 states have (on average 1.1904761904761905) internal successors, (150), 130 states have internal predecessors, (150), 46 states have call successors, (46), 27 states have call predecessors, (46), 26 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) [2022-04-27 13:00:20,014 INFO L87 Difference]: Start difference. First operand 207 states. Second operand has 199 states, 126 states have (on average 1.1904761904761905) internal successors, (150), 130 states have internal predecessors, (150), 46 states have call successors, (46), 27 states have call predecessors, (46), 26 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) [2022-04-27 13:00:20,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:00:20,020 INFO L93 Difference]: Finished difference Result 207 states and 242 transitions. [2022-04-27 13:00:20,020 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 242 transitions. [2022-04-27 13:00:20,021 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:00:20,021 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:00:20,023 INFO L74 IsIncluded]: Start isIncluded. First operand has 199 states, 126 states have (on average 1.1904761904761905) internal successors, (150), 130 states have internal predecessors, (150), 46 states have call successors, (46), 27 states have call predecessors, (46), 26 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) Second operand 207 states. [2022-04-27 13:00:20,023 INFO L87 Difference]: Start difference. First operand has 199 states, 126 states have (on average 1.1904761904761905) internal successors, (150), 130 states have internal predecessors, (150), 46 states have call successors, (46), 27 states have call predecessors, (46), 26 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) Second operand 207 states. [2022-04-27 13:00:20,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:00:20,029 INFO L93 Difference]: Finished difference Result 207 states and 242 transitions. [2022-04-27 13:00:20,029 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 242 transitions. [2022-04-27 13:00:20,030 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:00:20,030 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:00:20,030 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:00:20,030 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:00:20,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 126 states have (on average 1.1904761904761905) internal successors, (150), 130 states have internal predecessors, (150), 46 states have call successors, (46), 27 states have call predecessors, (46), 26 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) [2022-04-27 13:00:20,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 237 transitions. [2022-04-27 13:00:20,036 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 237 transitions. Word has length 60 [2022-04-27 13:00:20,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:00:20,038 INFO L495 AbstractCegarLoop]: Abstraction has 199 states and 237 transitions. [2022-04-27 13:00:20,038 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 6 states have call successors, (20), 5 states have call predecessors, (20), 4 states have return successors, (18), 4 states have call predecessors, (18), 5 states have call successors, (18) [2022-04-27 13:00:20,038 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 237 transitions. [2022-04-27 13:00:20,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-04-27 13:00:20,039 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:00:20,040 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:00:20,074 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:00:20,257 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:00:20,257 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:00:20,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:00:20,258 INFO L85 PathProgramCache]: Analyzing trace with hash 1088000375, now seen corresponding path program 1 times [2022-04-27 13:00:20,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:00:20,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857664777] [2022-04-27 13:00:20,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:00:20,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:00:20,279 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:00:20,279 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2058409963] [2022-04-27 13:00:20,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:00:20,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:00:20,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:00:20,282 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:00:20,312 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:00:20,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:00:20,341 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-27 13:00:20,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:00:20,353 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:00:20,558 INFO L272 TraceCheckUtils]: 0: Hoare triple {4818#true} call ULTIMATE.init(); {4818#true} is VALID [2022-04-27 13:00:20,558 INFO L290 TraceCheckUtils]: 1: Hoare triple {4818#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);~counter~0 := 0; {4818#true} is VALID [2022-04-27 13:00:20,558 INFO L290 TraceCheckUtils]: 2: Hoare triple {4818#true} assume true; {4818#true} is VALID [2022-04-27 13:00:20,558 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4818#true} {4818#true} #98#return; {4818#true} is VALID [2022-04-27 13:00:20,558 INFO L272 TraceCheckUtils]: 4: Hoare triple {4818#true} call #t~ret8 := main(); {4818#true} is VALID [2022-04-27 13:00:20,558 INFO L290 TraceCheckUtils]: 5: Hoare triple {4818#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {4818#true} is VALID [2022-04-27 13:00:20,558 INFO L272 TraceCheckUtils]: 6: Hoare triple {4818#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {4818#true} is VALID [2022-04-27 13:00:20,558 INFO L290 TraceCheckUtils]: 7: Hoare triple {4818#true} ~cond := #in~cond; {4844#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 13:00:20,559 INFO L290 TraceCheckUtils]: 8: Hoare triple {4844#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {4848#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 13:00:20,560 INFO L290 TraceCheckUtils]: 9: Hoare triple {4848#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {4848#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 13:00:20,560 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4848#(not (= |assume_abort_if_not_#in~cond| 0))} {4818#true} #78#return; {4855#(<= 1 main_~x~0)} is VALID [2022-04-27 13:00:20,560 INFO L272 TraceCheckUtils]: 11: Hoare triple {4855#(<= 1 main_~x~0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {4818#true} is VALID [2022-04-27 13:00:20,560 INFO L290 TraceCheckUtils]: 12: Hoare triple {4818#true} ~cond := #in~cond; {4818#true} is VALID [2022-04-27 13:00:20,560 INFO L290 TraceCheckUtils]: 13: Hoare triple {4818#true} assume !(0 == ~cond); {4818#true} is VALID [2022-04-27 13:00:20,560 INFO L290 TraceCheckUtils]: 14: Hoare triple {4818#true} assume true; {4818#true} is VALID [2022-04-27 13:00:20,563 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {4818#true} {4855#(<= 1 main_~x~0)} #80#return; {4855#(<= 1 main_~x~0)} is VALID [2022-04-27 13:00:20,564 INFO L290 TraceCheckUtils]: 16: Hoare triple {4855#(<= 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; {4874#(<= 1 main_~a~0)} is VALID [2022-04-27 13:00:20,564 INFO L272 TraceCheckUtils]: 17: Hoare triple {4874#(<= 1 main_~a~0)} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {4818#true} is VALID [2022-04-27 13:00:20,564 INFO L290 TraceCheckUtils]: 18: Hoare triple {4818#true} ~cond := #in~cond; {4818#true} is VALID [2022-04-27 13:00:20,564 INFO L290 TraceCheckUtils]: 19: Hoare triple {4818#true} assume !(0 == ~cond); {4818#true} is VALID [2022-04-27 13:00:20,564 INFO L290 TraceCheckUtils]: 20: Hoare triple {4818#true} assume true; {4818#true} is VALID [2022-04-27 13:00:20,565 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {4818#true} {4874#(<= 1 main_~a~0)} #82#return; {4874#(<= 1 main_~a~0)} is VALID [2022-04-27 13:00:20,565 INFO L272 TraceCheckUtils]: 22: Hoare triple {4874#(<= 1 main_~a~0)} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {4818#true} is VALID [2022-04-27 13:00:20,565 INFO L290 TraceCheckUtils]: 23: Hoare triple {4818#true} ~cond := #in~cond; {4818#true} is VALID [2022-04-27 13:00:20,565 INFO L290 TraceCheckUtils]: 24: Hoare triple {4818#true} assume !(0 == ~cond); {4818#true} is VALID [2022-04-27 13:00:20,565 INFO L290 TraceCheckUtils]: 25: Hoare triple {4818#true} assume true; {4818#true} is VALID [2022-04-27 13:00:20,566 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {4818#true} {4874#(<= 1 main_~a~0)} #84#return; {4874#(<= 1 main_~a~0)} is VALID [2022-04-27 13:00:20,566 INFO L290 TraceCheckUtils]: 27: Hoare triple {4874#(<= 1 main_~a~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4874#(<= 1 main_~a~0)} is VALID [2022-04-27 13:00:20,567 INFO L290 TraceCheckUtils]: 28: Hoare triple {4874#(<= 1 main_~a~0)} assume !!(#t~post6 < 50);havoc #t~post6; {4874#(<= 1 main_~a~0)} is VALID [2022-04-27 13:00:20,567 INFO L290 TraceCheckUtils]: 29: Hoare triple {4874#(<= 1 main_~a~0)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {4914#(<= 1 main_~c~0)} is VALID [2022-04-27 13:00:20,567 INFO L290 TraceCheckUtils]: 30: Hoare triple {4914#(<= 1 main_~c~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {4914#(<= 1 main_~c~0)} is VALID [2022-04-27 13:00:20,568 INFO L290 TraceCheckUtils]: 31: Hoare triple {4914#(<= 1 main_~c~0)} assume !!(#t~post7 < 50);havoc #t~post7; {4914#(<= 1 main_~c~0)} is VALID [2022-04-27 13:00:20,568 INFO L272 TraceCheckUtils]: 32: Hoare triple {4914#(<= 1 main_~c~0)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {4818#true} is VALID [2022-04-27 13:00:20,568 INFO L290 TraceCheckUtils]: 33: Hoare triple {4818#true} ~cond := #in~cond; {4818#true} is VALID [2022-04-27 13:00:20,568 INFO L290 TraceCheckUtils]: 34: Hoare triple {4818#true} assume !(0 == ~cond); {4818#true} is VALID [2022-04-27 13:00:20,568 INFO L290 TraceCheckUtils]: 35: Hoare triple {4818#true} assume true; {4818#true} is VALID [2022-04-27 13:00:20,569 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {4818#true} {4914#(<= 1 main_~c~0)} #86#return; {4914#(<= 1 main_~c~0)} is VALID [2022-04-27 13:00:20,569 INFO L272 TraceCheckUtils]: 37: Hoare triple {4914#(<= 1 main_~c~0)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {4818#true} is VALID [2022-04-27 13:00:20,569 INFO L290 TraceCheckUtils]: 38: Hoare triple {4818#true} ~cond := #in~cond; {4818#true} is VALID [2022-04-27 13:00:20,569 INFO L290 TraceCheckUtils]: 39: Hoare triple {4818#true} assume !(0 == ~cond); {4818#true} is VALID [2022-04-27 13:00:20,569 INFO L290 TraceCheckUtils]: 40: Hoare triple {4818#true} assume true; {4818#true} is VALID [2022-04-27 13:00:20,570 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {4818#true} {4914#(<= 1 main_~c~0)} #88#return; {4914#(<= 1 main_~c~0)} is VALID [2022-04-27 13:00:20,570 INFO L272 TraceCheckUtils]: 42: Hoare triple {4914#(<= 1 main_~c~0)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {4818#true} is VALID [2022-04-27 13:00:20,570 INFO L290 TraceCheckUtils]: 43: Hoare triple {4818#true} ~cond := #in~cond; {4818#true} is VALID [2022-04-27 13:00:20,570 INFO L290 TraceCheckUtils]: 44: Hoare triple {4818#true} assume !(0 == ~cond); {4818#true} is VALID [2022-04-27 13:00:20,570 INFO L290 TraceCheckUtils]: 45: Hoare triple {4818#true} assume true; {4818#true} is VALID [2022-04-27 13:00:20,571 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {4818#true} {4914#(<= 1 main_~c~0)} #90#return; {4914#(<= 1 main_~c~0)} is VALID [2022-04-27 13:00:20,571 INFO L272 TraceCheckUtils]: 47: Hoare triple {4914#(<= 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)); {4818#true} is VALID [2022-04-27 13:00:20,571 INFO L290 TraceCheckUtils]: 48: Hoare triple {4818#true} ~cond := #in~cond; {4818#true} is VALID [2022-04-27 13:00:20,571 INFO L290 TraceCheckUtils]: 49: Hoare triple {4818#true} assume !(0 == ~cond); {4818#true} is VALID [2022-04-27 13:00:20,571 INFO L290 TraceCheckUtils]: 50: Hoare triple {4818#true} assume true; {4818#true} is VALID [2022-04-27 13:00:20,572 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {4818#true} {4914#(<= 1 main_~c~0)} #92#return; {4914#(<= 1 main_~c~0)} is VALID [2022-04-27 13:00:20,573 INFO L290 TraceCheckUtils]: 52: Hoare triple {4914#(<= 1 main_~c~0)} assume !(~c~0 >= ~b~0); {4914#(<= 1 main_~c~0)} is VALID [2022-04-27 13:00:20,573 INFO L290 TraceCheckUtils]: 53: Hoare triple {4914#(<= 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; {4987#(<= 1 main_~b~0)} is VALID [2022-04-27 13:00:20,573 INFO L290 TraceCheckUtils]: 54: Hoare triple {4987#(<= 1 main_~b~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4987#(<= 1 main_~b~0)} is VALID [2022-04-27 13:00:20,574 INFO L290 TraceCheckUtils]: 55: Hoare triple {4987#(<= 1 main_~b~0)} assume !!(#t~post6 < 50);havoc #t~post6; {4987#(<= 1 main_~b~0)} is VALID [2022-04-27 13:00:20,574 INFO L290 TraceCheckUtils]: 56: Hoare triple {4987#(<= 1 main_~b~0)} assume !(0 != ~b~0); {4819#false} is VALID [2022-04-27 13:00:20,574 INFO L272 TraceCheckUtils]: 57: Hoare triple {4819#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {4819#false} is VALID [2022-04-27 13:00:20,574 INFO L290 TraceCheckUtils]: 58: Hoare triple {4819#false} ~cond := #in~cond; {4819#false} is VALID [2022-04-27 13:00:20,574 INFO L290 TraceCheckUtils]: 59: Hoare triple {4819#false} assume 0 == ~cond; {4819#false} is VALID [2022-04-27 13:00:20,574 INFO L290 TraceCheckUtils]: 60: Hoare triple {4819#false} assume !false; {4819#false} is VALID [2022-04-27 13:00:20,575 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 8 proven. 12 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-04-27 13:00:20,575 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:00:20,891 INFO L290 TraceCheckUtils]: 60: Hoare triple {4819#false} assume !false; {4819#false} is VALID [2022-04-27 13:00:20,891 INFO L290 TraceCheckUtils]: 59: Hoare triple {4819#false} assume 0 == ~cond; {4819#false} is VALID [2022-04-27 13:00:20,891 INFO L290 TraceCheckUtils]: 58: Hoare triple {4819#false} ~cond := #in~cond; {4819#false} is VALID [2022-04-27 13:00:20,891 INFO L272 TraceCheckUtils]: 57: Hoare triple {4819#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {4819#false} is VALID [2022-04-27 13:00:20,892 INFO L290 TraceCheckUtils]: 56: Hoare triple {4987#(<= 1 main_~b~0)} assume !(0 != ~b~0); {4819#false} is VALID [2022-04-27 13:00:20,892 INFO L290 TraceCheckUtils]: 55: Hoare triple {4987#(<= 1 main_~b~0)} assume !!(#t~post6 < 50);havoc #t~post6; {4987#(<= 1 main_~b~0)} is VALID [2022-04-27 13:00:20,893 INFO L290 TraceCheckUtils]: 54: Hoare triple {4987#(<= 1 main_~b~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4987#(<= 1 main_~b~0)} is VALID [2022-04-27 13:00:20,893 INFO L290 TraceCheckUtils]: 53: Hoare triple {4914#(<= 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; {4987#(<= 1 main_~b~0)} is VALID [2022-04-27 13:00:20,894 INFO L290 TraceCheckUtils]: 52: Hoare triple {4914#(<= 1 main_~c~0)} assume !(~c~0 >= ~b~0); {4914#(<= 1 main_~c~0)} is VALID [2022-04-27 13:00:20,894 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {4818#true} {4914#(<= 1 main_~c~0)} #92#return; {4914#(<= 1 main_~c~0)} is VALID [2022-04-27 13:00:20,895 INFO L290 TraceCheckUtils]: 50: Hoare triple {4818#true} assume true; {4818#true} is VALID [2022-04-27 13:00:20,895 INFO L290 TraceCheckUtils]: 49: Hoare triple {4818#true} assume !(0 == ~cond); {4818#true} is VALID [2022-04-27 13:00:20,895 INFO L290 TraceCheckUtils]: 48: Hoare triple {4818#true} ~cond := #in~cond; {4818#true} is VALID [2022-04-27 13:00:20,895 INFO L272 TraceCheckUtils]: 47: Hoare triple {4914#(<= 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)); {4818#true} is VALID [2022-04-27 13:00:20,896 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {4818#true} {4914#(<= 1 main_~c~0)} #90#return; {4914#(<= 1 main_~c~0)} is VALID [2022-04-27 13:00:20,896 INFO L290 TraceCheckUtils]: 45: Hoare triple {4818#true} assume true; {4818#true} is VALID [2022-04-27 13:00:20,896 INFO L290 TraceCheckUtils]: 44: Hoare triple {4818#true} assume !(0 == ~cond); {4818#true} is VALID [2022-04-27 13:00:20,896 INFO L290 TraceCheckUtils]: 43: Hoare triple {4818#true} ~cond := #in~cond; {4818#true} is VALID [2022-04-27 13:00:20,896 INFO L272 TraceCheckUtils]: 42: Hoare triple {4914#(<= 1 main_~c~0)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {4818#true} is VALID [2022-04-27 13:00:20,897 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {4818#true} {4914#(<= 1 main_~c~0)} #88#return; {4914#(<= 1 main_~c~0)} is VALID [2022-04-27 13:00:20,897 INFO L290 TraceCheckUtils]: 40: Hoare triple {4818#true} assume true; {4818#true} is VALID [2022-04-27 13:00:20,897 INFO L290 TraceCheckUtils]: 39: Hoare triple {4818#true} assume !(0 == ~cond); {4818#true} is VALID [2022-04-27 13:00:20,897 INFO L290 TraceCheckUtils]: 38: Hoare triple {4818#true} ~cond := #in~cond; {4818#true} is VALID [2022-04-27 13:00:20,897 INFO L272 TraceCheckUtils]: 37: Hoare triple {4914#(<= 1 main_~c~0)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {4818#true} is VALID [2022-04-27 13:00:20,898 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {4818#true} {4914#(<= 1 main_~c~0)} #86#return; {4914#(<= 1 main_~c~0)} is VALID [2022-04-27 13:00:20,898 INFO L290 TraceCheckUtils]: 35: Hoare triple {4818#true} assume true; {4818#true} is VALID [2022-04-27 13:00:20,898 INFO L290 TraceCheckUtils]: 34: Hoare triple {4818#true} assume !(0 == ~cond); {4818#true} is VALID [2022-04-27 13:00:20,898 INFO L290 TraceCheckUtils]: 33: Hoare triple {4818#true} ~cond := #in~cond; {4818#true} is VALID [2022-04-27 13:00:20,898 INFO L272 TraceCheckUtils]: 32: Hoare triple {4914#(<= 1 main_~c~0)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {4818#true} is VALID [2022-04-27 13:00:20,898 INFO L290 TraceCheckUtils]: 31: Hoare triple {4914#(<= 1 main_~c~0)} assume !!(#t~post7 < 50);havoc #t~post7; {4914#(<= 1 main_~c~0)} is VALID [2022-04-27 13:00:20,899 INFO L290 TraceCheckUtils]: 30: Hoare triple {4914#(<= 1 main_~c~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {4914#(<= 1 main_~c~0)} is VALID [2022-04-27 13:00:20,899 INFO L290 TraceCheckUtils]: 29: Hoare triple {4874#(<= 1 main_~a~0)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {4914#(<= 1 main_~c~0)} is VALID [2022-04-27 13:00:20,899 INFO L290 TraceCheckUtils]: 28: Hoare triple {4874#(<= 1 main_~a~0)} assume !!(#t~post6 < 50);havoc #t~post6; {4874#(<= 1 main_~a~0)} is VALID [2022-04-27 13:00:20,900 INFO L290 TraceCheckUtils]: 27: Hoare triple {4874#(<= 1 main_~a~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4874#(<= 1 main_~a~0)} is VALID [2022-04-27 13:00:20,900 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {4818#true} {4874#(<= 1 main_~a~0)} #84#return; {4874#(<= 1 main_~a~0)} is VALID [2022-04-27 13:00:20,900 INFO L290 TraceCheckUtils]: 25: Hoare triple {4818#true} assume true; {4818#true} is VALID [2022-04-27 13:00:20,900 INFO L290 TraceCheckUtils]: 24: Hoare triple {4818#true} assume !(0 == ~cond); {4818#true} is VALID [2022-04-27 13:00:20,901 INFO L290 TraceCheckUtils]: 23: Hoare triple {4818#true} ~cond := #in~cond; {4818#true} is VALID [2022-04-27 13:00:20,901 INFO L272 TraceCheckUtils]: 22: Hoare triple {4874#(<= 1 main_~a~0)} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {4818#true} is VALID [2022-04-27 13:00:20,901 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {4818#true} {4874#(<= 1 main_~a~0)} #82#return; {4874#(<= 1 main_~a~0)} is VALID [2022-04-27 13:00:20,901 INFO L290 TraceCheckUtils]: 20: Hoare triple {4818#true} assume true; {4818#true} is VALID [2022-04-27 13:00:20,901 INFO L290 TraceCheckUtils]: 19: Hoare triple {4818#true} assume !(0 == ~cond); {4818#true} is VALID [2022-04-27 13:00:20,901 INFO L290 TraceCheckUtils]: 18: Hoare triple {4818#true} ~cond := #in~cond; {4818#true} is VALID [2022-04-27 13:00:20,901 INFO L272 TraceCheckUtils]: 17: Hoare triple {4874#(<= 1 main_~a~0)} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {4818#true} is VALID [2022-04-27 13:00:20,902 INFO L290 TraceCheckUtils]: 16: Hoare triple {4855#(<= 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; {4874#(<= 1 main_~a~0)} is VALID [2022-04-27 13:00:20,902 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {4818#true} {4855#(<= 1 main_~x~0)} #80#return; {4855#(<= 1 main_~x~0)} is VALID [2022-04-27 13:00:20,903 INFO L290 TraceCheckUtils]: 14: Hoare triple {4818#true} assume true; {4818#true} is VALID [2022-04-27 13:00:20,903 INFO L290 TraceCheckUtils]: 13: Hoare triple {4818#true} assume !(0 == ~cond); {4818#true} is VALID [2022-04-27 13:00:20,903 INFO L290 TraceCheckUtils]: 12: Hoare triple {4818#true} ~cond := #in~cond; {4818#true} is VALID [2022-04-27 13:00:20,903 INFO L272 TraceCheckUtils]: 11: Hoare triple {4855#(<= 1 main_~x~0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {4818#true} is VALID [2022-04-27 13:00:20,903 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4848#(not (= |assume_abort_if_not_#in~cond| 0))} {4818#true} #78#return; {4855#(<= 1 main_~x~0)} is VALID [2022-04-27 13:00:20,904 INFO L290 TraceCheckUtils]: 9: Hoare triple {4848#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {4848#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 13:00:20,904 INFO L290 TraceCheckUtils]: 8: Hoare triple {5168#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} assume !(0 == ~cond); {4848#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 13:00:20,904 INFO L290 TraceCheckUtils]: 7: Hoare triple {4818#true} ~cond := #in~cond; {5168#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} is VALID [2022-04-27 13:00:20,905 INFO L272 TraceCheckUtils]: 6: Hoare triple {4818#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {4818#true} is VALID [2022-04-27 13:00:20,905 INFO L290 TraceCheckUtils]: 5: Hoare triple {4818#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {4818#true} is VALID [2022-04-27 13:00:20,905 INFO L272 TraceCheckUtils]: 4: Hoare triple {4818#true} call #t~ret8 := main(); {4818#true} is VALID [2022-04-27 13:00:20,905 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4818#true} {4818#true} #98#return; {4818#true} is VALID [2022-04-27 13:00:20,905 INFO L290 TraceCheckUtils]: 2: Hoare triple {4818#true} assume true; {4818#true} is VALID [2022-04-27 13:00:20,905 INFO L290 TraceCheckUtils]: 1: Hoare triple {4818#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);~counter~0 := 0; {4818#true} is VALID [2022-04-27 13:00:20,905 INFO L272 TraceCheckUtils]: 0: Hoare triple {4818#true} call ULTIMATE.init(); {4818#true} is VALID [2022-04-27 13:00:20,905 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 8 proven. 12 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-04-27 13:00:20,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:00:20,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857664777] [2022-04-27 13:00:20,906 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:00:20,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2058409963] [2022-04-27 13:00:20,906 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2058409963] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 13:00:20,906 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 13:00:20,906 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2022-04-27 13:00:20,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301672230] [2022-04-27 13:00:20,906 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 13:00:20,907 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 8 states have internal predecessors, (28), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) Word has length 61 [2022-04-27 13:00:20,907 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:00:20,907 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 8 states have internal predecessors, (28), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-04-27 13:00:20,949 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:00:20,949 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-27 13:00:20,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:00:20,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-27 13:00:20,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-04-27 13:00:20,950 INFO L87 Difference]: Start difference. First operand 199 states and 237 transitions. Second operand has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 8 states have internal predecessors, (28), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-04-27 13:00:21,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:00:21,814 INFO L93 Difference]: Finished difference Result 283 states and 368 transitions. [2022-04-27 13:00:21,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-27 13:00:21,814 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 8 states have internal predecessors, (28), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) Word has length 61 [2022-04-27 13:00:21,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:00:21,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 8 states have internal predecessors, (28), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-04-27 13:00:21,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 147 transitions. [2022-04-27 13:00:21,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 8 states have internal predecessors, (28), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-04-27 13:00:21,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 147 transitions. [2022-04-27 13:00:21,820 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 147 transitions. [2022-04-27 13:00:21,955 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 147 edges. 147 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:00:21,962 INFO L225 Difference]: With dead ends: 283 [2022-04-27 13:00:21,962 INFO L226 Difference]: Without dead ends: 263 [2022-04-27 13:00:21,963 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 113 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2022-04-27 13:00:21,963 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 64 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 13:00:21,963 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 262 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 13:00:21,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2022-04-27 13:00:22,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 239. [2022-04-27 13:00:22,168 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:00:22,169 INFO L82 GeneralOperation]: Start isEquivalent. First operand 263 states. Second operand has 239 states, 153 states have (on average 1.2222222222222223) internal successors, (187), 156 states have internal predecessors, (187), 60 states have call successors, (60), 26 states have call predecessors, (60), 25 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2022-04-27 13:00:22,169 INFO L74 IsIncluded]: Start isIncluded. First operand 263 states. Second operand has 239 states, 153 states have (on average 1.2222222222222223) internal successors, (187), 156 states have internal predecessors, (187), 60 states have call successors, (60), 26 states have call predecessors, (60), 25 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2022-04-27 13:00:22,169 INFO L87 Difference]: Start difference. First operand 263 states. Second operand has 239 states, 153 states have (on average 1.2222222222222223) internal successors, (187), 156 states have internal predecessors, (187), 60 states have call successors, (60), 26 states have call predecessors, (60), 25 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2022-04-27 13:00:22,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:00:22,178 INFO L93 Difference]: Finished difference Result 263 states and 342 transitions. [2022-04-27 13:00:22,178 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 342 transitions. [2022-04-27 13:00:22,179 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:00:22,179 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:00:22,180 INFO L74 IsIncluded]: Start isIncluded. First operand has 239 states, 153 states have (on average 1.2222222222222223) internal successors, (187), 156 states have internal predecessors, (187), 60 states have call successors, (60), 26 states have call predecessors, (60), 25 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) Second operand 263 states. [2022-04-27 13:00:22,180 INFO L87 Difference]: Start difference. First operand has 239 states, 153 states have (on average 1.2222222222222223) internal successors, (187), 156 states have internal predecessors, (187), 60 states have call successors, (60), 26 states have call predecessors, (60), 25 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) Second operand 263 states. [2022-04-27 13:00:22,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:00:22,188 INFO L93 Difference]: Finished difference Result 263 states and 342 transitions. [2022-04-27 13:00:22,189 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 342 transitions. [2022-04-27 13:00:22,190 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:00:22,190 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:00:22,190 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:00:22,190 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:00:22,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 153 states have (on average 1.2222222222222223) internal successors, (187), 156 states have internal predecessors, (187), 60 states have call successors, (60), 26 states have call predecessors, (60), 25 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2022-04-27 13:00:22,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 303 transitions. [2022-04-27 13:00:22,198 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 303 transitions. Word has length 61 [2022-04-27 13:00:22,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:00:22,198 INFO L495 AbstractCegarLoop]: Abstraction has 239 states and 303 transitions. [2022-04-27 13:00:22,198 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 8 states have internal predecessors, (28), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-04-27 13:00:22,198 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 303 transitions. [2022-04-27 13:00:22,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-04-27 13:00:22,199 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:00:22,199 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:00:22,217 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-04-27 13:00:22,407 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:00:22,408 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:00:22,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:00:22,408 INFO L85 PathProgramCache]: Analyzing trace with hash 428029148, now seen corresponding path program 1 times [2022-04-27 13:00:22,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:00:22,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584680761] [2022-04-27 13:00:22,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:00:22,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:00:22,419 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:00:22,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1002350310] [2022-04-27 13:00:22,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:00:22,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:00:22,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:00:22,421 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:00:22,430 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:00:22,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:00:22,481 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-27 13:00:22,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:00:22,495 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:00:22,742 INFO L272 TraceCheckUtils]: 0: Hoare triple {6497#true} call ULTIMATE.init(); {6497#true} is VALID [2022-04-27 13:00:22,743 INFO L290 TraceCheckUtils]: 1: Hoare triple {6497#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);~counter~0 := 0; {6505#(<= ~counter~0 0)} is VALID [2022-04-27 13:00:22,744 INFO L290 TraceCheckUtils]: 2: Hoare triple {6505#(<= ~counter~0 0)} assume true; {6505#(<= ~counter~0 0)} is VALID [2022-04-27 13:00:22,744 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6505#(<= ~counter~0 0)} {6497#true} #98#return; {6505#(<= ~counter~0 0)} is VALID [2022-04-27 13:00:22,744 INFO L272 TraceCheckUtils]: 4: Hoare triple {6505#(<= ~counter~0 0)} call #t~ret8 := main(); {6505#(<= ~counter~0 0)} is VALID [2022-04-27 13:00:22,745 INFO L290 TraceCheckUtils]: 5: Hoare triple {6505#(<= ~counter~0 0)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {6505#(<= ~counter~0 0)} is VALID [2022-04-27 13:00:22,745 INFO L272 TraceCheckUtils]: 6: Hoare triple {6505#(<= ~counter~0 0)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {6505#(<= ~counter~0 0)} is VALID [2022-04-27 13:00:22,746 INFO L290 TraceCheckUtils]: 7: Hoare triple {6505#(<= ~counter~0 0)} ~cond := #in~cond; {6505#(<= ~counter~0 0)} is VALID [2022-04-27 13:00:22,746 INFO L290 TraceCheckUtils]: 8: Hoare triple {6505#(<= ~counter~0 0)} assume !(0 == ~cond); {6505#(<= ~counter~0 0)} is VALID [2022-04-27 13:00:22,746 INFO L290 TraceCheckUtils]: 9: Hoare triple {6505#(<= ~counter~0 0)} assume true; {6505#(<= ~counter~0 0)} is VALID [2022-04-27 13:00:22,747 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6505#(<= ~counter~0 0)} {6505#(<= ~counter~0 0)} #78#return; {6505#(<= ~counter~0 0)} is VALID [2022-04-27 13:00:22,747 INFO L272 TraceCheckUtils]: 11: Hoare triple {6505#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {6505#(<= ~counter~0 0)} is VALID [2022-04-27 13:00:22,748 INFO L290 TraceCheckUtils]: 12: Hoare triple {6505#(<= ~counter~0 0)} ~cond := #in~cond; {6505#(<= ~counter~0 0)} is VALID [2022-04-27 13:00:22,748 INFO L290 TraceCheckUtils]: 13: Hoare triple {6505#(<= ~counter~0 0)} assume !(0 == ~cond); {6505#(<= ~counter~0 0)} is VALID [2022-04-27 13:00:22,748 INFO L290 TraceCheckUtils]: 14: Hoare triple {6505#(<= ~counter~0 0)} assume true; {6505#(<= ~counter~0 0)} is VALID [2022-04-27 13:00:22,749 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {6505#(<= ~counter~0 0)} {6505#(<= ~counter~0 0)} #80#return; {6505#(<= ~counter~0 0)} is VALID [2022-04-27 13:00:22,749 INFO L290 TraceCheckUtils]: 16: Hoare triple {6505#(<= ~counter~0 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; {6505#(<= ~counter~0 0)} is VALID [2022-04-27 13:00:22,749 INFO L272 TraceCheckUtils]: 17: Hoare triple {6505#(<= ~counter~0 0)} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {6505#(<= ~counter~0 0)} is VALID [2022-04-27 13:00:22,750 INFO L290 TraceCheckUtils]: 18: Hoare triple {6505#(<= ~counter~0 0)} ~cond := #in~cond; {6505#(<= ~counter~0 0)} is VALID [2022-04-27 13:00:22,750 INFO L290 TraceCheckUtils]: 19: Hoare triple {6505#(<= ~counter~0 0)} assume !(0 == ~cond); {6505#(<= ~counter~0 0)} is VALID [2022-04-27 13:00:22,750 INFO L290 TraceCheckUtils]: 20: Hoare triple {6505#(<= ~counter~0 0)} assume true; {6505#(<= ~counter~0 0)} is VALID [2022-04-27 13:00:22,751 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {6505#(<= ~counter~0 0)} {6505#(<= ~counter~0 0)} #82#return; {6505#(<= ~counter~0 0)} is VALID [2022-04-27 13:00:22,752 INFO L272 TraceCheckUtils]: 22: Hoare triple {6505#(<= ~counter~0 0)} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {6505#(<= ~counter~0 0)} is VALID [2022-04-27 13:00:22,752 INFO L290 TraceCheckUtils]: 23: Hoare triple {6505#(<= ~counter~0 0)} ~cond := #in~cond; {6505#(<= ~counter~0 0)} is VALID [2022-04-27 13:00:22,752 INFO L290 TraceCheckUtils]: 24: Hoare triple {6505#(<= ~counter~0 0)} assume !(0 == ~cond); {6505#(<= ~counter~0 0)} is VALID [2022-04-27 13:00:22,753 INFO L290 TraceCheckUtils]: 25: Hoare triple {6505#(<= ~counter~0 0)} assume true; {6505#(<= ~counter~0 0)} is VALID [2022-04-27 13:00:22,753 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {6505#(<= ~counter~0 0)} {6505#(<= ~counter~0 0)} #84#return; {6505#(<= ~counter~0 0)} is VALID [2022-04-27 13:00:22,754 INFO L290 TraceCheckUtils]: 27: Hoare triple {6505#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6584#(<= ~counter~0 1)} is VALID [2022-04-27 13:00:22,754 INFO L290 TraceCheckUtils]: 28: Hoare triple {6584#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {6584#(<= ~counter~0 1)} is VALID [2022-04-27 13:00:22,755 INFO L290 TraceCheckUtils]: 29: Hoare triple {6584#(<= ~counter~0 1)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {6584#(<= ~counter~0 1)} is VALID [2022-04-27 13:00:22,755 INFO L290 TraceCheckUtils]: 30: Hoare triple {6584#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {6594#(<= ~counter~0 2)} is VALID [2022-04-27 13:00:22,755 INFO L290 TraceCheckUtils]: 31: Hoare triple {6594#(<= ~counter~0 2)} assume !!(#t~post7 < 50);havoc #t~post7; {6594#(<= ~counter~0 2)} is VALID [2022-04-27 13:00:22,756 INFO L272 TraceCheckUtils]: 32: Hoare triple {6594#(<= ~counter~0 2)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {6594#(<= ~counter~0 2)} is VALID [2022-04-27 13:00:22,756 INFO L290 TraceCheckUtils]: 33: Hoare triple {6594#(<= ~counter~0 2)} ~cond := #in~cond; {6594#(<= ~counter~0 2)} is VALID [2022-04-27 13:00:22,757 INFO L290 TraceCheckUtils]: 34: Hoare triple {6594#(<= ~counter~0 2)} assume !(0 == ~cond); {6594#(<= ~counter~0 2)} is VALID [2022-04-27 13:00:22,757 INFO L290 TraceCheckUtils]: 35: Hoare triple {6594#(<= ~counter~0 2)} assume true; {6594#(<= ~counter~0 2)} is VALID [2022-04-27 13:00:22,758 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {6594#(<= ~counter~0 2)} {6594#(<= ~counter~0 2)} #86#return; {6594#(<= ~counter~0 2)} is VALID [2022-04-27 13:00:22,759 INFO L272 TraceCheckUtils]: 37: Hoare triple {6594#(<= ~counter~0 2)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {6594#(<= ~counter~0 2)} is VALID [2022-04-27 13:00:22,759 INFO L290 TraceCheckUtils]: 38: Hoare triple {6594#(<= ~counter~0 2)} ~cond := #in~cond; {6594#(<= ~counter~0 2)} is VALID [2022-04-27 13:00:22,759 INFO L290 TraceCheckUtils]: 39: Hoare triple {6594#(<= ~counter~0 2)} assume !(0 == ~cond); {6594#(<= ~counter~0 2)} is VALID [2022-04-27 13:00:22,760 INFO L290 TraceCheckUtils]: 40: Hoare triple {6594#(<= ~counter~0 2)} assume true; {6594#(<= ~counter~0 2)} is VALID [2022-04-27 13:00:22,760 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {6594#(<= ~counter~0 2)} {6594#(<= ~counter~0 2)} #88#return; {6594#(<= ~counter~0 2)} is VALID [2022-04-27 13:00:22,761 INFO L272 TraceCheckUtils]: 42: Hoare triple {6594#(<= ~counter~0 2)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {6594#(<= ~counter~0 2)} is VALID [2022-04-27 13:00:22,762 INFO L290 TraceCheckUtils]: 43: Hoare triple {6594#(<= ~counter~0 2)} ~cond := #in~cond; {6594#(<= ~counter~0 2)} is VALID [2022-04-27 13:00:22,762 INFO L290 TraceCheckUtils]: 44: Hoare triple {6594#(<= ~counter~0 2)} assume !(0 == ~cond); {6594#(<= ~counter~0 2)} is VALID [2022-04-27 13:00:22,762 INFO L290 TraceCheckUtils]: 45: Hoare triple {6594#(<= ~counter~0 2)} assume true; {6594#(<= ~counter~0 2)} is VALID [2022-04-27 13:00:22,763 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {6594#(<= ~counter~0 2)} {6594#(<= ~counter~0 2)} #90#return; {6594#(<= ~counter~0 2)} is VALID [2022-04-27 13:00:22,764 INFO L272 TraceCheckUtils]: 47: Hoare triple {6594#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {6594#(<= ~counter~0 2)} is VALID [2022-04-27 13:00:22,764 INFO L290 TraceCheckUtils]: 48: Hoare triple {6594#(<= ~counter~0 2)} ~cond := #in~cond; {6594#(<= ~counter~0 2)} is VALID [2022-04-27 13:00:22,765 INFO L290 TraceCheckUtils]: 49: Hoare triple {6594#(<= ~counter~0 2)} assume !(0 == ~cond); {6594#(<= ~counter~0 2)} is VALID [2022-04-27 13:00:22,765 INFO L290 TraceCheckUtils]: 50: Hoare triple {6594#(<= ~counter~0 2)} assume true; {6594#(<= ~counter~0 2)} is VALID [2022-04-27 13:00:22,766 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {6594#(<= ~counter~0 2)} {6594#(<= ~counter~0 2)} #92#return; {6594#(<= ~counter~0 2)} is VALID [2022-04-27 13:00:22,766 INFO L290 TraceCheckUtils]: 52: Hoare triple {6594#(<= ~counter~0 2)} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {6594#(<= ~counter~0 2)} is VALID [2022-04-27 13:00:22,767 INFO L290 TraceCheckUtils]: 53: Hoare triple {6594#(<= ~counter~0 2)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {6664#(<= |main_#t~post7| 2)} is VALID [2022-04-27 13:00:22,767 INFO L290 TraceCheckUtils]: 54: Hoare triple {6664#(<= |main_#t~post7| 2)} assume !(#t~post7 < 50);havoc #t~post7; {6498#false} is VALID [2022-04-27 13:00:22,767 INFO L290 TraceCheckUtils]: 55: Hoare triple {6498#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; {6498#false} is VALID [2022-04-27 13:00:22,767 INFO L290 TraceCheckUtils]: 56: Hoare triple {6498#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6498#false} is VALID [2022-04-27 13:00:22,768 INFO L290 TraceCheckUtils]: 57: Hoare triple {6498#false} assume !!(#t~post6 < 50);havoc #t~post6; {6498#false} is VALID [2022-04-27 13:00:22,768 INFO L290 TraceCheckUtils]: 58: Hoare triple {6498#false} assume !(0 != ~b~0); {6498#false} is VALID [2022-04-27 13:00:22,768 INFO L272 TraceCheckUtils]: 59: Hoare triple {6498#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {6498#false} is VALID [2022-04-27 13:00:22,768 INFO L290 TraceCheckUtils]: 60: Hoare triple {6498#false} ~cond := #in~cond; {6498#false} is VALID [2022-04-27 13:00:22,768 INFO L290 TraceCheckUtils]: 61: Hoare triple {6498#false} assume 0 == ~cond; {6498#false} is VALID [2022-04-27 13:00:22,768 INFO L290 TraceCheckUtils]: 62: Hoare triple {6498#false} assume !false; {6498#false} is VALID [2022-04-27 13:00:22,768 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-04-27 13:00:22,768 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:00:23,091 INFO L290 TraceCheckUtils]: 62: Hoare triple {6498#false} assume !false; {6498#false} is VALID [2022-04-27 13:00:23,091 INFO L290 TraceCheckUtils]: 61: Hoare triple {6498#false} assume 0 == ~cond; {6498#false} is VALID [2022-04-27 13:00:23,091 INFO L290 TraceCheckUtils]: 60: Hoare triple {6498#false} ~cond := #in~cond; {6498#false} is VALID [2022-04-27 13:00:23,092 INFO L272 TraceCheckUtils]: 59: Hoare triple {6498#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {6498#false} is VALID [2022-04-27 13:00:23,092 INFO L290 TraceCheckUtils]: 58: Hoare triple {6498#false} assume !(0 != ~b~0); {6498#false} is VALID [2022-04-27 13:00:23,092 INFO L290 TraceCheckUtils]: 57: Hoare triple {6498#false} assume !!(#t~post6 < 50);havoc #t~post6; {6498#false} is VALID [2022-04-27 13:00:23,092 INFO L290 TraceCheckUtils]: 56: Hoare triple {6498#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6498#false} is VALID [2022-04-27 13:00:23,092 INFO L290 TraceCheckUtils]: 55: Hoare triple {6498#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; {6498#false} is VALID [2022-04-27 13:00:23,092 INFO L290 TraceCheckUtils]: 54: Hoare triple {6716#(< |main_#t~post7| 50)} assume !(#t~post7 < 50);havoc #t~post7; {6498#false} is VALID [2022-04-27 13:00:23,093 INFO L290 TraceCheckUtils]: 53: Hoare triple {6720#(< ~counter~0 50)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {6716#(< |main_#t~post7| 50)} is VALID [2022-04-27 13:00:23,093 INFO L290 TraceCheckUtils]: 52: Hoare triple {6720#(< ~counter~0 50)} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {6720#(< ~counter~0 50)} is VALID [2022-04-27 13:00:23,094 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {6497#true} {6720#(< ~counter~0 50)} #92#return; {6720#(< ~counter~0 50)} is VALID [2022-04-27 13:00:23,094 INFO L290 TraceCheckUtils]: 50: Hoare triple {6497#true} assume true; {6497#true} is VALID [2022-04-27 13:00:23,094 INFO L290 TraceCheckUtils]: 49: Hoare triple {6497#true} assume !(0 == ~cond); {6497#true} is VALID [2022-04-27 13:00:23,094 INFO L290 TraceCheckUtils]: 48: Hoare triple {6497#true} ~cond := #in~cond; {6497#true} is VALID [2022-04-27 13:00:23,094 INFO L272 TraceCheckUtils]: 47: Hoare triple {6720#(< ~counter~0 50)} 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)); {6497#true} is VALID [2022-04-27 13:00:23,095 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {6497#true} {6720#(< ~counter~0 50)} #90#return; {6720#(< ~counter~0 50)} is VALID [2022-04-27 13:00:23,095 INFO L290 TraceCheckUtils]: 45: Hoare triple {6497#true} assume true; {6497#true} is VALID [2022-04-27 13:00:23,095 INFO L290 TraceCheckUtils]: 44: Hoare triple {6497#true} assume !(0 == ~cond); {6497#true} is VALID [2022-04-27 13:00:23,095 INFO L290 TraceCheckUtils]: 43: Hoare triple {6497#true} ~cond := #in~cond; {6497#true} is VALID [2022-04-27 13:00:23,095 INFO L272 TraceCheckUtils]: 42: Hoare triple {6720#(< ~counter~0 50)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {6497#true} is VALID [2022-04-27 13:00:23,096 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {6497#true} {6720#(< ~counter~0 50)} #88#return; {6720#(< ~counter~0 50)} is VALID [2022-04-27 13:00:23,096 INFO L290 TraceCheckUtils]: 40: Hoare triple {6497#true} assume true; {6497#true} is VALID [2022-04-27 13:00:23,096 INFO L290 TraceCheckUtils]: 39: Hoare triple {6497#true} assume !(0 == ~cond); {6497#true} is VALID [2022-04-27 13:00:23,096 INFO L290 TraceCheckUtils]: 38: Hoare triple {6497#true} ~cond := #in~cond; {6497#true} is VALID [2022-04-27 13:00:23,096 INFO L272 TraceCheckUtils]: 37: Hoare triple {6720#(< ~counter~0 50)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {6497#true} is VALID [2022-04-27 13:00:23,097 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {6497#true} {6720#(< ~counter~0 50)} #86#return; {6720#(< ~counter~0 50)} is VALID [2022-04-27 13:00:23,097 INFO L290 TraceCheckUtils]: 35: Hoare triple {6497#true} assume true; {6497#true} is VALID [2022-04-27 13:00:23,097 INFO L290 TraceCheckUtils]: 34: Hoare triple {6497#true} assume !(0 == ~cond); {6497#true} is VALID [2022-04-27 13:00:23,097 INFO L290 TraceCheckUtils]: 33: Hoare triple {6497#true} ~cond := #in~cond; {6497#true} is VALID [2022-04-27 13:00:23,097 INFO L272 TraceCheckUtils]: 32: Hoare triple {6720#(< ~counter~0 50)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {6497#true} is VALID [2022-04-27 13:00:23,097 INFO L290 TraceCheckUtils]: 31: Hoare triple {6720#(< ~counter~0 50)} assume !!(#t~post7 < 50);havoc #t~post7; {6720#(< ~counter~0 50)} is VALID [2022-04-27 13:00:23,098 INFO L290 TraceCheckUtils]: 30: Hoare triple {6790#(< ~counter~0 49)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {6720#(< ~counter~0 50)} is VALID [2022-04-27 13:00:23,098 INFO L290 TraceCheckUtils]: 29: Hoare triple {6790#(< ~counter~0 49)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {6790#(< ~counter~0 49)} is VALID [2022-04-27 13:00:23,098 INFO L290 TraceCheckUtils]: 28: Hoare triple {6790#(< ~counter~0 49)} assume !!(#t~post6 < 50);havoc #t~post6; {6790#(< ~counter~0 49)} is VALID [2022-04-27 13:00:23,099 INFO L290 TraceCheckUtils]: 27: Hoare triple {6800#(< ~counter~0 48)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6790#(< ~counter~0 49)} is VALID [2022-04-27 13:00:23,099 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {6497#true} {6800#(< ~counter~0 48)} #84#return; {6800#(< ~counter~0 48)} is VALID [2022-04-27 13:00:23,099 INFO L290 TraceCheckUtils]: 25: Hoare triple {6497#true} assume true; {6497#true} is VALID [2022-04-27 13:00:23,099 INFO L290 TraceCheckUtils]: 24: Hoare triple {6497#true} assume !(0 == ~cond); {6497#true} is VALID [2022-04-27 13:00:23,099 INFO L290 TraceCheckUtils]: 23: Hoare triple {6497#true} ~cond := #in~cond; {6497#true} is VALID [2022-04-27 13:00:23,100 INFO L272 TraceCheckUtils]: 22: Hoare triple {6800#(< ~counter~0 48)} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {6497#true} is VALID [2022-04-27 13:00:23,100 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {6497#true} {6800#(< ~counter~0 48)} #82#return; {6800#(< ~counter~0 48)} is VALID [2022-04-27 13:00:23,100 INFO L290 TraceCheckUtils]: 20: Hoare triple {6497#true} assume true; {6497#true} is VALID [2022-04-27 13:00:23,100 INFO L290 TraceCheckUtils]: 19: Hoare triple {6497#true} assume !(0 == ~cond); {6497#true} is VALID [2022-04-27 13:00:23,100 INFO L290 TraceCheckUtils]: 18: Hoare triple {6497#true} ~cond := #in~cond; {6497#true} is VALID [2022-04-27 13:00:23,100 INFO L272 TraceCheckUtils]: 17: Hoare triple {6800#(< ~counter~0 48)} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {6497#true} is VALID [2022-04-27 13:00:23,100 INFO L290 TraceCheckUtils]: 16: Hoare triple {6800#(< ~counter~0 48)} ~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; {6800#(< ~counter~0 48)} is VALID [2022-04-27 13:00:23,101 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {6497#true} {6800#(< ~counter~0 48)} #80#return; {6800#(< ~counter~0 48)} is VALID [2022-04-27 13:00:23,101 INFO L290 TraceCheckUtils]: 14: Hoare triple {6497#true} assume true; {6497#true} is VALID [2022-04-27 13:00:23,101 INFO L290 TraceCheckUtils]: 13: Hoare triple {6497#true} assume !(0 == ~cond); {6497#true} is VALID [2022-04-27 13:00:23,101 INFO L290 TraceCheckUtils]: 12: Hoare triple {6497#true} ~cond := #in~cond; {6497#true} is VALID [2022-04-27 13:00:23,101 INFO L272 TraceCheckUtils]: 11: Hoare triple {6800#(< ~counter~0 48)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {6497#true} is VALID [2022-04-27 13:00:23,103 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6497#true} {6800#(< ~counter~0 48)} #78#return; {6800#(< ~counter~0 48)} is VALID [2022-04-27 13:00:23,103 INFO L290 TraceCheckUtils]: 9: Hoare triple {6497#true} assume true; {6497#true} is VALID [2022-04-27 13:00:23,103 INFO L290 TraceCheckUtils]: 8: Hoare triple {6497#true} assume !(0 == ~cond); {6497#true} is VALID [2022-04-27 13:00:23,103 INFO L290 TraceCheckUtils]: 7: Hoare triple {6497#true} ~cond := #in~cond; {6497#true} is VALID [2022-04-27 13:00:23,104 INFO L272 TraceCheckUtils]: 6: Hoare triple {6800#(< ~counter~0 48)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {6497#true} is VALID [2022-04-27 13:00:23,104 INFO L290 TraceCheckUtils]: 5: Hoare triple {6800#(< ~counter~0 48)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {6800#(< ~counter~0 48)} is VALID [2022-04-27 13:00:23,104 INFO L272 TraceCheckUtils]: 4: Hoare triple {6800#(< ~counter~0 48)} call #t~ret8 := main(); {6800#(< ~counter~0 48)} is VALID [2022-04-27 13:00:23,105 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6800#(< ~counter~0 48)} {6497#true} #98#return; {6800#(< ~counter~0 48)} is VALID [2022-04-27 13:00:23,105 INFO L290 TraceCheckUtils]: 2: Hoare triple {6800#(< ~counter~0 48)} assume true; {6800#(< ~counter~0 48)} is VALID [2022-04-27 13:00:23,106 INFO L290 TraceCheckUtils]: 1: Hoare triple {6497#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);~counter~0 := 0; {6800#(< ~counter~0 48)} is VALID [2022-04-27 13:00:23,106 INFO L272 TraceCheckUtils]: 0: Hoare triple {6497#true} call ULTIMATE.init(); {6497#true} is VALID [2022-04-27 13:00:23,106 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-04-27 13:00:23,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:00:23,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584680761] [2022-04-27 13:00:23,106 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:00:23,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1002350310] [2022-04-27 13:00:23,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1002350310] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 13:00:23,106 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 13:00:23,106 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-04-27 13:00:23,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114201351] [2022-04-27 13:00:23,107 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 13:00:23,107 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 6 states have call successors, (20), 5 states have call predecessors, (20), 4 states have return successors, (18), 4 states have call predecessors, (18), 5 states have call successors, (18) Word has length 63 [2022-04-27 13:00:23,107 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:00:23,108 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 6 states have call successors, (20), 5 states have call predecessors, (20), 4 states have return successors, (18), 4 states have call predecessors, (18), 5 states have call successors, (18) [2022-04-27 13:00:23,166 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:00:23,167 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-27 13:00:23,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:00:23,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-27 13:00:23,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-27 13:00:23,168 INFO L87 Difference]: Start difference. First operand 239 states and 303 transitions. Second operand has 10 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 6 states have call successors, (20), 5 states have call predecessors, (20), 4 states have return successors, (18), 4 states have call predecessors, (18), 5 states have call successors, (18) [2022-04-27 13:00:23,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:00:23,824 INFO L93 Difference]: Finished difference Result 348 states and 452 transitions. [2022-04-27 13:00:23,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-27 13:00:23,825 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 6 states have call successors, (20), 5 states have call predecessors, (20), 4 states have return successors, (18), 4 states have call predecessors, (18), 5 states have call successors, (18) Word has length 63 [2022-04-27 13:00:23,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:00:23,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 6 states have call successors, (20), 5 states have call predecessors, (20), 4 states have return successors, (18), 4 states have call predecessors, (18), 5 states have call successors, (18) [2022-04-27 13:00:23,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 167 transitions. [2022-04-27 13:00:23,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 6 states have call successors, (20), 5 states have call predecessors, (20), 4 states have return successors, (18), 4 states have call predecessors, (18), 5 states have call successors, (18) [2022-04-27 13:00:23,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 167 transitions. [2022-04-27 13:00:23,830 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 167 transitions. [2022-04-27 13:00:23,977 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 167 edges. 167 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:00:23,983 INFO L225 Difference]: With dead ends: 348 [2022-04-27 13:00:23,984 INFO L226 Difference]: Without dead ends: 252 [2022-04-27 13:00:23,986 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2022-04-27 13:00:23,987 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 85 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 13:00:23,987 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 266 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 13:00:23,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2022-04-27 13:00:24,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 248. [2022-04-27 13:00:24,203 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:00:24,204 INFO L82 GeneralOperation]: Start isEquivalent. First operand 252 states. Second operand has 248 states, 162 states have (on average 1.1728395061728396) internal successors, (190), 165 states have internal predecessors, (190), 60 states have call successors, (60), 26 states have call predecessors, (60), 25 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2022-04-27 13:00:24,204 INFO L74 IsIncluded]: Start isIncluded. First operand 252 states. Second operand has 248 states, 162 states have (on average 1.1728395061728396) internal successors, (190), 165 states have internal predecessors, (190), 60 states have call successors, (60), 26 states have call predecessors, (60), 25 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2022-04-27 13:00:24,205 INFO L87 Difference]: Start difference. First operand 252 states. Second operand has 248 states, 162 states have (on average 1.1728395061728396) internal successors, (190), 165 states have internal predecessors, (190), 60 states have call successors, (60), 26 states have call predecessors, (60), 25 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2022-04-27 13:00:24,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:00:24,212 INFO L93 Difference]: Finished difference Result 252 states and 308 transitions. [2022-04-27 13:00:24,212 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 308 transitions. [2022-04-27 13:00:24,213 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:00:24,213 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:00:24,213 INFO L74 IsIncluded]: Start isIncluded. First operand has 248 states, 162 states have (on average 1.1728395061728396) internal successors, (190), 165 states have internal predecessors, (190), 60 states have call successors, (60), 26 states have call predecessors, (60), 25 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) Second operand 252 states. [2022-04-27 13:00:24,214 INFO L87 Difference]: Start difference. First operand has 248 states, 162 states have (on average 1.1728395061728396) internal successors, (190), 165 states have internal predecessors, (190), 60 states have call successors, (60), 26 states have call predecessors, (60), 25 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) Second operand 252 states. [2022-04-27 13:00:24,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:00:24,221 INFO L93 Difference]: Finished difference Result 252 states and 308 transitions. [2022-04-27 13:00:24,222 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 308 transitions. [2022-04-27 13:00:24,222 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:00:24,222 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:00:24,222 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:00:24,223 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:00:24,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 162 states have (on average 1.1728395061728396) internal successors, (190), 165 states have internal predecessors, (190), 60 states have call successors, (60), 26 states have call predecessors, (60), 25 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2022-04-27 13:00:24,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 306 transitions. [2022-04-27 13:00:24,230 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 306 transitions. Word has length 63 [2022-04-27 13:00:24,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:00:24,230 INFO L495 AbstractCegarLoop]: Abstraction has 248 states and 306 transitions. [2022-04-27 13:00:24,230 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 6 states have call successors, (20), 5 states have call predecessors, (20), 4 states have return successors, (18), 4 states have call predecessors, (18), 5 states have call successors, (18) [2022-04-27 13:00:24,231 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 306 transitions. [2022-04-27 13:00:24,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-04-27 13:00:24,231 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:00:24,231 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:00:24,257 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:00:24,456 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:00:24,457 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:00:24,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:00:24,457 INFO L85 PathProgramCache]: Analyzing trace with hash 792554045, now seen corresponding path program 1 times [2022-04-27 13:00:24,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:00:24,457 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442902255] [2022-04-27 13:00:24,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:00:24,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:00:24,490 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:00:24,491 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1016137303] [2022-04-27 13:00:24,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:00:24,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:00:24,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:00:24,492 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:00:24,524 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:00:24,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:00:24,555 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 32 conjunts are in the unsatisfiable core [2022-04-27 13:00:24,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:00:24,574 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:00:25,490 INFO L272 TraceCheckUtils]: 0: Hoare triple {8263#true} call ULTIMATE.init(); {8263#true} is VALID [2022-04-27 13:00:25,490 INFO L290 TraceCheckUtils]: 1: Hoare triple {8263#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);~counter~0 := 0; {8263#true} is VALID [2022-04-27 13:00:25,491 INFO L290 TraceCheckUtils]: 2: Hoare triple {8263#true} assume true; {8263#true} is VALID [2022-04-27 13:00:25,491 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8263#true} {8263#true} #98#return; {8263#true} is VALID [2022-04-27 13:00:25,491 INFO L272 TraceCheckUtils]: 4: Hoare triple {8263#true} call #t~ret8 := main(); {8263#true} is VALID [2022-04-27 13:00:25,491 INFO L290 TraceCheckUtils]: 5: Hoare triple {8263#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {8263#true} is VALID [2022-04-27 13:00:25,491 INFO L272 TraceCheckUtils]: 6: Hoare triple {8263#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {8263#true} is VALID [2022-04-27 13:00:25,491 INFO L290 TraceCheckUtils]: 7: Hoare triple {8263#true} ~cond := #in~cond; {8263#true} is VALID [2022-04-27 13:00:25,491 INFO L290 TraceCheckUtils]: 8: Hoare triple {8263#true} assume !(0 == ~cond); {8263#true} is VALID [2022-04-27 13:00:25,491 INFO L290 TraceCheckUtils]: 9: Hoare triple {8263#true} assume true; {8263#true} is VALID [2022-04-27 13:00:25,491 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8263#true} {8263#true} #78#return; {8263#true} is VALID [2022-04-27 13:00:25,491 INFO L272 TraceCheckUtils]: 11: Hoare triple {8263#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {8263#true} is VALID [2022-04-27 13:00:25,491 INFO L290 TraceCheckUtils]: 12: Hoare triple {8263#true} ~cond := #in~cond; {8263#true} is VALID [2022-04-27 13:00:25,492 INFO L290 TraceCheckUtils]: 13: Hoare triple {8263#true} assume !(0 == ~cond); {8263#true} is VALID [2022-04-27 13:00:25,492 INFO L290 TraceCheckUtils]: 14: Hoare triple {8263#true} assume true; {8263#true} is VALID [2022-04-27 13:00:25,492 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {8263#true} {8263#true} #80#return; {8263#true} is VALID [2022-04-27 13:00:25,492 INFO L290 TraceCheckUtils]: 16: Hoare triple {8263#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; {8316#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0))} is VALID [2022-04-27 13:00:25,492 INFO L272 TraceCheckUtils]: 17: Hoare triple {8316#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0))} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {8263#true} is VALID [2022-04-27 13:00:25,492 INFO L290 TraceCheckUtils]: 18: Hoare triple {8263#true} ~cond := #in~cond; {8263#true} is VALID [2022-04-27 13:00:25,493 INFO L290 TraceCheckUtils]: 19: Hoare triple {8263#true} assume !(0 == ~cond); {8263#true} is VALID [2022-04-27 13:00:25,493 INFO L290 TraceCheckUtils]: 20: Hoare triple {8263#true} assume true; {8263#true} is VALID [2022-04-27 13:00:25,493 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {8263#true} {8316#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0))} #82#return; {8316#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0))} is VALID [2022-04-27 13:00:25,493 INFO L272 TraceCheckUtils]: 22: Hoare triple {8316#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0))} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {8263#true} is VALID [2022-04-27 13:00:25,493 INFO L290 TraceCheckUtils]: 23: Hoare triple {8263#true} ~cond := #in~cond; {8263#true} is VALID [2022-04-27 13:00:25,494 INFO L290 TraceCheckUtils]: 24: Hoare triple {8263#true} assume !(0 == ~cond); {8263#true} is VALID [2022-04-27 13:00:25,494 INFO L290 TraceCheckUtils]: 25: Hoare triple {8263#true} assume true; {8263#true} is VALID [2022-04-27 13:00:25,494 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {8263#true} {8316#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0))} #84#return; {8316#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0))} is VALID [2022-04-27 13:00:25,495 INFO L290 TraceCheckUtils]: 27: Hoare triple {8316#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8316#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0))} is VALID [2022-04-27 13:00:25,495 INFO L290 TraceCheckUtils]: 28: Hoare triple {8316#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0))} assume !!(#t~post6 < 50);havoc #t~post6; {8316#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0))} is VALID [2022-04-27 13:00:25,496 INFO L290 TraceCheckUtils]: 29: Hoare triple {8316#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {8356#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0))} is VALID [2022-04-27 13:00:25,496 INFO L290 TraceCheckUtils]: 30: Hoare triple {8356#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {8356#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0))} is VALID [2022-04-27 13:00:25,497 INFO L290 TraceCheckUtils]: 31: Hoare triple {8356#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0))} assume !!(#t~post7 < 50);havoc #t~post7; {8356#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0))} is VALID [2022-04-27 13:00:25,497 INFO L272 TraceCheckUtils]: 32: Hoare triple {8356#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {8263#true} is VALID [2022-04-27 13:00:25,497 INFO L290 TraceCheckUtils]: 33: Hoare triple {8263#true} ~cond := #in~cond; {8263#true} is VALID [2022-04-27 13:00:25,497 INFO L290 TraceCheckUtils]: 34: Hoare triple {8263#true} assume !(0 == ~cond); {8263#true} is VALID [2022-04-27 13:00:25,497 INFO L290 TraceCheckUtils]: 35: Hoare triple {8263#true} assume true; {8263#true} is VALID [2022-04-27 13:00:25,498 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {8263#true} {8356#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0))} #86#return; {8356#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0))} is VALID [2022-04-27 13:00:25,498 INFO L272 TraceCheckUtils]: 37: Hoare triple {8356#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {8263#true} is VALID [2022-04-27 13:00:25,498 INFO L290 TraceCheckUtils]: 38: Hoare triple {8263#true} ~cond := #in~cond; {8263#true} is VALID [2022-04-27 13:00:25,498 INFO L290 TraceCheckUtils]: 39: Hoare triple {8263#true} assume !(0 == ~cond); {8263#true} is VALID [2022-04-27 13:00:25,498 INFO L290 TraceCheckUtils]: 40: Hoare triple {8263#true} assume true; {8263#true} is VALID [2022-04-27 13:00:25,499 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {8263#true} {8356#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0))} #88#return; {8356#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0))} is VALID [2022-04-27 13:00:25,499 INFO L272 TraceCheckUtils]: 42: Hoare triple {8356#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {8263#true} is VALID [2022-04-27 13:00:25,499 INFO L290 TraceCheckUtils]: 43: Hoare triple {8263#true} ~cond := #in~cond; {8399#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:00:25,500 INFO L290 TraceCheckUtils]: 44: Hoare triple {8399#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {8403#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:00:25,500 INFO L290 TraceCheckUtils]: 45: Hoare triple {8403#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {8403#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:00:25,500 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {8403#(not (= |__VERIFIER_assert_#in~cond| 0))} {8356#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0))} #90#return; {8356#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0))} is VALID [2022-04-27 13:00:25,501 INFO L272 TraceCheckUtils]: 47: Hoare triple {8356#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {8263#true} is VALID [2022-04-27 13:00:25,501 INFO L290 TraceCheckUtils]: 48: Hoare triple {8263#true} ~cond := #in~cond; {8263#true} is VALID [2022-04-27 13:00:25,501 INFO L290 TraceCheckUtils]: 49: Hoare triple {8263#true} assume !(0 == ~cond); {8263#true} is VALID [2022-04-27 13:00:25,501 INFO L290 TraceCheckUtils]: 50: Hoare triple {8263#true} assume true; {8263#true} is VALID [2022-04-27 13:00:25,501 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {8263#true} {8356#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0))} #92#return; {8356#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0))} is VALID [2022-04-27 13:00:25,502 INFO L290 TraceCheckUtils]: 52: Hoare triple {8356#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0))} assume !(~c~0 >= ~b~0); {8356#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0))} is VALID [2022-04-27 13:00:25,502 INFO L290 TraceCheckUtils]: 53: Hoare triple {8356#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {8431#(and (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} is VALID [2022-04-27 13:00:25,503 INFO L290 TraceCheckUtils]: 54: Hoare triple {8431#(and (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8431#(and (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} is VALID [2022-04-27 13:00:25,504 INFO L290 TraceCheckUtils]: 55: Hoare triple {8431#(and (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} assume !!(#t~post6 < 50);havoc #t~post6; {8431#(and (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} is VALID [2022-04-27 13:00:25,504 INFO L290 TraceCheckUtils]: 56: Hoare triple {8431#(and (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {8431#(and (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} is VALID [2022-04-27 13:00:25,506 INFO L290 TraceCheckUtils]: 57: Hoare triple {8431#(and (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {8431#(and (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} is VALID [2022-04-27 13:00:25,506 INFO L290 TraceCheckUtils]: 58: Hoare triple {8431#(and (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} assume !!(#t~post7 < 50);havoc #t~post7; {8431#(and (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} is VALID [2022-04-27 13:00:25,508 INFO L272 TraceCheckUtils]: 59: Hoare triple {8431#(and (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {8263#true} is VALID [2022-04-27 13:00:25,509 INFO L290 TraceCheckUtils]: 60: Hoare triple {8263#true} ~cond := #in~cond; {8263#true} is VALID [2022-04-27 13:00:25,509 INFO L290 TraceCheckUtils]: 61: Hoare triple {8263#true} assume !(0 == ~cond); {8263#true} is VALID [2022-04-27 13:00:25,509 INFO L290 TraceCheckUtils]: 62: Hoare triple {8263#true} assume true; {8263#true} is VALID [2022-04-27 13:00:25,509 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {8263#true} {8431#(and (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} #86#return; {8431#(and (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} is VALID [2022-04-27 13:00:25,510 INFO L272 TraceCheckUtils]: 64: Hoare triple {8431#(and (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {8465#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:00:25,510 INFO L290 TraceCheckUtils]: 65: Hoare triple {8465#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8469#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:00:25,511 INFO L290 TraceCheckUtils]: 66: Hoare triple {8469#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8264#false} is VALID [2022-04-27 13:00:25,511 INFO L290 TraceCheckUtils]: 67: Hoare triple {8264#false} assume !false; {8264#false} is VALID [2022-04-27 13:00:25,511 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 15 proven. 14 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2022-04-27 13:00:25,511 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:00:39,578 INFO L290 TraceCheckUtils]: 67: Hoare triple {8264#false} assume !false; {8264#false} is VALID [2022-04-27 13:00:39,579 INFO L290 TraceCheckUtils]: 66: Hoare triple {8469#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8264#false} is VALID [2022-04-27 13:00:39,579 INFO L290 TraceCheckUtils]: 65: Hoare triple {8465#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8469#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:00:39,580 INFO L272 TraceCheckUtils]: 64: Hoare triple {8485#(= 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)); {8465#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:00:39,581 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {8263#true} {8485#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #86#return; {8485#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 13:00:39,581 INFO L290 TraceCheckUtils]: 62: Hoare triple {8263#true} assume true; {8263#true} is VALID [2022-04-27 13:00:39,581 INFO L290 TraceCheckUtils]: 61: Hoare triple {8263#true} assume !(0 == ~cond); {8263#true} is VALID [2022-04-27 13:00:39,581 INFO L290 TraceCheckUtils]: 60: Hoare triple {8263#true} ~cond := #in~cond; {8263#true} is VALID [2022-04-27 13:00:39,581 INFO L272 TraceCheckUtils]: 59: Hoare triple {8485#(= 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)); {8263#true} is VALID [2022-04-27 13:00:39,581 INFO L290 TraceCheckUtils]: 58: Hoare triple {8485#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !!(#t~post7 < 50);havoc #t~post7; {8485#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 13:00:39,581 INFO L290 TraceCheckUtils]: 57: Hoare triple {8485#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {8485#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 13:00:39,582 INFO L290 TraceCheckUtils]: 56: Hoare triple {8485#(= 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; {8485#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 13:00:39,582 INFO L290 TraceCheckUtils]: 55: Hoare triple {8485#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !!(#t~post6 < 50);havoc #t~post6; {8485#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 13:00:39,582 INFO L290 TraceCheckUtils]: 54: Hoare triple {8485#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8485#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 13:00:39,583 INFO L290 TraceCheckUtils]: 53: Hoare triple {8519#(= 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; {8485#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 13:00:39,583 INFO L290 TraceCheckUtils]: 52: Hoare triple {8519#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !(~c~0 >= ~b~0); {8519#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 13:00:39,584 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {8263#true} {8519#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #92#return; {8519#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 13:00:39,584 INFO L290 TraceCheckUtils]: 50: Hoare triple {8263#true} assume true; {8263#true} is VALID [2022-04-27 13:00:39,584 INFO L290 TraceCheckUtils]: 49: Hoare triple {8263#true} assume !(0 == ~cond); {8263#true} is VALID [2022-04-27 13:00:39,584 INFO L290 TraceCheckUtils]: 48: Hoare triple {8263#true} ~cond := #in~cond; {8263#true} is VALID [2022-04-27 13:00:39,584 INFO L272 TraceCheckUtils]: 47: Hoare triple {8519#(= 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)); {8263#true} is VALID [2022-04-27 13:00:39,585 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {8403#(not (= |__VERIFIER_assert_#in~cond| 0))} {8263#true} #90#return; {8519#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 13:00:39,585 INFO L290 TraceCheckUtils]: 45: Hoare triple {8403#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {8403#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:00:39,585 INFO L290 TraceCheckUtils]: 44: Hoare triple {8550#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {8403#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:00:39,585 INFO L290 TraceCheckUtils]: 43: Hoare triple {8263#true} ~cond := #in~cond; {8550#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 13:00:39,586 INFO L272 TraceCheckUtils]: 42: Hoare triple {8263#true} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {8263#true} is VALID [2022-04-27 13:00:39,586 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {8263#true} {8263#true} #88#return; {8263#true} is VALID [2022-04-27 13:00:39,586 INFO L290 TraceCheckUtils]: 40: Hoare triple {8263#true} assume true; {8263#true} is VALID [2022-04-27 13:00:39,586 INFO L290 TraceCheckUtils]: 39: Hoare triple {8263#true} assume !(0 == ~cond); {8263#true} is VALID [2022-04-27 13:00:39,586 INFO L290 TraceCheckUtils]: 38: Hoare triple {8263#true} ~cond := #in~cond; {8263#true} is VALID [2022-04-27 13:00:39,586 INFO L272 TraceCheckUtils]: 37: Hoare triple {8263#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {8263#true} is VALID [2022-04-27 13:00:39,586 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {8263#true} {8263#true} #86#return; {8263#true} is VALID [2022-04-27 13:00:39,586 INFO L290 TraceCheckUtils]: 35: Hoare triple {8263#true} assume true; {8263#true} is VALID [2022-04-27 13:00:39,586 INFO L290 TraceCheckUtils]: 34: Hoare triple {8263#true} assume !(0 == ~cond); {8263#true} is VALID [2022-04-27 13:00:39,586 INFO L290 TraceCheckUtils]: 33: Hoare triple {8263#true} ~cond := #in~cond; {8263#true} is VALID [2022-04-27 13:00:39,586 INFO L272 TraceCheckUtils]: 32: Hoare triple {8263#true} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {8263#true} is VALID [2022-04-27 13:00:39,586 INFO L290 TraceCheckUtils]: 31: Hoare triple {8263#true} assume !!(#t~post7 < 50);havoc #t~post7; {8263#true} is VALID [2022-04-27 13:00:39,586 INFO L290 TraceCheckUtils]: 30: Hoare triple {8263#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {8263#true} is VALID [2022-04-27 13:00:39,586 INFO L290 TraceCheckUtils]: 29: Hoare triple {8263#true} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {8263#true} is VALID [2022-04-27 13:00:39,586 INFO L290 TraceCheckUtils]: 28: Hoare triple {8263#true} assume !!(#t~post6 < 50);havoc #t~post6; {8263#true} is VALID [2022-04-27 13:00:39,586 INFO L290 TraceCheckUtils]: 27: Hoare triple {8263#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8263#true} is VALID [2022-04-27 13:00:39,586 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {8263#true} {8263#true} #84#return; {8263#true} is VALID [2022-04-27 13:00:39,586 INFO L290 TraceCheckUtils]: 25: Hoare triple {8263#true} assume true; {8263#true} is VALID [2022-04-27 13:00:39,586 INFO L290 TraceCheckUtils]: 24: Hoare triple {8263#true} assume !(0 == ~cond); {8263#true} is VALID [2022-04-27 13:00:39,587 INFO L290 TraceCheckUtils]: 23: Hoare triple {8263#true} ~cond := #in~cond; {8263#true} is VALID [2022-04-27 13:00:39,587 INFO L272 TraceCheckUtils]: 22: Hoare triple {8263#true} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {8263#true} is VALID [2022-04-27 13:00:39,587 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {8263#true} {8263#true} #82#return; {8263#true} is VALID [2022-04-27 13:00:39,587 INFO L290 TraceCheckUtils]: 20: Hoare triple {8263#true} assume true; {8263#true} is VALID [2022-04-27 13:00:39,587 INFO L290 TraceCheckUtils]: 19: Hoare triple {8263#true} assume !(0 == ~cond); {8263#true} is VALID [2022-04-27 13:00:39,587 INFO L290 TraceCheckUtils]: 18: Hoare triple {8263#true} ~cond := #in~cond; {8263#true} is VALID [2022-04-27 13:00:39,587 INFO L272 TraceCheckUtils]: 17: Hoare triple {8263#true} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {8263#true} is VALID [2022-04-27 13:00:39,587 INFO L290 TraceCheckUtils]: 16: Hoare triple {8263#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; {8263#true} is VALID [2022-04-27 13:00:39,587 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {8263#true} {8263#true} #80#return; {8263#true} is VALID [2022-04-27 13:00:39,587 INFO L290 TraceCheckUtils]: 14: Hoare triple {8263#true} assume true; {8263#true} is VALID [2022-04-27 13:00:39,587 INFO L290 TraceCheckUtils]: 13: Hoare triple {8263#true} assume !(0 == ~cond); {8263#true} is VALID [2022-04-27 13:00:39,587 INFO L290 TraceCheckUtils]: 12: Hoare triple {8263#true} ~cond := #in~cond; {8263#true} is VALID [2022-04-27 13:00:39,587 INFO L272 TraceCheckUtils]: 11: Hoare triple {8263#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {8263#true} is VALID [2022-04-27 13:00:39,587 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8263#true} {8263#true} #78#return; {8263#true} is VALID [2022-04-27 13:00:39,587 INFO L290 TraceCheckUtils]: 9: Hoare triple {8263#true} assume true; {8263#true} is VALID [2022-04-27 13:00:39,587 INFO L290 TraceCheckUtils]: 8: Hoare triple {8263#true} assume !(0 == ~cond); {8263#true} is VALID [2022-04-27 13:00:39,588 INFO L290 TraceCheckUtils]: 7: Hoare triple {8263#true} ~cond := #in~cond; {8263#true} is VALID [2022-04-27 13:00:39,588 INFO L272 TraceCheckUtils]: 6: Hoare triple {8263#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {8263#true} is VALID [2022-04-27 13:00:39,588 INFO L290 TraceCheckUtils]: 5: Hoare triple {8263#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {8263#true} is VALID [2022-04-27 13:00:39,588 INFO L272 TraceCheckUtils]: 4: Hoare triple {8263#true} call #t~ret8 := main(); {8263#true} is VALID [2022-04-27 13:00:39,588 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8263#true} {8263#true} #98#return; {8263#true} is VALID [2022-04-27 13:00:39,588 INFO L290 TraceCheckUtils]: 2: Hoare triple {8263#true} assume true; {8263#true} is VALID [2022-04-27 13:00:39,588 INFO L290 TraceCheckUtils]: 1: Hoare triple {8263#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);~counter~0 := 0; {8263#true} is VALID [2022-04-27 13:00:39,588 INFO L272 TraceCheckUtils]: 0: Hoare triple {8263#true} call ULTIMATE.init(); {8263#true} is VALID [2022-04-27 13:00:39,588 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 22 proven. 7 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2022-04-27 13:00:39,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:00:39,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442902255] [2022-04-27 13:00:39,589 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:00:39,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1016137303] [2022-04-27 13:00:39,589 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1016137303] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 13:00:39,589 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 13:00:39,589 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 12 [2022-04-27 13:00:39,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776634451] [2022-04-27 13:00:39,589 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 13:00:39,590 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 11 states have internal predecessors, (43), 6 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (17), 6 states have call predecessors, (17), 6 states have call successors, (17) Word has length 68 [2022-04-27 13:00:39,590 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:00:39,591 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 11 states have internal predecessors, (43), 6 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (17), 6 states have call predecessors, (17), 6 states have call successors, (17) [2022-04-27 13:00:39,655 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:00:39,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-27 13:00:39,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:00:39,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-27 13:00:39,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-04-27 13:00:39,656 INFO L87 Difference]: Start difference. First operand 248 states and 306 transitions. Second operand has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 11 states have internal predecessors, (43), 6 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (17), 6 states have call predecessors, (17), 6 states have call successors, (17) [2022-04-27 13:00:41,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:00:41,291 INFO L93 Difference]: Finished difference Result 334 states and 433 transitions. [2022-04-27 13:00:41,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-27 13:00:41,291 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 11 states have internal predecessors, (43), 6 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (17), 6 states have call predecessors, (17), 6 states have call successors, (17) Word has length 68 [2022-04-27 13:00:41,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:00:41,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 11 states have internal predecessors, (43), 6 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (17), 6 states have call predecessors, (17), 6 states have call successors, (17) [2022-04-27 13:00:41,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 138 transitions. [2022-04-27 13:00:41,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 11 states have internal predecessors, (43), 6 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (17), 6 states have call predecessors, (17), 6 states have call successors, (17) [2022-04-27 13:00:41,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 138 transitions. [2022-04-27 13:00:41,297 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 138 transitions. [2022-04-27 13:00:41,448 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 138 edges. 138 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:00:41,457 INFO L225 Difference]: With dead ends: 334 [2022-04-27 13:00:41,457 INFO L226 Difference]: Without dead ends: 328 [2022-04-27 13:00:41,458 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 128 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2022-04-27 13:00:41,458 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 46 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 367 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-27 13:00:41,458 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 295 Invalid, 420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 367 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-27 13:00:41,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2022-04-27 13:00:41,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 295. [2022-04-27 13:00:41,713 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:00:41,714 INFO L82 GeneralOperation]: Start isEquivalent. First operand 328 states. Second operand has 295 states, 195 states have (on average 1.1948717948717948) internal successors, (233), 204 states have internal predecessors, (233), 71 states have call successors, (71), 29 states have call predecessors, (71), 28 states have return successors, (66), 61 states have call predecessors, (66), 66 states have call successors, (66) [2022-04-27 13:00:41,715 INFO L74 IsIncluded]: Start isIncluded. First operand 328 states. Second operand has 295 states, 195 states have (on average 1.1948717948717948) internal successors, (233), 204 states have internal predecessors, (233), 71 states have call successors, (71), 29 states have call predecessors, (71), 28 states have return successors, (66), 61 states have call predecessors, (66), 66 states have call successors, (66) [2022-04-27 13:00:41,715 INFO L87 Difference]: Start difference. First operand 328 states. Second operand has 295 states, 195 states have (on average 1.1948717948717948) internal successors, (233), 204 states have internal predecessors, (233), 71 states have call successors, (71), 29 states have call predecessors, (71), 28 states have return successors, (66), 61 states have call predecessors, (66), 66 states have call successors, (66) [2022-04-27 13:00:41,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:00:41,726 INFO L93 Difference]: Finished difference Result 328 states and 421 transitions. [2022-04-27 13:00:41,726 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 421 transitions. [2022-04-27 13:00:41,727 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:00:41,727 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:00:41,728 INFO L74 IsIncluded]: Start isIncluded. First operand has 295 states, 195 states have (on average 1.1948717948717948) internal successors, (233), 204 states have internal predecessors, (233), 71 states have call successors, (71), 29 states have call predecessors, (71), 28 states have return successors, (66), 61 states have call predecessors, (66), 66 states have call successors, (66) Second operand 328 states. [2022-04-27 13:00:41,728 INFO L87 Difference]: Start difference. First operand has 295 states, 195 states have (on average 1.1948717948717948) internal successors, (233), 204 states have internal predecessors, (233), 71 states have call successors, (71), 29 states have call predecessors, (71), 28 states have return successors, (66), 61 states have call predecessors, (66), 66 states have call successors, (66) Second operand 328 states. [2022-04-27 13:00:41,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:00:41,739 INFO L93 Difference]: Finished difference Result 328 states and 421 transitions. [2022-04-27 13:00:41,739 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 421 transitions. [2022-04-27 13:00:41,740 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:00:41,740 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:00:41,740 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:00:41,741 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:00:41,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 195 states have (on average 1.1948717948717948) internal successors, (233), 204 states have internal predecessors, (233), 71 states have call successors, (71), 29 states have call predecessors, (71), 28 states have return successors, (66), 61 states have call predecessors, (66), 66 states have call successors, (66) [2022-04-27 13:00:41,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 370 transitions. [2022-04-27 13:00:41,765 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 370 transitions. Word has length 68 [2022-04-27 13:00:41,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:00:41,765 INFO L495 AbstractCegarLoop]: Abstraction has 295 states and 370 transitions. [2022-04-27 13:00:41,766 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 11 states have internal predecessors, (43), 6 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (17), 6 states have call predecessors, (17), 6 states have call successors, (17) [2022-04-27 13:00:41,766 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 370 transitions. [2022-04-27 13:00:41,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-04-27 13:00:41,767 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:00:41,767 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:00:41,793 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:00:41,979 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:00:41,980 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:00:41,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:00:41,980 INFO L85 PathProgramCache]: Analyzing trace with hash 783638790, now seen corresponding path program 2 times [2022-04-27 13:00:41,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:00:41,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501726578] [2022-04-27 13:00:41,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:00:41,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:00:42,001 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:00:42,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [457227176] [2022-04-27 13:00:42,001 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 13:00:42,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:00:42,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:00:42,003 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:00:42,004 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:00:42,059 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 13:00:42,059 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 13:00:42,061 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 36 conjunts are in the unsatisfiable core [2022-04-27 13:00:42,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:00:42,081 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:00:46,477 INFO L272 TraceCheckUtils]: 0: Hoare triple {10276#true} call ULTIMATE.init(); {10276#true} is VALID [2022-04-27 13:00:46,478 INFO L290 TraceCheckUtils]: 1: Hoare triple {10276#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);~counter~0 := 0; {10276#true} is VALID [2022-04-27 13:00:46,478 INFO L290 TraceCheckUtils]: 2: Hoare triple {10276#true} assume true; {10276#true} is VALID [2022-04-27 13:00:46,478 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10276#true} {10276#true} #98#return; {10276#true} is VALID [2022-04-27 13:00:46,478 INFO L272 TraceCheckUtils]: 4: Hoare triple {10276#true} call #t~ret8 := main(); {10276#true} is VALID [2022-04-27 13:00:46,478 INFO L290 TraceCheckUtils]: 5: Hoare triple {10276#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {10276#true} is VALID [2022-04-27 13:00:46,478 INFO L272 TraceCheckUtils]: 6: Hoare triple {10276#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {10276#true} is VALID [2022-04-27 13:00:46,478 INFO L290 TraceCheckUtils]: 7: Hoare triple {10276#true} ~cond := #in~cond; {10276#true} is VALID [2022-04-27 13:00:46,478 INFO L290 TraceCheckUtils]: 8: Hoare triple {10276#true} assume !(0 == ~cond); {10276#true} is VALID [2022-04-27 13:00:46,478 INFO L290 TraceCheckUtils]: 9: Hoare triple {10276#true} assume true; {10276#true} is VALID [2022-04-27 13:00:46,478 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {10276#true} {10276#true} #78#return; {10276#true} is VALID [2022-04-27 13:00:46,478 INFO L272 TraceCheckUtils]: 11: Hoare triple {10276#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {10276#true} is VALID [2022-04-27 13:00:46,482 INFO L290 TraceCheckUtils]: 12: Hoare triple {10276#true} ~cond := #in~cond; {10276#true} is VALID [2022-04-27 13:00:46,482 INFO L290 TraceCheckUtils]: 13: Hoare triple {10276#true} assume !(0 == ~cond); {10276#true} is VALID [2022-04-27 13:00:46,482 INFO L290 TraceCheckUtils]: 14: Hoare triple {10276#true} assume true; {10276#true} is VALID [2022-04-27 13:00:46,482 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {10276#true} {10276#true} #80#return; {10276#true} is VALID [2022-04-27 13:00:46,487 INFO L290 TraceCheckUtils]: 16: Hoare triple {10276#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; {10329#(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:00:46,488 INFO L272 TraceCheckUtils]: 17: Hoare triple {10329#(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)); {10276#true} is VALID [2022-04-27 13:00:46,488 INFO L290 TraceCheckUtils]: 18: Hoare triple {10276#true} ~cond := #in~cond; {10276#true} is VALID [2022-04-27 13:00:46,488 INFO L290 TraceCheckUtils]: 19: Hoare triple {10276#true} assume !(0 == ~cond); {10276#true} is VALID [2022-04-27 13:00:46,488 INFO L290 TraceCheckUtils]: 20: Hoare triple {10276#true} assume true; {10276#true} is VALID [2022-04-27 13:00:46,489 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {10276#true} {10329#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #82#return; {10329#(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:00:46,489 INFO L272 TraceCheckUtils]: 22: Hoare triple {10329#(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)); {10276#true} is VALID [2022-04-27 13:00:46,489 INFO L290 TraceCheckUtils]: 23: Hoare triple {10276#true} ~cond := #in~cond; {10276#true} is VALID [2022-04-27 13:00:46,489 INFO L290 TraceCheckUtils]: 24: Hoare triple {10276#true} assume !(0 == ~cond); {10276#true} is VALID [2022-04-27 13:00:46,489 INFO L290 TraceCheckUtils]: 25: Hoare triple {10276#true} assume true; {10276#true} is VALID [2022-04-27 13:00:46,490 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {10276#true} {10329#(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))} #84#return; {10329#(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:00:46,491 INFO L290 TraceCheckUtils]: 27: Hoare triple {10329#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10329#(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:00:46,491 INFO L290 TraceCheckUtils]: 28: Hoare triple {10329#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(#t~post6 < 50);havoc #t~post6; {10329#(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:00:46,492 INFO L290 TraceCheckUtils]: 29: Hoare triple {10329#(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; {10369#(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:00:46,492 INFO L290 TraceCheckUtils]: 30: Hoare triple {10369#(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))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {10369#(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:00:46,493 INFO L290 TraceCheckUtils]: 31: Hoare triple {10369#(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 !!(#t~post7 < 50);havoc #t~post7; {10369#(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:00:46,493 INFO L272 TraceCheckUtils]: 32: Hoare triple {10369#(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)); {10276#true} is VALID [2022-04-27 13:00:46,493 INFO L290 TraceCheckUtils]: 33: Hoare triple {10276#true} ~cond := #in~cond; {10276#true} is VALID [2022-04-27 13:00:46,493 INFO L290 TraceCheckUtils]: 34: Hoare triple {10276#true} assume !(0 == ~cond); {10276#true} is VALID [2022-04-27 13:00:46,493 INFO L290 TraceCheckUtils]: 35: Hoare triple {10276#true} assume true; {10276#true} is VALID [2022-04-27 13:00:46,494 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {10276#true} {10369#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #86#return; {10369#(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:00:46,494 INFO L272 TraceCheckUtils]: 37: Hoare triple {10369#(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)); {10276#true} is VALID [2022-04-27 13:00:46,494 INFO L290 TraceCheckUtils]: 38: Hoare triple {10276#true} ~cond := #in~cond; {10276#true} is VALID [2022-04-27 13:00:46,494 INFO L290 TraceCheckUtils]: 39: Hoare triple {10276#true} assume !(0 == ~cond); {10276#true} is VALID [2022-04-27 13:00:46,494 INFO L290 TraceCheckUtils]: 40: Hoare triple {10276#true} assume true; {10276#true} is VALID [2022-04-27 13:00:46,499 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {10276#true} {10369#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #88#return; {10369#(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:00:46,499 INFO L272 TraceCheckUtils]: 42: Hoare triple {10369#(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)); {10276#true} is VALID [2022-04-27 13:00:46,499 INFO L290 TraceCheckUtils]: 43: Hoare triple {10276#true} ~cond := #in~cond; {10412#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:00:46,500 INFO L290 TraceCheckUtils]: 44: Hoare triple {10412#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {10416#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:00:46,500 INFO L290 TraceCheckUtils]: 45: Hoare triple {10416#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {10416#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:00:46,501 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {10416#(not (= |__VERIFIER_assert_#in~cond| 0))} {10369#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #90#return; {10423#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:00:46,501 INFO L272 TraceCheckUtils]: 47: Hoare triple {10423#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} 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)); {10276#true} is VALID [2022-04-27 13:00:46,501 INFO L290 TraceCheckUtils]: 48: Hoare triple {10276#true} ~cond := #in~cond; {10276#true} is VALID [2022-04-27 13:00:46,501 INFO L290 TraceCheckUtils]: 49: Hoare triple {10276#true} assume !(0 == ~cond); {10276#true} is VALID [2022-04-27 13:00:46,502 INFO L290 TraceCheckUtils]: 50: Hoare triple {10276#true} assume true; {10276#true} is VALID [2022-04-27 13:00:46,502 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {10276#true} {10423#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #92#return; {10423#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:00:46,503 INFO L290 TraceCheckUtils]: 52: Hoare triple {10423#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} assume !(~c~0 >= ~b~0); {10423#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:00:46,504 INFO L290 TraceCheckUtils]: 53: Hoare triple {10423#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {10445#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-27 13:00:46,504 INFO L290 TraceCheckUtils]: 54: Hoare triple {10445#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10445#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-27 13:00:46,504 INFO L290 TraceCheckUtils]: 55: Hoare triple {10445#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} assume !!(#t~post6 < 50);havoc #t~post6; {10445#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-27 13:00:46,505 INFO L290 TraceCheckUtils]: 56: Hoare triple {10445#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {10445#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-27 13:00:46,505 INFO L290 TraceCheckUtils]: 57: Hoare triple {10445#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {10445#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-27 13:00:46,506 INFO L290 TraceCheckUtils]: 58: Hoare triple {10445#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} assume !!(#t~post7 < 50);havoc #t~post7; {10445#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-27 13:00:46,506 INFO L272 TraceCheckUtils]: 59: Hoare triple {10445#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {10276#true} is VALID [2022-04-27 13:00:46,506 INFO L290 TraceCheckUtils]: 60: Hoare triple {10276#true} ~cond := #in~cond; {10276#true} is VALID [2022-04-27 13:00:46,506 INFO L290 TraceCheckUtils]: 61: Hoare triple {10276#true} assume !(0 == ~cond); {10276#true} is VALID [2022-04-27 13:00:46,506 INFO L290 TraceCheckUtils]: 62: Hoare triple {10276#true} assume true; {10276#true} is VALID [2022-04-27 13:00:46,506 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {10276#true} {10445#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} #86#return; {10445#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-27 13:00:46,507 INFO L272 TraceCheckUtils]: 64: Hoare triple {10445#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {10276#true} is VALID [2022-04-27 13:00:46,507 INFO L290 TraceCheckUtils]: 65: Hoare triple {10276#true} ~cond := #in~cond; {10276#true} is VALID [2022-04-27 13:00:46,507 INFO L290 TraceCheckUtils]: 66: Hoare triple {10276#true} assume !(0 == ~cond); {10276#true} is VALID [2022-04-27 13:00:46,507 INFO L290 TraceCheckUtils]: 67: Hoare triple {10276#true} assume true; {10276#true} is VALID [2022-04-27 13:00:46,508 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {10276#true} {10445#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} #88#return; {10445#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-27 13:00:46,508 INFO L272 TraceCheckUtils]: 69: Hoare triple {10445#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {10494#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:00:46,509 INFO L290 TraceCheckUtils]: 70: Hoare triple {10494#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {10498#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:00:46,509 INFO L290 TraceCheckUtils]: 71: Hoare triple {10498#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {10277#false} is VALID [2022-04-27 13:00:46,509 INFO L290 TraceCheckUtils]: 72: Hoare triple {10277#false} assume !false; {10277#false} is VALID [2022-04-27 13:00:46,509 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 17 proven. 18 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2022-04-27 13:00:46,509 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:01:04,387 INFO L290 TraceCheckUtils]: 72: Hoare triple {10277#false} assume !false; {10277#false} is VALID [2022-04-27 13:01:04,387 INFO L290 TraceCheckUtils]: 71: Hoare triple {10498#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {10277#false} is VALID [2022-04-27 13:01:04,388 INFO L290 TraceCheckUtils]: 70: Hoare triple {10494#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {10498#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:01:04,388 INFO L272 TraceCheckUtils]: 69: Hoare triple {10514#(= 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)); {10494#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:01:04,389 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {10276#true} {10514#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #88#return; {10514#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 13:01:04,389 INFO L290 TraceCheckUtils]: 67: Hoare triple {10276#true} assume true; {10276#true} is VALID [2022-04-27 13:01:04,389 INFO L290 TraceCheckUtils]: 66: Hoare triple {10276#true} assume !(0 == ~cond); {10276#true} is VALID [2022-04-27 13:01:04,389 INFO L290 TraceCheckUtils]: 65: Hoare triple {10276#true} ~cond := #in~cond; {10276#true} is VALID [2022-04-27 13:01:04,389 INFO L272 TraceCheckUtils]: 64: Hoare triple {10514#(= 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)); {10276#true} is VALID [2022-04-27 13:01:04,390 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {10276#true} {10514#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #86#return; {10514#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 13:01:04,390 INFO L290 TraceCheckUtils]: 62: Hoare triple {10276#true} assume true; {10276#true} is VALID [2022-04-27 13:01:04,390 INFO L290 TraceCheckUtils]: 61: Hoare triple {10276#true} assume !(0 == ~cond); {10276#true} is VALID [2022-04-27 13:01:04,390 INFO L290 TraceCheckUtils]: 60: Hoare triple {10276#true} ~cond := #in~cond; {10276#true} is VALID [2022-04-27 13:01:04,390 INFO L272 TraceCheckUtils]: 59: Hoare triple {10514#(= 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)); {10276#true} is VALID [2022-04-27 13:01:04,390 INFO L290 TraceCheckUtils]: 58: Hoare triple {10514#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !!(#t~post7 < 50);havoc #t~post7; {10514#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 13:01:04,391 INFO L290 TraceCheckUtils]: 57: Hoare triple {10514#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {10514#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 13:01:04,391 INFO L290 TraceCheckUtils]: 56: Hoare triple {10514#(= 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; {10514#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 13:01:04,391 INFO L290 TraceCheckUtils]: 55: Hoare triple {10514#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !!(#t~post6 < 50);havoc #t~post6; {10514#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 13:01:04,392 INFO L290 TraceCheckUtils]: 54: Hoare triple {10514#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10514#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 13:01:06,291 INFO L290 TraceCheckUtils]: 53: Hoare triple {10563#(= (+ (* (+ (* (* 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; {10514#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 13:01:06,292 INFO L290 TraceCheckUtils]: 52: Hoare triple {10563#(= (+ (* (+ (* (* 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); {10563#(= (+ (* (+ (* (* 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:01:06,293 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {10276#true} {10563#(= (+ (* (+ (* (* 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)} #92#return; {10563#(= (+ (* (+ (* (* 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:01:06,293 INFO L290 TraceCheckUtils]: 50: Hoare triple {10276#true} assume true; {10276#true} is VALID [2022-04-27 13:01:06,293 INFO L290 TraceCheckUtils]: 49: Hoare triple {10276#true} assume !(0 == ~cond); {10276#true} is VALID [2022-04-27 13:01:06,293 INFO L290 TraceCheckUtils]: 48: Hoare triple {10276#true} ~cond := #in~cond; {10276#true} is VALID [2022-04-27 13:01:06,293 INFO L272 TraceCheckUtils]: 47: Hoare triple {10563#(= (+ (* (+ (* (* 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)); {10276#true} is VALID [2022-04-27 13:01:06,294 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {10416#(not (= |__VERIFIER_assert_#in~cond| 0))} {10585#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} #90#return; {10563#(= (+ (* (+ (* (* 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:01:06,294 INFO L290 TraceCheckUtils]: 45: Hoare triple {10416#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {10416#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:01:06,294 INFO L290 TraceCheckUtils]: 44: Hoare triple {10595#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {10416#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:01:06,295 INFO L290 TraceCheckUtils]: 43: Hoare triple {10276#true} ~cond := #in~cond; {10595#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 13:01:06,295 INFO L272 TraceCheckUtils]: 42: Hoare triple {10585#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {10276#true} is VALID [2022-04-27 13:01:06,295 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {10276#true} {10585#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} #88#return; {10585#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is VALID [2022-04-27 13:01:06,296 INFO L290 TraceCheckUtils]: 40: Hoare triple {10276#true} assume true; {10276#true} is VALID [2022-04-27 13:01:06,296 INFO L290 TraceCheckUtils]: 39: Hoare triple {10276#true} assume !(0 == ~cond); {10276#true} is VALID [2022-04-27 13:01:06,296 INFO L290 TraceCheckUtils]: 38: Hoare triple {10276#true} ~cond := #in~cond; {10276#true} is VALID [2022-04-27 13:01:06,296 INFO L272 TraceCheckUtils]: 37: Hoare triple {10585#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {10276#true} is VALID [2022-04-27 13:01:06,296 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {10276#true} {10585#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} #86#return; {10585#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is VALID [2022-04-27 13:01:06,296 INFO L290 TraceCheckUtils]: 35: Hoare triple {10276#true} assume true; {10276#true} is VALID [2022-04-27 13:01:06,296 INFO L290 TraceCheckUtils]: 34: Hoare triple {10276#true} assume !(0 == ~cond); {10276#true} is VALID [2022-04-27 13:01:06,297 INFO L290 TraceCheckUtils]: 33: Hoare triple {10276#true} ~cond := #in~cond; {10276#true} is VALID [2022-04-27 13:01:06,297 INFO L272 TraceCheckUtils]: 32: Hoare triple {10585#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {10276#true} is VALID [2022-04-27 13:01:06,297 INFO L290 TraceCheckUtils]: 31: Hoare triple {10585#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} assume !!(#t~post7 < 50);havoc #t~post7; {10585#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is VALID [2022-04-27 13:01:06,297 INFO L290 TraceCheckUtils]: 30: Hoare triple {10585#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {10585#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is VALID [2022-04-27 13:01:06,298 INFO L290 TraceCheckUtils]: 29: Hoare triple {10638#(or (= 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; {10585#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is VALID [2022-04-27 13:01:06,298 INFO L290 TraceCheckUtils]: 28: Hoare triple {10638#(or (= 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 !!(#t~post6 < 50);havoc #t~post6; {10638#(or (= 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:01:06,299 INFO L290 TraceCheckUtils]: 27: Hoare triple {10638#(or (= 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)))))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10638#(or (= 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:01:06,299 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {10276#true} {10638#(or (= 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)))))} #84#return; {10638#(or (= 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:01:06,299 INFO L290 TraceCheckUtils]: 25: Hoare triple {10276#true} assume true; {10276#true} is VALID [2022-04-27 13:01:06,299 INFO L290 TraceCheckUtils]: 24: Hoare triple {10276#true} assume !(0 == ~cond); {10276#true} is VALID [2022-04-27 13:01:06,299 INFO L290 TraceCheckUtils]: 23: Hoare triple {10276#true} ~cond := #in~cond; {10276#true} is VALID [2022-04-27 13:01:06,299 INFO L272 TraceCheckUtils]: 22: Hoare triple {10638#(or (= 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)); {10276#true} is VALID [2022-04-27 13:01:06,300 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {10276#true} {10638#(or (= 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)))))} #82#return; {10638#(or (= 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:01:06,300 INFO L290 TraceCheckUtils]: 20: Hoare triple {10276#true} assume true; {10276#true} is VALID [2022-04-27 13:01:06,300 INFO L290 TraceCheckUtils]: 19: Hoare triple {10276#true} assume !(0 == ~cond); {10276#true} is VALID [2022-04-27 13:01:06,300 INFO L290 TraceCheckUtils]: 18: Hoare triple {10276#true} ~cond := #in~cond; {10276#true} is VALID [2022-04-27 13:01:06,300 INFO L272 TraceCheckUtils]: 17: Hoare triple {10638#(or (= 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)); {10276#true} is VALID [2022-04-27 13:01:06,301 INFO L290 TraceCheckUtils]: 16: Hoare triple {10276#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; {10638#(or (= 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:01:06,301 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {10276#true} {10276#true} #80#return; {10276#true} is VALID [2022-04-27 13:01:06,301 INFO L290 TraceCheckUtils]: 14: Hoare triple {10276#true} assume true; {10276#true} is VALID [2022-04-27 13:01:06,301 INFO L290 TraceCheckUtils]: 13: Hoare triple {10276#true} assume !(0 == ~cond); {10276#true} is VALID [2022-04-27 13:01:06,301 INFO L290 TraceCheckUtils]: 12: Hoare triple {10276#true} ~cond := #in~cond; {10276#true} is VALID [2022-04-27 13:01:06,301 INFO L272 TraceCheckUtils]: 11: Hoare triple {10276#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {10276#true} is VALID [2022-04-27 13:01:06,301 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {10276#true} {10276#true} #78#return; {10276#true} is VALID [2022-04-27 13:01:06,301 INFO L290 TraceCheckUtils]: 9: Hoare triple {10276#true} assume true; {10276#true} is VALID [2022-04-27 13:01:06,301 INFO L290 TraceCheckUtils]: 8: Hoare triple {10276#true} assume !(0 == ~cond); {10276#true} is VALID [2022-04-27 13:01:06,301 INFO L290 TraceCheckUtils]: 7: Hoare triple {10276#true} ~cond := #in~cond; {10276#true} is VALID [2022-04-27 13:01:06,301 INFO L272 TraceCheckUtils]: 6: Hoare triple {10276#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {10276#true} is VALID [2022-04-27 13:01:06,301 INFO L290 TraceCheckUtils]: 5: Hoare triple {10276#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {10276#true} is VALID [2022-04-27 13:01:06,301 INFO L272 TraceCheckUtils]: 4: Hoare triple {10276#true} call #t~ret8 := main(); {10276#true} is VALID [2022-04-27 13:01:06,301 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10276#true} {10276#true} #98#return; {10276#true} is VALID [2022-04-27 13:01:06,301 INFO L290 TraceCheckUtils]: 2: Hoare triple {10276#true} assume true; {10276#true} is VALID [2022-04-27 13:01:06,301 INFO L290 TraceCheckUtils]: 1: Hoare triple {10276#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);~counter~0 := 0; {10276#true} is VALID [2022-04-27 13:01:06,301 INFO L272 TraceCheckUtils]: 0: Hoare triple {10276#true} call ULTIMATE.init(); {10276#true} is VALID [2022-04-27 13:01:06,302 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 17 proven. 18 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2022-04-27 13:01:06,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:01:06,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501726578] [2022-04-27 13:01:06,302 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:01:06,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [457227176] [2022-04-27 13:01:06,302 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [457227176] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 13:01:06,302 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 13:01:06,302 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2022-04-27 13:01:06,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039678979] [2022-04-27 13:01:06,302 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 13:01:06,303 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 14 states have internal predecessors, (43), 9 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (19), 9 states have call predecessors, (19), 9 states have call successors, (19) Word has length 73 [2022-04-27 13:01:06,303 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:01:06,303 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 14 states have internal predecessors, (43), 9 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (19), 9 states have call predecessors, (19), 9 states have call successors, (19) [2022-04-27 13:01:06,626 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:01:06,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-27 13:01:06,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:01:06,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-27 13:01:06,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2022-04-27 13:01:06,627 INFO L87 Difference]: Start difference. First operand 295 states and 370 transitions. Second operand has 15 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 14 states have internal predecessors, (43), 9 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (19), 9 states have call predecessors, (19), 9 states have call successors, (19) [2022-04-27 13:01:11,300 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 13:01:11,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:01:11,579 INFO L93 Difference]: Finished difference Result 319 states and 399 transitions. [2022-04-27 13:01:11,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-27 13:01:11,580 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 14 states have internal predecessors, (43), 9 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (19), 9 states have call predecessors, (19), 9 states have call successors, (19) Word has length 73 [2022-04-27 13:01:11,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:01:11,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 14 states have internal predecessors, (43), 9 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (19), 9 states have call predecessors, (19), 9 states have call successors, (19) [2022-04-27 13:01:11,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 97 transitions. [2022-04-27 13:01:11,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 14 states have internal predecessors, (43), 9 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (19), 9 states have call predecessors, (19), 9 states have call successors, (19) [2022-04-27 13:01:11,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 97 transitions. [2022-04-27 13:01:11,584 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 97 transitions. [2022-04-27 13:01:13,846 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 96 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-27 13:01:13,859 INFO L225 Difference]: With dead ends: 319 [2022-04-27 13:01:13,859 INFO L226 Difference]: Without dead ends: 316 [2022-04-27 13:01:13,860 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 131 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=103, Invalid=403, Unknown=0, NotChecked=0, Total=506 [2022-04-27 13:01:13,865 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 52 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 77 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 376 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-04-27 13:01:13,865 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 320 Invalid, 454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 376 Invalid, 1 Unknown, 0 Unchecked, 3.0s Time] [2022-04-27 13:01:13,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2022-04-27 13:01:14,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 305. [2022-04-27 13:01:14,119 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:01:14,120 INFO L82 GeneralOperation]: Start isEquivalent. First operand 316 states. Second operand has 305 states, 204 states have (on average 1.1862745098039216) internal successors, (242), 212 states have internal predecessors, (242), 69 states have call successors, (69), 32 states have call predecessors, (69), 31 states have return successors, (65), 60 states have call predecessors, (65), 65 states have call successors, (65) [2022-04-27 13:01:14,121 INFO L74 IsIncluded]: Start isIncluded. First operand 316 states. Second operand has 305 states, 204 states have (on average 1.1862745098039216) internal successors, (242), 212 states have internal predecessors, (242), 69 states have call successors, (69), 32 states have call predecessors, (69), 31 states have return successors, (65), 60 states have call predecessors, (65), 65 states have call successors, (65) [2022-04-27 13:01:14,121 INFO L87 Difference]: Start difference. First operand 316 states. Second operand has 305 states, 204 states have (on average 1.1862745098039216) internal successors, (242), 212 states have internal predecessors, (242), 69 states have call successors, (69), 32 states have call predecessors, (69), 31 states have return successors, (65), 60 states have call predecessors, (65), 65 states have call successors, (65) [2022-04-27 13:01:14,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:01:14,148 INFO L93 Difference]: Finished difference Result 316 states and 393 transitions. [2022-04-27 13:01:14,148 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 393 transitions. [2022-04-27 13:01:14,149 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:01:14,149 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:01:14,150 INFO L74 IsIncluded]: Start isIncluded. First operand has 305 states, 204 states have (on average 1.1862745098039216) internal successors, (242), 212 states have internal predecessors, (242), 69 states have call successors, (69), 32 states have call predecessors, (69), 31 states have return successors, (65), 60 states have call predecessors, (65), 65 states have call successors, (65) Second operand 316 states. [2022-04-27 13:01:14,150 INFO L87 Difference]: Start difference. First operand has 305 states, 204 states have (on average 1.1862745098039216) internal successors, (242), 212 states have internal predecessors, (242), 69 states have call successors, (69), 32 states have call predecessors, (69), 31 states have return successors, (65), 60 states have call predecessors, (65), 65 states have call successors, (65) Second operand 316 states. [2022-04-27 13:01:14,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:01:14,159 INFO L93 Difference]: Finished difference Result 316 states and 393 transitions. [2022-04-27 13:01:14,159 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 393 transitions. [2022-04-27 13:01:14,160 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:01:14,160 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:01:14,160 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:01:14,161 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:01:14,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 204 states have (on average 1.1862745098039216) internal successors, (242), 212 states have internal predecessors, (242), 69 states have call successors, (69), 32 states have call predecessors, (69), 31 states have return successors, (65), 60 states have call predecessors, (65), 65 states have call successors, (65) [2022-04-27 13:01:14,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 376 transitions. [2022-04-27 13:01:14,170 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 376 transitions. Word has length 73 [2022-04-27 13:01:14,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:01:14,171 INFO L495 AbstractCegarLoop]: Abstraction has 305 states and 376 transitions. [2022-04-27 13:01:14,172 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 14 states have internal predecessors, (43), 9 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (19), 9 states have call predecessors, (19), 9 states have call successors, (19) [2022-04-27 13:01:14,172 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 376 transitions. [2022-04-27 13:01:14,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-04-27 13:01:14,173 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:01:14,173 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:01:14,201 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:01:14,393 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:01:14,394 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:01:14,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:01:14,394 INFO L85 PathProgramCache]: Analyzing trace with hash 1625446301, now seen corresponding path program 3 times [2022-04-27 13:01:14,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:01:14,394 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283637600] [2022-04-27 13:01:14,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:01:14,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:01:14,418 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:01:14,418 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [13687610] [2022-04-27 13:01:14,418 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 13:01:14,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:01:14,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:01:14,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:01:14,447 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:01:14,487 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-04-27 13:01:14,488 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 13:01:14,489 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 40 conjunts are in the unsatisfiable core [2022-04-27 13:01:14,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:01:14,505 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:01:17,740 INFO L272 TraceCheckUtils]: 0: Hoare triple {12282#true} call ULTIMATE.init(); {12282#true} is VALID [2022-04-27 13:01:17,740 INFO L290 TraceCheckUtils]: 1: Hoare triple {12282#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);~counter~0 := 0; {12282#true} is VALID [2022-04-27 13:01:17,740 INFO L290 TraceCheckUtils]: 2: Hoare triple {12282#true} assume true; {12282#true} is VALID [2022-04-27 13:01:17,740 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12282#true} {12282#true} #98#return; {12282#true} is VALID [2022-04-27 13:01:17,740 INFO L272 TraceCheckUtils]: 4: Hoare triple {12282#true} call #t~ret8 := main(); {12282#true} is VALID [2022-04-27 13:01:17,740 INFO L290 TraceCheckUtils]: 5: Hoare triple {12282#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {12282#true} is VALID [2022-04-27 13:01:17,740 INFO L272 TraceCheckUtils]: 6: Hoare triple {12282#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {12282#true} is VALID [2022-04-27 13:01:17,741 INFO L290 TraceCheckUtils]: 7: Hoare triple {12282#true} ~cond := #in~cond; {12282#true} is VALID [2022-04-27 13:01:17,741 INFO L290 TraceCheckUtils]: 8: Hoare triple {12282#true} assume !(0 == ~cond); {12282#true} is VALID [2022-04-27 13:01:17,741 INFO L290 TraceCheckUtils]: 9: Hoare triple {12282#true} assume true; {12282#true} is VALID [2022-04-27 13:01:17,741 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {12282#true} {12282#true} #78#return; {12282#true} is VALID [2022-04-27 13:01:17,741 INFO L272 TraceCheckUtils]: 11: Hoare triple {12282#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {12282#true} is VALID [2022-04-27 13:01:17,741 INFO L290 TraceCheckUtils]: 12: Hoare triple {12282#true} ~cond := #in~cond; {12282#true} is VALID [2022-04-27 13:01:17,741 INFO L290 TraceCheckUtils]: 13: Hoare triple {12282#true} assume !(0 == ~cond); {12282#true} is VALID [2022-04-27 13:01:17,741 INFO L290 TraceCheckUtils]: 14: Hoare triple {12282#true} assume true; {12282#true} is VALID [2022-04-27 13:01:17,741 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {12282#true} {12282#true} #80#return; {12282#true} is VALID [2022-04-27 13:01:17,741 INFO L290 TraceCheckUtils]: 16: Hoare triple {12282#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; {12335#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:01:17,741 INFO L272 TraceCheckUtils]: 17: Hoare triple {12335#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {12282#true} is VALID [2022-04-27 13:01:17,742 INFO L290 TraceCheckUtils]: 18: Hoare triple {12282#true} ~cond := #in~cond; {12282#true} is VALID [2022-04-27 13:01:17,742 INFO L290 TraceCheckUtils]: 19: Hoare triple {12282#true} assume !(0 == ~cond); {12282#true} is VALID [2022-04-27 13:01:17,742 INFO L290 TraceCheckUtils]: 20: Hoare triple {12282#true} assume true; {12282#true} is VALID [2022-04-27 13:01:17,742 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {12282#true} {12335#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #82#return; {12335#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:01:17,742 INFO L272 TraceCheckUtils]: 22: Hoare triple {12335#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {12282#true} is VALID [2022-04-27 13:01:17,742 INFO L290 TraceCheckUtils]: 23: Hoare triple {12282#true} ~cond := #in~cond; {12282#true} is VALID [2022-04-27 13:01:17,742 INFO L290 TraceCheckUtils]: 24: Hoare triple {12282#true} assume !(0 == ~cond); {12282#true} is VALID [2022-04-27 13:01:17,743 INFO L290 TraceCheckUtils]: 25: Hoare triple {12282#true} assume true; {12282#true} is VALID [2022-04-27 13:01:17,743 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {12282#true} {12335#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #84#return; {12335#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:01:17,744 INFO L290 TraceCheckUtils]: 27: Hoare triple {12335#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12335#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:01:17,744 INFO L290 TraceCheckUtils]: 28: Hoare triple {12335#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(#t~post6 < 50);havoc #t~post6; {12335#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:01:17,745 INFO L290 TraceCheckUtils]: 29: Hoare triple {12335#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {12375#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:01:17,745 INFO L290 TraceCheckUtils]: 30: Hoare triple {12375#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {12375#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:01:17,746 INFO L290 TraceCheckUtils]: 31: Hoare triple {12375#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} assume !!(#t~post7 < 50);havoc #t~post7; {12375#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:01:17,746 INFO L272 TraceCheckUtils]: 32: Hoare triple {12375#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {12282#true} is VALID [2022-04-27 13:01:17,746 INFO L290 TraceCheckUtils]: 33: Hoare triple {12282#true} ~cond := #in~cond; {12282#true} is VALID [2022-04-27 13:01:17,746 INFO L290 TraceCheckUtils]: 34: Hoare triple {12282#true} assume !(0 == ~cond); {12282#true} is VALID [2022-04-27 13:01:17,746 INFO L290 TraceCheckUtils]: 35: Hoare triple {12282#true} assume true; {12282#true} is VALID [2022-04-27 13:01:17,747 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {12282#true} {12375#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #86#return; {12375#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:01:17,747 INFO L272 TraceCheckUtils]: 37: Hoare triple {12375#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {12282#true} is VALID [2022-04-27 13:01:17,747 INFO L290 TraceCheckUtils]: 38: Hoare triple {12282#true} ~cond := #in~cond; {12282#true} is VALID [2022-04-27 13:01:17,747 INFO L290 TraceCheckUtils]: 39: Hoare triple {12282#true} assume !(0 == ~cond); {12282#true} is VALID [2022-04-27 13:01:17,747 INFO L290 TraceCheckUtils]: 40: Hoare triple {12282#true} assume true; {12282#true} is VALID [2022-04-27 13:01:17,748 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {12282#true} {12375#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #88#return; {12375#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:01:17,748 INFO L272 TraceCheckUtils]: 42: Hoare triple {12375#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {12282#true} is VALID [2022-04-27 13:01:17,748 INFO L290 TraceCheckUtils]: 43: Hoare triple {12282#true} ~cond := #in~cond; {12282#true} is VALID [2022-04-27 13:01:17,748 INFO L290 TraceCheckUtils]: 44: Hoare triple {12282#true} assume !(0 == ~cond); {12282#true} is VALID [2022-04-27 13:01:17,748 INFO L290 TraceCheckUtils]: 45: Hoare triple {12282#true} assume true; {12282#true} is VALID [2022-04-27 13:01:17,749 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {12282#true} {12375#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #90#return; {12375#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:01:17,749 INFO L272 TraceCheckUtils]: 47: Hoare triple {12375#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= 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)); {12282#true} is VALID [2022-04-27 13:01:17,749 INFO L290 TraceCheckUtils]: 48: Hoare triple {12282#true} ~cond := #in~cond; {12282#true} is VALID [2022-04-27 13:01:17,749 INFO L290 TraceCheckUtils]: 49: Hoare triple {12282#true} assume !(0 == ~cond); {12282#true} is VALID [2022-04-27 13:01:17,749 INFO L290 TraceCheckUtils]: 50: Hoare triple {12282#true} assume true; {12282#true} is VALID [2022-04-27 13:01:17,750 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {12282#true} {12375#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #92#return; {12375#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:01:17,750 INFO L290 TraceCheckUtils]: 52: Hoare triple {12375#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} assume !(~c~0 >= ~b~0); {12375#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:01:17,751 INFO L290 TraceCheckUtils]: 53: Hoare triple {12375#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= 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; {12448#(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:01:17,751 INFO L290 TraceCheckUtils]: 54: Hoare triple {12448#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12448#(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:01:17,751 INFO L290 TraceCheckUtils]: 55: Hoare triple {12448#(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 !!(#t~post6 < 50);havoc #t~post6; {12448#(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:01:17,752 INFO L290 TraceCheckUtils]: 56: Hoare triple {12448#(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; {12448#(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:01:17,759 INFO L290 TraceCheckUtils]: 57: Hoare triple {12448#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {12448#(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:01:17,760 INFO L290 TraceCheckUtils]: 58: Hoare triple {12448#(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 !!(#t~post7 < 50);havoc #t~post7; {12448#(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:01:17,760 INFO L272 TraceCheckUtils]: 59: Hoare triple {12448#(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)); {12282#true} is VALID [2022-04-27 13:01:17,760 INFO L290 TraceCheckUtils]: 60: Hoare triple {12282#true} ~cond := #in~cond; {12282#true} is VALID [2022-04-27 13:01:17,760 INFO L290 TraceCheckUtils]: 61: Hoare triple {12282#true} assume !(0 == ~cond); {12282#true} is VALID [2022-04-27 13:01:17,760 INFO L290 TraceCheckUtils]: 62: Hoare triple {12282#true} assume true; {12282#true} is VALID [2022-04-27 13:01:17,761 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {12282#true} {12448#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #86#return; {12448#(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:01:17,761 INFO L272 TraceCheckUtils]: 64: Hoare triple {12448#(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)); {12282#true} is VALID [2022-04-27 13:01:17,761 INFO L290 TraceCheckUtils]: 65: Hoare triple {12282#true} ~cond := #in~cond; {12282#true} is VALID [2022-04-27 13:01:17,761 INFO L290 TraceCheckUtils]: 66: Hoare triple {12282#true} assume !(0 == ~cond); {12282#true} is VALID [2022-04-27 13:01:17,761 INFO L290 TraceCheckUtils]: 67: Hoare triple {12282#true} assume true; {12282#true} is VALID [2022-04-27 13:01:17,762 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {12282#true} {12448#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #88#return; {12448#(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:01:17,762 INFO L272 TraceCheckUtils]: 69: Hoare triple {12448#(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)); {12282#true} is VALID [2022-04-27 13:01:17,762 INFO L290 TraceCheckUtils]: 70: Hoare triple {12282#true} ~cond := #in~cond; {12500#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:01:17,762 INFO L290 TraceCheckUtils]: 71: Hoare triple {12500#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {12504#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:01:17,763 INFO L290 TraceCheckUtils]: 72: Hoare triple {12504#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {12504#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:01:17,763 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {12504#(not (= |__VERIFIER_assert_#in~cond| 0))} {12448#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #90#return; {12448#(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:01:17,764 INFO L272 TraceCheckUtils]: 74: Hoare triple {12448#(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)); {12514#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:01:17,765 INFO L290 TraceCheckUtils]: 75: Hoare triple {12514#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {12518#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:01:17,765 INFO L290 TraceCheckUtils]: 76: Hoare triple {12518#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {12283#false} is VALID [2022-04-27 13:01:17,765 INFO L290 TraceCheckUtils]: 77: Hoare triple {12283#false} assume !false; {12283#false} is VALID [2022-04-27 13:01:17,766 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 31 proven. 10 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2022-04-27 13:01:17,766 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:02:05,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:02:05,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283637600] [2022-04-27 13:02:05,280 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:02:05,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [13687610] [2022-04-27 13:02:05,281 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [13687610] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 13:02:05,281 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 13:02:05,281 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2022-04-27 13:02:05,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359293742] [2022-04-27 13:02:05,281 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 13:02:05,281 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 8 states have internal predecessors, (28), 4 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) Word has length 78 [2022-04-27 13:02:05,281 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:02:05,281 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 8 states have internal predecessors, (28), 4 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2022-04-27 13:02:05,327 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:02:05,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-27 13:02:05,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:02:05,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-27 13:02:05,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-04-27 13:02:05,328 INFO L87 Difference]: Start difference. First operand 305 states and 376 transitions. Second operand has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 8 states have internal predecessors, (28), 4 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2022-04-27 13:02:06,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:02:06,391 INFO L93 Difference]: Finished difference Result 337 states and 411 transitions. [2022-04-27 13:02:06,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-27 13:02:06,391 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 8 states have internal predecessors, (28), 4 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) Word has length 78 [2022-04-27 13:02:06,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:02:06,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 8 states have internal predecessors, (28), 4 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2022-04-27 13:02:06,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 95 transitions. [2022-04-27 13:02:06,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 8 states have internal predecessors, (28), 4 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2022-04-27 13:02:06,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 95 transitions. [2022-04-27 13:02:06,395 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 95 transitions. [2022-04-27 13:02:06,510 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:02:06,519 INFO L225 Difference]: With dead ends: 337 [2022-04-27 13:02:06,519 INFO L226 Difference]: Without dead ends: 333 [2022-04-27 13:02:06,519 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 72 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:02:06,520 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 24 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-27 13:02:06,520 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 202 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-27 13:02:06,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2022-04-27 13:02:06,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 330. [2022-04-27 13:02:06,784 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:02:06,785 INFO L82 GeneralOperation]: Start isEquivalent. First operand 333 states. Second operand has 330 states, 221 states have (on average 1.1764705882352942) internal successors, (260), 228 states have internal predecessors, (260), 73 states have call successors, (73), 37 states have call predecessors, (73), 35 states have return successors, (69), 64 states have call predecessors, (69), 69 states have call successors, (69) [2022-04-27 13:02:06,785 INFO L74 IsIncluded]: Start isIncluded. First operand 333 states. Second operand has 330 states, 221 states have (on average 1.1764705882352942) internal successors, (260), 228 states have internal predecessors, (260), 73 states have call successors, (73), 37 states have call predecessors, (73), 35 states have return successors, (69), 64 states have call predecessors, (69), 69 states have call successors, (69) [2022-04-27 13:02:06,786 INFO L87 Difference]: Start difference. First operand 333 states. Second operand has 330 states, 221 states have (on average 1.1764705882352942) internal successors, (260), 228 states have internal predecessors, (260), 73 states have call successors, (73), 37 states have call predecessors, (73), 35 states have return successors, (69), 64 states have call predecessors, (69), 69 states have call successors, (69) [2022-04-27 13:02:06,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:02:06,795 INFO L93 Difference]: Finished difference Result 333 states and 405 transitions. [2022-04-27 13:02:06,795 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 405 transitions. [2022-04-27 13:02:06,796 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:02:06,796 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:02:06,796 INFO L74 IsIncluded]: Start isIncluded. First operand has 330 states, 221 states have (on average 1.1764705882352942) internal successors, (260), 228 states have internal predecessors, (260), 73 states have call successors, (73), 37 states have call predecessors, (73), 35 states have return successors, (69), 64 states have call predecessors, (69), 69 states have call successors, (69) Second operand 333 states. [2022-04-27 13:02:06,797 INFO L87 Difference]: Start difference. First operand has 330 states, 221 states have (on average 1.1764705882352942) internal successors, (260), 228 states have internal predecessors, (260), 73 states have call successors, (73), 37 states have call predecessors, (73), 35 states have return successors, (69), 64 states have call predecessors, (69), 69 states have call successors, (69) Second operand 333 states. [2022-04-27 13:02:06,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:02:06,805 INFO L93 Difference]: Finished difference Result 333 states and 405 transitions. [2022-04-27 13:02:06,806 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 405 transitions. [2022-04-27 13:02:06,806 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:02:06,806 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:02:06,807 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:02:06,807 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:02:06,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330 states, 221 states have (on average 1.1764705882352942) internal successors, (260), 228 states have internal predecessors, (260), 73 states have call successors, (73), 37 states have call predecessors, (73), 35 states have return successors, (69), 64 states have call predecessors, (69), 69 states have call successors, (69) [2022-04-27 13:02:06,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 402 transitions. [2022-04-27 13:02:06,817 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 402 transitions. Word has length 78 [2022-04-27 13:02:06,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:02:06,818 INFO L495 AbstractCegarLoop]: Abstraction has 330 states and 402 transitions. [2022-04-27 13:02:06,818 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 8 states have internal predecessors, (28), 4 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2022-04-27 13:02:06,818 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 402 transitions. [2022-04-27 13:02:06,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-04-27 13:02:06,819 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:02:06,819 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:02:06,847 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:02:07,042 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:02:07,043 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:02:07,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:02:07,043 INFO L85 PathProgramCache]: Analyzing trace with hash -1017110725, now seen corresponding path program 1 times [2022-04-27 13:02:07,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:02:07,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886447493] [2022-04-27 13:02:07,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:02:07,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:02:07,067 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:02:07,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1400800531] [2022-04-27 13:02:07,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:02:07,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:02:07,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:02:07,079 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:02:07,083 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:02:07,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:02:07,143 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 42 conjunts are in the unsatisfiable core [2022-04-27 13:02:07,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:02:07,161 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:02:07,901 INFO L272 TraceCheckUtils]: 0: Hoare triple {14174#true} call ULTIMATE.init(); {14174#true} is VALID [2022-04-27 13:02:07,901 INFO L290 TraceCheckUtils]: 1: Hoare triple {14174#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);~counter~0 := 0; {14174#true} is VALID [2022-04-27 13:02:07,901 INFO L290 TraceCheckUtils]: 2: Hoare triple {14174#true} assume true; {14174#true} is VALID [2022-04-27 13:02:07,902 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14174#true} {14174#true} #98#return; {14174#true} is VALID [2022-04-27 13:02:07,902 INFO L272 TraceCheckUtils]: 4: Hoare triple {14174#true} call #t~ret8 := main(); {14174#true} is VALID [2022-04-27 13:02:07,902 INFO L290 TraceCheckUtils]: 5: Hoare triple {14174#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {14174#true} is VALID [2022-04-27 13:02:07,902 INFO L272 TraceCheckUtils]: 6: Hoare triple {14174#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {14174#true} is VALID [2022-04-27 13:02:07,902 INFO L290 TraceCheckUtils]: 7: Hoare triple {14174#true} ~cond := #in~cond; {14174#true} is VALID [2022-04-27 13:02:07,902 INFO L290 TraceCheckUtils]: 8: Hoare triple {14174#true} assume !(0 == ~cond); {14174#true} is VALID [2022-04-27 13:02:07,902 INFO L290 TraceCheckUtils]: 9: Hoare triple {14174#true} assume true; {14174#true} is VALID [2022-04-27 13:02:07,902 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {14174#true} {14174#true} #78#return; {14174#true} is VALID [2022-04-27 13:02:07,902 INFO L272 TraceCheckUtils]: 11: Hoare triple {14174#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {14174#true} is VALID [2022-04-27 13:02:07,902 INFO L290 TraceCheckUtils]: 12: Hoare triple {14174#true} ~cond := #in~cond; {14174#true} is VALID [2022-04-27 13:02:07,902 INFO L290 TraceCheckUtils]: 13: Hoare triple {14174#true} assume !(0 == ~cond); {14174#true} is VALID [2022-04-27 13:02:07,902 INFO L290 TraceCheckUtils]: 14: Hoare triple {14174#true} assume true; {14174#true} is VALID [2022-04-27 13:02:07,902 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {14174#true} {14174#true} #80#return; {14174#true} is VALID [2022-04-27 13:02:07,903 INFO L290 TraceCheckUtils]: 16: Hoare triple {14174#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; {14227#(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:02:07,903 INFO L272 TraceCheckUtils]: 17: Hoare triple {14227#(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)); {14174#true} is VALID [2022-04-27 13:02:07,903 INFO L290 TraceCheckUtils]: 18: Hoare triple {14174#true} ~cond := #in~cond; {14174#true} is VALID [2022-04-27 13:02:07,903 INFO L290 TraceCheckUtils]: 19: Hoare triple {14174#true} assume !(0 == ~cond); {14174#true} is VALID [2022-04-27 13:02:07,903 INFO L290 TraceCheckUtils]: 20: Hoare triple {14174#true} assume true; {14174#true} is VALID [2022-04-27 13:02:07,903 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {14174#true} {14227#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #82#return; {14227#(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:02:07,903 INFO L272 TraceCheckUtils]: 22: Hoare triple {14227#(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)); {14174#true} is VALID [2022-04-27 13:02:07,904 INFO L290 TraceCheckUtils]: 23: Hoare triple {14174#true} ~cond := #in~cond; {14174#true} is VALID [2022-04-27 13:02:07,904 INFO L290 TraceCheckUtils]: 24: Hoare triple {14174#true} assume !(0 == ~cond); {14174#true} is VALID [2022-04-27 13:02:07,904 INFO L290 TraceCheckUtils]: 25: Hoare triple {14174#true} assume true; {14174#true} is VALID [2022-04-27 13:02:07,904 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {14174#true} {14227#(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))} #84#return; {14227#(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:02:07,905 INFO L290 TraceCheckUtils]: 27: Hoare triple {14227#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {14227#(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:02:07,905 INFO L290 TraceCheckUtils]: 28: Hoare triple {14227#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(#t~post6 < 50);havoc #t~post6; {14227#(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:02:07,905 INFO L290 TraceCheckUtils]: 29: Hoare triple {14227#(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; {14267#(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:02:07,906 INFO L290 TraceCheckUtils]: 30: Hoare triple {14267#(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))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {14267#(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:02:07,906 INFO L290 TraceCheckUtils]: 31: Hoare triple {14267#(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 !!(#t~post7 < 50);havoc #t~post7; {14267#(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:02:07,906 INFO L272 TraceCheckUtils]: 32: Hoare triple {14267#(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)); {14174#true} is VALID [2022-04-27 13:02:07,906 INFO L290 TraceCheckUtils]: 33: Hoare triple {14174#true} ~cond := #in~cond; {14174#true} is VALID [2022-04-27 13:02:07,906 INFO L290 TraceCheckUtils]: 34: Hoare triple {14174#true} assume !(0 == ~cond); {14174#true} is VALID [2022-04-27 13:02:07,906 INFO L290 TraceCheckUtils]: 35: Hoare triple {14174#true} assume true; {14174#true} is VALID [2022-04-27 13:02:07,908 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {14174#true} {14267#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #86#return; {14267#(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:02:07,908 INFO L272 TraceCheckUtils]: 37: Hoare triple {14267#(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)); {14174#true} is VALID [2022-04-27 13:02:07,908 INFO L290 TraceCheckUtils]: 38: Hoare triple {14174#true} ~cond := #in~cond; {14174#true} is VALID [2022-04-27 13:02:07,908 INFO L290 TraceCheckUtils]: 39: Hoare triple {14174#true} assume !(0 == ~cond); {14174#true} is VALID [2022-04-27 13:02:07,908 INFO L290 TraceCheckUtils]: 40: Hoare triple {14174#true} assume true; {14174#true} is VALID [2022-04-27 13:02:07,909 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {14174#true} {14267#(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))} #88#return; {14267#(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:02:07,909 INFO L272 TraceCheckUtils]: 42: Hoare triple {14267#(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)); {14174#true} is VALID [2022-04-27 13:02:07,909 INFO L290 TraceCheckUtils]: 43: Hoare triple {14174#true} ~cond := #in~cond; {14174#true} is VALID [2022-04-27 13:02:07,909 INFO L290 TraceCheckUtils]: 44: Hoare triple {14174#true} assume !(0 == ~cond); {14174#true} is VALID [2022-04-27 13:02:07,909 INFO L290 TraceCheckUtils]: 45: Hoare triple {14174#true} assume true; {14174#true} is VALID [2022-04-27 13:02:07,910 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {14174#true} {14267#(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))} #90#return; {14267#(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:02:07,910 INFO L272 TraceCheckUtils]: 47: Hoare triple {14267#(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)); {14174#true} is VALID [2022-04-27 13:02:07,910 INFO L290 TraceCheckUtils]: 48: Hoare triple {14174#true} ~cond := #in~cond; {14174#true} is VALID [2022-04-27 13:02:07,911 INFO L290 TraceCheckUtils]: 49: Hoare triple {14174#true} assume !(0 == ~cond); {14174#true} is VALID [2022-04-27 13:02:07,911 INFO L290 TraceCheckUtils]: 50: Hoare triple {14174#true} assume true; {14174#true} is VALID [2022-04-27 13:02:07,912 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {14174#true} {14267#(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))} #92#return; {14267#(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:02:07,913 INFO L290 TraceCheckUtils]: 52: Hoare triple {14267#(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; {14337#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~a~0)) (= (+ (- 1) main_~k~0) 0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:02:07,913 INFO L290 TraceCheckUtils]: 53: Hoare triple {14337#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~a~0)) (= (+ (- 1) main_~k~0) 0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {14337#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~a~0)) (= (+ (- 1) main_~k~0) 0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:02:07,914 INFO L290 TraceCheckUtils]: 54: Hoare triple {14337#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~a~0)) (= (+ (- 1) main_~k~0) 0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(#t~post7 < 50);havoc #t~post7; {14337#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~a~0)) (= (+ (- 1) main_~k~0) 0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:02:07,914 INFO L272 TraceCheckUtils]: 55: Hoare triple {14337#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~a~0)) (= (+ (- 1) main_~k~0) 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)); {14174#true} is VALID [2022-04-27 13:02:07,914 INFO L290 TraceCheckUtils]: 56: Hoare triple {14174#true} ~cond := #in~cond; {14174#true} is VALID [2022-04-27 13:02:07,914 INFO L290 TraceCheckUtils]: 57: Hoare triple {14174#true} assume !(0 == ~cond); {14174#true} is VALID [2022-04-27 13:02:07,914 INFO L290 TraceCheckUtils]: 58: Hoare triple {14174#true} assume true; {14174#true} is VALID [2022-04-27 13:02:07,915 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {14174#true} {14337#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~a~0)) (= (+ (- 1) main_~k~0) 0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #86#return; {14337#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~a~0)) (= (+ (- 1) main_~k~0) 0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:02:07,916 INFO L272 TraceCheckUtils]: 60: Hoare triple {14337#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~a~0)) (= (+ (- 1) main_~k~0) 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)); {14174#true} is VALID [2022-04-27 13:02:07,916 INFO L290 TraceCheckUtils]: 61: Hoare triple {14174#true} ~cond := #in~cond; {14365#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:02:07,916 INFO L290 TraceCheckUtils]: 62: Hoare triple {14365#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {14369#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:02:07,917 INFO L290 TraceCheckUtils]: 63: Hoare triple {14369#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {14369#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:02:07,918 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {14369#(not (= |__VERIFIER_assert_#in~cond| 0))} {14337#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~a~0)) (= (+ (- 1) main_~k~0) 0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #88#return; {14376#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~k~0 1) (= (+ main_~c~0 main_~y~0) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-27 13:02:07,918 INFO L272 TraceCheckUtils]: 65: Hoare triple {14376#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~k~0 1) (= (+ main_~c~0 main_~y~0) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~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)); {14174#true} is VALID [2022-04-27 13:02:07,918 INFO L290 TraceCheckUtils]: 66: Hoare triple {14174#true} ~cond := #in~cond; {14174#true} is VALID [2022-04-27 13:02:07,918 INFO L290 TraceCheckUtils]: 67: Hoare triple {14174#true} assume !(0 == ~cond); {14174#true} is VALID [2022-04-27 13:02:07,918 INFO L290 TraceCheckUtils]: 68: Hoare triple {14174#true} assume true; {14174#true} is VALID [2022-04-27 13:02:07,919 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {14174#true} {14376#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~k~0 1) (= (+ main_~c~0 main_~y~0) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= main_~q~0 0) (= main_~p~0 1))} #90#return; {14376#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~k~0 1) (= (+ main_~c~0 main_~y~0) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-27 13:02:07,919 INFO L272 TraceCheckUtils]: 70: Hoare triple {14376#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~k~0 1) (= (+ main_~c~0 main_~y~0) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~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)); {14174#true} is VALID [2022-04-27 13:02:07,919 INFO L290 TraceCheckUtils]: 71: Hoare triple {14174#true} ~cond := #in~cond; {14174#true} is VALID [2022-04-27 13:02:07,919 INFO L290 TraceCheckUtils]: 72: Hoare triple {14174#true} assume !(0 == ~cond); {14174#true} is VALID [2022-04-27 13:02:07,919 INFO L290 TraceCheckUtils]: 73: Hoare triple {14174#true} assume true; {14174#true} is VALID [2022-04-27 13:02:07,920 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {14174#true} {14376#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~k~0 1) (= (+ main_~c~0 main_~y~0) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= main_~q~0 0) (= main_~p~0 1))} #92#return; {14376#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~k~0 1) (= (+ main_~c~0 main_~y~0) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-27 13:02:07,920 INFO L290 TraceCheckUtils]: 75: Hoare triple {14376#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~k~0 1) (= (+ main_~c~0 main_~y~0) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= main_~q~0 0) (= main_~p~0 1))} assume !(~c~0 >= ~b~0); {14376#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~k~0 1) (= (+ main_~c~0 main_~y~0) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-27 13:02:07,921 INFO L290 TraceCheckUtils]: 76: Hoare triple {14376#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~k~0 1) (= (+ main_~c~0 main_~y~0) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~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; {14413#(and (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~q~0 1) (= (+ main_~s~0 1) 0))} is VALID [2022-04-27 13:02:07,921 INFO L290 TraceCheckUtils]: 77: Hoare triple {14413#(and (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~q~0 1) (= (+ main_~s~0 1) 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {14413#(and (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~q~0 1) (= (+ main_~s~0 1) 0))} is VALID [2022-04-27 13:02:07,922 INFO L290 TraceCheckUtils]: 78: Hoare triple {14413#(and (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~q~0 1) (= (+ main_~s~0 1) 0))} assume !!(#t~post6 < 50);havoc #t~post6; {14413#(and (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~q~0 1) (= (+ main_~s~0 1) 0))} is VALID [2022-04-27 13:02:07,922 INFO L290 TraceCheckUtils]: 79: Hoare triple {14413#(and (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~q~0 1) (= (+ main_~s~0 1) 0))} assume !(0 != ~b~0); {14423#(and (= main_~q~0 1) (= (+ main_~s~0 1) 0) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) 0))} is VALID [2022-04-27 13:02:07,923 INFO L272 TraceCheckUtils]: 80: Hoare triple {14423#(and (= main_~q~0 1) (= (+ main_~s~0 1) 0) (= (+ (* 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)); {14427#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:02:07,923 INFO L290 TraceCheckUtils]: 81: Hoare triple {14427#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {14431#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:02:07,923 INFO L290 TraceCheckUtils]: 82: Hoare triple {14431#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {14175#false} is VALID [2022-04-27 13:02:07,923 INFO L290 TraceCheckUtils]: 83: Hoare triple {14175#false} assume !false; {14175#false} is VALID [2022-04-27 13:02:07,924 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 30 proven. 17 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2022-04-27 13:02:07,924 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:02:57,698 INFO L290 TraceCheckUtils]: 83: Hoare triple {14175#false} assume !false; {14175#false} is VALID [2022-04-27 13:02:57,698 INFO L290 TraceCheckUtils]: 82: Hoare triple {14431#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {14175#false} is VALID [2022-04-27 13:02:57,699 INFO L290 TraceCheckUtils]: 81: Hoare triple {14427#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {14431#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:02:57,700 INFO L272 TraceCheckUtils]: 80: Hoare triple {14447#(= (+ (* 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)); {14427#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:02:57,700 INFO L290 TraceCheckUtils]: 79: Hoare triple {14451#(or (not (= main_~b~0 0)) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) 0))} assume !(0 != ~b~0); {14447#(= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) 0)} is VALID [2022-04-27 13:02:57,700 INFO L290 TraceCheckUtils]: 78: Hoare triple {14451#(or (not (= main_~b~0 0)) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) 0))} assume !!(#t~post6 < 50);havoc #t~post6; {14451#(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:02:57,701 INFO L290 TraceCheckUtils]: 77: Hoare triple {14451#(or (not (= main_~b~0 0)) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {14451#(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:02:57,849 INFO L290 TraceCheckUtils]: 76: Hoare triple {14461#(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; {14451#(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:02:57,849 INFO L290 TraceCheckUtils]: 75: Hoare triple {14461#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (- 1) main_~k~0 main_~s~0) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) 0))} assume !(~c~0 >= ~b~0); {14461#(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:02:57,850 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {14174#true} {14461#(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))} #92#return; {14461#(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:02:57,850 INFO L290 TraceCheckUtils]: 73: Hoare triple {14174#true} assume true; {14174#true} is VALID [2022-04-27 13:02:57,850 INFO L290 TraceCheckUtils]: 72: Hoare triple {14174#true} assume !(0 == ~cond); {14174#true} is VALID [2022-04-27 13:02:57,850 INFO L290 TraceCheckUtils]: 71: Hoare triple {14174#true} ~cond := #in~cond; {14174#true} is VALID [2022-04-27 13:02:57,850 INFO L272 TraceCheckUtils]: 70: Hoare triple {14461#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (- 1) main_~k~0 main_~s~0) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) 0))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {14174#true} is VALID [2022-04-27 13:02:57,851 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {14174#true} {14461#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (- 1) main_~k~0 main_~s~0) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) 0))} #90#return; {14461#(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:02:57,851 INFO L290 TraceCheckUtils]: 68: Hoare triple {14174#true} assume true; {14174#true} is VALID [2022-04-27 13:02:57,851 INFO L290 TraceCheckUtils]: 67: Hoare triple {14174#true} assume !(0 == ~cond); {14174#true} is VALID [2022-04-27 13:02:57,858 INFO L290 TraceCheckUtils]: 66: Hoare triple {14174#true} ~cond := #in~cond; {14174#true} is VALID [2022-04-27 13:02:57,858 INFO L272 TraceCheckUtils]: 65: Hoare triple {14461#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (- 1) main_~k~0 main_~s~0) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) 0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {14174#true} is VALID [2022-04-27 13:02:57,860 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {14369#(not (= |__VERIFIER_assert_#in~cond| 0))} {14498#(or (not (= main_~c~0 0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (= (+ (* (+ (* (- 1) main_~k~0 main_~s~0) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) 0))} #88#return; {14461#(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:02:57,861 INFO L290 TraceCheckUtils]: 63: Hoare triple {14369#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {14369#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:02:57,861 INFO L290 TraceCheckUtils]: 62: Hoare triple {14508#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {14369#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:02:57,861 INFO L290 TraceCheckUtils]: 61: Hoare triple {14174#true} ~cond := #in~cond; {14508#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 13:02:57,861 INFO L272 TraceCheckUtils]: 60: Hoare triple {14498#(or (not (= main_~c~0 0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~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)); {14174#true} is VALID [2022-04-27 13:02:57,862 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {14174#true} {14498#(or (not (= main_~c~0 0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (= (+ (* (+ (* (- 1) main_~k~0 main_~s~0) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) 0))} #86#return; {14498#(or (not (= main_~c~0 0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~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:02:57,862 INFO L290 TraceCheckUtils]: 58: Hoare triple {14174#true} assume true; {14174#true} is VALID [2022-04-27 13:02:57,862 INFO L290 TraceCheckUtils]: 57: Hoare triple {14174#true} assume !(0 == ~cond); {14174#true} is VALID [2022-04-27 13:02:57,862 INFO L290 TraceCheckUtils]: 56: Hoare triple {14174#true} ~cond := #in~cond; {14174#true} is VALID [2022-04-27 13:02:57,862 INFO L272 TraceCheckUtils]: 55: Hoare triple {14498#(or (not (= main_~c~0 0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (= (+ (* (+ (* (- 1) main_~k~0 main_~s~0) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) 0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {14174#true} is VALID [2022-04-27 13:02:57,863 INFO L290 TraceCheckUtils]: 54: Hoare triple {14498#(or (not (= main_~c~0 0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~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 !!(#t~post7 < 50);havoc #t~post7; {14498#(or (not (= main_~c~0 0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~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:02:57,863 INFO L290 TraceCheckUtils]: 53: Hoare triple {14498#(or (not (= main_~c~0 0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~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))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {14498#(or (not (= main_~c~0 0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~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:02:57,900 INFO L290 TraceCheckUtils]: 52: Hoare triple {14536#(or (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ (* (- 1) (+ main_~k~0 1) main_~s~0) main_~r~0))) 0) (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 0)))} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {14498#(or (not (= main_~c~0 0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~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:02:57,901 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {14174#true} {14536#(or (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ (* (- 1) (+ main_~k~0 1) main_~s~0) main_~r~0))) 0) (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 0)))} #92#return; {14536#(or (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ (* (- 1) (+ main_~k~0 1) main_~s~0) main_~r~0))) 0) (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 0)))} is VALID [2022-04-27 13:02:57,901 INFO L290 TraceCheckUtils]: 50: Hoare triple {14174#true} assume true; {14174#true} is VALID [2022-04-27 13:02:57,901 INFO L290 TraceCheckUtils]: 49: Hoare triple {14174#true} assume !(0 == ~cond); {14174#true} is VALID [2022-04-27 13:02:57,901 INFO L290 TraceCheckUtils]: 48: Hoare triple {14174#true} ~cond := #in~cond; {14174#true} is VALID [2022-04-27 13:02:57,902 INFO L272 TraceCheckUtils]: 47: Hoare triple {14536#(or (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ (* (- 1) (+ main_~k~0 1) main_~s~0) main_~r~0))) 0) (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 0)))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {14174#true} is VALID [2022-04-27 13:02:57,902 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {14174#true} {14536#(or (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ (* (- 1) (+ main_~k~0 1) main_~s~0) main_~r~0))) 0) (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 0)))} #90#return; {14536#(or (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ (* (- 1) (+ main_~k~0 1) main_~s~0) main_~r~0))) 0) (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 0)))} is VALID [2022-04-27 13:02:57,902 INFO L290 TraceCheckUtils]: 45: Hoare triple {14174#true} assume true; {14174#true} is VALID [2022-04-27 13:02:57,902 INFO L290 TraceCheckUtils]: 44: Hoare triple {14174#true} assume !(0 == ~cond); {14174#true} is VALID [2022-04-27 13:02:57,902 INFO L290 TraceCheckUtils]: 43: Hoare triple {14174#true} ~cond := #in~cond; {14174#true} is VALID [2022-04-27 13:02:57,902 INFO L272 TraceCheckUtils]: 42: Hoare triple {14536#(or (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ (* (- 1) (+ main_~k~0 1) main_~s~0) main_~r~0))) 0) (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 0)))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {14174#true} is VALID [2022-04-27 13:02:57,903 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {14174#true} {14536#(or (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ (* (- 1) (+ main_~k~0 1) main_~s~0) main_~r~0))) 0) (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 0)))} #88#return; {14536#(or (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ (* (- 1) (+ main_~k~0 1) main_~s~0) main_~r~0))) 0) (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 0)))} is VALID [2022-04-27 13:02:57,903 INFO L290 TraceCheckUtils]: 40: Hoare triple {14174#true} assume true; {14174#true} is VALID [2022-04-27 13:02:57,903 INFO L290 TraceCheckUtils]: 39: Hoare triple {14174#true} assume !(0 == ~cond); {14174#true} is VALID [2022-04-27 13:02:57,903 INFO L290 TraceCheckUtils]: 38: Hoare triple {14174#true} ~cond := #in~cond; {14174#true} is VALID [2022-04-27 13:02:57,903 INFO L272 TraceCheckUtils]: 37: Hoare triple {14536#(or (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ (* (- 1) (+ main_~k~0 1) main_~s~0) main_~r~0))) 0) (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 0)))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {14174#true} is VALID [2022-04-27 13:02:57,904 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {14174#true} {14536#(or (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ (* (- 1) (+ main_~k~0 1) main_~s~0) main_~r~0))) 0) (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 0)))} #86#return; {14536#(or (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ (* (- 1) (+ main_~k~0 1) main_~s~0) main_~r~0))) 0) (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 0)))} is VALID [2022-04-27 13:02:57,904 INFO L290 TraceCheckUtils]: 35: Hoare triple {14174#true} assume true; {14174#true} is VALID [2022-04-27 13:02:57,904 INFO L290 TraceCheckUtils]: 34: Hoare triple {14174#true} assume !(0 == ~cond); {14174#true} is VALID [2022-04-27 13:02:57,904 INFO L290 TraceCheckUtils]: 33: Hoare triple {14174#true} ~cond := #in~cond; {14174#true} is VALID [2022-04-27 13:02:57,904 INFO L272 TraceCheckUtils]: 32: Hoare triple {14536#(or (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ (* (- 1) (+ main_~k~0 1) main_~s~0) main_~r~0))) 0) (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 0)))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {14174#true} is VALID [2022-04-27 13:02:57,906 INFO L290 TraceCheckUtils]: 31: Hoare triple {14536#(or (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ (* (- 1) (+ main_~k~0 1) main_~s~0) main_~r~0))) 0) (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 0)))} assume !!(#t~post7 < 50);havoc #t~post7; {14536#(or (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ (* (- 1) (+ main_~k~0 1) main_~s~0) main_~r~0))) 0) (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 0)))} is VALID [2022-04-27 13:02:57,907 INFO L290 TraceCheckUtils]: 30: Hoare triple {14536#(or (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ (* (- 1) (+ main_~k~0 1) main_~s~0) main_~r~0))) 0) (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {14536#(or (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ (* (- 1) (+ main_~k~0 1) main_~s~0) main_~r~0))) 0) (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 0)))} is VALID [2022-04-27 13:02:57,908 INFO L290 TraceCheckUtils]: 29: Hoare triple {14606#(or (= (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))) 0) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 main_~a~0)))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {14536#(or (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ (* (- 1) (+ main_~k~0 1) main_~s~0) main_~r~0))) 0) (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 0)))} is VALID [2022-04-27 13:02:57,908 INFO L290 TraceCheckUtils]: 28: Hoare triple {14606#(or (= (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))) 0) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 main_~a~0)))} assume !!(#t~post6 < 50);havoc #t~post6; {14606#(or (= (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))) 0) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 main_~a~0)))} is VALID [2022-04-27 13:02:57,909 INFO L290 TraceCheckUtils]: 27: Hoare triple {14606#(or (= (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))) 0) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 main_~a~0)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {14606#(or (= (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))) 0) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 main_~a~0)))} is VALID [2022-04-27 13:02:57,909 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {14174#true} {14606#(or (= (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))) 0) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 main_~a~0)))} #84#return; {14606#(or (= (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))) 0) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 main_~a~0)))} is VALID [2022-04-27 13:02:57,909 INFO L290 TraceCheckUtils]: 25: Hoare triple {14174#true} assume true; {14174#true} is VALID [2022-04-27 13:02:57,909 INFO L290 TraceCheckUtils]: 24: Hoare triple {14174#true} assume !(0 == ~cond); {14174#true} is VALID [2022-04-27 13:02:57,910 INFO L290 TraceCheckUtils]: 23: Hoare triple {14174#true} ~cond := #in~cond; {14174#true} is VALID [2022-04-27 13:02:57,910 INFO L272 TraceCheckUtils]: 22: Hoare triple {14606#(or (= (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))) 0) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 main_~a~0)))} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {14174#true} is VALID [2022-04-27 13:02:57,910 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {14174#true} {14606#(or (= (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))) 0) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 main_~a~0)))} #82#return; {14606#(or (= (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))) 0) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 main_~a~0)))} is VALID [2022-04-27 13:02:57,910 INFO L290 TraceCheckUtils]: 20: Hoare triple {14174#true} assume true; {14174#true} is VALID [2022-04-27 13:02:57,910 INFO L290 TraceCheckUtils]: 19: Hoare triple {14174#true} assume !(0 == ~cond); {14174#true} is VALID [2022-04-27 13:02:57,910 INFO L290 TraceCheckUtils]: 18: Hoare triple {14174#true} ~cond := #in~cond; {14174#true} is VALID [2022-04-27 13:02:57,910 INFO L272 TraceCheckUtils]: 17: Hoare triple {14606#(or (= (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))) 0) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 main_~a~0)))} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {14174#true} is VALID [2022-04-27 13:02:57,911 INFO L290 TraceCheckUtils]: 16: Hoare triple {14174#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; {14606#(or (= (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))) 0) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 main_~a~0)))} is VALID [2022-04-27 13:02:57,911 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {14174#true} {14174#true} #80#return; {14174#true} is VALID [2022-04-27 13:02:57,911 INFO L290 TraceCheckUtils]: 14: Hoare triple {14174#true} assume true; {14174#true} is VALID [2022-04-27 13:02:57,911 INFO L290 TraceCheckUtils]: 13: Hoare triple {14174#true} assume !(0 == ~cond); {14174#true} is VALID [2022-04-27 13:02:57,911 INFO L290 TraceCheckUtils]: 12: Hoare triple {14174#true} ~cond := #in~cond; {14174#true} is VALID [2022-04-27 13:02:57,911 INFO L272 TraceCheckUtils]: 11: Hoare triple {14174#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {14174#true} is VALID [2022-04-27 13:02:57,911 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {14174#true} {14174#true} #78#return; {14174#true} is VALID [2022-04-27 13:02:57,911 INFO L290 TraceCheckUtils]: 9: Hoare triple {14174#true} assume true; {14174#true} is VALID [2022-04-27 13:02:57,911 INFO L290 TraceCheckUtils]: 8: Hoare triple {14174#true} assume !(0 == ~cond); {14174#true} is VALID [2022-04-27 13:02:57,911 INFO L290 TraceCheckUtils]: 7: Hoare triple {14174#true} ~cond := #in~cond; {14174#true} is VALID [2022-04-27 13:02:57,911 INFO L272 TraceCheckUtils]: 6: Hoare triple {14174#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {14174#true} is VALID [2022-04-27 13:02:57,911 INFO L290 TraceCheckUtils]: 5: Hoare triple {14174#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {14174#true} is VALID [2022-04-27 13:02:57,911 INFO L272 TraceCheckUtils]: 4: Hoare triple {14174#true} call #t~ret8 := main(); {14174#true} is VALID [2022-04-27 13:02:57,911 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14174#true} {14174#true} #98#return; {14174#true} is VALID [2022-04-27 13:02:57,912 INFO L290 TraceCheckUtils]: 2: Hoare triple {14174#true} assume true; {14174#true} is VALID [2022-04-27 13:02:57,912 INFO L290 TraceCheckUtils]: 1: Hoare triple {14174#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);~counter~0 := 0; {14174#true} is VALID [2022-04-27 13:02:57,912 INFO L272 TraceCheckUtils]: 0: Hoare triple {14174#true} call ULTIMATE.init(); {14174#true} is VALID [2022-04-27 13:02:57,912 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 30 proven. 17 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2022-04-27 13:02:57,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:02:57,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886447493] [2022-04-27 13:02:57,912 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:02:57,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1400800531] [2022-04-27 13:02:57,912 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1400800531] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 13:02:57,912 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 13:02:57,912 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 19 [2022-04-27 13:02:57,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041606139] [2022-04-27 13:02:57,913 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 13:02:57,913 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 18 states have internal predecessors, (45), 11 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (23), 9 states have call predecessors, (23), 9 states have call successors, (23) Word has length 84 [2022-04-27 13:02:57,914 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:02:57,914 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 18 states have internal predecessors, (45), 11 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (23), 9 states have call predecessors, (23), 9 states have call successors, (23) [2022-04-27 13:02:58,342 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:02:58,343 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-27 13:02:58,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:02:58,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-27 13:02:58,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2022-04-27 13:02:58,343 INFO L87 Difference]: Start difference. First operand 330 states and 402 transitions. Second operand has 19 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 18 states have internal predecessors, (45), 11 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (23), 9 states have call predecessors, (23), 9 states have call successors, (23) [2022-04-27 13:03:05,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:03:05,747 INFO L93 Difference]: Finished difference Result 392 states and 488 transitions. [2022-04-27 13:03:05,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-04-27 13:03:05,747 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 18 states have internal predecessors, (45), 11 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (23), 9 states have call predecessors, (23), 9 states have call successors, (23) Word has length 84 [2022-04-27 13:03:05,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:03:05,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 18 states have internal predecessors, (45), 11 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (23), 9 states have call predecessors, (23), 9 states have call successors, (23) [2022-04-27 13:03:05,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 173 transitions. [2022-04-27 13:03:05,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 18 states have internal predecessors, (45), 11 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (23), 9 states have call predecessors, (23), 9 states have call successors, (23) [2022-04-27 13:03:05,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 173 transitions. [2022-04-27 13:03:05,755 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 173 transitions. [2022-04-27 13:03:07,696 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 173 edges. 173 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:03:07,705 INFO L225 Difference]: With dead ends: 392 [2022-04-27 13:03:07,705 INFO L226 Difference]: Without dead ends: 377 [2022-04-27 13:03:07,706 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 149 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=248, Invalid=1084, Unknown=0, NotChecked=0, Total=1332 [2022-04-27 13:03:07,706 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 93 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 740 mSolverCounterSat, 141 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 881 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 141 IncrementalHoareTripleChecker+Valid, 740 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-04-27 13:03:07,706 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 428 Invalid, 881 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [141 Valid, 740 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2022-04-27 13:03:07,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2022-04-27 13:03:08,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 368. [2022-04-27 13:03:08,029 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:03:08,032 INFO L82 GeneralOperation]: Start isEquivalent. First operand 377 states. Second operand has 368 states, 247 states have (on average 1.1902834008097165) internal successors, (294), 252 states have internal predecessors, (294), 84 states have call successors, (84), 37 states have call predecessors, (84), 36 states have return successors, (82), 78 states have call predecessors, (82), 82 states have call successors, (82) [2022-04-27 13:03:08,032 INFO L74 IsIncluded]: Start isIncluded. First operand 377 states. Second operand has 368 states, 247 states have (on average 1.1902834008097165) internal successors, (294), 252 states have internal predecessors, (294), 84 states have call successors, (84), 37 states have call predecessors, (84), 36 states have return successors, (82), 78 states have call predecessors, (82), 82 states have call successors, (82) [2022-04-27 13:03:08,033 INFO L87 Difference]: Start difference. First operand 377 states. Second operand has 368 states, 247 states have (on average 1.1902834008097165) internal successors, (294), 252 states have internal predecessors, (294), 84 states have call successors, (84), 37 states have call predecessors, (84), 36 states have return successors, (82), 78 states have call predecessors, (82), 82 states have call successors, (82) [2022-04-27 13:03:08,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:03:08,043 INFO L93 Difference]: Finished difference Result 377 states and 469 transitions. [2022-04-27 13:03:08,043 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 469 transitions. [2022-04-27 13:03:08,044 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:03:08,044 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:03:08,045 INFO L74 IsIncluded]: Start isIncluded. First operand has 368 states, 247 states have (on average 1.1902834008097165) internal successors, (294), 252 states have internal predecessors, (294), 84 states have call successors, (84), 37 states have call predecessors, (84), 36 states have return successors, (82), 78 states have call predecessors, (82), 82 states have call successors, (82) Second operand 377 states. [2022-04-27 13:03:08,045 INFO L87 Difference]: Start difference. First operand has 368 states, 247 states have (on average 1.1902834008097165) internal successors, (294), 252 states have internal predecessors, (294), 84 states have call successors, (84), 37 states have call predecessors, (84), 36 states have return successors, (82), 78 states have call predecessors, (82), 82 states have call successors, (82) Second operand 377 states. [2022-04-27 13:03:08,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:03:08,063 INFO L93 Difference]: Finished difference Result 377 states and 469 transitions. [2022-04-27 13:03:08,063 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 469 transitions. [2022-04-27 13:03:08,064 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:03:08,064 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:03:08,064 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:03:08,064 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:03:08,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 368 states, 247 states have (on average 1.1902834008097165) internal successors, (294), 252 states have internal predecessors, (294), 84 states have call successors, (84), 37 states have call predecessors, (84), 36 states have return successors, (82), 78 states have call predecessors, (82), 82 states have call successors, (82) [2022-04-27 13:03:08,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 460 transitions. [2022-04-27 13:03:08,076 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 460 transitions. Word has length 84 [2022-04-27 13:03:08,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:03:08,077 INFO L495 AbstractCegarLoop]: Abstraction has 368 states and 460 transitions. [2022-04-27 13:03:08,077 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 18 states have internal predecessors, (45), 11 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (23), 9 states have call predecessors, (23), 9 states have call successors, (23) [2022-04-27 13:03:08,077 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 460 transitions. [2022-04-27 13:03:08,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-04-27 13:03:08,078 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:03:08,078 INFO L195 NwaCegarLoop]: trace histogram [12, 11, 11, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:03:08,101 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-04-27 13:03:08,291 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:03:08,291 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:03:08,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:03:08,292 INFO L85 PathProgramCache]: Analyzing trace with hash 1415088729, now seen corresponding path program 1 times [2022-04-27 13:03:08,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:03:08,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653085997] [2022-04-27 13:03:08,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:03:08,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:03:08,304 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:03:08,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [833594657] [2022-04-27 13:03:08,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:03:08,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:03:08,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:03:08,305 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:03:08,307 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:03:08,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:03:08,383 INFO L263 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 41 conjunts are in the unsatisfiable core [2022-04-27 13:03:08,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:03:08,417 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:03:18,706 INFO L272 TraceCheckUtils]: 0: Hoare triple {16584#true} call ULTIMATE.init(); {16584#true} is VALID [2022-04-27 13:03:18,706 INFO L290 TraceCheckUtils]: 1: Hoare triple {16584#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);~counter~0 := 0; {16584#true} is VALID [2022-04-27 13:03:18,706 INFO L290 TraceCheckUtils]: 2: Hoare triple {16584#true} assume true; {16584#true} is VALID [2022-04-27 13:03:18,706 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16584#true} {16584#true} #98#return; {16584#true} is VALID [2022-04-27 13:03:18,706 INFO L272 TraceCheckUtils]: 4: Hoare triple {16584#true} call #t~ret8 := main(); {16584#true} is VALID [2022-04-27 13:03:18,706 INFO L290 TraceCheckUtils]: 5: Hoare triple {16584#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {16584#true} is VALID [2022-04-27 13:03:18,706 INFO L272 TraceCheckUtils]: 6: Hoare triple {16584#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {16584#true} is VALID [2022-04-27 13:03:18,706 INFO L290 TraceCheckUtils]: 7: Hoare triple {16584#true} ~cond := #in~cond; {16584#true} is VALID [2022-04-27 13:03:18,706 INFO L290 TraceCheckUtils]: 8: Hoare triple {16584#true} assume !(0 == ~cond); {16584#true} is VALID [2022-04-27 13:03:18,706 INFO L290 TraceCheckUtils]: 9: Hoare triple {16584#true} assume true; {16584#true} is VALID [2022-04-27 13:03:18,706 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {16584#true} {16584#true} #78#return; {16584#true} is VALID [2022-04-27 13:03:18,706 INFO L272 TraceCheckUtils]: 11: Hoare triple {16584#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {16584#true} is VALID [2022-04-27 13:03:18,707 INFO L290 TraceCheckUtils]: 12: Hoare triple {16584#true} ~cond := #in~cond; {16584#true} is VALID [2022-04-27 13:03:18,707 INFO L290 TraceCheckUtils]: 13: Hoare triple {16584#true} assume !(0 == ~cond); {16584#true} is VALID [2022-04-27 13:03:18,707 INFO L290 TraceCheckUtils]: 14: Hoare triple {16584#true} assume true; {16584#true} is VALID [2022-04-27 13:03:18,707 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {16584#true} {16584#true} #80#return; {16584#true} is VALID [2022-04-27 13:03:18,707 INFO L290 TraceCheckUtils]: 16: Hoare triple {16584#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; {16637#(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))} is VALID [2022-04-27 13:03:18,707 INFO L272 TraceCheckUtils]: 17: Hoare triple {16637#(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))} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {16584#true} is VALID [2022-04-27 13:03:18,707 INFO L290 TraceCheckUtils]: 18: Hoare triple {16584#true} ~cond := #in~cond; {16584#true} is VALID [2022-04-27 13:03:18,707 INFO L290 TraceCheckUtils]: 19: Hoare triple {16584#true} assume !(0 == ~cond); {16584#true} is VALID [2022-04-27 13:03:18,707 INFO L290 TraceCheckUtils]: 20: Hoare triple {16584#true} assume true; {16584#true} is VALID [2022-04-27 13:03:18,708 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {16584#true} {16637#(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))} #82#return; {16637#(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))} is VALID [2022-04-27 13:03:18,708 INFO L272 TraceCheckUtils]: 22: Hoare triple {16637#(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))} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {16584#true} is VALID [2022-04-27 13:03:18,708 INFO L290 TraceCheckUtils]: 23: Hoare triple {16584#true} ~cond := #in~cond; {16584#true} is VALID [2022-04-27 13:03:18,708 INFO L290 TraceCheckUtils]: 24: Hoare triple {16584#true} assume !(0 == ~cond); {16584#true} is VALID [2022-04-27 13:03:18,708 INFO L290 TraceCheckUtils]: 25: Hoare triple {16584#true} assume true; {16584#true} is VALID [2022-04-27 13:03:18,709 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {16584#true} {16637#(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))} #84#return; {16637#(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))} is VALID [2022-04-27 13:03:18,709 INFO L290 TraceCheckUtils]: 27: Hoare triple {16637#(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))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {16637#(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))} is VALID [2022-04-27 13:03:18,710 INFO L290 TraceCheckUtils]: 28: Hoare triple {16637#(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))} assume !!(#t~post6 < 50);havoc #t~post6; {16637#(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))} is VALID [2022-04-27 13:03:18,710 INFO L290 TraceCheckUtils]: 29: Hoare triple {16637#(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))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {16677#(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))} is VALID [2022-04-27 13:03:18,711 INFO L290 TraceCheckUtils]: 30: Hoare triple {16677#(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))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {16677#(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))} is VALID [2022-04-27 13:03:18,711 INFO L290 TraceCheckUtils]: 31: Hoare triple {16677#(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))} assume !!(#t~post7 < 50);havoc #t~post7; {16677#(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))} is VALID [2022-04-27 13:03:18,711 INFO L272 TraceCheckUtils]: 32: Hoare triple {16677#(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))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {16584#true} is VALID [2022-04-27 13:03:18,711 INFO L290 TraceCheckUtils]: 33: Hoare triple {16584#true} ~cond := #in~cond; {16584#true} is VALID [2022-04-27 13:03:18,711 INFO L290 TraceCheckUtils]: 34: Hoare triple {16584#true} assume !(0 == ~cond); {16584#true} is VALID [2022-04-27 13:03:18,711 INFO L290 TraceCheckUtils]: 35: Hoare triple {16584#true} assume true; {16584#true} is VALID [2022-04-27 13:03:18,712 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {16584#true} {16677#(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))} #86#return; {16677#(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))} is VALID [2022-04-27 13:03:18,712 INFO L272 TraceCheckUtils]: 37: Hoare triple {16677#(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))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {16584#true} is VALID [2022-04-27 13:03:18,712 INFO L290 TraceCheckUtils]: 38: Hoare triple {16584#true} ~cond := #in~cond; {16584#true} is VALID [2022-04-27 13:03:18,712 INFO L290 TraceCheckUtils]: 39: Hoare triple {16584#true} assume !(0 == ~cond); {16584#true} is VALID [2022-04-27 13:03:18,712 INFO L290 TraceCheckUtils]: 40: Hoare triple {16584#true} assume true; {16584#true} is VALID [2022-04-27 13:03:18,713 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {16584#true} {16677#(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))} #88#return; {16677#(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))} is VALID [2022-04-27 13:03:18,713 INFO L272 TraceCheckUtils]: 42: Hoare triple {16677#(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))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {16584#true} is VALID [2022-04-27 13:03:18,713 INFO L290 TraceCheckUtils]: 43: Hoare triple {16584#true} ~cond := #in~cond; {16584#true} is VALID [2022-04-27 13:03:18,713 INFO L290 TraceCheckUtils]: 44: Hoare triple {16584#true} assume !(0 == ~cond); {16584#true} is VALID [2022-04-27 13:03:18,713 INFO L290 TraceCheckUtils]: 45: Hoare triple {16584#true} assume true; {16584#true} is VALID [2022-04-27 13:03:18,714 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {16584#true} {16677#(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))} #90#return; {16677#(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))} is VALID [2022-04-27 13:03:18,714 INFO L272 TraceCheckUtils]: 47: Hoare triple {16677#(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))} 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)); {16584#true} is VALID [2022-04-27 13:03:18,714 INFO L290 TraceCheckUtils]: 48: Hoare triple {16584#true} ~cond := #in~cond; {16584#true} is VALID [2022-04-27 13:03:18,714 INFO L290 TraceCheckUtils]: 49: Hoare triple {16584#true} assume !(0 == ~cond); {16584#true} is VALID [2022-04-27 13:03:18,714 INFO L290 TraceCheckUtils]: 50: Hoare triple {16584#true} assume true; {16584#true} is VALID [2022-04-27 13:03:18,715 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {16584#true} {16677#(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))} #92#return; {16677#(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))} is VALID [2022-04-27 13:03:18,715 INFO L290 TraceCheckUtils]: 52: Hoare triple {16677#(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))} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {16747#(and (= main_~r~0 0) (<= 1 main_~k~0) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~x~0)) (= main_~s~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-27 13:03:18,716 INFO L290 TraceCheckUtils]: 53: Hoare triple {16747#(and (= main_~r~0 0) (<= 1 main_~k~0) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~x~0)) (= main_~s~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {16747#(and (= main_~r~0 0) (<= 1 main_~k~0) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~x~0)) (= main_~s~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-27 13:03:18,716 INFO L290 TraceCheckUtils]: 54: Hoare triple {16747#(and (= main_~r~0 0) (<= 1 main_~k~0) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~x~0)) (= main_~s~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} assume !!(#t~post7 < 50);havoc #t~post7; {16747#(and (= main_~r~0 0) (<= 1 main_~k~0) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~x~0)) (= main_~s~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-27 13:03:18,716 INFO L272 TraceCheckUtils]: 55: Hoare triple {16747#(and (= main_~r~0 0) (<= 1 main_~k~0) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~x~0)) (= main_~s~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 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)); {16584#true} is VALID [2022-04-27 13:03:18,716 INFO L290 TraceCheckUtils]: 56: Hoare triple {16584#true} ~cond := #in~cond; {16584#true} is VALID [2022-04-27 13:03:18,716 INFO L290 TraceCheckUtils]: 57: Hoare triple {16584#true} assume !(0 == ~cond); {16584#true} is VALID [2022-04-27 13:03:18,716 INFO L290 TraceCheckUtils]: 58: Hoare triple {16584#true} assume true; {16584#true} is VALID [2022-04-27 13:03:18,717 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {16584#true} {16747#(and (= main_~r~0 0) (<= 1 main_~k~0) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~x~0)) (= main_~s~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #86#return; {16747#(and (= main_~r~0 0) (<= 1 main_~k~0) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~x~0)) (= main_~s~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-27 13:03:18,717 INFO L272 TraceCheckUtils]: 60: Hoare triple {16747#(and (= main_~r~0 0) (<= 1 main_~k~0) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~x~0)) (= main_~s~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 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)); {16584#true} is VALID [2022-04-27 13:03:18,717 INFO L290 TraceCheckUtils]: 61: Hoare triple {16584#true} ~cond := #in~cond; {16584#true} is VALID [2022-04-27 13:03:18,717 INFO L290 TraceCheckUtils]: 62: Hoare triple {16584#true} assume !(0 == ~cond); {16584#true} is VALID [2022-04-27 13:03:18,717 INFO L290 TraceCheckUtils]: 63: Hoare triple {16584#true} assume true; {16584#true} is VALID [2022-04-27 13:03:18,718 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {16584#true} {16747#(and (= main_~r~0 0) (<= 1 main_~k~0) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~x~0)) (= main_~s~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #88#return; {16747#(and (= main_~r~0 0) (<= 1 main_~k~0) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~x~0)) (= main_~s~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-27 13:03:18,718 INFO L272 TraceCheckUtils]: 65: Hoare triple {16747#(and (= main_~r~0 0) (<= 1 main_~k~0) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~x~0)) (= main_~s~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 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)); {16584#true} is VALID [2022-04-27 13:03:18,718 INFO L290 TraceCheckUtils]: 66: Hoare triple {16584#true} ~cond := #in~cond; {16584#true} is VALID [2022-04-27 13:03:18,718 INFO L290 TraceCheckUtils]: 67: Hoare triple {16584#true} assume !(0 == ~cond); {16584#true} is VALID [2022-04-27 13:03:18,718 INFO L290 TraceCheckUtils]: 68: Hoare triple {16584#true} assume true; {16584#true} is VALID [2022-04-27 13:03:18,719 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {16584#true} {16747#(and (= main_~r~0 0) (<= 1 main_~k~0) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~x~0)) (= main_~s~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #90#return; {16747#(and (= main_~r~0 0) (<= 1 main_~k~0) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~x~0)) (= main_~s~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-27 13:03:18,719 INFO L272 TraceCheckUtils]: 70: Hoare triple {16747#(and (= main_~r~0 0) (<= 1 main_~k~0) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~x~0)) (= main_~s~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 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)); {16584#true} is VALID [2022-04-27 13:03:18,719 INFO L290 TraceCheckUtils]: 71: Hoare triple {16584#true} ~cond := #in~cond; {16584#true} is VALID [2022-04-27 13:03:18,719 INFO L290 TraceCheckUtils]: 72: Hoare triple {16584#true} assume !(0 == ~cond); {16584#true} is VALID [2022-04-27 13:03:18,719 INFO L290 TraceCheckUtils]: 73: Hoare triple {16584#true} assume true; {16584#true} is VALID [2022-04-27 13:03:18,720 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {16584#true} {16747#(and (= main_~r~0 0) (<= 1 main_~k~0) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~x~0)) (= main_~s~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #92#return; {16747#(and (= main_~r~0 0) (<= 1 main_~k~0) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~x~0)) (= main_~s~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-27 13:03:18,720 INFO L290 TraceCheckUtils]: 75: Hoare triple {16747#(and (= main_~r~0 0) (<= 1 main_~k~0) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~x~0)) (= main_~s~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} assume !(~c~0 >= ~b~0); {16747#(and (= main_~r~0 0) (<= 1 main_~k~0) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~x~0)) (= main_~s~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-27 13:03:18,721 INFO L290 TraceCheckUtils]: 76: Hoare triple {16747#(and (= main_~r~0 0) (<= 1 main_~k~0) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~x~0)) (= main_~s~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {16820#(and (<= (+ main_~s~0 1) 0) (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-27 13:03:18,721 INFO L290 TraceCheckUtils]: 77: Hoare triple {16820#(and (<= (+ main_~s~0 1) 0) (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {16820#(and (<= (+ main_~s~0 1) 0) (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-27 13:03:18,722 INFO L290 TraceCheckUtils]: 78: Hoare triple {16820#(and (<= (+ main_~s~0 1) 0) (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} assume !!(#t~post6 < 50);havoc #t~post6; {16820#(and (<= (+ main_~s~0 1) 0) (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-27 13:03:18,722 INFO L290 TraceCheckUtils]: 79: Hoare triple {16820#(and (<= (+ main_~s~0 1) 0) (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {16820#(and (<= (+ main_~s~0 1) 0) (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-27 13:03:18,723 INFO L290 TraceCheckUtils]: 80: Hoare triple {16820#(and (<= (+ main_~s~0 1) 0) (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {16820#(and (<= (+ main_~s~0 1) 0) (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-27 13:03:18,723 INFO L290 TraceCheckUtils]: 81: Hoare triple {16820#(and (<= (+ main_~s~0 1) 0) (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} assume !!(#t~post7 < 50);havoc #t~post7; {16820#(and (<= (+ main_~s~0 1) 0) (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-27 13:03:18,723 INFO L272 TraceCheckUtils]: 82: Hoare triple {16820#(and (<= (+ main_~s~0 1) 0) (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {16584#true} is VALID [2022-04-27 13:03:18,723 INFO L290 TraceCheckUtils]: 83: Hoare triple {16584#true} ~cond := #in~cond; {16584#true} is VALID [2022-04-27 13:03:18,723 INFO L290 TraceCheckUtils]: 84: Hoare triple {16584#true} assume !(0 == ~cond); {16584#true} is VALID [2022-04-27 13:03:18,723 INFO L290 TraceCheckUtils]: 85: Hoare triple {16584#true} assume true; {16584#true} is VALID [2022-04-27 13:03:18,724 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {16584#true} {16820#(and (<= (+ main_~s~0 1) 0) (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #86#return; {16820#(and (<= (+ main_~s~0 1) 0) (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-27 13:03:18,724 INFO L272 TraceCheckUtils]: 87: Hoare triple {16820#(and (<= (+ main_~s~0 1) 0) (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {16584#true} is VALID [2022-04-27 13:03:18,724 INFO L290 TraceCheckUtils]: 88: Hoare triple {16584#true} ~cond := #in~cond; {16584#true} is VALID [2022-04-27 13:03:18,724 INFO L290 TraceCheckUtils]: 89: Hoare triple {16584#true} assume !(0 == ~cond); {16584#true} is VALID [2022-04-27 13:03:18,724 INFO L290 TraceCheckUtils]: 90: Hoare triple {16584#true} assume true; {16584#true} is VALID [2022-04-27 13:03:18,725 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {16584#true} {16820#(and (<= (+ main_~s~0 1) 0) (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #88#return; {16820#(and (<= (+ main_~s~0 1) 0) (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-27 13:03:18,725 INFO L272 TraceCheckUtils]: 92: Hoare triple {16820#(and (<= (+ main_~s~0 1) 0) (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {16584#true} is VALID [2022-04-27 13:03:18,725 INFO L290 TraceCheckUtils]: 93: Hoare triple {16584#true} ~cond := #in~cond; {16872#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:03:18,725 INFO L290 TraceCheckUtils]: 94: Hoare triple {16872#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {16876#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:03:18,725 INFO L290 TraceCheckUtils]: 95: Hoare triple {16876#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {16876#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:03:18,726 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {16876#(not (= |__VERIFIER_assert_#in~cond| 0))} {16820#(and (<= (+ main_~s~0 1) 0) (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #90#return; {16883#(and (<= (+ main_~s~0 1) 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-27 13:03:18,738 INFO L272 TraceCheckUtils]: 97: Hoare triple {16883#(and (<= (+ main_~s~0 1) 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {16887#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:03:18,738 INFO L290 TraceCheckUtils]: 98: Hoare triple {16887#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {16891#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:03:18,738 INFO L290 TraceCheckUtils]: 99: Hoare triple {16891#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {16585#false} is VALID [2022-04-27 13:03:18,738 INFO L290 TraceCheckUtils]: 100: Hoare triple {16585#false} assume !false; {16585#false} is VALID [2022-04-27 13:03:18,739 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 51 proven. 23 refuted. 0 times theorem prover too weak. 214 trivial. 0 not checked. [2022-04-27 13:03:18,739 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:03:56,464 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-27 13:03:57,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:03:57,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653085997] [2022-04-27 13:03:57,173 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:03:57,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [833594657] [2022-04-27 13:03:57,173 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [833594657] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 13:03:57,173 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 13:03:57,173 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2022-04-27 13:03:57,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042357184] [2022-04-27 13:03:57,173 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 13:03:57,174 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 9 states have internal predecessors, (31), 6 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 6 states have call predecessors, (16), 5 states have call successors, (16) Word has length 101 [2022-04-27 13:03:57,174 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:03:57,174 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 10 states have (on average 3.1) internal successors, (31), 9 states have internal predecessors, (31), 6 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 6 states have call predecessors, (16), 5 states have call successors, (16) [2022-04-27 13:03:57,279 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:57,279 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-27 13:03:57,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:03:57,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-27 13:03:57,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2022-04-27 13:03:57,280 INFO L87 Difference]: Start difference. First operand 368 states and 460 transitions. Second operand has 11 states, 10 states have (on average 3.1) internal successors, (31), 9 states have internal predecessors, (31), 6 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 6 states have call predecessors, (16), 5 states have call successors, (16) [2022-04-27 13:04:09,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:04:09,545 INFO L93 Difference]: Finished difference Result 377 states and 468 transitions. [2022-04-27 13:04:09,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-27 13:04:09,546 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 9 states have internal predecessors, (31), 6 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 6 states have call predecessors, (16), 5 states have call successors, (16) Word has length 101 [2022-04-27 13:04:09,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:04:09,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 3.1) internal successors, (31), 9 states have internal predecessors, (31), 6 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 6 states have call predecessors, (16), 5 states have call successors, (16) [2022-04-27 13:04:09,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 116 transitions. [2022-04-27 13:04:09,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 3.1) internal successors, (31), 9 states have internal predecessors, (31), 6 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 6 states have call predecessors, (16), 5 states have call successors, (16) [2022-04-27 13:04:09,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 116 transitions. [2022-04-27 13:04:09,549 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 116 transitions. [2022-04-27 13:04:09,766 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 116 edges. 116 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:04:09,776 INFO L225 Difference]: With dead ends: 377 [2022-04-27 13:04:09,776 INFO L226 Difference]: Without dead ends: 375 [2022-04-27 13:04:09,776 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 113 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2022-04-27 13:04:09,777 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 29 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 505 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 505 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-04-27 13:04:09,777 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 315 Invalid, 525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 505 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-04-27 13:04:09,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2022-04-27 13:04:10,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 372. [2022-04-27 13:04:10,124 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:04:10,125 INFO L82 GeneralOperation]: Start isEquivalent. First operand 375 states. Second operand has 372 states, 250 states have (on average 1.184) internal successors, (296), 255 states have internal predecessors, (296), 84 states have call successors, (84), 38 states have call predecessors, (84), 37 states have return successors, (82), 78 states have call predecessors, (82), 82 states have call successors, (82) [2022-04-27 13:04:10,126 INFO L74 IsIncluded]: Start isIncluded. First operand 375 states. Second operand has 372 states, 250 states have (on average 1.184) internal successors, (296), 255 states have internal predecessors, (296), 84 states have call successors, (84), 38 states have call predecessors, (84), 37 states have return successors, (82), 78 states have call predecessors, (82), 82 states have call successors, (82) [2022-04-27 13:04:10,126 INFO L87 Difference]: Start difference. First operand 375 states. Second operand has 372 states, 250 states have (on average 1.184) internal successors, (296), 255 states have internal predecessors, (296), 84 states have call successors, (84), 38 states have call predecessors, (84), 37 states have return successors, (82), 78 states have call predecessors, (82), 82 states have call successors, (82) [2022-04-27 13:04:10,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:04:10,136 INFO L93 Difference]: Finished difference Result 375 states and 465 transitions. [2022-04-27 13:04:10,136 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 465 transitions. [2022-04-27 13:04:10,137 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:04:10,137 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:04:10,138 INFO L74 IsIncluded]: Start isIncluded. First operand has 372 states, 250 states have (on average 1.184) internal successors, (296), 255 states have internal predecessors, (296), 84 states have call successors, (84), 38 states have call predecessors, (84), 37 states have return successors, (82), 78 states have call predecessors, (82), 82 states have call successors, (82) Second operand 375 states. [2022-04-27 13:04:10,138 INFO L87 Difference]: Start difference. First operand has 372 states, 250 states have (on average 1.184) internal successors, (296), 255 states have internal predecessors, (296), 84 states have call successors, (84), 38 states have call predecessors, (84), 37 states have return successors, (82), 78 states have call predecessors, (82), 82 states have call successors, (82) Second operand 375 states. [2022-04-27 13:04:10,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:04:10,153 INFO L93 Difference]: Finished difference Result 375 states and 465 transitions. [2022-04-27 13:04:10,154 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 465 transitions. [2022-04-27 13:04:10,154 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:04:10,155 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:04:10,155 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:04:10,155 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:04:10,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 372 states, 250 states have (on average 1.184) internal successors, (296), 255 states have internal predecessors, (296), 84 states have call successors, (84), 38 states have call predecessors, (84), 37 states have return successors, (82), 78 states have call predecessors, (82), 82 states have call successors, (82) [2022-04-27 13:04:10,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 462 transitions. [2022-04-27 13:04:10,167 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 462 transitions. Word has length 101 [2022-04-27 13:04:10,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:04:10,167 INFO L495 AbstractCegarLoop]: Abstraction has 372 states and 462 transitions. [2022-04-27 13:04:10,167 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 9 states have internal predecessors, (31), 6 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 6 states have call predecessors, (16), 5 states have call successors, (16) [2022-04-27 13:04:10,167 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 462 transitions. [2022-04-27 13:04:10,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-04-27 13:04:10,168 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:04:10,168 INFO L195 NwaCegarLoop]: trace histogram [12, 11, 11, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:04:10,191 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2022-04-27 13:04:10,387 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:04:10,387 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:04:10,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:04:10,388 INFO L85 PathProgramCache]: Analyzing trace with hash -2076615365, now seen corresponding path program 4 times [2022-04-27 13:04:10,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:04:10,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566011223] [2022-04-27 13:04:10,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:04:10,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:04:10,404 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:04:10,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [90769534] [2022-04-27 13:04:10,405 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-27 13:04:10,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:04:10,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:04:10,406 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 13:04:10,411 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-04-27 13:04:10,475 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-27 13:04:10,476 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 13:04:10,477 INFO L263 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-27 13:04:10,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:04:10,493 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:04:10,735 INFO L272 TraceCheckUtils]: 0: Hoare triple {18821#true} call ULTIMATE.init(); {18821#true} is VALID [2022-04-27 13:04:10,735 INFO L290 TraceCheckUtils]: 1: Hoare triple {18821#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);~counter~0 := 0; {18821#true} is VALID [2022-04-27 13:04:10,735 INFO L290 TraceCheckUtils]: 2: Hoare triple {18821#true} assume true; {18821#true} is VALID [2022-04-27 13:04:10,735 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18821#true} {18821#true} #98#return; {18821#true} is VALID [2022-04-27 13:04:10,736 INFO L272 TraceCheckUtils]: 4: Hoare triple {18821#true} call #t~ret8 := main(); {18821#true} is VALID [2022-04-27 13:04:10,736 INFO L290 TraceCheckUtils]: 5: Hoare triple {18821#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {18821#true} is VALID [2022-04-27 13:04:10,736 INFO L272 TraceCheckUtils]: 6: Hoare triple {18821#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {18821#true} is VALID [2022-04-27 13:04:10,736 INFO L290 TraceCheckUtils]: 7: Hoare triple {18821#true} ~cond := #in~cond; {18821#true} is VALID [2022-04-27 13:04:10,736 INFO L290 TraceCheckUtils]: 8: Hoare triple {18821#true} assume !(0 == ~cond); {18821#true} is VALID [2022-04-27 13:04:10,736 INFO L290 TraceCheckUtils]: 9: Hoare triple {18821#true} assume true; {18821#true} is VALID [2022-04-27 13:04:10,736 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {18821#true} {18821#true} #78#return; {18821#true} is VALID [2022-04-27 13:04:10,736 INFO L272 TraceCheckUtils]: 11: Hoare triple {18821#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {18821#true} is VALID [2022-04-27 13:04:10,736 INFO L290 TraceCheckUtils]: 12: Hoare triple {18821#true} ~cond := #in~cond; {18821#true} is VALID [2022-04-27 13:04:10,736 INFO L290 TraceCheckUtils]: 13: Hoare triple {18821#true} assume !(0 == ~cond); {18821#true} is VALID [2022-04-27 13:04:10,736 INFO L290 TraceCheckUtils]: 14: Hoare triple {18821#true} assume true; {18821#true} is VALID [2022-04-27 13:04:10,736 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {18821#true} {18821#true} #80#return; {18821#true} is VALID [2022-04-27 13:04:10,736 INFO L290 TraceCheckUtils]: 16: Hoare triple {18821#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; {18821#true} is VALID [2022-04-27 13:04:10,736 INFO L272 TraceCheckUtils]: 17: Hoare triple {18821#true} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {18821#true} is VALID [2022-04-27 13:04:10,736 INFO L290 TraceCheckUtils]: 18: Hoare triple {18821#true} ~cond := #in~cond; {18821#true} is VALID [2022-04-27 13:04:10,737 INFO L290 TraceCheckUtils]: 19: Hoare triple {18821#true} assume !(0 == ~cond); {18821#true} is VALID [2022-04-27 13:04:10,737 INFO L290 TraceCheckUtils]: 20: Hoare triple {18821#true} assume true; {18821#true} is VALID [2022-04-27 13:04:10,737 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {18821#true} {18821#true} #82#return; {18821#true} is VALID [2022-04-27 13:04:10,737 INFO L272 TraceCheckUtils]: 22: Hoare triple {18821#true} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {18821#true} is VALID [2022-04-27 13:04:10,737 INFO L290 TraceCheckUtils]: 23: Hoare triple {18821#true} ~cond := #in~cond; {18821#true} is VALID [2022-04-27 13:04:10,737 INFO L290 TraceCheckUtils]: 24: Hoare triple {18821#true} assume !(0 == ~cond); {18821#true} is VALID [2022-04-27 13:04:10,737 INFO L290 TraceCheckUtils]: 25: Hoare triple {18821#true} assume true; {18821#true} is VALID [2022-04-27 13:04:10,737 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {18821#true} {18821#true} #84#return; {18821#true} is VALID [2022-04-27 13:04:10,737 INFO L290 TraceCheckUtils]: 27: Hoare triple {18821#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {18821#true} is VALID [2022-04-27 13:04:10,737 INFO L290 TraceCheckUtils]: 28: Hoare triple {18821#true} assume !!(#t~post6 < 50);havoc #t~post6; {18821#true} is VALID [2022-04-27 13:04:10,737 INFO L290 TraceCheckUtils]: 29: Hoare triple {18821#true} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {18821#true} is VALID [2022-04-27 13:04:10,737 INFO L290 TraceCheckUtils]: 30: Hoare triple {18821#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {18821#true} is VALID [2022-04-27 13:04:10,737 INFO L290 TraceCheckUtils]: 31: Hoare triple {18821#true} assume !!(#t~post7 < 50);havoc #t~post7; {18821#true} is VALID [2022-04-27 13:04:10,737 INFO L272 TraceCheckUtils]: 32: Hoare triple {18821#true} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {18821#true} is VALID [2022-04-27 13:04:10,737 INFO L290 TraceCheckUtils]: 33: Hoare triple {18821#true} ~cond := #in~cond; {18821#true} is VALID [2022-04-27 13:04:10,738 INFO L290 TraceCheckUtils]: 34: Hoare triple {18821#true} assume !(0 == ~cond); {18821#true} is VALID [2022-04-27 13:04:10,738 INFO L290 TraceCheckUtils]: 35: Hoare triple {18821#true} assume true; {18821#true} is VALID [2022-04-27 13:04:10,738 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {18821#true} {18821#true} #86#return; {18821#true} is VALID [2022-04-27 13:04:10,738 INFO L272 TraceCheckUtils]: 37: Hoare triple {18821#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {18821#true} is VALID [2022-04-27 13:04:10,738 INFO L290 TraceCheckUtils]: 38: Hoare triple {18821#true} ~cond := #in~cond; {18821#true} is VALID [2022-04-27 13:04:10,738 INFO L290 TraceCheckUtils]: 39: Hoare triple {18821#true} assume !(0 == ~cond); {18821#true} is VALID [2022-04-27 13:04:10,738 INFO L290 TraceCheckUtils]: 40: Hoare triple {18821#true} assume true; {18821#true} is VALID [2022-04-27 13:04:10,738 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {18821#true} {18821#true} #88#return; {18821#true} is VALID [2022-04-27 13:04:10,738 INFO L272 TraceCheckUtils]: 42: Hoare triple {18821#true} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {18821#true} is VALID [2022-04-27 13:04:10,738 INFO L290 TraceCheckUtils]: 43: Hoare triple {18821#true} ~cond := #in~cond; {18821#true} is VALID [2022-04-27 13:04:10,738 INFO L290 TraceCheckUtils]: 44: Hoare triple {18821#true} assume !(0 == ~cond); {18821#true} is VALID [2022-04-27 13:04:10,738 INFO L290 TraceCheckUtils]: 45: Hoare triple {18821#true} assume true; {18821#true} is VALID [2022-04-27 13:04:10,738 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {18821#true} {18821#true} #90#return; {18821#true} is VALID [2022-04-27 13:04:10,738 INFO L272 TraceCheckUtils]: 47: Hoare triple {18821#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)); {18821#true} is VALID [2022-04-27 13:04:10,738 INFO L290 TraceCheckUtils]: 48: Hoare triple {18821#true} ~cond := #in~cond; {18821#true} is VALID [2022-04-27 13:04:10,739 INFO L290 TraceCheckUtils]: 49: Hoare triple {18821#true} assume !(0 == ~cond); {18821#true} is VALID [2022-04-27 13:04:10,739 INFO L290 TraceCheckUtils]: 50: Hoare triple {18821#true} assume true; {18821#true} is VALID [2022-04-27 13:04:10,739 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {18821#true} {18821#true} #92#return; {18821#true} is VALID [2022-04-27 13:04:10,739 INFO L290 TraceCheckUtils]: 52: Hoare triple {18821#true} assume !(~c~0 >= ~b~0); {18982#(not (<= main_~b~0 main_~c~0))} is VALID [2022-04-27 13:04:10,739 INFO L290 TraceCheckUtils]: 53: Hoare triple {18982#(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; {18986#(< main_~b~0 main_~a~0)} is VALID [2022-04-27 13:04:10,740 INFO L290 TraceCheckUtils]: 54: Hoare triple {18986#(< main_~b~0 main_~a~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {18986#(< main_~b~0 main_~a~0)} is VALID [2022-04-27 13:04:10,740 INFO L290 TraceCheckUtils]: 55: Hoare triple {18986#(< main_~b~0 main_~a~0)} assume !!(#t~post6 < 50);havoc #t~post6; {18986#(< main_~b~0 main_~a~0)} is VALID [2022-04-27 13:04:10,740 INFO L290 TraceCheckUtils]: 56: Hoare triple {18986#(< main_~b~0 main_~a~0)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {18996#(< main_~b~0 main_~c~0)} is VALID [2022-04-27 13:04:10,741 INFO L290 TraceCheckUtils]: 57: Hoare triple {18996#(< main_~b~0 main_~c~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {18996#(< main_~b~0 main_~c~0)} is VALID [2022-04-27 13:04:10,741 INFO L290 TraceCheckUtils]: 58: Hoare triple {18996#(< main_~b~0 main_~c~0)} assume !!(#t~post7 < 50);havoc #t~post7; {18996#(< main_~b~0 main_~c~0)} is VALID [2022-04-27 13:04:10,741 INFO L272 TraceCheckUtils]: 59: Hoare triple {18996#(< main_~b~0 main_~c~0)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {18821#true} is VALID [2022-04-27 13:04:10,741 INFO L290 TraceCheckUtils]: 60: Hoare triple {18821#true} ~cond := #in~cond; {18821#true} is VALID [2022-04-27 13:04:10,741 INFO L290 TraceCheckUtils]: 61: Hoare triple {18821#true} assume !(0 == ~cond); {18821#true} is VALID [2022-04-27 13:04:10,741 INFO L290 TraceCheckUtils]: 62: Hoare triple {18821#true} assume true; {18821#true} is VALID [2022-04-27 13:04:10,742 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {18821#true} {18996#(< main_~b~0 main_~c~0)} #86#return; {18996#(< main_~b~0 main_~c~0)} is VALID [2022-04-27 13:04:10,742 INFO L272 TraceCheckUtils]: 64: Hoare triple {18996#(< main_~b~0 main_~c~0)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {18821#true} is VALID [2022-04-27 13:04:10,742 INFO L290 TraceCheckUtils]: 65: Hoare triple {18821#true} ~cond := #in~cond; {18821#true} is VALID [2022-04-27 13:04:10,742 INFO L290 TraceCheckUtils]: 66: Hoare triple {18821#true} assume !(0 == ~cond); {18821#true} is VALID [2022-04-27 13:04:10,742 INFO L290 TraceCheckUtils]: 67: Hoare triple {18821#true} assume true; {18821#true} is VALID [2022-04-27 13:04:10,743 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {18821#true} {18996#(< main_~b~0 main_~c~0)} #88#return; {18996#(< main_~b~0 main_~c~0)} is VALID [2022-04-27 13:04:10,743 INFO L272 TraceCheckUtils]: 69: Hoare triple {18996#(< main_~b~0 main_~c~0)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {18821#true} is VALID [2022-04-27 13:04:10,743 INFO L290 TraceCheckUtils]: 70: Hoare triple {18821#true} ~cond := #in~cond; {18821#true} is VALID [2022-04-27 13:04:10,743 INFO L290 TraceCheckUtils]: 71: Hoare triple {18821#true} assume !(0 == ~cond); {18821#true} is VALID [2022-04-27 13:04:10,743 INFO L290 TraceCheckUtils]: 72: Hoare triple {18821#true} assume true; {18821#true} is VALID [2022-04-27 13:04:10,743 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {18821#true} {18996#(< main_~b~0 main_~c~0)} #90#return; {18996#(< main_~b~0 main_~c~0)} is VALID [2022-04-27 13:04:10,743 INFO L272 TraceCheckUtils]: 74: Hoare triple {18996#(< 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)); {18821#true} is VALID [2022-04-27 13:04:10,743 INFO L290 TraceCheckUtils]: 75: Hoare triple {18821#true} ~cond := #in~cond; {18821#true} is VALID [2022-04-27 13:04:10,744 INFO L290 TraceCheckUtils]: 76: Hoare triple {18821#true} assume !(0 == ~cond); {18821#true} is VALID [2022-04-27 13:04:10,744 INFO L290 TraceCheckUtils]: 77: Hoare triple {18821#true} assume true; {18821#true} is VALID [2022-04-27 13:04:10,744 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {18821#true} {18996#(< main_~b~0 main_~c~0)} #92#return; {18996#(< main_~b~0 main_~c~0)} is VALID [2022-04-27 13:04:10,745 INFO L290 TraceCheckUtils]: 79: Hoare triple {18996#(< main_~b~0 main_~c~0)} assume !(~c~0 >= ~b~0); {18822#false} is VALID [2022-04-27 13:04:10,745 INFO L290 TraceCheckUtils]: 80: Hoare triple {18822#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; {18822#false} is VALID [2022-04-27 13:04:10,745 INFO L290 TraceCheckUtils]: 81: Hoare triple {18822#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {18822#false} is VALID [2022-04-27 13:04:10,745 INFO L290 TraceCheckUtils]: 82: Hoare triple {18822#false} assume !!(#t~post6 < 50);havoc #t~post6; {18822#false} is VALID [2022-04-27 13:04:10,745 INFO L290 TraceCheckUtils]: 83: Hoare triple {18822#false} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {18822#false} is VALID [2022-04-27 13:04:10,745 INFO L290 TraceCheckUtils]: 84: Hoare triple {18822#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {18822#false} is VALID [2022-04-27 13:04:10,745 INFO L290 TraceCheckUtils]: 85: Hoare triple {18822#false} assume !!(#t~post7 < 50);havoc #t~post7; {18822#false} is VALID [2022-04-27 13:04:10,745 INFO L272 TraceCheckUtils]: 86: Hoare triple {18822#false} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {18822#false} is VALID [2022-04-27 13:04:10,745 INFO L290 TraceCheckUtils]: 87: Hoare triple {18822#false} ~cond := #in~cond; {18822#false} is VALID [2022-04-27 13:04:10,745 INFO L290 TraceCheckUtils]: 88: Hoare triple {18822#false} assume !(0 == ~cond); {18822#false} is VALID [2022-04-27 13:04:10,745 INFO L290 TraceCheckUtils]: 89: Hoare triple {18822#false} assume true; {18822#false} is VALID [2022-04-27 13:04:10,746 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {18822#false} {18822#false} #86#return; {18822#false} is VALID [2022-04-27 13:04:10,746 INFO L272 TraceCheckUtils]: 91: Hoare triple {18822#false} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {18822#false} is VALID [2022-04-27 13:04:10,746 INFO L290 TraceCheckUtils]: 92: Hoare triple {18822#false} ~cond := #in~cond; {18822#false} is VALID [2022-04-27 13:04:10,746 INFO L290 TraceCheckUtils]: 93: Hoare triple {18822#false} assume !(0 == ~cond); {18822#false} is VALID [2022-04-27 13:04:10,746 INFO L290 TraceCheckUtils]: 94: Hoare triple {18822#false} assume true; {18822#false} is VALID [2022-04-27 13:04:10,746 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {18822#false} {18822#false} #88#return; {18822#false} is VALID [2022-04-27 13:04:10,746 INFO L272 TraceCheckUtils]: 96: Hoare triple {18822#false} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {18822#false} is VALID [2022-04-27 13:04:10,746 INFO L290 TraceCheckUtils]: 97: Hoare triple {18822#false} ~cond := #in~cond; {18822#false} is VALID [2022-04-27 13:04:10,746 INFO L290 TraceCheckUtils]: 98: Hoare triple {18822#false} assume !(0 == ~cond); {18822#false} is VALID [2022-04-27 13:04:10,746 INFO L290 TraceCheckUtils]: 99: Hoare triple {18822#false} assume true; {18822#false} is VALID [2022-04-27 13:04:10,746 INFO L284 TraceCheckUtils]: 100: Hoare quadruple {18822#false} {18822#false} #90#return; {18822#false} is VALID [2022-04-27 13:04:10,746 INFO L272 TraceCheckUtils]: 101: Hoare triple {18822#false} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {18822#false} is VALID [2022-04-27 13:04:10,746 INFO L290 TraceCheckUtils]: 102: Hoare triple {18822#false} ~cond := #in~cond; {18822#false} is VALID [2022-04-27 13:04:10,746 INFO L290 TraceCheckUtils]: 103: Hoare triple {18822#false} assume 0 == ~cond; {18822#false} is VALID [2022-04-27 13:04:10,746 INFO L290 TraceCheckUtils]: 104: Hoare triple {18822#false} assume !false; {18822#false} is VALID [2022-04-27 13:04:10,747 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 141 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2022-04-27 13:04:10,747 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 13:04:10,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:04:10,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566011223] [2022-04-27 13:04:10,747 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:04:10,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [90769534] [2022-04-27 13:04:10,747 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [90769534] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:04:10,747 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:04:10,747 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 13:04:10,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780098622] [2022-04-27 13:04:10,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:04:10,748 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 3 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) Word has length 105 [2022-04-27 13:04:10,749 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:04:10,749 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 3 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2022-04-27 13:04:10,803 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:04:10,803 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 13:04:10,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:04:10,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 13:04:10,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 13:04:10,804 INFO L87 Difference]: Start difference. First operand 372 states and 462 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 3 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2022-04-27 13:04:11,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:04:11,455 INFO L93 Difference]: Finished difference Result 535 states and 713 transitions. [2022-04-27 13:04:11,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 13:04:11,456 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 3 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) Word has length 105 [2022-04-27 13:04:11,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:04:11,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 3 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2022-04-27 13:04:11,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 104 transitions. [2022-04-27 13:04:11,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 3 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2022-04-27 13:04:11,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 104 transitions. [2022-04-27 13:04:11,459 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 104 transitions. [2022-04-27 13:04:11,551 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:04:11,563 INFO L225 Difference]: With dead ends: 535 [2022-04-27 13:04:11,563 INFO L226 Difference]: Without dead ends: 417 [2022-04-27 13:04:11,564 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 102 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:04:11,564 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 12 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 13:04:11,565 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 172 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 13:04:11,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2022-04-27 13:04:11,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 387. [2022-04-27 13:04:11,937 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:04:11,937 INFO L82 GeneralOperation]: Start isEquivalent. First operand 417 states. Second operand has 387 states, 259 states have (on average 1.193050193050193) internal successors, (309), 263 states have internal predecessors, (309), 90 states have call successors, (90), 38 states have call predecessors, (90), 37 states have return successors, (88), 85 states have call predecessors, (88), 88 states have call successors, (88) [2022-04-27 13:04:11,938 INFO L74 IsIncluded]: Start isIncluded. First operand 417 states. Second operand has 387 states, 259 states have (on average 1.193050193050193) internal successors, (309), 263 states have internal predecessors, (309), 90 states have call successors, (90), 38 states have call predecessors, (90), 37 states have return successors, (88), 85 states have call predecessors, (88), 88 states have call successors, (88) [2022-04-27 13:04:11,938 INFO L87 Difference]: Start difference. First operand 417 states. Second operand has 387 states, 259 states have (on average 1.193050193050193) internal successors, (309), 263 states have internal predecessors, (309), 90 states have call successors, (90), 38 states have call predecessors, (90), 37 states have return successors, (88), 85 states have call predecessors, (88), 88 states have call successors, (88) [2022-04-27 13:04:11,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:04:11,954 INFO L93 Difference]: Finished difference Result 417 states and 535 transitions. [2022-04-27 13:04:11,954 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 535 transitions. [2022-04-27 13:04:11,956 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:04:11,956 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:04:11,956 INFO L74 IsIncluded]: Start isIncluded. First operand has 387 states, 259 states have (on average 1.193050193050193) internal successors, (309), 263 states have internal predecessors, (309), 90 states have call successors, (90), 38 states have call predecessors, (90), 37 states have return successors, (88), 85 states have call predecessors, (88), 88 states have call successors, (88) Second operand 417 states. [2022-04-27 13:04:11,957 INFO L87 Difference]: Start difference. First operand has 387 states, 259 states have (on average 1.193050193050193) internal successors, (309), 263 states have internal predecessors, (309), 90 states have call successors, (90), 38 states have call predecessors, (90), 37 states have return successors, (88), 85 states have call predecessors, (88), 88 states have call successors, (88) Second operand 417 states. [2022-04-27 13:04:11,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:04:11,969 INFO L93 Difference]: Finished difference Result 417 states and 535 transitions. [2022-04-27 13:04:11,969 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 535 transitions. [2022-04-27 13:04:11,970 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:04:11,970 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:04:11,970 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:04:11,970 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:04:11,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 387 states, 259 states have (on average 1.193050193050193) internal successors, (309), 263 states have internal predecessors, (309), 90 states have call successors, (90), 38 states have call predecessors, (90), 37 states have return successors, (88), 85 states have call predecessors, (88), 88 states have call successors, (88) [2022-04-27 13:04:11,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 487 transitions. [2022-04-27 13:04:11,983 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 487 transitions. Word has length 105 [2022-04-27 13:04:11,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:04:11,983 INFO L495 AbstractCegarLoop]: Abstraction has 387 states and 487 transitions. [2022-04-27 13:04:11,983 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 3 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2022-04-27 13:04:11,983 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 487 transitions. [2022-04-27 13:04:11,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-04-27 13:04:11,984 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:04:11,985 INFO L195 NwaCegarLoop]: trace histogram [13, 12, 12, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:04:12,014 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-04-27 13:04:12,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-04-27 13:04:12,195 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:04:12,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:04:12,196 INFO L85 PathProgramCache]: Analyzing trace with hash 1546024104, now seen corresponding path program 1 times [2022-04-27 13:04:12,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:04:12,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099652819] [2022-04-27 13:04:12,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:04:12,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:04:12,212 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:04:12,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [689277191] [2022-04-27 13:04:12,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:04:12,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:04:12,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:04:12,213 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 13:04:12,236 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-04-27 13:04:12,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:04:12,297 INFO L263 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-27 13:04:12,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:04:12,329 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:04:12,776 INFO L272 TraceCheckUtils]: 0: Hoare triple {21321#true} call ULTIMATE.init(); {21321#true} is VALID [2022-04-27 13:04:12,776 INFO L290 TraceCheckUtils]: 1: Hoare triple {21321#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);~counter~0 := 0; {21329#(<= ~counter~0 0)} is VALID [2022-04-27 13:04:12,777 INFO L290 TraceCheckUtils]: 2: Hoare triple {21329#(<= ~counter~0 0)} assume true; {21329#(<= ~counter~0 0)} is VALID [2022-04-27 13:04:12,777 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21329#(<= ~counter~0 0)} {21321#true} #98#return; {21329#(<= ~counter~0 0)} is VALID [2022-04-27 13:04:12,777 INFO L272 TraceCheckUtils]: 4: Hoare triple {21329#(<= ~counter~0 0)} call #t~ret8 := main(); {21329#(<= ~counter~0 0)} is VALID [2022-04-27 13:04:12,777 INFO L290 TraceCheckUtils]: 5: Hoare triple {21329#(<= ~counter~0 0)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {21329#(<= ~counter~0 0)} is VALID [2022-04-27 13:04:12,778 INFO L272 TraceCheckUtils]: 6: Hoare triple {21329#(<= ~counter~0 0)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {21329#(<= ~counter~0 0)} is VALID [2022-04-27 13:04:12,778 INFO L290 TraceCheckUtils]: 7: Hoare triple {21329#(<= ~counter~0 0)} ~cond := #in~cond; {21329#(<= ~counter~0 0)} is VALID [2022-04-27 13:04:12,778 INFO L290 TraceCheckUtils]: 8: Hoare triple {21329#(<= ~counter~0 0)} assume !(0 == ~cond); {21329#(<= ~counter~0 0)} is VALID [2022-04-27 13:04:12,779 INFO L290 TraceCheckUtils]: 9: Hoare triple {21329#(<= ~counter~0 0)} assume true; {21329#(<= ~counter~0 0)} is VALID [2022-04-27 13:04:12,779 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {21329#(<= ~counter~0 0)} {21329#(<= ~counter~0 0)} #78#return; {21329#(<= ~counter~0 0)} is VALID [2022-04-27 13:04:12,779 INFO L272 TraceCheckUtils]: 11: Hoare triple {21329#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {21329#(<= ~counter~0 0)} is VALID [2022-04-27 13:04:12,780 INFO L290 TraceCheckUtils]: 12: Hoare triple {21329#(<= ~counter~0 0)} ~cond := #in~cond; {21329#(<= ~counter~0 0)} is VALID [2022-04-27 13:04:12,780 INFO L290 TraceCheckUtils]: 13: Hoare triple {21329#(<= ~counter~0 0)} assume !(0 == ~cond); {21329#(<= ~counter~0 0)} is VALID [2022-04-27 13:04:12,780 INFO L290 TraceCheckUtils]: 14: Hoare triple {21329#(<= ~counter~0 0)} assume true; {21329#(<= ~counter~0 0)} is VALID [2022-04-27 13:04:12,780 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {21329#(<= ~counter~0 0)} {21329#(<= ~counter~0 0)} #80#return; {21329#(<= ~counter~0 0)} is VALID [2022-04-27 13:04:12,781 INFO L290 TraceCheckUtils]: 16: Hoare triple {21329#(<= ~counter~0 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; {21329#(<= ~counter~0 0)} is VALID [2022-04-27 13:04:12,781 INFO L272 TraceCheckUtils]: 17: Hoare triple {21329#(<= ~counter~0 0)} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {21329#(<= ~counter~0 0)} is VALID [2022-04-27 13:04:12,781 INFO L290 TraceCheckUtils]: 18: Hoare triple {21329#(<= ~counter~0 0)} ~cond := #in~cond; {21329#(<= ~counter~0 0)} is VALID [2022-04-27 13:04:12,781 INFO L290 TraceCheckUtils]: 19: Hoare triple {21329#(<= ~counter~0 0)} assume !(0 == ~cond); {21329#(<= ~counter~0 0)} is VALID [2022-04-27 13:04:12,782 INFO L290 TraceCheckUtils]: 20: Hoare triple {21329#(<= ~counter~0 0)} assume true; {21329#(<= ~counter~0 0)} is VALID [2022-04-27 13:04:12,782 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {21329#(<= ~counter~0 0)} {21329#(<= ~counter~0 0)} #82#return; {21329#(<= ~counter~0 0)} is VALID [2022-04-27 13:04:12,782 INFO L272 TraceCheckUtils]: 22: Hoare triple {21329#(<= ~counter~0 0)} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {21329#(<= ~counter~0 0)} is VALID [2022-04-27 13:04:12,783 INFO L290 TraceCheckUtils]: 23: Hoare triple {21329#(<= ~counter~0 0)} ~cond := #in~cond; {21329#(<= ~counter~0 0)} is VALID [2022-04-27 13:04:12,783 INFO L290 TraceCheckUtils]: 24: Hoare triple {21329#(<= ~counter~0 0)} assume !(0 == ~cond); {21329#(<= ~counter~0 0)} is VALID [2022-04-27 13:04:12,783 INFO L290 TraceCheckUtils]: 25: Hoare triple {21329#(<= ~counter~0 0)} assume true; {21329#(<= ~counter~0 0)} is VALID [2022-04-27 13:04:12,784 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {21329#(<= ~counter~0 0)} {21329#(<= ~counter~0 0)} #84#return; {21329#(<= ~counter~0 0)} is VALID [2022-04-27 13:04:12,784 INFO L290 TraceCheckUtils]: 27: Hoare triple {21329#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {21408#(<= ~counter~0 1)} is VALID [2022-04-27 13:04:12,784 INFO L290 TraceCheckUtils]: 28: Hoare triple {21408#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {21408#(<= ~counter~0 1)} is VALID [2022-04-27 13:04:12,785 INFO L290 TraceCheckUtils]: 29: Hoare triple {21408#(<= ~counter~0 1)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {21408#(<= ~counter~0 1)} is VALID [2022-04-27 13:04:12,785 INFO L290 TraceCheckUtils]: 30: Hoare triple {21408#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {21418#(<= ~counter~0 2)} is VALID [2022-04-27 13:04:12,785 INFO L290 TraceCheckUtils]: 31: Hoare triple {21418#(<= ~counter~0 2)} assume !!(#t~post7 < 50);havoc #t~post7; {21418#(<= ~counter~0 2)} is VALID [2022-04-27 13:04:12,786 INFO L272 TraceCheckUtils]: 32: Hoare triple {21418#(<= ~counter~0 2)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {21418#(<= ~counter~0 2)} is VALID [2022-04-27 13:04:12,786 INFO L290 TraceCheckUtils]: 33: Hoare triple {21418#(<= ~counter~0 2)} ~cond := #in~cond; {21418#(<= ~counter~0 2)} is VALID [2022-04-27 13:04:12,786 INFO L290 TraceCheckUtils]: 34: Hoare triple {21418#(<= ~counter~0 2)} assume !(0 == ~cond); {21418#(<= ~counter~0 2)} is VALID [2022-04-27 13:04:12,787 INFO L290 TraceCheckUtils]: 35: Hoare triple {21418#(<= ~counter~0 2)} assume true; {21418#(<= ~counter~0 2)} is VALID [2022-04-27 13:04:12,787 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {21418#(<= ~counter~0 2)} {21418#(<= ~counter~0 2)} #86#return; {21418#(<= ~counter~0 2)} is VALID [2022-04-27 13:04:12,788 INFO L272 TraceCheckUtils]: 37: Hoare triple {21418#(<= ~counter~0 2)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {21418#(<= ~counter~0 2)} is VALID [2022-04-27 13:04:12,788 INFO L290 TraceCheckUtils]: 38: Hoare triple {21418#(<= ~counter~0 2)} ~cond := #in~cond; {21418#(<= ~counter~0 2)} is VALID [2022-04-27 13:04:12,788 INFO L290 TraceCheckUtils]: 39: Hoare triple {21418#(<= ~counter~0 2)} assume !(0 == ~cond); {21418#(<= ~counter~0 2)} is VALID [2022-04-27 13:04:12,788 INFO L290 TraceCheckUtils]: 40: Hoare triple {21418#(<= ~counter~0 2)} assume true; {21418#(<= ~counter~0 2)} is VALID [2022-04-27 13:04:12,789 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {21418#(<= ~counter~0 2)} {21418#(<= ~counter~0 2)} #88#return; {21418#(<= ~counter~0 2)} is VALID [2022-04-27 13:04:12,789 INFO L272 TraceCheckUtils]: 42: Hoare triple {21418#(<= ~counter~0 2)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {21418#(<= ~counter~0 2)} is VALID [2022-04-27 13:04:12,789 INFO L290 TraceCheckUtils]: 43: Hoare triple {21418#(<= ~counter~0 2)} ~cond := #in~cond; {21418#(<= ~counter~0 2)} is VALID [2022-04-27 13:04:12,790 INFO L290 TraceCheckUtils]: 44: Hoare triple {21418#(<= ~counter~0 2)} assume !(0 == ~cond); {21418#(<= ~counter~0 2)} is VALID [2022-04-27 13:04:12,790 INFO L290 TraceCheckUtils]: 45: Hoare triple {21418#(<= ~counter~0 2)} assume true; {21418#(<= ~counter~0 2)} is VALID [2022-04-27 13:04:12,790 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {21418#(<= ~counter~0 2)} {21418#(<= ~counter~0 2)} #90#return; {21418#(<= ~counter~0 2)} is VALID [2022-04-27 13:04:12,791 INFO L272 TraceCheckUtils]: 47: Hoare triple {21418#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {21418#(<= ~counter~0 2)} is VALID [2022-04-27 13:04:12,791 INFO L290 TraceCheckUtils]: 48: Hoare triple {21418#(<= ~counter~0 2)} ~cond := #in~cond; {21418#(<= ~counter~0 2)} is VALID [2022-04-27 13:04:12,792 INFO L290 TraceCheckUtils]: 49: Hoare triple {21418#(<= ~counter~0 2)} assume !(0 == ~cond); {21418#(<= ~counter~0 2)} is VALID [2022-04-27 13:04:12,792 INFO L290 TraceCheckUtils]: 50: Hoare triple {21418#(<= ~counter~0 2)} assume true; {21418#(<= ~counter~0 2)} is VALID [2022-04-27 13:04:12,792 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {21418#(<= ~counter~0 2)} {21418#(<= ~counter~0 2)} #92#return; {21418#(<= ~counter~0 2)} is VALID [2022-04-27 13:04:12,793 INFO L290 TraceCheckUtils]: 52: Hoare triple {21418#(<= ~counter~0 2)} assume !(~c~0 >= ~b~0); {21418#(<= ~counter~0 2)} is VALID [2022-04-27 13:04:12,793 INFO L290 TraceCheckUtils]: 53: Hoare triple {21418#(<= ~counter~0 2)} ~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; {21418#(<= ~counter~0 2)} is VALID [2022-04-27 13:04:12,793 INFO L290 TraceCheckUtils]: 54: Hoare triple {21418#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {21491#(<= ~counter~0 3)} is VALID [2022-04-27 13:04:12,793 INFO L290 TraceCheckUtils]: 55: Hoare triple {21491#(<= ~counter~0 3)} assume !!(#t~post6 < 50);havoc #t~post6; {21491#(<= ~counter~0 3)} is VALID [2022-04-27 13:04:12,794 INFO L290 TraceCheckUtils]: 56: Hoare triple {21491#(<= ~counter~0 3)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {21491#(<= ~counter~0 3)} is VALID [2022-04-27 13:04:12,794 INFO L290 TraceCheckUtils]: 57: Hoare triple {21491#(<= ~counter~0 3)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {21501#(<= ~counter~0 4)} is VALID [2022-04-27 13:04:12,794 INFO L290 TraceCheckUtils]: 58: Hoare triple {21501#(<= ~counter~0 4)} assume !!(#t~post7 < 50);havoc #t~post7; {21501#(<= ~counter~0 4)} is VALID [2022-04-27 13:04:12,795 INFO L272 TraceCheckUtils]: 59: Hoare triple {21501#(<= ~counter~0 4)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {21501#(<= ~counter~0 4)} is VALID [2022-04-27 13:04:12,795 INFO L290 TraceCheckUtils]: 60: Hoare triple {21501#(<= ~counter~0 4)} ~cond := #in~cond; {21501#(<= ~counter~0 4)} is VALID [2022-04-27 13:04:12,795 INFO L290 TraceCheckUtils]: 61: Hoare triple {21501#(<= ~counter~0 4)} assume !(0 == ~cond); {21501#(<= ~counter~0 4)} is VALID [2022-04-27 13:04:12,796 INFO L290 TraceCheckUtils]: 62: Hoare triple {21501#(<= ~counter~0 4)} assume true; {21501#(<= ~counter~0 4)} is VALID [2022-04-27 13:04:12,796 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {21501#(<= ~counter~0 4)} {21501#(<= ~counter~0 4)} #86#return; {21501#(<= ~counter~0 4)} is VALID [2022-04-27 13:04:12,797 INFO L272 TraceCheckUtils]: 64: Hoare triple {21501#(<= ~counter~0 4)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {21501#(<= ~counter~0 4)} is VALID [2022-04-27 13:04:12,797 INFO L290 TraceCheckUtils]: 65: Hoare triple {21501#(<= ~counter~0 4)} ~cond := #in~cond; {21501#(<= ~counter~0 4)} is VALID [2022-04-27 13:04:12,797 INFO L290 TraceCheckUtils]: 66: Hoare triple {21501#(<= ~counter~0 4)} assume !(0 == ~cond); {21501#(<= ~counter~0 4)} is VALID [2022-04-27 13:04:12,797 INFO L290 TraceCheckUtils]: 67: Hoare triple {21501#(<= ~counter~0 4)} assume true; {21501#(<= ~counter~0 4)} is VALID [2022-04-27 13:04:12,798 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {21501#(<= ~counter~0 4)} {21501#(<= ~counter~0 4)} #88#return; {21501#(<= ~counter~0 4)} is VALID [2022-04-27 13:04:12,798 INFO L272 TraceCheckUtils]: 69: Hoare triple {21501#(<= ~counter~0 4)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {21501#(<= ~counter~0 4)} is VALID [2022-04-27 13:04:12,798 INFO L290 TraceCheckUtils]: 70: Hoare triple {21501#(<= ~counter~0 4)} ~cond := #in~cond; {21501#(<= ~counter~0 4)} is VALID [2022-04-27 13:04:12,799 INFO L290 TraceCheckUtils]: 71: Hoare triple {21501#(<= ~counter~0 4)} assume !(0 == ~cond); {21501#(<= ~counter~0 4)} is VALID [2022-04-27 13:04:12,799 INFO L290 TraceCheckUtils]: 72: Hoare triple {21501#(<= ~counter~0 4)} assume true; {21501#(<= ~counter~0 4)} is VALID [2022-04-27 13:04:12,799 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {21501#(<= ~counter~0 4)} {21501#(<= ~counter~0 4)} #90#return; {21501#(<= ~counter~0 4)} is VALID [2022-04-27 13:04:12,800 INFO L272 TraceCheckUtils]: 74: Hoare triple {21501#(<= ~counter~0 4)} 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)); {21501#(<= ~counter~0 4)} is VALID [2022-04-27 13:04:12,800 INFO L290 TraceCheckUtils]: 75: Hoare triple {21501#(<= ~counter~0 4)} ~cond := #in~cond; {21501#(<= ~counter~0 4)} is VALID [2022-04-27 13:04:12,800 INFO L290 TraceCheckUtils]: 76: Hoare triple {21501#(<= ~counter~0 4)} assume !(0 == ~cond); {21501#(<= ~counter~0 4)} is VALID [2022-04-27 13:04:12,801 INFO L290 TraceCheckUtils]: 77: Hoare triple {21501#(<= ~counter~0 4)} assume true; {21501#(<= ~counter~0 4)} is VALID [2022-04-27 13:04:12,801 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {21501#(<= ~counter~0 4)} {21501#(<= ~counter~0 4)} #92#return; {21501#(<= ~counter~0 4)} is VALID [2022-04-27 13:04:12,802 INFO L290 TraceCheckUtils]: 79: Hoare triple {21501#(<= ~counter~0 4)} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {21501#(<= ~counter~0 4)} is VALID [2022-04-27 13:04:12,802 INFO L290 TraceCheckUtils]: 80: Hoare triple {21501#(<= ~counter~0 4)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {21571#(<= ~counter~0 5)} is VALID [2022-04-27 13:04:12,802 INFO L290 TraceCheckUtils]: 81: Hoare triple {21571#(<= ~counter~0 5)} assume !!(#t~post7 < 50);havoc #t~post7; {21571#(<= ~counter~0 5)} is VALID [2022-04-27 13:04:12,803 INFO L272 TraceCheckUtils]: 82: Hoare triple {21571#(<= ~counter~0 5)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {21571#(<= ~counter~0 5)} is VALID [2022-04-27 13:04:12,803 INFO L290 TraceCheckUtils]: 83: Hoare triple {21571#(<= ~counter~0 5)} ~cond := #in~cond; {21571#(<= ~counter~0 5)} is VALID [2022-04-27 13:04:12,803 INFO L290 TraceCheckUtils]: 84: Hoare triple {21571#(<= ~counter~0 5)} assume !(0 == ~cond); {21571#(<= ~counter~0 5)} is VALID [2022-04-27 13:04:12,803 INFO L290 TraceCheckUtils]: 85: Hoare triple {21571#(<= ~counter~0 5)} assume true; {21571#(<= ~counter~0 5)} is VALID [2022-04-27 13:04:12,804 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {21571#(<= ~counter~0 5)} {21571#(<= ~counter~0 5)} #86#return; {21571#(<= ~counter~0 5)} is VALID [2022-04-27 13:04:12,804 INFO L272 TraceCheckUtils]: 87: Hoare triple {21571#(<= ~counter~0 5)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {21571#(<= ~counter~0 5)} is VALID [2022-04-27 13:04:12,805 INFO L290 TraceCheckUtils]: 88: Hoare triple {21571#(<= ~counter~0 5)} ~cond := #in~cond; {21571#(<= ~counter~0 5)} is VALID [2022-04-27 13:04:12,805 INFO L290 TraceCheckUtils]: 89: Hoare triple {21571#(<= ~counter~0 5)} assume !(0 == ~cond); {21571#(<= ~counter~0 5)} is VALID [2022-04-27 13:04:12,805 INFO L290 TraceCheckUtils]: 90: Hoare triple {21571#(<= ~counter~0 5)} assume true; {21571#(<= ~counter~0 5)} is VALID [2022-04-27 13:04:12,806 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {21571#(<= ~counter~0 5)} {21571#(<= ~counter~0 5)} #88#return; {21571#(<= ~counter~0 5)} is VALID [2022-04-27 13:04:12,806 INFO L272 TraceCheckUtils]: 92: Hoare triple {21571#(<= ~counter~0 5)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {21571#(<= ~counter~0 5)} is VALID [2022-04-27 13:04:12,806 INFO L290 TraceCheckUtils]: 93: Hoare triple {21571#(<= ~counter~0 5)} ~cond := #in~cond; {21571#(<= ~counter~0 5)} is VALID [2022-04-27 13:04:12,807 INFO L290 TraceCheckUtils]: 94: Hoare triple {21571#(<= ~counter~0 5)} assume !(0 == ~cond); {21571#(<= ~counter~0 5)} is VALID [2022-04-27 13:04:12,807 INFO L290 TraceCheckUtils]: 95: Hoare triple {21571#(<= ~counter~0 5)} assume true; {21571#(<= ~counter~0 5)} is VALID [2022-04-27 13:04:12,807 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {21571#(<= ~counter~0 5)} {21571#(<= ~counter~0 5)} #90#return; {21571#(<= ~counter~0 5)} is VALID [2022-04-27 13:04:12,808 INFO L272 TraceCheckUtils]: 97: Hoare triple {21571#(<= ~counter~0 5)} 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)); {21571#(<= ~counter~0 5)} is VALID [2022-04-27 13:04:12,809 INFO L290 TraceCheckUtils]: 98: Hoare triple {21571#(<= ~counter~0 5)} ~cond := #in~cond; {21571#(<= ~counter~0 5)} is VALID [2022-04-27 13:04:12,809 INFO L290 TraceCheckUtils]: 99: Hoare triple {21571#(<= ~counter~0 5)} assume !(0 == ~cond); {21571#(<= ~counter~0 5)} is VALID [2022-04-27 13:04:12,809 INFO L290 TraceCheckUtils]: 100: Hoare triple {21571#(<= ~counter~0 5)} assume true; {21571#(<= ~counter~0 5)} is VALID [2022-04-27 13:04:12,810 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {21571#(<= ~counter~0 5)} {21571#(<= ~counter~0 5)} #92#return; {21571#(<= ~counter~0 5)} is VALID [2022-04-27 13:04:12,810 INFO L290 TraceCheckUtils]: 102: Hoare triple {21571#(<= ~counter~0 5)} assume !(~c~0 >= ~b~0); {21571#(<= ~counter~0 5)} is VALID [2022-04-27 13:04:12,810 INFO L290 TraceCheckUtils]: 103: Hoare triple {21571#(<= ~counter~0 5)} ~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; {21571#(<= ~counter~0 5)} is VALID [2022-04-27 13:04:12,811 INFO L290 TraceCheckUtils]: 104: Hoare triple {21571#(<= ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {21644#(<= ~counter~0 6)} is VALID [2022-04-27 13:04:12,811 INFO L290 TraceCheckUtils]: 105: Hoare triple {21644#(<= ~counter~0 6)} assume !!(#t~post6 < 50);havoc #t~post6; {21644#(<= ~counter~0 6)} is VALID [2022-04-27 13:04:12,815 INFO L290 TraceCheckUtils]: 106: Hoare triple {21644#(<= ~counter~0 6)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {21644#(<= ~counter~0 6)} is VALID [2022-04-27 13:04:12,815 INFO L290 TraceCheckUtils]: 107: Hoare triple {21644#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {21654#(<= |main_#t~post7| 6)} is VALID [2022-04-27 13:04:12,816 INFO L290 TraceCheckUtils]: 108: Hoare triple {21654#(<= |main_#t~post7| 6)} assume !(#t~post7 < 50);havoc #t~post7; {21322#false} is VALID [2022-04-27 13:04:12,816 INFO L290 TraceCheckUtils]: 109: Hoare triple {21322#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; {21322#false} is VALID [2022-04-27 13:04:12,816 INFO L290 TraceCheckUtils]: 110: Hoare triple {21322#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {21322#false} is VALID [2022-04-27 13:04:12,816 INFO L290 TraceCheckUtils]: 111: Hoare triple {21322#false} assume !(#t~post6 < 50);havoc #t~post6; {21322#false} is VALID [2022-04-27 13:04:12,816 INFO L272 TraceCheckUtils]: 112: Hoare triple {21322#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {21322#false} is VALID [2022-04-27 13:04:12,816 INFO L290 TraceCheckUtils]: 113: Hoare triple {21322#false} ~cond := #in~cond; {21322#false} is VALID [2022-04-27 13:04:12,816 INFO L290 TraceCheckUtils]: 114: Hoare triple {21322#false} assume 0 == ~cond; {21322#false} is VALID [2022-04-27 13:04:12,816 INFO L290 TraceCheckUtils]: 115: Hoare triple {21322#false} assume !false; {21322#false} is VALID [2022-04-27 13:04:12,817 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 32 proven. 229 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2022-04-27 13:04:12,817 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:04:13,305 INFO L290 TraceCheckUtils]: 115: Hoare triple {21322#false} assume !false; {21322#false} is VALID [2022-04-27 13:04:13,306 INFO L290 TraceCheckUtils]: 114: Hoare triple {21322#false} assume 0 == ~cond; {21322#false} is VALID [2022-04-27 13:04:13,306 INFO L290 TraceCheckUtils]: 113: Hoare triple {21322#false} ~cond := #in~cond; {21322#false} is VALID [2022-04-27 13:04:13,306 INFO L272 TraceCheckUtils]: 112: Hoare triple {21322#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {21322#false} is VALID [2022-04-27 13:04:13,306 INFO L290 TraceCheckUtils]: 111: Hoare triple {21322#false} assume !(#t~post6 < 50);havoc #t~post6; {21322#false} is VALID [2022-04-27 13:04:13,306 INFO L290 TraceCheckUtils]: 110: Hoare triple {21322#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {21322#false} is VALID [2022-04-27 13:04:13,306 INFO L290 TraceCheckUtils]: 109: Hoare triple {21322#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; {21322#false} is VALID [2022-04-27 13:04:13,306 INFO L290 TraceCheckUtils]: 108: Hoare triple {21700#(< |main_#t~post7| 50)} assume !(#t~post7 < 50);havoc #t~post7; {21322#false} is VALID [2022-04-27 13:04:13,307 INFO L290 TraceCheckUtils]: 107: Hoare triple {21704#(< ~counter~0 50)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {21700#(< |main_#t~post7| 50)} is VALID [2022-04-27 13:04:13,307 INFO L290 TraceCheckUtils]: 106: Hoare triple {21704#(< ~counter~0 50)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {21704#(< ~counter~0 50)} is VALID [2022-04-27 13:04:13,307 INFO L290 TraceCheckUtils]: 105: Hoare triple {21704#(< ~counter~0 50)} assume !!(#t~post6 < 50);havoc #t~post6; {21704#(< ~counter~0 50)} is VALID [2022-04-27 13:04:13,308 INFO L290 TraceCheckUtils]: 104: Hoare triple {21714#(< ~counter~0 49)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {21704#(< ~counter~0 50)} is VALID [2022-04-27 13:04:13,308 INFO L290 TraceCheckUtils]: 103: Hoare triple {21714#(< ~counter~0 49)} ~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; {21714#(< ~counter~0 49)} is VALID [2022-04-27 13:04:13,309 INFO L290 TraceCheckUtils]: 102: Hoare triple {21714#(< ~counter~0 49)} assume !(~c~0 >= ~b~0); {21714#(< ~counter~0 49)} is VALID [2022-04-27 13:04:13,309 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {21321#true} {21714#(< ~counter~0 49)} #92#return; {21714#(< ~counter~0 49)} is VALID [2022-04-27 13:04:13,310 INFO L290 TraceCheckUtils]: 100: Hoare triple {21321#true} assume true; {21321#true} is VALID [2022-04-27 13:04:13,310 INFO L290 TraceCheckUtils]: 99: Hoare triple {21321#true} assume !(0 == ~cond); {21321#true} is VALID [2022-04-27 13:04:13,310 INFO L290 TraceCheckUtils]: 98: Hoare triple {21321#true} ~cond := #in~cond; {21321#true} is VALID [2022-04-27 13:04:13,310 INFO L272 TraceCheckUtils]: 97: Hoare triple {21714#(< ~counter~0 49)} 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)); {21321#true} is VALID [2022-04-27 13:04:13,310 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {21321#true} {21714#(< ~counter~0 49)} #90#return; {21714#(< ~counter~0 49)} is VALID [2022-04-27 13:04:13,310 INFO L290 TraceCheckUtils]: 95: Hoare triple {21321#true} assume true; {21321#true} is VALID [2022-04-27 13:04:13,311 INFO L290 TraceCheckUtils]: 94: Hoare triple {21321#true} assume !(0 == ~cond); {21321#true} is VALID [2022-04-27 13:04:13,311 INFO L290 TraceCheckUtils]: 93: Hoare triple {21321#true} ~cond := #in~cond; {21321#true} is VALID [2022-04-27 13:04:13,311 INFO L272 TraceCheckUtils]: 92: Hoare triple {21714#(< ~counter~0 49)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {21321#true} is VALID [2022-04-27 13:04:13,311 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {21321#true} {21714#(< ~counter~0 49)} #88#return; {21714#(< ~counter~0 49)} is VALID [2022-04-27 13:04:13,311 INFO L290 TraceCheckUtils]: 90: Hoare triple {21321#true} assume true; {21321#true} is VALID [2022-04-27 13:04:13,311 INFO L290 TraceCheckUtils]: 89: Hoare triple {21321#true} assume !(0 == ~cond); {21321#true} is VALID [2022-04-27 13:04:13,312 INFO L290 TraceCheckUtils]: 88: Hoare triple {21321#true} ~cond := #in~cond; {21321#true} is VALID [2022-04-27 13:04:13,312 INFO L272 TraceCheckUtils]: 87: Hoare triple {21714#(< ~counter~0 49)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {21321#true} is VALID [2022-04-27 13:04:13,312 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {21321#true} {21714#(< ~counter~0 49)} #86#return; {21714#(< ~counter~0 49)} is VALID [2022-04-27 13:04:13,312 INFO L290 TraceCheckUtils]: 85: Hoare triple {21321#true} assume true; {21321#true} is VALID [2022-04-27 13:04:13,312 INFO L290 TraceCheckUtils]: 84: Hoare triple {21321#true} assume !(0 == ~cond); {21321#true} is VALID [2022-04-27 13:04:13,312 INFO L290 TraceCheckUtils]: 83: Hoare triple {21321#true} ~cond := #in~cond; {21321#true} is VALID [2022-04-27 13:04:13,313 INFO L272 TraceCheckUtils]: 82: Hoare triple {21714#(< ~counter~0 49)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {21321#true} is VALID [2022-04-27 13:04:13,313 INFO L290 TraceCheckUtils]: 81: Hoare triple {21714#(< ~counter~0 49)} assume !!(#t~post7 < 50);havoc #t~post7; {21714#(< ~counter~0 49)} is VALID [2022-04-27 13:04:13,313 INFO L290 TraceCheckUtils]: 80: Hoare triple {21787#(< ~counter~0 48)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {21714#(< ~counter~0 49)} is VALID [2022-04-27 13:04:13,314 INFO L290 TraceCheckUtils]: 79: Hoare triple {21787#(< ~counter~0 48)} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {21787#(< ~counter~0 48)} is VALID [2022-04-27 13:04:13,315 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {21321#true} {21787#(< ~counter~0 48)} #92#return; {21787#(< ~counter~0 48)} is VALID [2022-04-27 13:04:13,315 INFO L290 TraceCheckUtils]: 77: Hoare triple {21321#true} assume true; {21321#true} is VALID [2022-04-27 13:04:13,315 INFO L290 TraceCheckUtils]: 76: Hoare triple {21321#true} assume !(0 == ~cond); {21321#true} is VALID [2022-04-27 13:04:13,315 INFO L290 TraceCheckUtils]: 75: Hoare triple {21321#true} ~cond := #in~cond; {21321#true} is VALID [2022-04-27 13:04:13,315 INFO L272 TraceCheckUtils]: 74: Hoare triple {21787#(< ~counter~0 48)} 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)); {21321#true} is VALID [2022-04-27 13:04:13,316 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {21321#true} {21787#(< ~counter~0 48)} #90#return; {21787#(< ~counter~0 48)} is VALID [2022-04-27 13:04:13,316 INFO L290 TraceCheckUtils]: 72: Hoare triple {21321#true} assume true; {21321#true} is VALID [2022-04-27 13:04:13,316 INFO L290 TraceCheckUtils]: 71: Hoare triple {21321#true} assume !(0 == ~cond); {21321#true} is VALID [2022-04-27 13:04:13,316 INFO L290 TraceCheckUtils]: 70: Hoare triple {21321#true} ~cond := #in~cond; {21321#true} is VALID [2022-04-27 13:04:13,316 INFO L272 TraceCheckUtils]: 69: Hoare triple {21787#(< ~counter~0 48)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {21321#true} is VALID [2022-04-27 13:04:13,317 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {21321#true} {21787#(< ~counter~0 48)} #88#return; {21787#(< ~counter~0 48)} is VALID [2022-04-27 13:04:13,317 INFO L290 TraceCheckUtils]: 67: Hoare triple {21321#true} assume true; {21321#true} is VALID [2022-04-27 13:04:13,317 INFO L290 TraceCheckUtils]: 66: Hoare triple {21321#true} assume !(0 == ~cond); {21321#true} is VALID [2022-04-27 13:04:13,317 INFO L290 TraceCheckUtils]: 65: Hoare triple {21321#true} ~cond := #in~cond; {21321#true} is VALID [2022-04-27 13:04:13,317 INFO L272 TraceCheckUtils]: 64: Hoare triple {21787#(< ~counter~0 48)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {21321#true} is VALID [2022-04-27 13:04:13,318 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {21321#true} {21787#(< ~counter~0 48)} #86#return; {21787#(< ~counter~0 48)} is VALID [2022-04-27 13:04:13,318 INFO L290 TraceCheckUtils]: 62: Hoare triple {21321#true} assume true; {21321#true} is VALID [2022-04-27 13:04:13,318 INFO L290 TraceCheckUtils]: 61: Hoare triple {21321#true} assume !(0 == ~cond); {21321#true} is VALID [2022-04-27 13:04:13,318 INFO L290 TraceCheckUtils]: 60: Hoare triple {21321#true} ~cond := #in~cond; {21321#true} is VALID [2022-04-27 13:04:13,318 INFO L272 TraceCheckUtils]: 59: Hoare triple {21787#(< ~counter~0 48)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {21321#true} is VALID [2022-04-27 13:04:13,318 INFO L290 TraceCheckUtils]: 58: Hoare triple {21787#(< ~counter~0 48)} assume !!(#t~post7 < 50);havoc #t~post7; {21787#(< ~counter~0 48)} is VALID [2022-04-27 13:04:13,319 INFO L290 TraceCheckUtils]: 57: Hoare triple {21857#(< ~counter~0 47)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {21787#(< ~counter~0 48)} is VALID [2022-04-27 13:04:13,319 INFO L290 TraceCheckUtils]: 56: Hoare triple {21857#(< ~counter~0 47)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {21857#(< ~counter~0 47)} is VALID [2022-04-27 13:04:13,320 INFO L290 TraceCheckUtils]: 55: Hoare triple {21857#(< ~counter~0 47)} assume !!(#t~post6 < 50);havoc #t~post6; {21857#(< ~counter~0 47)} is VALID [2022-04-27 13:04:13,320 INFO L290 TraceCheckUtils]: 54: Hoare triple {21867#(< ~counter~0 46)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {21857#(< ~counter~0 47)} is VALID [2022-04-27 13:04:13,321 INFO L290 TraceCheckUtils]: 53: Hoare triple {21867#(< ~counter~0 46)} ~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; {21867#(< ~counter~0 46)} is VALID [2022-04-27 13:04:13,321 INFO L290 TraceCheckUtils]: 52: Hoare triple {21867#(< ~counter~0 46)} assume !(~c~0 >= ~b~0); {21867#(< ~counter~0 46)} is VALID [2022-04-27 13:04:13,322 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {21321#true} {21867#(< ~counter~0 46)} #92#return; {21867#(< ~counter~0 46)} is VALID [2022-04-27 13:04:13,322 INFO L290 TraceCheckUtils]: 50: Hoare triple {21321#true} assume true; {21321#true} is VALID [2022-04-27 13:04:13,322 INFO L290 TraceCheckUtils]: 49: Hoare triple {21321#true} assume !(0 == ~cond); {21321#true} is VALID [2022-04-27 13:04:13,322 INFO L290 TraceCheckUtils]: 48: Hoare triple {21321#true} ~cond := #in~cond; {21321#true} is VALID [2022-04-27 13:04:13,322 INFO L272 TraceCheckUtils]: 47: Hoare triple {21867#(< ~counter~0 46)} 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)); {21321#true} is VALID [2022-04-27 13:04:13,323 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {21321#true} {21867#(< ~counter~0 46)} #90#return; {21867#(< ~counter~0 46)} is VALID [2022-04-27 13:04:13,323 INFO L290 TraceCheckUtils]: 45: Hoare triple {21321#true} assume true; {21321#true} is VALID [2022-04-27 13:04:13,323 INFO L290 TraceCheckUtils]: 44: Hoare triple {21321#true} assume !(0 == ~cond); {21321#true} is VALID [2022-04-27 13:04:13,323 INFO L290 TraceCheckUtils]: 43: Hoare triple {21321#true} ~cond := #in~cond; {21321#true} is VALID [2022-04-27 13:04:13,323 INFO L272 TraceCheckUtils]: 42: Hoare triple {21867#(< ~counter~0 46)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {21321#true} is VALID [2022-04-27 13:04:13,324 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {21321#true} {21867#(< ~counter~0 46)} #88#return; {21867#(< ~counter~0 46)} is VALID [2022-04-27 13:04:13,324 INFO L290 TraceCheckUtils]: 40: Hoare triple {21321#true} assume true; {21321#true} is VALID [2022-04-27 13:04:13,324 INFO L290 TraceCheckUtils]: 39: Hoare triple {21321#true} assume !(0 == ~cond); {21321#true} is VALID [2022-04-27 13:04:13,324 INFO L290 TraceCheckUtils]: 38: Hoare triple {21321#true} ~cond := #in~cond; {21321#true} is VALID [2022-04-27 13:04:13,324 INFO L272 TraceCheckUtils]: 37: Hoare triple {21867#(< ~counter~0 46)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {21321#true} is VALID [2022-04-27 13:04:13,325 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {21321#true} {21867#(< ~counter~0 46)} #86#return; {21867#(< ~counter~0 46)} is VALID [2022-04-27 13:04:13,325 INFO L290 TraceCheckUtils]: 35: Hoare triple {21321#true} assume true; {21321#true} is VALID [2022-04-27 13:04:13,325 INFO L290 TraceCheckUtils]: 34: Hoare triple {21321#true} assume !(0 == ~cond); {21321#true} is VALID [2022-04-27 13:04:13,325 INFO L290 TraceCheckUtils]: 33: Hoare triple {21321#true} ~cond := #in~cond; {21321#true} is VALID [2022-04-27 13:04:13,325 INFO L272 TraceCheckUtils]: 32: Hoare triple {21867#(< ~counter~0 46)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {21321#true} is VALID [2022-04-27 13:04:13,326 INFO L290 TraceCheckUtils]: 31: Hoare triple {21867#(< ~counter~0 46)} assume !!(#t~post7 < 50);havoc #t~post7; {21867#(< ~counter~0 46)} is VALID [2022-04-27 13:04:13,326 INFO L290 TraceCheckUtils]: 30: Hoare triple {21940#(< ~counter~0 45)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {21867#(< ~counter~0 46)} is VALID [2022-04-27 13:04:13,327 INFO L290 TraceCheckUtils]: 29: Hoare triple {21940#(< ~counter~0 45)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {21940#(< ~counter~0 45)} is VALID [2022-04-27 13:04:13,327 INFO L290 TraceCheckUtils]: 28: Hoare triple {21940#(< ~counter~0 45)} assume !!(#t~post6 < 50);havoc #t~post6; {21940#(< ~counter~0 45)} is VALID [2022-04-27 13:04:13,328 INFO L290 TraceCheckUtils]: 27: Hoare triple {21950#(< ~counter~0 44)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {21940#(< ~counter~0 45)} is VALID [2022-04-27 13:04:13,328 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {21321#true} {21950#(< ~counter~0 44)} #84#return; {21950#(< ~counter~0 44)} is VALID [2022-04-27 13:04:13,328 INFO L290 TraceCheckUtils]: 25: Hoare triple {21321#true} assume true; {21321#true} is VALID [2022-04-27 13:04:13,328 INFO L290 TraceCheckUtils]: 24: Hoare triple {21321#true} assume !(0 == ~cond); {21321#true} is VALID [2022-04-27 13:04:13,328 INFO L290 TraceCheckUtils]: 23: Hoare triple {21321#true} ~cond := #in~cond; {21321#true} is VALID [2022-04-27 13:04:13,328 INFO L272 TraceCheckUtils]: 22: Hoare triple {21950#(< ~counter~0 44)} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {21321#true} is VALID [2022-04-27 13:04:13,329 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {21321#true} {21950#(< ~counter~0 44)} #82#return; {21950#(< ~counter~0 44)} is VALID [2022-04-27 13:04:13,329 INFO L290 TraceCheckUtils]: 20: Hoare triple {21321#true} assume true; {21321#true} is VALID [2022-04-27 13:04:13,329 INFO L290 TraceCheckUtils]: 19: Hoare triple {21321#true} assume !(0 == ~cond); {21321#true} is VALID [2022-04-27 13:04:13,329 INFO L290 TraceCheckUtils]: 18: Hoare triple {21321#true} ~cond := #in~cond; {21321#true} is VALID [2022-04-27 13:04:13,329 INFO L272 TraceCheckUtils]: 17: Hoare triple {21950#(< ~counter~0 44)} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {21321#true} is VALID [2022-04-27 13:04:13,329 INFO L290 TraceCheckUtils]: 16: Hoare triple {21950#(< ~counter~0 44)} ~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; {21950#(< ~counter~0 44)} is VALID [2022-04-27 13:04:13,330 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {21321#true} {21950#(< ~counter~0 44)} #80#return; {21950#(< ~counter~0 44)} is VALID [2022-04-27 13:04:13,330 INFO L290 TraceCheckUtils]: 14: Hoare triple {21321#true} assume true; {21321#true} is VALID [2022-04-27 13:04:13,330 INFO L290 TraceCheckUtils]: 13: Hoare triple {21321#true} assume !(0 == ~cond); {21321#true} is VALID [2022-04-27 13:04:13,330 INFO L290 TraceCheckUtils]: 12: Hoare triple {21321#true} ~cond := #in~cond; {21321#true} is VALID [2022-04-27 13:04:13,330 INFO L272 TraceCheckUtils]: 11: Hoare triple {21950#(< ~counter~0 44)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {21321#true} is VALID [2022-04-27 13:04:13,331 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {21321#true} {21950#(< ~counter~0 44)} #78#return; {21950#(< ~counter~0 44)} is VALID [2022-04-27 13:04:13,331 INFO L290 TraceCheckUtils]: 9: Hoare triple {21321#true} assume true; {21321#true} is VALID [2022-04-27 13:04:13,331 INFO L290 TraceCheckUtils]: 8: Hoare triple {21321#true} assume !(0 == ~cond); {21321#true} is VALID [2022-04-27 13:04:13,331 INFO L290 TraceCheckUtils]: 7: Hoare triple {21321#true} ~cond := #in~cond; {21321#true} is VALID [2022-04-27 13:04:13,331 INFO L272 TraceCheckUtils]: 6: Hoare triple {21950#(< ~counter~0 44)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {21321#true} is VALID [2022-04-27 13:04:13,331 INFO L290 TraceCheckUtils]: 5: Hoare triple {21950#(< ~counter~0 44)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {21950#(< ~counter~0 44)} is VALID [2022-04-27 13:04:13,332 INFO L272 TraceCheckUtils]: 4: Hoare triple {21950#(< ~counter~0 44)} call #t~ret8 := main(); {21950#(< ~counter~0 44)} is VALID [2022-04-27 13:04:13,332 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21950#(< ~counter~0 44)} {21321#true} #98#return; {21950#(< ~counter~0 44)} is VALID [2022-04-27 13:04:13,332 INFO L290 TraceCheckUtils]: 2: Hoare triple {21950#(< ~counter~0 44)} assume true; {21950#(< ~counter~0 44)} is VALID [2022-04-27 13:04:13,333 INFO L290 TraceCheckUtils]: 1: Hoare triple {21321#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);~counter~0 := 0; {21950#(< ~counter~0 44)} is VALID [2022-04-27 13:04:13,333 INFO L272 TraceCheckUtils]: 0: Hoare triple {21321#true} call ULTIMATE.init(); {21321#true} is VALID [2022-04-27 13:04:13,333 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 32 proven. 37 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2022-04-27 13:04:13,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:04:13,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099652819] [2022-04-27 13:04:13,334 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:04:13,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [689277191] [2022-04-27 13:04:13,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [689277191] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 13:04:13,334 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 13:04:13,334 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2022-04-27 13:04:13,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060937136] [2022-04-27 13:04:13,334 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 13:04:13,335 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.222222222222222) internal successors, (76), 18 states have internal predecessors, (76), 10 states have call successors, (36), 7 states have call predecessors, (36), 6 states have return successors, (34), 8 states have call predecessors, (34), 9 states have call successors, (34) Word has length 116 [2022-04-27 13:04:13,335 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:04:13,335 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 4.222222222222222) internal successors, (76), 18 states have internal predecessors, (76), 10 states have call successors, (36), 7 states have call predecessors, (36), 6 states have return successors, (34), 8 states have call predecessors, (34), 9 states have call successors, (34) [2022-04-27 13:04:13,480 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 146 edges. 146 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:04:13,480 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-27 13:04:13,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:04:13,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-27 13:04:13,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2022-04-27 13:04:13,481 INFO L87 Difference]: Start difference. First operand 387 states and 487 transitions. Second operand has 18 states, 18 states have (on average 4.222222222222222) internal successors, (76), 18 states have internal predecessors, (76), 10 states have call successors, (36), 7 states have call predecessors, (36), 6 states have return successors, (34), 8 states have call predecessors, (34), 9 states have call successors, (34) [2022-04-27 13:04:16,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:04:16,390 INFO L93 Difference]: Finished difference Result 1393 states and 1817 transitions. [2022-04-27 13:04:16,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-04-27 13:04:16,391 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.222222222222222) internal successors, (76), 18 states have internal predecessors, (76), 10 states have call successors, (36), 7 states have call predecessors, (36), 6 states have return successors, (34), 8 states have call predecessors, (34), 9 states have call successors, (34) Word has length 116 [2022-04-27 13:04:16,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:04:16,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 4.222222222222222) internal successors, (76), 18 states have internal predecessors, (76), 10 states have call successors, (36), 7 states have call predecessors, (36), 6 states have return successors, (34), 8 states have call predecessors, (34), 9 states have call successors, (34) [2022-04-27 13:04:16,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 344 transitions. [2022-04-27 13:04:16,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 4.222222222222222) internal successors, (76), 18 states have internal predecessors, (76), 10 states have call successors, (36), 7 states have call predecessors, (36), 6 states have return successors, (34), 8 states have call predecessors, (34), 9 states have call successors, (34) [2022-04-27 13:04:16,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 344 transitions. [2022-04-27 13:04:16,399 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 344 transitions. [2022-04-27 13:04:16,718 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 344 edges. 344 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:04:16,798 INFO L225 Difference]: With dead ends: 1393 [2022-04-27 13:04:16,798 INFO L226 Difference]: Without dead ends: 1260 [2022-04-27 13:04:16,799 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 215 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=311, Invalid=559, Unknown=0, NotChecked=0, Total=870 [2022-04-27 13:04:16,800 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 322 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 230 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 322 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 230 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-27 13:04:16,800 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [322 Valid, 457 Invalid, 455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [230 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-27 13:04:16,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1260 states. [2022-04-27 13:04:18,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1260 to 1202. [2022-04-27 13:04:18,123 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:04:18,125 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1260 states. Second operand has 1202 states, 771 states have (on average 1.1595330739299612) internal successors, (894), 782 states have internal predecessors, (894), 305 states have call successors, (305), 126 states have call predecessors, (305), 125 states have return successors, (296), 293 states have call predecessors, (296), 296 states have call successors, (296) [2022-04-27 13:04:18,126 INFO L74 IsIncluded]: Start isIncluded. First operand 1260 states. Second operand has 1202 states, 771 states have (on average 1.1595330739299612) internal successors, (894), 782 states have internal predecessors, (894), 305 states have call successors, (305), 126 states have call predecessors, (305), 125 states have return successors, (296), 293 states have call predecessors, (296), 296 states have call successors, (296) [2022-04-27 13:04:18,128 INFO L87 Difference]: Start difference. First operand 1260 states. Second operand has 1202 states, 771 states have (on average 1.1595330739299612) internal successors, (894), 782 states have internal predecessors, (894), 305 states have call successors, (305), 126 states have call predecessors, (305), 125 states have return successors, (296), 293 states have call predecessors, (296), 296 states have call successors, (296) [2022-04-27 13:04:18,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:04:18,199 INFO L93 Difference]: Finished difference Result 1260 states and 1555 transitions. [2022-04-27 13:04:18,199 INFO L276 IsEmpty]: Start isEmpty. Operand 1260 states and 1555 transitions. [2022-04-27 13:04:18,202 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:04:18,202 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:04:18,204 INFO L74 IsIncluded]: Start isIncluded. First operand has 1202 states, 771 states have (on average 1.1595330739299612) internal successors, (894), 782 states have internal predecessors, (894), 305 states have call successors, (305), 126 states have call predecessors, (305), 125 states have return successors, (296), 293 states have call predecessors, (296), 296 states have call successors, (296) Second operand 1260 states. [2022-04-27 13:04:18,205 INFO L87 Difference]: Start difference. First operand has 1202 states, 771 states have (on average 1.1595330739299612) internal successors, (894), 782 states have internal predecessors, (894), 305 states have call successors, (305), 126 states have call predecessors, (305), 125 states have return successors, (296), 293 states have call predecessors, (296), 296 states have call successors, (296) Second operand 1260 states. [2022-04-27 13:04:18,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:04:18,276 INFO L93 Difference]: Finished difference Result 1260 states and 1555 transitions. [2022-04-27 13:04:18,276 INFO L276 IsEmpty]: Start isEmpty. Operand 1260 states and 1555 transitions. [2022-04-27 13:04:18,279 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:04:18,279 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:04:18,279 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:04:18,279 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:04:18,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1202 states, 771 states have (on average 1.1595330739299612) internal successors, (894), 782 states have internal predecessors, (894), 305 states have call successors, (305), 126 states have call predecessors, (305), 125 states have return successors, (296), 293 states have call predecessors, (296), 296 states have call successors, (296) [2022-04-27 13:04:18,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1202 states to 1202 states and 1495 transitions. [2022-04-27 13:04:18,366 INFO L78 Accepts]: Start accepts. Automaton has 1202 states and 1495 transitions. Word has length 116 [2022-04-27 13:04:18,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:04:18,367 INFO L495 AbstractCegarLoop]: Abstraction has 1202 states and 1495 transitions. [2022-04-27 13:04:18,367 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.222222222222222) internal successors, (76), 18 states have internal predecessors, (76), 10 states have call successors, (36), 7 states have call predecessors, (36), 6 states have return successors, (34), 8 states have call predecessors, (34), 9 states have call successors, (34) [2022-04-27 13:04:18,367 INFO L276 IsEmpty]: Start isEmpty. Operand 1202 states and 1495 transitions. [2022-04-27 13:04:18,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-04-27 13:04:18,368 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:04:18,368 INFO L195 NwaCegarLoop]: trace histogram [16, 15, 15, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:04:18,392 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-04-27 13:04:18,589 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-04-27 13:04:18,590 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:04:18,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:04:18,590 INFO L85 PathProgramCache]: Analyzing trace with hash 992936989, now seen corresponding path program 2 times [2022-04-27 13:04:18,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:04:18,590 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709491070] [2022-04-27 13:04:18,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:04:18,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:04:18,606 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:04:18,606 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1690216555] [2022-04-27 13:04:18,606 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 13:04:18,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:04:18,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:04:18,607 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 13:04:18,631 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-04-27 13:04:18,696 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 13:04:18,696 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 13:04:18,698 INFO L263 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 73 conjunts are in the unsatisfiable core [2022-04-27 13:04:18,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:04:18,724 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:04:34,676 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-27 13:04:37,621 INFO L272 TraceCheckUtils]: 0: Hoare triple {28359#true} call ULTIMATE.init(); {28359#true} is VALID [2022-04-27 13:04:37,621 INFO L290 TraceCheckUtils]: 1: Hoare triple {28359#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);~counter~0 := 0; {28359#true} is VALID [2022-04-27 13:04:37,621 INFO L290 TraceCheckUtils]: 2: Hoare triple {28359#true} assume true; {28359#true} is VALID [2022-04-27 13:04:37,621 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28359#true} {28359#true} #98#return; {28359#true} is VALID [2022-04-27 13:04:37,621 INFO L272 TraceCheckUtils]: 4: Hoare triple {28359#true} call #t~ret8 := main(); {28359#true} is VALID [2022-04-27 13:04:37,621 INFO L290 TraceCheckUtils]: 5: Hoare triple {28359#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {28359#true} is VALID [2022-04-27 13:04:37,621 INFO L272 TraceCheckUtils]: 6: Hoare triple {28359#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {28359#true} is VALID [2022-04-27 13:04:37,621 INFO L290 TraceCheckUtils]: 7: Hoare triple {28359#true} ~cond := #in~cond; {28359#true} is VALID [2022-04-27 13:04:37,621 INFO L290 TraceCheckUtils]: 8: Hoare triple {28359#true} assume !(0 == ~cond); {28359#true} is VALID [2022-04-27 13:04:37,621 INFO L290 TraceCheckUtils]: 9: Hoare triple {28359#true} assume true; {28359#true} is VALID [2022-04-27 13:04:37,621 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {28359#true} {28359#true} #78#return; {28359#true} is VALID [2022-04-27 13:04:37,622 INFO L272 TraceCheckUtils]: 11: Hoare triple {28359#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {28359#true} is VALID [2022-04-27 13:04:37,622 INFO L290 TraceCheckUtils]: 12: Hoare triple {28359#true} ~cond := #in~cond; {28400#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 13:04:37,622 INFO L290 TraceCheckUtils]: 13: Hoare triple {28400#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {28404#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 13:04:37,622 INFO L290 TraceCheckUtils]: 14: Hoare triple {28404#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {28404#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 13:04:37,623 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {28404#(not (= |assume_abort_if_not_#in~cond| 0))} {28359#true} #80#return; {28411#(<= 1 main_~y~0)} is VALID [2022-04-27 13:04:37,623 INFO L290 TraceCheckUtils]: 16: Hoare triple {28411#(<= 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; {28415#(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) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:04:37,623 INFO L272 TraceCheckUtils]: 17: Hoare triple {28415#(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) (<= 1 main_~y~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)); {28359#true} is VALID [2022-04-27 13:04:37,623 INFO L290 TraceCheckUtils]: 18: Hoare triple {28359#true} ~cond := #in~cond; {28359#true} is VALID [2022-04-27 13:04:37,623 INFO L290 TraceCheckUtils]: 19: Hoare triple {28359#true} assume !(0 == ~cond); {28359#true} is VALID [2022-04-27 13:04:37,623 INFO L290 TraceCheckUtils]: 20: Hoare triple {28359#true} assume true; {28359#true} is VALID [2022-04-27 13:04:37,624 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {28359#true} {28415#(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) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #82#return; {28415#(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) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:04:37,624 INFO L272 TraceCheckUtils]: 22: Hoare triple {28415#(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) (<= 1 main_~y~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)); {28359#true} is VALID [2022-04-27 13:04:37,624 INFO L290 TraceCheckUtils]: 23: Hoare triple {28359#true} ~cond := #in~cond; {28359#true} is VALID [2022-04-27 13:04:37,624 INFO L290 TraceCheckUtils]: 24: Hoare triple {28359#true} assume !(0 == ~cond); {28359#true} is VALID [2022-04-27 13:04:37,624 INFO L290 TraceCheckUtils]: 25: Hoare triple {28359#true} assume true; {28359#true} is VALID [2022-04-27 13:04:37,625 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {28359#true} {28415#(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) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #84#return; {28415#(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) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:04:37,625 INFO L290 TraceCheckUtils]: 27: Hoare triple {28415#(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) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {28415#(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) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:04:37,626 INFO L290 TraceCheckUtils]: 28: Hoare triple {28415#(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) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(#t~post6 < 50);havoc #t~post6; {28415#(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) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:04:37,626 INFO L290 TraceCheckUtils]: 29: Hoare triple {28415#(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) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {28455#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:04:37,627 INFO L290 TraceCheckUtils]: 30: Hoare triple {28455#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {28455#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:04:37,627 INFO L290 TraceCheckUtils]: 31: Hoare triple {28455#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(#t~post7 < 50);havoc #t~post7; {28455#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:04:37,627 INFO L272 TraceCheckUtils]: 32: Hoare triple {28455#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {28359#true} is VALID [2022-04-27 13:04:37,627 INFO L290 TraceCheckUtils]: 33: Hoare triple {28359#true} ~cond := #in~cond; {28359#true} is VALID [2022-04-27 13:04:37,627 INFO L290 TraceCheckUtils]: 34: Hoare triple {28359#true} assume !(0 == ~cond); {28359#true} is VALID [2022-04-27 13:04:37,627 INFO L290 TraceCheckUtils]: 35: Hoare triple {28359#true} assume true; {28359#true} is VALID [2022-04-27 13:04:37,628 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {28359#true} {28455#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #86#return; {28455#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:04:37,628 INFO L272 TraceCheckUtils]: 37: Hoare triple {28455#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {28359#true} is VALID [2022-04-27 13:04:37,628 INFO L290 TraceCheckUtils]: 38: Hoare triple {28359#true} ~cond := #in~cond; {28359#true} is VALID [2022-04-27 13:04:37,628 INFO L290 TraceCheckUtils]: 39: Hoare triple {28359#true} assume !(0 == ~cond); {28359#true} is VALID [2022-04-27 13:04:37,628 INFO L290 TraceCheckUtils]: 40: Hoare triple {28359#true} assume true; {28359#true} is VALID [2022-04-27 13:04:37,629 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {28359#true} {28455#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #88#return; {28455#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:04:37,629 INFO L272 TraceCheckUtils]: 42: Hoare triple {28455#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {28359#true} is VALID [2022-04-27 13:04:37,629 INFO L290 TraceCheckUtils]: 43: Hoare triple {28359#true} ~cond := #in~cond; {28359#true} is VALID [2022-04-27 13:04:37,629 INFO L290 TraceCheckUtils]: 44: Hoare triple {28359#true} assume !(0 == ~cond); {28359#true} is VALID [2022-04-27 13:04:37,629 INFO L290 TraceCheckUtils]: 45: Hoare triple {28359#true} assume true; {28359#true} is VALID [2022-04-27 13:04:37,630 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {28359#true} {28455#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #90#return; {28455#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:04:37,630 INFO L272 TraceCheckUtils]: 47: Hoare triple {28455#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {28359#true} is VALID [2022-04-27 13:04:37,630 INFO L290 TraceCheckUtils]: 48: Hoare triple {28359#true} ~cond := #in~cond; {28359#true} is VALID [2022-04-27 13:04:37,630 INFO L290 TraceCheckUtils]: 49: Hoare triple {28359#true} assume !(0 == ~cond); {28359#true} is VALID [2022-04-27 13:04:37,630 INFO L290 TraceCheckUtils]: 50: Hoare triple {28359#true} assume true; {28359#true} is VALID [2022-04-27 13:04:37,631 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {28359#true} {28455#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #92#return; {28455#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:04:37,632 INFO L290 TraceCheckUtils]: 52: Hoare triple {28455#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {28525#(and (= main_~r~0 0) (<= 1 main_~k~0) (= main_~s~0 1) (= main_~a~0 (+ main_~c~0 main_~b~0)) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:04:37,632 INFO L290 TraceCheckUtils]: 53: Hoare triple {28525#(and (= main_~r~0 0) (<= 1 main_~k~0) (= main_~s~0 1) (= main_~a~0 (+ main_~c~0 main_~b~0)) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {28525#(and (= main_~r~0 0) (<= 1 main_~k~0) (= main_~s~0 1) (= main_~a~0 (+ main_~c~0 main_~b~0)) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:04:37,633 INFO L290 TraceCheckUtils]: 54: Hoare triple {28525#(and (= main_~r~0 0) (<= 1 main_~k~0) (= main_~s~0 1) (= main_~a~0 (+ main_~c~0 main_~b~0)) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(#t~post7 < 50);havoc #t~post7; {28525#(and (= main_~r~0 0) (<= 1 main_~k~0) (= main_~s~0 1) (= main_~a~0 (+ main_~c~0 main_~b~0)) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:04:37,633 INFO L272 TraceCheckUtils]: 55: Hoare triple {28525#(and (= main_~r~0 0) (<= 1 main_~k~0) (= main_~s~0 1) (= main_~a~0 (+ main_~c~0 main_~b~0)) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {28359#true} is VALID [2022-04-27 13:04:37,633 INFO L290 TraceCheckUtils]: 56: Hoare triple {28359#true} ~cond := #in~cond; {28538#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:04:37,633 INFO L290 TraceCheckUtils]: 57: Hoare triple {28538#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {28542#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:04:37,633 INFO L290 TraceCheckUtils]: 58: Hoare triple {28542#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {28542#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:04:37,634 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {28542#(not (= |__VERIFIER_assert_#in~cond| 0))} {28525#(and (= main_~r~0 0) (<= 1 main_~k~0) (= main_~s~0 1) (= main_~a~0 (+ main_~c~0 main_~b~0)) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #86#return; {28549#(and (= main_~r~0 0) (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~s~0 1) (= main_~a~0 (+ main_~c~0 main_~b~0)) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:04:37,634 INFO L272 TraceCheckUtils]: 60: Hoare triple {28549#(and (= main_~r~0 0) (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~s~0 1) (= main_~a~0 (+ main_~c~0 main_~b~0)) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {28359#true} is VALID [2022-04-27 13:04:37,635 INFO L290 TraceCheckUtils]: 61: Hoare triple {28359#true} ~cond := #in~cond; {28359#true} is VALID [2022-04-27 13:04:37,635 INFO L290 TraceCheckUtils]: 62: Hoare triple {28359#true} assume !(0 == ~cond); {28359#true} is VALID [2022-04-27 13:04:37,635 INFO L290 TraceCheckUtils]: 63: Hoare triple {28359#true} assume true; {28359#true} is VALID [2022-04-27 13:04:37,635 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {28359#true} {28549#(and (= main_~r~0 0) (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~s~0 1) (= main_~a~0 (+ main_~c~0 main_~b~0)) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #88#return; {28549#(and (= main_~r~0 0) (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~s~0 1) (= main_~a~0 (+ main_~c~0 main_~b~0)) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:04:37,635 INFO L272 TraceCheckUtils]: 65: Hoare triple {28549#(and (= main_~r~0 0) (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~s~0 1) (= main_~a~0 (+ main_~c~0 main_~b~0)) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {28359#true} is VALID [2022-04-27 13:04:37,635 INFO L290 TraceCheckUtils]: 66: Hoare triple {28359#true} ~cond := #in~cond; {28359#true} is VALID [2022-04-27 13:04:37,635 INFO L290 TraceCheckUtils]: 67: Hoare triple {28359#true} assume !(0 == ~cond); {28359#true} is VALID [2022-04-27 13:04:37,636 INFO L290 TraceCheckUtils]: 68: Hoare triple {28359#true} assume true; {28359#true} is VALID [2022-04-27 13:04:37,636 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {28359#true} {28549#(and (= main_~r~0 0) (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~s~0 1) (= main_~a~0 (+ main_~c~0 main_~b~0)) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #90#return; {28549#(and (= main_~r~0 0) (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~s~0 1) (= main_~a~0 (+ main_~c~0 main_~b~0)) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:04:37,636 INFO L272 TraceCheckUtils]: 70: Hoare triple {28549#(and (= main_~r~0 0) (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~s~0 1) (= main_~a~0 (+ main_~c~0 main_~b~0)) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {28359#true} is VALID [2022-04-27 13:04:37,636 INFO L290 TraceCheckUtils]: 71: Hoare triple {28359#true} ~cond := #in~cond; {28359#true} is VALID [2022-04-27 13:04:37,636 INFO L290 TraceCheckUtils]: 72: Hoare triple {28359#true} assume !(0 == ~cond); {28359#true} is VALID [2022-04-27 13:04:37,636 INFO L290 TraceCheckUtils]: 73: Hoare triple {28359#true} assume true; {28359#true} is VALID [2022-04-27 13:04:37,637 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {28359#true} {28549#(and (= main_~r~0 0) (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~s~0 1) (= main_~a~0 (+ main_~c~0 main_~b~0)) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #92#return; {28549#(and (= main_~r~0 0) (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~s~0 1) (= main_~a~0 (+ main_~c~0 main_~b~0)) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:04:37,639 INFO L290 TraceCheckUtils]: 75: Hoare triple {28549#(and (= main_~r~0 0) (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~s~0 1) (= main_~a~0 (+ main_~c~0 main_~b~0)) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {28598#(and (= main_~r~0 0) (= main_~s~0 1) (<= 0 main_~c~0) (= main_~b~0 main_~y~0) (= (+ main_~c~0 (* main_~b~0 2)) main_~a~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (<= (+ (div (+ (* (- 1) main_~c~0) main_~a~0 (* (- 1) main_~b~0)) main_~b~0) 1) main_~k~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:04:37,639 INFO L290 TraceCheckUtils]: 76: Hoare triple {28598#(and (= main_~r~0 0) (= main_~s~0 1) (<= 0 main_~c~0) (= main_~b~0 main_~y~0) (= (+ main_~c~0 (* main_~b~0 2)) main_~a~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (<= (+ (div (+ (* (- 1) main_~c~0) main_~a~0 (* (- 1) main_~b~0)) main_~b~0) 1) main_~k~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {28598#(and (= main_~r~0 0) (= main_~s~0 1) (<= 0 main_~c~0) (= main_~b~0 main_~y~0) (= (+ main_~c~0 (* main_~b~0 2)) main_~a~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (<= (+ (div (+ (* (- 1) main_~c~0) main_~a~0 (* (- 1) main_~b~0)) main_~b~0) 1) main_~k~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:04:37,640 INFO L290 TraceCheckUtils]: 77: Hoare triple {28598#(and (= main_~r~0 0) (= main_~s~0 1) (<= 0 main_~c~0) (= main_~b~0 main_~y~0) (= (+ main_~c~0 (* main_~b~0 2)) main_~a~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (<= (+ (div (+ (* (- 1) main_~c~0) main_~a~0 (* (- 1) main_~b~0)) main_~b~0) 1) main_~k~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(#t~post7 < 50);havoc #t~post7; {28598#(and (= main_~r~0 0) (= main_~s~0 1) (<= 0 main_~c~0) (= main_~b~0 main_~y~0) (= (+ main_~c~0 (* main_~b~0 2)) main_~a~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (<= (+ (div (+ (* (- 1) main_~c~0) main_~a~0 (* (- 1) main_~b~0)) main_~b~0) 1) main_~k~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:04:37,640 INFO L272 TraceCheckUtils]: 78: Hoare triple {28598#(and (= main_~r~0 0) (= main_~s~0 1) (<= 0 main_~c~0) (= main_~b~0 main_~y~0) (= (+ main_~c~0 (* main_~b~0 2)) main_~a~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (<= (+ (div (+ (* (- 1) main_~c~0) main_~a~0 (* (- 1) main_~b~0)) main_~b~0) 1) main_~k~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {28359#true} is VALID [2022-04-27 13:04:37,640 INFO L290 TraceCheckUtils]: 79: Hoare triple {28359#true} ~cond := #in~cond; {28538#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:04:37,640 INFO L290 TraceCheckUtils]: 80: Hoare triple {28538#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {28542#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:04:37,641 INFO L290 TraceCheckUtils]: 81: Hoare triple {28542#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {28542#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:04:37,642 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {28542#(not (= |__VERIFIER_assert_#in~cond| 0))} {28598#(and (= main_~r~0 0) (= main_~s~0 1) (<= 0 main_~c~0) (= main_~b~0 main_~y~0) (= (+ main_~c~0 (* main_~b~0 2)) main_~a~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (<= (+ (div (+ (* (- 1) main_~c~0) main_~a~0 (* (- 1) main_~b~0)) main_~b~0) 1) main_~k~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #86#return; {28620#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~s~0 1) (<= 0 main_~c~0) (= main_~b~0 main_~y~0) (= (* main_~b~0 main_~k~0) (* main_~b~0 2)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~p~0 1))} is VALID [2022-04-27 13:04:37,642 INFO L272 TraceCheckUtils]: 83: Hoare triple {28620#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~s~0 1) (<= 0 main_~c~0) (= main_~b~0 main_~y~0) (= (* main_~b~0 main_~k~0) (* main_~b~0 2)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {28359#true} is VALID [2022-04-27 13:04:37,642 INFO L290 TraceCheckUtils]: 84: Hoare triple {28359#true} ~cond := #in~cond; {28359#true} is VALID [2022-04-27 13:04:37,642 INFO L290 TraceCheckUtils]: 85: Hoare triple {28359#true} assume !(0 == ~cond); {28359#true} is VALID [2022-04-27 13:04:37,642 INFO L290 TraceCheckUtils]: 86: Hoare triple {28359#true} assume true; {28359#true} is VALID [2022-04-27 13:04:37,643 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {28359#true} {28620#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~s~0 1) (<= 0 main_~c~0) (= main_~b~0 main_~y~0) (= (* main_~b~0 main_~k~0) (* main_~b~0 2)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~p~0 1))} #88#return; {28620#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~s~0 1) (<= 0 main_~c~0) (= main_~b~0 main_~y~0) (= (* main_~b~0 main_~k~0) (* main_~b~0 2)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~p~0 1))} is VALID [2022-04-27 13:04:37,643 INFO L272 TraceCheckUtils]: 88: Hoare triple {28620#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~s~0 1) (<= 0 main_~c~0) (= main_~b~0 main_~y~0) (= (* main_~b~0 main_~k~0) (* main_~b~0 2)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~p~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {28359#true} is VALID [2022-04-27 13:04:37,644 INFO L290 TraceCheckUtils]: 89: Hoare triple {28359#true} ~cond := #in~cond; {28538#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:04:37,644 INFO L290 TraceCheckUtils]: 90: Hoare triple {28538#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {28542#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:04:37,644 INFO L290 TraceCheckUtils]: 91: Hoare triple {28542#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {28542#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:04:37,645 INFO L284 TraceCheckUtils]: 92: Hoare quadruple {28542#(not (= |__VERIFIER_assert_#in~cond| 0))} {28620#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~s~0 1) (<= 0 main_~c~0) (= main_~b~0 main_~y~0) (= (* main_~b~0 main_~k~0) (* main_~b~0 2)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~p~0 1))} #90#return; {28620#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~s~0 1) (<= 0 main_~c~0) (= main_~b~0 main_~y~0) (= (* main_~b~0 main_~k~0) (* main_~b~0 2)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~p~0 1))} is VALID [2022-04-27 13:04:37,645 INFO L272 TraceCheckUtils]: 93: Hoare triple {28620#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~s~0 1) (<= 0 main_~c~0) (= main_~b~0 main_~y~0) (= (* main_~b~0 main_~k~0) (* main_~b~0 2)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {28359#true} is VALID [2022-04-27 13:04:37,645 INFO L290 TraceCheckUtils]: 94: Hoare triple {28359#true} ~cond := #in~cond; {28538#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:04:37,645 INFO L290 TraceCheckUtils]: 95: Hoare triple {28538#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {28542#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:04:37,646 INFO L290 TraceCheckUtils]: 96: Hoare triple {28542#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {28542#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:04:37,646 INFO L284 TraceCheckUtils]: 97: Hoare quadruple {28542#(not (= |__VERIFIER_assert_#in~cond| 0))} {28620#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~s~0 1) (<= 0 main_~c~0) (= main_~b~0 main_~y~0) (= (* main_~b~0 main_~k~0) (* main_~b~0 2)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~p~0 1))} #92#return; {28620#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~s~0 1) (<= 0 main_~c~0) (= main_~b~0 main_~y~0) (= (* main_~b~0 main_~k~0) (* main_~b~0 2)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~p~0 1))} is VALID [2022-04-27 13:04:37,647 INFO L290 TraceCheckUtils]: 98: Hoare triple {28620#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~s~0 1) (<= 0 main_~c~0) (= main_~b~0 main_~y~0) (= (* main_~b~0 main_~k~0) (* main_~b~0 2)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~p~0 1))} assume !(~c~0 >= ~b~0); {28669#(and (= main_~r~0 0) (< main_~c~0 main_~y~0) (= main_~s~0 1) (<= 0 main_~c~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~x~0 (+ main_~c~0 (* main_~k~0 main_~y~0))) (= (* main_~y~0 2) (* main_~k~0 main_~y~0)) (= main_~p~0 1))} is VALID [2022-04-27 13:04:37,649 INFO L290 TraceCheckUtils]: 99: Hoare triple {28669#(and (= main_~r~0 0) (< main_~c~0 main_~y~0) (= main_~s~0 1) (<= 0 main_~c~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~x~0 (+ main_~c~0 (* main_~k~0 main_~y~0))) (= (* main_~y~0 2) (* 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; {28673#(and (<= 0 (+ main_~x~0 (* main_~y~0 main_~s~0))) (< (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~y~0) (= (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~b~0) (= (* main_~y~0 (* (- 1) main_~s~0)) (* main_~y~0 2)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-27 13:04:37,649 INFO L290 TraceCheckUtils]: 100: Hoare triple {28673#(and (<= 0 (+ main_~x~0 (* main_~y~0 main_~s~0))) (< (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~y~0) (= (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~b~0) (= (* main_~y~0 (* (- 1) main_~s~0)) (* main_~y~0 2)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {28673#(and (<= 0 (+ main_~x~0 (* main_~y~0 main_~s~0))) (< (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~y~0) (= (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~b~0) (= (* main_~y~0 (* (- 1) main_~s~0)) (* main_~y~0 2)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-27 13:04:37,650 INFO L290 TraceCheckUtils]: 101: Hoare triple {28673#(and (<= 0 (+ main_~x~0 (* main_~y~0 main_~s~0))) (< (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~y~0) (= (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~b~0) (= (* main_~y~0 (* (- 1) main_~s~0)) (* main_~y~0 2)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} assume !!(#t~post6 < 50);havoc #t~post6; {28673#(and (<= 0 (+ main_~x~0 (* main_~y~0 main_~s~0))) (< (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~y~0) (= (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~b~0) (= (* main_~y~0 (* (- 1) main_~s~0)) (* main_~y~0 2)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-27 13:04:37,650 INFO L290 TraceCheckUtils]: 102: Hoare triple {28673#(and (<= 0 (+ main_~x~0 (* main_~y~0 main_~s~0))) (< (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~y~0) (= (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~b~0) (= (* main_~y~0 (* (- 1) main_~s~0)) (* main_~y~0 2)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {28673#(and (<= 0 (+ main_~x~0 (* main_~y~0 main_~s~0))) (< (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~y~0) (= (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~b~0) (= (* main_~y~0 (* (- 1) main_~s~0)) (* main_~y~0 2)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-27 13:04:37,650 INFO L290 TraceCheckUtils]: 103: Hoare triple {28673#(and (<= 0 (+ main_~x~0 (* main_~y~0 main_~s~0))) (< (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~y~0) (= (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~b~0) (= (* main_~y~0 (* (- 1) main_~s~0)) (* main_~y~0 2)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {28673#(and (<= 0 (+ main_~x~0 (* main_~y~0 main_~s~0))) (< (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~y~0) (= (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~b~0) (= (* main_~y~0 (* (- 1) main_~s~0)) (* main_~y~0 2)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-27 13:04:37,651 INFO L290 TraceCheckUtils]: 104: Hoare triple {28673#(and (<= 0 (+ main_~x~0 (* main_~y~0 main_~s~0))) (< (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~y~0) (= (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~b~0) (= (* main_~y~0 (* (- 1) main_~s~0)) (* main_~y~0 2)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} assume !!(#t~post7 < 50);havoc #t~post7; {28673#(and (<= 0 (+ main_~x~0 (* main_~y~0 main_~s~0))) (< (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~y~0) (= (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~b~0) (= (* main_~y~0 (* (- 1) main_~s~0)) (* main_~y~0 2)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-27 13:04:37,651 INFO L272 TraceCheckUtils]: 105: Hoare triple {28673#(and (<= 0 (+ main_~x~0 (* main_~y~0 main_~s~0))) (< (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~y~0) (= (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~b~0) (= (* main_~y~0 (* (- 1) main_~s~0)) (* main_~y~0 2)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {28359#true} is VALID [2022-04-27 13:04:37,651 INFO L290 TraceCheckUtils]: 106: Hoare triple {28359#true} ~cond := #in~cond; {28359#true} is VALID [2022-04-27 13:04:37,651 INFO L290 TraceCheckUtils]: 107: Hoare triple {28359#true} assume !(0 == ~cond); {28359#true} is VALID [2022-04-27 13:04:37,651 INFO L290 TraceCheckUtils]: 108: Hoare triple {28359#true} assume true; {28359#true} is VALID [2022-04-27 13:04:37,652 INFO L284 TraceCheckUtils]: 109: Hoare quadruple {28359#true} {28673#(and (<= 0 (+ main_~x~0 (* main_~y~0 main_~s~0))) (< (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~y~0) (= (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~b~0) (= (* main_~y~0 (* (- 1) main_~s~0)) (* main_~y~0 2)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #86#return; {28673#(and (<= 0 (+ main_~x~0 (* main_~y~0 main_~s~0))) (< (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~y~0) (= (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~b~0) (= (* main_~y~0 (* (- 1) main_~s~0)) (* main_~y~0 2)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-27 13:04:37,652 INFO L272 TraceCheckUtils]: 110: Hoare triple {28673#(and (<= 0 (+ main_~x~0 (* main_~y~0 main_~s~0))) (< (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~y~0) (= (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~b~0) (= (* main_~y~0 (* (- 1) main_~s~0)) (* main_~y~0 2)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {28359#true} is VALID [2022-04-27 13:04:37,652 INFO L290 TraceCheckUtils]: 111: Hoare triple {28359#true} ~cond := #in~cond; {28359#true} is VALID [2022-04-27 13:04:37,652 INFO L290 TraceCheckUtils]: 112: Hoare triple {28359#true} assume !(0 == ~cond); {28359#true} is VALID [2022-04-27 13:04:37,652 INFO L290 TraceCheckUtils]: 113: Hoare triple {28359#true} assume true; {28359#true} is VALID [2022-04-27 13:04:37,653 INFO L284 TraceCheckUtils]: 114: Hoare quadruple {28359#true} {28673#(and (<= 0 (+ main_~x~0 (* main_~y~0 main_~s~0))) (< (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~y~0) (= (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~b~0) (= (* main_~y~0 (* (- 1) main_~s~0)) (* main_~y~0 2)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #88#return; {28673#(and (<= 0 (+ main_~x~0 (* main_~y~0 main_~s~0))) (< (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~y~0) (= (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~b~0) (= (* main_~y~0 (* (- 1) main_~s~0)) (* main_~y~0 2)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-27 13:04:37,653 INFO L272 TraceCheckUtils]: 115: Hoare triple {28673#(and (<= 0 (+ main_~x~0 (* main_~y~0 main_~s~0))) (< (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~y~0) (= (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~b~0) (= (* main_~y~0 (* (- 1) main_~s~0)) (* main_~y~0 2)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {28359#true} is VALID [2022-04-27 13:04:37,653 INFO L290 TraceCheckUtils]: 116: Hoare triple {28359#true} ~cond := #in~cond; {28538#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:04:37,653 INFO L290 TraceCheckUtils]: 117: Hoare triple {28538#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {28542#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:04:37,654 INFO L290 TraceCheckUtils]: 118: Hoare triple {28542#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {28542#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:04:37,654 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {28542#(not (= |__VERIFIER_assert_#in~cond| 0))} {28673#(and (<= 0 (+ main_~x~0 (* main_~y~0 main_~s~0))) (< (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~y~0) (= (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~b~0) (= (* main_~y~0 (* (- 1) main_~s~0)) (* main_~y~0 2)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #90#return; {28673#(and (<= 0 (+ main_~x~0 (* main_~y~0 main_~s~0))) (< (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~y~0) (= (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~b~0) (= (* main_~y~0 (* (- 1) main_~s~0)) (* main_~y~0 2)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-27 13:04:37,656 INFO L272 TraceCheckUtils]: 120: Hoare triple {28673#(and (<= 0 (+ main_~x~0 (* main_~y~0 main_~s~0))) (< (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~y~0) (= (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~b~0) (= (* main_~y~0 (* (- 1) main_~s~0)) (* main_~y~0 2)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {28737#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:04:37,656 INFO L290 TraceCheckUtils]: 121: Hoare triple {28737#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {28741#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:04:37,657 INFO L290 TraceCheckUtils]: 122: Hoare triple {28741#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {28360#false} is VALID [2022-04-27 13:04:37,657 INFO L290 TraceCheckUtils]: 123: Hoare triple {28360#false} assume !false; {28360#false} is VALID [2022-04-27 13:04:37,657 INFO L134 CoverageAnalysis]: Checked inductivity of 516 backedges. 139 proven. 92 refuted. 0 times theorem prover too weak. 285 trivial. 0 not checked. [2022-04-27 13:04:37,657 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:06:43,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:06:43,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709491070] [2022-04-27 13:06:43,643 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:06:43,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1690216555] [2022-04-27 13:06:43,643 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1690216555] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 13:06:43,643 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 13:06:43,643 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2022-04-27 13:06:43,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637943897] [2022-04-27 13:06:43,643 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 13:06:43,643 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.176470588235294) internal successors, (37), 13 states have internal predecessors, (37), 8 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (20), 7 states have call predecessors, (20), 8 states have call successors, (20) Word has length 124 [2022-04-27 13:06:43,644 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:06:43,644 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 2.176470588235294) internal successors, (37), 13 states have internal predecessors, (37), 8 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (20), 7 states have call predecessors, (20), 8 states have call successors, (20) [2022-04-27 13:06:43,749 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:06:43,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-27 13:06:43,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:06:43,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-27 13:06:43,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=509, Unknown=1, NotChecked=0, Total=650 [2022-04-27 13:06:43,750 INFO L87 Difference]: Start difference. First operand 1202 states and 1495 transitions. Second operand has 17 states, 17 states have (on average 2.176470588235294) internal successors, (37), 13 states have internal predecessors, (37), 8 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (20), 7 states have call predecessors, (20), 8 states have call successors, (20) [2022-04-27 13:07:04,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:07:04,031 INFO L93 Difference]: Finished difference Result 1331 states and 1650 transitions. [2022-04-27 13:07:04,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-27 13:07:04,032 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.176470588235294) internal successors, (37), 13 states have internal predecessors, (37), 8 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (20), 7 states have call predecessors, (20), 8 states have call successors, (20) Word has length 124 [2022-04-27 13:07:04,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:07:04,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 2.176470588235294) internal successors, (37), 13 states have internal predecessors, (37), 8 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (20), 7 states have call predecessors, (20), 8 states have call successors, (20) [2022-04-27 13:07:04,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 121 transitions. [2022-04-27 13:07:04,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 2.176470588235294) internal successors, (37), 13 states have internal predecessors, (37), 8 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (20), 7 states have call predecessors, (20), 8 states have call successors, (20) [2022-04-27 13:07:04,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 121 transitions. [2022-04-27 13:07:04,036 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 121 transitions. [2022-04-27 13:07:04,245 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 121 edges. 121 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:07:04,340 INFO L225 Difference]: With dead ends: 1331 [2022-04-27 13:07:04,341 INFO L226 Difference]: Without dead ends: 1329 [2022-04-27 13:07:04,341 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 147 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=187, Invalid=742, Unknown=1, NotChecked=0, Total=930 [2022-04-27 13:07:04,341 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 51 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 756 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 813 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 756 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2022-04-27 13:07:04,342 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 326 Invalid, 813 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 756 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2022-04-27 13:07:04,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1329 states. [2022-04-27 13:07:06,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1329 to 1321. [2022-04-27 13:07:06,080 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:07:06,082 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1329 states. Second operand has 1321 states, 845 states have (on average 1.1538461538461537) internal successors, (975), 856 states have internal predecessors, (975), 333 states have call successors, (333), 143 states have call predecessors, (333), 142 states have return successors, (324), 321 states have call predecessors, (324), 324 states have call successors, (324) [2022-04-27 13:07:06,083 INFO L74 IsIncluded]: Start isIncluded. First operand 1329 states. Second operand has 1321 states, 845 states have (on average 1.1538461538461537) internal successors, (975), 856 states have internal predecessors, (975), 333 states have call successors, (333), 143 states have call predecessors, (333), 142 states have return successors, (324), 321 states have call predecessors, (324), 324 states have call successors, (324) [2022-04-27 13:07:06,085 INFO L87 Difference]: Start difference. First operand 1329 states. Second operand has 1321 states, 845 states have (on average 1.1538461538461537) internal successors, (975), 856 states have internal predecessors, (975), 333 states have call successors, (333), 143 states have call predecessors, (333), 142 states have return successors, (324), 321 states have call predecessors, (324), 324 states have call successors, (324) [2022-04-27 13:07:06,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:07:06,165 INFO L93 Difference]: Finished difference Result 1329 states and 1640 transitions. [2022-04-27 13:07:06,165 INFO L276 IsEmpty]: Start isEmpty. Operand 1329 states and 1640 transitions. [2022-04-27 13:07:06,169 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:07:06,169 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:07:06,171 INFO L74 IsIncluded]: Start isIncluded. First operand has 1321 states, 845 states have (on average 1.1538461538461537) internal successors, (975), 856 states have internal predecessors, (975), 333 states have call successors, (333), 143 states have call predecessors, (333), 142 states have return successors, (324), 321 states have call predecessors, (324), 324 states have call successors, (324) Second operand 1329 states. [2022-04-27 13:07:06,173 INFO L87 Difference]: Start difference. First operand has 1321 states, 845 states have (on average 1.1538461538461537) internal successors, (975), 856 states have internal predecessors, (975), 333 states have call successors, (333), 143 states have call predecessors, (333), 142 states have return successors, (324), 321 states have call predecessors, (324), 324 states have call successors, (324) Second operand 1329 states. [2022-04-27 13:07:06,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:07:06,252 INFO L93 Difference]: Finished difference Result 1329 states and 1640 transitions. [2022-04-27 13:07:06,252 INFO L276 IsEmpty]: Start isEmpty. Operand 1329 states and 1640 transitions. [2022-04-27 13:07:06,255 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:07:06,255 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:07:06,255 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:07:06,255 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:07:06,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1321 states, 845 states have (on average 1.1538461538461537) internal successors, (975), 856 states have internal predecessors, (975), 333 states have call successors, (333), 143 states have call predecessors, (333), 142 states have return successors, (324), 321 states have call predecessors, (324), 324 states have call successors, (324) [2022-04-27 13:07:06,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1321 states to 1321 states and 1632 transitions. [2022-04-27 13:07:06,372 INFO L78 Accepts]: Start accepts. Automaton has 1321 states and 1632 transitions. Word has length 124 [2022-04-27 13:07:06,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:07:06,372 INFO L495 AbstractCegarLoop]: Abstraction has 1321 states and 1632 transitions. [2022-04-27 13:07:06,372 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.176470588235294) internal successors, (37), 13 states have internal predecessors, (37), 8 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (20), 7 states have call predecessors, (20), 8 states have call successors, (20) [2022-04-27 13:07:06,372 INFO L276 IsEmpty]: Start isEmpty. Operand 1321 states and 1632 transitions. [2022-04-27 13:07:06,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2022-04-27 13:07:06,373 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:07:06,374 INFO L195 NwaCegarLoop]: trace histogram [16, 15, 15, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:07:06,401 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-04-27 13:07:06,587 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:07:06,587 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:07:06,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:07:06,588 INFO L85 PathProgramCache]: Analyzing trace with hash -270396677, now seen corresponding path program 3 times [2022-04-27 13:07:06,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:07:06,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371476538] [2022-04-27 13:07:06,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:07:06,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:07:06,611 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:07:06,611 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1890311047] [2022-04-27 13:07:06,611 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 13:07:06,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:07:06,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:07:06,614 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 13:07:06,639 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-04-27 13:07:06,704 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-04-27 13:07:06,704 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 13:07:06,706 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 67 conjunts are in the unsatisfiable core [2022-04-27 13:07:06,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:07:06,733 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:07:08,512 INFO L272 TraceCheckUtils]: 0: Hoare triple {35438#true} call ULTIMATE.init(); {35438#true} is VALID [2022-04-27 13:07:08,512 INFO L290 TraceCheckUtils]: 1: Hoare triple {35438#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);~counter~0 := 0; {35438#true} is VALID [2022-04-27 13:07:08,512 INFO L290 TraceCheckUtils]: 2: Hoare triple {35438#true} assume true; {35438#true} is VALID [2022-04-27 13:07:08,513 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35438#true} {35438#true} #98#return; {35438#true} is VALID [2022-04-27 13:07:08,513 INFO L272 TraceCheckUtils]: 4: Hoare triple {35438#true} call #t~ret8 := main(); {35438#true} is VALID [2022-04-27 13:07:08,513 INFO L290 TraceCheckUtils]: 5: Hoare triple {35438#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {35438#true} is VALID [2022-04-27 13:07:08,513 INFO L272 TraceCheckUtils]: 6: Hoare triple {35438#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {35438#true} is VALID [2022-04-27 13:07:08,513 INFO L290 TraceCheckUtils]: 7: Hoare triple {35438#true} ~cond := #in~cond; {35438#true} is VALID [2022-04-27 13:07:08,513 INFO L290 TraceCheckUtils]: 8: Hoare triple {35438#true} assume !(0 == ~cond); {35438#true} is VALID [2022-04-27 13:07:08,513 INFO L290 TraceCheckUtils]: 9: Hoare triple {35438#true} assume true; {35438#true} is VALID [2022-04-27 13:07:08,513 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {35438#true} {35438#true} #78#return; {35438#true} is VALID [2022-04-27 13:07:08,513 INFO L272 TraceCheckUtils]: 11: Hoare triple {35438#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {35438#true} is VALID [2022-04-27 13:07:08,513 INFO L290 TraceCheckUtils]: 12: Hoare triple {35438#true} ~cond := #in~cond; {35438#true} is VALID [2022-04-27 13:07:08,513 INFO L290 TraceCheckUtils]: 13: Hoare triple {35438#true} assume !(0 == ~cond); {35438#true} is VALID [2022-04-27 13:07:08,513 INFO L290 TraceCheckUtils]: 14: Hoare triple {35438#true} assume true; {35438#true} is VALID [2022-04-27 13:07:08,513 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {35438#true} {35438#true} #80#return; {35438#true} is VALID [2022-04-27 13:07:08,514 INFO L290 TraceCheckUtils]: 16: Hoare triple {35438#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; {35491#(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:07:08,514 INFO L272 TraceCheckUtils]: 17: Hoare triple {35491#(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)); {35438#true} is VALID [2022-04-27 13:07:08,514 INFO L290 TraceCheckUtils]: 18: Hoare triple {35438#true} ~cond := #in~cond; {35438#true} is VALID [2022-04-27 13:07:08,514 INFO L290 TraceCheckUtils]: 19: Hoare triple {35438#true} assume !(0 == ~cond); {35438#true} is VALID [2022-04-27 13:07:08,514 INFO L290 TraceCheckUtils]: 20: Hoare triple {35438#true} assume true; {35438#true} is VALID [2022-04-27 13:07:08,515 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {35438#true} {35491#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #82#return; {35491#(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:07:08,515 INFO L272 TraceCheckUtils]: 22: Hoare triple {35491#(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)); {35438#true} is VALID [2022-04-27 13:07:08,515 INFO L290 TraceCheckUtils]: 23: Hoare triple {35438#true} ~cond := #in~cond; {35438#true} is VALID [2022-04-27 13:07:08,515 INFO L290 TraceCheckUtils]: 24: Hoare triple {35438#true} assume !(0 == ~cond); {35438#true} is VALID [2022-04-27 13:07:08,515 INFO L290 TraceCheckUtils]: 25: Hoare triple {35438#true} assume true; {35438#true} is VALID [2022-04-27 13:07:08,516 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {35438#true} {35491#(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))} #84#return; {35491#(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:07:08,517 INFO L290 TraceCheckUtils]: 27: Hoare triple {35491#(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))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {35491#(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:07:08,517 INFO L290 TraceCheckUtils]: 28: Hoare triple {35491#(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 !!(#t~post6 < 50);havoc #t~post6; {35491#(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:07:08,518 INFO L290 TraceCheckUtils]: 29: Hoare triple {35491#(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; {35531#(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:07:08,518 INFO L290 TraceCheckUtils]: 30: Hoare triple {35531#(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))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {35531#(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:07:08,519 INFO L290 TraceCheckUtils]: 31: Hoare triple {35531#(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 !!(#t~post7 < 50);havoc #t~post7; {35531#(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:07:08,519 INFO L272 TraceCheckUtils]: 32: Hoare triple {35531#(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)); {35438#true} is VALID [2022-04-27 13:07:08,519 INFO L290 TraceCheckUtils]: 33: Hoare triple {35438#true} ~cond := #in~cond; {35438#true} is VALID [2022-04-27 13:07:08,519 INFO L290 TraceCheckUtils]: 34: Hoare triple {35438#true} assume !(0 == ~cond); {35438#true} is VALID [2022-04-27 13:07:08,519 INFO L290 TraceCheckUtils]: 35: Hoare triple {35438#true} assume true; {35438#true} is VALID [2022-04-27 13:07:08,520 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {35438#true} {35531#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #86#return; {35531#(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:07:08,520 INFO L272 TraceCheckUtils]: 37: Hoare triple {35531#(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)); {35438#true} is VALID [2022-04-27 13:07:08,520 INFO L290 TraceCheckUtils]: 38: Hoare triple {35438#true} ~cond := #in~cond; {35438#true} is VALID [2022-04-27 13:07:08,520 INFO L290 TraceCheckUtils]: 39: Hoare triple {35438#true} assume !(0 == ~cond); {35438#true} is VALID [2022-04-27 13:07:08,521 INFO L290 TraceCheckUtils]: 40: Hoare triple {35438#true} assume true; {35438#true} is VALID [2022-04-27 13:07:08,521 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {35438#true} {35531#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #88#return; {35531#(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:07:08,522 INFO L272 TraceCheckUtils]: 42: Hoare triple {35531#(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)); {35438#true} is VALID [2022-04-27 13:07:08,522 INFO L290 TraceCheckUtils]: 43: Hoare triple {35438#true} ~cond := #in~cond; {35438#true} is VALID [2022-04-27 13:07:08,522 INFO L290 TraceCheckUtils]: 44: Hoare triple {35438#true} assume !(0 == ~cond); {35438#true} is VALID [2022-04-27 13:07:08,522 INFO L290 TraceCheckUtils]: 45: Hoare triple {35438#true} assume true; {35438#true} is VALID [2022-04-27 13:07:08,523 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {35438#true} {35531#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #90#return; {35531#(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:07:08,523 INFO L272 TraceCheckUtils]: 47: Hoare triple {35531#(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)); {35438#true} is VALID [2022-04-27 13:07:08,523 INFO L290 TraceCheckUtils]: 48: Hoare triple {35438#true} ~cond := #in~cond; {35438#true} is VALID [2022-04-27 13:07:08,523 INFO L290 TraceCheckUtils]: 49: Hoare triple {35438#true} assume !(0 == ~cond); {35438#true} is VALID [2022-04-27 13:07:08,523 INFO L290 TraceCheckUtils]: 50: Hoare triple {35438#true} assume true; {35438#true} is VALID [2022-04-27 13:07:08,524 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {35438#true} {35531#(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))} #92#return; {35531#(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:07:08,524 INFO L290 TraceCheckUtils]: 52: Hoare triple {35531#(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); {35531#(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:07:08,525 INFO L290 TraceCheckUtils]: 53: Hoare triple {35531#(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))} ~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; {35604#(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_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-27 13:07:08,526 INFO L290 TraceCheckUtils]: 54: Hoare triple {35604#(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_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {35604#(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_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-27 13:07:08,526 INFO L290 TraceCheckUtils]: 55: Hoare triple {35604#(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_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} assume !!(#t~post6 < 50);havoc #t~post6; {35604#(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_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-27 13:07:08,527 INFO L290 TraceCheckUtils]: 56: Hoare triple {35604#(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_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {35614#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-27 13:07:08,527 INFO L290 TraceCheckUtils]: 57: Hoare triple {35614#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {35614#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-27 13:07:08,528 INFO L290 TraceCheckUtils]: 58: Hoare triple {35614#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} assume !!(#t~post7 < 50);havoc #t~post7; {35614#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-27 13:07:08,528 INFO L272 TraceCheckUtils]: 59: Hoare triple {35614#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {35438#true} is VALID [2022-04-27 13:07:08,528 INFO L290 TraceCheckUtils]: 60: Hoare triple {35438#true} ~cond := #in~cond; {35438#true} is VALID [2022-04-27 13:07:08,528 INFO L290 TraceCheckUtils]: 61: Hoare triple {35438#true} assume !(0 == ~cond); {35438#true} is VALID [2022-04-27 13:07:08,528 INFO L290 TraceCheckUtils]: 62: Hoare triple {35438#true} assume true; {35438#true} is VALID [2022-04-27 13:07:08,529 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {35438#true} {35614#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #86#return; {35614#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-27 13:07:08,529 INFO L272 TraceCheckUtils]: 64: Hoare triple {35614#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {35438#true} is VALID [2022-04-27 13:07:08,529 INFO L290 TraceCheckUtils]: 65: Hoare triple {35438#true} ~cond := #in~cond; {35438#true} is VALID [2022-04-27 13:07:08,529 INFO L290 TraceCheckUtils]: 66: Hoare triple {35438#true} assume !(0 == ~cond); {35438#true} is VALID [2022-04-27 13:07:08,529 INFO L290 TraceCheckUtils]: 67: Hoare triple {35438#true} assume true; {35438#true} is VALID [2022-04-27 13:07:08,530 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {35438#true} {35614#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #88#return; {35614#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-27 13:07:08,530 INFO L272 TraceCheckUtils]: 69: Hoare triple {35614#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {35438#true} is VALID [2022-04-27 13:07:08,531 INFO L290 TraceCheckUtils]: 70: Hoare triple {35438#true} ~cond := #in~cond; {35438#true} is VALID [2022-04-27 13:07:08,531 INFO L290 TraceCheckUtils]: 71: Hoare triple {35438#true} assume !(0 == ~cond); {35438#true} is VALID [2022-04-27 13:07:08,531 INFO L290 TraceCheckUtils]: 72: Hoare triple {35438#true} assume true; {35438#true} is VALID [2022-04-27 13:07:08,532 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {35438#true} {35614#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #90#return; {35614#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-27 13:07:08,532 INFO L272 TraceCheckUtils]: 74: Hoare triple {35614#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {35438#true} is VALID [2022-04-27 13:07:08,532 INFO L290 TraceCheckUtils]: 75: Hoare triple {35438#true} ~cond := #in~cond; {35438#true} is VALID [2022-04-27 13:07:08,532 INFO L290 TraceCheckUtils]: 76: Hoare triple {35438#true} assume !(0 == ~cond); {35438#true} is VALID [2022-04-27 13:07:08,532 INFO L290 TraceCheckUtils]: 77: Hoare triple {35438#true} assume true; {35438#true} is VALID [2022-04-27 13:07:08,533 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {35438#true} {35614#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #92#return; {35614#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-27 13:07:08,533 INFO L290 TraceCheckUtils]: 79: Hoare triple {35614#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {35684#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~k~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~y~0 (+ main_~c~0 main_~b~0)))} is VALID [2022-04-27 13:07:08,534 INFO L290 TraceCheckUtils]: 80: Hoare triple {35684#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~k~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~y~0 (+ main_~c~0 main_~b~0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {35684#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~k~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~y~0 (+ main_~c~0 main_~b~0)))} is VALID [2022-04-27 13:07:08,535 INFO L290 TraceCheckUtils]: 81: Hoare triple {35684#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~k~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~y~0 (+ main_~c~0 main_~b~0)))} assume !!(#t~post7 < 50);havoc #t~post7; {35684#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~k~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~y~0 (+ main_~c~0 main_~b~0)))} is VALID [2022-04-27 13:07:08,535 INFO L272 TraceCheckUtils]: 82: Hoare triple {35684#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~k~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~y~0 (+ main_~c~0 main_~b~0)))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {35438#true} is VALID [2022-04-27 13:07:08,535 INFO L290 TraceCheckUtils]: 83: Hoare triple {35438#true} ~cond := #in~cond; {35438#true} is VALID [2022-04-27 13:07:08,535 INFO L290 TraceCheckUtils]: 84: Hoare triple {35438#true} assume !(0 == ~cond); {35438#true} is VALID [2022-04-27 13:07:08,535 INFO L290 TraceCheckUtils]: 85: Hoare triple {35438#true} assume true; {35438#true} is VALID [2022-04-27 13:07:08,536 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {35438#true} {35684#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~k~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~y~0 (+ main_~c~0 main_~b~0)))} #86#return; {35684#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~k~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~y~0 (+ main_~c~0 main_~b~0)))} is VALID [2022-04-27 13:07:08,536 INFO L272 TraceCheckUtils]: 87: Hoare triple {35684#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~k~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~y~0 (+ main_~c~0 main_~b~0)))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {35438#true} is VALID [2022-04-27 13:07:08,536 INFO L290 TraceCheckUtils]: 88: Hoare triple {35438#true} ~cond := #in~cond; {35438#true} is VALID [2022-04-27 13:07:08,536 INFO L290 TraceCheckUtils]: 89: Hoare triple {35438#true} assume !(0 == ~cond); {35438#true} is VALID [2022-04-27 13:07:08,536 INFO L290 TraceCheckUtils]: 90: Hoare triple {35438#true} assume true; {35438#true} is VALID [2022-04-27 13:07:08,537 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {35438#true} {35684#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~k~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~y~0 (+ main_~c~0 main_~b~0)))} #88#return; {35684#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~k~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~y~0 (+ main_~c~0 main_~b~0)))} is VALID [2022-04-27 13:07:08,537 INFO L272 TraceCheckUtils]: 92: Hoare triple {35684#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~k~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~y~0 (+ main_~c~0 main_~b~0)))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {35438#true} is VALID [2022-04-27 13:07:08,537 INFO L290 TraceCheckUtils]: 93: Hoare triple {35438#true} ~cond := #in~cond; {35438#true} is VALID [2022-04-27 13:07:08,537 INFO L290 TraceCheckUtils]: 94: Hoare triple {35438#true} assume !(0 == ~cond); {35438#true} is VALID [2022-04-27 13:07:08,537 INFO L290 TraceCheckUtils]: 95: Hoare triple {35438#true} assume true; {35438#true} is VALID [2022-04-27 13:07:08,538 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {35438#true} {35684#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~k~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~y~0 (+ main_~c~0 main_~b~0)))} #90#return; {35684#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~k~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~y~0 (+ main_~c~0 main_~b~0)))} is VALID [2022-04-27 13:07:08,538 INFO L272 TraceCheckUtils]: 97: Hoare triple {35684#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~k~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~y~0 (+ main_~c~0 main_~b~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)); {35438#true} is VALID [2022-04-27 13:07:08,539 INFO L290 TraceCheckUtils]: 98: Hoare triple {35438#true} ~cond := #in~cond; {35742#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:07:08,539 INFO L290 TraceCheckUtils]: 99: Hoare triple {35742#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {35746#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:07:08,539 INFO L290 TraceCheckUtils]: 100: Hoare triple {35746#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {35746#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:07:08,540 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {35746#(not (= |__VERIFIER_assert_#in~cond| 0))} {35684#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~k~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~y~0 (+ main_~c~0 main_~b~0)))} #92#return; {35753#(and (= (+ main_~c~0 main_~x~0) main_~y~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~k~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-27 13:07:08,541 INFO L290 TraceCheckUtils]: 102: Hoare triple {35753#(and (= (+ main_~c~0 main_~x~0) main_~y~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~k~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} assume !(~c~0 >= ~b~0); {35753#(and (= (+ main_~c~0 main_~x~0) main_~y~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~k~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-27 13:07:08,542 INFO L290 TraceCheckUtils]: 103: Hoare triple {35753#(and (= (+ main_~c~0 main_~x~0) main_~y~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~k~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} ~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; {35760#(and (= main_~s~0 1) (= main_~b~0 (+ main_~y~0 (* (- 1) main_~x~0))) (= (* (- 1) main_~q~0) 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-27 13:07:08,542 INFO L290 TraceCheckUtils]: 104: Hoare triple {35760#(and (= main_~s~0 1) (= main_~b~0 (+ main_~y~0 (* (- 1) main_~x~0))) (= (* (- 1) main_~q~0) 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {35760#(and (= main_~s~0 1) (= main_~b~0 (+ main_~y~0 (* (- 1) main_~x~0))) (= (* (- 1) main_~q~0) 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-27 13:07:08,543 INFO L290 TraceCheckUtils]: 105: Hoare triple {35760#(and (= main_~s~0 1) (= main_~b~0 (+ main_~y~0 (* (- 1) main_~x~0))) (= (* (- 1) main_~q~0) 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} assume !!(#t~post6 < 50);havoc #t~post6; {35760#(and (= main_~s~0 1) (= main_~b~0 (+ main_~y~0 (* (- 1) main_~x~0))) (= (* (- 1) main_~q~0) 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-27 13:07:08,543 INFO L290 TraceCheckUtils]: 106: Hoare triple {35760#(and (= main_~s~0 1) (= main_~b~0 (+ main_~y~0 (* (- 1) main_~x~0))) (= (* (- 1) main_~q~0) 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {35760#(and (= main_~s~0 1) (= main_~b~0 (+ main_~y~0 (* (- 1) main_~x~0))) (= (* (- 1) main_~q~0) 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-27 13:07:08,544 INFO L290 TraceCheckUtils]: 107: Hoare triple {35760#(and (= main_~s~0 1) (= main_~b~0 (+ main_~y~0 (* (- 1) main_~x~0))) (= (* (- 1) main_~q~0) 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {35760#(and (= main_~s~0 1) (= main_~b~0 (+ main_~y~0 (* (- 1) main_~x~0))) (= (* (- 1) main_~q~0) 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-27 13:07:08,545 INFO L290 TraceCheckUtils]: 108: Hoare triple {35760#(and (= main_~s~0 1) (= main_~b~0 (+ main_~y~0 (* (- 1) main_~x~0))) (= (* (- 1) main_~q~0) 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} assume !!(#t~post7 < 50);havoc #t~post7; {35760#(and (= main_~s~0 1) (= main_~b~0 (+ main_~y~0 (* (- 1) main_~x~0))) (= (* (- 1) main_~q~0) 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-27 13:07:08,545 INFO L272 TraceCheckUtils]: 109: Hoare triple {35760#(and (= main_~s~0 1) (= main_~b~0 (+ main_~y~0 (* (- 1) main_~x~0))) (= (* (- 1) main_~q~0) 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {35438#true} is VALID [2022-04-27 13:07:08,545 INFO L290 TraceCheckUtils]: 110: Hoare triple {35438#true} ~cond := #in~cond; {35438#true} is VALID [2022-04-27 13:07:08,545 INFO L290 TraceCheckUtils]: 111: Hoare triple {35438#true} assume !(0 == ~cond); {35438#true} is VALID [2022-04-27 13:07:08,545 INFO L290 TraceCheckUtils]: 112: Hoare triple {35438#true} assume true; {35438#true} is VALID [2022-04-27 13:07:08,546 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {35438#true} {35760#(and (= main_~s~0 1) (= main_~b~0 (+ main_~y~0 (* (- 1) main_~x~0))) (= (* (- 1) main_~q~0) 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #86#return; {35760#(and (= main_~s~0 1) (= main_~b~0 (+ main_~y~0 (* (- 1) main_~x~0))) (= (* (- 1) main_~q~0) 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-27 13:07:08,546 INFO L272 TraceCheckUtils]: 114: Hoare triple {35760#(and (= main_~s~0 1) (= main_~b~0 (+ main_~y~0 (* (- 1) main_~x~0))) (= (* (- 1) main_~q~0) 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {35438#true} is VALID [2022-04-27 13:07:08,546 INFO L290 TraceCheckUtils]: 115: Hoare triple {35438#true} ~cond := #in~cond; {35438#true} is VALID [2022-04-27 13:07:08,546 INFO L290 TraceCheckUtils]: 116: Hoare triple {35438#true} assume !(0 == ~cond); {35438#true} is VALID [2022-04-27 13:07:08,546 INFO L290 TraceCheckUtils]: 117: Hoare triple {35438#true} assume true; {35438#true} is VALID [2022-04-27 13:07:08,547 INFO L284 TraceCheckUtils]: 118: Hoare quadruple {35438#true} {35760#(and (= main_~s~0 1) (= main_~b~0 (+ main_~y~0 (* (- 1) main_~x~0))) (= (* (- 1) main_~q~0) 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #88#return; {35760#(and (= main_~s~0 1) (= main_~b~0 (+ main_~y~0 (* (- 1) main_~x~0))) (= (* (- 1) main_~q~0) 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-27 13:07:08,547 INFO L272 TraceCheckUtils]: 119: Hoare triple {35760#(and (= main_~s~0 1) (= main_~b~0 (+ main_~y~0 (* (- 1) main_~x~0))) (= (* (- 1) main_~q~0) 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {35438#true} is VALID [2022-04-27 13:07:08,547 INFO L290 TraceCheckUtils]: 120: Hoare triple {35438#true} ~cond := #in~cond; {35742#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:07:08,548 INFO L290 TraceCheckUtils]: 121: Hoare triple {35742#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {35746#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:07:08,548 INFO L290 TraceCheckUtils]: 122: Hoare triple {35746#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {35746#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:07:08,549 INFO L284 TraceCheckUtils]: 123: Hoare quadruple {35746#(not (= |__VERIFIER_assert_#in~cond| 0))} {35760#(and (= main_~s~0 1) (= main_~b~0 (+ main_~y~0 (* (- 1) main_~x~0))) (= (* (- 1) main_~q~0) 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #90#return; {35760#(and (= main_~s~0 1) (= main_~b~0 (+ main_~y~0 (* (- 1) main_~x~0))) (= (* (- 1) main_~q~0) 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-27 13:07:08,551 INFO L272 TraceCheckUtils]: 124: Hoare triple {35760#(and (= main_~s~0 1) (= main_~b~0 (+ main_~y~0 (* (- 1) main_~x~0))) (= (* (- 1) main_~q~0) 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {35824#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:07:08,552 INFO L290 TraceCheckUtils]: 125: Hoare triple {35824#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {35828#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:07:08,552 INFO L290 TraceCheckUtils]: 126: Hoare triple {35828#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {35439#false} is VALID [2022-04-27 13:07:08,552 INFO L290 TraceCheckUtils]: 127: Hoare triple {35439#false} assume !false; {35439#false} is VALID [2022-04-27 13:07:08,553 INFO L134 CoverageAnalysis]: Checked inductivity of 523 backedges. 100 proven. 57 refuted. 0 times theorem prover too weak. 366 trivial. 0 not checked. [2022-04-27 13:07:08,553 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:09:11,784 INFO L290 TraceCheckUtils]: 127: Hoare triple {35439#false} assume !false; {35439#false} is VALID [2022-04-27 13:09:11,785 INFO L290 TraceCheckUtils]: 126: Hoare triple {35828#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {35439#false} is VALID [2022-04-27 13:09:11,786 INFO L290 TraceCheckUtils]: 125: Hoare triple {35824#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {35828#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:09:11,786 INFO L272 TraceCheckUtils]: 124: Hoare triple {35844#(= (+ (* 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)); {35824#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:09:11,787 INFO L284 TraceCheckUtils]: 123: Hoare quadruple {35746#(not (= |__VERIFIER_assert_#in~cond| 0))} {35848#(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)))))} #90#return; {35844#(= (+ (* 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:09:11,788 INFO L290 TraceCheckUtils]: 122: Hoare triple {35746#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {35746#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:09:11,788 INFO L290 TraceCheckUtils]: 121: Hoare triple {35858#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {35746#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:09:11,788 INFO L290 TraceCheckUtils]: 120: Hoare triple {35438#true} ~cond := #in~cond; {35858#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 13:09:11,788 INFO L272 TraceCheckUtils]: 119: Hoare triple {35848#(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)); {35438#true} is VALID [2022-04-27 13:09:11,789 INFO L284 TraceCheckUtils]: 118: Hoare quadruple {35438#true} {35848#(or (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} #88#return; {35848#(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:09:11,789 INFO L290 TraceCheckUtils]: 117: Hoare triple {35438#true} assume true; {35438#true} is VALID [2022-04-27 13:09:11,789 INFO L290 TraceCheckUtils]: 116: Hoare triple {35438#true} assume !(0 == ~cond); {35438#true} is VALID [2022-04-27 13:09:11,789 INFO L290 TraceCheckUtils]: 115: Hoare triple {35438#true} ~cond := #in~cond; {35438#true} is VALID [2022-04-27 13:09:11,789 INFO L272 TraceCheckUtils]: 114: Hoare triple {35848#(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)); {35438#true} is VALID [2022-04-27 13:09:11,790 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {35438#true} {35848#(or (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} #86#return; {35848#(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:09:11,790 INFO L290 TraceCheckUtils]: 112: Hoare triple {35438#true} assume true; {35438#true} is VALID [2022-04-27 13:09:11,790 INFO L290 TraceCheckUtils]: 111: Hoare triple {35438#true} assume !(0 == ~cond); {35438#true} is VALID [2022-04-27 13:09:11,790 INFO L290 TraceCheckUtils]: 110: Hoare triple {35438#true} ~cond := #in~cond; {35438#true} is VALID [2022-04-27 13:09:11,790 INFO L272 TraceCheckUtils]: 109: Hoare triple {35848#(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)); {35438#true} is VALID [2022-04-27 13:09:11,790 INFO L290 TraceCheckUtils]: 108: Hoare triple {35848#(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 !!(#t~post7 < 50);havoc #t~post7; {35848#(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:09:11,791 INFO L290 TraceCheckUtils]: 107: Hoare triple {35848#(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)))))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {35848#(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:09:11,791 INFO L290 TraceCheckUtils]: 106: Hoare triple {35848#(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; {35848#(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:09:11,791 INFO L290 TraceCheckUtils]: 105: Hoare triple {35848#(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 !!(#t~post6 < 50);havoc #t~post6; {35848#(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:09:11,792 INFO L290 TraceCheckUtils]: 104: Hoare triple {35848#(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)))))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {35848#(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:09:13,805 WARN L290 TraceCheckUtils]: 103: Hoare triple {35910#(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; {35848#(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:09:13,805 INFO L290 TraceCheckUtils]: 102: Hoare triple {35910#(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); {35910#(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:09:13,807 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {35746#(not (= |__VERIFIER_assert_#in~cond| 0))} {35917#(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)))} #92#return; {35910#(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:09:13,808 INFO L290 TraceCheckUtils]: 100: Hoare triple {35746#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {35746#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:09:13,808 INFO L290 TraceCheckUtils]: 99: Hoare triple {35858#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {35746#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:09:13,808 INFO L290 TraceCheckUtils]: 98: Hoare triple {35438#true} ~cond := #in~cond; {35858#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 13:09:13,808 INFO L272 TraceCheckUtils]: 97: Hoare triple {35917#(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)); {35438#true} is VALID [2022-04-27 13:09:13,809 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {35438#true} {35917#(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)))} #90#return; {35917#(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:09:13,810 INFO L290 TraceCheckUtils]: 95: Hoare triple {35438#true} assume true; {35438#true} is VALID [2022-04-27 13:09:13,810 INFO L290 TraceCheckUtils]: 94: Hoare triple {35438#true} assume !(0 == ~cond); {35438#true} is VALID [2022-04-27 13:09:13,810 INFO L290 TraceCheckUtils]: 93: Hoare triple {35438#true} ~cond := #in~cond; {35438#true} is VALID [2022-04-27 13:09:13,810 INFO L272 TraceCheckUtils]: 92: Hoare triple {35917#(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 ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {35438#true} is VALID [2022-04-27 13:09:13,811 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {35438#true} {35917#(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)))} #88#return; {35917#(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:09:13,811 INFO L290 TraceCheckUtils]: 90: Hoare triple {35438#true} assume true; {35438#true} is VALID [2022-04-27 13:09:13,811 INFO L290 TraceCheckUtils]: 89: Hoare triple {35438#true} assume !(0 == ~cond); {35438#true} is VALID [2022-04-27 13:09:13,811 INFO L290 TraceCheckUtils]: 88: Hoare triple {35438#true} ~cond := #in~cond; {35438#true} is VALID [2022-04-27 13:09:13,811 INFO L272 TraceCheckUtils]: 87: Hoare triple {35917#(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 ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {35438#true} is VALID [2022-04-27 13:09:13,812 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {35438#true} {35917#(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)))} #86#return; {35917#(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:09:13,812 INFO L290 TraceCheckUtils]: 85: Hoare triple {35438#true} assume true; {35438#true} is VALID [2022-04-27 13:09:13,812 INFO L290 TraceCheckUtils]: 84: Hoare triple {35438#true} assume !(0 == ~cond); {35438#true} is VALID [2022-04-27 13:09:13,812 INFO L290 TraceCheckUtils]: 83: Hoare triple {35438#true} ~cond := #in~cond; {35438#true} is VALID [2022-04-27 13:09:13,813 INFO L272 TraceCheckUtils]: 82: Hoare triple {35917#(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 ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {35438#true} is VALID [2022-04-27 13:09:13,813 INFO L290 TraceCheckUtils]: 81: Hoare triple {35917#(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)))} assume !!(#t~post7 < 50);havoc #t~post7; {35917#(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:09:13,814 INFO L290 TraceCheckUtils]: 80: Hoare triple {35917#(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)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {35917#(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:09:14,041 INFO L290 TraceCheckUtils]: 79: Hoare triple {35984#(or (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))) (* (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) main_~y~0)) (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0)) main_~xy~0) (* (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))) main_~yy~0) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))))) (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_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0)))))} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {35917#(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:09:14,042 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {35438#true} {35984#(or (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))) (* (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) main_~y~0)) (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0)) main_~xy~0) (* (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))) main_~yy~0) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))))) (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_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0)))))} #92#return; {35984#(or (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))) (* (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) main_~y~0)) (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0)) main_~xy~0) (* (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))) main_~yy~0) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))))) (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_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0)))))} is VALID [2022-04-27 13:09:14,042 INFO L290 TraceCheckUtils]: 77: Hoare triple {35438#true} assume true; {35438#true} is VALID [2022-04-27 13:09:14,042 INFO L290 TraceCheckUtils]: 76: Hoare triple {35438#true} assume !(0 == ~cond); {35438#true} is VALID [2022-04-27 13:09:14,042 INFO L290 TraceCheckUtils]: 75: Hoare triple {35438#true} ~cond := #in~cond; {35438#true} is VALID [2022-04-27 13:09:14,042 INFO L272 TraceCheckUtils]: 74: Hoare triple {35984#(or (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))) (* (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) main_~y~0)) (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0)) main_~xy~0) (* (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))) main_~yy~0) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))))) (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_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0)))))} 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)); {35438#true} is VALID [2022-04-27 13:09:14,044 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {35438#true} {35984#(or (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))) (* (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) main_~y~0)) (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0)) main_~xy~0) (* (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))) main_~yy~0) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))))) (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_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0)))))} #90#return; {35984#(or (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))) (* (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) main_~y~0)) (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0)) main_~xy~0) (* (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))) main_~yy~0) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))))) (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_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0)))))} is VALID [2022-04-27 13:09:14,044 INFO L290 TraceCheckUtils]: 72: Hoare triple {35438#true} assume true; {35438#true} is VALID [2022-04-27 13:09:14,044 INFO L290 TraceCheckUtils]: 71: Hoare triple {35438#true} assume !(0 == ~cond); {35438#true} is VALID [2022-04-27 13:09:14,044 INFO L290 TraceCheckUtils]: 70: Hoare triple {35438#true} ~cond := #in~cond; {35438#true} is VALID [2022-04-27 13:09:14,044 INFO L272 TraceCheckUtils]: 69: Hoare triple {35984#(or (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))) (* (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) main_~y~0)) (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0)) main_~xy~0) (* (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))) main_~yy~0) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))))) (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_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0)))))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {35438#true} is VALID [2022-04-27 13:09:14,045 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {35438#true} {35984#(or (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))) (* (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) main_~y~0)) (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0)) main_~xy~0) (* (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))) main_~yy~0) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))))) (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_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0)))))} #88#return; {35984#(or (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))) (* (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) main_~y~0)) (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0)) main_~xy~0) (* (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))) main_~yy~0) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))))) (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_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0)))))} is VALID [2022-04-27 13:09:14,045 INFO L290 TraceCheckUtils]: 67: Hoare triple {35438#true} assume true; {35438#true} is VALID [2022-04-27 13:09:14,045 INFO L290 TraceCheckUtils]: 66: Hoare triple {35438#true} assume !(0 == ~cond); {35438#true} is VALID [2022-04-27 13:09:14,045 INFO L290 TraceCheckUtils]: 65: Hoare triple {35438#true} ~cond := #in~cond; {35438#true} is VALID [2022-04-27 13:09:14,045 INFO L272 TraceCheckUtils]: 64: Hoare triple {35984#(or (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))) (* (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) main_~y~0)) (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0)) main_~xy~0) (* (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))) main_~yy~0) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))))) (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_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0)))))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {35438#true} is VALID [2022-04-27 13:09:14,046 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {35438#true} {35984#(or (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))) (* (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) main_~y~0)) (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0)) main_~xy~0) (* (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))) main_~yy~0) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))))) (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_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0)))))} #86#return; {35984#(or (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))) (* (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) main_~y~0)) (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0)) main_~xy~0) (* (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))) main_~yy~0) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))))) (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_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0)))))} is VALID [2022-04-27 13:09:14,046 INFO L290 TraceCheckUtils]: 62: Hoare triple {35438#true} assume true; {35438#true} is VALID [2022-04-27 13:09:14,046 INFO L290 TraceCheckUtils]: 61: Hoare triple {35438#true} assume !(0 == ~cond); {35438#true} is VALID [2022-04-27 13:09:14,046 INFO L290 TraceCheckUtils]: 60: Hoare triple {35438#true} ~cond := #in~cond; {35438#true} is VALID [2022-04-27 13:09:14,046 INFO L272 TraceCheckUtils]: 59: Hoare triple {35984#(or (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))) (* (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) main_~y~0)) (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0)) main_~xy~0) (* (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))) main_~yy~0) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))))) (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_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0)))))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {35438#true} is VALID [2022-04-27 13:09:14,047 INFO L290 TraceCheckUtils]: 58: Hoare triple {35984#(or (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))) (* (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) main_~y~0)) (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0)) main_~xy~0) (* (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))) main_~yy~0) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))))) (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_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0)))))} assume !!(#t~post7 < 50);havoc #t~post7; {35984#(or (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))) (* (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) main_~y~0)) (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0)) main_~xy~0) (* (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))) main_~yy~0) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))))) (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_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0)))))} is VALID [2022-04-27 13:09:14,048 INFO L290 TraceCheckUtils]: 57: Hoare triple {35984#(or (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))) (* (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) main_~y~0)) (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0)) main_~xy~0) (* (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))) main_~yy~0) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))))) (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_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0)))))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {35984#(or (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))) (* (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) main_~y~0)) (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0)) main_~xy~0) (* (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))) main_~yy~0) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))))) (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_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0)))))} is VALID [2022-04-27 13:09:14,049 INFO L290 TraceCheckUtils]: 56: Hoare triple {36054#(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_~r~0 (* (- 1) main_~s~0)) main_~yy~0) (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))) (* main_~xy~0 (+ main_~p~0 (* (- 1) main_~q~0)))) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))) (* (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))) main_~y~0))) (not (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {35984#(or (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))) (* (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) main_~y~0)) (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0)) main_~xy~0) (* (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))) main_~yy~0) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))))) (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_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0)))))} is VALID [2022-04-27 13:09:14,050 INFO L290 TraceCheckUtils]: 55: Hoare triple {36054#(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_~r~0 (* (- 1) main_~s~0)) main_~yy~0) (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))) (* main_~xy~0 (+ main_~p~0 (* (- 1) main_~q~0)))) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))) (* (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))) main_~y~0))) (not (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))))} assume !!(#t~post6 < 50);havoc #t~post6; {36054#(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_~r~0 (* (- 1) main_~s~0)) main_~yy~0) (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))) (* main_~xy~0 (+ main_~p~0 (* (- 1) main_~q~0)))) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))) (* (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))) main_~y~0))) (not (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))))} is VALID [2022-04-27 13:09:14,051 INFO L290 TraceCheckUtils]: 54: Hoare triple {36054#(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_~r~0 (* (- 1) main_~s~0)) main_~yy~0) (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))) (* main_~xy~0 (+ main_~p~0 (* (- 1) main_~q~0)))) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))) (* (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))) main_~y~0))) (not (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {36054#(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_~r~0 (* (- 1) main_~s~0)) main_~yy~0) (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))) (* main_~xy~0 (+ main_~p~0 (* (- 1) main_~q~0)))) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))) (* (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))) main_~y~0))) (not (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))))} is VALID [2022-04-27 13:09:16,054 WARN L290 TraceCheckUtils]: 53: Hoare triple {36064#(or (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) main_~c~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0)) (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~c~0 main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)))) (= (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~yy~0) (* main_~xy~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) main_~y~0) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0))) (not (= (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) (+ (* (- 1) main_~c~0) main_~b~0))))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {36054#(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_~r~0 (* (- 1) main_~s~0)) main_~yy~0) (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))) (* main_~xy~0 (+ main_~p~0 (* (- 1) main_~q~0)))) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))) (* (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))) main_~y~0))) (not (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))))} is UNKNOWN [2022-04-27 13:09:16,055 INFO L290 TraceCheckUtils]: 52: Hoare triple {36064#(or (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) main_~c~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0)) (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~c~0 main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)))) (= (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~yy~0) (* main_~xy~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) main_~y~0) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0))) (not (= (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) (+ (* (- 1) main_~c~0) main_~b~0))))} assume !(~c~0 >= ~b~0); {36064#(or (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) main_~c~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0)) (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~c~0 main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)))) (= (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~yy~0) (* main_~xy~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) main_~y~0) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0))) (not (= (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) (+ (* (- 1) main_~c~0) main_~b~0))))} is VALID [2022-04-27 13:09:16,056 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {35438#true} {36064#(or (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) main_~c~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0)) (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~c~0 main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)))) (= (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~yy~0) (* main_~xy~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) main_~y~0) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0))) (not (= (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) (+ (* (- 1) main_~c~0) main_~b~0))))} #92#return; {36064#(or (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) main_~c~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0)) (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~c~0 main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)))) (= (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~yy~0) (* main_~xy~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) main_~y~0) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0))) (not (= (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) (+ (* (- 1) main_~c~0) main_~b~0))))} is VALID [2022-04-27 13:09:16,056 INFO L290 TraceCheckUtils]: 50: Hoare triple {35438#true} assume true; {35438#true} is VALID [2022-04-27 13:09:16,056 INFO L290 TraceCheckUtils]: 49: Hoare triple {35438#true} assume !(0 == ~cond); {35438#true} is VALID [2022-04-27 13:09:16,056 INFO L290 TraceCheckUtils]: 48: Hoare triple {35438#true} ~cond := #in~cond; {35438#true} is VALID [2022-04-27 13:09:16,056 INFO L272 TraceCheckUtils]: 47: Hoare triple {36064#(or (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) main_~c~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0)) (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~c~0 main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)))) (= (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~yy~0) (* main_~xy~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) main_~y~0) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0))) (not (= (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) (+ (* (- 1) main_~c~0) main_~b~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)); {35438#true} is VALID [2022-04-27 13:09:16,057 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {35438#true} {36064#(or (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) main_~c~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0)) (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~c~0 main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)))) (= (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~yy~0) (* main_~xy~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) main_~y~0) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0))) (not (= (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) (+ (* (- 1) main_~c~0) main_~b~0))))} #90#return; {36064#(or (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) main_~c~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0)) (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~c~0 main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)))) (= (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~yy~0) (* main_~xy~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) main_~y~0) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0))) (not (= (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) (+ (* (- 1) main_~c~0) main_~b~0))))} is VALID [2022-04-27 13:09:16,057 INFO L290 TraceCheckUtils]: 45: Hoare triple {35438#true} assume true; {35438#true} is VALID [2022-04-27 13:09:16,057 INFO L290 TraceCheckUtils]: 44: Hoare triple {35438#true} assume !(0 == ~cond); {35438#true} is VALID [2022-04-27 13:09:16,057 INFO L290 TraceCheckUtils]: 43: Hoare triple {35438#true} ~cond := #in~cond; {35438#true} is VALID [2022-04-27 13:09:16,057 INFO L272 TraceCheckUtils]: 42: Hoare triple {36064#(or (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) main_~c~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0)) (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~c~0 main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)))) (= (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~yy~0) (* main_~xy~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) main_~y~0) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0))) (not (= (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) (+ (* (- 1) main_~c~0) main_~b~0))))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {35438#true} is VALID [2022-04-27 13:09:16,058 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {35438#true} {36064#(or (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) main_~c~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0)) (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~c~0 main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)))) (= (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~yy~0) (* main_~xy~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) main_~y~0) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0))) (not (= (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) (+ (* (- 1) main_~c~0) main_~b~0))))} #88#return; {36064#(or (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) main_~c~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0)) (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~c~0 main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)))) (= (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~yy~0) (* main_~xy~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) main_~y~0) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0))) (not (= (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) (+ (* (- 1) main_~c~0) main_~b~0))))} is VALID [2022-04-27 13:09:16,058 INFO L290 TraceCheckUtils]: 40: Hoare triple {35438#true} assume true; {35438#true} is VALID [2022-04-27 13:09:16,058 INFO L290 TraceCheckUtils]: 39: Hoare triple {35438#true} assume !(0 == ~cond); {35438#true} is VALID [2022-04-27 13:09:16,058 INFO L290 TraceCheckUtils]: 38: Hoare triple {35438#true} ~cond := #in~cond; {35438#true} is VALID [2022-04-27 13:09:16,058 INFO L272 TraceCheckUtils]: 37: Hoare triple {36064#(or (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) main_~c~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0)) (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~c~0 main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)))) (= (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~yy~0) (* main_~xy~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) main_~y~0) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0))) (not (= (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) (+ (* (- 1) main_~c~0) main_~b~0))))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {35438#true} is VALID [2022-04-27 13:09:16,059 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {35438#true} {36064#(or (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) main_~c~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0)) (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~c~0 main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)))) (= (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~yy~0) (* main_~xy~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) main_~y~0) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0))) (not (= (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) (+ (* (- 1) main_~c~0) main_~b~0))))} #86#return; {36064#(or (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) main_~c~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0)) (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~c~0 main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)))) (= (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~yy~0) (* main_~xy~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) main_~y~0) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0))) (not (= (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) (+ (* (- 1) main_~c~0) main_~b~0))))} is VALID [2022-04-27 13:09:16,059 INFO L290 TraceCheckUtils]: 35: Hoare triple {35438#true} assume true; {35438#true} is VALID [2022-04-27 13:09:16,059 INFO L290 TraceCheckUtils]: 34: Hoare triple {35438#true} assume !(0 == ~cond); {35438#true} is VALID [2022-04-27 13:09:16,059 INFO L290 TraceCheckUtils]: 33: Hoare triple {35438#true} ~cond := #in~cond; {35438#true} is VALID [2022-04-27 13:09:16,059 INFO L272 TraceCheckUtils]: 32: Hoare triple {36064#(or (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) main_~c~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0)) (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~c~0 main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)))) (= (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~yy~0) (* main_~xy~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) main_~y~0) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0))) (not (= (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) (+ (* (- 1) main_~c~0) main_~b~0))))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {35438#true} is VALID [2022-04-27 13:09:16,060 INFO L290 TraceCheckUtils]: 31: Hoare triple {36064#(or (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) main_~c~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0)) (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~c~0 main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)))) (= (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~yy~0) (* main_~xy~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) main_~y~0) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0))) (not (= (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) (+ (* (- 1) main_~c~0) main_~b~0))))} assume !!(#t~post7 < 50);havoc #t~post7; {36064#(or (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) main_~c~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0)) (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~c~0 main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)))) (= (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~yy~0) (* main_~xy~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) main_~y~0) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0))) (not (= (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) (+ (* (- 1) main_~c~0) main_~b~0))))} is VALID [2022-04-27 13:09:16,060 INFO L290 TraceCheckUtils]: 30: Hoare triple {36064#(or (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) main_~c~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0)) (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~c~0 main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)))) (= (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~yy~0) (* main_~xy~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) main_~y~0) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0))) (not (= (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) (+ (* (- 1) main_~c~0) main_~b~0))))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {36064#(or (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) main_~c~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0)) (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~c~0 main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)))) (= (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~yy~0) (* main_~xy~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) main_~y~0) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0))) (not (= (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) (+ (* (- 1) main_~c~0) main_~b~0))))} is VALID [2022-04-27 13:09:18,062 WARN L290 TraceCheckUtils]: 29: Hoare triple {36137#(or (= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* (+ main_~q~0 (* (- 1) main_~p~0)) main_~xy~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0))) (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~yy~0)) (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0))) (* (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0)))) main_~y~0))) (not (= (+ (* (- 1) main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) main_~b~0 (* (- 1) main_~q~0 main_~x~0) (* main_~p~0 main_~x~0)) main_~a~0)) (not (= (+ (* (- 1) main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) main_~b~0 (* (- 1) main_~q~0 main_~x~0) (* main_~p~0 main_~xy~0) (* main_~r~0 main_~yy~0) (* main_~p~0 main_~x~0)) (+ (* main_~y~0 main_~r~0) (* (+ (* (- 1) main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) main_~b~0 (* (- 1) main_~q~0 main_~x~0) (* main_~p~0 main_~x~0)) main_~y~0) (* main_~p~0 main_~x~0)))))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {36064#(or (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) main_~c~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0)) (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~c~0 main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)))) (= (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~yy~0) (* main_~xy~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) main_~y~0) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0))) (not (= (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) (+ (* (- 1) main_~c~0) main_~b~0))))} is UNKNOWN [2022-04-27 13:09:18,063 INFO L290 TraceCheckUtils]: 28: Hoare triple {36137#(or (= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* (+ main_~q~0 (* (- 1) main_~p~0)) main_~xy~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0))) (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~yy~0)) (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0))) (* (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0)))) main_~y~0))) (not (= (+ (* (- 1) main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) main_~b~0 (* (- 1) main_~q~0 main_~x~0) (* main_~p~0 main_~x~0)) main_~a~0)) (not (= (+ (* (- 1) main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) main_~b~0 (* (- 1) main_~q~0 main_~x~0) (* main_~p~0 main_~xy~0) (* main_~r~0 main_~yy~0) (* main_~p~0 main_~x~0)) (+ (* main_~y~0 main_~r~0) (* (+ (* (- 1) main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) main_~b~0 (* (- 1) main_~q~0 main_~x~0) (* main_~p~0 main_~x~0)) main_~y~0) (* main_~p~0 main_~x~0)))))} assume !!(#t~post6 < 50);havoc #t~post6; {36137#(or (= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* (+ main_~q~0 (* (- 1) main_~p~0)) main_~xy~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0))) (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~yy~0)) (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0))) (* (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0)))) main_~y~0))) (not (= (+ (* (- 1) main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) main_~b~0 (* (- 1) main_~q~0 main_~x~0) (* main_~p~0 main_~x~0)) main_~a~0)) (not (= (+ (* (- 1) main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) main_~b~0 (* (- 1) main_~q~0 main_~x~0) (* main_~p~0 main_~xy~0) (* main_~r~0 main_~yy~0) (* main_~p~0 main_~x~0)) (+ (* main_~y~0 main_~r~0) (* (+ (* (- 1) main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) main_~b~0 (* (- 1) main_~q~0 main_~x~0) (* main_~p~0 main_~x~0)) main_~y~0) (* main_~p~0 main_~x~0)))))} is VALID [2022-04-27 13:09:18,064 INFO L290 TraceCheckUtils]: 27: Hoare triple {36137#(or (= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* (+ main_~q~0 (* (- 1) main_~p~0)) main_~xy~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0))) (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~yy~0)) (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0))) (* (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0)))) main_~y~0))) (not (= (+ (* (- 1) main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) main_~b~0 (* (- 1) main_~q~0 main_~x~0) (* main_~p~0 main_~x~0)) main_~a~0)) (not (= (+ (* (- 1) main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) main_~b~0 (* (- 1) main_~q~0 main_~x~0) (* main_~p~0 main_~xy~0) (* main_~r~0 main_~yy~0) (* main_~p~0 main_~x~0)) (+ (* main_~y~0 main_~r~0) (* (+ (* (- 1) main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) main_~b~0 (* (- 1) main_~q~0 main_~x~0) (* main_~p~0 main_~x~0)) main_~y~0) (* main_~p~0 main_~x~0)))))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {36137#(or (= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* (+ main_~q~0 (* (- 1) main_~p~0)) main_~xy~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0))) (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~yy~0)) (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0))) (* (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0)))) main_~y~0))) (not (= (+ (* (- 1) main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) main_~b~0 (* (- 1) main_~q~0 main_~x~0) (* main_~p~0 main_~x~0)) main_~a~0)) (not (= (+ (* (- 1) main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) main_~b~0 (* (- 1) main_~q~0 main_~x~0) (* main_~p~0 main_~xy~0) (* main_~r~0 main_~yy~0) (* main_~p~0 main_~x~0)) (+ (* main_~y~0 main_~r~0) (* (+ (* (- 1) main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) main_~b~0 (* (- 1) main_~q~0 main_~x~0) (* main_~p~0 main_~x~0)) main_~y~0) (* main_~p~0 main_~x~0)))))} is VALID [2022-04-27 13:09:18,065 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {35438#true} {36137#(or (= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* (+ main_~q~0 (* (- 1) main_~p~0)) main_~xy~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0))) (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~yy~0)) (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0))) (* (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0)))) main_~y~0))) (not (= (+ (* (- 1) main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) main_~b~0 (* (- 1) main_~q~0 main_~x~0) (* main_~p~0 main_~x~0)) main_~a~0)) (not (= (+ (* (- 1) main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) main_~b~0 (* (- 1) main_~q~0 main_~x~0) (* main_~p~0 main_~xy~0) (* main_~r~0 main_~yy~0) (* main_~p~0 main_~x~0)) (+ (* main_~y~0 main_~r~0) (* (+ (* (- 1) main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) main_~b~0 (* (- 1) main_~q~0 main_~x~0) (* main_~p~0 main_~x~0)) main_~y~0) (* main_~p~0 main_~x~0)))))} #84#return; {36137#(or (= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* (+ main_~q~0 (* (- 1) main_~p~0)) main_~xy~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0))) (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~yy~0)) (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0))) (* (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0)))) main_~y~0))) (not (= (+ (* (- 1) main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) main_~b~0 (* (- 1) main_~q~0 main_~x~0) (* main_~p~0 main_~x~0)) main_~a~0)) (not (= (+ (* (- 1) main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) main_~b~0 (* (- 1) main_~q~0 main_~x~0) (* main_~p~0 main_~xy~0) (* main_~r~0 main_~yy~0) (* main_~p~0 main_~x~0)) (+ (* main_~y~0 main_~r~0) (* (+ (* (- 1) main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) main_~b~0 (* (- 1) main_~q~0 main_~x~0) (* main_~p~0 main_~x~0)) main_~y~0) (* main_~p~0 main_~x~0)))))} is VALID [2022-04-27 13:09:18,065 INFO L290 TraceCheckUtils]: 25: Hoare triple {35438#true} assume true; {35438#true} is VALID [2022-04-27 13:09:18,065 INFO L290 TraceCheckUtils]: 24: Hoare triple {35438#true} assume !(0 == ~cond); {35438#true} is VALID [2022-04-27 13:09:18,065 INFO L290 TraceCheckUtils]: 23: Hoare triple {35438#true} ~cond := #in~cond; {35438#true} is VALID [2022-04-27 13:09:18,065 INFO L272 TraceCheckUtils]: 22: Hoare triple {36137#(or (= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* (+ main_~q~0 (* (- 1) main_~p~0)) main_~xy~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0))) (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~yy~0)) (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0))) (* (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0)))) main_~y~0))) (not (= (+ (* (- 1) main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) main_~b~0 (* (- 1) main_~q~0 main_~x~0) (* main_~p~0 main_~x~0)) main_~a~0)) (not (= (+ (* (- 1) main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) main_~b~0 (* (- 1) main_~q~0 main_~x~0) (* main_~p~0 main_~xy~0) (* main_~r~0 main_~yy~0) (* main_~p~0 main_~x~0)) (+ (* main_~y~0 main_~r~0) (* (+ (* (- 1) main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) main_~b~0 (* (- 1) main_~q~0 main_~x~0) (* main_~p~0 main_~x~0)) main_~y~0) (* main_~p~0 main_~x~0)))))} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {35438#true} is VALID [2022-04-27 13:09:18,065 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {35438#true} {36137#(or (= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* (+ main_~q~0 (* (- 1) main_~p~0)) main_~xy~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0))) (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~yy~0)) (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0))) (* (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0)))) main_~y~0))) (not (= (+ (* (- 1) main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) main_~b~0 (* (- 1) main_~q~0 main_~x~0) (* main_~p~0 main_~x~0)) main_~a~0)) (not (= (+ (* (- 1) main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) main_~b~0 (* (- 1) main_~q~0 main_~x~0) (* main_~p~0 main_~xy~0) (* main_~r~0 main_~yy~0) (* main_~p~0 main_~x~0)) (+ (* main_~y~0 main_~r~0) (* (+ (* (- 1) main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) main_~b~0 (* (- 1) main_~q~0 main_~x~0) (* main_~p~0 main_~x~0)) main_~y~0) (* main_~p~0 main_~x~0)))))} #82#return; {36137#(or (= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* (+ main_~q~0 (* (- 1) main_~p~0)) main_~xy~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0))) (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~yy~0)) (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0))) (* (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0)))) main_~y~0))) (not (= (+ (* (- 1) main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) main_~b~0 (* (- 1) main_~q~0 main_~x~0) (* main_~p~0 main_~x~0)) main_~a~0)) (not (= (+ (* (- 1) main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) main_~b~0 (* (- 1) main_~q~0 main_~x~0) (* main_~p~0 main_~xy~0) (* main_~r~0 main_~yy~0) (* main_~p~0 main_~x~0)) (+ (* main_~y~0 main_~r~0) (* (+ (* (- 1) main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) main_~b~0 (* (- 1) main_~q~0 main_~x~0) (* main_~p~0 main_~x~0)) main_~y~0) (* main_~p~0 main_~x~0)))))} is VALID [2022-04-27 13:09:18,065 INFO L290 TraceCheckUtils]: 20: Hoare triple {35438#true} assume true; {35438#true} is VALID [2022-04-27 13:09:18,066 INFO L290 TraceCheckUtils]: 19: Hoare triple {35438#true} assume !(0 == ~cond); {35438#true} is VALID [2022-04-27 13:09:18,066 INFO L290 TraceCheckUtils]: 18: Hoare triple {35438#true} ~cond := #in~cond; {35438#true} is VALID [2022-04-27 13:09:18,066 INFO L272 TraceCheckUtils]: 17: Hoare triple {36137#(or (= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* (+ main_~q~0 (* (- 1) main_~p~0)) main_~xy~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0))) (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~yy~0)) (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0))) (* (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0)))) main_~y~0))) (not (= (+ (* (- 1) main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) main_~b~0 (* (- 1) main_~q~0 main_~x~0) (* main_~p~0 main_~x~0)) main_~a~0)) (not (= (+ (* (- 1) main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) main_~b~0 (* (- 1) main_~q~0 main_~x~0) (* main_~p~0 main_~xy~0) (* main_~r~0 main_~yy~0) (* main_~p~0 main_~x~0)) (+ (* main_~y~0 main_~r~0) (* (+ (* (- 1) main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) main_~b~0 (* (- 1) main_~q~0 main_~x~0) (* main_~p~0 main_~x~0)) main_~y~0) (* main_~p~0 main_~x~0)))))} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {35438#true} is VALID [2022-04-27 13:09:18,067 INFO L290 TraceCheckUtils]: 16: Hoare triple {35438#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; {36137#(or (= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* (+ main_~q~0 (* (- 1) main_~p~0)) main_~xy~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0))) (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~yy~0)) (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0))) (* (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0)))) main_~y~0))) (not (= (+ (* (- 1) main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) main_~b~0 (* (- 1) main_~q~0 main_~x~0) (* main_~p~0 main_~x~0)) main_~a~0)) (not (= (+ (* (- 1) main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) main_~b~0 (* (- 1) main_~q~0 main_~x~0) (* main_~p~0 main_~xy~0) (* main_~r~0 main_~yy~0) (* main_~p~0 main_~x~0)) (+ (* main_~y~0 main_~r~0) (* (+ (* (- 1) main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) main_~b~0 (* (- 1) main_~q~0 main_~x~0) (* main_~p~0 main_~x~0)) main_~y~0) (* main_~p~0 main_~x~0)))))} is VALID [2022-04-27 13:09:18,067 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {35438#true} {35438#true} #80#return; {35438#true} is VALID [2022-04-27 13:09:18,067 INFO L290 TraceCheckUtils]: 14: Hoare triple {35438#true} assume true; {35438#true} is VALID [2022-04-27 13:09:18,067 INFO L290 TraceCheckUtils]: 13: Hoare triple {35438#true} assume !(0 == ~cond); {35438#true} is VALID [2022-04-27 13:09:18,067 INFO L290 TraceCheckUtils]: 12: Hoare triple {35438#true} ~cond := #in~cond; {35438#true} is VALID [2022-04-27 13:09:18,067 INFO L272 TraceCheckUtils]: 11: Hoare triple {35438#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {35438#true} is VALID [2022-04-27 13:09:18,067 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {35438#true} {35438#true} #78#return; {35438#true} is VALID [2022-04-27 13:09:18,067 INFO L290 TraceCheckUtils]: 9: Hoare triple {35438#true} assume true; {35438#true} is VALID [2022-04-27 13:09:18,067 INFO L290 TraceCheckUtils]: 8: Hoare triple {35438#true} assume !(0 == ~cond); {35438#true} is VALID [2022-04-27 13:09:18,067 INFO L290 TraceCheckUtils]: 7: Hoare triple {35438#true} ~cond := #in~cond; {35438#true} is VALID [2022-04-27 13:09:18,067 INFO L272 TraceCheckUtils]: 6: Hoare triple {35438#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {35438#true} is VALID [2022-04-27 13:09:18,067 INFO L290 TraceCheckUtils]: 5: Hoare triple {35438#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {35438#true} is VALID [2022-04-27 13:09:18,068 INFO L272 TraceCheckUtils]: 4: Hoare triple {35438#true} call #t~ret8 := main(); {35438#true} is VALID [2022-04-27 13:09:18,068 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35438#true} {35438#true} #98#return; {35438#true} is VALID [2022-04-27 13:09:18,068 INFO L290 TraceCheckUtils]: 2: Hoare triple {35438#true} assume true; {35438#true} is VALID [2022-04-27 13:09:18,068 INFO L290 TraceCheckUtils]: 1: Hoare triple {35438#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);~counter~0 := 0; {35438#true} is VALID [2022-04-27 13:09:18,068 INFO L272 TraceCheckUtils]: 0: Hoare triple {35438#true} call ULTIMATE.init(); {35438#true} is VALID [2022-04-27 13:09:18,068 INFO L134 CoverageAnalysis]: Checked inductivity of 523 backedges. 100 proven. 49 refuted. 8 times theorem prover too weak. 366 trivial. 0 not checked. [2022-04-27 13:09:18,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:09:18,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371476538] [2022-04-27 13:09:18,069 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:09:18,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1890311047] [2022-04-27 13:09:18,069 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1890311047] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 13:09:18,069 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 13:09:18,069 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 22 [2022-04-27 13:09:18,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285733197] [2022-04-27 13:09:18,069 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 13:09:18,070 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 3.0) internal successors, (63), 20 states have internal predecessors, (63), 12 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (37), 14 states have call predecessors, (37), 11 states have call successors, (37) Word has length 128 [2022-04-27 13:09:18,070 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:09:18,070 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 22 states, 21 states have (on average 3.0) internal successors, (63), 20 states have internal predecessors, (63), 12 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (37), 14 states have call predecessors, (37), 11 states have call successors, (37) [2022-04-27 13:09:24,298 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 140 edges. 137 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-27 13:09:24,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-27 13:09:24,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:09:24,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-27 13:09:24,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=353, Unknown=5, NotChecked=0, Total=462 [2022-04-27 13:09:24,299 INFO L87 Difference]: Start difference. First operand 1321 states and 1632 transitions. Second operand has 22 states, 21 states have (on average 3.0) internal successors, (63), 20 states have internal predecessors, (63), 12 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (37), 14 states have call predecessors, (37), 11 states have call successors, (37) [2022-04-27 13:09:49,971 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 13:09:54,966 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:10:24,927 WARN L232 SmtUtils]: Spent 27.09s on a formula simplification that was a NOOP. DAG size: 132 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 13:11:05,720 WARN L232 SmtUtils]: Spent 37.30s on a formula simplification that was a NOOP. DAG size: 124 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 13:11:08,127 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 13:11:13,083 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 13:11:17,207 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 13:11:19,273 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 13:11:21,407 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 13:11:26,087 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 13:11:32,777 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 13:11:34,783 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 13:11:36,792 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 13:11:43,359 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 13:11:47,669 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 13:11:49,827 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 13:11:52,417 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 13:11:59,161 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 13:12:03,260 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 13:12:05,262 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 13:12:26,960 WARN L232 SmtUtils]: Spent 21.17s on a formula simplification that was a NOOP. DAG size: 106 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 13:12:35,133 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 13:12:51,053 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 13:12:53,787 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:13:06,437 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:13:12,417 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 13:13:16,099 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers []