/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/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/cohendiv-ll_unwindbound20.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 11:22:52,510 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 11:22:52,525 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 11:22:52,567 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 11:22:52,567 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 11:22:52,568 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 11:22:52,570 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 11:22:52,572 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 11:22:52,573 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 11:22:52,576 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 11:22:52,577 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 11:22:52,578 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 11:22:52,578 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 11:22:52,580 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 11:22:52,580 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 11:22:52,582 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 11:22:52,583 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 11:22:52,583 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 11:22:52,585 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 11:22:52,588 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 11:22:52,590 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 11:22:52,591 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 11:22:52,591 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 11:22:52,591 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 11:22:52,592 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 11:22:52,597 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 11:22:52,597 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 11:22:52,598 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 11:22:52,598 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 11:22:52,598 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 11:22:52,599 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 11:22:52,599 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 11:22:52,600 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 11:22:52,600 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 11:22:52,601 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 11:22:52,601 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 11:22:52,601 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 11:22:52,602 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 11:22:52,602 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 11:22:52,602 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 11:22:52,602 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 11:22:52,603 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 11:22:52,604 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-28 11:22:52,612 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 11:22:52,613 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 11:22:52,613 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 11:22:52,614 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 11:22:52,614 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 11:22:52,614 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 11:22:52,614 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 11:22:52,614 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 11:22:52,614 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 11:22:52,614 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 11:22:52,615 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 11:22:52,615 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 11:22:52,615 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 11:22:52,615 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 11:22:52,615 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 11:22:52,615 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 11:22:52,615 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 11:22:52,615 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 11:22:52,615 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 11:22:52,615 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 11:22:52,616 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 11:22:52,616 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-28 11:22:52,616 INFO L138 SettingsManager]: * Use separate solver for trace checks=false 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-28 11:22:52,767 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 11:22:52,778 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 11:22:52,780 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 11:22:52,780 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 11:22:52,781 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 11:22:52,781 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/cohendiv-ll_unwindbound20.c [2022-04-28 11:22:52,814 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6c48793b/a63e4847f4124189b7f0587326f87888/FLAGa93b4bfec [2022-04-28 11:22:53,153 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 11:22:53,154 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/cohendiv-ll_unwindbound20.c [2022-04-28 11:22:53,157 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6c48793b/a63e4847f4124189b7f0587326f87888/FLAGa93b4bfec [2022-04-28 11:22:53,165 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6c48793b/a63e4847f4124189b7f0587326f87888 [2022-04-28 11:22:53,166 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 11:22:53,167 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 11:22:53,168 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 11:22:53,168 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 11:22:53,170 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 11:22:53,171 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 11:22:53" (1/1) ... [2022-04-28 11:22:53,172 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45413a5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:22:53, skipping insertion in model container [2022-04-28 11:22:53,172 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 11:22:53" (1/1) ... [2022-04-28 11:22:53,176 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 11:22:53,183 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 11:22:53,288 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/cohendiv-ll_unwindbound20.c[576,589] [2022-04-28 11:22:53,312 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 11:22:53,323 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 11:22:53,330 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/cohendiv-ll_unwindbound20.c[576,589] [2022-04-28 11:22:53,339 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 11:22:53,346 INFO L208 MainTranslator]: Completed translation [2022-04-28 11:22:53,347 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:22:53 WrapperNode [2022-04-28 11:22:53,347 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 11:22:53,347 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 11:22:53,347 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 11:22:53,347 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 11:22:53,353 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:22:53" (1/1) ... [2022-04-28 11:22:53,353 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:22:53" (1/1) ... [2022-04-28 11:22:53,357 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:22:53" (1/1) ... [2022-04-28 11:22:53,357 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:22:53" (1/1) ... [2022-04-28 11:22:53,361 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:22:53" (1/1) ... [2022-04-28 11:22:53,363 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:22:53" (1/1) ... [2022-04-28 11:22:53,364 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:22:53" (1/1) ... [2022-04-28 11:22:53,365 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 11:22:53,365 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 11:22:53,366 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 11:22:53,366 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 11:22:53,366 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:22:53" (1/1) ... [2022-04-28 11:22:53,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 11:22:53,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:22:53,397 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-28 11:22:53,403 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-28 11:22:53,429 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 11:22:53,430 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 11:22:53,430 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 11:22:53,430 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 11:22:53,430 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 11:22:53,430 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 11:22:53,430 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 11:22:53,430 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 11:22:53,435 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 11:22:53,435 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 11:22:53,435 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 11:22:53,435 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 11:22:53,435 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 11:22:53,435 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 11:22:53,435 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 11:22:53,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 11:22:53,436 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 11:22:53,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 11:22:53,436 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 11:22:53,437 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 11:22:53,481 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 11:22:53,482 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 11:22:53,648 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 11:22:53,654 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 11:22:53,654 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-28 11:22:53,656 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 11:22:53 BoogieIcfgContainer [2022-04-28 11:22:53,656 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 11:22:53,660 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 11:22:53,660 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 11:22:53,662 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 11:22:53,663 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 11:22:53" (1/3) ... [2022-04-28 11:22:53,663 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@396b7371 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 11:22:53, skipping insertion in model container [2022-04-28 11:22:53,663 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:22:53" (2/3) ... [2022-04-28 11:22:53,663 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@396b7371 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 11:22:53, skipping insertion in model container [2022-04-28 11:22:53,663 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 11:22:53" (3/3) ... [2022-04-28 11:22:53,664 INFO L111 eAbstractionObserver]: Analyzing ICFG cohendiv-ll_unwindbound20.c [2022-04-28 11:22:53,673 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 11:22:53,673 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 11:22:53,712 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 11:22:53,716 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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@445c2934, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@4de5a06d [2022-04-28 11:22:53,716 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 11:22:53,722 INFO L276 IsEmpty]: Start isEmpty. Operand has 38 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 23 states have internal predecessors, (31), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 11:22:53,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-28 11:22:53,726 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:22:53,726 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:22:53,727 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:22:53,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:22:53,730 INFO L85 PathProgramCache]: Analyzing trace with hash -1588022502, now seen corresponding path program 1 times [2022-04-28 11:22:53,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:22:53,735 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1022307399] [2022-04-28 11:22:53,741 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 11:22:53,741 INFO L85 PathProgramCache]: Analyzing trace with hash -1588022502, now seen corresponding path program 2 times [2022-04-28 11:22:53,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:22:53,743 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504222089] [2022-04-28 11:22:53,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:22:53,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:22:53,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:22:53,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 11:22:53,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:22:53,856 INFO L290 TraceCheckUtils]: 0: Hoare triple {50#(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(14, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {41#true} is VALID [2022-04-28 11:22:53,856 INFO L290 TraceCheckUtils]: 1: Hoare triple {41#true} assume true; {41#true} is VALID [2022-04-28 11:22:53,856 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {41#true} {41#true} #93#return; {41#true} is VALID [2022-04-28 11:22:53,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-28 11:22:53,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:22:53,862 INFO L290 TraceCheckUtils]: 0: Hoare triple {41#true} ~cond := #in~cond; {41#true} is VALID [2022-04-28 11:22:53,863 INFO L290 TraceCheckUtils]: 1: Hoare triple {41#true} assume 0 == ~cond;assume false; {42#false} is VALID [2022-04-28 11:22:53,863 INFO L290 TraceCheckUtils]: 2: Hoare triple {42#false} assume true; {42#false} is VALID [2022-04-28 11:22:53,863 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42#false} {41#true} #77#return; {42#false} is VALID [2022-04-28 11:22:53,864 INFO L272 TraceCheckUtils]: 0: Hoare triple {41#true} call ULTIMATE.init(); {50#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 11:22:53,864 INFO L290 TraceCheckUtils]: 1: Hoare triple {50#(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(14, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {41#true} is VALID [2022-04-28 11:22:53,864 INFO L290 TraceCheckUtils]: 2: Hoare triple {41#true} assume true; {41#true} is VALID [2022-04-28 11:22:53,864 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41#true} {41#true} #93#return; {41#true} is VALID [2022-04-28 11:22:53,864 INFO L272 TraceCheckUtils]: 4: Hoare triple {41#true} call #t~ret8 := main(); {41#true} is VALID [2022-04-28 11:22:53,865 INFO L290 TraceCheckUtils]: 5: Hoare triple {41#true} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~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; {41#true} is VALID [2022-04-28 11:22:53,865 INFO L272 TraceCheckUtils]: 6: Hoare triple {41#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {41#true} is VALID [2022-04-28 11:22:53,865 INFO L290 TraceCheckUtils]: 7: Hoare triple {41#true} ~cond := #in~cond; {41#true} is VALID [2022-04-28 11:22:53,865 INFO L290 TraceCheckUtils]: 8: Hoare triple {41#true} assume 0 == ~cond;assume false; {42#false} is VALID [2022-04-28 11:22:53,866 INFO L290 TraceCheckUtils]: 9: Hoare triple {42#false} assume true; {42#false} is VALID [2022-04-28 11:22:53,866 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {42#false} {41#true} #77#return; {42#false} is VALID [2022-04-28 11:22:53,866 INFO L290 TraceCheckUtils]: 11: Hoare triple {42#false} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {42#false} is VALID [2022-04-28 11:22:53,866 INFO L290 TraceCheckUtils]: 12: Hoare triple {42#false} assume !true; {42#false} is VALID [2022-04-28 11:22:53,866 INFO L272 TraceCheckUtils]: 13: Hoare triple {42#false} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {42#false} is VALID [2022-04-28 11:22:53,866 INFO L290 TraceCheckUtils]: 14: Hoare triple {42#false} ~cond := #in~cond; {42#false} is VALID [2022-04-28 11:22:53,866 INFO L290 TraceCheckUtils]: 15: Hoare triple {42#false} assume 0 == ~cond; {42#false} is VALID [2022-04-28 11:22:53,867 INFO L290 TraceCheckUtils]: 16: Hoare triple {42#false} assume !false; {42#false} is VALID [2022-04-28 11:22:53,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 11:22:53,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:22:53,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504222089] [2022-04-28 11:22:53,868 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504222089] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:22:53,868 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:22:53,868 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 11:22:53,869 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:22:53,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1022307399] [2022-04-28 11:22:53,870 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1022307399] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:22:53,870 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:22:53,870 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 11:22:53,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838217788] [2022-04-28 11:22:53,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:22:53,873 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, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-28 11:22:53,874 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:22:53,876 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, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 11:22:53,892 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:22:53,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 11:22:53,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:22:53,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 11:22:53,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 11:22:53,906 INFO L87 Difference]: Start difference. First operand has 38 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 23 states have internal predecessors, (31), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) 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, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 11:22:54,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:22:54,020 INFO L93 Difference]: Finished difference Result 68 states and 101 transitions. [2022-04-28 11:22:54,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 11:22:54,021 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, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-28 11:22:54,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:22:54,022 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, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 11:22:54,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 101 transitions. [2022-04-28 11:22:54,037 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, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 11:22:54,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 101 transitions. [2022-04-28 11:22:54,042 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 101 transitions. [2022-04-28 11:22:54,121 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:22:54,131 INFO L225 Difference]: With dead ends: 68 [2022-04-28 11:22:54,131 INFO L226 Difference]: Without dead ends: 34 [2022-04-28 11:22:54,134 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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-28 11:22:54,137 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 10 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 11:22:54,138 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 49 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 11:22:54,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-28 11:22:54,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2022-04-28 11:22:54,162 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:22:54,162 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 33 states, 19 states have (on average 1.263157894736842) internal successors, (24), 20 states have internal predecessors, (24), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 11:22:54,163 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 33 states, 19 states have (on average 1.263157894736842) internal successors, (24), 20 states have internal predecessors, (24), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 11:22:54,163 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 33 states, 19 states have (on average 1.263157894736842) internal successors, (24), 20 states have internal predecessors, (24), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 11:22:54,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:22:54,166 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2022-04-28 11:22:54,166 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2022-04-28 11:22:54,167 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:22:54,167 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:22:54,167 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 19 states have (on average 1.263157894736842) internal successors, (24), 20 states have internal predecessors, (24), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 34 states. [2022-04-28 11:22:54,167 INFO L87 Difference]: Start difference. First operand has 33 states, 19 states have (on average 1.263157894736842) internal successors, (24), 20 states have internal predecessors, (24), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 34 states. [2022-04-28 11:22:54,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:22:54,170 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2022-04-28 11:22:54,170 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2022-04-28 11:22:54,171 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:22:54,171 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:22:54,171 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:22:54,171 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:22:54,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 19 states have (on average 1.263157894736842) internal successors, (24), 20 states have internal predecessors, (24), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 11:22:54,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 42 transitions. [2022-04-28 11:22:54,174 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 42 transitions. Word has length 17 [2022-04-28 11:22:54,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:22:54,174 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 42 transitions. [2022-04-28 11:22:54,174 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, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 11:22:54,174 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 42 transitions. [2022-04-28 11:22:54,209 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-28 11:22:54,209 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 42 transitions. [2022-04-28 11:22:54,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-28 11:22:54,209 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:22:54,210 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:22:54,210 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 11:22:54,210 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:22:54,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:22:54,212 INFO L85 PathProgramCache]: Analyzing trace with hash 766070672, now seen corresponding path program 1 times [2022-04-28 11:22:54,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:22:54,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1709564770] [2022-04-28 11:22:54,213 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 11:22:54,214 INFO L85 PathProgramCache]: Analyzing trace with hash 766070672, now seen corresponding path program 2 times [2022-04-28 11:22:54,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:22:54,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275601627] [2022-04-28 11:22:54,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:22:54,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:22:54,243 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:22:54,243 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [685592938] [2022-04-28 11:22:54,243 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:22:54,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:22:54,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:22:54,248 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-28 11:22:54,281 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-28 11:22:54,329 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-28 11:22:54,329 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:22:54,331 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-28 11:22:54,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:22:54,345 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:22:54,483 INFO L272 TraceCheckUtils]: 0: Hoare triple {323#true} call ULTIMATE.init(); {323#true} is VALID [2022-04-28 11:22:54,484 INFO L290 TraceCheckUtils]: 1: Hoare triple {323#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(14, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {331#(<= ~counter~0 0)} is VALID [2022-04-28 11:22:54,485 INFO L290 TraceCheckUtils]: 2: Hoare triple {331#(<= ~counter~0 0)} assume true; {331#(<= ~counter~0 0)} is VALID [2022-04-28 11:22:54,485 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {331#(<= ~counter~0 0)} {323#true} #93#return; {331#(<= ~counter~0 0)} is VALID [2022-04-28 11:22:54,486 INFO L272 TraceCheckUtils]: 4: Hoare triple {331#(<= ~counter~0 0)} call #t~ret8 := main(); {331#(<= ~counter~0 0)} is VALID [2022-04-28 11:22:54,487 INFO L290 TraceCheckUtils]: 5: Hoare triple {331#(<= ~counter~0 0)} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~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; {331#(<= ~counter~0 0)} is VALID [2022-04-28 11:22:54,488 INFO L272 TraceCheckUtils]: 6: Hoare triple {331#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {331#(<= ~counter~0 0)} is VALID [2022-04-28 11:22:54,488 INFO L290 TraceCheckUtils]: 7: Hoare triple {331#(<= ~counter~0 0)} ~cond := #in~cond; {331#(<= ~counter~0 0)} is VALID [2022-04-28 11:22:54,488 INFO L290 TraceCheckUtils]: 8: Hoare triple {331#(<= ~counter~0 0)} assume !(0 == ~cond); {331#(<= ~counter~0 0)} is VALID [2022-04-28 11:22:54,489 INFO L290 TraceCheckUtils]: 9: Hoare triple {331#(<= ~counter~0 0)} assume true; {331#(<= ~counter~0 0)} is VALID [2022-04-28 11:22:54,489 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {331#(<= ~counter~0 0)} {331#(<= ~counter~0 0)} #77#return; {331#(<= ~counter~0 0)} is VALID [2022-04-28 11:22:54,490 INFO L290 TraceCheckUtils]: 11: Hoare triple {331#(<= ~counter~0 0)} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {331#(<= ~counter~0 0)} is VALID [2022-04-28 11:22:54,491 INFO L290 TraceCheckUtils]: 12: Hoare triple {331#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {365#(<= |main_#t~post6| 0)} is VALID [2022-04-28 11:22:54,491 INFO L290 TraceCheckUtils]: 13: Hoare triple {365#(<= |main_#t~post6| 0)} assume !(#t~post6 < 20);havoc #t~post6; {324#false} is VALID [2022-04-28 11:22:54,492 INFO L272 TraceCheckUtils]: 14: Hoare triple {324#false} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {324#false} is VALID [2022-04-28 11:22:54,492 INFO L290 TraceCheckUtils]: 15: Hoare triple {324#false} ~cond := #in~cond; {324#false} is VALID [2022-04-28 11:22:54,492 INFO L290 TraceCheckUtils]: 16: Hoare triple {324#false} assume 0 == ~cond; {324#false} is VALID [2022-04-28 11:22:54,492 INFO L290 TraceCheckUtils]: 17: Hoare triple {324#false} assume !false; {324#false} is VALID [2022-04-28 11:22:54,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 11:22:54,493 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 11:22:54,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:22:54,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275601627] [2022-04-28 11:22:54,494 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:22:54,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [685592938] [2022-04-28 11:22:54,495 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [685592938] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:22:54,495 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:22:54,495 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 11:22:54,496 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:22:54,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1709564770] [2022-04-28 11:22:54,496 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1709564770] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:22:54,496 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:22:54,496 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 11:22:54,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936589985] [2022-04-28 11:22:54,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:22:54,498 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, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2022-04-28 11:22:54,498 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:22:54,498 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, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 11:22:54,512 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:22:54,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 11:22:54,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:22:54,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 11:22:54,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 11:22:54,514 INFO L87 Difference]: Start difference. First operand 33 states and 42 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, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 11:22:54,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:22:54,613 INFO L93 Difference]: Finished difference Result 42 states and 51 transitions. [2022-04-28 11:22:54,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 11:22:54,614 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, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2022-04-28 11:22:54,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:22:54,614 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, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 11:22:54,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 51 transitions. [2022-04-28 11:22:54,622 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, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 11:22:54,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 51 transitions. [2022-04-28 11:22:54,624 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 51 transitions. [2022-04-28 11:22:54,677 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:22:54,681 INFO L225 Difference]: With dead ends: 42 [2022-04-28 11:22:54,681 INFO L226 Difference]: Without dead ends: 35 [2022-04-28 11:22:54,681 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 15 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-28 11:22:54,683 INFO L413 NwaCegarLoop]: 40 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, 107 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-28 11:22:54,685 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 107 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 11:22:54,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-28 11:22:54,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2022-04-28 11:22:54,705 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:22:54,705 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 35 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 11:22:54,706 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 35 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 11:22:54,708 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 35 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 11:22:54,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:22:54,711 INFO L93 Difference]: Finished difference Result 35 states and 44 transitions. [2022-04-28 11:22:54,711 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 44 transitions. [2022-04-28 11:22:54,712 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:22:54,712 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:22:54,712 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 35 states. [2022-04-28 11:22:54,713 INFO L87 Difference]: Start difference. First operand has 35 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 35 states. [2022-04-28 11:22:54,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:22:54,715 INFO L93 Difference]: Finished difference Result 35 states and 44 transitions. [2022-04-28 11:22:54,715 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 44 transitions. [2022-04-28 11:22:54,715 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:22:54,715 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:22:54,715 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:22:54,715 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:22:54,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 11:22:54,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 44 transitions. [2022-04-28 11:22:54,717 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 44 transitions. Word has length 18 [2022-04-28 11:22:54,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:22:54,718 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 44 transitions. [2022-04-28 11:22:54,718 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, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 11:22:54,718 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 44 transitions. [2022-04-28 11:22:54,760 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:22:54,760 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 44 transitions. [2022-04-28 11:22:54,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-28 11:22:54,763 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:22:54,766 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:22:54,793 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-28 11:22:54,979 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-28 11:22:54,980 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:22:54,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:22:54,980 INFO L85 PathProgramCache]: Analyzing trace with hash 767560222, now seen corresponding path program 1 times [2022-04-28 11:22:54,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:22:54,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [599133393] [2022-04-28 11:22:54,981 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 11:22:54,981 INFO L85 PathProgramCache]: Analyzing trace with hash 767560222, now seen corresponding path program 2 times [2022-04-28 11:22:54,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:22:54,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026748180] [2022-04-28 11:22:54,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:22:54,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:22:54,993 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:22:54,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [846648173] [2022-04-28 11:22:54,993 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:22:54,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:22:54,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:22:55,010 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-28 11:22:55,014 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-28 11:22:55,050 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-28 11:22:55,050 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:22:55,051 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 11:22:55,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:22:55,057 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:22:57,308 INFO L272 TraceCheckUtils]: 0: Hoare triple {604#true} call ULTIMATE.init(); {604#true} is VALID [2022-04-28 11:22:57,309 INFO L290 TraceCheckUtils]: 1: Hoare triple {604#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(14, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {604#true} is VALID [2022-04-28 11:22:57,309 INFO L290 TraceCheckUtils]: 2: Hoare triple {604#true} assume true; {604#true} is VALID [2022-04-28 11:22:57,309 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {604#true} {604#true} #93#return; {604#true} is VALID [2022-04-28 11:22:57,309 INFO L272 TraceCheckUtils]: 4: Hoare triple {604#true} call #t~ret8 := main(); {604#true} is VALID [2022-04-28 11:22:57,309 INFO L290 TraceCheckUtils]: 5: Hoare triple {604#true} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~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; {604#true} is VALID [2022-04-28 11:22:57,309 INFO L272 TraceCheckUtils]: 6: Hoare triple {604#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {604#true} is VALID [2022-04-28 11:22:57,310 INFO L290 TraceCheckUtils]: 7: Hoare triple {604#true} ~cond := #in~cond; {604#true} is VALID [2022-04-28 11:22:57,310 INFO L290 TraceCheckUtils]: 8: Hoare triple {604#true} assume !(0 == ~cond); {604#true} is VALID [2022-04-28 11:22:57,310 INFO L290 TraceCheckUtils]: 9: Hoare triple {604#true} assume true; {604#true} is VALID [2022-04-28 11:22:57,310 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {604#true} {604#true} #77#return; {604#true} is VALID [2022-04-28 11:22:57,310 INFO L290 TraceCheckUtils]: 11: Hoare triple {604#true} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {642#(and (= main_~a~0 0) (= main_~b~0 0))} is VALID [2022-04-28 11:22:57,311 INFO L290 TraceCheckUtils]: 12: Hoare triple {642#(and (= main_~a~0 0) (= main_~b~0 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {642#(and (= main_~a~0 0) (= main_~b~0 0))} is VALID [2022-04-28 11:22:57,311 INFO L290 TraceCheckUtils]: 13: Hoare triple {642#(and (= main_~a~0 0) (= main_~b~0 0))} assume !!(#t~post6 < 20);havoc #t~post6; {642#(and (= main_~a~0 0) (= main_~b~0 0))} is VALID [2022-04-28 11:22:57,312 INFO L272 TraceCheckUtils]: 14: Hoare triple {642#(and (= main_~a~0 0) (= main_~b~0 0))} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {652#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:22:57,313 INFO L290 TraceCheckUtils]: 15: Hoare triple {652#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {656#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:22:57,313 INFO L290 TraceCheckUtils]: 16: Hoare triple {656#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {605#false} is VALID [2022-04-28 11:22:57,313 INFO L290 TraceCheckUtils]: 17: Hoare triple {605#false} assume !false; {605#false} is VALID [2022-04-28 11:22:57,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 11:22:57,313 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 11:22:57,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:22:57,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026748180] [2022-04-28 11:22:57,314 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:22:57,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [846648173] [2022-04-28 11:22:57,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [846648173] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:22:57,314 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:22:57,314 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 11:22:57,314 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:22:57,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [599133393] [2022-04-28 11:22:57,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [599133393] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:22:57,314 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:22:57,314 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 11:22:57,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723045706] [2022-04-28 11:22:57,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:22:57,315 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-04-28 11:22:57,315 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:22:57,315 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 11:22:57,331 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:22:57,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 11:22:57,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:22:57,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 11:22:57,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 11:22:57,331 INFO L87 Difference]: Start difference. First operand 35 states and 44 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 11:22:57,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:22:57,471 INFO L93 Difference]: Finished difference Result 45 states and 56 transitions. [2022-04-28 11:22:57,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 11:22:57,471 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-04-28 11:22:57,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:22:57,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 11:22:57,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 56 transitions. [2022-04-28 11:22:57,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 11:22:57,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 56 transitions. [2022-04-28 11:22:57,474 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 56 transitions. [2022-04-28 11:22:57,511 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-28 11:22:57,512 INFO L225 Difference]: With dead ends: 45 [2022-04-28 11:22:57,512 INFO L226 Difference]: Without dead ends: 43 [2022-04-28 11:22:57,513 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 11:22:57,513 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 6 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 11:22:57,513 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 145 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 11:22:57,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-04-28 11:22:57,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 40. [2022-04-28 11:22:57,526 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:22:57,527 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand has 40 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 26 states have internal predecessors, (29), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 11:22:57,527 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand has 40 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 26 states have internal predecessors, (29), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 11:22:57,527 INFO L87 Difference]: Start difference. First operand 43 states. Second operand has 40 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 26 states have internal predecessors, (29), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 11:22:57,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:22:57,529 INFO L93 Difference]: Finished difference Result 43 states and 54 transitions. [2022-04-28 11:22:57,529 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 54 transitions. [2022-04-28 11:22:57,530 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:22:57,530 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:22:57,530 INFO L74 IsIncluded]: Start isIncluded. First operand has 40 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 26 states have internal predecessors, (29), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) Second operand 43 states. [2022-04-28 11:22:57,530 INFO L87 Difference]: Start difference. First operand has 40 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 26 states have internal predecessors, (29), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) Second operand 43 states. [2022-04-28 11:22:57,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:22:57,532 INFO L93 Difference]: Finished difference Result 43 states and 54 transitions. [2022-04-28 11:22:57,532 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 54 transitions. [2022-04-28 11:22:57,533 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:22:57,533 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:22:57,533 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:22:57,533 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:22:57,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 26 states have internal predecessors, (29), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 11:22:57,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 49 transitions. [2022-04-28 11:22:57,535 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 49 transitions. Word has length 18 [2022-04-28 11:22:57,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:22:57,535 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 49 transitions. [2022-04-28 11:22:57,535 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 11:22:57,535 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 40 states and 49 transitions. [2022-04-28 11:22:57,575 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:22:57,575 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 49 transitions. [2022-04-28 11:22:57,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-28 11:22:57,576 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:22:57,576 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:22:57,609 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-28 11:22:57,810 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-28 11:22:57,810 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:22:57,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:22:57,811 INFO L85 PathProgramCache]: Analyzing trace with hash -1016228092, now seen corresponding path program 1 times [2022-04-28 11:22:57,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:22:57,811 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [384103029] [2022-04-28 11:22:57,811 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 11:22:57,811 INFO L85 PathProgramCache]: Analyzing trace with hash -1016228092, now seen corresponding path program 2 times [2022-04-28 11:22:57,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:22:57,814 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347168794] [2022-04-28 11:22:57,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:22:57,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:22:57,843 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:22:57,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1203329136] [2022-04-28 11:22:57,844 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:22:57,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:22:57,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:22:57,848 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-28 11:22:57,872 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-28 11:22:57,918 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 11:22:57,918 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:22:57,919 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 11:22:57,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:22:57,927 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:22:58,056 INFO L272 TraceCheckUtils]: 0: Hoare triple {920#true} call ULTIMATE.init(); {920#true} is VALID [2022-04-28 11:22:58,056 INFO L290 TraceCheckUtils]: 1: Hoare triple {920#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(14, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {920#true} is VALID [2022-04-28 11:22:58,056 INFO L290 TraceCheckUtils]: 2: Hoare triple {920#true} assume true; {920#true} is VALID [2022-04-28 11:22:58,056 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {920#true} {920#true} #93#return; {920#true} is VALID [2022-04-28 11:22:58,057 INFO L272 TraceCheckUtils]: 4: Hoare triple {920#true} call #t~ret8 := main(); {920#true} is VALID [2022-04-28 11:22:58,057 INFO L290 TraceCheckUtils]: 5: Hoare triple {920#true} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~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; {920#true} is VALID [2022-04-28 11:22:58,057 INFO L272 TraceCheckUtils]: 6: Hoare triple {920#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {920#true} is VALID [2022-04-28 11:22:58,057 INFO L290 TraceCheckUtils]: 7: Hoare triple {920#true} ~cond := #in~cond; {920#true} is VALID [2022-04-28 11:22:58,057 INFO L290 TraceCheckUtils]: 8: Hoare triple {920#true} assume !(0 == ~cond); {920#true} is VALID [2022-04-28 11:22:58,057 INFO L290 TraceCheckUtils]: 9: Hoare triple {920#true} assume true; {920#true} is VALID [2022-04-28 11:22:58,057 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {920#true} {920#true} #77#return; {920#true} is VALID [2022-04-28 11:22:58,058 INFO L290 TraceCheckUtils]: 11: Hoare triple {920#true} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {958#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:22:58,058 INFO L290 TraceCheckUtils]: 12: Hoare triple {958#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {958#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:22:58,059 INFO L290 TraceCheckUtils]: 13: Hoare triple {958#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} assume !!(#t~post6 < 20);havoc #t~post6; {958#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:22:58,061 INFO L272 TraceCheckUtils]: 14: Hoare triple {958#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {920#true} is VALID [2022-04-28 11:22:58,062 INFO L290 TraceCheckUtils]: 15: Hoare triple {920#true} ~cond := #in~cond; {920#true} is VALID [2022-04-28 11:22:58,062 INFO L290 TraceCheckUtils]: 16: Hoare triple {920#true} assume !(0 == ~cond); {920#true} is VALID [2022-04-28 11:22:58,062 INFO L290 TraceCheckUtils]: 17: Hoare triple {920#true} assume true; {920#true} is VALID [2022-04-28 11:22:58,063 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {920#true} {958#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #79#return; {958#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:22:58,063 INFO L272 TraceCheckUtils]: 19: Hoare triple {958#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {983#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:22:58,064 INFO L290 TraceCheckUtils]: 20: Hoare triple {983#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {987#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:22:58,065 INFO L290 TraceCheckUtils]: 21: Hoare triple {987#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {921#false} is VALID [2022-04-28 11:22:58,065 INFO L290 TraceCheckUtils]: 22: Hoare triple {921#false} assume !false; {921#false} is VALID [2022-04-28 11:22:58,066 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 11:22:58,066 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 11:22:58,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:22:58,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347168794] [2022-04-28 11:22:58,066 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:22:58,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1203329136] [2022-04-28 11:22:58,066 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1203329136] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:22:58,067 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:22:58,067 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 11:22:58,067 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:22:58,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [384103029] [2022-04-28 11:22:58,067 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [384103029] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:22:58,067 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:22:58,067 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 11:22:58,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274517057] [2022-04-28 11:22:58,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:22:58,068 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, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-28 11:22:58,068 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:22:58,068 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, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 11:22:58,086 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-28 11:22:58,087 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 11:22:58,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:22:58,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 11:22:58,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 11:22:58,088 INFO L87 Difference]: Start difference. First operand 40 states and 49 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, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 11:22:58,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:22:58,272 INFO L93 Difference]: Finished difference Result 58 states and 74 transitions. [2022-04-28 11:22:58,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 11:22:58,272 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, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-28 11:22:58,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:22:58,273 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, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 11:22:58,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 71 transitions. [2022-04-28 11:22:58,275 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, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 11:22:58,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 71 transitions. [2022-04-28 11:22:58,276 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 71 transitions. [2022-04-28 11:22:58,325 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-28 11:22:58,327 INFO L225 Difference]: With dead ends: 58 [2022-04-28 11:22:58,327 INFO L226 Difference]: Without dead ends: 55 [2022-04-28 11:22:58,327 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 11:22:58,327 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 13 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 11:22:58,328 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 139 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 11:22:58,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-04-28 11:22:58,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 54. [2022-04-28 11:22:58,343 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:22:58,344 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-28 11:22:58,344 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-28 11:22:58,344 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-28 11:22:58,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:22:58,346 INFO L93 Difference]: Finished difference Result 55 states and 70 transitions. [2022-04-28 11:22:58,346 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 70 transitions. [2022-04-28 11:22:58,347 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:22:58,347 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:22:58,347 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-28 11:22:58,347 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-28 11:22:58,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:22:58,349 INFO L93 Difference]: Finished difference Result 55 states and 70 transitions. [2022-04-28 11:22:58,349 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 70 transitions. [2022-04-28 11:22:58,350 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:22:58,350 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:22:58,350 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:22:58,350 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:22:58,350 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-28 11:22:58,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 69 transitions. [2022-04-28 11:22:58,352 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 69 transitions. Word has length 23 [2022-04-28 11:22:58,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:22:58,352 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 69 transitions. [2022-04-28 11:22:58,352 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, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 11:22:58,352 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 54 states and 69 transitions. [2022-04-28 11:22:58,405 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:22:58,405 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 69 transitions. [2022-04-28 11:22:58,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-28 11:22:58,406 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:22:58,406 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-04-28 11:22:58,425 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-04-28 11:22:58,627 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-28 11:22:58,628 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:22:58,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:22:58,628 INFO L85 PathProgramCache]: Analyzing trace with hash 2019703110, now seen corresponding path program 1 times [2022-04-28 11:22:58,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:22:58,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1866815021] [2022-04-28 11:22:58,629 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 11:22:58,629 INFO L85 PathProgramCache]: Analyzing trace with hash 2019703110, now seen corresponding path program 2 times [2022-04-28 11:22:58,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:22:58,629 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214341985] [2022-04-28 11:22:58,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:22:58,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:22:58,640 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:22:58,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [714863003] [2022-04-28 11:22:58,640 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:22:58,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:22:58,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:22:58,643 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-28 11:22:58,651 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-28 11:22:58,717 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 11:22:58,718 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:22:58,724 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 11:22:58,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:22:58,743 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:22:58,839 INFO L272 TraceCheckUtils]: 0: Hoare triple {1329#true} call ULTIMATE.init(); {1329#true} is VALID [2022-04-28 11:22:58,839 INFO L290 TraceCheckUtils]: 1: Hoare triple {1329#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(14, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1329#true} is VALID [2022-04-28 11:22:58,839 INFO L290 TraceCheckUtils]: 2: Hoare triple {1329#true} assume true; {1329#true} is VALID [2022-04-28 11:22:58,839 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1329#true} {1329#true} #93#return; {1329#true} is VALID [2022-04-28 11:22:58,839 INFO L272 TraceCheckUtils]: 4: Hoare triple {1329#true} call #t~ret8 := main(); {1329#true} is VALID [2022-04-28 11:22:58,839 INFO L290 TraceCheckUtils]: 5: Hoare triple {1329#true} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~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; {1329#true} is VALID [2022-04-28 11:22:58,839 INFO L272 TraceCheckUtils]: 6: Hoare triple {1329#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1329#true} is VALID [2022-04-28 11:22:58,840 INFO L290 TraceCheckUtils]: 7: Hoare triple {1329#true} ~cond := #in~cond; {1329#true} is VALID [2022-04-28 11:22:58,840 INFO L290 TraceCheckUtils]: 8: Hoare triple {1329#true} assume !(0 == ~cond); {1329#true} is VALID [2022-04-28 11:22:58,840 INFO L290 TraceCheckUtils]: 9: Hoare triple {1329#true} assume true; {1329#true} is VALID [2022-04-28 11:22:58,840 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1329#true} {1329#true} #77#return; {1329#true} is VALID [2022-04-28 11:22:58,840 INFO L290 TraceCheckUtils]: 11: Hoare triple {1329#true} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {1329#true} is VALID [2022-04-28 11:22:58,840 INFO L290 TraceCheckUtils]: 12: Hoare triple {1329#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1329#true} is VALID [2022-04-28 11:22:58,840 INFO L290 TraceCheckUtils]: 13: Hoare triple {1329#true} assume !!(#t~post6 < 20);havoc #t~post6; {1329#true} is VALID [2022-04-28 11:22:58,840 INFO L272 TraceCheckUtils]: 14: Hoare triple {1329#true} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {1329#true} is VALID [2022-04-28 11:22:58,840 INFO L290 TraceCheckUtils]: 15: Hoare triple {1329#true} ~cond := #in~cond; {1329#true} is VALID [2022-04-28 11:22:58,840 INFO L290 TraceCheckUtils]: 16: Hoare triple {1329#true} assume !(0 == ~cond); {1329#true} is VALID [2022-04-28 11:22:58,841 INFO L290 TraceCheckUtils]: 17: Hoare triple {1329#true} assume true; {1329#true} is VALID [2022-04-28 11:22:58,841 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1329#true} {1329#true} #79#return; {1329#true} is VALID [2022-04-28 11:22:58,841 INFO L272 TraceCheckUtils]: 19: Hoare triple {1329#true} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {1329#true} is VALID [2022-04-28 11:22:58,841 INFO L290 TraceCheckUtils]: 20: Hoare triple {1329#true} ~cond := #in~cond; {1329#true} is VALID [2022-04-28 11:22:58,841 INFO L290 TraceCheckUtils]: 21: Hoare triple {1329#true} assume !(0 == ~cond); {1329#true} is VALID [2022-04-28 11:22:58,841 INFO L290 TraceCheckUtils]: 22: Hoare triple {1329#true} assume true; {1329#true} is VALID [2022-04-28 11:22:58,841 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1329#true} {1329#true} #81#return; {1329#true} is VALID [2022-04-28 11:22:58,842 INFO L290 TraceCheckUtils]: 24: Hoare triple {1329#true} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {1406#(and (= main_~a~0 1) (= main_~b~0 main_~y~0))} is VALID [2022-04-28 11:22:58,842 INFO L290 TraceCheckUtils]: 25: Hoare triple {1406#(and (= main_~a~0 1) (= main_~b~0 main_~y~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {1406#(and (= main_~a~0 1) (= main_~b~0 main_~y~0))} is VALID [2022-04-28 11:22:58,842 INFO L290 TraceCheckUtils]: 26: Hoare triple {1406#(and (= main_~a~0 1) (= main_~b~0 main_~y~0))} assume !!(#t~post7 < 20);havoc #t~post7; {1406#(and (= main_~a~0 1) (= main_~b~0 main_~y~0))} is VALID [2022-04-28 11:22:58,843 INFO L272 TraceCheckUtils]: 27: Hoare triple {1406#(and (= main_~a~0 1) (= main_~b~0 main_~y~0))} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {1416#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:22:58,843 INFO L290 TraceCheckUtils]: 28: Hoare triple {1416#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1420#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:22:58,844 INFO L290 TraceCheckUtils]: 29: Hoare triple {1420#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1330#false} is VALID [2022-04-28 11:22:58,844 INFO L290 TraceCheckUtils]: 30: Hoare triple {1330#false} assume !false; {1330#false} is VALID [2022-04-28 11:22:58,844 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 11:22:58,844 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 11:22:58,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:22:58,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214341985] [2022-04-28 11:22:58,844 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:22:58,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [714863003] [2022-04-28 11:22:58,844 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [714863003] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:22:58,844 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:22:58,844 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 11:22:58,845 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:22:58,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1866815021] [2022-04-28 11:22:58,845 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1866815021] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:22:58,845 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:22:58,845 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 11:22:58,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992924123] [2022-04-28 11:22:58,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:22:58,845 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, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 31 [2022-04-28 11:22:58,845 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:22:58,846 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, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-28 11:22:58,861 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:22:58,862 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 11:22:58,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:22:58,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 11:22:58,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 11:22:58,862 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, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-28 11:22:59,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:22:59,046 INFO L93 Difference]: Finished difference Result 83 states and 113 transitions. [2022-04-28 11:22:59,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 11:22:59,046 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, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 31 [2022-04-28 11:22:59,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:22:59,047 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, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-28 11:22:59,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 72 transitions. [2022-04-28 11:22:59,048 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, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-28 11:22:59,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 72 transitions. [2022-04-28 11:22:59,049 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 72 transitions. [2022-04-28 11:22:59,083 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:22:59,084 INFO L225 Difference]: With dead ends: 83 [2022-04-28 11:22:59,084 INFO L226 Difference]: Without dead ends: 81 [2022-04-28 11:22:59,085 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 11:22:59,099 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 13 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 11:22:59,100 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 145 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 11:22:59,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-04-28 11:22:59,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 74. [2022-04-28 11:22:59,127 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:22:59,127 INFO L82 GeneralOperation]: Start isEquivalent. First operand 81 states. Second operand has 74 states, 44 states have (on average 1.2727272727272727) internal successors, (56), 46 states have internal predecessors, (56), 23 states have call successors, (23), 7 states have call predecessors, (23), 6 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-28 11:22:59,128 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand has 74 states, 44 states have (on average 1.2727272727272727) internal successors, (56), 46 states have internal predecessors, (56), 23 states have call successors, (23), 7 states have call predecessors, (23), 6 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-28 11:22:59,128 INFO L87 Difference]: Start difference. First operand 81 states. Second operand has 74 states, 44 states have (on average 1.2727272727272727) internal successors, (56), 46 states have internal predecessors, (56), 23 states have call successors, (23), 7 states have call predecessors, (23), 6 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-28 11:22:59,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:22:59,132 INFO L93 Difference]: Finished difference Result 81 states and 111 transitions. [2022-04-28 11:22:59,132 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 111 transitions. [2022-04-28 11:22:59,132 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:22:59,132 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:22:59,133 INFO L74 IsIncluded]: Start isIncluded. First operand has 74 states, 44 states have (on average 1.2727272727272727) internal successors, (56), 46 states have internal predecessors, (56), 23 states have call successors, (23), 7 states have call predecessors, (23), 6 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) Second operand 81 states. [2022-04-28 11:22:59,133 INFO L87 Difference]: Start difference. First operand has 74 states, 44 states have (on average 1.2727272727272727) internal successors, (56), 46 states have internal predecessors, (56), 23 states have call successors, (23), 7 states have call predecessors, (23), 6 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) Second operand 81 states. [2022-04-28 11:22:59,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:22:59,141 INFO L93 Difference]: Finished difference Result 81 states and 111 transitions. [2022-04-28 11:22:59,141 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 111 transitions. [2022-04-28 11:22:59,142 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:22:59,142 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:22:59,142 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:22:59,142 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:22:59,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 44 states have (on average 1.2727272727272727) internal successors, (56), 46 states have internal predecessors, (56), 23 states have call successors, (23), 7 states have call predecessors, (23), 6 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-28 11:22:59,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 100 transitions. [2022-04-28 11:22:59,151 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 100 transitions. Word has length 31 [2022-04-28 11:22:59,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:22:59,151 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 100 transitions. [2022-04-28 11:22:59,151 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, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-28 11:22:59,151 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 74 states and 100 transitions. [2022-04-28 11:22:59,239 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:22:59,239 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 100 transitions. [2022-04-28 11:22:59,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-28 11:22:59,239 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:22:59,239 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:22:59,267 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-28 11:22:59,467 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-28 11:22:59,468 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:22:59,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:22:59,468 INFO L85 PathProgramCache]: Analyzing trace with hash 202176206, now seen corresponding path program 1 times [2022-04-28 11:22:59,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:22:59,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [244081337] [2022-04-28 11:23:07,614 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:23:07,615 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:23:07,615 INFO L85 PathProgramCache]: Analyzing trace with hash 202176206, now seen corresponding path program 2 times [2022-04-28 11:23:07,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:23:07,615 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077624819] [2022-04-28 11:23:07,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:23:07,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:23:07,628 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:23:07,629 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [72458758] [2022-04-28 11:23:07,629 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:23:07,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:23:07,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:23:07,630 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-28 11:23:07,661 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-28 11:23:07,686 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 11:23:07,686 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:23:07,687 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 11:23:07,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:23:07,697 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:23:07,853 INFO L272 TraceCheckUtils]: 0: Hoare triple {1904#true} call ULTIMATE.init(); {1904#true} is VALID [2022-04-28 11:23:07,853 INFO L290 TraceCheckUtils]: 1: Hoare triple {1904#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(14, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1912#(<= ~counter~0 0)} is VALID [2022-04-28 11:23:07,854 INFO L290 TraceCheckUtils]: 2: Hoare triple {1912#(<= ~counter~0 0)} assume true; {1912#(<= ~counter~0 0)} is VALID [2022-04-28 11:23:07,856 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1912#(<= ~counter~0 0)} {1904#true} #93#return; {1912#(<= ~counter~0 0)} is VALID [2022-04-28 11:23:07,856 INFO L272 TraceCheckUtils]: 4: Hoare triple {1912#(<= ~counter~0 0)} call #t~ret8 := main(); {1912#(<= ~counter~0 0)} is VALID [2022-04-28 11:23:07,863 INFO L290 TraceCheckUtils]: 5: Hoare triple {1912#(<= ~counter~0 0)} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~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; {1912#(<= ~counter~0 0)} is VALID [2022-04-28 11:23:07,864 INFO L272 TraceCheckUtils]: 6: Hoare triple {1912#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1912#(<= ~counter~0 0)} is VALID [2022-04-28 11:23:07,864 INFO L290 TraceCheckUtils]: 7: Hoare triple {1912#(<= ~counter~0 0)} ~cond := #in~cond; {1912#(<= ~counter~0 0)} is VALID [2022-04-28 11:23:07,864 INFO L290 TraceCheckUtils]: 8: Hoare triple {1912#(<= ~counter~0 0)} assume !(0 == ~cond); {1912#(<= ~counter~0 0)} is VALID [2022-04-28 11:23:07,865 INFO L290 TraceCheckUtils]: 9: Hoare triple {1912#(<= ~counter~0 0)} assume true; {1912#(<= ~counter~0 0)} is VALID [2022-04-28 11:23:07,865 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1912#(<= ~counter~0 0)} {1912#(<= ~counter~0 0)} #77#return; {1912#(<= ~counter~0 0)} is VALID [2022-04-28 11:23:07,866 INFO L290 TraceCheckUtils]: 11: Hoare triple {1912#(<= ~counter~0 0)} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {1912#(<= ~counter~0 0)} is VALID [2022-04-28 11:23:07,866 INFO L290 TraceCheckUtils]: 12: Hoare triple {1912#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1946#(<= ~counter~0 1)} is VALID [2022-04-28 11:23:07,867 INFO L290 TraceCheckUtils]: 13: Hoare triple {1946#(<= ~counter~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {1946#(<= ~counter~0 1)} is VALID [2022-04-28 11:23:07,867 INFO L272 TraceCheckUtils]: 14: Hoare triple {1946#(<= ~counter~0 1)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {1946#(<= ~counter~0 1)} is VALID [2022-04-28 11:23:07,867 INFO L290 TraceCheckUtils]: 15: Hoare triple {1946#(<= ~counter~0 1)} ~cond := #in~cond; {1946#(<= ~counter~0 1)} is VALID [2022-04-28 11:23:07,868 INFO L290 TraceCheckUtils]: 16: Hoare triple {1946#(<= ~counter~0 1)} assume !(0 == ~cond); {1946#(<= ~counter~0 1)} is VALID [2022-04-28 11:23:07,868 INFO L290 TraceCheckUtils]: 17: Hoare triple {1946#(<= ~counter~0 1)} assume true; {1946#(<= ~counter~0 1)} is VALID [2022-04-28 11:23:07,869 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1946#(<= ~counter~0 1)} {1946#(<= ~counter~0 1)} #79#return; {1946#(<= ~counter~0 1)} is VALID [2022-04-28 11:23:07,869 INFO L272 TraceCheckUtils]: 19: Hoare triple {1946#(<= ~counter~0 1)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {1946#(<= ~counter~0 1)} is VALID [2022-04-28 11:23:07,869 INFO L290 TraceCheckUtils]: 20: Hoare triple {1946#(<= ~counter~0 1)} ~cond := #in~cond; {1946#(<= ~counter~0 1)} is VALID [2022-04-28 11:23:07,870 INFO L290 TraceCheckUtils]: 21: Hoare triple {1946#(<= ~counter~0 1)} assume !(0 == ~cond); {1946#(<= ~counter~0 1)} is VALID [2022-04-28 11:23:07,870 INFO L290 TraceCheckUtils]: 22: Hoare triple {1946#(<= ~counter~0 1)} assume true; {1946#(<= ~counter~0 1)} is VALID [2022-04-28 11:23:07,871 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1946#(<= ~counter~0 1)} {1946#(<= ~counter~0 1)} #81#return; {1946#(<= ~counter~0 1)} is VALID [2022-04-28 11:23:07,871 INFO L290 TraceCheckUtils]: 24: Hoare triple {1946#(<= ~counter~0 1)} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {1946#(<= ~counter~0 1)} is VALID [2022-04-28 11:23:07,871 INFO L290 TraceCheckUtils]: 25: Hoare triple {1946#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {1986#(<= |main_#t~post7| 1)} is VALID [2022-04-28 11:23:07,872 INFO L290 TraceCheckUtils]: 26: Hoare triple {1986#(<= |main_#t~post7| 1)} assume !(#t~post7 < 20);havoc #t~post7; {1905#false} is VALID [2022-04-28 11:23:07,872 INFO L290 TraceCheckUtils]: 27: Hoare triple {1905#false} ~r~0 := ~r~0 - ~b~0;~q~0 := ~q~0 + ~a~0; {1905#false} is VALID [2022-04-28 11:23:07,872 INFO L290 TraceCheckUtils]: 28: Hoare triple {1905#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1905#false} is VALID [2022-04-28 11:23:07,872 INFO L290 TraceCheckUtils]: 29: Hoare triple {1905#false} assume !(#t~post6 < 20);havoc #t~post6; {1905#false} is VALID [2022-04-28 11:23:07,872 INFO L272 TraceCheckUtils]: 30: Hoare triple {1905#false} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {1905#false} is VALID [2022-04-28 11:23:07,872 INFO L290 TraceCheckUtils]: 31: Hoare triple {1905#false} ~cond := #in~cond; {1905#false} is VALID [2022-04-28 11:23:07,872 INFO L290 TraceCheckUtils]: 32: Hoare triple {1905#false} assume 0 == ~cond; {1905#false} is VALID [2022-04-28 11:23:07,873 INFO L290 TraceCheckUtils]: 33: Hoare triple {1905#false} assume !false; {1905#false} is VALID [2022-04-28 11:23:07,873 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 11:23:07,873 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 11:23:07,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:23:07,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077624819] [2022-04-28 11:23:07,873 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:23:07,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [72458758] [2022-04-28 11:23:07,873 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [72458758] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:23:07,873 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:23:07,873 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 11:23:07,873 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:23:07,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [244081337] [2022-04-28 11:23:07,873 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [244081337] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:23:07,874 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:23:07,874 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 11:23:07,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332697200] [2022-04-28 11:23:07,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:23:07,874 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 34 [2022-04-28 11:23:07,874 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:23:07,875 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 11:23:07,896 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:23:07,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 11:23:07,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:23:07,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 11:23:07,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-28 11:23:07,896 INFO L87 Difference]: Start difference. First operand 74 states and 100 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 11:23:08,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:23:08,034 INFO L93 Difference]: Finished difference Result 113 states and 153 transitions. [2022-04-28 11:23:08,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 11:23:08,034 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 34 [2022-04-28 11:23:08,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:23:08,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 11:23:08,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 85 transitions. [2022-04-28 11:23:08,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 11:23:08,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 85 transitions. [2022-04-28 11:23:08,037 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 85 transitions. [2022-04-28 11:23:08,111 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:23:08,114 INFO L225 Difference]: With dead ends: 113 [2022-04-28 11:23:08,114 INFO L226 Difference]: Without dead ends: 78 [2022-04-28 11:23:08,115 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 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-28 11:23:08,116 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 6 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 11:23:08,116 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 114 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 11:23:08,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-04-28 11:23:08,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2022-04-28 11:23:08,166 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:23:08,166 INFO L82 GeneralOperation]: Start isEquivalent. First operand 78 states. Second operand has 78 states, 47 states have (on average 1.2340425531914894) internal successors, (58), 49 states have internal predecessors, (58), 23 states have call successors, (23), 8 states have call predecessors, (23), 7 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-28 11:23:08,167 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand has 78 states, 47 states have (on average 1.2340425531914894) internal successors, (58), 49 states have internal predecessors, (58), 23 states have call successors, (23), 8 states have call predecessors, (23), 7 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-28 11:23:08,168 INFO L87 Difference]: Start difference. First operand 78 states. Second operand has 78 states, 47 states have (on average 1.2340425531914894) internal successors, (58), 49 states have internal predecessors, (58), 23 states have call successors, (23), 8 states have call predecessors, (23), 7 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-28 11:23:08,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:23:08,173 INFO L93 Difference]: Finished difference Result 78 states and 102 transitions. [2022-04-28 11:23:08,173 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 102 transitions. [2022-04-28 11:23:08,174 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:23:08,174 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:23:08,174 INFO L74 IsIncluded]: Start isIncluded. First operand has 78 states, 47 states have (on average 1.2340425531914894) internal successors, (58), 49 states have internal predecessors, (58), 23 states have call successors, (23), 8 states have call predecessors, (23), 7 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) Second operand 78 states. [2022-04-28 11:23:08,177 INFO L87 Difference]: Start difference. First operand has 78 states, 47 states have (on average 1.2340425531914894) internal successors, (58), 49 states have internal predecessors, (58), 23 states have call successors, (23), 8 states have call predecessors, (23), 7 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) Second operand 78 states. [2022-04-28 11:23:08,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:23:08,179 INFO L93 Difference]: Finished difference Result 78 states and 102 transitions. [2022-04-28 11:23:08,179 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 102 transitions. [2022-04-28 11:23:08,180 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:23:08,180 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:23:08,180 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:23:08,180 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:23:08,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 47 states have (on average 1.2340425531914894) internal successors, (58), 49 states have internal predecessors, (58), 23 states have call successors, (23), 8 states have call predecessors, (23), 7 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-28 11:23:08,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 102 transitions. [2022-04-28 11:23:08,182 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 102 transitions. Word has length 34 [2022-04-28 11:23:08,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:23:08,182 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 102 transitions. [2022-04-28 11:23:08,182 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 11:23:08,183 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 78 states and 102 transitions. [2022-04-28 11:23:08,273 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:23:08,274 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 102 transitions. [2022-04-28 11:23:08,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-28 11:23:08,274 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:23:08,274 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:23:08,294 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-28 11:23:08,474 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-28 11:23:08,475 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:23:08,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:23:08,475 INFO L85 PathProgramCache]: Analyzing trace with hash 1813008070, now seen corresponding path program 1 times [2022-04-28 11:23:08,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:23:08,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [340721098] [2022-04-28 11:23:08,476 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 11:23:08,476 INFO L85 PathProgramCache]: Analyzing trace with hash 1813008070, now seen corresponding path program 2 times [2022-04-28 11:23:08,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:23:08,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545763889] [2022-04-28 11:23:08,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:23:08,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:23:08,494 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:23:08,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2134124837] [2022-04-28 11:23:08,494 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:23:08,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:23:08,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:23:08,498 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-28 11:23:08,536 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-28 11:23:08,550 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 11:23:08,551 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:23:08,551 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 11:23:08,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:23:08,563 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:23:08,770 INFO L272 TraceCheckUtils]: 0: Hoare triple {2548#true} call ULTIMATE.init(); {2548#true} is VALID [2022-04-28 11:23:08,770 INFO L290 TraceCheckUtils]: 1: Hoare triple {2548#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(14, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2548#true} is VALID [2022-04-28 11:23:08,770 INFO L290 TraceCheckUtils]: 2: Hoare triple {2548#true} assume true; {2548#true} is VALID [2022-04-28 11:23:08,770 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2548#true} {2548#true} #93#return; {2548#true} is VALID [2022-04-28 11:23:08,770 INFO L272 TraceCheckUtils]: 4: Hoare triple {2548#true} call #t~ret8 := main(); {2548#true} is VALID [2022-04-28 11:23:08,770 INFO L290 TraceCheckUtils]: 5: Hoare triple {2548#true} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~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; {2548#true} is VALID [2022-04-28 11:23:08,771 INFO L272 TraceCheckUtils]: 6: Hoare triple {2548#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {2548#true} is VALID [2022-04-28 11:23:08,771 INFO L290 TraceCheckUtils]: 7: Hoare triple {2548#true} ~cond := #in~cond; {2574#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 11:23:08,771 INFO L290 TraceCheckUtils]: 8: Hoare triple {2574#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {2578#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 11:23:08,772 INFO L290 TraceCheckUtils]: 9: Hoare triple {2578#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {2578#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 11:23:08,772 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2578#(not (= |assume_abort_if_not_#in~cond| 0))} {2548#true} #77#return; {2585#(<= 1 main_~y~0)} is VALID [2022-04-28 11:23:08,773 INFO L290 TraceCheckUtils]: 11: Hoare triple {2585#(<= 1 main_~y~0)} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {2585#(<= 1 main_~y~0)} is VALID [2022-04-28 11:23:08,773 INFO L290 TraceCheckUtils]: 12: Hoare triple {2585#(<= 1 main_~y~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2585#(<= 1 main_~y~0)} is VALID [2022-04-28 11:23:08,773 INFO L290 TraceCheckUtils]: 13: Hoare triple {2585#(<= 1 main_~y~0)} assume !!(#t~post6 < 20);havoc #t~post6; {2585#(<= 1 main_~y~0)} is VALID [2022-04-28 11:23:08,774 INFO L272 TraceCheckUtils]: 14: Hoare triple {2585#(<= 1 main_~y~0)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {2548#true} is VALID [2022-04-28 11:23:08,774 INFO L290 TraceCheckUtils]: 15: Hoare triple {2548#true} ~cond := #in~cond; {2548#true} is VALID [2022-04-28 11:23:08,774 INFO L290 TraceCheckUtils]: 16: Hoare triple {2548#true} assume !(0 == ~cond); {2548#true} is VALID [2022-04-28 11:23:08,774 INFO L290 TraceCheckUtils]: 17: Hoare triple {2548#true} assume true; {2548#true} is VALID [2022-04-28 11:23:08,775 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {2548#true} {2585#(<= 1 main_~y~0)} #79#return; {2585#(<= 1 main_~y~0)} is VALID [2022-04-28 11:23:08,775 INFO L272 TraceCheckUtils]: 19: Hoare triple {2585#(<= 1 main_~y~0)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {2548#true} is VALID [2022-04-28 11:23:08,775 INFO L290 TraceCheckUtils]: 20: Hoare triple {2548#true} ~cond := #in~cond; {2548#true} is VALID [2022-04-28 11:23:08,775 INFO L290 TraceCheckUtils]: 21: Hoare triple {2548#true} assume !(0 == ~cond); {2548#true} is VALID [2022-04-28 11:23:08,775 INFO L290 TraceCheckUtils]: 22: Hoare triple {2548#true} assume true; {2548#true} is VALID [2022-04-28 11:23:08,776 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2548#true} {2585#(<= 1 main_~y~0)} #81#return; {2585#(<= 1 main_~y~0)} is VALID [2022-04-28 11:23:08,776 INFO L290 TraceCheckUtils]: 24: Hoare triple {2585#(<= 1 main_~y~0)} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {2628#(<= 1 main_~r~0)} is VALID [2022-04-28 11:23:08,778 INFO L290 TraceCheckUtils]: 25: Hoare triple {2628#(<= 1 main_~r~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {2628#(<= 1 main_~r~0)} is VALID [2022-04-28 11:23:08,779 INFO L290 TraceCheckUtils]: 26: Hoare triple {2628#(<= 1 main_~r~0)} assume !!(#t~post7 < 20);havoc #t~post7; {2628#(<= 1 main_~r~0)} is VALID [2022-04-28 11:23:08,779 INFO L272 TraceCheckUtils]: 27: Hoare triple {2628#(<= 1 main_~r~0)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {2548#true} is VALID [2022-04-28 11:23:08,779 INFO L290 TraceCheckUtils]: 28: Hoare triple {2548#true} ~cond := #in~cond; {2548#true} is VALID [2022-04-28 11:23:08,779 INFO L290 TraceCheckUtils]: 29: Hoare triple {2548#true} assume !(0 == ~cond); {2548#true} is VALID [2022-04-28 11:23:08,779 INFO L290 TraceCheckUtils]: 30: Hoare triple {2548#true} assume true; {2548#true} is VALID [2022-04-28 11:23:08,780 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {2548#true} {2628#(<= 1 main_~r~0)} #83#return; {2628#(<= 1 main_~r~0)} is VALID [2022-04-28 11:23:08,780 INFO L272 TraceCheckUtils]: 32: Hoare triple {2628#(<= 1 main_~r~0)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {2548#true} is VALID [2022-04-28 11:23:08,780 INFO L290 TraceCheckUtils]: 33: Hoare triple {2548#true} ~cond := #in~cond; {2548#true} is VALID [2022-04-28 11:23:08,780 INFO L290 TraceCheckUtils]: 34: Hoare triple {2548#true} assume !(0 == ~cond); {2548#true} is VALID [2022-04-28 11:23:08,780 INFO L290 TraceCheckUtils]: 35: Hoare triple {2548#true} assume true; {2548#true} is VALID [2022-04-28 11:23:08,781 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {2548#true} {2628#(<= 1 main_~r~0)} #85#return; {2628#(<= 1 main_~r~0)} is VALID [2022-04-28 11:23:08,784 INFO L272 TraceCheckUtils]: 37: Hoare triple {2628#(<= 1 main_~r~0)} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {2668#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:23:08,784 INFO L290 TraceCheckUtils]: 38: Hoare triple {2668#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2672#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:23:08,785 INFO L290 TraceCheckUtils]: 39: Hoare triple {2672#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2549#false} is VALID [2022-04-28 11:23:08,785 INFO L290 TraceCheckUtils]: 40: Hoare triple {2549#false} assume !false; {2549#false} is VALID [2022-04-28 11:23:08,785 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-28 11:23:08,785 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 11:23:08,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:23:08,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545763889] [2022-04-28 11:23:08,785 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:23:08,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2134124837] [2022-04-28 11:23:08,786 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2134124837] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:23:08,786 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:23:08,786 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 11:23:08,786 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:23:08,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [340721098] [2022-04-28 11:23:08,786 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [340721098] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:23:08,786 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:23:08,786 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 11:23:08,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819615907] [2022-04-28 11:23:08,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:23:08,787 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 41 [2022-04-28 11:23:08,787 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:23:08,787 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-28 11:23:08,815 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-28 11:23:08,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 11:23:08,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:23:08,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 11:23:08,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-04-28 11:23:08,816 INFO L87 Difference]: Start difference. First operand 78 states and 102 transitions. Second operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-28 11:23:09,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:23:09,173 INFO L93 Difference]: Finished difference Result 84 states and 107 transitions. [2022-04-28 11:23:09,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 11:23:09,173 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 41 [2022-04-28 11:23:09,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:23:09,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-28 11:23:09,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 47 transitions. [2022-04-28 11:23:09,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-28 11:23:09,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 47 transitions. [2022-04-28 11:23:09,175 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 47 transitions. [2022-04-28 11:23:09,210 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:23:09,211 INFO L225 Difference]: With dead ends: 84 [2022-04-28 11:23:09,212 INFO L226 Difference]: Without dead ends: 82 [2022-04-28 11:23:09,212 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-04-28 11:23:09,212 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 20 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 11:23:09,213 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 167 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 11:23:09,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-04-28 11:23:09,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2022-04-28 11:23:09,287 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:23:09,287 INFO L82 GeneralOperation]: Start isEquivalent. First operand 82 states. Second operand has 82 states, 50 states have (on average 1.22) internal successors, (61), 52 states have internal predecessors, (61), 23 states have call successors, (23), 9 states have call predecessors, (23), 8 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-28 11:23:09,288 INFO L74 IsIncluded]: Start isIncluded. First operand 82 states. Second operand has 82 states, 50 states have (on average 1.22) internal successors, (61), 52 states have internal predecessors, (61), 23 states have call successors, (23), 9 states have call predecessors, (23), 8 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-28 11:23:09,288 INFO L87 Difference]: Start difference. First operand 82 states. Second operand has 82 states, 50 states have (on average 1.22) internal successors, (61), 52 states have internal predecessors, (61), 23 states have call successors, (23), 9 states have call predecessors, (23), 8 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-28 11:23:09,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:23:09,291 INFO L93 Difference]: Finished difference Result 82 states and 105 transitions. [2022-04-28 11:23:09,291 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 105 transitions. [2022-04-28 11:23:09,291 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:23:09,291 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:23:09,291 INFO L74 IsIncluded]: Start isIncluded. First operand has 82 states, 50 states have (on average 1.22) internal successors, (61), 52 states have internal predecessors, (61), 23 states have call successors, (23), 9 states have call predecessors, (23), 8 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) Second operand 82 states. [2022-04-28 11:23:09,292 INFO L87 Difference]: Start difference. First operand has 82 states, 50 states have (on average 1.22) internal successors, (61), 52 states have internal predecessors, (61), 23 states have call successors, (23), 9 states have call predecessors, (23), 8 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) Second operand 82 states. [2022-04-28 11:23:09,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:23:09,294 INFO L93 Difference]: Finished difference Result 82 states and 105 transitions. [2022-04-28 11:23:09,294 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 105 transitions. [2022-04-28 11:23:09,294 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:23:09,295 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:23:09,295 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:23:09,295 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:23:09,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 50 states have (on average 1.22) internal successors, (61), 52 states have internal predecessors, (61), 23 states have call successors, (23), 9 states have call predecessors, (23), 8 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-28 11:23:09,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 105 transitions. [2022-04-28 11:23:09,298 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 105 transitions. Word has length 41 [2022-04-28 11:23:09,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:23:09,298 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 105 transitions. [2022-04-28 11:23:09,298 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-28 11:23:09,298 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 82 states and 105 transitions. [2022-04-28 11:23:09,398 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:23:09,398 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 105 transitions. [2022-04-28 11:23:09,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-28 11:23:09,399 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:23:09,399 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 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-28 11:23:09,423 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-28 11:23:09,599 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-28 11:23:09,600 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:23:09,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:23:09,600 INFO L85 PathProgramCache]: Analyzing trace with hash -683043127, now seen corresponding path program 1 times [2022-04-28 11:23:09,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:23:09,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [127516460] [2022-04-28 11:23:09,601 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 11:23:09,601 INFO L85 PathProgramCache]: Analyzing trace with hash -683043127, now seen corresponding path program 2 times [2022-04-28 11:23:09,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:23:09,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690167627] [2022-04-28 11:23:09,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:23:09,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:23:09,624 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:23:09,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [585827530] [2022-04-28 11:23:09,624 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:23:09,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:23:09,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:23:09,635 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-28 11:23:09,636 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-28 11:23:09,692 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 11:23:09,693 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:23:09,693 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 11:23:09,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:23:09,710 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:23:09,873 INFO L272 TraceCheckUtils]: 0: Hoare triple {3180#true} call ULTIMATE.init(); {3180#true} is VALID [2022-04-28 11:23:09,873 INFO L290 TraceCheckUtils]: 1: Hoare triple {3180#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(14, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {3180#true} is VALID [2022-04-28 11:23:09,873 INFO L290 TraceCheckUtils]: 2: Hoare triple {3180#true} assume true; {3180#true} is VALID [2022-04-28 11:23:09,873 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3180#true} {3180#true} #93#return; {3180#true} is VALID [2022-04-28 11:23:09,873 INFO L272 TraceCheckUtils]: 4: Hoare triple {3180#true} call #t~ret8 := main(); {3180#true} is VALID [2022-04-28 11:23:09,874 INFO L290 TraceCheckUtils]: 5: Hoare triple {3180#true} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~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; {3180#true} is VALID [2022-04-28 11:23:09,874 INFO L272 TraceCheckUtils]: 6: Hoare triple {3180#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {3180#true} is VALID [2022-04-28 11:23:09,874 INFO L290 TraceCheckUtils]: 7: Hoare triple {3180#true} ~cond := #in~cond; {3180#true} is VALID [2022-04-28 11:23:09,874 INFO L290 TraceCheckUtils]: 8: Hoare triple {3180#true} assume !(0 == ~cond); {3180#true} is VALID [2022-04-28 11:23:09,878 INFO L290 TraceCheckUtils]: 9: Hoare triple {3180#true} assume true; {3180#true} is VALID [2022-04-28 11:23:09,878 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3180#true} {3180#true} #77#return; {3180#true} is VALID [2022-04-28 11:23:09,878 INFO L290 TraceCheckUtils]: 11: Hoare triple {3180#true} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {3180#true} is VALID [2022-04-28 11:23:09,880 INFO L290 TraceCheckUtils]: 12: Hoare triple {3180#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3180#true} is VALID [2022-04-28 11:23:09,880 INFO L290 TraceCheckUtils]: 13: Hoare triple {3180#true} assume !!(#t~post6 < 20);havoc #t~post6; {3180#true} is VALID [2022-04-28 11:23:09,880 INFO L272 TraceCheckUtils]: 14: Hoare triple {3180#true} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {3180#true} is VALID [2022-04-28 11:23:09,880 INFO L290 TraceCheckUtils]: 15: Hoare triple {3180#true} ~cond := #in~cond; {3180#true} is VALID [2022-04-28 11:23:09,880 INFO L290 TraceCheckUtils]: 16: Hoare triple {3180#true} assume !(0 == ~cond); {3180#true} is VALID [2022-04-28 11:23:09,880 INFO L290 TraceCheckUtils]: 17: Hoare triple {3180#true} assume true; {3180#true} is VALID [2022-04-28 11:23:09,880 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {3180#true} {3180#true} #79#return; {3180#true} is VALID [2022-04-28 11:23:09,880 INFO L272 TraceCheckUtils]: 19: Hoare triple {3180#true} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {3180#true} is VALID [2022-04-28 11:23:09,880 INFO L290 TraceCheckUtils]: 20: Hoare triple {3180#true} ~cond := #in~cond; {3180#true} is VALID [2022-04-28 11:23:09,880 INFO L290 TraceCheckUtils]: 21: Hoare triple {3180#true} assume !(0 == ~cond); {3180#true} is VALID [2022-04-28 11:23:09,881 INFO L290 TraceCheckUtils]: 22: Hoare triple {3180#true} assume true; {3180#true} is VALID [2022-04-28 11:23:09,881 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {3180#true} {3180#true} #81#return; {3180#true} is VALID [2022-04-28 11:23:09,881 INFO L290 TraceCheckUtils]: 24: Hoare triple {3180#true} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {3180#true} is VALID [2022-04-28 11:23:09,881 INFO L290 TraceCheckUtils]: 25: Hoare triple {3180#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {3180#true} is VALID [2022-04-28 11:23:09,881 INFO L290 TraceCheckUtils]: 26: Hoare triple {3180#true} assume !!(#t~post7 < 20);havoc #t~post7; {3180#true} is VALID [2022-04-28 11:23:09,881 INFO L272 TraceCheckUtils]: 27: Hoare triple {3180#true} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {3180#true} is VALID [2022-04-28 11:23:09,881 INFO L290 TraceCheckUtils]: 28: Hoare triple {3180#true} ~cond := #in~cond; {3269#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:23:09,882 INFO L290 TraceCheckUtils]: 29: Hoare triple {3269#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {3273#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:23:09,882 INFO L290 TraceCheckUtils]: 30: Hoare triple {3273#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3273#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:23:09,882 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {3273#(not (= |__VERIFIER_assert_#in~cond| 0))} {3180#true} #83#return; {3280#(= main_~b~0 (* main_~a~0 main_~y~0))} is VALID [2022-04-28 11:23:09,883 INFO L272 TraceCheckUtils]: 32: Hoare triple {3280#(= main_~b~0 (* main_~a~0 main_~y~0))} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {3180#true} is VALID [2022-04-28 11:23:09,883 INFO L290 TraceCheckUtils]: 33: Hoare triple {3180#true} ~cond := #in~cond; {3180#true} is VALID [2022-04-28 11:23:09,883 INFO L290 TraceCheckUtils]: 34: Hoare triple {3180#true} assume !(0 == ~cond); {3180#true} is VALID [2022-04-28 11:23:09,883 INFO L290 TraceCheckUtils]: 35: Hoare triple {3180#true} assume true; {3180#true} is VALID [2022-04-28 11:23:09,883 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {3180#true} {3280#(= main_~b~0 (* main_~a~0 main_~y~0))} #85#return; {3280#(= main_~b~0 (* main_~a~0 main_~y~0))} is VALID [2022-04-28 11:23:09,883 INFO L272 TraceCheckUtils]: 37: Hoare triple {3280#(= main_~b~0 (* main_~a~0 main_~y~0))} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {3180#true} is VALID [2022-04-28 11:23:09,883 INFO L290 TraceCheckUtils]: 38: Hoare triple {3180#true} ~cond := #in~cond; {3180#true} is VALID [2022-04-28 11:23:09,884 INFO L290 TraceCheckUtils]: 39: Hoare triple {3180#true} assume !(0 == ~cond); {3180#true} is VALID [2022-04-28 11:23:09,884 INFO L290 TraceCheckUtils]: 40: Hoare triple {3180#true} assume true; {3180#true} is VALID [2022-04-28 11:23:09,884 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {3180#true} {3280#(= main_~b~0 (* main_~a~0 main_~y~0))} #87#return; {3280#(= main_~b~0 (* main_~a~0 main_~y~0))} is VALID [2022-04-28 11:23:09,885 INFO L290 TraceCheckUtils]: 42: Hoare triple {3280#(= main_~b~0 (* main_~a~0 main_~y~0))} assume !!(~r~0 >= 2 * ~b~0); {3314#(<= (* 2 (* main_~a~0 main_~y~0)) main_~r~0)} is VALID [2022-04-28 11:23:09,885 INFO L272 TraceCheckUtils]: 43: Hoare triple {3314#(<= (* 2 (* main_~a~0 main_~y~0)) main_~r~0)} call __VERIFIER_assert((if ~r~0 >= 2 * ~y~0 * ~a~0 then 1 else 0)); {3318#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:23:09,885 INFO L290 TraceCheckUtils]: 44: Hoare triple {3318#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3322#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:23:09,886 INFO L290 TraceCheckUtils]: 45: Hoare triple {3322#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3181#false} is VALID [2022-04-28 11:23:09,886 INFO L290 TraceCheckUtils]: 46: Hoare triple {3181#false} assume !false; {3181#false} is VALID [2022-04-28 11:23:09,887 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 15 proven. 7 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-28 11:23:09,887 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:23:16,483 INFO L290 TraceCheckUtils]: 46: Hoare triple {3181#false} assume !false; {3181#false} is VALID [2022-04-28 11:23:16,484 INFO L290 TraceCheckUtils]: 45: Hoare triple {3322#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3181#false} is VALID [2022-04-28 11:23:16,484 INFO L290 TraceCheckUtils]: 44: Hoare triple {3318#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3322#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:23:16,485 INFO L272 TraceCheckUtils]: 43: Hoare triple {3314#(<= (* 2 (* main_~a~0 main_~y~0)) main_~r~0)} call __VERIFIER_assert((if ~r~0 >= 2 * ~y~0 * ~a~0 then 1 else 0)); {3318#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:23:16,485 INFO L290 TraceCheckUtils]: 42: Hoare triple {3341#(<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))} assume !!(~r~0 >= 2 * ~b~0); {3314#(<= (* 2 (* main_~a~0 main_~y~0)) main_~r~0)} is VALID [2022-04-28 11:23:16,486 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {3180#true} {3341#(<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))} #87#return; {3341#(<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))} is VALID [2022-04-28 11:23:16,490 INFO L290 TraceCheckUtils]: 40: Hoare triple {3180#true} assume true; {3180#true} is VALID [2022-04-28 11:23:16,490 INFO L290 TraceCheckUtils]: 39: Hoare triple {3180#true} assume !(0 == ~cond); {3180#true} is VALID [2022-04-28 11:23:16,490 INFO L290 TraceCheckUtils]: 38: Hoare triple {3180#true} ~cond := #in~cond; {3180#true} is VALID [2022-04-28 11:23:16,491 INFO L272 TraceCheckUtils]: 37: Hoare triple {3341#(<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {3180#true} is VALID [2022-04-28 11:23:16,495 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {3180#true} {3341#(<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))} #85#return; {3341#(<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))} is VALID [2022-04-28 11:23:16,495 INFO L290 TraceCheckUtils]: 35: Hoare triple {3180#true} assume true; {3180#true} is VALID [2022-04-28 11:23:16,496 INFO L290 TraceCheckUtils]: 34: Hoare triple {3180#true} assume !(0 == ~cond); {3180#true} is VALID [2022-04-28 11:23:16,496 INFO L290 TraceCheckUtils]: 33: Hoare triple {3180#true} ~cond := #in~cond; {3180#true} is VALID [2022-04-28 11:23:16,498 INFO L272 TraceCheckUtils]: 32: Hoare triple {3341#(<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {3180#true} is VALID [2022-04-28 11:23:16,498 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {3273#(not (= |__VERIFIER_assert_#in~cond| 0))} {3180#true} #83#return; {3341#(<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))} is VALID [2022-04-28 11:23:16,499 INFO L290 TraceCheckUtils]: 30: Hoare triple {3273#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3273#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:23:16,499 INFO L290 TraceCheckUtils]: 29: Hoare triple {3384#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {3273#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:23:16,501 INFO L290 TraceCheckUtils]: 28: Hoare triple {3180#true} ~cond := #in~cond; {3384#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 11:23:16,501 INFO L272 TraceCheckUtils]: 27: Hoare triple {3180#true} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {3180#true} is VALID [2022-04-28 11:23:16,501 INFO L290 TraceCheckUtils]: 26: Hoare triple {3180#true} assume !!(#t~post7 < 20);havoc #t~post7; {3180#true} is VALID [2022-04-28 11:23:16,501 INFO L290 TraceCheckUtils]: 25: Hoare triple {3180#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {3180#true} is VALID [2022-04-28 11:23:16,501 INFO L290 TraceCheckUtils]: 24: Hoare triple {3180#true} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {3180#true} is VALID [2022-04-28 11:23:16,501 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {3180#true} {3180#true} #81#return; {3180#true} is VALID [2022-04-28 11:23:16,501 INFO L290 TraceCheckUtils]: 22: Hoare triple {3180#true} assume true; {3180#true} is VALID [2022-04-28 11:23:16,501 INFO L290 TraceCheckUtils]: 21: Hoare triple {3180#true} assume !(0 == ~cond); {3180#true} is VALID [2022-04-28 11:23:16,501 INFO L290 TraceCheckUtils]: 20: Hoare triple {3180#true} ~cond := #in~cond; {3180#true} is VALID [2022-04-28 11:23:16,501 INFO L272 TraceCheckUtils]: 19: Hoare triple {3180#true} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {3180#true} is VALID [2022-04-28 11:23:16,501 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {3180#true} {3180#true} #79#return; {3180#true} is VALID [2022-04-28 11:23:16,502 INFO L290 TraceCheckUtils]: 17: Hoare triple {3180#true} assume true; {3180#true} is VALID [2022-04-28 11:23:16,502 INFO L290 TraceCheckUtils]: 16: Hoare triple {3180#true} assume !(0 == ~cond); {3180#true} is VALID [2022-04-28 11:23:16,502 INFO L290 TraceCheckUtils]: 15: Hoare triple {3180#true} ~cond := #in~cond; {3180#true} is VALID [2022-04-28 11:23:16,502 INFO L272 TraceCheckUtils]: 14: Hoare triple {3180#true} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {3180#true} is VALID [2022-04-28 11:23:16,502 INFO L290 TraceCheckUtils]: 13: Hoare triple {3180#true} assume !!(#t~post6 < 20);havoc #t~post6; {3180#true} is VALID [2022-04-28 11:23:16,502 INFO L290 TraceCheckUtils]: 12: Hoare triple {3180#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3180#true} is VALID [2022-04-28 11:23:16,502 INFO L290 TraceCheckUtils]: 11: Hoare triple {3180#true} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {3180#true} is VALID [2022-04-28 11:23:16,502 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3180#true} {3180#true} #77#return; {3180#true} is VALID [2022-04-28 11:23:16,502 INFO L290 TraceCheckUtils]: 9: Hoare triple {3180#true} assume true; {3180#true} is VALID [2022-04-28 11:23:16,502 INFO L290 TraceCheckUtils]: 8: Hoare triple {3180#true} assume !(0 == ~cond); {3180#true} is VALID [2022-04-28 11:23:16,502 INFO L290 TraceCheckUtils]: 7: Hoare triple {3180#true} ~cond := #in~cond; {3180#true} is VALID [2022-04-28 11:23:16,502 INFO L272 TraceCheckUtils]: 6: Hoare triple {3180#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {3180#true} is VALID [2022-04-28 11:23:16,502 INFO L290 TraceCheckUtils]: 5: Hoare triple {3180#true} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~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; {3180#true} is VALID [2022-04-28 11:23:16,502 INFO L272 TraceCheckUtils]: 4: Hoare triple {3180#true} call #t~ret8 := main(); {3180#true} is VALID [2022-04-28 11:23:16,502 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3180#true} {3180#true} #93#return; {3180#true} is VALID [2022-04-28 11:23:16,503 INFO L290 TraceCheckUtils]: 2: Hoare triple {3180#true} assume true; {3180#true} is VALID [2022-04-28 11:23:16,503 INFO L290 TraceCheckUtils]: 1: Hoare triple {3180#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(14, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {3180#true} is VALID [2022-04-28 11:23:16,503 INFO L272 TraceCheckUtils]: 0: Hoare triple {3180#true} call ULTIMATE.init(); {3180#true} is VALID [2022-04-28 11:23:16,503 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 15 proven. 7 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-28 11:23:16,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:23:16,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690167627] [2022-04-28 11:23:16,503 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:23:16,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [585827530] [2022-04-28 11:23:16,504 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [585827530] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 11:23:16,504 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 11:23:16,504 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2022-04-28 11:23:16,504 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:23:16,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [127516460] [2022-04-28 11:23:16,504 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [127516460] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:23:16,504 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:23:16,504 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 11:23:16,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234573379] [2022-04-28 11:23:16,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:23:16,504 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 47 [2022-04-28 11:23:16,505 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:23:16,505 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-28 11:23:16,531 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:23:16,531 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 11:23:16,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:23:16,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 11:23:16,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-04-28 11:23:16,532 INFO L87 Difference]: Start difference. First operand 82 states and 105 transitions. Second operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-28 11:23:16,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:23:16,855 INFO L93 Difference]: Finished difference Result 88 states and 110 transitions. [2022-04-28 11:23:16,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 11:23:16,855 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 47 [2022-04-28 11:23:16,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:23:16,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-28 11:23:16,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 47 transitions. [2022-04-28 11:23:16,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-28 11:23:16,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 47 transitions. [2022-04-28 11:23:16,858 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 47 transitions. [2022-04-28 11:23:16,896 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:23:16,901 INFO L225 Difference]: With dead ends: 88 [2022-04-28 11:23:16,902 INFO L226 Difference]: Without dead ends: 86 [2022-04-28 11:23:16,902 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 84 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2022-04-28 11:23:16,903 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 22 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 11:23:16,903 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 115 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 11:23:16,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-04-28 11:23:16,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2022-04-28 11:23:16,985 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:23:16,985 INFO L82 GeneralOperation]: Start isEquivalent. First operand 86 states. Second operand has 86 states, 53 states have (on average 1.2075471698113207) internal successors, (64), 55 states have internal predecessors, (64), 23 states have call successors, (23), 10 states have call predecessors, (23), 9 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-28 11:23:16,985 INFO L74 IsIncluded]: Start isIncluded. First operand 86 states. Second operand has 86 states, 53 states have (on average 1.2075471698113207) internal successors, (64), 55 states have internal predecessors, (64), 23 states have call successors, (23), 10 states have call predecessors, (23), 9 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-28 11:23:16,986 INFO L87 Difference]: Start difference. First operand 86 states. Second operand has 86 states, 53 states have (on average 1.2075471698113207) internal successors, (64), 55 states have internal predecessors, (64), 23 states have call successors, (23), 10 states have call predecessors, (23), 9 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-28 11:23:16,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:23:16,988 INFO L93 Difference]: Finished difference Result 86 states and 108 transitions. [2022-04-28 11:23:16,988 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 108 transitions. [2022-04-28 11:23:16,988 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:23:16,988 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:23:16,989 INFO L74 IsIncluded]: Start isIncluded. First operand has 86 states, 53 states have (on average 1.2075471698113207) internal successors, (64), 55 states have internal predecessors, (64), 23 states have call successors, (23), 10 states have call predecessors, (23), 9 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) Second operand 86 states. [2022-04-28 11:23:16,989 INFO L87 Difference]: Start difference. First operand has 86 states, 53 states have (on average 1.2075471698113207) internal successors, (64), 55 states have internal predecessors, (64), 23 states have call successors, (23), 10 states have call predecessors, (23), 9 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) Second operand 86 states. [2022-04-28 11:23:16,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:23:16,991 INFO L93 Difference]: Finished difference Result 86 states and 108 transitions. [2022-04-28 11:23:16,991 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 108 transitions. [2022-04-28 11:23:16,991 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:23:16,992 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:23:16,992 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:23:16,992 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:23:16,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 53 states have (on average 1.2075471698113207) internal successors, (64), 55 states have internal predecessors, (64), 23 states have call successors, (23), 10 states have call predecessors, (23), 9 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-28 11:23:16,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 108 transitions. [2022-04-28 11:23:16,994 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 108 transitions. Word has length 47 [2022-04-28 11:23:16,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:23:16,994 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 108 transitions. [2022-04-28 11:23:16,994 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-28 11:23:16,994 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 86 states and 108 transitions. [2022-04-28 11:23:17,088 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:23:17,088 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 108 transitions. [2022-04-28 11:23:17,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-28 11:23:17,089 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:23:17,089 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 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-28 11:23:17,105 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-28 11:23:17,299 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-28 11:23:17,299 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:23:17,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:23:17,300 INFO L85 PathProgramCache]: Analyzing trace with hash -589126939, now seen corresponding path program 1 times [2022-04-28 11:23:17,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:23:17,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1409849876] [2022-04-28 11:23:29,962 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:23:29,962 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:23:29,962 INFO L85 PathProgramCache]: Analyzing trace with hash -589126939, now seen corresponding path program 2 times [2022-04-28 11:23:29,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:23:29,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463534357] [2022-04-28 11:23:29,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:23:29,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:23:29,990 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:23:29,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [683179305] [2022-04-28 11:23:29,990 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:23:29,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:23:29,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:23:29,997 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-28 11:23:29,998 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-28 11:23:30,037 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 11:23:30,037 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:23:30,038 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 11:23:30,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:23:30,047 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:23:30,262 INFO L272 TraceCheckUtils]: 0: Hoare triple {3997#true} call ULTIMATE.init(); {3997#true} is VALID [2022-04-28 11:23:30,263 INFO L290 TraceCheckUtils]: 1: Hoare triple {3997#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(14, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {4005#(<= ~counter~0 0)} is VALID [2022-04-28 11:23:30,263 INFO L290 TraceCheckUtils]: 2: Hoare triple {4005#(<= ~counter~0 0)} assume true; {4005#(<= ~counter~0 0)} is VALID [2022-04-28 11:23:30,263 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4005#(<= ~counter~0 0)} {3997#true} #93#return; {4005#(<= ~counter~0 0)} is VALID [2022-04-28 11:23:30,264 INFO L272 TraceCheckUtils]: 4: Hoare triple {4005#(<= ~counter~0 0)} call #t~ret8 := main(); {4005#(<= ~counter~0 0)} is VALID [2022-04-28 11:23:30,264 INFO L290 TraceCheckUtils]: 5: Hoare triple {4005#(<= ~counter~0 0)} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~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; {4005#(<= ~counter~0 0)} is VALID [2022-04-28 11:23:30,264 INFO L272 TraceCheckUtils]: 6: Hoare triple {4005#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {4005#(<= ~counter~0 0)} is VALID [2022-04-28 11:23:30,265 INFO L290 TraceCheckUtils]: 7: Hoare triple {4005#(<= ~counter~0 0)} ~cond := #in~cond; {4005#(<= ~counter~0 0)} is VALID [2022-04-28 11:23:30,265 INFO L290 TraceCheckUtils]: 8: Hoare triple {4005#(<= ~counter~0 0)} assume !(0 == ~cond); {4005#(<= ~counter~0 0)} is VALID [2022-04-28 11:23:30,265 INFO L290 TraceCheckUtils]: 9: Hoare triple {4005#(<= ~counter~0 0)} assume true; {4005#(<= ~counter~0 0)} is VALID [2022-04-28 11:23:30,266 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4005#(<= ~counter~0 0)} {4005#(<= ~counter~0 0)} #77#return; {4005#(<= ~counter~0 0)} is VALID [2022-04-28 11:23:30,266 INFO L290 TraceCheckUtils]: 11: Hoare triple {4005#(<= ~counter~0 0)} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {4005#(<= ~counter~0 0)} is VALID [2022-04-28 11:23:30,266 INFO L290 TraceCheckUtils]: 12: Hoare triple {4005#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4039#(<= ~counter~0 1)} is VALID [2022-04-28 11:23:30,267 INFO L290 TraceCheckUtils]: 13: Hoare triple {4039#(<= ~counter~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {4039#(<= ~counter~0 1)} is VALID [2022-04-28 11:23:30,267 INFO L272 TraceCheckUtils]: 14: Hoare triple {4039#(<= ~counter~0 1)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {4039#(<= ~counter~0 1)} is VALID [2022-04-28 11:23:30,268 INFO L290 TraceCheckUtils]: 15: Hoare triple {4039#(<= ~counter~0 1)} ~cond := #in~cond; {4039#(<= ~counter~0 1)} is VALID [2022-04-28 11:23:30,268 INFO L290 TraceCheckUtils]: 16: Hoare triple {4039#(<= ~counter~0 1)} assume !(0 == ~cond); {4039#(<= ~counter~0 1)} is VALID [2022-04-28 11:23:30,268 INFO L290 TraceCheckUtils]: 17: Hoare triple {4039#(<= ~counter~0 1)} assume true; {4039#(<= ~counter~0 1)} is VALID [2022-04-28 11:23:30,269 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {4039#(<= ~counter~0 1)} {4039#(<= ~counter~0 1)} #79#return; {4039#(<= ~counter~0 1)} is VALID [2022-04-28 11:23:30,269 INFO L272 TraceCheckUtils]: 19: Hoare triple {4039#(<= ~counter~0 1)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {4039#(<= ~counter~0 1)} is VALID [2022-04-28 11:23:30,269 INFO L290 TraceCheckUtils]: 20: Hoare triple {4039#(<= ~counter~0 1)} ~cond := #in~cond; {4039#(<= ~counter~0 1)} is VALID [2022-04-28 11:23:30,270 INFO L290 TraceCheckUtils]: 21: Hoare triple {4039#(<= ~counter~0 1)} assume !(0 == ~cond); {4039#(<= ~counter~0 1)} is VALID [2022-04-28 11:23:30,270 INFO L290 TraceCheckUtils]: 22: Hoare triple {4039#(<= ~counter~0 1)} assume true; {4039#(<= ~counter~0 1)} is VALID [2022-04-28 11:23:30,270 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {4039#(<= ~counter~0 1)} {4039#(<= ~counter~0 1)} #81#return; {4039#(<= ~counter~0 1)} is VALID [2022-04-28 11:23:30,271 INFO L290 TraceCheckUtils]: 24: Hoare triple {4039#(<= ~counter~0 1)} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {4039#(<= ~counter~0 1)} is VALID [2022-04-28 11:23:30,271 INFO L290 TraceCheckUtils]: 25: Hoare triple {4039#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {4079#(<= ~counter~0 2)} is VALID [2022-04-28 11:23:30,271 INFO L290 TraceCheckUtils]: 26: Hoare triple {4079#(<= ~counter~0 2)} assume !!(#t~post7 < 20);havoc #t~post7; {4079#(<= ~counter~0 2)} is VALID [2022-04-28 11:23:30,272 INFO L272 TraceCheckUtils]: 27: Hoare triple {4079#(<= ~counter~0 2)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {4079#(<= ~counter~0 2)} is VALID [2022-04-28 11:23:30,272 INFO L290 TraceCheckUtils]: 28: Hoare triple {4079#(<= ~counter~0 2)} ~cond := #in~cond; {4079#(<= ~counter~0 2)} is VALID [2022-04-28 11:23:30,272 INFO L290 TraceCheckUtils]: 29: Hoare triple {4079#(<= ~counter~0 2)} assume !(0 == ~cond); {4079#(<= ~counter~0 2)} is VALID [2022-04-28 11:23:30,273 INFO L290 TraceCheckUtils]: 30: Hoare triple {4079#(<= ~counter~0 2)} assume true; {4079#(<= ~counter~0 2)} is VALID [2022-04-28 11:23:30,273 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {4079#(<= ~counter~0 2)} {4079#(<= ~counter~0 2)} #83#return; {4079#(<= ~counter~0 2)} is VALID [2022-04-28 11:23:30,274 INFO L272 TraceCheckUtils]: 32: Hoare triple {4079#(<= ~counter~0 2)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {4079#(<= ~counter~0 2)} is VALID [2022-04-28 11:23:30,274 INFO L290 TraceCheckUtils]: 33: Hoare triple {4079#(<= ~counter~0 2)} ~cond := #in~cond; {4079#(<= ~counter~0 2)} is VALID [2022-04-28 11:23:30,274 INFO L290 TraceCheckUtils]: 34: Hoare triple {4079#(<= ~counter~0 2)} assume !(0 == ~cond); {4079#(<= ~counter~0 2)} is VALID [2022-04-28 11:23:30,274 INFO L290 TraceCheckUtils]: 35: Hoare triple {4079#(<= ~counter~0 2)} assume true; {4079#(<= ~counter~0 2)} is VALID [2022-04-28 11:23:30,275 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {4079#(<= ~counter~0 2)} {4079#(<= ~counter~0 2)} #85#return; {4079#(<= ~counter~0 2)} is VALID [2022-04-28 11:23:30,275 INFO L272 TraceCheckUtils]: 37: Hoare triple {4079#(<= ~counter~0 2)} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {4079#(<= ~counter~0 2)} is VALID [2022-04-28 11:23:30,276 INFO L290 TraceCheckUtils]: 38: Hoare triple {4079#(<= ~counter~0 2)} ~cond := #in~cond; {4079#(<= ~counter~0 2)} is VALID [2022-04-28 11:23:30,276 INFO L290 TraceCheckUtils]: 39: Hoare triple {4079#(<= ~counter~0 2)} assume !(0 == ~cond); {4079#(<= ~counter~0 2)} is VALID [2022-04-28 11:23:30,276 INFO L290 TraceCheckUtils]: 40: Hoare triple {4079#(<= ~counter~0 2)} assume true; {4079#(<= ~counter~0 2)} is VALID [2022-04-28 11:23:30,277 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {4079#(<= ~counter~0 2)} {4079#(<= ~counter~0 2)} #87#return; {4079#(<= ~counter~0 2)} is VALID [2022-04-28 11:23:30,277 INFO L290 TraceCheckUtils]: 42: Hoare triple {4079#(<= ~counter~0 2)} assume !(~r~0 >= 2 * ~b~0); {4079#(<= ~counter~0 2)} is VALID [2022-04-28 11:23:30,277 INFO L290 TraceCheckUtils]: 43: Hoare triple {4079#(<= ~counter~0 2)} ~r~0 := ~r~0 - ~b~0;~q~0 := ~q~0 + ~a~0; {4079#(<= ~counter~0 2)} is VALID [2022-04-28 11:23:30,278 INFO L290 TraceCheckUtils]: 44: Hoare triple {4079#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4137#(<= |main_#t~post6| 2)} is VALID [2022-04-28 11:23:30,278 INFO L290 TraceCheckUtils]: 45: Hoare triple {4137#(<= |main_#t~post6| 2)} assume !(#t~post6 < 20);havoc #t~post6; {3998#false} is VALID [2022-04-28 11:23:30,278 INFO L272 TraceCheckUtils]: 46: Hoare triple {3998#false} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {3998#false} is VALID [2022-04-28 11:23:30,278 INFO L290 TraceCheckUtils]: 47: Hoare triple {3998#false} ~cond := #in~cond; {3998#false} is VALID [2022-04-28 11:23:30,278 INFO L290 TraceCheckUtils]: 48: Hoare triple {3998#false} assume 0 == ~cond; {3998#false} is VALID [2022-04-28 11:23:30,278 INFO L290 TraceCheckUtils]: 49: Hoare triple {3998#false} assume !false; {3998#false} is VALID [2022-04-28 11:23:30,278 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 10 proven. 26 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-28 11:23:30,278 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:23:30,506 INFO L290 TraceCheckUtils]: 49: Hoare triple {3998#false} assume !false; {3998#false} is VALID [2022-04-28 11:23:30,507 INFO L290 TraceCheckUtils]: 48: Hoare triple {3998#false} assume 0 == ~cond; {3998#false} is VALID [2022-04-28 11:23:30,507 INFO L290 TraceCheckUtils]: 47: Hoare triple {3998#false} ~cond := #in~cond; {3998#false} is VALID [2022-04-28 11:23:30,507 INFO L272 TraceCheckUtils]: 46: Hoare triple {3998#false} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {3998#false} is VALID [2022-04-28 11:23:30,507 INFO L290 TraceCheckUtils]: 45: Hoare triple {4165#(< |main_#t~post6| 20)} assume !(#t~post6 < 20);havoc #t~post6; {3998#false} is VALID [2022-04-28 11:23:30,507 INFO L290 TraceCheckUtils]: 44: Hoare triple {4169#(< ~counter~0 20)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4165#(< |main_#t~post6| 20)} is VALID [2022-04-28 11:23:30,508 INFO L290 TraceCheckUtils]: 43: Hoare triple {4169#(< ~counter~0 20)} ~r~0 := ~r~0 - ~b~0;~q~0 := ~q~0 + ~a~0; {4169#(< ~counter~0 20)} is VALID [2022-04-28 11:23:30,508 INFO L290 TraceCheckUtils]: 42: Hoare triple {4169#(< ~counter~0 20)} assume !(~r~0 >= 2 * ~b~0); {4169#(< ~counter~0 20)} is VALID [2022-04-28 11:23:30,508 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {3997#true} {4169#(< ~counter~0 20)} #87#return; {4169#(< ~counter~0 20)} is VALID [2022-04-28 11:23:30,508 INFO L290 TraceCheckUtils]: 40: Hoare triple {3997#true} assume true; {3997#true} is VALID [2022-04-28 11:23:30,509 INFO L290 TraceCheckUtils]: 39: Hoare triple {3997#true} assume !(0 == ~cond); {3997#true} is VALID [2022-04-28 11:23:30,509 INFO L290 TraceCheckUtils]: 38: Hoare triple {3997#true} ~cond := #in~cond; {3997#true} is VALID [2022-04-28 11:23:30,509 INFO L272 TraceCheckUtils]: 37: Hoare triple {4169#(< ~counter~0 20)} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {3997#true} is VALID [2022-04-28 11:23:30,509 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {3997#true} {4169#(< ~counter~0 20)} #85#return; {4169#(< ~counter~0 20)} is VALID [2022-04-28 11:23:30,509 INFO L290 TraceCheckUtils]: 35: Hoare triple {3997#true} assume true; {3997#true} is VALID [2022-04-28 11:23:30,509 INFO L290 TraceCheckUtils]: 34: Hoare triple {3997#true} assume !(0 == ~cond); {3997#true} is VALID [2022-04-28 11:23:30,509 INFO L290 TraceCheckUtils]: 33: Hoare triple {3997#true} ~cond := #in~cond; {3997#true} is VALID [2022-04-28 11:23:30,509 INFO L272 TraceCheckUtils]: 32: Hoare triple {4169#(< ~counter~0 20)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {3997#true} is VALID [2022-04-28 11:23:30,510 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {3997#true} {4169#(< ~counter~0 20)} #83#return; {4169#(< ~counter~0 20)} is VALID [2022-04-28 11:23:30,510 INFO L290 TraceCheckUtils]: 30: Hoare triple {3997#true} assume true; {3997#true} is VALID [2022-04-28 11:23:30,510 INFO L290 TraceCheckUtils]: 29: Hoare triple {3997#true} assume !(0 == ~cond); {3997#true} is VALID [2022-04-28 11:23:30,510 INFO L290 TraceCheckUtils]: 28: Hoare triple {3997#true} ~cond := #in~cond; {3997#true} is VALID [2022-04-28 11:23:30,510 INFO L272 TraceCheckUtils]: 27: Hoare triple {4169#(< ~counter~0 20)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {3997#true} is VALID [2022-04-28 11:23:30,510 INFO L290 TraceCheckUtils]: 26: Hoare triple {4169#(< ~counter~0 20)} assume !!(#t~post7 < 20);havoc #t~post7; {4169#(< ~counter~0 20)} is VALID [2022-04-28 11:23:30,511 INFO L290 TraceCheckUtils]: 25: Hoare triple {4227#(< ~counter~0 19)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {4169#(< ~counter~0 20)} is VALID [2022-04-28 11:23:30,511 INFO L290 TraceCheckUtils]: 24: Hoare triple {4227#(< ~counter~0 19)} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {4227#(< ~counter~0 19)} is VALID [2022-04-28 11:23:30,512 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {3997#true} {4227#(< ~counter~0 19)} #81#return; {4227#(< ~counter~0 19)} is VALID [2022-04-28 11:23:30,512 INFO L290 TraceCheckUtils]: 22: Hoare triple {3997#true} assume true; {3997#true} is VALID [2022-04-28 11:23:30,512 INFO L290 TraceCheckUtils]: 21: Hoare triple {3997#true} assume !(0 == ~cond); {3997#true} is VALID [2022-04-28 11:23:30,512 INFO L290 TraceCheckUtils]: 20: Hoare triple {3997#true} ~cond := #in~cond; {3997#true} is VALID [2022-04-28 11:23:30,512 INFO L272 TraceCheckUtils]: 19: Hoare triple {4227#(< ~counter~0 19)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {3997#true} is VALID [2022-04-28 11:23:30,512 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {3997#true} {4227#(< ~counter~0 19)} #79#return; {4227#(< ~counter~0 19)} is VALID [2022-04-28 11:23:30,513 INFO L290 TraceCheckUtils]: 17: Hoare triple {3997#true} assume true; {3997#true} is VALID [2022-04-28 11:23:30,513 INFO L290 TraceCheckUtils]: 16: Hoare triple {3997#true} assume !(0 == ~cond); {3997#true} is VALID [2022-04-28 11:23:30,513 INFO L290 TraceCheckUtils]: 15: Hoare triple {3997#true} ~cond := #in~cond; {3997#true} is VALID [2022-04-28 11:23:30,513 INFO L272 TraceCheckUtils]: 14: Hoare triple {4227#(< ~counter~0 19)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {3997#true} is VALID [2022-04-28 11:23:30,513 INFO L290 TraceCheckUtils]: 13: Hoare triple {4227#(< ~counter~0 19)} assume !!(#t~post6 < 20);havoc #t~post6; {4227#(< ~counter~0 19)} is VALID [2022-04-28 11:23:30,513 INFO L290 TraceCheckUtils]: 12: Hoare triple {4267#(< ~counter~0 18)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4227#(< ~counter~0 19)} is VALID [2022-04-28 11:23:30,514 INFO L290 TraceCheckUtils]: 11: Hoare triple {4267#(< ~counter~0 18)} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {4267#(< ~counter~0 18)} is VALID [2022-04-28 11:23:30,514 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3997#true} {4267#(< ~counter~0 18)} #77#return; {4267#(< ~counter~0 18)} is VALID [2022-04-28 11:23:30,514 INFO L290 TraceCheckUtils]: 9: Hoare triple {3997#true} assume true; {3997#true} is VALID [2022-04-28 11:23:30,514 INFO L290 TraceCheckUtils]: 8: Hoare triple {3997#true} assume !(0 == ~cond); {3997#true} is VALID [2022-04-28 11:23:30,514 INFO L290 TraceCheckUtils]: 7: Hoare triple {3997#true} ~cond := #in~cond; {3997#true} is VALID [2022-04-28 11:23:30,514 INFO L272 TraceCheckUtils]: 6: Hoare triple {4267#(< ~counter~0 18)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {3997#true} is VALID [2022-04-28 11:23:30,515 INFO L290 TraceCheckUtils]: 5: Hoare triple {4267#(< ~counter~0 18)} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~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; {4267#(< ~counter~0 18)} is VALID [2022-04-28 11:23:30,515 INFO L272 TraceCheckUtils]: 4: Hoare triple {4267#(< ~counter~0 18)} call #t~ret8 := main(); {4267#(< ~counter~0 18)} is VALID [2022-04-28 11:23:30,515 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4267#(< ~counter~0 18)} {3997#true} #93#return; {4267#(< ~counter~0 18)} is VALID [2022-04-28 11:23:30,516 INFO L290 TraceCheckUtils]: 2: Hoare triple {4267#(< ~counter~0 18)} assume true; {4267#(< ~counter~0 18)} is VALID [2022-04-28 11:23:30,516 INFO L290 TraceCheckUtils]: 1: Hoare triple {3997#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(14, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {4267#(< ~counter~0 18)} is VALID [2022-04-28 11:23:30,516 INFO L272 TraceCheckUtils]: 0: Hoare triple {3997#true} call ULTIMATE.init(); {3997#true} is VALID [2022-04-28 11:23:30,516 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-04-28 11:23:30,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:23:30,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463534357] [2022-04-28 11:23:30,516 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:23:30,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [683179305] [2022-04-28 11:23:30,517 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [683179305] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 11:23:30,517 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 11:23:30,517 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-04-28 11:23:30,517 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:23:30,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1409849876] [2022-04-28 11:23:30,517 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1409849876] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:23:30,517 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:23:30,517 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 11:23:30,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798363122] [2022-04-28 11:23:30,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:23:30,517 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 5 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) Word has length 50 [2022-04-28 11:23:30,518 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:23:30,518 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 5 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2022-04-28 11:23:30,545 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:23:30,545 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 11:23:30,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:23:30,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 11:23:30,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-28 11:23:30,546 INFO L87 Difference]: Start difference. First operand 86 states and 108 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 5 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2022-04-28 11:23:30,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:23:30,784 INFO L93 Difference]: Finished difference Result 115 states and 134 transitions. [2022-04-28 11:23:30,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 11:23:30,785 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 5 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) Word has length 50 [2022-04-28 11:23:30,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:23:30,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 5 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2022-04-28 11:23:30,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 79 transitions. [2022-04-28 11:23:30,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 5 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2022-04-28 11:23:30,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 79 transitions. [2022-04-28 11:23:30,787 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 79 transitions. [2022-04-28 11:23:30,837 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-28 11:23:30,838 INFO L225 Difference]: With dead ends: 115 [2022-04-28 11:23:30,838 INFO L226 Difference]: Without dead ends: 108 [2022-04-28 11:23:30,838 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2022-04-28 11:23:30,839 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 11 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 11:23:30,839 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 145 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 11:23:30,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2022-04-28 11:23:30,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 106. [2022-04-28 11:23:30,929 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:23:30,930 INFO L82 GeneralOperation]: Start isEquivalent. First operand 108 states. Second operand has 106 states, 68 states have (on average 1.161764705882353) internal successors, (79), 71 states have internal predecessors, (79), 24 states have call successors, (24), 14 states have call predecessors, (24), 13 states have return successors, (22), 20 states have call predecessors, (22), 22 states have call successors, (22) [2022-04-28 11:23:30,930 INFO L74 IsIncluded]: Start isIncluded. First operand 108 states. Second operand has 106 states, 68 states have (on average 1.161764705882353) internal successors, (79), 71 states have internal predecessors, (79), 24 states have call successors, (24), 14 states have call predecessors, (24), 13 states have return successors, (22), 20 states have call predecessors, (22), 22 states have call successors, (22) [2022-04-28 11:23:30,931 INFO L87 Difference]: Start difference. First operand 108 states. Second operand has 106 states, 68 states have (on average 1.161764705882353) internal successors, (79), 71 states have internal predecessors, (79), 24 states have call successors, (24), 14 states have call predecessors, (24), 13 states have return successors, (22), 20 states have call predecessors, (22), 22 states have call successors, (22) [2022-04-28 11:23:30,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:23:30,934 INFO L93 Difference]: Finished difference Result 108 states and 127 transitions. [2022-04-28 11:23:30,934 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 127 transitions. [2022-04-28 11:23:30,935 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:23:30,935 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:23:30,935 INFO L74 IsIncluded]: Start isIncluded. First operand has 106 states, 68 states have (on average 1.161764705882353) internal successors, (79), 71 states have internal predecessors, (79), 24 states have call successors, (24), 14 states have call predecessors, (24), 13 states have return successors, (22), 20 states have call predecessors, (22), 22 states have call successors, (22) Second operand 108 states. [2022-04-28 11:23:30,935 INFO L87 Difference]: Start difference. First operand has 106 states, 68 states have (on average 1.161764705882353) internal successors, (79), 71 states have internal predecessors, (79), 24 states have call successors, (24), 14 states have call predecessors, (24), 13 states have return successors, (22), 20 states have call predecessors, (22), 22 states have call successors, (22) Second operand 108 states. [2022-04-28 11:23:30,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:23:30,937 INFO L93 Difference]: Finished difference Result 108 states and 127 transitions. [2022-04-28 11:23:30,937 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 127 transitions. [2022-04-28 11:23:30,938 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:23:30,938 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:23:30,938 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:23:30,938 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:23:30,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 68 states have (on average 1.161764705882353) internal successors, (79), 71 states have internal predecessors, (79), 24 states have call successors, (24), 14 states have call predecessors, (24), 13 states have return successors, (22), 20 states have call predecessors, (22), 22 states have call successors, (22) [2022-04-28 11:23:30,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 125 transitions. [2022-04-28 11:23:30,940 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 125 transitions. Word has length 50 [2022-04-28 11:23:30,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:23:30,941 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 125 transitions. [2022-04-28 11:23:30,941 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 5 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2022-04-28 11:23:30,941 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 106 states and 125 transitions. [2022-04-28 11:23:31,055 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 125 edges. 125 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:23:31,056 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 125 transitions. [2022-04-28 11:23:31,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-04-28 11:23:31,056 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:23:31,056 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:23:31,073 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-28 11:23:31,256 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-28 11:23:31,257 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:23:31,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:23:31,257 INFO L85 PathProgramCache]: Analyzing trace with hash -484699953, now seen corresponding path program 1 times [2022-04-28 11:23:31,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:23:31,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1520979941] [2022-04-28 11:23:47,018 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:23:47,018 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:23:47,018 INFO L85 PathProgramCache]: Analyzing trace with hash -484699953, now seen corresponding path program 2 times [2022-04-28 11:23:47,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:23:47,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601739360] [2022-04-28 11:23:47,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:23:47,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:23:47,037 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:23:47,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [649105088] [2022-04-28 11:23:47,038 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:23:47,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:23:47,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:23:47,039 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-28 11:23:47,041 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-28 11:23:47,092 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 11:23:47,092 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:23:47,093 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-28 11:23:47,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:23:47,102 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:23:47,401 INFO L272 TraceCheckUtils]: 0: Hoare triple {4966#true} call ULTIMATE.init(); {4966#true} is VALID [2022-04-28 11:23:47,401 INFO L290 TraceCheckUtils]: 1: Hoare triple {4966#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(14, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {4966#true} is VALID [2022-04-28 11:23:47,401 INFO L290 TraceCheckUtils]: 2: Hoare triple {4966#true} assume true; {4966#true} is VALID [2022-04-28 11:23:47,401 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4966#true} {4966#true} #93#return; {4966#true} is VALID [2022-04-28 11:23:47,401 INFO L272 TraceCheckUtils]: 4: Hoare triple {4966#true} call #t~ret8 := main(); {4966#true} is VALID [2022-04-28 11:23:47,401 INFO L290 TraceCheckUtils]: 5: Hoare triple {4966#true} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~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; {4966#true} is VALID [2022-04-28 11:23:47,401 INFO L272 TraceCheckUtils]: 6: Hoare triple {4966#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {4966#true} is VALID [2022-04-28 11:23:47,401 INFO L290 TraceCheckUtils]: 7: Hoare triple {4966#true} ~cond := #in~cond; {4966#true} is VALID [2022-04-28 11:23:47,401 INFO L290 TraceCheckUtils]: 8: Hoare triple {4966#true} assume !(0 == ~cond); {4966#true} is VALID [2022-04-28 11:23:47,401 INFO L290 TraceCheckUtils]: 9: Hoare triple {4966#true} assume true; {4966#true} is VALID [2022-04-28 11:23:47,402 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4966#true} {4966#true} #77#return; {4966#true} is VALID [2022-04-28 11:23:47,402 INFO L290 TraceCheckUtils]: 11: Hoare triple {4966#true} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {5004#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:23:47,402 INFO L290 TraceCheckUtils]: 12: Hoare triple {5004#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5004#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:23:47,403 INFO L290 TraceCheckUtils]: 13: Hoare triple {5004#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} assume !!(#t~post6 < 20);havoc #t~post6; {5004#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:23:47,405 INFO L272 TraceCheckUtils]: 14: Hoare triple {5004#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {4966#true} is VALID [2022-04-28 11:23:47,405 INFO L290 TraceCheckUtils]: 15: Hoare triple {4966#true} ~cond := #in~cond; {4966#true} is VALID [2022-04-28 11:23:47,405 INFO L290 TraceCheckUtils]: 16: Hoare triple {4966#true} assume !(0 == ~cond); {4966#true} is VALID [2022-04-28 11:23:47,406 INFO L290 TraceCheckUtils]: 17: Hoare triple {4966#true} assume true; {4966#true} is VALID [2022-04-28 11:23:47,406 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {4966#true} {5004#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #79#return; {5004#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:23:47,406 INFO L272 TraceCheckUtils]: 19: Hoare triple {5004#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {4966#true} is VALID [2022-04-28 11:23:47,406 INFO L290 TraceCheckUtils]: 20: Hoare triple {4966#true} ~cond := #in~cond; {4966#true} is VALID [2022-04-28 11:23:47,406 INFO L290 TraceCheckUtils]: 21: Hoare triple {4966#true} assume !(0 == ~cond); {4966#true} is VALID [2022-04-28 11:23:47,406 INFO L290 TraceCheckUtils]: 22: Hoare triple {4966#true} assume true; {4966#true} is VALID [2022-04-28 11:23:47,407 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {4966#true} {5004#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #81#return; {5004#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:23:47,407 INFO L290 TraceCheckUtils]: 24: Hoare triple {5004#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {5044#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-28 11:23:47,408 INFO L290 TraceCheckUtils]: 25: Hoare triple {5044#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {5044#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-28 11:23:47,408 INFO L290 TraceCheckUtils]: 26: Hoare triple {5044#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} assume !!(#t~post7 < 20);havoc #t~post7; {5044#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-28 11:23:47,408 INFO L272 TraceCheckUtils]: 27: Hoare triple {5044#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {4966#true} is VALID [2022-04-28 11:23:47,408 INFO L290 TraceCheckUtils]: 28: Hoare triple {4966#true} ~cond := #in~cond; {4966#true} is VALID [2022-04-28 11:23:47,408 INFO L290 TraceCheckUtils]: 29: Hoare triple {4966#true} assume !(0 == ~cond); {4966#true} is VALID [2022-04-28 11:23:47,408 INFO L290 TraceCheckUtils]: 30: Hoare triple {4966#true} assume true; {4966#true} is VALID [2022-04-28 11:23:47,409 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {4966#true} {5044#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #83#return; {5044#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-28 11:23:47,409 INFO L272 TraceCheckUtils]: 32: Hoare triple {5044#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {4966#true} is VALID [2022-04-28 11:23:47,409 INFO L290 TraceCheckUtils]: 33: Hoare triple {4966#true} ~cond := #in~cond; {4966#true} is VALID [2022-04-28 11:23:47,409 INFO L290 TraceCheckUtils]: 34: Hoare triple {4966#true} assume !(0 == ~cond); {4966#true} is VALID [2022-04-28 11:23:47,409 INFO L290 TraceCheckUtils]: 35: Hoare triple {4966#true} assume true; {4966#true} is VALID [2022-04-28 11:23:47,410 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {4966#true} {5044#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #85#return; {5044#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-28 11:23:47,410 INFO L272 TraceCheckUtils]: 37: Hoare triple {5044#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {4966#true} is VALID [2022-04-28 11:23:47,410 INFO L290 TraceCheckUtils]: 38: Hoare triple {4966#true} ~cond := #in~cond; {4966#true} is VALID [2022-04-28 11:23:47,410 INFO L290 TraceCheckUtils]: 39: Hoare triple {4966#true} assume !(0 == ~cond); {4966#true} is VALID [2022-04-28 11:23:47,410 INFO L290 TraceCheckUtils]: 40: Hoare triple {4966#true} assume true; {4966#true} is VALID [2022-04-28 11:23:47,410 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {4966#true} {5044#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #87#return; {5044#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-28 11:23:47,411 INFO L290 TraceCheckUtils]: 42: Hoare triple {5044#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} assume !(~r~0 >= 2 * ~b~0); {5044#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-28 11:23:47,411 INFO L290 TraceCheckUtils]: 43: Hoare triple {5044#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} ~r~0 := ~r~0 - ~b~0;~q~0 := ~q~0 + ~a~0; {5102#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~r~0) (= main_~q~0 1))} is VALID [2022-04-28 11:23:47,412 INFO L290 TraceCheckUtils]: 44: Hoare triple {5102#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~r~0) (= main_~q~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5102#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~r~0) (= main_~q~0 1))} is VALID [2022-04-28 11:23:47,412 INFO L290 TraceCheckUtils]: 45: Hoare triple {5102#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~r~0) (= main_~q~0 1))} assume !!(#t~post6 < 20);havoc #t~post6; {5102#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~r~0) (= main_~q~0 1))} is VALID [2022-04-28 11:23:47,412 INFO L272 TraceCheckUtils]: 46: Hoare triple {5102#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~r~0) (= main_~q~0 1))} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {4966#true} is VALID [2022-04-28 11:23:47,412 INFO L290 TraceCheckUtils]: 47: Hoare triple {4966#true} ~cond := #in~cond; {4966#true} is VALID [2022-04-28 11:23:47,412 INFO L290 TraceCheckUtils]: 48: Hoare triple {4966#true} assume !(0 == ~cond); {4966#true} is VALID [2022-04-28 11:23:47,412 INFO L290 TraceCheckUtils]: 49: Hoare triple {4966#true} assume true; {4966#true} is VALID [2022-04-28 11:23:47,413 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {4966#true} {5102#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~r~0) (= main_~q~0 1))} #79#return; {5102#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~r~0) (= main_~q~0 1))} is VALID [2022-04-28 11:23:47,413 INFO L272 TraceCheckUtils]: 51: Hoare triple {5102#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~r~0) (= main_~q~0 1))} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {5127#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:23:47,414 INFO L290 TraceCheckUtils]: 52: Hoare triple {5127#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5131#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:23:47,415 INFO L290 TraceCheckUtils]: 53: Hoare triple {5131#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4967#false} is VALID [2022-04-28 11:23:47,415 INFO L290 TraceCheckUtils]: 54: Hoare triple {4967#false} assume !false; {4967#false} is VALID [2022-04-28 11:23:47,415 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-28 11:23:47,415 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:24:08,649 INFO L290 TraceCheckUtils]: 54: Hoare triple {4967#false} assume !false; {4967#false} is VALID [2022-04-28 11:24:08,649 INFO L290 TraceCheckUtils]: 53: Hoare triple {5131#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4967#false} is VALID [2022-04-28 11:24:08,650 INFO L290 TraceCheckUtils]: 52: Hoare triple {5127#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5131#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:24:08,650 INFO L272 TraceCheckUtils]: 51: Hoare triple {5147#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {5127#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:24:08,651 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {4966#true} {5147#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} #79#return; {5147#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:24:08,651 INFO L290 TraceCheckUtils]: 49: Hoare triple {4966#true} assume true; {4966#true} is VALID [2022-04-28 11:24:08,651 INFO L290 TraceCheckUtils]: 48: Hoare triple {4966#true} assume !(0 == ~cond); {4966#true} is VALID [2022-04-28 11:24:08,651 INFO L290 TraceCheckUtils]: 47: Hoare triple {4966#true} ~cond := #in~cond; {4966#true} is VALID [2022-04-28 11:24:08,651 INFO L272 TraceCheckUtils]: 46: Hoare triple {5147#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {4966#true} is VALID [2022-04-28 11:24:08,651 INFO L290 TraceCheckUtils]: 45: Hoare triple {5147#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} assume !!(#t~post6 < 20);havoc #t~post6; {5147#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:24:08,652 INFO L290 TraceCheckUtils]: 44: Hoare triple {5147#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5147#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:24:08,661 INFO L290 TraceCheckUtils]: 43: Hoare triple {5172#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} ~r~0 := ~r~0 - ~b~0;~q~0 := ~q~0 + ~a~0; {5147#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:24:08,661 INFO L290 TraceCheckUtils]: 42: Hoare triple {5172#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} assume !(~r~0 >= 2 * ~b~0); {5172#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} is VALID [2022-04-28 11:24:08,662 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {4966#true} {5172#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} #87#return; {5172#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} is VALID [2022-04-28 11:24:08,662 INFO L290 TraceCheckUtils]: 40: Hoare triple {4966#true} assume true; {4966#true} is VALID [2022-04-28 11:24:08,662 INFO L290 TraceCheckUtils]: 39: Hoare triple {4966#true} assume !(0 == ~cond); {4966#true} is VALID [2022-04-28 11:24:08,662 INFO L290 TraceCheckUtils]: 38: Hoare triple {4966#true} ~cond := #in~cond; {4966#true} is VALID [2022-04-28 11:24:08,662 INFO L272 TraceCheckUtils]: 37: Hoare triple {5172#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {4966#true} is VALID [2022-04-28 11:24:08,662 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {4966#true} {5172#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} #85#return; {5172#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} is VALID [2022-04-28 11:24:08,663 INFO L290 TraceCheckUtils]: 35: Hoare triple {4966#true} assume true; {4966#true} is VALID [2022-04-28 11:24:08,663 INFO L290 TraceCheckUtils]: 34: Hoare triple {4966#true} assume !(0 == ~cond); {4966#true} is VALID [2022-04-28 11:24:08,663 INFO L290 TraceCheckUtils]: 33: Hoare triple {4966#true} ~cond := #in~cond; {4966#true} is VALID [2022-04-28 11:24:08,663 INFO L272 TraceCheckUtils]: 32: Hoare triple {5172#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {4966#true} is VALID [2022-04-28 11:24:08,663 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {4966#true} {5172#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} #83#return; {5172#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} is VALID [2022-04-28 11:24:08,663 INFO L290 TraceCheckUtils]: 30: Hoare triple {4966#true} assume true; {4966#true} is VALID [2022-04-28 11:24:08,663 INFO L290 TraceCheckUtils]: 29: Hoare triple {4966#true} assume !(0 == ~cond); {4966#true} is VALID [2022-04-28 11:24:08,663 INFO L290 TraceCheckUtils]: 28: Hoare triple {4966#true} ~cond := #in~cond; {4966#true} is VALID [2022-04-28 11:24:08,664 INFO L272 TraceCheckUtils]: 27: Hoare triple {5172#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {4966#true} is VALID [2022-04-28 11:24:08,664 INFO L290 TraceCheckUtils]: 26: Hoare triple {5172#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} assume !!(#t~post7 < 20);havoc #t~post7; {5172#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} is VALID [2022-04-28 11:24:08,664 INFO L290 TraceCheckUtils]: 25: Hoare triple {5172#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {5172#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} is VALID [2022-04-28 11:24:08,665 INFO L290 TraceCheckUtils]: 24: Hoare triple {5004#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {5172#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} is VALID [2022-04-28 11:24:08,665 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {4966#true} {5004#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #81#return; {5004#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:24:08,665 INFO L290 TraceCheckUtils]: 22: Hoare triple {4966#true} assume true; {4966#true} is VALID [2022-04-28 11:24:08,665 INFO L290 TraceCheckUtils]: 21: Hoare triple {4966#true} assume !(0 == ~cond); {4966#true} is VALID [2022-04-28 11:24:08,665 INFO L290 TraceCheckUtils]: 20: Hoare triple {4966#true} ~cond := #in~cond; {4966#true} is VALID [2022-04-28 11:24:08,665 INFO L272 TraceCheckUtils]: 19: Hoare triple {5004#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {4966#true} is VALID [2022-04-28 11:24:08,666 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {4966#true} {5004#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #79#return; {5004#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:24:08,666 INFO L290 TraceCheckUtils]: 17: Hoare triple {4966#true} assume true; {4966#true} is VALID [2022-04-28 11:24:08,666 INFO L290 TraceCheckUtils]: 16: Hoare triple {4966#true} assume !(0 == ~cond); {4966#true} is VALID [2022-04-28 11:24:08,666 INFO L290 TraceCheckUtils]: 15: Hoare triple {4966#true} ~cond := #in~cond; {4966#true} is VALID [2022-04-28 11:24:08,666 INFO L272 TraceCheckUtils]: 14: Hoare triple {5004#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {4966#true} is VALID [2022-04-28 11:24:08,666 INFO L290 TraceCheckUtils]: 13: Hoare triple {5004#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} assume !!(#t~post6 < 20);havoc #t~post6; {5004#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:24:08,667 INFO L290 TraceCheckUtils]: 12: Hoare triple {5004#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5004#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:24:08,667 INFO L290 TraceCheckUtils]: 11: Hoare triple {4966#true} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {5004#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:24:08,667 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4966#true} {4966#true} #77#return; {4966#true} is VALID [2022-04-28 11:24:08,667 INFO L290 TraceCheckUtils]: 9: Hoare triple {4966#true} assume true; {4966#true} is VALID [2022-04-28 11:24:08,667 INFO L290 TraceCheckUtils]: 8: Hoare triple {4966#true} assume !(0 == ~cond); {4966#true} is VALID [2022-04-28 11:24:08,667 INFO L290 TraceCheckUtils]: 7: Hoare triple {4966#true} ~cond := #in~cond; {4966#true} is VALID [2022-04-28 11:24:08,668 INFO L272 TraceCheckUtils]: 6: Hoare triple {4966#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {4966#true} is VALID [2022-04-28 11:24:08,668 INFO L290 TraceCheckUtils]: 5: Hoare triple {4966#true} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~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; {4966#true} is VALID [2022-04-28 11:24:08,668 INFO L272 TraceCheckUtils]: 4: Hoare triple {4966#true} call #t~ret8 := main(); {4966#true} is VALID [2022-04-28 11:24:08,668 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4966#true} {4966#true} #93#return; {4966#true} is VALID [2022-04-28 11:24:08,668 INFO L290 TraceCheckUtils]: 2: Hoare triple {4966#true} assume true; {4966#true} is VALID [2022-04-28 11:24:08,668 INFO L290 TraceCheckUtils]: 1: Hoare triple {4966#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(14, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {4966#true} is VALID [2022-04-28 11:24:08,668 INFO L272 TraceCheckUtils]: 0: Hoare triple {4966#true} call ULTIMATE.init(); {4966#true} is VALID [2022-04-28 11:24:08,668 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-28 11:24:08,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:24:08,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601739360] [2022-04-28 11:24:08,668 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:24:08,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [649105088] [2022-04-28 11:24:08,668 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [649105088] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 11:24:08,668 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 11:24:08,668 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2022-04-28 11:24:08,669 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:24:08,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1520979941] [2022-04-28 11:24:08,669 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1520979941] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:24:08,669 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:24:08,669 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 11:24:08,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216679735] [2022-04-28 11:24:08,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:24:08,669 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 55 [2022-04-28 11:24:08,669 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:24:08,670 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-04-28 11:24:08,697 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:24:08,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 11:24:08,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:24:08,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 11:24:08,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-04-28 11:24:08,698 INFO L87 Difference]: Start difference. First operand 106 states and 125 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-04-28 11:24:09,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:24:09,221 INFO L93 Difference]: Finished difference Result 134 states and 166 transitions. [2022-04-28 11:24:09,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 11:24:09,221 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 55 [2022-04-28 11:24:09,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:24:09,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-04-28 11:24:09,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 107 transitions. [2022-04-28 11:24:09,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-04-28 11:24:09,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 107 transitions. [2022-04-28 11:24:09,227 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 107 transitions. [2022-04-28 11:24:09,314 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 107 edges. 107 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:24:09,316 INFO L225 Difference]: With dead ends: 134 [2022-04-28 11:24:09,316 INFO L226 Difference]: Without dead ends: 131 [2022-04-28 11:24:09,319 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 100 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-04-28 11:24:09,320 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 24 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 11:24:09,321 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 237 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 11:24:09,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2022-04-28 11:24:09,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 127. [2022-04-28 11:24:09,458 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:24:09,458 INFO L82 GeneralOperation]: Start isEquivalent. First operand 131 states. Second operand has 127 states, 79 states have (on average 1.1898734177215189) internal successors, (94), 82 states have internal predecessors, (94), 33 states have call successors, (33), 15 states have call predecessors, (33), 14 states have return successors, (31), 29 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-28 11:24:09,460 INFO L74 IsIncluded]: Start isIncluded. First operand 131 states. Second operand has 127 states, 79 states have (on average 1.1898734177215189) internal successors, (94), 82 states have internal predecessors, (94), 33 states have call successors, (33), 15 states have call predecessors, (33), 14 states have return successors, (31), 29 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-28 11:24:09,461 INFO L87 Difference]: Start difference. First operand 131 states. Second operand has 127 states, 79 states have (on average 1.1898734177215189) internal successors, (94), 82 states have internal predecessors, (94), 33 states have call successors, (33), 15 states have call predecessors, (33), 14 states have return successors, (31), 29 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-28 11:24:09,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:24:09,465 INFO L93 Difference]: Finished difference Result 131 states and 162 transitions. [2022-04-28 11:24:09,465 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 162 transitions. [2022-04-28 11:24:09,466 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:24:09,466 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:24:09,467 INFO L74 IsIncluded]: Start isIncluded. First operand has 127 states, 79 states have (on average 1.1898734177215189) internal successors, (94), 82 states have internal predecessors, (94), 33 states have call successors, (33), 15 states have call predecessors, (33), 14 states have return successors, (31), 29 states have call predecessors, (31), 31 states have call successors, (31) Second operand 131 states. [2022-04-28 11:24:09,467 INFO L87 Difference]: Start difference. First operand has 127 states, 79 states have (on average 1.1898734177215189) internal successors, (94), 82 states have internal predecessors, (94), 33 states have call successors, (33), 15 states have call predecessors, (33), 14 states have return successors, (31), 29 states have call predecessors, (31), 31 states have call successors, (31) Second operand 131 states. [2022-04-28 11:24:09,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:24:09,473 INFO L93 Difference]: Finished difference Result 131 states and 162 transitions. [2022-04-28 11:24:09,473 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 162 transitions. [2022-04-28 11:24:09,473 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:24:09,473 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:24:09,473 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:24:09,473 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:24:09,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 79 states have (on average 1.1898734177215189) internal successors, (94), 82 states have internal predecessors, (94), 33 states have call successors, (33), 15 states have call predecessors, (33), 14 states have return successors, (31), 29 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-28 11:24:09,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 158 transitions. [2022-04-28 11:24:09,480 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 158 transitions. Word has length 55 [2022-04-28 11:24:09,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:24:09,480 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 158 transitions. [2022-04-28 11:24:09,480 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-04-28 11:24:09,480 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 127 states and 158 transitions. [2022-04-28 11:24:09,664 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 158 edges. 158 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:24:09,665 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 158 transitions. [2022-04-28 11:24:09,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-04-28 11:24:09,666 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:24:09,666 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:24:09,689 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-04-28 11:24:09,879 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-28 11:24:09,880 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:24:09,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:24:09,880 INFO L85 PathProgramCache]: Analyzing trace with hash 765609565, now seen corresponding path program 1 times [2022-04-28 11:24:09,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:24:09,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [810012586] [2022-04-28 11:24:22,407 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:24:22,408 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:24:22,408 INFO L85 PathProgramCache]: Analyzing trace with hash 765609565, now seen corresponding path program 2 times [2022-04-28 11:24:22,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:24:22,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973988498] [2022-04-28 11:24:22,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:24:22,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:24:22,417 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:24:22,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2045467350] [2022-04-28 11:24:22,417 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:24:22,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:24:22,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:24:22,418 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-28 11:24:22,447 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-04-28 11:24:22,485 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 11:24:22,486 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:24:22,486 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 11:24:22,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:24:22,497 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:24:22,747 INFO L272 TraceCheckUtils]: 0: Hoare triple {6090#true} call ULTIMATE.init(); {6090#true} is VALID [2022-04-28 11:24:22,748 INFO L290 TraceCheckUtils]: 1: Hoare triple {6090#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(14, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {6098#(<= ~counter~0 0)} is VALID [2022-04-28 11:24:22,748 INFO L290 TraceCheckUtils]: 2: Hoare triple {6098#(<= ~counter~0 0)} assume true; {6098#(<= ~counter~0 0)} is VALID [2022-04-28 11:24:22,749 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6098#(<= ~counter~0 0)} {6090#true} #93#return; {6098#(<= ~counter~0 0)} is VALID [2022-04-28 11:24:22,749 INFO L272 TraceCheckUtils]: 4: Hoare triple {6098#(<= ~counter~0 0)} call #t~ret8 := main(); {6098#(<= ~counter~0 0)} is VALID [2022-04-28 11:24:22,750 INFO L290 TraceCheckUtils]: 5: Hoare triple {6098#(<= ~counter~0 0)} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~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; {6098#(<= ~counter~0 0)} is VALID [2022-04-28 11:24:22,750 INFO L272 TraceCheckUtils]: 6: Hoare triple {6098#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {6098#(<= ~counter~0 0)} is VALID [2022-04-28 11:24:22,750 INFO L290 TraceCheckUtils]: 7: Hoare triple {6098#(<= ~counter~0 0)} ~cond := #in~cond; {6098#(<= ~counter~0 0)} is VALID [2022-04-28 11:24:22,751 INFO L290 TraceCheckUtils]: 8: Hoare triple {6098#(<= ~counter~0 0)} assume !(0 == ~cond); {6098#(<= ~counter~0 0)} is VALID [2022-04-28 11:24:22,751 INFO L290 TraceCheckUtils]: 9: Hoare triple {6098#(<= ~counter~0 0)} assume true; {6098#(<= ~counter~0 0)} is VALID [2022-04-28 11:24:22,752 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6098#(<= ~counter~0 0)} {6098#(<= ~counter~0 0)} #77#return; {6098#(<= ~counter~0 0)} is VALID [2022-04-28 11:24:22,752 INFO L290 TraceCheckUtils]: 11: Hoare triple {6098#(<= ~counter~0 0)} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {6098#(<= ~counter~0 0)} is VALID [2022-04-28 11:24:22,752 INFO L290 TraceCheckUtils]: 12: Hoare triple {6098#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6132#(<= ~counter~0 1)} is VALID [2022-04-28 11:24:22,753 INFO L290 TraceCheckUtils]: 13: Hoare triple {6132#(<= ~counter~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {6132#(<= ~counter~0 1)} is VALID [2022-04-28 11:24:22,753 INFO L272 TraceCheckUtils]: 14: Hoare triple {6132#(<= ~counter~0 1)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {6132#(<= ~counter~0 1)} is VALID [2022-04-28 11:24:22,754 INFO L290 TraceCheckUtils]: 15: Hoare triple {6132#(<= ~counter~0 1)} ~cond := #in~cond; {6132#(<= ~counter~0 1)} is VALID [2022-04-28 11:24:22,754 INFO L290 TraceCheckUtils]: 16: Hoare triple {6132#(<= ~counter~0 1)} assume !(0 == ~cond); {6132#(<= ~counter~0 1)} is VALID [2022-04-28 11:24:22,754 INFO L290 TraceCheckUtils]: 17: Hoare triple {6132#(<= ~counter~0 1)} assume true; {6132#(<= ~counter~0 1)} is VALID [2022-04-28 11:24:22,755 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {6132#(<= ~counter~0 1)} {6132#(<= ~counter~0 1)} #79#return; {6132#(<= ~counter~0 1)} is VALID [2022-04-28 11:24:22,755 INFO L272 TraceCheckUtils]: 19: Hoare triple {6132#(<= ~counter~0 1)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {6132#(<= ~counter~0 1)} is VALID [2022-04-28 11:24:22,756 INFO L290 TraceCheckUtils]: 20: Hoare triple {6132#(<= ~counter~0 1)} ~cond := #in~cond; {6132#(<= ~counter~0 1)} is VALID [2022-04-28 11:24:22,756 INFO L290 TraceCheckUtils]: 21: Hoare triple {6132#(<= ~counter~0 1)} assume !(0 == ~cond); {6132#(<= ~counter~0 1)} is VALID [2022-04-28 11:24:22,756 INFO L290 TraceCheckUtils]: 22: Hoare triple {6132#(<= ~counter~0 1)} assume true; {6132#(<= ~counter~0 1)} is VALID [2022-04-28 11:24:22,757 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {6132#(<= ~counter~0 1)} {6132#(<= ~counter~0 1)} #81#return; {6132#(<= ~counter~0 1)} is VALID [2022-04-28 11:24:22,757 INFO L290 TraceCheckUtils]: 24: Hoare triple {6132#(<= ~counter~0 1)} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {6132#(<= ~counter~0 1)} is VALID [2022-04-28 11:24:22,758 INFO L290 TraceCheckUtils]: 25: Hoare triple {6132#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {6172#(<= ~counter~0 2)} is VALID [2022-04-28 11:24:22,758 INFO L290 TraceCheckUtils]: 26: Hoare triple {6172#(<= ~counter~0 2)} assume !!(#t~post7 < 20);havoc #t~post7; {6172#(<= ~counter~0 2)} is VALID [2022-04-28 11:24:22,759 INFO L272 TraceCheckUtils]: 27: Hoare triple {6172#(<= ~counter~0 2)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {6172#(<= ~counter~0 2)} is VALID [2022-04-28 11:24:22,759 INFO L290 TraceCheckUtils]: 28: Hoare triple {6172#(<= ~counter~0 2)} ~cond := #in~cond; {6172#(<= ~counter~0 2)} is VALID [2022-04-28 11:24:22,759 INFO L290 TraceCheckUtils]: 29: Hoare triple {6172#(<= ~counter~0 2)} assume !(0 == ~cond); {6172#(<= ~counter~0 2)} is VALID [2022-04-28 11:24:22,760 INFO L290 TraceCheckUtils]: 30: Hoare triple {6172#(<= ~counter~0 2)} assume true; {6172#(<= ~counter~0 2)} is VALID [2022-04-28 11:24:22,760 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {6172#(<= ~counter~0 2)} {6172#(<= ~counter~0 2)} #83#return; {6172#(<= ~counter~0 2)} is VALID [2022-04-28 11:24:22,761 INFO L272 TraceCheckUtils]: 32: Hoare triple {6172#(<= ~counter~0 2)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {6172#(<= ~counter~0 2)} is VALID [2022-04-28 11:24:22,761 INFO L290 TraceCheckUtils]: 33: Hoare triple {6172#(<= ~counter~0 2)} ~cond := #in~cond; {6172#(<= ~counter~0 2)} is VALID [2022-04-28 11:24:22,762 INFO L290 TraceCheckUtils]: 34: Hoare triple {6172#(<= ~counter~0 2)} assume !(0 == ~cond); {6172#(<= ~counter~0 2)} is VALID [2022-04-28 11:24:22,762 INFO L290 TraceCheckUtils]: 35: Hoare triple {6172#(<= ~counter~0 2)} assume true; {6172#(<= ~counter~0 2)} is VALID [2022-04-28 11:24:22,762 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {6172#(<= ~counter~0 2)} {6172#(<= ~counter~0 2)} #85#return; {6172#(<= ~counter~0 2)} is VALID [2022-04-28 11:24:22,763 INFO L272 TraceCheckUtils]: 37: Hoare triple {6172#(<= ~counter~0 2)} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {6172#(<= ~counter~0 2)} is VALID [2022-04-28 11:24:22,763 INFO L290 TraceCheckUtils]: 38: Hoare triple {6172#(<= ~counter~0 2)} ~cond := #in~cond; {6172#(<= ~counter~0 2)} is VALID [2022-04-28 11:24:22,763 INFO L290 TraceCheckUtils]: 39: Hoare triple {6172#(<= ~counter~0 2)} assume !(0 == ~cond); {6172#(<= ~counter~0 2)} is VALID [2022-04-28 11:24:22,764 INFO L290 TraceCheckUtils]: 40: Hoare triple {6172#(<= ~counter~0 2)} assume true; {6172#(<= ~counter~0 2)} is VALID [2022-04-28 11:24:22,764 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {6172#(<= ~counter~0 2)} {6172#(<= ~counter~0 2)} #87#return; {6172#(<= ~counter~0 2)} is VALID [2022-04-28 11:24:22,764 INFO L290 TraceCheckUtils]: 42: Hoare triple {6172#(<= ~counter~0 2)} assume !!(~r~0 >= 2 * ~b~0); {6172#(<= ~counter~0 2)} is VALID [2022-04-28 11:24:22,765 INFO L272 TraceCheckUtils]: 43: Hoare triple {6172#(<= ~counter~0 2)} call __VERIFIER_assert((if ~r~0 >= 2 * ~y~0 * ~a~0 then 1 else 0)); {6172#(<= ~counter~0 2)} is VALID [2022-04-28 11:24:22,765 INFO L290 TraceCheckUtils]: 44: Hoare triple {6172#(<= ~counter~0 2)} ~cond := #in~cond; {6172#(<= ~counter~0 2)} is VALID [2022-04-28 11:24:22,766 INFO L290 TraceCheckUtils]: 45: Hoare triple {6172#(<= ~counter~0 2)} assume !(0 == ~cond); {6172#(<= ~counter~0 2)} is VALID [2022-04-28 11:24:22,766 INFO L290 TraceCheckUtils]: 46: Hoare triple {6172#(<= ~counter~0 2)} assume true; {6172#(<= ~counter~0 2)} is VALID [2022-04-28 11:24:22,766 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {6172#(<= ~counter~0 2)} {6172#(<= ~counter~0 2)} #89#return; {6172#(<= ~counter~0 2)} is VALID [2022-04-28 11:24:22,767 INFO L290 TraceCheckUtils]: 48: Hoare triple {6172#(<= ~counter~0 2)} ~a~0 := 2 * ~a~0;~b~0 := 2 * ~b~0; {6172#(<= ~counter~0 2)} is VALID [2022-04-28 11:24:22,767 INFO L290 TraceCheckUtils]: 49: Hoare triple {6172#(<= ~counter~0 2)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {6245#(<= |main_#t~post7| 2)} is VALID [2022-04-28 11:24:22,767 INFO L290 TraceCheckUtils]: 50: Hoare triple {6245#(<= |main_#t~post7| 2)} assume !(#t~post7 < 20);havoc #t~post7; {6091#false} is VALID [2022-04-28 11:24:22,767 INFO L290 TraceCheckUtils]: 51: Hoare triple {6091#false} ~r~0 := ~r~0 - ~b~0;~q~0 := ~q~0 + ~a~0; {6091#false} is VALID [2022-04-28 11:24:22,768 INFO L290 TraceCheckUtils]: 52: Hoare triple {6091#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6091#false} is VALID [2022-04-28 11:24:22,768 INFO L290 TraceCheckUtils]: 53: Hoare triple {6091#false} assume !(#t~post6 < 20);havoc #t~post6; {6091#false} is VALID [2022-04-28 11:24:22,768 INFO L272 TraceCheckUtils]: 54: Hoare triple {6091#false} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {6091#false} is VALID [2022-04-28 11:24:22,768 INFO L290 TraceCheckUtils]: 55: Hoare triple {6091#false} ~cond := #in~cond; {6091#false} is VALID [2022-04-28 11:24:22,768 INFO L290 TraceCheckUtils]: 56: Hoare triple {6091#false} assume 0 == ~cond; {6091#false} is VALID [2022-04-28 11:24:22,768 INFO L290 TraceCheckUtils]: 57: Hoare triple {6091#false} assume !false; {6091#false} is VALID [2022-04-28 11:24:22,768 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 14 proven. 34 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-28 11:24:22,768 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:24:23,043 INFO L290 TraceCheckUtils]: 57: Hoare triple {6091#false} assume !false; {6091#false} is VALID [2022-04-28 11:24:23,043 INFO L290 TraceCheckUtils]: 56: Hoare triple {6091#false} assume 0 == ~cond; {6091#false} is VALID [2022-04-28 11:24:23,043 INFO L290 TraceCheckUtils]: 55: Hoare triple {6091#false} ~cond := #in~cond; {6091#false} is VALID [2022-04-28 11:24:23,043 INFO L272 TraceCheckUtils]: 54: Hoare triple {6091#false} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {6091#false} is VALID [2022-04-28 11:24:23,043 INFO L290 TraceCheckUtils]: 53: Hoare triple {6091#false} assume !(#t~post6 < 20);havoc #t~post6; {6091#false} is VALID [2022-04-28 11:24:23,044 INFO L290 TraceCheckUtils]: 52: Hoare triple {6091#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6091#false} is VALID [2022-04-28 11:24:23,044 INFO L290 TraceCheckUtils]: 51: Hoare triple {6091#false} ~r~0 := ~r~0 - ~b~0;~q~0 := ~q~0 + ~a~0; {6091#false} is VALID [2022-04-28 11:24:23,044 INFO L290 TraceCheckUtils]: 50: Hoare triple {6291#(< |main_#t~post7| 20)} assume !(#t~post7 < 20);havoc #t~post7; {6091#false} is VALID [2022-04-28 11:24:23,044 INFO L290 TraceCheckUtils]: 49: Hoare triple {6295#(< ~counter~0 20)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {6291#(< |main_#t~post7| 20)} is VALID [2022-04-28 11:24:23,045 INFO L290 TraceCheckUtils]: 48: Hoare triple {6295#(< ~counter~0 20)} ~a~0 := 2 * ~a~0;~b~0 := 2 * ~b~0; {6295#(< ~counter~0 20)} is VALID [2022-04-28 11:24:23,045 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {6090#true} {6295#(< ~counter~0 20)} #89#return; {6295#(< ~counter~0 20)} is VALID [2022-04-28 11:24:23,045 INFO L290 TraceCheckUtils]: 46: Hoare triple {6090#true} assume true; {6090#true} is VALID [2022-04-28 11:24:23,045 INFO L290 TraceCheckUtils]: 45: Hoare triple {6090#true} assume !(0 == ~cond); {6090#true} is VALID [2022-04-28 11:24:23,045 INFO L290 TraceCheckUtils]: 44: Hoare triple {6090#true} ~cond := #in~cond; {6090#true} is VALID [2022-04-28 11:24:23,045 INFO L272 TraceCheckUtils]: 43: Hoare triple {6295#(< ~counter~0 20)} call __VERIFIER_assert((if ~r~0 >= 2 * ~y~0 * ~a~0 then 1 else 0)); {6090#true} is VALID [2022-04-28 11:24:23,046 INFO L290 TraceCheckUtils]: 42: Hoare triple {6295#(< ~counter~0 20)} assume !!(~r~0 >= 2 * ~b~0); {6295#(< ~counter~0 20)} is VALID [2022-04-28 11:24:23,046 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {6090#true} {6295#(< ~counter~0 20)} #87#return; {6295#(< ~counter~0 20)} is VALID [2022-04-28 11:24:23,046 INFO L290 TraceCheckUtils]: 40: Hoare triple {6090#true} assume true; {6090#true} is VALID [2022-04-28 11:24:23,046 INFO L290 TraceCheckUtils]: 39: Hoare triple {6090#true} assume !(0 == ~cond); {6090#true} is VALID [2022-04-28 11:24:23,046 INFO L290 TraceCheckUtils]: 38: Hoare triple {6090#true} ~cond := #in~cond; {6090#true} is VALID [2022-04-28 11:24:23,046 INFO L272 TraceCheckUtils]: 37: Hoare triple {6295#(< ~counter~0 20)} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {6090#true} is VALID [2022-04-28 11:24:23,047 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {6090#true} {6295#(< ~counter~0 20)} #85#return; {6295#(< ~counter~0 20)} is VALID [2022-04-28 11:24:23,047 INFO L290 TraceCheckUtils]: 35: Hoare triple {6090#true} assume true; {6090#true} is VALID [2022-04-28 11:24:23,047 INFO L290 TraceCheckUtils]: 34: Hoare triple {6090#true} assume !(0 == ~cond); {6090#true} is VALID [2022-04-28 11:24:23,047 INFO L290 TraceCheckUtils]: 33: Hoare triple {6090#true} ~cond := #in~cond; {6090#true} is VALID [2022-04-28 11:24:23,047 INFO L272 TraceCheckUtils]: 32: Hoare triple {6295#(< ~counter~0 20)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {6090#true} is VALID [2022-04-28 11:24:23,048 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {6090#true} {6295#(< ~counter~0 20)} #83#return; {6295#(< ~counter~0 20)} is VALID [2022-04-28 11:24:23,048 INFO L290 TraceCheckUtils]: 30: Hoare triple {6090#true} assume true; {6090#true} is VALID [2022-04-28 11:24:23,048 INFO L290 TraceCheckUtils]: 29: Hoare triple {6090#true} assume !(0 == ~cond); {6090#true} is VALID [2022-04-28 11:24:23,048 INFO L290 TraceCheckUtils]: 28: Hoare triple {6090#true} ~cond := #in~cond; {6090#true} is VALID [2022-04-28 11:24:23,048 INFO L272 TraceCheckUtils]: 27: Hoare triple {6295#(< ~counter~0 20)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {6090#true} is VALID [2022-04-28 11:24:23,048 INFO L290 TraceCheckUtils]: 26: Hoare triple {6295#(< ~counter~0 20)} assume !!(#t~post7 < 20);havoc #t~post7; {6295#(< ~counter~0 20)} is VALID [2022-04-28 11:24:23,049 INFO L290 TraceCheckUtils]: 25: Hoare triple {6368#(< ~counter~0 19)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {6295#(< ~counter~0 20)} is VALID [2022-04-28 11:24:23,049 INFO L290 TraceCheckUtils]: 24: Hoare triple {6368#(< ~counter~0 19)} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {6368#(< ~counter~0 19)} is VALID [2022-04-28 11:24:23,050 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {6090#true} {6368#(< ~counter~0 19)} #81#return; {6368#(< ~counter~0 19)} is VALID [2022-04-28 11:24:23,050 INFO L290 TraceCheckUtils]: 22: Hoare triple {6090#true} assume true; {6090#true} is VALID [2022-04-28 11:24:23,050 INFO L290 TraceCheckUtils]: 21: Hoare triple {6090#true} assume !(0 == ~cond); {6090#true} is VALID [2022-04-28 11:24:23,050 INFO L290 TraceCheckUtils]: 20: Hoare triple {6090#true} ~cond := #in~cond; {6090#true} is VALID [2022-04-28 11:24:23,050 INFO L272 TraceCheckUtils]: 19: Hoare triple {6368#(< ~counter~0 19)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {6090#true} is VALID [2022-04-28 11:24:23,050 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {6090#true} {6368#(< ~counter~0 19)} #79#return; {6368#(< ~counter~0 19)} is VALID [2022-04-28 11:24:23,050 INFO L290 TraceCheckUtils]: 17: Hoare triple {6090#true} assume true; {6090#true} is VALID [2022-04-28 11:24:23,051 INFO L290 TraceCheckUtils]: 16: Hoare triple {6090#true} assume !(0 == ~cond); {6090#true} is VALID [2022-04-28 11:24:23,051 INFO L290 TraceCheckUtils]: 15: Hoare triple {6090#true} ~cond := #in~cond; {6090#true} is VALID [2022-04-28 11:24:23,051 INFO L272 TraceCheckUtils]: 14: Hoare triple {6368#(< ~counter~0 19)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {6090#true} is VALID [2022-04-28 11:24:23,051 INFO L290 TraceCheckUtils]: 13: Hoare triple {6368#(< ~counter~0 19)} assume !!(#t~post6 < 20);havoc #t~post6; {6368#(< ~counter~0 19)} is VALID [2022-04-28 11:24:23,051 INFO L290 TraceCheckUtils]: 12: Hoare triple {6408#(< ~counter~0 18)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6368#(< ~counter~0 19)} is VALID [2022-04-28 11:24:23,052 INFO L290 TraceCheckUtils]: 11: Hoare triple {6408#(< ~counter~0 18)} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {6408#(< ~counter~0 18)} is VALID [2022-04-28 11:24:23,052 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6090#true} {6408#(< ~counter~0 18)} #77#return; {6408#(< ~counter~0 18)} is VALID [2022-04-28 11:24:23,052 INFO L290 TraceCheckUtils]: 9: Hoare triple {6090#true} assume true; {6090#true} is VALID [2022-04-28 11:24:23,052 INFO L290 TraceCheckUtils]: 8: Hoare triple {6090#true} assume !(0 == ~cond); {6090#true} is VALID [2022-04-28 11:24:23,052 INFO L290 TraceCheckUtils]: 7: Hoare triple {6090#true} ~cond := #in~cond; {6090#true} is VALID [2022-04-28 11:24:23,052 INFO L272 TraceCheckUtils]: 6: Hoare triple {6408#(< ~counter~0 18)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {6090#true} is VALID [2022-04-28 11:24:23,053 INFO L290 TraceCheckUtils]: 5: Hoare triple {6408#(< ~counter~0 18)} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~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; {6408#(< ~counter~0 18)} is VALID [2022-04-28 11:24:23,053 INFO L272 TraceCheckUtils]: 4: Hoare triple {6408#(< ~counter~0 18)} call #t~ret8 := main(); {6408#(< ~counter~0 18)} is VALID [2022-04-28 11:24:23,053 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6408#(< ~counter~0 18)} {6090#true} #93#return; {6408#(< ~counter~0 18)} is VALID [2022-04-28 11:24:23,054 INFO L290 TraceCheckUtils]: 2: Hoare triple {6408#(< ~counter~0 18)} assume true; {6408#(< ~counter~0 18)} is VALID [2022-04-28 11:24:23,054 INFO L290 TraceCheckUtils]: 1: Hoare triple {6090#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(14, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {6408#(< ~counter~0 18)} is VALID [2022-04-28 11:24:23,054 INFO L272 TraceCheckUtils]: 0: Hoare triple {6090#true} call ULTIMATE.init(); {6090#true} is VALID [2022-04-28 11:24:23,055 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-28 11:24:23,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:24:23,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973988498] [2022-04-28 11:24:23,055 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:24:23,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2045467350] [2022-04-28 11:24:23,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2045467350] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 11:24:23,055 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 11:24:23,055 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-04-28 11:24:23,055 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:24:23,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [810012586] [2022-04-28 11:24:23,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [810012586] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:24:23,055 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:24:23,055 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 11:24:23,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586815363] [2022-04-28 11:24:23,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:24:23,056 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) Word has length 58 [2022-04-28 11:24:23,056 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:24:23,056 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2022-04-28 11:24:23,091 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:24:23,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 11:24:23,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:24:23,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 11:24:23,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-28 11:24:23,091 INFO L87 Difference]: Start difference. First operand 127 states and 158 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2022-04-28 11:24:23,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:24:23,353 INFO L93 Difference]: Finished difference Result 173 states and 218 transitions. [2022-04-28 11:24:23,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 11:24:23,353 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) Word has length 58 [2022-04-28 11:24:23,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:24:23,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2022-04-28 11:24:23,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 103 transitions. [2022-04-28 11:24:23,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2022-04-28 11:24:23,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 103 transitions. [2022-04-28 11:24:23,357 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 103 transitions. [2022-04-28 11:24:23,423 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:24:23,425 INFO L225 Difference]: With dead ends: 173 [2022-04-28 11:24:23,425 INFO L226 Difference]: Without dead ends: 130 [2022-04-28 11:24:23,425 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2022-04-28 11:24:23,426 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 10 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 11:24:23,426 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 163 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 11:24:23,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-04-28 11:24:23,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2022-04-28 11:24:23,547 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:24:23,548 INFO L82 GeneralOperation]: Start isEquivalent. First operand 130 states. Second operand has 130 states, 82 states have (on average 1.1829268292682926) internal successors, (97), 84 states have internal predecessors, (97), 33 states have call successors, (33), 15 states have call predecessors, (33), 14 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-28 11:24:23,548 INFO L74 IsIncluded]: Start isIncluded. First operand 130 states. Second operand has 130 states, 82 states have (on average 1.1829268292682926) internal successors, (97), 84 states have internal predecessors, (97), 33 states have call successors, (33), 15 states have call predecessors, (33), 14 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-28 11:24:23,548 INFO L87 Difference]: Start difference. First operand 130 states. Second operand has 130 states, 82 states have (on average 1.1829268292682926) internal successors, (97), 84 states have internal predecessors, (97), 33 states have call successors, (33), 15 states have call predecessors, (33), 14 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-28 11:24:23,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:24:23,551 INFO L93 Difference]: Finished difference Result 130 states and 161 transitions. [2022-04-28 11:24:23,551 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 161 transitions. [2022-04-28 11:24:23,551 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:24:23,551 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:24:23,552 INFO L74 IsIncluded]: Start isIncluded. First operand has 130 states, 82 states have (on average 1.1829268292682926) internal successors, (97), 84 states have internal predecessors, (97), 33 states have call successors, (33), 15 states have call predecessors, (33), 14 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) Second operand 130 states. [2022-04-28 11:24:23,552 INFO L87 Difference]: Start difference. First operand has 130 states, 82 states have (on average 1.1829268292682926) internal successors, (97), 84 states have internal predecessors, (97), 33 states have call successors, (33), 15 states have call predecessors, (33), 14 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) Second operand 130 states. [2022-04-28 11:24:23,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:24:23,555 INFO L93 Difference]: Finished difference Result 130 states and 161 transitions. [2022-04-28 11:24:23,555 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 161 transitions. [2022-04-28 11:24:23,555 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:24:23,555 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:24:23,555 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:24:23,555 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:24:23,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 82 states have (on average 1.1829268292682926) internal successors, (97), 84 states have internal predecessors, (97), 33 states have call successors, (33), 15 states have call predecessors, (33), 14 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-28 11:24:23,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 161 transitions. [2022-04-28 11:24:23,558 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 161 transitions. Word has length 58 [2022-04-28 11:24:23,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:24:23,558 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 161 transitions. [2022-04-28 11:24:23,558 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2022-04-28 11:24:23,558 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 130 states and 161 transitions. [2022-04-28 11:24:23,731 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 161 edges. 161 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:24:23,731 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 161 transitions. [2022-04-28 11:24:23,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-04-28 11:24:23,732 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:24:23,732 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:24:23,752 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-28 11:24:23,932 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-28 11:24:23,933 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:24:23,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:24:23,933 INFO L85 PathProgramCache]: Analyzing trace with hash 78053411, now seen corresponding path program 1 times [2022-04-28 11:24:23,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:24:23,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1077316313] [2022-04-28 11:24:43,021 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:24:43,021 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:24:43,021 INFO L85 PathProgramCache]: Analyzing trace with hash 78053411, now seen corresponding path program 2 times [2022-04-28 11:24:43,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:24:43,022 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576247037] [2022-04-28 11:24:43,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:24:43,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:24:43,037 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:24:43,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [327706910] [2022-04-28 11:24:43,037 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:24:43,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:24:43,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:24:43,039 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-28 11:24:43,040 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-28 11:24:43,082 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 11:24:43,083 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:24:43,083 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-28 11:24:43,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:24:43,092 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:24:43,320 INFO L272 TraceCheckUtils]: 0: Hoare triple {7315#true} call ULTIMATE.init(); {7315#true} is VALID [2022-04-28 11:24:43,320 INFO L290 TraceCheckUtils]: 1: Hoare triple {7315#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(14, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {7315#true} is VALID [2022-04-28 11:24:43,320 INFO L290 TraceCheckUtils]: 2: Hoare triple {7315#true} assume true; {7315#true} is VALID [2022-04-28 11:24:43,320 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7315#true} {7315#true} #93#return; {7315#true} is VALID [2022-04-28 11:24:43,320 INFO L272 TraceCheckUtils]: 4: Hoare triple {7315#true} call #t~ret8 := main(); {7315#true} is VALID [2022-04-28 11:24:43,321 INFO L290 TraceCheckUtils]: 5: Hoare triple {7315#true} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~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; {7315#true} is VALID [2022-04-28 11:24:43,321 INFO L272 TraceCheckUtils]: 6: Hoare triple {7315#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {7315#true} is VALID [2022-04-28 11:24:43,321 INFO L290 TraceCheckUtils]: 7: Hoare triple {7315#true} ~cond := #in~cond; {7315#true} is VALID [2022-04-28 11:24:43,321 INFO L290 TraceCheckUtils]: 8: Hoare triple {7315#true} assume !(0 == ~cond); {7315#true} is VALID [2022-04-28 11:24:43,321 INFO L290 TraceCheckUtils]: 9: Hoare triple {7315#true} assume true; {7315#true} is VALID [2022-04-28 11:24:43,321 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7315#true} {7315#true} #77#return; {7315#true} is VALID [2022-04-28 11:24:43,321 INFO L290 TraceCheckUtils]: 11: Hoare triple {7315#true} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {7315#true} is VALID [2022-04-28 11:24:43,321 INFO L290 TraceCheckUtils]: 12: Hoare triple {7315#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7315#true} is VALID [2022-04-28 11:24:43,321 INFO L290 TraceCheckUtils]: 13: Hoare triple {7315#true} assume !!(#t~post6 < 20);havoc #t~post6; {7315#true} is VALID [2022-04-28 11:24:43,321 INFO L272 TraceCheckUtils]: 14: Hoare triple {7315#true} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {7315#true} is VALID [2022-04-28 11:24:43,321 INFO L290 TraceCheckUtils]: 15: Hoare triple {7315#true} ~cond := #in~cond; {7315#true} is VALID [2022-04-28 11:24:43,321 INFO L290 TraceCheckUtils]: 16: Hoare triple {7315#true} assume !(0 == ~cond); {7315#true} is VALID [2022-04-28 11:24:43,321 INFO L290 TraceCheckUtils]: 17: Hoare triple {7315#true} assume true; {7315#true} is VALID [2022-04-28 11:24:43,321 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {7315#true} {7315#true} #79#return; {7315#true} is VALID [2022-04-28 11:24:43,321 INFO L272 TraceCheckUtils]: 19: Hoare triple {7315#true} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {7315#true} is VALID [2022-04-28 11:24:43,321 INFO L290 TraceCheckUtils]: 20: Hoare triple {7315#true} ~cond := #in~cond; {7315#true} is VALID [2022-04-28 11:24:43,321 INFO L290 TraceCheckUtils]: 21: Hoare triple {7315#true} assume !(0 == ~cond); {7315#true} is VALID [2022-04-28 11:24:43,322 INFO L290 TraceCheckUtils]: 22: Hoare triple {7315#true} assume true; {7315#true} is VALID [2022-04-28 11:24:43,322 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {7315#true} {7315#true} #81#return; {7315#true} is VALID [2022-04-28 11:24:43,322 INFO L290 TraceCheckUtils]: 24: Hoare triple {7315#true} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {7392#(<= main_~b~0 main_~y~0)} is VALID [2022-04-28 11:24:43,322 INFO L290 TraceCheckUtils]: 25: Hoare triple {7392#(<= main_~b~0 main_~y~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {7392#(<= main_~b~0 main_~y~0)} is VALID [2022-04-28 11:24:43,322 INFO L290 TraceCheckUtils]: 26: Hoare triple {7392#(<= main_~b~0 main_~y~0)} assume !!(#t~post7 < 20);havoc #t~post7; {7392#(<= main_~b~0 main_~y~0)} is VALID [2022-04-28 11:24:43,323 INFO L272 TraceCheckUtils]: 27: Hoare triple {7392#(<= main_~b~0 main_~y~0)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {7315#true} is VALID [2022-04-28 11:24:43,323 INFO L290 TraceCheckUtils]: 28: Hoare triple {7315#true} ~cond := #in~cond; {7315#true} is VALID [2022-04-28 11:24:43,323 INFO L290 TraceCheckUtils]: 29: Hoare triple {7315#true} assume !(0 == ~cond); {7315#true} is VALID [2022-04-28 11:24:43,323 INFO L290 TraceCheckUtils]: 30: Hoare triple {7315#true} assume true; {7315#true} is VALID [2022-04-28 11:24:43,323 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {7315#true} {7392#(<= main_~b~0 main_~y~0)} #83#return; {7392#(<= main_~b~0 main_~y~0)} is VALID [2022-04-28 11:24:43,323 INFO L272 TraceCheckUtils]: 32: Hoare triple {7392#(<= main_~b~0 main_~y~0)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {7315#true} is VALID [2022-04-28 11:24:43,323 INFO L290 TraceCheckUtils]: 33: Hoare triple {7315#true} ~cond := #in~cond; {7315#true} is VALID [2022-04-28 11:24:43,323 INFO L290 TraceCheckUtils]: 34: Hoare triple {7315#true} assume !(0 == ~cond); {7315#true} is VALID [2022-04-28 11:24:43,323 INFO L290 TraceCheckUtils]: 35: Hoare triple {7315#true} assume true; {7315#true} is VALID [2022-04-28 11:24:43,324 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {7315#true} {7392#(<= main_~b~0 main_~y~0)} #85#return; {7392#(<= main_~b~0 main_~y~0)} is VALID [2022-04-28 11:24:43,324 INFO L272 TraceCheckUtils]: 37: Hoare triple {7392#(<= main_~b~0 main_~y~0)} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {7315#true} is VALID [2022-04-28 11:24:43,324 INFO L290 TraceCheckUtils]: 38: Hoare triple {7315#true} ~cond := #in~cond; {7315#true} is VALID [2022-04-28 11:24:43,324 INFO L290 TraceCheckUtils]: 39: Hoare triple {7315#true} assume !(0 == ~cond); {7315#true} is VALID [2022-04-28 11:24:43,324 INFO L290 TraceCheckUtils]: 40: Hoare triple {7315#true} assume true; {7315#true} is VALID [2022-04-28 11:24:43,325 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {7315#true} {7392#(<= main_~b~0 main_~y~0)} #87#return; {7392#(<= main_~b~0 main_~y~0)} is VALID [2022-04-28 11:24:43,325 INFO L290 TraceCheckUtils]: 42: Hoare triple {7392#(<= main_~b~0 main_~y~0)} assume !(~r~0 >= 2 * ~b~0); {7447#(and (not (<= (* main_~b~0 2) main_~r~0)) (<= main_~b~0 main_~y~0))} is VALID [2022-04-28 11:24:43,325 INFO L290 TraceCheckUtils]: 43: Hoare triple {7447#(and (not (<= (* main_~b~0 2) main_~r~0)) (<= main_~b~0 main_~y~0))} ~r~0 := ~r~0 - ~b~0;~q~0 := ~q~0 + ~a~0; {7451#(< main_~r~0 main_~y~0)} is VALID [2022-04-28 11:24:43,326 INFO L290 TraceCheckUtils]: 44: Hoare triple {7451#(< main_~r~0 main_~y~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7451#(< main_~r~0 main_~y~0)} is VALID [2022-04-28 11:24:43,326 INFO L290 TraceCheckUtils]: 45: Hoare triple {7451#(< main_~r~0 main_~y~0)} assume !!(#t~post6 < 20);havoc #t~post6; {7451#(< main_~r~0 main_~y~0)} is VALID [2022-04-28 11:24:43,326 INFO L272 TraceCheckUtils]: 46: Hoare triple {7451#(< main_~r~0 main_~y~0)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {7315#true} is VALID [2022-04-28 11:24:43,326 INFO L290 TraceCheckUtils]: 47: Hoare triple {7315#true} ~cond := #in~cond; {7315#true} is VALID [2022-04-28 11:24:43,326 INFO L290 TraceCheckUtils]: 48: Hoare triple {7315#true} assume !(0 == ~cond); {7315#true} is VALID [2022-04-28 11:24:43,326 INFO L290 TraceCheckUtils]: 49: Hoare triple {7315#true} assume true; {7315#true} is VALID [2022-04-28 11:24:43,327 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {7315#true} {7451#(< main_~r~0 main_~y~0)} #79#return; {7451#(< main_~r~0 main_~y~0)} is VALID [2022-04-28 11:24:43,327 INFO L272 TraceCheckUtils]: 51: Hoare triple {7451#(< main_~r~0 main_~y~0)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {7315#true} is VALID [2022-04-28 11:24:43,327 INFO L290 TraceCheckUtils]: 52: Hoare triple {7315#true} ~cond := #in~cond; {7315#true} is VALID [2022-04-28 11:24:43,327 INFO L290 TraceCheckUtils]: 53: Hoare triple {7315#true} assume !(0 == ~cond); {7315#true} is VALID [2022-04-28 11:24:43,327 INFO L290 TraceCheckUtils]: 54: Hoare triple {7315#true} assume true; {7315#true} is VALID [2022-04-28 11:24:43,327 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {7315#true} {7451#(< main_~r~0 main_~y~0)} #81#return; {7451#(< main_~r~0 main_~y~0)} is VALID [2022-04-28 11:24:43,328 INFO L290 TraceCheckUtils]: 56: Hoare triple {7451#(< main_~r~0 main_~y~0)} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {7316#false} is VALID [2022-04-28 11:24:43,328 INFO L290 TraceCheckUtils]: 57: Hoare triple {7316#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {7316#false} is VALID [2022-04-28 11:24:43,328 INFO L290 TraceCheckUtils]: 58: Hoare triple {7316#false} assume !(#t~post7 < 20);havoc #t~post7; {7316#false} is VALID [2022-04-28 11:24:43,328 INFO L290 TraceCheckUtils]: 59: Hoare triple {7316#false} ~r~0 := ~r~0 - ~b~0;~q~0 := ~q~0 + ~a~0; {7316#false} is VALID [2022-04-28 11:24:43,328 INFO L290 TraceCheckUtils]: 60: Hoare triple {7316#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7316#false} is VALID [2022-04-28 11:24:43,328 INFO L290 TraceCheckUtils]: 61: Hoare triple {7316#false} assume !(#t~post6 < 20);havoc #t~post6; {7316#false} is VALID [2022-04-28 11:24:43,328 INFO L272 TraceCheckUtils]: 62: Hoare triple {7316#false} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {7316#false} is VALID [2022-04-28 11:24:43,328 INFO L290 TraceCheckUtils]: 63: Hoare triple {7316#false} ~cond := #in~cond; {7316#false} is VALID [2022-04-28 11:24:43,328 INFO L290 TraceCheckUtils]: 64: Hoare triple {7316#false} assume 0 == ~cond; {7316#false} is VALID [2022-04-28 11:24:43,328 INFO L290 TraceCheckUtils]: 65: Hoare triple {7316#false} assume !false; {7316#false} is VALID [2022-04-28 11:24:43,329 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-04-28 11:24:43,329 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 11:24:43,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:24:43,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576247037] [2022-04-28 11:24:43,329 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:24:43,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [327706910] [2022-04-28 11:24:43,329 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [327706910] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:24:43,329 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:24:43,329 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 11:24:43,329 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:24:43,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1077316313] [2022-04-28 11:24:43,329 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1077316313] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:24:43,329 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:24:43,329 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 11:24:43,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151696899] [2022-04-28 11:24:43,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:24:43,330 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 4 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 66 [2022-04-28 11:24:43,330 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:24:43,330 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 4 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-28 11:24:43,362 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-28 11:24:43,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 11:24:43,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:24:43,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 11:24:43,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-28 11:24:43,363 INFO L87 Difference]: Start difference. First operand 130 states and 161 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 4 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-28 11:24:43,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:24:43,659 INFO L93 Difference]: Finished difference Result 190 states and 240 transitions. [2022-04-28 11:24:43,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 11:24:43,659 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 4 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 66 [2022-04-28 11:24:43,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:24:43,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 4 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-28 11:24:43,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 109 transitions. [2022-04-28 11:24:43,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 4 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-28 11:24:43,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 109 transitions. [2022-04-28 11:24:43,661 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 109 transitions. [2022-04-28 11:24:43,743 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:24:43,746 INFO L225 Difference]: With dead ends: 190 [2022-04-28 11:24:43,746 INFO L226 Difference]: Without dead ends: 119 [2022-04-28 11:24:43,747 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-04-28 11:24:43,747 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 11 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 11:24:43,747 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 120 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 11:24:43,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-04-28 11:24:43,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 112. [2022-04-28 11:24:43,854 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:24:43,854 INFO L82 GeneralOperation]: Start isEquivalent. First operand 119 states. Second operand has 112 states, 72 states have (on average 1.1527777777777777) internal successors, (83), 74 states have internal predecessors, (83), 26 states have call successors, (26), 14 states have call predecessors, (26), 13 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-28 11:24:43,855 INFO L74 IsIncluded]: Start isIncluded. First operand 119 states. Second operand has 112 states, 72 states have (on average 1.1527777777777777) internal successors, (83), 74 states have internal predecessors, (83), 26 states have call successors, (26), 14 states have call predecessors, (26), 13 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-28 11:24:43,855 INFO L87 Difference]: Start difference. First operand 119 states. Second operand has 112 states, 72 states have (on average 1.1527777777777777) internal successors, (83), 74 states have internal predecessors, (83), 26 states have call successors, (26), 14 states have call predecessors, (26), 13 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-28 11:24:43,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:24:43,857 INFO L93 Difference]: Finished difference Result 119 states and 143 transitions. [2022-04-28 11:24:43,857 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 143 transitions. [2022-04-28 11:24:43,857 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:24:43,857 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:24:43,857 INFO L74 IsIncluded]: Start isIncluded. First operand has 112 states, 72 states have (on average 1.1527777777777777) internal successors, (83), 74 states have internal predecessors, (83), 26 states have call successors, (26), 14 states have call predecessors, (26), 13 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) Second operand 119 states. [2022-04-28 11:24:43,857 INFO L87 Difference]: Start difference. First operand has 112 states, 72 states have (on average 1.1527777777777777) internal successors, (83), 74 states have internal predecessors, (83), 26 states have call successors, (26), 14 states have call predecessors, (26), 13 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) Second operand 119 states. [2022-04-28 11:24:43,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:24:43,859 INFO L93 Difference]: Finished difference Result 119 states and 143 transitions. [2022-04-28 11:24:43,859 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 143 transitions. [2022-04-28 11:24:43,860 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:24:43,860 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:24:43,860 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:24:43,860 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:24:43,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 72 states have (on average 1.1527777777777777) internal successors, (83), 74 states have internal predecessors, (83), 26 states have call successors, (26), 14 states have call predecessors, (26), 13 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-28 11:24:43,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 133 transitions. [2022-04-28 11:24:43,862 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 133 transitions. Word has length 66 [2022-04-28 11:24:43,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:24:43,862 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 133 transitions. [2022-04-28 11:24:43,862 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 4 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-28 11:24:43,862 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 112 states and 133 transitions. [2022-04-28 11:24:44,006 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 133 edges. 133 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:24:44,007 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 133 transitions. [2022-04-28 11:24:44,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-04-28 11:24:44,007 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:24:44,007 INFO L195 NwaCegarLoop]: trace histogram [10, 9, 9, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:24:44,039 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-28 11:24:44,207 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-28 11:24:44,208 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:24:44,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:24:44,208 INFO L85 PathProgramCache]: Analyzing trace with hash -1361251212, now seen corresponding path program 1 times [2022-04-28 11:24:44,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:24:44,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1479846875] [2022-04-28 11:25:00,981 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:25:00,982 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:25:00,982 INFO L85 PathProgramCache]: Analyzing trace with hash -1361251212, now seen corresponding path program 2 times [2022-04-28 11:25:00,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:25:00,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670115198] [2022-04-28 11:25:00,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:25:00,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:25:00,997 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:25:00,997 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1230120587] [2022-04-28 11:25:00,997 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:25:00,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:25:00,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:25:01,000 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-28 11:25:01,001 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-28 11:25:01,045 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 11:25:01,045 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:25:01,046 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-28 11:25:01,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:25:01,058 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:25:01,363 INFO L272 TraceCheckUtils]: 0: Hoare triple {8362#true} call ULTIMATE.init(); {8362#true} is VALID [2022-04-28 11:25:01,364 INFO L290 TraceCheckUtils]: 1: Hoare triple {8362#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(14, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {8370#(<= ~counter~0 0)} is VALID [2022-04-28 11:25:01,364 INFO L290 TraceCheckUtils]: 2: Hoare triple {8370#(<= ~counter~0 0)} assume true; {8370#(<= ~counter~0 0)} is VALID [2022-04-28 11:25:01,365 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8370#(<= ~counter~0 0)} {8362#true} #93#return; {8370#(<= ~counter~0 0)} is VALID [2022-04-28 11:25:01,365 INFO L272 TraceCheckUtils]: 4: Hoare triple {8370#(<= ~counter~0 0)} call #t~ret8 := main(); {8370#(<= ~counter~0 0)} is VALID [2022-04-28 11:25:01,365 INFO L290 TraceCheckUtils]: 5: Hoare triple {8370#(<= ~counter~0 0)} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~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; {8370#(<= ~counter~0 0)} is VALID [2022-04-28 11:25:01,366 INFO L272 TraceCheckUtils]: 6: Hoare triple {8370#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {8370#(<= ~counter~0 0)} is VALID [2022-04-28 11:25:01,366 INFO L290 TraceCheckUtils]: 7: Hoare triple {8370#(<= ~counter~0 0)} ~cond := #in~cond; {8370#(<= ~counter~0 0)} is VALID [2022-04-28 11:25:01,366 INFO L290 TraceCheckUtils]: 8: Hoare triple {8370#(<= ~counter~0 0)} assume !(0 == ~cond); {8370#(<= ~counter~0 0)} is VALID [2022-04-28 11:25:01,366 INFO L290 TraceCheckUtils]: 9: Hoare triple {8370#(<= ~counter~0 0)} assume true; {8370#(<= ~counter~0 0)} is VALID [2022-04-28 11:25:01,367 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8370#(<= ~counter~0 0)} {8370#(<= ~counter~0 0)} #77#return; {8370#(<= ~counter~0 0)} is VALID [2022-04-28 11:25:01,367 INFO L290 TraceCheckUtils]: 11: Hoare triple {8370#(<= ~counter~0 0)} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {8370#(<= ~counter~0 0)} is VALID [2022-04-28 11:25:01,368 INFO L290 TraceCheckUtils]: 12: Hoare triple {8370#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8404#(<= ~counter~0 1)} is VALID [2022-04-28 11:25:01,368 INFO L290 TraceCheckUtils]: 13: Hoare triple {8404#(<= ~counter~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {8404#(<= ~counter~0 1)} is VALID [2022-04-28 11:25:01,368 INFO L272 TraceCheckUtils]: 14: Hoare triple {8404#(<= ~counter~0 1)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {8404#(<= ~counter~0 1)} is VALID [2022-04-28 11:25:01,369 INFO L290 TraceCheckUtils]: 15: Hoare triple {8404#(<= ~counter~0 1)} ~cond := #in~cond; {8404#(<= ~counter~0 1)} is VALID [2022-04-28 11:25:01,369 INFO L290 TraceCheckUtils]: 16: Hoare triple {8404#(<= ~counter~0 1)} assume !(0 == ~cond); {8404#(<= ~counter~0 1)} is VALID [2022-04-28 11:25:01,369 INFO L290 TraceCheckUtils]: 17: Hoare triple {8404#(<= ~counter~0 1)} assume true; {8404#(<= ~counter~0 1)} is VALID [2022-04-28 11:25:01,370 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {8404#(<= ~counter~0 1)} {8404#(<= ~counter~0 1)} #79#return; {8404#(<= ~counter~0 1)} is VALID [2022-04-28 11:25:01,370 INFO L272 TraceCheckUtils]: 19: Hoare triple {8404#(<= ~counter~0 1)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {8404#(<= ~counter~0 1)} is VALID [2022-04-28 11:25:01,370 INFO L290 TraceCheckUtils]: 20: Hoare triple {8404#(<= ~counter~0 1)} ~cond := #in~cond; {8404#(<= ~counter~0 1)} is VALID [2022-04-28 11:25:01,371 INFO L290 TraceCheckUtils]: 21: Hoare triple {8404#(<= ~counter~0 1)} assume !(0 == ~cond); {8404#(<= ~counter~0 1)} is VALID [2022-04-28 11:25:01,371 INFO L290 TraceCheckUtils]: 22: Hoare triple {8404#(<= ~counter~0 1)} assume true; {8404#(<= ~counter~0 1)} is VALID [2022-04-28 11:25:01,371 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {8404#(<= ~counter~0 1)} {8404#(<= ~counter~0 1)} #81#return; {8404#(<= ~counter~0 1)} is VALID [2022-04-28 11:25:01,372 INFO L290 TraceCheckUtils]: 24: Hoare triple {8404#(<= ~counter~0 1)} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {8404#(<= ~counter~0 1)} is VALID [2022-04-28 11:25:01,372 INFO L290 TraceCheckUtils]: 25: Hoare triple {8404#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {8444#(<= ~counter~0 2)} is VALID [2022-04-28 11:25:01,372 INFO L290 TraceCheckUtils]: 26: Hoare triple {8444#(<= ~counter~0 2)} assume !!(#t~post7 < 20);havoc #t~post7; {8444#(<= ~counter~0 2)} is VALID [2022-04-28 11:25:01,373 INFO L272 TraceCheckUtils]: 27: Hoare triple {8444#(<= ~counter~0 2)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {8444#(<= ~counter~0 2)} is VALID [2022-04-28 11:25:01,373 INFO L290 TraceCheckUtils]: 28: Hoare triple {8444#(<= ~counter~0 2)} ~cond := #in~cond; {8444#(<= ~counter~0 2)} is VALID [2022-04-28 11:25:01,373 INFO L290 TraceCheckUtils]: 29: Hoare triple {8444#(<= ~counter~0 2)} assume !(0 == ~cond); {8444#(<= ~counter~0 2)} is VALID [2022-04-28 11:25:01,374 INFO L290 TraceCheckUtils]: 30: Hoare triple {8444#(<= ~counter~0 2)} assume true; {8444#(<= ~counter~0 2)} is VALID [2022-04-28 11:25:01,374 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {8444#(<= ~counter~0 2)} {8444#(<= ~counter~0 2)} #83#return; {8444#(<= ~counter~0 2)} is VALID [2022-04-28 11:25:01,375 INFO L272 TraceCheckUtils]: 32: Hoare triple {8444#(<= ~counter~0 2)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {8444#(<= ~counter~0 2)} is VALID [2022-04-28 11:25:01,375 INFO L290 TraceCheckUtils]: 33: Hoare triple {8444#(<= ~counter~0 2)} ~cond := #in~cond; {8444#(<= ~counter~0 2)} is VALID [2022-04-28 11:25:01,375 INFO L290 TraceCheckUtils]: 34: Hoare triple {8444#(<= ~counter~0 2)} assume !(0 == ~cond); {8444#(<= ~counter~0 2)} is VALID [2022-04-28 11:25:01,376 INFO L290 TraceCheckUtils]: 35: Hoare triple {8444#(<= ~counter~0 2)} assume true; {8444#(<= ~counter~0 2)} is VALID [2022-04-28 11:25:01,376 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {8444#(<= ~counter~0 2)} {8444#(<= ~counter~0 2)} #85#return; {8444#(<= ~counter~0 2)} is VALID [2022-04-28 11:25:01,377 INFO L272 TraceCheckUtils]: 37: Hoare triple {8444#(<= ~counter~0 2)} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {8444#(<= ~counter~0 2)} is VALID [2022-04-28 11:25:01,377 INFO L290 TraceCheckUtils]: 38: Hoare triple {8444#(<= ~counter~0 2)} ~cond := #in~cond; {8444#(<= ~counter~0 2)} is VALID [2022-04-28 11:25:01,377 INFO L290 TraceCheckUtils]: 39: Hoare triple {8444#(<= ~counter~0 2)} assume !(0 == ~cond); {8444#(<= ~counter~0 2)} is VALID [2022-04-28 11:25:01,378 INFO L290 TraceCheckUtils]: 40: Hoare triple {8444#(<= ~counter~0 2)} assume true; {8444#(<= ~counter~0 2)} is VALID [2022-04-28 11:25:01,378 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {8444#(<= ~counter~0 2)} {8444#(<= ~counter~0 2)} #87#return; {8444#(<= ~counter~0 2)} is VALID [2022-04-28 11:25:01,378 INFO L290 TraceCheckUtils]: 42: Hoare triple {8444#(<= ~counter~0 2)} assume !!(~r~0 >= 2 * ~b~0); {8444#(<= ~counter~0 2)} is VALID [2022-04-28 11:25:01,379 INFO L272 TraceCheckUtils]: 43: Hoare triple {8444#(<= ~counter~0 2)} call __VERIFIER_assert((if ~r~0 >= 2 * ~y~0 * ~a~0 then 1 else 0)); {8444#(<= ~counter~0 2)} is VALID [2022-04-28 11:25:01,379 INFO L290 TraceCheckUtils]: 44: Hoare triple {8444#(<= ~counter~0 2)} ~cond := #in~cond; {8444#(<= ~counter~0 2)} is VALID [2022-04-28 11:25:01,379 INFO L290 TraceCheckUtils]: 45: Hoare triple {8444#(<= ~counter~0 2)} assume !(0 == ~cond); {8444#(<= ~counter~0 2)} is VALID [2022-04-28 11:25:01,380 INFO L290 TraceCheckUtils]: 46: Hoare triple {8444#(<= ~counter~0 2)} assume true; {8444#(<= ~counter~0 2)} is VALID [2022-04-28 11:25:01,380 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {8444#(<= ~counter~0 2)} {8444#(<= ~counter~0 2)} #89#return; {8444#(<= ~counter~0 2)} is VALID [2022-04-28 11:25:01,381 INFO L290 TraceCheckUtils]: 48: Hoare triple {8444#(<= ~counter~0 2)} ~a~0 := 2 * ~a~0;~b~0 := 2 * ~b~0; {8444#(<= ~counter~0 2)} is VALID [2022-04-28 11:25:01,381 INFO L290 TraceCheckUtils]: 49: Hoare triple {8444#(<= ~counter~0 2)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {8517#(<= ~counter~0 3)} is VALID [2022-04-28 11:25:01,381 INFO L290 TraceCheckUtils]: 50: Hoare triple {8517#(<= ~counter~0 3)} assume !!(#t~post7 < 20);havoc #t~post7; {8517#(<= ~counter~0 3)} is VALID [2022-04-28 11:25:01,382 INFO L272 TraceCheckUtils]: 51: Hoare triple {8517#(<= ~counter~0 3)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {8517#(<= ~counter~0 3)} is VALID [2022-04-28 11:25:01,382 INFO L290 TraceCheckUtils]: 52: Hoare triple {8517#(<= ~counter~0 3)} ~cond := #in~cond; {8517#(<= ~counter~0 3)} is VALID [2022-04-28 11:25:01,383 INFO L290 TraceCheckUtils]: 53: Hoare triple {8517#(<= ~counter~0 3)} assume !(0 == ~cond); {8517#(<= ~counter~0 3)} is VALID [2022-04-28 11:25:01,383 INFO L290 TraceCheckUtils]: 54: Hoare triple {8517#(<= ~counter~0 3)} assume true; {8517#(<= ~counter~0 3)} is VALID [2022-04-28 11:25:01,383 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {8517#(<= ~counter~0 3)} {8517#(<= ~counter~0 3)} #83#return; {8517#(<= ~counter~0 3)} is VALID [2022-04-28 11:25:01,384 INFO L272 TraceCheckUtils]: 56: Hoare triple {8517#(<= ~counter~0 3)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {8517#(<= ~counter~0 3)} is VALID [2022-04-28 11:25:01,384 INFO L290 TraceCheckUtils]: 57: Hoare triple {8517#(<= ~counter~0 3)} ~cond := #in~cond; {8517#(<= ~counter~0 3)} is VALID [2022-04-28 11:25:01,385 INFO L290 TraceCheckUtils]: 58: Hoare triple {8517#(<= ~counter~0 3)} assume !(0 == ~cond); {8517#(<= ~counter~0 3)} is VALID [2022-04-28 11:25:01,385 INFO L290 TraceCheckUtils]: 59: Hoare triple {8517#(<= ~counter~0 3)} assume true; {8517#(<= ~counter~0 3)} is VALID [2022-04-28 11:25:01,385 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {8517#(<= ~counter~0 3)} {8517#(<= ~counter~0 3)} #85#return; {8517#(<= ~counter~0 3)} is VALID [2022-04-28 11:25:01,386 INFO L272 TraceCheckUtils]: 61: Hoare triple {8517#(<= ~counter~0 3)} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {8517#(<= ~counter~0 3)} is VALID [2022-04-28 11:25:01,386 INFO L290 TraceCheckUtils]: 62: Hoare triple {8517#(<= ~counter~0 3)} ~cond := #in~cond; {8517#(<= ~counter~0 3)} is VALID [2022-04-28 11:25:01,386 INFO L290 TraceCheckUtils]: 63: Hoare triple {8517#(<= ~counter~0 3)} assume !(0 == ~cond); {8517#(<= ~counter~0 3)} is VALID [2022-04-28 11:25:01,387 INFO L290 TraceCheckUtils]: 64: Hoare triple {8517#(<= ~counter~0 3)} assume true; {8517#(<= ~counter~0 3)} is VALID [2022-04-28 11:25:01,387 INFO L284 TraceCheckUtils]: 65: Hoare quadruple {8517#(<= ~counter~0 3)} {8517#(<= ~counter~0 3)} #87#return; {8517#(<= ~counter~0 3)} is VALID [2022-04-28 11:25:01,388 INFO L290 TraceCheckUtils]: 66: Hoare triple {8517#(<= ~counter~0 3)} assume !(~r~0 >= 2 * ~b~0); {8517#(<= ~counter~0 3)} is VALID [2022-04-28 11:25:01,388 INFO L290 TraceCheckUtils]: 67: Hoare triple {8517#(<= ~counter~0 3)} ~r~0 := ~r~0 - ~b~0;~q~0 := ~q~0 + ~a~0; {8517#(<= ~counter~0 3)} is VALID [2022-04-28 11:25:01,388 INFO L290 TraceCheckUtils]: 68: Hoare triple {8517#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8575#(<= |main_#t~post6| 3)} is VALID [2022-04-28 11:25:01,389 INFO L290 TraceCheckUtils]: 69: Hoare triple {8575#(<= |main_#t~post6| 3)} assume !(#t~post6 < 20);havoc #t~post6; {8363#false} is VALID [2022-04-28 11:25:01,389 INFO L272 TraceCheckUtils]: 70: Hoare triple {8363#false} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {8363#false} is VALID [2022-04-28 11:25:01,389 INFO L290 TraceCheckUtils]: 71: Hoare triple {8363#false} ~cond := #in~cond; {8363#false} is VALID [2022-04-28 11:25:01,389 INFO L290 TraceCheckUtils]: 72: Hoare triple {8363#false} assume 0 == ~cond; {8363#false} is VALID [2022-04-28 11:25:01,389 INFO L290 TraceCheckUtils]: 73: Hoare triple {8363#false} assume !false; {8363#false} is VALID [2022-04-28 11:25:01,389 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 18 proven. 112 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-04-28 11:25:01,389 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:25:01,709 INFO L290 TraceCheckUtils]: 73: Hoare triple {8363#false} assume !false; {8363#false} is VALID [2022-04-28 11:25:01,709 INFO L290 TraceCheckUtils]: 72: Hoare triple {8363#false} assume 0 == ~cond; {8363#false} is VALID [2022-04-28 11:25:01,709 INFO L290 TraceCheckUtils]: 71: Hoare triple {8363#false} ~cond := #in~cond; {8363#false} is VALID [2022-04-28 11:25:01,709 INFO L272 TraceCheckUtils]: 70: Hoare triple {8363#false} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {8363#false} is VALID [2022-04-28 11:25:01,709 INFO L290 TraceCheckUtils]: 69: Hoare triple {8603#(< |main_#t~post6| 20)} assume !(#t~post6 < 20);havoc #t~post6; {8363#false} is VALID [2022-04-28 11:25:01,710 INFO L290 TraceCheckUtils]: 68: Hoare triple {8607#(< ~counter~0 20)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8603#(< |main_#t~post6| 20)} is VALID [2022-04-28 11:25:01,710 INFO L290 TraceCheckUtils]: 67: Hoare triple {8607#(< ~counter~0 20)} ~r~0 := ~r~0 - ~b~0;~q~0 := ~q~0 + ~a~0; {8607#(< ~counter~0 20)} is VALID [2022-04-28 11:25:01,710 INFO L290 TraceCheckUtils]: 66: Hoare triple {8607#(< ~counter~0 20)} assume !(~r~0 >= 2 * ~b~0); {8607#(< ~counter~0 20)} is VALID [2022-04-28 11:25:01,711 INFO L284 TraceCheckUtils]: 65: Hoare quadruple {8362#true} {8607#(< ~counter~0 20)} #87#return; {8607#(< ~counter~0 20)} is VALID [2022-04-28 11:25:01,711 INFO L290 TraceCheckUtils]: 64: Hoare triple {8362#true} assume true; {8362#true} is VALID [2022-04-28 11:25:01,711 INFO L290 TraceCheckUtils]: 63: Hoare triple {8362#true} assume !(0 == ~cond); {8362#true} is VALID [2022-04-28 11:25:01,711 INFO L290 TraceCheckUtils]: 62: Hoare triple {8362#true} ~cond := #in~cond; {8362#true} is VALID [2022-04-28 11:25:01,711 INFO L272 TraceCheckUtils]: 61: Hoare triple {8607#(< ~counter~0 20)} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {8362#true} is VALID [2022-04-28 11:25:01,711 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {8362#true} {8607#(< ~counter~0 20)} #85#return; {8607#(< ~counter~0 20)} is VALID [2022-04-28 11:25:01,711 INFO L290 TraceCheckUtils]: 59: Hoare triple {8362#true} assume true; {8362#true} is VALID [2022-04-28 11:25:01,712 INFO L290 TraceCheckUtils]: 58: Hoare triple {8362#true} assume !(0 == ~cond); {8362#true} is VALID [2022-04-28 11:25:01,712 INFO L290 TraceCheckUtils]: 57: Hoare triple {8362#true} ~cond := #in~cond; {8362#true} is VALID [2022-04-28 11:25:01,712 INFO L272 TraceCheckUtils]: 56: Hoare triple {8607#(< ~counter~0 20)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {8362#true} is VALID [2022-04-28 11:25:01,712 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {8362#true} {8607#(< ~counter~0 20)} #83#return; {8607#(< ~counter~0 20)} is VALID [2022-04-28 11:25:01,712 INFO L290 TraceCheckUtils]: 54: Hoare triple {8362#true} assume true; {8362#true} is VALID [2022-04-28 11:25:01,712 INFO L290 TraceCheckUtils]: 53: Hoare triple {8362#true} assume !(0 == ~cond); {8362#true} is VALID [2022-04-28 11:25:01,712 INFO L290 TraceCheckUtils]: 52: Hoare triple {8362#true} ~cond := #in~cond; {8362#true} is VALID [2022-04-28 11:25:01,712 INFO L272 TraceCheckUtils]: 51: Hoare triple {8607#(< ~counter~0 20)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {8362#true} is VALID [2022-04-28 11:25:01,713 INFO L290 TraceCheckUtils]: 50: Hoare triple {8607#(< ~counter~0 20)} assume !!(#t~post7 < 20);havoc #t~post7; {8607#(< ~counter~0 20)} is VALID [2022-04-28 11:25:01,713 INFO L290 TraceCheckUtils]: 49: Hoare triple {8665#(< ~counter~0 19)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {8607#(< ~counter~0 20)} is VALID [2022-04-28 11:25:01,713 INFO L290 TraceCheckUtils]: 48: Hoare triple {8665#(< ~counter~0 19)} ~a~0 := 2 * ~a~0;~b~0 := 2 * ~b~0; {8665#(< ~counter~0 19)} is VALID [2022-04-28 11:25:01,714 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {8362#true} {8665#(< ~counter~0 19)} #89#return; {8665#(< ~counter~0 19)} is VALID [2022-04-28 11:25:01,714 INFO L290 TraceCheckUtils]: 46: Hoare triple {8362#true} assume true; {8362#true} is VALID [2022-04-28 11:25:01,714 INFO L290 TraceCheckUtils]: 45: Hoare triple {8362#true} assume !(0 == ~cond); {8362#true} is VALID [2022-04-28 11:25:01,714 INFO L290 TraceCheckUtils]: 44: Hoare triple {8362#true} ~cond := #in~cond; {8362#true} is VALID [2022-04-28 11:25:01,714 INFO L272 TraceCheckUtils]: 43: Hoare triple {8665#(< ~counter~0 19)} call __VERIFIER_assert((if ~r~0 >= 2 * ~y~0 * ~a~0 then 1 else 0)); {8362#true} is VALID [2022-04-28 11:25:01,714 INFO L290 TraceCheckUtils]: 42: Hoare triple {8665#(< ~counter~0 19)} assume !!(~r~0 >= 2 * ~b~0); {8665#(< ~counter~0 19)} is VALID [2022-04-28 11:25:01,715 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {8362#true} {8665#(< ~counter~0 19)} #87#return; {8665#(< ~counter~0 19)} is VALID [2022-04-28 11:25:01,715 INFO L290 TraceCheckUtils]: 40: Hoare triple {8362#true} assume true; {8362#true} is VALID [2022-04-28 11:25:01,715 INFO L290 TraceCheckUtils]: 39: Hoare triple {8362#true} assume !(0 == ~cond); {8362#true} is VALID [2022-04-28 11:25:01,715 INFO L290 TraceCheckUtils]: 38: Hoare triple {8362#true} ~cond := #in~cond; {8362#true} is VALID [2022-04-28 11:25:01,715 INFO L272 TraceCheckUtils]: 37: Hoare triple {8665#(< ~counter~0 19)} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {8362#true} is VALID [2022-04-28 11:25:01,716 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {8362#true} {8665#(< ~counter~0 19)} #85#return; {8665#(< ~counter~0 19)} is VALID [2022-04-28 11:25:01,716 INFO L290 TraceCheckUtils]: 35: Hoare triple {8362#true} assume true; {8362#true} is VALID [2022-04-28 11:25:01,716 INFO L290 TraceCheckUtils]: 34: Hoare triple {8362#true} assume !(0 == ~cond); {8362#true} is VALID [2022-04-28 11:25:01,716 INFO L290 TraceCheckUtils]: 33: Hoare triple {8362#true} ~cond := #in~cond; {8362#true} is VALID [2022-04-28 11:25:01,716 INFO L272 TraceCheckUtils]: 32: Hoare triple {8665#(< ~counter~0 19)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {8362#true} is VALID [2022-04-28 11:25:01,716 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {8362#true} {8665#(< ~counter~0 19)} #83#return; {8665#(< ~counter~0 19)} is VALID [2022-04-28 11:25:01,716 INFO L290 TraceCheckUtils]: 30: Hoare triple {8362#true} assume true; {8362#true} is VALID [2022-04-28 11:25:01,716 INFO L290 TraceCheckUtils]: 29: Hoare triple {8362#true} assume !(0 == ~cond); {8362#true} is VALID [2022-04-28 11:25:01,716 INFO L290 TraceCheckUtils]: 28: Hoare triple {8362#true} ~cond := #in~cond; {8362#true} is VALID [2022-04-28 11:25:01,717 INFO L272 TraceCheckUtils]: 27: Hoare triple {8665#(< ~counter~0 19)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {8362#true} is VALID [2022-04-28 11:25:01,717 INFO L290 TraceCheckUtils]: 26: Hoare triple {8665#(< ~counter~0 19)} assume !!(#t~post7 < 20);havoc #t~post7; {8665#(< ~counter~0 19)} is VALID [2022-04-28 11:25:01,717 INFO L290 TraceCheckUtils]: 25: Hoare triple {8738#(< ~counter~0 18)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {8665#(< ~counter~0 19)} is VALID [2022-04-28 11:25:01,718 INFO L290 TraceCheckUtils]: 24: Hoare triple {8738#(< ~counter~0 18)} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {8738#(< ~counter~0 18)} is VALID [2022-04-28 11:25:01,718 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {8362#true} {8738#(< ~counter~0 18)} #81#return; {8738#(< ~counter~0 18)} is VALID [2022-04-28 11:25:01,718 INFO L290 TraceCheckUtils]: 22: Hoare triple {8362#true} assume true; {8362#true} is VALID [2022-04-28 11:25:01,718 INFO L290 TraceCheckUtils]: 21: Hoare triple {8362#true} assume !(0 == ~cond); {8362#true} is VALID [2022-04-28 11:25:01,718 INFO L290 TraceCheckUtils]: 20: Hoare triple {8362#true} ~cond := #in~cond; {8362#true} is VALID [2022-04-28 11:25:01,718 INFO L272 TraceCheckUtils]: 19: Hoare triple {8738#(< ~counter~0 18)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {8362#true} is VALID [2022-04-28 11:25:01,719 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {8362#true} {8738#(< ~counter~0 18)} #79#return; {8738#(< ~counter~0 18)} is VALID [2022-04-28 11:25:01,719 INFO L290 TraceCheckUtils]: 17: Hoare triple {8362#true} assume true; {8362#true} is VALID [2022-04-28 11:25:01,719 INFO L290 TraceCheckUtils]: 16: Hoare triple {8362#true} assume !(0 == ~cond); {8362#true} is VALID [2022-04-28 11:25:01,719 INFO L290 TraceCheckUtils]: 15: Hoare triple {8362#true} ~cond := #in~cond; {8362#true} is VALID [2022-04-28 11:25:01,719 INFO L272 TraceCheckUtils]: 14: Hoare triple {8738#(< ~counter~0 18)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {8362#true} is VALID [2022-04-28 11:25:01,719 INFO L290 TraceCheckUtils]: 13: Hoare triple {8738#(< ~counter~0 18)} assume !!(#t~post6 < 20);havoc #t~post6; {8738#(< ~counter~0 18)} is VALID [2022-04-28 11:25:01,720 INFO L290 TraceCheckUtils]: 12: Hoare triple {8778#(< ~counter~0 17)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8738#(< ~counter~0 18)} is VALID [2022-04-28 11:25:01,720 INFO L290 TraceCheckUtils]: 11: Hoare triple {8778#(< ~counter~0 17)} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {8778#(< ~counter~0 17)} is VALID [2022-04-28 11:25:01,720 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8362#true} {8778#(< ~counter~0 17)} #77#return; {8778#(< ~counter~0 17)} is VALID [2022-04-28 11:25:01,720 INFO L290 TraceCheckUtils]: 9: Hoare triple {8362#true} assume true; {8362#true} is VALID [2022-04-28 11:25:01,721 INFO L290 TraceCheckUtils]: 8: Hoare triple {8362#true} assume !(0 == ~cond); {8362#true} is VALID [2022-04-28 11:25:01,721 INFO L290 TraceCheckUtils]: 7: Hoare triple {8362#true} ~cond := #in~cond; {8362#true} is VALID [2022-04-28 11:25:01,721 INFO L272 TraceCheckUtils]: 6: Hoare triple {8778#(< ~counter~0 17)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {8362#true} is VALID [2022-04-28 11:25:01,721 INFO L290 TraceCheckUtils]: 5: Hoare triple {8778#(< ~counter~0 17)} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~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; {8778#(< ~counter~0 17)} is VALID [2022-04-28 11:25:01,721 INFO L272 TraceCheckUtils]: 4: Hoare triple {8778#(< ~counter~0 17)} call #t~ret8 := main(); {8778#(< ~counter~0 17)} is VALID [2022-04-28 11:25:01,722 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8778#(< ~counter~0 17)} {8362#true} #93#return; {8778#(< ~counter~0 17)} is VALID [2022-04-28 11:25:01,722 INFO L290 TraceCheckUtils]: 2: Hoare triple {8778#(< ~counter~0 17)} assume true; {8778#(< ~counter~0 17)} is VALID [2022-04-28 11:25:01,722 INFO L290 TraceCheckUtils]: 1: Hoare triple {8362#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(14, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {8778#(< ~counter~0 17)} is VALID [2022-04-28 11:25:01,722 INFO L272 TraceCheckUtils]: 0: Hoare triple {8362#true} call ULTIMATE.init(); {8362#true} is VALID [2022-04-28 11:25:01,723 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 18 proven. 8 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2022-04-28 11:25:01,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:25:01,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670115198] [2022-04-28 11:25:01,723 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:25:01,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1230120587] [2022-04-28 11:25:01,723 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1230120587] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 11:25:01,723 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 11:25:01,723 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2022-04-28 11:25:01,723 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:25:01,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1479846875] [2022-04-28 11:25:01,723 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1479846875] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:25:01,723 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:25:01,723 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 11:25:01,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794629734] [2022-04-28 11:25:01,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:25:01,724 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 6 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (11), 4 states have call predecessors, (11), 5 states have call successors, (11) Word has length 74 [2022-04-28 11:25:01,724 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:25:01,724 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 6 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (11), 4 states have call predecessors, (11), 5 states have call successors, (11) [2022-04-28 11:25:01,764 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-28 11:25:01,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 11:25:01,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:25:01,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 11:25:01,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2022-04-28 11:25:01,765 INFO L87 Difference]: Start difference. First operand 112 states and 133 transitions. Second operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 6 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (11), 4 states have call predecessors, (11), 5 states have call successors, (11) [2022-04-28 11:25:02,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:25:02,064 INFO L93 Difference]: Finished difference Result 141 states and 164 transitions. [2022-04-28 11:25:02,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 11:25:02,064 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 6 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (11), 4 states have call predecessors, (11), 5 states have call successors, (11) Word has length 74 [2022-04-28 11:25:02,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:25:02,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 6 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (11), 4 states have call predecessors, (11), 5 states have call successors, (11) [2022-04-28 11:25:02,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 94 transitions. [2022-04-28 11:25:02,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 6 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (11), 4 states have call predecessors, (11), 5 states have call successors, (11) [2022-04-28 11:25:02,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 94 transitions. [2022-04-28 11:25:02,066 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 94 transitions. [2022-04-28 11:25:02,127 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-28 11:25:02,129 INFO L225 Difference]: With dead ends: 141 [2022-04-28 11:25:02,129 INFO L226 Difference]: Without dead ends: 134 [2022-04-28 11:25:02,129 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2022-04-28 11:25:02,130 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 14 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 11:25:02,130 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 161 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 11:25:02,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2022-04-28 11:25:02,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 132. [2022-04-28 11:25:02,262 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:25:02,262 INFO L82 GeneralOperation]: Start isEquivalent. First operand 134 states. Second operand has 132 states, 85 states have (on average 1.1411764705882352) internal successors, (97), 88 states have internal predecessors, (97), 30 states have call successors, (30), 17 states have call predecessors, (30), 16 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-28 11:25:02,262 INFO L74 IsIncluded]: Start isIncluded. First operand 134 states. Second operand has 132 states, 85 states have (on average 1.1411764705882352) internal successors, (97), 88 states have internal predecessors, (97), 30 states have call successors, (30), 17 states have call predecessors, (30), 16 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-28 11:25:02,263 INFO L87 Difference]: Start difference. First operand 134 states. Second operand has 132 states, 85 states have (on average 1.1411764705882352) internal successors, (97), 88 states have internal predecessors, (97), 30 states have call successors, (30), 17 states have call predecessors, (30), 16 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-28 11:25:02,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:25:02,265 INFO L93 Difference]: Finished difference Result 134 states and 157 transitions. [2022-04-28 11:25:02,265 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 157 transitions. [2022-04-28 11:25:02,265 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:25:02,265 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:25:02,266 INFO L74 IsIncluded]: Start isIncluded. First operand has 132 states, 85 states have (on average 1.1411764705882352) internal successors, (97), 88 states have internal predecessors, (97), 30 states have call successors, (30), 17 states have call predecessors, (30), 16 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) Second operand 134 states. [2022-04-28 11:25:02,266 INFO L87 Difference]: Start difference. First operand has 132 states, 85 states have (on average 1.1411764705882352) internal successors, (97), 88 states have internal predecessors, (97), 30 states have call successors, (30), 17 states have call predecessors, (30), 16 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) Second operand 134 states. [2022-04-28 11:25:02,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:25:02,268 INFO L93 Difference]: Finished difference Result 134 states and 157 transitions. [2022-04-28 11:25:02,268 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 157 transitions. [2022-04-28 11:25:02,268 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:25:02,268 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:25:02,268 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:25:02,268 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:25:02,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 85 states have (on average 1.1411764705882352) internal successors, (97), 88 states have internal predecessors, (97), 30 states have call successors, (30), 17 states have call predecessors, (30), 16 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-28 11:25:02,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 155 transitions. [2022-04-28 11:25:02,271 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 155 transitions. Word has length 74 [2022-04-28 11:25:02,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:25:02,271 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 155 transitions. [2022-04-28 11:25:02,271 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 6 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (11), 4 states have call predecessors, (11), 5 states have call successors, (11) [2022-04-28 11:25:02,271 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 132 states and 155 transitions. [2022-04-28 11:25:02,416 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 155 edges. 155 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:25:02,416 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 155 transitions. [2022-04-28 11:25:02,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-04-28 11:25:02,416 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:25:02,416 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 2, 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] [2022-04-28 11:25:02,434 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-28 11:25:02,617 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-28 11:25:02,618 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:25:02,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:25:02,619 INFO L85 PathProgramCache]: Analyzing trace with hash 1777426592, now seen corresponding path program 1 times [2022-04-28 11:25:02,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:25:02,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [534474962] [2022-04-28 11:25:02,799 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:25:22,586 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:25:22,586 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:25:22,586 INFO L85 PathProgramCache]: Analyzing trace with hash 1777426592, now seen corresponding path program 2 times [2022-04-28 11:25:22,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:25:22,586 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418903655] [2022-04-28 11:25:22,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:25:22,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:25:22,595 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:25:22,595 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1732419696] [2022-04-28 11:25:22,595 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:25:22,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:25:22,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:25:22,596 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-28 11:25:22,597 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-28 11:25:22,645 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 11:25:22,645 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:25:22,646 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 26 conjunts are in the unsatisfiable core [2022-04-28 11:25:22,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:25:22,660 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:25:24,230 INFO L272 TraceCheckUtils]: 0: Hoare triple {9633#true} call ULTIMATE.init(); {9633#true} is VALID [2022-04-28 11:25:24,230 INFO L290 TraceCheckUtils]: 1: Hoare triple {9633#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(14, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {9633#true} is VALID [2022-04-28 11:25:24,230 INFO L290 TraceCheckUtils]: 2: Hoare triple {9633#true} assume true; {9633#true} is VALID [2022-04-28 11:25:24,230 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9633#true} {9633#true} #93#return; {9633#true} is VALID [2022-04-28 11:25:24,230 INFO L272 TraceCheckUtils]: 4: Hoare triple {9633#true} call #t~ret8 := main(); {9633#true} is VALID [2022-04-28 11:25:24,230 INFO L290 TraceCheckUtils]: 5: Hoare triple {9633#true} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~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; {9633#true} is VALID [2022-04-28 11:25:24,230 INFO L272 TraceCheckUtils]: 6: Hoare triple {9633#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {9633#true} is VALID [2022-04-28 11:25:24,230 INFO L290 TraceCheckUtils]: 7: Hoare triple {9633#true} ~cond := #in~cond; {9659#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 11:25:24,231 INFO L290 TraceCheckUtils]: 8: Hoare triple {9659#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {9663#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 11:25:24,231 INFO L290 TraceCheckUtils]: 9: Hoare triple {9663#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {9663#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 11:25:24,232 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {9663#(not (= |assume_abort_if_not_#in~cond| 0))} {9633#true} #77#return; {9670#(<= 1 main_~y~0)} is VALID [2022-04-28 11:25:24,232 INFO L290 TraceCheckUtils]: 11: Hoare triple {9670#(<= 1 main_~y~0)} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {9674#(and (= main_~x~0 main_~r~0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-28 11:25:24,232 INFO L290 TraceCheckUtils]: 12: Hoare triple {9674#(and (= main_~x~0 main_~r~0) (= main_~q~0 0) (<= 1 main_~y~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9674#(and (= main_~x~0 main_~r~0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-28 11:25:24,233 INFO L290 TraceCheckUtils]: 13: Hoare triple {9674#(and (= main_~x~0 main_~r~0) (= main_~q~0 0) (<= 1 main_~y~0))} assume !!(#t~post6 < 20);havoc #t~post6; {9674#(and (= main_~x~0 main_~r~0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-28 11:25:24,233 INFO L272 TraceCheckUtils]: 14: Hoare triple {9674#(and (= main_~x~0 main_~r~0) (= main_~q~0 0) (<= 1 main_~y~0))} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {9633#true} is VALID [2022-04-28 11:25:24,233 INFO L290 TraceCheckUtils]: 15: Hoare triple {9633#true} ~cond := #in~cond; {9633#true} is VALID [2022-04-28 11:25:24,233 INFO L290 TraceCheckUtils]: 16: Hoare triple {9633#true} assume !(0 == ~cond); {9633#true} is VALID [2022-04-28 11:25:24,233 INFO L290 TraceCheckUtils]: 17: Hoare triple {9633#true} assume true; {9633#true} is VALID [2022-04-28 11:25:24,233 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {9633#true} {9674#(and (= main_~x~0 main_~r~0) (= main_~q~0 0) (<= 1 main_~y~0))} #79#return; {9674#(and (= main_~x~0 main_~r~0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-28 11:25:24,233 INFO L272 TraceCheckUtils]: 19: Hoare triple {9674#(and (= main_~x~0 main_~r~0) (= main_~q~0 0) (<= 1 main_~y~0))} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {9633#true} is VALID [2022-04-28 11:25:24,233 INFO L290 TraceCheckUtils]: 20: Hoare triple {9633#true} ~cond := #in~cond; {9633#true} is VALID [2022-04-28 11:25:24,234 INFO L290 TraceCheckUtils]: 21: Hoare triple {9633#true} assume !(0 == ~cond); {9633#true} is VALID [2022-04-28 11:25:24,234 INFO L290 TraceCheckUtils]: 22: Hoare triple {9633#true} assume true; {9633#true} is VALID [2022-04-28 11:25:24,234 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {9633#true} {9674#(and (= main_~x~0 main_~r~0) (= main_~q~0 0) (<= 1 main_~y~0))} #81#return; {9674#(and (= main_~x~0 main_~r~0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-28 11:25:24,234 INFO L290 TraceCheckUtils]: 24: Hoare triple {9674#(and (= main_~x~0 main_~r~0) (= main_~q~0 0) (<= 1 main_~y~0))} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {9714#(and (= main_~x~0 main_~r~0) (<= 1 main_~a~0) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-28 11:25:24,235 INFO L290 TraceCheckUtils]: 25: Hoare triple {9714#(and (= main_~x~0 main_~r~0) (<= 1 main_~a~0) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {9714#(and (= main_~x~0 main_~r~0) (<= 1 main_~a~0) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-28 11:25:24,235 INFO L290 TraceCheckUtils]: 26: Hoare triple {9714#(and (= main_~x~0 main_~r~0) (<= 1 main_~a~0) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} assume !!(#t~post7 < 20);havoc #t~post7; {9714#(and (= main_~x~0 main_~r~0) (<= 1 main_~a~0) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-28 11:25:24,235 INFO L272 TraceCheckUtils]: 27: Hoare triple {9714#(and (= main_~x~0 main_~r~0) (<= 1 main_~a~0) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {9633#true} is VALID [2022-04-28 11:25:24,235 INFO L290 TraceCheckUtils]: 28: Hoare triple {9633#true} ~cond := #in~cond; {9633#true} is VALID [2022-04-28 11:25:24,235 INFO L290 TraceCheckUtils]: 29: Hoare triple {9633#true} assume !(0 == ~cond); {9633#true} is VALID [2022-04-28 11:25:24,235 INFO L290 TraceCheckUtils]: 30: Hoare triple {9633#true} assume true; {9633#true} is VALID [2022-04-28 11:25:24,236 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {9633#true} {9714#(and (= main_~x~0 main_~r~0) (<= 1 main_~a~0) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} #83#return; {9714#(and (= main_~x~0 main_~r~0) (<= 1 main_~a~0) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-28 11:25:24,236 INFO L272 TraceCheckUtils]: 32: Hoare triple {9714#(and (= main_~x~0 main_~r~0) (<= 1 main_~a~0) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {9633#true} is VALID [2022-04-28 11:25:24,236 INFO L290 TraceCheckUtils]: 33: Hoare triple {9633#true} ~cond := #in~cond; {9633#true} is VALID [2022-04-28 11:25:24,236 INFO L290 TraceCheckUtils]: 34: Hoare triple {9633#true} assume !(0 == ~cond); {9633#true} is VALID [2022-04-28 11:25:24,236 INFO L290 TraceCheckUtils]: 35: Hoare triple {9633#true} assume true; {9633#true} is VALID [2022-04-28 11:25:24,237 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {9633#true} {9714#(and (= main_~x~0 main_~r~0) (<= 1 main_~a~0) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} #85#return; {9714#(and (= main_~x~0 main_~r~0) (<= 1 main_~a~0) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-28 11:25:24,237 INFO L272 TraceCheckUtils]: 37: Hoare triple {9714#(and (= main_~x~0 main_~r~0) (<= 1 main_~a~0) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {9633#true} is VALID [2022-04-28 11:25:24,237 INFO L290 TraceCheckUtils]: 38: Hoare triple {9633#true} ~cond := #in~cond; {9633#true} is VALID [2022-04-28 11:25:24,237 INFO L290 TraceCheckUtils]: 39: Hoare triple {9633#true} assume !(0 == ~cond); {9633#true} is VALID [2022-04-28 11:25:24,237 INFO L290 TraceCheckUtils]: 40: Hoare triple {9633#true} assume true; {9633#true} is VALID [2022-04-28 11:25:24,237 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {9633#true} {9714#(and (= main_~x~0 main_~r~0) (<= 1 main_~a~0) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} #87#return; {9714#(and (= main_~x~0 main_~r~0) (<= 1 main_~a~0) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-28 11:25:24,238 INFO L290 TraceCheckUtils]: 42: Hoare triple {9714#(and (= main_~x~0 main_~r~0) (<= 1 main_~a~0) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} assume !!(~r~0 >= 2 * ~b~0); {9714#(and (= main_~x~0 main_~r~0) (<= 1 main_~a~0) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-28 11:25:24,238 INFO L272 TraceCheckUtils]: 43: Hoare triple {9714#(and (= main_~x~0 main_~r~0) (<= 1 main_~a~0) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} call __VERIFIER_assert((if ~r~0 >= 2 * ~y~0 * ~a~0 then 1 else 0)); {9633#true} is VALID [2022-04-28 11:25:24,238 INFO L290 TraceCheckUtils]: 44: Hoare triple {9633#true} ~cond := #in~cond; {9633#true} is VALID [2022-04-28 11:25:24,238 INFO L290 TraceCheckUtils]: 45: Hoare triple {9633#true} assume !(0 == ~cond); {9633#true} is VALID [2022-04-28 11:25:24,238 INFO L290 TraceCheckUtils]: 46: Hoare triple {9633#true} assume true; {9633#true} is VALID [2022-04-28 11:25:24,239 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {9633#true} {9714#(and (= main_~x~0 main_~r~0) (<= 1 main_~a~0) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} #89#return; {9714#(and (= main_~x~0 main_~r~0) (<= 1 main_~a~0) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-28 11:25:24,240 INFO L290 TraceCheckUtils]: 48: Hoare triple {9714#(and (= main_~x~0 main_~r~0) (<= 1 main_~a~0) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} ~a~0 := 2 * ~a~0;~b~0 := 2 * ~b~0; {9787#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (<= 1 (div (* (- 1) main_~a~0) (- 2))) (<= (div (- main_~b~0) (- 2)) main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-28 11:25:24,240 INFO L290 TraceCheckUtils]: 49: Hoare triple {9787#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (<= 1 (div (* (- 1) main_~a~0) (- 2))) (<= (div (- main_~b~0) (- 2)) main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {9787#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (<= 1 (div (* (- 1) main_~a~0) (- 2))) (<= (div (- main_~b~0) (- 2)) main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-28 11:25:24,240 INFO L290 TraceCheckUtils]: 50: Hoare triple {9787#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (<= 1 (div (* (- 1) main_~a~0) (- 2))) (<= (div (- main_~b~0) (- 2)) main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} assume !!(#t~post7 < 20);havoc #t~post7; {9787#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (<= 1 (div (* (- 1) main_~a~0) (- 2))) (<= (div (- main_~b~0) (- 2)) main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-28 11:25:24,240 INFO L272 TraceCheckUtils]: 51: Hoare triple {9787#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (<= 1 (div (* (- 1) main_~a~0) (- 2))) (<= (div (- main_~b~0) (- 2)) main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {9633#true} is VALID [2022-04-28 11:25:24,241 INFO L290 TraceCheckUtils]: 52: Hoare triple {9633#true} ~cond := #in~cond; {9633#true} is VALID [2022-04-28 11:25:24,241 INFO L290 TraceCheckUtils]: 53: Hoare triple {9633#true} assume !(0 == ~cond); {9633#true} is VALID [2022-04-28 11:25:24,241 INFO L290 TraceCheckUtils]: 54: Hoare triple {9633#true} assume true; {9633#true} is VALID [2022-04-28 11:25:24,241 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {9633#true} {9787#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (<= 1 (div (* (- 1) main_~a~0) (- 2))) (<= (div (- main_~b~0) (- 2)) main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} #83#return; {9787#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (<= 1 (div (* (- 1) main_~a~0) (- 2))) (<= (div (- main_~b~0) (- 2)) main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-28 11:25:24,241 INFO L272 TraceCheckUtils]: 56: Hoare triple {9787#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (<= 1 (div (* (- 1) main_~a~0) (- 2))) (<= (div (- main_~b~0) (- 2)) main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {9633#true} is VALID [2022-04-28 11:25:24,241 INFO L290 TraceCheckUtils]: 57: Hoare triple {9633#true} ~cond := #in~cond; {9633#true} is VALID [2022-04-28 11:25:24,241 INFO L290 TraceCheckUtils]: 58: Hoare triple {9633#true} assume !(0 == ~cond); {9633#true} is VALID [2022-04-28 11:25:24,241 INFO L290 TraceCheckUtils]: 59: Hoare triple {9633#true} assume true; {9633#true} is VALID [2022-04-28 11:25:24,242 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {9633#true} {9787#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (<= 1 (div (* (- 1) main_~a~0) (- 2))) (<= (div (- main_~b~0) (- 2)) main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} #85#return; {9787#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (<= 1 (div (* (- 1) main_~a~0) (- 2))) (<= (div (- main_~b~0) (- 2)) main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-28 11:25:24,242 INFO L272 TraceCheckUtils]: 61: Hoare triple {9787#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (<= 1 (div (* (- 1) main_~a~0) (- 2))) (<= (div (- main_~b~0) (- 2)) main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {9633#true} is VALID [2022-04-28 11:25:24,242 INFO L290 TraceCheckUtils]: 62: Hoare triple {9633#true} ~cond := #in~cond; {9633#true} is VALID [2022-04-28 11:25:24,242 INFO L290 TraceCheckUtils]: 63: Hoare triple {9633#true} assume !(0 == ~cond); {9633#true} is VALID [2022-04-28 11:25:24,242 INFO L290 TraceCheckUtils]: 64: Hoare triple {9633#true} assume true; {9633#true} is VALID [2022-04-28 11:25:24,243 INFO L284 TraceCheckUtils]: 65: Hoare quadruple {9633#true} {9787#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (<= 1 (div (* (- 1) main_~a~0) (- 2))) (<= (div (- main_~b~0) (- 2)) main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} #87#return; {9787#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (<= 1 (div (* (- 1) main_~a~0) (- 2))) (<= (div (- main_~b~0) (- 2)) main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-28 11:25:24,243 INFO L290 TraceCheckUtils]: 66: Hoare triple {9787#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (<= 1 (div (* (- 1) main_~a~0) (- 2))) (<= (div (- main_~b~0) (- 2)) main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} assume !(~r~0 >= 2 * ~b~0); {9787#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (<= 1 (div (* (- 1) main_~a~0) (- 2))) (<= (div (- main_~b~0) (- 2)) main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-28 11:25:24,244 INFO L290 TraceCheckUtils]: 67: Hoare triple {9787#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (<= 1 (div (* (- 1) main_~a~0) (- 2))) (<= (div (- main_~b~0) (- 2)) main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} ~r~0 := ~r~0 - ~b~0;~q~0 := ~q~0 + ~a~0; {9845#(and (= (+ (* (- 1) main_~a~0) main_~q~0) 0) (= (mod main_~a~0 2) 0) (<= 1 (div (* (- 1) main_~a~0) (- 2))) (<= (div (- main_~b~0) (- 2)) main_~y~0) (= main_~x~0 (+ main_~b~0 main_~r~0)) (<= 1 main_~y~0))} is VALID [2022-04-28 11:25:24,244 INFO L290 TraceCheckUtils]: 68: Hoare triple {9845#(and (= (+ (* (- 1) main_~a~0) main_~q~0) 0) (= (mod main_~a~0 2) 0) (<= 1 (div (* (- 1) main_~a~0) (- 2))) (<= (div (- main_~b~0) (- 2)) main_~y~0) (= main_~x~0 (+ main_~b~0 main_~r~0)) (<= 1 main_~y~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9845#(and (= (+ (* (- 1) main_~a~0) main_~q~0) 0) (= (mod main_~a~0 2) 0) (<= 1 (div (* (- 1) main_~a~0) (- 2))) (<= (div (- main_~b~0) (- 2)) main_~y~0) (= main_~x~0 (+ main_~b~0 main_~r~0)) (<= 1 main_~y~0))} is VALID [2022-04-28 11:25:24,245 INFO L290 TraceCheckUtils]: 69: Hoare triple {9845#(and (= (+ (* (- 1) main_~a~0) main_~q~0) 0) (= (mod main_~a~0 2) 0) (<= 1 (div (* (- 1) main_~a~0) (- 2))) (<= (div (- main_~b~0) (- 2)) main_~y~0) (= main_~x~0 (+ main_~b~0 main_~r~0)) (<= 1 main_~y~0))} assume !!(#t~post6 < 20);havoc #t~post6; {9845#(and (= (+ (* (- 1) main_~a~0) main_~q~0) 0) (= (mod main_~a~0 2) 0) (<= 1 (div (* (- 1) main_~a~0) (- 2))) (<= (div (- main_~b~0) (- 2)) main_~y~0) (= main_~x~0 (+ main_~b~0 main_~r~0)) (<= 1 main_~y~0))} is VALID [2022-04-28 11:25:24,245 INFO L272 TraceCheckUtils]: 70: Hoare triple {9845#(and (= (+ (* (- 1) main_~a~0) main_~q~0) 0) (= (mod main_~a~0 2) 0) (<= 1 (div (* (- 1) main_~a~0) (- 2))) (<= (div (- main_~b~0) (- 2)) main_~y~0) (= main_~x~0 (+ main_~b~0 main_~r~0)) (<= 1 main_~y~0))} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {9633#true} is VALID [2022-04-28 11:25:24,245 INFO L290 TraceCheckUtils]: 71: Hoare triple {9633#true} ~cond := #in~cond; {9858#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:25:24,245 INFO L290 TraceCheckUtils]: 72: Hoare triple {9858#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {9862#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:25:24,245 INFO L290 TraceCheckUtils]: 73: Hoare triple {9862#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {9862#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:25:24,248 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {9862#(not (= |__VERIFIER_assert_#in~cond| 0))} {9845#(and (= (+ (* (- 1) main_~a~0) main_~q~0) 0) (= (mod main_~a~0 2) 0) (<= 1 (div (* (- 1) main_~a~0) (- 2))) (<= (div (- main_~b~0) (- 2)) main_~y~0) (= main_~x~0 (+ main_~b~0 main_~r~0)) (<= 1 main_~y~0))} #79#return; {9869#(and (<= 1 (div (* (- 1) main_~q~0) (- 2))) (= (+ main_~x~0 (* (- 1) main_~r~0)) (* main_~q~0 main_~y~0)) (= (mod main_~q~0 2) 0) (<= 1 main_~y~0) (<= (div (+ main_~r~0 (* (- 1) main_~x~0)) (- 2)) main_~y~0))} is VALID [2022-04-28 11:25:24,249 INFO L272 TraceCheckUtils]: 75: Hoare triple {9869#(and (<= 1 (div (* (- 1) main_~q~0) (- 2))) (= (+ main_~x~0 (* (- 1) main_~r~0)) (* main_~q~0 main_~y~0)) (= (mod main_~q~0 2) 0) (<= 1 main_~y~0) (<= (div (+ main_~r~0 (* (- 1) main_~x~0)) (- 2)) main_~y~0))} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {9873#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:25:24,249 INFO L290 TraceCheckUtils]: 76: Hoare triple {9873#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {9877#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:25:24,249 INFO L290 TraceCheckUtils]: 77: Hoare triple {9877#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {9634#false} is VALID [2022-04-28 11:25:24,249 INFO L290 TraceCheckUtils]: 78: Hoare triple {9634#false} assume !false; {9634#false} is VALID [2022-04-28 11:25:24,250 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 46 proven. 11 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2022-04-28 11:25:24,250 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:25:32,621 INFO L290 TraceCheckUtils]: 78: Hoare triple {9634#false} assume !false; {9634#false} is VALID [2022-04-28 11:25:32,622 INFO L290 TraceCheckUtils]: 77: Hoare triple {9877#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {9634#false} is VALID [2022-04-28 11:25:32,622 INFO L290 TraceCheckUtils]: 76: Hoare triple {9873#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {9877#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:25:32,623 INFO L272 TraceCheckUtils]: 75: Hoare triple {9893#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {9873#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:25:32,623 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {9862#(not (= |__VERIFIER_assert_#in~cond| 0))} {9897#(or (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (not (= main_~b~0 (* main_~a~0 main_~y~0))))} #79#return; {9893#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:25:32,624 INFO L290 TraceCheckUtils]: 73: Hoare triple {9862#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {9862#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:25:32,624 INFO L290 TraceCheckUtils]: 72: Hoare triple {9907#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {9862#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:25:32,624 INFO L290 TraceCheckUtils]: 71: Hoare triple {9633#true} ~cond := #in~cond; {9907#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 11:25:32,624 INFO L272 TraceCheckUtils]: 70: Hoare triple {9897#(or (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (not (= main_~b~0 (* main_~a~0 main_~y~0))))} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {9633#true} is VALID [2022-04-28 11:25:32,625 INFO L290 TraceCheckUtils]: 69: Hoare triple {9897#(or (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (not (= main_~b~0 (* main_~a~0 main_~y~0))))} assume !!(#t~post6 < 20);havoc #t~post6; {9897#(or (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (not (= main_~b~0 (* main_~a~0 main_~y~0))))} is VALID [2022-04-28 11:25:32,625 INFO L290 TraceCheckUtils]: 68: Hoare triple {9897#(or (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (not (= main_~b~0 (* main_~a~0 main_~y~0))))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9897#(or (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (not (= main_~b~0 (* main_~a~0 main_~y~0))))} is VALID [2022-04-28 11:25:32,632 INFO L290 TraceCheckUtils]: 67: Hoare triple {9897#(or (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (not (= main_~b~0 (* main_~a~0 main_~y~0))))} ~r~0 := ~r~0 - ~b~0;~q~0 := ~q~0 + ~a~0; {9897#(or (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (not (= main_~b~0 (* main_~a~0 main_~y~0))))} is VALID [2022-04-28 11:25:32,632 INFO L290 TraceCheckUtils]: 66: Hoare triple {9897#(or (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (not (= main_~b~0 (* main_~a~0 main_~y~0))))} assume !(~r~0 >= 2 * ~b~0); {9897#(or (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (not (= main_~b~0 (* main_~a~0 main_~y~0))))} is VALID [2022-04-28 11:25:32,633 INFO L284 TraceCheckUtils]: 65: Hoare quadruple {9633#true} {9897#(or (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (not (= main_~b~0 (* main_~a~0 main_~y~0))))} #87#return; {9897#(or (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (not (= main_~b~0 (* main_~a~0 main_~y~0))))} is VALID [2022-04-28 11:25:32,633 INFO L290 TraceCheckUtils]: 64: Hoare triple {9633#true} assume true; {9633#true} is VALID [2022-04-28 11:25:32,633 INFO L290 TraceCheckUtils]: 63: Hoare triple {9633#true} assume !(0 == ~cond); {9633#true} is VALID [2022-04-28 11:25:32,633 INFO L290 TraceCheckUtils]: 62: Hoare triple {9633#true} ~cond := #in~cond; {9633#true} is VALID [2022-04-28 11:25:32,633 INFO L272 TraceCheckUtils]: 61: Hoare triple {9897#(or (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (not (= main_~b~0 (* main_~a~0 main_~y~0))))} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {9633#true} is VALID [2022-04-28 11:25:32,634 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {9633#true} {9897#(or (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (not (= main_~b~0 (* main_~a~0 main_~y~0))))} #85#return; {9897#(or (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (not (= main_~b~0 (* main_~a~0 main_~y~0))))} is VALID [2022-04-28 11:25:32,634 INFO L290 TraceCheckUtils]: 59: Hoare triple {9633#true} assume true; {9633#true} is VALID [2022-04-28 11:25:32,634 INFO L290 TraceCheckUtils]: 58: Hoare triple {9633#true} assume !(0 == ~cond); {9633#true} is VALID [2022-04-28 11:25:32,634 INFO L290 TraceCheckUtils]: 57: Hoare triple {9633#true} ~cond := #in~cond; {9633#true} is VALID [2022-04-28 11:25:32,634 INFO L272 TraceCheckUtils]: 56: Hoare triple {9897#(or (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (not (= main_~b~0 (* main_~a~0 main_~y~0))))} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {9633#true} is VALID [2022-04-28 11:25:32,635 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {9633#true} {9897#(or (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (not (= main_~b~0 (* main_~a~0 main_~y~0))))} #83#return; {9897#(or (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (not (= main_~b~0 (* main_~a~0 main_~y~0))))} is VALID [2022-04-28 11:25:32,635 INFO L290 TraceCheckUtils]: 54: Hoare triple {9633#true} assume true; {9633#true} is VALID [2022-04-28 11:25:32,635 INFO L290 TraceCheckUtils]: 53: Hoare triple {9633#true} assume !(0 == ~cond); {9633#true} is VALID [2022-04-28 11:25:32,635 INFO L290 TraceCheckUtils]: 52: Hoare triple {9633#true} ~cond := #in~cond; {9633#true} is VALID [2022-04-28 11:25:32,635 INFO L272 TraceCheckUtils]: 51: Hoare triple {9897#(or (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (not (= main_~b~0 (* main_~a~0 main_~y~0))))} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {9633#true} is VALID [2022-04-28 11:25:32,635 INFO L290 TraceCheckUtils]: 50: Hoare triple {9897#(or (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (not (= main_~b~0 (* main_~a~0 main_~y~0))))} assume !!(#t~post7 < 20);havoc #t~post7; {9897#(or (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (not (= main_~b~0 (* main_~a~0 main_~y~0))))} is VALID [2022-04-28 11:25:32,636 INFO L290 TraceCheckUtils]: 49: Hoare triple {9897#(or (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (not (= main_~b~0 (* main_~a~0 main_~y~0))))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {9897#(or (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (not (= main_~b~0 (* main_~a~0 main_~y~0))))} is VALID [2022-04-28 11:25:32,637 INFO L290 TraceCheckUtils]: 48: Hoare triple {9977#(or (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (not (<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))))} ~a~0 := 2 * ~a~0;~b~0 := 2 * ~b~0; {9897#(or (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (not (= main_~b~0 (* main_~a~0 main_~y~0))))} is VALID [2022-04-28 11:25:32,637 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {9633#true} {9977#(or (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (not (<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))))} #89#return; {9977#(or (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (not (<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))))} is VALID [2022-04-28 11:25:32,637 INFO L290 TraceCheckUtils]: 46: Hoare triple {9633#true} assume true; {9633#true} is VALID [2022-04-28 11:25:32,637 INFO L290 TraceCheckUtils]: 45: Hoare triple {9633#true} assume !(0 == ~cond); {9633#true} is VALID [2022-04-28 11:25:32,637 INFO L290 TraceCheckUtils]: 44: Hoare triple {9633#true} ~cond := #in~cond; {9633#true} is VALID [2022-04-28 11:25:32,638 INFO L272 TraceCheckUtils]: 43: Hoare triple {9977#(or (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (not (<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))))} call __VERIFIER_assert((if ~r~0 >= 2 * ~y~0 * ~a~0 then 1 else 0)); {9633#true} is VALID [2022-04-28 11:25:32,638 INFO L290 TraceCheckUtils]: 42: Hoare triple {9977#(or (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (not (<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))))} assume !!(~r~0 >= 2 * ~b~0); {9977#(or (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (not (<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))))} is VALID [2022-04-28 11:25:32,638 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {9633#true} {9977#(or (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (not (<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))))} #87#return; {9977#(or (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (not (<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))))} is VALID [2022-04-28 11:25:32,639 INFO L290 TraceCheckUtils]: 40: Hoare triple {9633#true} assume true; {9633#true} is VALID [2022-04-28 11:25:32,639 INFO L290 TraceCheckUtils]: 39: Hoare triple {9633#true} assume !(0 == ~cond); {9633#true} is VALID [2022-04-28 11:25:32,639 INFO L290 TraceCheckUtils]: 38: Hoare triple {9633#true} ~cond := #in~cond; {9633#true} is VALID [2022-04-28 11:25:32,639 INFO L272 TraceCheckUtils]: 37: Hoare triple {9977#(or (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (not (<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))))} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {9633#true} is VALID [2022-04-28 11:25:32,639 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {9633#true} {9977#(or (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (not (<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))))} #85#return; {9977#(or (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (not (<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))))} is VALID [2022-04-28 11:25:32,639 INFO L290 TraceCheckUtils]: 35: Hoare triple {9633#true} assume true; {9633#true} is VALID [2022-04-28 11:25:32,639 INFO L290 TraceCheckUtils]: 34: Hoare triple {9633#true} assume !(0 == ~cond); {9633#true} is VALID [2022-04-28 11:25:32,639 INFO L290 TraceCheckUtils]: 33: Hoare triple {9633#true} ~cond := #in~cond; {9633#true} is VALID [2022-04-28 11:25:32,639 INFO L272 TraceCheckUtils]: 32: Hoare triple {9977#(or (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (not (<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))))} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {9633#true} is VALID [2022-04-28 11:25:32,640 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {9633#true} {9977#(or (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (not (<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))))} #83#return; {9977#(or (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (not (<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))))} is VALID [2022-04-28 11:25:32,640 INFO L290 TraceCheckUtils]: 30: Hoare triple {9633#true} assume true; {9633#true} is VALID [2022-04-28 11:25:32,640 INFO L290 TraceCheckUtils]: 29: Hoare triple {9633#true} assume !(0 == ~cond); {9633#true} is VALID [2022-04-28 11:25:32,640 INFO L290 TraceCheckUtils]: 28: Hoare triple {9633#true} ~cond := #in~cond; {9633#true} is VALID [2022-04-28 11:25:32,640 INFO L272 TraceCheckUtils]: 27: Hoare triple {9977#(or (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (not (<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))))} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {9633#true} is VALID [2022-04-28 11:25:32,641 INFO L290 TraceCheckUtils]: 26: Hoare triple {9977#(or (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (not (<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))))} assume !!(#t~post7 < 20);havoc #t~post7; {9977#(or (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (not (<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))))} is VALID [2022-04-28 11:25:32,641 INFO L290 TraceCheckUtils]: 25: Hoare triple {9977#(or (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (not (<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {9977#(or (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (not (<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))))} is VALID [2022-04-28 11:25:32,641 INFO L290 TraceCheckUtils]: 24: Hoare triple {9893#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {9977#(or (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (not (<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))))} is VALID [2022-04-28 11:25:32,642 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {9633#true} {9893#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} #81#return; {9893#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:25:32,642 INFO L290 TraceCheckUtils]: 22: Hoare triple {9633#true} assume true; {9633#true} is VALID [2022-04-28 11:25:32,642 INFO L290 TraceCheckUtils]: 21: Hoare triple {9633#true} assume !(0 == ~cond); {9633#true} is VALID [2022-04-28 11:25:32,642 INFO L290 TraceCheckUtils]: 20: Hoare triple {9633#true} ~cond := #in~cond; {9633#true} is VALID [2022-04-28 11:25:32,642 INFO L272 TraceCheckUtils]: 19: Hoare triple {9893#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {9633#true} is VALID [2022-04-28 11:25:32,643 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {9633#true} {9893#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} #79#return; {9893#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:25:32,643 INFO L290 TraceCheckUtils]: 17: Hoare triple {9633#true} assume true; {9633#true} is VALID [2022-04-28 11:25:32,643 INFO L290 TraceCheckUtils]: 16: Hoare triple {9633#true} assume !(0 == ~cond); {9633#true} is VALID [2022-04-28 11:25:32,643 INFO L290 TraceCheckUtils]: 15: Hoare triple {9633#true} ~cond := #in~cond; {9633#true} is VALID [2022-04-28 11:25:32,643 INFO L272 TraceCheckUtils]: 14: Hoare triple {9893#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {9633#true} is VALID [2022-04-28 11:25:32,643 INFO L290 TraceCheckUtils]: 13: Hoare triple {9893#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} assume !!(#t~post6 < 20);havoc #t~post6; {9893#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:25:32,643 INFO L290 TraceCheckUtils]: 12: Hoare triple {9893#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9893#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:25:32,644 INFO L290 TraceCheckUtils]: 11: Hoare triple {9633#true} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {9893#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:25:32,644 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {9633#true} {9633#true} #77#return; {9633#true} is VALID [2022-04-28 11:25:32,644 INFO L290 TraceCheckUtils]: 9: Hoare triple {9633#true} assume true; {9633#true} is VALID [2022-04-28 11:25:32,644 INFO L290 TraceCheckUtils]: 8: Hoare triple {9633#true} assume !(0 == ~cond); {9633#true} is VALID [2022-04-28 11:25:32,644 INFO L290 TraceCheckUtils]: 7: Hoare triple {9633#true} ~cond := #in~cond; {9633#true} is VALID [2022-04-28 11:25:32,644 INFO L272 TraceCheckUtils]: 6: Hoare triple {9633#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {9633#true} is VALID [2022-04-28 11:25:32,644 INFO L290 TraceCheckUtils]: 5: Hoare triple {9633#true} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~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; {9633#true} is VALID [2022-04-28 11:25:32,644 INFO L272 TraceCheckUtils]: 4: Hoare triple {9633#true} call #t~ret8 := main(); {9633#true} is VALID [2022-04-28 11:25:32,644 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9633#true} {9633#true} #93#return; {9633#true} is VALID [2022-04-28 11:25:32,644 INFO L290 TraceCheckUtils]: 2: Hoare triple {9633#true} assume true; {9633#true} is VALID [2022-04-28 11:25:32,644 INFO L290 TraceCheckUtils]: 1: Hoare triple {9633#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(14, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {9633#true} is VALID [2022-04-28 11:25:32,644 INFO L272 TraceCheckUtils]: 0: Hoare triple {9633#true} call ULTIMATE.init(); {9633#true} is VALID [2022-04-28 11:25:32,645 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 46 proven. 10 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2022-04-28 11:25:32,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:25:32,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418903655] [2022-04-28 11:25:32,645 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:25:32,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1732419696] [2022-04-28 11:25:32,645 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1732419696] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 11:25:32,645 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 11:25:32,645 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9] total 18 [2022-04-28 11:25:32,645 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:25:32,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [534474962] [2022-04-28 11:25:32,645 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [534474962] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:25:32,645 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:25:32,645 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-28 11:25:32,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163252051] [2022-04-28 11:25:32,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:25:32,646 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.230769230769231) internal successors, (29), 11 states have internal predecessors, (29), 6 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 6 states have call predecessors, (12), 5 states have call successors, (12) Word has length 79 [2022-04-28 11:25:32,646 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:25:32,646 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 13 states have (on average 2.230769230769231) internal successors, (29), 11 states have internal predecessors, (29), 6 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 6 states have call predecessors, (12), 5 states have call successors, (12) [2022-04-28 11:25:32,680 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:25:32,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-28 11:25:32,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:25:32,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-28 11:25:32,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2022-04-28 11:25:32,681 INFO L87 Difference]: Start difference. First operand 132 states and 155 transitions. Second operand has 14 states, 13 states have (on average 2.230769230769231) internal successors, (29), 11 states have internal predecessors, (29), 6 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 6 states have call predecessors, (12), 5 states have call successors, (12) [2022-04-28 11:25:36,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:25:36,744 INFO L93 Difference]: Finished difference Result 161 states and 197 transitions. [2022-04-28 11:25:36,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-28 11:25:36,745 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.230769230769231) internal successors, (29), 11 states have internal predecessors, (29), 6 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 6 states have call predecessors, (12), 5 states have call successors, (12) Word has length 79 [2022-04-28 11:25:36,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:25:36,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 2.230769230769231) internal successors, (29), 11 states have internal predecessors, (29), 6 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 6 states have call predecessors, (12), 5 states have call successors, (12) [2022-04-28 11:25:36,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 119 transitions. [2022-04-28 11:25:36,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 2.230769230769231) internal successors, (29), 11 states have internal predecessors, (29), 6 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 6 states have call predecessors, (12), 5 states have call successors, (12) [2022-04-28 11:25:36,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 119 transitions. [2022-04-28 11:25:36,748 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 119 transitions. [2022-04-28 11:25:36,854 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 119 edges. 119 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:25:36,857 INFO L225 Difference]: With dead ends: 161 [2022-04-28 11:25:36,857 INFO L226 Difference]: Without dead ends: 158 [2022-04-28 11:25:36,857 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 138 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=86, Invalid=376, Unknown=0, NotChecked=0, Total=462 [2022-04-28 11:25:36,857 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 51 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 576 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 607 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 576 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-04-28 11:25:36,858 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 259 Invalid, 607 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 576 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-04-28 11:25:36,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2022-04-28 11:25:37,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 153. [2022-04-28 11:25:37,048 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:25:37,048 INFO L82 GeneralOperation]: Start isEquivalent. First operand 158 states. Second operand has 153 states, 96 states have (on average 1.1666666666666667) internal successors, (112), 99 states have internal predecessors, (112), 39 states have call successors, (39), 18 states have call predecessors, (39), 17 states have return successors, (37), 35 states have call predecessors, (37), 37 states have call successors, (37) [2022-04-28 11:25:37,048 INFO L74 IsIncluded]: Start isIncluded. First operand 158 states. Second operand has 153 states, 96 states have (on average 1.1666666666666667) internal successors, (112), 99 states have internal predecessors, (112), 39 states have call successors, (39), 18 states have call predecessors, (39), 17 states have return successors, (37), 35 states have call predecessors, (37), 37 states have call successors, (37) [2022-04-28 11:25:37,049 INFO L87 Difference]: Start difference. First operand 158 states. Second operand has 153 states, 96 states have (on average 1.1666666666666667) internal successors, (112), 99 states have internal predecessors, (112), 39 states have call successors, (39), 18 states have call predecessors, (39), 17 states have return successors, (37), 35 states have call predecessors, (37), 37 states have call successors, (37) [2022-04-28 11:25:37,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:25:37,051 INFO L93 Difference]: Finished difference Result 158 states and 193 transitions. [2022-04-28 11:25:37,052 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 193 transitions. [2022-04-28 11:25:37,052 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:25:37,052 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:25:37,052 INFO L74 IsIncluded]: Start isIncluded. First operand has 153 states, 96 states have (on average 1.1666666666666667) internal successors, (112), 99 states have internal predecessors, (112), 39 states have call successors, (39), 18 states have call predecessors, (39), 17 states have return successors, (37), 35 states have call predecessors, (37), 37 states have call successors, (37) Second operand 158 states. [2022-04-28 11:25:37,052 INFO L87 Difference]: Start difference. First operand has 153 states, 96 states have (on average 1.1666666666666667) internal successors, (112), 99 states have internal predecessors, (112), 39 states have call successors, (39), 18 states have call predecessors, (39), 17 states have return successors, (37), 35 states have call predecessors, (37), 37 states have call successors, (37) Second operand 158 states. [2022-04-28 11:25:37,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:25:37,055 INFO L93 Difference]: Finished difference Result 158 states and 193 transitions. [2022-04-28 11:25:37,055 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 193 transitions. [2022-04-28 11:25:37,055 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:25:37,055 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:25:37,055 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:25:37,055 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:25:37,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 96 states have (on average 1.1666666666666667) internal successors, (112), 99 states have internal predecessors, (112), 39 states have call successors, (39), 18 states have call predecessors, (39), 17 states have return successors, (37), 35 states have call predecessors, (37), 37 states have call successors, (37) [2022-04-28 11:25:37,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 188 transitions. [2022-04-28 11:25:37,058 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 188 transitions. Word has length 79 [2022-04-28 11:25:37,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:25:37,060 INFO L495 AbstractCegarLoop]: Abstraction has 153 states and 188 transitions. [2022-04-28 11:25:37,060 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.230769230769231) internal successors, (29), 11 states have internal predecessors, (29), 6 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 6 states have call predecessors, (12), 5 states have call successors, (12) [2022-04-28 11:25:37,060 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 153 states and 188 transitions. [2022-04-28 11:25:37,265 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 188 edges. 188 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:25:37,266 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 188 transitions. [2022-04-28 11:25:37,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-04-28 11:25:37,266 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:25:37,266 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:25:37,283 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-28 11:25:37,467 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-28 11:25:37,467 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:25:37,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:25:37,468 INFO L85 PathProgramCache]: Analyzing trace with hash -554329876, now seen corresponding path program 3 times [2022-04-28 11:25:37,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:25:37,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [847176507] [2022-04-28 11:25:56,930 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:25:56,931 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:25:56,931 INFO L85 PathProgramCache]: Analyzing trace with hash -554329876, now seen corresponding path program 4 times [2022-04-28 11:25:56,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:25:56,931 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190416401] [2022-04-28 11:25:56,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:25:56,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:25:56,954 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:25:56,954 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [596259395] [2022-04-28 11:25:56,955 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 11:25:56,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:25:56,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:25:56,956 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-28 11:25:56,957 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-28 11:25:57,006 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 11:25:57,006 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:25:57,007 INFO L263 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-28 11:25:57,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:25:57,025 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:25:57,405 INFO L272 TraceCheckUtils]: 0: Hoare triple {11076#true} call ULTIMATE.init(); {11076#true} is VALID [2022-04-28 11:25:57,405 INFO L290 TraceCheckUtils]: 1: Hoare triple {11076#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(14, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {11076#true} is VALID [2022-04-28 11:25:57,405 INFO L290 TraceCheckUtils]: 2: Hoare triple {11076#true} assume true; {11076#true} is VALID [2022-04-28 11:25:57,405 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11076#true} {11076#true} #93#return; {11076#true} is VALID [2022-04-28 11:25:57,405 INFO L272 TraceCheckUtils]: 4: Hoare triple {11076#true} call #t~ret8 := main(); {11076#true} is VALID [2022-04-28 11:25:57,405 INFO L290 TraceCheckUtils]: 5: Hoare triple {11076#true} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~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; {11076#true} is VALID [2022-04-28 11:25:57,405 INFO L272 TraceCheckUtils]: 6: Hoare triple {11076#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {11076#true} is VALID [2022-04-28 11:25:57,405 INFO L290 TraceCheckUtils]: 7: Hoare triple {11076#true} ~cond := #in~cond; {11076#true} is VALID [2022-04-28 11:25:57,405 INFO L290 TraceCheckUtils]: 8: Hoare triple {11076#true} assume !(0 == ~cond); {11076#true} is VALID [2022-04-28 11:25:57,405 INFO L290 TraceCheckUtils]: 9: Hoare triple {11076#true} assume true; {11076#true} is VALID [2022-04-28 11:25:57,405 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {11076#true} {11076#true} #77#return; {11076#true} is VALID [2022-04-28 11:25:57,406 INFO L290 TraceCheckUtils]: 11: Hoare triple {11076#true} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {11114#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:25:57,406 INFO L290 TraceCheckUtils]: 12: Hoare triple {11114#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {11114#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:25:57,406 INFO L290 TraceCheckUtils]: 13: Hoare triple {11114#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} assume !!(#t~post6 < 20);havoc #t~post6; {11114#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:25:57,406 INFO L272 TraceCheckUtils]: 14: Hoare triple {11114#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {11076#true} is VALID [2022-04-28 11:25:57,406 INFO L290 TraceCheckUtils]: 15: Hoare triple {11076#true} ~cond := #in~cond; {11076#true} is VALID [2022-04-28 11:25:57,406 INFO L290 TraceCheckUtils]: 16: Hoare triple {11076#true} assume !(0 == ~cond); {11076#true} is VALID [2022-04-28 11:25:57,406 INFO L290 TraceCheckUtils]: 17: Hoare triple {11076#true} assume true; {11076#true} is VALID [2022-04-28 11:25:57,407 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {11076#true} {11114#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #79#return; {11114#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:25:57,407 INFO L272 TraceCheckUtils]: 19: Hoare triple {11114#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {11076#true} is VALID [2022-04-28 11:25:57,407 INFO L290 TraceCheckUtils]: 20: Hoare triple {11076#true} ~cond := #in~cond; {11076#true} is VALID [2022-04-28 11:25:57,407 INFO L290 TraceCheckUtils]: 21: Hoare triple {11076#true} assume !(0 == ~cond); {11076#true} is VALID [2022-04-28 11:25:57,408 INFO L290 TraceCheckUtils]: 22: Hoare triple {11076#true} assume true; {11076#true} is VALID [2022-04-28 11:25:57,408 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {11076#true} {11114#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #81#return; {11114#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:25:57,408 INFO L290 TraceCheckUtils]: 24: Hoare triple {11114#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {11154#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-28 11:25:57,408 INFO L290 TraceCheckUtils]: 25: Hoare triple {11154#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {11154#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-28 11:25:57,409 INFO L290 TraceCheckUtils]: 26: Hoare triple {11154#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} assume !!(#t~post7 < 20);havoc #t~post7; {11154#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-28 11:25:57,409 INFO L272 TraceCheckUtils]: 27: Hoare triple {11154#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {11076#true} is VALID [2022-04-28 11:25:57,409 INFO L290 TraceCheckUtils]: 28: Hoare triple {11076#true} ~cond := #in~cond; {11076#true} is VALID [2022-04-28 11:25:57,409 INFO L290 TraceCheckUtils]: 29: Hoare triple {11076#true} assume !(0 == ~cond); {11076#true} is VALID [2022-04-28 11:25:57,409 INFO L290 TraceCheckUtils]: 30: Hoare triple {11076#true} assume true; {11076#true} is VALID [2022-04-28 11:25:57,410 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {11076#true} {11154#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #83#return; {11154#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-28 11:25:57,410 INFO L272 TraceCheckUtils]: 32: Hoare triple {11154#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {11076#true} is VALID [2022-04-28 11:25:57,410 INFO L290 TraceCheckUtils]: 33: Hoare triple {11076#true} ~cond := #in~cond; {11076#true} is VALID [2022-04-28 11:25:57,410 INFO L290 TraceCheckUtils]: 34: Hoare triple {11076#true} assume !(0 == ~cond); {11076#true} is VALID [2022-04-28 11:25:57,410 INFO L290 TraceCheckUtils]: 35: Hoare triple {11076#true} assume true; {11076#true} is VALID [2022-04-28 11:25:57,412 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {11076#true} {11154#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #85#return; {11154#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-28 11:25:57,412 INFO L272 TraceCheckUtils]: 37: Hoare triple {11154#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {11076#true} is VALID [2022-04-28 11:25:57,412 INFO L290 TraceCheckUtils]: 38: Hoare triple {11076#true} ~cond := #in~cond; {11076#true} is VALID [2022-04-28 11:25:57,412 INFO L290 TraceCheckUtils]: 39: Hoare triple {11076#true} assume !(0 == ~cond); {11076#true} is VALID [2022-04-28 11:25:57,412 INFO L290 TraceCheckUtils]: 40: Hoare triple {11076#true} assume true; {11076#true} is VALID [2022-04-28 11:25:57,412 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {11076#true} {11154#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #87#return; {11154#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-28 11:25:57,413 INFO L290 TraceCheckUtils]: 42: Hoare triple {11154#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} assume !!(~r~0 >= 2 * ~b~0); {11154#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-28 11:25:57,413 INFO L272 TraceCheckUtils]: 43: Hoare triple {11154#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~r~0 >= 2 * ~y~0 * ~a~0 then 1 else 0)); {11076#true} is VALID [2022-04-28 11:25:57,413 INFO L290 TraceCheckUtils]: 44: Hoare triple {11076#true} ~cond := #in~cond; {11076#true} is VALID [2022-04-28 11:25:57,413 INFO L290 TraceCheckUtils]: 45: Hoare triple {11076#true} assume !(0 == ~cond); {11076#true} is VALID [2022-04-28 11:25:57,413 INFO L290 TraceCheckUtils]: 46: Hoare triple {11076#true} assume true; {11076#true} is VALID [2022-04-28 11:25:57,413 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {11076#true} {11154#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #89#return; {11154#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-28 11:25:57,414 INFO L290 TraceCheckUtils]: 48: Hoare triple {11154#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} ~a~0 := 2 * ~a~0;~b~0 := 2 * ~b~0; {11227#(and (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (= main_~q~0 0) (= main_~a~0 2))} is VALID [2022-04-28 11:25:57,414 INFO L290 TraceCheckUtils]: 49: Hoare triple {11227#(and (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (= main_~q~0 0) (= main_~a~0 2))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {11227#(and (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (= main_~q~0 0) (= main_~a~0 2))} is VALID [2022-04-28 11:25:57,414 INFO L290 TraceCheckUtils]: 50: Hoare triple {11227#(and (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (= main_~q~0 0) (= main_~a~0 2))} assume !!(#t~post7 < 20);havoc #t~post7; {11227#(and (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (= main_~q~0 0) (= main_~a~0 2))} is VALID [2022-04-28 11:25:57,414 INFO L272 TraceCheckUtils]: 51: Hoare triple {11227#(and (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (= main_~q~0 0) (= main_~a~0 2))} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {11076#true} is VALID [2022-04-28 11:25:57,414 INFO L290 TraceCheckUtils]: 52: Hoare triple {11076#true} ~cond := #in~cond; {11076#true} is VALID [2022-04-28 11:25:57,414 INFO L290 TraceCheckUtils]: 53: Hoare triple {11076#true} assume !(0 == ~cond); {11076#true} is VALID [2022-04-28 11:25:57,414 INFO L290 TraceCheckUtils]: 54: Hoare triple {11076#true} assume true; {11076#true} is VALID [2022-04-28 11:25:57,415 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {11076#true} {11227#(and (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (= main_~q~0 0) (= main_~a~0 2))} #83#return; {11227#(and (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (= main_~q~0 0) (= main_~a~0 2))} is VALID [2022-04-28 11:25:57,415 INFO L272 TraceCheckUtils]: 56: Hoare triple {11227#(and (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (= main_~q~0 0) (= main_~a~0 2))} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {11076#true} is VALID [2022-04-28 11:25:57,415 INFO L290 TraceCheckUtils]: 57: Hoare triple {11076#true} ~cond := #in~cond; {11076#true} is VALID [2022-04-28 11:25:57,415 INFO L290 TraceCheckUtils]: 58: Hoare triple {11076#true} assume !(0 == ~cond); {11076#true} is VALID [2022-04-28 11:25:57,415 INFO L290 TraceCheckUtils]: 59: Hoare triple {11076#true} assume true; {11076#true} is VALID [2022-04-28 11:25:57,415 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {11076#true} {11227#(and (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (= main_~q~0 0) (= main_~a~0 2))} #85#return; {11227#(and (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (= main_~q~0 0) (= main_~a~0 2))} is VALID [2022-04-28 11:25:57,415 INFO L272 TraceCheckUtils]: 61: Hoare triple {11227#(and (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (= main_~q~0 0) (= main_~a~0 2))} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {11076#true} is VALID [2022-04-28 11:25:57,416 INFO L290 TraceCheckUtils]: 62: Hoare triple {11076#true} ~cond := #in~cond; {11076#true} is VALID [2022-04-28 11:25:57,416 INFO L290 TraceCheckUtils]: 63: Hoare triple {11076#true} assume !(0 == ~cond); {11076#true} is VALID [2022-04-28 11:25:57,416 INFO L290 TraceCheckUtils]: 64: Hoare triple {11076#true} assume true; {11076#true} is VALID [2022-04-28 11:25:57,416 INFO L284 TraceCheckUtils]: 65: Hoare quadruple {11076#true} {11227#(and (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (= main_~q~0 0) (= main_~a~0 2))} #87#return; {11227#(and (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (= main_~q~0 0) (= main_~a~0 2))} is VALID [2022-04-28 11:25:57,416 INFO L290 TraceCheckUtils]: 66: Hoare triple {11227#(and (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (= main_~q~0 0) (= main_~a~0 2))} assume !!(~r~0 >= 2 * ~b~0); {11227#(and (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (= main_~q~0 0) (= main_~a~0 2))} is VALID [2022-04-28 11:25:57,416 INFO L272 TraceCheckUtils]: 67: Hoare triple {11227#(and (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (= main_~q~0 0) (= main_~a~0 2))} call __VERIFIER_assert((if ~r~0 >= 2 * ~y~0 * ~a~0 then 1 else 0)); {11076#true} is VALID [2022-04-28 11:25:57,416 INFO L290 TraceCheckUtils]: 68: Hoare triple {11076#true} ~cond := #in~cond; {11076#true} is VALID [2022-04-28 11:25:57,416 INFO L290 TraceCheckUtils]: 69: Hoare triple {11076#true} assume !(0 == ~cond); {11076#true} is VALID [2022-04-28 11:25:57,416 INFO L290 TraceCheckUtils]: 70: Hoare triple {11076#true} assume true; {11076#true} is VALID [2022-04-28 11:25:57,417 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {11076#true} {11227#(and (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (= main_~q~0 0) (= main_~a~0 2))} #89#return; {11227#(and (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (= main_~q~0 0) (= main_~a~0 2))} is VALID [2022-04-28 11:25:57,417 INFO L290 TraceCheckUtils]: 72: Hoare triple {11227#(and (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (= main_~q~0 0) (= main_~a~0 2))} ~a~0 := 2 * ~a~0;~b~0 := 2 * ~b~0; {11300#(and (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 4)) (= main_~q~0 0) (= main_~a~0 4))} is VALID [2022-04-28 11:25:57,418 INFO L290 TraceCheckUtils]: 73: Hoare triple {11300#(and (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 4)) (= main_~q~0 0) (= main_~a~0 4))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {11300#(and (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 4)) (= main_~q~0 0) (= main_~a~0 4))} is VALID [2022-04-28 11:25:57,418 INFO L290 TraceCheckUtils]: 74: Hoare triple {11300#(and (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 4)) (= main_~q~0 0) (= main_~a~0 4))} assume !(#t~post7 < 20);havoc #t~post7; {11300#(and (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 4)) (= main_~q~0 0) (= main_~a~0 4))} is VALID [2022-04-28 11:25:57,418 INFO L290 TraceCheckUtils]: 75: Hoare triple {11300#(and (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 4)) (= main_~q~0 0) (= main_~a~0 4))} ~r~0 := ~r~0 - ~b~0;~q~0 := ~q~0 + ~a~0; {11310#(and (= main_~x~0 (+ main_~r~0 (* main_~y~0 4))) (= main_~q~0 4))} is VALID [2022-04-28 11:25:57,419 INFO L290 TraceCheckUtils]: 76: Hoare triple {11310#(and (= main_~x~0 (+ main_~r~0 (* main_~y~0 4))) (= main_~q~0 4))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {11310#(and (= main_~x~0 (+ main_~r~0 (* main_~y~0 4))) (= main_~q~0 4))} is VALID [2022-04-28 11:25:57,419 INFO L290 TraceCheckUtils]: 77: Hoare triple {11310#(and (= main_~x~0 (+ main_~r~0 (* main_~y~0 4))) (= main_~q~0 4))} assume !(#t~post6 < 20);havoc #t~post6; {11310#(and (= main_~x~0 (+ main_~r~0 (* main_~y~0 4))) (= main_~q~0 4))} is VALID [2022-04-28 11:25:57,419 INFO L272 TraceCheckUtils]: 78: Hoare triple {11310#(and (= main_~x~0 (+ main_~r~0 (* main_~y~0 4))) (= main_~q~0 4))} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {11320#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:25:57,419 INFO L290 TraceCheckUtils]: 79: Hoare triple {11320#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {11324#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:25:57,420 INFO L290 TraceCheckUtils]: 80: Hoare triple {11324#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {11077#false} is VALID [2022-04-28 11:25:57,420 INFO L290 TraceCheckUtils]: 81: Hoare triple {11077#false} assume !false; {11077#false} is VALID [2022-04-28 11:25:57,420 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 20 proven. 14 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-04-28 11:25:57,420 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:26:19,223 INFO L290 TraceCheckUtils]: 81: Hoare triple {11077#false} assume !false; {11077#false} is VALID [2022-04-28 11:26:19,223 INFO L290 TraceCheckUtils]: 80: Hoare triple {11324#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {11077#false} is VALID [2022-04-28 11:26:19,224 INFO L290 TraceCheckUtils]: 79: Hoare triple {11320#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {11324#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:26:19,224 INFO L272 TraceCheckUtils]: 78: Hoare triple {11340#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {11320#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:26:19,225 INFO L290 TraceCheckUtils]: 77: Hoare triple {11340#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} assume !(#t~post6 < 20);havoc #t~post6; {11340#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:26:19,225 INFO L290 TraceCheckUtils]: 76: Hoare triple {11340#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {11340#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:26:19,246 INFO L290 TraceCheckUtils]: 75: Hoare triple {11350#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} ~r~0 := ~r~0 - ~b~0;~q~0 := ~q~0 + ~a~0; {11340#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:26:19,246 INFO L290 TraceCheckUtils]: 74: Hoare triple {11350#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} assume !(#t~post7 < 20);havoc #t~post7; {11350#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} is VALID [2022-04-28 11:26:19,247 INFO L290 TraceCheckUtils]: 73: Hoare triple {11350#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {11350#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} is VALID [2022-04-28 11:26:19,249 INFO L290 TraceCheckUtils]: 72: Hoare triple {11360#(= (+ (* (- 2) main_~b~0) (* (+ (* main_~a~0 2) main_~q~0) main_~y~0) main_~r~0) main_~x~0)} ~a~0 := 2 * ~a~0;~b~0 := 2 * ~b~0; {11350#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} is VALID [2022-04-28 11:26:19,250 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {11076#true} {11360#(= (+ (* (- 2) main_~b~0) (* (+ (* main_~a~0 2) main_~q~0) main_~y~0) main_~r~0) main_~x~0)} #89#return; {11360#(= (+ (* (- 2) main_~b~0) (* (+ (* main_~a~0 2) main_~q~0) main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:26:19,250 INFO L290 TraceCheckUtils]: 70: Hoare triple {11076#true} assume true; {11076#true} is VALID [2022-04-28 11:26:19,250 INFO L290 TraceCheckUtils]: 69: Hoare triple {11076#true} assume !(0 == ~cond); {11076#true} is VALID [2022-04-28 11:26:19,250 INFO L290 TraceCheckUtils]: 68: Hoare triple {11076#true} ~cond := #in~cond; {11076#true} is VALID [2022-04-28 11:26:19,250 INFO L272 TraceCheckUtils]: 67: Hoare triple {11360#(= (+ (* (- 2) main_~b~0) (* (+ (* main_~a~0 2) main_~q~0) main_~y~0) main_~r~0) main_~x~0)} call __VERIFIER_assert((if ~r~0 >= 2 * ~y~0 * ~a~0 then 1 else 0)); {11076#true} is VALID [2022-04-28 11:26:19,250 INFO L290 TraceCheckUtils]: 66: Hoare triple {11360#(= (+ (* (- 2) main_~b~0) (* (+ (* main_~a~0 2) main_~q~0) main_~y~0) main_~r~0) main_~x~0)} assume !!(~r~0 >= 2 * ~b~0); {11360#(= (+ (* (- 2) main_~b~0) (* (+ (* main_~a~0 2) main_~q~0) main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:26:19,251 INFO L284 TraceCheckUtils]: 65: Hoare quadruple {11076#true} {11360#(= (+ (* (- 2) main_~b~0) (* (+ (* main_~a~0 2) main_~q~0) main_~y~0) main_~r~0) main_~x~0)} #87#return; {11360#(= (+ (* (- 2) main_~b~0) (* (+ (* main_~a~0 2) main_~q~0) main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:26:19,251 INFO L290 TraceCheckUtils]: 64: Hoare triple {11076#true} assume true; {11076#true} is VALID [2022-04-28 11:26:19,251 INFO L290 TraceCheckUtils]: 63: Hoare triple {11076#true} assume !(0 == ~cond); {11076#true} is VALID [2022-04-28 11:26:19,251 INFO L290 TraceCheckUtils]: 62: Hoare triple {11076#true} ~cond := #in~cond; {11076#true} is VALID [2022-04-28 11:26:19,251 INFO L272 TraceCheckUtils]: 61: Hoare triple {11360#(= (+ (* (- 2) main_~b~0) (* (+ (* main_~a~0 2) main_~q~0) main_~y~0) main_~r~0) main_~x~0)} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {11076#true} is VALID [2022-04-28 11:26:19,251 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {11076#true} {11360#(= (+ (* (- 2) main_~b~0) (* (+ (* main_~a~0 2) main_~q~0) main_~y~0) main_~r~0) main_~x~0)} #85#return; {11360#(= (+ (* (- 2) main_~b~0) (* (+ (* main_~a~0 2) main_~q~0) main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:26:19,251 INFO L290 TraceCheckUtils]: 59: Hoare triple {11076#true} assume true; {11076#true} is VALID [2022-04-28 11:26:19,252 INFO L290 TraceCheckUtils]: 58: Hoare triple {11076#true} assume !(0 == ~cond); {11076#true} is VALID [2022-04-28 11:26:19,252 INFO L290 TraceCheckUtils]: 57: Hoare triple {11076#true} ~cond := #in~cond; {11076#true} is VALID [2022-04-28 11:26:19,252 INFO L272 TraceCheckUtils]: 56: Hoare triple {11360#(= (+ (* (- 2) main_~b~0) (* (+ (* main_~a~0 2) main_~q~0) main_~y~0) main_~r~0) main_~x~0)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {11076#true} is VALID [2022-04-28 11:26:19,252 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {11076#true} {11360#(= (+ (* (- 2) main_~b~0) (* (+ (* main_~a~0 2) main_~q~0) main_~y~0) main_~r~0) main_~x~0)} #83#return; {11360#(= (+ (* (- 2) main_~b~0) (* (+ (* main_~a~0 2) main_~q~0) main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:26:19,252 INFO L290 TraceCheckUtils]: 54: Hoare triple {11076#true} assume true; {11076#true} is VALID [2022-04-28 11:26:19,252 INFO L290 TraceCheckUtils]: 53: Hoare triple {11076#true} assume !(0 == ~cond); {11076#true} is VALID [2022-04-28 11:26:19,252 INFO L290 TraceCheckUtils]: 52: Hoare triple {11076#true} ~cond := #in~cond; {11076#true} is VALID [2022-04-28 11:26:19,252 INFO L272 TraceCheckUtils]: 51: Hoare triple {11360#(= (+ (* (- 2) main_~b~0) (* (+ (* main_~a~0 2) main_~q~0) main_~y~0) main_~r~0) main_~x~0)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {11076#true} is VALID [2022-04-28 11:26:19,253 INFO L290 TraceCheckUtils]: 50: Hoare triple {11360#(= (+ (* (- 2) main_~b~0) (* (+ (* main_~a~0 2) main_~q~0) main_~y~0) main_~r~0) main_~x~0)} assume !!(#t~post7 < 20);havoc #t~post7; {11360#(= (+ (* (- 2) main_~b~0) (* (+ (* main_~a~0 2) main_~q~0) main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:26:19,253 INFO L290 TraceCheckUtils]: 49: Hoare triple {11360#(= (+ (* (- 2) main_~b~0) (* (+ (* main_~a~0 2) main_~q~0) main_~y~0) main_~r~0) main_~x~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {11360#(= (+ (* (- 2) main_~b~0) (* (+ (* main_~a~0 2) main_~q~0) main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:26:19,255 INFO L290 TraceCheckUtils]: 48: Hoare triple {11433#(= (+ (* main_~b~0 (- 4)) main_~r~0 (* main_~y~0 (+ (* main_~a~0 4) main_~q~0))) main_~x~0)} ~a~0 := 2 * ~a~0;~b~0 := 2 * ~b~0; {11360#(= (+ (* (- 2) main_~b~0) (* (+ (* main_~a~0 2) main_~q~0) main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:26:19,256 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {11076#true} {11433#(= (+ (* main_~b~0 (- 4)) main_~r~0 (* main_~y~0 (+ (* main_~a~0 4) main_~q~0))) main_~x~0)} #89#return; {11433#(= (+ (* main_~b~0 (- 4)) main_~r~0 (* main_~y~0 (+ (* main_~a~0 4) main_~q~0))) main_~x~0)} is VALID [2022-04-28 11:26:19,256 INFO L290 TraceCheckUtils]: 46: Hoare triple {11076#true} assume true; {11076#true} is VALID [2022-04-28 11:26:19,256 INFO L290 TraceCheckUtils]: 45: Hoare triple {11076#true} assume !(0 == ~cond); {11076#true} is VALID [2022-04-28 11:26:19,256 INFO L290 TraceCheckUtils]: 44: Hoare triple {11076#true} ~cond := #in~cond; {11076#true} is VALID [2022-04-28 11:26:19,256 INFO L272 TraceCheckUtils]: 43: Hoare triple {11433#(= (+ (* main_~b~0 (- 4)) main_~r~0 (* main_~y~0 (+ (* main_~a~0 4) main_~q~0))) main_~x~0)} call __VERIFIER_assert((if ~r~0 >= 2 * ~y~0 * ~a~0 then 1 else 0)); {11076#true} is VALID [2022-04-28 11:26:19,256 INFO L290 TraceCheckUtils]: 42: Hoare triple {11433#(= (+ (* main_~b~0 (- 4)) main_~r~0 (* main_~y~0 (+ (* main_~a~0 4) main_~q~0))) main_~x~0)} assume !!(~r~0 >= 2 * ~b~0); {11433#(= (+ (* main_~b~0 (- 4)) main_~r~0 (* main_~y~0 (+ (* main_~a~0 4) main_~q~0))) main_~x~0)} is VALID [2022-04-28 11:26:19,257 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {11076#true} {11433#(= (+ (* main_~b~0 (- 4)) main_~r~0 (* main_~y~0 (+ (* main_~a~0 4) main_~q~0))) main_~x~0)} #87#return; {11433#(= (+ (* main_~b~0 (- 4)) main_~r~0 (* main_~y~0 (+ (* main_~a~0 4) main_~q~0))) main_~x~0)} is VALID [2022-04-28 11:26:19,257 INFO L290 TraceCheckUtils]: 40: Hoare triple {11076#true} assume true; {11076#true} is VALID [2022-04-28 11:26:19,257 INFO L290 TraceCheckUtils]: 39: Hoare triple {11076#true} assume !(0 == ~cond); {11076#true} is VALID [2022-04-28 11:26:19,257 INFO L290 TraceCheckUtils]: 38: Hoare triple {11076#true} ~cond := #in~cond; {11076#true} is VALID [2022-04-28 11:26:19,257 INFO L272 TraceCheckUtils]: 37: Hoare triple {11433#(= (+ (* main_~b~0 (- 4)) main_~r~0 (* main_~y~0 (+ (* main_~a~0 4) main_~q~0))) main_~x~0)} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {11076#true} is VALID [2022-04-28 11:26:19,257 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {11076#true} {11433#(= (+ (* main_~b~0 (- 4)) main_~r~0 (* main_~y~0 (+ (* main_~a~0 4) main_~q~0))) main_~x~0)} #85#return; {11433#(= (+ (* main_~b~0 (- 4)) main_~r~0 (* main_~y~0 (+ (* main_~a~0 4) main_~q~0))) main_~x~0)} is VALID [2022-04-28 11:26:19,257 INFO L290 TraceCheckUtils]: 35: Hoare triple {11076#true} assume true; {11076#true} is VALID [2022-04-28 11:26:19,258 INFO L290 TraceCheckUtils]: 34: Hoare triple {11076#true} assume !(0 == ~cond); {11076#true} is VALID [2022-04-28 11:26:19,258 INFO L290 TraceCheckUtils]: 33: Hoare triple {11076#true} ~cond := #in~cond; {11076#true} is VALID [2022-04-28 11:26:19,258 INFO L272 TraceCheckUtils]: 32: Hoare triple {11433#(= (+ (* main_~b~0 (- 4)) main_~r~0 (* main_~y~0 (+ (* main_~a~0 4) main_~q~0))) main_~x~0)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {11076#true} is VALID [2022-04-28 11:26:19,258 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {11076#true} {11433#(= (+ (* main_~b~0 (- 4)) main_~r~0 (* main_~y~0 (+ (* main_~a~0 4) main_~q~0))) main_~x~0)} #83#return; {11433#(= (+ (* main_~b~0 (- 4)) main_~r~0 (* main_~y~0 (+ (* main_~a~0 4) main_~q~0))) main_~x~0)} is VALID [2022-04-28 11:26:19,258 INFO L290 TraceCheckUtils]: 30: Hoare triple {11076#true} assume true; {11076#true} is VALID [2022-04-28 11:26:19,258 INFO L290 TraceCheckUtils]: 29: Hoare triple {11076#true} assume !(0 == ~cond); {11076#true} is VALID [2022-04-28 11:26:19,258 INFO L290 TraceCheckUtils]: 28: Hoare triple {11076#true} ~cond := #in~cond; {11076#true} is VALID [2022-04-28 11:26:19,258 INFO L272 TraceCheckUtils]: 27: Hoare triple {11433#(= (+ (* main_~b~0 (- 4)) main_~r~0 (* main_~y~0 (+ (* main_~a~0 4) main_~q~0))) main_~x~0)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {11076#true} is VALID [2022-04-28 11:26:19,259 INFO L290 TraceCheckUtils]: 26: Hoare triple {11433#(= (+ (* main_~b~0 (- 4)) main_~r~0 (* main_~y~0 (+ (* main_~a~0 4) main_~q~0))) main_~x~0)} assume !!(#t~post7 < 20);havoc #t~post7; {11433#(= (+ (* main_~b~0 (- 4)) main_~r~0 (* main_~y~0 (+ (* main_~a~0 4) main_~q~0))) main_~x~0)} is VALID [2022-04-28 11:26:19,259 INFO L290 TraceCheckUtils]: 25: Hoare triple {11433#(= (+ (* main_~b~0 (- 4)) main_~r~0 (* main_~y~0 (+ (* main_~a~0 4) main_~q~0))) main_~x~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {11433#(= (+ (* main_~b~0 (- 4)) main_~r~0 (* main_~y~0 (+ (* main_~a~0 4) main_~q~0))) main_~x~0)} is VALID [2022-04-28 11:26:19,259 INFO L290 TraceCheckUtils]: 24: Hoare triple {11114#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {11433#(= (+ (* main_~b~0 (- 4)) main_~r~0 (* main_~y~0 (+ (* main_~a~0 4) main_~q~0))) main_~x~0)} is VALID [2022-04-28 11:26:19,260 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {11076#true} {11114#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #81#return; {11114#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:26:19,260 INFO L290 TraceCheckUtils]: 22: Hoare triple {11076#true} assume true; {11076#true} is VALID [2022-04-28 11:26:19,260 INFO L290 TraceCheckUtils]: 21: Hoare triple {11076#true} assume !(0 == ~cond); {11076#true} is VALID [2022-04-28 11:26:19,260 INFO L290 TraceCheckUtils]: 20: Hoare triple {11076#true} ~cond := #in~cond; {11076#true} is VALID [2022-04-28 11:26:19,260 INFO L272 TraceCheckUtils]: 19: Hoare triple {11114#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {11076#true} is VALID [2022-04-28 11:26:19,260 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {11076#true} {11114#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #79#return; {11114#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:26:19,260 INFO L290 TraceCheckUtils]: 17: Hoare triple {11076#true} assume true; {11076#true} is VALID [2022-04-28 11:26:19,260 INFO L290 TraceCheckUtils]: 16: Hoare triple {11076#true} assume !(0 == ~cond); {11076#true} is VALID [2022-04-28 11:26:19,260 INFO L290 TraceCheckUtils]: 15: Hoare triple {11076#true} ~cond := #in~cond; {11076#true} is VALID [2022-04-28 11:26:19,261 INFO L272 TraceCheckUtils]: 14: Hoare triple {11114#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {11076#true} is VALID [2022-04-28 11:26:19,261 INFO L290 TraceCheckUtils]: 13: Hoare triple {11114#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} assume !!(#t~post6 < 20);havoc #t~post6; {11114#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:26:19,261 INFO L290 TraceCheckUtils]: 12: Hoare triple {11114#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {11114#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:26:19,261 INFO L290 TraceCheckUtils]: 11: Hoare triple {11076#true} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {11114#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:26:19,261 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {11076#true} {11076#true} #77#return; {11076#true} is VALID [2022-04-28 11:26:19,262 INFO L290 TraceCheckUtils]: 9: Hoare triple {11076#true} assume true; {11076#true} is VALID [2022-04-28 11:26:19,262 INFO L290 TraceCheckUtils]: 8: Hoare triple {11076#true} assume !(0 == ~cond); {11076#true} is VALID [2022-04-28 11:26:19,262 INFO L290 TraceCheckUtils]: 7: Hoare triple {11076#true} ~cond := #in~cond; {11076#true} is VALID [2022-04-28 11:26:19,262 INFO L272 TraceCheckUtils]: 6: Hoare triple {11076#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {11076#true} is VALID [2022-04-28 11:26:19,262 INFO L290 TraceCheckUtils]: 5: Hoare triple {11076#true} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~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; {11076#true} is VALID [2022-04-28 11:26:19,262 INFO L272 TraceCheckUtils]: 4: Hoare triple {11076#true} call #t~ret8 := main(); {11076#true} is VALID [2022-04-28 11:26:19,262 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11076#true} {11076#true} #93#return; {11076#true} is VALID [2022-04-28 11:26:19,262 INFO L290 TraceCheckUtils]: 2: Hoare triple {11076#true} assume true; {11076#true} is VALID [2022-04-28 11:26:19,262 INFO L290 TraceCheckUtils]: 1: Hoare triple {11076#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(14, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {11076#true} is VALID [2022-04-28 11:26:19,262 INFO L272 TraceCheckUtils]: 0: Hoare triple {11076#true} call ULTIMATE.init(); {11076#true} is VALID [2022-04-28 11:26:19,262 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 20 proven. 14 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-04-28 11:26:19,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:26:19,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190416401] [2022-04-28 11:26:19,263 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:26:19,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [596259395] [2022-04-28 11:26:19,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [596259395] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 11:26:19,263 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 11:26:19,263 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2022-04-28 11:26:19,263 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:26:19,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [847176507] [2022-04-28 11:26:19,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [847176507] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:26:19,263 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:26:19,263 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 11:26:19,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168182686] [2022-04-28 11:26:19,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:26:19,264 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 8 states have internal predecessors, (29), 5 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) Word has length 82 [2022-04-28 11:26:19,264 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:26:19,264 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 8 states have internal predecessors, (29), 5 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2022-04-28 11:26:19,305 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:26:19,305 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 11:26:19,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:26:19,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 11:26:19,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2022-04-28 11:26:19,306 INFO L87 Difference]: Start difference. First operand 153 states and 188 transitions. Second operand has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 8 states have internal predecessors, (29), 5 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2022-04-28 11:26:20,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:26:20,212 INFO L93 Difference]: Finished difference Result 201 states and 254 transitions. [2022-04-28 11:26:20,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 11:26:20,213 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 8 states have internal predecessors, (29), 5 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) Word has length 82 [2022-04-28 11:26:20,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:26:20,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 8 states have internal predecessors, (29), 5 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2022-04-28 11:26:20,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 135 transitions. [2022-04-28 11:26:20,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 8 states have internal predecessors, (29), 5 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2022-04-28 11:26:20,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 135 transitions. [2022-04-28 11:26:20,216 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 135 transitions. [2022-04-28 11:26:20,345 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 135 edges. 135 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:26:20,348 INFO L225 Difference]: With dead ends: 201 [2022-04-28 11:26:20,348 INFO L226 Difference]: Without dead ends: 198 [2022-04-28 11:26:20,348 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 150 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2022-04-28 11:26:20,349 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 37 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 11:26:20,349 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 266 Invalid, 304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 11:26:20,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2022-04-28 11:26:20,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 168. [2022-04-28 11:26:20,517 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:26:20,517 INFO L82 GeneralOperation]: Start isEquivalent. First operand 198 states. Second operand has 168 states, 106 states have (on average 1.169811320754717) internal successors, (124), 108 states have internal predecessors, (124), 42 states have call successors, (42), 20 states have call predecessors, (42), 19 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) [2022-04-28 11:26:20,517 INFO L74 IsIncluded]: Start isIncluded. First operand 198 states. Second operand has 168 states, 106 states have (on average 1.169811320754717) internal successors, (124), 108 states have internal predecessors, (124), 42 states have call successors, (42), 20 states have call predecessors, (42), 19 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) [2022-04-28 11:26:20,517 INFO L87 Difference]: Start difference. First operand 198 states. Second operand has 168 states, 106 states have (on average 1.169811320754717) internal successors, (124), 108 states have internal predecessors, (124), 42 states have call successors, (42), 20 states have call predecessors, (42), 19 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) [2022-04-28 11:26:20,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:26:20,522 INFO L93 Difference]: Finished difference Result 198 states and 249 transitions. [2022-04-28 11:26:20,522 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 249 transitions. [2022-04-28 11:26:20,522 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:26:20,522 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:26:20,522 INFO L74 IsIncluded]: Start isIncluded. First operand has 168 states, 106 states have (on average 1.169811320754717) internal successors, (124), 108 states have internal predecessors, (124), 42 states have call successors, (42), 20 states have call predecessors, (42), 19 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) Second operand 198 states. [2022-04-28 11:26:20,523 INFO L87 Difference]: Start difference. First operand has 168 states, 106 states have (on average 1.169811320754717) internal successors, (124), 108 states have internal predecessors, (124), 42 states have call successors, (42), 20 states have call predecessors, (42), 19 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) Second operand 198 states. [2022-04-28 11:26:20,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:26:20,526 INFO L93 Difference]: Finished difference Result 198 states and 249 transitions. [2022-04-28 11:26:20,526 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 249 transitions. [2022-04-28 11:26:20,527 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:26:20,527 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:26:20,527 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:26:20,527 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:26:20,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 106 states have (on average 1.169811320754717) internal successors, (124), 108 states have internal predecessors, (124), 42 states have call successors, (42), 20 states have call predecessors, (42), 19 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) [2022-04-28 11:26:20,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 206 transitions. [2022-04-28 11:26:20,530 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 206 transitions. Word has length 82 [2022-04-28 11:26:20,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:26:20,530 INFO L495 AbstractCegarLoop]: Abstraction has 168 states and 206 transitions. [2022-04-28 11:26:20,531 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 8 states have internal predecessors, (29), 5 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2022-04-28 11:26:20,531 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 168 states and 206 transitions. [2022-04-28 11:26:20,807 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 206 edges. 206 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:26:20,808 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 206 transitions. [2022-04-28 11:26:20,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-04-28 11:26:20,808 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:26:20,808 INFO L195 NwaCegarLoop]: trace histogram [12, 11, 11, 3, 3, 2, 2, 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] [2022-04-28 11:26:20,841 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-28 11:26:21,009 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-28 11:26:21,009 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:26:21,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:26:21,010 INFO L85 PathProgramCache]: Analyzing trace with hash 1891783602, now seen corresponding path program 1 times [2022-04-28 11:26:21,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:26:21,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2088474626] [2022-04-28 11:26:45,538 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:26:45,538 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:26:45,538 INFO L85 PathProgramCache]: Analyzing trace with hash 1891783602, now seen corresponding path program 2 times [2022-04-28 11:26:45,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:26:45,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588357897] [2022-04-28 11:26:45,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:26:45,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:26:45,555 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:26:45,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [488349313] [2022-04-28 11:26:45,556 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:26:45,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:26:45,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:26:45,557 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-28 11:26:45,557 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-28 11:26:45,617 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 11:26:45,617 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:26:45,618 INFO L263 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-28 11:26:45,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:26:45,632 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:26:46,003 INFO L272 TraceCheckUtils]: 0: Hoare triple {12716#true} call ULTIMATE.init(); {12716#true} is VALID [2022-04-28 11:26:46,003 INFO L290 TraceCheckUtils]: 1: Hoare triple {12716#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(14, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {12724#(<= ~counter~0 0)} is VALID [2022-04-28 11:26:46,003 INFO L290 TraceCheckUtils]: 2: Hoare triple {12724#(<= ~counter~0 0)} assume true; {12724#(<= ~counter~0 0)} is VALID [2022-04-28 11:26:46,004 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12724#(<= ~counter~0 0)} {12716#true} #93#return; {12724#(<= ~counter~0 0)} is VALID [2022-04-28 11:26:46,004 INFO L272 TraceCheckUtils]: 4: Hoare triple {12724#(<= ~counter~0 0)} call #t~ret8 := main(); {12724#(<= ~counter~0 0)} is VALID [2022-04-28 11:26:46,004 INFO L290 TraceCheckUtils]: 5: Hoare triple {12724#(<= ~counter~0 0)} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~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; {12724#(<= ~counter~0 0)} is VALID [2022-04-28 11:26:46,005 INFO L272 TraceCheckUtils]: 6: Hoare triple {12724#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {12724#(<= ~counter~0 0)} is VALID [2022-04-28 11:26:46,005 INFO L290 TraceCheckUtils]: 7: Hoare triple {12724#(<= ~counter~0 0)} ~cond := #in~cond; {12724#(<= ~counter~0 0)} is VALID [2022-04-28 11:26:46,005 INFO L290 TraceCheckUtils]: 8: Hoare triple {12724#(<= ~counter~0 0)} assume !(0 == ~cond); {12724#(<= ~counter~0 0)} is VALID [2022-04-28 11:26:46,005 INFO L290 TraceCheckUtils]: 9: Hoare triple {12724#(<= ~counter~0 0)} assume true; {12724#(<= ~counter~0 0)} is VALID [2022-04-28 11:26:46,006 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {12724#(<= ~counter~0 0)} {12724#(<= ~counter~0 0)} #77#return; {12724#(<= ~counter~0 0)} is VALID [2022-04-28 11:26:46,006 INFO L290 TraceCheckUtils]: 11: Hoare triple {12724#(<= ~counter~0 0)} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {12724#(<= ~counter~0 0)} is VALID [2022-04-28 11:26:46,007 INFO L290 TraceCheckUtils]: 12: Hoare triple {12724#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12758#(<= ~counter~0 1)} is VALID [2022-04-28 11:26:46,007 INFO L290 TraceCheckUtils]: 13: Hoare triple {12758#(<= ~counter~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {12758#(<= ~counter~0 1)} is VALID [2022-04-28 11:26:46,007 INFO L272 TraceCheckUtils]: 14: Hoare triple {12758#(<= ~counter~0 1)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {12758#(<= ~counter~0 1)} is VALID [2022-04-28 11:26:46,008 INFO L290 TraceCheckUtils]: 15: Hoare triple {12758#(<= ~counter~0 1)} ~cond := #in~cond; {12758#(<= ~counter~0 1)} is VALID [2022-04-28 11:26:46,008 INFO L290 TraceCheckUtils]: 16: Hoare triple {12758#(<= ~counter~0 1)} assume !(0 == ~cond); {12758#(<= ~counter~0 1)} is VALID [2022-04-28 11:26:46,008 INFO L290 TraceCheckUtils]: 17: Hoare triple {12758#(<= ~counter~0 1)} assume true; {12758#(<= ~counter~0 1)} is VALID [2022-04-28 11:26:46,009 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {12758#(<= ~counter~0 1)} {12758#(<= ~counter~0 1)} #79#return; {12758#(<= ~counter~0 1)} is VALID [2022-04-28 11:26:46,009 INFO L272 TraceCheckUtils]: 19: Hoare triple {12758#(<= ~counter~0 1)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {12758#(<= ~counter~0 1)} is VALID [2022-04-28 11:26:46,009 INFO L290 TraceCheckUtils]: 20: Hoare triple {12758#(<= ~counter~0 1)} ~cond := #in~cond; {12758#(<= ~counter~0 1)} is VALID [2022-04-28 11:26:46,010 INFO L290 TraceCheckUtils]: 21: Hoare triple {12758#(<= ~counter~0 1)} assume !(0 == ~cond); {12758#(<= ~counter~0 1)} is VALID [2022-04-28 11:26:46,010 INFO L290 TraceCheckUtils]: 22: Hoare triple {12758#(<= ~counter~0 1)} assume true; {12758#(<= ~counter~0 1)} is VALID [2022-04-28 11:26:46,010 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {12758#(<= ~counter~0 1)} {12758#(<= ~counter~0 1)} #81#return; {12758#(<= ~counter~0 1)} is VALID [2022-04-28 11:26:46,011 INFO L290 TraceCheckUtils]: 24: Hoare triple {12758#(<= ~counter~0 1)} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {12758#(<= ~counter~0 1)} is VALID [2022-04-28 11:26:46,011 INFO L290 TraceCheckUtils]: 25: Hoare triple {12758#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {12798#(<= ~counter~0 2)} is VALID [2022-04-28 11:26:46,011 INFO L290 TraceCheckUtils]: 26: Hoare triple {12798#(<= ~counter~0 2)} assume !!(#t~post7 < 20);havoc #t~post7; {12798#(<= ~counter~0 2)} is VALID [2022-04-28 11:26:46,012 INFO L272 TraceCheckUtils]: 27: Hoare triple {12798#(<= ~counter~0 2)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {12798#(<= ~counter~0 2)} is VALID [2022-04-28 11:26:46,012 INFO L290 TraceCheckUtils]: 28: Hoare triple {12798#(<= ~counter~0 2)} ~cond := #in~cond; {12798#(<= ~counter~0 2)} is VALID [2022-04-28 11:26:46,012 INFO L290 TraceCheckUtils]: 29: Hoare triple {12798#(<= ~counter~0 2)} assume !(0 == ~cond); {12798#(<= ~counter~0 2)} is VALID [2022-04-28 11:26:46,013 INFO L290 TraceCheckUtils]: 30: Hoare triple {12798#(<= ~counter~0 2)} assume true; {12798#(<= ~counter~0 2)} is VALID [2022-04-28 11:26:46,013 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {12798#(<= ~counter~0 2)} {12798#(<= ~counter~0 2)} #83#return; {12798#(<= ~counter~0 2)} is VALID [2022-04-28 11:26:46,013 INFO L272 TraceCheckUtils]: 32: Hoare triple {12798#(<= ~counter~0 2)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {12798#(<= ~counter~0 2)} is VALID [2022-04-28 11:26:46,014 INFO L290 TraceCheckUtils]: 33: Hoare triple {12798#(<= ~counter~0 2)} ~cond := #in~cond; {12798#(<= ~counter~0 2)} is VALID [2022-04-28 11:26:46,014 INFO L290 TraceCheckUtils]: 34: Hoare triple {12798#(<= ~counter~0 2)} assume !(0 == ~cond); {12798#(<= ~counter~0 2)} is VALID [2022-04-28 11:26:46,014 INFO L290 TraceCheckUtils]: 35: Hoare triple {12798#(<= ~counter~0 2)} assume true; {12798#(<= ~counter~0 2)} is VALID [2022-04-28 11:26:46,015 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {12798#(<= ~counter~0 2)} {12798#(<= ~counter~0 2)} #85#return; {12798#(<= ~counter~0 2)} is VALID [2022-04-28 11:26:46,015 INFO L272 TraceCheckUtils]: 37: Hoare triple {12798#(<= ~counter~0 2)} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {12798#(<= ~counter~0 2)} is VALID [2022-04-28 11:26:46,015 INFO L290 TraceCheckUtils]: 38: Hoare triple {12798#(<= ~counter~0 2)} ~cond := #in~cond; {12798#(<= ~counter~0 2)} is VALID [2022-04-28 11:26:46,016 INFO L290 TraceCheckUtils]: 39: Hoare triple {12798#(<= ~counter~0 2)} assume !(0 == ~cond); {12798#(<= ~counter~0 2)} is VALID [2022-04-28 11:26:46,016 INFO L290 TraceCheckUtils]: 40: Hoare triple {12798#(<= ~counter~0 2)} assume true; {12798#(<= ~counter~0 2)} is VALID [2022-04-28 11:26:46,016 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {12798#(<= ~counter~0 2)} {12798#(<= ~counter~0 2)} #87#return; {12798#(<= ~counter~0 2)} is VALID [2022-04-28 11:26:46,017 INFO L290 TraceCheckUtils]: 42: Hoare triple {12798#(<= ~counter~0 2)} assume !!(~r~0 >= 2 * ~b~0); {12798#(<= ~counter~0 2)} is VALID [2022-04-28 11:26:46,017 INFO L272 TraceCheckUtils]: 43: Hoare triple {12798#(<= ~counter~0 2)} call __VERIFIER_assert((if ~r~0 >= 2 * ~y~0 * ~a~0 then 1 else 0)); {12798#(<= ~counter~0 2)} is VALID [2022-04-28 11:26:46,017 INFO L290 TraceCheckUtils]: 44: Hoare triple {12798#(<= ~counter~0 2)} ~cond := #in~cond; {12798#(<= ~counter~0 2)} is VALID [2022-04-28 11:26:46,017 INFO L290 TraceCheckUtils]: 45: Hoare triple {12798#(<= ~counter~0 2)} assume !(0 == ~cond); {12798#(<= ~counter~0 2)} is VALID [2022-04-28 11:26:46,018 INFO L290 TraceCheckUtils]: 46: Hoare triple {12798#(<= ~counter~0 2)} assume true; {12798#(<= ~counter~0 2)} is VALID [2022-04-28 11:26:46,021 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {12798#(<= ~counter~0 2)} {12798#(<= ~counter~0 2)} #89#return; {12798#(<= ~counter~0 2)} is VALID [2022-04-28 11:26:46,027 INFO L290 TraceCheckUtils]: 48: Hoare triple {12798#(<= ~counter~0 2)} ~a~0 := 2 * ~a~0;~b~0 := 2 * ~b~0; {12798#(<= ~counter~0 2)} is VALID [2022-04-28 11:26:46,027 INFO L290 TraceCheckUtils]: 49: Hoare triple {12798#(<= ~counter~0 2)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {12871#(<= ~counter~0 3)} is VALID [2022-04-28 11:26:46,028 INFO L290 TraceCheckUtils]: 50: Hoare triple {12871#(<= ~counter~0 3)} assume !!(#t~post7 < 20);havoc #t~post7; {12871#(<= ~counter~0 3)} is VALID [2022-04-28 11:26:46,028 INFO L272 TraceCheckUtils]: 51: Hoare triple {12871#(<= ~counter~0 3)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {12871#(<= ~counter~0 3)} is VALID [2022-04-28 11:26:46,028 INFO L290 TraceCheckUtils]: 52: Hoare triple {12871#(<= ~counter~0 3)} ~cond := #in~cond; {12871#(<= ~counter~0 3)} is VALID [2022-04-28 11:26:46,029 INFO L290 TraceCheckUtils]: 53: Hoare triple {12871#(<= ~counter~0 3)} assume !(0 == ~cond); {12871#(<= ~counter~0 3)} is VALID [2022-04-28 11:26:46,029 INFO L290 TraceCheckUtils]: 54: Hoare triple {12871#(<= ~counter~0 3)} assume true; {12871#(<= ~counter~0 3)} is VALID [2022-04-28 11:26:46,029 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {12871#(<= ~counter~0 3)} {12871#(<= ~counter~0 3)} #83#return; {12871#(<= ~counter~0 3)} is VALID [2022-04-28 11:26:46,030 INFO L272 TraceCheckUtils]: 56: Hoare triple {12871#(<= ~counter~0 3)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {12871#(<= ~counter~0 3)} is VALID [2022-04-28 11:26:46,030 INFO L290 TraceCheckUtils]: 57: Hoare triple {12871#(<= ~counter~0 3)} ~cond := #in~cond; {12871#(<= ~counter~0 3)} is VALID [2022-04-28 11:26:46,030 INFO L290 TraceCheckUtils]: 58: Hoare triple {12871#(<= ~counter~0 3)} assume !(0 == ~cond); {12871#(<= ~counter~0 3)} is VALID [2022-04-28 11:26:46,031 INFO L290 TraceCheckUtils]: 59: Hoare triple {12871#(<= ~counter~0 3)} assume true; {12871#(<= ~counter~0 3)} is VALID [2022-04-28 11:26:46,031 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {12871#(<= ~counter~0 3)} {12871#(<= ~counter~0 3)} #85#return; {12871#(<= ~counter~0 3)} is VALID [2022-04-28 11:26:46,031 INFO L272 TraceCheckUtils]: 61: Hoare triple {12871#(<= ~counter~0 3)} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {12871#(<= ~counter~0 3)} is VALID [2022-04-28 11:26:46,032 INFO L290 TraceCheckUtils]: 62: Hoare triple {12871#(<= ~counter~0 3)} ~cond := #in~cond; {12871#(<= ~counter~0 3)} is VALID [2022-04-28 11:26:46,032 INFO L290 TraceCheckUtils]: 63: Hoare triple {12871#(<= ~counter~0 3)} assume !(0 == ~cond); {12871#(<= ~counter~0 3)} is VALID [2022-04-28 11:26:46,032 INFO L290 TraceCheckUtils]: 64: Hoare triple {12871#(<= ~counter~0 3)} assume true; {12871#(<= ~counter~0 3)} is VALID [2022-04-28 11:26:46,033 INFO L284 TraceCheckUtils]: 65: Hoare quadruple {12871#(<= ~counter~0 3)} {12871#(<= ~counter~0 3)} #87#return; {12871#(<= ~counter~0 3)} is VALID [2022-04-28 11:26:46,033 INFO L290 TraceCheckUtils]: 66: Hoare triple {12871#(<= ~counter~0 3)} assume !(~r~0 >= 2 * ~b~0); {12871#(<= ~counter~0 3)} is VALID [2022-04-28 11:26:46,033 INFO L290 TraceCheckUtils]: 67: Hoare triple {12871#(<= ~counter~0 3)} ~r~0 := ~r~0 - ~b~0;~q~0 := ~q~0 + ~a~0; {12871#(<= ~counter~0 3)} is VALID [2022-04-28 11:26:46,033 INFO L290 TraceCheckUtils]: 68: Hoare triple {12871#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12929#(<= ~counter~0 4)} is VALID [2022-04-28 11:26:46,034 INFO L290 TraceCheckUtils]: 69: Hoare triple {12929#(<= ~counter~0 4)} assume !!(#t~post6 < 20);havoc #t~post6; {12929#(<= ~counter~0 4)} is VALID [2022-04-28 11:26:46,034 INFO L272 TraceCheckUtils]: 70: Hoare triple {12929#(<= ~counter~0 4)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {12929#(<= ~counter~0 4)} is VALID [2022-04-28 11:26:46,034 INFO L290 TraceCheckUtils]: 71: Hoare triple {12929#(<= ~counter~0 4)} ~cond := #in~cond; {12929#(<= ~counter~0 4)} is VALID [2022-04-28 11:26:46,035 INFO L290 TraceCheckUtils]: 72: Hoare triple {12929#(<= ~counter~0 4)} assume !(0 == ~cond); {12929#(<= ~counter~0 4)} is VALID [2022-04-28 11:26:46,035 INFO L290 TraceCheckUtils]: 73: Hoare triple {12929#(<= ~counter~0 4)} assume true; {12929#(<= ~counter~0 4)} is VALID [2022-04-28 11:26:46,035 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {12929#(<= ~counter~0 4)} {12929#(<= ~counter~0 4)} #79#return; {12929#(<= ~counter~0 4)} is VALID [2022-04-28 11:26:46,036 INFO L272 TraceCheckUtils]: 75: Hoare triple {12929#(<= ~counter~0 4)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {12929#(<= ~counter~0 4)} is VALID [2022-04-28 11:26:46,036 INFO L290 TraceCheckUtils]: 76: Hoare triple {12929#(<= ~counter~0 4)} ~cond := #in~cond; {12929#(<= ~counter~0 4)} is VALID [2022-04-28 11:26:46,036 INFO L290 TraceCheckUtils]: 77: Hoare triple {12929#(<= ~counter~0 4)} assume !(0 == ~cond); {12929#(<= ~counter~0 4)} is VALID [2022-04-28 11:26:46,036 INFO L290 TraceCheckUtils]: 78: Hoare triple {12929#(<= ~counter~0 4)} assume true; {12929#(<= ~counter~0 4)} is VALID [2022-04-28 11:26:46,037 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {12929#(<= ~counter~0 4)} {12929#(<= ~counter~0 4)} #81#return; {12929#(<= ~counter~0 4)} is VALID [2022-04-28 11:26:46,037 INFO L290 TraceCheckUtils]: 80: Hoare triple {12929#(<= ~counter~0 4)} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {12929#(<= ~counter~0 4)} is VALID [2022-04-28 11:26:46,038 INFO L290 TraceCheckUtils]: 81: Hoare triple {12929#(<= ~counter~0 4)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {12969#(<= |main_#t~post7| 4)} is VALID [2022-04-28 11:26:46,038 INFO L290 TraceCheckUtils]: 82: Hoare triple {12969#(<= |main_#t~post7| 4)} assume !(#t~post7 < 20);havoc #t~post7; {12717#false} is VALID [2022-04-28 11:26:46,038 INFO L290 TraceCheckUtils]: 83: Hoare triple {12717#false} ~r~0 := ~r~0 - ~b~0;~q~0 := ~q~0 + ~a~0; {12717#false} is VALID [2022-04-28 11:26:46,038 INFO L290 TraceCheckUtils]: 84: Hoare triple {12717#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12717#false} is VALID [2022-04-28 11:26:46,038 INFO L290 TraceCheckUtils]: 85: Hoare triple {12717#false} assume !(#t~post6 < 20);havoc #t~post6; {12717#false} is VALID [2022-04-28 11:26:46,038 INFO L272 TraceCheckUtils]: 86: Hoare triple {12717#false} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {12717#false} is VALID [2022-04-28 11:26:46,038 INFO L290 TraceCheckUtils]: 87: Hoare triple {12717#false} ~cond := #in~cond; {12717#false} is VALID [2022-04-28 11:26:46,038 INFO L290 TraceCheckUtils]: 88: Hoare triple {12717#false} assume 0 == ~cond; {12717#false} is VALID [2022-04-28 11:26:46,038 INFO L290 TraceCheckUtils]: 89: Hoare triple {12717#false} assume !false; {12717#false} is VALID [2022-04-28 11:26:46,039 INFO L134 CoverageAnalysis]: Checked inductivity of 262 backedges. 27 proven. 191 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-04-28 11:26:46,039 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:26:46,369 INFO L290 TraceCheckUtils]: 89: Hoare triple {12717#false} assume !false; {12717#false} is VALID [2022-04-28 11:26:46,369 INFO L290 TraceCheckUtils]: 88: Hoare triple {12717#false} assume 0 == ~cond; {12717#false} is VALID [2022-04-28 11:26:46,370 INFO L290 TraceCheckUtils]: 87: Hoare triple {12717#false} ~cond := #in~cond; {12717#false} is VALID [2022-04-28 11:26:46,370 INFO L272 TraceCheckUtils]: 86: Hoare triple {12717#false} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {12717#false} is VALID [2022-04-28 11:26:46,370 INFO L290 TraceCheckUtils]: 85: Hoare triple {12717#false} assume !(#t~post6 < 20);havoc #t~post6; {12717#false} is VALID [2022-04-28 11:26:46,370 INFO L290 TraceCheckUtils]: 84: Hoare triple {12717#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12717#false} is VALID [2022-04-28 11:26:46,370 INFO L290 TraceCheckUtils]: 83: Hoare triple {12717#false} ~r~0 := ~r~0 - ~b~0;~q~0 := ~q~0 + ~a~0; {12717#false} is VALID [2022-04-28 11:26:46,370 INFO L290 TraceCheckUtils]: 82: Hoare triple {13015#(< |main_#t~post7| 20)} assume !(#t~post7 < 20);havoc #t~post7; {12717#false} is VALID [2022-04-28 11:26:46,370 INFO L290 TraceCheckUtils]: 81: Hoare triple {13019#(< ~counter~0 20)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {13015#(< |main_#t~post7| 20)} is VALID [2022-04-28 11:26:46,371 INFO L290 TraceCheckUtils]: 80: Hoare triple {13019#(< ~counter~0 20)} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {13019#(< ~counter~0 20)} is VALID [2022-04-28 11:26:46,371 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {12716#true} {13019#(< ~counter~0 20)} #81#return; {13019#(< ~counter~0 20)} is VALID [2022-04-28 11:26:46,371 INFO L290 TraceCheckUtils]: 78: Hoare triple {12716#true} assume true; {12716#true} is VALID [2022-04-28 11:26:46,371 INFO L290 TraceCheckUtils]: 77: Hoare triple {12716#true} assume !(0 == ~cond); {12716#true} is VALID [2022-04-28 11:26:46,371 INFO L290 TraceCheckUtils]: 76: Hoare triple {12716#true} ~cond := #in~cond; {12716#true} is VALID [2022-04-28 11:26:46,371 INFO L272 TraceCheckUtils]: 75: Hoare triple {13019#(< ~counter~0 20)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {12716#true} is VALID [2022-04-28 11:26:46,372 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {12716#true} {13019#(< ~counter~0 20)} #79#return; {13019#(< ~counter~0 20)} is VALID [2022-04-28 11:26:46,372 INFO L290 TraceCheckUtils]: 73: Hoare triple {12716#true} assume true; {12716#true} is VALID [2022-04-28 11:26:46,372 INFO L290 TraceCheckUtils]: 72: Hoare triple {12716#true} assume !(0 == ~cond); {12716#true} is VALID [2022-04-28 11:26:46,372 INFO L290 TraceCheckUtils]: 71: Hoare triple {12716#true} ~cond := #in~cond; {12716#true} is VALID [2022-04-28 11:26:46,372 INFO L272 TraceCheckUtils]: 70: Hoare triple {13019#(< ~counter~0 20)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {12716#true} is VALID [2022-04-28 11:26:46,372 INFO L290 TraceCheckUtils]: 69: Hoare triple {13019#(< ~counter~0 20)} assume !!(#t~post6 < 20);havoc #t~post6; {13019#(< ~counter~0 20)} is VALID [2022-04-28 11:26:46,373 INFO L290 TraceCheckUtils]: 68: Hoare triple {13059#(< ~counter~0 19)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {13019#(< ~counter~0 20)} is VALID [2022-04-28 11:26:46,373 INFO L290 TraceCheckUtils]: 67: Hoare triple {13059#(< ~counter~0 19)} ~r~0 := ~r~0 - ~b~0;~q~0 := ~q~0 + ~a~0; {13059#(< ~counter~0 19)} is VALID [2022-04-28 11:26:46,373 INFO L290 TraceCheckUtils]: 66: Hoare triple {13059#(< ~counter~0 19)} assume !(~r~0 >= 2 * ~b~0); {13059#(< ~counter~0 19)} is VALID [2022-04-28 11:26:46,374 INFO L284 TraceCheckUtils]: 65: Hoare quadruple {12716#true} {13059#(< ~counter~0 19)} #87#return; {13059#(< ~counter~0 19)} is VALID [2022-04-28 11:26:46,374 INFO L290 TraceCheckUtils]: 64: Hoare triple {12716#true} assume true; {12716#true} is VALID [2022-04-28 11:26:46,374 INFO L290 TraceCheckUtils]: 63: Hoare triple {12716#true} assume !(0 == ~cond); {12716#true} is VALID [2022-04-28 11:26:46,374 INFO L290 TraceCheckUtils]: 62: Hoare triple {12716#true} ~cond := #in~cond; {12716#true} is VALID [2022-04-28 11:26:46,374 INFO L272 TraceCheckUtils]: 61: Hoare triple {13059#(< ~counter~0 19)} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {12716#true} is VALID [2022-04-28 11:26:46,374 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {12716#true} {13059#(< ~counter~0 19)} #85#return; {13059#(< ~counter~0 19)} is VALID [2022-04-28 11:26:46,375 INFO L290 TraceCheckUtils]: 59: Hoare triple {12716#true} assume true; {12716#true} is VALID [2022-04-28 11:26:46,375 INFO L290 TraceCheckUtils]: 58: Hoare triple {12716#true} assume !(0 == ~cond); {12716#true} is VALID [2022-04-28 11:26:46,375 INFO L290 TraceCheckUtils]: 57: Hoare triple {12716#true} ~cond := #in~cond; {12716#true} is VALID [2022-04-28 11:26:46,375 INFO L272 TraceCheckUtils]: 56: Hoare triple {13059#(< ~counter~0 19)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {12716#true} is VALID [2022-04-28 11:26:46,375 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {12716#true} {13059#(< ~counter~0 19)} #83#return; {13059#(< ~counter~0 19)} is VALID [2022-04-28 11:26:46,375 INFO L290 TraceCheckUtils]: 54: Hoare triple {12716#true} assume true; {12716#true} is VALID [2022-04-28 11:26:46,375 INFO L290 TraceCheckUtils]: 53: Hoare triple {12716#true} assume !(0 == ~cond); {12716#true} is VALID [2022-04-28 11:26:46,375 INFO L290 TraceCheckUtils]: 52: Hoare triple {12716#true} ~cond := #in~cond; {12716#true} is VALID [2022-04-28 11:26:46,375 INFO L272 TraceCheckUtils]: 51: Hoare triple {13059#(< ~counter~0 19)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {12716#true} is VALID [2022-04-28 11:26:46,376 INFO L290 TraceCheckUtils]: 50: Hoare triple {13059#(< ~counter~0 19)} assume !!(#t~post7 < 20);havoc #t~post7; {13059#(< ~counter~0 19)} is VALID [2022-04-28 11:26:46,376 INFO L290 TraceCheckUtils]: 49: Hoare triple {13117#(< ~counter~0 18)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {13059#(< ~counter~0 19)} is VALID [2022-04-28 11:26:46,376 INFO L290 TraceCheckUtils]: 48: Hoare triple {13117#(< ~counter~0 18)} ~a~0 := 2 * ~a~0;~b~0 := 2 * ~b~0; {13117#(< ~counter~0 18)} is VALID [2022-04-28 11:26:46,377 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {12716#true} {13117#(< ~counter~0 18)} #89#return; {13117#(< ~counter~0 18)} is VALID [2022-04-28 11:26:46,377 INFO L290 TraceCheckUtils]: 46: Hoare triple {12716#true} assume true; {12716#true} is VALID [2022-04-28 11:26:46,377 INFO L290 TraceCheckUtils]: 45: Hoare triple {12716#true} assume !(0 == ~cond); {12716#true} is VALID [2022-04-28 11:26:46,377 INFO L290 TraceCheckUtils]: 44: Hoare triple {12716#true} ~cond := #in~cond; {12716#true} is VALID [2022-04-28 11:26:46,377 INFO L272 TraceCheckUtils]: 43: Hoare triple {13117#(< ~counter~0 18)} call __VERIFIER_assert((if ~r~0 >= 2 * ~y~0 * ~a~0 then 1 else 0)); {12716#true} is VALID [2022-04-28 11:26:46,377 INFO L290 TraceCheckUtils]: 42: Hoare triple {13117#(< ~counter~0 18)} assume !!(~r~0 >= 2 * ~b~0); {13117#(< ~counter~0 18)} is VALID [2022-04-28 11:26:46,378 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {12716#true} {13117#(< ~counter~0 18)} #87#return; {13117#(< ~counter~0 18)} is VALID [2022-04-28 11:26:46,378 INFO L290 TraceCheckUtils]: 40: Hoare triple {12716#true} assume true; {12716#true} is VALID [2022-04-28 11:26:46,378 INFO L290 TraceCheckUtils]: 39: Hoare triple {12716#true} assume !(0 == ~cond); {12716#true} is VALID [2022-04-28 11:26:46,378 INFO L290 TraceCheckUtils]: 38: Hoare triple {12716#true} ~cond := #in~cond; {12716#true} is VALID [2022-04-28 11:26:46,378 INFO L272 TraceCheckUtils]: 37: Hoare triple {13117#(< ~counter~0 18)} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {12716#true} is VALID [2022-04-28 11:26:46,378 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {12716#true} {13117#(< ~counter~0 18)} #85#return; {13117#(< ~counter~0 18)} is VALID [2022-04-28 11:26:46,378 INFO L290 TraceCheckUtils]: 35: Hoare triple {12716#true} assume true; {12716#true} is VALID [2022-04-28 11:26:46,378 INFO L290 TraceCheckUtils]: 34: Hoare triple {12716#true} assume !(0 == ~cond); {12716#true} is VALID [2022-04-28 11:26:46,378 INFO L290 TraceCheckUtils]: 33: Hoare triple {12716#true} ~cond := #in~cond; {12716#true} is VALID [2022-04-28 11:26:46,379 INFO L272 TraceCheckUtils]: 32: Hoare triple {13117#(< ~counter~0 18)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {12716#true} is VALID [2022-04-28 11:26:46,379 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {12716#true} {13117#(< ~counter~0 18)} #83#return; {13117#(< ~counter~0 18)} is VALID [2022-04-28 11:26:46,379 INFO L290 TraceCheckUtils]: 30: Hoare triple {12716#true} assume true; {12716#true} is VALID [2022-04-28 11:26:46,379 INFO L290 TraceCheckUtils]: 29: Hoare triple {12716#true} assume !(0 == ~cond); {12716#true} is VALID [2022-04-28 11:26:46,379 INFO L290 TraceCheckUtils]: 28: Hoare triple {12716#true} ~cond := #in~cond; {12716#true} is VALID [2022-04-28 11:26:46,379 INFO L272 TraceCheckUtils]: 27: Hoare triple {13117#(< ~counter~0 18)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {12716#true} is VALID [2022-04-28 11:26:46,379 INFO L290 TraceCheckUtils]: 26: Hoare triple {13117#(< ~counter~0 18)} assume !!(#t~post7 < 20);havoc #t~post7; {13117#(< ~counter~0 18)} is VALID [2022-04-28 11:26:46,380 INFO L290 TraceCheckUtils]: 25: Hoare triple {13190#(< ~counter~0 17)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {13117#(< ~counter~0 18)} is VALID [2022-04-28 11:26:46,380 INFO L290 TraceCheckUtils]: 24: Hoare triple {13190#(< ~counter~0 17)} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {13190#(< ~counter~0 17)} is VALID [2022-04-28 11:26:46,381 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {12716#true} {13190#(< ~counter~0 17)} #81#return; {13190#(< ~counter~0 17)} is VALID [2022-04-28 11:26:46,381 INFO L290 TraceCheckUtils]: 22: Hoare triple {12716#true} assume true; {12716#true} is VALID [2022-04-28 11:26:46,381 INFO L290 TraceCheckUtils]: 21: Hoare triple {12716#true} assume !(0 == ~cond); {12716#true} is VALID [2022-04-28 11:26:46,381 INFO L290 TraceCheckUtils]: 20: Hoare triple {12716#true} ~cond := #in~cond; {12716#true} is VALID [2022-04-28 11:26:46,381 INFO L272 TraceCheckUtils]: 19: Hoare triple {13190#(< ~counter~0 17)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {12716#true} is VALID [2022-04-28 11:26:46,381 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {12716#true} {13190#(< ~counter~0 17)} #79#return; {13190#(< ~counter~0 17)} is VALID [2022-04-28 11:26:46,381 INFO L290 TraceCheckUtils]: 17: Hoare triple {12716#true} assume true; {12716#true} is VALID [2022-04-28 11:26:46,381 INFO L290 TraceCheckUtils]: 16: Hoare triple {12716#true} assume !(0 == ~cond); {12716#true} is VALID [2022-04-28 11:26:46,381 INFO L290 TraceCheckUtils]: 15: Hoare triple {12716#true} ~cond := #in~cond; {12716#true} is VALID [2022-04-28 11:26:46,381 INFO L272 TraceCheckUtils]: 14: Hoare triple {13190#(< ~counter~0 17)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {12716#true} is VALID [2022-04-28 11:26:46,382 INFO L290 TraceCheckUtils]: 13: Hoare triple {13190#(< ~counter~0 17)} assume !!(#t~post6 < 20);havoc #t~post6; {13190#(< ~counter~0 17)} is VALID [2022-04-28 11:26:46,382 INFO L290 TraceCheckUtils]: 12: Hoare triple {13230#(< ~counter~0 16)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {13190#(< ~counter~0 17)} is VALID [2022-04-28 11:26:46,382 INFO L290 TraceCheckUtils]: 11: Hoare triple {13230#(< ~counter~0 16)} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {13230#(< ~counter~0 16)} is VALID [2022-04-28 11:26:46,383 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {12716#true} {13230#(< ~counter~0 16)} #77#return; {13230#(< ~counter~0 16)} is VALID [2022-04-28 11:26:46,383 INFO L290 TraceCheckUtils]: 9: Hoare triple {12716#true} assume true; {12716#true} is VALID [2022-04-28 11:26:46,383 INFO L290 TraceCheckUtils]: 8: Hoare triple {12716#true} assume !(0 == ~cond); {12716#true} is VALID [2022-04-28 11:26:46,383 INFO L290 TraceCheckUtils]: 7: Hoare triple {12716#true} ~cond := #in~cond; {12716#true} is VALID [2022-04-28 11:26:46,383 INFO L272 TraceCheckUtils]: 6: Hoare triple {13230#(< ~counter~0 16)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {12716#true} is VALID [2022-04-28 11:26:46,383 INFO L290 TraceCheckUtils]: 5: Hoare triple {13230#(< ~counter~0 16)} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~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; {13230#(< ~counter~0 16)} is VALID [2022-04-28 11:26:46,384 INFO L272 TraceCheckUtils]: 4: Hoare triple {13230#(< ~counter~0 16)} call #t~ret8 := main(); {13230#(< ~counter~0 16)} is VALID [2022-04-28 11:26:46,384 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13230#(< ~counter~0 16)} {12716#true} #93#return; {13230#(< ~counter~0 16)} is VALID [2022-04-28 11:26:46,384 INFO L290 TraceCheckUtils]: 2: Hoare triple {13230#(< ~counter~0 16)} assume true; {13230#(< ~counter~0 16)} is VALID [2022-04-28 11:26:46,385 INFO L290 TraceCheckUtils]: 1: Hoare triple {12716#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(14, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {13230#(< ~counter~0 16)} is VALID [2022-04-28 11:26:46,385 INFO L272 TraceCheckUtils]: 0: Hoare triple {12716#true} call ULTIMATE.init(); {12716#true} is VALID [2022-04-28 11:26:46,385 INFO L134 CoverageAnalysis]: Checked inductivity of 262 backedges. 27 proven. 15 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2022-04-28 11:26:46,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:26:46,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588357897] [2022-04-28 11:26:46,385 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:26:46,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [488349313] [2022-04-28 11:26:46,385 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [488349313] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 11:26:46,385 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 11:26:46,385 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-04-28 11:26:46,385 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:26:46,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2088474626] [2022-04-28 11:26:46,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2088474626] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:26:46,386 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:26:46,386 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 11:26:46,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075919847] [2022-04-28 11:26:46,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:26:46,386 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 7 states have internal predecessors, (41), 7 states have call successors, (15), 7 states have call predecessors, (15), 5 states have return successors, (13), 5 states have call predecessors, (13), 6 states have call successors, (13) Word has length 90 [2022-04-28 11:26:46,386 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:26:46,386 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 5.125) internal successors, (41), 7 states have internal predecessors, (41), 7 states have call successors, (15), 7 states have call predecessors, (15), 5 states have return successors, (13), 5 states have call predecessors, (13), 6 states have call successors, (13) [2022-04-28 11:26:46,432 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:26:46,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 11:26:46,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:26:46,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 11:26:46,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-28 11:26:46,433 INFO L87 Difference]: Start difference. First operand 168 states and 206 transitions. Second operand has 8 states, 8 states have (on average 5.125) internal successors, (41), 7 states have internal predecessors, (41), 7 states have call successors, (15), 7 states have call predecessors, (15), 5 states have return successors, (13), 5 states have call predecessors, (13), 6 states have call successors, (13) [2022-04-28 11:26:46,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:26:46,949 INFO L93 Difference]: Finished difference Result 269 states and 336 transitions. [2022-04-28 11:26:46,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-28 11:26:46,949 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 7 states have internal predecessors, (41), 7 states have call successors, (15), 7 states have call predecessors, (15), 5 states have return successors, (13), 5 states have call predecessors, (13), 6 states have call successors, (13) Word has length 90 [2022-04-28 11:26:46,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:26:46,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 5.125) internal successors, (41), 7 states have internal predecessors, (41), 7 states have call successors, (15), 7 states have call predecessors, (15), 5 states have return successors, (13), 5 states have call predecessors, (13), 6 states have call successors, (13) [2022-04-28 11:26:46,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 143 transitions. [2022-04-28 11:26:46,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 5.125) internal successors, (41), 7 states have internal predecessors, (41), 7 states have call successors, (15), 7 states have call predecessors, (15), 5 states have return successors, (13), 5 states have call predecessors, (13), 6 states have call successors, (13) [2022-04-28 11:26:46,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 143 transitions. [2022-04-28 11:26:46,952 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 143 transitions. [2022-04-28 11:26:47,047 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 143 edges. 143 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:26:47,050 INFO L225 Difference]: With dead ends: 269 [2022-04-28 11:26:47,050 INFO L226 Difference]: Without dead ends: 196 [2022-04-28 11:26:47,051 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=107, Invalid=165, Unknown=0, NotChecked=0, Total=272 [2022-04-28 11:26:47,051 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 46 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 11:26:47,051 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 169 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 11:26:47,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2022-04-28 11:26:47,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 196. [2022-04-28 11:26:47,300 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:26:47,301 INFO L82 GeneralOperation]: Start isEquivalent. First operand 196 states. Second operand has 196 states, 127 states have (on average 1.1338582677165354) internal successors, (144), 129 states have internal predecessors, (144), 45 states have call successors, (45), 24 states have call predecessors, (45), 23 states have return successors, (43), 42 states have call predecessors, (43), 43 states have call successors, (43) [2022-04-28 11:26:47,301 INFO L74 IsIncluded]: Start isIncluded. First operand 196 states. Second operand has 196 states, 127 states have (on average 1.1338582677165354) internal successors, (144), 129 states have internal predecessors, (144), 45 states have call successors, (45), 24 states have call predecessors, (45), 23 states have return successors, (43), 42 states have call predecessors, (43), 43 states have call successors, (43) [2022-04-28 11:26:47,301 INFO L87 Difference]: Start difference. First operand 196 states. Second operand has 196 states, 127 states have (on average 1.1338582677165354) internal successors, (144), 129 states have internal predecessors, (144), 45 states have call successors, (45), 24 states have call predecessors, (45), 23 states have return successors, (43), 42 states have call predecessors, (43), 43 states have call successors, (43) [2022-04-28 11:26:47,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:26:47,305 INFO L93 Difference]: Finished difference Result 196 states and 232 transitions. [2022-04-28 11:26:47,305 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 232 transitions. [2022-04-28 11:26:47,305 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:26:47,305 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:26:47,305 INFO L74 IsIncluded]: Start isIncluded. First operand has 196 states, 127 states have (on average 1.1338582677165354) internal successors, (144), 129 states have internal predecessors, (144), 45 states have call successors, (45), 24 states have call predecessors, (45), 23 states have return successors, (43), 42 states have call predecessors, (43), 43 states have call successors, (43) Second operand 196 states. [2022-04-28 11:26:47,306 INFO L87 Difference]: Start difference. First operand has 196 states, 127 states have (on average 1.1338582677165354) internal successors, (144), 129 states have internal predecessors, (144), 45 states have call successors, (45), 24 states have call predecessors, (45), 23 states have return successors, (43), 42 states have call predecessors, (43), 43 states have call successors, (43) Second operand 196 states. [2022-04-28 11:26:47,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:26:47,309 INFO L93 Difference]: Finished difference Result 196 states and 232 transitions. [2022-04-28 11:26:47,309 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 232 transitions. [2022-04-28 11:26:47,309 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:26:47,309 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:26:47,309 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:26:47,309 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:26:47,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 127 states have (on average 1.1338582677165354) internal successors, (144), 129 states have internal predecessors, (144), 45 states have call successors, (45), 24 states have call predecessors, (45), 23 states have return successors, (43), 42 states have call predecessors, (43), 43 states have call successors, (43) [2022-04-28 11:26:47,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 232 transitions. [2022-04-28 11:26:47,313 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 232 transitions. Word has length 90 [2022-04-28 11:26:47,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:26:47,313 INFO L495 AbstractCegarLoop]: Abstraction has 196 states and 232 transitions. [2022-04-28 11:26:47,313 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 7 states have internal predecessors, (41), 7 states have call successors, (15), 7 states have call predecessors, (15), 5 states have return successors, (13), 5 states have call predecessors, (13), 6 states have call successors, (13) [2022-04-28 11:26:47,313 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 196 states and 232 transitions. [2022-04-28 11:26:47,594 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 232 edges. 232 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:26:47,595 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 232 transitions. [2022-04-28 11:26:47,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-04-28 11:26:47,595 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:26:47,595 INFO L195 NwaCegarLoop]: trace histogram [15, 14, 14, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-28 11:26:47,612 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-04-28 11:26:47,796 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-28 11:26:47,796 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:26:47,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:26:47,796 INFO L85 PathProgramCache]: Analyzing trace with hash 447330249, now seen corresponding path program 3 times [2022-04-28 11:26:47,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:26:47,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [183620002] [2022-04-28 11:27:14,939 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:27:14,939 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:27:14,939 INFO L85 PathProgramCache]: Analyzing trace with hash 447330249, now seen corresponding path program 4 times [2022-04-28 11:27:14,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:27:14,939 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364325792] [2022-04-28 11:27:14,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:27:14,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:27:14,949 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:27:14,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [564920806] [2022-04-28 11:27:14,949 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 11:27:14,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:27:14,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:27:14,950 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-28 11:27:14,952 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-28 11:27:15,008 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 11:27:15,008 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:27:15,009 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-28 11:27:15,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:27:15,026 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:27:16,751 INFO L272 TraceCheckUtils]: 0: Hoare triple {14597#true} call ULTIMATE.init(); {14597#true} is VALID [2022-04-28 11:27:16,751 INFO L290 TraceCheckUtils]: 1: Hoare triple {14597#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(14, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {14597#true} is VALID [2022-04-28 11:27:16,751 INFO L290 TraceCheckUtils]: 2: Hoare triple {14597#true} assume true; {14597#true} is VALID [2022-04-28 11:27:16,751 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14597#true} {14597#true} #93#return; {14597#true} is VALID [2022-04-28 11:27:16,751 INFO L272 TraceCheckUtils]: 4: Hoare triple {14597#true} call #t~ret8 := main(); {14597#true} is VALID [2022-04-28 11:27:16,751 INFO L290 TraceCheckUtils]: 5: Hoare triple {14597#true} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~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; {14597#true} is VALID [2022-04-28 11:27:16,751 INFO L272 TraceCheckUtils]: 6: Hoare triple {14597#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {14597#true} is VALID [2022-04-28 11:27:16,751 INFO L290 TraceCheckUtils]: 7: Hoare triple {14597#true} ~cond := #in~cond; {14597#true} is VALID [2022-04-28 11:27:16,751 INFO L290 TraceCheckUtils]: 8: Hoare triple {14597#true} assume !(0 == ~cond); {14597#true} is VALID [2022-04-28 11:27:16,752 INFO L290 TraceCheckUtils]: 9: Hoare triple {14597#true} assume true; {14597#true} is VALID [2022-04-28 11:27:16,752 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {14597#true} {14597#true} #77#return; {14597#true} is VALID [2022-04-28 11:27:16,752 INFO L290 TraceCheckUtils]: 11: Hoare triple {14597#true} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {14635#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:27:16,752 INFO L290 TraceCheckUtils]: 12: Hoare triple {14635#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {14635#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:27:16,753 INFO L290 TraceCheckUtils]: 13: Hoare triple {14635#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} assume !!(#t~post6 < 20);havoc #t~post6; {14635#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:27:16,753 INFO L272 TraceCheckUtils]: 14: Hoare triple {14635#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {14597#true} is VALID [2022-04-28 11:27:16,753 INFO L290 TraceCheckUtils]: 15: Hoare triple {14597#true} ~cond := #in~cond; {14597#true} is VALID [2022-04-28 11:27:16,753 INFO L290 TraceCheckUtils]: 16: Hoare triple {14597#true} assume !(0 == ~cond); {14597#true} is VALID [2022-04-28 11:27:16,753 INFO L290 TraceCheckUtils]: 17: Hoare triple {14597#true} assume true; {14597#true} is VALID [2022-04-28 11:27:16,753 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {14597#true} {14635#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #79#return; {14635#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:27:16,753 INFO L272 TraceCheckUtils]: 19: Hoare triple {14635#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {14597#true} is VALID [2022-04-28 11:27:16,753 INFO L290 TraceCheckUtils]: 20: Hoare triple {14597#true} ~cond := #in~cond; {14597#true} is VALID [2022-04-28 11:27:16,754 INFO L290 TraceCheckUtils]: 21: Hoare triple {14597#true} assume !(0 == ~cond); {14597#true} is VALID [2022-04-28 11:27:16,754 INFO L290 TraceCheckUtils]: 22: Hoare triple {14597#true} assume true; {14597#true} is VALID [2022-04-28 11:27:16,754 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {14597#true} {14635#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #81#return; {14635#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:27:16,754 INFO L290 TraceCheckUtils]: 24: Hoare triple {14635#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {14675#(and (<= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-28 11:27:16,755 INFO L290 TraceCheckUtils]: 25: Hoare triple {14675#(and (<= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {14675#(and (<= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-28 11:27:16,755 INFO L290 TraceCheckUtils]: 26: Hoare triple {14675#(and (<= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} assume !!(#t~post7 < 20);havoc #t~post7; {14675#(and (<= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-28 11:27:16,755 INFO L272 TraceCheckUtils]: 27: Hoare triple {14675#(and (<= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {14597#true} is VALID [2022-04-28 11:27:16,755 INFO L290 TraceCheckUtils]: 28: Hoare triple {14597#true} ~cond := #in~cond; {14597#true} is VALID [2022-04-28 11:27:16,755 INFO L290 TraceCheckUtils]: 29: Hoare triple {14597#true} assume !(0 == ~cond); {14597#true} is VALID [2022-04-28 11:27:16,755 INFO L290 TraceCheckUtils]: 30: Hoare triple {14597#true} assume true; {14597#true} is VALID [2022-04-28 11:27:16,756 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {14597#true} {14675#(and (<= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #83#return; {14675#(and (<= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-28 11:27:16,756 INFO L272 TraceCheckUtils]: 32: Hoare triple {14675#(and (<= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {14597#true} is VALID [2022-04-28 11:27:16,756 INFO L290 TraceCheckUtils]: 33: Hoare triple {14597#true} ~cond := #in~cond; {14597#true} is VALID [2022-04-28 11:27:16,756 INFO L290 TraceCheckUtils]: 34: Hoare triple {14597#true} assume !(0 == ~cond); {14597#true} is VALID [2022-04-28 11:27:16,756 INFO L290 TraceCheckUtils]: 35: Hoare triple {14597#true} assume true; {14597#true} is VALID [2022-04-28 11:27:16,757 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {14597#true} {14675#(and (<= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #85#return; {14675#(and (<= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-28 11:27:16,768 INFO L272 TraceCheckUtils]: 37: Hoare triple {14675#(and (<= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {14597#true} is VALID [2022-04-28 11:27:16,768 INFO L290 TraceCheckUtils]: 38: Hoare triple {14597#true} ~cond := #in~cond; {14597#true} is VALID [2022-04-28 11:27:16,768 INFO L290 TraceCheckUtils]: 39: Hoare triple {14597#true} assume !(0 == ~cond); {14597#true} is VALID [2022-04-28 11:27:16,768 INFO L290 TraceCheckUtils]: 40: Hoare triple {14597#true} assume true; {14597#true} is VALID [2022-04-28 11:27:16,770 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {14597#true} {14675#(and (<= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #87#return; {14675#(and (<= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-28 11:27:16,771 INFO L290 TraceCheckUtils]: 42: Hoare triple {14675#(and (<= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} assume !!(~r~0 >= 2 * ~b~0); {14675#(and (<= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-28 11:27:16,771 INFO L272 TraceCheckUtils]: 43: Hoare triple {14675#(and (<= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~r~0 >= 2 * ~y~0 * ~a~0 then 1 else 0)); {14597#true} is VALID [2022-04-28 11:27:16,771 INFO L290 TraceCheckUtils]: 44: Hoare triple {14597#true} ~cond := #in~cond; {14597#true} is VALID [2022-04-28 11:27:16,771 INFO L290 TraceCheckUtils]: 45: Hoare triple {14597#true} assume !(0 == ~cond); {14597#true} is VALID [2022-04-28 11:27:16,771 INFO L290 TraceCheckUtils]: 46: Hoare triple {14597#true} assume true; {14597#true} is VALID [2022-04-28 11:27:16,781 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {14597#true} {14675#(and (<= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #89#return; {14675#(and (<= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-28 11:27:16,782 INFO L290 TraceCheckUtils]: 48: Hoare triple {14675#(and (<= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} ~a~0 := 2 * ~a~0;~b~0 := 2 * ~b~0; {14748#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (<= (div main_~a~0 2) 1) (= main_~q~0 0))} is VALID [2022-04-28 11:27:16,782 INFO L290 TraceCheckUtils]: 49: Hoare triple {14748#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (<= (div main_~a~0 2) 1) (= main_~q~0 0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {14748#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (<= (div main_~a~0 2) 1) (= main_~q~0 0))} is VALID [2022-04-28 11:27:16,783 INFO L290 TraceCheckUtils]: 50: Hoare triple {14748#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (<= (div main_~a~0 2) 1) (= main_~q~0 0))} assume !!(#t~post7 < 20);havoc #t~post7; {14748#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (<= (div main_~a~0 2) 1) (= main_~q~0 0))} is VALID [2022-04-28 11:27:16,783 INFO L272 TraceCheckUtils]: 51: Hoare triple {14748#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (<= (div main_~a~0 2) 1) (= main_~q~0 0))} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {14597#true} is VALID [2022-04-28 11:27:16,783 INFO L290 TraceCheckUtils]: 52: Hoare triple {14597#true} ~cond := #in~cond; {14597#true} is VALID [2022-04-28 11:27:16,783 INFO L290 TraceCheckUtils]: 53: Hoare triple {14597#true} assume !(0 == ~cond); {14597#true} is VALID [2022-04-28 11:27:16,783 INFO L290 TraceCheckUtils]: 54: Hoare triple {14597#true} assume true; {14597#true} is VALID [2022-04-28 11:27:16,783 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {14597#true} {14748#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (<= (div main_~a~0 2) 1) (= main_~q~0 0))} #83#return; {14748#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (<= (div main_~a~0 2) 1) (= main_~q~0 0))} is VALID [2022-04-28 11:27:16,783 INFO L272 TraceCheckUtils]: 56: Hoare triple {14748#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (<= (div main_~a~0 2) 1) (= main_~q~0 0))} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {14597#true} is VALID [2022-04-28 11:27:16,783 INFO L290 TraceCheckUtils]: 57: Hoare triple {14597#true} ~cond := #in~cond; {14597#true} is VALID [2022-04-28 11:27:16,783 INFO L290 TraceCheckUtils]: 58: Hoare triple {14597#true} assume !(0 == ~cond); {14597#true} is VALID [2022-04-28 11:27:16,783 INFO L290 TraceCheckUtils]: 59: Hoare triple {14597#true} assume true; {14597#true} is VALID [2022-04-28 11:27:16,784 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {14597#true} {14748#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (<= (div main_~a~0 2) 1) (= main_~q~0 0))} #85#return; {14748#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (<= (div main_~a~0 2) 1) (= main_~q~0 0))} is VALID [2022-04-28 11:27:16,784 INFO L272 TraceCheckUtils]: 61: Hoare triple {14748#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (<= (div main_~a~0 2) 1) (= main_~q~0 0))} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {14597#true} is VALID [2022-04-28 11:27:16,784 INFO L290 TraceCheckUtils]: 62: Hoare triple {14597#true} ~cond := #in~cond; {14597#true} is VALID [2022-04-28 11:27:16,784 INFO L290 TraceCheckUtils]: 63: Hoare triple {14597#true} assume !(0 == ~cond); {14597#true} is VALID [2022-04-28 11:27:16,784 INFO L290 TraceCheckUtils]: 64: Hoare triple {14597#true} assume true; {14597#true} is VALID [2022-04-28 11:27:16,784 INFO L284 TraceCheckUtils]: 65: Hoare quadruple {14597#true} {14748#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (<= (div main_~a~0 2) 1) (= main_~q~0 0))} #87#return; {14748#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (<= (div main_~a~0 2) 1) (= main_~q~0 0))} is VALID [2022-04-28 11:27:16,785 INFO L290 TraceCheckUtils]: 66: Hoare triple {14748#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (<= (div main_~a~0 2) 1) (= main_~q~0 0))} assume !(~r~0 >= 2 * ~b~0); {14803#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (not (<= (* main_~b~0 2) main_~r~0)) (<= (div main_~a~0 2) 1) (= main_~q~0 0))} is VALID [2022-04-28 11:27:16,786 INFO L290 TraceCheckUtils]: 67: Hoare triple {14803#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (not (<= (* main_~b~0 2) main_~r~0)) (<= (div main_~a~0 2) 1) (= main_~q~0 0))} ~r~0 := ~r~0 - ~b~0;~q~0 := ~q~0 + ~a~0; {14807#(and (not (<= (* main_~y~0 4) main_~x~0)) (<= (div main_~q~0 2) 1) (= (mod main_~q~0 2) 0) (= main_~r~0 (+ main_~x~0 (* (- 2) main_~y~0))))} is VALID [2022-04-28 11:27:16,786 INFO L290 TraceCheckUtils]: 68: Hoare triple {14807#(and (not (<= (* main_~y~0 4) main_~x~0)) (<= (div main_~q~0 2) 1) (= (mod main_~q~0 2) 0) (= main_~r~0 (+ main_~x~0 (* (- 2) main_~y~0))))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {14807#(and (not (<= (* main_~y~0 4) main_~x~0)) (<= (div main_~q~0 2) 1) (= (mod main_~q~0 2) 0) (= main_~r~0 (+ main_~x~0 (* (- 2) main_~y~0))))} is VALID [2022-04-28 11:27:16,786 INFO L290 TraceCheckUtils]: 69: Hoare triple {14807#(and (not (<= (* main_~y~0 4) main_~x~0)) (<= (div main_~q~0 2) 1) (= (mod main_~q~0 2) 0) (= main_~r~0 (+ main_~x~0 (* (- 2) main_~y~0))))} assume !!(#t~post6 < 20);havoc #t~post6; {14807#(and (not (<= (* main_~y~0 4) main_~x~0)) (<= (div main_~q~0 2) 1) (= (mod main_~q~0 2) 0) (= main_~r~0 (+ main_~x~0 (* (- 2) main_~y~0))))} is VALID [2022-04-28 11:27:16,786 INFO L272 TraceCheckUtils]: 70: Hoare triple {14807#(and (not (<= (* main_~y~0 4) main_~x~0)) (<= (div main_~q~0 2) 1) (= (mod main_~q~0 2) 0) (= main_~r~0 (+ main_~x~0 (* (- 2) main_~y~0))))} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {14597#true} is VALID [2022-04-28 11:27:16,786 INFO L290 TraceCheckUtils]: 71: Hoare triple {14597#true} ~cond := #in~cond; {14597#true} is VALID [2022-04-28 11:27:16,786 INFO L290 TraceCheckUtils]: 72: Hoare triple {14597#true} assume !(0 == ~cond); {14597#true} is VALID [2022-04-28 11:27:16,786 INFO L290 TraceCheckUtils]: 73: Hoare triple {14597#true} assume true; {14597#true} is VALID [2022-04-28 11:27:16,787 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {14597#true} {14807#(and (not (<= (* main_~y~0 4) main_~x~0)) (<= (div main_~q~0 2) 1) (= (mod main_~q~0 2) 0) (= main_~r~0 (+ main_~x~0 (* (- 2) main_~y~0))))} #79#return; {14807#(and (not (<= (* main_~y~0 4) main_~x~0)) (<= (div main_~q~0 2) 1) (= (mod main_~q~0 2) 0) (= main_~r~0 (+ main_~x~0 (* (- 2) main_~y~0))))} is VALID [2022-04-28 11:27:16,787 INFO L272 TraceCheckUtils]: 75: Hoare triple {14807#(and (not (<= (* main_~y~0 4) main_~x~0)) (<= (div main_~q~0 2) 1) (= (mod main_~q~0 2) 0) (= main_~r~0 (+ main_~x~0 (* (- 2) main_~y~0))))} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {14597#true} is VALID [2022-04-28 11:27:16,787 INFO L290 TraceCheckUtils]: 76: Hoare triple {14597#true} ~cond := #in~cond; {14597#true} is VALID [2022-04-28 11:27:16,787 INFO L290 TraceCheckUtils]: 77: Hoare triple {14597#true} assume !(0 == ~cond); {14597#true} is VALID [2022-04-28 11:27:16,787 INFO L290 TraceCheckUtils]: 78: Hoare triple {14597#true} assume true; {14597#true} is VALID [2022-04-28 11:27:16,787 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {14597#true} {14807#(and (not (<= (* main_~y~0 4) main_~x~0)) (<= (div main_~q~0 2) 1) (= (mod main_~q~0 2) 0) (= main_~r~0 (+ main_~x~0 (* (- 2) main_~y~0))))} #81#return; {14807#(and (not (<= (* main_~y~0 4) main_~x~0)) (<= (div main_~q~0 2) 1) (= (mod main_~q~0 2) 0) (= main_~r~0 (+ main_~x~0 (* (- 2) main_~y~0))))} is VALID [2022-04-28 11:27:16,788 INFO L290 TraceCheckUtils]: 80: Hoare triple {14807#(and (not (<= (* main_~y~0 4) main_~x~0)) (<= (div main_~q~0 2) 1) (= (mod main_~q~0 2) 0) (= main_~r~0 (+ main_~x~0 (* (- 2) main_~y~0))))} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {14847#(and (= main_~a~0 1) (not (<= (* main_~y~0 4) main_~x~0)) (<= main_~y~0 main_~r~0) (= main_~b~0 main_~y~0) (<= (div main_~q~0 2) 1) (= (mod main_~q~0 2) 0) (= main_~r~0 (+ main_~x~0 (* (- 2) main_~y~0))))} is VALID [2022-04-28 11:27:16,788 INFO L290 TraceCheckUtils]: 81: Hoare triple {14847#(and (= main_~a~0 1) (not (<= (* main_~y~0 4) main_~x~0)) (<= main_~y~0 main_~r~0) (= main_~b~0 main_~y~0) (<= (div main_~q~0 2) 1) (= (mod main_~q~0 2) 0) (= main_~r~0 (+ main_~x~0 (* (- 2) main_~y~0))))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {14847#(and (= main_~a~0 1) (not (<= (* main_~y~0 4) main_~x~0)) (<= main_~y~0 main_~r~0) (= main_~b~0 main_~y~0) (<= (div main_~q~0 2) 1) (= (mod main_~q~0 2) 0) (= main_~r~0 (+ main_~x~0 (* (- 2) main_~y~0))))} is VALID [2022-04-28 11:27:16,789 INFO L290 TraceCheckUtils]: 82: Hoare triple {14847#(and (= main_~a~0 1) (not (<= (* main_~y~0 4) main_~x~0)) (<= main_~y~0 main_~r~0) (= main_~b~0 main_~y~0) (<= (div main_~q~0 2) 1) (= (mod main_~q~0 2) 0) (= main_~r~0 (+ main_~x~0 (* (- 2) main_~y~0))))} assume !!(#t~post7 < 20);havoc #t~post7; {14847#(and (= main_~a~0 1) (not (<= (* main_~y~0 4) main_~x~0)) (<= main_~y~0 main_~r~0) (= main_~b~0 main_~y~0) (<= (div main_~q~0 2) 1) (= (mod main_~q~0 2) 0) (= main_~r~0 (+ main_~x~0 (* (- 2) main_~y~0))))} is VALID [2022-04-28 11:27:16,789 INFO L272 TraceCheckUtils]: 83: Hoare triple {14847#(and (= main_~a~0 1) (not (<= (* main_~y~0 4) main_~x~0)) (<= main_~y~0 main_~r~0) (= main_~b~0 main_~y~0) (<= (div main_~q~0 2) 1) (= (mod main_~q~0 2) 0) (= main_~r~0 (+ main_~x~0 (* (- 2) main_~y~0))))} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {14597#true} is VALID [2022-04-28 11:27:16,789 INFO L290 TraceCheckUtils]: 84: Hoare triple {14597#true} ~cond := #in~cond; {14597#true} is VALID [2022-04-28 11:27:16,789 INFO L290 TraceCheckUtils]: 85: Hoare triple {14597#true} assume !(0 == ~cond); {14597#true} is VALID [2022-04-28 11:27:16,789 INFO L290 TraceCheckUtils]: 86: Hoare triple {14597#true} assume true; {14597#true} is VALID [2022-04-28 11:27:16,789 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {14597#true} {14847#(and (= main_~a~0 1) (not (<= (* main_~y~0 4) main_~x~0)) (<= main_~y~0 main_~r~0) (= main_~b~0 main_~y~0) (<= (div main_~q~0 2) 1) (= (mod main_~q~0 2) 0) (= main_~r~0 (+ main_~x~0 (* (- 2) main_~y~0))))} #83#return; {14847#(and (= main_~a~0 1) (not (<= (* main_~y~0 4) main_~x~0)) (<= main_~y~0 main_~r~0) (= main_~b~0 main_~y~0) (<= (div main_~q~0 2) 1) (= (mod main_~q~0 2) 0) (= main_~r~0 (+ main_~x~0 (* (- 2) main_~y~0))))} is VALID [2022-04-28 11:27:16,789 INFO L272 TraceCheckUtils]: 88: Hoare triple {14847#(and (= main_~a~0 1) (not (<= (* main_~y~0 4) main_~x~0)) (<= main_~y~0 main_~r~0) (= main_~b~0 main_~y~0) (<= (div main_~q~0 2) 1) (= (mod main_~q~0 2) 0) (= main_~r~0 (+ main_~x~0 (* (- 2) main_~y~0))))} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {14597#true} is VALID [2022-04-28 11:27:16,789 INFO L290 TraceCheckUtils]: 89: Hoare triple {14597#true} ~cond := #in~cond; {14875#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:27:16,790 INFO L290 TraceCheckUtils]: 90: Hoare triple {14875#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {14879#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:27:16,790 INFO L290 TraceCheckUtils]: 91: Hoare triple {14879#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {14879#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:27:16,790 INFO L284 TraceCheckUtils]: 92: Hoare quadruple {14879#(not (= |__VERIFIER_assert_#in~cond| 0))} {14847#(and (= main_~a~0 1) (not (<= (* main_~y~0 4) main_~x~0)) (<= main_~y~0 main_~r~0) (= main_~b~0 main_~y~0) (<= (div main_~q~0 2) 1) (= (mod main_~q~0 2) 0) (= main_~r~0 (+ main_~x~0 (* (- 2) main_~y~0))))} #85#return; {14886#(and (= main_~a~0 1) (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (<= main_~y~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~x~0 (+ main_~r~0 (* main_~y~0 2))) (< main_~x~0 (* main_~y~0 4)))} is VALID [2022-04-28 11:27:16,790 INFO L272 TraceCheckUtils]: 93: Hoare triple {14886#(and (= main_~a~0 1) (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (<= main_~y~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~x~0 (+ main_~r~0 (* main_~y~0 2))) (< main_~x~0 (* main_~y~0 4)))} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {14597#true} is VALID [2022-04-28 11:27:16,790 INFO L290 TraceCheckUtils]: 94: Hoare triple {14597#true} ~cond := #in~cond; {14597#true} is VALID [2022-04-28 11:27:16,791 INFO L290 TraceCheckUtils]: 95: Hoare triple {14597#true} assume !(0 == ~cond); {14597#true} is VALID [2022-04-28 11:27:16,791 INFO L290 TraceCheckUtils]: 96: Hoare triple {14597#true} assume true; {14597#true} is VALID [2022-04-28 11:27:16,799 INFO L284 TraceCheckUtils]: 97: Hoare quadruple {14597#true} {14886#(and (= main_~a~0 1) (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (<= main_~y~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~x~0 (+ main_~r~0 (* main_~y~0 2))) (< main_~x~0 (* main_~y~0 4)))} #87#return; {14886#(and (= main_~a~0 1) (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (<= main_~y~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~x~0 (+ main_~r~0 (* main_~y~0 2))) (< main_~x~0 (* main_~y~0 4)))} is VALID [2022-04-28 11:27:16,800 INFO L290 TraceCheckUtils]: 98: Hoare triple {14886#(and (= main_~a~0 1) (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (<= main_~y~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~x~0 (+ main_~r~0 (* main_~y~0 2))) (< main_~x~0 (* main_~y~0 4)))} assume !(~r~0 >= 2 * ~b~0); {14886#(and (= main_~a~0 1) (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (<= main_~y~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~x~0 (+ main_~r~0 (* main_~y~0 2))) (< main_~x~0 (* main_~y~0 4)))} is VALID [2022-04-28 11:27:16,801 INFO L290 TraceCheckUtils]: 99: Hoare triple {14886#(and (= main_~a~0 1) (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (<= main_~y~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~x~0 (+ main_~r~0 (* main_~y~0 2))) (< main_~x~0 (* main_~y~0 4)))} ~r~0 := ~r~0 - ~b~0;~q~0 := ~q~0 + ~a~0; {14908#(and (<= 0 main_~r~0) (= (+ (* main_~y~0 (+ (- 1) main_~q~0)) main_~y~0 main_~r~0) main_~x~0) (< main_~x~0 (* main_~y~0 4)) (= (+ main_~r~0 (* main_~y~0 3)) main_~x~0))} is VALID [2022-04-28 11:27:16,801 INFO L290 TraceCheckUtils]: 100: Hoare triple {14908#(and (<= 0 main_~r~0) (= (+ (* main_~y~0 (+ (- 1) main_~q~0)) main_~y~0 main_~r~0) main_~x~0) (< main_~x~0 (* main_~y~0 4)) (= (+ main_~r~0 (* main_~y~0 3)) main_~x~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {14908#(and (<= 0 main_~r~0) (= (+ (* main_~y~0 (+ (- 1) main_~q~0)) main_~y~0 main_~r~0) main_~x~0) (< main_~x~0 (* main_~y~0 4)) (= (+ main_~r~0 (* main_~y~0 3)) main_~x~0))} is VALID [2022-04-28 11:27:16,802 INFO L290 TraceCheckUtils]: 101: Hoare triple {14908#(and (<= 0 main_~r~0) (= (+ (* main_~y~0 (+ (- 1) main_~q~0)) main_~y~0 main_~r~0) main_~x~0) (< main_~x~0 (* main_~y~0 4)) (= (+ main_~r~0 (* main_~y~0 3)) main_~x~0))} assume !(#t~post6 < 20);havoc #t~post6; {14908#(and (<= 0 main_~r~0) (= (+ (* main_~y~0 (+ (- 1) main_~q~0)) main_~y~0 main_~r~0) main_~x~0) (< main_~x~0 (* main_~y~0 4)) (= (+ main_~r~0 (* main_~y~0 3)) main_~x~0))} is VALID [2022-04-28 11:27:16,802 INFO L272 TraceCheckUtils]: 102: Hoare triple {14908#(and (<= 0 main_~r~0) (= (+ (* main_~y~0 (+ (- 1) main_~q~0)) main_~y~0 main_~r~0) main_~x~0) (< main_~x~0 (* main_~y~0 4)) (= (+ main_~r~0 (* main_~y~0 3)) main_~x~0))} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {14918#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:27:16,802 INFO L290 TraceCheckUtils]: 103: Hoare triple {14918#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {14922#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:27:16,803 INFO L290 TraceCheckUtils]: 104: Hoare triple {14922#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {14598#false} is VALID [2022-04-28 11:27:16,803 INFO L290 TraceCheckUtils]: 105: Hoare triple {14598#false} assume !false; {14598#false} is VALID [2022-04-28 11:27:16,803 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 63 proven. 32 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2022-04-28 11:27:16,803 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:27:38,594 INFO L290 TraceCheckUtils]: 105: Hoare triple {14598#false} assume !false; {14598#false} is VALID [2022-04-28 11:27:38,595 INFO L290 TraceCheckUtils]: 104: Hoare triple {14922#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {14598#false} is VALID [2022-04-28 11:27:38,595 INFO L290 TraceCheckUtils]: 103: Hoare triple {14918#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {14922#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:27:38,595 INFO L272 TraceCheckUtils]: 102: Hoare triple {14938#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {14918#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:27:38,596 INFO L290 TraceCheckUtils]: 101: Hoare triple {14938#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} assume !(#t~post6 < 20);havoc #t~post6; {14938#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:27:38,596 INFO L290 TraceCheckUtils]: 100: Hoare triple {14938#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {14938#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:27:38,604 INFO L290 TraceCheckUtils]: 99: Hoare triple {14948#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} ~r~0 := ~r~0 - ~b~0;~q~0 := ~q~0 + ~a~0; {14938#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:27:38,604 INFO L290 TraceCheckUtils]: 98: Hoare triple {14948#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} assume !(~r~0 >= 2 * ~b~0); {14948#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} is VALID [2022-04-28 11:27:38,605 INFO L284 TraceCheckUtils]: 97: Hoare quadruple {14597#true} {14948#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} #87#return; {14948#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} is VALID [2022-04-28 11:27:38,605 INFO L290 TraceCheckUtils]: 96: Hoare triple {14597#true} assume true; {14597#true} is VALID [2022-04-28 11:27:38,605 INFO L290 TraceCheckUtils]: 95: Hoare triple {14597#true} assume !(0 == ~cond); {14597#true} is VALID [2022-04-28 11:27:38,605 INFO L290 TraceCheckUtils]: 94: Hoare triple {14597#true} ~cond := #in~cond; {14597#true} is VALID [2022-04-28 11:27:38,605 INFO L272 TraceCheckUtils]: 93: Hoare triple {14948#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {14597#true} is VALID [2022-04-28 11:27:38,606 INFO L284 TraceCheckUtils]: 92: Hoare quadruple {14879#(not (= |__VERIFIER_assert_#in~cond| 0))} {14970#(or (= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0)))) (not (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)))} #85#return; {14948#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} is VALID [2022-04-28 11:27:38,606 INFO L290 TraceCheckUtils]: 91: Hoare triple {14879#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {14879#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:27:38,606 INFO L290 TraceCheckUtils]: 90: Hoare triple {14980#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {14879#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:27:38,607 INFO L290 TraceCheckUtils]: 89: Hoare triple {14597#true} ~cond := #in~cond; {14980#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 11:27:38,607 INFO L272 TraceCheckUtils]: 88: Hoare triple {14970#(or (= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0)))) (not (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)))} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {14597#true} is VALID [2022-04-28 11:27:38,607 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {14597#true} {14970#(or (= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0)))) (not (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)))} #83#return; {14970#(or (= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0)))) (not (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)))} is VALID [2022-04-28 11:27:38,607 INFO L290 TraceCheckUtils]: 86: Hoare triple {14597#true} assume true; {14597#true} is VALID [2022-04-28 11:27:38,607 INFO L290 TraceCheckUtils]: 85: Hoare triple {14597#true} assume !(0 == ~cond); {14597#true} is VALID [2022-04-28 11:27:38,607 INFO L290 TraceCheckUtils]: 84: Hoare triple {14597#true} ~cond := #in~cond; {14597#true} is VALID [2022-04-28 11:27:38,607 INFO L272 TraceCheckUtils]: 83: Hoare triple {14970#(or (= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0)))) (not (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)))} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {14597#true} is VALID [2022-04-28 11:27:38,608 INFO L290 TraceCheckUtils]: 82: Hoare triple {14970#(or (= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0)))) (not (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)))} assume !!(#t~post7 < 20);havoc #t~post7; {14970#(or (= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0)))) (not (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)))} is VALID [2022-04-28 11:27:38,608 INFO L290 TraceCheckUtils]: 81: Hoare triple {14970#(or (= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0)))) (not (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {14970#(or (= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0)))) (not (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)))} is VALID [2022-04-28 11:27:38,609 INFO L290 TraceCheckUtils]: 80: Hoare triple {14597#true} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {14970#(or (= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0)))) (not (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)))} is VALID [2022-04-28 11:27:38,609 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {14597#true} {14597#true} #81#return; {14597#true} is VALID [2022-04-28 11:27:38,609 INFO L290 TraceCheckUtils]: 78: Hoare triple {14597#true} assume true; {14597#true} is VALID [2022-04-28 11:27:38,609 INFO L290 TraceCheckUtils]: 77: Hoare triple {14597#true} assume !(0 == ~cond); {14597#true} is VALID [2022-04-28 11:27:38,609 INFO L290 TraceCheckUtils]: 76: Hoare triple {14597#true} ~cond := #in~cond; {14597#true} is VALID [2022-04-28 11:27:38,609 INFO L272 TraceCheckUtils]: 75: Hoare triple {14597#true} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {14597#true} is VALID [2022-04-28 11:27:38,609 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {14597#true} {14597#true} #79#return; {14597#true} is VALID [2022-04-28 11:27:38,609 INFO L290 TraceCheckUtils]: 73: Hoare triple {14597#true} assume true; {14597#true} is VALID [2022-04-28 11:27:38,609 INFO L290 TraceCheckUtils]: 72: Hoare triple {14597#true} assume !(0 == ~cond); {14597#true} is VALID [2022-04-28 11:27:38,609 INFO L290 TraceCheckUtils]: 71: Hoare triple {14597#true} ~cond := #in~cond; {14597#true} is VALID [2022-04-28 11:27:38,609 INFO L272 TraceCheckUtils]: 70: Hoare triple {14597#true} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {14597#true} is VALID [2022-04-28 11:27:38,609 INFO L290 TraceCheckUtils]: 69: Hoare triple {14597#true} assume !!(#t~post6 < 20);havoc #t~post6; {14597#true} is VALID [2022-04-28 11:27:38,609 INFO L290 TraceCheckUtils]: 68: Hoare triple {14597#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {14597#true} is VALID [2022-04-28 11:27:38,609 INFO L290 TraceCheckUtils]: 67: Hoare triple {14597#true} ~r~0 := ~r~0 - ~b~0;~q~0 := ~q~0 + ~a~0; {14597#true} is VALID [2022-04-28 11:27:38,609 INFO L290 TraceCheckUtils]: 66: Hoare triple {14597#true} assume !(~r~0 >= 2 * ~b~0); {14597#true} is VALID [2022-04-28 11:27:38,609 INFO L284 TraceCheckUtils]: 65: Hoare quadruple {14597#true} {14597#true} #87#return; {14597#true} is VALID [2022-04-28 11:27:38,609 INFO L290 TraceCheckUtils]: 64: Hoare triple {14597#true} assume true; {14597#true} is VALID [2022-04-28 11:27:38,610 INFO L290 TraceCheckUtils]: 63: Hoare triple {14597#true} assume !(0 == ~cond); {14597#true} is VALID [2022-04-28 11:27:38,610 INFO L290 TraceCheckUtils]: 62: Hoare triple {14597#true} ~cond := #in~cond; {14597#true} is VALID [2022-04-28 11:27:38,610 INFO L272 TraceCheckUtils]: 61: Hoare triple {14597#true} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {14597#true} is VALID [2022-04-28 11:27:38,610 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {14597#true} {14597#true} #85#return; {14597#true} is VALID [2022-04-28 11:27:38,610 INFO L290 TraceCheckUtils]: 59: Hoare triple {14597#true} assume true; {14597#true} is VALID [2022-04-28 11:27:38,610 INFO L290 TraceCheckUtils]: 58: Hoare triple {14597#true} assume !(0 == ~cond); {14597#true} is VALID [2022-04-28 11:27:38,610 INFO L290 TraceCheckUtils]: 57: Hoare triple {14597#true} ~cond := #in~cond; {14597#true} is VALID [2022-04-28 11:27:38,610 INFO L272 TraceCheckUtils]: 56: Hoare triple {14597#true} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {14597#true} is VALID [2022-04-28 11:27:38,610 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {14597#true} {14597#true} #83#return; {14597#true} is VALID [2022-04-28 11:27:38,610 INFO L290 TraceCheckUtils]: 54: Hoare triple {14597#true} assume true; {14597#true} is VALID [2022-04-28 11:27:38,610 INFO L290 TraceCheckUtils]: 53: Hoare triple {14597#true} assume !(0 == ~cond); {14597#true} is VALID [2022-04-28 11:27:38,610 INFO L290 TraceCheckUtils]: 52: Hoare triple {14597#true} ~cond := #in~cond; {14597#true} is VALID [2022-04-28 11:27:38,610 INFO L272 TraceCheckUtils]: 51: Hoare triple {14597#true} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {14597#true} is VALID [2022-04-28 11:27:38,610 INFO L290 TraceCheckUtils]: 50: Hoare triple {14597#true} assume !!(#t~post7 < 20);havoc #t~post7; {14597#true} is VALID [2022-04-28 11:27:38,610 INFO L290 TraceCheckUtils]: 49: Hoare triple {14597#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {14597#true} is VALID [2022-04-28 11:27:38,610 INFO L290 TraceCheckUtils]: 48: Hoare triple {14597#true} ~a~0 := 2 * ~a~0;~b~0 := 2 * ~b~0; {14597#true} is VALID [2022-04-28 11:27:38,610 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {14597#true} {14597#true} #89#return; {14597#true} is VALID [2022-04-28 11:27:38,610 INFO L290 TraceCheckUtils]: 46: Hoare triple {14597#true} assume true; {14597#true} is VALID [2022-04-28 11:27:38,611 INFO L290 TraceCheckUtils]: 45: Hoare triple {14597#true} assume !(0 == ~cond); {14597#true} is VALID [2022-04-28 11:27:38,611 INFO L290 TraceCheckUtils]: 44: Hoare triple {14597#true} ~cond := #in~cond; {14597#true} is VALID [2022-04-28 11:27:38,611 INFO L272 TraceCheckUtils]: 43: Hoare triple {14597#true} call __VERIFIER_assert((if ~r~0 >= 2 * ~y~0 * ~a~0 then 1 else 0)); {14597#true} is VALID [2022-04-28 11:27:38,611 INFO L290 TraceCheckUtils]: 42: Hoare triple {14597#true} assume !!(~r~0 >= 2 * ~b~0); {14597#true} is VALID [2022-04-28 11:27:38,611 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {14597#true} {14597#true} #87#return; {14597#true} is VALID [2022-04-28 11:27:38,611 INFO L290 TraceCheckUtils]: 40: Hoare triple {14597#true} assume true; {14597#true} is VALID [2022-04-28 11:27:38,611 INFO L290 TraceCheckUtils]: 39: Hoare triple {14597#true} assume !(0 == ~cond); {14597#true} is VALID [2022-04-28 11:27:38,611 INFO L290 TraceCheckUtils]: 38: Hoare triple {14597#true} ~cond := #in~cond; {14597#true} is VALID [2022-04-28 11:27:38,611 INFO L272 TraceCheckUtils]: 37: Hoare triple {14597#true} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {14597#true} is VALID [2022-04-28 11:27:38,611 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {14597#true} {14597#true} #85#return; {14597#true} is VALID [2022-04-28 11:27:38,611 INFO L290 TraceCheckUtils]: 35: Hoare triple {14597#true} assume true; {14597#true} is VALID [2022-04-28 11:27:38,611 INFO L290 TraceCheckUtils]: 34: Hoare triple {14597#true} assume !(0 == ~cond); {14597#true} is VALID [2022-04-28 11:27:38,611 INFO L290 TraceCheckUtils]: 33: Hoare triple {14597#true} ~cond := #in~cond; {14597#true} is VALID [2022-04-28 11:27:38,611 INFO L272 TraceCheckUtils]: 32: Hoare triple {14597#true} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {14597#true} is VALID [2022-04-28 11:27:38,611 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {14597#true} {14597#true} #83#return; {14597#true} is VALID [2022-04-28 11:27:38,611 INFO L290 TraceCheckUtils]: 30: Hoare triple {14597#true} assume true; {14597#true} is VALID [2022-04-28 11:27:38,611 INFO L290 TraceCheckUtils]: 29: Hoare triple {14597#true} assume !(0 == ~cond); {14597#true} is VALID [2022-04-28 11:27:38,611 INFO L290 TraceCheckUtils]: 28: Hoare triple {14597#true} ~cond := #in~cond; {14597#true} is VALID [2022-04-28 11:27:38,612 INFO L272 TraceCheckUtils]: 27: Hoare triple {14597#true} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {14597#true} is VALID [2022-04-28 11:27:38,612 INFO L290 TraceCheckUtils]: 26: Hoare triple {14597#true} assume !!(#t~post7 < 20);havoc #t~post7; {14597#true} is VALID [2022-04-28 11:27:38,612 INFO L290 TraceCheckUtils]: 25: Hoare triple {14597#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {14597#true} is VALID [2022-04-28 11:27:38,612 INFO L290 TraceCheckUtils]: 24: Hoare triple {14597#true} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {14597#true} is VALID [2022-04-28 11:27:38,612 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {14597#true} {14597#true} #81#return; {14597#true} is VALID [2022-04-28 11:27:38,612 INFO L290 TraceCheckUtils]: 22: Hoare triple {14597#true} assume true; {14597#true} is VALID [2022-04-28 11:27:38,612 INFO L290 TraceCheckUtils]: 21: Hoare triple {14597#true} assume !(0 == ~cond); {14597#true} is VALID [2022-04-28 11:27:38,612 INFO L290 TraceCheckUtils]: 20: Hoare triple {14597#true} ~cond := #in~cond; {14597#true} is VALID [2022-04-28 11:27:38,612 INFO L272 TraceCheckUtils]: 19: Hoare triple {14597#true} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {14597#true} is VALID [2022-04-28 11:27:38,612 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {14597#true} {14597#true} #79#return; {14597#true} is VALID [2022-04-28 11:27:38,612 INFO L290 TraceCheckUtils]: 17: Hoare triple {14597#true} assume true; {14597#true} is VALID [2022-04-28 11:27:38,612 INFO L290 TraceCheckUtils]: 16: Hoare triple {14597#true} assume !(0 == ~cond); {14597#true} is VALID [2022-04-28 11:27:38,612 INFO L290 TraceCheckUtils]: 15: Hoare triple {14597#true} ~cond := #in~cond; {14597#true} is VALID [2022-04-28 11:27:38,612 INFO L272 TraceCheckUtils]: 14: Hoare triple {14597#true} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {14597#true} is VALID [2022-04-28 11:27:38,612 INFO L290 TraceCheckUtils]: 13: Hoare triple {14597#true} assume !!(#t~post6 < 20);havoc #t~post6; {14597#true} is VALID [2022-04-28 11:27:38,612 INFO L290 TraceCheckUtils]: 12: Hoare triple {14597#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {14597#true} is VALID [2022-04-28 11:27:38,612 INFO L290 TraceCheckUtils]: 11: Hoare triple {14597#true} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {14597#true} is VALID [2022-04-28 11:27:38,613 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {14597#true} {14597#true} #77#return; {14597#true} is VALID [2022-04-28 11:27:38,613 INFO L290 TraceCheckUtils]: 9: Hoare triple {14597#true} assume true; {14597#true} is VALID [2022-04-28 11:27:38,613 INFO L290 TraceCheckUtils]: 8: Hoare triple {14597#true} assume !(0 == ~cond); {14597#true} is VALID [2022-04-28 11:27:38,613 INFO L290 TraceCheckUtils]: 7: Hoare triple {14597#true} ~cond := #in~cond; {14597#true} is VALID [2022-04-28 11:27:38,613 INFO L272 TraceCheckUtils]: 6: Hoare triple {14597#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {14597#true} is VALID [2022-04-28 11:27:38,613 INFO L290 TraceCheckUtils]: 5: Hoare triple {14597#true} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~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; {14597#true} is VALID [2022-04-28 11:27:38,613 INFO L272 TraceCheckUtils]: 4: Hoare triple {14597#true} call #t~ret8 := main(); {14597#true} is VALID [2022-04-28 11:27:38,613 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14597#true} {14597#true} #93#return; {14597#true} is VALID [2022-04-28 11:27:38,613 INFO L290 TraceCheckUtils]: 2: Hoare triple {14597#true} assume true; {14597#true} is VALID [2022-04-28 11:27:38,613 INFO L290 TraceCheckUtils]: 1: Hoare triple {14597#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(14, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {14597#true} is VALID [2022-04-28 11:27:38,613 INFO L272 TraceCheckUtils]: 0: Hoare triple {14597#true} call ULTIMATE.init(); {14597#true} is VALID [2022-04-28 11:27:38,613 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 80 proven. 4 refuted. 0 times theorem prover too weak. 336 trivial. 0 not checked. [2022-04-28 11:27:38,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:27:38,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364325792] [2022-04-28 11:27:38,614 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:27:38,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [564920806] [2022-04-28 11:27:38,614 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [564920806] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 11:27:38,614 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 11:27:38,614 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9] total 18 [2022-04-28 11:27:38,614 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:27:38,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [183620002] [2022-04-28 11:27:38,614 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [183620002] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:27:38,614 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:27:38,614 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-28 11:27:38,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943921645] [2022-04-28 11:27:38,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:27:38,615 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 13 states have internal predecessors, (36), 8 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 7 states have call predecessors, (16), 7 states have call successors, (16) Word has length 106 [2022-04-28 11:27:38,615 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:27:38,615 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 13 states have internal predecessors, (36), 8 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 7 states have call predecessors, (16), 7 states have call successors, (16) [2022-04-28 11:27:38,686 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:27:38,686 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-28 11:27:38,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:27:38,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-28 11:27:38,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2022-04-28 11:27:38,687 INFO L87 Difference]: Start difference. First operand 196 states and 232 transitions. Second operand has 14 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 13 states have internal predecessors, (36), 8 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 7 states have call predecessors, (16), 7 states have call successors, (16) [2022-04-28 11:27:41,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:27:41,876 INFO L93 Difference]: Finished difference Result 281 states and 343 transitions. [2022-04-28 11:27:41,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-28 11:27:41,876 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 13 states have internal predecessors, (36), 8 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 7 states have call predecessors, (16), 7 states have call successors, (16) Word has length 106 [2022-04-28 11:27:41,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:27:41,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 13 states have internal predecessors, (36), 8 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 7 states have call predecessors, (16), 7 states have call successors, (16) [2022-04-28 11:27:41,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 151 transitions. [2022-04-28 11:27:41,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 13 states have internal predecessors, (36), 8 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 7 states have call predecessors, (16), 7 states have call successors, (16) [2022-04-28 11:27:41,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 151 transitions. [2022-04-28 11:27:41,880 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 151 transitions. [2022-04-28 11:27:42,014 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 151 edges. 151 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:27:42,017 INFO L225 Difference]: With dead ends: 281 [2022-04-28 11:27:42,017 INFO L226 Difference]: Without dead ends: 185 [2022-04-28 11:27:42,018 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 194 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=67, Invalid=313, Unknown=0, NotChecked=0, Total=380 [2022-04-28 11:27:42,018 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 31 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 549 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 549 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-04-28 11:27:42,018 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 293 Invalid, 578 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 549 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-04-28 11:27:42,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2022-04-28 11:27:42,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 184. [2022-04-28 11:27:42,256 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:27:42,256 INFO L82 GeneralOperation]: Start isEquivalent. First operand 185 states. Second operand has 184 states, 118 states have (on average 1.1355932203389831) internal successors, (134), 120 states have internal predecessors, (134), 43 states have call successors, (43), 23 states have call predecessors, (43), 22 states have return successors, (41), 40 states have call predecessors, (41), 41 states have call successors, (41) [2022-04-28 11:27:42,257 INFO L74 IsIncluded]: Start isIncluded. First operand 185 states. Second operand has 184 states, 118 states have (on average 1.1355932203389831) internal successors, (134), 120 states have internal predecessors, (134), 43 states have call successors, (43), 23 states have call predecessors, (43), 22 states have return successors, (41), 40 states have call predecessors, (41), 41 states have call successors, (41) [2022-04-28 11:27:42,257 INFO L87 Difference]: Start difference. First operand 185 states. Second operand has 184 states, 118 states have (on average 1.1355932203389831) internal successors, (134), 120 states have internal predecessors, (134), 43 states have call successors, (43), 23 states have call predecessors, (43), 22 states have return successors, (41), 40 states have call predecessors, (41), 41 states have call successors, (41) [2022-04-28 11:27:42,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:27:42,260 INFO L93 Difference]: Finished difference Result 185 states and 219 transitions. [2022-04-28 11:27:42,260 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 219 transitions. [2022-04-28 11:27:42,260 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:27:42,260 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:27:42,261 INFO L74 IsIncluded]: Start isIncluded. First operand has 184 states, 118 states have (on average 1.1355932203389831) internal successors, (134), 120 states have internal predecessors, (134), 43 states have call successors, (43), 23 states have call predecessors, (43), 22 states have return successors, (41), 40 states have call predecessors, (41), 41 states have call successors, (41) Second operand 185 states. [2022-04-28 11:27:42,261 INFO L87 Difference]: Start difference. First operand has 184 states, 118 states have (on average 1.1355932203389831) internal successors, (134), 120 states have internal predecessors, (134), 43 states have call successors, (43), 23 states have call predecessors, (43), 22 states have return successors, (41), 40 states have call predecessors, (41), 41 states have call successors, (41) Second operand 185 states. [2022-04-28 11:27:42,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:27:42,266 INFO L93 Difference]: Finished difference Result 185 states and 219 transitions. [2022-04-28 11:27:42,266 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 219 transitions. [2022-04-28 11:27:42,267 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:27:42,267 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:27:42,267 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:27:42,267 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:27:42,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 118 states have (on average 1.1355932203389831) internal successors, (134), 120 states have internal predecessors, (134), 43 states have call successors, (43), 23 states have call predecessors, (43), 22 states have return successors, (41), 40 states have call predecessors, (41), 41 states have call successors, (41) [2022-04-28 11:27:42,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 218 transitions. [2022-04-28 11:27:42,270 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 218 transitions. Word has length 106 [2022-04-28 11:27:42,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:27:42,270 INFO L495 AbstractCegarLoop]: Abstraction has 184 states and 218 transitions. [2022-04-28 11:27:42,270 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 13 states have internal predecessors, (36), 8 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 7 states have call predecessors, (16), 7 states have call successors, (16) [2022-04-28 11:27:42,270 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 184 states and 218 transitions. [2022-04-28 11:27:42,514 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 218 edges. 218 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:27:42,514 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 218 transitions. [2022-04-28 11:27:42,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-04-28 11:27:42,515 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:27:42,515 INFO L195 NwaCegarLoop]: trace histogram [16, 15, 15, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-04-28 11:27:42,545 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-28 11:27:42,716 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-28 11:27:42,716 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:27:42,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:27:42,716 INFO L85 PathProgramCache]: Analyzing trace with hash 2077207105, now seen corresponding path program 3 times [2022-04-28 11:27:42,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:27:42,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1803881488] [2022-04-28 11:28:14,186 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:28:14,186 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:28:14,186 INFO L85 PathProgramCache]: Analyzing trace with hash 2077207105, now seen corresponding path program 4 times [2022-04-28 11:28:14,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:28:14,186 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806770231] [2022-04-28 11:28:14,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:28:14,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:28:14,211 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:28:14,211 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [979325277] [2022-04-28 11:28:14,211 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 11:28:14,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:28:14,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:28:14,212 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-28 11:28:14,213 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-28 11:28:14,292 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 11:28:14,292 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:28:14,293 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 37 conjunts are in the unsatisfiable core [2022-04-28 11:28:14,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:28:14,310 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:29:46,941 INFO L272 TraceCheckUtils]: 0: Hoare triple {16554#true} call ULTIMATE.init(); {16554#true} is VALID [2022-04-28 11:29:46,942 INFO L290 TraceCheckUtils]: 1: Hoare triple {16554#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(14, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {16554#true} is VALID [2022-04-28 11:29:46,942 INFO L290 TraceCheckUtils]: 2: Hoare triple {16554#true} assume true; {16554#true} is VALID [2022-04-28 11:29:46,942 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16554#true} {16554#true} #93#return; {16554#true} is VALID [2022-04-28 11:29:46,942 INFO L272 TraceCheckUtils]: 4: Hoare triple {16554#true} call #t~ret8 := main(); {16554#true} is VALID [2022-04-28 11:29:46,942 INFO L290 TraceCheckUtils]: 5: Hoare triple {16554#true} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~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; {16554#true} is VALID [2022-04-28 11:29:46,942 INFO L272 TraceCheckUtils]: 6: Hoare triple {16554#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {16554#true} is VALID [2022-04-28 11:29:46,942 INFO L290 TraceCheckUtils]: 7: Hoare triple {16554#true} ~cond := #in~cond; {16554#true} is VALID [2022-04-28 11:29:46,942 INFO L290 TraceCheckUtils]: 8: Hoare triple {16554#true} assume !(0 == ~cond); {16554#true} is VALID [2022-04-28 11:29:46,942 INFO L290 TraceCheckUtils]: 9: Hoare triple {16554#true} assume true; {16554#true} is VALID [2022-04-28 11:29:46,942 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {16554#true} {16554#true} #77#return; {16554#true} is VALID [2022-04-28 11:29:46,943 INFO L290 TraceCheckUtils]: 11: Hoare triple {16554#true} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {16592#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:29:46,943 INFO L290 TraceCheckUtils]: 12: Hoare triple {16592#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {16592#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:29:46,943 INFO L290 TraceCheckUtils]: 13: Hoare triple {16592#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} assume !!(#t~post6 < 20);havoc #t~post6; {16592#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:29:46,943 INFO L272 TraceCheckUtils]: 14: Hoare triple {16592#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {16554#true} is VALID [2022-04-28 11:29:46,944 INFO L290 TraceCheckUtils]: 15: Hoare triple {16554#true} ~cond := #in~cond; {16554#true} is VALID [2022-04-28 11:29:46,944 INFO L290 TraceCheckUtils]: 16: Hoare triple {16554#true} assume !(0 == ~cond); {16554#true} is VALID [2022-04-28 11:29:46,944 INFO L290 TraceCheckUtils]: 17: Hoare triple {16554#true} assume true; {16554#true} is VALID [2022-04-28 11:29:46,944 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {16554#true} {16592#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #79#return; {16592#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:29:46,944 INFO L272 TraceCheckUtils]: 19: Hoare triple {16592#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {16554#true} is VALID [2022-04-28 11:29:46,944 INFO L290 TraceCheckUtils]: 20: Hoare triple {16554#true} ~cond := #in~cond; {16554#true} is VALID [2022-04-28 11:29:46,944 INFO L290 TraceCheckUtils]: 21: Hoare triple {16554#true} assume !(0 == ~cond); {16554#true} is VALID [2022-04-28 11:29:46,944 INFO L290 TraceCheckUtils]: 22: Hoare triple {16554#true} assume true; {16554#true} is VALID [2022-04-28 11:29:46,945 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {16554#true} {16592#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #81#return; {16592#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:29:46,945 INFO L290 TraceCheckUtils]: 24: Hoare triple {16592#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {16632#(and (<= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-28 11:29:46,946 INFO L290 TraceCheckUtils]: 25: Hoare triple {16632#(and (<= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {16632#(and (<= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-28 11:29:46,946 INFO L290 TraceCheckUtils]: 26: Hoare triple {16632#(and (<= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} assume !!(#t~post7 < 20);havoc #t~post7; {16632#(and (<= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-28 11:29:46,946 INFO L272 TraceCheckUtils]: 27: Hoare triple {16632#(and (<= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {16554#true} is VALID [2022-04-28 11:29:46,946 INFO L290 TraceCheckUtils]: 28: Hoare triple {16554#true} ~cond := #in~cond; {16554#true} is VALID [2022-04-28 11:29:46,946 INFO L290 TraceCheckUtils]: 29: Hoare triple {16554#true} assume !(0 == ~cond); {16554#true} is VALID [2022-04-28 11:29:46,946 INFO L290 TraceCheckUtils]: 30: Hoare triple {16554#true} assume true; {16554#true} is VALID [2022-04-28 11:29:46,947 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {16554#true} {16632#(and (<= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #83#return; {16632#(and (<= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-28 11:29:46,947 INFO L272 TraceCheckUtils]: 32: Hoare triple {16632#(and (<= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {16554#true} is VALID [2022-04-28 11:29:46,947 INFO L290 TraceCheckUtils]: 33: Hoare triple {16554#true} ~cond := #in~cond; {16554#true} is VALID [2022-04-28 11:29:46,947 INFO L290 TraceCheckUtils]: 34: Hoare triple {16554#true} assume !(0 == ~cond); {16554#true} is VALID [2022-04-28 11:29:46,947 INFO L290 TraceCheckUtils]: 35: Hoare triple {16554#true} assume true; {16554#true} is VALID [2022-04-28 11:29:46,947 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {16554#true} {16632#(and (<= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #85#return; {16632#(and (<= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-28 11:29:46,947 INFO L272 TraceCheckUtils]: 37: Hoare triple {16632#(and (<= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {16554#true} is VALID [2022-04-28 11:29:46,948 INFO L290 TraceCheckUtils]: 38: Hoare triple {16554#true} ~cond := #in~cond; {16554#true} is VALID [2022-04-28 11:29:46,948 INFO L290 TraceCheckUtils]: 39: Hoare triple {16554#true} assume !(0 == ~cond); {16554#true} is VALID [2022-04-28 11:29:46,948 INFO L290 TraceCheckUtils]: 40: Hoare triple {16554#true} assume true; {16554#true} is VALID [2022-04-28 11:29:46,948 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {16554#true} {16632#(and (<= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #87#return; {16632#(and (<= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-28 11:29:46,948 INFO L290 TraceCheckUtils]: 42: Hoare triple {16632#(and (<= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} assume !!(~r~0 >= 2 * ~b~0); {16632#(and (<= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-28 11:29:46,949 INFO L272 TraceCheckUtils]: 43: Hoare triple {16632#(and (<= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~r~0 >= 2 * ~y~0 * ~a~0 then 1 else 0)); {16554#true} is VALID [2022-04-28 11:29:46,949 INFO L290 TraceCheckUtils]: 44: Hoare triple {16554#true} ~cond := #in~cond; {16554#true} is VALID [2022-04-28 11:29:46,949 INFO L290 TraceCheckUtils]: 45: Hoare triple {16554#true} assume !(0 == ~cond); {16554#true} is VALID [2022-04-28 11:29:46,949 INFO L290 TraceCheckUtils]: 46: Hoare triple {16554#true} assume true; {16554#true} is VALID [2022-04-28 11:29:46,949 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {16554#true} {16632#(and (<= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #89#return; {16632#(and (<= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-28 11:29:46,950 INFO L290 TraceCheckUtils]: 48: Hoare triple {16632#(and (<= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} ~a~0 := 2 * ~a~0;~b~0 := 2 * ~b~0; {16705#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (<= (div (* (- 1) main_~a~0) (- 2)) 1) (= main_~q~0 0))} is VALID [2022-04-28 11:29:46,951 INFO L290 TraceCheckUtils]: 49: Hoare triple {16705#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (<= (div (* (- 1) main_~a~0) (- 2)) 1) (= main_~q~0 0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {16705#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (<= (div (* (- 1) main_~a~0) (- 2)) 1) (= main_~q~0 0))} is VALID [2022-04-28 11:29:46,951 INFO L290 TraceCheckUtils]: 50: Hoare triple {16705#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (<= (div (* (- 1) main_~a~0) (- 2)) 1) (= main_~q~0 0))} assume !!(#t~post7 < 20);havoc #t~post7; {16705#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (<= (div (* (- 1) main_~a~0) (- 2)) 1) (= main_~q~0 0))} is VALID [2022-04-28 11:29:46,951 INFO L272 TraceCheckUtils]: 51: Hoare triple {16705#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (<= (div (* (- 1) main_~a~0) (- 2)) 1) (= main_~q~0 0))} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {16554#true} is VALID [2022-04-28 11:29:46,951 INFO L290 TraceCheckUtils]: 52: Hoare triple {16554#true} ~cond := #in~cond; {16718#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:29:46,952 INFO L290 TraceCheckUtils]: 53: Hoare triple {16718#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {16722#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:29:46,952 INFO L290 TraceCheckUtils]: 54: Hoare triple {16722#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {16722#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:29:46,953 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {16722#(not (= |__VERIFIER_assert_#in~cond| 0))} {16705#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (<= (div (* (- 1) main_~a~0) (- 2)) 1) (= main_~q~0 0))} #83#return; {16729#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (<= (div (* (- 1) main_~a~0) (- 2)) 1) (= main_~q~0 0) (= main_~b~0 (* main_~a~0 main_~y~0)))} is VALID [2022-04-28 11:29:46,953 INFO L272 TraceCheckUtils]: 56: Hoare triple {16729#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (<= (div (* (- 1) main_~a~0) (- 2)) 1) (= main_~q~0 0) (= main_~b~0 (* main_~a~0 main_~y~0)))} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {16554#true} is VALID [2022-04-28 11:29:46,953 INFO L290 TraceCheckUtils]: 57: Hoare triple {16554#true} ~cond := #in~cond; {16554#true} is VALID [2022-04-28 11:29:46,953 INFO L290 TraceCheckUtils]: 58: Hoare triple {16554#true} assume !(0 == ~cond); {16554#true} is VALID [2022-04-28 11:29:46,953 INFO L290 TraceCheckUtils]: 59: Hoare triple {16554#true} assume true; {16554#true} is VALID [2022-04-28 11:29:46,954 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {16554#true} {16729#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (<= (div (* (- 1) main_~a~0) (- 2)) 1) (= main_~q~0 0) (= main_~b~0 (* main_~a~0 main_~y~0)))} #85#return; {16729#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (<= (div (* (- 1) main_~a~0) (- 2)) 1) (= main_~q~0 0) (= main_~b~0 (* main_~a~0 main_~y~0)))} is VALID [2022-04-28 11:29:46,954 INFO L272 TraceCheckUtils]: 61: Hoare triple {16729#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (<= (div (* (- 1) main_~a~0) (- 2)) 1) (= main_~q~0 0) (= main_~b~0 (* main_~a~0 main_~y~0)))} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {16554#true} is VALID [2022-04-28 11:29:46,954 INFO L290 TraceCheckUtils]: 62: Hoare triple {16554#true} ~cond := #in~cond; {16554#true} is VALID [2022-04-28 11:29:46,954 INFO L290 TraceCheckUtils]: 63: Hoare triple {16554#true} assume !(0 == ~cond); {16554#true} is VALID [2022-04-28 11:29:46,954 INFO L290 TraceCheckUtils]: 64: Hoare triple {16554#true} assume true; {16554#true} is VALID [2022-04-28 11:29:46,954 INFO L284 TraceCheckUtils]: 65: Hoare quadruple {16554#true} {16729#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (<= (div (* (- 1) main_~a~0) (- 2)) 1) (= main_~q~0 0) (= main_~b~0 (* main_~a~0 main_~y~0)))} #87#return; {16729#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (<= (div (* (- 1) main_~a~0) (- 2)) 1) (= main_~q~0 0) (= main_~b~0 (* main_~a~0 main_~y~0)))} is VALID [2022-04-28 11:29:46,955 INFO L290 TraceCheckUtils]: 66: Hoare triple {16729#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (<= (div (* (- 1) main_~a~0) (- 2)) 1) (= main_~q~0 0) (= main_~b~0 (* main_~a~0 main_~y~0)))} assume !!(~r~0 >= 2 * ~b~0); {16729#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (<= (div (* (- 1) main_~a~0) (- 2)) 1) (= main_~q~0 0) (= main_~b~0 (* main_~a~0 main_~y~0)))} is VALID [2022-04-28 11:29:46,955 INFO L272 TraceCheckUtils]: 67: Hoare triple {16729#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (<= (div (* (- 1) main_~a~0) (- 2)) 1) (= main_~q~0 0) (= main_~b~0 (* main_~a~0 main_~y~0)))} call __VERIFIER_assert((if ~r~0 >= 2 * ~y~0 * ~a~0 then 1 else 0)); {16554#true} is VALID [2022-04-28 11:29:46,955 INFO L290 TraceCheckUtils]: 68: Hoare triple {16554#true} ~cond := #in~cond; {16554#true} is VALID [2022-04-28 11:29:46,955 INFO L290 TraceCheckUtils]: 69: Hoare triple {16554#true} assume !(0 == ~cond); {16554#true} is VALID [2022-04-28 11:29:46,955 INFO L290 TraceCheckUtils]: 70: Hoare triple {16554#true} assume true; {16554#true} is VALID [2022-04-28 11:29:46,955 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {16554#true} {16729#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (<= (div (* (- 1) main_~a~0) (- 2)) 1) (= main_~q~0 0) (= main_~b~0 (* main_~a~0 main_~y~0)))} #89#return; {16729#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (<= (div (* (- 1) main_~a~0) (- 2)) 1) (= main_~q~0 0) (= main_~b~0 (* main_~a~0 main_~y~0)))} is VALID [2022-04-28 11:29:46,960 INFO L290 TraceCheckUtils]: 72: Hoare triple {16729#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (<= (div (* (- 1) main_~a~0) (- 2)) 1) (= main_~q~0 0) (= main_~b~0 (* main_~a~0 main_~y~0)))} ~a~0 := 2 * ~a~0;~b~0 := 2 * ~b~0; {16781#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (<= (div (* (- 1) (div (* (- 1) main_~a~0) (- 2))) (- 2)) 1) (= (mod (div (- main_~a~0) (- 2)) 2) 0) (= (* (div (- main_~a~0) (- 2)) main_~y~0) (* main_~y~0 2)) (= main_~q~0 0) (= (* (* (div (- main_~a~0) (- 2)) main_~y~0) 2) main_~b~0))} is VALID [2022-04-28 11:29:46,960 INFO L290 TraceCheckUtils]: 73: Hoare triple {16781#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (<= (div (* (- 1) (div (* (- 1) main_~a~0) (- 2))) (- 2)) 1) (= (mod (div (- main_~a~0) (- 2)) 2) 0) (= (* (div (- main_~a~0) (- 2)) main_~y~0) (* main_~y~0 2)) (= main_~q~0 0) (= (* (* (div (- main_~a~0) (- 2)) main_~y~0) 2) main_~b~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {16781#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (<= (div (* (- 1) (div (* (- 1) main_~a~0) (- 2))) (- 2)) 1) (= (mod (div (- main_~a~0) (- 2)) 2) 0) (= (* (div (- main_~a~0) (- 2)) main_~y~0) (* main_~y~0 2)) (= main_~q~0 0) (= (* (* (div (- main_~a~0) (- 2)) main_~y~0) 2) main_~b~0))} is VALID [2022-04-28 11:29:46,961 INFO L290 TraceCheckUtils]: 74: Hoare triple {16781#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (<= (div (* (- 1) (div (* (- 1) main_~a~0) (- 2))) (- 2)) 1) (= (mod (div (- main_~a~0) (- 2)) 2) 0) (= (* (div (- main_~a~0) (- 2)) main_~y~0) (* main_~y~0 2)) (= main_~q~0 0) (= (* (* (div (- main_~a~0) (- 2)) main_~y~0) 2) main_~b~0))} assume !!(#t~post7 < 20);havoc #t~post7; {16781#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (<= (div (* (- 1) (div (* (- 1) main_~a~0) (- 2))) (- 2)) 1) (= (mod (div (- main_~a~0) (- 2)) 2) 0) (= (* (div (- main_~a~0) (- 2)) main_~y~0) (* main_~y~0 2)) (= main_~q~0 0) (= (* (* (div (- main_~a~0) (- 2)) main_~y~0) 2) main_~b~0))} is VALID [2022-04-28 11:29:46,961 INFO L272 TraceCheckUtils]: 75: Hoare triple {16781#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (<= (div (* (- 1) (div (* (- 1) main_~a~0) (- 2))) (- 2)) 1) (= (mod (div (- main_~a~0) (- 2)) 2) 0) (= (* (div (- main_~a~0) (- 2)) main_~y~0) (* main_~y~0 2)) (= main_~q~0 0) (= (* (* (div (- main_~a~0) (- 2)) main_~y~0) 2) main_~b~0))} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {16554#true} is VALID [2022-04-28 11:29:46,961 INFO L290 TraceCheckUtils]: 76: Hoare triple {16554#true} ~cond := #in~cond; {16554#true} is VALID [2022-04-28 11:29:46,961 INFO L290 TraceCheckUtils]: 77: Hoare triple {16554#true} assume !(0 == ~cond); {16554#true} is VALID [2022-04-28 11:29:46,961 INFO L290 TraceCheckUtils]: 78: Hoare triple {16554#true} assume true; {16554#true} is VALID [2022-04-28 11:29:46,961 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {16554#true} {16781#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (<= (div (* (- 1) (div (* (- 1) main_~a~0) (- 2))) (- 2)) 1) (= (mod (div (- main_~a~0) (- 2)) 2) 0) (= (* (div (- main_~a~0) (- 2)) main_~y~0) (* main_~y~0 2)) (= main_~q~0 0) (= (* (* (div (- main_~a~0) (- 2)) main_~y~0) 2) main_~b~0))} #83#return; {16781#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (<= (div (* (- 1) (div (* (- 1) main_~a~0) (- 2))) (- 2)) 1) (= (mod (div (- main_~a~0) (- 2)) 2) 0) (= (* (div (- main_~a~0) (- 2)) main_~y~0) (* main_~y~0 2)) (= main_~q~0 0) (= (* (* (div (- main_~a~0) (- 2)) main_~y~0) 2) main_~b~0))} is VALID [2022-04-28 11:29:46,961 INFO L272 TraceCheckUtils]: 80: Hoare triple {16781#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (<= (div (* (- 1) (div (* (- 1) main_~a~0) (- 2))) (- 2)) 1) (= (mod (div (- main_~a~0) (- 2)) 2) 0) (= (* (div (- main_~a~0) (- 2)) main_~y~0) (* main_~y~0 2)) (= main_~q~0 0) (= (* (* (div (- main_~a~0) (- 2)) main_~y~0) 2) main_~b~0))} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {16554#true} is VALID [2022-04-28 11:29:46,962 INFO L290 TraceCheckUtils]: 81: Hoare triple {16554#true} ~cond := #in~cond; {16554#true} is VALID [2022-04-28 11:29:46,962 INFO L290 TraceCheckUtils]: 82: Hoare triple {16554#true} assume !(0 == ~cond); {16554#true} is VALID [2022-04-28 11:29:46,962 INFO L290 TraceCheckUtils]: 83: Hoare triple {16554#true} assume true; {16554#true} is VALID [2022-04-28 11:29:46,962 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {16554#true} {16781#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (<= (div (* (- 1) (div (* (- 1) main_~a~0) (- 2))) (- 2)) 1) (= (mod (div (- main_~a~0) (- 2)) 2) 0) (= (* (div (- main_~a~0) (- 2)) main_~y~0) (* main_~y~0 2)) (= main_~q~0 0) (= (* (* (div (- main_~a~0) (- 2)) main_~y~0) 2) main_~b~0))} #85#return; {16781#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (<= (div (* (- 1) (div (* (- 1) main_~a~0) (- 2))) (- 2)) 1) (= (mod (div (- main_~a~0) (- 2)) 2) 0) (= (* (div (- main_~a~0) (- 2)) main_~y~0) (* main_~y~0 2)) (= main_~q~0 0) (= (* (* (div (- main_~a~0) (- 2)) main_~y~0) 2) main_~b~0))} is VALID [2022-04-28 11:29:46,962 INFO L272 TraceCheckUtils]: 85: Hoare triple {16781#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (<= (div (* (- 1) (div (* (- 1) main_~a~0) (- 2))) (- 2)) 1) (= (mod (div (- main_~a~0) (- 2)) 2) 0) (= (* (div (- main_~a~0) (- 2)) main_~y~0) (* main_~y~0 2)) (= main_~q~0 0) (= (* (* (div (- main_~a~0) (- 2)) main_~y~0) 2) main_~b~0))} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {16554#true} is VALID [2022-04-28 11:29:46,962 INFO L290 TraceCheckUtils]: 86: Hoare triple {16554#true} ~cond := #in~cond; {16554#true} is VALID [2022-04-28 11:29:46,962 INFO L290 TraceCheckUtils]: 87: Hoare triple {16554#true} assume !(0 == ~cond); {16554#true} is VALID [2022-04-28 11:29:46,962 INFO L290 TraceCheckUtils]: 88: Hoare triple {16554#true} assume true; {16554#true} is VALID [2022-04-28 11:29:46,963 INFO L284 TraceCheckUtils]: 89: Hoare quadruple {16554#true} {16781#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (<= (div (* (- 1) (div (* (- 1) main_~a~0) (- 2))) (- 2)) 1) (= (mod (div (- main_~a~0) (- 2)) 2) 0) (= (* (div (- main_~a~0) (- 2)) main_~y~0) (* main_~y~0 2)) (= main_~q~0 0) (= (* (* (div (- main_~a~0) (- 2)) main_~y~0) 2) main_~b~0))} #87#return; {16781#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (<= (div (* (- 1) (div (* (- 1) main_~a~0) (- 2))) (- 2)) 1) (= (mod (div (- main_~a~0) (- 2)) 2) 0) (= (* (div (- main_~a~0) (- 2)) main_~y~0) (* main_~y~0 2)) (= main_~q~0 0) (= (* (* (div (- main_~a~0) (- 2)) main_~y~0) 2) main_~b~0))} is VALID [2022-04-28 11:29:46,963 INFO L290 TraceCheckUtils]: 90: Hoare triple {16781#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (<= (div (* (- 1) (div (* (- 1) main_~a~0) (- 2))) (- 2)) 1) (= (mod (div (- main_~a~0) (- 2)) 2) 0) (= (* (div (- main_~a~0) (- 2)) main_~y~0) (* main_~y~0 2)) (= main_~q~0 0) (= (* (* (div (- main_~a~0) (- 2)) main_~y~0) 2) main_~b~0))} assume !(~r~0 >= 2 * ~b~0); {16836#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (<= (div (* (- 1) (div (* (- 1) main_~a~0) (- 2))) (- 2)) 1) (= (mod (div (- main_~a~0) (- 2)) 2) 0) (not (<= (* main_~b~0 2) main_~r~0)) (= (* (div (- main_~a~0) (- 2)) main_~y~0) (* main_~y~0 2)) (= main_~q~0 0) (= (* (* (div (- main_~a~0) (- 2)) main_~y~0) 2) main_~b~0))} is VALID [2022-04-28 11:29:46,968 INFO L290 TraceCheckUtils]: 91: Hoare triple {16836#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (<= (div (* (- 1) (div (* (- 1) main_~a~0) (- 2))) (- 2)) 1) (= (mod (div (- main_~a~0) (- 2)) 2) 0) (not (<= (* main_~b~0 2) main_~r~0)) (= (* (div (- main_~a~0) (- 2)) main_~y~0) (* main_~y~0 2)) (= main_~q~0 0) (= (* (* (div (- main_~a~0) (- 2)) main_~y~0) 2) main_~b~0))} ~r~0 := ~r~0 - ~b~0;~q~0 := ~q~0 + ~a~0; {16840#(and (not (<= main_~x~0 (* main_~r~0 2))) (= (* 2 (* (div (- main_~q~0) (- 2)) main_~y~0)) (+ main_~x~0 (* (- 1) main_~r~0))) (<= (div (* (- 1) (div (* (- 1) main_~q~0) (- 2))) (- 2)) 1) (= (mod (div (- main_~q~0) (- 2)) 2) 0) (= (mod main_~q~0 2) 0) (= (* main_~y~0 2) (* (div (- main_~q~0) (- 2)) main_~y~0)))} is VALID [2022-04-28 11:29:46,969 INFO L290 TraceCheckUtils]: 92: Hoare triple {16840#(and (not (<= main_~x~0 (* main_~r~0 2))) (= (* 2 (* (div (- main_~q~0) (- 2)) main_~y~0)) (+ main_~x~0 (* (- 1) main_~r~0))) (<= (div (* (- 1) (div (* (- 1) main_~q~0) (- 2))) (- 2)) 1) (= (mod (div (- main_~q~0) (- 2)) 2) 0) (= (mod main_~q~0 2) 0) (= (* main_~y~0 2) (* (div (- main_~q~0) (- 2)) main_~y~0)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {16840#(and (not (<= main_~x~0 (* main_~r~0 2))) (= (* 2 (* (div (- main_~q~0) (- 2)) main_~y~0)) (+ main_~x~0 (* (- 1) main_~r~0))) (<= (div (* (- 1) (div (* (- 1) main_~q~0) (- 2))) (- 2)) 1) (= (mod (div (- main_~q~0) (- 2)) 2) 0) (= (mod main_~q~0 2) 0) (= (* main_~y~0 2) (* (div (- main_~q~0) (- 2)) main_~y~0)))} is VALID [2022-04-28 11:29:46,970 INFO L290 TraceCheckUtils]: 93: Hoare triple {16840#(and (not (<= main_~x~0 (* main_~r~0 2))) (= (* 2 (* (div (- main_~q~0) (- 2)) main_~y~0)) (+ main_~x~0 (* (- 1) main_~r~0))) (<= (div (* (- 1) (div (* (- 1) main_~q~0) (- 2))) (- 2)) 1) (= (mod (div (- main_~q~0) (- 2)) 2) 0) (= (mod main_~q~0 2) 0) (= (* main_~y~0 2) (* (div (- main_~q~0) (- 2)) main_~y~0)))} assume !!(#t~post6 < 20);havoc #t~post6; {16840#(and (not (<= main_~x~0 (* main_~r~0 2))) (= (* 2 (* (div (- main_~q~0) (- 2)) main_~y~0)) (+ main_~x~0 (* (- 1) main_~r~0))) (<= (div (* (- 1) (div (* (- 1) main_~q~0) (- 2))) (- 2)) 1) (= (mod (div (- main_~q~0) (- 2)) 2) 0) (= (mod main_~q~0 2) 0) (= (* main_~y~0 2) (* (div (- main_~q~0) (- 2)) main_~y~0)))} is VALID [2022-04-28 11:29:46,970 INFO L272 TraceCheckUtils]: 94: Hoare triple {16840#(and (not (<= main_~x~0 (* main_~r~0 2))) (= (* 2 (* (div (- main_~q~0) (- 2)) main_~y~0)) (+ main_~x~0 (* (- 1) main_~r~0))) (<= (div (* (- 1) (div (* (- 1) main_~q~0) (- 2))) (- 2)) 1) (= (mod (div (- main_~q~0) (- 2)) 2) 0) (= (mod main_~q~0 2) 0) (= (* main_~y~0 2) (* (div (- main_~q~0) (- 2)) main_~y~0)))} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {16554#true} is VALID [2022-04-28 11:29:46,970 INFO L290 TraceCheckUtils]: 95: Hoare triple {16554#true} ~cond := #in~cond; {16554#true} is VALID [2022-04-28 11:29:46,970 INFO L290 TraceCheckUtils]: 96: Hoare triple {16554#true} assume !(0 == ~cond); {16554#true} is VALID [2022-04-28 11:29:46,970 INFO L290 TraceCheckUtils]: 97: Hoare triple {16554#true} assume true; {16554#true} is VALID [2022-04-28 11:29:46,970 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {16554#true} {16840#(and (not (<= main_~x~0 (* main_~r~0 2))) (= (* 2 (* (div (- main_~q~0) (- 2)) main_~y~0)) (+ main_~x~0 (* (- 1) main_~r~0))) (<= (div (* (- 1) (div (* (- 1) main_~q~0) (- 2))) (- 2)) 1) (= (mod (div (- main_~q~0) (- 2)) 2) 0) (= (mod main_~q~0 2) 0) (= (* main_~y~0 2) (* (div (- main_~q~0) (- 2)) main_~y~0)))} #79#return; {16840#(and (not (<= main_~x~0 (* main_~r~0 2))) (= (* 2 (* (div (- main_~q~0) (- 2)) main_~y~0)) (+ main_~x~0 (* (- 1) main_~r~0))) (<= (div (* (- 1) (div (* (- 1) main_~q~0) (- 2))) (- 2)) 1) (= (mod (div (- main_~q~0) (- 2)) 2) 0) (= (mod main_~q~0 2) 0) (= (* main_~y~0 2) (* (div (- main_~q~0) (- 2)) main_~y~0)))} is VALID [2022-04-28 11:29:46,971 INFO L272 TraceCheckUtils]: 99: Hoare triple {16840#(and (not (<= main_~x~0 (* main_~r~0 2))) (= (* 2 (* (div (- main_~q~0) (- 2)) main_~y~0)) (+ main_~x~0 (* (- 1) main_~r~0))) (<= (div (* (- 1) (div (* (- 1) main_~q~0) (- 2))) (- 2)) 1) (= (mod (div (- main_~q~0) (- 2)) 2) 0) (= (mod main_~q~0 2) 0) (= (* main_~y~0 2) (* (div (- main_~q~0) (- 2)) main_~y~0)))} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {16554#true} is VALID [2022-04-28 11:29:46,971 INFO L290 TraceCheckUtils]: 100: Hoare triple {16554#true} ~cond := #in~cond; {16554#true} is VALID [2022-04-28 11:29:46,971 INFO L290 TraceCheckUtils]: 101: Hoare triple {16554#true} assume !(0 == ~cond); {16554#true} is VALID [2022-04-28 11:29:46,971 INFO L290 TraceCheckUtils]: 102: Hoare triple {16554#true} assume true; {16554#true} is VALID [2022-04-28 11:29:46,971 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {16554#true} {16840#(and (not (<= main_~x~0 (* main_~r~0 2))) (= (* 2 (* (div (- main_~q~0) (- 2)) main_~y~0)) (+ main_~x~0 (* (- 1) main_~r~0))) (<= (div (* (- 1) (div (* (- 1) main_~q~0) (- 2))) (- 2)) 1) (= (mod (div (- main_~q~0) (- 2)) 2) 0) (= (mod main_~q~0 2) 0) (= (* main_~y~0 2) (* (div (- main_~q~0) (- 2)) main_~y~0)))} #81#return; {16840#(and (not (<= main_~x~0 (* main_~r~0 2))) (= (* 2 (* (div (- main_~q~0) (- 2)) main_~y~0)) (+ main_~x~0 (* (- 1) main_~r~0))) (<= (div (* (- 1) (div (* (- 1) main_~q~0) (- 2))) (- 2)) 1) (= (mod (div (- main_~q~0) (- 2)) 2) 0) (= (mod main_~q~0 2) 0) (= (* main_~y~0 2) (* (div (- main_~q~0) (- 2)) main_~y~0)))} is VALID [2022-04-28 11:29:46,972 INFO L290 TraceCheckUtils]: 104: Hoare triple {16840#(and (not (<= main_~x~0 (* main_~r~0 2))) (= (* 2 (* (div (- main_~q~0) (- 2)) main_~y~0)) (+ main_~x~0 (* (- 1) main_~r~0))) (<= (div (* (- 1) (div (* (- 1) main_~q~0) (- 2))) (- 2)) 1) (= (mod (div (- main_~q~0) (- 2)) 2) 0) (= (mod main_~q~0 2) 0) (= (* main_~y~0 2) (* (div (- main_~q~0) (- 2)) main_~y~0)))} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {16880#(and (= main_~a~0 1) (<= main_~y~0 main_~r~0) (= (* main_~y~0 (div (* (- 1) main_~q~0) (- 2))) (* main_~y~0 2)) (= main_~b~0 main_~y~0) (= (mod main_~q~0 2) 0) (= main_~x~0 (+ (* 2 (* main_~y~0 (div (* (- 1) main_~q~0) (- 2)))) main_~r~0)) (< (* main_~r~0 2) main_~x~0))} is VALID [2022-04-28 11:29:46,972 INFO L290 TraceCheckUtils]: 105: Hoare triple {16880#(and (= main_~a~0 1) (<= main_~y~0 main_~r~0) (= (* main_~y~0 (div (* (- 1) main_~q~0) (- 2))) (* main_~y~0 2)) (= main_~b~0 main_~y~0) (= (mod main_~q~0 2) 0) (= main_~x~0 (+ (* 2 (* main_~y~0 (div (* (- 1) main_~q~0) (- 2)))) main_~r~0)) (< (* main_~r~0 2) main_~x~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {16880#(and (= main_~a~0 1) (<= main_~y~0 main_~r~0) (= (* main_~y~0 (div (* (- 1) main_~q~0) (- 2))) (* main_~y~0 2)) (= main_~b~0 main_~y~0) (= (mod main_~q~0 2) 0) (= main_~x~0 (+ (* 2 (* main_~y~0 (div (* (- 1) main_~q~0) (- 2)))) main_~r~0)) (< (* main_~r~0 2) main_~x~0))} is VALID [2022-04-28 11:29:46,973 INFO L290 TraceCheckUtils]: 106: Hoare triple {16880#(and (= main_~a~0 1) (<= main_~y~0 main_~r~0) (= (* main_~y~0 (div (* (- 1) main_~q~0) (- 2))) (* main_~y~0 2)) (= main_~b~0 main_~y~0) (= (mod main_~q~0 2) 0) (= main_~x~0 (+ (* 2 (* main_~y~0 (div (* (- 1) main_~q~0) (- 2)))) main_~r~0)) (< (* main_~r~0 2) main_~x~0))} assume !(#t~post7 < 20);havoc #t~post7; {16880#(and (= main_~a~0 1) (<= main_~y~0 main_~r~0) (= (* main_~y~0 (div (* (- 1) main_~q~0) (- 2))) (* main_~y~0 2)) (= main_~b~0 main_~y~0) (= (mod main_~q~0 2) 0) (= main_~x~0 (+ (* 2 (* main_~y~0 (div (* (- 1) main_~q~0) (- 2)))) main_~r~0)) (< (* main_~r~0 2) main_~x~0))} is VALID [2022-04-28 11:29:46,976 INFO L290 TraceCheckUtils]: 107: Hoare triple {16880#(and (= main_~a~0 1) (<= main_~y~0 main_~r~0) (= (* main_~y~0 (div (* (- 1) main_~q~0) (- 2))) (* main_~y~0 2)) (= main_~b~0 main_~y~0) (= (mod main_~q~0 2) 0) (= main_~x~0 (+ (* 2 (* main_~y~0 (div (* (- 1) main_~q~0) (- 2)))) main_~r~0)) (< (* main_~r~0 2) main_~x~0))} ~r~0 := ~r~0 - ~b~0;~q~0 := ~q~0 + ~a~0; {16890#(and (= (* main_~y~0 2) (* (div (+ (* (- 1) main_~q~0) 1) (- 2)) main_~y~0)) (< main_~x~0 (* 4 (* (div (+ (* (- 1) main_~q~0) 1) (- 2)) main_~y~0))) (<= (+ main_~y~0 (* 2 (* (div (+ (* (- 1) main_~q~0) 1) (- 2)) main_~y~0))) main_~x~0) (= (mod (+ main_~q~0 1) 2) 0) (= (+ main_~x~0 (* (- 2) (div (+ (* (- 1) main_~q~0) 1) (- 2)) main_~y~0) (* (- 1) main_~y~0)) main_~r~0))} is VALID [2022-04-28 11:29:46,977 INFO L290 TraceCheckUtils]: 108: Hoare triple {16890#(and (= (* main_~y~0 2) (* (div (+ (* (- 1) main_~q~0) 1) (- 2)) main_~y~0)) (< main_~x~0 (* 4 (* (div (+ (* (- 1) main_~q~0) 1) (- 2)) main_~y~0))) (<= (+ main_~y~0 (* 2 (* (div (+ (* (- 1) main_~q~0) 1) (- 2)) main_~y~0))) main_~x~0) (= (mod (+ main_~q~0 1) 2) 0) (= (+ main_~x~0 (* (- 2) (div (+ (* (- 1) main_~q~0) 1) (- 2)) main_~y~0) (* (- 1) main_~y~0)) main_~r~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {16890#(and (= (* main_~y~0 2) (* (div (+ (* (- 1) main_~q~0) 1) (- 2)) main_~y~0)) (< main_~x~0 (* 4 (* (div (+ (* (- 1) main_~q~0) 1) (- 2)) main_~y~0))) (<= (+ main_~y~0 (* 2 (* (div (+ (* (- 1) main_~q~0) 1) (- 2)) main_~y~0))) main_~x~0) (= (mod (+ main_~q~0 1) 2) 0) (= (+ main_~x~0 (* (- 2) (div (+ (* (- 1) main_~q~0) 1) (- 2)) main_~y~0) (* (- 1) main_~y~0)) main_~r~0))} is VALID [2022-04-28 11:29:46,977 INFO L290 TraceCheckUtils]: 109: Hoare triple {16890#(and (= (* main_~y~0 2) (* (div (+ (* (- 1) main_~q~0) 1) (- 2)) main_~y~0)) (< main_~x~0 (* 4 (* (div (+ (* (- 1) main_~q~0) 1) (- 2)) main_~y~0))) (<= (+ main_~y~0 (* 2 (* (div (+ (* (- 1) main_~q~0) 1) (- 2)) main_~y~0))) main_~x~0) (= (mod (+ main_~q~0 1) 2) 0) (= (+ main_~x~0 (* (- 2) (div (+ (* (- 1) main_~q~0) 1) (- 2)) main_~y~0) (* (- 1) main_~y~0)) main_~r~0))} assume !(#t~post6 < 20);havoc #t~post6; {16890#(and (= (* main_~y~0 2) (* (div (+ (* (- 1) main_~q~0) 1) (- 2)) main_~y~0)) (< main_~x~0 (* 4 (* (div (+ (* (- 1) main_~q~0) 1) (- 2)) main_~y~0))) (<= (+ main_~y~0 (* 2 (* (div (+ (* (- 1) main_~q~0) 1) (- 2)) main_~y~0))) main_~x~0) (= (mod (+ main_~q~0 1) 2) 0) (= (+ main_~x~0 (* (- 2) (div (+ (* (- 1) main_~q~0) 1) (- 2)) main_~y~0) (* (- 1) main_~y~0)) main_~r~0))} is VALID [2022-04-28 11:29:46,980 INFO L272 TraceCheckUtils]: 110: Hoare triple {16890#(and (= (* main_~y~0 2) (* (div (+ (* (- 1) main_~q~0) 1) (- 2)) main_~y~0)) (< main_~x~0 (* 4 (* (div (+ (* (- 1) main_~q~0) 1) (- 2)) main_~y~0))) (<= (+ main_~y~0 (* 2 (* (div (+ (* (- 1) main_~q~0) 1) (- 2)) main_~y~0))) main_~x~0) (= (mod (+ main_~q~0 1) 2) 0) (= (+ main_~x~0 (* (- 2) (div (+ (* (- 1) main_~q~0) 1) (- 2)) main_~y~0) (* (- 1) main_~y~0)) main_~r~0))} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {16900#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:29:46,980 INFO L290 TraceCheckUtils]: 111: Hoare triple {16900#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {16904#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:29:46,981 INFO L290 TraceCheckUtils]: 112: Hoare triple {16904#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {16555#false} is VALID [2022-04-28 11:29:46,981 INFO L290 TraceCheckUtils]: 113: Hoare triple {16555#false} assume !false; {16555#false} is VALID [2022-04-28 11:29:46,981 INFO L134 CoverageAnalysis]: Checked inductivity of 486 backedges. 47 proven. 61 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2022-04-28 11:29:46,981 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:30:05,506 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 11:30:57,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:30:57,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806770231] [2022-04-28 11:30:57,180 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:30:57,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [979325277] [2022-04-28 11:30:57,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [979325277] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 11:30:57,180 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 11:30:57,180 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2022-04-28 11:30:57,180 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:30:57,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1803881488] [2022-04-28 11:30:57,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1803881488] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:30:57,180 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:30:57,180 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-28 11:30:57,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911801825] [2022-04-28 11:30:57,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:30:57,181 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.6) internal successors, (39), 14 states have internal predecessors, (39), 8 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 6 states have call predecessors, (17), 7 states have call successors, (17) Word has length 114 [2022-04-28 11:30:57,181 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:30:57,181 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 2.6) internal successors, (39), 14 states have internal predecessors, (39), 8 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 6 states have call predecessors, (17), 7 states have call successors, (17) [2022-04-28 11:30:57,271 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:30:57,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-28 11:30:57,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:30:57,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-28 11:30:57,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=469, Unknown=0, NotChecked=0, Total=600 [2022-04-28 11:30:57,272 INFO L87 Difference]: Start difference. First operand 184 states and 218 transitions. Second operand has 15 states, 15 states have (on average 2.6) internal successors, (39), 14 states have internal predecessors, (39), 8 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 6 states have call predecessors, (17), 7 states have call successors, (17) [2022-04-28 11:31:04,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:31:04,383 INFO L93 Difference]: Finished difference Result 232 states and 282 transitions. [2022-04-28 11:31:04,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-28 11:31:04,384 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.6) internal successors, (39), 14 states have internal predecessors, (39), 8 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 6 states have call predecessors, (17), 7 states have call successors, (17) Word has length 114 [2022-04-28 11:31:04,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:31:04,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 2.6) internal successors, (39), 14 states have internal predecessors, (39), 8 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 6 states have call predecessors, (17), 7 states have call successors, (17) [2022-04-28 11:31:04,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 169 transitions. [2022-04-28 11:31:04,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 2.6) internal successors, (39), 14 states have internal predecessors, (39), 8 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 6 states have call predecessors, (17), 7 states have call successors, (17) [2022-04-28 11:31:04,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 169 transitions. [2022-04-28 11:31:04,388 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 169 transitions. [2022-04-28 11:31:04,604 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 169 edges. 169 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:31:04,607 INFO L225 Difference]: With dead ends: 232 [2022-04-28 11:31:04,607 INFO L226 Difference]: Without dead ends: 223 [2022-04-28 11:31:04,607 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 180 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=144, Invalid=558, Unknown=0, NotChecked=0, Total=702 [2022-04-28 11:31:04,608 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 54 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 625 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 677 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 625 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-28 11:31:04,608 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 282 Invalid, 677 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 625 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-04-28 11:31:04,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2022-04-28 11:31:04,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 216. [2022-04-28 11:31:04,934 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:31:04,934 INFO L82 GeneralOperation]: Start isEquivalent. First operand 223 states. Second operand has 216 states, 138 states have (on average 1.1376811594202898) internal successors, (157), 140 states have internal predecessors, (157), 52 states have call successors, (52), 26 states have call predecessors, (52), 25 states have return successors, (50), 49 states have call predecessors, (50), 50 states have call successors, (50) [2022-04-28 11:31:04,934 INFO L74 IsIncluded]: Start isIncluded. First operand 223 states. Second operand has 216 states, 138 states have (on average 1.1376811594202898) internal successors, (157), 140 states have internal predecessors, (157), 52 states have call successors, (52), 26 states have call predecessors, (52), 25 states have return successors, (50), 49 states have call predecessors, (50), 50 states have call successors, (50) [2022-04-28 11:31:04,935 INFO L87 Difference]: Start difference. First operand 223 states. Second operand has 216 states, 138 states have (on average 1.1376811594202898) internal successors, (157), 140 states have internal predecessors, (157), 52 states have call successors, (52), 26 states have call predecessors, (52), 25 states have return successors, (50), 49 states have call predecessors, (50), 50 states have call successors, (50) [2022-04-28 11:31:04,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:31:04,938 INFO L93 Difference]: Finished difference Result 223 states and 267 transitions. [2022-04-28 11:31:04,938 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 267 transitions. [2022-04-28 11:31:04,939 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:31:04,939 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:31:04,939 INFO L74 IsIncluded]: Start isIncluded. First operand has 216 states, 138 states have (on average 1.1376811594202898) internal successors, (157), 140 states have internal predecessors, (157), 52 states have call successors, (52), 26 states have call predecessors, (52), 25 states have return successors, (50), 49 states have call predecessors, (50), 50 states have call successors, (50) Second operand 223 states. [2022-04-28 11:31:04,939 INFO L87 Difference]: Start difference. First operand has 216 states, 138 states have (on average 1.1376811594202898) internal successors, (157), 140 states have internal predecessors, (157), 52 states have call successors, (52), 26 states have call predecessors, (52), 25 states have return successors, (50), 49 states have call predecessors, (50), 50 states have call successors, (50) Second operand 223 states. [2022-04-28 11:31:04,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:31:04,943 INFO L93 Difference]: Finished difference Result 223 states and 267 transitions. [2022-04-28 11:31:04,943 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 267 transitions. [2022-04-28 11:31:04,944 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:31:04,944 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:31:04,944 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:31:04,944 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:31:04,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 138 states have (on average 1.1376811594202898) internal successors, (157), 140 states have internal predecessors, (157), 52 states have call successors, (52), 26 states have call predecessors, (52), 25 states have return successors, (50), 49 states have call predecessors, (50), 50 states have call successors, (50) [2022-04-28 11:31:04,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 259 transitions. [2022-04-28 11:31:04,948 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 259 transitions. Word has length 114 [2022-04-28 11:31:04,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:31:04,948 INFO L495 AbstractCegarLoop]: Abstraction has 216 states and 259 transitions. [2022-04-28 11:31:04,948 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.6) internal successors, (39), 14 states have internal predecessors, (39), 8 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 6 states have call predecessors, (17), 7 states have call successors, (17) [2022-04-28 11:31:04,948 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 216 states and 259 transitions. [2022-04-28 11:31:05,328 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 259 edges. 259 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:31:05,328 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 259 transitions. [2022-04-28 11:31:05,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-04-28 11:31:05,329 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:31:05,329 INFO L195 NwaCegarLoop]: trace histogram [18, 17, 17, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1] [2022-04-28 11:31:05,371 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-28 11:31:05,529 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-28 11:31:05,530 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:31:05,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:31:05,530 INFO L85 PathProgramCache]: Analyzing trace with hash 1338024082, now seen corresponding path program 5 times [2022-04-28 11:31:05,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:31:05,530 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [553410923] [2022-04-28 11:31:36,249 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:31:36,249 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:31:36,249 INFO L85 PathProgramCache]: Analyzing trace with hash 1338024082, now seen corresponding path program 6 times [2022-04-28 11:31:36,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:31:36,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880463871] [2022-04-28 11:31:36,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:31:36,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:31:36,260 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:31:36,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1996117714] [2022-04-28 11:31:36,260 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 11:31:36,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:31:36,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:31:36,261 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-28 11:31:36,263 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-28 11:31:36,326 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2022-04-28 11:31:36,326 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:31:36,327 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-28 11:31:36,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:31:36,346 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:31:37,026 INFO L272 TraceCheckUtils]: 0: Hoare triple {18539#true} call ULTIMATE.init(); {18539#true} is VALID [2022-04-28 11:31:37,026 INFO L290 TraceCheckUtils]: 1: Hoare triple {18539#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(14, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {18539#true} is VALID [2022-04-28 11:31:37,026 INFO L290 TraceCheckUtils]: 2: Hoare triple {18539#true} assume true; {18539#true} is VALID [2022-04-28 11:31:37,027 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18539#true} {18539#true} #93#return; {18539#true} is VALID [2022-04-28 11:31:37,027 INFO L272 TraceCheckUtils]: 4: Hoare triple {18539#true} call #t~ret8 := main(); {18539#true} is VALID [2022-04-28 11:31:37,027 INFO L290 TraceCheckUtils]: 5: Hoare triple {18539#true} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~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; {18539#true} is VALID [2022-04-28 11:31:37,027 INFO L272 TraceCheckUtils]: 6: Hoare triple {18539#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {18539#true} is VALID [2022-04-28 11:31:37,027 INFO L290 TraceCheckUtils]: 7: Hoare triple {18539#true} ~cond := #in~cond; {18539#true} is VALID [2022-04-28 11:31:37,027 INFO L290 TraceCheckUtils]: 8: Hoare triple {18539#true} assume !(0 == ~cond); {18539#true} is VALID [2022-04-28 11:31:37,027 INFO L290 TraceCheckUtils]: 9: Hoare triple {18539#true} assume true; {18539#true} is VALID [2022-04-28 11:31:37,027 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {18539#true} {18539#true} #77#return; {18539#true} is VALID [2022-04-28 11:31:37,027 INFO L290 TraceCheckUtils]: 11: Hoare triple {18539#true} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {18577#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:31:37,028 INFO L290 TraceCheckUtils]: 12: Hoare triple {18577#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {18577#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:31:37,028 INFO L290 TraceCheckUtils]: 13: Hoare triple {18577#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} assume !!(#t~post6 < 20);havoc #t~post6; {18577#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:31:37,028 INFO L272 TraceCheckUtils]: 14: Hoare triple {18577#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {18539#true} is VALID [2022-04-28 11:31:37,028 INFO L290 TraceCheckUtils]: 15: Hoare triple {18539#true} ~cond := #in~cond; {18539#true} is VALID [2022-04-28 11:31:37,028 INFO L290 TraceCheckUtils]: 16: Hoare triple {18539#true} assume !(0 == ~cond); {18539#true} is VALID [2022-04-28 11:31:37,028 INFO L290 TraceCheckUtils]: 17: Hoare triple {18539#true} assume true; {18539#true} is VALID [2022-04-28 11:31:37,029 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {18539#true} {18577#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #79#return; {18577#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:31:37,029 INFO L272 TraceCheckUtils]: 19: Hoare triple {18577#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {18539#true} is VALID [2022-04-28 11:31:37,029 INFO L290 TraceCheckUtils]: 20: Hoare triple {18539#true} ~cond := #in~cond; {18539#true} is VALID [2022-04-28 11:31:37,029 INFO L290 TraceCheckUtils]: 21: Hoare triple {18539#true} assume !(0 == ~cond); {18539#true} is VALID [2022-04-28 11:31:37,029 INFO L290 TraceCheckUtils]: 22: Hoare triple {18539#true} assume true; {18539#true} is VALID [2022-04-28 11:31:37,030 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {18539#true} {18577#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #81#return; {18577#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:31:37,030 INFO L290 TraceCheckUtils]: 24: Hoare triple {18577#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {18577#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:31:37,030 INFO L290 TraceCheckUtils]: 25: Hoare triple {18577#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {18577#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:31:37,031 INFO L290 TraceCheckUtils]: 26: Hoare triple {18577#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} assume !!(#t~post7 < 20);havoc #t~post7; {18577#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:31:37,031 INFO L272 TraceCheckUtils]: 27: Hoare triple {18577#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {18539#true} is VALID [2022-04-28 11:31:37,031 INFO L290 TraceCheckUtils]: 28: Hoare triple {18539#true} ~cond := #in~cond; {18539#true} is VALID [2022-04-28 11:31:37,031 INFO L290 TraceCheckUtils]: 29: Hoare triple {18539#true} assume !(0 == ~cond); {18539#true} is VALID [2022-04-28 11:31:37,031 INFO L290 TraceCheckUtils]: 30: Hoare triple {18539#true} assume true; {18539#true} is VALID [2022-04-28 11:31:37,031 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {18539#true} {18577#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #83#return; {18577#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:31:37,031 INFO L272 TraceCheckUtils]: 32: Hoare triple {18577#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {18539#true} is VALID [2022-04-28 11:31:37,032 INFO L290 TraceCheckUtils]: 33: Hoare triple {18539#true} ~cond := #in~cond; {18539#true} is VALID [2022-04-28 11:31:37,032 INFO L290 TraceCheckUtils]: 34: Hoare triple {18539#true} assume !(0 == ~cond); {18539#true} is VALID [2022-04-28 11:31:37,032 INFO L290 TraceCheckUtils]: 35: Hoare triple {18539#true} assume true; {18539#true} is VALID [2022-04-28 11:31:37,032 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {18539#true} {18577#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #85#return; {18577#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:31:37,032 INFO L272 TraceCheckUtils]: 37: Hoare triple {18577#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {18539#true} is VALID [2022-04-28 11:31:37,032 INFO L290 TraceCheckUtils]: 38: Hoare triple {18539#true} ~cond := #in~cond; {18539#true} is VALID [2022-04-28 11:31:37,032 INFO L290 TraceCheckUtils]: 39: Hoare triple {18539#true} assume !(0 == ~cond); {18539#true} is VALID [2022-04-28 11:31:37,032 INFO L290 TraceCheckUtils]: 40: Hoare triple {18539#true} assume true; {18539#true} is VALID [2022-04-28 11:31:37,033 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {18539#true} {18577#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #87#return; {18577#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:31:37,033 INFO L290 TraceCheckUtils]: 42: Hoare triple {18577#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} assume !!(~r~0 >= 2 * ~b~0); {18577#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:31:37,033 INFO L272 TraceCheckUtils]: 43: Hoare triple {18577#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~r~0 >= 2 * ~y~0 * ~a~0 then 1 else 0)); {18539#true} is VALID [2022-04-28 11:31:37,033 INFO L290 TraceCheckUtils]: 44: Hoare triple {18539#true} ~cond := #in~cond; {18539#true} is VALID [2022-04-28 11:31:37,033 INFO L290 TraceCheckUtils]: 45: Hoare triple {18539#true} assume !(0 == ~cond); {18539#true} is VALID [2022-04-28 11:31:37,033 INFO L290 TraceCheckUtils]: 46: Hoare triple {18539#true} assume true; {18539#true} is VALID [2022-04-28 11:31:37,034 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {18539#true} {18577#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #89#return; {18577#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:31:37,034 INFO L290 TraceCheckUtils]: 48: Hoare triple {18577#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} ~a~0 := 2 * ~a~0;~b~0 := 2 * ~b~0; {18577#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:31:37,035 INFO L290 TraceCheckUtils]: 49: Hoare triple {18577#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {18577#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:31:37,035 INFO L290 TraceCheckUtils]: 50: Hoare triple {18577#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} assume !!(#t~post7 < 20);havoc #t~post7; {18577#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:31:37,035 INFO L272 TraceCheckUtils]: 51: Hoare triple {18577#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {18539#true} is VALID [2022-04-28 11:31:37,035 INFO L290 TraceCheckUtils]: 52: Hoare triple {18539#true} ~cond := #in~cond; {18539#true} is VALID [2022-04-28 11:31:37,035 INFO L290 TraceCheckUtils]: 53: Hoare triple {18539#true} assume !(0 == ~cond); {18539#true} is VALID [2022-04-28 11:31:37,035 INFO L290 TraceCheckUtils]: 54: Hoare triple {18539#true} assume true; {18539#true} is VALID [2022-04-28 11:31:37,036 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {18539#true} {18577#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #83#return; {18577#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:31:37,036 INFO L272 TraceCheckUtils]: 56: Hoare triple {18577#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {18539#true} is VALID [2022-04-28 11:31:37,036 INFO L290 TraceCheckUtils]: 57: Hoare triple {18539#true} ~cond := #in~cond; {18539#true} is VALID [2022-04-28 11:31:37,036 INFO L290 TraceCheckUtils]: 58: Hoare triple {18539#true} assume !(0 == ~cond); {18539#true} is VALID [2022-04-28 11:31:37,036 INFO L290 TraceCheckUtils]: 59: Hoare triple {18539#true} assume true; {18539#true} is VALID [2022-04-28 11:31:37,036 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {18539#true} {18577#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #85#return; {18577#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:31:37,036 INFO L272 TraceCheckUtils]: 61: Hoare triple {18577#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {18539#true} is VALID [2022-04-28 11:31:37,036 INFO L290 TraceCheckUtils]: 62: Hoare triple {18539#true} ~cond := #in~cond; {18539#true} is VALID [2022-04-28 11:31:37,036 INFO L290 TraceCheckUtils]: 63: Hoare triple {18539#true} assume !(0 == ~cond); {18539#true} is VALID [2022-04-28 11:31:37,037 INFO L290 TraceCheckUtils]: 64: Hoare triple {18539#true} assume true; {18539#true} is VALID [2022-04-28 11:31:37,037 INFO L284 TraceCheckUtils]: 65: Hoare quadruple {18539#true} {18577#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #87#return; {18577#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:31:37,037 INFO L290 TraceCheckUtils]: 66: Hoare triple {18577#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} assume !!(~r~0 >= 2 * ~b~0); {18577#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:31:37,037 INFO L272 TraceCheckUtils]: 67: Hoare triple {18577#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~r~0 >= 2 * ~y~0 * ~a~0 then 1 else 0)); {18539#true} is VALID [2022-04-28 11:31:37,037 INFO L290 TraceCheckUtils]: 68: Hoare triple {18539#true} ~cond := #in~cond; {18539#true} is VALID [2022-04-28 11:31:37,037 INFO L290 TraceCheckUtils]: 69: Hoare triple {18539#true} assume !(0 == ~cond); {18539#true} is VALID [2022-04-28 11:31:37,038 INFO L290 TraceCheckUtils]: 70: Hoare triple {18539#true} assume true; {18539#true} is VALID [2022-04-28 11:31:37,038 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {18539#true} {18577#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #89#return; {18577#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:31:37,038 INFO L290 TraceCheckUtils]: 72: Hoare triple {18577#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} ~a~0 := 2 * ~a~0;~b~0 := 2 * ~b~0; {18577#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:31:37,039 INFO L290 TraceCheckUtils]: 73: Hoare triple {18577#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {18577#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:31:37,039 INFO L290 TraceCheckUtils]: 74: Hoare triple {18577#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} assume !!(#t~post7 < 20);havoc #t~post7; {18577#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:31:37,039 INFO L272 TraceCheckUtils]: 75: Hoare triple {18577#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {18539#true} is VALID [2022-04-28 11:31:37,039 INFO L290 TraceCheckUtils]: 76: Hoare triple {18539#true} ~cond := #in~cond; {18539#true} is VALID [2022-04-28 11:31:37,039 INFO L290 TraceCheckUtils]: 77: Hoare triple {18539#true} assume !(0 == ~cond); {18539#true} is VALID [2022-04-28 11:31:37,039 INFO L290 TraceCheckUtils]: 78: Hoare triple {18539#true} assume true; {18539#true} is VALID [2022-04-28 11:31:37,040 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {18539#true} {18577#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #83#return; {18577#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:31:37,040 INFO L272 TraceCheckUtils]: 80: Hoare triple {18577#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {18539#true} is VALID [2022-04-28 11:31:37,040 INFO L290 TraceCheckUtils]: 81: Hoare triple {18539#true} ~cond := #in~cond; {18539#true} is VALID [2022-04-28 11:31:37,040 INFO L290 TraceCheckUtils]: 82: Hoare triple {18539#true} assume !(0 == ~cond); {18539#true} is VALID [2022-04-28 11:31:37,040 INFO L290 TraceCheckUtils]: 83: Hoare triple {18539#true} assume true; {18539#true} is VALID [2022-04-28 11:31:37,041 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {18539#true} {18577#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #85#return; {18577#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:31:37,041 INFO L272 TraceCheckUtils]: 85: Hoare triple {18577#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {18539#true} is VALID [2022-04-28 11:31:37,041 INFO L290 TraceCheckUtils]: 86: Hoare triple {18539#true} ~cond := #in~cond; {18539#true} is VALID [2022-04-28 11:31:37,041 INFO L290 TraceCheckUtils]: 87: Hoare triple {18539#true} assume !(0 == ~cond); {18539#true} is VALID [2022-04-28 11:31:37,041 INFO L290 TraceCheckUtils]: 88: Hoare triple {18539#true} assume true; {18539#true} is VALID [2022-04-28 11:31:37,041 INFO L284 TraceCheckUtils]: 89: Hoare quadruple {18539#true} {18577#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #87#return; {18577#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:31:37,041 INFO L290 TraceCheckUtils]: 90: Hoare triple {18577#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} assume !!(~r~0 >= 2 * ~b~0); {18577#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:31:37,042 INFO L272 TraceCheckUtils]: 91: Hoare triple {18577#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~r~0 >= 2 * ~y~0 * ~a~0 then 1 else 0)); {18539#true} is VALID [2022-04-28 11:31:37,042 INFO L290 TraceCheckUtils]: 92: Hoare triple {18539#true} ~cond := #in~cond; {18539#true} is VALID [2022-04-28 11:31:37,042 INFO L290 TraceCheckUtils]: 93: Hoare triple {18539#true} assume !(0 == ~cond); {18539#true} is VALID [2022-04-28 11:31:37,042 INFO L290 TraceCheckUtils]: 94: Hoare triple {18539#true} assume true; {18539#true} is VALID [2022-04-28 11:31:37,042 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {18539#true} {18577#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #89#return; {18577#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:31:37,043 INFO L290 TraceCheckUtils]: 96: Hoare triple {18577#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} ~a~0 := 2 * ~a~0;~b~0 := 2 * ~b~0; {18833#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:31:37,044 INFO L290 TraceCheckUtils]: 97: Hoare triple {18833#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (= main_~q~0 0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {18833#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:31:37,044 INFO L290 TraceCheckUtils]: 98: Hoare triple {18833#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (= main_~q~0 0))} assume !!(#t~post7 < 20);havoc #t~post7; {18833#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:31:37,056 INFO L272 TraceCheckUtils]: 99: Hoare triple {18833#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {18539#true} is VALID [2022-04-28 11:31:37,057 INFO L290 TraceCheckUtils]: 100: Hoare triple {18539#true} ~cond := #in~cond; {18846#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:31:37,057 INFO L290 TraceCheckUtils]: 101: Hoare triple {18846#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {18850#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:31:37,058 INFO L290 TraceCheckUtils]: 102: Hoare triple {18850#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {18850#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:31:37,058 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {18850#(not (= |__VERIFIER_assert_#in~cond| 0))} {18833#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (= main_~q~0 0))} #83#return; {18857#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (= main_~q~0 0) (= main_~b~0 (* main_~a~0 main_~y~0)))} is VALID [2022-04-28 11:31:37,059 INFO L272 TraceCheckUtils]: 104: Hoare triple {18857#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (= main_~q~0 0) (= main_~b~0 (* main_~a~0 main_~y~0)))} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {18539#true} is VALID [2022-04-28 11:31:37,059 INFO L290 TraceCheckUtils]: 105: Hoare triple {18539#true} ~cond := #in~cond; {18539#true} is VALID [2022-04-28 11:31:37,059 INFO L290 TraceCheckUtils]: 106: Hoare triple {18539#true} assume !(0 == ~cond); {18539#true} is VALID [2022-04-28 11:31:37,059 INFO L290 TraceCheckUtils]: 107: Hoare triple {18539#true} assume true; {18539#true} is VALID [2022-04-28 11:31:37,059 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {18539#true} {18857#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (= main_~q~0 0) (= main_~b~0 (* main_~a~0 main_~y~0)))} #85#return; {18857#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (= main_~q~0 0) (= main_~b~0 (* main_~a~0 main_~y~0)))} is VALID [2022-04-28 11:31:37,059 INFO L272 TraceCheckUtils]: 109: Hoare triple {18857#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (= main_~q~0 0) (= main_~b~0 (* main_~a~0 main_~y~0)))} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {18539#true} is VALID [2022-04-28 11:31:37,059 INFO L290 TraceCheckUtils]: 110: Hoare triple {18539#true} ~cond := #in~cond; {18539#true} is VALID [2022-04-28 11:31:37,059 INFO L290 TraceCheckUtils]: 111: Hoare triple {18539#true} assume !(0 == ~cond); {18539#true} is VALID [2022-04-28 11:31:37,060 INFO L290 TraceCheckUtils]: 112: Hoare triple {18539#true} assume true; {18539#true} is VALID [2022-04-28 11:31:37,060 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {18539#true} {18857#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (= main_~q~0 0) (= main_~b~0 (* main_~a~0 main_~y~0)))} #87#return; {18857#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (= main_~q~0 0) (= main_~b~0 (* main_~a~0 main_~y~0)))} is VALID [2022-04-28 11:31:37,061 INFO L290 TraceCheckUtils]: 114: Hoare triple {18857#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (= main_~q~0 0) (= main_~b~0 (* main_~a~0 main_~y~0)))} assume !(~r~0 >= 2 * ~b~0); {18857#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (= main_~q~0 0) (= main_~b~0 (* main_~a~0 main_~y~0)))} is VALID [2022-04-28 11:31:37,062 INFO L290 TraceCheckUtils]: 115: Hoare triple {18857#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (= main_~q~0 0) (= main_~b~0 (* main_~a~0 main_~y~0)))} ~r~0 := ~r~0 - ~b~0;~q~0 := ~q~0 + ~a~0; {18894#(and (= (+ main_~x~0 (* (- 1) main_~r~0)) (* main_~q~0 main_~y~0)) (= (mod main_~q~0 2) 0))} is VALID [2022-04-28 11:31:37,063 INFO L290 TraceCheckUtils]: 116: Hoare triple {18894#(and (= (+ main_~x~0 (* (- 1) main_~r~0)) (* main_~q~0 main_~y~0)) (= (mod main_~q~0 2) 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {18894#(and (= (+ main_~x~0 (* (- 1) main_~r~0)) (* main_~q~0 main_~y~0)) (= (mod main_~q~0 2) 0))} is VALID [2022-04-28 11:31:37,063 INFO L290 TraceCheckUtils]: 117: Hoare triple {18894#(and (= (+ main_~x~0 (* (- 1) main_~r~0)) (* main_~q~0 main_~y~0)) (= (mod main_~q~0 2) 0))} assume !(#t~post6 < 20);havoc #t~post6; {18894#(and (= (+ main_~x~0 (* (- 1) main_~r~0)) (* main_~q~0 main_~y~0)) (= (mod main_~q~0 2) 0))} is VALID [2022-04-28 11:31:37,064 INFO L272 TraceCheckUtils]: 118: Hoare triple {18894#(and (= (+ main_~x~0 (* (- 1) main_~r~0)) (* main_~q~0 main_~y~0)) (= (mod main_~q~0 2) 0))} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {18904#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:31:37,064 INFO L290 TraceCheckUtils]: 119: Hoare triple {18904#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {18908#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:31:37,064 INFO L290 TraceCheckUtils]: 120: Hoare triple {18908#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {18540#false} is VALID [2022-04-28 11:31:37,064 INFO L290 TraceCheckUtils]: 121: Hoare triple {18540#false} assume !false; {18540#false} is VALID [2022-04-28 11:31:37,065 INFO L134 CoverageAnalysis]: Checked inductivity of 622 backedges. 93 proven. 9 refuted. 0 times theorem prover too weak. 520 trivial. 0 not checked. [2022-04-28 11:31:37,065 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:31:45,051 INFO L290 TraceCheckUtils]: 121: Hoare triple {18540#false} assume !false; {18540#false} is VALID [2022-04-28 11:31:45,051 INFO L290 TraceCheckUtils]: 120: Hoare triple {18908#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {18540#false} is VALID [2022-04-28 11:31:45,052 INFO L290 TraceCheckUtils]: 119: Hoare triple {18904#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {18908#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:31:45,052 INFO L272 TraceCheckUtils]: 118: Hoare triple {18924#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {18904#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:31:45,052 INFO L290 TraceCheckUtils]: 117: Hoare triple {18924#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} assume !(#t~post6 < 20);havoc #t~post6; {18924#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:31:45,053 INFO L290 TraceCheckUtils]: 116: Hoare triple {18924#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {18924#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:31:45,062 INFO L290 TraceCheckUtils]: 115: Hoare triple {18934#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} ~r~0 := ~r~0 - ~b~0;~q~0 := ~q~0 + ~a~0; {18924#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:31:45,063 INFO L290 TraceCheckUtils]: 114: Hoare triple {18934#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} assume !(~r~0 >= 2 * ~b~0); {18934#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} is VALID [2022-04-28 11:31:45,064 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {18539#true} {18934#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} #87#return; {18934#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} is VALID [2022-04-28 11:31:45,064 INFO L290 TraceCheckUtils]: 112: Hoare triple {18539#true} assume true; {18539#true} is VALID [2022-04-28 11:31:45,064 INFO L290 TraceCheckUtils]: 111: Hoare triple {18539#true} assume !(0 == ~cond); {18539#true} is VALID [2022-04-28 11:31:45,064 INFO L290 TraceCheckUtils]: 110: Hoare triple {18539#true} ~cond := #in~cond; {18539#true} is VALID [2022-04-28 11:31:45,064 INFO L272 TraceCheckUtils]: 109: Hoare triple {18934#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {18539#true} is VALID [2022-04-28 11:31:45,064 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {18539#true} {18934#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} #85#return; {18934#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} is VALID [2022-04-28 11:31:45,065 INFO L290 TraceCheckUtils]: 107: Hoare triple {18539#true} assume true; {18539#true} is VALID [2022-04-28 11:31:45,065 INFO L290 TraceCheckUtils]: 106: Hoare triple {18539#true} assume !(0 == ~cond); {18539#true} is VALID [2022-04-28 11:31:45,065 INFO L290 TraceCheckUtils]: 105: Hoare triple {18539#true} ~cond := #in~cond; {18539#true} is VALID [2022-04-28 11:31:45,065 INFO L272 TraceCheckUtils]: 104: Hoare triple {18934#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {18539#true} is VALID [2022-04-28 11:31:45,066 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {18850#(not (= |__VERIFIER_assert_#in~cond| 0))} {18924#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} #83#return; {18934#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} is VALID [2022-04-28 11:31:45,066 INFO L290 TraceCheckUtils]: 102: Hoare triple {18850#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {18850#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:31:45,066 INFO L290 TraceCheckUtils]: 101: Hoare triple {18980#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {18850#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:31:45,067 INFO L290 TraceCheckUtils]: 100: Hoare triple {18539#true} ~cond := #in~cond; {18980#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 11:31:45,067 INFO L272 TraceCheckUtils]: 99: Hoare triple {18924#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {18539#true} is VALID [2022-04-28 11:31:45,067 INFO L290 TraceCheckUtils]: 98: Hoare triple {18924#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} assume !!(#t~post7 < 20);havoc #t~post7; {18924#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:31:45,067 INFO L290 TraceCheckUtils]: 97: Hoare triple {18924#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {18924#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:31:45,068 INFO L290 TraceCheckUtils]: 96: Hoare triple {18924#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} ~a~0 := 2 * ~a~0;~b~0 := 2 * ~b~0; {18924#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:31:45,068 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {18539#true} {18924#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} #89#return; {18924#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:31:45,068 INFO L290 TraceCheckUtils]: 94: Hoare triple {18539#true} assume true; {18539#true} is VALID [2022-04-28 11:31:45,068 INFO L290 TraceCheckUtils]: 93: Hoare triple {18539#true} assume !(0 == ~cond); {18539#true} is VALID [2022-04-28 11:31:45,068 INFO L290 TraceCheckUtils]: 92: Hoare triple {18539#true} ~cond := #in~cond; {18539#true} is VALID [2022-04-28 11:31:45,068 INFO L272 TraceCheckUtils]: 91: Hoare triple {18924#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} call __VERIFIER_assert((if ~r~0 >= 2 * ~y~0 * ~a~0 then 1 else 0)); {18539#true} is VALID [2022-04-28 11:31:45,068 INFO L290 TraceCheckUtils]: 90: Hoare triple {18924#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} assume !!(~r~0 >= 2 * ~b~0); {18924#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:31:45,069 INFO L284 TraceCheckUtils]: 89: Hoare quadruple {18539#true} {18924#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} #87#return; {18924#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:31:45,069 INFO L290 TraceCheckUtils]: 88: Hoare triple {18539#true} assume true; {18539#true} is VALID [2022-04-28 11:31:45,069 INFO L290 TraceCheckUtils]: 87: Hoare triple {18539#true} assume !(0 == ~cond); {18539#true} is VALID [2022-04-28 11:31:45,069 INFO L290 TraceCheckUtils]: 86: Hoare triple {18539#true} ~cond := #in~cond; {18539#true} is VALID [2022-04-28 11:31:45,069 INFO L272 TraceCheckUtils]: 85: Hoare triple {18924#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {18539#true} is VALID [2022-04-28 11:31:45,070 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {18539#true} {18924#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} #85#return; {18924#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:31:45,070 INFO L290 TraceCheckUtils]: 83: Hoare triple {18539#true} assume true; {18539#true} is VALID [2022-04-28 11:31:45,070 INFO L290 TraceCheckUtils]: 82: Hoare triple {18539#true} assume !(0 == ~cond); {18539#true} is VALID [2022-04-28 11:31:45,070 INFO L290 TraceCheckUtils]: 81: Hoare triple {18539#true} ~cond := #in~cond; {18539#true} is VALID [2022-04-28 11:31:45,070 INFO L272 TraceCheckUtils]: 80: Hoare triple {18924#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {18539#true} is VALID [2022-04-28 11:31:45,070 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {18539#true} {18924#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} #83#return; {18924#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:31:45,070 INFO L290 TraceCheckUtils]: 78: Hoare triple {18539#true} assume true; {18539#true} is VALID [2022-04-28 11:31:45,070 INFO L290 TraceCheckUtils]: 77: Hoare triple {18539#true} assume !(0 == ~cond); {18539#true} is VALID [2022-04-28 11:31:45,071 INFO L290 TraceCheckUtils]: 76: Hoare triple {18539#true} ~cond := #in~cond; {18539#true} is VALID [2022-04-28 11:31:45,071 INFO L272 TraceCheckUtils]: 75: Hoare triple {18924#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {18539#true} is VALID [2022-04-28 11:31:45,071 INFO L290 TraceCheckUtils]: 74: Hoare triple {18924#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} assume !!(#t~post7 < 20);havoc #t~post7; {18924#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:31:45,071 INFO L290 TraceCheckUtils]: 73: Hoare triple {18924#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {18924#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:31:45,071 INFO L290 TraceCheckUtils]: 72: Hoare triple {18924#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} ~a~0 := 2 * ~a~0;~b~0 := 2 * ~b~0; {18924#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:31:45,072 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {18539#true} {18924#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} #89#return; {18924#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:31:45,072 INFO L290 TraceCheckUtils]: 70: Hoare triple {18539#true} assume true; {18539#true} is VALID [2022-04-28 11:31:45,072 INFO L290 TraceCheckUtils]: 69: Hoare triple {18539#true} assume !(0 == ~cond); {18539#true} is VALID [2022-04-28 11:31:45,072 INFO L290 TraceCheckUtils]: 68: Hoare triple {18539#true} ~cond := #in~cond; {18539#true} is VALID [2022-04-28 11:31:45,072 INFO L272 TraceCheckUtils]: 67: Hoare triple {18924#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} call __VERIFIER_assert((if ~r~0 >= 2 * ~y~0 * ~a~0 then 1 else 0)); {18539#true} is VALID [2022-04-28 11:31:45,072 INFO L290 TraceCheckUtils]: 66: Hoare triple {18924#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} assume !!(~r~0 >= 2 * ~b~0); {18924#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:31:45,073 INFO L284 TraceCheckUtils]: 65: Hoare quadruple {18539#true} {18924#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} #87#return; {18924#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:31:45,073 INFO L290 TraceCheckUtils]: 64: Hoare triple {18539#true} assume true; {18539#true} is VALID [2022-04-28 11:31:45,073 INFO L290 TraceCheckUtils]: 63: Hoare triple {18539#true} assume !(0 == ~cond); {18539#true} is VALID [2022-04-28 11:31:45,073 INFO L290 TraceCheckUtils]: 62: Hoare triple {18539#true} ~cond := #in~cond; {18539#true} is VALID [2022-04-28 11:31:45,073 INFO L272 TraceCheckUtils]: 61: Hoare triple {18924#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {18539#true} is VALID [2022-04-28 11:31:45,073 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {18539#true} {18924#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} #85#return; {18924#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:31:45,074 INFO L290 TraceCheckUtils]: 59: Hoare triple {18539#true} assume true; {18539#true} is VALID [2022-04-28 11:31:45,074 INFO L290 TraceCheckUtils]: 58: Hoare triple {18539#true} assume !(0 == ~cond); {18539#true} is VALID [2022-04-28 11:31:45,074 INFO L290 TraceCheckUtils]: 57: Hoare triple {18539#true} ~cond := #in~cond; {18539#true} is VALID [2022-04-28 11:31:45,074 INFO L272 TraceCheckUtils]: 56: Hoare triple {18924#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {18539#true} is VALID [2022-04-28 11:31:45,074 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {18539#true} {18924#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} #83#return; {18924#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:31:45,074 INFO L290 TraceCheckUtils]: 54: Hoare triple {18539#true} assume true; {18539#true} is VALID [2022-04-28 11:31:45,074 INFO L290 TraceCheckUtils]: 53: Hoare triple {18539#true} assume !(0 == ~cond); {18539#true} is VALID [2022-04-28 11:31:45,074 INFO L290 TraceCheckUtils]: 52: Hoare triple {18539#true} ~cond := #in~cond; {18539#true} is VALID [2022-04-28 11:31:45,074 INFO L272 TraceCheckUtils]: 51: Hoare triple {18924#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {18539#true} is VALID [2022-04-28 11:31:45,075 INFO L290 TraceCheckUtils]: 50: Hoare triple {18924#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} assume !!(#t~post7 < 20);havoc #t~post7; {18924#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:31:45,075 INFO L290 TraceCheckUtils]: 49: Hoare triple {18924#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {18924#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:31:45,075 INFO L290 TraceCheckUtils]: 48: Hoare triple {18924#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} ~a~0 := 2 * ~a~0;~b~0 := 2 * ~b~0; {18924#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:31:45,076 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {18539#true} {18924#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} #89#return; {18924#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:31:45,076 INFO L290 TraceCheckUtils]: 46: Hoare triple {18539#true} assume true; {18539#true} is VALID [2022-04-28 11:31:45,076 INFO L290 TraceCheckUtils]: 45: Hoare triple {18539#true} assume !(0 == ~cond); {18539#true} is VALID [2022-04-28 11:31:45,076 INFO L290 TraceCheckUtils]: 44: Hoare triple {18539#true} ~cond := #in~cond; {18539#true} is VALID [2022-04-28 11:31:45,076 INFO L272 TraceCheckUtils]: 43: Hoare triple {18924#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} call __VERIFIER_assert((if ~r~0 >= 2 * ~y~0 * ~a~0 then 1 else 0)); {18539#true} is VALID [2022-04-28 11:31:45,076 INFO L290 TraceCheckUtils]: 42: Hoare triple {18924#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} assume !!(~r~0 >= 2 * ~b~0); {18924#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:31:45,077 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {18539#true} {18924#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} #87#return; {18924#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:31:45,077 INFO L290 TraceCheckUtils]: 40: Hoare triple {18539#true} assume true; {18539#true} is VALID [2022-04-28 11:31:45,077 INFO L290 TraceCheckUtils]: 39: Hoare triple {18539#true} assume !(0 == ~cond); {18539#true} is VALID [2022-04-28 11:31:45,077 INFO L290 TraceCheckUtils]: 38: Hoare triple {18539#true} ~cond := #in~cond; {18539#true} is VALID [2022-04-28 11:31:45,077 INFO L272 TraceCheckUtils]: 37: Hoare triple {18924#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {18539#true} is VALID [2022-04-28 11:31:45,077 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {18539#true} {18924#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} #85#return; {18924#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:31:45,077 INFO L290 TraceCheckUtils]: 35: Hoare triple {18539#true} assume true; {18539#true} is VALID [2022-04-28 11:31:45,077 INFO L290 TraceCheckUtils]: 34: Hoare triple {18539#true} assume !(0 == ~cond); {18539#true} is VALID [2022-04-28 11:31:45,078 INFO L290 TraceCheckUtils]: 33: Hoare triple {18539#true} ~cond := #in~cond; {18539#true} is VALID [2022-04-28 11:31:45,078 INFO L272 TraceCheckUtils]: 32: Hoare triple {18924#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {18539#true} is VALID [2022-04-28 11:31:45,078 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {18539#true} {18924#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} #83#return; {18924#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:31:45,078 INFO L290 TraceCheckUtils]: 30: Hoare triple {18539#true} assume true; {18539#true} is VALID [2022-04-28 11:31:45,078 INFO L290 TraceCheckUtils]: 29: Hoare triple {18539#true} assume !(0 == ~cond); {18539#true} is VALID [2022-04-28 11:31:45,078 INFO L290 TraceCheckUtils]: 28: Hoare triple {18539#true} ~cond := #in~cond; {18539#true} is VALID [2022-04-28 11:31:45,078 INFO L272 TraceCheckUtils]: 27: Hoare triple {18924#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {18539#true} is VALID [2022-04-28 11:31:45,079 INFO L290 TraceCheckUtils]: 26: Hoare triple {18924#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} assume !!(#t~post7 < 20);havoc #t~post7; {18924#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:31:45,079 INFO L290 TraceCheckUtils]: 25: Hoare triple {18924#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {18924#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:31:45,079 INFO L290 TraceCheckUtils]: 24: Hoare triple {18924#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {18924#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:31:45,080 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {18539#true} {18924#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} #81#return; {18924#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:31:45,080 INFO L290 TraceCheckUtils]: 22: Hoare triple {18539#true} assume true; {18539#true} is VALID [2022-04-28 11:31:45,080 INFO L290 TraceCheckUtils]: 21: Hoare triple {18539#true} assume !(0 == ~cond); {18539#true} is VALID [2022-04-28 11:31:45,080 INFO L290 TraceCheckUtils]: 20: Hoare triple {18539#true} ~cond := #in~cond; {18539#true} is VALID [2022-04-28 11:31:45,080 INFO L272 TraceCheckUtils]: 19: Hoare triple {18924#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {18539#true} is VALID [2022-04-28 11:31:45,080 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {18539#true} {18924#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} #79#return; {18924#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:31:45,080 INFO L290 TraceCheckUtils]: 17: Hoare triple {18539#true} assume true; {18539#true} is VALID [2022-04-28 11:31:45,080 INFO L290 TraceCheckUtils]: 16: Hoare triple {18539#true} assume !(0 == ~cond); {18539#true} is VALID [2022-04-28 11:31:45,080 INFO L290 TraceCheckUtils]: 15: Hoare triple {18539#true} ~cond := #in~cond; {18539#true} is VALID [2022-04-28 11:31:45,081 INFO L272 TraceCheckUtils]: 14: Hoare triple {18924#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {18539#true} is VALID [2022-04-28 11:31:45,081 INFO L290 TraceCheckUtils]: 13: Hoare triple {18924#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} assume !!(#t~post6 < 20);havoc #t~post6; {18924#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:31:45,081 INFO L290 TraceCheckUtils]: 12: Hoare triple {18924#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {18924#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:31:45,081 INFO L290 TraceCheckUtils]: 11: Hoare triple {18539#true} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {18924#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:31:45,081 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {18539#true} {18539#true} #77#return; {18539#true} is VALID [2022-04-28 11:31:45,082 INFO L290 TraceCheckUtils]: 9: Hoare triple {18539#true} assume true; {18539#true} is VALID [2022-04-28 11:31:45,082 INFO L290 TraceCheckUtils]: 8: Hoare triple {18539#true} assume !(0 == ~cond); {18539#true} is VALID [2022-04-28 11:31:45,082 INFO L290 TraceCheckUtils]: 7: Hoare triple {18539#true} ~cond := #in~cond; {18539#true} is VALID [2022-04-28 11:31:45,082 INFO L272 TraceCheckUtils]: 6: Hoare triple {18539#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {18539#true} is VALID [2022-04-28 11:31:45,082 INFO L290 TraceCheckUtils]: 5: Hoare triple {18539#true} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~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; {18539#true} is VALID [2022-04-28 11:31:45,082 INFO L272 TraceCheckUtils]: 4: Hoare triple {18539#true} call #t~ret8 := main(); {18539#true} is VALID [2022-04-28 11:31:45,082 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18539#true} {18539#true} #93#return; {18539#true} is VALID [2022-04-28 11:31:45,082 INFO L290 TraceCheckUtils]: 2: Hoare triple {18539#true} assume true; {18539#true} is VALID [2022-04-28 11:31:45,082 INFO L290 TraceCheckUtils]: 1: Hoare triple {18539#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(14, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {18539#true} is VALID [2022-04-28 11:31:45,082 INFO L272 TraceCheckUtils]: 0: Hoare triple {18539#true} call ULTIMATE.init(); {18539#true} is VALID [2022-04-28 11:31:45,082 INFO L134 CoverageAnalysis]: Checked inductivity of 622 backedges. 75 proven. 16 refuted. 0 times theorem prover too weak. 531 trivial. 0 not checked. [2022-04-28 11:31:45,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:31:45,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880463871] [2022-04-28 11:31:45,083 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:31:45,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1996117714] [2022-04-28 11:31:45,083 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1996117714] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 11:31:45,083 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 11:31:45,083 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 13 [2022-04-28 11:31:45,083 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:31:45,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [553410923] [2022-04-28 11:31:45,083 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [553410923] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:31:45,083 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:31:45,083 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 11:31:45,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022837032] [2022-04-28 11:31:45,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:31:45,084 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 9 states have internal predecessors, (30), 5 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) Word has length 122 [2022-04-28 11:31:45,084 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:31:45,084 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 3.0) internal successors, (30), 9 states have internal predecessors, (30), 5 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2022-04-28 11:31:45,158 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-28 11:31:45,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 11:31:45,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:31:45,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 11:31:45,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2022-04-28 11:31:45,159 INFO L87 Difference]: Start difference. First operand 216 states and 259 transitions. Second operand has 10 states, 10 states have (on average 3.0) internal successors, (30), 9 states have internal predecessors, (30), 5 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2022-04-28 11:31:46,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:31:46,570 INFO L93 Difference]: Finished difference Result 250 states and 306 transitions. [2022-04-28 11:31:46,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 11:31:46,570 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 9 states have internal predecessors, (30), 5 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) Word has length 122 [2022-04-28 11:31:46,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:31:46,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.0) internal successors, (30), 9 states have internal predecessors, (30), 5 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2022-04-28 11:31:46,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 110 transitions. [2022-04-28 11:31:46,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.0) internal successors, (30), 9 states have internal predecessors, (30), 5 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2022-04-28 11:31:46,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 110 transitions. [2022-04-28 11:31:46,588 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 110 transitions. [2022-04-28 11:31:46,706 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:31:46,710 INFO L225 Difference]: With dead ends: 250 [2022-04-28 11:31:46,710 INFO L226 Difference]: Without dead ends: 247 [2022-04-28 11:31:46,710 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 230 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2022-04-28 11:31:46,711 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 35 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-28 11:31:46,711 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 159 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 11:31:46,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2022-04-28 11:31:46,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 244. [2022-04-28 11:31:46,995 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:31:46,996 INFO L82 GeneralOperation]: Start isEquivalent. First operand 247 states. Second operand has 244 states, 155 states have (on average 1.1483870967741936) internal successors, (178), 157 states have internal predecessors, (178), 61 states have call successors, (61), 28 states have call predecessors, (61), 27 states have return successors, (59), 58 states have call predecessors, (59), 59 states have call successors, (59) [2022-04-28 11:31:46,996 INFO L74 IsIncluded]: Start isIncluded. First operand 247 states. Second operand has 244 states, 155 states have (on average 1.1483870967741936) internal successors, (178), 157 states have internal predecessors, (178), 61 states have call successors, (61), 28 states have call predecessors, (61), 27 states have return successors, (59), 58 states have call predecessors, (59), 59 states have call successors, (59) [2022-04-28 11:31:46,996 INFO L87 Difference]: Start difference. First operand 247 states. Second operand has 244 states, 155 states have (on average 1.1483870967741936) internal successors, (178), 157 states have internal predecessors, (178), 61 states have call successors, (61), 28 states have call predecessors, (61), 27 states have return successors, (59), 58 states have call predecessors, (59), 59 states have call successors, (59) [2022-04-28 11:31:47,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:31:47,000 INFO L93 Difference]: Finished difference Result 247 states and 301 transitions. [2022-04-28 11:31:47,001 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 301 transitions. [2022-04-28 11:31:47,001 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:31:47,001 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:31:47,002 INFO L74 IsIncluded]: Start isIncluded. First operand has 244 states, 155 states have (on average 1.1483870967741936) internal successors, (178), 157 states have internal predecessors, (178), 61 states have call successors, (61), 28 states have call predecessors, (61), 27 states have return successors, (59), 58 states have call predecessors, (59), 59 states have call successors, (59) Second operand 247 states. [2022-04-28 11:31:47,002 INFO L87 Difference]: Start difference. First operand has 244 states, 155 states have (on average 1.1483870967741936) internal successors, (178), 157 states have internal predecessors, (178), 61 states have call successors, (61), 28 states have call predecessors, (61), 27 states have return successors, (59), 58 states have call predecessors, (59), 59 states have call successors, (59) Second operand 247 states. [2022-04-28 11:31:47,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:31:47,016 INFO L93 Difference]: Finished difference Result 247 states and 301 transitions. [2022-04-28 11:31:47,016 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 301 transitions. [2022-04-28 11:31:47,017 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:31:47,017 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:31:47,017 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:31:47,017 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:31:47,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 155 states have (on average 1.1483870967741936) internal successors, (178), 157 states have internal predecessors, (178), 61 states have call successors, (61), 28 states have call predecessors, (61), 27 states have return successors, (59), 58 states have call predecessors, (59), 59 states have call successors, (59) [2022-04-28 11:31:47,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 298 transitions. [2022-04-28 11:31:47,023 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 298 transitions. Word has length 122 [2022-04-28 11:31:47,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:31:47,024 INFO L495 AbstractCegarLoop]: Abstraction has 244 states and 298 transitions. [2022-04-28 11:31:47,024 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 9 states have internal predecessors, (30), 5 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2022-04-28 11:31:47,024 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 244 states and 298 transitions. [2022-04-28 11:31:47,425 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 298 edges. 298 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:31:47,426 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 298 transitions. [2022-04-28 11:31:47,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2022-04-28 11:31:47,427 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:31:47,427 INFO L195 NwaCegarLoop]: trace histogram [18, 17, 17, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:31:47,459 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2022-04-28 11:31:47,627 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-28 11:31:47,627 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:31:47,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:31:47,628 INFO L85 PathProgramCache]: Analyzing trace with hash -877539457, now seen corresponding path program 5 times [2022-04-28 11:31:47,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:31:47,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1796725430] [2022-04-28 11:32:22,202 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:32:22,202 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:32:22,202 INFO L85 PathProgramCache]: Analyzing trace with hash -877539457, now seen corresponding path program 6 times [2022-04-28 11:32:22,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:32:22,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099092181] [2022-04-28 11:32:22,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:32:22,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:32:22,215 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:32:22,215 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [468874971] [2022-04-28 11:32:22,215 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 11:32:22,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:32:22,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:32:22,216 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-28 11:32:22,218 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-28 11:32:22,278 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-28 11:32:22,278 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:32:22,279 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-28 11:32:22,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:32:22,295 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:32:22,528 INFO L272 TraceCheckUtils]: 0: Hoare triple {20769#true} call ULTIMATE.init(); {20769#true} is VALID [2022-04-28 11:32:22,528 INFO L290 TraceCheckUtils]: 1: Hoare triple {20769#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(14, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {20769#true} is VALID [2022-04-28 11:32:22,528 INFO L290 TraceCheckUtils]: 2: Hoare triple {20769#true} assume true; {20769#true} is VALID [2022-04-28 11:32:22,528 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20769#true} {20769#true} #93#return; {20769#true} is VALID [2022-04-28 11:32:22,528 INFO L272 TraceCheckUtils]: 4: Hoare triple {20769#true} call #t~ret8 := main(); {20769#true} is VALID [2022-04-28 11:32:22,528 INFO L290 TraceCheckUtils]: 5: Hoare triple {20769#true} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~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; {20769#true} is VALID [2022-04-28 11:32:22,528 INFO L272 TraceCheckUtils]: 6: Hoare triple {20769#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {20769#true} is VALID [2022-04-28 11:32:22,528 INFO L290 TraceCheckUtils]: 7: Hoare triple {20769#true} ~cond := #in~cond; {20769#true} is VALID [2022-04-28 11:32:22,528 INFO L290 TraceCheckUtils]: 8: Hoare triple {20769#true} assume !(0 == ~cond); {20769#true} is VALID [2022-04-28 11:32:22,528 INFO L290 TraceCheckUtils]: 9: Hoare triple {20769#true} assume true; {20769#true} is VALID [2022-04-28 11:32:22,529 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {20769#true} {20769#true} #77#return; {20769#true} is VALID [2022-04-28 11:32:22,529 INFO L290 TraceCheckUtils]: 11: Hoare triple {20769#true} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {20769#true} is VALID [2022-04-28 11:32:22,529 INFO L290 TraceCheckUtils]: 12: Hoare triple {20769#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {20769#true} is VALID [2022-04-28 11:32:22,529 INFO L290 TraceCheckUtils]: 13: Hoare triple {20769#true} assume !!(#t~post6 < 20);havoc #t~post6; {20769#true} is VALID [2022-04-28 11:32:22,529 INFO L272 TraceCheckUtils]: 14: Hoare triple {20769#true} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {20769#true} is VALID [2022-04-28 11:32:22,529 INFO L290 TraceCheckUtils]: 15: Hoare triple {20769#true} ~cond := #in~cond; {20769#true} is VALID [2022-04-28 11:32:22,529 INFO L290 TraceCheckUtils]: 16: Hoare triple {20769#true} assume !(0 == ~cond); {20769#true} is VALID [2022-04-28 11:32:22,529 INFO L290 TraceCheckUtils]: 17: Hoare triple {20769#true} assume true; {20769#true} is VALID [2022-04-28 11:32:22,529 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {20769#true} {20769#true} #79#return; {20769#true} is VALID [2022-04-28 11:32:22,529 INFO L272 TraceCheckUtils]: 19: Hoare triple {20769#true} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {20769#true} is VALID [2022-04-28 11:32:22,529 INFO L290 TraceCheckUtils]: 20: Hoare triple {20769#true} ~cond := #in~cond; {20769#true} is VALID [2022-04-28 11:32:22,529 INFO L290 TraceCheckUtils]: 21: Hoare triple {20769#true} assume !(0 == ~cond); {20769#true} is VALID [2022-04-28 11:32:22,529 INFO L290 TraceCheckUtils]: 22: Hoare triple {20769#true} assume true; {20769#true} is VALID [2022-04-28 11:32:22,529 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {20769#true} {20769#true} #81#return; {20769#true} is VALID [2022-04-28 11:32:22,529 INFO L290 TraceCheckUtils]: 24: Hoare triple {20769#true} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {20769#true} is VALID [2022-04-28 11:32:22,529 INFO L290 TraceCheckUtils]: 25: Hoare triple {20769#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {20769#true} is VALID [2022-04-28 11:32:22,529 INFO L290 TraceCheckUtils]: 26: Hoare triple {20769#true} assume !!(#t~post7 < 20);havoc #t~post7; {20769#true} is VALID [2022-04-28 11:32:22,529 INFO L272 TraceCheckUtils]: 27: Hoare triple {20769#true} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {20769#true} is VALID [2022-04-28 11:32:22,529 INFO L290 TraceCheckUtils]: 28: Hoare triple {20769#true} ~cond := #in~cond; {20769#true} is VALID [2022-04-28 11:32:22,530 INFO L290 TraceCheckUtils]: 29: Hoare triple {20769#true} assume !(0 == ~cond); {20769#true} is VALID [2022-04-28 11:32:22,530 INFO L290 TraceCheckUtils]: 30: Hoare triple {20769#true} assume true; {20769#true} is VALID [2022-04-28 11:32:22,530 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {20769#true} {20769#true} #83#return; {20769#true} is VALID [2022-04-28 11:32:22,530 INFO L272 TraceCheckUtils]: 32: Hoare triple {20769#true} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {20769#true} is VALID [2022-04-28 11:32:22,530 INFO L290 TraceCheckUtils]: 33: Hoare triple {20769#true} ~cond := #in~cond; {20769#true} is VALID [2022-04-28 11:32:22,530 INFO L290 TraceCheckUtils]: 34: Hoare triple {20769#true} assume !(0 == ~cond); {20769#true} is VALID [2022-04-28 11:32:22,530 INFO L290 TraceCheckUtils]: 35: Hoare triple {20769#true} assume true; {20769#true} is VALID [2022-04-28 11:32:22,530 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {20769#true} {20769#true} #85#return; {20769#true} is VALID [2022-04-28 11:32:22,530 INFO L272 TraceCheckUtils]: 37: Hoare triple {20769#true} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {20769#true} is VALID [2022-04-28 11:32:22,530 INFO L290 TraceCheckUtils]: 38: Hoare triple {20769#true} ~cond := #in~cond; {20769#true} is VALID [2022-04-28 11:32:22,530 INFO L290 TraceCheckUtils]: 39: Hoare triple {20769#true} assume !(0 == ~cond); {20769#true} is VALID [2022-04-28 11:32:22,530 INFO L290 TraceCheckUtils]: 40: Hoare triple {20769#true} assume true; {20769#true} is VALID [2022-04-28 11:32:22,530 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {20769#true} {20769#true} #87#return; {20769#true} is VALID [2022-04-28 11:32:22,530 INFO L290 TraceCheckUtils]: 42: Hoare triple {20769#true} assume !!(~r~0 >= 2 * ~b~0); {20769#true} is VALID [2022-04-28 11:32:22,530 INFO L272 TraceCheckUtils]: 43: Hoare triple {20769#true} call __VERIFIER_assert((if ~r~0 >= 2 * ~y~0 * ~a~0 then 1 else 0)); {20769#true} is VALID [2022-04-28 11:32:22,530 INFO L290 TraceCheckUtils]: 44: Hoare triple {20769#true} ~cond := #in~cond; {20769#true} is VALID [2022-04-28 11:32:22,530 INFO L290 TraceCheckUtils]: 45: Hoare triple {20769#true} assume !(0 == ~cond); {20769#true} is VALID [2022-04-28 11:32:22,530 INFO L290 TraceCheckUtils]: 46: Hoare triple {20769#true} assume true; {20769#true} is VALID [2022-04-28 11:32:22,530 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {20769#true} {20769#true} #89#return; {20769#true} is VALID [2022-04-28 11:32:22,531 INFO L290 TraceCheckUtils]: 48: Hoare triple {20769#true} ~a~0 := 2 * ~a~0;~b~0 := 2 * ~b~0; {20769#true} is VALID [2022-04-28 11:32:22,531 INFO L290 TraceCheckUtils]: 49: Hoare triple {20769#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {20769#true} is VALID [2022-04-28 11:32:22,531 INFO L290 TraceCheckUtils]: 50: Hoare triple {20769#true} assume !!(#t~post7 < 20);havoc #t~post7; {20769#true} is VALID [2022-04-28 11:32:22,531 INFO L272 TraceCheckUtils]: 51: Hoare triple {20769#true} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {20769#true} is VALID [2022-04-28 11:32:22,531 INFO L290 TraceCheckUtils]: 52: Hoare triple {20769#true} ~cond := #in~cond; {20769#true} is VALID [2022-04-28 11:32:22,531 INFO L290 TraceCheckUtils]: 53: Hoare triple {20769#true} assume !(0 == ~cond); {20769#true} is VALID [2022-04-28 11:32:22,531 INFO L290 TraceCheckUtils]: 54: Hoare triple {20769#true} assume true; {20769#true} is VALID [2022-04-28 11:32:22,531 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {20769#true} {20769#true} #83#return; {20769#true} is VALID [2022-04-28 11:32:22,531 INFO L272 TraceCheckUtils]: 56: Hoare triple {20769#true} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {20769#true} is VALID [2022-04-28 11:32:22,531 INFO L290 TraceCheckUtils]: 57: Hoare triple {20769#true} ~cond := #in~cond; {20769#true} is VALID [2022-04-28 11:32:22,531 INFO L290 TraceCheckUtils]: 58: Hoare triple {20769#true} assume !(0 == ~cond); {20769#true} is VALID [2022-04-28 11:32:22,531 INFO L290 TraceCheckUtils]: 59: Hoare triple {20769#true} assume true; {20769#true} is VALID [2022-04-28 11:32:22,531 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {20769#true} {20769#true} #85#return; {20769#true} is VALID [2022-04-28 11:32:22,531 INFO L272 TraceCheckUtils]: 61: Hoare triple {20769#true} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {20769#true} is VALID [2022-04-28 11:32:22,531 INFO L290 TraceCheckUtils]: 62: Hoare triple {20769#true} ~cond := #in~cond; {20769#true} is VALID [2022-04-28 11:32:22,531 INFO L290 TraceCheckUtils]: 63: Hoare triple {20769#true} assume !(0 == ~cond); {20769#true} is VALID [2022-04-28 11:32:22,531 INFO L290 TraceCheckUtils]: 64: Hoare triple {20769#true} assume true; {20769#true} is VALID [2022-04-28 11:32:22,531 INFO L284 TraceCheckUtils]: 65: Hoare quadruple {20769#true} {20769#true} #87#return; {20769#true} is VALID [2022-04-28 11:32:22,531 INFO L290 TraceCheckUtils]: 66: Hoare triple {20769#true} assume !!(~r~0 >= 2 * ~b~0); {20769#true} is VALID [2022-04-28 11:32:22,532 INFO L272 TraceCheckUtils]: 67: Hoare triple {20769#true} call __VERIFIER_assert((if ~r~0 >= 2 * ~y~0 * ~a~0 then 1 else 0)); {20769#true} is VALID [2022-04-28 11:32:22,532 INFO L290 TraceCheckUtils]: 68: Hoare triple {20769#true} ~cond := #in~cond; {20769#true} is VALID [2022-04-28 11:32:22,532 INFO L290 TraceCheckUtils]: 69: Hoare triple {20769#true} assume !(0 == ~cond); {20769#true} is VALID [2022-04-28 11:32:22,532 INFO L290 TraceCheckUtils]: 70: Hoare triple {20769#true} assume true; {20769#true} is VALID [2022-04-28 11:32:22,532 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {20769#true} {20769#true} #89#return; {20769#true} is VALID [2022-04-28 11:32:22,532 INFO L290 TraceCheckUtils]: 72: Hoare triple {20769#true} ~a~0 := 2 * ~a~0;~b~0 := 2 * ~b~0; {20769#true} is VALID [2022-04-28 11:32:22,532 INFO L290 TraceCheckUtils]: 73: Hoare triple {20769#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {20769#true} is VALID [2022-04-28 11:32:22,532 INFO L290 TraceCheckUtils]: 74: Hoare triple {20769#true} assume !!(#t~post7 < 20);havoc #t~post7; {20769#true} is VALID [2022-04-28 11:32:22,532 INFO L272 TraceCheckUtils]: 75: Hoare triple {20769#true} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {20769#true} is VALID [2022-04-28 11:32:22,532 INFO L290 TraceCheckUtils]: 76: Hoare triple {20769#true} ~cond := #in~cond; {20769#true} is VALID [2022-04-28 11:32:22,532 INFO L290 TraceCheckUtils]: 77: Hoare triple {20769#true} assume !(0 == ~cond); {20769#true} is VALID [2022-04-28 11:32:22,532 INFO L290 TraceCheckUtils]: 78: Hoare triple {20769#true} assume true; {20769#true} is VALID [2022-04-28 11:32:22,532 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {20769#true} {20769#true} #83#return; {20769#true} is VALID [2022-04-28 11:32:22,532 INFO L272 TraceCheckUtils]: 80: Hoare triple {20769#true} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {20769#true} is VALID [2022-04-28 11:32:22,532 INFO L290 TraceCheckUtils]: 81: Hoare triple {20769#true} ~cond := #in~cond; {20769#true} is VALID [2022-04-28 11:32:22,532 INFO L290 TraceCheckUtils]: 82: Hoare triple {20769#true} assume !(0 == ~cond); {20769#true} is VALID [2022-04-28 11:32:22,532 INFO L290 TraceCheckUtils]: 83: Hoare triple {20769#true} assume true; {20769#true} is VALID [2022-04-28 11:32:22,532 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {20769#true} {20769#true} #85#return; {20769#true} is VALID [2022-04-28 11:32:22,533 INFO L272 TraceCheckUtils]: 85: Hoare triple {20769#true} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {20769#true} is VALID [2022-04-28 11:32:22,533 INFO L290 TraceCheckUtils]: 86: Hoare triple {20769#true} ~cond := #in~cond; {20769#true} is VALID [2022-04-28 11:32:22,533 INFO L290 TraceCheckUtils]: 87: Hoare triple {20769#true} assume !(0 == ~cond); {20769#true} is VALID [2022-04-28 11:32:22,533 INFO L290 TraceCheckUtils]: 88: Hoare triple {20769#true} assume true; {20769#true} is VALID [2022-04-28 11:32:22,533 INFO L284 TraceCheckUtils]: 89: Hoare quadruple {20769#true} {20769#true} #87#return; {20769#true} is VALID [2022-04-28 11:32:22,533 INFO L290 TraceCheckUtils]: 90: Hoare triple {20769#true} assume !(~r~0 >= 2 * ~b~0); {20769#true} is VALID [2022-04-28 11:32:22,533 INFO L290 TraceCheckUtils]: 91: Hoare triple {20769#true} ~r~0 := ~r~0 - ~b~0;~q~0 := ~q~0 + ~a~0; {20769#true} is VALID [2022-04-28 11:32:22,533 INFO L290 TraceCheckUtils]: 92: Hoare triple {20769#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {20769#true} is VALID [2022-04-28 11:32:22,533 INFO L290 TraceCheckUtils]: 93: Hoare triple {20769#true} assume !!(#t~post6 < 20);havoc #t~post6; {20769#true} is VALID [2022-04-28 11:32:22,533 INFO L272 TraceCheckUtils]: 94: Hoare triple {20769#true} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {20769#true} is VALID [2022-04-28 11:32:22,533 INFO L290 TraceCheckUtils]: 95: Hoare triple {20769#true} ~cond := #in~cond; {20769#true} is VALID [2022-04-28 11:32:22,533 INFO L290 TraceCheckUtils]: 96: Hoare triple {20769#true} assume !(0 == ~cond); {20769#true} is VALID [2022-04-28 11:32:22,533 INFO L290 TraceCheckUtils]: 97: Hoare triple {20769#true} assume true; {20769#true} is VALID [2022-04-28 11:32:22,533 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {20769#true} {20769#true} #79#return; {20769#true} is VALID [2022-04-28 11:32:22,533 INFO L272 TraceCheckUtils]: 99: Hoare triple {20769#true} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {20769#true} is VALID [2022-04-28 11:32:22,533 INFO L290 TraceCheckUtils]: 100: Hoare triple {20769#true} ~cond := #in~cond; {20769#true} is VALID [2022-04-28 11:32:22,533 INFO L290 TraceCheckUtils]: 101: Hoare triple {20769#true} assume !(0 == ~cond); {20769#true} is VALID [2022-04-28 11:32:22,533 INFO L290 TraceCheckUtils]: 102: Hoare triple {20769#true} assume true; {20769#true} is VALID [2022-04-28 11:32:22,533 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {20769#true} {20769#true} #81#return; {20769#true} is VALID [2022-04-28 11:32:22,534 INFO L290 TraceCheckUtils]: 104: Hoare triple {20769#true} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {20769#true} is VALID [2022-04-28 11:32:22,534 INFO L290 TraceCheckUtils]: 105: Hoare triple {20769#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {21089#(<= (+ |main_#t~post7| 1) ~counter~0)} is VALID [2022-04-28 11:32:22,535 INFO L290 TraceCheckUtils]: 106: Hoare triple {21089#(<= (+ |main_#t~post7| 1) ~counter~0)} assume !(#t~post7 < 20);havoc #t~post7; {21093#(<= 21 ~counter~0)} is VALID [2022-04-28 11:32:22,535 INFO L290 TraceCheckUtils]: 107: Hoare triple {21093#(<= 21 ~counter~0)} ~r~0 := ~r~0 - ~b~0;~q~0 := ~q~0 + ~a~0; {21093#(<= 21 ~counter~0)} is VALID [2022-04-28 11:32:22,536 INFO L290 TraceCheckUtils]: 108: Hoare triple {21093#(<= 21 ~counter~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {21100#(<= 21 |main_#t~post6|)} is VALID [2022-04-28 11:32:22,536 INFO L290 TraceCheckUtils]: 109: Hoare triple {21100#(<= 21 |main_#t~post6|)} assume !!(#t~post6 < 20);havoc #t~post6; {20770#false} is VALID [2022-04-28 11:32:22,536 INFO L272 TraceCheckUtils]: 110: Hoare triple {20770#false} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {20770#false} is VALID [2022-04-28 11:32:22,536 INFO L290 TraceCheckUtils]: 111: Hoare triple {20770#false} ~cond := #in~cond; {20770#false} is VALID [2022-04-28 11:32:22,536 INFO L290 TraceCheckUtils]: 112: Hoare triple {20770#false} assume !(0 == ~cond); {20770#false} is VALID [2022-04-28 11:32:22,536 INFO L290 TraceCheckUtils]: 113: Hoare triple {20770#false} assume true; {20770#false} is VALID [2022-04-28 11:32:22,536 INFO L284 TraceCheckUtils]: 114: Hoare quadruple {20770#false} {20770#false} #79#return; {20770#false} is VALID [2022-04-28 11:32:22,536 INFO L272 TraceCheckUtils]: 115: Hoare triple {20770#false} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {20770#false} is VALID [2022-04-28 11:32:22,536 INFO L290 TraceCheckUtils]: 116: Hoare triple {20770#false} ~cond := #in~cond; {20770#false} is VALID [2022-04-28 11:32:22,536 INFO L290 TraceCheckUtils]: 117: Hoare triple {20770#false} assume !(0 == ~cond); {20770#false} is VALID [2022-04-28 11:32:22,536 INFO L290 TraceCheckUtils]: 118: Hoare triple {20770#false} assume true; {20770#false} is VALID [2022-04-28 11:32:22,537 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {20770#false} {20770#false} #81#return; {20770#false} is VALID [2022-04-28 11:32:22,537 INFO L290 TraceCheckUtils]: 120: Hoare triple {20770#false} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {20770#false} is VALID [2022-04-28 11:32:22,537 INFO L290 TraceCheckUtils]: 121: Hoare triple {20770#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {20770#false} is VALID [2022-04-28 11:32:22,537 INFO L290 TraceCheckUtils]: 122: Hoare triple {20770#false} assume !(#t~post7 < 20);havoc #t~post7; {20770#false} is VALID [2022-04-28 11:32:22,537 INFO L290 TraceCheckUtils]: 123: Hoare triple {20770#false} ~r~0 := ~r~0 - ~b~0;~q~0 := ~q~0 + ~a~0; {20770#false} is VALID [2022-04-28 11:32:22,537 INFO L290 TraceCheckUtils]: 124: Hoare triple {20770#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {20770#false} is VALID [2022-04-28 11:32:22,537 INFO L290 TraceCheckUtils]: 125: Hoare triple {20770#false} assume !(#t~post6 < 20);havoc #t~post6; {20770#false} is VALID [2022-04-28 11:32:22,537 INFO L272 TraceCheckUtils]: 126: Hoare triple {20770#false} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {20770#false} is VALID [2022-04-28 11:32:22,537 INFO L290 TraceCheckUtils]: 127: Hoare triple {20770#false} ~cond := #in~cond; {20770#false} is VALID [2022-04-28 11:32:22,537 INFO L290 TraceCheckUtils]: 128: Hoare triple {20770#false} assume 0 == ~cond; {20770#false} is VALID [2022-04-28 11:32:22,537 INFO L290 TraceCheckUtils]: 129: Hoare triple {20770#false} assume !false; {20770#false} is VALID [2022-04-28 11:32:22,537 INFO L134 CoverageAnalysis]: Checked inductivity of 636 backedges. 180 proven. 0 refuted. 0 times theorem prover too weak. 456 trivial. 0 not checked. [2022-04-28 11:32:22,537 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 11:32:22,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:32:22,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099092181] [2022-04-28 11:32:22,538 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:32:22,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [468874971] [2022-04-28 11:32:22,538 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [468874971] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:32:22,538 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:32:22,538 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 11:32:22,538 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:32:22,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1796725430] [2022-04-28 11:32:22,538 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1796725430] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:32:22,538 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:32:22,538 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 11:32:22,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241978943] [2022-04-28 11:32:22,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:32:22,539 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 130 [2022-04-28 11:32:22,539 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:32:22,539 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-04-28 11:32:22,581 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:32:22,581 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 11:32:22,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:32:22,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 11:32:22,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 11:32:22,582 INFO L87 Difference]: Start difference. First operand 244 states and 298 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-04-28 11:32:23,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:32:23,093 INFO L93 Difference]: Finished difference Result 330 states and 410 transitions. [2022-04-28 11:32:23,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 11:32:23,093 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 130 [2022-04-28 11:32:23,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:32:23,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-04-28 11:32:23,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 82 transitions. [2022-04-28 11:32:23,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-04-28 11:32:23,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 82 transitions. [2022-04-28 11:32:23,095 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 82 transitions. [2022-04-28 11:32:23,156 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:32:23,169 INFO L225 Difference]: With dead ends: 330 [2022-04-28 11:32:23,169 INFO L226 Difference]: Without dead ends: 227 [2022-04-28 11:32:23,169 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 11:32:23,170 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 6 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 11:32:23,171 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 160 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 11:32:23,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2022-04-28 11:32:23,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 219. [2022-04-28 11:32:23,504 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:32:23,506 INFO L82 GeneralOperation]: Start isEquivalent. First operand 227 states. Second operand has 219 states, 140 states have (on average 1.1142857142857143) internal successors, (156), 142 states have internal predecessors, (156), 52 states have call successors, (52), 28 states have call predecessors, (52), 26 states have return successors, (49), 48 states have call predecessors, (49), 49 states have call successors, (49) [2022-04-28 11:32:23,506 INFO L74 IsIncluded]: Start isIncluded. First operand 227 states. Second operand has 219 states, 140 states have (on average 1.1142857142857143) internal successors, (156), 142 states have internal predecessors, (156), 52 states have call successors, (52), 28 states have call predecessors, (52), 26 states have return successors, (49), 48 states have call predecessors, (49), 49 states have call successors, (49) [2022-04-28 11:32:23,506 INFO L87 Difference]: Start difference. First operand 227 states. Second operand has 219 states, 140 states have (on average 1.1142857142857143) internal successors, (156), 142 states have internal predecessors, (156), 52 states have call successors, (52), 28 states have call predecessors, (52), 26 states have return successors, (49), 48 states have call predecessors, (49), 49 states have call successors, (49) [2022-04-28 11:32:23,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:32:23,510 INFO L93 Difference]: Finished difference Result 227 states and 264 transitions. [2022-04-28 11:32:23,510 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 264 transitions. [2022-04-28 11:32:23,510 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:32:23,510 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:32:23,510 INFO L74 IsIncluded]: Start isIncluded. First operand has 219 states, 140 states have (on average 1.1142857142857143) internal successors, (156), 142 states have internal predecessors, (156), 52 states have call successors, (52), 28 states have call predecessors, (52), 26 states have return successors, (49), 48 states have call predecessors, (49), 49 states have call successors, (49) Second operand 227 states. [2022-04-28 11:32:23,511 INFO L87 Difference]: Start difference. First operand has 219 states, 140 states have (on average 1.1142857142857143) internal successors, (156), 142 states have internal predecessors, (156), 52 states have call successors, (52), 28 states have call predecessors, (52), 26 states have return successors, (49), 48 states have call predecessors, (49), 49 states have call successors, (49) Second operand 227 states. [2022-04-28 11:32:23,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:32:23,515 INFO L93 Difference]: Finished difference Result 227 states and 264 transitions. [2022-04-28 11:32:23,515 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 264 transitions. [2022-04-28 11:32:23,515 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:32:23,515 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:32:23,515 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:32:23,515 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:32:23,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 140 states have (on average 1.1142857142857143) internal successors, (156), 142 states have internal predecessors, (156), 52 states have call successors, (52), 28 states have call predecessors, (52), 26 states have return successors, (49), 48 states have call predecessors, (49), 49 states have call successors, (49) [2022-04-28 11:32:23,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 257 transitions. [2022-04-28 11:32:23,519 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 257 transitions. Word has length 130 [2022-04-28 11:32:23,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:32:23,520 INFO L495 AbstractCegarLoop]: Abstraction has 219 states and 257 transitions. [2022-04-28 11:32:23,520 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-04-28 11:32:23,520 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 219 states and 257 transitions. [2022-04-28 11:32:23,940 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 257 edges. 257 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:32:23,940 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 257 transitions. [2022-04-28 11:32:23,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-04-28 11:32:23,941 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:32:23,941 INFO L195 NwaCegarLoop]: trace histogram [20, 19, 19, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:32:23,965 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-04-28 11:32:24,141 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:32:24,142 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:32:24,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:32:24,142 INFO L85 PathProgramCache]: Analyzing trace with hash 518951120, now seen corresponding path program 7 times [2022-04-28 11:32:24,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:32:24,142 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [392669446] [2022-04-28 11:33:02,381 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:33:02,381 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:33:02,381 INFO L85 PathProgramCache]: Analyzing trace with hash 518951120, now seen corresponding path program 8 times [2022-04-28 11:33:02,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:33:02,381 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360712513] [2022-04-28 11:33:02,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:33:02,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:33:02,394 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:33:02,394 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1740535174] [2022-04-28 11:33:02,394 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:33:02,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:33:02,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:33:02,396 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 11:33:02,397 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-04-28 11:33:02,499 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 11:33:02,499 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:33:02,501 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-28 11:33:02,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:33:02,532 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:33:03,150 INFO L272 TraceCheckUtils]: 0: Hoare triple {22717#true} call ULTIMATE.init(); {22717#true} is VALID [2022-04-28 11:33:03,151 INFO L290 TraceCheckUtils]: 1: Hoare triple {22717#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(14, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {22725#(<= ~counter~0 0)} is VALID [2022-04-28 11:33:03,151 INFO L290 TraceCheckUtils]: 2: Hoare triple {22725#(<= ~counter~0 0)} assume true; {22725#(<= ~counter~0 0)} is VALID [2022-04-28 11:33:03,152 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22725#(<= ~counter~0 0)} {22717#true} #93#return; {22725#(<= ~counter~0 0)} is VALID [2022-04-28 11:33:03,152 INFO L272 TraceCheckUtils]: 4: Hoare triple {22725#(<= ~counter~0 0)} call #t~ret8 := main(); {22725#(<= ~counter~0 0)} is VALID [2022-04-28 11:33:03,152 INFO L290 TraceCheckUtils]: 5: Hoare triple {22725#(<= ~counter~0 0)} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~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; {22725#(<= ~counter~0 0)} is VALID [2022-04-28 11:33:03,153 INFO L272 TraceCheckUtils]: 6: Hoare triple {22725#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {22725#(<= ~counter~0 0)} is VALID [2022-04-28 11:33:03,153 INFO L290 TraceCheckUtils]: 7: Hoare triple {22725#(<= ~counter~0 0)} ~cond := #in~cond; {22725#(<= ~counter~0 0)} is VALID [2022-04-28 11:33:03,153 INFO L290 TraceCheckUtils]: 8: Hoare triple {22725#(<= ~counter~0 0)} assume !(0 == ~cond); {22725#(<= ~counter~0 0)} is VALID [2022-04-28 11:33:03,153 INFO L290 TraceCheckUtils]: 9: Hoare triple {22725#(<= ~counter~0 0)} assume true; {22725#(<= ~counter~0 0)} is VALID [2022-04-28 11:33:03,154 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {22725#(<= ~counter~0 0)} {22725#(<= ~counter~0 0)} #77#return; {22725#(<= ~counter~0 0)} is VALID [2022-04-28 11:33:03,154 INFO L290 TraceCheckUtils]: 11: Hoare triple {22725#(<= ~counter~0 0)} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {22725#(<= ~counter~0 0)} is VALID [2022-04-28 11:33:03,155 INFO L290 TraceCheckUtils]: 12: Hoare triple {22725#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {22759#(<= ~counter~0 1)} is VALID [2022-04-28 11:33:03,155 INFO L290 TraceCheckUtils]: 13: Hoare triple {22759#(<= ~counter~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {22759#(<= ~counter~0 1)} is VALID [2022-04-28 11:33:03,156 INFO L272 TraceCheckUtils]: 14: Hoare triple {22759#(<= ~counter~0 1)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {22759#(<= ~counter~0 1)} is VALID [2022-04-28 11:33:03,156 INFO L290 TraceCheckUtils]: 15: Hoare triple {22759#(<= ~counter~0 1)} ~cond := #in~cond; {22759#(<= ~counter~0 1)} is VALID [2022-04-28 11:33:03,156 INFO L290 TraceCheckUtils]: 16: Hoare triple {22759#(<= ~counter~0 1)} assume !(0 == ~cond); {22759#(<= ~counter~0 1)} is VALID [2022-04-28 11:33:03,156 INFO L290 TraceCheckUtils]: 17: Hoare triple {22759#(<= ~counter~0 1)} assume true; {22759#(<= ~counter~0 1)} is VALID [2022-04-28 11:33:03,157 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {22759#(<= ~counter~0 1)} {22759#(<= ~counter~0 1)} #79#return; {22759#(<= ~counter~0 1)} is VALID [2022-04-28 11:33:03,157 INFO L272 TraceCheckUtils]: 19: Hoare triple {22759#(<= ~counter~0 1)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {22759#(<= ~counter~0 1)} is VALID [2022-04-28 11:33:03,158 INFO L290 TraceCheckUtils]: 20: Hoare triple {22759#(<= ~counter~0 1)} ~cond := #in~cond; {22759#(<= ~counter~0 1)} is VALID [2022-04-28 11:33:03,158 INFO L290 TraceCheckUtils]: 21: Hoare triple {22759#(<= ~counter~0 1)} assume !(0 == ~cond); {22759#(<= ~counter~0 1)} is VALID [2022-04-28 11:33:03,158 INFO L290 TraceCheckUtils]: 22: Hoare triple {22759#(<= ~counter~0 1)} assume true; {22759#(<= ~counter~0 1)} is VALID [2022-04-28 11:33:03,159 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {22759#(<= ~counter~0 1)} {22759#(<= ~counter~0 1)} #81#return; {22759#(<= ~counter~0 1)} is VALID [2022-04-28 11:33:03,159 INFO L290 TraceCheckUtils]: 24: Hoare triple {22759#(<= ~counter~0 1)} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {22759#(<= ~counter~0 1)} is VALID [2022-04-28 11:33:03,160 INFO L290 TraceCheckUtils]: 25: Hoare triple {22759#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {22799#(<= ~counter~0 2)} is VALID [2022-04-28 11:33:03,160 INFO L290 TraceCheckUtils]: 26: Hoare triple {22799#(<= ~counter~0 2)} assume !!(#t~post7 < 20);havoc #t~post7; {22799#(<= ~counter~0 2)} is VALID [2022-04-28 11:33:03,160 INFO L272 TraceCheckUtils]: 27: Hoare triple {22799#(<= ~counter~0 2)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {22799#(<= ~counter~0 2)} is VALID [2022-04-28 11:33:03,161 INFO L290 TraceCheckUtils]: 28: Hoare triple {22799#(<= ~counter~0 2)} ~cond := #in~cond; {22799#(<= ~counter~0 2)} is VALID [2022-04-28 11:33:03,161 INFO L290 TraceCheckUtils]: 29: Hoare triple {22799#(<= ~counter~0 2)} assume !(0 == ~cond); {22799#(<= ~counter~0 2)} is VALID [2022-04-28 11:33:03,161 INFO L290 TraceCheckUtils]: 30: Hoare triple {22799#(<= ~counter~0 2)} assume true; {22799#(<= ~counter~0 2)} is VALID [2022-04-28 11:33:03,162 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {22799#(<= ~counter~0 2)} {22799#(<= ~counter~0 2)} #83#return; {22799#(<= ~counter~0 2)} is VALID [2022-04-28 11:33:03,162 INFO L272 TraceCheckUtils]: 32: Hoare triple {22799#(<= ~counter~0 2)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {22799#(<= ~counter~0 2)} is VALID [2022-04-28 11:33:03,162 INFO L290 TraceCheckUtils]: 33: Hoare triple {22799#(<= ~counter~0 2)} ~cond := #in~cond; {22799#(<= ~counter~0 2)} is VALID [2022-04-28 11:33:03,163 INFO L290 TraceCheckUtils]: 34: Hoare triple {22799#(<= ~counter~0 2)} assume !(0 == ~cond); {22799#(<= ~counter~0 2)} is VALID [2022-04-28 11:33:03,163 INFO L290 TraceCheckUtils]: 35: Hoare triple {22799#(<= ~counter~0 2)} assume true; {22799#(<= ~counter~0 2)} is VALID [2022-04-28 11:33:03,163 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {22799#(<= ~counter~0 2)} {22799#(<= ~counter~0 2)} #85#return; {22799#(<= ~counter~0 2)} is VALID [2022-04-28 11:33:03,164 INFO L272 TraceCheckUtils]: 37: Hoare triple {22799#(<= ~counter~0 2)} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {22799#(<= ~counter~0 2)} is VALID [2022-04-28 11:33:03,164 INFO L290 TraceCheckUtils]: 38: Hoare triple {22799#(<= ~counter~0 2)} ~cond := #in~cond; {22799#(<= ~counter~0 2)} is VALID [2022-04-28 11:33:03,164 INFO L290 TraceCheckUtils]: 39: Hoare triple {22799#(<= ~counter~0 2)} assume !(0 == ~cond); {22799#(<= ~counter~0 2)} is VALID [2022-04-28 11:33:03,165 INFO L290 TraceCheckUtils]: 40: Hoare triple {22799#(<= ~counter~0 2)} assume true; {22799#(<= ~counter~0 2)} is VALID [2022-04-28 11:33:03,165 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {22799#(<= ~counter~0 2)} {22799#(<= ~counter~0 2)} #87#return; {22799#(<= ~counter~0 2)} is VALID [2022-04-28 11:33:03,165 INFO L290 TraceCheckUtils]: 42: Hoare triple {22799#(<= ~counter~0 2)} assume !!(~r~0 >= 2 * ~b~0); {22799#(<= ~counter~0 2)} is VALID [2022-04-28 11:33:03,166 INFO L272 TraceCheckUtils]: 43: Hoare triple {22799#(<= ~counter~0 2)} call __VERIFIER_assert((if ~r~0 >= 2 * ~y~0 * ~a~0 then 1 else 0)); {22799#(<= ~counter~0 2)} is VALID [2022-04-28 11:33:03,166 INFO L290 TraceCheckUtils]: 44: Hoare triple {22799#(<= ~counter~0 2)} ~cond := #in~cond; {22799#(<= ~counter~0 2)} is VALID [2022-04-28 11:33:03,166 INFO L290 TraceCheckUtils]: 45: Hoare triple {22799#(<= ~counter~0 2)} assume !(0 == ~cond); {22799#(<= ~counter~0 2)} is VALID [2022-04-28 11:33:03,166 INFO L290 TraceCheckUtils]: 46: Hoare triple {22799#(<= ~counter~0 2)} assume true; {22799#(<= ~counter~0 2)} is VALID [2022-04-28 11:33:03,167 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {22799#(<= ~counter~0 2)} {22799#(<= ~counter~0 2)} #89#return; {22799#(<= ~counter~0 2)} is VALID [2022-04-28 11:33:03,167 INFO L290 TraceCheckUtils]: 48: Hoare triple {22799#(<= ~counter~0 2)} ~a~0 := 2 * ~a~0;~b~0 := 2 * ~b~0; {22799#(<= ~counter~0 2)} is VALID [2022-04-28 11:33:03,168 INFO L290 TraceCheckUtils]: 49: Hoare triple {22799#(<= ~counter~0 2)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {22872#(<= ~counter~0 3)} is VALID [2022-04-28 11:33:03,168 INFO L290 TraceCheckUtils]: 50: Hoare triple {22872#(<= ~counter~0 3)} assume !!(#t~post7 < 20);havoc #t~post7; {22872#(<= ~counter~0 3)} is VALID [2022-04-28 11:33:03,169 INFO L272 TraceCheckUtils]: 51: Hoare triple {22872#(<= ~counter~0 3)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {22872#(<= ~counter~0 3)} is VALID [2022-04-28 11:33:03,169 INFO L290 TraceCheckUtils]: 52: Hoare triple {22872#(<= ~counter~0 3)} ~cond := #in~cond; {22872#(<= ~counter~0 3)} is VALID [2022-04-28 11:33:03,169 INFO L290 TraceCheckUtils]: 53: Hoare triple {22872#(<= ~counter~0 3)} assume !(0 == ~cond); {22872#(<= ~counter~0 3)} is VALID [2022-04-28 11:33:03,169 INFO L290 TraceCheckUtils]: 54: Hoare triple {22872#(<= ~counter~0 3)} assume true; {22872#(<= ~counter~0 3)} is VALID [2022-04-28 11:33:03,170 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {22872#(<= ~counter~0 3)} {22872#(<= ~counter~0 3)} #83#return; {22872#(<= ~counter~0 3)} is VALID [2022-04-28 11:33:03,170 INFO L272 TraceCheckUtils]: 56: Hoare triple {22872#(<= ~counter~0 3)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {22872#(<= ~counter~0 3)} is VALID [2022-04-28 11:33:03,171 INFO L290 TraceCheckUtils]: 57: Hoare triple {22872#(<= ~counter~0 3)} ~cond := #in~cond; {22872#(<= ~counter~0 3)} is VALID [2022-04-28 11:33:03,171 INFO L290 TraceCheckUtils]: 58: Hoare triple {22872#(<= ~counter~0 3)} assume !(0 == ~cond); {22872#(<= ~counter~0 3)} is VALID [2022-04-28 11:33:03,171 INFO L290 TraceCheckUtils]: 59: Hoare triple {22872#(<= ~counter~0 3)} assume true; {22872#(<= ~counter~0 3)} is VALID [2022-04-28 11:33:03,172 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {22872#(<= ~counter~0 3)} {22872#(<= ~counter~0 3)} #85#return; {22872#(<= ~counter~0 3)} is VALID [2022-04-28 11:33:03,172 INFO L272 TraceCheckUtils]: 61: Hoare triple {22872#(<= ~counter~0 3)} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {22872#(<= ~counter~0 3)} is VALID [2022-04-28 11:33:03,172 INFO L290 TraceCheckUtils]: 62: Hoare triple {22872#(<= ~counter~0 3)} ~cond := #in~cond; {22872#(<= ~counter~0 3)} is VALID [2022-04-28 11:33:03,173 INFO L290 TraceCheckUtils]: 63: Hoare triple {22872#(<= ~counter~0 3)} assume !(0 == ~cond); {22872#(<= ~counter~0 3)} is VALID [2022-04-28 11:33:03,173 INFO L290 TraceCheckUtils]: 64: Hoare triple {22872#(<= ~counter~0 3)} assume true; {22872#(<= ~counter~0 3)} is VALID [2022-04-28 11:33:03,173 INFO L284 TraceCheckUtils]: 65: Hoare quadruple {22872#(<= ~counter~0 3)} {22872#(<= ~counter~0 3)} #87#return; {22872#(<= ~counter~0 3)} is VALID [2022-04-28 11:33:03,173 INFO L290 TraceCheckUtils]: 66: Hoare triple {22872#(<= ~counter~0 3)} assume !!(~r~0 >= 2 * ~b~0); {22872#(<= ~counter~0 3)} is VALID [2022-04-28 11:33:03,174 INFO L272 TraceCheckUtils]: 67: Hoare triple {22872#(<= ~counter~0 3)} call __VERIFIER_assert((if ~r~0 >= 2 * ~y~0 * ~a~0 then 1 else 0)); {22872#(<= ~counter~0 3)} is VALID [2022-04-28 11:33:03,174 INFO L290 TraceCheckUtils]: 68: Hoare triple {22872#(<= ~counter~0 3)} ~cond := #in~cond; {22872#(<= ~counter~0 3)} is VALID [2022-04-28 11:33:03,174 INFO L290 TraceCheckUtils]: 69: Hoare triple {22872#(<= ~counter~0 3)} assume !(0 == ~cond); {22872#(<= ~counter~0 3)} is VALID [2022-04-28 11:33:03,175 INFO L290 TraceCheckUtils]: 70: Hoare triple {22872#(<= ~counter~0 3)} assume true; {22872#(<= ~counter~0 3)} is VALID [2022-04-28 11:33:03,175 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {22872#(<= ~counter~0 3)} {22872#(<= ~counter~0 3)} #89#return; {22872#(<= ~counter~0 3)} is VALID [2022-04-28 11:33:03,175 INFO L290 TraceCheckUtils]: 72: Hoare triple {22872#(<= ~counter~0 3)} ~a~0 := 2 * ~a~0;~b~0 := 2 * ~b~0; {22872#(<= ~counter~0 3)} is VALID [2022-04-28 11:33:03,176 INFO L290 TraceCheckUtils]: 73: Hoare triple {22872#(<= ~counter~0 3)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {22945#(<= ~counter~0 4)} is VALID [2022-04-28 11:33:03,177 INFO L290 TraceCheckUtils]: 74: Hoare triple {22945#(<= ~counter~0 4)} assume !!(#t~post7 < 20);havoc #t~post7; {22945#(<= ~counter~0 4)} is VALID [2022-04-28 11:33:03,177 INFO L272 TraceCheckUtils]: 75: Hoare triple {22945#(<= ~counter~0 4)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {22945#(<= ~counter~0 4)} is VALID [2022-04-28 11:33:03,177 INFO L290 TraceCheckUtils]: 76: Hoare triple {22945#(<= ~counter~0 4)} ~cond := #in~cond; {22945#(<= ~counter~0 4)} is VALID [2022-04-28 11:33:03,178 INFO L290 TraceCheckUtils]: 77: Hoare triple {22945#(<= ~counter~0 4)} assume !(0 == ~cond); {22945#(<= ~counter~0 4)} is VALID [2022-04-28 11:33:03,178 INFO L290 TraceCheckUtils]: 78: Hoare triple {22945#(<= ~counter~0 4)} assume true; {22945#(<= ~counter~0 4)} is VALID [2022-04-28 11:33:03,178 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {22945#(<= ~counter~0 4)} {22945#(<= ~counter~0 4)} #83#return; {22945#(<= ~counter~0 4)} is VALID [2022-04-28 11:33:03,179 INFO L272 TraceCheckUtils]: 80: Hoare triple {22945#(<= ~counter~0 4)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {22945#(<= ~counter~0 4)} is VALID [2022-04-28 11:33:03,179 INFO L290 TraceCheckUtils]: 81: Hoare triple {22945#(<= ~counter~0 4)} ~cond := #in~cond; {22945#(<= ~counter~0 4)} is VALID [2022-04-28 11:33:03,179 INFO L290 TraceCheckUtils]: 82: Hoare triple {22945#(<= ~counter~0 4)} assume !(0 == ~cond); {22945#(<= ~counter~0 4)} is VALID [2022-04-28 11:33:03,179 INFO L290 TraceCheckUtils]: 83: Hoare triple {22945#(<= ~counter~0 4)} assume true; {22945#(<= ~counter~0 4)} is VALID [2022-04-28 11:33:03,180 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {22945#(<= ~counter~0 4)} {22945#(<= ~counter~0 4)} #85#return; {22945#(<= ~counter~0 4)} is VALID [2022-04-28 11:33:03,180 INFO L272 TraceCheckUtils]: 85: Hoare triple {22945#(<= ~counter~0 4)} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {22945#(<= ~counter~0 4)} is VALID [2022-04-28 11:33:03,181 INFO L290 TraceCheckUtils]: 86: Hoare triple {22945#(<= ~counter~0 4)} ~cond := #in~cond; {22945#(<= ~counter~0 4)} is VALID [2022-04-28 11:33:03,181 INFO L290 TraceCheckUtils]: 87: Hoare triple {22945#(<= ~counter~0 4)} assume !(0 == ~cond); {22945#(<= ~counter~0 4)} is VALID [2022-04-28 11:33:03,181 INFO L290 TraceCheckUtils]: 88: Hoare triple {22945#(<= ~counter~0 4)} assume true; {22945#(<= ~counter~0 4)} is VALID [2022-04-28 11:33:03,182 INFO L284 TraceCheckUtils]: 89: Hoare quadruple {22945#(<= ~counter~0 4)} {22945#(<= ~counter~0 4)} #87#return; {22945#(<= ~counter~0 4)} is VALID [2022-04-28 11:33:03,182 INFO L290 TraceCheckUtils]: 90: Hoare triple {22945#(<= ~counter~0 4)} assume !(~r~0 >= 2 * ~b~0); {22945#(<= ~counter~0 4)} is VALID [2022-04-28 11:33:03,182 INFO L290 TraceCheckUtils]: 91: Hoare triple {22945#(<= ~counter~0 4)} ~r~0 := ~r~0 - ~b~0;~q~0 := ~q~0 + ~a~0; {22945#(<= ~counter~0 4)} is VALID [2022-04-28 11:33:03,183 INFO L290 TraceCheckUtils]: 92: Hoare triple {22945#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {23003#(<= ~counter~0 5)} is VALID [2022-04-28 11:33:03,183 INFO L290 TraceCheckUtils]: 93: Hoare triple {23003#(<= ~counter~0 5)} assume !!(#t~post6 < 20);havoc #t~post6; {23003#(<= ~counter~0 5)} is VALID [2022-04-28 11:33:03,184 INFO L272 TraceCheckUtils]: 94: Hoare triple {23003#(<= ~counter~0 5)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {23003#(<= ~counter~0 5)} is VALID [2022-04-28 11:33:03,184 INFO L290 TraceCheckUtils]: 95: Hoare triple {23003#(<= ~counter~0 5)} ~cond := #in~cond; {23003#(<= ~counter~0 5)} is VALID [2022-04-28 11:33:03,184 INFO L290 TraceCheckUtils]: 96: Hoare triple {23003#(<= ~counter~0 5)} assume !(0 == ~cond); {23003#(<= ~counter~0 5)} is VALID [2022-04-28 11:33:03,184 INFO L290 TraceCheckUtils]: 97: Hoare triple {23003#(<= ~counter~0 5)} assume true; {23003#(<= ~counter~0 5)} is VALID [2022-04-28 11:33:03,185 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {23003#(<= ~counter~0 5)} {23003#(<= ~counter~0 5)} #79#return; {23003#(<= ~counter~0 5)} is VALID [2022-04-28 11:33:03,185 INFO L272 TraceCheckUtils]: 99: Hoare triple {23003#(<= ~counter~0 5)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {23003#(<= ~counter~0 5)} is VALID [2022-04-28 11:33:03,186 INFO L290 TraceCheckUtils]: 100: Hoare triple {23003#(<= ~counter~0 5)} ~cond := #in~cond; {23003#(<= ~counter~0 5)} is VALID [2022-04-28 11:33:03,186 INFO L290 TraceCheckUtils]: 101: Hoare triple {23003#(<= ~counter~0 5)} assume !(0 == ~cond); {23003#(<= ~counter~0 5)} is VALID [2022-04-28 11:33:03,186 INFO L290 TraceCheckUtils]: 102: Hoare triple {23003#(<= ~counter~0 5)} assume true; {23003#(<= ~counter~0 5)} is VALID [2022-04-28 11:33:03,187 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {23003#(<= ~counter~0 5)} {23003#(<= ~counter~0 5)} #81#return; {23003#(<= ~counter~0 5)} is VALID [2022-04-28 11:33:03,187 INFO L290 TraceCheckUtils]: 104: Hoare triple {23003#(<= ~counter~0 5)} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {23003#(<= ~counter~0 5)} is VALID [2022-04-28 11:33:03,188 INFO L290 TraceCheckUtils]: 105: Hoare triple {23003#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {23043#(<= ~counter~0 6)} is VALID [2022-04-28 11:33:03,188 INFO L290 TraceCheckUtils]: 106: Hoare triple {23043#(<= ~counter~0 6)} assume !!(#t~post7 < 20);havoc #t~post7; {23043#(<= ~counter~0 6)} is VALID [2022-04-28 11:33:03,189 INFO L272 TraceCheckUtils]: 107: Hoare triple {23043#(<= ~counter~0 6)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {23043#(<= ~counter~0 6)} is VALID [2022-04-28 11:33:03,189 INFO L290 TraceCheckUtils]: 108: Hoare triple {23043#(<= ~counter~0 6)} ~cond := #in~cond; {23043#(<= ~counter~0 6)} is VALID [2022-04-28 11:33:03,189 INFO L290 TraceCheckUtils]: 109: Hoare triple {23043#(<= ~counter~0 6)} assume !(0 == ~cond); {23043#(<= ~counter~0 6)} is VALID [2022-04-28 11:33:03,189 INFO L290 TraceCheckUtils]: 110: Hoare triple {23043#(<= ~counter~0 6)} assume true; {23043#(<= ~counter~0 6)} is VALID [2022-04-28 11:33:03,190 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {23043#(<= ~counter~0 6)} {23043#(<= ~counter~0 6)} #83#return; {23043#(<= ~counter~0 6)} is VALID [2022-04-28 11:33:03,190 INFO L272 TraceCheckUtils]: 112: Hoare triple {23043#(<= ~counter~0 6)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {23043#(<= ~counter~0 6)} is VALID [2022-04-28 11:33:03,191 INFO L290 TraceCheckUtils]: 113: Hoare triple {23043#(<= ~counter~0 6)} ~cond := #in~cond; {23043#(<= ~counter~0 6)} is VALID [2022-04-28 11:33:03,191 INFO L290 TraceCheckUtils]: 114: Hoare triple {23043#(<= ~counter~0 6)} assume !(0 == ~cond); {23043#(<= ~counter~0 6)} is VALID [2022-04-28 11:33:03,191 INFO L290 TraceCheckUtils]: 115: Hoare triple {23043#(<= ~counter~0 6)} assume true; {23043#(<= ~counter~0 6)} is VALID [2022-04-28 11:33:03,192 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {23043#(<= ~counter~0 6)} {23043#(<= ~counter~0 6)} #85#return; {23043#(<= ~counter~0 6)} is VALID [2022-04-28 11:33:03,192 INFO L272 TraceCheckUtils]: 117: Hoare triple {23043#(<= ~counter~0 6)} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {23043#(<= ~counter~0 6)} is VALID [2022-04-28 11:33:03,192 INFO L290 TraceCheckUtils]: 118: Hoare triple {23043#(<= ~counter~0 6)} ~cond := #in~cond; {23043#(<= ~counter~0 6)} is VALID [2022-04-28 11:33:03,192 INFO L290 TraceCheckUtils]: 119: Hoare triple {23043#(<= ~counter~0 6)} assume !(0 == ~cond); {23043#(<= ~counter~0 6)} is VALID [2022-04-28 11:33:03,193 INFO L290 TraceCheckUtils]: 120: Hoare triple {23043#(<= ~counter~0 6)} assume true; {23043#(<= ~counter~0 6)} is VALID [2022-04-28 11:33:03,193 INFO L284 TraceCheckUtils]: 121: Hoare quadruple {23043#(<= ~counter~0 6)} {23043#(<= ~counter~0 6)} #87#return; {23043#(<= ~counter~0 6)} is VALID [2022-04-28 11:33:03,193 INFO L290 TraceCheckUtils]: 122: Hoare triple {23043#(<= ~counter~0 6)} assume !!(~r~0 >= 2 * ~b~0); {23043#(<= ~counter~0 6)} is VALID [2022-04-28 11:33:03,194 INFO L272 TraceCheckUtils]: 123: Hoare triple {23043#(<= ~counter~0 6)} call __VERIFIER_assert((if ~r~0 >= 2 * ~y~0 * ~a~0 then 1 else 0)); {23043#(<= ~counter~0 6)} is VALID [2022-04-28 11:33:03,194 INFO L290 TraceCheckUtils]: 124: Hoare triple {23043#(<= ~counter~0 6)} ~cond := #in~cond; {23043#(<= ~counter~0 6)} is VALID [2022-04-28 11:33:03,194 INFO L290 TraceCheckUtils]: 125: Hoare triple {23043#(<= ~counter~0 6)} assume !(0 == ~cond); {23043#(<= ~counter~0 6)} is VALID [2022-04-28 11:33:03,194 INFO L290 TraceCheckUtils]: 126: Hoare triple {23043#(<= ~counter~0 6)} assume true; {23043#(<= ~counter~0 6)} is VALID [2022-04-28 11:33:03,195 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {23043#(<= ~counter~0 6)} {23043#(<= ~counter~0 6)} #89#return; {23043#(<= ~counter~0 6)} is VALID [2022-04-28 11:33:03,195 INFO L290 TraceCheckUtils]: 128: Hoare triple {23043#(<= ~counter~0 6)} ~a~0 := 2 * ~a~0;~b~0 := 2 * ~b~0; {23043#(<= ~counter~0 6)} is VALID [2022-04-28 11:33:03,196 INFO L290 TraceCheckUtils]: 129: Hoare triple {23043#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {23116#(<= |main_#t~post7| 6)} is VALID [2022-04-28 11:33:03,196 INFO L290 TraceCheckUtils]: 130: Hoare triple {23116#(<= |main_#t~post7| 6)} assume !(#t~post7 < 20);havoc #t~post7; {22718#false} is VALID [2022-04-28 11:33:03,196 INFO L290 TraceCheckUtils]: 131: Hoare triple {22718#false} ~r~0 := ~r~0 - ~b~0;~q~0 := ~q~0 + ~a~0; {22718#false} is VALID [2022-04-28 11:33:03,196 INFO L290 TraceCheckUtils]: 132: Hoare triple {22718#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {22718#false} is VALID [2022-04-28 11:33:03,196 INFO L290 TraceCheckUtils]: 133: Hoare triple {22718#false} assume !(#t~post6 < 20);havoc #t~post6; {22718#false} is VALID [2022-04-28 11:33:03,196 INFO L272 TraceCheckUtils]: 134: Hoare triple {22718#false} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {22718#false} is VALID [2022-04-28 11:33:03,196 INFO L290 TraceCheckUtils]: 135: Hoare triple {22718#false} ~cond := #in~cond; {22718#false} is VALID [2022-04-28 11:33:03,196 INFO L290 TraceCheckUtils]: 136: Hoare triple {22718#false} assume 0 == ~cond; {22718#false} is VALID [2022-04-28 11:33:03,196 INFO L290 TraceCheckUtils]: 137: Hoare triple {22718#false} assume !false; {22718#false} is VALID [2022-04-28 11:33:03,197 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 43 proven. 647 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2022-04-28 11:33:03,197 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:33:03,768 INFO L290 TraceCheckUtils]: 137: Hoare triple {22718#false} assume !false; {22718#false} is VALID [2022-04-28 11:33:03,768 INFO L290 TraceCheckUtils]: 136: Hoare triple {22718#false} assume 0 == ~cond; {22718#false} is VALID [2022-04-28 11:33:03,768 INFO L290 TraceCheckUtils]: 135: Hoare triple {22718#false} ~cond := #in~cond; {22718#false} is VALID [2022-04-28 11:33:03,768 INFO L272 TraceCheckUtils]: 134: Hoare triple {22718#false} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {22718#false} is VALID [2022-04-28 11:33:03,769 INFO L290 TraceCheckUtils]: 133: Hoare triple {22718#false} assume !(#t~post6 < 20);havoc #t~post6; {22718#false} is VALID [2022-04-28 11:33:03,769 INFO L290 TraceCheckUtils]: 132: Hoare triple {22718#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {22718#false} is VALID [2022-04-28 11:33:03,769 INFO L290 TraceCheckUtils]: 131: Hoare triple {22718#false} ~r~0 := ~r~0 - ~b~0;~q~0 := ~q~0 + ~a~0; {22718#false} is VALID [2022-04-28 11:33:03,769 INFO L290 TraceCheckUtils]: 130: Hoare triple {23162#(< |main_#t~post7| 20)} assume !(#t~post7 < 20);havoc #t~post7; {22718#false} is VALID [2022-04-28 11:33:03,769 INFO L290 TraceCheckUtils]: 129: Hoare triple {23166#(< ~counter~0 20)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {23162#(< |main_#t~post7| 20)} is VALID [2022-04-28 11:33:03,770 INFO L290 TraceCheckUtils]: 128: Hoare triple {23166#(< ~counter~0 20)} ~a~0 := 2 * ~a~0;~b~0 := 2 * ~b~0; {23166#(< ~counter~0 20)} is VALID [2022-04-28 11:33:03,770 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {22717#true} {23166#(< ~counter~0 20)} #89#return; {23166#(< ~counter~0 20)} is VALID [2022-04-28 11:33:03,770 INFO L290 TraceCheckUtils]: 126: Hoare triple {22717#true} assume true; {22717#true} is VALID [2022-04-28 11:33:03,770 INFO L290 TraceCheckUtils]: 125: Hoare triple {22717#true} assume !(0 == ~cond); {22717#true} is VALID [2022-04-28 11:33:03,770 INFO L290 TraceCheckUtils]: 124: Hoare triple {22717#true} ~cond := #in~cond; {22717#true} is VALID [2022-04-28 11:33:03,770 INFO L272 TraceCheckUtils]: 123: Hoare triple {23166#(< ~counter~0 20)} call __VERIFIER_assert((if ~r~0 >= 2 * ~y~0 * ~a~0 then 1 else 0)); {22717#true} is VALID [2022-04-28 11:33:03,771 INFO L290 TraceCheckUtils]: 122: Hoare triple {23166#(< ~counter~0 20)} assume !!(~r~0 >= 2 * ~b~0); {23166#(< ~counter~0 20)} is VALID [2022-04-28 11:33:03,771 INFO L284 TraceCheckUtils]: 121: Hoare quadruple {22717#true} {23166#(< ~counter~0 20)} #87#return; {23166#(< ~counter~0 20)} is VALID [2022-04-28 11:33:03,771 INFO L290 TraceCheckUtils]: 120: Hoare triple {22717#true} assume true; {22717#true} is VALID [2022-04-28 11:33:03,771 INFO L290 TraceCheckUtils]: 119: Hoare triple {22717#true} assume !(0 == ~cond); {22717#true} is VALID [2022-04-28 11:33:03,771 INFO L290 TraceCheckUtils]: 118: Hoare triple {22717#true} ~cond := #in~cond; {22717#true} is VALID [2022-04-28 11:33:03,771 INFO L272 TraceCheckUtils]: 117: Hoare triple {23166#(< ~counter~0 20)} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {22717#true} is VALID [2022-04-28 11:33:03,772 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {22717#true} {23166#(< ~counter~0 20)} #85#return; {23166#(< ~counter~0 20)} is VALID [2022-04-28 11:33:03,772 INFO L290 TraceCheckUtils]: 115: Hoare triple {22717#true} assume true; {22717#true} is VALID [2022-04-28 11:33:03,772 INFO L290 TraceCheckUtils]: 114: Hoare triple {22717#true} assume !(0 == ~cond); {22717#true} is VALID [2022-04-28 11:33:03,772 INFO L290 TraceCheckUtils]: 113: Hoare triple {22717#true} ~cond := #in~cond; {22717#true} is VALID [2022-04-28 11:33:03,772 INFO L272 TraceCheckUtils]: 112: Hoare triple {23166#(< ~counter~0 20)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {22717#true} is VALID [2022-04-28 11:33:03,772 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {22717#true} {23166#(< ~counter~0 20)} #83#return; {23166#(< ~counter~0 20)} is VALID [2022-04-28 11:33:03,772 INFO L290 TraceCheckUtils]: 110: Hoare triple {22717#true} assume true; {22717#true} is VALID [2022-04-28 11:33:03,772 INFO L290 TraceCheckUtils]: 109: Hoare triple {22717#true} assume !(0 == ~cond); {22717#true} is VALID [2022-04-28 11:33:03,773 INFO L290 TraceCheckUtils]: 108: Hoare triple {22717#true} ~cond := #in~cond; {22717#true} is VALID [2022-04-28 11:33:03,773 INFO L272 TraceCheckUtils]: 107: Hoare triple {23166#(< ~counter~0 20)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {22717#true} is VALID [2022-04-28 11:33:03,773 INFO L290 TraceCheckUtils]: 106: Hoare triple {23166#(< ~counter~0 20)} assume !!(#t~post7 < 20);havoc #t~post7; {23166#(< ~counter~0 20)} is VALID [2022-04-28 11:33:03,774 INFO L290 TraceCheckUtils]: 105: Hoare triple {23239#(< ~counter~0 19)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {23166#(< ~counter~0 20)} is VALID [2022-04-28 11:33:03,774 INFO L290 TraceCheckUtils]: 104: Hoare triple {23239#(< ~counter~0 19)} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {23239#(< ~counter~0 19)} is VALID [2022-04-28 11:33:03,775 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {22717#true} {23239#(< ~counter~0 19)} #81#return; {23239#(< ~counter~0 19)} is VALID [2022-04-28 11:33:03,775 INFO L290 TraceCheckUtils]: 102: Hoare triple {22717#true} assume true; {22717#true} is VALID [2022-04-28 11:33:03,775 INFO L290 TraceCheckUtils]: 101: Hoare triple {22717#true} assume !(0 == ~cond); {22717#true} is VALID [2022-04-28 11:33:03,775 INFO L290 TraceCheckUtils]: 100: Hoare triple {22717#true} ~cond := #in~cond; {22717#true} is VALID [2022-04-28 11:33:03,775 INFO L272 TraceCheckUtils]: 99: Hoare triple {23239#(< ~counter~0 19)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {22717#true} is VALID [2022-04-28 11:33:03,775 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {22717#true} {23239#(< ~counter~0 19)} #79#return; {23239#(< ~counter~0 19)} is VALID [2022-04-28 11:33:03,775 INFO L290 TraceCheckUtils]: 97: Hoare triple {22717#true} assume true; {22717#true} is VALID [2022-04-28 11:33:03,775 INFO L290 TraceCheckUtils]: 96: Hoare triple {22717#true} assume !(0 == ~cond); {22717#true} is VALID [2022-04-28 11:33:03,775 INFO L290 TraceCheckUtils]: 95: Hoare triple {22717#true} ~cond := #in~cond; {22717#true} is VALID [2022-04-28 11:33:03,775 INFO L272 TraceCheckUtils]: 94: Hoare triple {23239#(< ~counter~0 19)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {22717#true} is VALID [2022-04-28 11:33:03,776 INFO L290 TraceCheckUtils]: 93: Hoare triple {23239#(< ~counter~0 19)} assume !!(#t~post6 < 20);havoc #t~post6; {23239#(< ~counter~0 19)} is VALID [2022-04-28 11:33:03,776 INFO L290 TraceCheckUtils]: 92: Hoare triple {23279#(< ~counter~0 18)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {23239#(< ~counter~0 19)} is VALID [2022-04-28 11:33:03,777 INFO L290 TraceCheckUtils]: 91: Hoare triple {23279#(< ~counter~0 18)} ~r~0 := ~r~0 - ~b~0;~q~0 := ~q~0 + ~a~0; {23279#(< ~counter~0 18)} is VALID [2022-04-28 11:33:03,777 INFO L290 TraceCheckUtils]: 90: Hoare triple {23279#(< ~counter~0 18)} assume !(~r~0 >= 2 * ~b~0); {23279#(< ~counter~0 18)} is VALID [2022-04-28 11:33:03,777 INFO L284 TraceCheckUtils]: 89: Hoare quadruple {22717#true} {23279#(< ~counter~0 18)} #87#return; {23279#(< ~counter~0 18)} is VALID [2022-04-28 11:33:03,777 INFO L290 TraceCheckUtils]: 88: Hoare triple {22717#true} assume true; {22717#true} is VALID [2022-04-28 11:33:03,777 INFO L290 TraceCheckUtils]: 87: Hoare triple {22717#true} assume !(0 == ~cond); {22717#true} is VALID [2022-04-28 11:33:03,777 INFO L290 TraceCheckUtils]: 86: Hoare triple {22717#true} ~cond := #in~cond; {22717#true} is VALID [2022-04-28 11:33:03,777 INFO L272 TraceCheckUtils]: 85: Hoare triple {23279#(< ~counter~0 18)} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {22717#true} is VALID [2022-04-28 11:33:03,778 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {22717#true} {23279#(< ~counter~0 18)} #85#return; {23279#(< ~counter~0 18)} is VALID [2022-04-28 11:33:03,778 INFO L290 TraceCheckUtils]: 83: Hoare triple {22717#true} assume true; {22717#true} is VALID [2022-04-28 11:33:03,778 INFO L290 TraceCheckUtils]: 82: Hoare triple {22717#true} assume !(0 == ~cond); {22717#true} is VALID [2022-04-28 11:33:03,778 INFO L290 TraceCheckUtils]: 81: Hoare triple {22717#true} ~cond := #in~cond; {22717#true} is VALID [2022-04-28 11:33:03,778 INFO L272 TraceCheckUtils]: 80: Hoare triple {23279#(< ~counter~0 18)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {22717#true} is VALID [2022-04-28 11:33:03,779 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {22717#true} {23279#(< ~counter~0 18)} #83#return; {23279#(< ~counter~0 18)} is VALID [2022-04-28 11:33:03,779 INFO L290 TraceCheckUtils]: 78: Hoare triple {22717#true} assume true; {22717#true} is VALID [2022-04-28 11:33:03,779 INFO L290 TraceCheckUtils]: 77: Hoare triple {22717#true} assume !(0 == ~cond); {22717#true} is VALID [2022-04-28 11:33:03,779 INFO L290 TraceCheckUtils]: 76: Hoare triple {22717#true} ~cond := #in~cond; {22717#true} is VALID [2022-04-28 11:33:03,779 INFO L272 TraceCheckUtils]: 75: Hoare triple {23279#(< ~counter~0 18)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {22717#true} is VALID [2022-04-28 11:33:03,779 INFO L290 TraceCheckUtils]: 74: Hoare triple {23279#(< ~counter~0 18)} assume !!(#t~post7 < 20);havoc #t~post7; {23279#(< ~counter~0 18)} is VALID [2022-04-28 11:33:03,780 INFO L290 TraceCheckUtils]: 73: Hoare triple {23337#(< ~counter~0 17)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {23279#(< ~counter~0 18)} is VALID [2022-04-28 11:33:03,780 INFO L290 TraceCheckUtils]: 72: Hoare triple {23337#(< ~counter~0 17)} ~a~0 := 2 * ~a~0;~b~0 := 2 * ~b~0; {23337#(< ~counter~0 17)} is VALID [2022-04-28 11:33:03,781 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {22717#true} {23337#(< ~counter~0 17)} #89#return; {23337#(< ~counter~0 17)} is VALID [2022-04-28 11:33:03,781 INFO L290 TraceCheckUtils]: 70: Hoare triple {22717#true} assume true; {22717#true} is VALID [2022-04-28 11:33:03,781 INFO L290 TraceCheckUtils]: 69: Hoare triple {22717#true} assume !(0 == ~cond); {22717#true} is VALID [2022-04-28 11:33:03,781 INFO L290 TraceCheckUtils]: 68: Hoare triple {22717#true} ~cond := #in~cond; {22717#true} is VALID [2022-04-28 11:33:03,781 INFO L272 TraceCheckUtils]: 67: Hoare triple {23337#(< ~counter~0 17)} call __VERIFIER_assert((if ~r~0 >= 2 * ~y~0 * ~a~0 then 1 else 0)); {22717#true} is VALID [2022-04-28 11:33:03,781 INFO L290 TraceCheckUtils]: 66: Hoare triple {23337#(< ~counter~0 17)} assume !!(~r~0 >= 2 * ~b~0); {23337#(< ~counter~0 17)} is VALID [2022-04-28 11:33:03,782 INFO L284 TraceCheckUtils]: 65: Hoare quadruple {22717#true} {23337#(< ~counter~0 17)} #87#return; {23337#(< ~counter~0 17)} is VALID [2022-04-28 11:33:03,782 INFO L290 TraceCheckUtils]: 64: Hoare triple {22717#true} assume true; {22717#true} is VALID [2022-04-28 11:33:03,782 INFO L290 TraceCheckUtils]: 63: Hoare triple {22717#true} assume !(0 == ~cond); {22717#true} is VALID [2022-04-28 11:33:03,782 INFO L290 TraceCheckUtils]: 62: Hoare triple {22717#true} ~cond := #in~cond; {22717#true} is VALID [2022-04-28 11:33:03,782 INFO L272 TraceCheckUtils]: 61: Hoare triple {23337#(< ~counter~0 17)} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {22717#true} is VALID [2022-04-28 11:33:03,782 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {22717#true} {23337#(< ~counter~0 17)} #85#return; {23337#(< ~counter~0 17)} is VALID [2022-04-28 11:33:03,782 INFO L290 TraceCheckUtils]: 59: Hoare triple {22717#true} assume true; {22717#true} is VALID [2022-04-28 11:33:03,782 INFO L290 TraceCheckUtils]: 58: Hoare triple {22717#true} assume !(0 == ~cond); {22717#true} is VALID [2022-04-28 11:33:03,782 INFO L290 TraceCheckUtils]: 57: Hoare triple {22717#true} ~cond := #in~cond; {22717#true} is VALID [2022-04-28 11:33:03,783 INFO L272 TraceCheckUtils]: 56: Hoare triple {23337#(< ~counter~0 17)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {22717#true} is VALID [2022-04-28 11:33:03,783 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {22717#true} {23337#(< ~counter~0 17)} #83#return; {23337#(< ~counter~0 17)} is VALID [2022-04-28 11:33:03,783 INFO L290 TraceCheckUtils]: 54: Hoare triple {22717#true} assume true; {22717#true} is VALID [2022-04-28 11:33:03,783 INFO L290 TraceCheckUtils]: 53: Hoare triple {22717#true} assume !(0 == ~cond); {22717#true} is VALID [2022-04-28 11:33:03,783 INFO L290 TraceCheckUtils]: 52: Hoare triple {22717#true} ~cond := #in~cond; {22717#true} is VALID [2022-04-28 11:33:03,783 INFO L272 TraceCheckUtils]: 51: Hoare triple {23337#(< ~counter~0 17)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {22717#true} is VALID [2022-04-28 11:33:03,783 INFO L290 TraceCheckUtils]: 50: Hoare triple {23337#(< ~counter~0 17)} assume !!(#t~post7 < 20);havoc #t~post7; {23337#(< ~counter~0 17)} is VALID [2022-04-28 11:33:03,784 INFO L290 TraceCheckUtils]: 49: Hoare triple {23410#(< ~counter~0 16)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {23337#(< ~counter~0 17)} is VALID [2022-04-28 11:33:03,785 INFO L290 TraceCheckUtils]: 48: Hoare triple {23410#(< ~counter~0 16)} ~a~0 := 2 * ~a~0;~b~0 := 2 * ~b~0; {23410#(< ~counter~0 16)} is VALID [2022-04-28 11:33:03,785 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {22717#true} {23410#(< ~counter~0 16)} #89#return; {23410#(< ~counter~0 16)} is VALID [2022-04-28 11:33:03,785 INFO L290 TraceCheckUtils]: 46: Hoare triple {22717#true} assume true; {22717#true} is VALID [2022-04-28 11:33:03,785 INFO L290 TraceCheckUtils]: 45: Hoare triple {22717#true} assume !(0 == ~cond); {22717#true} is VALID [2022-04-28 11:33:03,785 INFO L290 TraceCheckUtils]: 44: Hoare triple {22717#true} ~cond := #in~cond; {22717#true} is VALID [2022-04-28 11:33:03,785 INFO L272 TraceCheckUtils]: 43: Hoare triple {23410#(< ~counter~0 16)} call __VERIFIER_assert((if ~r~0 >= 2 * ~y~0 * ~a~0 then 1 else 0)); {22717#true} is VALID [2022-04-28 11:33:03,786 INFO L290 TraceCheckUtils]: 42: Hoare triple {23410#(< ~counter~0 16)} assume !!(~r~0 >= 2 * ~b~0); {23410#(< ~counter~0 16)} is VALID [2022-04-28 11:33:03,786 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {22717#true} {23410#(< ~counter~0 16)} #87#return; {23410#(< ~counter~0 16)} is VALID [2022-04-28 11:33:03,786 INFO L290 TraceCheckUtils]: 40: Hoare triple {22717#true} assume true; {22717#true} is VALID [2022-04-28 11:33:03,786 INFO L290 TraceCheckUtils]: 39: Hoare triple {22717#true} assume !(0 == ~cond); {22717#true} is VALID [2022-04-28 11:33:03,786 INFO L290 TraceCheckUtils]: 38: Hoare triple {22717#true} ~cond := #in~cond; {22717#true} is VALID [2022-04-28 11:33:03,786 INFO L272 TraceCheckUtils]: 37: Hoare triple {23410#(< ~counter~0 16)} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {22717#true} is VALID [2022-04-28 11:33:03,787 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {22717#true} {23410#(< ~counter~0 16)} #85#return; {23410#(< ~counter~0 16)} is VALID [2022-04-28 11:33:03,787 INFO L290 TraceCheckUtils]: 35: Hoare triple {22717#true} assume true; {22717#true} is VALID [2022-04-28 11:33:03,787 INFO L290 TraceCheckUtils]: 34: Hoare triple {22717#true} assume !(0 == ~cond); {22717#true} is VALID [2022-04-28 11:33:03,787 INFO L290 TraceCheckUtils]: 33: Hoare triple {22717#true} ~cond := #in~cond; {22717#true} is VALID [2022-04-28 11:33:03,787 INFO L272 TraceCheckUtils]: 32: Hoare triple {23410#(< ~counter~0 16)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {22717#true} is VALID [2022-04-28 11:33:03,787 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {22717#true} {23410#(< ~counter~0 16)} #83#return; {23410#(< ~counter~0 16)} is VALID [2022-04-28 11:33:03,787 INFO L290 TraceCheckUtils]: 30: Hoare triple {22717#true} assume true; {22717#true} is VALID [2022-04-28 11:33:03,787 INFO L290 TraceCheckUtils]: 29: Hoare triple {22717#true} assume !(0 == ~cond); {22717#true} is VALID [2022-04-28 11:33:03,788 INFO L290 TraceCheckUtils]: 28: Hoare triple {22717#true} ~cond := #in~cond; {22717#true} is VALID [2022-04-28 11:33:03,788 INFO L272 TraceCheckUtils]: 27: Hoare triple {23410#(< ~counter~0 16)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {22717#true} is VALID [2022-04-28 11:33:03,788 INFO L290 TraceCheckUtils]: 26: Hoare triple {23410#(< ~counter~0 16)} assume !!(#t~post7 < 20);havoc #t~post7; {23410#(< ~counter~0 16)} is VALID [2022-04-28 11:33:03,789 INFO L290 TraceCheckUtils]: 25: Hoare triple {23483#(< ~counter~0 15)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {23410#(< ~counter~0 16)} is VALID [2022-04-28 11:33:03,789 INFO L290 TraceCheckUtils]: 24: Hoare triple {23483#(< ~counter~0 15)} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {23483#(< ~counter~0 15)} is VALID [2022-04-28 11:33:03,789 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {22717#true} {23483#(< ~counter~0 15)} #81#return; {23483#(< ~counter~0 15)} is VALID [2022-04-28 11:33:03,790 INFO L290 TraceCheckUtils]: 22: Hoare triple {22717#true} assume true; {22717#true} is VALID [2022-04-28 11:33:03,790 INFO L290 TraceCheckUtils]: 21: Hoare triple {22717#true} assume !(0 == ~cond); {22717#true} is VALID [2022-04-28 11:33:03,790 INFO L290 TraceCheckUtils]: 20: Hoare triple {22717#true} ~cond := #in~cond; {22717#true} is VALID [2022-04-28 11:33:03,790 INFO L272 TraceCheckUtils]: 19: Hoare triple {23483#(< ~counter~0 15)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {22717#true} is VALID [2022-04-28 11:33:03,790 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {22717#true} {23483#(< ~counter~0 15)} #79#return; {23483#(< ~counter~0 15)} is VALID [2022-04-28 11:33:03,790 INFO L290 TraceCheckUtils]: 17: Hoare triple {22717#true} assume true; {22717#true} is VALID [2022-04-28 11:33:03,790 INFO L290 TraceCheckUtils]: 16: Hoare triple {22717#true} assume !(0 == ~cond); {22717#true} is VALID [2022-04-28 11:33:03,790 INFO L290 TraceCheckUtils]: 15: Hoare triple {22717#true} ~cond := #in~cond; {22717#true} is VALID [2022-04-28 11:33:03,790 INFO L272 TraceCheckUtils]: 14: Hoare triple {23483#(< ~counter~0 15)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {22717#true} is VALID [2022-04-28 11:33:03,791 INFO L290 TraceCheckUtils]: 13: Hoare triple {23483#(< ~counter~0 15)} assume !!(#t~post6 < 20);havoc #t~post6; {23483#(< ~counter~0 15)} is VALID [2022-04-28 11:33:03,791 INFO L290 TraceCheckUtils]: 12: Hoare triple {23523#(< ~counter~0 14)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {23483#(< ~counter~0 15)} is VALID [2022-04-28 11:33:03,791 INFO L290 TraceCheckUtils]: 11: Hoare triple {23523#(< ~counter~0 14)} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {23523#(< ~counter~0 14)} is VALID [2022-04-28 11:33:03,792 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {22717#true} {23523#(< ~counter~0 14)} #77#return; {23523#(< ~counter~0 14)} is VALID [2022-04-28 11:33:03,792 INFO L290 TraceCheckUtils]: 9: Hoare triple {22717#true} assume true; {22717#true} is VALID [2022-04-28 11:33:03,792 INFO L290 TraceCheckUtils]: 8: Hoare triple {22717#true} assume !(0 == ~cond); {22717#true} is VALID [2022-04-28 11:33:03,792 INFO L290 TraceCheckUtils]: 7: Hoare triple {22717#true} ~cond := #in~cond; {22717#true} is VALID [2022-04-28 11:33:03,792 INFO L272 TraceCheckUtils]: 6: Hoare triple {23523#(< ~counter~0 14)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {22717#true} is VALID [2022-04-28 11:33:03,792 INFO L290 TraceCheckUtils]: 5: Hoare triple {23523#(< ~counter~0 14)} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~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; {23523#(< ~counter~0 14)} is VALID [2022-04-28 11:33:03,793 INFO L272 TraceCheckUtils]: 4: Hoare triple {23523#(< ~counter~0 14)} call #t~ret8 := main(); {23523#(< ~counter~0 14)} is VALID [2022-04-28 11:33:03,793 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23523#(< ~counter~0 14)} {22717#true} #93#return; {23523#(< ~counter~0 14)} is VALID [2022-04-28 11:33:03,793 INFO L290 TraceCheckUtils]: 2: Hoare triple {23523#(< ~counter~0 14)} assume true; {23523#(< ~counter~0 14)} is VALID [2022-04-28 11:33:03,794 INFO L290 TraceCheckUtils]: 1: Hoare triple {22717#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(14, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {23523#(< ~counter~0 14)} is VALID [2022-04-28 11:33:03,794 INFO L272 TraceCheckUtils]: 0: Hoare triple {22717#true} call ULTIMATE.init(); {22717#true} is VALID [2022-04-28 11:33:03,794 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 43 proven. 55 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2022-04-28 11:33:03,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:33:03,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360712513] [2022-04-28 11:33:03,794 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:33:03,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1740535174] [2022-04-28 11:33:03,794 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1740535174] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 11:33:03,795 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 11:33:03,795 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2022-04-28 11:33:03,795 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:33:03,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [392669446] [2022-04-28 11:33:03,795 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [392669446] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:33:03,795 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:33:03,795 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 11:33:03,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489572521] [2022-04-28 11:33:03,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:33:03,795 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 9 states have internal predecessors, (55), 9 states have call successors, (23), 9 states have call predecessors, (23), 7 states have return successors, (21), 7 states have call predecessors, (21), 8 states have call successors, (21) Word has length 138 [2022-04-28 11:33:03,796 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:33:03,796 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 5.5) internal successors, (55), 9 states have internal predecessors, (55), 9 states have call successors, (23), 9 states have call predecessors, (23), 7 states have return successors, (21), 7 states have call predecessors, (21), 8 states have call successors, (21) [2022-04-28 11:33:03,878 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:33:03,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 11:33:03,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:33:03,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 11:33:03,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2022-04-28 11:33:03,879 INFO L87 Difference]: Start difference. First operand 219 states and 257 transitions. Second operand has 10 states, 10 states have (on average 5.5) internal successors, (55), 9 states have internal predecessors, (55), 9 states have call successors, (23), 9 states have call predecessors, (23), 7 states have return successors, (21), 7 states have call predecessors, (21), 8 states have call successors, (21) [2022-04-28 11:33:04,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:33:04,902 INFO L93 Difference]: Finished difference Result 304 states and 345 transitions. [2022-04-28 11:33:04,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-28 11:33:04,902 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 9 states have internal predecessors, (55), 9 states have call successors, (23), 9 states have call predecessors, (23), 7 states have return successors, (21), 7 states have call predecessors, (21), 8 states have call successors, (21) Word has length 138 [2022-04-28 11:33:04,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:33:04,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 5.5) internal successors, (55), 9 states have internal predecessors, (55), 9 states have call successors, (23), 9 states have call predecessors, (23), 7 states have return successors, (21), 7 states have call predecessors, (21), 8 states have call successors, (21) [2022-04-28 11:33:04,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 158 transitions. [2022-04-28 11:33:04,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 5.5) internal successors, (55), 9 states have internal predecessors, (55), 9 states have call successors, (23), 9 states have call predecessors, (23), 7 states have return successors, (21), 7 states have call predecessors, (21), 8 states have call successors, (21) [2022-04-28 11:33:04,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 158 transitions. [2022-04-28 11:33:04,905 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 158 transitions. [2022-04-28 11:33:05,010 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 158 edges. 158 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:33:05,015 INFO L225 Difference]: With dead ends: 304 [2022-04-28 11:33:05,015 INFO L226 Difference]: Without dead ends: 296 [2022-04-28 11:33:05,016 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 259 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=205, Invalid=301, Unknown=0, NotChecked=0, Total=506 [2022-04-28 11:33:05,016 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 44 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 11:33:05,016 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 244 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 11:33:05,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2022-04-28 11:33:05,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 291. [2022-04-28 11:33:05,414 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:33:05,415 INFO L82 GeneralOperation]: Start isEquivalent. First operand 296 states. Second operand has 291 states, 190 states have (on average 1.0947368421052632) internal successors, (208), 192 states have internal predecessors, (208), 63 states have call successors, (63), 39 states have call predecessors, (63), 37 states have return successors, (60), 59 states have call predecessors, (60), 60 states have call successors, (60) [2022-04-28 11:33:05,415 INFO L74 IsIncluded]: Start isIncluded. First operand 296 states. Second operand has 291 states, 190 states have (on average 1.0947368421052632) internal successors, (208), 192 states have internal predecessors, (208), 63 states have call successors, (63), 39 states have call predecessors, (63), 37 states have return successors, (60), 59 states have call predecessors, (60), 60 states have call successors, (60) [2022-04-28 11:33:05,416 INFO L87 Difference]: Start difference. First operand 296 states. Second operand has 291 states, 190 states have (on average 1.0947368421052632) internal successors, (208), 192 states have internal predecessors, (208), 63 states have call successors, (63), 39 states have call predecessors, (63), 37 states have return successors, (60), 59 states have call predecessors, (60), 60 states have call successors, (60) [2022-04-28 11:33:05,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:33:05,420 INFO L93 Difference]: Finished difference Result 296 states and 336 transitions. [2022-04-28 11:33:05,420 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 336 transitions. [2022-04-28 11:33:05,421 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:33:05,421 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:33:05,421 INFO L74 IsIncluded]: Start isIncluded. First operand has 291 states, 190 states have (on average 1.0947368421052632) internal successors, (208), 192 states have internal predecessors, (208), 63 states have call successors, (63), 39 states have call predecessors, (63), 37 states have return successors, (60), 59 states have call predecessors, (60), 60 states have call successors, (60) Second operand 296 states. [2022-04-28 11:33:05,421 INFO L87 Difference]: Start difference. First operand has 291 states, 190 states have (on average 1.0947368421052632) internal successors, (208), 192 states have internal predecessors, (208), 63 states have call successors, (63), 39 states have call predecessors, (63), 37 states have return successors, (60), 59 states have call predecessors, (60), 60 states have call successors, (60) Second operand 296 states. [2022-04-28 11:33:05,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:33:05,426 INFO L93 Difference]: Finished difference Result 296 states and 336 transitions. [2022-04-28 11:33:05,426 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 336 transitions. [2022-04-28 11:33:05,427 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:33:05,427 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:33:05,427 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:33:05,427 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:33:05,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 190 states have (on average 1.0947368421052632) internal successors, (208), 192 states have internal predecessors, (208), 63 states have call successors, (63), 39 states have call predecessors, (63), 37 states have return successors, (60), 59 states have call predecessors, (60), 60 states have call successors, (60) [2022-04-28 11:33:05,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 331 transitions. [2022-04-28 11:33:05,433 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 331 transitions. Word has length 138 [2022-04-28 11:33:05,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:33:05,433 INFO L495 AbstractCegarLoop]: Abstraction has 291 states and 331 transitions. [2022-04-28 11:33:05,433 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 9 states have internal predecessors, (55), 9 states have call successors, (23), 9 states have call predecessors, (23), 7 states have return successors, (21), 7 states have call predecessors, (21), 8 states have call successors, (21) [2022-04-28 11:33:05,433 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 291 states and 331 transitions. [2022-04-28 11:33:05,971 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 331 edges. 331 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:33:05,971 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 331 transitions. [2022-04-28 11:33:05,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2022-04-28 11:33:05,972 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:33:05,972 INFO L195 NwaCegarLoop]: trace histogram [23, 22, 22, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:33:06,000 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-04-28 11:33:06,172 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-04-28 11:33:06,172 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:33:06,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:33:06,173 INFO L85 PathProgramCache]: Analyzing trace with hash -559679257, now seen corresponding path program 7 times [2022-04-28 11:33:06,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:33:06,173 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [818966833] [2022-04-28 11:33:50,881 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:33:50,881 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:33:50,882 INFO L85 PathProgramCache]: Analyzing trace with hash -559679257, now seen corresponding path program 8 times [2022-04-28 11:33:50,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:33:50,882 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268475843] [2022-04-28 11:33:50,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:33:50,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:33:50,895 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:33:50,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [612609014] [2022-04-28 11:33:50,895 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:33:50,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:33:50,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:33:50,903 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 11:33:50,904 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-04-28 11:33:50,991 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 11:33:50,991 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:33:50,993 INFO L263 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-28 11:33:51,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:33:51,018 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:33:51,623 INFO L272 TraceCheckUtils]: 0: Hoare triple {25354#true} call ULTIMATE.init(); {25354#true} is VALID [2022-04-28 11:33:51,624 INFO L290 TraceCheckUtils]: 1: Hoare triple {25354#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(14, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {25362#(<= ~counter~0 0)} is VALID [2022-04-28 11:33:51,624 INFO L290 TraceCheckUtils]: 2: Hoare triple {25362#(<= ~counter~0 0)} assume true; {25362#(<= ~counter~0 0)} is VALID [2022-04-28 11:33:51,625 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25362#(<= ~counter~0 0)} {25354#true} #93#return; {25362#(<= ~counter~0 0)} is VALID [2022-04-28 11:33:51,625 INFO L272 TraceCheckUtils]: 4: Hoare triple {25362#(<= ~counter~0 0)} call #t~ret8 := main(); {25362#(<= ~counter~0 0)} is VALID [2022-04-28 11:33:51,625 INFO L290 TraceCheckUtils]: 5: Hoare triple {25362#(<= ~counter~0 0)} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~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; {25362#(<= ~counter~0 0)} is VALID [2022-04-28 11:33:51,625 INFO L272 TraceCheckUtils]: 6: Hoare triple {25362#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {25362#(<= ~counter~0 0)} is VALID [2022-04-28 11:33:51,625 INFO L290 TraceCheckUtils]: 7: Hoare triple {25362#(<= ~counter~0 0)} ~cond := #in~cond; {25362#(<= ~counter~0 0)} is VALID [2022-04-28 11:33:51,626 INFO L290 TraceCheckUtils]: 8: Hoare triple {25362#(<= ~counter~0 0)} assume !(0 == ~cond); {25362#(<= ~counter~0 0)} is VALID [2022-04-28 11:33:51,626 INFO L290 TraceCheckUtils]: 9: Hoare triple {25362#(<= ~counter~0 0)} assume true; {25362#(<= ~counter~0 0)} is VALID [2022-04-28 11:33:51,626 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {25362#(<= ~counter~0 0)} {25362#(<= ~counter~0 0)} #77#return; {25362#(<= ~counter~0 0)} is VALID [2022-04-28 11:33:51,626 INFO L290 TraceCheckUtils]: 11: Hoare triple {25362#(<= ~counter~0 0)} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {25362#(<= ~counter~0 0)} is VALID [2022-04-28 11:33:51,627 INFO L290 TraceCheckUtils]: 12: Hoare triple {25362#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {25396#(<= ~counter~0 1)} is VALID [2022-04-28 11:33:51,627 INFO L290 TraceCheckUtils]: 13: Hoare triple {25396#(<= ~counter~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {25396#(<= ~counter~0 1)} is VALID [2022-04-28 11:33:51,628 INFO L272 TraceCheckUtils]: 14: Hoare triple {25396#(<= ~counter~0 1)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {25396#(<= ~counter~0 1)} is VALID [2022-04-28 11:33:51,628 INFO L290 TraceCheckUtils]: 15: Hoare triple {25396#(<= ~counter~0 1)} ~cond := #in~cond; {25396#(<= ~counter~0 1)} is VALID [2022-04-28 11:33:51,628 INFO L290 TraceCheckUtils]: 16: Hoare triple {25396#(<= ~counter~0 1)} assume !(0 == ~cond); {25396#(<= ~counter~0 1)} is VALID [2022-04-28 11:33:51,628 INFO L290 TraceCheckUtils]: 17: Hoare triple {25396#(<= ~counter~0 1)} assume true; {25396#(<= ~counter~0 1)} is VALID [2022-04-28 11:33:51,628 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {25396#(<= ~counter~0 1)} {25396#(<= ~counter~0 1)} #79#return; {25396#(<= ~counter~0 1)} is VALID [2022-04-28 11:33:51,629 INFO L272 TraceCheckUtils]: 19: Hoare triple {25396#(<= ~counter~0 1)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {25396#(<= ~counter~0 1)} is VALID [2022-04-28 11:33:51,629 INFO L290 TraceCheckUtils]: 20: Hoare triple {25396#(<= ~counter~0 1)} ~cond := #in~cond; {25396#(<= ~counter~0 1)} is VALID [2022-04-28 11:33:51,629 INFO L290 TraceCheckUtils]: 21: Hoare triple {25396#(<= ~counter~0 1)} assume !(0 == ~cond); {25396#(<= ~counter~0 1)} is VALID [2022-04-28 11:33:51,629 INFO L290 TraceCheckUtils]: 22: Hoare triple {25396#(<= ~counter~0 1)} assume true; {25396#(<= ~counter~0 1)} is VALID [2022-04-28 11:33:51,630 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {25396#(<= ~counter~0 1)} {25396#(<= ~counter~0 1)} #81#return; {25396#(<= ~counter~0 1)} is VALID [2022-04-28 11:33:51,630 INFO L290 TraceCheckUtils]: 24: Hoare triple {25396#(<= ~counter~0 1)} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {25396#(<= ~counter~0 1)} is VALID [2022-04-28 11:33:51,631 INFO L290 TraceCheckUtils]: 25: Hoare triple {25396#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {25436#(<= ~counter~0 2)} is VALID [2022-04-28 11:33:51,631 INFO L290 TraceCheckUtils]: 26: Hoare triple {25436#(<= ~counter~0 2)} assume !!(#t~post7 < 20);havoc #t~post7; {25436#(<= ~counter~0 2)} is VALID [2022-04-28 11:33:51,631 INFO L272 TraceCheckUtils]: 27: Hoare triple {25436#(<= ~counter~0 2)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {25436#(<= ~counter~0 2)} is VALID [2022-04-28 11:33:51,631 INFO L290 TraceCheckUtils]: 28: Hoare triple {25436#(<= ~counter~0 2)} ~cond := #in~cond; {25436#(<= ~counter~0 2)} is VALID [2022-04-28 11:33:51,631 INFO L290 TraceCheckUtils]: 29: Hoare triple {25436#(<= ~counter~0 2)} assume !(0 == ~cond); {25436#(<= ~counter~0 2)} is VALID [2022-04-28 11:33:51,632 INFO L290 TraceCheckUtils]: 30: Hoare triple {25436#(<= ~counter~0 2)} assume true; {25436#(<= ~counter~0 2)} is VALID [2022-04-28 11:33:51,632 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {25436#(<= ~counter~0 2)} {25436#(<= ~counter~0 2)} #83#return; {25436#(<= ~counter~0 2)} is VALID [2022-04-28 11:33:51,632 INFO L272 TraceCheckUtils]: 32: Hoare triple {25436#(<= ~counter~0 2)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {25436#(<= ~counter~0 2)} is VALID [2022-04-28 11:33:51,632 INFO L290 TraceCheckUtils]: 33: Hoare triple {25436#(<= ~counter~0 2)} ~cond := #in~cond; {25436#(<= ~counter~0 2)} is VALID [2022-04-28 11:33:51,633 INFO L290 TraceCheckUtils]: 34: Hoare triple {25436#(<= ~counter~0 2)} assume !(0 == ~cond); {25436#(<= ~counter~0 2)} is VALID [2022-04-28 11:33:51,633 INFO L290 TraceCheckUtils]: 35: Hoare triple {25436#(<= ~counter~0 2)} assume true; {25436#(<= ~counter~0 2)} is VALID [2022-04-28 11:33:51,633 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {25436#(<= ~counter~0 2)} {25436#(<= ~counter~0 2)} #85#return; {25436#(<= ~counter~0 2)} is VALID [2022-04-28 11:33:51,634 INFO L272 TraceCheckUtils]: 37: Hoare triple {25436#(<= ~counter~0 2)} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {25436#(<= ~counter~0 2)} is VALID [2022-04-28 11:33:51,634 INFO L290 TraceCheckUtils]: 38: Hoare triple {25436#(<= ~counter~0 2)} ~cond := #in~cond; {25436#(<= ~counter~0 2)} is VALID [2022-04-28 11:33:51,634 INFO L290 TraceCheckUtils]: 39: Hoare triple {25436#(<= ~counter~0 2)} assume !(0 == ~cond); {25436#(<= ~counter~0 2)} is VALID [2022-04-28 11:33:51,634 INFO L290 TraceCheckUtils]: 40: Hoare triple {25436#(<= ~counter~0 2)} assume true; {25436#(<= ~counter~0 2)} is VALID [2022-04-28 11:33:51,635 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {25436#(<= ~counter~0 2)} {25436#(<= ~counter~0 2)} #87#return; {25436#(<= ~counter~0 2)} is VALID [2022-04-28 11:33:51,635 INFO L290 TraceCheckUtils]: 42: Hoare triple {25436#(<= ~counter~0 2)} assume !!(~r~0 >= 2 * ~b~0); {25436#(<= ~counter~0 2)} is VALID [2022-04-28 11:33:51,635 INFO L272 TraceCheckUtils]: 43: Hoare triple {25436#(<= ~counter~0 2)} call __VERIFIER_assert((if ~r~0 >= 2 * ~y~0 * ~a~0 then 1 else 0)); {25436#(<= ~counter~0 2)} is VALID [2022-04-28 11:33:51,635 INFO L290 TraceCheckUtils]: 44: Hoare triple {25436#(<= ~counter~0 2)} ~cond := #in~cond; {25436#(<= ~counter~0 2)} is VALID [2022-04-28 11:33:51,635 INFO L290 TraceCheckUtils]: 45: Hoare triple {25436#(<= ~counter~0 2)} assume !(0 == ~cond); {25436#(<= ~counter~0 2)} is VALID [2022-04-28 11:33:51,636 INFO L290 TraceCheckUtils]: 46: Hoare triple {25436#(<= ~counter~0 2)} assume true; {25436#(<= ~counter~0 2)} is VALID [2022-04-28 11:33:51,636 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {25436#(<= ~counter~0 2)} {25436#(<= ~counter~0 2)} #89#return; {25436#(<= ~counter~0 2)} is VALID [2022-04-28 11:33:51,636 INFO L290 TraceCheckUtils]: 48: Hoare triple {25436#(<= ~counter~0 2)} ~a~0 := 2 * ~a~0;~b~0 := 2 * ~b~0; {25436#(<= ~counter~0 2)} is VALID [2022-04-28 11:33:51,643 INFO L290 TraceCheckUtils]: 49: Hoare triple {25436#(<= ~counter~0 2)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {25509#(<= ~counter~0 3)} is VALID [2022-04-28 11:33:51,643 INFO L290 TraceCheckUtils]: 50: Hoare triple {25509#(<= ~counter~0 3)} assume !!(#t~post7 < 20);havoc #t~post7; {25509#(<= ~counter~0 3)} is VALID [2022-04-28 11:33:51,644 INFO L272 TraceCheckUtils]: 51: Hoare triple {25509#(<= ~counter~0 3)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {25509#(<= ~counter~0 3)} is VALID [2022-04-28 11:33:51,644 INFO L290 TraceCheckUtils]: 52: Hoare triple {25509#(<= ~counter~0 3)} ~cond := #in~cond; {25509#(<= ~counter~0 3)} is VALID [2022-04-28 11:33:51,644 INFO L290 TraceCheckUtils]: 53: Hoare triple {25509#(<= ~counter~0 3)} assume !(0 == ~cond); {25509#(<= ~counter~0 3)} is VALID [2022-04-28 11:33:51,644 INFO L290 TraceCheckUtils]: 54: Hoare triple {25509#(<= ~counter~0 3)} assume true; {25509#(<= ~counter~0 3)} is VALID [2022-04-28 11:33:51,645 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {25509#(<= ~counter~0 3)} {25509#(<= ~counter~0 3)} #83#return; {25509#(<= ~counter~0 3)} is VALID [2022-04-28 11:33:51,645 INFO L272 TraceCheckUtils]: 56: Hoare triple {25509#(<= ~counter~0 3)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {25509#(<= ~counter~0 3)} is VALID [2022-04-28 11:33:51,645 INFO L290 TraceCheckUtils]: 57: Hoare triple {25509#(<= ~counter~0 3)} ~cond := #in~cond; {25509#(<= ~counter~0 3)} is VALID [2022-04-28 11:33:51,645 INFO L290 TraceCheckUtils]: 58: Hoare triple {25509#(<= ~counter~0 3)} assume !(0 == ~cond); {25509#(<= ~counter~0 3)} is VALID [2022-04-28 11:33:51,645 INFO L290 TraceCheckUtils]: 59: Hoare triple {25509#(<= ~counter~0 3)} assume true; {25509#(<= ~counter~0 3)} is VALID [2022-04-28 11:33:51,646 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {25509#(<= ~counter~0 3)} {25509#(<= ~counter~0 3)} #85#return; {25509#(<= ~counter~0 3)} is VALID [2022-04-28 11:33:51,646 INFO L272 TraceCheckUtils]: 61: Hoare triple {25509#(<= ~counter~0 3)} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {25509#(<= ~counter~0 3)} is VALID [2022-04-28 11:33:51,646 INFO L290 TraceCheckUtils]: 62: Hoare triple {25509#(<= ~counter~0 3)} ~cond := #in~cond; {25509#(<= ~counter~0 3)} is VALID [2022-04-28 11:33:51,646 INFO L290 TraceCheckUtils]: 63: Hoare triple {25509#(<= ~counter~0 3)} assume !(0 == ~cond); {25509#(<= ~counter~0 3)} is VALID [2022-04-28 11:33:51,646 INFO L290 TraceCheckUtils]: 64: Hoare triple {25509#(<= ~counter~0 3)} assume true; {25509#(<= ~counter~0 3)} is VALID [2022-04-28 11:33:51,647 INFO L284 TraceCheckUtils]: 65: Hoare quadruple {25509#(<= ~counter~0 3)} {25509#(<= ~counter~0 3)} #87#return; {25509#(<= ~counter~0 3)} is VALID [2022-04-28 11:33:51,647 INFO L290 TraceCheckUtils]: 66: Hoare triple {25509#(<= ~counter~0 3)} assume !!(~r~0 >= 2 * ~b~0); {25509#(<= ~counter~0 3)} is VALID [2022-04-28 11:33:51,647 INFO L272 TraceCheckUtils]: 67: Hoare triple {25509#(<= ~counter~0 3)} call __VERIFIER_assert((if ~r~0 >= 2 * ~y~0 * ~a~0 then 1 else 0)); {25509#(<= ~counter~0 3)} is VALID [2022-04-28 11:33:51,647 INFO L290 TraceCheckUtils]: 68: Hoare triple {25509#(<= ~counter~0 3)} ~cond := #in~cond; {25509#(<= ~counter~0 3)} is VALID [2022-04-28 11:33:51,648 INFO L290 TraceCheckUtils]: 69: Hoare triple {25509#(<= ~counter~0 3)} assume !(0 == ~cond); {25509#(<= ~counter~0 3)} is VALID [2022-04-28 11:33:51,648 INFO L290 TraceCheckUtils]: 70: Hoare triple {25509#(<= ~counter~0 3)} assume true; {25509#(<= ~counter~0 3)} is VALID [2022-04-28 11:33:51,648 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {25509#(<= ~counter~0 3)} {25509#(<= ~counter~0 3)} #89#return; {25509#(<= ~counter~0 3)} is VALID [2022-04-28 11:33:51,648 INFO L290 TraceCheckUtils]: 72: Hoare triple {25509#(<= ~counter~0 3)} ~a~0 := 2 * ~a~0;~b~0 := 2 * ~b~0; {25509#(<= ~counter~0 3)} is VALID [2022-04-28 11:33:51,649 INFO L290 TraceCheckUtils]: 73: Hoare triple {25509#(<= ~counter~0 3)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {25582#(<= ~counter~0 4)} is VALID [2022-04-28 11:33:51,649 INFO L290 TraceCheckUtils]: 74: Hoare triple {25582#(<= ~counter~0 4)} assume !!(#t~post7 < 20);havoc #t~post7; {25582#(<= ~counter~0 4)} is VALID [2022-04-28 11:33:51,650 INFO L272 TraceCheckUtils]: 75: Hoare triple {25582#(<= ~counter~0 4)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {25582#(<= ~counter~0 4)} is VALID [2022-04-28 11:33:51,651 INFO L290 TraceCheckUtils]: 76: Hoare triple {25582#(<= ~counter~0 4)} ~cond := #in~cond; {25582#(<= ~counter~0 4)} is VALID [2022-04-28 11:33:51,652 INFO L290 TraceCheckUtils]: 77: Hoare triple {25582#(<= ~counter~0 4)} assume !(0 == ~cond); {25582#(<= ~counter~0 4)} is VALID [2022-04-28 11:33:51,652 INFO L290 TraceCheckUtils]: 78: Hoare triple {25582#(<= ~counter~0 4)} assume true; {25582#(<= ~counter~0 4)} is VALID [2022-04-28 11:33:51,652 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {25582#(<= ~counter~0 4)} {25582#(<= ~counter~0 4)} #83#return; {25582#(<= ~counter~0 4)} is VALID [2022-04-28 11:33:51,653 INFO L272 TraceCheckUtils]: 80: Hoare triple {25582#(<= ~counter~0 4)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {25582#(<= ~counter~0 4)} is VALID [2022-04-28 11:33:51,653 INFO L290 TraceCheckUtils]: 81: Hoare triple {25582#(<= ~counter~0 4)} ~cond := #in~cond; {25582#(<= ~counter~0 4)} is VALID [2022-04-28 11:33:51,653 INFO L290 TraceCheckUtils]: 82: Hoare triple {25582#(<= ~counter~0 4)} assume !(0 == ~cond); {25582#(<= ~counter~0 4)} is VALID [2022-04-28 11:33:51,653 INFO L290 TraceCheckUtils]: 83: Hoare triple {25582#(<= ~counter~0 4)} assume true; {25582#(<= ~counter~0 4)} is VALID [2022-04-28 11:33:51,653 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {25582#(<= ~counter~0 4)} {25582#(<= ~counter~0 4)} #85#return; {25582#(<= ~counter~0 4)} is VALID [2022-04-28 11:33:51,654 INFO L272 TraceCheckUtils]: 85: Hoare triple {25582#(<= ~counter~0 4)} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {25582#(<= ~counter~0 4)} is VALID [2022-04-28 11:33:51,654 INFO L290 TraceCheckUtils]: 86: Hoare triple {25582#(<= ~counter~0 4)} ~cond := #in~cond; {25582#(<= ~counter~0 4)} is VALID [2022-04-28 11:33:51,654 INFO L290 TraceCheckUtils]: 87: Hoare triple {25582#(<= ~counter~0 4)} assume !(0 == ~cond); {25582#(<= ~counter~0 4)} is VALID [2022-04-28 11:33:51,654 INFO L290 TraceCheckUtils]: 88: Hoare triple {25582#(<= ~counter~0 4)} assume true; {25582#(<= ~counter~0 4)} is VALID [2022-04-28 11:33:51,654 INFO L284 TraceCheckUtils]: 89: Hoare quadruple {25582#(<= ~counter~0 4)} {25582#(<= ~counter~0 4)} #87#return; {25582#(<= ~counter~0 4)} is VALID [2022-04-28 11:33:51,655 INFO L290 TraceCheckUtils]: 90: Hoare triple {25582#(<= ~counter~0 4)} assume !(~r~0 >= 2 * ~b~0); {25582#(<= ~counter~0 4)} is VALID [2022-04-28 11:33:51,655 INFO L290 TraceCheckUtils]: 91: Hoare triple {25582#(<= ~counter~0 4)} ~r~0 := ~r~0 - ~b~0;~q~0 := ~q~0 + ~a~0; {25582#(<= ~counter~0 4)} is VALID [2022-04-28 11:33:51,656 INFO L290 TraceCheckUtils]: 92: Hoare triple {25582#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {25640#(<= ~counter~0 5)} is VALID [2022-04-28 11:33:51,656 INFO L290 TraceCheckUtils]: 93: Hoare triple {25640#(<= ~counter~0 5)} assume !!(#t~post6 < 20);havoc #t~post6; {25640#(<= ~counter~0 5)} is VALID [2022-04-28 11:33:51,656 INFO L272 TraceCheckUtils]: 94: Hoare triple {25640#(<= ~counter~0 5)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {25640#(<= ~counter~0 5)} is VALID [2022-04-28 11:33:51,657 INFO L290 TraceCheckUtils]: 95: Hoare triple {25640#(<= ~counter~0 5)} ~cond := #in~cond; {25640#(<= ~counter~0 5)} is VALID [2022-04-28 11:33:51,657 INFO L290 TraceCheckUtils]: 96: Hoare triple {25640#(<= ~counter~0 5)} assume !(0 == ~cond); {25640#(<= ~counter~0 5)} is VALID [2022-04-28 11:33:51,657 INFO L290 TraceCheckUtils]: 97: Hoare triple {25640#(<= ~counter~0 5)} assume true; {25640#(<= ~counter~0 5)} is VALID [2022-04-28 11:33:51,657 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {25640#(<= ~counter~0 5)} {25640#(<= ~counter~0 5)} #79#return; {25640#(<= ~counter~0 5)} is VALID [2022-04-28 11:33:51,657 INFO L272 TraceCheckUtils]: 99: Hoare triple {25640#(<= ~counter~0 5)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {25640#(<= ~counter~0 5)} is VALID [2022-04-28 11:33:51,658 INFO L290 TraceCheckUtils]: 100: Hoare triple {25640#(<= ~counter~0 5)} ~cond := #in~cond; {25640#(<= ~counter~0 5)} is VALID [2022-04-28 11:33:51,658 INFO L290 TraceCheckUtils]: 101: Hoare triple {25640#(<= ~counter~0 5)} assume !(0 == ~cond); {25640#(<= ~counter~0 5)} is VALID [2022-04-28 11:33:51,658 INFO L290 TraceCheckUtils]: 102: Hoare triple {25640#(<= ~counter~0 5)} assume true; {25640#(<= ~counter~0 5)} is VALID [2022-04-28 11:33:51,658 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {25640#(<= ~counter~0 5)} {25640#(<= ~counter~0 5)} #81#return; {25640#(<= ~counter~0 5)} is VALID [2022-04-28 11:33:51,658 INFO L290 TraceCheckUtils]: 104: Hoare triple {25640#(<= ~counter~0 5)} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {25640#(<= ~counter~0 5)} is VALID [2022-04-28 11:33:51,659 INFO L290 TraceCheckUtils]: 105: Hoare triple {25640#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {25680#(<= ~counter~0 6)} is VALID [2022-04-28 11:33:51,659 INFO L290 TraceCheckUtils]: 106: Hoare triple {25680#(<= ~counter~0 6)} assume !!(#t~post7 < 20);havoc #t~post7; {25680#(<= ~counter~0 6)} is VALID [2022-04-28 11:33:51,660 INFO L272 TraceCheckUtils]: 107: Hoare triple {25680#(<= ~counter~0 6)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {25680#(<= ~counter~0 6)} is VALID [2022-04-28 11:33:51,660 INFO L290 TraceCheckUtils]: 108: Hoare triple {25680#(<= ~counter~0 6)} ~cond := #in~cond; {25680#(<= ~counter~0 6)} is VALID [2022-04-28 11:33:51,660 INFO L290 TraceCheckUtils]: 109: Hoare triple {25680#(<= ~counter~0 6)} assume !(0 == ~cond); {25680#(<= ~counter~0 6)} is VALID [2022-04-28 11:33:51,660 INFO L290 TraceCheckUtils]: 110: Hoare triple {25680#(<= ~counter~0 6)} assume true; {25680#(<= ~counter~0 6)} is VALID [2022-04-28 11:33:51,661 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {25680#(<= ~counter~0 6)} {25680#(<= ~counter~0 6)} #83#return; {25680#(<= ~counter~0 6)} is VALID [2022-04-28 11:33:51,661 INFO L272 TraceCheckUtils]: 112: Hoare triple {25680#(<= ~counter~0 6)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {25680#(<= ~counter~0 6)} is VALID [2022-04-28 11:33:51,661 INFO L290 TraceCheckUtils]: 113: Hoare triple {25680#(<= ~counter~0 6)} ~cond := #in~cond; {25680#(<= ~counter~0 6)} is VALID [2022-04-28 11:33:51,661 INFO L290 TraceCheckUtils]: 114: Hoare triple {25680#(<= ~counter~0 6)} assume !(0 == ~cond); {25680#(<= ~counter~0 6)} is VALID [2022-04-28 11:33:51,662 INFO L290 TraceCheckUtils]: 115: Hoare triple {25680#(<= ~counter~0 6)} assume true; {25680#(<= ~counter~0 6)} is VALID [2022-04-28 11:33:51,662 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {25680#(<= ~counter~0 6)} {25680#(<= ~counter~0 6)} #85#return; {25680#(<= ~counter~0 6)} is VALID [2022-04-28 11:33:51,662 INFO L272 TraceCheckUtils]: 117: Hoare triple {25680#(<= ~counter~0 6)} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {25680#(<= ~counter~0 6)} is VALID [2022-04-28 11:33:51,663 INFO L290 TraceCheckUtils]: 118: Hoare triple {25680#(<= ~counter~0 6)} ~cond := #in~cond; {25680#(<= ~counter~0 6)} is VALID [2022-04-28 11:33:51,663 INFO L290 TraceCheckUtils]: 119: Hoare triple {25680#(<= ~counter~0 6)} assume !(0 == ~cond); {25680#(<= ~counter~0 6)} is VALID [2022-04-28 11:33:51,663 INFO L290 TraceCheckUtils]: 120: Hoare triple {25680#(<= ~counter~0 6)} assume true; {25680#(<= ~counter~0 6)} is VALID [2022-04-28 11:33:51,663 INFO L284 TraceCheckUtils]: 121: Hoare quadruple {25680#(<= ~counter~0 6)} {25680#(<= ~counter~0 6)} #87#return; {25680#(<= ~counter~0 6)} is VALID [2022-04-28 11:33:51,663 INFO L290 TraceCheckUtils]: 122: Hoare triple {25680#(<= ~counter~0 6)} assume !!(~r~0 >= 2 * ~b~0); {25680#(<= ~counter~0 6)} is VALID [2022-04-28 11:33:51,664 INFO L272 TraceCheckUtils]: 123: Hoare triple {25680#(<= ~counter~0 6)} call __VERIFIER_assert((if ~r~0 >= 2 * ~y~0 * ~a~0 then 1 else 0)); {25680#(<= ~counter~0 6)} is VALID [2022-04-28 11:33:51,664 INFO L290 TraceCheckUtils]: 124: Hoare triple {25680#(<= ~counter~0 6)} ~cond := #in~cond; {25680#(<= ~counter~0 6)} is VALID [2022-04-28 11:33:51,664 INFO L290 TraceCheckUtils]: 125: Hoare triple {25680#(<= ~counter~0 6)} assume !(0 == ~cond); {25680#(<= ~counter~0 6)} is VALID [2022-04-28 11:33:51,664 INFO L290 TraceCheckUtils]: 126: Hoare triple {25680#(<= ~counter~0 6)} assume true; {25680#(<= ~counter~0 6)} is VALID [2022-04-28 11:33:51,665 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {25680#(<= ~counter~0 6)} {25680#(<= ~counter~0 6)} #89#return; {25680#(<= ~counter~0 6)} is VALID [2022-04-28 11:33:51,665 INFO L290 TraceCheckUtils]: 128: Hoare triple {25680#(<= ~counter~0 6)} ~a~0 := 2 * ~a~0;~b~0 := 2 * ~b~0; {25680#(<= ~counter~0 6)} is VALID [2022-04-28 11:33:51,666 INFO L290 TraceCheckUtils]: 129: Hoare triple {25680#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {25753#(<= ~counter~0 7)} is VALID [2022-04-28 11:33:51,666 INFO L290 TraceCheckUtils]: 130: Hoare triple {25753#(<= ~counter~0 7)} assume !!(#t~post7 < 20);havoc #t~post7; {25753#(<= ~counter~0 7)} is VALID [2022-04-28 11:33:51,666 INFO L272 TraceCheckUtils]: 131: Hoare triple {25753#(<= ~counter~0 7)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {25753#(<= ~counter~0 7)} is VALID [2022-04-28 11:33:51,666 INFO L290 TraceCheckUtils]: 132: Hoare triple {25753#(<= ~counter~0 7)} ~cond := #in~cond; {25753#(<= ~counter~0 7)} is VALID [2022-04-28 11:33:51,667 INFO L290 TraceCheckUtils]: 133: Hoare triple {25753#(<= ~counter~0 7)} assume !(0 == ~cond); {25753#(<= ~counter~0 7)} is VALID [2022-04-28 11:33:51,667 INFO L290 TraceCheckUtils]: 134: Hoare triple {25753#(<= ~counter~0 7)} assume true; {25753#(<= ~counter~0 7)} is VALID [2022-04-28 11:33:51,667 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {25753#(<= ~counter~0 7)} {25753#(<= ~counter~0 7)} #83#return; {25753#(<= ~counter~0 7)} is VALID [2022-04-28 11:33:51,667 INFO L272 TraceCheckUtils]: 136: Hoare triple {25753#(<= ~counter~0 7)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {25753#(<= ~counter~0 7)} is VALID [2022-04-28 11:33:51,668 INFO L290 TraceCheckUtils]: 137: Hoare triple {25753#(<= ~counter~0 7)} ~cond := #in~cond; {25753#(<= ~counter~0 7)} is VALID [2022-04-28 11:33:51,668 INFO L290 TraceCheckUtils]: 138: Hoare triple {25753#(<= ~counter~0 7)} assume !(0 == ~cond); {25753#(<= ~counter~0 7)} is VALID [2022-04-28 11:33:51,668 INFO L290 TraceCheckUtils]: 139: Hoare triple {25753#(<= ~counter~0 7)} assume true; {25753#(<= ~counter~0 7)} is VALID [2022-04-28 11:33:51,668 INFO L284 TraceCheckUtils]: 140: Hoare quadruple {25753#(<= ~counter~0 7)} {25753#(<= ~counter~0 7)} #85#return; {25753#(<= ~counter~0 7)} is VALID [2022-04-28 11:33:51,668 INFO L272 TraceCheckUtils]: 141: Hoare triple {25753#(<= ~counter~0 7)} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {25753#(<= ~counter~0 7)} is VALID [2022-04-28 11:33:51,669 INFO L290 TraceCheckUtils]: 142: Hoare triple {25753#(<= ~counter~0 7)} ~cond := #in~cond; {25753#(<= ~counter~0 7)} is VALID [2022-04-28 11:33:51,669 INFO L290 TraceCheckUtils]: 143: Hoare triple {25753#(<= ~counter~0 7)} assume !(0 == ~cond); {25753#(<= ~counter~0 7)} is VALID [2022-04-28 11:33:51,669 INFO L290 TraceCheckUtils]: 144: Hoare triple {25753#(<= ~counter~0 7)} assume true; {25753#(<= ~counter~0 7)} is VALID [2022-04-28 11:33:51,669 INFO L284 TraceCheckUtils]: 145: Hoare quadruple {25753#(<= ~counter~0 7)} {25753#(<= ~counter~0 7)} #87#return; {25753#(<= ~counter~0 7)} is VALID [2022-04-28 11:33:51,669 INFO L290 TraceCheckUtils]: 146: Hoare triple {25753#(<= ~counter~0 7)} assume !(~r~0 >= 2 * ~b~0); {25753#(<= ~counter~0 7)} is VALID [2022-04-28 11:33:51,669 INFO L290 TraceCheckUtils]: 147: Hoare triple {25753#(<= ~counter~0 7)} ~r~0 := ~r~0 - ~b~0;~q~0 := ~q~0 + ~a~0; {25753#(<= ~counter~0 7)} is VALID [2022-04-28 11:33:51,670 INFO L290 TraceCheckUtils]: 148: Hoare triple {25753#(<= ~counter~0 7)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {25811#(<= |main_#t~post6| 7)} is VALID [2022-04-28 11:33:51,670 INFO L290 TraceCheckUtils]: 149: Hoare triple {25811#(<= |main_#t~post6| 7)} assume !(#t~post6 < 20);havoc #t~post6; {25355#false} is VALID [2022-04-28 11:33:51,670 INFO L272 TraceCheckUtils]: 150: Hoare triple {25355#false} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {25355#false} is VALID [2022-04-28 11:33:51,670 INFO L290 TraceCheckUtils]: 151: Hoare triple {25355#false} ~cond := #in~cond; {25355#false} is VALID [2022-04-28 11:33:51,670 INFO L290 TraceCheckUtils]: 152: Hoare triple {25355#false} assume 0 == ~cond; {25355#false} is VALID [2022-04-28 11:33:51,670 INFO L290 TraceCheckUtils]: 153: Hoare triple {25355#false} assume !false; {25355#false} is VALID [2022-04-28 11:33:51,671 INFO L134 CoverageAnalysis]: Checked inductivity of 1044 backedges. 44 proven. 896 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2022-04-28 11:33:51,671 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:33:52,360 INFO L290 TraceCheckUtils]: 153: Hoare triple {25355#false} assume !false; {25355#false} is VALID [2022-04-28 11:33:52,361 INFO L290 TraceCheckUtils]: 152: Hoare triple {25355#false} assume 0 == ~cond; {25355#false} is VALID [2022-04-28 11:33:52,361 INFO L290 TraceCheckUtils]: 151: Hoare triple {25355#false} ~cond := #in~cond; {25355#false} is VALID [2022-04-28 11:33:52,361 INFO L272 TraceCheckUtils]: 150: Hoare triple {25355#false} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {25355#false} is VALID [2022-04-28 11:33:52,361 INFO L290 TraceCheckUtils]: 149: Hoare triple {25839#(< |main_#t~post6| 20)} assume !(#t~post6 < 20);havoc #t~post6; {25355#false} is VALID [2022-04-28 11:33:52,362 INFO L290 TraceCheckUtils]: 148: Hoare triple {25843#(< ~counter~0 20)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {25839#(< |main_#t~post6| 20)} is VALID [2022-04-28 11:33:52,362 INFO L290 TraceCheckUtils]: 147: Hoare triple {25843#(< ~counter~0 20)} ~r~0 := ~r~0 - ~b~0;~q~0 := ~q~0 + ~a~0; {25843#(< ~counter~0 20)} is VALID [2022-04-28 11:33:52,362 INFO L290 TraceCheckUtils]: 146: Hoare triple {25843#(< ~counter~0 20)} assume !(~r~0 >= 2 * ~b~0); {25843#(< ~counter~0 20)} is VALID [2022-04-28 11:33:52,363 INFO L284 TraceCheckUtils]: 145: Hoare quadruple {25354#true} {25843#(< ~counter~0 20)} #87#return; {25843#(< ~counter~0 20)} is VALID [2022-04-28 11:33:52,363 INFO L290 TraceCheckUtils]: 144: Hoare triple {25354#true} assume true; {25354#true} is VALID [2022-04-28 11:33:52,363 INFO L290 TraceCheckUtils]: 143: Hoare triple {25354#true} assume !(0 == ~cond); {25354#true} is VALID [2022-04-28 11:33:52,363 INFO L290 TraceCheckUtils]: 142: Hoare triple {25354#true} ~cond := #in~cond; {25354#true} is VALID [2022-04-28 11:33:52,363 INFO L272 TraceCheckUtils]: 141: Hoare triple {25843#(< ~counter~0 20)} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {25354#true} is VALID [2022-04-28 11:33:52,364 INFO L284 TraceCheckUtils]: 140: Hoare quadruple {25354#true} {25843#(< ~counter~0 20)} #85#return; {25843#(< ~counter~0 20)} is VALID [2022-04-28 11:33:52,364 INFO L290 TraceCheckUtils]: 139: Hoare triple {25354#true} assume true; {25354#true} is VALID [2022-04-28 11:33:52,364 INFO L290 TraceCheckUtils]: 138: Hoare triple {25354#true} assume !(0 == ~cond); {25354#true} is VALID [2022-04-28 11:33:52,364 INFO L290 TraceCheckUtils]: 137: Hoare triple {25354#true} ~cond := #in~cond; {25354#true} is VALID [2022-04-28 11:33:52,364 INFO L272 TraceCheckUtils]: 136: Hoare triple {25843#(< ~counter~0 20)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {25354#true} is VALID [2022-04-28 11:33:52,365 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {25354#true} {25843#(< ~counter~0 20)} #83#return; {25843#(< ~counter~0 20)} is VALID [2022-04-28 11:33:52,365 INFO L290 TraceCheckUtils]: 134: Hoare triple {25354#true} assume true; {25354#true} is VALID [2022-04-28 11:33:52,365 INFO L290 TraceCheckUtils]: 133: Hoare triple {25354#true} assume !(0 == ~cond); {25354#true} is VALID [2022-04-28 11:33:52,365 INFO L290 TraceCheckUtils]: 132: Hoare triple {25354#true} ~cond := #in~cond; {25354#true} is VALID [2022-04-28 11:33:52,365 INFO L272 TraceCheckUtils]: 131: Hoare triple {25843#(< ~counter~0 20)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {25354#true} is VALID [2022-04-28 11:33:52,365 INFO L290 TraceCheckUtils]: 130: Hoare triple {25843#(< ~counter~0 20)} assume !!(#t~post7 < 20);havoc #t~post7; {25843#(< ~counter~0 20)} is VALID [2022-04-28 11:33:52,366 INFO L290 TraceCheckUtils]: 129: Hoare triple {25901#(< ~counter~0 19)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {25843#(< ~counter~0 20)} is VALID [2022-04-28 11:33:52,367 INFO L290 TraceCheckUtils]: 128: Hoare triple {25901#(< ~counter~0 19)} ~a~0 := 2 * ~a~0;~b~0 := 2 * ~b~0; {25901#(< ~counter~0 19)} is VALID [2022-04-28 11:33:52,367 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {25354#true} {25901#(< ~counter~0 19)} #89#return; {25901#(< ~counter~0 19)} is VALID [2022-04-28 11:33:52,367 INFO L290 TraceCheckUtils]: 126: Hoare triple {25354#true} assume true; {25354#true} is VALID [2022-04-28 11:33:52,367 INFO L290 TraceCheckUtils]: 125: Hoare triple {25354#true} assume !(0 == ~cond); {25354#true} is VALID [2022-04-28 11:33:52,367 INFO L290 TraceCheckUtils]: 124: Hoare triple {25354#true} ~cond := #in~cond; {25354#true} is VALID [2022-04-28 11:33:52,367 INFO L272 TraceCheckUtils]: 123: Hoare triple {25901#(< ~counter~0 19)} call __VERIFIER_assert((if ~r~0 >= 2 * ~y~0 * ~a~0 then 1 else 0)); {25354#true} is VALID [2022-04-28 11:33:52,368 INFO L290 TraceCheckUtils]: 122: Hoare triple {25901#(< ~counter~0 19)} assume !!(~r~0 >= 2 * ~b~0); {25901#(< ~counter~0 19)} is VALID [2022-04-28 11:33:52,368 INFO L284 TraceCheckUtils]: 121: Hoare quadruple {25354#true} {25901#(< ~counter~0 19)} #87#return; {25901#(< ~counter~0 19)} is VALID [2022-04-28 11:33:52,368 INFO L290 TraceCheckUtils]: 120: Hoare triple {25354#true} assume true; {25354#true} is VALID [2022-04-28 11:33:52,368 INFO L290 TraceCheckUtils]: 119: Hoare triple {25354#true} assume !(0 == ~cond); {25354#true} is VALID [2022-04-28 11:33:52,368 INFO L290 TraceCheckUtils]: 118: Hoare triple {25354#true} ~cond := #in~cond; {25354#true} is VALID [2022-04-28 11:33:52,368 INFO L272 TraceCheckUtils]: 117: Hoare triple {25901#(< ~counter~0 19)} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {25354#true} is VALID [2022-04-28 11:33:52,369 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {25354#true} {25901#(< ~counter~0 19)} #85#return; {25901#(< ~counter~0 19)} is VALID [2022-04-28 11:33:52,369 INFO L290 TraceCheckUtils]: 115: Hoare triple {25354#true} assume true; {25354#true} is VALID [2022-04-28 11:33:52,369 INFO L290 TraceCheckUtils]: 114: Hoare triple {25354#true} assume !(0 == ~cond); {25354#true} is VALID [2022-04-28 11:33:52,369 INFO L290 TraceCheckUtils]: 113: Hoare triple {25354#true} ~cond := #in~cond; {25354#true} is VALID [2022-04-28 11:33:52,369 INFO L272 TraceCheckUtils]: 112: Hoare triple {25901#(< ~counter~0 19)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {25354#true} is VALID [2022-04-28 11:33:52,370 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {25354#true} {25901#(< ~counter~0 19)} #83#return; {25901#(< ~counter~0 19)} is VALID [2022-04-28 11:33:52,370 INFO L290 TraceCheckUtils]: 110: Hoare triple {25354#true} assume true; {25354#true} is VALID [2022-04-28 11:33:52,370 INFO L290 TraceCheckUtils]: 109: Hoare triple {25354#true} assume !(0 == ~cond); {25354#true} is VALID [2022-04-28 11:33:52,370 INFO L290 TraceCheckUtils]: 108: Hoare triple {25354#true} ~cond := #in~cond; {25354#true} is VALID [2022-04-28 11:33:52,370 INFO L272 TraceCheckUtils]: 107: Hoare triple {25901#(< ~counter~0 19)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {25354#true} is VALID [2022-04-28 11:33:52,370 INFO L290 TraceCheckUtils]: 106: Hoare triple {25901#(< ~counter~0 19)} assume !!(#t~post7 < 20);havoc #t~post7; {25901#(< ~counter~0 19)} is VALID [2022-04-28 11:33:52,371 INFO L290 TraceCheckUtils]: 105: Hoare triple {25974#(< ~counter~0 18)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {25901#(< ~counter~0 19)} is VALID [2022-04-28 11:33:52,371 INFO L290 TraceCheckUtils]: 104: Hoare triple {25974#(< ~counter~0 18)} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {25974#(< ~counter~0 18)} is VALID [2022-04-28 11:33:52,372 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {25354#true} {25974#(< ~counter~0 18)} #81#return; {25974#(< ~counter~0 18)} is VALID [2022-04-28 11:33:52,372 INFO L290 TraceCheckUtils]: 102: Hoare triple {25354#true} assume true; {25354#true} is VALID [2022-04-28 11:33:52,372 INFO L290 TraceCheckUtils]: 101: Hoare triple {25354#true} assume !(0 == ~cond); {25354#true} is VALID [2022-04-28 11:33:52,372 INFO L290 TraceCheckUtils]: 100: Hoare triple {25354#true} ~cond := #in~cond; {25354#true} is VALID [2022-04-28 11:33:52,372 INFO L272 TraceCheckUtils]: 99: Hoare triple {25974#(< ~counter~0 18)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {25354#true} is VALID [2022-04-28 11:33:52,372 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {25354#true} {25974#(< ~counter~0 18)} #79#return; {25974#(< ~counter~0 18)} is VALID [2022-04-28 11:33:52,372 INFO L290 TraceCheckUtils]: 97: Hoare triple {25354#true} assume true; {25354#true} is VALID [2022-04-28 11:33:52,373 INFO L290 TraceCheckUtils]: 96: Hoare triple {25354#true} assume !(0 == ~cond); {25354#true} is VALID [2022-04-28 11:33:52,373 INFO L290 TraceCheckUtils]: 95: Hoare triple {25354#true} ~cond := #in~cond; {25354#true} is VALID [2022-04-28 11:33:52,373 INFO L272 TraceCheckUtils]: 94: Hoare triple {25974#(< ~counter~0 18)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {25354#true} is VALID [2022-04-28 11:33:52,373 INFO L290 TraceCheckUtils]: 93: Hoare triple {25974#(< ~counter~0 18)} assume !!(#t~post6 < 20);havoc #t~post6; {25974#(< ~counter~0 18)} is VALID [2022-04-28 11:33:52,374 INFO L290 TraceCheckUtils]: 92: Hoare triple {26014#(< ~counter~0 17)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {25974#(< ~counter~0 18)} is VALID [2022-04-28 11:33:52,374 INFO L290 TraceCheckUtils]: 91: Hoare triple {26014#(< ~counter~0 17)} ~r~0 := ~r~0 - ~b~0;~q~0 := ~q~0 + ~a~0; {26014#(< ~counter~0 17)} is VALID [2022-04-28 11:33:52,374 INFO L290 TraceCheckUtils]: 90: Hoare triple {26014#(< ~counter~0 17)} assume !(~r~0 >= 2 * ~b~0); {26014#(< ~counter~0 17)} is VALID [2022-04-28 11:33:52,375 INFO L284 TraceCheckUtils]: 89: Hoare quadruple {25354#true} {26014#(< ~counter~0 17)} #87#return; {26014#(< ~counter~0 17)} is VALID [2022-04-28 11:33:52,375 INFO L290 TraceCheckUtils]: 88: Hoare triple {25354#true} assume true; {25354#true} is VALID [2022-04-28 11:33:52,375 INFO L290 TraceCheckUtils]: 87: Hoare triple {25354#true} assume !(0 == ~cond); {25354#true} is VALID [2022-04-28 11:33:52,375 INFO L290 TraceCheckUtils]: 86: Hoare triple {25354#true} ~cond := #in~cond; {25354#true} is VALID [2022-04-28 11:33:52,375 INFO L272 TraceCheckUtils]: 85: Hoare triple {26014#(< ~counter~0 17)} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {25354#true} is VALID [2022-04-28 11:33:52,375 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {25354#true} {26014#(< ~counter~0 17)} #85#return; {26014#(< ~counter~0 17)} is VALID [2022-04-28 11:33:52,375 INFO L290 TraceCheckUtils]: 83: Hoare triple {25354#true} assume true; {25354#true} is VALID [2022-04-28 11:33:52,375 INFO L290 TraceCheckUtils]: 82: Hoare triple {25354#true} assume !(0 == ~cond); {25354#true} is VALID [2022-04-28 11:33:52,375 INFO L290 TraceCheckUtils]: 81: Hoare triple {25354#true} ~cond := #in~cond; {25354#true} is VALID [2022-04-28 11:33:52,376 INFO L272 TraceCheckUtils]: 80: Hoare triple {26014#(< ~counter~0 17)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {25354#true} is VALID [2022-04-28 11:33:52,376 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {25354#true} {26014#(< ~counter~0 17)} #83#return; {26014#(< ~counter~0 17)} is VALID [2022-04-28 11:33:52,376 INFO L290 TraceCheckUtils]: 78: Hoare triple {25354#true} assume true; {25354#true} is VALID [2022-04-28 11:33:52,376 INFO L290 TraceCheckUtils]: 77: Hoare triple {25354#true} assume !(0 == ~cond); {25354#true} is VALID [2022-04-28 11:33:52,376 INFO L290 TraceCheckUtils]: 76: Hoare triple {25354#true} ~cond := #in~cond; {25354#true} is VALID [2022-04-28 11:33:52,376 INFO L272 TraceCheckUtils]: 75: Hoare triple {26014#(< ~counter~0 17)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {25354#true} is VALID [2022-04-28 11:33:52,376 INFO L290 TraceCheckUtils]: 74: Hoare triple {26014#(< ~counter~0 17)} assume !!(#t~post7 < 20);havoc #t~post7; {26014#(< ~counter~0 17)} is VALID [2022-04-28 11:33:52,377 INFO L290 TraceCheckUtils]: 73: Hoare triple {26072#(< ~counter~0 16)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {26014#(< ~counter~0 17)} is VALID [2022-04-28 11:33:52,377 INFO L290 TraceCheckUtils]: 72: Hoare triple {26072#(< ~counter~0 16)} ~a~0 := 2 * ~a~0;~b~0 := 2 * ~b~0; {26072#(< ~counter~0 16)} is VALID [2022-04-28 11:33:52,378 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {25354#true} {26072#(< ~counter~0 16)} #89#return; {26072#(< ~counter~0 16)} is VALID [2022-04-28 11:33:52,378 INFO L290 TraceCheckUtils]: 70: Hoare triple {25354#true} assume true; {25354#true} is VALID [2022-04-28 11:33:52,378 INFO L290 TraceCheckUtils]: 69: Hoare triple {25354#true} assume !(0 == ~cond); {25354#true} is VALID [2022-04-28 11:33:52,378 INFO L290 TraceCheckUtils]: 68: Hoare triple {25354#true} ~cond := #in~cond; {25354#true} is VALID [2022-04-28 11:33:52,378 INFO L272 TraceCheckUtils]: 67: Hoare triple {26072#(< ~counter~0 16)} call __VERIFIER_assert((if ~r~0 >= 2 * ~y~0 * ~a~0 then 1 else 0)); {25354#true} is VALID [2022-04-28 11:33:52,378 INFO L290 TraceCheckUtils]: 66: Hoare triple {26072#(< ~counter~0 16)} assume !!(~r~0 >= 2 * ~b~0); {26072#(< ~counter~0 16)} is VALID [2022-04-28 11:33:52,379 INFO L284 TraceCheckUtils]: 65: Hoare quadruple {25354#true} {26072#(< ~counter~0 16)} #87#return; {26072#(< ~counter~0 16)} is VALID [2022-04-28 11:33:52,379 INFO L290 TraceCheckUtils]: 64: Hoare triple {25354#true} assume true; {25354#true} is VALID [2022-04-28 11:33:52,379 INFO L290 TraceCheckUtils]: 63: Hoare triple {25354#true} assume !(0 == ~cond); {25354#true} is VALID [2022-04-28 11:33:52,379 INFO L290 TraceCheckUtils]: 62: Hoare triple {25354#true} ~cond := #in~cond; {25354#true} is VALID [2022-04-28 11:33:52,379 INFO L272 TraceCheckUtils]: 61: Hoare triple {26072#(< ~counter~0 16)} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {25354#true} is VALID [2022-04-28 11:33:52,380 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {25354#true} {26072#(< ~counter~0 16)} #85#return; {26072#(< ~counter~0 16)} is VALID [2022-04-28 11:33:52,380 INFO L290 TraceCheckUtils]: 59: Hoare triple {25354#true} assume true; {25354#true} is VALID [2022-04-28 11:33:52,380 INFO L290 TraceCheckUtils]: 58: Hoare triple {25354#true} assume !(0 == ~cond); {25354#true} is VALID [2022-04-28 11:33:52,380 INFO L290 TraceCheckUtils]: 57: Hoare triple {25354#true} ~cond := #in~cond; {25354#true} is VALID [2022-04-28 11:33:52,380 INFO L272 TraceCheckUtils]: 56: Hoare triple {26072#(< ~counter~0 16)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {25354#true} is VALID [2022-04-28 11:33:52,381 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {25354#true} {26072#(< ~counter~0 16)} #83#return; {26072#(< ~counter~0 16)} is VALID [2022-04-28 11:33:52,381 INFO L290 TraceCheckUtils]: 54: Hoare triple {25354#true} assume true; {25354#true} is VALID [2022-04-28 11:33:52,381 INFO L290 TraceCheckUtils]: 53: Hoare triple {25354#true} assume !(0 == ~cond); {25354#true} is VALID [2022-04-28 11:33:52,381 INFO L290 TraceCheckUtils]: 52: Hoare triple {25354#true} ~cond := #in~cond; {25354#true} is VALID [2022-04-28 11:33:52,381 INFO L272 TraceCheckUtils]: 51: Hoare triple {26072#(< ~counter~0 16)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {25354#true} is VALID [2022-04-28 11:33:52,381 INFO L290 TraceCheckUtils]: 50: Hoare triple {26072#(< ~counter~0 16)} assume !!(#t~post7 < 20);havoc #t~post7; {26072#(< ~counter~0 16)} is VALID [2022-04-28 11:33:52,382 INFO L290 TraceCheckUtils]: 49: Hoare triple {26145#(< ~counter~0 15)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {26072#(< ~counter~0 16)} is VALID [2022-04-28 11:33:52,382 INFO L290 TraceCheckUtils]: 48: Hoare triple {26145#(< ~counter~0 15)} ~a~0 := 2 * ~a~0;~b~0 := 2 * ~b~0; {26145#(< ~counter~0 15)} is VALID [2022-04-28 11:33:52,383 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {25354#true} {26145#(< ~counter~0 15)} #89#return; {26145#(< ~counter~0 15)} is VALID [2022-04-28 11:33:52,383 INFO L290 TraceCheckUtils]: 46: Hoare triple {25354#true} assume true; {25354#true} is VALID [2022-04-28 11:33:52,383 INFO L290 TraceCheckUtils]: 45: Hoare triple {25354#true} assume !(0 == ~cond); {25354#true} is VALID [2022-04-28 11:33:52,383 INFO L290 TraceCheckUtils]: 44: Hoare triple {25354#true} ~cond := #in~cond; {25354#true} is VALID [2022-04-28 11:33:52,383 INFO L272 TraceCheckUtils]: 43: Hoare triple {26145#(< ~counter~0 15)} call __VERIFIER_assert((if ~r~0 >= 2 * ~y~0 * ~a~0 then 1 else 0)); {25354#true} is VALID [2022-04-28 11:33:52,383 INFO L290 TraceCheckUtils]: 42: Hoare triple {26145#(< ~counter~0 15)} assume !!(~r~0 >= 2 * ~b~0); {26145#(< ~counter~0 15)} is VALID [2022-04-28 11:33:52,384 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {25354#true} {26145#(< ~counter~0 15)} #87#return; {26145#(< ~counter~0 15)} is VALID [2022-04-28 11:33:52,384 INFO L290 TraceCheckUtils]: 40: Hoare triple {25354#true} assume true; {25354#true} is VALID [2022-04-28 11:33:52,384 INFO L290 TraceCheckUtils]: 39: Hoare triple {25354#true} assume !(0 == ~cond); {25354#true} is VALID [2022-04-28 11:33:52,384 INFO L290 TraceCheckUtils]: 38: Hoare triple {25354#true} ~cond := #in~cond; {25354#true} is VALID [2022-04-28 11:33:52,384 INFO L272 TraceCheckUtils]: 37: Hoare triple {26145#(< ~counter~0 15)} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {25354#true} is VALID [2022-04-28 11:33:52,384 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {25354#true} {26145#(< ~counter~0 15)} #85#return; {26145#(< ~counter~0 15)} is VALID [2022-04-28 11:33:52,385 INFO L290 TraceCheckUtils]: 35: Hoare triple {25354#true} assume true; {25354#true} is VALID [2022-04-28 11:33:52,385 INFO L290 TraceCheckUtils]: 34: Hoare triple {25354#true} assume !(0 == ~cond); {25354#true} is VALID [2022-04-28 11:33:52,385 INFO L290 TraceCheckUtils]: 33: Hoare triple {25354#true} ~cond := #in~cond; {25354#true} is VALID [2022-04-28 11:33:52,385 INFO L272 TraceCheckUtils]: 32: Hoare triple {26145#(< ~counter~0 15)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {25354#true} is VALID [2022-04-28 11:33:52,385 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {25354#true} {26145#(< ~counter~0 15)} #83#return; {26145#(< ~counter~0 15)} is VALID [2022-04-28 11:33:52,385 INFO L290 TraceCheckUtils]: 30: Hoare triple {25354#true} assume true; {25354#true} is VALID [2022-04-28 11:33:52,385 INFO L290 TraceCheckUtils]: 29: Hoare triple {25354#true} assume !(0 == ~cond); {25354#true} is VALID [2022-04-28 11:33:52,385 INFO L290 TraceCheckUtils]: 28: Hoare triple {25354#true} ~cond := #in~cond; {25354#true} is VALID [2022-04-28 11:33:52,385 INFO L272 TraceCheckUtils]: 27: Hoare triple {26145#(< ~counter~0 15)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {25354#true} is VALID [2022-04-28 11:33:52,386 INFO L290 TraceCheckUtils]: 26: Hoare triple {26145#(< ~counter~0 15)} assume !!(#t~post7 < 20);havoc #t~post7; {26145#(< ~counter~0 15)} is VALID [2022-04-28 11:33:52,387 INFO L290 TraceCheckUtils]: 25: Hoare triple {26218#(< ~counter~0 14)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {26145#(< ~counter~0 15)} is VALID [2022-04-28 11:33:52,387 INFO L290 TraceCheckUtils]: 24: Hoare triple {26218#(< ~counter~0 14)} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {26218#(< ~counter~0 14)} is VALID [2022-04-28 11:33:52,387 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {25354#true} {26218#(< ~counter~0 14)} #81#return; {26218#(< ~counter~0 14)} is VALID [2022-04-28 11:33:52,387 INFO L290 TraceCheckUtils]: 22: Hoare triple {25354#true} assume true; {25354#true} is VALID [2022-04-28 11:33:52,388 INFO L290 TraceCheckUtils]: 21: Hoare triple {25354#true} assume !(0 == ~cond); {25354#true} is VALID [2022-04-28 11:33:52,388 INFO L290 TraceCheckUtils]: 20: Hoare triple {25354#true} ~cond := #in~cond; {25354#true} is VALID [2022-04-28 11:33:52,388 INFO L272 TraceCheckUtils]: 19: Hoare triple {26218#(< ~counter~0 14)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {25354#true} is VALID [2022-04-28 11:33:52,388 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {25354#true} {26218#(< ~counter~0 14)} #79#return; {26218#(< ~counter~0 14)} is VALID [2022-04-28 11:33:52,388 INFO L290 TraceCheckUtils]: 17: Hoare triple {25354#true} assume true; {25354#true} is VALID [2022-04-28 11:33:52,388 INFO L290 TraceCheckUtils]: 16: Hoare triple {25354#true} assume !(0 == ~cond); {25354#true} is VALID [2022-04-28 11:33:52,388 INFO L290 TraceCheckUtils]: 15: Hoare triple {25354#true} ~cond := #in~cond; {25354#true} is VALID [2022-04-28 11:33:52,388 INFO L272 TraceCheckUtils]: 14: Hoare triple {26218#(< ~counter~0 14)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {25354#true} is VALID [2022-04-28 11:33:52,389 INFO L290 TraceCheckUtils]: 13: Hoare triple {26218#(< ~counter~0 14)} assume !!(#t~post6 < 20);havoc #t~post6; {26218#(< ~counter~0 14)} is VALID [2022-04-28 11:33:52,389 INFO L290 TraceCheckUtils]: 12: Hoare triple {26258#(< ~counter~0 13)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {26218#(< ~counter~0 14)} is VALID [2022-04-28 11:33:52,390 INFO L290 TraceCheckUtils]: 11: Hoare triple {26258#(< ~counter~0 13)} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {26258#(< ~counter~0 13)} is VALID [2022-04-28 11:33:52,390 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {25354#true} {26258#(< ~counter~0 13)} #77#return; {26258#(< ~counter~0 13)} is VALID [2022-04-28 11:33:52,390 INFO L290 TraceCheckUtils]: 9: Hoare triple {25354#true} assume true; {25354#true} is VALID [2022-04-28 11:33:52,390 INFO L290 TraceCheckUtils]: 8: Hoare triple {25354#true} assume !(0 == ~cond); {25354#true} is VALID [2022-04-28 11:33:52,390 INFO L290 TraceCheckUtils]: 7: Hoare triple {25354#true} ~cond := #in~cond; {25354#true} is VALID [2022-04-28 11:33:52,390 INFO L272 TraceCheckUtils]: 6: Hoare triple {26258#(< ~counter~0 13)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {25354#true} is VALID [2022-04-28 11:33:52,390 INFO L290 TraceCheckUtils]: 5: Hoare triple {26258#(< ~counter~0 13)} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~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; {26258#(< ~counter~0 13)} is VALID [2022-04-28 11:33:52,391 INFO L272 TraceCheckUtils]: 4: Hoare triple {26258#(< ~counter~0 13)} call #t~ret8 := main(); {26258#(< ~counter~0 13)} is VALID [2022-04-28 11:33:52,391 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26258#(< ~counter~0 13)} {25354#true} #93#return; {26258#(< ~counter~0 13)} is VALID [2022-04-28 11:33:52,391 INFO L290 TraceCheckUtils]: 2: Hoare triple {26258#(< ~counter~0 13)} assume true; {26258#(< ~counter~0 13)} is VALID [2022-04-28 11:33:52,392 INFO L290 TraceCheckUtils]: 1: Hoare triple {25354#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(14, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {26258#(< ~counter~0 13)} is VALID [2022-04-28 11:33:52,392 INFO L272 TraceCheckUtils]: 0: Hoare triple {25354#true} call ULTIMATE.init(); {25354#true} is VALID [2022-04-28 11:33:52,392 INFO L134 CoverageAnalysis]: Checked inductivity of 1044 backedges. 44 proven. 76 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2022-04-28 11:33:52,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:33:52,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268475843] [2022-04-28 11:33:52,393 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:33:52,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [612609014] [2022-04-28 11:33:52,393 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [612609014] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 11:33:52,393 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 11:33:52,393 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2022-04-28 11:33:52,393 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:33:52,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [818966833] [2022-04-28 11:33:52,393 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [818966833] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:33:52,393 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:33:52,393 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 11:33:52,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858766557] [2022-04-28 11:33:52,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:33:52,394 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 10 states have internal predecessors, (59), 10 states have call successors, (26), 10 states have call predecessors, (26), 8 states have return successors, (24), 8 states have call predecessors, (24), 9 states have call successors, (24) Word has length 154 [2022-04-28 11:33:52,394 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:33:52,394 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 10 states have internal predecessors, (59), 10 states have call successors, (26), 10 states have call predecessors, (26), 8 states have return successors, (24), 8 states have call predecessors, (24), 9 states have call successors, (24) [2022-04-28 11:33:52,489 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:33:52,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 11:33:52,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:33:52,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 11:33:52,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=222, Unknown=0, NotChecked=0, Total=380 [2022-04-28 11:33:52,490 INFO L87 Difference]: Start difference. First operand 291 states and 331 transitions. Second operand has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 10 states have internal predecessors, (59), 10 states have call successors, (26), 10 states have call predecessors, (26), 8 states have return successors, (24), 8 states have call predecessors, (24), 9 states have call successors, (24) [2022-04-28 11:33:53,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:33:53,877 INFO L93 Difference]: Finished difference Result 366 states and 417 transitions. [2022-04-28 11:33:53,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-28 11:33:53,877 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 10 states have internal predecessors, (59), 10 states have call successors, (26), 10 states have call predecessors, (26), 8 states have return successors, (24), 8 states have call predecessors, (24), 9 states have call successors, (24) Word has length 154 [2022-04-28 11:33:53,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:33:53,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 10 states have internal predecessors, (59), 10 states have call successors, (26), 10 states have call predecessors, (26), 8 states have return successors, (24), 8 states have call predecessors, (24), 9 states have call successors, (24) [2022-04-28 11:33:53,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 181 transitions. [2022-04-28 11:33:53,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 10 states have internal predecessors, (59), 10 states have call successors, (26), 10 states have call predecessors, (26), 8 states have return successors, (24), 8 states have call predecessors, (24), 9 states have call successors, (24) [2022-04-28 11:33:53,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 181 transitions. [2022-04-28 11:33:53,882 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 181 transitions. [2022-04-28 11:33:54,060 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 181 edges. 181 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:33:54,070 INFO L225 Difference]: With dead ends: 366 [2022-04-28 11:33:54,070 INFO L226 Difference]: Without dead ends: 359 [2022-04-28 11:33:54,070 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 311 GetRequests, 289 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=225, Invalid=327, Unknown=0, NotChecked=0, Total=552 [2022-04-28 11:33:54,071 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 76 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 11:33:54,071 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 240 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 11:33:54,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2022-04-28 11:33:54,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 348. [2022-04-28 11:33:54,684 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:33:54,685 INFO L82 GeneralOperation]: Start isEquivalent. First operand 359 states. Second operand has 348 states, 226 states have (on average 1.092920353982301) internal successors, (247), 231 states have internal predecessors, (247), 77 states have call successors, (77), 46 states have call predecessors, (77), 44 states have return successors, (74), 70 states have call predecessors, (74), 74 states have call successors, (74) [2022-04-28 11:33:54,685 INFO L74 IsIncluded]: Start isIncluded. First operand 359 states. Second operand has 348 states, 226 states have (on average 1.092920353982301) internal successors, (247), 231 states have internal predecessors, (247), 77 states have call successors, (77), 46 states have call predecessors, (77), 44 states have return successors, (74), 70 states have call predecessors, (74), 74 states have call successors, (74) [2022-04-28 11:33:54,686 INFO L87 Difference]: Start difference. First operand 359 states. Second operand has 348 states, 226 states have (on average 1.092920353982301) internal successors, (247), 231 states have internal predecessors, (247), 77 states have call successors, (77), 46 states have call predecessors, (77), 44 states have return successors, (74), 70 states have call predecessors, (74), 74 states have call successors, (74) [2022-04-28 11:33:54,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:33:54,694 INFO L93 Difference]: Finished difference Result 359 states and 409 transitions. [2022-04-28 11:33:54,694 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 409 transitions. [2022-04-28 11:33:54,695 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:33:54,695 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:33:54,696 INFO L74 IsIncluded]: Start isIncluded. First operand has 348 states, 226 states have (on average 1.092920353982301) internal successors, (247), 231 states have internal predecessors, (247), 77 states have call successors, (77), 46 states have call predecessors, (77), 44 states have return successors, (74), 70 states have call predecessors, (74), 74 states have call successors, (74) Second operand 359 states. [2022-04-28 11:33:54,697 INFO L87 Difference]: Start difference. First operand has 348 states, 226 states have (on average 1.092920353982301) internal successors, (247), 231 states have internal predecessors, (247), 77 states have call successors, (77), 46 states have call predecessors, (77), 44 states have return successors, (74), 70 states have call predecessors, (74), 74 states have call successors, (74) Second operand 359 states. [2022-04-28 11:33:54,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:33:54,706 INFO L93 Difference]: Finished difference Result 359 states and 409 transitions. [2022-04-28 11:33:54,706 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 409 transitions. [2022-04-28 11:33:54,706 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:33:54,707 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:33:54,707 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:33:54,707 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:33:54,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 348 states, 226 states have (on average 1.092920353982301) internal successors, (247), 231 states have internal predecessors, (247), 77 states have call successors, (77), 46 states have call predecessors, (77), 44 states have return successors, (74), 70 states have call predecessors, (74), 74 states have call successors, (74) [2022-04-28 11:33:54,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 398 transitions. [2022-04-28 11:33:54,715 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 398 transitions. Word has length 154 [2022-04-28 11:33:54,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:33:54,715 INFO L495 AbstractCegarLoop]: Abstraction has 348 states and 398 transitions. [2022-04-28 11:33:54,716 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 10 states have internal predecessors, (59), 10 states have call successors, (26), 10 states have call predecessors, (26), 8 states have return successors, (24), 8 states have call predecessors, (24), 9 states have call successors, (24) [2022-04-28 11:33:54,716 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 348 states and 398 transitions. [2022-04-28 11:33:55,424 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 398 edges. 398 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:33:55,424 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 398 transitions. [2022-04-28 11:33:55,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2022-04-28 11:33:55,425 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:33:55,425 INFO L195 NwaCegarLoop]: trace histogram [24, 23, 23, 5, 5, 5, 5, 5, 5, 5, 5, 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] [2022-04-28 11:33:55,444 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2022-04-28 11:33:55,625 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-04-28 11:33:55,626 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:33:55,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:33:55,626 INFO L85 PathProgramCache]: Analyzing trace with hash -1775621107, now seen corresponding path program 3 times [2022-04-28 11:33:55,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:33:55,626 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [652614119] [2022-04-28 11:34:33,548 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:34:33,548 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:34:33,549 INFO L85 PathProgramCache]: Analyzing trace with hash -1775621107, now seen corresponding path program 4 times [2022-04-28 11:34:33,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:34:33,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039229431] [2022-04-28 11:34:33,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:34:33,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:34:33,562 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:34:33,562 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1386542122] [2022-04-28 11:34:33,562 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 11:34:33,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:34:33,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:34:33,574 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 11:34:33,574 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-04-28 11:34:33,656 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 11:34:33,656 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:34:33,658 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 51 conjunts are in the unsatisfiable core [2022-04-28 11:34:33,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:34:33,688 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:35:12,189 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 11:35:12,948 INFO L272 TraceCheckUtils]: 0: Hoare triple {28451#true} call ULTIMATE.init(); {28451#true} is VALID [2022-04-28 11:35:12,948 INFO L290 TraceCheckUtils]: 1: Hoare triple {28451#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(14, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {28451#true} is VALID [2022-04-28 11:35:12,948 INFO L290 TraceCheckUtils]: 2: Hoare triple {28451#true} assume true; {28451#true} is VALID [2022-04-28 11:35:12,948 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28451#true} {28451#true} #93#return; {28451#true} is VALID [2022-04-28 11:35:12,949 INFO L272 TraceCheckUtils]: 4: Hoare triple {28451#true} call #t~ret8 := main(); {28451#true} is VALID [2022-04-28 11:35:12,949 INFO L290 TraceCheckUtils]: 5: Hoare triple {28451#true} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~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; {28451#true} is VALID [2022-04-28 11:35:12,949 INFO L272 TraceCheckUtils]: 6: Hoare triple {28451#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {28451#true} is VALID [2022-04-28 11:35:12,949 INFO L290 TraceCheckUtils]: 7: Hoare triple {28451#true} ~cond := #in~cond; {28451#true} is VALID [2022-04-28 11:35:12,949 INFO L290 TraceCheckUtils]: 8: Hoare triple {28451#true} assume !(0 == ~cond); {28451#true} is VALID [2022-04-28 11:35:12,949 INFO L290 TraceCheckUtils]: 9: Hoare triple {28451#true} assume true; {28451#true} is VALID [2022-04-28 11:35:12,949 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {28451#true} {28451#true} #77#return; {28451#true} is VALID [2022-04-28 11:35:12,949 INFO L290 TraceCheckUtils]: 11: Hoare triple {28451#true} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {28489#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:35:12,950 INFO L290 TraceCheckUtils]: 12: Hoare triple {28489#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {28489#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:35:12,950 INFO L290 TraceCheckUtils]: 13: Hoare triple {28489#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} assume !!(#t~post6 < 20);havoc #t~post6; {28489#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:35:12,950 INFO L272 TraceCheckUtils]: 14: Hoare triple {28489#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {28451#true} is VALID [2022-04-28 11:35:12,950 INFO L290 TraceCheckUtils]: 15: Hoare triple {28451#true} ~cond := #in~cond; {28451#true} is VALID [2022-04-28 11:35:12,950 INFO L290 TraceCheckUtils]: 16: Hoare triple {28451#true} assume !(0 == ~cond); {28451#true} is VALID [2022-04-28 11:35:12,950 INFO L290 TraceCheckUtils]: 17: Hoare triple {28451#true} assume true; {28451#true} is VALID [2022-04-28 11:35:12,951 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {28451#true} {28489#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #79#return; {28489#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:35:12,951 INFO L272 TraceCheckUtils]: 19: Hoare triple {28489#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {28451#true} is VALID [2022-04-28 11:35:12,951 INFO L290 TraceCheckUtils]: 20: Hoare triple {28451#true} ~cond := #in~cond; {28451#true} is VALID [2022-04-28 11:35:12,951 INFO L290 TraceCheckUtils]: 21: Hoare triple {28451#true} assume !(0 == ~cond); {28451#true} is VALID [2022-04-28 11:35:12,951 INFO L290 TraceCheckUtils]: 22: Hoare triple {28451#true} assume true; {28451#true} is VALID [2022-04-28 11:35:12,951 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {28451#true} {28489#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #81#return; {28489#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:35:12,952 INFO L290 TraceCheckUtils]: 24: Hoare triple {28489#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {28529#(and (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-28 11:35:12,952 INFO L290 TraceCheckUtils]: 25: Hoare triple {28529#(and (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {28529#(and (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-28 11:35:12,952 INFO L290 TraceCheckUtils]: 26: Hoare triple {28529#(and (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} assume !!(#t~post7 < 20);havoc #t~post7; {28529#(and (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-28 11:35:12,952 INFO L272 TraceCheckUtils]: 27: Hoare triple {28529#(and (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {28451#true} is VALID [2022-04-28 11:35:12,953 INFO L290 TraceCheckUtils]: 28: Hoare triple {28451#true} ~cond := #in~cond; {28451#true} is VALID [2022-04-28 11:35:12,953 INFO L290 TraceCheckUtils]: 29: Hoare triple {28451#true} assume !(0 == ~cond); {28451#true} is VALID [2022-04-28 11:35:12,953 INFO L290 TraceCheckUtils]: 30: Hoare triple {28451#true} assume true; {28451#true} is VALID [2022-04-28 11:35:12,953 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {28451#true} {28529#(and (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #83#return; {28529#(and (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-28 11:35:12,953 INFO L272 TraceCheckUtils]: 32: Hoare triple {28529#(and (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {28451#true} is VALID [2022-04-28 11:35:12,953 INFO L290 TraceCheckUtils]: 33: Hoare triple {28451#true} ~cond := #in~cond; {28451#true} is VALID [2022-04-28 11:35:12,953 INFO L290 TraceCheckUtils]: 34: Hoare triple {28451#true} assume !(0 == ~cond); {28451#true} is VALID [2022-04-28 11:35:12,953 INFO L290 TraceCheckUtils]: 35: Hoare triple {28451#true} assume true; {28451#true} is VALID [2022-04-28 11:35:12,954 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {28451#true} {28529#(and (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #85#return; {28529#(and (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-28 11:35:12,954 INFO L272 TraceCheckUtils]: 37: Hoare triple {28529#(and (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {28451#true} is VALID [2022-04-28 11:35:12,954 INFO L290 TraceCheckUtils]: 38: Hoare triple {28451#true} ~cond := #in~cond; {28451#true} is VALID [2022-04-28 11:35:12,954 INFO L290 TraceCheckUtils]: 39: Hoare triple {28451#true} assume !(0 == ~cond); {28451#true} is VALID [2022-04-28 11:35:12,954 INFO L290 TraceCheckUtils]: 40: Hoare triple {28451#true} assume true; {28451#true} is VALID [2022-04-28 11:35:12,955 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {28451#true} {28529#(and (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #87#return; {28529#(and (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-28 11:35:12,955 INFO L290 TraceCheckUtils]: 42: Hoare triple {28529#(and (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} assume !!(~r~0 >= 2 * ~b~0); {28529#(and (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-28 11:35:12,955 INFO L272 TraceCheckUtils]: 43: Hoare triple {28529#(and (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~r~0 >= 2 * ~y~0 * ~a~0 then 1 else 0)); {28451#true} is VALID [2022-04-28 11:35:12,955 INFO L290 TraceCheckUtils]: 44: Hoare triple {28451#true} ~cond := #in~cond; {28451#true} is VALID [2022-04-28 11:35:12,955 INFO L290 TraceCheckUtils]: 45: Hoare triple {28451#true} assume !(0 == ~cond); {28451#true} is VALID [2022-04-28 11:35:12,955 INFO L290 TraceCheckUtils]: 46: Hoare triple {28451#true} assume true; {28451#true} is VALID [2022-04-28 11:35:12,956 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {28451#true} {28529#(and (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #89#return; {28529#(and (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-28 11:35:12,957 INFO L290 TraceCheckUtils]: 48: Hoare triple {28529#(and (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} ~a~0 := 2 * ~a~0;~b~0 := 2 * ~b~0; {28602#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (= main_~q~0 0))} is VALID [2022-04-28 11:35:12,957 INFO L290 TraceCheckUtils]: 49: Hoare triple {28602#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (= main_~q~0 0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {28602#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (= main_~q~0 0))} is VALID [2022-04-28 11:35:12,958 INFO L290 TraceCheckUtils]: 50: Hoare triple {28602#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (= main_~q~0 0))} assume !!(#t~post7 < 20);havoc #t~post7; {28602#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (= main_~q~0 0))} is VALID [2022-04-28 11:35:12,958 INFO L272 TraceCheckUtils]: 51: Hoare triple {28602#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (= main_~q~0 0))} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {28451#true} is VALID [2022-04-28 11:35:12,958 INFO L290 TraceCheckUtils]: 52: Hoare triple {28451#true} ~cond := #in~cond; {28615#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:35:12,958 INFO L290 TraceCheckUtils]: 53: Hoare triple {28615#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {28619#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:35:12,958 INFO L290 TraceCheckUtils]: 54: Hoare triple {28619#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {28619#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:35:12,959 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {28619#(not (= |__VERIFIER_assert_#in~cond| 0))} {28602#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (= main_~q~0 0))} #83#return; {28626#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (= main_~q~0 0) (= main_~b~0 (* main_~a~0 main_~y~0)))} is VALID [2022-04-28 11:35:12,959 INFO L272 TraceCheckUtils]: 56: Hoare triple {28626#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (= main_~q~0 0) (= main_~b~0 (* main_~a~0 main_~y~0)))} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {28451#true} is VALID [2022-04-28 11:35:12,959 INFO L290 TraceCheckUtils]: 57: Hoare triple {28451#true} ~cond := #in~cond; {28451#true} is VALID [2022-04-28 11:35:12,959 INFO L290 TraceCheckUtils]: 58: Hoare triple {28451#true} assume !(0 == ~cond); {28451#true} is VALID [2022-04-28 11:35:12,959 INFO L290 TraceCheckUtils]: 59: Hoare triple {28451#true} assume true; {28451#true} is VALID [2022-04-28 11:35:12,960 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {28451#true} {28626#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (= main_~q~0 0) (= main_~b~0 (* main_~a~0 main_~y~0)))} #85#return; {28626#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (= main_~q~0 0) (= main_~b~0 (* main_~a~0 main_~y~0)))} is VALID [2022-04-28 11:35:12,960 INFO L272 TraceCheckUtils]: 61: Hoare triple {28626#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (= main_~q~0 0) (= main_~b~0 (* main_~a~0 main_~y~0)))} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {28451#true} is VALID [2022-04-28 11:35:12,960 INFO L290 TraceCheckUtils]: 62: Hoare triple {28451#true} ~cond := #in~cond; {28451#true} is VALID [2022-04-28 11:35:12,960 INFO L290 TraceCheckUtils]: 63: Hoare triple {28451#true} assume !(0 == ~cond); {28451#true} is VALID [2022-04-28 11:35:12,960 INFO L290 TraceCheckUtils]: 64: Hoare triple {28451#true} assume true; {28451#true} is VALID [2022-04-28 11:35:12,961 INFO L284 TraceCheckUtils]: 65: Hoare quadruple {28451#true} {28626#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (= main_~q~0 0) (= main_~b~0 (* main_~a~0 main_~y~0)))} #87#return; {28626#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (= main_~q~0 0) (= main_~b~0 (* main_~a~0 main_~y~0)))} is VALID [2022-04-28 11:35:12,961 INFO L290 TraceCheckUtils]: 66: Hoare triple {28626#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (= main_~q~0 0) (= main_~b~0 (* main_~a~0 main_~y~0)))} assume !!(~r~0 >= 2 * ~b~0); {28626#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (= main_~q~0 0) (= main_~b~0 (* main_~a~0 main_~y~0)))} is VALID [2022-04-28 11:35:12,961 INFO L272 TraceCheckUtils]: 67: Hoare triple {28626#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (= main_~q~0 0) (= main_~b~0 (* main_~a~0 main_~y~0)))} call __VERIFIER_assert((if ~r~0 >= 2 * ~y~0 * ~a~0 then 1 else 0)); {28451#true} is VALID [2022-04-28 11:35:12,961 INFO L290 TraceCheckUtils]: 68: Hoare triple {28451#true} ~cond := #in~cond; {28451#true} is VALID [2022-04-28 11:35:12,961 INFO L290 TraceCheckUtils]: 69: Hoare triple {28451#true} assume !(0 == ~cond); {28451#true} is VALID [2022-04-28 11:35:12,961 INFO L290 TraceCheckUtils]: 70: Hoare triple {28451#true} assume true; {28451#true} is VALID [2022-04-28 11:35:12,962 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {28451#true} {28626#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (= main_~q~0 0) (= main_~b~0 (* main_~a~0 main_~y~0)))} #89#return; {28626#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (= main_~q~0 0) (= main_~b~0 (* main_~a~0 main_~y~0)))} is VALID [2022-04-28 11:35:12,966 INFO L290 TraceCheckUtils]: 72: Hoare triple {28626#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (= main_~q~0 0) (= main_~b~0 (* main_~a~0 main_~y~0)))} ~a~0 := 2 * ~a~0;~b~0 := 2 * ~b~0; {28678#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (= (mod (div (- main_~a~0) (- 2)) 2) 0) (= main_~b~0 (* main_~y~0 4)) (= (* (div (- main_~a~0) (- 2)) main_~y~0) (* main_~y~0 2)) (= main_~q~0 0))} is VALID [2022-04-28 11:35:12,966 INFO L290 TraceCheckUtils]: 73: Hoare triple {28678#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (= (mod (div (- main_~a~0) (- 2)) 2) 0) (= main_~b~0 (* main_~y~0 4)) (= (* (div (- main_~a~0) (- 2)) main_~y~0) (* main_~y~0 2)) (= main_~q~0 0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {28678#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (= (mod (div (- main_~a~0) (- 2)) 2) 0) (= main_~b~0 (* main_~y~0 4)) (= (* (div (- main_~a~0) (- 2)) main_~y~0) (* main_~y~0 2)) (= main_~q~0 0))} is VALID [2022-04-28 11:35:12,967 INFO L290 TraceCheckUtils]: 74: Hoare triple {28678#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (= (mod (div (- main_~a~0) (- 2)) 2) 0) (= main_~b~0 (* main_~y~0 4)) (= (* (div (- main_~a~0) (- 2)) main_~y~0) (* main_~y~0 2)) (= main_~q~0 0))} assume !!(#t~post7 < 20);havoc #t~post7; {28678#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (= (mod (div (- main_~a~0) (- 2)) 2) 0) (= main_~b~0 (* main_~y~0 4)) (= (* (div (- main_~a~0) (- 2)) main_~y~0) (* main_~y~0 2)) (= main_~q~0 0))} is VALID [2022-04-28 11:35:12,967 INFO L272 TraceCheckUtils]: 75: Hoare triple {28678#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (= (mod (div (- main_~a~0) (- 2)) 2) 0) (= main_~b~0 (* main_~y~0 4)) (= (* (div (- main_~a~0) (- 2)) main_~y~0) (* main_~y~0 2)) (= main_~q~0 0))} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {28451#true} is VALID [2022-04-28 11:35:12,967 INFO L290 TraceCheckUtils]: 76: Hoare triple {28451#true} ~cond := #in~cond; {28451#true} is VALID [2022-04-28 11:35:12,967 INFO L290 TraceCheckUtils]: 77: Hoare triple {28451#true} assume !(0 == ~cond); {28451#true} is VALID [2022-04-28 11:35:12,967 INFO L290 TraceCheckUtils]: 78: Hoare triple {28451#true} assume true; {28451#true} is VALID [2022-04-28 11:35:12,968 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {28451#true} {28678#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (= (mod (div (- main_~a~0) (- 2)) 2) 0) (= main_~b~0 (* main_~y~0 4)) (= (* (div (- main_~a~0) (- 2)) main_~y~0) (* main_~y~0 2)) (= main_~q~0 0))} #83#return; {28678#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (= (mod (div (- main_~a~0) (- 2)) 2) 0) (= main_~b~0 (* main_~y~0 4)) (= (* (div (- main_~a~0) (- 2)) main_~y~0) (* main_~y~0 2)) (= main_~q~0 0))} is VALID [2022-04-28 11:35:12,968 INFO L272 TraceCheckUtils]: 80: Hoare triple {28678#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (= (mod (div (- main_~a~0) (- 2)) 2) 0) (= main_~b~0 (* main_~y~0 4)) (= (* (div (- main_~a~0) (- 2)) main_~y~0) (* main_~y~0 2)) (= main_~q~0 0))} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {28451#true} is VALID [2022-04-28 11:35:12,968 INFO L290 TraceCheckUtils]: 81: Hoare triple {28451#true} ~cond := #in~cond; {28451#true} is VALID [2022-04-28 11:35:12,968 INFO L290 TraceCheckUtils]: 82: Hoare triple {28451#true} assume !(0 == ~cond); {28451#true} is VALID [2022-04-28 11:35:12,968 INFO L290 TraceCheckUtils]: 83: Hoare triple {28451#true} assume true; {28451#true} is VALID [2022-04-28 11:35:12,968 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {28451#true} {28678#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (= (mod (div (- main_~a~0) (- 2)) 2) 0) (= main_~b~0 (* main_~y~0 4)) (= (* (div (- main_~a~0) (- 2)) main_~y~0) (* main_~y~0 2)) (= main_~q~0 0))} #85#return; {28678#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (= (mod (div (- main_~a~0) (- 2)) 2) 0) (= main_~b~0 (* main_~y~0 4)) (= (* (div (- main_~a~0) (- 2)) main_~y~0) (* main_~y~0 2)) (= main_~q~0 0))} is VALID [2022-04-28 11:35:12,968 INFO L272 TraceCheckUtils]: 85: Hoare triple {28678#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (= (mod (div (- main_~a~0) (- 2)) 2) 0) (= main_~b~0 (* main_~y~0 4)) (= (* (div (- main_~a~0) (- 2)) main_~y~0) (* main_~y~0 2)) (= main_~q~0 0))} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {28451#true} is VALID [2022-04-28 11:35:12,968 INFO L290 TraceCheckUtils]: 86: Hoare triple {28451#true} ~cond := #in~cond; {28451#true} is VALID [2022-04-28 11:35:12,968 INFO L290 TraceCheckUtils]: 87: Hoare triple {28451#true} assume !(0 == ~cond); {28451#true} is VALID [2022-04-28 11:35:12,968 INFO L290 TraceCheckUtils]: 88: Hoare triple {28451#true} assume true; {28451#true} is VALID [2022-04-28 11:35:12,969 INFO L284 TraceCheckUtils]: 89: Hoare quadruple {28451#true} {28678#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (= (mod (div (- main_~a~0) (- 2)) 2) 0) (= main_~b~0 (* main_~y~0 4)) (= (* (div (- main_~a~0) (- 2)) main_~y~0) (* main_~y~0 2)) (= main_~q~0 0))} #87#return; {28678#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (= (mod (div (- main_~a~0) (- 2)) 2) 0) (= main_~b~0 (* main_~y~0 4)) (= (* (div (- main_~a~0) (- 2)) main_~y~0) (* main_~y~0 2)) (= main_~q~0 0))} is VALID [2022-04-28 11:35:12,969 INFO L290 TraceCheckUtils]: 90: Hoare triple {28678#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (= (mod (div (- main_~a~0) (- 2)) 2) 0) (= main_~b~0 (* main_~y~0 4)) (= (* (div (- main_~a~0) (- 2)) main_~y~0) (* main_~y~0 2)) (= main_~q~0 0))} assume !(~r~0 >= 2 * ~b~0); {28678#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (= (mod (div (- main_~a~0) (- 2)) 2) 0) (= main_~b~0 (* main_~y~0 4)) (= (* (div (- main_~a~0) (- 2)) main_~y~0) (* main_~y~0 2)) (= main_~q~0 0))} is VALID [2022-04-28 11:35:12,971 INFO L290 TraceCheckUtils]: 91: Hoare triple {28678#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (= (mod (div (- main_~a~0) (- 2)) 2) 0) (= main_~b~0 (* main_~y~0 4)) (= (* (div (- main_~a~0) (- 2)) main_~y~0) (* main_~y~0 2)) (= main_~q~0 0))} ~r~0 := ~r~0 - ~b~0;~q~0 := ~q~0 + ~a~0; {28736#(and (= (mod main_~a~0 2) 0) (= (mod (div (- main_~a~0) (- 2)) 2) 0) (= main_~b~0 (* main_~y~0 4)) (= (* (div (- main_~a~0) (- 2)) main_~y~0) (* main_~y~0 2)) (= main_~a~0 main_~q~0) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~r~0))} is VALID [2022-04-28 11:35:12,972 INFO L290 TraceCheckUtils]: 92: Hoare triple {28736#(and (= (mod main_~a~0 2) 0) (= (mod (div (- main_~a~0) (- 2)) 2) 0) (= main_~b~0 (* main_~y~0 4)) (= (* (div (- main_~a~0) (- 2)) main_~y~0) (* main_~y~0 2)) (= main_~a~0 main_~q~0) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~r~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {28736#(and (= (mod main_~a~0 2) 0) (= (mod (div (- main_~a~0) (- 2)) 2) 0) (= main_~b~0 (* main_~y~0 4)) (= (* (div (- main_~a~0) (- 2)) main_~y~0) (* main_~y~0 2)) (= main_~a~0 main_~q~0) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~r~0))} is VALID [2022-04-28 11:35:12,973 INFO L290 TraceCheckUtils]: 93: Hoare triple {28736#(and (= (mod main_~a~0 2) 0) (= (mod (div (- main_~a~0) (- 2)) 2) 0) (= main_~b~0 (* main_~y~0 4)) (= (* (div (- main_~a~0) (- 2)) main_~y~0) (* main_~y~0 2)) (= main_~a~0 main_~q~0) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~r~0))} assume !!(#t~post6 < 20);havoc #t~post6; {28736#(and (= (mod main_~a~0 2) 0) (= (mod (div (- main_~a~0) (- 2)) 2) 0) (= main_~b~0 (* main_~y~0 4)) (= (* (div (- main_~a~0) (- 2)) main_~y~0) (* main_~y~0 2)) (= main_~a~0 main_~q~0) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~r~0))} is VALID [2022-04-28 11:35:12,973 INFO L272 TraceCheckUtils]: 94: Hoare triple {28736#(and (= (mod main_~a~0 2) 0) (= (mod (div (- main_~a~0) (- 2)) 2) 0) (= main_~b~0 (* main_~y~0 4)) (= (* (div (- main_~a~0) (- 2)) main_~y~0) (* main_~y~0 2)) (= main_~a~0 main_~q~0) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~r~0))} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {28451#true} is VALID [2022-04-28 11:35:12,973 INFO L290 TraceCheckUtils]: 95: Hoare triple {28451#true} ~cond := #in~cond; {28615#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:35:12,973 INFO L290 TraceCheckUtils]: 96: Hoare triple {28615#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {28619#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:35:12,973 INFO L290 TraceCheckUtils]: 97: Hoare triple {28619#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {28619#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:35:12,975 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {28619#(not (= |__VERIFIER_assert_#in~cond| 0))} {28736#(and (= (mod main_~a~0 2) 0) (= (mod (div (- main_~a~0) (- 2)) 2) 0) (= main_~b~0 (* main_~y~0 4)) (= (* (div (- main_~a~0) (- 2)) main_~y~0) (* main_~y~0 2)) (= main_~a~0 main_~q~0) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~r~0))} #79#return; {28758#(and (= main_~x~0 (+ main_~r~0 (* main_~y~0 4))) (= (mod (div (- main_~q~0) (- 2)) 2) 0) (= (* main_~y~0 (div (* (- 1) main_~q~0) (- 2))) (* main_~y~0 2)) (= (mod main_~q~0 2) 0))} is VALID [2022-04-28 11:35:12,975 INFO L272 TraceCheckUtils]: 99: Hoare triple {28758#(and (= main_~x~0 (+ main_~r~0 (* main_~y~0 4))) (= (mod (div (- main_~q~0) (- 2)) 2) 0) (= (* main_~y~0 (div (* (- 1) main_~q~0) (- 2))) (* main_~y~0 2)) (= (mod main_~q~0 2) 0))} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {28451#true} is VALID [2022-04-28 11:35:12,975 INFO L290 TraceCheckUtils]: 100: Hoare triple {28451#true} ~cond := #in~cond; {28451#true} is VALID [2022-04-28 11:35:12,975 INFO L290 TraceCheckUtils]: 101: Hoare triple {28451#true} assume !(0 == ~cond); {28451#true} is VALID [2022-04-28 11:35:12,976 INFO L290 TraceCheckUtils]: 102: Hoare triple {28451#true} assume true; {28451#true} is VALID [2022-04-28 11:35:12,976 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {28451#true} {28758#(and (= main_~x~0 (+ main_~r~0 (* main_~y~0 4))) (= (mod (div (- main_~q~0) (- 2)) 2) 0) (= (* main_~y~0 (div (* (- 1) main_~q~0) (- 2))) (* main_~y~0 2)) (= (mod main_~q~0 2) 0))} #81#return; {28758#(and (= main_~x~0 (+ main_~r~0 (* main_~y~0 4))) (= (mod (div (- main_~q~0) (- 2)) 2) 0) (= (* main_~y~0 (div (* (- 1) main_~q~0) (- 2))) (* main_~y~0 2)) (= (mod main_~q~0 2) 0))} is VALID [2022-04-28 11:35:12,976 INFO L290 TraceCheckUtils]: 104: Hoare triple {28758#(and (= main_~x~0 (+ main_~r~0 (* main_~y~0 4))) (= (mod (div (- main_~q~0) (- 2)) 2) 0) (= (* main_~y~0 (div (* (- 1) main_~q~0) (- 2))) (* main_~y~0 2)) (= (mod main_~q~0 2) 0))} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {28777#(and (= main_~x~0 (+ main_~r~0 (* main_~y~0 4))) (= (mod (div (- main_~q~0) (- 2)) 2) 0) (= (* main_~y~0 (div (* (- 1) main_~q~0) (- 2))) (* main_~y~0 2)) (= main_~b~0 main_~y~0) (= (mod main_~q~0 2) 0))} is VALID [2022-04-28 11:35:12,977 INFO L290 TraceCheckUtils]: 105: Hoare triple {28777#(and (= main_~x~0 (+ main_~r~0 (* main_~y~0 4))) (= (mod (div (- main_~q~0) (- 2)) 2) 0) (= (* main_~y~0 (div (* (- 1) main_~q~0) (- 2))) (* main_~y~0 2)) (= main_~b~0 main_~y~0) (= (mod main_~q~0 2) 0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {28777#(and (= main_~x~0 (+ main_~r~0 (* main_~y~0 4))) (= (mod (div (- main_~q~0) (- 2)) 2) 0) (= (* main_~y~0 (div (* (- 1) main_~q~0) (- 2))) (* main_~y~0 2)) (= main_~b~0 main_~y~0) (= (mod main_~q~0 2) 0))} is VALID [2022-04-28 11:35:12,977 INFO L290 TraceCheckUtils]: 106: Hoare triple {28777#(and (= main_~x~0 (+ main_~r~0 (* main_~y~0 4))) (= (mod (div (- main_~q~0) (- 2)) 2) 0) (= (* main_~y~0 (div (* (- 1) main_~q~0) (- 2))) (* main_~y~0 2)) (= main_~b~0 main_~y~0) (= (mod main_~q~0 2) 0))} assume !!(#t~post7 < 20);havoc #t~post7; {28777#(and (= main_~x~0 (+ main_~r~0 (* main_~y~0 4))) (= (mod (div (- main_~q~0) (- 2)) 2) 0) (= (* main_~y~0 (div (* (- 1) main_~q~0) (- 2))) (* main_~y~0 2)) (= main_~b~0 main_~y~0) (= (mod main_~q~0 2) 0))} is VALID [2022-04-28 11:35:12,977 INFO L272 TraceCheckUtils]: 107: Hoare triple {28777#(and (= main_~x~0 (+ main_~r~0 (* main_~y~0 4))) (= (mod (div (- main_~q~0) (- 2)) 2) 0) (= (* main_~y~0 (div (* (- 1) main_~q~0) (- 2))) (* main_~y~0 2)) (= main_~b~0 main_~y~0) (= (mod main_~q~0 2) 0))} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {28451#true} is VALID [2022-04-28 11:35:12,977 INFO L290 TraceCheckUtils]: 108: Hoare triple {28451#true} ~cond := #in~cond; {28451#true} is VALID [2022-04-28 11:35:12,978 INFO L290 TraceCheckUtils]: 109: Hoare triple {28451#true} assume !(0 == ~cond); {28451#true} is VALID [2022-04-28 11:35:12,978 INFO L290 TraceCheckUtils]: 110: Hoare triple {28451#true} assume true; {28451#true} is VALID [2022-04-28 11:35:12,978 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {28451#true} {28777#(and (= main_~x~0 (+ main_~r~0 (* main_~y~0 4))) (= (mod (div (- main_~q~0) (- 2)) 2) 0) (= (* main_~y~0 (div (* (- 1) main_~q~0) (- 2))) (* main_~y~0 2)) (= main_~b~0 main_~y~0) (= (mod main_~q~0 2) 0))} #83#return; {28777#(and (= main_~x~0 (+ main_~r~0 (* main_~y~0 4))) (= (mod (div (- main_~q~0) (- 2)) 2) 0) (= (* main_~y~0 (div (* (- 1) main_~q~0) (- 2))) (* main_~y~0 2)) (= main_~b~0 main_~y~0) (= (mod main_~q~0 2) 0))} is VALID [2022-04-28 11:35:12,978 INFO L272 TraceCheckUtils]: 112: Hoare triple {28777#(and (= main_~x~0 (+ main_~r~0 (* main_~y~0 4))) (= (mod (div (- main_~q~0) (- 2)) 2) 0) (= (* main_~y~0 (div (* (- 1) main_~q~0) (- 2))) (* main_~y~0 2)) (= main_~b~0 main_~y~0) (= (mod main_~q~0 2) 0))} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {28451#true} is VALID [2022-04-28 11:35:12,978 INFO L290 TraceCheckUtils]: 113: Hoare triple {28451#true} ~cond := #in~cond; {28451#true} is VALID [2022-04-28 11:35:12,978 INFO L290 TraceCheckUtils]: 114: Hoare triple {28451#true} assume !(0 == ~cond); {28451#true} is VALID [2022-04-28 11:35:12,978 INFO L290 TraceCheckUtils]: 115: Hoare triple {28451#true} assume true; {28451#true} is VALID [2022-04-28 11:35:12,979 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {28451#true} {28777#(and (= main_~x~0 (+ main_~r~0 (* main_~y~0 4))) (= (mod (div (- main_~q~0) (- 2)) 2) 0) (= (* main_~y~0 (div (* (- 1) main_~q~0) (- 2))) (* main_~y~0 2)) (= main_~b~0 main_~y~0) (= (mod main_~q~0 2) 0))} #85#return; {28777#(and (= main_~x~0 (+ main_~r~0 (* main_~y~0 4))) (= (mod (div (- main_~q~0) (- 2)) 2) 0) (= (* main_~y~0 (div (* (- 1) main_~q~0) (- 2))) (* main_~y~0 2)) (= main_~b~0 main_~y~0) (= (mod main_~q~0 2) 0))} is VALID [2022-04-28 11:35:12,979 INFO L272 TraceCheckUtils]: 117: Hoare triple {28777#(and (= main_~x~0 (+ main_~r~0 (* main_~y~0 4))) (= (mod (div (- main_~q~0) (- 2)) 2) 0) (= (* main_~y~0 (div (* (- 1) main_~q~0) (- 2))) (* main_~y~0 2)) (= main_~b~0 main_~y~0) (= (mod main_~q~0 2) 0))} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {28451#true} is VALID [2022-04-28 11:35:12,979 INFO L290 TraceCheckUtils]: 118: Hoare triple {28451#true} ~cond := #in~cond; {28451#true} is VALID [2022-04-28 11:35:12,979 INFO L290 TraceCheckUtils]: 119: Hoare triple {28451#true} assume !(0 == ~cond); {28451#true} is VALID [2022-04-28 11:35:12,979 INFO L290 TraceCheckUtils]: 120: Hoare triple {28451#true} assume true; {28451#true} is VALID [2022-04-28 11:35:12,979 INFO L284 TraceCheckUtils]: 121: Hoare quadruple {28451#true} {28777#(and (= main_~x~0 (+ main_~r~0 (* main_~y~0 4))) (= (mod (div (- main_~q~0) (- 2)) 2) 0) (= (* main_~y~0 (div (* (- 1) main_~q~0) (- 2))) (* main_~y~0 2)) (= main_~b~0 main_~y~0) (= (mod main_~q~0 2) 0))} #87#return; {28777#(and (= main_~x~0 (+ main_~r~0 (* main_~y~0 4))) (= (mod (div (- main_~q~0) (- 2)) 2) 0) (= (* main_~y~0 (div (* (- 1) main_~q~0) (- 2))) (* main_~y~0 2)) (= main_~b~0 main_~y~0) (= (mod main_~q~0 2) 0))} is VALID [2022-04-28 11:35:12,980 INFO L290 TraceCheckUtils]: 122: Hoare triple {28777#(and (= main_~x~0 (+ main_~r~0 (* main_~y~0 4))) (= (mod (div (- main_~q~0) (- 2)) 2) 0) (= (* main_~y~0 (div (* (- 1) main_~q~0) (- 2))) (* main_~y~0 2)) (= main_~b~0 main_~y~0) (= (mod main_~q~0 2) 0))} assume !!(~r~0 >= 2 * ~b~0); {28777#(and (= main_~x~0 (+ main_~r~0 (* main_~y~0 4))) (= (mod (div (- main_~q~0) (- 2)) 2) 0) (= (* main_~y~0 (div (* (- 1) main_~q~0) (- 2))) (* main_~y~0 2)) (= main_~b~0 main_~y~0) (= (mod main_~q~0 2) 0))} is VALID [2022-04-28 11:35:12,980 INFO L272 TraceCheckUtils]: 123: Hoare triple {28777#(and (= main_~x~0 (+ main_~r~0 (* main_~y~0 4))) (= (mod (div (- main_~q~0) (- 2)) 2) 0) (= (* main_~y~0 (div (* (- 1) main_~q~0) (- 2))) (* main_~y~0 2)) (= main_~b~0 main_~y~0) (= (mod main_~q~0 2) 0))} call __VERIFIER_assert((if ~r~0 >= 2 * ~y~0 * ~a~0 then 1 else 0)); {28451#true} is VALID [2022-04-28 11:35:12,980 INFO L290 TraceCheckUtils]: 124: Hoare triple {28451#true} ~cond := #in~cond; {28451#true} is VALID [2022-04-28 11:35:12,980 INFO L290 TraceCheckUtils]: 125: Hoare triple {28451#true} assume !(0 == ~cond); {28451#true} is VALID [2022-04-28 11:35:12,980 INFO L290 TraceCheckUtils]: 126: Hoare triple {28451#true} assume true; {28451#true} is VALID [2022-04-28 11:35:12,981 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {28451#true} {28777#(and (= main_~x~0 (+ main_~r~0 (* main_~y~0 4))) (= (mod (div (- main_~q~0) (- 2)) 2) 0) (= (* main_~y~0 (div (* (- 1) main_~q~0) (- 2))) (* main_~y~0 2)) (= main_~b~0 main_~y~0) (= (mod main_~q~0 2) 0))} #89#return; {28777#(and (= main_~x~0 (+ main_~r~0 (* main_~y~0 4))) (= (mod (div (- main_~q~0) (- 2)) 2) 0) (= (* main_~y~0 (div (* (- 1) main_~q~0) (- 2))) (* main_~y~0 2)) (= main_~b~0 main_~y~0) (= (mod main_~q~0 2) 0))} is VALID [2022-04-28 11:35:12,983 INFO L290 TraceCheckUtils]: 128: Hoare triple {28777#(and (= main_~x~0 (+ main_~r~0 (* main_~y~0 4))) (= (mod (div (- main_~q~0) (- 2)) 2) 0) (= (* main_~y~0 (div (* (- 1) main_~q~0) (- 2))) (* main_~y~0 2)) (= main_~b~0 main_~y~0) (= (mod main_~q~0 2) 0))} ~a~0 := 2 * ~a~0;~b~0 := 2 * ~b~0; {28850#(and (= (mod main_~a~0 2) 0) (= main_~b~0 (* main_~y~0 2)) (= main_~x~0 (+ main_~r~0 (* main_~y~0 4))) (= (mod (div (- main_~q~0) (- 2)) 2) 0) (= (* main_~y~0 (div (* (- 1) main_~q~0) (- 2))) (* main_~y~0 2)) (= (mod main_~q~0 2) 0))} is VALID [2022-04-28 11:35:12,983 INFO L290 TraceCheckUtils]: 129: Hoare triple {28850#(and (= (mod main_~a~0 2) 0) (= main_~b~0 (* main_~y~0 2)) (= main_~x~0 (+ main_~r~0 (* main_~y~0 4))) (= (mod (div (- main_~q~0) (- 2)) 2) 0) (= (* main_~y~0 (div (* (- 1) main_~q~0) (- 2))) (* main_~y~0 2)) (= (mod main_~q~0 2) 0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {28850#(and (= (mod main_~a~0 2) 0) (= main_~b~0 (* main_~y~0 2)) (= main_~x~0 (+ main_~r~0 (* main_~y~0 4))) (= (mod (div (- main_~q~0) (- 2)) 2) 0) (= (* main_~y~0 (div (* (- 1) main_~q~0) (- 2))) (* main_~y~0 2)) (= (mod main_~q~0 2) 0))} is VALID [2022-04-28 11:35:12,984 INFO L290 TraceCheckUtils]: 130: Hoare triple {28850#(and (= (mod main_~a~0 2) 0) (= main_~b~0 (* main_~y~0 2)) (= main_~x~0 (+ main_~r~0 (* main_~y~0 4))) (= (mod (div (- main_~q~0) (- 2)) 2) 0) (= (* main_~y~0 (div (* (- 1) main_~q~0) (- 2))) (* main_~y~0 2)) (= (mod main_~q~0 2) 0))} assume !!(#t~post7 < 20);havoc #t~post7; {28850#(and (= (mod main_~a~0 2) 0) (= main_~b~0 (* main_~y~0 2)) (= main_~x~0 (+ main_~r~0 (* main_~y~0 4))) (= (mod (div (- main_~q~0) (- 2)) 2) 0) (= (* main_~y~0 (div (* (- 1) main_~q~0) (- 2))) (* main_~y~0 2)) (= (mod main_~q~0 2) 0))} is VALID [2022-04-28 11:35:12,984 INFO L272 TraceCheckUtils]: 131: Hoare triple {28850#(and (= (mod main_~a~0 2) 0) (= main_~b~0 (* main_~y~0 2)) (= main_~x~0 (+ main_~r~0 (* main_~y~0 4))) (= (mod (div (- main_~q~0) (- 2)) 2) 0) (= (* main_~y~0 (div (* (- 1) main_~q~0) (- 2))) (* main_~y~0 2)) (= (mod main_~q~0 2) 0))} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {28451#true} is VALID [2022-04-28 11:35:12,984 INFO L290 TraceCheckUtils]: 132: Hoare triple {28451#true} ~cond := #in~cond; {28451#true} is VALID [2022-04-28 11:35:12,984 INFO L290 TraceCheckUtils]: 133: Hoare triple {28451#true} assume !(0 == ~cond); {28451#true} is VALID [2022-04-28 11:35:12,984 INFO L290 TraceCheckUtils]: 134: Hoare triple {28451#true} assume true; {28451#true} is VALID [2022-04-28 11:35:12,984 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {28451#true} {28850#(and (= (mod main_~a~0 2) 0) (= main_~b~0 (* main_~y~0 2)) (= main_~x~0 (+ main_~r~0 (* main_~y~0 4))) (= (mod (div (- main_~q~0) (- 2)) 2) 0) (= (* main_~y~0 (div (* (- 1) main_~q~0) (- 2))) (* main_~y~0 2)) (= (mod main_~q~0 2) 0))} #83#return; {28850#(and (= (mod main_~a~0 2) 0) (= main_~b~0 (* main_~y~0 2)) (= main_~x~0 (+ main_~r~0 (* main_~y~0 4))) (= (mod (div (- main_~q~0) (- 2)) 2) 0) (= (* main_~y~0 (div (* (- 1) main_~q~0) (- 2))) (* main_~y~0 2)) (= (mod main_~q~0 2) 0))} is VALID [2022-04-28 11:35:12,985 INFO L272 TraceCheckUtils]: 136: Hoare triple {28850#(and (= (mod main_~a~0 2) 0) (= main_~b~0 (* main_~y~0 2)) (= main_~x~0 (+ main_~r~0 (* main_~y~0 4))) (= (mod (div (- main_~q~0) (- 2)) 2) 0) (= (* main_~y~0 (div (* (- 1) main_~q~0) (- 2))) (* main_~y~0 2)) (= (mod main_~q~0 2) 0))} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {28451#true} is VALID [2022-04-28 11:35:12,986 INFO L290 TraceCheckUtils]: 137: Hoare triple {28451#true} ~cond := #in~cond; {28615#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:35:12,986 INFO L290 TraceCheckUtils]: 138: Hoare triple {28615#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {28619#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:35:12,986 INFO L290 TraceCheckUtils]: 139: Hoare triple {28619#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {28619#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:35:12,987 INFO L284 TraceCheckUtils]: 140: Hoare quadruple {28619#(not (= |__VERIFIER_assert_#in~cond| 0))} {28850#(and (= (mod main_~a~0 2) 0) (= main_~b~0 (* main_~y~0 2)) (= main_~x~0 (+ main_~r~0 (* main_~y~0 4))) (= (mod (div (- main_~q~0) (- 2)) 2) 0) (= (* main_~y~0 (div (* (- 1) main_~q~0) (- 2))) (* main_~y~0 2)) (= (mod main_~q~0 2) 0))} #85#return; {28850#(and (= (mod main_~a~0 2) 0) (= main_~b~0 (* main_~y~0 2)) (= main_~x~0 (+ main_~r~0 (* main_~y~0 4))) (= (mod (div (- main_~q~0) (- 2)) 2) 0) (= (* main_~y~0 (div (* (- 1) main_~q~0) (- 2))) (* main_~y~0 2)) (= (mod main_~q~0 2) 0))} is VALID [2022-04-28 11:35:12,987 INFO L272 TraceCheckUtils]: 141: Hoare triple {28850#(and (= (mod main_~a~0 2) 0) (= main_~b~0 (* main_~y~0 2)) (= main_~x~0 (+ main_~r~0 (* main_~y~0 4))) (= (mod (div (- main_~q~0) (- 2)) 2) 0) (= (* main_~y~0 (div (* (- 1) main_~q~0) (- 2))) (* main_~y~0 2)) (= (mod main_~q~0 2) 0))} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {28451#true} is VALID [2022-04-28 11:35:12,987 INFO L290 TraceCheckUtils]: 142: Hoare triple {28451#true} ~cond := #in~cond; {28451#true} is VALID [2022-04-28 11:35:12,987 INFO L290 TraceCheckUtils]: 143: Hoare triple {28451#true} assume !(0 == ~cond); {28451#true} is VALID [2022-04-28 11:35:12,987 INFO L290 TraceCheckUtils]: 144: Hoare triple {28451#true} assume true; {28451#true} is VALID [2022-04-28 11:35:12,988 INFO L284 TraceCheckUtils]: 145: Hoare quadruple {28451#true} {28850#(and (= (mod main_~a~0 2) 0) (= main_~b~0 (* main_~y~0 2)) (= main_~x~0 (+ main_~r~0 (* main_~y~0 4))) (= (mod (div (- main_~q~0) (- 2)) 2) 0) (= (* main_~y~0 (div (* (- 1) main_~q~0) (- 2))) (* main_~y~0 2)) (= (mod main_~q~0 2) 0))} #87#return; {28850#(and (= (mod main_~a~0 2) 0) (= main_~b~0 (* main_~y~0 2)) (= main_~x~0 (+ main_~r~0 (* main_~y~0 4))) (= (mod (div (- main_~q~0) (- 2)) 2) 0) (= (* main_~y~0 (div (* (- 1) main_~q~0) (- 2))) (* main_~y~0 2)) (= (mod main_~q~0 2) 0))} is VALID [2022-04-28 11:35:12,988 INFO L290 TraceCheckUtils]: 146: Hoare triple {28850#(and (= (mod main_~a~0 2) 0) (= main_~b~0 (* main_~y~0 2)) (= main_~x~0 (+ main_~r~0 (* main_~y~0 4))) (= (mod (div (- main_~q~0) (- 2)) 2) 0) (= (* main_~y~0 (div (* (- 1) main_~q~0) (- 2))) (* main_~y~0 2)) (= (mod main_~q~0 2) 0))} assume !(~r~0 >= 2 * ~b~0); {28850#(and (= (mod main_~a~0 2) 0) (= main_~b~0 (* main_~y~0 2)) (= main_~x~0 (+ main_~r~0 (* main_~y~0 4))) (= (mod (div (- main_~q~0) (- 2)) 2) 0) (= (* main_~y~0 (div (* (- 1) main_~q~0) (- 2))) (* main_~y~0 2)) (= (mod main_~q~0 2) 0))} is VALID [2022-04-28 11:35:12,995 INFO L290 TraceCheckUtils]: 147: Hoare triple {28850#(and (= (mod main_~a~0 2) 0) (= main_~b~0 (* main_~y~0 2)) (= main_~x~0 (+ main_~r~0 (* main_~y~0 4))) (= (mod (div (- main_~q~0) (- 2)) 2) 0) (= (* main_~y~0 (div (* (- 1) main_~q~0) (- 2))) (* main_~y~0 2)) (= (mod main_~q~0 2) 0))} ~r~0 := ~r~0 - ~b~0;~q~0 := ~q~0 + ~a~0; {28908#(and (= (mod main_~a~0 2) 0) (= (* main_~y~0 2) (* main_~y~0 (div (+ main_~a~0 (* (- 1) main_~q~0)) (- 2)))) (= main_~r~0 (+ (* main_~y~0 (- 4)) main_~x~0 (* (- 1) main_~b~0))) (= main_~b~0 (* main_~y~0 2)) (= (mod (+ main_~a~0 main_~q~0) 2) 0) (= (mod (div (+ main_~a~0 (* (- 1) main_~q~0)) (- 2)) 2) 0))} is VALID [2022-04-28 11:35:12,996 INFO L290 TraceCheckUtils]: 148: Hoare triple {28908#(and (= (mod main_~a~0 2) 0) (= (* main_~y~0 2) (* main_~y~0 (div (+ main_~a~0 (* (- 1) main_~q~0)) (- 2)))) (= main_~r~0 (+ (* main_~y~0 (- 4)) main_~x~0 (* (- 1) main_~b~0))) (= main_~b~0 (* main_~y~0 2)) (= (mod (+ main_~a~0 main_~q~0) 2) 0) (= (mod (div (+ main_~a~0 (* (- 1) main_~q~0)) (- 2)) 2) 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {28908#(and (= (mod main_~a~0 2) 0) (= (* main_~y~0 2) (* main_~y~0 (div (+ main_~a~0 (* (- 1) main_~q~0)) (- 2)))) (= main_~r~0 (+ (* main_~y~0 (- 4)) main_~x~0 (* (- 1) main_~b~0))) (= main_~b~0 (* main_~y~0 2)) (= (mod (+ main_~a~0 main_~q~0) 2) 0) (= (mod (div (+ main_~a~0 (* (- 1) main_~q~0)) (- 2)) 2) 0))} is VALID [2022-04-28 11:35:12,996 INFO L290 TraceCheckUtils]: 149: Hoare triple {28908#(and (= (mod main_~a~0 2) 0) (= (* main_~y~0 2) (* main_~y~0 (div (+ main_~a~0 (* (- 1) main_~q~0)) (- 2)))) (= main_~r~0 (+ (* main_~y~0 (- 4)) main_~x~0 (* (- 1) main_~b~0))) (= main_~b~0 (* main_~y~0 2)) (= (mod (+ main_~a~0 main_~q~0) 2) 0) (= (mod (div (+ main_~a~0 (* (- 1) main_~q~0)) (- 2)) 2) 0))} assume !!(#t~post6 < 20);havoc #t~post6; {28908#(and (= (mod main_~a~0 2) 0) (= (* main_~y~0 2) (* main_~y~0 (div (+ main_~a~0 (* (- 1) main_~q~0)) (- 2)))) (= main_~r~0 (+ (* main_~y~0 (- 4)) main_~x~0 (* (- 1) main_~b~0))) (= main_~b~0 (* main_~y~0 2)) (= (mod (+ main_~a~0 main_~q~0) 2) 0) (= (mod (div (+ main_~a~0 (* (- 1) main_~q~0)) (- 2)) 2) 0))} is VALID [2022-04-28 11:35:12,996 INFO L272 TraceCheckUtils]: 150: Hoare triple {28908#(and (= (mod main_~a~0 2) 0) (= (* main_~y~0 2) (* main_~y~0 (div (+ main_~a~0 (* (- 1) main_~q~0)) (- 2)))) (= main_~r~0 (+ (* main_~y~0 (- 4)) main_~x~0 (* (- 1) main_~b~0))) (= main_~b~0 (* main_~y~0 2)) (= (mod (+ main_~a~0 main_~q~0) 2) 0) (= (mod (div (+ main_~a~0 (* (- 1) main_~q~0)) (- 2)) 2) 0))} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {28451#true} is VALID [2022-04-28 11:35:12,996 INFO L290 TraceCheckUtils]: 151: Hoare triple {28451#true} ~cond := #in~cond; {28615#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:35:12,997 INFO L290 TraceCheckUtils]: 152: Hoare triple {28615#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {28619#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:35:13,008 INFO L290 TraceCheckUtils]: 153: Hoare triple {28619#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {28619#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:35:13,020 INFO L284 TraceCheckUtils]: 154: Hoare quadruple {28619#(not (= |__VERIFIER_assert_#in~cond| 0))} {28908#(and (= (mod main_~a~0 2) 0) (= (* main_~y~0 2) (* main_~y~0 (div (+ main_~a~0 (* (- 1) main_~q~0)) (- 2)))) (= main_~r~0 (+ (* main_~y~0 (- 4)) main_~x~0 (* (- 1) main_~b~0))) (= main_~b~0 (* main_~y~0 2)) (= (mod (+ main_~a~0 main_~q~0) 2) 0) (= (mod (div (+ main_~a~0 (* (- 1) main_~q~0)) (- 2)) 2) 0))} #79#return; {28930#(and (= (+ main_~r~0 (* main_~y~0 6)) main_~x~0) (= (mod main_~q~0 2) 0) (= (* (div (+ (* (div (+ (div (+ main_~r~0 (* (- 1) main_~x~0)) (- 2)) (* (- 2) main_~y~0)) main_~y~0) 2) (* (- 1) main_~q~0)) (- 2)) main_~y~0) (* main_~y~0 2)))} is VALID [2022-04-28 11:35:13,028 INFO L272 TraceCheckUtils]: 155: Hoare triple {28930#(and (= (+ main_~r~0 (* main_~y~0 6)) main_~x~0) (= (mod main_~q~0 2) 0) (= (* (div (+ (* (div (+ (div (+ main_~r~0 (* (- 1) main_~x~0)) (- 2)) (* (- 2) main_~y~0)) main_~y~0) 2) (* (- 1) main_~q~0)) (- 2)) main_~y~0) (* main_~y~0 2)))} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {28934#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:35:13,029 INFO L290 TraceCheckUtils]: 156: Hoare triple {28934#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {28938#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:35:13,029 INFO L290 TraceCheckUtils]: 157: Hoare triple {28938#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {28452#false} is VALID [2022-04-28 11:35:13,029 INFO L290 TraceCheckUtils]: 158: Hoare triple {28452#false} assume !false; {28452#false} is VALID [2022-04-28 11:35:13,030 INFO L134 CoverageAnalysis]: Checked inductivity of 1138 backedges. 207 proven. 147 refuted. 0 times theorem prover too weak. 784 trivial. 0 not checked. [2022-04-28 11:35:13,030 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:35:33,075 INFO L290 TraceCheckUtils]: 158: Hoare triple {28452#false} assume !false; {28452#false} is VALID [2022-04-28 11:35:33,075 INFO L290 TraceCheckUtils]: 157: Hoare triple {28938#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {28452#false} is VALID [2022-04-28 11:35:33,075 INFO L290 TraceCheckUtils]: 156: Hoare triple {28934#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {28938#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:35:33,076 INFO L272 TraceCheckUtils]: 155: Hoare triple {28954#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {28934#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:35:33,077 INFO L284 TraceCheckUtils]: 154: Hoare quadruple {28619#(not (= |__VERIFIER_assert_#in~cond| 0))} {28958#(or (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (not (= main_~b~0 (* main_~a~0 main_~y~0))))} #79#return; {28954#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:35:33,077 INFO L290 TraceCheckUtils]: 153: Hoare triple {28619#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {28619#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:35:33,077 INFO L290 TraceCheckUtils]: 152: Hoare triple {28968#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {28619#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:35:33,078 INFO L290 TraceCheckUtils]: 151: Hoare triple {28451#true} ~cond := #in~cond; {28968#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 11:35:33,078 INFO L272 TraceCheckUtils]: 150: Hoare triple {28958#(or (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (not (= main_~b~0 (* main_~a~0 main_~y~0))))} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {28451#true} is VALID [2022-04-28 11:35:33,078 INFO L290 TraceCheckUtils]: 149: Hoare triple {28958#(or (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (not (= main_~b~0 (* main_~a~0 main_~y~0))))} assume !!(#t~post6 < 20);havoc #t~post6; {28958#(or (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (not (= main_~b~0 (* main_~a~0 main_~y~0))))} is VALID [2022-04-28 11:35:33,078 INFO L290 TraceCheckUtils]: 148: Hoare triple {28958#(or (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (not (= main_~b~0 (* main_~a~0 main_~y~0))))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {28958#(or (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (not (= main_~b~0 (* main_~a~0 main_~y~0))))} is VALID [2022-04-28 11:35:33,086 INFO L290 TraceCheckUtils]: 147: Hoare triple {28958#(or (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (not (= main_~b~0 (* main_~a~0 main_~y~0))))} ~r~0 := ~r~0 - ~b~0;~q~0 := ~q~0 + ~a~0; {28958#(or (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (not (= main_~b~0 (* main_~a~0 main_~y~0))))} is VALID [2022-04-28 11:35:33,087 INFO L290 TraceCheckUtils]: 146: Hoare triple {28958#(or (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (not (= main_~b~0 (* main_~a~0 main_~y~0))))} assume !(~r~0 >= 2 * ~b~0); {28958#(or (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (not (= main_~b~0 (* main_~a~0 main_~y~0))))} is VALID [2022-04-28 11:35:33,088 INFO L284 TraceCheckUtils]: 145: Hoare quadruple {28451#true} {28958#(or (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (not (= main_~b~0 (* main_~a~0 main_~y~0))))} #87#return; {28958#(or (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (not (= main_~b~0 (* main_~a~0 main_~y~0))))} is VALID [2022-04-28 11:35:33,088 INFO L290 TraceCheckUtils]: 144: Hoare triple {28451#true} assume true; {28451#true} is VALID [2022-04-28 11:35:33,088 INFO L290 TraceCheckUtils]: 143: Hoare triple {28451#true} assume !(0 == ~cond); {28451#true} is VALID [2022-04-28 11:35:33,088 INFO L290 TraceCheckUtils]: 142: Hoare triple {28451#true} ~cond := #in~cond; {28451#true} is VALID [2022-04-28 11:35:33,088 INFO L272 TraceCheckUtils]: 141: Hoare triple {28958#(or (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (not (= main_~b~0 (* main_~a~0 main_~y~0))))} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {28451#true} is VALID [2022-04-28 11:35:33,088 INFO L284 TraceCheckUtils]: 140: Hoare quadruple {28619#(not (= |__VERIFIER_assert_#in~cond| 0))} {28451#true} #85#return; {28958#(or (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (not (= main_~b~0 (* main_~a~0 main_~y~0))))} is VALID [2022-04-28 11:35:33,089 INFO L290 TraceCheckUtils]: 139: Hoare triple {28619#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {28619#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:35:33,089 INFO L290 TraceCheckUtils]: 138: Hoare triple {28968#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {28619#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:35:33,089 INFO L290 TraceCheckUtils]: 137: Hoare triple {28451#true} ~cond := #in~cond; {28968#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 11:35:33,089 INFO L272 TraceCheckUtils]: 136: Hoare triple {28451#true} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {28451#true} is VALID [2022-04-28 11:35:33,089 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {28451#true} {28451#true} #83#return; {28451#true} is VALID [2022-04-28 11:35:33,090 INFO L290 TraceCheckUtils]: 134: Hoare triple {28451#true} assume true; {28451#true} is VALID [2022-04-28 11:35:33,090 INFO L290 TraceCheckUtils]: 133: Hoare triple {28451#true} assume !(0 == ~cond); {28451#true} is VALID [2022-04-28 11:35:33,090 INFO L290 TraceCheckUtils]: 132: Hoare triple {28451#true} ~cond := #in~cond; {28451#true} is VALID [2022-04-28 11:35:33,090 INFO L272 TraceCheckUtils]: 131: Hoare triple {28451#true} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {28451#true} is VALID [2022-04-28 11:35:33,090 INFO L290 TraceCheckUtils]: 130: Hoare triple {28451#true} assume !!(#t~post7 < 20);havoc #t~post7; {28451#true} is VALID [2022-04-28 11:35:33,090 INFO L290 TraceCheckUtils]: 129: Hoare triple {28451#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {28451#true} is VALID [2022-04-28 11:35:33,090 INFO L290 TraceCheckUtils]: 128: Hoare triple {28451#true} ~a~0 := 2 * ~a~0;~b~0 := 2 * ~b~0; {28451#true} is VALID [2022-04-28 11:35:33,090 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {28451#true} {28451#true} #89#return; {28451#true} is VALID [2022-04-28 11:35:33,090 INFO L290 TraceCheckUtils]: 126: Hoare triple {28451#true} assume true; {28451#true} is VALID [2022-04-28 11:35:33,090 INFO L290 TraceCheckUtils]: 125: Hoare triple {28451#true} assume !(0 == ~cond); {28451#true} is VALID [2022-04-28 11:35:33,090 INFO L290 TraceCheckUtils]: 124: Hoare triple {28451#true} ~cond := #in~cond; {28451#true} is VALID [2022-04-28 11:35:33,090 INFO L272 TraceCheckUtils]: 123: Hoare triple {28451#true} call __VERIFIER_assert((if ~r~0 >= 2 * ~y~0 * ~a~0 then 1 else 0)); {28451#true} is VALID [2022-04-28 11:35:33,090 INFO L290 TraceCheckUtils]: 122: Hoare triple {28451#true} assume !!(~r~0 >= 2 * ~b~0); {28451#true} is VALID [2022-04-28 11:35:33,090 INFO L284 TraceCheckUtils]: 121: Hoare quadruple {28451#true} {28451#true} #87#return; {28451#true} is VALID [2022-04-28 11:35:33,090 INFO L290 TraceCheckUtils]: 120: Hoare triple {28451#true} assume true; {28451#true} is VALID [2022-04-28 11:35:33,090 INFO L290 TraceCheckUtils]: 119: Hoare triple {28451#true} assume !(0 == ~cond); {28451#true} is VALID [2022-04-28 11:35:33,090 INFO L290 TraceCheckUtils]: 118: Hoare triple {28451#true} ~cond := #in~cond; {28451#true} is VALID [2022-04-28 11:35:33,090 INFO L272 TraceCheckUtils]: 117: Hoare triple {28451#true} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {28451#true} is VALID [2022-04-28 11:35:33,090 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {28451#true} {28451#true} #85#return; {28451#true} is VALID [2022-04-28 11:35:33,091 INFO L290 TraceCheckUtils]: 115: Hoare triple {28451#true} assume true; {28451#true} is VALID [2022-04-28 11:35:33,091 INFO L290 TraceCheckUtils]: 114: Hoare triple {28451#true} assume !(0 == ~cond); {28451#true} is VALID [2022-04-28 11:35:33,091 INFO L290 TraceCheckUtils]: 113: Hoare triple {28451#true} ~cond := #in~cond; {28451#true} is VALID [2022-04-28 11:35:33,091 INFO L272 TraceCheckUtils]: 112: Hoare triple {28451#true} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {28451#true} is VALID [2022-04-28 11:35:33,091 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {28451#true} {28451#true} #83#return; {28451#true} is VALID [2022-04-28 11:35:33,091 INFO L290 TraceCheckUtils]: 110: Hoare triple {28451#true} assume true; {28451#true} is VALID [2022-04-28 11:35:33,091 INFO L290 TraceCheckUtils]: 109: Hoare triple {28451#true} assume !(0 == ~cond); {28451#true} is VALID [2022-04-28 11:35:33,091 INFO L290 TraceCheckUtils]: 108: Hoare triple {28451#true} ~cond := #in~cond; {28451#true} is VALID [2022-04-28 11:35:33,091 INFO L272 TraceCheckUtils]: 107: Hoare triple {28451#true} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {28451#true} is VALID [2022-04-28 11:35:33,091 INFO L290 TraceCheckUtils]: 106: Hoare triple {28451#true} assume !!(#t~post7 < 20);havoc #t~post7; {28451#true} is VALID [2022-04-28 11:35:33,091 INFO L290 TraceCheckUtils]: 105: Hoare triple {28451#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {28451#true} is VALID [2022-04-28 11:35:33,091 INFO L290 TraceCheckUtils]: 104: Hoare triple {28451#true} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {28451#true} is VALID [2022-04-28 11:35:33,091 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {28451#true} {28451#true} #81#return; {28451#true} is VALID [2022-04-28 11:35:33,091 INFO L290 TraceCheckUtils]: 102: Hoare triple {28451#true} assume true; {28451#true} is VALID [2022-04-28 11:35:33,091 INFO L290 TraceCheckUtils]: 101: Hoare triple {28451#true} assume !(0 == ~cond); {28451#true} is VALID [2022-04-28 11:35:33,091 INFO L290 TraceCheckUtils]: 100: Hoare triple {28451#true} ~cond := #in~cond; {28451#true} is VALID [2022-04-28 11:35:33,091 INFO L272 TraceCheckUtils]: 99: Hoare triple {28451#true} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {28451#true} is VALID [2022-04-28 11:35:33,091 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {28451#true} {28451#true} #79#return; {28451#true} is VALID [2022-04-28 11:35:33,091 INFO L290 TraceCheckUtils]: 97: Hoare triple {28451#true} assume true; {28451#true} is VALID [2022-04-28 11:35:33,092 INFO L290 TraceCheckUtils]: 96: Hoare triple {28451#true} assume !(0 == ~cond); {28451#true} is VALID [2022-04-28 11:35:33,092 INFO L290 TraceCheckUtils]: 95: Hoare triple {28451#true} ~cond := #in~cond; {28451#true} is VALID [2022-04-28 11:35:33,092 INFO L272 TraceCheckUtils]: 94: Hoare triple {28451#true} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {28451#true} is VALID [2022-04-28 11:35:33,092 INFO L290 TraceCheckUtils]: 93: Hoare triple {28451#true} assume !!(#t~post6 < 20);havoc #t~post6; {28451#true} is VALID [2022-04-28 11:35:33,092 INFO L290 TraceCheckUtils]: 92: Hoare triple {28451#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {28451#true} is VALID [2022-04-28 11:35:33,092 INFO L290 TraceCheckUtils]: 91: Hoare triple {28451#true} ~r~0 := ~r~0 - ~b~0;~q~0 := ~q~0 + ~a~0; {28451#true} is VALID [2022-04-28 11:35:33,092 INFO L290 TraceCheckUtils]: 90: Hoare triple {28451#true} assume !(~r~0 >= 2 * ~b~0); {28451#true} is VALID [2022-04-28 11:35:33,092 INFO L284 TraceCheckUtils]: 89: Hoare quadruple {28451#true} {28451#true} #87#return; {28451#true} is VALID [2022-04-28 11:35:33,092 INFO L290 TraceCheckUtils]: 88: Hoare triple {28451#true} assume true; {28451#true} is VALID [2022-04-28 11:35:33,092 INFO L290 TraceCheckUtils]: 87: Hoare triple {28451#true} assume !(0 == ~cond); {28451#true} is VALID [2022-04-28 11:35:33,092 INFO L290 TraceCheckUtils]: 86: Hoare triple {28451#true} ~cond := #in~cond; {28451#true} is VALID [2022-04-28 11:35:33,092 INFO L272 TraceCheckUtils]: 85: Hoare triple {28451#true} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {28451#true} is VALID [2022-04-28 11:35:33,092 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {28451#true} {28451#true} #85#return; {28451#true} is VALID [2022-04-28 11:35:33,092 INFO L290 TraceCheckUtils]: 83: Hoare triple {28451#true} assume true; {28451#true} is VALID [2022-04-28 11:35:33,092 INFO L290 TraceCheckUtils]: 82: Hoare triple {28451#true} assume !(0 == ~cond); {28451#true} is VALID [2022-04-28 11:35:33,092 INFO L290 TraceCheckUtils]: 81: Hoare triple {28451#true} ~cond := #in~cond; {28451#true} is VALID [2022-04-28 11:35:33,092 INFO L272 TraceCheckUtils]: 80: Hoare triple {28451#true} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {28451#true} is VALID [2022-04-28 11:35:33,092 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {28451#true} {28451#true} #83#return; {28451#true} is VALID [2022-04-28 11:35:33,093 INFO L290 TraceCheckUtils]: 78: Hoare triple {28451#true} assume true; {28451#true} is VALID [2022-04-28 11:35:33,093 INFO L290 TraceCheckUtils]: 77: Hoare triple {28451#true} assume !(0 == ~cond); {28451#true} is VALID [2022-04-28 11:35:33,093 INFO L290 TraceCheckUtils]: 76: Hoare triple {28451#true} ~cond := #in~cond; {28451#true} is VALID [2022-04-28 11:35:33,093 INFO L272 TraceCheckUtils]: 75: Hoare triple {28451#true} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {28451#true} is VALID [2022-04-28 11:35:33,093 INFO L290 TraceCheckUtils]: 74: Hoare triple {28451#true} assume !!(#t~post7 < 20);havoc #t~post7; {28451#true} is VALID [2022-04-28 11:35:33,093 INFO L290 TraceCheckUtils]: 73: Hoare triple {28451#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {28451#true} is VALID [2022-04-28 11:35:33,093 INFO L290 TraceCheckUtils]: 72: Hoare triple {28451#true} ~a~0 := 2 * ~a~0;~b~0 := 2 * ~b~0; {28451#true} is VALID [2022-04-28 11:35:33,093 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {28451#true} {28451#true} #89#return; {28451#true} is VALID [2022-04-28 11:35:33,093 INFO L290 TraceCheckUtils]: 70: Hoare triple {28451#true} assume true; {28451#true} is VALID [2022-04-28 11:35:33,093 INFO L290 TraceCheckUtils]: 69: Hoare triple {28451#true} assume !(0 == ~cond); {28451#true} is VALID [2022-04-28 11:35:33,093 INFO L290 TraceCheckUtils]: 68: Hoare triple {28451#true} ~cond := #in~cond; {28451#true} is VALID [2022-04-28 11:35:33,093 INFO L272 TraceCheckUtils]: 67: Hoare triple {28451#true} call __VERIFIER_assert((if ~r~0 >= 2 * ~y~0 * ~a~0 then 1 else 0)); {28451#true} is VALID [2022-04-28 11:35:33,093 INFO L290 TraceCheckUtils]: 66: Hoare triple {28451#true} assume !!(~r~0 >= 2 * ~b~0); {28451#true} is VALID [2022-04-28 11:35:33,093 INFO L284 TraceCheckUtils]: 65: Hoare quadruple {28451#true} {28451#true} #87#return; {28451#true} is VALID [2022-04-28 11:35:33,093 INFO L290 TraceCheckUtils]: 64: Hoare triple {28451#true} assume true; {28451#true} is VALID [2022-04-28 11:35:33,093 INFO L290 TraceCheckUtils]: 63: Hoare triple {28451#true} assume !(0 == ~cond); {28451#true} is VALID [2022-04-28 11:35:33,093 INFO L290 TraceCheckUtils]: 62: Hoare triple {28451#true} ~cond := #in~cond; {28451#true} is VALID [2022-04-28 11:35:33,093 INFO L272 TraceCheckUtils]: 61: Hoare triple {28451#true} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {28451#true} is VALID [2022-04-28 11:35:33,093 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {28451#true} {28451#true} #85#return; {28451#true} is VALID [2022-04-28 11:35:33,094 INFO L290 TraceCheckUtils]: 59: Hoare triple {28451#true} assume true; {28451#true} is VALID [2022-04-28 11:35:33,094 INFO L290 TraceCheckUtils]: 58: Hoare triple {28451#true} assume !(0 == ~cond); {28451#true} is VALID [2022-04-28 11:35:33,094 INFO L290 TraceCheckUtils]: 57: Hoare triple {28451#true} ~cond := #in~cond; {28451#true} is VALID [2022-04-28 11:35:33,094 INFO L272 TraceCheckUtils]: 56: Hoare triple {28451#true} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {28451#true} is VALID [2022-04-28 11:35:33,094 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {28451#true} {28451#true} #83#return; {28451#true} is VALID [2022-04-28 11:35:33,094 INFO L290 TraceCheckUtils]: 54: Hoare triple {28451#true} assume true; {28451#true} is VALID [2022-04-28 11:35:33,094 INFO L290 TraceCheckUtils]: 53: Hoare triple {28451#true} assume !(0 == ~cond); {28451#true} is VALID [2022-04-28 11:35:33,094 INFO L290 TraceCheckUtils]: 52: Hoare triple {28451#true} ~cond := #in~cond; {28451#true} is VALID [2022-04-28 11:35:33,094 INFO L272 TraceCheckUtils]: 51: Hoare triple {28451#true} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {28451#true} is VALID [2022-04-28 11:35:33,094 INFO L290 TraceCheckUtils]: 50: Hoare triple {28451#true} assume !!(#t~post7 < 20);havoc #t~post7; {28451#true} is VALID [2022-04-28 11:35:33,094 INFO L290 TraceCheckUtils]: 49: Hoare triple {28451#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {28451#true} is VALID [2022-04-28 11:35:33,094 INFO L290 TraceCheckUtils]: 48: Hoare triple {28451#true} ~a~0 := 2 * ~a~0;~b~0 := 2 * ~b~0; {28451#true} is VALID [2022-04-28 11:35:33,094 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {28451#true} {28451#true} #89#return; {28451#true} is VALID [2022-04-28 11:35:33,094 INFO L290 TraceCheckUtils]: 46: Hoare triple {28451#true} assume true; {28451#true} is VALID [2022-04-28 11:35:33,094 INFO L290 TraceCheckUtils]: 45: Hoare triple {28451#true} assume !(0 == ~cond); {28451#true} is VALID [2022-04-28 11:35:33,094 INFO L290 TraceCheckUtils]: 44: Hoare triple {28451#true} ~cond := #in~cond; {28451#true} is VALID [2022-04-28 11:35:33,094 INFO L272 TraceCheckUtils]: 43: Hoare triple {28451#true} call __VERIFIER_assert((if ~r~0 >= 2 * ~y~0 * ~a~0 then 1 else 0)); {28451#true} is VALID [2022-04-28 11:35:33,094 INFO L290 TraceCheckUtils]: 42: Hoare triple {28451#true} assume !!(~r~0 >= 2 * ~b~0); {28451#true} is VALID [2022-04-28 11:35:33,095 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {28451#true} {28451#true} #87#return; {28451#true} is VALID [2022-04-28 11:35:33,095 INFO L290 TraceCheckUtils]: 40: Hoare triple {28451#true} assume true; {28451#true} is VALID [2022-04-28 11:35:33,095 INFO L290 TraceCheckUtils]: 39: Hoare triple {28451#true} assume !(0 == ~cond); {28451#true} is VALID [2022-04-28 11:35:33,095 INFO L290 TraceCheckUtils]: 38: Hoare triple {28451#true} ~cond := #in~cond; {28451#true} is VALID [2022-04-28 11:35:33,095 INFO L272 TraceCheckUtils]: 37: Hoare triple {28451#true} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {28451#true} is VALID [2022-04-28 11:35:33,095 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {28451#true} {28451#true} #85#return; {28451#true} is VALID [2022-04-28 11:35:33,095 INFO L290 TraceCheckUtils]: 35: Hoare triple {28451#true} assume true; {28451#true} is VALID [2022-04-28 11:35:33,095 INFO L290 TraceCheckUtils]: 34: Hoare triple {28451#true} assume !(0 == ~cond); {28451#true} is VALID [2022-04-28 11:35:33,095 INFO L290 TraceCheckUtils]: 33: Hoare triple {28451#true} ~cond := #in~cond; {28451#true} is VALID [2022-04-28 11:35:33,095 INFO L272 TraceCheckUtils]: 32: Hoare triple {28451#true} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {28451#true} is VALID [2022-04-28 11:35:33,095 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {28451#true} {28451#true} #83#return; {28451#true} is VALID [2022-04-28 11:35:33,095 INFO L290 TraceCheckUtils]: 30: Hoare triple {28451#true} assume true; {28451#true} is VALID [2022-04-28 11:35:33,095 INFO L290 TraceCheckUtils]: 29: Hoare triple {28451#true} assume !(0 == ~cond); {28451#true} is VALID [2022-04-28 11:35:33,095 INFO L290 TraceCheckUtils]: 28: Hoare triple {28451#true} ~cond := #in~cond; {28451#true} is VALID [2022-04-28 11:35:33,095 INFO L272 TraceCheckUtils]: 27: Hoare triple {28451#true} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {28451#true} is VALID [2022-04-28 11:35:33,095 INFO L290 TraceCheckUtils]: 26: Hoare triple {28451#true} assume !!(#t~post7 < 20);havoc #t~post7; {28451#true} is VALID [2022-04-28 11:35:33,095 INFO L290 TraceCheckUtils]: 25: Hoare triple {28451#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {28451#true} is VALID [2022-04-28 11:35:33,095 INFO L290 TraceCheckUtils]: 24: Hoare triple {28451#true} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {28451#true} is VALID [2022-04-28 11:35:33,095 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {28451#true} {28451#true} #81#return; {28451#true} is VALID [2022-04-28 11:35:33,096 INFO L290 TraceCheckUtils]: 22: Hoare triple {28451#true} assume true; {28451#true} is VALID [2022-04-28 11:35:33,096 INFO L290 TraceCheckUtils]: 21: Hoare triple {28451#true} assume !(0 == ~cond); {28451#true} is VALID [2022-04-28 11:35:33,096 INFO L290 TraceCheckUtils]: 20: Hoare triple {28451#true} ~cond := #in~cond; {28451#true} is VALID [2022-04-28 11:35:33,096 INFO L272 TraceCheckUtils]: 19: Hoare triple {28451#true} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {28451#true} is VALID [2022-04-28 11:35:33,096 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {28451#true} {28451#true} #79#return; {28451#true} is VALID [2022-04-28 11:35:33,096 INFO L290 TraceCheckUtils]: 17: Hoare triple {28451#true} assume true; {28451#true} is VALID [2022-04-28 11:35:33,096 INFO L290 TraceCheckUtils]: 16: Hoare triple {28451#true} assume !(0 == ~cond); {28451#true} is VALID [2022-04-28 11:35:33,096 INFO L290 TraceCheckUtils]: 15: Hoare triple {28451#true} ~cond := #in~cond; {28451#true} is VALID [2022-04-28 11:35:33,096 INFO L272 TraceCheckUtils]: 14: Hoare triple {28451#true} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {28451#true} is VALID [2022-04-28 11:35:33,096 INFO L290 TraceCheckUtils]: 13: Hoare triple {28451#true} assume !!(#t~post6 < 20);havoc #t~post6; {28451#true} is VALID [2022-04-28 11:35:33,096 INFO L290 TraceCheckUtils]: 12: Hoare triple {28451#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {28451#true} is VALID [2022-04-28 11:35:33,096 INFO L290 TraceCheckUtils]: 11: Hoare triple {28451#true} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {28451#true} is VALID [2022-04-28 11:35:33,096 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {28451#true} {28451#true} #77#return; {28451#true} is VALID [2022-04-28 11:35:33,096 INFO L290 TraceCheckUtils]: 9: Hoare triple {28451#true} assume true; {28451#true} is VALID [2022-04-28 11:35:33,096 INFO L290 TraceCheckUtils]: 8: Hoare triple {28451#true} assume !(0 == ~cond); {28451#true} is VALID [2022-04-28 11:35:33,096 INFO L290 TraceCheckUtils]: 7: Hoare triple {28451#true} ~cond := #in~cond; {28451#true} is VALID [2022-04-28 11:35:33,096 INFO L272 TraceCheckUtils]: 6: Hoare triple {28451#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {28451#true} is VALID [2022-04-28 11:35:33,096 INFO L290 TraceCheckUtils]: 5: Hoare triple {28451#true} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~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; {28451#true} is VALID [2022-04-28 11:35:33,096 INFO L272 TraceCheckUtils]: 4: Hoare triple {28451#true} call #t~ret8 := main(); {28451#true} is VALID [2022-04-28 11:35:33,096 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28451#true} {28451#true} #93#return; {28451#true} is VALID [2022-04-28 11:35:33,097 INFO L290 TraceCheckUtils]: 2: Hoare triple {28451#true} assume true; {28451#true} is VALID [2022-04-28 11:35:33,097 INFO L290 TraceCheckUtils]: 1: Hoare triple {28451#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(14, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {28451#true} is VALID [2022-04-28 11:35:33,097 INFO L272 TraceCheckUtils]: 0: Hoare triple {28451#true} call ULTIMATE.init(); {28451#true} is VALID [2022-04-28 11:35:33,097 INFO L134 CoverageAnalysis]: Checked inductivity of 1138 backedges. 184 proven. 5 refuted. 0 times theorem prover too weak. 949 trivial. 0 not checked. [2022-04-28 11:35:33,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:35:33,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039229431] [2022-04-28 11:35:33,097 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:35:33,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1386542122] [2022-04-28 11:35:33,097 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1386542122] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 11:35:33,098 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 11:35:33,098 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 8] total 20 [2022-04-28 11:35:33,099 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:35:33,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [652614119] [2022-04-28 11:35:33,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [652614119] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:35:33,099 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:35:33,099 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-28 11:35:33,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010444854] [2022-04-28 11:35:33,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:35:33,100 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.75) internal successors, (44), 14 states have internal predecessors, (44), 12 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (25), 9 states have call predecessors, (25), 11 states have call successors, (25) Word has length 159 [2022-04-28 11:35:33,100 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:35:33,100 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 16 states have (on average 2.75) internal successors, (44), 14 states have internal predecessors, (44), 12 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (25), 9 states have call predecessors, (25), 11 states have call successors, (25) [2022-04-28 11:35:33,262 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:35:33,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-28 11:35:33,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:35:33,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-28 11:35:33,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2022-04-28 11:35:33,263 INFO L87 Difference]: Start difference. First operand 348 states and 398 transitions. Second operand has 17 states, 16 states have (on average 2.75) internal successors, (44), 14 states have internal predecessors, (44), 12 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (25), 9 states have call predecessors, (25), 11 states have call successors, (25) [2022-04-28 11:35:45,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:35:45,169 INFO L93 Difference]: Finished difference Result 382 states and 444 transitions. [2022-04-28 11:35:45,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-28 11:35:45,169 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.75) internal successors, (44), 14 states have internal predecessors, (44), 12 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (25), 9 states have call predecessors, (25), 11 states have call successors, (25) Word has length 159 [2022-04-28 11:35:45,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:35:45,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 2.75) internal successors, (44), 14 states have internal predecessors, (44), 12 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (25), 9 states have call predecessors, (25), 11 states have call successors, (25) [2022-04-28 11:35:45,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 178 transitions. [2022-04-28 11:35:45,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 2.75) internal successors, (44), 14 states have internal predecessors, (44), 12 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (25), 9 states have call predecessors, (25), 11 states have call successors, (25) [2022-04-28 11:35:45,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 178 transitions. [2022-04-28 11:35:45,176 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 178 transitions. [2022-04-28 11:35:45,488 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 178 edges. 178 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:35:45,495 INFO L225 Difference]: With dead ends: 382 [2022-04-28 11:35:45,496 INFO L226 Difference]: Without dead ends: 379 [2022-04-28 11:35:45,496 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 320 GetRequests, 297 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=90, Invalid=416, Unknown=0, NotChecked=0, Total=506 [2022-04-28 11:35:45,496 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 51 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 1091 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 1150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 1091 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2022-04-28 11:35:45,496 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 433 Invalid, 1150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 1091 Invalid, 0 Unknown, 0 Unchecked, 5.2s Time] [2022-04-28 11:35:45,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2022-04-28 11:35:46,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 349. [2022-04-28 11:35:46,109 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:35:46,110 INFO L82 GeneralOperation]: Start isEquivalent. First operand 379 states. Second operand has 349 states, 226 states have (on average 1.092920353982301) internal successors, (247), 231 states have internal predecessors, (247), 77 states have call successors, (77), 47 states have call predecessors, (77), 45 states have return successors, (74), 70 states have call predecessors, (74), 74 states have call successors, (74) [2022-04-28 11:35:46,110 INFO L74 IsIncluded]: Start isIncluded. First operand 379 states. Second operand has 349 states, 226 states have (on average 1.092920353982301) internal successors, (247), 231 states have internal predecessors, (247), 77 states have call successors, (77), 47 states have call predecessors, (77), 45 states have return successors, (74), 70 states have call predecessors, (74), 74 states have call successors, (74) [2022-04-28 11:35:46,110 INFO L87 Difference]: Start difference. First operand 379 states. Second operand has 349 states, 226 states have (on average 1.092920353982301) internal successors, (247), 231 states have internal predecessors, (247), 77 states have call successors, (77), 47 states have call predecessors, (77), 45 states have return successors, (74), 70 states have call predecessors, (74), 74 states have call successors, (74) [2022-04-28 11:35:46,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:35:46,117 INFO L93 Difference]: Finished difference Result 379 states and 440 transitions. [2022-04-28 11:35:46,117 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 440 transitions. [2022-04-28 11:35:46,118 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:35:46,118 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:35:46,119 INFO L74 IsIncluded]: Start isIncluded. First operand has 349 states, 226 states have (on average 1.092920353982301) internal successors, (247), 231 states have internal predecessors, (247), 77 states have call successors, (77), 47 states have call predecessors, (77), 45 states have return successors, (74), 70 states have call predecessors, (74), 74 states have call successors, (74) Second operand 379 states. [2022-04-28 11:35:46,119 INFO L87 Difference]: Start difference. First operand has 349 states, 226 states have (on average 1.092920353982301) internal successors, (247), 231 states have internal predecessors, (247), 77 states have call successors, (77), 47 states have call predecessors, (77), 45 states have return successors, (74), 70 states have call predecessors, (74), 74 states have call successors, (74) Second operand 379 states. [2022-04-28 11:35:46,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:35:46,126 INFO L93 Difference]: Finished difference Result 379 states and 440 transitions. [2022-04-28 11:35:46,126 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 440 transitions. [2022-04-28 11:35:46,126 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:35:46,126 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:35:46,126 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:35:46,126 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:35:46,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 226 states have (on average 1.092920353982301) internal successors, (247), 231 states have internal predecessors, (247), 77 states have call successors, (77), 47 states have call predecessors, (77), 45 states have return successors, (74), 70 states have call predecessors, (74), 74 states have call successors, (74) [2022-04-28 11:35:46,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 398 transitions. [2022-04-28 11:35:46,134 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 398 transitions. Word has length 159 [2022-04-28 11:35:46,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:35:46,134 INFO L495 AbstractCegarLoop]: Abstraction has 349 states and 398 transitions. [2022-04-28 11:35:46,134 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.75) internal successors, (44), 14 states have internal predecessors, (44), 12 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (25), 9 states have call predecessors, (25), 11 states have call successors, (25) [2022-04-28 11:35:46,134 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 349 states and 398 transitions. [2022-04-28 11:35:46,897 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 398 edges. 398 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:35:46,897 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 398 transitions. [2022-04-28 11:35:46,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2022-04-28 11:35:46,898 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:35:46,898 INFO L195 NwaCegarLoop]: trace histogram [24, 23, 23, 5, 5, 5, 5, 5, 5, 5, 5, 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] [2022-04-28 11:35:46,919 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-04-28 11:35:47,099 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:35:47,099 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:35:47,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:35:47,099 INFO L85 PathProgramCache]: Analyzing trace with hash -107439859, now seen corresponding path program 5 times [2022-04-28 11:35:47,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:35:47,099 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [194664901] [2022-04-28 11:36:29,420 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:36:29,420 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:36:29,420 INFO L85 PathProgramCache]: Analyzing trace with hash -107439859, now seen corresponding path program 6 times [2022-04-28 11:36:29,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:36:29,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446256058] [2022-04-28 11:36:29,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:36:29,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:36:29,433 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:36:29,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1447647515] [2022-04-28 11:36:29,433 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 11:36:29,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:36:29,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:36:29,441 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 11:36:29,442 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-04-28 11:36:29,529 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-28 11:36:29,529 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:36:29,531 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 34 conjunts are in the unsatisfiable core [2022-04-28 11:36:29,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:36:29,579 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:36:30,245 INFO L272 TraceCheckUtils]: 0: Hoare triple {31650#true} call ULTIMATE.init(); {31650#true} is VALID [2022-04-28 11:36:30,246 INFO L290 TraceCheckUtils]: 1: Hoare triple {31650#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(14, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {31650#true} is VALID [2022-04-28 11:36:30,246 INFO L290 TraceCheckUtils]: 2: Hoare triple {31650#true} assume true; {31650#true} is VALID [2022-04-28 11:36:30,246 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31650#true} {31650#true} #93#return; {31650#true} is VALID [2022-04-28 11:36:30,246 INFO L272 TraceCheckUtils]: 4: Hoare triple {31650#true} call #t~ret8 := main(); {31650#true} is VALID [2022-04-28 11:36:30,246 INFO L290 TraceCheckUtils]: 5: Hoare triple {31650#true} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~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; {31650#true} is VALID [2022-04-28 11:36:30,246 INFO L272 TraceCheckUtils]: 6: Hoare triple {31650#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {31650#true} is VALID [2022-04-28 11:36:30,246 INFO L290 TraceCheckUtils]: 7: Hoare triple {31650#true} ~cond := #in~cond; {31650#true} is VALID [2022-04-28 11:36:30,246 INFO L290 TraceCheckUtils]: 8: Hoare triple {31650#true} assume !(0 == ~cond); {31650#true} is VALID [2022-04-28 11:36:30,246 INFO L290 TraceCheckUtils]: 9: Hoare triple {31650#true} assume true; {31650#true} is VALID [2022-04-28 11:36:30,246 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {31650#true} {31650#true} #77#return; {31650#true} is VALID [2022-04-28 11:36:30,247 INFO L290 TraceCheckUtils]: 11: Hoare triple {31650#true} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {31688#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:36:30,247 INFO L290 TraceCheckUtils]: 12: Hoare triple {31688#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {31688#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:36:30,247 INFO L290 TraceCheckUtils]: 13: Hoare triple {31688#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} assume !!(#t~post6 < 20);havoc #t~post6; {31688#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:36:30,247 INFO L272 TraceCheckUtils]: 14: Hoare triple {31688#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {31650#true} is VALID [2022-04-28 11:36:30,247 INFO L290 TraceCheckUtils]: 15: Hoare triple {31650#true} ~cond := #in~cond; {31650#true} is VALID [2022-04-28 11:36:30,247 INFO L290 TraceCheckUtils]: 16: Hoare triple {31650#true} assume !(0 == ~cond); {31650#true} is VALID [2022-04-28 11:36:30,248 INFO L290 TraceCheckUtils]: 17: Hoare triple {31650#true} assume true; {31650#true} is VALID [2022-04-28 11:36:30,248 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {31650#true} {31688#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #79#return; {31688#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:36:30,248 INFO L272 TraceCheckUtils]: 19: Hoare triple {31688#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {31650#true} is VALID [2022-04-28 11:36:30,248 INFO L290 TraceCheckUtils]: 20: Hoare triple {31650#true} ~cond := #in~cond; {31650#true} is VALID [2022-04-28 11:36:30,248 INFO L290 TraceCheckUtils]: 21: Hoare triple {31650#true} assume !(0 == ~cond); {31650#true} is VALID [2022-04-28 11:36:30,248 INFO L290 TraceCheckUtils]: 22: Hoare triple {31650#true} assume true; {31650#true} is VALID [2022-04-28 11:36:30,249 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {31650#true} {31688#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #81#return; {31688#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:36:30,249 INFO L290 TraceCheckUtils]: 24: Hoare triple {31688#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {31688#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:36:30,249 INFO L290 TraceCheckUtils]: 25: Hoare triple {31688#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {31688#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:36:30,250 INFO L290 TraceCheckUtils]: 26: Hoare triple {31688#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} assume !!(#t~post7 < 20);havoc #t~post7; {31688#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:36:30,250 INFO L272 TraceCheckUtils]: 27: Hoare triple {31688#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {31650#true} is VALID [2022-04-28 11:36:30,250 INFO L290 TraceCheckUtils]: 28: Hoare triple {31650#true} ~cond := #in~cond; {31650#true} is VALID [2022-04-28 11:36:30,250 INFO L290 TraceCheckUtils]: 29: Hoare triple {31650#true} assume !(0 == ~cond); {31650#true} is VALID [2022-04-28 11:36:30,250 INFO L290 TraceCheckUtils]: 30: Hoare triple {31650#true} assume true; {31650#true} is VALID [2022-04-28 11:36:30,250 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {31650#true} {31688#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #83#return; {31688#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:36:30,251 INFO L272 TraceCheckUtils]: 32: Hoare triple {31688#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {31650#true} is VALID [2022-04-28 11:36:30,251 INFO L290 TraceCheckUtils]: 33: Hoare triple {31650#true} ~cond := #in~cond; {31650#true} is VALID [2022-04-28 11:36:30,251 INFO L290 TraceCheckUtils]: 34: Hoare triple {31650#true} assume !(0 == ~cond); {31650#true} is VALID [2022-04-28 11:36:30,251 INFO L290 TraceCheckUtils]: 35: Hoare triple {31650#true} assume true; {31650#true} is VALID [2022-04-28 11:36:30,251 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {31650#true} {31688#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #85#return; {31688#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:36:30,251 INFO L272 TraceCheckUtils]: 37: Hoare triple {31688#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {31650#true} is VALID [2022-04-28 11:36:30,251 INFO L290 TraceCheckUtils]: 38: Hoare triple {31650#true} ~cond := #in~cond; {31650#true} is VALID [2022-04-28 11:36:30,251 INFO L290 TraceCheckUtils]: 39: Hoare triple {31650#true} assume !(0 == ~cond); {31650#true} is VALID [2022-04-28 11:36:30,251 INFO L290 TraceCheckUtils]: 40: Hoare triple {31650#true} assume true; {31650#true} is VALID [2022-04-28 11:36:30,252 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {31650#true} {31688#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #87#return; {31688#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:36:30,252 INFO L290 TraceCheckUtils]: 42: Hoare triple {31688#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} assume !!(~r~0 >= 2 * ~b~0); {31688#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:36:30,252 INFO L272 TraceCheckUtils]: 43: Hoare triple {31688#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~r~0 >= 2 * ~y~0 * ~a~0 then 1 else 0)); {31650#true} is VALID [2022-04-28 11:36:30,252 INFO L290 TraceCheckUtils]: 44: Hoare triple {31650#true} ~cond := #in~cond; {31650#true} is VALID [2022-04-28 11:36:30,252 INFO L290 TraceCheckUtils]: 45: Hoare triple {31650#true} assume !(0 == ~cond); {31650#true} is VALID [2022-04-28 11:36:30,252 INFO L290 TraceCheckUtils]: 46: Hoare triple {31650#true} assume true; {31650#true} is VALID [2022-04-28 11:36:30,253 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {31650#true} {31688#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #89#return; {31688#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:36:30,253 INFO L290 TraceCheckUtils]: 48: Hoare triple {31688#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} ~a~0 := 2 * ~a~0;~b~0 := 2 * ~b~0; {31688#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:36:30,253 INFO L290 TraceCheckUtils]: 49: Hoare triple {31688#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {31688#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:36:30,254 INFO L290 TraceCheckUtils]: 50: Hoare triple {31688#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} assume !!(#t~post7 < 20);havoc #t~post7; {31688#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:36:30,254 INFO L272 TraceCheckUtils]: 51: Hoare triple {31688#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {31650#true} is VALID [2022-04-28 11:36:30,254 INFO L290 TraceCheckUtils]: 52: Hoare triple {31650#true} ~cond := #in~cond; {31650#true} is VALID [2022-04-28 11:36:30,254 INFO L290 TraceCheckUtils]: 53: Hoare triple {31650#true} assume !(0 == ~cond); {31650#true} is VALID [2022-04-28 11:36:30,254 INFO L290 TraceCheckUtils]: 54: Hoare triple {31650#true} assume true; {31650#true} is VALID [2022-04-28 11:36:30,254 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {31650#true} {31688#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #83#return; {31688#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:36:30,254 INFO L272 TraceCheckUtils]: 56: Hoare triple {31688#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {31650#true} is VALID [2022-04-28 11:36:30,255 INFO L290 TraceCheckUtils]: 57: Hoare triple {31650#true} ~cond := #in~cond; {31650#true} is VALID [2022-04-28 11:36:30,255 INFO L290 TraceCheckUtils]: 58: Hoare triple {31650#true} assume !(0 == ~cond); {31650#true} is VALID [2022-04-28 11:36:30,255 INFO L290 TraceCheckUtils]: 59: Hoare triple {31650#true} assume true; {31650#true} is VALID [2022-04-28 11:36:30,255 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {31650#true} {31688#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #85#return; {31688#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:36:30,255 INFO L272 TraceCheckUtils]: 61: Hoare triple {31688#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {31650#true} is VALID [2022-04-28 11:36:30,255 INFO L290 TraceCheckUtils]: 62: Hoare triple {31650#true} ~cond := #in~cond; {31650#true} is VALID [2022-04-28 11:36:30,255 INFO L290 TraceCheckUtils]: 63: Hoare triple {31650#true} assume !(0 == ~cond); {31650#true} is VALID [2022-04-28 11:36:30,255 INFO L290 TraceCheckUtils]: 64: Hoare triple {31650#true} assume true; {31650#true} is VALID [2022-04-28 11:36:30,256 INFO L284 TraceCheckUtils]: 65: Hoare quadruple {31650#true} {31688#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #87#return; {31688#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:36:30,256 INFO L290 TraceCheckUtils]: 66: Hoare triple {31688#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} assume !!(~r~0 >= 2 * ~b~0); {31688#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:36:30,256 INFO L272 TraceCheckUtils]: 67: Hoare triple {31688#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~r~0 >= 2 * ~y~0 * ~a~0 then 1 else 0)); {31650#true} is VALID [2022-04-28 11:36:30,256 INFO L290 TraceCheckUtils]: 68: Hoare triple {31650#true} ~cond := #in~cond; {31650#true} is VALID [2022-04-28 11:36:30,256 INFO L290 TraceCheckUtils]: 69: Hoare triple {31650#true} assume !(0 == ~cond); {31650#true} is VALID [2022-04-28 11:36:30,256 INFO L290 TraceCheckUtils]: 70: Hoare triple {31650#true} assume true; {31650#true} is VALID [2022-04-28 11:36:30,257 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {31650#true} {31688#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #89#return; {31688#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:36:30,257 INFO L290 TraceCheckUtils]: 72: Hoare triple {31688#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} ~a~0 := 2 * ~a~0;~b~0 := 2 * ~b~0; {31688#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:36:30,257 INFO L290 TraceCheckUtils]: 73: Hoare triple {31688#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {31688#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:36:30,258 INFO L290 TraceCheckUtils]: 74: Hoare triple {31688#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} assume !!(#t~post7 < 20);havoc #t~post7; {31688#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:36:30,258 INFO L272 TraceCheckUtils]: 75: Hoare triple {31688#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {31650#true} is VALID [2022-04-28 11:36:30,258 INFO L290 TraceCheckUtils]: 76: Hoare triple {31650#true} ~cond := #in~cond; {31650#true} is VALID [2022-04-28 11:36:30,258 INFO L290 TraceCheckUtils]: 77: Hoare triple {31650#true} assume !(0 == ~cond); {31650#true} is VALID [2022-04-28 11:36:30,258 INFO L290 TraceCheckUtils]: 78: Hoare triple {31650#true} assume true; {31650#true} is VALID [2022-04-28 11:36:30,258 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {31650#true} {31688#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #83#return; {31688#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:36:30,259 INFO L272 TraceCheckUtils]: 80: Hoare triple {31688#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {31650#true} is VALID [2022-04-28 11:36:30,259 INFO L290 TraceCheckUtils]: 81: Hoare triple {31650#true} ~cond := #in~cond; {31650#true} is VALID [2022-04-28 11:36:30,259 INFO L290 TraceCheckUtils]: 82: Hoare triple {31650#true} assume !(0 == ~cond); {31650#true} is VALID [2022-04-28 11:36:30,259 INFO L290 TraceCheckUtils]: 83: Hoare triple {31650#true} assume true; {31650#true} is VALID [2022-04-28 11:36:30,259 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {31650#true} {31688#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #85#return; {31688#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:36:30,259 INFO L272 TraceCheckUtils]: 85: Hoare triple {31688#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {31650#true} is VALID [2022-04-28 11:36:30,259 INFO L290 TraceCheckUtils]: 86: Hoare triple {31650#true} ~cond := #in~cond; {31650#true} is VALID [2022-04-28 11:36:30,259 INFO L290 TraceCheckUtils]: 87: Hoare triple {31650#true} assume !(0 == ~cond); {31650#true} is VALID [2022-04-28 11:36:30,259 INFO L290 TraceCheckUtils]: 88: Hoare triple {31650#true} assume true; {31650#true} is VALID [2022-04-28 11:36:30,260 INFO L284 TraceCheckUtils]: 89: Hoare quadruple {31650#true} {31688#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #87#return; {31688#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:36:30,260 INFO L290 TraceCheckUtils]: 90: Hoare triple {31688#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} assume !!(~r~0 >= 2 * ~b~0); {31688#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:36:30,260 INFO L272 TraceCheckUtils]: 91: Hoare triple {31688#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~r~0 >= 2 * ~y~0 * ~a~0 then 1 else 0)); {31650#true} is VALID [2022-04-28 11:36:30,260 INFO L290 TraceCheckUtils]: 92: Hoare triple {31650#true} ~cond := #in~cond; {31650#true} is VALID [2022-04-28 11:36:30,260 INFO L290 TraceCheckUtils]: 93: Hoare triple {31650#true} assume !(0 == ~cond); {31650#true} is VALID [2022-04-28 11:36:30,260 INFO L290 TraceCheckUtils]: 94: Hoare triple {31650#true} assume true; {31650#true} is VALID [2022-04-28 11:36:30,261 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {31650#true} {31688#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #89#return; {31688#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:36:30,261 INFO L290 TraceCheckUtils]: 96: Hoare triple {31688#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} ~a~0 := 2 * ~a~0;~b~0 := 2 * ~b~0; {31688#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:36:30,261 INFO L290 TraceCheckUtils]: 97: Hoare triple {31688#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {31688#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:36:30,262 INFO L290 TraceCheckUtils]: 98: Hoare triple {31688#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} assume !!(#t~post7 < 20);havoc #t~post7; {31688#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:36:30,262 INFO L272 TraceCheckUtils]: 99: Hoare triple {31688#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {31650#true} is VALID [2022-04-28 11:36:30,262 INFO L290 TraceCheckUtils]: 100: Hoare triple {31650#true} ~cond := #in~cond; {31650#true} is VALID [2022-04-28 11:36:30,262 INFO L290 TraceCheckUtils]: 101: Hoare triple {31650#true} assume !(0 == ~cond); {31650#true} is VALID [2022-04-28 11:36:30,262 INFO L290 TraceCheckUtils]: 102: Hoare triple {31650#true} assume true; {31650#true} is VALID [2022-04-28 11:36:30,262 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {31650#true} {31688#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #83#return; {31688#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:36:30,263 INFO L272 TraceCheckUtils]: 104: Hoare triple {31688#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {31650#true} is VALID [2022-04-28 11:36:30,263 INFO L290 TraceCheckUtils]: 105: Hoare triple {31650#true} ~cond := #in~cond; {31650#true} is VALID [2022-04-28 11:36:30,263 INFO L290 TraceCheckUtils]: 106: Hoare triple {31650#true} assume !(0 == ~cond); {31650#true} is VALID [2022-04-28 11:36:30,263 INFO L290 TraceCheckUtils]: 107: Hoare triple {31650#true} assume true; {31650#true} is VALID [2022-04-28 11:36:30,263 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {31650#true} {31688#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #85#return; {31688#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:36:30,263 INFO L272 TraceCheckUtils]: 109: Hoare triple {31688#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {31650#true} is VALID [2022-04-28 11:36:30,263 INFO L290 TraceCheckUtils]: 110: Hoare triple {31650#true} ~cond := #in~cond; {31650#true} is VALID [2022-04-28 11:36:30,263 INFO L290 TraceCheckUtils]: 111: Hoare triple {31650#true} assume !(0 == ~cond); {31650#true} is VALID [2022-04-28 11:36:30,263 INFO L290 TraceCheckUtils]: 112: Hoare triple {31650#true} assume true; {31650#true} is VALID [2022-04-28 11:36:30,264 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {31650#true} {31688#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #87#return; {31688#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:36:30,264 INFO L290 TraceCheckUtils]: 114: Hoare triple {31688#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} assume !(~r~0 >= 2 * ~b~0); {31688#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:36:30,265 INFO L290 TraceCheckUtils]: 115: Hoare triple {31688#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} ~r~0 := ~r~0 - ~b~0;~q~0 := ~q~0 + ~a~0; {32001#(and (= main_~x~0 (+ main_~b~0 main_~r~0)) (= main_~a~0 main_~q~0))} is VALID [2022-04-28 11:36:30,266 INFO L290 TraceCheckUtils]: 116: Hoare triple {32001#(and (= main_~x~0 (+ main_~b~0 main_~r~0)) (= main_~a~0 main_~q~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {32001#(and (= main_~x~0 (+ main_~b~0 main_~r~0)) (= main_~a~0 main_~q~0))} is VALID [2022-04-28 11:36:30,266 INFO L290 TraceCheckUtils]: 117: Hoare triple {32001#(and (= main_~x~0 (+ main_~b~0 main_~r~0)) (= main_~a~0 main_~q~0))} assume !!(#t~post6 < 20);havoc #t~post6; {32001#(and (= main_~x~0 (+ main_~b~0 main_~r~0)) (= main_~a~0 main_~q~0))} is VALID [2022-04-28 11:36:30,266 INFO L272 TraceCheckUtils]: 118: Hoare triple {32001#(and (= main_~x~0 (+ main_~b~0 main_~r~0)) (= main_~a~0 main_~q~0))} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {31650#true} is VALID [2022-04-28 11:36:30,266 INFO L290 TraceCheckUtils]: 119: Hoare triple {31650#true} ~cond := #in~cond; {32014#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:36:30,267 INFO L290 TraceCheckUtils]: 120: Hoare triple {32014#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {32018#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:36:30,267 INFO L290 TraceCheckUtils]: 121: Hoare triple {32018#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {32018#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:36:30,268 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {32018#(not (= |__VERIFIER_assert_#in~cond| 0))} {32001#(and (= main_~x~0 (+ main_~b~0 main_~r~0)) (= main_~a~0 main_~q~0))} #79#return; {32025#(= (+ main_~x~0 (* (- 1) main_~r~0)) (* main_~q~0 main_~y~0))} is VALID [2022-04-28 11:36:30,268 INFO L272 TraceCheckUtils]: 123: Hoare triple {32025#(= (+ main_~x~0 (* (- 1) main_~r~0)) (* main_~q~0 main_~y~0))} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {31650#true} is VALID [2022-04-28 11:36:30,268 INFO L290 TraceCheckUtils]: 124: Hoare triple {31650#true} ~cond := #in~cond; {31650#true} is VALID [2022-04-28 11:36:30,268 INFO L290 TraceCheckUtils]: 125: Hoare triple {31650#true} assume !(0 == ~cond); {31650#true} is VALID [2022-04-28 11:36:30,268 INFO L290 TraceCheckUtils]: 126: Hoare triple {31650#true} assume true; {31650#true} is VALID [2022-04-28 11:36:30,269 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {31650#true} {32025#(= (+ main_~x~0 (* (- 1) main_~r~0)) (* main_~q~0 main_~y~0))} #81#return; {32025#(= (+ main_~x~0 (* (- 1) main_~r~0)) (* main_~q~0 main_~y~0))} is VALID [2022-04-28 11:36:30,269 INFO L290 TraceCheckUtils]: 128: Hoare triple {32025#(= (+ main_~x~0 (* (- 1) main_~r~0)) (* main_~q~0 main_~y~0))} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {32025#(= (+ main_~x~0 (* (- 1) main_~r~0)) (* main_~q~0 main_~y~0))} is VALID [2022-04-28 11:36:30,269 INFO L290 TraceCheckUtils]: 129: Hoare triple {32025#(= (+ main_~x~0 (* (- 1) main_~r~0)) (* main_~q~0 main_~y~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {32025#(= (+ main_~x~0 (* (- 1) main_~r~0)) (* main_~q~0 main_~y~0))} is VALID [2022-04-28 11:36:30,270 INFO L290 TraceCheckUtils]: 130: Hoare triple {32025#(= (+ main_~x~0 (* (- 1) main_~r~0)) (* main_~q~0 main_~y~0))} assume !!(#t~post7 < 20);havoc #t~post7; {32025#(= (+ main_~x~0 (* (- 1) main_~r~0)) (* main_~q~0 main_~y~0))} is VALID [2022-04-28 11:36:30,270 INFO L272 TraceCheckUtils]: 131: Hoare triple {32025#(= (+ main_~x~0 (* (- 1) main_~r~0)) (* main_~q~0 main_~y~0))} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {31650#true} is VALID [2022-04-28 11:36:30,270 INFO L290 TraceCheckUtils]: 132: Hoare triple {31650#true} ~cond := #in~cond; {31650#true} is VALID [2022-04-28 11:36:30,270 INFO L290 TraceCheckUtils]: 133: Hoare triple {31650#true} assume !(0 == ~cond); {31650#true} is VALID [2022-04-28 11:36:30,270 INFO L290 TraceCheckUtils]: 134: Hoare triple {31650#true} assume true; {31650#true} is VALID [2022-04-28 11:36:30,270 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {31650#true} {32025#(= (+ main_~x~0 (* (- 1) main_~r~0)) (* main_~q~0 main_~y~0))} #83#return; {32025#(= (+ main_~x~0 (* (- 1) main_~r~0)) (* main_~q~0 main_~y~0))} is VALID [2022-04-28 11:36:30,271 INFO L272 TraceCheckUtils]: 136: Hoare triple {32025#(= (+ main_~x~0 (* (- 1) main_~r~0)) (* main_~q~0 main_~y~0))} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {31650#true} is VALID [2022-04-28 11:36:30,271 INFO L290 TraceCheckUtils]: 137: Hoare triple {31650#true} ~cond := #in~cond; {32014#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:36:30,271 INFO L290 TraceCheckUtils]: 138: Hoare triple {32014#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {32018#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:36:30,271 INFO L290 TraceCheckUtils]: 139: Hoare triple {32018#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {32018#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:36:30,272 INFO L284 TraceCheckUtils]: 140: Hoare quadruple {32018#(not (= |__VERIFIER_assert_#in~cond| 0))} {32025#(= (+ main_~x~0 (* (- 1) main_~r~0)) (* main_~q~0 main_~y~0))} #85#return; {32025#(= (+ main_~x~0 (* (- 1) main_~r~0)) (* main_~q~0 main_~y~0))} is VALID [2022-04-28 11:36:30,272 INFO L272 TraceCheckUtils]: 141: Hoare triple {32025#(= (+ main_~x~0 (* (- 1) main_~r~0)) (* main_~q~0 main_~y~0))} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {31650#true} is VALID [2022-04-28 11:36:30,272 INFO L290 TraceCheckUtils]: 142: Hoare triple {31650#true} ~cond := #in~cond; {31650#true} is VALID [2022-04-28 11:36:30,272 INFO L290 TraceCheckUtils]: 143: Hoare triple {31650#true} assume !(0 == ~cond); {31650#true} is VALID [2022-04-28 11:36:30,272 INFO L290 TraceCheckUtils]: 144: Hoare triple {31650#true} assume true; {31650#true} is VALID [2022-04-28 11:36:30,272 INFO L284 TraceCheckUtils]: 145: Hoare quadruple {31650#true} {32025#(= (+ main_~x~0 (* (- 1) main_~r~0)) (* main_~q~0 main_~y~0))} #87#return; {32025#(= (+ main_~x~0 (* (- 1) main_~r~0)) (* main_~q~0 main_~y~0))} is VALID [2022-04-28 11:36:30,273 INFO L290 TraceCheckUtils]: 146: Hoare triple {32025#(= (+ main_~x~0 (* (- 1) main_~r~0)) (* main_~q~0 main_~y~0))} assume !(~r~0 >= 2 * ~b~0); {32025#(= (+ main_~x~0 (* (- 1) main_~r~0)) (* main_~q~0 main_~y~0))} is VALID [2022-04-28 11:36:30,280 INFO L290 TraceCheckUtils]: 147: Hoare triple {32025#(= (+ main_~x~0 (* (- 1) main_~r~0)) (* main_~q~0 main_~y~0))} ~r~0 := ~r~0 - ~b~0;~q~0 := ~q~0 + ~a~0; {32101#(= (+ main_~x~0 (* (- 1) main_~b~0) (* (- 1) main_~r~0)) (* (+ (* (- 1) main_~a~0) main_~q~0) main_~y~0))} is VALID [2022-04-28 11:36:30,280 INFO L290 TraceCheckUtils]: 148: Hoare triple {32101#(= (+ main_~x~0 (* (- 1) main_~b~0) (* (- 1) main_~r~0)) (* (+ (* (- 1) main_~a~0) main_~q~0) main_~y~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {32101#(= (+ main_~x~0 (* (- 1) main_~b~0) (* (- 1) main_~r~0)) (* (+ (* (- 1) main_~a~0) main_~q~0) main_~y~0))} is VALID [2022-04-28 11:36:30,281 INFO L290 TraceCheckUtils]: 149: Hoare triple {32101#(= (+ main_~x~0 (* (- 1) main_~b~0) (* (- 1) main_~r~0)) (* (+ (* (- 1) main_~a~0) main_~q~0) main_~y~0))} assume !!(#t~post6 < 20);havoc #t~post6; {32101#(= (+ main_~x~0 (* (- 1) main_~b~0) (* (- 1) main_~r~0)) (* (+ (* (- 1) main_~a~0) main_~q~0) main_~y~0))} is VALID [2022-04-28 11:36:30,281 INFO L272 TraceCheckUtils]: 150: Hoare triple {32101#(= (+ main_~x~0 (* (- 1) main_~b~0) (* (- 1) main_~r~0)) (* (+ (* (- 1) main_~a~0) main_~q~0) main_~y~0))} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {31650#true} is VALID [2022-04-28 11:36:30,281 INFO L290 TraceCheckUtils]: 151: Hoare triple {31650#true} ~cond := #in~cond; {32014#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:36:30,281 INFO L290 TraceCheckUtils]: 152: Hoare triple {32014#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {32018#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:36:30,282 INFO L290 TraceCheckUtils]: 153: Hoare triple {32018#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {32018#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:36:30,283 INFO L284 TraceCheckUtils]: 154: Hoare quadruple {32018#(not (= |__VERIFIER_assert_#in~cond| 0))} {32101#(= (+ main_~x~0 (* (- 1) main_~b~0) (* (- 1) main_~r~0)) (* (+ (* (- 1) main_~a~0) main_~q~0) main_~y~0))} #79#return; {32025#(= (+ main_~x~0 (* (- 1) main_~r~0)) (* main_~q~0 main_~y~0))} is VALID [2022-04-28 11:36:30,284 INFO L272 TraceCheckUtils]: 155: Hoare triple {32025#(= (+ main_~x~0 (* (- 1) main_~r~0)) (* main_~q~0 main_~y~0))} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {32126#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:36:30,284 INFO L290 TraceCheckUtils]: 156: Hoare triple {32126#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {32130#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:36:30,285 INFO L290 TraceCheckUtils]: 157: Hoare triple {32130#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {31651#false} is VALID [2022-04-28 11:36:30,285 INFO L290 TraceCheckUtils]: 158: Hoare triple {31651#false} assume !false; {31651#false} is VALID [2022-04-28 11:36:30,285 INFO L134 CoverageAnalysis]: Checked inductivity of 1138 backedges. 211 proven. 52 refuted. 0 times theorem prover too weak. 875 trivial. 0 not checked. [2022-04-28 11:36:30,285 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:36:47,769 INFO L290 TraceCheckUtils]: 158: Hoare triple {31651#false} assume !false; {31651#false} is VALID [2022-04-28 11:36:47,769 INFO L290 TraceCheckUtils]: 157: Hoare triple {32130#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {31651#false} is VALID [2022-04-28 11:36:47,769 INFO L290 TraceCheckUtils]: 156: Hoare triple {32126#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {32130#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:36:47,770 INFO L272 TraceCheckUtils]: 155: Hoare triple {32025#(= (+ main_~x~0 (* (- 1) main_~r~0)) (* main_~q~0 main_~y~0))} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {32126#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:36:47,771 INFO L284 TraceCheckUtils]: 154: Hoare quadruple {32018#(not (= |__VERIFIER_assert_#in~cond| 0))} {32149#(or (not (= main_~b~0 (* main_~a~0 main_~y~0))) (= (+ main_~x~0 (* (- 1) main_~r~0)) (* main_~q~0 main_~y~0)))} #79#return; {32025#(= (+ main_~x~0 (* (- 1) main_~r~0)) (* main_~q~0 main_~y~0))} is VALID [2022-04-28 11:36:47,771 INFO L290 TraceCheckUtils]: 153: Hoare triple {32018#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {32018#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:36:47,771 INFO L290 TraceCheckUtils]: 152: Hoare triple {32159#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {32018#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:36:47,772 INFO L290 TraceCheckUtils]: 151: Hoare triple {31650#true} ~cond := #in~cond; {32159#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 11:36:47,772 INFO L272 TraceCheckUtils]: 150: Hoare triple {32149#(or (not (= main_~b~0 (* main_~a~0 main_~y~0))) (= (+ main_~x~0 (* (- 1) main_~r~0)) (* main_~q~0 main_~y~0)))} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {31650#true} is VALID [2022-04-28 11:36:47,772 INFO L290 TraceCheckUtils]: 149: Hoare triple {32149#(or (not (= main_~b~0 (* main_~a~0 main_~y~0))) (= (+ main_~x~0 (* (- 1) main_~r~0)) (* main_~q~0 main_~y~0)))} assume !!(#t~post6 < 20);havoc #t~post6; {32149#(or (not (= main_~b~0 (* main_~a~0 main_~y~0))) (= (+ main_~x~0 (* (- 1) main_~r~0)) (* main_~q~0 main_~y~0)))} is VALID [2022-04-28 11:36:47,773 INFO L290 TraceCheckUtils]: 148: Hoare triple {32149#(or (not (= main_~b~0 (* main_~a~0 main_~y~0))) (= (+ main_~x~0 (* (- 1) main_~r~0)) (* main_~q~0 main_~y~0)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {32149#(or (not (= main_~b~0 (* main_~a~0 main_~y~0))) (= (+ main_~x~0 (* (- 1) main_~r~0)) (* main_~q~0 main_~y~0)))} is VALID [2022-04-28 11:36:47,781 INFO L290 TraceCheckUtils]: 147: Hoare triple {32025#(= (+ main_~x~0 (* (- 1) main_~r~0)) (* main_~q~0 main_~y~0))} ~r~0 := ~r~0 - ~b~0;~q~0 := ~q~0 + ~a~0; {32149#(or (not (= main_~b~0 (* main_~a~0 main_~y~0))) (= (+ main_~x~0 (* (- 1) main_~r~0)) (* main_~q~0 main_~y~0)))} is VALID [2022-04-28 11:36:47,781 INFO L290 TraceCheckUtils]: 146: Hoare triple {32025#(= (+ main_~x~0 (* (- 1) main_~r~0)) (* main_~q~0 main_~y~0))} assume !(~r~0 >= 2 * ~b~0); {32025#(= (+ main_~x~0 (* (- 1) main_~r~0)) (* main_~q~0 main_~y~0))} is VALID [2022-04-28 11:36:47,782 INFO L284 TraceCheckUtils]: 145: Hoare quadruple {31650#true} {32025#(= (+ main_~x~0 (* (- 1) main_~r~0)) (* main_~q~0 main_~y~0))} #87#return; {32025#(= (+ main_~x~0 (* (- 1) main_~r~0)) (* main_~q~0 main_~y~0))} is VALID [2022-04-28 11:36:47,782 INFO L290 TraceCheckUtils]: 144: Hoare triple {31650#true} assume true; {31650#true} is VALID [2022-04-28 11:36:47,782 INFO L290 TraceCheckUtils]: 143: Hoare triple {31650#true} assume !(0 == ~cond); {31650#true} is VALID [2022-04-28 11:36:47,782 INFO L290 TraceCheckUtils]: 142: Hoare triple {31650#true} ~cond := #in~cond; {31650#true} is VALID [2022-04-28 11:36:47,782 INFO L272 TraceCheckUtils]: 141: Hoare triple {32025#(= (+ main_~x~0 (* (- 1) main_~r~0)) (* main_~q~0 main_~y~0))} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {31650#true} is VALID [2022-04-28 11:36:47,783 INFO L284 TraceCheckUtils]: 140: Hoare quadruple {32018#(not (= |__VERIFIER_assert_#in~cond| 0))} {31650#true} #85#return; {32025#(= (+ main_~x~0 (* (- 1) main_~r~0)) (* main_~q~0 main_~y~0))} is VALID [2022-04-28 11:36:47,783 INFO L290 TraceCheckUtils]: 139: Hoare triple {32018#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {32018#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:36:47,783 INFO L290 TraceCheckUtils]: 138: Hoare triple {32159#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {32018#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:36:47,784 INFO L290 TraceCheckUtils]: 137: Hoare triple {31650#true} ~cond := #in~cond; {32159#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 11:36:47,784 INFO L272 TraceCheckUtils]: 136: Hoare triple {31650#true} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {31650#true} is VALID [2022-04-28 11:36:47,784 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {31650#true} {31650#true} #83#return; {31650#true} is VALID [2022-04-28 11:36:47,784 INFO L290 TraceCheckUtils]: 134: Hoare triple {31650#true} assume true; {31650#true} is VALID [2022-04-28 11:36:47,784 INFO L290 TraceCheckUtils]: 133: Hoare triple {31650#true} assume !(0 == ~cond); {31650#true} is VALID [2022-04-28 11:36:47,784 INFO L290 TraceCheckUtils]: 132: Hoare triple {31650#true} ~cond := #in~cond; {31650#true} is VALID [2022-04-28 11:36:47,784 INFO L272 TraceCheckUtils]: 131: Hoare triple {31650#true} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {31650#true} is VALID [2022-04-28 11:36:47,784 INFO L290 TraceCheckUtils]: 130: Hoare triple {31650#true} assume !!(#t~post7 < 20);havoc #t~post7; {31650#true} is VALID [2022-04-28 11:36:47,784 INFO L290 TraceCheckUtils]: 129: Hoare triple {31650#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {31650#true} is VALID [2022-04-28 11:36:47,784 INFO L290 TraceCheckUtils]: 128: Hoare triple {31650#true} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {31650#true} is VALID [2022-04-28 11:36:47,784 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {31650#true} {31650#true} #81#return; {31650#true} is VALID [2022-04-28 11:36:47,784 INFO L290 TraceCheckUtils]: 126: Hoare triple {31650#true} assume true; {31650#true} is VALID [2022-04-28 11:36:47,784 INFO L290 TraceCheckUtils]: 125: Hoare triple {31650#true} assume !(0 == ~cond); {31650#true} is VALID [2022-04-28 11:36:47,784 INFO L290 TraceCheckUtils]: 124: Hoare triple {31650#true} ~cond := #in~cond; {31650#true} is VALID [2022-04-28 11:36:47,784 INFO L272 TraceCheckUtils]: 123: Hoare triple {31650#true} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {31650#true} is VALID [2022-04-28 11:36:47,784 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {31650#true} {31650#true} #79#return; {31650#true} is VALID [2022-04-28 11:36:47,784 INFO L290 TraceCheckUtils]: 121: Hoare triple {31650#true} assume true; {31650#true} is VALID [2022-04-28 11:36:47,784 INFO L290 TraceCheckUtils]: 120: Hoare triple {31650#true} assume !(0 == ~cond); {31650#true} is VALID [2022-04-28 11:36:47,785 INFO L290 TraceCheckUtils]: 119: Hoare triple {31650#true} ~cond := #in~cond; {31650#true} is VALID [2022-04-28 11:36:47,785 INFO L272 TraceCheckUtils]: 118: Hoare triple {31650#true} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {31650#true} is VALID [2022-04-28 11:36:47,785 INFO L290 TraceCheckUtils]: 117: Hoare triple {31650#true} assume !!(#t~post6 < 20);havoc #t~post6; {31650#true} is VALID [2022-04-28 11:36:47,785 INFO L290 TraceCheckUtils]: 116: Hoare triple {31650#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {31650#true} is VALID [2022-04-28 11:36:47,785 INFO L290 TraceCheckUtils]: 115: Hoare triple {31650#true} ~r~0 := ~r~0 - ~b~0;~q~0 := ~q~0 + ~a~0; {31650#true} is VALID [2022-04-28 11:36:47,785 INFO L290 TraceCheckUtils]: 114: Hoare triple {31650#true} assume !(~r~0 >= 2 * ~b~0); {31650#true} is VALID [2022-04-28 11:36:47,797 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {31650#true} {31650#true} #87#return; {31650#true} is VALID [2022-04-28 11:36:47,797 INFO L290 TraceCheckUtils]: 112: Hoare triple {31650#true} assume true; {31650#true} is VALID [2022-04-28 11:36:47,797 INFO L290 TraceCheckUtils]: 111: Hoare triple {31650#true} assume !(0 == ~cond); {31650#true} is VALID [2022-04-28 11:36:47,797 INFO L290 TraceCheckUtils]: 110: Hoare triple {31650#true} ~cond := #in~cond; {31650#true} is VALID [2022-04-28 11:36:47,797 INFO L272 TraceCheckUtils]: 109: Hoare triple {31650#true} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {31650#true} is VALID [2022-04-28 11:36:47,797 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {31650#true} {31650#true} #85#return; {31650#true} is VALID [2022-04-28 11:36:47,797 INFO L290 TraceCheckUtils]: 107: Hoare triple {31650#true} assume true; {31650#true} is VALID [2022-04-28 11:36:47,797 INFO L290 TraceCheckUtils]: 106: Hoare triple {31650#true} assume !(0 == ~cond); {31650#true} is VALID [2022-04-28 11:36:47,797 INFO L290 TraceCheckUtils]: 105: Hoare triple {31650#true} ~cond := #in~cond; {31650#true} is VALID [2022-04-28 11:36:47,797 INFO L272 TraceCheckUtils]: 104: Hoare triple {31650#true} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {31650#true} is VALID [2022-04-28 11:36:47,797 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {31650#true} {31650#true} #83#return; {31650#true} is VALID [2022-04-28 11:36:47,797 INFO L290 TraceCheckUtils]: 102: Hoare triple {31650#true} assume true; {31650#true} is VALID [2022-04-28 11:36:47,797 INFO L290 TraceCheckUtils]: 101: Hoare triple {31650#true} assume !(0 == ~cond); {31650#true} is VALID [2022-04-28 11:36:47,797 INFO L290 TraceCheckUtils]: 100: Hoare triple {31650#true} ~cond := #in~cond; {31650#true} is VALID [2022-04-28 11:36:47,797 INFO L272 TraceCheckUtils]: 99: Hoare triple {31650#true} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {31650#true} is VALID [2022-04-28 11:36:47,798 INFO L290 TraceCheckUtils]: 98: Hoare triple {31650#true} assume !!(#t~post7 < 20);havoc #t~post7; {31650#true} is VALID [2022-04-28 11:36:47,798 INFO L290 TraceCheckUtils]: 97: Hoare triple {31650#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {31650#true} is VALID [2022-04-28 11:36:47,798 INFO L290 TraceCheckUtils]: 96: Hoare triple {31650#true} ~a~0 := 2 * ~a~0;~b~0 := 2 * ~b~0; {31650#true} is VALID [2022-04-28 11:36:47,798 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {31650#true} {31650#true} #89#return; {31650#true} is VALID [2022-04-28 11:36:47,798 INFO L290 TraceCheckUtils]: 94: Hoare triple {31650#true} assume true; {31650#true} is VALID [2022-04-28 11:36:47,798 INFO L290 TraceCheckUtils]: 93: Hoare triple {31650#true} assume !(0 == ~cond); {31650#true} is VALID [2022-04-28 11:36:47,798 INFO L290 TraceCheckUtils]: 92: Hoare triple {31650#true} ~cond := #in~cond; {31650#true} is VALID [2022-04-28 11:36:47,798 INFO L272 TraceCheckUtils]: 91: Hoare triple {31650#true} call __VERIFIER_assert((if ~r~0 >= 2 * ~y~0 * ~a~0 then 1 else 0)); {31650#true} is VALID [2022-04-28 11:36:47,798 INFO L290 TraceCheckUtils]: 90: Hoare triple {31650#true} assume !!(~r~0 >= 2 * ~b~0); {31650#true} is VALID [2022-04-28 11:36:47,798 INFO L284 TraceCheckUtils]: 89: Hoare quadruple {31650#true} {31650#true} #87#return; {31650#true} is VALID [2022-04-28 11:36:47,798 INFO L290 TraceCheckUtils]: 88: Hoare triple {31650#true} assume true; {31650#true} is VALID [2022-04-28 11:36:47,798 INFO L290 TraceCheckUtils]: 87: Hoare triple {31650#true} assume !(0 == ~cond); {31650#true} is VALID [2022-04-28 11:36:47,798 INFO L290 TraceCheckUtils]: 86: Hoare triple {31650#true} ~cond := #in~cond; {31650#true} is VALID [2022-04-28 11:36:47,798 INFO L272 TraceCheckUtils]: 85: Hoare triple {31650#true} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {31650#true} is VALID [2022-04-28 11:36:47,798 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {31650#true} {31650#true} #85#return; {31650#true} is VALID [2022-04-28 11:36:47,798 INFO L290 TraceCheckUtils]: 83: Hoare triple {31650#true} assume true; {31650#true} is VALID [2022-04-28 11:36:47,798 INFO L290 TraceCheckUtils]: 82: Hoare triple {31650#true} assume !(0 == ~cond); {31650#true} is VALID [2022-04-28 11:36:47,798 INFO L290 TraceCheckUtils]: 81: Hoare triple {31650#true} ~cond := #in~cond; {31650#true} is VALID [2022-04-28 11:36:47,798 INFO L272 TraceCheckUtils]: 80: Hoare triple {31650#true} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {31650#true} is VALID [2022-04-28 11:36:47,799 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {31650#true} {31650#true} #83#return; {31650#true} is VALID [2022-04-28 11:36:47,799 INFO L290 TraceCheckUtils]: 78: Hoare triple {31650#true} assume true; {31650#true} is VALID [2022-04-28 11:36:47,799 INFO L290 TraceCheckUtils]: 77: Hoare triple {31650#true} assume !(0 == ~cond); {31650#true} is VALID [2022-04-28 11:36:47,799 INFO L290 TraceCheckUtils]: 76: Hoare triple {31650#true} ~cond := #in~cond; {31650#true} is VALID [2022-04-28 11:36:47,799 INFO L272 TraceCheckUtils]: 75: Hoare triple {31650#true} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {31650#true} is VALID [2022-04-28 11:36:47,799 INFO L290 TraceCheckUtils]: 74: Hoare triple {31650#true} assume !!(#t~post7 < 20);havoc #t~post7; {31650#true} is VALID [2022-04-28 11:36:47,799 INFO L290 TraceCheckUtils]: 73: Hoare triple {31650#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {31650#true} is VALID [2022-04-28 11:36:47,799 INFO L290 TraceCheckUtils]: 72: Hoare triple {31650#true} ~a~0 := 2 * ~a~0;~b~0 := 2 * ~b~0; {31650#true} is VALID [2022-04-28 11:36:47,799 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {31650#true} {31650#true} #89#return; {31650#true} is VALID [2022-04-28 11:36:47,799 INFO L290 TraceCheckUtils]: 70: Hoare triple {31650#true} assume true; {31650#true} is VALID [2022-04-28 11:36:47,799 INFO L290 TraceCheckUtils]: 69: Hoare triple {31650#true} assume !(0 == ~cond); {31650#true} is VALID [2022-04-28 11:36:47,799 INFO L290 TraceCheckUtils]: 68: Hoare triple {31650#true} ~cond := #in~cond; {31650#true} is VALID [2022-04-28 11:36:47,799 INFO L272 TraceCheckUtils]: 67: Hoare triple {31650#true} call __VERIFIER_assert((if ~r~0 >= 2 * ~y~0 * ~a~0 then 1 else 0)); {31650#true} is VALID [2022-04-28 11:36:47,799 INFO L290 TraceCheckUtils]: 66: Hoare triple {31650#true} assume !!(~r~0 >= 2 * ~b~0); {31650#true} is VALID [2022-04-28 11:36:47,799 INFO L284 TraceCheckUtils]: 65: Hoare quadruple {31650#true} {31650#true} #87#return; {31650#true} is VALID [2022-04-28 11:36:47,799 INFO L290 TraceCheckUtils]: 64: Hoare triple {31650#true} assume true; {31650#true} is VALID [2022-04-28 11:36:47,799 INFO L290 TraceCheckUtils]: 63: Hoare triple {31650#true} assume !(0 == ~cond); {31650#true} is VALID [2022-04-28 11:36:47,799 INFO L290 TraceCheckUtils]: 62: Hoare triple {31650#true} ~cond := #in~cond; {31650#true} is VALID [2022-04-28 11:36:47,800 INFO L272 TraceCheckUtils]: 61: Hoare triple {31650#true} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {31650#true} is VALID [2022-04-28 11:36:47,800 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {31650#true} {31650#true} #85#return; {31650#true} is VALID [2022-04-28 11:36:47,800 INFO L290 TraceCheckUtils]: 59: Hoare triple {31650#true} assume true; {31650#true} is VALID [2022-04-28 11:36:47,800 INFO L290 TraceCheckUtils]: 58: Hoare triple {31650#true} assume !(0 == ~cond); {31650#true} is VALID [2022-04-28 11:36:47,800 INFO L290 TraceCheckUtils]: 57: Hoare triple {31650#true} ~cond := #in~cond; {31650#true} is VALID [2022-04-28 11:36:47,800 INFO L272 TraceCheckUtils]: 56: Hoare triple {31650#true} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {31650#true} is VALID [2022-04-28 11:36:47,800 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {31650#true} {31650#true} #83#return; {31650#true} is VALID [2022-04-28 11:36:47,800 INFO L290 TraceCheckUtils]: 54: Hoare triple {31650#true} assume true; {31650#true} is VALID [2022-04-28 11:36:47,800 INFO L290 TraceCheckUtils]: 53: Hoare triple {31650#true} assume !(0 == ~cond); {31650#true} is VALID [2022-04-28 11:36:47,800 INFO L290 TraceCheckUtils]: 52: Hoare triple {31650#true} ~cond := #in~cond; {31650#true} is VALID [2022-04-28 11:36:47,800 INFO L272 TraceCheckUtils]: 51: Hoare triple {31650#true} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {31650#true} is VALID [2022-04-28 11:36:47,800 INFO L290 TraceCheckUtils]: 50: Hoare triple {31650#true} assume !!(#t~post7 < 20);havoc #t~post7; {31650#true} is VALID [2022-04-28 11:36:47,800 INFO L290 TraceCheckUtils]: 49: Hoare triple {31650#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {31650#true} is VALID [2022-04-28 11:36:47,800 INFO L290 TraceCheckUtils]: 48: Hoare triple {31650#true} ~a~0 := 2 * ~a~0;~b~0 := 2 * ~b~0; {31650#true} is VALID [2022-04-28 11:36:47,800 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {31650#true} {31650#true} #89#return; {31650#true} is VALID [2022-04-28 11:36:47,800 INFO L290 TraceCheckUtils]: 46: Hoare triple {31650#true} assume true; {31650#true} is VALID [2022-04-28 11:36:47,800 INFO L290 TraceCheckUtils]: 45: Hoare triple {31650#true} assume !(0 == ~cond); {31650#true} is VALID [2022-04-28 11:36:47,800 INFO L290 TraceCheckUtils]: 44: Hoare triple {31650#true} ~cond := #in~cond; {31650#true} is VALID [2022-04-28 11:36:47,800 INFO L272 TraceCheckUtils]: 43: Hoare triple {31650#true} call __VERIFIER_assert((if ~r~0 >= 2 * ~y~0 * ~a~0 then 1 else 0)); {31650#true} is VALID [2022-04-28 11:36:47,801 INFO L290 TraceCheckUtils]: 42: Hoare triple {31650#true} assume !!(~r~0 >= 2 * ~b~0); {31650#true} is VALID [2022-04-28 11:36:47,801 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {31650#true} {31650#true} #87#return; {31650#true} is VALID [2022-04-28 11:36:47,801 INFO L290 TraceCheckUtils]: 40: Hoare triple {31650#true} assume true; {31650#true} is VALID [2022-04-28 11:36:47,801 INFO L290 TraceCheckUtils]: 39: Hoare triple {31650#true} assume !(0 == ~cond); {31650#true} is VALID [2022-04-28 11:36:47,801 INFO L290 TraceCheckUtils]: 38: Hoare triple {31650#true} ~cond := #in~cond; {31650#true} is VALID [2022-04-28 11:36:47,801 INFO L272 TraceCheckUtils]: 37: Hoare triple {31650#true} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {31650#true} is VALID [2022-04-28 11:36:47,801 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {31650#true} {31650#true} #85#return; {31650#true} is VALID [2022-04-28 11:36:47,801 INFO L290 TraceCheckUtils]: 35: Hoare triple {31650#true} assume true; {31650#true} is VALID [2022-04-28 11:36:47,801 INFO L290 TraceCheckUtils]: 34: Hoare triple {31650#true} assume !(0 == ~cond); {31650#true} is VALID [2022-04-28 11:36:47,801 INFO L290 TraceCheckUtils]: 33: Hoare triple {31650#true} ~cond := #in~cond; {31650#true} is VALID [2022-04-28 11:36:47,801 INFO L272 TraceCheckUtils]: 32: Hoare triple {31650#true} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {31650#true} is VALID [2022-04-28 11:36:47,801 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {31650#true} {31650#true} #83#return; {31650#true} is VALID [2022-04-28 11:36:47,801 INFO L290 TraceCheckUtils]: 30: Hoare triple {31650#true} assume true; {31650#true} is VALID [2022-04-28 11:36:47,801 INFO L290 TraceCheckUtils]: 29: Hoare triple {31650#true} assume !(0 == ~cond); {31650#true} is VALID [2022-04-28 11:36:47,801 INFO L290 TraceCheckUtils]: 28: Hoare triple {31650#true} ~cond := #in~cond; {31650#true} is VALID [2022-04-28 11:36:47,801 INFO L272 TraceCheckUtils]: 27: Hoare triple {31650#true} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {31650#true} is VALID [2022-04-28 11:36:47,801 INFO L290 TraceCheckUtils]: 26: Hoare triple {31650#true} assume !!(#t~post7 < 20);havoc #t~post7; {31650#true} is VALID [2022-04-28 11:36:47,801 INFO L290 TraceCheckUtils]: 25: Hoare triple {31650#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {31650#true} is VALID [2022-04-28 11:36:47,801 INFO L290 TraceCheckUtils]: 24: Hoare triple {31650#true} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {31650#true} is VALID [2022-04-28 11:36:47,802 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {31650#true} {31650#true} #81#return; {31650#true} is VALID [2022-04-28 11:36:47,802 INFO L290 TraceCheckUtils]: 22: Hoare triple {31650#true} assume true; {31650#true} is VALID [2022-04-28 11:36:47,802 INFO L290 TraceCheckUtils]: 21: Hoare triple {31650#true} assume !(0 == ~cond); {31650#true} is VALID [2022-04-28 11:36:47,802 INFO L290 TraceCheckUtils]: 20: Hoare triple {31650#true} ~cond := #in~cond; {31650#true} is VALID [2022-04-28 11:36:47,802 INFO L272 TraceCheckUtils]: 19: Hoare triple {31650#true} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {31650#true} is VALID [2022-04-28 11:36:47,802 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {31650#true} {31650#true} #79#return; {31650#true} is VALID [2022-04-28 11:36:47,802 INFO L290 TraceCheckUtils]: 17: Hoare triple {31650#true} assume true; {31650#true} is VALID [2022-04-28 11:36:47,802 INFO L290 TraceCheckUtils]: 16: Hoare triple {31650#true} assume !(0 == ~cond); {31650#true} is VALID [2022-04-28 11:36:47,802 INFO L290 TraceCheckUtils]: 15: Hoare triple {31650#true} ~cond := #in~cond; {31650#true} is VALID [2022-04-28 11:36:47,802 INFO L272 TraceCheckUtils]: 14: Hoare triple {31650#true} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {31650#true} is VALID [2022-04-28 11:36:47,802 INFO L290 TraceCheckUtils]: 13: Hoare triple {31650#true} assume !!(#t~post6 < 20);havoc #t~post6; {31650#true} is VALID [2022-04-28 11:36:47,802 INFO L290 TraceCheckUtils]: 12: Hoare triple {31650#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {31650#true} is VALID [2022-04-28 11:36:47,802 INFO L290 TraceCheckUtils]: 11: Hoare triple {31650#true} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {31650#true} is VALID [2022-04-28 11:36:47,802 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {31650#true} {31650#true} #77#return; {31650#true} is VALID [2022-04-28 11:36:47,802 INFO L290 TraceCheckUtils]: 9: Hoare triple {31650#true} assume true; {31650#true} is VALID [2022-04-28 11:36:47,802 INFO L290 TraceCheckUtils]: 8: Hoare triple {31650#true} assume !(0 == ~cond); {31650#true} is VALID [2022-04-28 11:36:47,802 INFO L290 TraceCheckUtils]: 7: Hoare triple {31650#true} ~cond := #in~cond; {31650#true} is VALID [2022-04-28 11:36:47,802 INFO L272 TraceCheckUtils]: 6: Hoare triple {31650#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {31650#true} is VALID [2022-04-28 11:36:47,803 INFO L290 TraceCheckUtils]: 5: Hoare triple {31650#true} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~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; {31650#true} is VALID [2022-04-28 11:36:47,803 INFO L272 TraceCheckUtils]: 4: Hoare triple {31650#true} call #t~ret8 := main(); {31650#true} is VALID [2022-04-28 11:36:47,803 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31650#true} {31650#true} #93#return; {31650#true} is VALID [2022-04-28 11:36:47,803 INFO L290 TraceCheckUtils]: 2: Hoare triple {31650#true} assume true; {31650#true} is VALID [2022-04-28 11:36:47,803 INFO L290 TraceCheckUtils]: 1: Hoare triple {31650#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(14, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {31650#true} is VALID [2022-04-28 11:36:47,803 INFO L272 TraceCheckUtils]: 0: Hoare triple {31650#true} call ULTIMATE.init(); {31650#true} is VALID [2022-04-28 11:36:47,803 INFO L134 CoverageAnalysis]: Checked inductivity of 1138 backedges. 184 proven. 5 refuted. 0 times theorem prover too weak. 949 trivial. 0 not checked. [2022-04-28 11:36:47,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:36:47,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446256058] [2022-04-28 11:36:47,804 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:36:47,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1447647515] [2022-04-28 11:36:47,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1447647515] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 11:36:47,804 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 11:36:47,804 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 12 [2022-04-28 11:36:47,804 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:36:47,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [194664901] [2022-04-28 11:36:47,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [194664901] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:36:47,804 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:36:47,804 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 11:36:47,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639894022] [2022-04-28 11:36:47,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:36:47,805 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.4) internal successors, (34), 9 states have internal predecessors, (34), 5 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 3 states have call predecessors, (14), 5 states have call successors, (14) Word has length 159 [2022-04-28 11:36:47,805 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:36:47,805 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 3.4) internal successors, (34), 9 states have internal predecessors, (34), 5 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 3 states have call predecessors, (14), 5 states have call successors, (14) [2022-04-28 11:36:47,874 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:36:47,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 11:36:47,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:36:47,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 11:36:47,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-04-28 11:36:47,875 INFO L87 Difference]: Start difference. First operand 349 states and 398 transitions. Second operand has 10 states, 10 states have (on average 3.4) internal successors, (34), 9 states have internal predecessors, (34), 5 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 3 states have call predecessors, (14), 5 states have call successors, (14) [2022-04-28 11:36:49,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:36:49,323 INFO L93 Difference]: Finished difference Result 367 states and 415 transitions. [2022-04-28 11:36:49,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 11:36:49,324 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.4) internal successors, (34), 9 states have internal predecessors, (34), 5 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 3 states have call predecessors, (14), 5 states have call successors, (14) Word has length 159 [2022-04-28 11:36:49,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:36:49,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.4) internal successors, (34), 9 states have internal predecessors, (34), 5 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 3 states have call predecessors, (14), 5 states have call successors, (14) [2022-04-28 11:36:49,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 73 transitions. [2022-04-28 11:36:49,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.4) internal successors, (34), 9 states have internal predecessors, (34), 5 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 3 states have call predecessors, (14), 5 states have call successors, (14) [2022-04-28 11:36:49,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 73 transitions. [2022-04-28 11:36:49,326 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 73 transitions. [2022-04-28 11:36:49,491 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:36:49,492 INFO L225 Difference]: With dead ends: 367 [2022-04-28 11:36:49,492 INFO L226 Difference]: Without dead ends: 0 [2022-04-28 11:36:49,493 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 302 SyntacticMatches, 5 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=233, Unknown=0, NotChecked=0, Total=306 [2022-04-28 11:36:49,493 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 31 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-28 11:36:49,493 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 143 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 11:36:49,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-28 11:36:49,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-28 11:36:49,493 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:36:49,493 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 11:36:49,493 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 11:36:49,494 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 11:36:49,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:36:49,494 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 11:36:49,494 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 11:36:49,494 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:36:49,494 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:36:49,494 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-28 11:36:49,494 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-28 11:36:49,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:36:49,494 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 11:36:49,494 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 11:36:49,494 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:36:49,494 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:36:49,494 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:36:49,494 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:36:49,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 11:36:49,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-28 11:36:49,494 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 159 [2022-04-28 11:36:49,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:36:49,494 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-28 11:36:49,495 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.4) internal successors, (34), 9 states have internal predecessors, (34), 5 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 3 states have call predecessors, (14), 5 states have call successors, (14) [2022-04-28 11:36:49,495 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-28 11:36:49,495 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:36:49,495 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 11:36:49,495 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:36:49,497 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-28 11:36:49,526 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-04-28 11:36:49,697 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:36:49,699 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-28 11:37:01,748 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 8) no Hoare annotation was computed. [2022-04-28 11:37:01,748 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 8) no Hoare annotation was computed. [2022-04-28 11:37:01,748 INFO L899 garLoopResultBuilder]: For program point reach_errorFINAL(line 8) no Hoare annotation was computed. [2022-04-28 11:37:01,748 INFO L902 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 11 13) the Hoare annotation is: true [2022-04-28 11:37:01,749 INFO L895 garLoopResultBuilder]: At program point L12(line 12) the Hoare annotation is: (or (= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|) (not (<= ~counter~0 0))) [2022-04-28 11:37:01,749 INFO L895 garLoopResultBuilder]: At program point L12-2(lines 11 13) the Hoare annotation is: (or (and (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)) (not (<= ~counter~0 0))) [2022-04-28 11:37:01,749 INFO L895 garLoopResultBuilder]: At program point assume_abort_if_notEXIT(lines 11 13) the Hoare annotation is: (or (and (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)) (not (<= ~counter~0 0))) [2022-04-28 11:37:01,749 INFO L895 garLoopResultBuilder]: At program point L37-4(lines 37 61) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (let ((.cse0 (* main_~q~0 main_~y~0))) (and (= (+ .cse0 main_~r~0) main_~x~0) (= (+ .cse0 main_~b~0 main_~r~0) (+ main_~x~0 (* main_~a~0 main_~y~0))) (<= 1 main_~y~0))) (and (= main_~x~0 main_~r~0) (= main_~q~0 0))) [2022-04-28 11:37:01,749 INFO L902 garLoopResultBuilder]: At program point mainEXIT(lines 23 65) the Hoare annotation is: true [2022-04-28 11:37:01,749 INFO L895 garLoopResultBuilder]: At program point L54(line 54) the Hoare annotation is: (or (let ((.cse0 (* main_~a~0 main_~y~0))) (and (= (+ (* main_~q~0 main_~y~0) main_~b~0 main_~r~0) (+ main_~x~0 .cse0)) (<= (* 2 .cse0) main_~r~0) (<= 1 main_~r~0) (<= 1 main_~y~0) (= main_~b~0 .cse0))) (not (<= |old(~counter~0)| 0))) [2022-04-28 11:37:01,749 INFO L895 garLoopResultBuilder]: At program point L54-1(line 54) the Hoare annotation is: (or (let ((.cse0 (* main_~a~0 main_~y~0))) (and (= (+ (* main_~q~0 main_~y~0) main_~b~0 main_~r~0) (+ main_~x~0 .cse0)) (<= (* 2 .cse0) main_~r~0) (<= 1 main_~r~0) (<= 1 main_~y~0) (= main_~b~0 .cse0))) (not (<= |old(~counter~0)| 0))) [2022-04-28 11:37:01,749 INFO L895 garLoopResultBuilder]: At program point L48(line 48) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (let ((.cse0 (* main_~a~0 main_~y~0))) (and (= (+ (* main_~q~0 main_~y~0) main_~b~0 main_~r~0) (+ main_~x~0 .cse0)) (<= 1 main_~r~0) (<= 1 main_~y~0) (= main_~b~0 .cse0)))) [2022-04-28 11:37:01,749 INFO L895 garLoopResultBuilder]: At program point L46-1(lines 46 58) the Hoare annotation is: (let ((.cse1 (* main_~a~0 main_~y~0))) (let ((.cse0 (* main_~q~0 main_~y~0)) (.cse2 (<= 1 main_~y~0)) (.cse3 (= main_~b~0 .cse1))) (or (and (<= (+ |main_#t~post7| 1) ~counter~0) (= (+ .cse0 main_~b~0 main_~r~0) (+ main_~x~0 .cse1)) (<= 1 main_~r~0) .cse2 .cse3) (and (= (+ .cse0 main_~r~0) main_~x~0) (not (<= (* main_~y~0 4) main_~x~0)) (<= 1 (div (* (- 1) main_~q~0) (- 2))) (<= main_~y~0 main_~r~0) (= main_~b~0 main_~y~0) (= (mod main_~q~0 2) 0) (<= |main_#t~post7| 4) .cse2 .cse3) (not (<= |old(~counter~0)| 0))))) [2022-04-28 11:37:01,749 INFO L902 garLoopResultBuilder]: At program point mainFINAL(lines 23 65) the Hoare annotation is: true [2022-04-28 11:37:01,749 INFO L895 garLoopResultBuilder]: At program point L46-3(lines 46 58) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (let ((.cse0 (* main_~a~0 main_~y~0))) (and (= (+ (* main_~q~0 main_~y~0) main_~b~0 main_~r~0) (+ main_~x~0 .cse0)) (<= 1 main_~r~0) (<= 1 main_~y~0) (= main_~b~0 .cse0)))) [2022-04-28 11:37:01,749 INFO L895 garLoopResultBuilder]: At program point L46-4(lines 46 58) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (let ((.cse0 (* main_~a~0 main_~y~0))) (and (= (+ (* main_~q~0 main_~y~0) main_~b~0 main_~r~0) (+ main_~x~0 .cse0)) (<= 1 main_~r~0) (<= 1 main_~y~0) (= main_~b~0 .cse0)))) [2022-04-28 11:37:01,749 INFO L895 garLoopResultBuilder]: At program point L38(line 38) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (let ((.cse0 (* main_~a~0 main_~y~0))) (and (= (+ (* main_~q~0 main_~y~0) main_~b~0 main_~r~0) (+ main_~x~0 .cse0)) (<= 1 main_~y~0) (= main_~b~0 .cse0)))) [2022-04-28 11:37:01,749 INFO L895 garLoopResultBuilder]: At program point L38-1(line 38) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (let ((.cse0 (* main_~a~0 main_~y~0))) (and (= (+ (* main_~q~0 main_~y~0) main_~b~0 main_~r~0) (+ main_~x~0 .cse0)) (<= 1 main_~y~0) (= main_~b~0 .cse0)))) [2022-04-28 11:37:01,749 INFO L902 garLoopResultBuilder]: At program point L63(line 63) the Hoare annotation is: true [2022-04-28 11:37:01,749 INFO L895 garLoopResultBuilder]: At program point L30(line 30) the Hoare annotation is: (or (= ~counter~0 |old(~counter~0)|) (not (<= |old(~counter~0)| 0))) [2022-04-28 11:37:01,749 INFO L895 garLoopResultBuilder]: At program point mainENTRY(lines 23 65) the Hoare annotation is: (or (= ~counter~0 |old(~counter~0)|) (not (<= |old(~counter~0)| 0))) [2022-04-28 11:37:01,749 INFO L895 garLoopResultBuilder]: At program point L30-1(line 30) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (and (= ~counter~0 |old(~counter~0)|) (<= 1 main_~y~0))) [2022-04-28 11:37:01,750 INFO L895 garLoopResultBuilder]: At program point L49(lines 46 58) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (let ((.cse0 (* main_~a~0 main_~y~0))) (and (= (+ (* main_~q~0 main_~y~0) main_~b~0 main_~r~0) (+ main_~x~0 .cse0)) (<= 1 main_~r~0) (<= 1 main_~y~0) (= main_~b~0 .cse0)))) [2022-04-28 11:37:01,750 INFO L895 garLoopResultBuilder]: At program point L47(line 47) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (let ((.cse0 (* main_~a~0 main_~y~0))) (and (= (+ (* main_~q~0 main_~y~0) main_~b~0 main_~r~0) (+ main_~x~0 .cse0)) (<= 1 main_~r~0) (<= 1 main_~y~0) (= main_~b~0 .cse0)))) [2022-04-28 11:37:01,750 INFO L895 garLoopResultBuilder]: At program point L47-1(line 47) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (let ((.cse0 (* main_~a~0 main_~y~0))) (and (= (+ (* main_~q~0 main_~y~0) main_~b~0 main_~r~0) (+ main_~x~0 .cse0)) (<= 1 main_~r~0) (<= 1 main_~y~0) (= main_~b~0 .cse0)))) [2022-04-28 11:37:01,750 INFO L895 garLoopResultBuilder]: At program point L39(lines 37 61) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (let ((.cse0 (* main_~a~0 main_~y~0))) (and (= (+ (* main_~q~0 main_~y~0) main_~b~0 main_~r~0) (+ main_~x~0 .cse0)) (<= 1 main_~y~0) (= main_~b~0 .cse0)))) [2022-04-28 11:37:01,750 INFO L895 garLoopResultBuilder]: At program point L37-1(lines 37 61) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (let ((.cse0 (* main_~a~0 main_~y~0))) (and (= (+ (* main_~q~0 main_~y~0) main_~b~0 main_~r~0) (+ main_~x~0 .cse0)) (<= 1 main_~y~0) (= main_~b~0 .cse0)))) [2022-04-28 11:37:01,750 INFO L895 garLoopResultBuilder]: At program point L37-3(lines 37 61) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (let ((.cse0 (* main_~a~0 main_~y~0))) (and (= (+ (* main_~q~0 main_~y~0) main_~b~0 main_~r~0) (+ main_~x~0 .cse0)) (<= 1 main_~y~0) (= main_~b~0 .cse0)))) [2022-04-28 11:37:01,750 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: (<= ~counter~0 0) [2022-04-28 11:37:01,750 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-28 11:37:01,750 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: (<= ~counter~0 0) [2022-04-28 11:37:01,750 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-28 11:37:01,750 INFO L895 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: (<= ~counter~0 0) [2022-04-28 11:37:01,750 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-28 11:37:01,750 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-28 11:37:01,750 INFO L895 garLoopResultBuilder]: At program point L16(lines 16 17) the Hoare annotation is: (not (<= 1 |__VERIFIER_assert_#in~cond|)) [2022-04-28 11:37:01,750 INFO L895 garLoopResultBuilder]: At program point L15(lines 15 18) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (not (<= 1 |__VERIFIER_assert_#in~cond|))) [2022-04-28 11:37:01,750 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 14 20) the Hoare annotation is: true [2022-04-28 11:37:01,750 INFO L895 garLoopResultBuilder]: At program point L15-2(lines 14 20) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (not (<= 1 |__VERIFIER_assert_#in~cond|))) [2022-04-28 11:37:01,750 INFO L895 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 14 20) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (not (<= 1 |__VERIFIER_assert_#in~cond|))) [2022-04-28 11:37:01,750 INFO L895 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 17) the Hoare annotation is: (not (<= 1 |__VERIFIER_assert_#in~cond|)) [2022-04-28 11:37:01,753 INFO L356 BasicCegarLoop]: Path program histogram: [8, 8, 6, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2] [2022-04-28 11:37:01,754 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-28 11:37:01,756 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 11:37:01,758 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-28 11:37:01,794 INFO L163 areAnnotationChecker]: CFG has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-28 11:37:01,803 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 11:37:01 BoogieIcfgContainer [2022-04-28 11:37:01,803 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-28 11:37:01,804 INFO L158 Benchmark]: Toolchain (without parser) took 848636.83ms. Allocated memory was 173.0MB in the beginning and 315.6MB in the end (delta: 142.6MB). Free memory was 122.1MB in the beginning and 264.2MB in the end (delta: -142.1MB). Peak memory consumption was 169.2MB. Max. memory is 8.0GB. [2022-04-28 11:37:01,804 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 173.0MB. Free memory was 138.7MB in the beginning and 138.6MB in the end (delta: 74.9kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 11:37:01,804 INFO L158 Benchmark]: CACSL2BoogieTranslator took 178.83ms. Allocated memory is still 173.0MB. Free memory was 121.9MB in the beginning and 146.8MB in the end (delta: -24.9MB). Peak memory consumption was 12.5MB. Max. memory is 8.0GB. [2022-04-28 11:37:01,804 INFO L158 Benchmark]: Boogie Preprocessor took 17.78ms. Allocated memory is still 173.0MB. Free memory was 146.8MB in the beginning and 145.2MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-28 11:37:01,805 INFO L158 Benchmark]: RCFGBuilder took 290.70ms. Allocated memory is still 173.0MB. Free memory was 145.2MB in the beginning and 133.3MB in the end (delta: 11.8MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-28 11:37:01,805 INFO L158 Benchmark]: TraceAbstraction took 848143.50ms. Allocated memory was 173.0MB in the beginning and 315.6MB in the end (delta: 142.6MB). Free memory was 132.6MB in the beginning and 264.2MB in the end (delta: -131.6MB). Peak memory consumption was 179.8MB. Max. memory is 8.0GB. [2022-04-28 11:37:01,805 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 173.0MB. Free memory was 138.7MB in the beginning and 138.6MB in the end (delta: 74.9kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 178.83ms. Allocated memory is still 173.0MB. Free memory was 121.9MB in the beginning and 146.8MB in the end (delta: -24.9MB). Peak memory consumption was 12.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 17.78ms. Allocated memory is still 173.0MB. Free memory was 146.8MB in the beginning and 145.2MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 290.70ms. Allocated memory is still 173.0MB. Free memory was 145.2MB in the beginning and 133.3MB in the end (delta: 11.8MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 848143.50ms. Allocated memory was 173.0MB in the beginning and 315.6MB in the end (delta: 142.6MB). Free memory was 132.6MB in the beginning and 264.2MB in the end (delta: -131.6MB). Peak memory consumption was 179.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 17]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 41 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 848.1s, OverallIterations: 24, TraceHistogramMax: 24, PathProgramHistogramMax: 8, EmptinessCheckTime: 0.0s, AutomataDifference: 39.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 12.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 737 SdHoareTripleChecker+Valid, 12.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 622 mSDsluCounter, 4455 SdHoareTripleChecker+Invalid, 12.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3280 mSDsCounter, 540 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4622 IncrementalHoareTripleChecker+Invalid, 5162 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 540 mSolverCounterUnsat, 1175 mSDtfsCounter, 4622 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3344 GetRequests, 3059 SyntacticMatches, 19 SemanticMatches, 266 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 758 ImplicationChecksByTransitivity, 5.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=349occurred in iteration=23, InterpolantAutomatonStates: 215, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 4.6s AutomataMinimizationTime, 24 MinimizatonAttempts, 127 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 38 LocationsWithAnnotation, 1334 PreInvPairs, 1823 NumberOfFragments, 609 HoareAnnotationTreeSize, 1334 FomulaSimplifications, 7550 FormulaSimplificationTreeSizeReduction, 3.0s HoareSimplificationTime, 38 FomulaSimplificationsInter, 203004 FormulaSimplificationTreeSizeReductionInter, 8.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 46]: Loop Invariant Derived loop invariant: !(\old(counter) <= 0) || (((q * y + b + r == x + a * y && 1 <= r) && 1 <= y) && b == a * y) - InvariantResult [Line: 37]: Loop Invariant Derived loop invariant: !(\old(counter) <= 0) || ((q * y + b + r == x + a * y && 1 <= y) && b == a * y) - ProcedureContractResult [Line: 11]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not: (!(\old(cond) == 0) && cond == \old(cond)) || !(counter <= 0) - ProcedureContractResult [Line: 23]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 14]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: \old(cond) == cond || !(1 <= \old(cond)) RESULT: Ultimate proved your program to be correct! [2022-04-28 11:37:02,027 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2022-04-28 11:37:02,042 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...