/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_unwindbound100.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 11:20:29,727 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 11:20:29,735 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 11:20:29,774 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 11:20:29,774 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 11:20:29,775 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 11:20:29,775 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 11:20:29,776 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 11:20:29,777 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 11:20:29,778 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 11:20:29,778 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 11:20:29,779 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 11:20:29,779 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 11:20:29,780 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 11:20:29,780 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 11:20:29,781 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 11:20:29,782 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 11:20:29,782 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 11:20:29,783 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 11:20:29,784 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 11:20:29,785 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 11:20:29,786 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 11:20:29,787 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 11:20:29,787 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 11:20:29,788 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 11:20:29,790 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 11:20:29,790 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 11:20:29,790 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 11:20:29,790 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 11:20:29,791 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 11:20:29,791 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 11:20:29,791 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 11:20:29,792 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 11:20:29,792 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 11:20:29,793 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 11:20:29,793 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 11:20:29,793 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 11:20:29,794 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 11:20:29,794 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 11:20:29,794 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 11:20:29,795 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 11:20:29,807 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 11:20:29,808 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-08 11:20:29,813 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 11:20:29,813 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 11:20:29,814 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 11:20:29,814 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 11:20:29,814 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 11:20:29,814 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 11:20:29,814 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 11:20:29,815 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 11:20:29,815 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 11:20:29,815 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 11:20:29,815 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 11:20:29,815 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 11:20:29,815 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 11:20:29,815 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 11:20:29,815 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 11:20:29,816 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 11:20:29,816 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 11:20:29,816 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 11:20:29,816 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 11:20:29,816 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 11:20:29,816 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 11:20:29,816 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-08 11:20:29,816 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-08 11:20:30,007 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 11:20:30,034 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 11:20:30,035 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 11:20:30,036 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 11:20:30,037 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 11:20:30,038 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/cohendiv-ll_unwindbound100.c [2022-04-08 11:20:30,081 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/777496592/666b35b23eb5483784fb42fd955569d7/FLAG7fcee8beb [2022-04-08 11:20:30,439 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 11:20:30,440 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/cohendiv-ll_unwindbound100.c [2022-04-08 11:20:30,444 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/777496592/666b35b23eb5483784fb42fd955569d7/FLAG7fcee8beb [2022-04-08 11:20:30,451 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/777496592/666b35b23eb5483784fb42fd955569d7 [2022-04-08 11:20:30,453 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 11:20:30,454 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 11:20:30,455 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 11:20:30,455 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 11:20:30,457 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 11:20:30,458 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 11:20:30" (1/1) ... [2022-04-08 11:20:30,458 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@743d270a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 11:20:30, skipping insertion in model container [2022-04-08 11:20:30,459 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 11:20:30" (1/1) ... [2022-04-08 11:20:30,463 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 11:20:30,474 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 11:20:30,604 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_unwindbound100.c[576,589] [2022-04-08 11:20:30,620 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 11:20:30,654 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 11:20:30,663 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_unwindbound100.c[576,589] [2022-04-08 11:20:30,668 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 11:20:30,676 INFO L208 MainTranslator]: Completed translation [2022-04-08 11:20:30,676 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 11:20:30 WrapperNode [2022-04-08 11:20:30,676 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 11:20:30,677 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 11:20:30,677 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 11:20:30,677 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 11:20:30,685 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 11:20:30" (1/1) ... [2022-04-08 11:20:30,685 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 11:20:30" (1/1) ... [2022-04-08 11:20:30,689 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 11:20:30" (1/1) ... [2022-04-08 11:20:30,689 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 11:20:30" (1/1) ... [2022-04-08 11:20:30,694 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 11:20:30" (1/1) ... [2022-04-08 11:20:30,702 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 11:20:30" (1/1) ... [2022-04-08 11:20:30,703 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 11:20:30" (1/1) ... [2022-04-08 11:20:30,704 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 11:20:30,705 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 11:20:30,705 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 11:20:30,705 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 11:20:30,706 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 11:20:30" (1/1) ... [2022-04-08 11:20:30,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 11:20:30,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:20:30,728 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-08 11:20:30,729 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-08 11:20:30,761 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 11:20:30,762 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 11:20:30,762 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 11:20:30,762 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-08 11:20:30,762 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 11:20:30,763 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 11:20:30,763 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 11:20:30,763 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 11:20:30,763 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 11:20:30,763 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 11:20:30,763 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-08 11:20:30,764 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-08 11:20:30,764 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 11:20:30,764 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 11:20:30,765 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 11:20:30,766 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 11:20:30,766 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 11:20:30,766 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 11:20:30,767 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 11:20:30,767 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 11:20:30,812 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 11:20:30,813 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 11:20:30,962 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 11:20:30,967 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 11:20:30,983 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-08 11:20:30,984 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 11:20:30 BoogieIcfgContainer [2022-04-08 11:20:30,984 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 11:20:30,985 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 11:20:30,985 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 11:20:30,999 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 11:20:31,000 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 11:20:30" (1/3) ... [2022-04-08 11:20:31,000 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2824ec80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 11:20:31, skipping insertion in model container [2022-04-08 11:20:31,000 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 11:20:30" (2/3) ... [2022-04-08 11:20:31,000 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2824ec80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 11:20:31, skipping insertion in model container [2022-04-08 11:20:31,000 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 11:20:30" (3/3) ... [2022-04-08 11:20:31,001 INFO L111 eAbstractionObserver]: Analyzing ICFG cohendiv-ll_unwindbound100.c [2022-04-08 11:20:31,009 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 11:20:31,009 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 11:20:31,044 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 11:20:31,049 INFO L340 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 [2022-04-08 11:20:31,049 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 11:20:31,073 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-08 11:20:31,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-08 11:20:31,079 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:20:31,079 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 11:20:31,080 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:20:31,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:20:31,087 INFO L85 PathProgramCache]: Analyzing trace with hash -1588022502, now seen corresponding path program 1 times [2022-04-08 11:20:31,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:20:31,094 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [635197469] [2022-04-08 11:20:31,103 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 11:20:31,103 INFO L85 PathProgramCache]: Analyzing trace with hash -1588022502, now seen corresponding path program 2 times [2022-04-08 11:20:31,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:20:31,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95014638] [2022-04-08 11:20:31,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:20:31,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:20:31,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:20:31,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 11:20:31,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:20:31,286 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-08 11:20:31,287 INFO L290 TraceCheckUtils]: 1: Hoare triple {41#true} assume true; {41#true} is VALID [2022-04-08 11:20:31,287 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {41#true} {41#true} #93#return; {41#true} is VALID [2022-04-08 11:20:31,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-08 11:20:31,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:20:31,296 INFO L290 TraceCheckUtils]: 0: Hoare triple {41#true} ~cond := #in~cond; {41#true} is VALID [2022-04-08 11:20:31,297 INFO L290 TraceCheckUtils]: 1: Hoare triple {41#true} assume 0 == ~cond;assume false; {42#false} is VALID [2022-04-08 11:20:31,297 INFO L290 TraceCheckUtils]: 2: Hoare triple {42#false} assume true; {42#false} is VALID [2022-04-08 11:20:31,297 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42#false} {41#true} #77#return; {42#false} is VALID [2022-04-08 11:20:31,299 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-08 11:20:31,299 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-08 11:20:31,300 INFO L290 TraceCheckUtils]: 2: Hoare triple {41#true} assume true; {41#true} is VALID [2022-04-08 11:20:31,300 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41#true} {41#true} #93#return; {41#true} is VALID [2022-04-08 11:20:31,301 INFO L272 TraceCheckUtils]: 4: Hoare triple {41#true} call #t~ret8 := main(); {41#true} is VALID [2022-04-08 11:20:31,301 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-08 11:20:31,301 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-08 11:20:31,302 INFO L290 TraceCheckUtils]: 7: Hoare triple {41#true} ~cond := #in~cond; {41#true} is VALID [2022-04-08 11:20:31,303 INFO L290 TraceCheckUtils]: 8: Hoare triple {41#true} assume 0 == ~cond;assume false; {42#false} is VALID [2022-04-08 11:20:31,303 INFO L290 TraceCheckUtils]: 9: Hoare triple {42#false} assume true; {42#false} is VALID [2022-04-08 11:20:31,303 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {42#false} {41#true} #77#return; {42#false} is VALID [2022-04-08 11:20:31,304 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-08 11:20:31,304 INFO L290 TraceCheckUtils]: 12: Hoare triple {42#false} assume !true; {42#false} is VALID [2022-04-08 11:20:31,304 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-08 11:20:31,304 INFO L290 TraceCheckUtils]: 14: Hoare triple {42#false} ~cond := #in~cond; {42#false} is VALID [2022-04-08 11:20:31,305 INFO L290 TraceCheckUtils]: 15: Hoare triple {42#false} assume 0 == ~cond; {42#false} is VALID [2022-04-08 11:20:31,305 INFO L290 TraceCheckUtils]: 16: Hoare triple {42#false} assume !false; {42#false} is VALID [2022-04-08 11:20:31,305 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-08 11:20:31,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:20:31,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95014638] [2022-04-08 11:20:31,306 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95014638] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:20:31,307 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:20:31,307 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 11:20:31,309 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:20:31,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [635197469] [2022-04-08 11:20:31,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [635197469] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:20:31,310 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:20:31,310 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 11:20:31,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273480825] [2022-04-08 11:20:31,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:20:31,314 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-08 11:20:31,315 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:20:31,317 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-08 11:20:31,340 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-08 11:20:31,341 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-08 11:20:31,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:20:31,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-08 11:20:31,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 11:20:31,367 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-08 11:20:31,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:20:31,556 INFO L93 Difference]: Finished difference Result 68 states and 101 transitions. [2022-04-08 11:20:31,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-08 11:20:31,557 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-08 11:20:31,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:20:31,558 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-08 11:20:31,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 101 transitions. [2022-04-08 11:20:31,570 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-08 11:20:31,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 101 transitions. [2022-04-08 11:20:31,581 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 101 transitions. [2022-04-08 11:20:31,680 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-08 11:20:31,688 INFO L225 Difference]: With dead ends: 68 [2022-04-08 11:20:31,688 INFO L226 Difference]: Without dead ends: 34 [2022-04-08 11:20:31,691 INFO L912 BasicCegarLoop]: 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-08 11:20:31,695 INFO L913 BasicCegarLoop]: 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-08 11:20:31,696 INFO L914 BasicCegarLoop]: 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-08 11:20:31,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-08 11:20:31,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2022-04-08 11:20:31,723 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:20:31,724 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-08 11:20:31,725 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-08 11:20:31,726 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-08 11:20:31,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:20:31,731 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2022-04-08 11:20:31,731 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2022-04-08 11:20:31,731 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:20:31,731 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:20:31,732 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-08 11:20:31,733 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-08 11:20:31,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:20:31,738 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2022-04-08 11:20:31,738 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2022-04-08 11:20:31,739 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:20:31,740 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:20:31,742 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:20:31,742 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:20:31,747 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-08 11:20:31,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 42 transitions. [2022-04-08 11:20:31,752 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 42 transitions. Word has length 17 [2022-04-08 11:20:31,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:20:31,752 INFO L478 AbstractCegarLoop]: Abstraction has 33 states and 42 transitions. [2022-04-08 11:20:31,753 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (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-08 11:20:31,753 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 42 transitions. [2022-04-08 11:20:31,793 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-08 11:20:31,793 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 42 transitions. [2022-04-08 11:20:31,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-08 11:20:31,794 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:20:31,794 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 11:20:31,794 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 11:20:31,794 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:20:31,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:20:31,796 INFO L85 PathProgramCache]: Analyzing trace with hash 766070672, now seen corresponding path program 1 times [2022-04-08 11:20:31,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:20:31,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1966701308] [2022-04-08 11:20:31,799 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 11:20:31,799 INFO L85 PathProgramCache]: Analyzing trace with hash 766070672, now seen corresponding path program 2 times [2022-04-08 11:20:31,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:20:31,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973386248] [2022-04-08 11:20:31,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:20:31,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:20:31,839 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:20:31,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [496340481] [2022-04-08 11:20:31,840 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 11:20:31,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:20:31,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:20:31,848 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-08 11:20:31,849 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-08 11:20:31,895 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-08 11:20:31,895 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:20:31,897 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-08 11:20:31,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:20:31,908 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:20:32,018 INFO L272 TraceCheckUtils]: 0: Hoare triple {323#true} call ULTIMATE.init(); {323#true} is VALID [2022-04-08 11:20:32,019 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-08 11:20:32,020 INFO L290 TraceCheckUtils]: 2: Hoare triple {331#(<= ~counter~0 0)} assume true; {331#(<= ~counter~0 0)} is VALID [2022-04-08 11:20:32,020 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {331#(<= ~counter~0 0)} {323#true} #93#return; {331#(<= ~counter~0 0)} is VALID [2022-04-08 11:20:32,020 INFO L272 TraceCheckUtils]: 4: Hoare triple {331#(<= ~counter~0 0)} call #t~ret8 := main(); {331#(<= ~counter~0 0)} is VALID [2022-04-08 11:20:32,021 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-08 11:20:32,021 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-08 11:20:32,022 INFO L290 TraceCheckUtils]: 7: Hoare triple {331#(<= ~counter~0 0)} ~cond := #in~cond; {331#(<= ~counter~0 0)} is VALID [2022-04-08 11:20:32,022 INFO L290 TraceCheckUtils]: 8: Hoare triple {331#(<= ~counter~0 0)} assume !(0 == ~cond); {331#(<= ~counter~0 0)} is VALID [2022-04-08 11:20:32,022 INFO L290 TraceCheckUtils]: 9: Hoare triple {331#(<= ~counter~0 0)} assume true; {331#(<= ~counter~0 0)} is VALID [2022-04-08 11:20:32,023 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {331#(<= ~counter~0 0)} {331#(<= ~counter~0 0)} #77#return; {331#(<= ~counter~0 0)} is VALID [2022-04-08 11:20:32,023 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-08 11:20:32,024 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-08 11:20:32,024 INFO L290 TraceCheckUtils]: 13: Hoare triple {365#(<= |main_#t~post6| 0)} assume !(#t~post6 < 100);havoc #t~post6; {324#false} is VALID [2022-04-08 11:20:32,025 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-08 11:20:32,025 INFO L290 TraceCheckUtils]: 15: Hoare triple {324#false} ~cond := #in~cond; {324#false} is VALID [2022-04-08 11:20:32,026 INFO L290 TraceCheckUtils]: 16: Hoare triple {324#false} assume 0 == ~cond; {324#false} is VALID [2022-04-08 11:20:32,026 INFO L290 TraceCheckUtils]: 17: Hoare triple {324#false} assume !false; {324#false} is VALID [2022-04-08 11:20:32,026 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-08 11:20:32,026 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 11:20:32,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:20:32,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973386248] [2022-04-08 11:20:32,027 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:20:32,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [496340481] [2022-04-08 11:20:32,028 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [496340481] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:20:32,028 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:20:32,028 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 11:20:32,028 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:20:32,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1966701308] [2022-04-08 11:20:32,029 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1966701308] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:20:32,029 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:20:32,029 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 11:20:32,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065883056] [2022-04-08 11:20:32,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:20:32,030 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-08 11:20:32,030 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:20:32,031 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-08 11:20:32,041 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-08 11:20:32,042 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 11:20:32,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:20:32,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 11:20:32,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 11:20:32,043 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-08 11:20:32,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:20:32,111 INFO L93 Difference]: Finished difference Result 42 states and 51 transitions. [2022-04-08 11:20:32,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 11:20:32,112 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-08 11:20:32,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:20:32,112 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-08 11:20:32,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 51 transitions. [2022-04-08 11:20:32,113 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-08 11:20:32,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 51 transitions. [2022-04-08 11:20:32,115 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 51 transitions. [2022-04-08 11:20:32,155 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-08 11:20:32,156 INFO L225 Difference]: With dead ends: 42 [2022-04-08 11:20:32,156 INFO L226 Difference]: Without dead ends: 35 [2022-04-08 11:20:32,157 INFO L912 BasicCegarLoop]: 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-08 11:20:32,157 INFO L913 BasicCegarLoop]: 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-08 11:20:32,158 INFO L914 BasicCegarLoop]: 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-08 11:20:32,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-08 11:20:32,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2022-04-08 11:20:32,166 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:20:32,167 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-08 11:20:32,167 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-08 11:20:32,167 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-08 11:20:32,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:20:32,169 INFO L93 Difference]: Finished difference Result 35 states and 44 transitions. [2022-04-08 11:20:32,169 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 44 transitions. [2022-04-08 11:20:32,169 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:20:32,169 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:20:32,170 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-08 11:20:32,170 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-08 11:20:32,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:20:32,172 INFO L93 Difference]: Finished difference Result 35 states and 44 transitions. [2022-04-08 11:20:32,172 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 44 transitions. [2022-04-08 11:20:32,172 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:20:32,172 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:20:32,173 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:20:32,173 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:20:32,173 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-08 11:20:32,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 44 transitions. [2022-04-08 11:20:32,175 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 44 transitions. Word has length 18 [2022-04-08 11:20:32,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:20:32,175 INFO L478 AbstractCegarLoop]: Abstraction has 35 states and 44 transitions. [2022-04-08 11:20:32,175 INFO L479 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-08 11:20:32,175 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 44 transitions. [2022-04-08 11:20:32,209 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-08 11:20:32,209 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 44 transitions. [2022-04-08 11:20:32,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-08 11:20:32,210 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:20:32,210 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 11:20:32,230 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-08 11:20:32,419 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:20:32,420 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:20:32,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:20:32,420 INFO L85 PathProgramCache]: Analyzing trace with hash 767560222, now seen corresponding path program 1 times [2022-04-08 11:20:32,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:20:32,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [878772276] [2022-04-08 11:20:32,421 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 11:20:32,421 INFO L85 PathProgramCache]: Analyzing trace with hash 767560222, now seen corresponding path program 2 times [2022-04-08 11:20:32,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:20:32,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571988352] [2022-04-08 11:20:32,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:20:32,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:20:32,436 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:20:32,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1228725198] [2022-04-08 11:20:32,437 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 11:20:32,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:20:32,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:20:32,444 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-08 11:20:32,445 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-08 11:20:32,477 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-08 11:20:32,477 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:20:32,478 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-08 11:20:32,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:20:32,487 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:20:32,599 INFO L272 TraceCheckUtils]: 0: Hoare triple {604#true} call ULTIMATE.init(); {604#true} is VALID [2022-04-08 11:20:32,599 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-08 11:20:32,599 INFO L290 TraceCheckUtils]: 2: Hoare triple {604#true} assume true; {604#true} is VALID [2022-04-08 11:20:32,600 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {604#true} {604#true} #93#return; {604#true} is VALID [2022-04-08 11:20:32,600 INFO L272 TraceCheckUtils]: 4: Hoare triple {604#true} call #t~ret8 := main(); {604#true} is VALID [2022-04-08 11:20:32,600 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-08 11:20:32,602 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-08 11:20:32,602 INFO L290 TraceCheckUtils]: 7: Hoare triple {604#true} ~cond := #in~cond; {604#true} is VALID [2022-04-08 11:20:32,603 INFO L290 TraceCheckUtils]: 8: Hoare triple {604#true} assume !(0 == ~cond); {604#true} is VALID [2022-04-08 11:20:32,603 INFO L290 TraceCheckUtils]: 9: Hoare triple {604#true} assume true; {604#true} is VALID [2022-04-08 11:20:32,604 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {604#true} {604#true} #77#return; {604#true} is VALID [2022-04-08 11:20:32,605 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-08 11:20:32,605 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-08 11:20:32,606 INFO L290 TraceCheckUtils]: 13: Hoare triple {642#(and (= main_~a~0 0) (= main_~b~0 0))} assume !!(#t~post6 < 100);havoc #t~post6; {642#(and (= main_~a~0 0) (= main_~b~0 0))} is VALID [2022-04-08 11:20:32,607 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-08 11:20:32,607 INFO L290 TraceCheckUtils]: 15: Hoare triple {652#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {656#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:20:32,607 INFO L290 TraceCheckUtils]: 16: Hoare triple {656#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {605#false} is VALID [2022-04-08 11:20:32,607 INFO L290 TraceCheckUtils]: 17: Hoare triple {605#false} assume !false; {605#false} is VALID [2022-04-08 11:20:32,608 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-08 11:20:32,608 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 11:20:32,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:20:32,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571988352] [2022-04-08 11:20:32,608 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:20:32,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1228725198] [2022-04-08 11:20:32,608 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1228725198] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:20:32,608 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:20:32,609 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 11:20:32,609 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:20:32,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [878772276] [2022-04-08 11:20:32,609 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [878772276] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:20:32,609 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:20:32,609 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 11:20:32,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682384845] [2022-04-08 11:20:32,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:20:32,610 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-08 11:20:32,610 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:20:32,610 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-08 11:20:32,626 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-08 11:20:32,627 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 11:20:32,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:20:32,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 11:20:32,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 11:20:32,627 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-08 11:20:32,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:20:32,765 INFO L93 Difference]: Finished difference Result 45 states and 56 transitions. [2022-04-08 11:20:32,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 11:20:32,765 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-08 11:20:32,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:20:32,766 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-08 11:20:32,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 56 transitions. [2022-04-08 11:20:32,770 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-08 11:20:32,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 56 transitions. [2022-04-08 11:20:32,776 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 56 transitions. [2022-04-08 11:20:32,816 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-08 11:20:32,817 INFO L225 Difference]: With dead ends: 45 [2022-04-08 11:20:32,817 INFO L226 Difference]: Without dead ends: 43 [2022-04-08 11:20:32,818 INFO L912 BasicCegarLoop]: 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-08 11:20:32,818 INFO L913 BasicCegarLoop]: 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-08 11:20:32,819 INFO L914 BasicCegarLoop]: 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-08 11:20:32,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-04-08 11:20:32,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 40. [2022-04-08 11:20:32,839 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:20:32,840 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-08 11:20:32,841 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-08 11:20:32,841 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-08 11:20:32,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:20:32,851 INFO L93 Difference]: Finished difference Result 43 states and 54 transitions. [2022-04-08 11:20:32,851 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 54 transitions. [2022-04-08 11:20:32,851 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:20:32,851 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:20:32,851 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-08 11:20:32,852 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-08 11:20:32,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:20:32,853 INFO L93 Difference]: Finished difference Result 43 states and 54 transitions. [2022-04-08 11:20:32,853 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 54 transitions. [2022-04-08 11:20:32,854 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:20:32,854 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:20:32,854 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:20:32,854 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:20:32,854 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-08 11:20:32,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 49 transitions. [2022-04-08 11:20:32,856 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 49 transitions. Word has length 18 [2022-04-08 11:20:32,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:20:32,856 INFO L478 AbstractCegarLoop]: Abstraction has 40 states and 49 transitions. [2022-04-08 11:20:32,856 INFO L479 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-08 11:20:32,856 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 40 states and 49 transitions. [2022-04-08 11:20:32,892 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-08 11:20:32,893 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 49 transitions. [2022-04-08 11:20:32,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-08 11:20:32,893 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:20:32,893 INFO L499 BasicCegarLoop]: 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-08 11:20:32,909 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-08 11:20:33,094 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-08 11:20:33,094 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:20:33,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:20:33,095 INFO L85 PathProgramCache]: Analyzing trace with hash -1016228092, now seen corresponding path program 1 times [2022-04-08 11:20:33,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:20:33,095 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1284543194] [2022-04-08 11:20:33,095 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 11:20:33,095 INFO L85 PathProgramCache]: Analyzing trace with hash -1016228092, now seen corresponding path program 2 times [2022-04-08 11:20:33,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:20:33,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131244338] [2022-04-08 11:20:33,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:20:33,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:20:33,109 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:20:33,109 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [45108974] [2022-04-08 11:20:33,110 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 11:20:33,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:20:33,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:20:33,111 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-08 11:20:33,121 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-08 11:20:33,155 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 11:20:33,155 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:20:33,156 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-08 11:20:33,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:20:33,162 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:20:33,257 INFO L272 TraceCheckUtils]: 0: Hoare triple {920#true} call ULTIMATE.init(); {920#true} is VALID [2022-04-08 11:20:33,257 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-08 11:20:33,257 INFO L290 TraceCheckUtils]: 2: Hoare triple {920#true} assume true; {920#true} is VALID [2022-04-08 11:20:33,257 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {920#true} {920#true} #93#return; {920#true} is VALID [2022-04-08 11:20:33,257 INFO L272 TraceCheckUtils]: 4: Hoare triple {920#true} call #t~ret8 := main(); {920#true} is VALID [2022-04-08 11:20:33,258 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-08 11:20:33,258 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-08 11:20:33,258 INFO L290 TraceCheckUtils]: 7: Hoare triple {920#true} ~cond := #in~cond; {920#true} is VALID [2022-04-08 11:20:33,258 INFO L290 TraceCheckUtils]: 8: Hoare triple {920#true} assume !(0 == ~cond); {920#true} is VALID [2022-04-08 11:20:33,258 INFO L290 TraceCheckUtils]: 9: Hoare triple {920#true} assume true; {920#true} is VALID [2022-04-08 11:20:33,258 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {920#true} {920#true} #77#return; {920#true} is VALID [2022-04-08 11:20:33,259 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-08 11:20:33,260 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-08 11:20:33,260 INFO L290 TraceCheckUtils]: 13: Hoare triple {958#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} assume !!(#t~post6 < 100);havoc #t~post6; {958#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 11:20:33,260 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-08 11:20:33,260 INFO L290 TraceCheckUtils]: 15: Hoare triple {920#true} ~cond := #in~cond; {920#true} is VALID [2022-04-08 11:20:33,260 INFO L290 TraceCheckUtils]: 16: Hoare triple {920#true} assume !(0 == ~cond); {920#true} is VALID [2022-04-08 11:20:33,261 INFO L290 TraceCheckUtils]: 17: Hoare triple {920#true} assume true; {920#true} is VALID [2022-04-08 11:20:33,261 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-08 11:20:33,262 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-08 11:20:33,262 INFO L290 TraceCheckUtils]: 20: Hoare triple {983#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {987#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:20:33,263 INFO L290 TraceCheckUtils]: 21: Hoare triple {987#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {921#false} is VALID [2022-04-08 11:20:33,263 INFO L290 TraceCheckUtils]: 22: Hoare triple {921#false} assume !false; {921#false} is VALID [2022-04-08 11:20:33,263 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-08 11:20:33,263 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 11:20:33,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:20:33,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131244338] [2022-04-08 11:20:33,264 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:20:33,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [45108974] [2022-04-08 11:20:33,264 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [45108974] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:20:33,264 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:20:33,264 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 11:20:33,264 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:20:33,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1284543194] [2022-04-08 11:20:33,264 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1284543194] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:20:33,264 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:20:33,264 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 11:20:33,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262837889] [2022-04-08 11:20:33,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:20:33,265 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-08 11:20:33,265 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:20:33,265 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-08 11:20:33,285 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-08 11:20:33,285 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 11:20:33,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:20:33,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 11:20:33,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 11:20:33,286 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-08 11:20:33,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:20:33,478 INFO L93 Difference]: Finished difference Result 58 states and 74 transitions. [2022-04-08 11:20:33,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 11:20:33,478 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-08 11:20:33,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:20:33,478 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-08 11:20:33,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 71 transitions. [2022-04-08 11:20:33,480 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-08 11:20:33,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 71 transitions. [2022-04-08 11:20:33,481 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 71 transitions. [2022-04-08 11:20:33,528 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-08 11:20:33,529 INFO L225 Difference]: With dead ends: 58 [2022-04-08 11:20:33,530 INFO L226 Difference]: Without dead ends: 55 [2022-04-08 11:20:33,530 INFO L912 BasicCegarLoop]: 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-08 11:20:33,531 INFO L913 BasicCegarLoop]: 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-08 11:20:33,531 INFO L914 BasicCegarLoop]: 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-08 11:20:33,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-04-08 11:20:33,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 54. [2022-04-08 11:20:33,555 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:20:33,555 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-08 11:20:33,555 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-08 11:20:33,556 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-08 11:20:33,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:20:33,558 INFO L93 Difference]: Finished difference Result 55 states and 70 transitions. [2022-04-08 11:20:33,558 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 70 transitions. [2022-04-08 11:20:33,558 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:20:33,558 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:20:33,559 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-08 11:20:33,559 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-08 11:20:33,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:20:33,561 INFO L93 Difference]: Finished difference Result 55 states and 70 transitions. [2022-04-08 11:20:33,561 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 70 transitions. [2022-04-08 11:20:33,561 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:20:33,561 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:20:33,561 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:20:33,562 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:20:33,562 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-08 11:20:33,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 69 transitions. [2022-04-08 11:20:33,564 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 69 transitions. Word has length 23 [2022-04-08 11:20:33,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:20:33,564 INFO L478 AbstractCegarLoop]: Abstraction has 54 states and 69 transitions. [2022-04-08 11:20:33,564 INFO L479 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-08 11:20:33,564 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 54 states and 69 transitions. [2022-04-08 11:20:33,618 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-08 11:20:33,619 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 69 transitions. [2022-04-08 11:20:33,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-08 11:20:33,619 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:20:33,619 INFO L499 BasicCegarLoop]: 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-08 11:20:33,638 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-08 11:20:33,835 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:20:33,836 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:20:33,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:20:33,836 INFO L85 PathProgramCache]: Analyzing trace with hash 2019703110, now seen corresponding path program 1 times [2022-04-08 11:20:33,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:20:33,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1207007718] [2022-04-08 11:20:33,837 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 11:20:33,837 INFO L85 PathProgramCache]: Analyzing trace with hash 2019703110, now seen corresponding path program 2 times [2022-04-08 11:20:33,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:20:33,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838546556] [2022-04-08 11:20:33,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:20:33,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:20:33,848 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:20:33,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [111916081] [2022-04-08 11:20:33,848 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 11:20:33,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:20:33,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:20:33,855 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-08 11:20:33,869 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-08 11:20:33,895 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 11:20:33,896 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:20:33,896 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-08 11:20:33,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:20:33,910 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:20:33,996 INFO L272 TraceCheckUtils]: 0: Hoare triple {1329#true} call ULTIMATE.init(); {1329#true} is VALID [2022-04-08 11:20:33,996 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-08 11:20:33,996 INFO L290 TraceCheckUtils]: 2: Hoare triple {1329#true} assume true; {1329#true} is VALID [2022-04-08 11:20:33,996 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1329#true} {1329#true} #93#return; {1329#true} is VALID [2022-04-08 11:20:33,997 INFO L272 TraceCheckUtils]: 4: Hoare triple {1329#true} call #t~ret8 := main(); {1329#true} is VALID [2022-04-08 11:20:33,997 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-08 11:20:33,997 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-08 11:20:33,997 INFO L290 TraceCheckUtils]: 7: Hoare triple {1329#true} ~cond := #in~cond; {1329#true} is VALID [2022-04-08 11:20:33,997 INFO L290 TraceCheckUtils]: 8: Hoare triple {1329#true} assume !(0 == ~cond); {1329#true} is VALID [2022-04-08 11:20:33,997 INFO L290 TraceCheckUtils]: 9: Hoare triple {1329#true} assume true; {1329#true} is VALID [2022-04-08 11:20:33,997 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1329#true} {1329#true} #77#return; {1329#true} is VALID [2022-04-08 11:20:33,998 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-08 11:20:33,998 INFO L290 TraceCheckUtils]: 12: Hoare triple {1329#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1329#true} is VALID [2022-04-08 11:20:33,998 INFO L290 TraceCheckUtils]: 13: Hoare triple {1329#true} assume !!(#t~post6 < 100);havoc #t~post6; {1329#true} is VALID [2022-04-08 11:20:33,998 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-08 11:20:33,998 INFO L290 TraceCheckUtils]: 15: Hoare triple {1329#true} ~cond := #in~cond; {1329#true} is VALID [2022-04-08 11:20:33,998 INFO L290 TraceCheckUtils]: 16: Hoare triple {1329#true} assume !(0 == ~cond); {1329#true} is VALID [2022-04-08 11:20:33,998 INFO L290 TraceCheckUtils]: 17: Hoare triple {1329#true} assume true; {1329#true} is VALID [2022-04-08 11:20:33,999 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1329#true} {1329#true} #79#return; {1329#true} is VALID [2022-04-08 11:20:33,999 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-08 11:20:33,999 INFO L290 TraceCheckUtils]: 20: Hoare triple {1329#true} ~cond := #in~cond; {1329#true} is VALID [2022-04-08 11:20:33,999 INFO L290 TraceCheckUtils]: 21: Hoare triple {1329#true} assume !(0 == ~cond); {1329#true} is VALID [2022-04-08 11:20:33,999 INFO L290 TraceCheckUtils]: 22: Hoare triple {1329#true} assume true; {1329#true} is VALID [2022-04-08 11:20:33,999 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1329#true} {1329#true} #81#return; {1329#true} is VALID [2022-04-08 11:20:34,001 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-08 11:20:34,001 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-08 11:20:34,002 INFO L290 TraceCheckUtils]: 26: Hoare triple {1406#(and (= main_~a~0 1) (= main_~b~0 main_~y~0))} assume !!(#t~post7 < 100);havoc #t~post7; {1406#(and (= main_~a~0 1) (= main_~b~0 main_~y~0))} is VALID [2022-04-08 11:20:34,003 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-08 11:20:34,003 INFO L290 TraceCheckUtils]: 28: Hoare triple {1416#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1420#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:20:34,004 INFO L290 TraceCheckUtils]: 29: Hoare triple {1420#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1330#false} is VALID [2022-04-08 11:20:34,004 INFO L290 TraceCheckUtils]: 30: Hoare triple {1330#false} assume !false; {1330#false} is VALID [2022-04-08 11:20:34,004 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-08 11:20:34,005 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 11:20:34,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:20:34,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838546556] [2022-04-08 11:20:34,005 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:20:34,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [111916081] [2022-04-08 11:20:34,005 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [111916081] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:20:34,005 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:20:34,005 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 11:20:34,006 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:20:34,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1207007718] [2022-04-08 11:20:34,006 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1207007718] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:20:34,006 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:20:34,006 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 11:20:34,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393665625] [2022-04-08 11:20:34,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:20:34,006 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-08 11:20:34,007 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:20:34,007 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-08 11:20:34,027 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-08 11:20:34,027 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 11:20:34,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:20:34,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 11:20:34,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 11:20:34,028 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-08 11:20:34,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:20:34,184 INFO L93 Difference]: Finished difference Result 83 states and 113 transitions. [2022-04-08 11:20:34,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 11:20:34,184 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-08 11:20:34,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:20:34,186 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-08 11:20:34,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 72 transitions. [2022-04-08 11:20:34,187 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-08 11:20:34,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 72 transitions. [2022-04-08 11:20:34,188 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 72 transitions. [2022-04-08 11:20:34,229 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-08 11:20:34,232 INFO L225 Difference]: With dead ends: 83 [2022-04-08 11:20:34,232 INFO L226 Difference]: Without dead ends: 81 [2022-04-08 11:20:34,232 INFO L912 BasicCegarLoop]: 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-08 11:20:34,234 INFO L913 BasicCegarLoop]: 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-08 11:20:34,234 INFO L914 BasicCegarLoop]: 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-08 11:20:34,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-04-08 11:20:34,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 74. [2022-04-08 11:20:34,257 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:20:34,258 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-08 11:20:34,258 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-08 11:20:34,258 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-08 11:20:34,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:20:34,261 INFO L93 Difference]: Finished difference Result 81 states and 111 transitions. [2022-04-08 11:20:34,261 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 111 transitions. [2022-04-08 11:20:34,262 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:20:34,262 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:20:34,262 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-08 11:20:34,262 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-08 11:20:34,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:20:34,265 INFO L93 Difference]: Finished difference Result 81 states and 111 transitions. [2022-04-08 11:20:34,265 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 111 transitions. [2022-04-08 11:20:34,265 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:20:34,265 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:20:34,266 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:20:34,266 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:20:34,266 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-08 11:20:34,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 100 transitions. [2022-04-08 11:20:34,268 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 100 transitions. Word has length 31 [2022-04-08 11:20:34,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:20:34,268 INFO L478 AbstractCegarLoop]: Abstraction has 74 states and 100 transitions. [2022-04-08 11:20:34,268 INFO L479 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-08 11:20:34,269 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 74 states and 100 transitions. [2022-04-08 11:20:34,344 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-08 11:20:34,344 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 100 transitions. [2022-04-08 11:20:34,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-08 11:20:34,345 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:20:34,345 INFO L499 BasicCegarLoop]: 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-08 11:20:34,363 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-08 11:20:34,563 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:20:34,563 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:20:34,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:20:34,564 INFO L85 PathProgramCache]: Analyzing trace with hash 202176206, now seen corresponding path program 1 times [2022-04-08 11:20:34,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:20:34,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [446572842] [2022-04-08 11:20:41,298 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 11:20:41,298 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 11:20:41,298 INFO L85 PathProgramCache]: Analyzing trace with hash 202176206, now seen corresponding path program 2 times [2022-04-08 11:20:41,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:20:41,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4521519] [2022-04-08 11:20:41,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:20:41,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:20:41,320 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:20:41,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [159168849] [2022-04-08 11:20:41,320 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 11:20:41,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:20:41,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:20:41,332 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-08 11:20:41,333 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-08 11:20:41,373 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 11:20:41,374 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:20:41,375 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-08 11:20:41,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:20:41,389 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:20:41,553 INFO L272 TraceCheckUtils]: 0: Hoare triple {1904#true} call ULTIMATE.init(); {1904#true} is VALID [2022-04-08 11:20:41,554 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-08 11:20:41,555 INFO L290 TraceCheckUtils]: 2: Hoare triple {1912#(<= ~counter~0 0)} assume true; {1912#(<= ~counter~0 0)} is VALID [2022-04-08 11:20:41,561 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1912#(<= ~counter~0 0)} {1904#true} #93#return; {1912#(<= ~counter~0 0)} is VALID [2022-04-08 11:20:41,563 INFO L272 TraceCheckUtils]: 4: Hoare triple {1912#(<= ~counter~0 0)} call #t~ret8 := main(); {1912#(<= ~counter~0 0)} is VALID [2022-04-08 11:20:41,564 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-08 11:20:41,564 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-08 11:20:41,564 INFO L290 TraceCheckUtils]: 7: Hoare triple {1912#(<= ~counter~0 0)} ~cond := #in~cond; {1912#(<= ~counter~0 0)} is VALID [2022-04-08 11:20:41,565 INFO L290 TraceCheckUtils]: 8: Hoare triple {1912#(<= ~counter~0 0)} assume !(0 == ~cond); {1912#(<= ~counter~0 0)} is VALID [2022-04-08 11:20:41,565 INFO L290 TraceCheckUtils]: 9: Hoare triple {1912#(<= ~counter~0 0)} assume true; {1912#(<= ~counter~0 0)} is VALID [2022-04-08 11:20:41,566 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1912#(<= ~counter~0 0)} {1912#(<= ~counter~0 0)} #77#return; {1912#(<= ~counter~0 0)} is VALID [2022-04-08 11:20:41,566 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-08 11:20:41,566 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-08 11:20:41,567 INFO L290 TraceCheckUtils]: 13: Hoare triple {1946#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {1946#(<= ~counter~0 1)} is VALID [2022-04-08 11:20:41,567 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-08 11:20:41,568 INFO L290 TraceCheckUtils]: 15: Hoare triple {1946#(<= ~counter~0 1)} ~cond := #in~cond; {1946#(<= ~counter~0 1)} is VALID [2022-04-08 11:20:41,568 INFO L290 TraceCheckUtils]: 16: Hoare triple {1946#(<= ~counter~0 1)} assume !(0 == ~cond); {1946#(<= ~counter~0 1)} is VALID [2022-04-08 11:20:41,568 INFO L290 TraceCheckUtils]: 17: Hoare triple {1946#(<= ~counter~0 1)} assume true; {1946#(<= ~counter~0 1)} is VALID [2022-04-08 11:20:41,569 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1946#(<= ~counter~0 1)} {1946#(<= ~counter~0 1)} #79#return; {1946#(<= ~counter~0 1)} is VALID [2022-04-08 11:20:41,569 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-08 11:20:41,570 INFO L290 TraceCheckUtils]: 20: Hoare triple {1946#(<= ~counter~0 1)} ~cond := #in~cond; {1946#(<= ~counter~0 1)} is VALID [2022-04-08 11:20:41,570 INFO L290 TraceCheckUtils]: 21: Hoare triple {1946#(<= ~counter~0 1)} assume !(0 == ~cond); {1946#(<= ~counter~0 1)} is VALID [2022-04-08 11:20:41,570 INFO L290 TraceCheckUtils]: 22: Hoare triple {1946#(<= ~counter~0 1)} assume true; {1946#(<= ~counter~0 1)} is VALID [2022-04-08 11:20:41,571 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1946#(<= ~counter~0 1)} {1946#(<= ~counter~0 1)} #81#return; {1946#(<= ~counter~0 1)} is VALID [2022-04-08 11:20:41,571 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-08 11:20:41,571 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-08 11:20:41,572 INFO L290 TraceCheckUtils]: 26: Hoare triple {1986#(<= |main_#t~post7| 1)} assume !(#t~post7 < 100);havoc #t~post7; {1905#false} is VALID [2022-04-08 11:20:41,572 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-08 11:20:41,572 INFO L290 TraceCheckUtils]: 28: Hoare triple {1905#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1905#false} is VALID [2022-04-08 11:20:41,572 INFO L290 TraceCheckUtils]: 29: Hoare triple {1905#false} assume !(#t~post6 < 100);havoc #t~post6; {1905#false} is VALID [2022-04-08 11:20:41,572 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-08 11:20:41,572 INFO L290 TraceCheckUtils]: 31: Hoare triple {1905#false} ~cond := #in~cond; {1905#false} is VALID [2022-04-08 11:20:41,573 INFO L290 TraceCheckUtils]: 32: Hoare triple {1905#false} assume 0 == ~cond; {1905#false} is VALID [2022-04-08 11:20:41,573 INFO L290 TraceCheckUtils]: 33: Hoare triple {1905#false} assume !false; {1905#false} is VALID [2022-04-08 11:20:41,573 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-08 11:20:41,573 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 11:20:41,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:20:41,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4521519] [2022-04-08 11:20:41,573 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:20:41,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [159168849] [2022-04-08 11:20:41,573 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [159168849] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:20:41,573 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:20:41,573 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 11:20:41,574 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:20:41,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [446572842] [2022-04-08 11:20:41,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [446572842] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:20:41,574 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:20:41,574 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 11:20:41,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329414342] [2022-04-08 11:20:41,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:20:41,574 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-08 11:20:41,575 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:20:41,575 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-08 11:20:41,596 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-08 11:20:41,596 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 11:20:41,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:20:41,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 11:20:41,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-08 11:20:41,596 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-08 11:20:41,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:20:41,705 INFO L93 Difference]: Finished difference Result 113 states and 153 transitions. [2022-04-08 11:20:41,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 11:20:41,705 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-08 11:20:41,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:20:41,706 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-08 11:20:41,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 85 transitions. [2022-04-08 11:20:41,707 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-08 11:20:41,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 85 transitions. [2022-04-08 11:20:41,708 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 85 transitions. [2022-04-08 11:20:41,762 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-08 11:20:41,763 INFO L225 Difference]: With dead ends: 113 [2022-04-08 11:20:41,763 INFO L226 Difference]: Without dead ends: 78 [2022-04-08 11:20:41,764 INFO L912 BasicCegarLoop]: 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-08 11:20:41,764 INFO L913 BasicCegarLoop]: 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-08 11:20:41,764 INFO L914 BasicCegarLoop]: 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-08 11:20:41,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-04-08 11:20:41,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2022-04-08 11:20:41,792 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:20:41,792 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-08 11:20:41,793 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-08 11:20:41,793 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-08 11:20:41,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:20:41,795 INFO L93 Difference]: Finished difference Result 78 states and 102 transitions. [2022-04-08 11:20:41,795 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 102 transitions. [2022-04-08 11:20:41,796 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:20:41,796 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:20:41,796 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-08 11:20:41,796 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-08 11:20:41,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:20:41,799 INFO L93 Difference]: Finished difference Result 78 states and 102 transitions. [2022-04-08 11:20:41,799 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 102 transitions. [2022-04-08 11:20:41,799 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:20:41,799 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:20:41,799 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:20:41,799 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:20:41,799 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-08 11:20:41,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 102 transitions. [2022-04-08 11:20:41,802 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 102 transitions. Word has length 34 [2022-04-08 11:20:41,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:20:41,802 INFO L478 AbstractCegarLoop]: Abstraction has 78 states and 102 transitions. [2022-04-08 11:20:41,802 INFO L479 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-08 11:20:41,802 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 78 states and 102 transitions. [2022-04-08 11:20:41,878 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-08 11:20:41,878 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 102 transitions. [2022-04-08 11:20:41,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-08 11:20:41,879 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:20:41,879 INFO L499 BasicCegarLoop]: 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-08 11:20:41,898 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-08 11:20:42,095 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:20:42,096 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:20:42,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:20:42,096 INFO L85 PathProgramCache]: Analyzing trace with hash 1813008070, now seen corresponding path program 1 times [2022-04-08 11:20:42,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:20:42,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [15108363] [2022-04-08 11:20:42,097 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 11:20:42,097 INFO L85 PathProgramCache]: Analyzing trace with hash 1813008070, now seen corresponding path program 2 times [2022-04-08 11:20:42,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:20:42,097 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44439534] [2022-04-08 11:20:42,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:20:42,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:20:42,107 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:20:42,107 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1871675033] [2022-04-08 11:20:42,107 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 11:20:42,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:20:42,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:20:42,108 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-08 11:20:42,122 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-08 11:20:42,156 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 11:20:42,156 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:20:42,157 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-08 11:20:42,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:20:42,168 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:20:42,368 INFO L272 TraceCheckUtils]: 0: Hoare triple {2548#true} call ULTIMATE.init(); {2548#true} is VALID [2022-04-08 11:20:42,368 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-08 11:20:42,368 INFO L290 TraceCheckUtils]: 2: Hoare triple {2548#true} assume true; {2548#true} is VALID [2022-04-08 11:20:42,368 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2548#true} {2548#true} #93#return; {2548#true} is VALID [2022-04-08 11:20:42,368 INFO L272 TraceCheckUtils]: 4: Hoare triple {2548#true} call #t~ret8 := main(); {2548#true} is VALID [2022-04-08 11:20:42,368 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-08 11:20:42,368 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-08 11:20:42,369 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-08 11:20:42,369 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-08 11:20:42,369 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-08 11:20:42,370 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-08 11:20:42,370 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-08 11:20:42,371 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-08 11:20:42,371 INFO L290 TraceCheckUtils]: 13: Hoare triple {2585#(<= 1 main_~y~0)} assume !!(#t~post6 < 100);havoc #t~post6; {2585#(<= 1 main_~y~0)} is VALID [2022-04-08 11:20:42,371 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-08 11:20:42,371 INFO L290 TraceCheckUtils]: 15: Hoare triple {2548#true} ~cond := #in~cond; {2548#true} is VALID [2022-04-08 11:20:42,371 INFO L290 TraceCheckUtils]: 16: Hoare triple {2548#true} assume !(0 == ~cond); {2548#true} is VALID [2022-04-08 11:20:42,371 INFO L290 TraceCheckUtils]: 17: Hoare triple {2548#true} assume true; {2548#true} is VALID [2022-04-08 11:20:42,372 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {2548#true} {2585#(<= 1 main_~y~0)} #79#return; {2585#(<= 1 main_~y~0)} is VALID [2022-04-08 11:20:42,372 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-08 11:20:42,372 INFO L290 TraceCheckUtils]: 20: Hoare triple {2548#true} ~cond := #in~cond; {2548#true} is VALID [2022-04-08 11:20:42,372 INFO L290 TraceCheckUtils]: 21: Hoare triple {2548#true} assume !(0 == ~cond); {2548#true} is VALID [2022-04-08 11:20:42,372 INFO L290 TraceCheckUtils]: 22: Hoare triple {2548#true} assume true; {2548#true} is VALID [2022-04-08 11:20:42,373 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2548#true} {2585#(<= 1 main_~y~0)} #81#return; {2585#(<= 1 main_~y~0)} is VALID [2022-04-08 11:20:42,373 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-08 11:20:42,374 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-08 11:20:42,374 INFO L290 TraceCheckUtils]: 26: Hoare triple {2628#(<= 1 main_~r~0)} assume !!(#t~post7 < 100);havoc #t~post7; {2628#(<= 1 main_~r~0)} is VALID [2022-04-08 11:20:42,374 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-08 11:20:42,374 INFO L290 TraceCheckUtils]: 28: Hoare triple {2548#true} ~cond := #in~cond; {2548#true} is VALID [2022-04-08 11:20:42,374 INFO L290 TraceCheckUtils]: 29: Hoare triple {2548#true} assume !(0 == ~cond); {2548#true} is VALID [2022-04-08 11:20:42,374 INFO L290 TraceCheckUtils]: 30: Hoare triple {2548#true} assume true; {2548#true} is VALID [2022-04-08 11:20:42,375 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {2548#true} {2628#(<= 1 main_~r~0)} #83#return; {2628#(<= 1 main_~r~0)} is VALID [2022-04-08 11:20:42,375 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-08 11:20:42,375 INFO L290 TraceCheckUtils]: 33: Hoare triple {2548#true} ~cond := #in~cond; {2548#true} is VALID [2022-04-08 11:20:42,375 INFO L290 TraceCheckUtils]: 34: Hoare triple {2548#true} assume !(0 == ~cond); {2548#true} is VALID [2022-04-08 11:20:42,375 INFO L290 TraceCheckUtils]: 35: Hoare triple {2548#true} assume true; {2548#true} is VALID [2022-04-08 11:20:42,376 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {2548#true} {2628#(<= 1 main_~r~0)} #85#return; {2628#(<= 1 main_~r~0)} is VALID [2022-04-08 11:20:42,377 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-08 11:20:42,377 INFO L290 TraceCheckUtils]: 38: Hoare triple {2668#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2672#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:20:42,377 INFO L290 TraceCheckUtils]: 39: Hoare triple {2672#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2549#false} is VALID [2022-04-08 11:20:42,377 INFO L290 TraceCheckUtils]: 40: Hoare triple {2549#false} assume !false; {2549#false} is VALID [2022-04-08 11:20:42,378 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-08 11:20:42,378 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 11:20:42,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:20:42,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44439534] [2022-04-08 11:20:42,378 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:20:42,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1871675033] [2022-04-08 11:20:42,378 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1871675033] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:20:42,378 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:20:42,378 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 11:20:42,379 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:20:42,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [15108363] [2022-04-08 11:20:42,379 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [15108363] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:20:42,379 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:20:42,379 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 11:20:42,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325646027] [2022-04-08 11:20:42,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:20:42,379 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-08 11:20:42,379 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:20:42,380 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-08 11:20:42,402 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-08 11:20:42,402 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 11:20:42,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:20:42,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 11:20:42,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-04-08 11:20:42,403 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-08 11:20:42,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:20:42,707 INFO L93 Difference]: Finished difference Result 84 states and 107 transitions. [2022-04-08 11:20:42,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 11:20:42,708 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-08 11:20:42,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:20:42,708 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-08 11:20:42,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 47 transitions. [2022-04-08 11:20:42,709 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-08 11:20:42,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 47 transitions. [2022-04-08 11:20:42,710 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 47 transitions. [2022-04-08 11:20:42,750 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-08 11:20:42,751 INFO L225 Difference]: With dead ends: 84 [2022-04-08 11:20:42,751 INFO L226 Difference]: Without dead ends: 82 [2022-04-08 11:20:42,752 INFO L912 BasicCegarLoop]: 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-08 11:20:42,752 INFO L913 BasicCegarLoop]: 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-08 11:20:42,752 INFO L914 BasicCegarLoop]: 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-08 11:20:42,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-04-08 11:20:42,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2022-04-08 11:20:42,826 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:20:42,826 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-08 11:20:42,826 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-08 11:20:42,827 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-08 11:20:42,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:20:42,829 INFO L93 Difference]: Finished difference Result 82 states and 105 transitions. [2022-04-08 11:20:42,829 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 105 transitions. [2022-04-08 11:20:42,829 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:20:42,829 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:20:42,830 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-08 11:20:42,830 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-08 11:20:42,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:20:42,832 INFO L93 Difference]: Finished difference Result 82 states and 105 transitions. [2022-04-08 11:20:42,832 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 105 transitions. [2022-04-08 11:20:42,832 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:20:42,832 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:20:42,832 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:20:42,833 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:20:42,833 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-08 11:20:42,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 105 transitions. [2022-04-08 11:20:42,837 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 105 transitions. Word has length 41 [2022-04-08 11:20:42,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:20:42,837 INFO L478 AbstractCegarLoop]: Abstraction has 82 states and 105 transitions. [2022-04-08 11:20:42,837 INFO L479 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-08 11:20:42,837 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 82 states and 105 transitions. [2022-04-08 11:20:42,917 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-08 11:20:42,917 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 105 transitions. [2022-04-08 11:20:42,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-08 11:20:42,918 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:20:42,918 INFO L499 BasicCegarLoop]: 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-08 11:20:42,935 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-08 11:20:43,127 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:20:43,127 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:20:43,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:20:43,128 INFO L85 PathProgramCache]: Analyzing trace with hash -683043127, now seen corresponding path program 1 times [2022-04-08 11:20:43,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:20:43,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1079158561] [2022-04-08 11:20:43,128 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 11:20:43,128 INFO L85 PathProgramCache]: Analyzing trace with hash -683043127, now seen corresponding path program 2 times [2022-04-08 11:20:43,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:20:43,129 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701916594] [2022-04-08 11:20:43,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:20:43,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:20:43,142 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:20:43,142 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [370552159] [2022-04-08 11:20:43,142 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 11:20:43,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:20:43,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:20:43,143 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-08 11:20:43,179 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-08 11:20:43,186 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 11:20:43,186 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:20:43,187 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-08 11:20:43,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:20:43,195 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:20:43,388 INFO L272 TraceCheckUtils]: 0: Hoare triple {3180#true} call ULTIMATE.init(); {3180#true} is VALID [2022-04-08 11:20:43,388 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-08 11:20:43,388 INFO L290 TraceCheckUtils]: 2: Hoare triple {3180#true} assume true; {3180#true} is VALID [2022-04-08 11:20:43,388 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3180#true} {3180#true} #93#return; {3180#true} is VALID [2022-04-08 11:20:43,388 INFO L272 TraceCheckUtils]: 4: Hoare triple {3180#true} call #t~ret8 := main(); {3180#true} is VALID [2022-04-08 11:20:43,388 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-08 11:20:43,389 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-08 11:20:43,389 INFO L290 TraceCheckUtils]: 7: Hoare triple {3180#true} ~cond := #in~cond; {3180#true} is VALID [2022-04-08 11:20:43,389 INFO L290 TraceCheckUtils]: 8: Hoare triple {3180#true} assume !(0 == ~cond); {3180#true} is VALID [2022-04-08 11:20:43,389 INFO L290 TraceCheckUtils]: 9: Hoare triple {3180#true} assume true; {3180#true} is VALID [2022-04-08 11:20:43,389 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3180#true} {3180#true} #77#return; {3180#true} is VALID [2022-04-08 11:20:43,389 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-08 11:20:43,389 INFO L290 TraceCheckUtils]: 12: Hoare triple {3180#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3180#true} is VALID [2022-04-08 11:20:43,389 INFO L290 TraceCheckUtils]: 13: Hoare triple {3180#true} assume !!(#t~post6 < 100);havoc #t~post6; {3180#true} is VALID [2022-04-08 11:20:43,389 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-08 11:20:43,389 INFO L290 TraceCheckUtils]: 15: Hoare triple {3180#true} ~cond := #in~cond; {3180#true} is VALID [2022-04-08 11:20:43,390 INFO L290 TraceCheckUtils]: 16: Hoare triple {3180#true} assume !(0 == ~cond); {3180#true} is VALID [2022-04-08 11:20:43,390 INFO L290 TraceCheckUtils]: 17: Hoare triple {3180#true} assume true; {3180#true} is VALID [2022-04-08 11:20:43,390 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {3180#true} {3180#true} #79#return; {3180#true} is VALID [2022-04-08 11:20:43,390 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-08 11:20:43,390 INFO L290 TraceCheckUtils]: 20: Hoare triple {3180#true} ~cond := #in~cond; {3180#true} is VALID [2022-04-08 11:20:43,390 INFO L290 TraceCheckUtils]: 21: Hoare triple {3180#true} assume !(0 == ~cond); {3180#true} is VALID [2022-04-08 11:20:43,390 INFO L290 TraceCheckUtils]: 22: Hoare triple {3180#true} assume true; {3180#true} is VALID [2022-04-08 11:20:43,390 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {3180#true} {3180#true} #81#return; {3180#true} is VALID [2022-04-08 11:20:43,390 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-08 11:20:43,390 INFO L290 TraceCheckUtils]: 25: Hoare triple {3180#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {3180#true} is VALID [2022-04-08 11:20:43,391 INFO L290 TraceCheckUtils]: 26: Hoare triple {3180#true} assume !!(#t~post7 < 100);havoc #t~post7; {3180#true} is VALID [2022-04-08 11:20:43,391 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-08 11:20:43,391 INFO L290 TraceCheckUtils]: 28: Hoare triple {3180#true} ~cond := #in~cond; {3269#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:20:43,391 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-08 11:20:43,392 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-08 11:20:43,392 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-08 11:20:43,393 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-08 11:20:43,393 INFO L290 TraceCheckUtils]: 33: Hoare triple {3180#true} ~cond := #in~cond; {3180#true} is VALID [2022-04-08 11:20:43,393 INFO L290 TraceCheckUtils]: 34: Hoare triple {3180#true} assume !(0 == ~cond); {3180#true} is VALID [2022-04-08 11:20:43,393 INFO L290 TraceCheckUtils]: 35: Hoare triple {3180#true} assume true; {3180#true} is VALID [2022-04-08 11:20:43,393 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-08 11:20:43,393 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-08 11:20:43,394 INFO L290 TraceCheckUtils]: 38: Hoare triple {3180#true} ~cond := #in~cond; {3180#true} is VALID [2022-04-08 11:20:43,394 INFO L290 TraceCheckUtils]: 39: Hoare triple {3180#true} assume !(0 == ~cond); {3180#true} is VALID [2022-04-08 11:20:43,394 INFO L290 TraceCheckUtils]: 40: Hoare triple {3180#true} assume true; {3180#true} is VALID [2022-04-08 11:20:43,394 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-08 11:20:43,395 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-08 11:20:43,395 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-08 11:20:43,396 INFO L290 TraceCheckUtils]: 44: Hoare triple {3318#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3322#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:20:43,396 INFO L290 TraceCheckUtils]: 45: Hoare triple {3322#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3181#false} is VALID [2022-04-08 11:20:43,396 INFO L290 TraceCheckUtils]: 46: Hoare triple {3181#false} assume !false; {3181#false} is VALID [2022-04-08 11:20:43,397 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-08 11:20:43,397 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 11:20:51,793 INFO L290 TraceCheckUtils]: 46: Hoare triple {3181#false} assume !false; {3181#false} is VALID [2022-04-08 11:20:51,794 INFO L290 TraceCheckUtils]: 45: Hoare triple {3322#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3181#false} is VALID [2022-04-08 11:20:51,794 INFO L290 TraceCheckUtils]: 44: Hoare triple {3318#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3322#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:20:51,795 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-08 11:20:51,800 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-08 11:20:51,801 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-08 11:20:51,801 INFO L290 TraceCheckUtils]: 40: Hoare triple {3180#true} assume true; {3180#true} is VALID [2022-04-08 11:20:51,801 INFO L290 TraceCheckUtils]: 39: Hoare triple {3180#true} assume !(0 == ~cond); {3180#true} is VALID [2022-04-08 11:20:51,801 INFO L290 TraceCheckUtils]: 38: Hoare triple {3180#true} ~cond := #in~cond; {3180#true} is VALID [2022-04-08 11:20:51,801 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-08 11:20:51,802 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-08 11:20:51,802 INFO L290 TraceCheckUtils]: 35: Hoare triple {3180#true} assume true; {3180#true} is VALID [2022-04-08 11:20:51,802 INFO L290 TraceCheckUtils]: 34: Hoare triple {3180#true} assume !(0 == ~cond); {3180#true} is VALID [2022-04-08 11:20:51,803 INFO L290 TraceCheckUtils]: 33: Hoare triple {3180#true} ~cond := #in~cond; {3180#true} is VALID [2022-04-08 11:20:51,803 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-08 11:20:51,816 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-08 11:20:51,816 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-08 11:20:51,816 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-08 11:20:51,817 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-08 11:20:51,817 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-08 11:20:51,817 INFO L290 TraceCheckUtils]: 26: Hoare triple {3180#true} assume !!(#t~post7 < 100);havoc #t~post7; {3180#true} is VALID [2022-04-08 11:20:51,817 INFO L290 TraceCheckUtils]: 25: Hoare triple {3180#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {3180#true} is VALID [2022-04-08 11:20:51,817 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-08 11:20:51,818 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {3180#true} {3180#true} #81#return; {3180#true} is VALID [2022-04-08 11:20:51,818 INFO L290 TraceCheckUtils]: 22: Hoare triple {3180#true} assume true; {3180#true} is VALID [2022-04-08 11:20:51,818 INFO L290 TraceCheckUtils]: 21: Hoare triple {3180#true} assume !(0 == ~cond); {3180#true} is VALID [2022-04-08 11:20:51,818 INFO L290 TraceCheckUtils]: 20: Hoare triple {3180#true} ~cond := #in~cond; {3180#true} is VALID [2022-04-08 11:20:51,818 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-08 11:20:51,818 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {3180#true} {3180#true} #79#return; {3180#true} is VALID [2022-04-08 11:20:51,818 INFO L290 TraceCheckUtils]: 17: Hoare triple {3180#true} assume true; {3180#true} is VALID [2022-04-08 11:20:51,818 INFO L290 TraceCheckUtils]: 16: Hoare triple {3180#true} assume !(0 == ~cond); {3180#true} is VALID [2022-04-08 11:20:51,818 INFO L290 TraceCheckUtils]: 15: Hoare triple {3180#true} ~cond := #in~cond; {3180#true} is VALID [2022-04-08 11:20:51,818 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-08 11:20:51,818 INFO L290 TraceCheckUtils]: 13: Hoare triple {3180#true} assume !!(#t~post6 < 100);havoc #t~post6; {3180#true} is VALID [2022-04-08 11:20:51,818 INFO L290 TraceCheckUtils]: 12: Hoare triple {3180#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3180#true} is VALID [2022-04-08 11:20:51,819 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-08 11:20:51,819 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3180#true} {3180#true} #77#return; {3180#true} is VALID [2022-04-08 11:20:51,819 INFO L290 TraceCheckUtils]: 9: Hoare triple {3180#true} assume true; {3180#true} is VALID [2022-04-08 11:20:51,819 INFO L290 TraceCheckUtils]: 8: Hoare triple {3180#true} assume !(0 == ~cond); {3180#true} is VALID [2022-04-08 11:20:51,819 INFO L290 TraceCheckUtils]: 7: Hoare triple {3180#true} ~cond := #in~cond; {3180#true} is VALID [2022-04-08 11:20:51,819 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-08 11:20:51,819 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-08 11:20:51,819 INFO L272 TraceCheckUtils]: 4: Hoare triple {3180#true} call #t~ret8 := main(); {3180#true} is VALID [2022-04-08 11:20:51,819 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3180#true} {3180#true} #93#return; {3180#true} is VALID [2022-04-08 11:20:51,819 INFO L290 TraceCheckUtils]: 2: Hoare triple {3180#true} assume true; {3180#true} is VALID [2022-04-08 11:20:51,819 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-08 11:20:51,820 INFO L272 TraceCheckUtils]: 0: Hoare triple {3180#true} call ULTIMATE.init(); {3180#true} is VALID [2022-04-08 11:20:51,820 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-08 11:20:51,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:20:51,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701916594] [2022-04-08 11:20:51,820 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:20:51,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [370552159] [2022-04-08 11:20:51,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [370552159] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 11:20:51,820 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 11:20:51,820 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2022-04-08 11:20:51,820 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:20:51,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1079158561] [2022-04-08 11:20:51,821 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1079158561] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:20:51,821 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:20:51,821 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 11:20:51,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143016726] [2022-04-08 11:20:51,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:20:51,821 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-08 11:20:51,821 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:20:51,822 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-08 11:20:51,849 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-08 11:20:51,849 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 11:20:51,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:20:51,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 11:20:51,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-04-08 11:20:51,850 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-08 11:20:52,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:20:52,176 INFO L93 Difference]: Finished difference Result 88 states and 110 transitions. [2022-04-08 11:20:52,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 11:20:52,176 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-08 11:20:52,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:20:52,176 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-08 11:20:52,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 47 transitions. [2022-04-08 11:20:52,177 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-08 11:20:52,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 47 transitions. [2022-04-08 11:20:52,178 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 47 transitions. [2022-04-08 11:20:52,213 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-08 11:20:52,215 INFO L225 Difference]: With dead ends: 88 [2022-04-08 11:20:52,215 INFO L226 Difference]: Without dead ends: 86 [2022-04-08 11:20:52,215 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 84 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2022-04-08 11:20:52,216 INFO L913 BasicCegarLoop]: 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-08 11:20:52,216 INFO L914 BasicCegarLoop]: 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-08 11:20:52,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-04-08 11:20:52,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2022-04-08 11:20:52,286 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:20:52,286 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-08 11:20:52,286 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-08 11:20:52,286 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-08 11:20:52,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:20:52,289 INFO L93 Difference]: Finished difference Result 86 states and 108 transitions. [2022-04-08 11:20:52,290 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 108 transitions. [2022-04-08 11:20:52,290 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:20:52,290 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:20:52,290 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-08 11:20:52,290 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-08 11:20:52,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:20:52,293 INFO L93 Difference]: Finished difference Result 86 states and 108 transitions. [2022-04-08 11:20:52,293 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 108 transitions. [2022-04-08 11:20:52,294 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:20:52,294 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:20:52,294 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:20:52,294 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:20:52,294 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-08 11:20:52,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 108 transitions. [2022-04-08 11:20:52,297 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 108 transitions. Word has length 47 [2022-04-08 11:20:52,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:20:52,297 INFO L478 AbstractCegarLoop]: Abstraction has 86 states and 108 transitions. [2022-04-08 11:20:52,298 INFO L479 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-08 11:20:52,298 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 86 states and 108 transitions. [2022-04-08 11:20:52,398 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-08 11:20:52,398 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 108 transitions. [2022-04-08 11:20:52,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-08 11:20:52,398 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:20:52,398 INFO L499 BasicCegarLoop]: 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-08 11:20:52,416 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-08 11:20:52,615 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:20:52,615 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:20:52,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:20:52,616 INFO L85 PathProgramCache]: Analyzing trace with hash -589126939, now seen corresponding path program 1 times [2022-04-08 11:20:52,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:20:52,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [64504811] [2022-04-08 11:21:07,555 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 11:21:07,556 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 11:21:07,556 INFO L85 PathProgramCache]: Analyzing trace with hash -589126939, now seen corresponding path program 2 times [2022-04-08 11:21:07,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:21:07,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296798905] [2022-04-08 11:21:07,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:21:07,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:21:07,567 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:21:07,567 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1067796184] [2022-04-08 11:21:07,567 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 11:21:07,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:21:07,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:21:07,580 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-08 11:21:07,581 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-08 11:21:07,619 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 11:21:07,619 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:21:07,620 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-08 11:21:07,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:21:07,630 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:21:07,841 INFO L272 TraceCheckUtils]: 0: Hoare triple {3997#true} call ULTIMATE.init(); {3997#true} is VALID [2022-04-08 11:21:07,841 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-08 11:21:07,842 INFO L290 TraceCheckUtils]: 2: Hoare triple {4005#(<= ~counter~0 0)} assume true; {4005#(<= ~counter~0 0)} is VALID [2022-04-08 11:21:07,842 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4005#(<= ~counter~0 0)} {3997#true} #93#return; {4005#(<= ~counter~0 0)} is VALID [2022-04-08 11:21:07,843 INFO L272 TraceCheckUtils]: 4: Hoare triple {4005#(<= ~counter~0 0)} call #t~ret8 := main(); {4005#(<= ~counter~0 0)} is VALID [2022-04-08 11:21:07,843 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-08 11:21:07,844 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-08 11:21:07,844 INFO L290 TraceCheckUtils]: 7: Hoare triple {4005#(<= ~counter~0 0)} ~cond := #in~cond; {4005#(<= ~counter~0 0)} is VALID [2022-04-08 11:21:07,844 INFO L290 TraceCheckUtils]: 8: Hoare triple {4005#(<= ~counter~0 0)} assume !(0 == ~cond); {4005#(<= ~counter~0 0)} is VALID [2022-04-08 11:21:07,845 INFO L290 TraceCheckUtils]: 9: Hoare triple {4005#(<= ~counter~0 0)} assume true; {4005#(<= ~counter~0 0)} is VALID [2022-04-08 11:21:07,845 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4005#(<= ~counter~0 0)} {4005#(<= ~counter~0 0)} #77#return; {4005#(<= ~counter~0 0)} is VALID [2022-04-08 11:21:07,845 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-08 11:21:07,846 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-08 11:21:07,846 INFO L290 TraceCheckUtils]: 13: Hoare triple {4039#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {4039#(<= ~counter~0 1)} is VALID [2022-04-08 11:21:07,847 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-08 11:21:07,847 INFO L290 TraceCheckUtils]: 15: Hoare triple {4039#(<= ~counter~0 1)} ~cond := #in~cond; {4039#(<= ~counter~0 1)} is VALID [2022-04-08 11:21:07,848 INFO L290 TraceCheckUtils]: 16: Hoare triple {4039#(<= ~counter~0 1)} assume !(0 == ~cond); {4039#(<= ~counter~0 1)} is VALID [2022-04-08 11:21:07,848 INFO L290 TraceCheckUtils]: 17: Hoare triple {4039#(<= ~counter~0 1)} assume true; {4039#(<= ~counter~0 1)} is VALID [2022-04-08 11:21:07,849 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {4039#(<= ~counter~0 1)} {4039#(<= ~counter~0 1)} #79#return; {4039#(<= ~counter~0 1)} is VALID [2022-04-08 11:21:07,849 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-08 11:21:07,850 INFO L290 TraceCheckUtils]: 20: Hoare triple {4039#(<= ~counter~0 1)} ~cond := #in~cond; {4039#(<= ~counter~0 1)} is VALID [2022-04-08 11:21:07,850 INFO L290 TraceCheckUtils]: 21: Hoare triple {4039#(<= ~counter~0 1)} assume !(0 == ~cond); {4039#(<= ~counter~0 1)} is VALID [2022-04-08 11:21:07,850 INFO L290 TraceCheckUtils]: 22: Hoare triple {4039#(<= ~counter~0 1)} assume true; {4039#(<= ~counter~0 1)} is VALID [2022-04-08 11:21:07,851 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {4039#(<= ~counter~0 1)} {4039#(<= ~counter~0 1)} #81#return; {4039#(<= ~counter~0 1)} is VALID [2022-04-08 11:21:07,851 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-08 11:21:07,852 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-08 11:21:07,852 INFO L290 TraceCheckUtils]: 26: Hoare triple {4079#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {4079#(<= ~counter~0 2)} is VALID [2022-04-08 11:21:07,852 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-08 11:21:07,853 INFO L290 TraceCheckUtils]: 28: Hoare triple {4079#(<= ~counter~0 2)} ~cond := #in~cond; {4079#(<= ~counter~0 2)} is VALID [2022-04-08 11:21:07,853 INFO L290 TraceCheckUtils]: 29: Hoare triple {4079#(<= ~counter~0 2)} assume !(0 == ~cond); {4079#(<= ~counter~0 2)} is VALID [2022-04-08 11:21:07,853 INFO L290 TraceCheckUtils]: 30: Hoare triple {4079#(<= ~counter~0 2)} assume true; {4079#(<= ~counter~0 2)} is VALID [2022-04-08 11:21:07,854 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {4079#(<= ~counter~0 2)} {4079#(<= ~counter~0 2)} #83#return; {4079#(<= ~counter~0 2)} is VALID [2022-04-08 11:21:07,854 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-08 11:21:07,854 INFO L290 TraceCheckUtils]: 33: Hoare triple {4079#(<= ~counter~0 2)} ~cond := #in~cond; {4079#(<= ~counter~0 2)} is VALID [2022-04-08 11:21:07,855 INFO L290 TraceCheckUtils]: 34: Hoare triple {4079#(<= ~counter~0 2)} assume !(0 == ~cond); {4079#(<= ~counter~0 2)} is VALID [2022-04-08 11:21:07,855 INFO L290 TraceCheckUtils]: 35: Hoare triple {4079#(<= ~counter~0 2)} assume true; {4079#(<= ~counter~0 2)} is VALID [2022-04-08 11:21:07,855 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {4079#(<= ~counter~0 2)} {4079#(<= ~counter~0 2)} #85#return; {4079#(<= ~counter~0 2)} is VALID [2022-04-08 11:21:07,856 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-08 11:21:07,856 INFO L290 TraceCheckUtils]: 38: Hoare triple {4079#(<= ~counter~0 2)} ~cond := #in~cond; {4079#(<= ~counter~0 2)} is VALID [2022-04-08 11:21:07,856 INFO L290 TraceCheckUtils]: 39: Hoare triple {4079#(<= ~counter~0 2)} assume !(0 == ~cond); {4079#(<= ~counter~0 2)} is VALID [2022-04-08 11:21:07,857 INFO L290 TraceCheckUtils]: 40: Hoare triple {4079#(<= ~counter~0 2)} assume true; {4079#(<= ~counter~0 2)} is VALID [2022-04-08 11:21:07,857 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {4079#(<= ~counter~0 2)} {4079#(<= ~counter~0 2)} #87#return; {4079#(<= ~counter~0 2)} is VALID [2022-04-08 11:21:07,858 INFO L290 TraceCheckUtils]: 42: Hoare triple {4079#(<= ~counter~0 2)} assume !(~r~0 >= 2 * ~b~0); {4079#(<= ~counter~0 2)} is VALID [2022-04-08 11:21:07,858 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-08 11:21:07,858 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-08 11:21:07,859 INFO L290 TraceCheckUtils]: 45: Hoare triple {4137#(<= |main_#t~post6| 2)} assume !(#t~post6 < 100);havoc #t~post6; {3998#false} is VALID [2022-04-08 11:21:07,859 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-08 11:21:07,859 INFO L290 TraceCheckUtils]: 47: Hoare triple {3998#false} ~cond := #in~cond; {3998#false} is VALID [2022-04-08 11:21:07,859 INFO L290 TraceCheckUtils]: 48: Hoare triple {3998#false} assume 0 == ~cond; {3998#false} is VALID [2022-04-08 11:21:07,859 INFO L290 TraceCheckUtils]: 49: Hoare triple {3998#false} assume !false; {3998#false} is VALID [2022-04-08 11:21:07,859 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-08 11:21:07,860 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 11:21:08,069 INFO L290 TraceCheckUtils]: 49: Hoare triple {3998#false} assume !false; {3998#false} is VALID [2022-04-08 11:21:08,069 INFO L290 TraceCheckUtils]: 48: Hoare triple {3998#false} assume 0 == ~cond; {3998#false} is VALID [2022-04-08 11:21:08,069 INFO L290 TraceCheckUtils]: 47: Hoare triple {3998#false} ~cond := #in~cond; {3998#false} is VALID [2022-04-08 11:21:08,069 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-08 11:21:08,070 INFO L290 TraceCheckUtils]: 45: Hoare triple {4165#(< |main_#t~post6| 100)} assume !(#t~post6 < 100);havoc #t~post6; {3998#false} is VALID [2022-04-08 11:21:08,070 INFO L290 TraceCheckUtils]: 44: Hoare triple {4169#(< ~counter~0 100)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4165#(< |main_#t~post6| 100)} is VALID [2022-04-08 11:21:08,070 INFO L290 TraceCheckUtils]: 43: Hoare triple {4169#(< ~counter~0 100)} ~r~0 := ~r~0 - ~b~0;~q~0 := ~q~0 + ~a~0; {4169#(< ~counter~0 100)} is VALID [2022-04-08 11:21:08,071 INFO L290 TraceCheckUtils]: 42: Hoare triple {4169#(< ~counter~0 100)} assume !(~r~0 >= 2 * ~b~0); {4169#(< ~counter~0 100)} is VALID [2022-04-08 11:21:08,071 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {3997#true} {4169#(< ~counter~0 100)} #87#return; {4169#(< ~counter~0 100)} is VALID [2022-04-08 11:21:08,071 INFO L290 TraceCheckUtils]: 40: Hoare triple {3997#true} assume true; {3997#true} is VALID [2022-04-08 11:21:08,071 INFO L290 TraceCheckUtils]: 39: Hoare triple {3997#true} assume !(0 == ~cond); {3997#true} is VALID [2022-04-08 11:21:08,071 INFO L290 TraceCheckUtils]: 38: Hoare triple {3997#true} ~cond := #in~cond; {3997#true} is VALID [2022-04-08 11:21:08,071 INFO L272 TraceCheckUtils]: 37: Hoare triple {4169#(< ~counter~0 100)} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {3997#true} is VALID [2022-04-08 11:21:08,072 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {3997#true} {4169#(< ~counter~0 100)} #85#return; {4169#(< ~counter~0 100)} is VALID [2022-04-08 11:21:08,072 INFO L290 TraceCheckUtils]: 35: Hoare triple {3997#true} assume true; {3997#true} is VALID [2022-04-08 11:21:08,072 INFO L290 TraceCheckUtils]: 34: Hoare triple {3997#true} assume !(0 == ~cond); {3997#true} is VALID [2022-04-08 11:21:08,072 INFO L290 TraceCheckUtils]: 33: Hoare triple {3997#true} ~cond := #in~cond; {3997#true} is VALID [2022-04-08 11:21:08,072 INFO L272 TraceCheckUtils]: 32: Hoare triple {4169#(< ~counter~0 100)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {3997#true} is VALID [2022-04-08 11:21:08,079 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {3997#true} {4169#(< ~counter~0 100)} #83#return; {4169#(< ~counter~0 100)} is VALID [2022-04-08 11:21:08,079 INFO L290 TraceCheckUtils]: 30: Hoare triple {3997#true} assume true; {3997#true} is VALID [2022-04-08 11:21:08,079 INFO L290 TraceCheckUtils]: 29: Hoare triple {3997#true} assume !(0 == ~cond); {3997#true} is VALID [2022-04-08 11:21:08,079 INFO L290 TraceCheckUtils]: 28: Hoare triple {3997#true} ~cond := #in~cond; {3997#true} is VALID [2022-04-08 11:21:08,079 INFO L272 TraceCheckUtils]: 27: Hoare triple {4169#(< ~counter~0 100)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {3997#true} is VALID [2022-04-08 11:21:08,079 INFO L290 TraceCheckUtils]: 26: Hoare triple {4169#(< ~counter~0 100)} assume !!(#t~post7 < 100);havoc #t~post7; {4169#(< ~counter~0 100)} is VALID [2022-04-08 11:21:08,080 INFO L290 TraceCheckUtils]: 25: Hoare triple {4227#(< ~counter~0 99)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {4169#(< ~counter~0 100)} is VALID [2022-04-08 11:21:08,080 INFO L290 TraceCheckUtils]: 24: Hoare triple {4227#(< ~counter~0 99)} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {4227#(< ~counter~0 99)} is VALID [2022-04-08 11:21:08,081 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {3997#true} {4227#(< ~counter~0 99)} #81#return; {4227#(< ~counter~0 99)} is VALID [2022-04-08 11:21:08,081 INFO L290 TraceCheckUtils]: 22: Hoare triple {3997#true} assume true; {3997#true} is VALID [2022-04-08 11:21:08,081 INFO L290 TraceCheckUtils]: 21: Hoare triple {3997#true} assume !(0 == ~cond); {3997#true} is VALID [2022-04-08 11:21:08,081 INFO L290 TraceCheckUtils]: 20: Hoare triple {3997#true} ~cond := #in~cond; {3997#true} is VALID [2022-04-08 11:21:08,081 INFO L272 TraceCheckUtils]: 19: Hoare triple {4227#(< ~counter~0 99)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {3997#true} is VALID [2022-04-08 11:21:08,082 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {3997#true} {4227#(< ~counter~0 99)} #79#return; {4227#(< ~counter~0 99)} is VALID [2022-04-08 11:21:08,082 INFO L290 TraceCheckUtils]: 17: Hoare triple {3997#true} assume true; {3997#true} is VALID [2022-04-08 11:21:08,082 INFO L290 TraceCheckUtils]: 16: Hoare triple {3997#true} assume !(0 == ~cond); {3997#true} is VALID [2022-04-08 11:21:08,082 INFO L290 TraceCheckUtils]: 15: Hoare triple {3997#true} ~cond := #in~cond; {3997#true} is VALID [2022-04-08 11:21:08,083 INFO L272 TraceCheckUtils]: 14: Hoare triple {4227#(< ~counter~0 99)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {3997#true} is VALID [2022-04-08 11:21:08,083 INFO L290 TraceCheckUtils]: 13: Hoare triple {4227#(< ~counter~0 99)} assume !!(#t~post6 < 100);havoc #t~post6; {4227#(< ~counter~0 99)} is VALID [2022-04-08 11:21:08,084 INFO L290 TraceCheckUtils]: 12: Hoare triple {4267#(< ~counter~0 98)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4227#(< ~counter~0 99)} is VALID [2022-04-08 11:21:08,085 INFO L290 TraceCheckUtils]: 11: Hoare triple {4267#(< ~counter~0 98)} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {4267#(< ~counter~0 98)} is VALID [2022-04-08 11:21:08,090 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3997#true} {4267#(< ~counter~0 98)} #77#return; {4267#(< ~counter~0 98)} is VALID [2022-04-08 11:21:08,090 INFO L290 TraceCheckUtils]: 9: Hoare triple {3997#true} assume true; {3997#true} is VALID [2022-04-08 11:21:08,090 INFO L290 TraceCheckUtils]: 8: Hoare triple {3997#true} assume !(0 == ~cond); {3997#true} is VALID [2022-04-08 11:21:08,090 INFO L290 TraceCheckUtils]: 7: Hoare triple {3997#true} ~cond := #in~cond; {3997#true} is VALID [2022-04-08 11:21:08,091 INFO L272 TraceCheckUtils]: 6: Hoare triple {4267#(< ~counter~0 98)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {3997#true} is VALID [2022-04-08 11:21:08,092 INFO L290 TraceCheckUtils]: 5: Hoare triple {4267#(< ~counter~0 98)} 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 98)} is VALID [2022-04-08 11:21:08,093 INFO L272 TraceCheckUtils]: 4: Hoare triple {4267#(< ~counter~0 98)} call #t~ret8 := main(); {4267#(< ~counter~0 98)} is VALID [2022-04-08 11:21:08,094 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4267#(< ~counter~0 98)} {3997#true} #93#return; {4267#(< ~counter~0 98)} is VALID [2022-04-08 11:21:08,094 INFO L290 TraceCheckUtils]: 2: Hoare triple {4267#(< ~counter~0 98)} assume true; {4267#(< ~counter~0 98)} is VALID [2022-04-08 11:21:08,095 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 98)} is VALID [2022-04-08 11:21:08,095 INFO L272 TraceCheckUtils]: 0: Hoare triple {3997#true} call ULTIMATE.init(); {3997#true} is VALID [2022-04-08 11:21:08,095 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-08 11:21:08,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:21:08,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296798905] [2022-04-08 11:21:08,096 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:21:08,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1067796184] [2022-04-08 11:21:08,096 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1067796184] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 11:21:08,096 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 11:21:08,096 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-04-08 11:21:08,096 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:21:08,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [64504811] [2022-04-08 11:21:08,096 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [64504811] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:21:08,096 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:21:08,096 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 11:21:08,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518593514] [2022-04-08 11:21:08,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:21:08,097 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-08 11:21:08,097 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:21:08,097 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-08 11:21:08,135 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-08 11:21:08,136 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 11:21:08,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:21:08,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 11:21:08,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-08 11:21:08,136 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-08 11:21:08,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:21:08,410 INFO L93 Difference]: Finished difference Result 115 states and 134 transitions. [2022-04-08 11:21:08,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 11:21:08,411 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-08 11:21:08,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:21:08,412 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-08 11:21:08,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 79 transitions. [2022-04-08 11:21:08,418 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-08 11:21:08,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 79 transitions. [2022-04-08 11:21:08,420 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 79 transitions. [2022-04-08 11:21:08,468 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-08 11:21:08,469 INFO L225 Difference]: With dead ends: 115 [2022-04-08 11:21:08,469 INFO L226 Difference]: Without dead ends: 108 [2022-04-08 11:21:08,469 INFO L912 BasicCegarLoop]: 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-08 11:21:08,470 INFO L913 BasicCegarLoop]: 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-08 11:21:08,470 INFO L914 BasicCegarLoop]: 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-08 11:21:08,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2022-04-08 11:21:08,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 106. [2022-04-08 11:21:08,593 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:21:08,594 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-08 11:21:08,596 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-08 11:21:08,596 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-08 11:21:08,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:21:08,598 INFO L93 Difference]: Finished difference Result 108 states and 127 transitions. [2022-04-08 11:21:08,598 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 127 transitions. [2022-04-08 11:21:08,598 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:21:08,598 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:21:08,599 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-08 11:21:08,599 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-08 11:21:08,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:21:08,601 INFO L93 Difference]: Finished difference Result 108 states and 127 transitions. [2022-04-08 11:21:08,601 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 127 transitions. [2022-04-08 11:21:08,601 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:21:08,601 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:21:08,601 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:21:08,601 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:21:08,601 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-08 11:21:08,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 125 transitions. [2022-04-08 11:21:08,603 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 125 transitions. Word has length 50 [2022-04-08 11:21:08,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:21:08,603 INFO L478 AbstractCegarLoop]: Abstraction has 106 states and 125 transitions. [2022-04-08 11:21:08,603 INFO L479 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-08 11:21:08,604 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 106 states and 125 transitions. [2022-04-08 11:21:08,754 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-08 11:21:08,754 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 125 transitions. [2022-04-08 11:21:08,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-04-08 11:21:08,755 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:21:08,755 INFO L499 BasicCegarLoop]: 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-08 11:21:08,776 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-08 11:21:08,955 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-04-08 11:21:08,956 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:21:08,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:21:08,956 INFO L85 PathProgramCache]: Analyzing trace with hash -484699953, now seen corresponding path program 1 times [2022-04-08 11:21:08,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:21:08,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1726111097] [2022-04-08 11:21:21,072 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 11:21:21,072 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 11:21:21,072 INFO L85 PathProgramCache]: Analyzing trace with hash -484699953, now seen corresponding path program 2 times [2022-04-08 11:21:21,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:21:21,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921614227] [2022-04-08 11:21:21,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:21:21,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:21:21,096 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:21:21,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2013299562] [2022-04-08 11:21:21,096 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 11:21:21,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:21:21,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:21:21,097 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-08 11:21:21,098 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-08 11:21:21,137 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 11:21:21,137 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:21:21,138 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-08 11:21:21,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:21:21,150 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:21:21,360 INFO L272 TraceCheckUtils]: 0: Hoare triple {4966#true} call ULTIMATE.init(); {4966#true} is VALID [2022-04-08 11:21:21,360 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-08 11:21:21,360 INFO L290 TraceCheckUtils]: 2: Hoare triple {4966#true} assume true; {4966#true} is VALID [2022-04-08 11:21:21,360 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4966#true} {4966#true} #93#return; {4966#true} is VALID [2022-04-08 11:21:21,360 INFO L272 TraceCheckUtils]: 4: Hoare triple {4966#true} call #t~ret8 := main(); {4966#true} is VALID [2022-04-08 11:21:21,360 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-08 11:21:21,360 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-08 11:21:21,360 INFO L290 TraceCheckUtils]: 7: Hoare triple {4966#true} ~cond := #in~cond; {4966#true} is VALID [2022-04-08 11:21:21,361 INFO L290 TraceCheckUtils]: 8: Hoare triple {4966#true} assume !(0 == ~cond); {4966#true} is VALID [2022-04-08 11:21:21,361 INFO L290 TraceCheckUtils]: 9: Hoare triple {4966#true} assume true; {4966#true} is VALID [2022-04-08 11:21:21,361 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4966#true} {4966#true} #77#return; {4966#true} is VALID [2022-04-08 11:21:21,361 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-08 11:21:21,361 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-08 11:21:21,362 INFO L290 TraceCheckUtils]: 13: Hoare triple {5004#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} assume !!(#t~post6 < 100);havoc #t~post6; {5004#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 11:21:21,362 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-08 11:21:21,362 INFO L290 TraceCheckUtils]: 15: Hoare triple {4966#true} ~cond := #in~cond; {4966#true} is VALID [2022-04-08 11:21:21,362 INFO L290 TraceCheckUtils]: 16: Hoare triple {4966#true} assume !(0 == ~cond); {4966#true} is VALID [2022-04-08 11:21:21,362 INFO L290 TraceCheckUtils]: 17: Hoare triple {4966#true} assume true; {4966#true} is VALID [2022-04-08 11:21:21,362 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-08 11:21:21,363 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-08 11:21:21,363 INFO L290 TraceCheckUtils]: 20: Hoare triple {4966#true} ~cond := #in~cond; {4966#true} is VALID [2022-04-08 11:21:21,363 INFO L290 TraceCheckUtils]: 21: Hoare triple {4966#true} assume !(0 == ~cond); {4966#true} is VALID [2022-04-08 11:21:21,363 INFO L290 TraceCheckUtils]: 22: Hoare triple {4966#true} assume true; {4966#true} is VALID [2022-04-08 11:21:21,363 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-08 11:21:21,364 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-08 11:21:21,364 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-08 11:21:21,364 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 < 100);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-08 11:21:21,364 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-08 11:21:21,364 INFO L290 TraceCheckUtils]: 28: Hoare triple {4966#true} ~cond := #in~cond; {4966#true} is VALID [2022-04-08 11:21:21,364 INFO L290 TraceCheckUtils]: 29: Hoare triple {4966#true} assume !(0 == ~cond); {4966#true} is VALID [2022-04-08 11:21:21,365 INFO L290 TraceCheckUtils]: 30: Hoare triple {4966#true} assume true; {4966#true} is VALID [2022-04-08 11:21:21,365 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-08 11:21:21,365 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-08 11:21:21,365 INFO L290 TraceCheckUtils]: 33: Hoare triple {4966#true} ~cond := #in~cond; {4966#true} is VALID [2022-04-08 11:21:21,365 INFO L290 TraceCheckUtils]: 34: Hoare triple {4966#true} assume !(0 == ~cond); {4966#true} is VALID [2022-04-08 11:21:21,365 INFO L290 TraceCheckUtils]: 35: Hoare triple {4966#true} assume true; {4966#true} is VALID [2022-04-08 11:21:21,366 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-08 11:21:21,366 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-08 11:21:21,366 INFO L290 TraceCheckUtils]: 38: Hoare triple {4966#true} ~cond := #in~cond; {4966#true} is VALID [2022-04-08 11:21:21,366 INFO L290 TraceCheckUtils]: 39: Hoare triple {4966#true} assume !(0 == ~cond); {4966#true} is VALID [2022-04-08 11:21:21,366 INFO L290 TraceCheckUtils]: 40: Hoare triple {4966#true} assume true; {4966#true} is VALID [2022-04-08 11:21:21,366 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-08 11:21:21,367 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-08 11:21:21,367 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-08 11:21:21,367 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-08 11:21:21,368 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 < 100);havoc #t~post6; {5102#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~r~0) (= main_~q~0 1))} is VALID [2022-04-08 11:21:21,368 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-08 11:21:21,368 INFO L290 TraceCheckUtils]: 47: Hoare triple {4966#true} ~cond := #in~cond; {4966#true} is VALID [2022-04-08 11:21:21,368 INFO L290 TraceCheckUtils]: 48: Hoare triple {4966#true} assume !(0 == ~cond); {4966#true} is VALID [2022-04-08 11:21:21,368 INFO L290 TraceCheckUtils]: 49: Hoare triple {4966#true} assume true; {4966#true} is VALID [2022-04-08 11:21:21,370 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-08 11:21:21,370 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-08 11:21:21,371 INFO L290 TraceCheckUtils]: 52: Hoare triple {5127#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5131#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:21:21,371 INFO L290 TraceCheckUtils]: 53: Hoare triple {5131#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4967#false} is VALID [2022-04-08 11:21:21,371 INFO L290 TraceCheckUtils]: 54: Hoare triple {4967#false} assume !false; {4967#false} is VALID [2022-04-08 11:21:21,373 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-08 11:21:21,373 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 11:21:42,739 INFO L290 TraceCheckUtils]: 54: Hoare triple {4967#false} assume !false; {4967#false} is VALID [2022-04-08 11:21:42,740 INFO L290 TraceCheckUtils]: 53: Hoare triple {5131#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4967#false} is VALID [2022-04-08 11:21:42,740 INFO L290 TraceCheckUtils]: 52: Hoare triple {5127#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5131#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:21:42,741 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-08 11:21:42,742 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-08 11:21:42,742 INFO L290 TraceCheckUtils]: 49: Hoare triple {4966#true} assume true; {4966#true} is VALID [2022-04-08 11:21:42,742 INFO L290 TraceCheckUtils]: 48: Hoare triple {4966#true} assume !(0 == ~cond); {4966#true} is VALID [2022-04-08 11:21:42,742 INFO L290 TraceCheckUtils]: 47: Hoare triple {4966#true} ~cond := #in~cond; {4966#true} is VALID [2022-04-08 11:21:42,742 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-08 11:21:42,743 INFO L290 TraceCheckUtils]: 45: Hoare triple {5147#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} assume !!(#t~post6 < 100);havoc #t~post6; {5147#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-08 11:21:42,743 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-08 11:21:42,761 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-08 11:21:42,762 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-08 11:21:42,763 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-08 11:21:42,763 INFO L290 TraceCheckUtils]: 40: Hoare triple {4966#true} assume true; {4966#true} is VALID [2022-04-08 11:21:42,763 INFO L290 TraceCheckUtils]: 39: Hoare triple {4966#true} assume !(0 == ~cond); {4966#true} is VALID [2022-04-08 11:21:42,763 INFO L290 TraceCheckUtils]: 38: Hoare triple {4966#true} ~cond := #in~cond; {4966#true} is VALID [2022-04-08 11:21:42,763 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-08 11:21:42,764 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-08 11:21:42,764 INFO L290 TraceCheckUtils]: 35: Hoare triple {4966#true} assume true; {4966#true} is VALID [2022-04-08 11:21:42,764 INFO L290 TraceCheckUtils]: 34: Hoare triple {4966#true} assume !(0 == ~cond); {4966#true} is VALID [2022-04-08 11:21:42,764 INFO L290 TraceCheckUtils]: 33: Hoare triple {4966#true} ~cond := #in~cond; {4966#true} is VALID [2022-04-08 11:21:42,764 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-08 11:21:42,764 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-08 11:21:42,765 INFO L290 TraceCheckUtils]: 30: Hoare triple {4966#true} assume true; {4966#true} is VALID [2022-04-08 11:21:42,765 INFO L290 TraceCheckUtils]: 29: Hoare triple {4966#true} assume !(0 == ~cond); {4966#true} is VALID [2022-04-08 11:21:42,765 INFO L290 TraceCheckUtils]: 28: Hoare triple {4966#true} ~cond := #in~cond; {4966#true} is VALID [2022-04-08 11:21:42,765 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-08 11:21:42,765 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 < 100);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-08 11:21:42,766 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-08 11:21:42,766 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-08 11:21:42,767 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-08 11:21:42,767 INFO L290 TraceCheckUtils]: 22: Hoare triple {4966#true} assume true; {4966#true} is VALID [2022-04-08 11:21:42,767 INFO L290 TraceCheckUtils]: 21: Hoare triple {4966#true} assume !(0 == ~cond); {4966#true} is VALID [2022-04-08 11:21:42,767 INFO L290 TraceCheckUtils]: 20: Hoare triple {4966#true} ~cond := #in~cond; {4966#true} is VALID [2022-04-08 11:21:42,767 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-08 11:21:42,767 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-08 11:21:42,768 INFO L290 TraceCheckUtils]: 17: Hoare triple {4966#true} assume true; {4966#true} is VALID [2022-04-08 11:21:42,768 INFO L290 TraceCheckUtils]: 16: Hoare triple {4966#true} assume !(0 == ~cond); {4966#true} is VALID [2022-04-08 11:21:42,768 INFO L290 TraceCheckUtils]: 15: Hoare triple {4966#true} ~cond := #in~cond; {4966#true} is VALID [2022-04-08 11:21:42,768 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-08 11:21:42,768 INFO L290 TraceCheckUtils]: 13: Hoare triple {5004#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} assume !!(#t~post6 < 100);havoc #t~post6; {5004#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 11:21:42,768 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-08 11:21:42,769 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-08 11:21:42,769 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4966#true} {4966#true} #77#return; {4966#true} is VALID [2022-04-08 11:21:42,769 INFO L290 TraceCheckUtils]: 9: Hoare triple {4966#true} assume true; {4966#true} is VALID [2022-04-08 11:21:42,769 INFO L290 TraceCheckUtils]: 8: Hoare triple {4966#true} assume !(0 == ~cond); {4966#true} is VALID [2022-04-08 11:21:42,769 INFO L290 TraceCheckUtils]: 7: Hoare triple {4966#true} ~cond := #in~cond; {4966#true} is VALID [2022-04-08 11:21:42,769 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-08 11:21:42,769 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-08 11:21:42,769 INFO L272 TraceCheckUtils]: 4: Hoare triple {4966#true} call #t~ret8 := main(); {4966#true} is VALID [2022-04-08 11:21:42,769 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4966#true} {4966#true} #93#return; {4966#true} is VALID [2022-04-08 11:21:42,770 INFO L290 TraceCheckUtils]: 2: Hoare triple {4966#true} assume true; {4966#true} is VALID [2022-04-08 11:21:42,770 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-08 11:21:42,770 INFO L272 TraceCheckUtils]: 0: Hoare triple {4966#true} call ULTIMATE.init(); {4966#true} is VALID [2022-04-08 11:21:42,770 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-08 11:21:42,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:21:42,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921614227] [2022-04-08 11:21:42,770 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:21:42,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2013299562] [2022-04-08 11:21:42,770 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2013299562] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 11:21:42,771 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 11:21:42,771 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2022-04-08 11:21:42,771 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:21:42,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1726111097] [2022-04-08 11:21:42,771 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1726111097] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:21:42,771 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:21:42,771 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 11:21:42,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812247297] [2022-04-08 11:21:42,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:21:42,772 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-08 11:21:42,772 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:21:42,772 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-08 11:21:42,806 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-08 11:21:42,806 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 11:21:42,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:21:42,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 11:21:42,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-04-08 11:21:42,807 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-08 11:21:43,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:21:43,405 INFO L93 Difference]: Finished difference Result 134 states and 166 transitions. [2022-04-08 11:21:43,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 11:21:43,405 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-08 11:21:43,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:21:43,405 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-08 11:21:43,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 107 transitions. [2022-04-08 11:21:43,407 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-08 11:21:43,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 107 transitions. [2022-04-08 11:21:43,409 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 107 transitions. [2022-04-08 11:21:43,490 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-08 11:21:43,492 INFO L225 Difference]: With dead ends: 134 [2022-04-08 11:21:43,492 INFO L226 Difference]: Without dead ends: 131 [2022-04-08 11:21:43,492 INFO L912 BasicCegarLoop]: 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-08 11:21:43,492 INFO L913 BasicCegarLoop]: 60 mSDtfsCounter, 24 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2022-04-08 11:21:43,493 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 237 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 11:21:43,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2022-04-08 11:21:43,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 127. [2022-04-08 11:21:43,613 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:21:43,613 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-08 11:21:43,614 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-08 11:21:43,614 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-08 11:21:43,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:21:43,617 INFO L93 Difference]: Finished difference Result 131 states and 162 transitions. [2022-04-08 11:21:43,617 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 162 transitions. [2022-04-08 11:21:43,618 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:21:43,618 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:21:43,618 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-08 11:21:43,619 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-08 11:21:43,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:21:43,622 INFO L93 Difference]: Finished difference Result 131 states and 162 transitions. [2022-04-08 11:21:43,622 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 162 transitions. [2022-04-08 11:21:43,623 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:21:43,623 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:21:43,623 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:21:43,623 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:21:43,624 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-08 11:21:43,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 158 transitions. [2022-04-08 11:21:43,627 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 158 transitions. Word has length 55 [2022-04-08 11:21:43,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:21:43,628 INFO L478 AbstractCegarLoop]: Abstraction has 127 states and 158 transitions. [2022-04-08 11:21:43,628 INFO L479 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-08 11:21:43,628 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 127 states and 158 transitions. [2022-04-08 11:21:43,802 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-08 11:21:43,803 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 158 transitions. [2022-04-08 11:21:43,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-04-08 11:21:43,803 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:21:43,803 INFO L499 BasicCegarLoop]: 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-08 11:21:43,823 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-04-08 11:21:44,004 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-04-08 11:21:44,004 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:21:44,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:21:44,004 INFO L85 PathProgramCache]: Analyzing trace with hash 765609565, now seen corresponding path program 1 times [2022-04-08 11:21:44,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:21:44,005 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1379685557] [2022-04-08 11:21:56,446 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 11:21:56,447 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 11:21:56,447 INFO L85 PathProgramCache]: Analyzing trace with hash 765609565, now seen corresponding path program 2 times [2022-04-08 11:21:56,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:21:56,447 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936221162] [2022-04-08 11:21:56,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:21:56,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:21:56,456 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:21:56,457 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1090402134] [2022-04-08 11:21:56,457 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 11:21:56,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:21:56,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:21:56,458 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-08 11:21:56,459 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-08 11:21:56,498 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 11:21:56,498 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:21:56,499 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-08 11:21:56,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:21:56,511 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:21:56,736 INFO L272 TraceCheckUtils]: 0: Hoare triple {6090#true} call ULTIMATE.init(); {6090#true} is VALID [2022-04-08 11:21:56,736 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-08 11:21:56,737 INFO L290 TraceCheckUtils]: 2: Hoare triple {6098#(<= ~counter~0 0)} assume true; {6098#(<= ~counter~0 0)} is VALID [2022-04-08 11:21:56,737 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6098#(<= ~counter~0 0)} {6090#true} #93#return; {6098#(<= ~counter~0 0)} is VALID [2022-04-08 11:21:56,737 INFO L272 TraceCheckUtils]: 4: Hoare triple {6098#(<= ~counter~0 0)} call #t~ret8 := main(); {6098#(<= ~counter~0 0)} is VALID [2022-04-08 11:21:56,737 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-08 11:21:56,738 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-08 11:21:56,738 INFO L290 TraceCheckUtils]: 7: Hoare triple {6098#(<= ~counter~0 0)} ~cond := #in~cond; {6098#(<= ~counter~0 0)} is VALID [2022-04-08 11:21:56,738 INFO L290 TraceCheckUtils]: 8: Hoare triple {6098#(<= ~counter~0 0)} assume !(0 == ~cond); {6098#(<= ~counter~0 0)} is VALID [2022-04-08 11:21:56,739 INFO L290 TraceCheckUtils]: 9: Hoare triple {6098#(<= ~counter~0 0)} assume true; {6098#(<= ~counter~0 0)} is VALID [2022-04-08 11:21:56,739 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6098#(<= ~counter~0 0)} {6098#(<= ~counter~0 0)} #77#return; {6098#(<= ~counter~0 0)} is VALID [2022-04-08 11:21:56,739 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-08 11:21:56,740 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-08 11:21:56,740 INFO L290 TraceCheckUtils]: 13: Hoare triple {6132#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {6132#(<= ~counter~0 1)} is VALID [2022-04-08 11:21:56,741 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-08 11:21:56,741 INFO L290 TraceCheckUtils]: 15: Hoare triple {6132#(<= ~counter~0 1)} ~cond := #in~cond; {6132#(<= ~counter~0 1)} is VALID [2022-04-08 11:21:56,742 INFO L290 TraceCheckUtils]: 16: Hoare triple {6132#(<= ~counter~0 1)} assume !(0 == ~cond); {6132#(<= ~counter~0 1)} is VALID [2022-04-08 11:21:56,742 INFO L290 TraceCheckUtils]: 17: Hoare triple {6132#(<= ~counter~0 1)} assume true; {6132#(<= ~counter~0 1)} is VALID [2022-04-08 11:21:56,743 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {6132#(<= ~counter~0 1)} {6132#(<= ~counter~0 1)} #79#return; {6132#(<= ~counter~0 1)} is VALID [2022-04-08 11:21:56,743 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-08 11:21:56,743 INFO L290 TraceCheckUtils]: 20: Hoare triple {6132#(<= ~counter~0 1)} ~cond := #in~cond; {6132#(<= ~counter~0 1)} is VALID [2022-04-08 11:21:56,744 INFO L290 TraceCheckUtils]: 21: Hoare triple {6132#(<= ~counter~0 1)} assume !(0 == ~cond); {6132#(<= ~counter~0 1)} is VALID [2022-04-08 11:21:56,744 INFO L290 TraceCheckUtils]: 22: Hoare triple {6132#(<= ~counter~0 1)} assume true; {6132#(<= ~counter~0 1)} is VALID [2022-04-08 11:21:56,745 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {6132#(<= ~counter~0 1)} {6132#(<= ~counter~0 1)} #81#return; {6132#(<= ~counter~0 1)} is VALID [2022-04-08 11:21:56,745 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-08 11:21:56,746 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-08 11:21:56,746 INFO L290 TraceCheckUtils]: 26: Hoare triple {6172#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {6172#(<= ~counter~0 2)} is VALID [2022-04-08 11:21:56,746 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-08 11:21:56,747 INFO L290 TraceCheckUtils]: 28: Hoare triple {6172#(<= ~counter~0 2)} ~cond := #in~cond; {6172#(<= ~counter~0 2)} is VALID [2022-04-08 11:21:56,747 INFO L290 TraceCheckUtils]: 29: Hoare triple {6172#(<= ~counter~0 2)} assume !(0 == ~cond); {6172#(<= ~counter~0 2)} is VALID [2022-04-08 11:21:56,747 INFO L290 TraceCheckUtils]: 30: Hoare triple {6172#(<= ~counter~0 2)} assume true; {6172#(<= ~counter~0 2)} is VALID [2022-04-08 11:21:56,748 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {6172#(<= ~counter~0 2)} {6172#(<= ~counter~0 2)} #83#return; {6172#(<= ~counter~0 2)} is VALID [2022-04-08 11:21:56,749 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-08 11:21:56,749 INFO L290 TraceCheckUtils]: 33: Hoare triple {6172#(<= ~counter~0 2)} ~cond := #in~cond; {6172#(<= ~counter~0 2)} is VALID [2022-04-08 11:21:56,749 INFO L290 TraceCheckUtils]: 34: Hoare triple {6172#(<= ~counter~0 2)} assume !(0 == ~cond); {6172#(<= ~counter~0 2)} is VALID [2022-04-08 11:21:56,749 INFO L290 TraceCheckUtils]: 35: Hoare triple {6172#(<= ~counter~0 2)} assume true; {6172#(<= ~counter~0 2)} is VALID [2022-04-08 11:21:56,750 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {6172#(<= ~counter~0 2)} {6172#(<= ~counter~0 2)} #85#return; {6172#(<= ~counter~0 2)} is VALID [2022-04-08 11:21:56,751 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-08 11:21:56,751 INFO L290 TraceCheckUtils]: 38: Hoare triple {6172#(<= ~counter~0 2)} ~cond := #in~cond; {6172#(<= ~counter~0 2)} is VALID [2022-04-08 11:21:56,751 INFO L290 TraceCheckUtils]: 39: Hoare triple {6172#(<= ~counter~0 2)} assume !(0 == ~cond); {6172#(<= ~counter~0 2)} is VALID [2022-04-08 11:21:56,751 INFO L290 TraceCheckUtils]: 40: Hoare triple {6172#(<= ~counter~0 2)} assume true; {6172#(<= ~counter~0 2)} is VALID [2022-04-08 11:21:56,752 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {6172#(<= ~counter~0 2)} {6172#(<= ~counter~0 2)} #87#return; {6172#(<= ~counter~0 2)} is VALID [2022-04-08 11:21:56,752 INFO L290 TraceCheckUtils]: 42: Hoare triple {6172#(<= ~counter~0 2)} assume !!(~r~0 >= 2 * ~b~0); {6172#(<= ~counter~0 2)} is VALID [2022-04-08 11:21:56,753 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-08 11:21:56,753 INFO L290 TraceCheckUtils]: 44: Hoare triple {6172#(<= ~counter~0 2)} ~cond := #in~cond; {6172#(<= ~counter~0 2)} is VALID [2022-04-08 11:21:56,753 INFO L290 TraceCheckUtils]: 45: Hoare triple {6172#(<= ~counter~0 2)} assume !(0 == ~cond); {6172#(<= ~counter~0 2)} is VALID [2022-04-08 11:21:56,754 INFO L290 TraceCheckUtils]: 46: Hoare triple {6172#(<= ~counter~0 2)} assume true; {6172#(<= ~counter~0 2)} is VALID [2022-04-08 11:21:56,754 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {6172#(<= ~counter~0 2)} {6172#(<= ~counter~0 2)} #89#return; {6172#(<= ~counter~0 2)} is VALID [2022-04-08 11:21:56,755 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-08 11:21:56,755 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-08 11:21:56,755 INFO L290 TraceCheckUtils]: 50: Hoare triple {6245#(<= |main_#t~post7| 2)} assume !(#t~post7 < 100);havoc #t~post7; {6091#false} is VALID [2022-04-08 11:21:56,756 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-08 11:21:56,756 INFO L290 TraceCheckUtils]: 52: Hoare triple {6091#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6091#false} is VALID [2022-04-08 11:21:56,756 INFO L290 TraceCheckUtils]: 53: Hoare triple {6091#false} assume !(#t~post6 < 100);havoc #t~post6; {6091#false} is VALID [2022-04-08 11:21:56,756 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-08 11:21:56,756 INFO L290 TraceCheckUtils]: 55: Hoare triple {6091#false} ~cond := #in~cond; {6091#false} is VALID [2022-04-08 11:21:56,756 INFO L290 TraceCheckUtils]: 56: Hoare triple {6091#false} assume 0 == ~cond; {6091#false} is VALID [2022-04-08 11:21:56,756 INFO L290 TraceCheckUtils]: 57: Hoare triple {6091#false} assume !false; {6091#false} is VALID [2022-04-08 11:21:56,756 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-08 11:21:56,756 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 11:21:56,987 INFO L290 TraceCheckUtils]: 57: Hoare triple {6091#false} assume !false; {6091#false} is VALID [2022-04-08 11:21:56,987 INFO L290 TraceCheckUtils]: 56: Hoare triple {6091#false} assume 0 == ~cond; {6091#false} is VALID [2022-04-08 11:21:56,987 INFO L290 TraceCheckUtils]: 55: Hoare triple {6091#false} ~cond := #in~cond; {6091#false} is VALID [2022-04-08 11:21:56,987 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-08 11:21:56,988 INFO L290 TraceCheckUtils]: 53: Hoare triple {6091#false} assume !(#t~post6 < 100);havoc #t~post6; {6091#false} is VALID [2022-04-08 11:21:56,988 INFO L290 TraceCheckUtils]: 52: Hoare triple {6091#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6091#false} is VALID [2022-04-08 11:21:56,988 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-08 11:21:56,988 INFO L290 TraceCheckUtils]: 50: Hoare triple {6291#(< |main_#t~post7| 100)} assume !(#t~post7 < 100);havoc #t~post7; {6091#false} is VALID [2022-04-08 11:21:56,988 INFO L290 TraceCheckUtils]: 49: Hoare triple {6295#(< ~counter~0 100)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {6291#(< |main_#t~post7| 100)} is VALID [2022-04-08 11:21:56,989 INFO L290 TraceCheckUtils]: 48: Hoare triple {6295#(< ~counter~0 100)} ~a~0 := 2 * ~a~0;~b~0 := 2 * ~b~0; {6295#(< ~counter~0 100)} is VALID [2022-04-08 11:21:56,989 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {6090#true} {6295#(< ~counter~0 100)} #89#return; {6295#(< ~counter~0 100)} is VALID [2022-04-08 11:21:56,989 INFO L290 TraceCheckUtils]: 46: Hoare triple {6090#true} assume true; {6090#true} is VALID [2022-04-08 11:21:56,989 INFO L290 TraceCheckUtils]: 45: Hoare triple {6090#true} assume !(0 == ~cond); {6090#true} is VALID [2022-04-08 11:21:56,989 INFO L290 TraceCheckUtils]: 44: Hoare triple {6090#true} ~cond := #in~cond; {6090#true} is VALID [2022-04-08 11:21:56,989 INFO L272 TraceCheckUtils]: 43: Hoare triple {6295#(< ~counter~0 100)} call __VERIFIER_assert((if ~r~0 >= 2 * ~y~0 * ~a~0 then 1 else 0)); {6090#true} is VALID [2022-04-08 11:21:56,990 INFO L290 TraceCheckUtils]: 42: Hoare triple {6295#(< ~counter~0 100)} assume !!(~r~0 >= 2 * ~b~0); {6295#(< ~counter~0 100)} is VALID [2022-04-08 11:21:56,990 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {6090#true} {6295#(< ~counter~0 100)} #87#return; {6295#(< ~counter~0 100)} is VALID [2022-04-08 11:21:56,990 INFO L290 TraceCheckUtils]: 40: Hoare triple {6090#true} assume true; {6090#true} is VALID [2022-04-08 11:21:56,990 INFO L290 TraceCheckUtils]: 39: Hoare triple {6090#true} assume !(0 == ~cond); {6090#true} is VALID [2022-04-08 11:21:56,990 INFO L290 TraceCheckUtils]: 38: Hoare triple {6090#true} ~cond := #in~cond; {6090#true} is VALID [2022-04-08 11:21:56,990 INFO L272 TraceCheckUtils]: 37: Hoare triple {6295#(< ~counter~0 100)} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {6090#true} is VALID [2022-04-08 11:21:56,991 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {6090#true} {6295#(< ~counter~0 100)} #85#return; {6295#(< ~counter~0 100)} is VALID [2022-04-08 11:21:56,991 INFO L290 TraceCheckUtils]: 35: Hoare triple {6090#true} assume true; {6090#true} is VALID [2022-04-08 11:21:56,991 INFO L290 TraceCheckUtils]: 34: Hoare triple {6090#true} assume !(0 == ~cond); {6090#true} is VALID [2022-04-08 11:21:56,991 INFO L290 TraceCheckUtils]: 33: Hoare triple {6090#true} ~cond := #in~cond; {6090#true} is VALID [2022-04-08 11:21:56,991 INFO L272 TraceCheckUtils]: 32: Hoare triple {6295#(< ~counter~0 100)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {6090#true} is VALID [2022-04-08 11:21:56,991 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {6090#true} {6295#(< ~counter~0 100)} #83#return; {6295#(< ~counter~0 100)} is VALID [2022-04-08 11:21:56,992 INFO L290 TraceCheckUtils]: 30: Hoare triple {6090#true} assume true; {6090#true} is VALID [2022-04-08 11:21:56,992 INFO L290 TraceCheckUtils]: 29: Hoare triple {6090#true} assume !(0 == ~cond); {6090#true} is VALID [2022-04-08 11:21:56,992 INFO L290 TraceCheckUtils]: 28: Hoare triple {6090#true} ~cond := #in~cond; {6090#true} is VALID [2022-04-08 11:21:56,992 INFO L272 TraceCheckUtils]: 27: Hoare triple {6295#(< ~counter~0 100)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {6090#true} is VALID [2022-04-08 11:21:56,992 INFO L290 TraceCheckUtils]: 26: Hoare triple {6295#(< ~counter~0 100)} assume !!(#t~post7 < 100);havoc #t~post7; {6295#(< ~counter~0 100)} is VALID [2022-04-08 11:21:56,993 INFO L290 TraceCheckUtils]: 25: Hoare triple {6368#(< ~counter~0 99)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {6295#(< ~counter~0 100)} is VALID [2022-04-08 11:21:56,993 INFO L290 TraceCheckUtils]: 24: Hoare triple {6368#(< ~counter~0 99)} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {6368#(< ~counter~0 99)} is VALID [2022-04-08 11:21:56,993 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {6090#true} {6368#(< ~counter~0 99)} #81#return; {6368#(< ~counter~0 99)} is VALID [2022-04-08 11:21:56,993 INFO L290 TraceCheckUtils]: 22: Hoare triple {6090#true} assume true; {6090#true} is VALID [2022-04-08 11:21:56,993 INFO L290 TraceCheckUtils]: 21: Hoare triple {6090#true} assume !(0 == ~cond); {6090#true} is VALID [2022-04-08 11:21:56,994 INFO L290 TraceCheckUtils]: 20: Hoare triple {6090#true} ~cond := #in~cond; {6090#true} is VALID [2022-04-08 11:21:56,994 INFO L272 TraceCheckUtils]: 19: Hoare triple {6368#(< ~counter~0 99)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {6090#true} is VALID [2022-04-08 11:21:56,994 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {6090#true} {6368#(< ~counter~0 99)} #79#return; {6368#(< ~counter~0 99)} is VALID [2022-04-08 11:21:56,994 INFO L290 TraceCheckUtils]: 17: Hoare triple {6090#true} assume true; {6090#true} is VALID [2022-04-08 11:21:56,994 INFO L290 TraceCheckUtils]: 16: Hoare triple {6090#true} assume !(0 == ~cond); {6090#true} is VALID [2022-04-08 11:21:56,994 INFO L290 TraceCheckUtils]: 15: Hoare triple {6090#true} ~cond := #in~cond; {6090#true} is VALID [2022-04-08 11:21:56,994 INFO L272 TraceCheckUtils]: 14: Hoare triple {6368#(< ~counter~0 99)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {6090#true} is VALID [2022-04-08 11:21:56,995 INFO L290 TraceCheckUtils]: 13: Hoare triple {6368#(< ~counter~0 99)} assume !!(#t~post6 < 100);havoc #t~post6; {6368#(< ~counter~0 99)} is VALID [2022-04-08 11:21:56,995 INFO L290 TraceCheckUtils]: 12: Hoare triple {6408#(< ~counter~0 98)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6368#(< ~counter~0 99)} is VALID [2022-04-08 11:21:56,995 INFO L290 TraceCheckUtils]: 11: Hoare triple {6408#(< ~counter~0 98)} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {6408#(< ~counter~0 98)} is VALID [2022-04-08 11:21:56,996 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6090#true} {6408#(< ~counter~0 98)} #77#return; {6408#(< ~counter~0 98)} is VALID [2022-04-08 11:21:56,996 INFO L290 TraceCheckUtils]: 9: Hoare triple {6090#true} assume true; {6090#true} is VALID [2022-04-08 11:21:56,996 INFO L290 TraceCheckUtils]: 8: Hoare triple {6090#true} assume !(0 == ~cond); {6090#true} is VALID [2022-04-08 11:21:56,996 INFO L290 TraceCheckUtils]: 7: Hoare triple {6090#true} ~cond := #in~cond; {6090#true} is VALID [2022-04-08 11:21:56,996 INFO L272 TraceCheckUtils]: 6: Hoare triple {6408#(< ~counter~0 98)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {6090#true} is VALID [2022-04-08 11:21:56,996 INFO L290 TraceCheckUtils]: 5: Hoare triple {6408#(< ~counter~0 98)} 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 98)} is VALID [2022-04-08 11:21:56,996 INFO L272 TraceCheckUtils]: 4: Hoare triple {6408#(< ~counter~0 98)} call #t~ret8 := main(); {6408#(< ~counter~0 98)} is VALID [2022-04-08 11:21:56,997 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6408#(< ~counter~0 98)} {6090#true} #93#return; {6408#(< ~counter~0 98)} is VALID [2022-04-08 11:21:56,997 INFO L290 TraceCheckUtils]: 2: Hoare triple {6408#(< ~counter~0 98)} assume true; {6408#(< ~counter~0 98)} is VALID [2022-04-08 11:21:56,997 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 98)} is VALID [2022-04-08 11:21:56,998 INFO L272 TraceCheckUtils]: 0: Hoare triple {6090#true} call ULTIMATE.init(); {6090#true} is VALID [2022-04-08 11:21:56,998 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-08 11:21:56,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:21:56,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936221162] [2022-04-08 11:21:56,998 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:21:56,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1090402134] [2022-04-08 11:21:56,998 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1090402134] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 11:21:56,998 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 11:21:56,998 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-04-08 11:21:56,998 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:21:56,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1379685557] [2022-04-08 11:21:56,999 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1379685557] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:21:56,999 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:21:56,999 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 11:21:56,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220115628] [2022-04-08 11:21:56,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:21:56,999 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-08 11:21:56,999 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:21:56,999 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-08 11:21:57,030 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-08 11:21:57,030 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 11:21:57,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:21:57,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 11:21:57,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-08 11:21:57,031 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-08 11:21:57,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:21:57,290 INFO L93 Difference]: Finished difference Result 173 states and 218 transitions. [2022-04-08 11:21:57,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 11:21:57,291 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-08 11:21:57,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:21:57,291 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-08 11:21:57,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 103 transitions. [2022-04-08 11:21:57,292 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-08 11:21:57,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 103 transitions. [2022-04-08 11:21:57,293 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 103 transitions. [2022-04-08 11:21:57,383 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-08 11:21:57,386 INFO L225 Difference]: With dead ends: 173 [2022-04-08 11:21:57,386 INFO L226 Difference]: Without dead ends: 130 [2022-04-08 11:21:57,386 INFO L912 BasicCegarLoop]: 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-08 11:21:57,387 INFO L913 BasicCegarLoop]: 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-08 11:21:57,387 INFO L914 BasicCegarLoop]: 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-08 11:21:57,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-04-08 11:21:57,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2022-04-08 11:21:57,504 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:21:57,504 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-08 11:21:57,505 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-08 11:21:57,505 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-08 11:21:57,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:21:57,509 INFO L93 Difference]: Finished difference Result 130 states and 161 transitions. [2022-04-08 11:21:57,509 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 161 transitions. [2022-04-08 11:21:57,509 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:21:57,510 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:21:57,510 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-08 11:21:57,510 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-08 11:21:57,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:21:57,514 INFO L93 Difference]: Finished difference Result 130 states and 161 transitions. [2022-04-08 11:21:57,514 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 161 transitions. [2022-04-08 11:21:57,514 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:21:57,515 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:21:57,515 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:21:57,515 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:21:57,515 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-08 11:21:57,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 161 transitions. [2022-04-08 11:21:57,520 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 161 transitions. Word has length 58 [2022-04-08 11:21:57,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:21:57,520 INFO L478 AbstractCegarLoop]: Abstraction has 130 states and 161 transitions. [2022-04-08 11:21:57,520 INFO L479 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-08 11:21:57,520 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 130 states and 161 transitions. [2022-04-08 11:21:57,670 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-08 11:21:57,670 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 161 transitions. [2022-04-08 11:21:57,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-04-08 11:21:57,671 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:21:57,671 INFO L499 BasicCegarLoop]: 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-08 11:21:57,687 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-08 11:21:57,875 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-04-08 11:21:57,877 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:21:57,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:21:57,878 INFO L85 PathProgramCache]: Analyzing trace with hash 78053411, now seen corresponding path program 1 times [2022-04-08 11:21:57,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:21:57,878 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [801548722] [2022-04-08 11:22:13,010 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 11:22:13,010 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 11:22:13,010 INFO L85 PathProgramCache]: Analyzing trace with hash 78053411, now seen corresponding path program 2 times [2022-04-08 11:22:13,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:22:13,011 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630337460] [2022-04-08 11:22:13,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:22:13,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:22:13,021 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:22:13,021 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [95302274] [2022-04-08 11:22:13,021 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 11:22:13,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:22:13,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:22:13,031 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-08 11:22:13,032 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-08 11:22:13,077 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 11:22:13,077 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:22:13,078 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-08 11:22:13,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:22:13,089 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:22:13,250 INFO L272 TraceCheckUtils]: 0: Hoare triple {7315#true} call ULTIMATE.init(); {7315#true} is VALID [2022-04-08 11:22:13,251 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-08 11:22:13,251 INFO L290 TraceCheckUtils]: 2: Hoare triple {7315#true} assume true; {7315#true} is VALID [2022-04-08 11:22:13,251 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7315#true} {7315#true} #93#return; {7315#true} is VALID [2022-04-08 11:22:13,251 INFO L272 TraceCheckUtils]: 4: Hoare triple {7315#true} call #t~ret8 := main(); {7315#true} is VALID [2022-04-08 11:22:13,251 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-08 11:22:13,251 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-08 11:22:13,251 INFO L290 TraceCheckUtils]: 7: Hoare triple {7315#true} ~cond := #in~cond; {7315#true} is VALID [2022-04-08 11:22:13,251 INFO L290 TraceCheckUtils]: 8: Hoare triple {7315#true} assume !(0 == ~cond); {7315#true} is VALID [2022-04-08 11:22:13,251 INFO L290 TraceCheckUtils]: 9: Hoare triple {7315#true} assume true; {7315#true} is VALID [2022-04-08 11:22:13,251 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7315#true} {7315#true} #77#return; {7315#true} is VALID [2022-04-08 11:22:13,251 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-08 11:22:13,252 INFO L290 TraceCheckUtils]: 12: Hoare triple {7315#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7315#true} is VALID [2022-04-08 11:22:13,252 INFO L290 TraceCheckUtils]: 13: Hoare triple {7315#true} assume !!(#t~post6 < 100);havoc #t~post6; {7315#true} is VALID [2022-04-08 11:22:13,252 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-08 11:22:13,252 INFO L290 TraceCheckUtils]: 15: Hoare triple {7315#true} ~cond := #in~cond; {7315#true} is VALID [2022-04-08 11:22:13,252 INFO L290 TraceCheckUtils]: 16: Hoare triple {7315#true} assume !(0 == ~cond); {7315#true} is VALID [2022-04-08 11:22:13,252 INFO L290 TraceCheckUtils]: 17: Hoare triple {7315#true} assume true; {7315#true} is VALID [2022-04-08 11:22:13,252 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {7315#true} {7315#true} #79#return; {7315#true} is VALID [2022-04-08 11:22:13,252 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-08 11:22:13,252 INFO L290 TraceCheckUtils]: 20: Hoare triple {7315#true} ~cond := #in~cond; {7315#true} is VALID [2022-04-08 11:22:13,252 INFO L290 TraceCheckUtils]: 21: Hoare triple {7315#true} assume !(0 == ~cond); {7315#true} is VALID [2022-04-08 11:22:13,252 INFO L290 TraceCheckUtils]: 22: Hoare triple {7315#true} assume true; {7315#true} is VALID [2022-04-08 11:22:13,253 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {7315#true} {7315#true} #81#return; {7315#true} is VALID [2022-04-08 11:22:13,253 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-08 11:22:13,253 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-08 11:22:13,254 INFO L290 TraceCheckUtils]: 26: Hoare triple {7392#(<= main_~b~0 main_~y~0)} assume !!(#t~post7 < 100);havoc #t~post7; {7392#(<= main_~b~0 main_~y~0)} is VALID [2022-04-08 11:22:13,254 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-08 11:22:13,254 INFO L290 TraceCheckUtils]: 28: Hoare triple {7315#true} ~cond := #in~cond; {7315#true} is VALID [2022-04-08 11:22:13,254 INFO L290 TraceCheckUtils]: 29: Hoare triple {7315#true} assume !(0 == ~cond); {7315#true} is VALID [2022-04-08 11:22:13,254 INFO L290 TraceCheckUtils]: 30: Hoare triple {7315#true} assume true; {7315#true} is VALID [2022-04-08 11:22:13,254 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-08 11:22:13,255 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-08 11:22:13,255 INFO L290 TraceCheckUtils]: 33: Hoare triple {7315#true} ~cond := #in~cond; {7315#true} is VALID [2022-04-08 11:22:13,255 INFO L290 TraceCheckUtils]: 34: Hoare triple {7315#true} assume !(0 == ~cond); {7315#true} is VALID [2022-04-08 11:22:13,255 INFO L290 TraceCheckUtils]: 35: Hoare triple {7315#true} assume true; {7315#true} is VALID [2022-04-08 11:22:13,255 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-08 11:22:13,256 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-08 11:22:13,256 INFO L290 TraceCheckUtils]: 38: Hoare triple {7315#true} ~cond := #in~cond; {7315#true} is VALID [2022-04-08 11:22:13,256 INFO L290 TraceCheckUtils]: 39: Hoare triple {7315#true} assume !(0 == ~cond); {7315#true} is VALID [2022-04-08 11:22:13,256 INFO L290 TraceCheckUtils]: 40: Hoare triple {7315#true} assume true; {7315#true} is VALID [2022-04-08 11:22:13,256 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-08 11:22:13,257 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-08 11:22:13,257 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-08 11:22:13,257 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-08 11:22:13,258 INFO L290 TraceCheckUtils]: 45: Hoare triple {7451#(< main_~r~0 main_~y~0)} assume !!(#t~post6 < 100);havoc #t~post6; {7451#(< main_~r~0 main_~y~0)} is VALID [2022-04-08 11:22:13,258 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-08 11:22:13,258 INFO L290 TraceCheckUtils]: 47: Hoare triple {7315#true} ~cond := #in~cond; {7315#true} is VALID [2022-04-08 11:22:13,258 INFO L290 TraceCheckUtils]: 48: Hoare triple {7315#true} assume !(0 == ~cond); {7315#true} is VALID [2022-04-08 11:22:13,258 INFO L290 TraceCheckUtils]: 49: Hoare triple {7315#true} assume true; {7315#true} is VALID [2022-04-08 11:22:13,258 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-08 11:22:13,259 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-08 11:22:13,259 INFO L290 TraceCheckUtils]: 52: Hoare triple {7315#true} ~cond := #in~cond; {7315#true} is VALID [2022-04-08 11:22:13,259 INFO L290 TraceCheckUtils]: 53: Hoare triple {7315#true} assume !(0 == ~cond); {7315#true} is VALID [2022-04-08 11:22:13,259 INFO L290 TraceCheckUtils]: 54: Hoare triple {7315#true} assume true; {7315#true} is VALID [2022-04-08 11:22:13,259 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-08 11:22:13,259 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-08 11:22:13,260 INFO L290 TraceCheckUtils]: 57: Hoare triple {7316#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {7316#false} is VALID [2022-04-08 11:22:13,260 INFO L290 TraceCheckUtils]: 58: Hoare triple {7316#false} assume !(#t~post7 < 100);havoc #t~post7; {7316#false} is VALID [2022-04-08 11:22:13,260 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-08 11:22:13,260 INFO L290 TraceCheckUtils]: 60: Hoare triple {7316#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7316#false} is VALID [2022-04-08 11:22:13,260 INFO L290 TraceCheckUtils]: 61: Hoare triple {7316#false} assume !(#t~post6 < 100);havoc #t~post6; {7316#false} is VALID [2022-04-08 11:22:13,260 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-08 11:22:13,260 INFO L290 TraceCheckUtils]: 63: Hoare triple {7316#false} ~cond := #in~cond; {7316#false} is VALID [2022-04-08 11:22:13,260 INFO L290 TraceCheckUtils]: 64: Hoare triple {7316#false} assume 0 == ~cond; {7316#false} is VALID [2022-04-08 11:22:13,260 INFO L290 TraceCheckUtils]: 65: Hoare triple {7316#false} assume !false; {7316#false} is VALID [2022-04-08 11:22:13,260 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-08 11:22:13,260 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 11:22:13,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:22:13,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630337460] [2022-04-08 11:22:13,261 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:22:13,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [95302274] [2022-04-08 11:22:13,261 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [95302274] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:22:13,261 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:22:13,261 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 11:22:13,261 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:22:13,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [801548722] [2022-04-08 11:22:13,261 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [801548722] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:22:13,261 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:22:13,261 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 11:22:13,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547588164] [2022-04-08 11:22:13,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:22:13,262 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-08 11:22:13,262 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:22:13,262 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-08 11:22:13,308 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-08 11:22:13,308 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 11:22:13,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:22:13,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 11:22:13,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-08 11:22:13,309 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-08 11:22:13,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:22:13,608 INFO L93 Difference]: Finished difference Result 190 states and 240 transitions. [2022-04-08 11:22:13,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 11:22:13,608 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-08 11:22:13,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:22:13,609 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-08 11:22:13,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 109 transitions. [2022-04-08 11:22:13,610 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-08 11:22:13,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 109 transitions. [2022-04-08 11:22:13,612 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 109 transitions. [2022-04-08 11:22:13,701 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-08 11:22:13,703 INFO L225 Difference]: With dead ends: 190 [2022-04-08 11:22:13,703 INFO L226 Difference]: Without dead ends: 119 [2022-04-08 11:22:13,703 INFO L912 BasicCegarLoop]: 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-08 11:22:13,704 INFO L913 BasicCegarLoop]: 56 mSDtfsCounter, 11 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2022-04-08 11:22:13,704 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 120 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 11:22:13,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-04-08 11:22:13,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 112. [2022-04-08 11:22:13,827 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:22:13,827 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-08 11:22:13,828 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-08 11:22:13,828 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-08 11:22:13,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:22:13,830 INFO L93 Difference]: Finished difference Result 119 states and 143 transitions. [2022-04-08 11:22:13,830 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 143 transitions. [2022-04-08 11:22:13,830 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:22:13,830 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:22:13,830 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-08 11:22:13,831 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-08 11:22:13,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:22:13,836 INFO L93 Difference]: Finished difference Result 119 states and 143 transitions. [2022-04-08 11:22:13,836 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 143 transitions. [2022-04-08 11:22:13,837 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:22:13,837 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:22:13,837 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:22:13,837 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:22:13,837 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-08 11:22:13,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 133 transitions. [2022-04-08 11:22:13,839 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 133 transitions. Word has length 66 [2022-04-08 11:22:13,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:22:13,839 INFO L478 AbstractCegarLoop]: Abstraction has 112 states and 133 transitions. [2022-04-08 11:22:13,840 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 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-08 11:22:13,840 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 112 states and 133 transitions. [2022-04-08 11:22:13,981 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-08 11:22:13,981 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 133 transitions. [2022-04-08 11:22:13,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-04-08 11:22:13,982 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:22:13,982 INFO L499 BasicCegarLoop]: 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-08 11:22:13,998 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-08 11:22:14,187 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-04-08 11:22:14,188 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:22:14,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:22:14,188 INFO L85 PathProgramCache]: Analyzing trace with hash -1361251212, now seen corresponding path program 1 times [2022-04-08 11:22:14,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:22:14,189 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1788421294] [2022-04-08 11:22:30,629 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 11:22:30,629 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 11:22:30,629 INFO L85 PathProgramCache]: Analyzing trace with hash -1361251212, now seen corresponding path program 2 times [2022-04-08 11:22:30,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:22:30,629 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590173783] [2022-04-08 11:22:30,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:22:30,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:22:30,654 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:22:30,654 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [637125462] [2022-04-08 11:22:30,655 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 11:22:30,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:22:30,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:22:30,662 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-08 11:22:30,663 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-08 11:22:30,717 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 11:22:30,717 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:22:30,719 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-08 11:22:30,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:22:30,735 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:22:31,042 INFO L272 TraceCheckUtils]: 0: Hoare triple {8362#true} call ULTIMATE.init(); {8362#true} is VALID [2022-04-08 11:22:31,043 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-08 11:22:31,044 INFO L290 TraceCheckUtils]: 2: Hoare triple {8370#(<= ~counter~0 0)} assume true; {8370#(<= ~counter~0 0)} is VALID [2022-04-08 11:22:31,044 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8370#(<= ~counter~0 0)} {8362#true} #93#return; {8370#(<= ~counter~0 0)} is VALID [2022-04-08 11:22:31,044 INFO L272 TraceCheckUtils]: 4: Hoare triple {8370#(<= ~counter~0 0)} call #t~ret8 := main(); {8370#(<= ~counter~0 0)} is VALID [2022-04-08 11:22:31,045 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-08 11:22:31,045 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-08 11:22:31,045 INFO L290 TraceCheckUtils]: 7: Hoare triple {8370#(<= ~counter~0 0)} ~cond := #in~cond; {8370#(<= ~counter~0 0)} is VALID [2022-04-08 11:22:31,046 INFO L290 TraceCheckUtils]: 8: Hoare triple {8370#(<= ~counter~0 0)} assume !(0 == ~cond); {8370#(<= ~counter~0 0)} is VALID [2022-04-08 11:22:31,046 INFO L290 TraceCheckUtils]: 9: Hoare triple {8370#(<= ~counter~0 0)} assume true; {8370#(<= ~counter~0 0)} is VALID [2022-04-08 11:22:31,047 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8370#(<= ~counter~0 0)} {8370#(<= ~counter~0 0)} #77#return; {8370#(<= ~counter~0 0)} is VALID [2022-04-08 11:22:31,048 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-08 11:22:31,048 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-08 11:22:31,049 INFO L290 TraceCheckUtils]: 13: Hoare triple {8404#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {8404#(<= ~counter~0 1)} is VALID [2022-04-08 11:22:31,049 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-08 11:22:31,050 INFO L290 TraceCheckUtils]: 15: Hoare triple {8404#(<= ~counter~0 1)} ~cond := #in~cond; {8404#(<= ~counter~0 1)} is VALID [2022-04-08 11:22:31,051 INFO L290 TraceCheckUtils]: 16: Hoare triple {8404#(<= ~counter~0 1)} assume !(0 == ~cond); {8404#(<= ~counter~0 1)} is VALID [2022-04-08 11:22:31,051 INFO L290 TraceCheckUtils]: 17: Hoare triple {8404#(<= ~counter~0 1)} assume true; {8404#(<= ~counter~0 1)} is VALID [2022-04-08 11:22:31,052 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {8404#(<= ~counter~0 1)} {8404#(<= ~counter~0 1)} #79#return; {8404#(<= ~counter~0 1)} is VALID [2022-04-08 11:22:31,052 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-08 11:22:31,053 INFO L290 TraceCheckUtils]: 20: Hoare triple {8404#(<= ~counter~0 1)} ~cond := #in~cond; {8404#(<= ~counter~0 1)} is VALID [2022-04-08 11:22:31,053 INFO L290 TraceCheckUtils]: 21: Hoare triple {8404#(<= ~counter~0 1)} assume !(0 == ~cond); {8404#(<= ~counter~0 1)} is VALID [2022-04-08 11:22:31,053 INFO L290 TraceCheckUtils]: 22: Hoare triple {8404#(<= ~counter~0 1)} assume true; {8404#(<= ~counter~0 1)} is VALID [2022-04-08 11:22:31,054 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {8404#(<= ~counter~0 1)} {8404#(<= ~counter~0 1)} #81#return; {8404#(<= ~counter~0 1)} is VALID [2022-04-08 11:22:31,054 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-08 11:22:31,055 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-08 11:22:31,055 INFO L290 TraceCheckUtils]: 26: Hoare triple {8444#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {8444#(<= ~counter~0 2)} is VALID [2022-04-08 11:22:31,056 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-08 11:22:31,056 INFO L290 TraceCheckUtils]: 28: Hoare triple {8444#(<= ~counter~0 2)} ~cond := #in~cond; {8444#(<= ~counter~0 2)} is VALID [2022-04-08 11:22:31,057 INFO L290 TraceCheckUtils]: 29: Hoare triple {8444#(<= ~counter~0 2)} assume !(0 == ~cond); {8444#(<= ~counter~0 2)} is VALID [2022-04-08 11:22:31,057 INFO L290 TraceCheckUtils]: 30: Hoare triple {8444#(<= ~counter~0 2)} assume true; {8444#(<= ~counter~0 2)} is VALID [2022-04-08 11:22:31,058 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {8444#(<= ~counter~0 2)} {8444#(<= ~counter~0 2)} #83#return; {8444#(<= ~counter~0 2)} is VALID [2022-04-08 11:22:31,058 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-08 11:22:31,059 INFO L290 TraceCheckUtils]: 33: Hoare triple {8444#(<= ~counter~0 2)} ~cond := #in~cond; {8444#(<= ~counter~0 2)} is VALID [2022-04-08 11:22:31,059 INFO L290 TraceCheckUtils]: 34: Hoare triple {8444#(<= ~counter~0 2)} assume !(0 == ~cond); {8444#(<= ~counter~0 2)} is VALID [2022-04-08 11:22:31,059 INFO L290 TraceCheckUtils]: 35: Hoare triple {8444#(<= ~counter~0 2)} assume true; {8444#(<= ~counter~0 2)} is VALID [2022-04-08 11:22:31,060 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {8444#(<= ~counter~0 2)} {8444#(<= ~counter~0 2)} #85#return; {8444#(<= ~counter~0 2)} is VALID [2022-04-08 11:22:31,060 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-08 11:22:31,061 INFO L290 TraceCheckUtils]: 38: Hoare triple {8444#(<= ~counter~0 2)} ~cond := #in~cond; {8444#(<= ~counter~0 2)} is VALID [2022-04-08 11:22:31,061 INFO L290 TraceCheckUtils]: 39: Hoare triple {8444#(<= ~counter~0 2)} assume !(0 == ~cond); {8444#(<= ~counter~0 2)} is VALID [2022-04-08 11:22:31,061 INFO L290 TraceCheckUtils]: 40: Hoare triple {8444#(<= ~counter~0 2)} assume true; {8444#(<= ~counter~0 2)} is VALID [2022-04-08 11:22:31,062 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {8444#(<= ~counter~0 2)} {8444#(<= ~counter~0 2)} #87#return; {8444#(<= ~counter~0 2)} is VALID [2022-04-08 11:22:31,062 INFO L290 TraceCheckUtils]: 42: Hoare triple {8444#(<= ~counter~0 2)} assume !!(~r~0 >= 2 * ~b~0); {8444#(<= ~counter~0 2)} is VALID [2022-04-08 11:22:31,063 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-08 11:22:31,063 INFO L290 TraceCheckUtils]: 44: Hoare triple {8444#(<= ~counter~0 2)} ~cond := #in~cond; {8444#(<= ~counter~0 2)} is VALID [2022-04-08 11:22:31,063 INFO L290 TraceCheckUtils]: 45: Hoare triple {8444#(<= ~counter~0 2)} assume !(0 == ~cond); {8444#(<= ~counter~0 2)} is VALID [2022-04-08 11:22:31,064 INFO L290 TraceCheckUtils]: 46: Hoare triple {8444#(<= ~counter~0 2)} assume true; {8444#(<= ~counter~0 2)} is VALID [2022-04-08 11:22:31,064 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {8444#(<= ~counter~0 2)} {8444#(<= ~counter~0 2)} #89#return; {8444#(<= ~counter~0 2)} is VALID [2022-04-08 11:22:31,065 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-08 11:22:31,065 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-08 11:22:31,066 INFO L290 TraceCheckUtils]: 50: Hoare triple {8517#(<= ~counter~0 3)} assume !!(#t~post7 < 100);havoc #t~post7; {8517#(<= ~counter~0 3)} is VALID [2022-04-08 11:22:31,066 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-08 11:22:31,066 INFO L290 TraceCheckUtils]: 52: Hoare triple {8517#(<= ~counter~0 3)} ~cond := #in~cond; {8517#(<= ~counter~0 3)} is VALID [2022-04-08 11:22:31,067 INFO L290 TraceCheckUtils]: 53: Hoare triple {8517#(<= ~counter~0 3)} assume !(0 == ~cond); {8517#(<= ~counter~0 3)} is VALID [2022-04-08 11:22:31,067 INFO L290 TraceCheckUtils]: 54: Hoare triple {8517#(<= ~counter~0 3)} assume true; {8517#(<= ~counter~0 3)} is VALID [2022-04-08 11:22:31,068 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {8517#(<= ~counter~0 3)} {8517#(<= ~counter~0 3)} #83#return; {8517#(<= ~counter~0 3)} is VALID [2022-04-08 11:22:31,068 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-08 11:22:31,069 INFO L290 TraceCheckUtils]: 57: Hoare triple {8517#(<= ~counter~0 3)} ~cond := #in~cond; {8517#(<= ~counter~0 3)} is VALID [2022-04-08 11:22:31,069 INFO L290 TraceCheckUtils]: 58: Hoare triple {8517#(<= ~counter~0 3)} assume !(0 == ~cond); {8517#(<= ~counter~0 3)} is VALID [2022-04-08 11:22:31,069 INFO L290 TraceCheckUtils]: 59: Hoare triple {8517#(<= ~counter~0 3)} assume true; {8517#(<= ~counter~0 3)} is VALID [2022-04-08 11:22:31,070 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {8517#(<= ~counter~0 3)} {8517#(<= ~counter~0 3)} #85#return; {8517#(<= ~counter~0 3)} is VALID [2022-04-08 11:22:31,070 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-08 11:22:31,070 INFO L290 TraceCheckUtils]: 62: Hoare triple {8517#(<= ~counter~0 3)} ~cond := #in~cond; {8517#(<= ~counter~0 3)} is VALID [2022-04-08 11:22:31,071 INFO L290 TraceCheckUtils]: 63: Hoare triple {8517#(<= ~counter~0 3)} assume !(0 == ~cond); {8517#(<= ~counter~0 3)} is VALID [2022-04-08 11:22:31,071 INFO L290 TraceCheckUtils]: 64: Hoare triple {8517#(<= ~counter~0 3)} assume true; {8517#(<= ~counter~0 3)} is VALID [2022-04-08 11:22:31,071 INFO L284 TraceCheckUtils]: 65: Hoare quadruple {8517#(<= ~counter~0 3)} {8517#(<= ~counter~0 3)} #87#return; {8517#(<= ~counter~0 3)} is VALID [2022-04-08 11:22:31,072 INFO L290 TraceCheckUtils]: 66: Hoare triple {8517#(<= ~counter~0 3)} assume !(~r~0 >= 2 * ~b~0); {8517#(<= ~counter~0 3)} is VALID [2022-04-08 11:22:31,072 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-08 11:22:31,073 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-08 11:22:31,073 INFO L290 TraceCheckUtils]: 69: Hoare triple {8575#(<= |main_#t~post6| 3)} assume !(#t~post6 < 100);havoc #t~post6; {8363#false} is VALID [2022-04-08 11:22:31,073 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-08 11:22:31,073 INFO L290 TraceCheckUtils]: 71: Hoare triple {8363#false} ~cond := #in~cond; {8363#false} is VALID [2022-04-08 11:22:31,073 INFO L290 TraceCheckUtils]: 72: Hoare triple {8363#false} assume 0 == ~cond; {8363#false} is VALID [2022-04-08 11:22:31,073 INFO L290 TraceCheckUtils]: 73: Hoare triple {8363#false} assume !false; {8363#false} is VALID [2022-04-08 11:22:31,074 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-08 11:22:31,074 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 11:22:31,396 INFO L290 TraceCheckUtils]: 73: Hoare triple {8363#false} assume !false; {8363#false} is VALID [2022-04-08 11:22:31,397 INFO L290 TraceCheckUtils]: 72: Hoare triple {8363#false} assume 0 == ~cond; {8363#false} is VALID [2022-04-08 11:22:31,397 INFO L290 TraceCheckUtils]: 71: Hoare triple {8363#false} ~cond := #in~cond; {8363#false} is VALID [2022-04-08 11:22:31,397 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-08 11:22:31,397 INFO L290 TraceCheckUtils]: 69: Hoare triple {8603#(< |main_#t~post6| 100)} assume !(#t~post6 < 100);havoc #t~post6; {8363#false} is VALID [2022-04-08 11:22:31,398 INFO L290 TraceCheckUtils]: 68: Hoare triple {8607#(< ~counter~0 100)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8603#(< |main_#t~post6| 100)} is VALID [2022-04-08 11:22:31,398 INFO L290 TraceCheckUtils]: 67: Hoare triple {8607#(< ~counter~0 100)} ~r~0 := ~r~0 - ~b~0;~q~0 := ~q~0 + ~a~0; {8607#(< ~counter~0 100)} is VALID [2022-04-08 11:22:31,398 INFO L290 TraceCheckUtils]: 66: Hoare triple {8607#(< ~counter~0 100)} assume !(~r~0 >= 2 * ~b~0); {8607#(< ~counter~0 100)} is VALID [2022-04-08 11:22:31,399 INFO L284 TraceCheckUtils]: 65: Hoare quadruple {8362#true} {8607#(< ~counter~0 100)} #87#return; {8607#(< ~counter~0 100)} is VALID [2022-04-08 11:22:31,399 INFO L290 TraceCheckUtils]: 64: Hoare triple {8362#true} assume true; {8362#true} is VALID [2022-04-08 11:22:31,399 INFO L290 TraceCheckUtils]: 63: Hoare triple {8362#true} assume !(0 == ~cond); {8362#true} is VALID [2022-04-08 11:22:31,399 INFO L290 TraceCheckUtils]: 62: Hoare triple {8362#true} ~cond := #in~cond; {8362#true} is VALID [2022-04-08 11:22:31,399 INFO L272 TraceCheckUtils]: 61: Hoare triple {8607#(< ~counter~0 100)} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {8362#true} is VALID [2022-04-08 11:22:31,413 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {8362#true} {8607#(< ~counter~0 100)} #85#return; {8607#(< ~counter~0 100)} is VALID [2022-04-08 11:22:31,413 INFO L290 TraceCheckUtils]: 59: Hoare triple {8362#true} assume true; {8362#true} is VALID [2022-04-08 11:22:31,413 INFO L290 TraceCheckUtils]: 58: Hoare triple {8362#true} assume !(0 == ~cond); {8362#true} is VALID [2022-04-08 11:22:31,413 INFO L290 TraceCheckUtils]: 57: Hoare triple {8362#true} ~cond := #in~cond; {8362#true} is VALID [2022-04-08 11:22:31,413 INFO L272 TraceCheckUtils]: 56: Hoare triple {8607#(< ~counter~0 100)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {8362#true} is VALID [2022-04-08 11:22:31,414 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {8362#true} {8607#(< ~counter~0 100)} #83#return; {8607#(< ~counter~0 100)} is VALID [2022-04-08 11:22:31,414 INFO L290 TraceCheckUtils]: 54: Hoare triple {8362#true} assume true; {8362#true} is VALID [2022-04-08 11:22:31,414 INFO L290 TraceCheckUtils]: 53: Hoare triple {8362#true} assume !(0 == ~cond); {8362#true} is VALID [2022-04-08 11:22:31,414 INFO L290 TraceCheckUtils]: 52: Hoare triple {8362#true} ~cond := #in~cond; {8362#true} is VALID [2022-04-08 11:22:31,414 INFO L272 TraceCheckUtils]: 51: Hoare triple {8607#(< ~counter~0 100)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {8362#true} is VALID [2022-04-08 11:22:31,414 INFO L290 TraceCheckUtils]: 50: Hoare triple {8607#(< ~counter~0 100)} assume !!(#t~post7 < 100);havoc #t~post7; {8607#(< ~counter~0 100)} is VALID [2022-04-08 11:22:31,415 INFO L290 TraceCheckUtils]: 49: Hoare triple {8665#(< ~counter~0 99)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {8607#(< ~counter~0 100)} is VALID [2022-04-08 11:22:31,416 INFO L290 TraceCheckUtils]: 48: Hoare triple {8665#(< ~counter~0 99)} ~a~0 := 2 * ~a~0;~b~0 := 2 * ~b~0; {8665#(< ~counter~0 99)} is VALID [2022-04-08 11:22:31,416 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {8362#true} {8665#(< ~counter~0 99)} #89#return; {8665#(< ~counter~0 99)} is VALID [2022-04-08 11:22:31,416 INFO L290 TraceCheckUtils]: 46: Hoare triple {8362#true} assume true; {8362#true} is VALID [2022-04-08 11:22:31,416 INFO L290 TraceCheckUtils]: 45: Hoare triple {8362#true} assume !(0 == ~cond); {8362#true} is VALID [2022-04-08 11:22:31,417 INFO L290 TraceCheckUtils]: 44: Hoare triple {8362#true} ~cond := #in~cond; {8362#true} is VALID [2022-04-08 11:22:31,417 INFO L272 TraceCheckUtils]: 43: Hoare triple {8665#(< ~counter~0 99)} call __VERIFIER_assert((if ~r~0 >= 2 * ~y~0 * ~a~0 then 1 else 0)); {8362#true} is VALID [2022-04-08 11:22:31,417 INFO L290 TraceCheckUtils]: 42: Hoare triple {8665#(< ~counter~0 99)} assume !!(~r~0 >= 2 * ~b~0); {8665#(< ~counter~0 99)} is VALID [2022-04-08 11:22:31,418 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {8362#true} {8665#(< ~counter~0 99)} #87#return; {8665#(< ~counter~0 99)} is VALID [2022-04-08 11:22:31,418 INFO L290 TraceCheckUtils]: 40: Hoare triple {8362#true} assume true; {8362#true} is VALID [2022-04-08 11:22:31,418 INFO L290 TraceCheckUtils]: 39: Hoare triple {8362#true} assume !(0 == ~cond); {8362#true} is VALID [2022-04-08 11:22:31,418 INFO L290 TraceCheckUtils]: 38: Hoare triple {8362#true} ~cond := #in~cond; {8362#true} is VALID [2022-04-08 11:22:31,418 INFO L272 TraceCheckUtils]: 37: Hoare triple {8665#(< ~counter~0 99)} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {8362#true} is VALID [2022-04-08 11:22:31,419 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {8362#true} {8665#(< ~counter~0 99)} #85#return; {8665#(< ~counter~0 99)} is VALID [2022-04-08 11:22:31,419 INFO L290 TraceCheckUtils]: 35: Hoare triple {8362#true} assume true; {8362#true} is VALID [2022-04-08 11:22:31,419 INFO L290 TraceCheckUtils]: 34: Hoare triple {8362#true} assume !(0 == ~cond); {8362#true} is VALID [2022-04-08 11:22:31,419 INFO L290 TraceCheckUtils]: 33: Hoare triple {8362#true} ~cond := #in~cond; {8362#true} is VALID [2022-04-08 11:22:31,419 INFO L272 TraceCheckUtils]: 32: Hoare triple {8665#(< ~counter~0 99)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {8362#true} is VALID [2022-04-08 11:22:31,420 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {8362#true} {8665#(< ~counter~0 99)} #83#return; {8665#(< ~counter~0 99)} is VALID [2022-04-08 11:22:31,420 INFO L290 TraceCheckUtils]: 30: Hoare triple {8362#true} assume true; {8362#true} is VALID [2022-04-08 11:22:31,420 INFO L290 TraceCheckUtils]: 29: Hoare triple {8362#true} assume !(0 == ~cond); {8362#true} is VALID [2022-04-08 11:22:31,420 INFO L290 TraceCheckUtils]: 28: Hoare triple {8362#true} ~cond := #in~cond; {8362#true} is VALID [2022-04-08 11:22:31,420 INFO L272 TraceCheckUtils]: 27: Hoare triple {8665#(< ~counter~0 99)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {8362#true} is VALID [2022-04-08 11:22:31,424 INFO L290 TraceCheckUtils]: 26: Hoare triple {8665#(< ~counter~0 99)} assume !!(#t~post7 < 100);havoc #t~post7; {8665#(< ~counter~0 99)} is VALID [2022-04-08 11:22:31,424 INFO L290 TraceCheckUtils]: 25: Hoare triple {8738#(< ~counter~0 98)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {8665#(< ~counter~0 99)} is VALID [2022-04-08 11:22:31,425 INFO L290 TraceCheckUtils]: 24: Hoare triple {8738#(< ~counter~0 98)} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {8738#(< ~counter~0 98)} is VALID [2022-04-08 11:22:31,425 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {8362#true} {8738#(< ~counter~0 98)} #81#return; {8738#(< ~counter~0 98)} is VALID [2022-04-08 11:22:31,425 INFO L290 TraceCheckUtils]: 22: Hoare triple {8362#true} assume true; {8362#true} is VALID [2022-04-08 11:22:31,426 INFO L290 TraceCheckUtils]: 21: Hoare triple {8362#true} assume !(0 == ~cond); {8362#true} is VALID [2022-04-08 11:22:31,426 INFO L290 TraceCheckUtils]: 20: Hoare triple {8362#true} ~cond := #in~cond; {8362#true} is VALID [2022-04-08 11:22:31,426 INFO L272 TraceCheckUtils]: 19: Hoare triple {8738#(< ~counter~0 98)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {8362#true} is VALID [2022-04-08 11:22:31,426 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {8362#true} {8738#(< ~counter~0 98)} #79#return; {8738#(< ~counter~0 98)} is VALID [2022-04-08 11:22:31,426 INFO L290 TraceCheckUtils]: 17: Hoare triple {8362#true} assume true; {8362#true} is VALID [2022-04-08 11:22:31,426 INFO L290 TraceCheckUtils]: 16: Hoare triple {8362#true} assume !(0 == ~cond); {8362#true} is VALID [2022-04-08 11:22:31,426 INFO L290 TraceCheckUtils]: 15: Hoare triple {8362#true} ~cond := #in~cond; {8362#true} is VALID [2022-04-08 11:22:31,426 INFO L272 TraceCheckUtils]: 14: Hoare triple {8738#(< ~counter~0 98)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {8362#true} is VALID [2022-04-08 11:22:31,427 INFO L290 TraceCheckUtils]: 13: Hoare triple {8738#(< ~counter~0 98)} assume !!(#t~post6 < 100);havoc #t~post6; {8738#(< ~counter~0 98)} is VALID [2022-04-08 11:22:31,427 INFO L290 TraceCheckUtils]: 12: Hoare triple {8778#(< ~counter~0 97)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8738#(< ~counter~0 98)} is VALID [2022-04-08 11:22:31,427 INFO L290 TraceCheckUtils]: 11: Hoare triple {8778#(< ~counter~0 97)} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {8778#(< ~counter~0 97)} is VALID [2022-04-08 11:22:31,428 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8362#true} {8778#(< ~counter~0 97)} #77#return; {8778#(< ~counter~0 97)} is VALID [2022-04-08 11:22:31,428 INFO L290 TraceCheckUtils]: 9: Hoare triple {8362#true} assume true; {8362#true} is VALID [2022-04-08 11:22:31,428 INFO L290 TraceCheckUtils]: 8: Hoare triple {8362#true} assume !(0 == ~cond); {8362#true} is VALID [2022-04-08 11:22:31,428 INFO L290 TraceCheckUtils]: 7: Hoare triple {8362#true} ~cond := #in~cond; {8362#true} is VALID [2022-04-08 11:22:31,428 INFO L272 TraceCheckUtils]: 6: Hoare triple {8778#(< ~counter~0 97)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {8362#true} is VALID [2022-04-08 11:22:31,429 INFO L290 TraceCheckUtils]: 5: Hoare triple {8778#(< ~counter~0 97)} 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 97)} is VALID [2022-04-08 11:22:31,430 INFO L272 TraceCheckUtils]: 4: Hoare triple {8778#(< ~counter~0 97)} call #t~ret8 := main(); {8778#(< ~counter~0 97)} is VALID [2022-04-08 11:22:31,432 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8778#(< ~counter~0 97)} {8362#true} #93#return; {8778#(< ~counter~0 97)} is VALID [2022-04-08 11:22:31,432 INFO L290 TraceCheckUtils]: 2: Hoare triple {8778#(< ~counter~0 97)} assume true; {8778#(< ~counter~0 97)} is VALID [2022-04-08 11:22:31,432 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 97)} is VALID [2022-04-08 11:22:31,433 INFO L272 TraceCheckUtils]: 0: Hoare triple {8362#true} call ULTIMATE.init(); {8362#true} is VALID [2022-04-08 11:22:31,433 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-08 11:22:31,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:22:31,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590173783] [2022-04-08 11:22:31,433 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:22:31,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [637125462] [2022-04-08 11:22:31,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [637125462] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 11:22:31,433 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 11:22:31,433 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2022-04-08 11:22:31,434 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:22:31,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1788421294] [2022-04-08 11:22:31,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1788421294] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:22:31,434 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:22:31,434 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 11:22:31,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862189401] [2022-04-08 11:22:31,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:22:31,434 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-08 11:22:31,435 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:22:31,435 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-08 11:22:31,474 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-08 11:22:31,474 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 11:22:31,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:22:31,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 11:22:31,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2022-04-08 11:22:31,475 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-08 11:22:31,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:22:31,782 INFO L93 Difference]: Finished difference Result 141 states and 164 transitions. [2022-04-08 11:22:31,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 11:22:31,783 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-08 11:22:31,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:22:31,783 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-08 11:22:31,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 94 transitions. [2022-04-08 11:22:31,784 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-08 11:22:31,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 94 transitions. [2022-04-08 11:22:31,785 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 94 transitions. [2022-04-08 11:22:31,871 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-08 11:22:31,873 INFO L225 Difference]: With dead ends: 141 [2022-04-08 11:22:31,873 INFO L226 Difference]: Without dead ends: 134 [2022-04-08 11:22:31,873 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2022-04-08 11:22:31,874 INFO L913 BasicCegarLoop]: 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-08 11:22:31,874 INFO L914 BasicCegarLoop]: 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-08 11:22:31,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2022-04-08 11:22:32,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 132. [2022-04-08 11:22:32,012 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:22:32,012 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-08 11:22:32,012 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-08 11:22:32,013 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-08 11:22:32,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:22:32,018 INFO L93 Difference]: Finished difference Result 134 states and 157 transitions. [2022-04-08 11:22:32,018 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 157 transitions. [2022-04-08 11:22:32,018 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:22:32,018 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:22:32,019 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-08 11:22:32,019 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-08 11:22:32,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:22:32,023 INFO L93 Difference]: Finished difference Result 134 states and 157 transitions. [2022-04-08 11:22:32,023 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 157 transitions. [2022-04-08 11:22:32,023 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:22:32,023 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:22:32,024 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:22:32,024 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:22:32,024 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-08 11:22:32,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 155 transitions. [2022-04-08 11:22:32,026 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 155 transitions. Word has length 74 [2022-04-08 11:22:32,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:22:32,026 INFO L478 AbstractCegarLoop]: Abstraction has 132 states and 155 transitions. [2022-04-08 11:22:32,026 INFO L479 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-08 11:22:32,027 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 132 states and 155 transitions. [2022-04-08 11:22:32,170 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-08 11:22:32,170 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 155 transitions. [2022-04-08 11:22:32,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-04-08 11:22:32,171 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:22:32,171 INFO L499 BasicCegarLoop]: 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-08 11:22:32,190 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-08 11:22:32,371 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-04-08 11:22:32,372 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:22:32,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:22:32,372 INFO L85 PathProgramCache]: Analyzing trace with hash 1777426592, now seen corresponding path program 1 times [2022-04-08 11:22:32,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:22:32,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1562306231] [2022-04-08 11:22:32,586 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 11:22:53,313 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 11:22:53,313 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 11:22:53,313 INFO L85 PathProgramCache]: Analyzing trace with hash 1777426592, now seen corresponding path program 2 times [2022-04-08 11:22:53,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:22:53,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98894567] [2022-04-08 11:22:53,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:22:53,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:22:53,331 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:22:53,331 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1099024222] [2022-04-08 11:22:53,331 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 11:22:53,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:22:53,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:22:53,334 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-08 11:22:53,335 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-08 11:22:53,385 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 11:22:53,385 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:22:53,386 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 26 conjunts are in the unsatisfiable core [2022-04-08 11:22:53,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:22:53,402 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:22:55,035 INFO L272 TraceCheckUtils]: 0: Hoare triple {9633#true} call ULTIMATE.init(); {9633#true} is VALID [2022-04-08 11:22:55,036 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-08 11:22:55,036 INFO L290 TraceCheckUtils]: 2: Hoare triple {9633#true} assume true; {9633#true} is VALID [2022-04-08 11:22:55,036 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9633#true} {9633#true} #93#return; {9633#true} is VALID [2022-04-08 11:22:55,036 INFO L272 TraceCheckUtils]: 4: Hoare triple {9633#true} call #t~ret8 := main(); {9633#true} is VALID [2022-04-08 11:22:55,036 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-08 11:22:55,036 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-08 11:22:55,036 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-08 11:22:55,037 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-08 11:22:55,037 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-08 11:22:55,037 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-08 11:22:55,038 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-08 11:22:55,038 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-08 11:22:55,039 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 < 100);havoc #t~post6; {9674#(and (= main_~x~0 main_~r~0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-08 11:22:55,039 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-08 11:22:55,039 INFO L290 TraceCheckUtils]: 15: Hoare triple {9633#true} ~cond := #in~cond; {9633#true} is VALID [2022-04-08 11:22:55,039 INFO L290 TraceCheckUtils]: 16: Hoare triple {9633#true} assume !(0 == ~cond); {9633#true} is VALID [2022-04-08 11:22:55,039 INFO L290 TraceCheckUtils]: 17: Hoare triple {9633#true} assume true; {9633#true} is VALID [2022-04-08 11:22:55,039 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-08 11:22:55,039 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-08 11:22:55,040 INFO L290 TraceCheckUtils]: 20: Hoare triple {9633#true} ~cond := #in~cond; {9633#true} is VALID [2022-04-08 11:22:55,040 INFO L290 TraceCheckUtils]: 21: Hoare triple {9633#true} assume !(0 == ~cond); {9633#true} is VALID [2022-04-08 11:22:55,040 INFO L290 TraceCheckUtils]: 22: Hoare triple {9633#true} assume true; {9633#true} is VALID [2022-04-08 11:22:55,040 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-08 11:22:55,041 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-08 11:22:55,041 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-08 11:22:55,041 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 < 100);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-08 11:22:55,041 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-08 11:22:55,042 INFO L290 TraceCheckUtils]: 28: Hoare triple {9633#true} ~cond := #in~cond; {9633#true} is VALID [2022-04-08 11:22:55,042 INFO L290 TraceCheckUtils]: 29: Hoare triple {9633#true} assume !(0 == ~cond); {9633#true} is VALID [2022-04-08 11:22:55,042 INFO L290 TraceCheckUtils]: 30: Hoare triple {9633#true} assume true; {9633#true} is VALID [2022-04-08 11:22:55,042 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-08 11:22:55,042 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-08 11:22:55,042 INFO L290 TraceCheckUtils]: 33: Hoare triple {9633#true} ~cond := #in~cond; {9633#true} is VALID [2022-04-08 11:22:55,042 INFO L290 TraceCheckUtils]: 34: Hoare triple {9633#true} assume !(0 == ~cond); {9633#true} is VALID [2022-04-08 11:22:55,043 INFO L290 TraceCheckUtils]: 35: Hoare triple {9633#true} assume true; {9633#true} is VALID [2022-04-08 11:22:55,043 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-08 11:22:55,043 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-08 11:22:55,043 INFO L290 TraceCheckUtils]: 38: Hoare triple {9633#true} ~cond := #in~cond; {9633#true} is VALID [2022-04-08 11:22:55,043 INFO L290 TraceCheckUtils]: 39: Hoare triple {9633#true} assume !(0 == ~cond); {9633#true} is VALID [2022-04-08 11:22:55,043 INFO L290 TraceCheckUtils]: 40: Hoare triple {9633#true} assume true; {9633#true} is VALID [2022-04-08 11:22:55,044 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-08 11:22:55,044 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-08 11:22:55,045 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-08 11:22:55,045 INFO L290 TraceCheckUtils]: 44: Hoare triple {9633#true} ~cond := #in~cond; {9633#true} is VALID [2022-04-08 11:22:55,045 INFO L290 TraceCheckUtils]: 45: Hoare triple {9633#true} assume !(0 == ~cond); {9633#true} is VALID [2022-04-08 11:22:55,045 INFO L290 TraceCheckUtils]: 46: Hoare triple {9633#true} assume true; {9633#true} is VALID [2022-04-08 11:22:55,045 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-08 11:22:55,046 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-08 11:22:55,047 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-08 11:22:55,047 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 < 100);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-08 11:22:55,047 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-08 11:22:55,047 INFO L290 TraceCheckUtils]: 52: Hoare triple {9633#true} ~cond := #in~cond; {9633#true} is VALID [2022-04-08 11:22:55,047 INFO L290 TraceCheckUtils]: 53: Hoare triple {9633#true} assume !(0 == ~cond); {9633#true} is VALID [2022-04-08 11:22:55,048 INFO L290 TraceCheckUtils]: 54: Hoare triple {9633#true} assume true; {9633#true} is VALID [2022-04-08 11:22:55,048 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-08 11:22:55,048 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-08 11:22:55,048 INFO L290 TraceCheckUtils]: 57: Hoare triple {9633#true} ~cond := #in~cond; {9633#true} is VALID [2022-04-08 11:22:55,048 INFO L290 TraceCheckUtils]: 58: Hoare triple {9633#true} assume !(0 == ~cond); {9633#true} is VALID [2022-04-08 11:22:55,048 INFO L290 TraceCheckUtils]: 59: Hoare triple {9633#true} assume true; {9633#true} is VALID [2022-04-08 11:22:55,049 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-08 11:22:55,049 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-08 11:22:55,049 INFO L290 TraceCheckUtils]: 62: Hoare triple {9633#true} ~cond := #in~cond; {9633#true} is VALID [2022-04-08 11:22:55,049 INFO L290 TraceCheckUtils]: 63: Hoare triple {9633#true} assume !(0 == ~cond); {9633#true} is VALID [2022-04-08 11:22:55,049 INFO L290 TraceCheckUtils]: 64: Hoare triple {9633#true} assume true; {9633#true} is VALID [2022-04-08 11:22:55,050 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-08 11:22:55,050 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-08 11:22:55,051 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-08 11:22:55,051 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-08 11:22:55,051 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 < 100);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-08 11:22:55,052 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-08 11:22:55,052 INFO L290 TraceCheckUtils]: 71: Hoare triple {9633#true} ~cond := #in~cond; {9858#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:22:55,052 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-08 11:22:55,052 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-08 11:22:55,056 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-08 11:22:55,057 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-08 11:22:55,057 INFO L290 TraceCheckUtils]: 76: Hoare triple {9873#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {9877#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:22:55,057 INFO L290 TraceCheckUtils]: 77: Hoare triple {9877#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {9634#false} is VALID [2022-04-08 11:22:55,057 INFO L290 TraceCheckUtils]: 78: Hoare triple {9634#false} assume !false; {9634#false} is VALID [2022-04-08 11:22:55,058 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-08 11:22:55,058 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 11:23:04,756 INFO L290 TraceCheckUtils]: 78: Hoare triple {9634#false} assume !false; {9634#false} is VALID [2022-04-08 11:23:04,756 INFO L290 TraceCheckUtils]: 77: Hoare triple {9877#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {9634#false} is VALID [2022-04-08 11:23:04,757 INFO L290 TraceCheckUtils]: 76: Hoare triple {9873#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {9877#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:23:04,757 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-08 11:23:04,758 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-08 11:23:04,758 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-08 11:23:04,759 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-08 11:23:04,759 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-08 11:23:04,759 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-08 11:23:04,760 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 < 100);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-08 11:23:04,760 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-08 11:23:04,767 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-08 11:23:04,768 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-08 11:23:04,769 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-08 11:23:04,769 INFO L290 TraceCheckUtils]: 64: Hoare triple {9633#true} assume true; {9633#true} is VALID [2022-04-08 11:23:04,769 INFO L290 TraceCheckUtils]: 63: Hoare triple {9633#true} assume !(0 == ~cond); {9633#true} is VALID [2022-04-08 11:23:04,769 INFO L290 TraceCheckUtils]: 62: Hoare triple {9633#true} ~cond := #in~cond; {9633#true} is VALID [2022-04-08 11:23:04,769 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-08 11:23:04,769 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-08 11:23:04,769 INFO L290 TraceCheckUtils]: 59: Hoare triple {9633#true} assume true; {9633#true} is VALID [2022-04-08 11:23:04,770 INFO L290 TraceCheckUtils]: 58: Hoare triple {9633#true} assume !(0 == ~cond); {9633#true} is VALID [2022-04-08 11:23:04,770 INFO L290 TraceCheckUtils]: 57: Hoare triple {9633#true} ~cond := #in~cond; {9633#true} is VALID [2022-04-08 11:23:04,770 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-08 11:23:04,770 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-08 11:23:04,770 INFO L290 TraceCheckUtils]: 54: Hoare triple {9633#true} assume true; {9633#true} is VALID [2022-04-08 11:23:04,770 INFO L290 TraceCheckUtils]: 53: Hoare triple {9633#true} assume !(0 == ~cond); {9633#true} is VALID [2022-04-08 11:23:04,770 INFO L290 TraceCheckUtils]: 52: Hoare triple {9633#true} ~cond := #in~cond; {9633#true} is VALID [2022-04-08 11:23:04,771 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-08 11:23:04,771 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 < 100);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-08 11:23:04,771 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-08 11:23:04,772 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-08 11:23:04,773 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-08 11:23:04,773 INFO L290 TraceCheckUtils]: 46: Hoare triple {9633#true} assume true; {9633#true} is VALID [2022-04-08 11:23:04,773 INFO L290 TraceCheckUtils]: 45: Hoare triple {9633#true} assume !(0 == ~cond); {9633#true} is VALID [2022-04-08 11:23:04,773 INFO L290 TraceCheckUtils]: 44: Hoare triple {9633#true} ~cond := #in~cond; {9633#true} is VALID [2022-04-08 11:23:04,773 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-08 11:23:04,774 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-08 11:23:04,774 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-08 11:23:04,774 INFO L290 TraceCheckUtils]: 40: Hoare triple {9633#true} assume true; {9633#true} is VALID [2022-04-08 11:23:04,774 INFO L290 TraceCheckUtils]: 39: Hoare triple {9633#true} assume !(0 == ~cond); {9633#true} is VALID [2022-04-08 11:23:04,775 INFO L290 TraceCheckUtils]: 38: Hoare triple {9633#true} ~cond := #in~cond; {9633#true} is VALID [2022-04-08 11:23:04,775 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-08 11:23:04,775 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-08 11:23:04,775 INFO L290 TraceCheckUtils]: 35: Hoare triple {9633#true} assume true; {9633#true} is VALID [2022-04-08 11:23:04,775 INFO L290 TraceCheckUtils]: 34: Hoare triple {9633#true} assume !(0 == ~cond); {9633#true} is VALID [2022-04-08 11:23:04,775 INFO L290 TraceCheckUtils]: 33: Hoare triple {9633#true} ~cond := #in~cond; {9633#true} is VALID [2022-04-08 11:23:04,775 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-08 11:23:04,776 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-08 11:23:04,776 INFO L290 TraceCheckUtils]: 30: Hoare triple {9633#true} assume true; {9633#true} is VALID [2022-04-08 11:23:04,776 INFO L290 TraceCheckUtils]: 29: Hoare triple {9633#true} assume !(0 == ~cond); {9633#true} is VALID [2022-04-08 11:23:04,776 INFO L290 TraceCheckUtils]: 28: Hoare triple {9633#true} ~cond := #in~cond; {9633#true} is VALID [2022-04-08 11:23:04,776 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-08 11:23:04,777 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 < 100);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-08 11:23:04,778 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-08 11:23:04,778 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-08 11:23:04,779 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-08 11:23:04,779 INFO L290 TraceCheckUtils]: 22: Hoare triple {9633#true} assume true; {9633#true} is VALID [2022-04-08 11:23:04,779 INFO L290 TraceCheckUtils]: 21: Hoare triple {9633#true} assume !(0 == ~cond); {9633#true} is VALID [2022-04-08 11:23:04,779 INFO L290 TraceCheckUtils]: 20: Hoare triple {9633#true} ~cond := #in~cond; {9633#true} is VALID [2022-04-08 11:23:04,779 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-08 11:23:04,779 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-08 11:23:04,780 INFO L290 TraceCheckUtils]: 17: Hoare triple {9633#true} assume true; {9633#true} is VALID [2022-04-08 11:23:04,780 INFO L290 TraceCheckUtils]: 16: Hoare triple {9633#true} assume !(0 == ~cond); {9633#true} is VALID [2022-04-08 11:23:04,780 INFO L290 TraceCheckUtils]: 15: Hoare triple {9633#true} ~cond := #in~cond; {9633#true} is VALID [2022-04-08 11:23:04,780 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-08 11:23:04,780 INFO L290 TraceCheckUtils]: 13: Hoare triple {9893#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} assume !!(#t~post6 < 100);havoc #t~post6; {9893#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-08 11:23:04,780 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-08 11:23:04,781 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-08 11:23:04,781 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {9633#true} {9633#true} #77#return; {9633#true} is VALID [2022-04-08 11:23:04,781 INFO L290 TraceCheckUtils]: 9: Hoare triple {9633#true} assume true; {9633#true} is VALID [2022-04-08 11:23:04,781 INFO L290 TraceCheckUtils]: 8: Hoare triple {9633#true} assume !(0 == ~cond); {9633#true} is VALID [2022-04-08 11:23:04,781 INFO L290 TraceCheckUtils]: 7: Hoare triple {9633#true} ~cond := #in~cond; {9633#true} is VALID [2022-04-08 11:23:04,781 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-08 11:23:04,781 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-08 11:23:04,781 INFO L272 TraceCheckUtils]: 4: Hoare triple {9633#true} call #t~ret8 := main(); {9633#true} is VALID [2022-04-08 11:23:04,781 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9633#true} {9633#true} #93#return; {9633#true} is VALID [2022-04-08 11:23:04,781 INFO L290 TraceCheckUtils]: 2: Hoare triple {9633#true} assume true; {9633#true} is VALID [2022-04-08 11:23:04,781 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-08 11:23:04,781 INFO L272 TraceCheckUtils]: 0: Hoare triple {9633#true} call ULTIMATE.init(); {9633#true} is VALID [2022-04-08 11:23:04,782 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-08 11:23:04,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:23:04,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98894567] [2022-04-08 11:23:04,782 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:23:04,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1099024222] [2022-04-08 11:23:04,782 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1099024222] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 11:23:04,782 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 11:23:04,782 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9] total 18 [2022-04-08 11:23:04,783 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:23:04,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1562306231] [2022-04-08 11:23:04,783 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1562306231] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:23:04,783 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:23:04,784 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-08 11:23:04,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912754810] [2022-04-08 11:23:04,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:23:04,784 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-08 11:23:04,784 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:23:04,784 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-08 11:23:04,831 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-08 11:23:04,831 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-08 11:23:04,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:23:04,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-08 11:23:04,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2022-04-08 11:23:04,831 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-08 11:23:09,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:23:09,277 INFO L93 Difference]: Finished difference Result 161 states and 197 transitions. [2022-04-08 11:23:09,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-08 11:23:09,278 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-08 11:23:09,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:23:09,278 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-08 11:23:09,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 119 transitions. [2022-04-08 11:23:09,280 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-08 11:23:09,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 119 transitions. [2022-04-08 11:23:09,281 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 119 transitions. [2022-04-08 11:23:09,388 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-08 11:23:09,390 INFO L225 Difference]: With dead ends: 161 [2022-04-08 11:23:09,390 INFO L226 Difference]: Without dead ends: 158 [2022-04-08 11:23:09,391 INFO L912 BasicCegarLoop]: 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-08 11:23:09,391 INFO L913 BasicCegarLoop]: 45 mSDtfsCounter, 51 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 576 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s 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.7s IncrementalHoareTripleChecker+Time [2022-04-08 11:23:09,391 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [67 Valid, 259 Invalid, 607 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 576 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-04-08 11:23:09,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2022-04-08 11:23:09,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 153. [2022-04-08 11:23:09,615 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:23:09,616 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-08 11:23:09,616 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-08 11:23:09,616 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-08 11:23:09,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:23:09,619 INFO L93 Difference]: Finished difference Result 158 states and 193 transitions. [2022-04-08 11:23:09,619 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 193 transitions. [2022-04-08 11:23:09,619 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:23:09,619 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:23:09,620 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-08 11:23:09,620 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-08 11:23:09,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:23:09,623 INFO L93 Difference]: Finished difference Result 158 states and 193 transitions. [2022-04-08 11:23:09,623 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 193 transitions. [2022-04-08 11:23:09,623 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:23:09,623 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:23:09,623 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:23:09,623 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:23:09,624 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-08 11:23:09,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 188 transitions. [2022-04-08 11:23:09,626 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 188 transitions. Word has length 79 [2022-04-08 11:23:09,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:23:09,626 INFO L478 AbstractCegarLoop]: Abstraction has 153 states and 188 transitions. [2022-04-08 11:23:09,627 INFO L479 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-08 11:23:09,627 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 153 states and 188 transitions. [2022-04-08 11:23:09,871 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-08 11:23:09,871 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 188 transitions. [2022-04-08 11:23:09,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-04-08 11:23:09,872 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:23:09,872 INFO L499 BasicCegarLoop]: 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-08 11:23:09,897 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-08 11:23:10,072 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-04-08 11:23:10,073 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:23:10,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:23:10,073 INFO L85 PathProgramCache]: Analyzing trace with hash -554329876, now seen corresponding path program 3 times [2022-04-08 11:23:10,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:23:10,073 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1810949304] [2022-04-08 11:23:30,414 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 11:23:30,414 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 11:23:30,414 INFO L85 PathProgramCache]: Analyzing trace with hash -554329876, now seen corresponding path program 4 times [2022-04-08 11:23:30,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:23:30,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806271380] [2022-04-08 11:23:30,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:23:30,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:23:30,426 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:23:30,426 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1011207884] [2022-04-08 11:23:30,426 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 11:23:30,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:23:30,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:23:30,427 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-08 11:23:30,428 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-08 11:23:30,474 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 11:23:30,475 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:23:30,475 INFO L263 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-08 11:23:30,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:23:30,489 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:23:30,884 INFO L272 TraceCheckUtils]: 0: Hoare triple {11076#true} call ULTIMATE.init(); {11076#true} is VALID [2022-04-08 11:23:30,885 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-08 11:23:30,885 INFO L290 TraceCheckUtils]: 2: Hoare triple {11076#true} assume true; {11076#true} is VALID [2022-04-08 11:23:30,885 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11076#true} {11076#true} #93#return; {11076#true} is VALID [2022-04-08 11:23:30,885 INFO L272 TraceCheckUtils]: 4: Hoare triple {11076#true} call #t~ret8 := main(); {11076#true} is VALID [2022-04-08 11:23:30,885 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-08 11:23:30,885 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-08 11:23:30,885 INFO L290 TraceCheckUtils]: 7: Hoare triple {11076#true} ~cond := #in~cond; {11076#true} is VALID [2022-04-08 11:23:30,885 INFO L290 TraceCheckUtils]: 8: Hoare triple {11076#true} assume !(0 == ~cond); {11076#true} is VALID [2022-04-08 11:23:30,885 INFO L290 TraceCheckUtils]: 9: Hoare triple {11076#true} assume true; {11076#true} is VALID [2022-04-08 11:23:30,885 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {11076#true} {11076#true} #77#return; {11076#true} is VALID [2022-04-08 11:23:30,886 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-08 11:23:30,886 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-08 11:23:30,886 INFO L290 TraceCheckUtils]: 13: Hoare triple {11114#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} assume !!(#t~post6 < 100);havoc #t~post6; {11114#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 11:23:30,887 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-08 11:23:30,887 INFO L290 TraceCheckUtils]: 15: Hoare triple {11076#true} ~cond := #in~cond; {11076#true} is VALID [2022-04-08 11:23:30,887 INFO L290 TraceCheckUtils]: 16: Hoare triple {11076#true} assume !(0 == ~cond); {11076#true} is VALID [2022-04-08 11:23:30,887 INFO L290 TraceCheckUtils]: 17: Hoare triple {11076#true} assume true; {11076#true} is VALID [2022-04-08 11:23:30,887 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-08 11:23:30,887 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-08 11:23:30,887 INFO L290 TraceCheckUtils]: 20: Hoare triple {11076#true} ~cond := #in~cond; {11076#true} is VALID [2022-04-08 11:23:30,888 INFO L290 TraceCheckUtils]: 21: Hoare triple {11076#true} assume !(0 == ~cond); {11076#true} is VALID [2022-04-08 11:23:30,888 INFO L290 TraceCheckUtils]: 22: Hoare triple {11076#true} assume true; {11076#true} is VALID [2022-04-08 11:23:30,888 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-08 11:23:30,888 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-08 11:23:30,889 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-08 11:23:30,889 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 < 100);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-08 11:23:30,889 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-08 11:23:30,889 INFO L290 TraceCheckUtils]: 28: Hoare triple {11076#true} ~cond := #in~cond; {11076#true} is VALID [2022-04-08 11:23:30,889 INFO L290 TraceCheckUtils]: 29: Hoare triple {11076#true} assume !(0 == ~cond); {11076#true} is VALID [2022-04-08 11:23:30,889 INFO L290 TraceCheckUtils]: 30: Hoare triple {11076#true} assume true; {11076#true} is VALID [2022-04-08 11:23:30,890 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-08 11:23:30,890 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-08 11:23:30,890 INFO L290 TraceCheckUtils]: 33: Hoare triple {11076#true} ~cond := #in~cond; {11076#true} is VALID [2022-04-08 11:23:30,890 INFO L290 TraceCheckUtils]: 34: Hoare triple {11076#true} assume !(0 == ~cond); {11076#true} is VALID [2022-04-08 11:23:30,890 INFO L290 TraceCheckUtils]: 35: Hoare triple {11076#true} assume true; {11076#true} is VALID [2022-04-08 11:23:30,891 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-08 11:23:30,891 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-08 11:23:30,891 INFO L290 TraceCheckUtils]: 38: Hoare triple {11076#true} ~cond := #in~cond; {11076#true} is VALID [2022-04-08 11:23:30,891 INFO L290 TraceCheckUtils]: 39: Hoare triple {11076#true} assume !(0 == ~cond); {11076#true} is VALID [2022-04-08 11:23:30,891 INFO L290 TraceCheckUtils]: 40: Hoare triple {11076#true} assume true; {11076#true} is VALID [2022-04-08 11:23:30,892 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-08 11:23:30,892 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-08 11:23:30,892 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-08 11:23:30,892 INFO L290 TraceCheckUtils]: 44: Hoare triple {11076#true} ~cond := #in~cond; {11076#true} is VALID [2022-04-08 11:23:30,893 INFO L290 TraceCheckUtils]: 45: Hoare triple {11076#true} assume !(0 == ~cond); {11076#true} is VALID [2022-04-08 11:23:30,893 INFO L290 TraceCheckUtils]: 46: Hoare triple {11076#true} assume true; {11076#true} is VALID [2022-04-08 11:23:30,893 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-08 11:23:30,893 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-08 11:23:30,894 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-08 11:23:30,894 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 < 100);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-08 11:23:30,894 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-08 11:23:30,894 INFO L290 TraceCheckUtils]: 52: Hoare triple {11076#true} ~cond := #in~cond; {11076#true} is VALID [2022-04-08 11:23:30,894 INFO L290 TraceCheckUtils]: 53: Hoare triple {11076#true} assume !(0 == ~cond); {11076#true} is VALID [2022-04-08 11:23:30,895 INFO L290 TraceCheckUtils]: 54: Hoare triple {11076#true} assume true; {11076#true} is VALID [2022-04-08 11:23:30,895 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-08 11:23:30,895 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-08 11:23:30,895 INFO L290 TraceCheckUtils]: 57: Hoare triple {11076#true} ~cond := #in~cond; {11076#true} is VALID [2022-04-08 11:23:30,895 INFO L290 TraceCheckUtils]: 58: Hoare triple {11076#true} assume !(0 == ~cond); {11076#true} is VALID [2022-04-08 11:23:30,895 INFO L290 TraceCheckUtils]: 59: Hoare triple {11076#true} assume true; {11076#true} is VALID [2022-04-08 11:23:30,896 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-08 11:23:30,896 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-08 11:23:30,896 INFO L290 TraceCheckUtils]: 62: Hoare triple {11076#true} ~cond := #in~cond; {11076#true} is VALID [2022-04-08 11:23:30,896 INFO L290 TraceCheckUtils]: 63: Hoare triple {11076#true} assume !(0 == ~cond); {11076#true} is VALID [2022-04-08 11:23:30,896 INFO L290 TraceCheckUtils]: 64: Hoare triple {11076#true} assume true; {11076#true} is VALID [2022-04-08 11:23:30,897 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-08 11:23:30,897 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-08 11:23:30,897 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-08 11:23:30,897 INFO L290 TraceCheckUtils]: 68: Hoare triple {11076#true} ~cond := #in~cond; {11076#true} is VALID [2022-04-08 11:23:30,897 INFO L290 TraceCheckUtils]: 69: Hoare triple {11076#true} assume !(0 == ~cond); {11076#true} is VALID [2022-04-08 11:23:30,897 INFO L290 TraceCheckUtils]: 70: Hoare triple {11076#true} assume true; {11076#true} is VALID [2022-04-08 11:23:30,898 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-08 11:23:30,898 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-08 11:23:30,899 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-08 11:23:30,899 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 < 100);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-08 11:23:30,900 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-08 11:23:30,900 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-08 11:23:30,901 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 < 100);havoc #t~post6; {11310#(and (= main_~x~0 (+ main_~r~0 (* main_~y~0 4))) (= main_~q~0 4))} is VALID [2022-04-08 11:23:30,901 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-08 11:23:30,901 INFO L290 TraceCheckUtils]: 79: Hoare triple {11320#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {11324#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:23:30,902 INFO L290 TraceCheckUtils]: 80: Hoare triple {11324#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {11077#false} is VALID [2022-04-08 11:23:30,902 INFO L290 TraceCheckUtils]: 81: Hoare triple {11077#false} assume !false; {11077#false} is VALID [2022-04-08 11:23:30,902 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-08 11:23:30,902 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 11:23:50,867 INFO L290 TraceCheckUtils]: 81: Hoare triple {11077#false} assume !false; {11077#false} is VALID [2022-04-08 11:23:50,875 INFO L290 TraceCheckUtils]: 80: Hoare triple {11324#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {11077#false} is VALID [2022-04-08 11:23:50,875 INFO L290 TraceCheckUtils]: 79: Hoare triple {11320#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {11324#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:23:50,876 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-08 11:23:50,876 INFO L290 TraceCheckUtils]: 77: Hoare triple {11340#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} assume !(#t~post6 < 100);havoc #t~post6; {11340#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-08 11:23:50,877 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-08 11:23:50,884 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-08 11:23:50,884 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 < 100);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-08 11:23:50,884 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-08 11:23:50,887 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-08 11:23:50,887 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-08 11:23:50,887 INFO L290 TraceCheckUtils]: 70: Hoare triple {11076#true} assume true; {11076#true} is VALID [2022-04-08 11:23:50,887 INFO L290 TraceCheckUtils]: 69: Hoare triple {11076#true} assume !(0 == ~cond); {11076#true} is VALID [2022-04-08 11:23:50,888 INFO L290 TraceCheckUtils]: 68: Hoare triple {11076#true} ~cond := #in~cond; {11076#true} is VALID [2022-04-08 11:23:50,888 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-08 11:23:50,888 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-08 11:23:50,888 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-08 11:23:50,889 INFO L290 TraceCheckUtils]: 64: Hoare triple {11076#true} assume true; {11076#true} is VALID [2022-04-08 11:23:50,889 INFO L290 TraceCheckUtils]: 63: Hoare triple {11076#true} assume !(0 == ~cond); {11076#true} is VALID [2022-04-08 11:23:50,889 INFO L290 TraceCheckUtils]: 62: Hoare triple {11076#true} ~cond := #in~cond; {11076#true} is VALID [2022-04-08 11:23:50,889 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-08 11:23:50,889 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-08 11:23:50,889 INFO L290 TraceCheckUtils]: 59: Hoare triple {11076#true} assume true; {11076#true} is VALID [2022-04-08 11:23:50,889 INFO L290 TraceCheckUtils]: 58: Hoare triple {11076#true} assume !(0 == ~cond); {11076#true} is VALID [2022-04-08 11:23:50,890 INFO L290 TraceCheckUtils]: 57: Hoare triple {11076#true} ~cond := #in~cond; {11076#true} is VALID [2022-04-08 11:23:50,890 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-08 11:23:50,890 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-08 11:23:50,890 INFO L290 TraceCheckUtils]: 54: Hoare triple {11076#true} assume true; {11076#true} is VALID [2022-04-08 11:23:50,890 INFO L290 TraceCheckUtils]: 53: Hoare triple {11076#true} assume !(0 == ~cond); {11076#true} is VALID [2022-04-08 11:23:50,890 INFO L290 TraceCheckUtils]: 52: Hoare triple {11076#true} ~cond := #in~cond; {11076#true} is VALID [2022-04-08 11:23:50,890 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-08 11:23:50,891 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 < 100);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-08 11:23:50,891 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-08 11:23:50,893 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-08 11:23:50,894 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-08 11:23:50,894 INFO L290 TraceCheckUtils]: 46: Hoare triple {11076#true} assume true; {11076#true} is VALID [2022-04-08 11:23:50,894 INFO L290 TraceCheckUtils]: 45: Hoare triple {11076#true} assume !(0 == ~cond); {11076#true} is VALID [2022-04-08 11:23:50,894 INFO L290 TraceCheckUtils]: 44: Hoare triple {11076#true} ~cond := #in~cond; {11076#true} is VALID [2022-04-08 11:23:50,894 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-08 11:23:50,895 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-08 11:23:50,895 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-08 11:23:50,895 INFO L290 TraceCheckUtils]: 40: Hoare triple {11076#true} assume true; {11076#true} is VALID [2022-04-08 11:23:50,895 INFO L290 TraceCheckUtils]: 39: Hoare triple {11076#true} assume !(0 == ~cond); {11076#true} is VALID [2022-04-08 11:23:50,895 INFO L290 TraceCheckUtils]: 38: Hoare triple {11076#true} ~cond := #in~cond; {11076#true} is VALID [2022-04-08 11:23:50,896 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-08 11:23:50,896 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-08 11:23:50,896 INFO L290 TraceCheckUtils]: 35: Hoare triple {11076#true} assume true; {11076#true} is VALID [2022-04-08 11:23:50,896 INFO L290 TraceCheckUtils]: 34: Hoare triple {11076#true} assume !(0 == ~cond); {11076#true} is VALID [2022-04-08 11:23:50,896 INFO L290 TraceCheckUtils]: 33: Hoare triple {11076#true} ~cond := #in~cond; {11076#true} is VALID [2022-04-08 11:23:50,896 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-08 11:23:50,897 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-08 11:23:50,897 INFO L290 TraceCheckUtils]: 30: Hoare triple {11076#true} assume true; {11076#true} is VALID [2022-04-08 11:23:50,897 INFO L290 TraceCheckUtils]: 29: Hoare triple {11076#true} assume !(0 == ~cond); {11076#true} is VALID [2022-04-08 11:23:50,897 INFO L290 TraceCheckUtils]: 28: Hoare triple {11076#true} ~cond := #in~cond; {11076#true} is VALID [2022-04-08 11:23:50,897 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-08 11:23:50,898 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 < 100);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-08 11:23:50,898 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-08 11:23:50,899 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-08 11:23:50,899 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-08 11:23:50,899 INFO L290 TraceCheckUtils]: 22: Hoare triple {11076#true} assume true; {11076#true} is VALID [2022-04-08 11:23:50,899 INFO L290 TraceCheckUtils]: 21: Hoare triple {11076#true} assume !(0 == ~cond); {11076#true} is VALID [2022-04-08 11:23:50,899 INFO L290 TraceCheckUtils]: 20: Hoare triple {11076#true} ~cond := #in~cond; {11076#true} is VALID [2022-04-08 11:23:50,900 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-08 11:23:50,900 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-08 11:23:50,900 INFO L290 TraceCheckUtils]: 17: Hoare triple {11076#true} assume true; {11076#true} is VALID [2022-04-08 11:23:50,900 INFO L290 TraceCheckUtils]: 16: Hoare triple {11076#true} assume !(0 == ~cond); {11076#true} is VALID [2022-04-08 11:23:50,900 INFO L290 TraceCheckUtils]: 15: Hoare triple {11076#true} ~cond := #in~cond; {11076#true} is VALID [2022-04-08 11:23:50,900 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-08 11:23:50,901 INFO L290 TraceCheckUtils]: 13: Hoare triple {11114#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} assume !!(#t~post6 < 100);havoc #t~post6; {11114#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 11:23:50,901 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-08 11:23:50,902 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-08 11:23:50,902 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {11076#true} {11076#true} #77#return; {11076#true} is VALID [2022-04-08 11:23:50,902 INFO L290 TraceCheckUtils]: 9: Hoare triple {11076#true} assume true; {11076#true} is VALID [2022-04-08 11:23:50,902 INFO L290 TraceCheckUtils]: 8: Hoare triple {11076#true} assume !(0 == ~cond); {11076#true} is VALID [2022-04-08 11:23:50,902 INFO L290 TraceCheckUtils]: 7: Hoare triple {11076#true} ~cond := #in~cond; {11076#true} is VALID [2022-04-08 11:23:50,902 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-08 11:23:50,902 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-08 11:23:50,902 INFO L272 TraceCheckUtils]: 4: Hoare triple {11076#true} call #t~ret8 := main(); {11076#true} is VALID [2022-04-08 11:23:50,902 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11076#true} {11076#true} #93#return; {11076#true} is VALID [2022-04-08 11:23:50,902 INFO L290 TraceCheckUtils]: 2: Hoare triple {11076#true} assume true; {11076#true} is VALID [2022-04-08 11:23:50,902 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-08 11:23:50,902 INFO L272 TraceCheckUtils]: 0: Hoare triple {11076#true} call ULTIMATE.init(); {11076#true} is VALID [2022-04-08 11:23:50,903 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-08 11:23:50,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:23:50,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806271380] [2022-04-08 11:23:50,903 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:23:50,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1011207884] [2022-04-08 11:23:50,903 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1011207884] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 11:23:50,903 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 11:23:50,903 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2022-04-08 11:23:50,904 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:23:50,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1810949304] [2022-04-08 11:23:50,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1810949304] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:23:50,904 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:23:50,904 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-08 11:23:50,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705554363] [2022-04-08 11:23:50,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:23:50,904 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-08 11:23:50,905 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:23:50,905 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-08 11:23:50,965 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-08 11:23:50,965 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-08 11:23:50,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:23:50,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-08 11:23:50,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2022-04-08 11:23:50,966 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-08 11:23:51,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:23:51,902 INFO L93 Difference]: Finished difference Result 201 states and 254 transitions. [2022-04-08 11:23:51,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-08 11:23:51,902 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-08 11:23:51,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:23:51,902 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-08 11:23:51,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 135 transitions. [2022-04-08 11:23:51,904 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-08 11:23:51,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 135 transitions. [2022-04-08 11:23:51,905 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 135 transitions. [2022-04-08 11:23:52,028 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-08 11:23:52,031 INFO L225 Difference]: With dead ends: 201 [2022-04-08 11:23:52,032 INFO L226 Difference]: Without dead ends: 198 [2022-04-08 11:23:52,032 INFO L912 BasicCegarLoop]: 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-08 11:23:52,032 INFO L913 BasicCegarLoop]: 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-08 11:23:52,032 INFO L914 BasicCegarLoop]: 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-08 11:23:52,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2022-04-08 11:23:52,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 168. [2022-04-08 11:23:52,238 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:23:52,239 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-08 11:23:52,239 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-08 11:23:52,239 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-08 11:23:52,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:23:52,244 INFO L93 Difference]: Finished difference Result 198 states and 249 transitions. [2022-04-08 11:23:52,244 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 249 transitions. [2022-04-08 11:23:52,244 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:23:52,244 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:23:52,244 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-08 11:23:52,245 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-08 11:23:52,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:23:52,249 INFO L93 Difference]: Finished difference Result 198 states and 249 transitions. [2022-04-08 11:23:52,249 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 249 transitions. [2022-04-08 11:23:52,249 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:23:52,249 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:23:52,249 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:23:52,249 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:23:52,250 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-08 11:23:52,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 206 transitions. [2022-04-08 11:23:52,253 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 206 transitions. Word has length 82 [2022-04-08 11:23:52,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:23:52,253 INFO L478 AbstractCegarLoop]: Abstraction has 168 states and 206 transitions. [2022-04-08 11:23:52,253 INFO L479 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-08 11:23:52,253 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 168 states and 206 transitions. [2022-04-08 11:23:52,497 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-08 11:23:52,497 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 206 transitions. [2022-04-08 11:23:52,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-04-08 11:23:52,497 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:23:52,497 INFO L499 BasicCegarLoop]: 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-08 11:23:52,519 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-08 11:23:52,698 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:23:52,698 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:23:52,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:23:52,699 INFO L85 PathProgramCache]: Analyzing trace with hash 1891783602, now seen corresponding path program 1 times [2022-04-08 11:23:52,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:23:52,699 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1254394329] [2022-04-08 11:24:16,100 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 11:24:16,101 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 11:24:16,101 INFO L85 PathProgramCache]: Analyzing trace with hash 1891783602, now seen corresponding path program 2 times [2022-04-08 11:24:16,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:24:16,101 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296862945] [2022-04-08 11:24:16,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:24:16,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:24:16,111 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:24:16,111 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [756194981] [2022-04-08 11:24:16,111 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 11:24:16,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:24:16,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:24:16,112 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-08 11:24:16,113 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-08 11:24:16,166 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 11:24:16,166 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:24:16,167 INFO L263 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-08 11:24:16,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:24:16,183 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:24:16,500 INFO L272 TraceCheckUtils]: 0: Hoare triple {12716#true} call ULTIMATE.init(); {12716#true} is VALID [2022-04-08 11:24:16,500 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-08 11:24:16,500 INFO L290 TraceCheckUtils]: 2: Hoare triple {12724#(<= ~counter~0 0)} assume true; {12724#(<= ~counter~0 0)} is VALID [2022-04-08 11:24:16,501 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12724#(<= ~counter~0 0)} {12716#true} #93#return; {12724#(<= ~counter~0 0)} is VALID [2022-04-08 11:24:16,501 INFO L272 TraceCheckUtils]: 4: Hoare triple {12724#(<= ~counter~0 0)} call #t~ret8 := main(); {12724#(<= ~counter~0 0)} is VALID [2022-04-08 11:24:16,501 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-08 11:24:16,502 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-08 11:24:16,502 INFO L290 TraceCheckUtils]: 7: Hoare triple {12724#(<= ~counter~0 0)} ~cond := #in~cond; {12724#(<= ~counter~0 0)} is VALID [2022-04-08 11:24:16,502 INFO L290 TraceCheckUtils]: 8: Hoare triple {12724#(<= ~counter~0 0)} assume !(0 == ~cond); {12724#(<= ~counter~0 0)} is VALID [2022-04-08 11:24:16,503 INFO L290 TraceCheckUtils]: 9: Hoare triple {12724#(<= ~counter~0 0)} assume true; {12724#(<= ~counter~0 0)} is VALID [2022-04-08 11:24:16,503 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {12724#(<= ~counter~0 0)} {12724#(<= ~counter~0 0)} #77#return; {12724#(<= ~counter~0 0)} is VALID [2022-04-08 11:24:16,503 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-08 11:24:16,504 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-08 11:24:16,504 INFO L290 TraceCheckUtils]: 13: Hoare triple {12758#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {12758#(<= ~counter~0 1)} is VALID [2022-04-08 11:24:16,504 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-08 11:24:16,505 INFO L290 TraceCheckUtils]: 15: Hoare triple {12758#(<= ~counter~0 1)} ~cond := #in~cond; {12758#(<= ~counter~0 1)} is VALID [2022-04-08 11:24:16,505 INFO L290 TraceCheckUtils]: 16: Hoare triple {12758#(<= ~counter~0 1)} assume !(0 == ~cond); {12758#(<= ~counter~0 1)} is VALID [2022-04-08 11:24:16,505 INFO L290 TraceCheckUtils]: 17: Hoare triple {12758#(<= ~counter~0 1)} assume true; {12758#(<= ~counter~0 1)} is VALID [2022-04-08 11:24:16,506 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {12758#(<= ~counter~0 1)} {12758#(<= ~counter~0 1)} #79#return; {12758#(<= ~counter~0 1)} is VALID [2022-04-08 11:24:16,506 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-08 11:24:16,506 INFO L290 TraceCheckUtils]: 20: Hoare triple {12758#(<= ~counter~0 1)} ~cond := #in~cond; {12758#(<= ~counter~0 1)} is VALID [2022-04-08 11:24:16,507 INFO L290 TraceCheckUtils]: 21: Hoare triple {12758#(<= ~counter~0 1)} assume !(0 == ~cond); {12758#(<= ~counter~0 1)} is VALID [2022-04-08 11:24:16,507 INFO L290 TraceCheckUtils]: 22: Hoare triple {12758#(<= ~counter~0 1)} assume true; {12758#(<= ~counter~0 1)} is VALID [2022-04-08 11:24:16,507 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {12758#(<= ~counter~0 1)} {12758#(<= ~counter~0 1)} #81#return; {12758#(<= ~counter~0 1)} is VALID [2022-04-08 11:24:16,508 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-08 11:24:16,508 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-08 11:24:16,508 INFO L290 TraceCheckUtils]: 26: Hoare triple {12798#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {12798#(<= ~counter~0 2)} is VALID [2022-04-08 11:24:16,509 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-08 11:24:16,509 INFO L290 TraceCheckUtils]: 28: Hoare triple {12798#(<= ~counter~0 2)} ~cond := #in~cond; {12798#(<= ~counter~0 2)} is VALID [2022-04-08 11:24:16,509 INFO L290 TraceCheckUtils]: 29: Hoare triple {12798#(<= ~counter~0 2)} assume !(0 == ~cond); {12798#(<= ~counter~0 2)} is VALID [2022-04-08 11:24:16,510 INFO L290 TraceCheckUtils]: 30: Hoare triple {12798#(<= ~counter~0 2)} assume true; {12798#(<= ~counter~0 2)} is VALID [2022-04-08 11:24:16,510 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {12798#(<= ~counter~0 2)} {12798#(<= ~counter~0 2)} #83#return; {12798#(<= ~counter~0 2)} is VALID [2022-04-08 11:24:16,510 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-08 11:24:16,511 INFO L290 TraceCheckUtils]: 33: Hoare triple {12798#(<= ~counter~0 2)} ~cond := #in~cond; {12798#(<= ~counter~0 2)} is VALID [2022-04-08 11:24:16,511 INFO L290 TraceCheckUtils]: 34: Hoare triple {12798#(<= ~counter~0 2)} assume !(0 == ~cond); {12798#(<= ~counter~0 2)} is VALID [2022-04-08 11:24:16,511 INFO L290 TraceCheckUtils]: 35: Hoare triple {12798#(<= ~counter~0 2)} assume true; {12798#(<= ~counter~0 2)} is VALID [2022-04-08 11:24:16,512 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {12798#(<= ~counter~0 2)} {12798#(<= ~counter~0 2)} #85#return; {12798#(<= ~counter~0 2)} is VALID [2022-04-08 11:24:16,512 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-08 11:24:16,512 INFO L290 TraceCheckUtils]: 38: Hoare triple {12798#(<= ~counter~0 2)} ~cond := #in~cond; {12798#(<= ~counter~0 2)} is VALID [2022-04-08 11:24:16,513 INFO L290 TraceCheckUtils]: 39: Hoare triple {12798#(<= ~counter~0 2)} assume !(0 == ~cond); {12798#(<= ~counter~0 2)} is VALID [2022-04-08 11:24:16,513 INFO L290 TraceCheckUtils]: 40: Hoare triple {12798#(<= ~counter~0 2)} assume true; {12798#(<= ~counter~0 2)} is VALID [2022-04-08 11:24:16,513 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {12798#(<= ~counter~0 2)} {12798#(<= ~counter~0 2)} #87#return; {12798#(<= ~counter~0 2)} is VALID [2022-04-08 11:24:16,514 INFO L290 TraceCheckUtils]: 42: Hoare triple {12798#(<= ~counter~0 2)} assume !!(~r~0 >= 2 * ~b~0); {12798#(<= ~counter~0 2)} is VALID [2022-04-08 11:24:16,514 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-08 11:24:16,514 INFO L290 TraceCheckUtils]: 44: Hoare triple {12798#(<= ~counter~0 2)} ~cond := #in~cond; {12798#(<= ~counter~0 2)} is VALID [2022-04-08 11:24:16,515 INFO L290 TraceCheckUtils]: 45: Hoare triple {12798#(<= ~counter~0 2)} assume !(0 == ~cond); {12798#(<= ~counter~0 2)} is VALID [2022-04-08 11:24:16,515 INFO L290 TraceCheckUtils]: 46: Hoare triple {12798#(<= ~counter~0 2)} assume true; {12798#(<= ~counter~0 2)} is VALID [2022-04-08 11:24:16,515 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {12798#(<= ~counter~0 2)} {12798#(<= ~counter~0 2)} #89#return; {12798#(<= ~counter~0 2)} is VALID [2022-04-08 11:24:16,515 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-08 11:24:16,516 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-08 11:24:16,516 INFO L290 TraceCheckUtils]: 50: Hoare triple {12871#(<= ~counter~0 3)} assume !!(#t~post7 < 100);havoc #t~post7; {12871#(<= ~counter~0 3)} is VALID [2022-04-08 11:24:16,517 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-08 11:24:16,517 INFO L290 TraceCheckUtils]: 52: Hoare triple {12871#(<= ~counter~0 3)} ~cond := #in~cond; {12871#(<= ~counter~0 3)} is VALID [2022-04-08 11:24:16,517 INFO L290 TraceCheckUtils]: 53: Hoare triple {12871#(<= ~counter~0 3)} assume !(0 == ~cond); {12871#(<= ~counter~0 3)} is VALID [2022-04-08 11:24:16,517 INFO L290 TraceCheckUtils]: 54: Hoare triple {12871#(<= ~counter~0 3)} assume true; {12871#(<= ~counter~0 3)} is VALID [2022-04-08 11:24:16,518 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {12871#(<= ~counter~0 3)} {12871#(<= ~counter~0 3)} #83#return; {12871#(<= ~counter~0 3)} is VALID [2022-04-08 11:24:16,518 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-08 11:24:16,519 INFO L290 TraceCheckUtils]: 57: Hoare triple {12871#(<= ~counter~0 3)} ~cond := #in~cond; {12871#(<= ~counter~0 3)} is VALID [2022-04-08 11:24:16,519 INFO L290 TraceCheckUtils]: 58: Hoare triple {12871#(<= ~counter~0 3)} assume !(0 == ~cond); {12871#(<= ~counter~0 3)} is VALID [2022-04-08 11:24:16,519 INFO L290 TraceCheckUtils]: 59: Hoare triple {12871#(<= ~counter~0 3)} assume true; {12871#(<= ~counter~0 3)} is VALID [2022-04-08 11:24:16,520 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {12871#(<= ~counter~0 3)} {12871#(<= ~counter~0 3)} #85#return; {12871#(<= ~counter~0 3)} is VALID [2022-04-08 11:24:16,520 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-08 11:24:16,520 INFO L290 TraceCheckUtils]: 62: Hoare triple {12871#(<= ~counter~0 3)} ~cond := #in~cond; {12871#(<= ~counter~0 3)} is VALID [2022-04-08 11:24:16,520 INFO L290 TraceCheckUtils]: 63: Hoare triple {12871#(<= ~counter~0 3)} assume !(0 == ~cond); {12871#(<= ~counter~0 3)} is VALID [2022-04-08 11:24:16,521 INFO L290 TraceCheckUtils]: 64: Hoare triple {12871#(<= ~counter~0 3)} assume true; {12871#(<= ~counter~0 3)} is VALID [2022-04-08 11:24:16,521 INFO L284 TraceCheckUtils]: 65: Hoare quadruple {12871#(<= ~counter~0 3)} {12871#(<= ~counter~0 3)} #87#return; {12871#(<= ~counter~0 3)} is VALID [2022-04-08 11:24:16,521 INFO L290 TraceCheckUtils]: 66: Hoare triple {12871#(<= ~counter~0 3)} assume !(~r~0 >= 2 * ~b~0); {12871#(<= ~counter~0 3)} is VALID [2022-04-08 11:24:16,522 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-08 11:24:16,522 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-08 11:24:16,522 INFO L290 TraceCheckUtils]: 69: Hoare triple {12929#(<= ~counter~0 4)} assume !!(#t~post6 < 100);havoc #t~post6; {12929#(<= ~counter~0 4)} is VALID [2022-04-08 11:24:16,523 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-08 11:24:16,523 INFO L290 TraceCheckUtils]: 71: Hoare triple {12929#(<= ~counter~0 4)} ~cond := #in~cond; {12929#(<= ~counter~0 4)} is VALID [2022-04-08 11:24:16,523 INFO L290 TraceCheckUtils]: 72: Hoare triple {12929#(<= ~counter~0 4)} assume !(0 == ~cond); {12929#(<= ~counter~0 4)} is VALID [2022-04-08 11:24:16,524 INFO L290 TraceCheckUtils]: 73: Hoare triple {12929#(<= ~counter~0 4)} assume true; {12929#(<= ~counter~0 4)} is VALID [2022-04-08 11:24:16,524 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {12929#(<= ~counter~0 4)} {12929#(<= ~counter~0 4)} #79#return; {12929#(<= ~counter~0 4)} is VALID [2022-04-08 11:24:16,524 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-08 11:24:16,525 INFO L290 TraceCheckUtils]: 76: Hoare triple {12929#(<= ~counter~0 4)} ~cond := #in~cond; {12929#(<= ~counter~0 4)} is VALID [2022-04-08 11:24:16,525 INFO L290 TraceCheckUtils]: 77: Hoare triple {12929#(<= ~counter~0 4)} assume !(0 == ~cond); {12929#(<= ~counter~0 4)} is VALID [2022-04-08 11:24:16,525 INFO L290 TraceCheckUtils]: 78: Hoare triple {12929#(<= ~counter~0 4)} assume true; {12929#(<= ~counter~0 4)} is VALID [2022-04-08 11:24:16,526 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {12929#(<= ~counter~0 4)} {12929#(<= ~counter~0 4)} #81#return; {12929#(<= ~counter~0 4)} is VALID [2022-04-08 11:24:16,526 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-08 11:24:16,526 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-08 11:24:16,527 INFO L290 TraceCheckUtils]: 82: Hoare triple {12969#(<= |main_#t~post7| 4)} assume !(#t~post7 < 100);havoc #t~post7; {12717#false} is VALID [2022-04-08 11:24:16,527 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-08 11:24:16,527 INFO L290 TraceCheckUtils]: 84: Hoare triple {12717#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12717#false} is VALID [2022-04-08 11:24:16,527 INFO L290 TraceCheckUtils]: 85: Hoare triple {12717#false} assume !(#t~post6 < 100);havoc #t~post6; {12717#false} is VALID [2022-04-08 11:24:16,527 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-08 11:24:16,527 INFO L290 TraceCheckUtils]: 87: Hoare triple {12717#false} ~cond := #in~cond; {12717#false} is VALID [2022-04-08 11:24:16,527 INFO L290 TraceCheckUtils]: 88: Hoare triple {12717#false} assume 0 == ~cond; {12717#false} is VALID [2022-04-08 11:24:16,527 INFO L290 TraceCheckUtils]: 89: Hoare triple {12717#false} assume !false; {12717#false} is VALID [2022-04-08 11:24:16,527 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-08 11:24:16,527 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 11:24:16,861 INFO L290 TraceCheckUtils]: 89: Hoare triple {12717#false} assume !false; {12717#false} is VALID [2022-04-08 11:24:16,862 INFO L290 TraceCheckUtils]: 88: Hoare triple {12717#false} assume 0 == ~cond; {12717#false} is VALID [2022-04-08 11:24:16,862 INFO L290 TraceCheckUtils]: 87: Hoare triple {12717#false} ~cond := #in~cond; {12717#false} is VALID [2022-04-08 11:24:16,862 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-08 11:24:16,862 INFO L290 TraceCheckUtils]: 85: Hoare triple {12717#false} assume !(#t~post6 < 100);havoc #t~post6; {12717#false} is VALID [2022-04-08 11:24:16,862 INFO L290 TraceCheckUtils]: 84: Hoare triple {12717#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12717#false} is VALID [2022-04-08 11:24:16,862 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-08 11:24:16,862 INFO L290 TraceCheckUtils]: 82: Hoare triple {13015#(< |main_#t~post7| 100)} assume !(#t~post7 < 100);havoc #t~post7; {12717#false} is VALID [2022-04-08 11:24:16,863 INFO L290 TraceCheckUtils]: 81: Hoare triple {13019#(< ~counter~0 100)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {13015#(< |main_#t~post7| 100)} is VALID [2022-04-08 11:24:16,863 INFO L290 TraceCheckUtils]: 80: Hoare triple {13019#(< ~counter~0 100)} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {13019#(< ~counter~0 100)} is VALID [2022-04-08 11:24:16,864 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {12716#true} {13019#(< ~counter~0 100)} #81#return; {13019#(< ~counter~0 100)} is VALID [2022-04-08 11:24:16,864 INFO L290 TraceCheckUtils]: 78: Hoare triple {12716#true} assume true; {12716#true} is VALID [2022-04-08 11:24:16,864 INFO L290 TraceCheckUtils]: 77: Hoare triple {12716#true} assume !(0 == ~cond); {12716#true} is VALID [2022-04-08 11:24:16,864 INFO L290 TraceCheckUtils]: 76: Hoare triple {12716#true} ~cond := #in~cond; {12716#true} is VALID [2022-04-08 11:24:16,864 INFO L272 TraceCheckUtils]: 75: Hoare triple {13019#(< ~counter~0 100)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {12716#true} is VALID [2022-04-08 11:24:16,864 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {12716#true} {13019#(< ~counter~0 100)} #79#return; {13019#(< ~counter~0 100)} is VALID [2022-04-08 11:24:16,864 INFO L290 TraceCheckUtils]: 73: Hoare triple {12716#true} assume true; {12716#true} is VALID [2022-04-08 11:24:16,864 INFO L290 TraceCheckUtils]: 72: Hoare triple {12716#true} assume !(0 == ~cond); {12716#true} is VALID [2022-04-08 11:24:16,865 INFO L290 TraceCheckUtils]: 71: Hoare triple {12716#true} ~cond := #in~cond; {12716#true} is VALID [2022-04-08 11:24:16,865 INFO L272 TraceCheckUtils]: 70: Hoare triple {13019#(< ~counter~0 100)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {12716#true} is VALID [2022-04-08 11:24:16,865 INFO L290 TraceCheckUtils]: 69: Hoare triple {13019#(< ~counter~0 100)} assume !!(#t~post6 < 100);havoc #t~post6; {13019#(< ~counter~0 100)} is VALID [2022-04-08 11:24:16,865 INFO L290 TraceCheckUtils]: 68: Hoare triple {13059#(< ~counter~0 99)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {13019#(< ~counter~0 100)} is VALID [2022-04-08 11:24:16,866 INFO L290 TraceCheckUtils]: 67: Hoare triple {13059#(< ~counter~0 99)} ~r~0 := ~r~0 - ~b~0;~q~0 := ~q~0 + ~a~0; {13059#(< ~counter~0 99)} is VALID [2022-04-08 11:24:16,866 INFO L290 TraceCheckUtils]: 66: Hoare triple {13059#(< ~counter~0 99)} assume !(~r~0 >= 2 * ~b~0); {13059#(< ~counter~0 99)} is VALID [2022-04-08 11:24:16,866 INFO L284 TraceCheckUtils]: 65: Hoare quadruple {12716#true} {13059#(< ~counter~0 99)} #87#return; {13059#(< ~counter~0 99)} is VALID [2022-04-08 11:24:16,866 INFO L290 TraceCheckUtils]: 64: Hoare triple {12716#true} assume true; {12716#true} is VALID [2022-04-08 11:24:16,867 INFO L290 TraceCheckUtils]: 63: Hoare triple {12716#true} assume !(0 == ~cond); {12716#true} is VALID [2022-04-08 11:24:16,867 INFO L290 TraceCheckUtils]: 62: Hoare triple {12716#true} ~cond := #in~cond; {12716#true} is VALID [2022-04-08 11:24:16,867 INFO L272 TraceCheckUtils]: 61: Hoare triple {13059#(< ~counter~0 99)} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {12716#true} is VALID [2022-04-08 11:24:16,867 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {12716#true} {13059#(< ~counter~0 99)} #85#return; {13059#(< ~counter~0 99)} is VALID [2022-04-08 11:24:16,867 INFO L290 TraceCheckUtils]: 59: Hoare triple {12716#true} assume true; {12716#true} is VALID [2022-04-08 11:24:16,867 INFO L290 TraceCheckUtils]: 58: Hoare triple {12716#true} assume !(0 == ~cond); {12716#true} is VALID [2022-04-08 11:24:16,867 INFO L290 TraceCheckUtils]: 57: Hoare triple {12716#true} ~cond := #in~cond; {12716#true} is VALID [2022-04-08 11:24:16,867 INFO L272 TraceCheckUtils]: 56: Hoare triple {13059#(< ~counter~0 99)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {12716#true} is VALID [2022-04-08 11:24:16,868 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {12716#true} {13059#(< ~counter~0 99)} #83#return; {13059#(< ~counter~0 99)} is VALID [2022-04-08 11:24:16,868 INFO L290 TraceCheckUtils]: 54: Hoare triple {12716#true} assume true; {12716#true} is VALID [2022-04-08 11:24:16,868 INFO L290 TraceCheckUtils]: 53: Hoare triple {12716#true} assume !(0 == ~cond); {12716#true} is VALID [2022-04-08 11:24:16,868 INFO L290 TraceCheckUtils]: 52: Hoare triple {12716#true} ~cond := #in~cond; {12716#true} is VALID [2022-04-08 11:24:16,868 INFO L272 TraceCheckUtils]: 51: Hoare triple {13059#(< ~counter~0 99)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {12716#true} is VALID [2022-04-08 11:24:16,868 INFO L290 TraceCheckUtils]: 50: Hoare triple {13059#(< ~counter~0 99)} assume !!(#t~post7 < 100);havoc #t~post7; {13059#(< ~counter~0 99)} is VALID [2022-04-08 11:24:16,869 INFO L290 TraceCheckUtils]: 49: Hoare triple {13117#(< ~counter~0 98)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {13059#(< ~counter~0 99)} is VALID [2022-04-08 11:24:16,869 INFO L290 TraceCheckUtils]: 48: Hoare triple {13117#(< ~counter~0 98)} ~a~0 := 2 * ~a~0;~b~0 := 2 * ~b~0; {13117#(< ~counter~0 98)} is VALID [2022-04-08 11:24:16,870 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {12716#true} {13117#(< ~counter~0 98)} #89#return; {13117#(< ~counter~0 98)} is VALID [2022-04-08 11:24:16,870 INFO L290 TraceCheckUtils]: 46: Hoare triple {12716#true} assume true; {12716#true} is VALID [2022-04-08 11:24:16,870 INFO L290 TraceCheckUtils]: 45: Hoare triple {12716#true} assume !(0 == ~cond); {12716#true} is VALID [2022-04-08 11:24:16,870 INFO L290 TraceCheckUtils]: 44: Hoare triple {12716#true} ~cond := #in~cond; {12716#true} is VALID [2022-04-08 11:24:16,870 INFO L272 TraceCheckUtils]: 43: Hoare triple {13117#(< ~counter~0 98)} call __VERIFIER_assert((if ~r~0 >= 2 * ~y~0 * ~a~0 then 1 else 0)); {12716#true} is VALID [2022-04-08 11:24:16,870 INFO L290 TraceCheckUtils]: 42: Hoare triple {13117#(< ~counter~0 98)} assume !!(~r~0 >= 2 * ~b~0); {13117#(< ~counter~0 98)} is VALID [2022-04-08 11:24:16,871 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {12716#true} {13117#(< ~counter~0 98)} #87#return; {13117#(< ~counter~0 98)} is VALID [2022-04-08 11:24:16,871 INFO L290 TraceCheckUtils]: 40: Hoare triple {12716#true} assume true; {12716#true} is VALID [2022-04-08 11:24:16,871 INFO L290 TraceCheckUtils]: 39: Hoare triple {12716#true} assume !(0 == ~cond); {12716#true} is VALID [2022-04-08 11:24:16,871 INFO L290 TraceCheckUtils]: 38: Hoare triple {12716#true} ~cond := #in~cond; {12716#true} is VALID [2022-04-08 11:24:16,871 INFO L272 TraceCheckUtils]: 37: Hoare triple {13117#(< ~counter~0 98)} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {12716#true} is VALID [2022-04-08 11:24:16,871 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {12716#true} {13117#(< ~counter~0 98)} #85#return; {13117#(< ~counter~0 98)} is VALID [2022-04-08 11:24:16,871 INFO L290 TraceCheckUtils]: 35: Hoare triple {12716#true} assume true; {12716#true} is VALID [2022-04-08 11:24:16,872 INFO L290 TraceCheckUtils]: 34: Hoare triple {12716#true} assume !(0 == ~cond); {12716#true} is VALID [2022-04-08 11:24:16,872 INFO L290 TraceCheckUtils]: 33: Hoare triple {12716#true} ~cond := #in~cond; {12716#true} is VALID [2022-04-08 11:24:16,872 INFO L272 TraceCheckUtils]: 32: Hoare triple {13117#(< ~counter~0 98)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {12716#true} is VALID [2022-04-08 11:24:16,872 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {12716#true} {13117#(< ~counter~0 98)} #83#return; {13117#(< ~counter~0 98)} is VALID [2022-04-08 11:24:16,872 INFO L290 TraceCheckUtils]: 30: Hoare triple {12716#true} assume true; {12716#true} is VALID [2022-04-08 11:24:16,872 INFO L290 TraceCheckUtils]: 29: Hoare triple {12716#true} assume !(0 == ~cond); {12716#true} is VALID [2022-04-08 11:24:16,872 INFO L290 TraceCheckUtils]: 28: Hoare triple {12716#true} ~cond := #in~cond; {12716#true} is VALID [2022-04-08 11:24:16,872 INFO L272 TraceCheckUtils]: 27: Hoare triple {13117#(< ~counter~0 98)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {12716#true} is VALID [2022-04-08 11:24:16,873 INFO L290 TraceCheckUtils]: 26: Hoare triple {13117#(< ~counter~0 98)} assume !!(#t~post7 < 100);havoc #t~post7; {13117#(< ~counter~0 98)} is VALID [2022-04-08 11:24:16,873 INFO L290 TraceCheckUtils]: 25: Hoare triple {13190#(< ~counter~0 97)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {13117#(< ~counter~0 98)} is VALID [2022-04-08 11:24:16,873 INFO L290 TraceCheckUtils]: 24: Hoare triple {13190#(< ~counter~0 97)} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {13190#(< ~counter~0 97)} is VALID [2022-04-08 11:24:16,874 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {12716#true} {13190#(< ~counter~0 97)} #81#return; {13190#(< ~counter~0 97)} is VALID [2022-04-08 11:24:16,874 INFO L290 TraceCheckUtils]: 22: Hoare triple {12716#true} assume true; {12716#true} is VALID [2022-04-08 11:24:16,874 INFO L290 TraceCheckUtils]: 21: Hoare triple {12716#true} assume !(0 == ~cond); {12716#true} is VALID [2022-04-08 11:24:16,874 INFO L290 TraceCheckUtils]: 20: Hoare triple {12716#true} ~cond := #in~cond; {12716#true} is VALID [2022-04-08 11:24:16,874 INFO L272 TraceCheckUtils]: 19: Hoare triple {13190#(< ~counter~0 97)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {12716#true} is VALID [2022-04-08 11:24:16,875 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {12716#true} {13190#(< ~counter~0 97)} #79#return; {13190#(< ~counter~0 97)} is VALID [2022-04-08 11:24:16,875 INFO L290 TraceCheckUtils]: 17: Hoare triple {12716#true} assume true; {12716#true} is VALID [2022-04-08 11:24:16,875 INFO L290 TraceCheckUtils]: 16: Hoare triple {12716#true} assume !(0 == ~cond); {12716#true} is VALID [2022-04-08 11:24:16,875 INFO L290 TraceCheckUtils]: 15: Hoare triple {12716#true} ~cond := #in~cond; {12716#true} is VALID [2022-04-08 11:24:16,875 INFO L272 TraceCheckUtils]: 14: Hoare triple {13190#(< ~counter~0 97)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {12716#true} is VALID [2022-04-08 11:24:16,875 INFO L290 TraceCheckUtils]: 13: Hoare triple {13190#(< ~counter~0 97)} assume !!(#t~post6 < 100);havoc #t~post6; {13190#(< ~counter~0 97)} is VALID [2022-04-08 11:24:16,876 INFO L290 TraceCheckUtils]: 12: Hoare triple {13230#(< ~counter~0 96)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {13190#(< ~counter~0 97)} is VALID [2022-04-08 11:24:16,876 INFO L290 TraceCheckUtils]: 11: Hoare triple {13230#(< ~counter~0 96)} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {13230#(< ~counter~0 96)} is VALID [2022-04-08 11:24:16,876 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {12716#true} {13230#(< ~counter~0 96)} #77#return; {13230#(< ~counter~0 96)} is VALID [2022-04-08 11:24:16,876 INFO L290 TraceCheckUtils]: 9: Hoare triple {12716#true} assume true; {12716#true} is VALID [2022-04-08 11:24:16,876 INFO L290 TraceCheckUtils]: 8: Hoare triple {12716#true} assume !(0 == ~cond); {12716#true} is VALID [2022-04-08 11:24:16,877 INFO L290 TraceCheckUtils]: 7: Hoare triple {12716#true} ~cond := #in~cond; {12716#true} is VALID [2022-04-08 11:24:16,877 INFO L272 TraceCheckUtils]: 6: Hoare triple {13230#(< ~counter~0 96)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {12716#true} is VALID [2022-04-08 11:24:16,877 INFO L290 TraceCheckUtils]: 5: Hoare triple {13230#(< ~counter~0 96)} 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 96)} is VALID [2022-04-08 11:24:16,886 INFO L272 TraceCheckUtils]: 4: Hoare triple {13230#(< ~counter~0 96)} call #t~ret8 := main(); {13230#(< ~counter~0 96)} is VALID [2022-04-08 11:24:16,887 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13230#(< ~counter~0 96)} {12716#true} #93#return; {13230#(< ~counter~0 96)} is VALID [2022-04-08 11:24:16,887 INFO L290 TraceCheckUtils]: 2: Hoare triple {13230#(< ~counter~0 96)} assume true; {13230#(< ~counter~0 96)} is VALID [2022-04-08 11:24:16,888 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 96)} is VALID [2022-04-08 11:24:16,888 INFO L272 TraceCheckUtils]: 0: Hoare triple {12716#true} call ULTIMATE.init(); {12716#true} is VALID [2022-04-08 11:24:16,888 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-08 11:24:16,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:24:16,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296862945] [2022-04-08 11:24:16,888 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:24:16,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [756194981] [2022-04-08 11:24:16,888 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [756194981] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 11:24:16,889 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 11:24:16,889 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-04-08 11:24:16,889 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:24:16,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1254394329] [2022-04-08 11:24:16,889 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1254394329] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:24:16,889 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:24:16,889 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 11:24:16,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580214399] [2022-04-08 11:24:16,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:24:16,890 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-08 11:24:16,890 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:24:16,890 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-08 11:24:16,960 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-08 11:24:16,960 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 11:24:16,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:24:16,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 11:24:16,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-08 11:24:16,961 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-08 11:24:17,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:24:17,541 INFO L93 Difference]: Finished difference Result 269 states and 336 transitions. [2022-04-08 11:24:17,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-08 11:24:17,542 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-08 11:24:17,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:24:17,542 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-08 11:24:17,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 143 transitions. [2022-04-08 11:24:17,545 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-08 11:24:17,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 143 transitions. [2022-04-08 11:24:17,546 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 143 transitions. [2022-04-08 11:24:17,650 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-08 11:24:17,653 INFO L225 Difference]: With dead ends: 269 [2022-04-08 11:24:17,653 INFO L226 Difference]: Without dead ends: 196 [2022-04-08 11:24:17,654 INFO L912 BasicCegarLoop]: 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-08 11:24:17,654 INFO L913 BasicCegarLoop]: 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-08 11:24:17,654 INFO L914 BasicCegarLoop]: 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-08 11:24:17,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2022-04-08 11:24:17,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 196. [2022-04-08 11:24:17,912 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:24:17,912 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-08 11:24:17,912 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-08 11:24:17,913 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-08 11:24:17,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:24:17,916 INFO L93 Difference]: Finished difference Result 196 states and 232 transitions. [2022-04-08 11:24:17,917 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 232 transitions. [2022-04-08 11:24:17,917 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:24:17,917 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:24:17,917 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-08 11:24:17,917 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-08 11:24:17,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:24:17,921 INFO L93 Difference]: Finished difference Result 196 states and 232 transitions. [2022-04-08 11:24:17,921 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 232 transitions. [2022-04-08 11:24:17,921 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:24:17,922 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:24:17,922 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:24:17,922 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:24:17,922 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-08 11:24:17,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 232 transitions. [2022-04-08 11:24:17,925 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 232 transitions. Word has length 90 [2022-04-08 11:24:17,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:24:17,926 INFO L478 AbstractCegarLoop]: Abstraction has 196 states and 232 transitions. [2022-04-08 11:24:17,926 INFO L479 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-08 11:24:17,926 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 196 states and 232 transitions. [2022-04-08 11:24:18,184 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-08 11:24:18,184 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 232 transitions. [2022-04-08 11:24:18,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-04-08 11:24:18,185 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:24:18,186 INFO L499 BasicCegarLoop]: 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-08 11:24:18,202 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2022-04-08 11:24:18,402 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-04-08 11:24:18,403 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:24:18,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:24:18,403 INFO L85 PathProgramCache]: Analyzing trace with hash 447330249, now seen corresponding path program 3 times [2022-04-08 11:24:18,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:24:18,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [512658373] [2022-04-08 11:24:46,360 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 11:24:46,360 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 11:24:46,361 INFO L85 PathProgramCache]: Analyzing trace with hash 447330249, now seen corresponding path program 4 times [2022-04-08 11:24:46,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:24:46,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985251973] [2022-04-08 11:24:46,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:24:46,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:24:46,371 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:24:46,371 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [279753302] [2022-04-08 11:24:46,371 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 11:24:46,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:24:46,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:24:46,372 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-08 11:24:46,373 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-08 11:24:46,441 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 11:24:46,441 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:24:46,442 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-08 11:24:46,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:24:46,465 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:24:48,146 INFO L272 TraceCheckUtils]: 0: Hoare triple {14597#true} call ULTIMATE.init(); {14597#true} is VALID [2022-04-08 11:24:48,146 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-08 11:24:48,146 INFO L290 TraceCheckUtils]: 2: Hoare triple {14597#true} assume true; {14597#true} is VALID [2022-04-08 11:24:48,146 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14597#true} {14597#true} #93#return; {14597#true} is VALID [2022-04-08 11:24:48,146 INFO L272 TraceCheckUtils]: 4: Hoare triple {14597#true} call #t~ret8 := main(); {14597#true} is VALID [2022-04-08 11:24:48,147 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-08 11:24:48,147 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-08 11:24:48,147 INFO L290 TraceCheckUtils]: 7: Hoare triple {14597#true} ~cond := #in~cond; {14597#true} is VALID [2022-04-08 11:24:48,147 INFO L290 TraceCheckUtils]: 8: Hoare triple {14597#true} assume !(0 == ~cond); {14597#true} is VALID [2022-04-08 11:24:48,147 INFO L290 TraceCheckUtils]: 9: Hoare triple {14597#true} assume true; {14597#true} is VALID [2022-04-08 11:24:48,147 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {14597#true} {14597#true} #77#return; {14597#true} is VALID [2022-04-08 11:24:48,147 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-08 11:24:48,148 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-08 11:24:48,148 INFO L290 TraceCheckUtils]: 13: Hoare triple {14635#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} assume !!(#t~post6 < 100);havoc #t~post6; {14635#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 11:24:48,148 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-08 11:24:48,148 INFO L290 TraceCheckUtils]: 15: Hoare triple {14597#true} ~cond := #in~cond; {14597#true} is VALID [2022-04-08 11:24:48,148 INFO L290 TraceCheckUtils]: 16: Hoare triple {14597#true} assume !(0 == ~cond); {14597#true} is VALID [2022-04-08 11:24:48,148 INFO L290 TraceCheckUtils]: 17: Hoare triple {14597#true} assume true; {14597#true} is VALID [2022-04-08 11:24:48,149 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-08 11:24:48,149 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-08 11:24:48,149 INFO L290 TraceCheckUtils]: 20: Hoare triple {14597#true} ~cond := #in~cond; {14597#true} is VALID [2022-04-08 11:24:48,149 INFO L290 TraceCheckUtils]: 21: Hoare triple {14597#true} assume !(0 == ~cond); {14597#true} is VALID [2022-04-08 11:24:48,149 INFO L290 TraceCheckUtils]: 22: Hoare triple {14597#true} assume true; {14597#true} is VALID [2022-04-08 11:24:48,150 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-08 11:24:48,150 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-08 11:24:48,150 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-08 11:24:48,151 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 < 100);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-08 11:24:48,151 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-08 11:24:48,151 INFO L290 TraceCheckUtils]: 28: Hoare triple {14597#true} ~cond := #in~cond; {14597#true} is VALID [2022-04-08 11:24:48,151 INFO L290 TraceCheckUtils]: 29: Hoare triple {14597#true} assume !(0 == ~cond); {14597#true} is VALID [2022-04-08 11:24:48,151 INFO L290 TraceCheckUtils]: 30: Hoare triple {14597#true} assume true; {14597#true} is VALID [2022-04-08 11:24:48,152 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-08 11:24:48,152 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-08 11:24:48,152 INFO L290 TraceCheckUtils]: 33: Hoare triple {14597#true} ~cond := #in~cond; {14597#true} is VALID [2022-04-08 11:24:48,152 INFO L290 TraceCheckUtils]: 34: Hoare triple {14597#true} assume !(0 == ~cond); {14597#true} is VALID [2022-04-08 11:24:48,152 INFO L290 TraceCheckUtils]: 35: Hoare triple {14597#true} assume true; {14597#true} is VALID [2022-04-08 11:24:48,152 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-08 11:24:48,153 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-08 11:24:48,153 INFO L290 TraceCheckUtils]: 38: Hoare triple {14597#true} ~cond := #in~cond; {14597#true} is VALID [2022-04-08 11:24:48,153 INFO L290 TraceCheckUtils]: 39: Hoare triple {14597#true} assume !(0 == ~cond); {14597#true} is VALID [2022-04-08 11:24:48,153 INFO L290 TraceCheckUtils]: 40: Hoare triple {14597#true} assume true; {14597#true} is VALID [2022-04-08 11:24:48,153 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-08 11:24:48,154 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-08 11:24:48,154 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-08 11:24:48,154 INFO L290 TraceCheckUtils]: 44: Hoare triple {14597#true} ~cond := #in~cond; {14597#true} is VALID [2022-04-08 11:24:48,154 INFO L290 TraceCheckUtils]: 45: Hoare triple {14597#true} assume !(0 == ~cond); {14597#true} is VALID [2022-04-08 11:24:48,154 INFO L290 TraceCheckUtils]: 46: Hoare triple {14597#true} assume true; {14597#true} is VALID [2022-04-08 11:24:48,155 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-08 11:24:48,155 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-08 11:24:48,156 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-08 11:24:48,156 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 < 100);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-08 11:24:48,156 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-08 11:24:48,156 INFO L290 TraceCheckUtils]: 52: Hoare triple {14597#true} ~cond := #in~cond; {14597#true} is VALID [2022-04-08 11:24:48,156 INFO L290 TraceCheckUtils]: 53: Hoare triple {14597#true} assume !(0 == ~cond); {14597#true} is VALID [2022-04-08 11:24:48,157 INFO L290 TraceCheckUtils]: 54: Hoare triple {14597#true} assume true; {14597#true} is VALID [2022-04-08 11:24:48,157 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-08 11:24:48,157 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-08 11:24:48,157 INFO L290 TraceCheckUtils]: 57: Hoare triple {14597#true} ~cond := #in~cond; {14597#true} is VALID [2022-04-08 11:24:48,157 INFO L290 TraceCheckUtils]: 58: Hoare triple {14597#true} assume !(0 == ~cond); {14597#true} is VALID [2022-04-08 11:24:48,157 INFO L290 TraceCheckUtils]: 59: Hoare triple {14597#true} assume true; {14597#true} is VALID [2022-04-08 11:24:48,158 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-08 11:24:48,158 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-08 11:24:48,158 INFO L290 TraceCheckUtils]: 62: Hoare triple {14597#true} ~cond := #in~cond; {14597#true} is VALID [2022-04-08 11:24:48,158 INFO L290 TraceCheckUtils]: 63: Hoare triple {14597#true} assume !(0 == ~cond); {14597#true} is VALID [2022-04-08 11:24:48,158 INFO L290 TraceCheckUtils]: 64: Hoare triple {14597#true} assume true; {14597#true} is VALID [2022-04-08 11:24:48,159 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-08 11:24:48,159 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-08 11:24:48,160 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-08 11:24:48,161 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-08 11:24:48,161 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 < 100);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-08 11:24:48,161 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-08 11:24:48,161 INFO L290 TraceCheckUtils]: 71: Hoare triple {14597#true} ~cond := #in~cond; {14597#true} is VALID [2022-04-08 11:24:48,161 INFO L290 TraceCheckUtils]: 72: Hoare triple {14597#true} assume !(0 == ~cond); {14597#true} is VALID [2022-04-08 11:24:48,161 INFO L290 TraceCheckUtils]: 73: Hoare triple {14597#true} assume true; {14597#true} is VALID [2022-04-08 11:24:48,162 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-08 11:24:48,162 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-08 11:24:48,162 INFO L290 TraceCheckUtils]: 76: Hoare triple {14597#true} ~cond := #in~cond; {14597#true} is VALID [2022-04-08 11:24:48,162 INFO L290 TraceCheckUtils]: 77: Hoare triple {14597#true} assume !(0 == ~cond); {14597#true} is VALID [2022-04-08 11:24:48,162 INFO L290 TraceCheckUtils]: 78: Hoare triple {14597#true} assume true; {14597#true} is VALID [2022-04-08 11:24:48,163 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-08 11:24:48,163 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-08 11:24:48,164 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-08 11:24:48,164 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 < 100);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-08 11:24:48,164 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-08 11:24:48,164 INFO L290 TraceCheckUtils]: 84: Hoare triple {14597#true} ~cond := #in~cond; {14597#true} is VALID [2022-04-08 11:24:48,164 INFO L290 TraceCheckUtils]: 85: Hoare triple {14597#true} assume !(0 == ~cond); {14597#true} is VALID [2022-04-08 11:24:48,164 INFO L290 TraceCheckUtils]: 86: Hoare triple {14597#true} assume true; {14597#true} is VALID [2022-04-08 11:24:48,165 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-08 11:24:48,175 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-08 11:24:48,175 INFO L290 TraceCheckUtils]: 89: Hoare triple {14597#true} ~cond := #in~cond; {14875#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:24:48,176 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-08 11:24:48,176 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-08 11:24:48,177 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-08 11:24:48,177 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-08 11:24:48,177 INFO L290 TraceCheckUtils]: 94: Hoare triple {14597#true} ~cond := #in~cond; {14597#true} is VALID [2022-04-08 11:24:48,177 INFO L290 TraceCheckUtils]: 95: Hoare triple {14597#true} assume !(0 == ~cond); {14597#true} is VALID [2022-04-08 11:24:48,177 INFO L290 TraceCheckUtils]: 96: Hoare triple {14597#true} assume true; {14597#true} is VALID [2022-04-08 11:24:48,178 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-08 11:24:48,178 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-08 11:24:48,180 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-08 11:24:48,180 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-08 11:24:48,181 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 < 100);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-08 11:24:48,182 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-08 11:24:48,182 INFO L290 TraceCheckUtils]: 103: Hoare triple {14918#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {14922#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:24:48,182 INFO L290 TraceCheckUtils]: 104: Hoare triple {14922#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {14598#false} is VALID [2022-04-08 11:24:48,182 INFO L290 TraceCheckUtils]: 105: Hoare triple {14598#false} assume !false; {14598#false} is VALID [2022-04-08 11:24:48,183 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-08 11:24:48,183 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 11:25:02,996 INFO L290 TraceCheckUtils]: 105: Hoare triple {14598#false} assume !false; {14598#false} is VALID [2022-04-08 11:25:02,996 INFO L290 TraceCheckUtils]: 104: Hoare triple {14922#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {14598#false} is VALID [2022-04-08 11:25:02,997 INFO L290 TraceCheckUtils]: 103: Hoare triple {14918#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {14922#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:25:02,997 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-08 11:25:02,997 INFO L290 TraceCheckUtils]: 101: Hoare triple {14938#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} assume !(#t~post6 < 100);havoc #t~post6; {14938#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-08 11:25:02,998 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-08 11:25:03,024 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-08 11:25:03,024 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-08 11:25:03,025 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-08 11:25:03,025 INFO L290 TraceCheckUtils]: 96: Hoare triple {14597#true} assume true; {14597#true} is VALID [2022-04-08 11:25:03,025 INFO L290 TraceCheckUtils]: 95: Hoare triple {14597#true} assume !(0 == ~cond); {14597#true} is VALID [2022-04-08 11:25:03,025 INFO L290 TraceCheckUtils]: 94: Hoare triple {14597#true} ~cond := #in~cond; {14597#true} is VALID [2022-04-08 11:25:03,025 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-08 11:25:03,026 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-08 11:25:03,026 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-08 11:25:03,027 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-08 11:25:03,027 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-08 11:25:03,027 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-08 11:25:03,028 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-08 11:25:03,028 INFO L290 TraceCheckUtils]: 86: Hoare triple {14597#true} assume true; {14597#true} is VALID [2022-04-08 11:25:03,028 INFO L290 TraceCheckUtils]: 85: Hoare triple {14597#true} assume !(0 == ~cond); {14597#true} is VALID [2022-04-08 11:25:03,028 INFO L290 TraceCheckUtils]: 84: Hoare triple {14597#true} ~cond := #in~cond; {14597#true} is VALID [2022-04-08 11:25:03,028 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-08 11:25:03,028 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 < 100);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-08 11:25:03,029 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-08 11:25:03,029 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-08 11:25:03,029 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {14597#true} {14597#true} #81#return; {14597#true} is VALID [2022-04-08 11:25:03,029 INFO L290 TraceCheckUtils]: 78: Hoare triple {14597#true} assume true; {14597#true} is VALID [2022-04-08 11:25:03,029 INFO L290 TraceCheckUtils]: 77: Hoare triple {14597#true} assume !(0 == ~cond); {14597#true} is VALID [2022-04-08 11:25:03,029 INFO L290 TraceCheckUtils]: 76: Hoare triple {14597#true} ~cond := #in~cond; {14597#true} is VALID [2022-04-08 11:25:03,029 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-08 11:25:03,030 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {14597#true} {14597#true} #79#return; {14597#true} is VALID [2022-04-08 11:25:03,030 INFO L290 TraceCheckUtils]: 73: Hoare triple {14597#true} assume true; {14597#true} is VALID [2022-04-08 11:25:03,030 INFO L290 TraceCheckUtils]: 72: Hoare triple {14597#true} assume !(0 == ~cond); {14597#true} is VALID [2022-04-08 11:25:03,030 INFO L290 TraceCheckUtils]: 71: Hoare triple {14597#true} ~cond := #in~cond; {14597#true} is VALID [2022-04-08 11:25:03,030 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-08 11:25:03,030 INFO L290 TraceCheckUtils]: 69: Hoare triple {14597#true} assume !!(#t~post6 < 100);havoc #t~post6; {14597#true} is VALID [2022-04-08 11:25:03,030 INFO L290 TraceCheckUtils]: 68: Hoare triple {14597#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {14597#true} is VALID [2022-04-08 11:25:03,030 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-08 11:25:03,030 INFO L290 TraceCheckUtils]: 66: Hoare triple {14597#true} assume !(~r~0 >= 2 * ~b~0); {14597#true} is VALID [2022-04-08 11:25:03,030 INFO L284 TraceCheckUtils]: 65: Hoare quadruple {14597#true} {14597#true} #87#return; {14597#true} is VALID [2022-04-08 11:25:03,030 INFO L290 TraceCheckUtils]: 64: Hoare triple {14597#true} assume true; {14597#true} is VALID [2022-04-08 11:25:03,030 INFO L290 TraceCheckUtils]: 63: Hoare triple {14597#true} assume !(0 == ~cond); {14597#true} is VALID [2022-04-08 11:25:03,030 INFO L290 TraceCheckUtils]: 62: Hoare triple {14597#true} ~cond := #in~cond; {14597#true} is VALID [2022-04-08 11:25:03,030 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-08 11:25:03,031 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {14597#true} {14597#true} #85#return; {14597#true} is VALID [2022-04-08 11:25:03,031 INFO L290 TraceCheckUtils]: 59: Hoare triple {14597#true} assume true; {14597#true} is VALID [2022-04-08 11:25:03,031 INFO L290 TraceCheckUtils]: 58: Hoare triple {14597#true} assume !(0 == ~cond); {14597#true} is VALID [2022-04-08 11:25:03,031 INFO L290 TraceCheckUtils]: 57: Hoare triple {14597#true} ~cond := #in~cond; {14597#true} is VALID [2022-04-08 11:25:03,031 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-08 11:25:03,031 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {14597#true} {14597#true} #83#return; {14597#true} is VALID [2022-04-08 11:25:03,031 INFO L290 TraceCheckUtils]: 54: Hoare triple {14597#true} assume true; {14597#true} is VALID [2022-04-08 11:25:03,031 INFO L290 TraceCheckUtils]: 53: Hoare triple {14597#true} assume !(0 == ~cond); {14597#true} is VALID [2022-04-08 11:25:03,031 INFO L290 TraceCheckUtils]: 52: Hoare triple {14597#true} ~cond := #in~cond; {14597#true} is VALID [2022-04-08 11:25:03,031 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-08 11:25:03,031 INFO L290 TraceCheckUtils]: 50: Hoare triple {14597#true} assume !!(#t~post7 < 100);havoc #t~post7; {14597#true} is VALID [2022-04-08 11:25:03,031 INFO L290 TraceCheckUtils]: 49: Hoare triple {14597#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {14597#true} is VALID [2022-04-08 11:25:03,031 INFO L290 TraceCheckUtils]: 48: Hoare triple {14597#true} ~a~0 := 2 * ~a~0;~b~0 := 2 * ~b~0; {14597#true} is VALID [2022-04-08 11:25:03,032 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {14597#true} {14597#true} #89#return; {14597#true} is VALID [2022-04-08 11:25:03,032 INFO L290 TraceCheckUtils]: 46: Hoare triple {14597#true} assume true; {14597#true} is VALID [2022-04-08 11:25:03,032 INFO L290 TraceCheckUtils]: 45: Hoare triple {14597#true} assume !(0 == ~cond); {14597#true} is VALID [2022-04-08 11:25:03,032 INFO L290 TraceCheckUtils]: 44: Hoare triple {14597#true} ~cond := #in~cond; {14597#true} is VALID [2022-04-08 11:25:03,032 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-08 11:25:03,032 INFO L290 TraceCheckUtils]: 42: Hoare triple {14597#true} assume !!(~r~0 >= 2 * ~b~0); {14597#true} is VALID [2022-04-08 11:25:03,032 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {14597#true} {14597#true} #87#return; {14597#true} is VALID [2022-04-08 11:25:03,032 INFO L290 TraceCheckUtils]: 40: Hoare triple {14597#true} assume true; {14597#true} is VALID [2022-04-08 11:25:03,032 INFO L290 TraceCheckUtils]: 39: Hoare triple {14597#true} assume !(0 == ~cond); {14597#true} is VALID [2022-04-08 11:25:03,032 INFO L290 TraceCheckUtils]: 38: Hoare triple {14597#true} ~cond := #in~cond; {14597#true} is VALID [2022-04-08 11:25:03,032 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-08 11:25:03,032 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {14597#true} {14597#true} #85#return; {14597#true} is VALID [2022-04-08 11:25:03,032 INFO L290 TraceCheckUtils]: 35: Hoare triple {14597#true} assume true; {14597#true} is VALID [2022-04-08 11:25:03,032 INFO L290 TraceCheckUtils]: 34: Hoare triple {14597#true} assume !(0 == ~cond); {14597#true} is VALID [2022-04-08 11:25:03,033 INFO L290 TraceCheckUtils]: 33: Hoare triple {14597#true} ~cond := #in~cond; {14597#true} is VALID [2022-04-08 11:25:03,033 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-08 11:25:03,033 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {14597#true} {14597#true} #83#return; {14597#true} is VALID [2022-04-08 11:25:03,033 INFO L290 TraceCheckUtils]: 30: Hoare triple {14597#true} assume true; {14597#true} is VALID [2022-04-08 11:25:03,033 INFO L290 TraceCheckUtils]: 29: Hoare triple {14597#true} assume !(0 == ~cond); {14597#true} is VALID [2022-04-08 11:25:03,033 INFO L290 TraceCheckUtils]: 28: Hoare triple {14597#true} ~cond := #in~cond; {14597#true} is VALID [2022-04-08 11:25:03,033 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-08 11:25:03,033 INFO L290 TraceCheckUtils]: 26: Hoare triple {14597#true} assume !!(#t~post7 < 100);havoc #t~post7; {14597#true} is VALID [2022-04-08 11:25:03,033 INFO L290 TraceCheckUtils]: 25: Hoare triple {14597#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {14597#true} is VALID [2022-04-08 11:25:03,033 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-08 11:25:03,033 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {14597#true} {14597#true} #81#return; {14597#true} is VALID [2022-04-08 11:25:03,033 INFO L290 TraceCheckUtils]: 22: Hoare triple {14597#true} assume true; {14597#true} is VALID [2022-04-08 11:25:03,033 INFO L290 TraceCheckUtils]: 21: Hoare triple {14597#true} assume !(0 == ~cond); {14597#true} is VALID [2022-04-08 11:25:03,033 INFO L290 TraceCheckUtils]: 20: Hoare triple {14597#true} ~cond := #in~cond; {14597#true} is VALID [2022-04-08 11:25:03,034 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-08 11:25:03,034 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {14597#true} {14597#true} #79#return; {14597#true} is VALID [2022-04-08 11:25:03,034 INFO L290 TraceCheckUtils]: 17: Hoare triple {14597#true} assume true; {14597#true} is VALID [2022-04-08 11:25:03,034 INFO L290 TraceCheckUtils]: 16: Hoare triple {14597#true} assume !(0 == ~cond); {14597#true} is VALID [2022-04-08 11:25:03,034 INFO L290 TraceCheckUtils]: 15: Hoare triple {14597#true} ~cond := #in~cond; {14597#true} is VALID [2022-04-08 11:25:03,034 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-08 11:25:03,034 INFO L290 TraceCheckUtils]: 13: Hoare triple {14597#true} assume !!(#t~post6 < 100);havoc #t~post6; {14597#true} is VALID [2022-04-08 11:25:03,034 INFO L290 TraceCheckUtils]: 12: Hoare triple {14597#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {14597#true} is VALID [2022-04-08 11:25:03,034 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-08 11:25:03,034 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {14597#true} {14597#true} #77#return; {14597#true} is VALID [2022-04-08 11:25:03,034 INFO L290 TraceCheckUtils]: 9: Hoare triple {14597#true} assume true; {14597#true} is VALID [2022-04-08 11:25:03,034 INFO L290 TraceCheckUtils]: 8: Hoare triple {14597#true} assume !(0 == ~cond); {14597#true} is VALID [2022-04-08 11:25:03,034 INFO L290 TraceCheckUtils]: 7: Hoare triple {14597#true} ~cond := #in~cond; {14597#true} is VALID [2022-04-08 11:25:03,034 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-08 11:25:03,035 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-08 11:25:03,035 INFO L272 TraceCheckUtils]: 4: Hoare triple {14597#true} call #t~ret8 := main(); {14597#true} is VALID [2022-04-08 11:25:03,035 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14597#true} {14597#true} #93#return; {14597#true} is VALID [2022-04-08 11:25:03,035 INFO L290 TraceCheckUtils]: 2: Hoare triple {14597#true} assume true; {14597#true} is VALID [2022-04-08 11:25:03,035 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-08 11:25:03,035 INFO L272 TraceCheckUtils]: 0: Hoare triple {14597#true} call ULTIMATE.init(); {14597#true} is VALID [2022-04-08 11:25:03,035 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-08 11:25:03,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:25:03,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985251973] [2022-04-08 11:25:03,035 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:25:03,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [279753302] [2022-04-08 11:25:03,036 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [279753302] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 11:25:03,036 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 11:25:03,036 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9] total 18 [2022-04-08 11:25:03,036 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:25:03,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [512658373] [2022-04-08 11:25:03,036 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [512658373] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:25:03,036 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:25:03,036 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-08 11:25:03,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434023971] [2022-04-08 11:25:03,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:25:03,037 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-08 11:25:03,037 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:25:03,037 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-08 11:25:03,095 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-08 11:25:03,096 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-08 11:25:03,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:25:03,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-08 11:25:03,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2022-04-08 11:25:03,096 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-08 11:25:06,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:25:06,170 INFO L93 Difference]: Finished difference Result 281 states and 343 transitions. [2022-04-08 11:25:06,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-08 11:25:06,170 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-08 11:25:06,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:25:06,170 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-08 11:25:06,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 151 transitions. [2022-04-08 11:25:06,172 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-08 11:25:06,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 151 transitions. [2022-04-08 11:25:06,174 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 151 transitions. [2022-04-08 11:25:06,314 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-08 11:25:06,317 INFO L225 Difference]: With dead ends: 281 [2022-04-08 11:25:06,317 INFO L226 Difference]: Without dead ends: 185 [2022-04-08 11:25:06,318 INFO L912 BasicCegarLoop]: 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-08 11:25:06,318 INFO L913 BasicCegarLoop]: 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-08 11:25:06,318 INFO L914 BasicCegarLoop]: 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-08 11:25:06,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2022-04-08 11:25:06,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 184. [2022-04-08 11:25:06,534 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:25:06,534 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-08 11:25:06,535 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-08 11:25:06,535 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-08 11:25:06,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:25:06,538 INFO L93 Difference]: Finished difference Result 185 states and 219 transitions. [2022-04-08 11:25:06,538 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 219 transitions. [2022-04-08 11:25:06,538 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:25:06,538 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:25:06,539 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-08 11:25:06,539 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-08 11:25:06,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:25:06,542 INFO L93 Difference]: Finished difference Result 185 states and 219 transitions. [2022-04-08 11:25:06,542 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 219 transitions. [2022-04-08 11:25:06,542 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:25:06,542 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:25:06,542 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:25:06,542 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:25:06,542 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-08 11:25:06,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 218 transitions. [2022-04-08 11:25:06,545 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 218 transitions. Word has length 106 [2022-04-08 11:25:06,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:25:06,546 INFO L478 AbstractCegarLoop]: Abstraction has 184 states and 218 transitions. [2022-04-08 11:25:06,546 INFO L479 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-08 11:25:06,546 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 184 states and 218 transitions. [2022-04-08 11:25:06,839 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-08 11:25:06,839 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 218 transitions. [2022-04-08 11:25:06,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-04-08 11:25:06,840 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:25:06,840 INFO L499 BasicCegarLoop]: 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-08 11:25:06,858 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-08 11:25:07,040 WARN L460 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-08 11:25:07,041 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:25:07,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:25:07,041 INFO L85 PathProgramCache]: Analyzing trace with hash 2077207105, now seen corresponding path program 3 times [2022-04-08 11:25:07,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:25:07,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1047243365] [2022-04-08 11:25:36,026 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 11:25:36,026 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 11:25:36,026 INFO L85 PathProgramCache]: Analyzing trace with hash 2077207105, now seen corresponding path program 4 times [2022-04-08 11:25:36,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:25:36,027 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689812309] [2022-04-08 11:25:36,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:25:36,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:25:36,038 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:25:36,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1834171713] [2022-04-08 11:25:36,038 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 11:25:36,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:25:36,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:25:36,039 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-08 11:25:36,040 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-08 11:25:36,104 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 11:25:36,104 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:25:36,105 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 37 conjunts are in the unsatisfiable core [2022-04-08 11:25:36,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:25:36,133 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:27:34,886 INFO L272 TraceCheckUtils]: 0: Hoare triple {16554#true} call ULTIMATE.init(); {16554#true} is VALID [2022-04-08 11:27:34,886 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-08 11:27:34,886 INFO L290 TraceCheckUtils]: 2: Hoare triple {16554#true} assume true; {16554#true} is VALID [2022-04-08 11:27:34,886 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16554#true} {16554#true} #93#return; {16554#true} is VALID [2022-04-08 11:27:34,886 INFO L272 TraceCheckUtils]: 4: Hoare triple {16554#true} call #t~ret8 := main(); {16554#true} is VALID [2022-04-08 11:27:34,886 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-08 11:27:34,886 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-08 11:27:34,886 INFO L290 TraceCheckUtils]: 7: Hoare triple {16554#true} ~cond := #in~cond; {16554#true} is VALID [2022-04-08 11:27:34,887 INFO L290 TraceCheckUtils]: 8: Hoare triple {16554#true} assume !(0 == ~cond); {16554#true} is VALID [2022-04-08 11:27:34,887 INFO L290 TraceCheckUtils]: 9: Hoare triple {16554#true} assume true; {16554#true} is VALID [2022-04-08 11:27:34,887 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {16554#true} {16554#true} #77#return; {16554#true} is VALID [2022-04-08 11:27:34,887 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-08 11:27:34,887 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-08 11:27:34,888 INFO L290 TraceCheckUtils]: 13: Hoare triple {16592#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} assume !!(#t~post6 < 100);havoc #t~post6; {16592#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 11:27:34,888 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-08 11:27:34,888 INFO L290 TraceCheckUtils]: 15: Hoare triple {16554#true} ~cond := #in~cond; {16554#true} is VALID [2022-04-08 11:27:34,888 INFO L290 TraceCheckUtils]: 16: Hoare triple {16554#true} assume !(0 == ~cond); {16554#true} is VALID [2022-04-08 11:27:34,888 INFO L290 TraceCheckUtils]: 17: Hoare triple {16554#true} assume true; {16554#true} is VALID [2022-04-08 11:27:34,889 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-08 11:27:34,906 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-08 11:27:34,907 INFO L290 TraceCheckUtils]: 20: Hoare triple {16554#true} ~cond := #in~cond; {16554#true} is VALID [2022-04-08 11:27:34,907 INFO L290 TraceCheckUtils]: 21: Hoare triple {16554#true} assume !(0 == ~cond); {16554#true} is VALID [2022-04-08 11:27:34,907 INFO L290 TraceCheckUtils]: 22: Hoare triple {16554#true} assume true; {16554#true} is VALID [2022-04-08 11:27:34,909 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-08 11:27:34,911 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-08 11:27:34,911 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-08 11:27:34,912 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 < 100);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-08 11:27:34,912 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-08 11:27:34,912 INFO L290 TraceCheckUtils]: 28: Hoare triple {16554#true} ~cond := #in~cond; {16554#true} is VALID [2022-04-08 11:27:34,912 INFO L290 TraceCheckUtils]: 29: Hoare triple {16554#true} assume !(0 == ~cond); {16554#true} is VALID [2022-04-08 11:27:34,912 INFO L290 TraceCheckUtils]: 30: Hoare triple {16554#true} assume true; {16554#true} is VALID [2022-04-08 11:27:34,913 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-08 11:27:34,913 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-08 11:27:34,913 INFO L290 TraceCheckUtils]: 33: Hoare triple {16554#true} ~cond := #in~cond; {16554#true} is VALID [2022-04-08 11:27:34,913 INFO L290 TraceCheckUtils]: 34: Hoare triple {16554#true} assume !(0 == ~cond); {16554#true} is VALID [2022-04-08 11:27:34,913 INFO L290 TraceCheckUtils]: 35: Hoare triple {16554#true} assume true; {16554#true} is VALID [2022-04-08 11:27:34,914 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-08 11:27:34,914 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-08 11:27:34,914 INFO L290 TraceCheckUtils]: 38: Hoare triple {16554#true} ~cond := #in~cond; {16554#true} is VALID [2022-04-08 11:27:34,914 INFO L290 TraceCheckUtils]: 39: Hoare triple {16554#true} assume !(0 == ~cond); {16554#true} is VALID [2022-04-08 11:27:34,914 INFO L290 TraceCheckUtils]: 40: Hoare triple {16554#true} assume true; {16554#true} is VALID [2022-04-08 11:27:34,914 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-08 11:27:34,915 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-08 11:27:34,915 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-08 11:27:34,915 INFO L290 TraceCheckUtils]: 44: Hoare triple {16554#true} ~cond := #in~cond; {16554#true} is VALID [2022-04-08 11:27:34,915 INFO L290 TraceCheckUtils]: 45: Hoare triple {16554#true} assume !(0 == ~cond); {16554#true} is VALID [2022-04-08 11:27:34,915 INFO L290 TraceCheckUtils]: 46: Hoare triple {16554#true} assume true; {16554#true} is VALID [2022-04-08 11:27:34,916 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-08 11:27:34,917 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-08 11:27:34,917 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-08 11:27:34,918 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 < 100);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-08 11:27:34,918 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-08 11:27:34,918 INFO L290 TraceCheckUtils]: 52: Hoare triple {16554#true} ~cond := #in~cond; {16718#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:27:34,918 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-08 11:27:34,919 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-08 11:27:34,919 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-08 11:27:34,920 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-08 11:27:34,920 INFO L290 TraceCheckUtils]: 57: Hoare triple {16554#true} ~cond := #in~cond; {16554#true} is VALID [2022-04-08 11:27:34,920 INFO L290 TraceCheckUtils]: 58: Hoare triple {16554#true} assume !(0 == ~cond); {16554#true} is VALID [2022-04-08 11:27:34,920 INFO L290 TraceCheckUtils]: 59: Hoare triple {16554#true} assume true; {16554#true} is VALID [2022-04-08 11:27:34,920 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-08 11:27:34,921 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-08 11:27:34,921 INFO L290 TraceCheckUtils]: 62: Hoare triple {16554#true} ~cond := #in~cond; {16554#true} is VALID [2022-04-08 11:27:34,921 INFO L290 TraceCheckUtils]: 63: Hoare triple {16554#true} assume !(0 == ~cond); {16554#true} is VALID [2022-04-08 11:27:34,921 INFO L290 TraceCheckUtils]: 64: Hoare triple {16554#true} assume true; {16554#true} is VALID [2022-04-08 11:27:34,922 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-08 11:27:34,922 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-08 11:27:34,922 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-08 11:27:34,922 INFO L290 TraceCheckUtils]: 68: Hoare triple {16554#true} ~cond := #in~cond; {16554#true} is VALID [2022-04-08 11:27:34,922 INFO L290 TraceCheckUtils]: 69: Hoare triple {16554#true} assume !(0 == ~cond); {16554#true} is VALID [2022-04-08 11:27:34,922 INFO L290 TraceCheckUtils]: 70: Hoare triple {16554#true} assume true; {16554#true} is VALID [2022-04-08 11:27:34,923 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-08 11:27:34,927 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-08 11:27:34,928 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-08 11:27:34,928 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 < 100);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-08 11:27:34,928 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-08 11:27:34,928 INFO L290 TraceCheckUtils]: 76: Hoare triple {16554#true} ~cond := #in~cond; {16554#true} is VALID [2022-04-08 11:27:34,929 INFO L290 TraceCheckUtils]: 77: Hoare triple {16554#true} assume !(0 == ~cond); {16554#true} is VALID [2022-04-08 11:27:34,929 INFO L290 TraceCheckUtils]: 78: Hoare triple {16554#true} assume true; {16554#true} is VALID [2022-04-08 11:27:34,929 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-08 11:27:34,929 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-08 11:27:34,929 INFO L290 TraceCheckUtils]: 81: Hoare triple {16554#true} ~cond := #in~cond; {16554#true} is VALID [2022-04-08 11:27:34,930 INFO L290 TraceCheckUtils]: 82: Hoare triple {16554#true} assume !(0 == ~cond); {16554#true} is VALID [2022-04-08 11:27:34,930 INFO L290 TraceCheckUtils]: 83: Hoare triple {16554#true} assume true; {16554#true} is VALID [2022-04-08 11:27:34,930 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-08 11:27:34,930 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-08 11:27:34,930 INFO L290 TraceCheckUtils]: 86: Hoare triple {16554#true} ~cond := #in~cond; {16554#true} is VALID [2022-04-08 11:27:34,931 INFO L290 TraceCheckUtils]: 87: Hoare triple {16554#true} assume !(0 == ~cond); {16554#true} is VALID [2022-04-08 11:27:34,931 INFO L290 TraceCheckUtils]: 88: Hoare triple {16554#true} assume true; {16554#true} is VALID [2022-04-08 11:27:34,931 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-08 11:27:34,932 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-08 11:27:34,937 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-08 11:27:34,937 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-08 11:27:34,938 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 < 100);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-08 11:27:34,938 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-08 11:27:34,938 INFO L290 TraceCheckUtils]: 95: Hoare triple {16554#true} ~cond := #in~cond; {16554#true} is VALID [2022-04-08 11:27:34,938 INFO L290 TraceCheckUtils]: 96: Hoare triple {16554#true} assume !(0 == ~cond); {16554#true} is VALID [2022-04-08 11:27:34,938 INFO L290 TraceCheckUtils]: 97: Hoare triple {16554#true} assume true; {16554#true} is VALID [2022-04-08 11:27:34,939 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-08 11:27:34,939 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-08 11:27:34,939 INFO L290 TraceCheckUtils]: 100: Hoare triple {16554#true} ~cond := #in~cond; {16554#true} is VALID [2022-04-08 11:27:34,939 INFO L290 TraceCheckUtils]: 101: Hoare triple {16554#true} assume !(0 == ~cond); {16554#true} is VALID [2022-04-08 11:27:34,939 INFO L290 TraceCheckUtils]: 102: Hoare triple {16554#true} assume true; {16554#true} is VALID [2022-04-08 11:27:34,940 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-08 11:27:34,940 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-08 11:27:34,941 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-08 11:27:34,941 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 < 100);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-08 11:27:34,946 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-08 11:27:34,946 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-08 11:27:34,947 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 < 100);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-08 11:27:35,569 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#(exists ((aux_div_aux_mod_aux_mod_v_main_~q~0_BEFORE_CALL_125_55_103_58 Int) (aux_div_aux_mod_v_main_~q~0_BEFORE_CALL_125_55_103 Int) (aux_div_v_main_~q~0_BEFORE_CALL_125_55 Int) (v_main_~y~0_BEFORE_CALL_173 Int)) (and (< (* 2 aux_div_aux_mod_aux_mod_v_main_~q~0_BEFORE_CALL_125_55_103_58) 2) (<= (* aux_div_aux_mod_v_main_~q~0_BEFORE_CALL_125_55_103 2) (+ (* 2 aux_div_aux_mod_aux_mod_v_main_~q~0_BEFORE_CALL_125_55_103_58) (* 2 aux_div_v_main_~q~0_BEFORE_CALL_125_55))) (< (+ (* 2 aux_div_aux_mod_aux_mod_v_main_~q~0_BEFORE_CALL_125_55_103_58) (* 2 aux_div_v_main_~q~0_BEFORE_CALL_125_55)) (+ 2 (* aux_div_aux_mod_v_main_~q~0_BEFORE_CALL_125_55_103 2))) (= (* v_main_~y~0_BEFORE_CALL_173 2) (* aux_div_aux_mod_v_main_~q~0_BEFORE_CALL_125_55_103 v_main_~y~0_BEFORE_CALL_173)) (<= 0 (* 2 aux_div_aux_mod_aux_mod_v_main_~q~0_BEFORE_CALL_125_55_103_58)) (< (+ (* 2 (* aux_div_aux_mod_v_main_~q~0_BEFORE_CALL_125_55_103 v_main_~y~0_BEFORE_CALL_173)) v_main_~y~0_BEFORE_CALL_173) (+ (* 4 (* v_main_~y~0_BEFORE_CALL_173 aux_div_v_main_~q~0_BEFORE_CALL_125_55)) (* 2 (* v_main_~y~0_BEFORE_CALL_173 aux_div_aux_mod_aux_mod_v_main_~q~0_BEFORE_CALL_125_55_103_58)))) (<= 1 |__VERIFIER_assert_#in~cond|)))} is VALID [2022-04-08 11:27:35,570 INFO L290 TraceCheckUtils]: 111: Hoare triple {16900#(exists ((aux_div_aux_mod_aux_mod_v_main_~q~0_BEFORE_CALL_125_55_103_58 Int) (aux_div_aux_mod_v_main_~q~0_BEFORE_CALL_125_55_103 Int) (aux_div_v_main_~q~0_BEFORE_CALL_125_55 Int) (v_main_~y~0_BEFORE_CALL_173 Int)) (and (< (* 2 aux_div_aux_mod_aux_mod_v_main_~q~0_BEFORE_CALL_125_55_103_58) 2) (<= (* aux_div_aux_mod_v_main_~q~0_BEFORE_CALL_125_55_103 2) (+ (* 2 aux_div_aux_mod_aux_mod_v_main_~q~0_BEFORE_CALL_125_55_103_58) (* 2 aux_div_v_main_~q~0_BEFORE_CALL_125_55))) (< (+ (* 2 aux_div_aux_mod_aux_mod_v_main_~q~0_BEFORE_CALL_125_55_103_58) (* 2 aux_div_v_main_~q~0_BEFORE_CALL_125_55)) (+ 2 (* aux_div_aux_mod_v_main_~q~0_BEFORE_CALL_125_55_103 2))) (= (* v_main_~y~0_BEFORE_CALL_173 2) (* aux_div_aux_mod_v_main_~q~0_BEFORE_CALL_125_55_103 v_main_~y~0_BEFORE_CALL_173)) (<= 0 (* 2 aux_div_aux_mod_aux_mod_v_main_~q~0_BEFORE_CALL_125_55_103_58)) (< (+ (* 2 (* aux_div_aux_mod_v_main_~q~0_BEFORE_CALL_125_55_103 v_main_~y~0_BEFORE_CALL_173)) v_main_~y~0_BEFORE_CALL_173) (+ (* 4 (* v_main_~y~0_BEFORE_CALL_173 aux_div_v_main_~q~0_BEFORE_CALL_125_55)) (* 2 (* v_main_~y~0_BEFORE_CALL_173 aux_div_aux_mod_aux_mod_v_main_~q~0_BEFORE_CALL_125_55_103_58)))) (<= 1 |__VERIFIER_assert_#in~cond|)))} ~cond := #in~cond; {16904#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:27:35,570 INFO L290 TraceCheckUtils]: 112: Hoare triple {16904#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {16555#false} is VALID [2022-04-08 11:27:35,570 INFO L290 TraceCheckUtils]: 113: Hoare triple {16555#false} assume !false; {16555#false} is VALID [2022-04-08 11:27:35,571 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-08 11:27:35,571 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 11:27:51,728 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-08 11:28:39,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:28:39,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689812309] [2022-04-08 11:28:39,780 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:28:39,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1834171713] [2022-04-08 11:28:39,780 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1834171713] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 11:28:39,781 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 11:28:39,781 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2022-04-08 11:28:39,781 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:28:39,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1047243365] [2022-04-08 11:28:39,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1047243365] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:28:39,781 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:28:39,781 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-08 11:28:39,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983154546] [2022-04-08 11:28:39,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:28:39,782 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-08 11:28:39,782 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:28:39,782 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-08 11:28:39,936 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-08 11:28:39,936 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-08 11:28:39,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:28:39,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-08 11:28:39,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=513, Unknown=0, NotChecked=0, Total=650 [2022-04-08 11:28:39,937 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-08 11:28:49,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:28:49,800 INFO L93 Difference]: Finished difference Result 230 states and 283 transitions. [2022-04-08 11:28:49,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-08 11:28:49,801 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-08 11:28:49,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:28:49,801 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-08 11:28:49,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 172 transitions. [2022-04-08 11:28:49,803 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-08 11:28:49,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 172 transitions. [2022-04-08 11:28:49,805 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 172 transitions. [2022-04-08 11:28:50,083 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 172 edges. 172 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:28:50,086 INFO L225 Difference]: With dead ends: 230 [2022-04-08 11:28:50,086 INFO L226 Difference]: Without dead ends: 217 [2022-04-08 11:28:50,087 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 179 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=151, Invalid=605, Unknown=0, NotChecked=0, Total=756 [2022-04-08 11:28:50,087 INFO L913 BasicCegarLoop]: 64 mSDtfsCounter, 53 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 630 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 685 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 630 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 16 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2022-04-08 11:28:50,087 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [73 Valid, 282 Invalid, 685 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 630 Invalid, 0 Unknown, 16 Unchecked, 3.5s Time] [2022-04-08 11:28:50,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2022-04-08 11:28:50,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 206. [2022-04-08 11:28:50,392 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:28:50,393 INFO L82 GeneralOperation]: Start isEquivalent. First operand 217 states. Second operand has 206 states, 131 states have (on average 1.1450381679389312) internal successors, (150), 132 states have internal predecessors, (150), 52 states have call successors, (52), 24 states have call predecessors, (52), 22 states have return successors, (50), 49 states have call predecessors, (50), 50 states have call successors, (50) [2022-04-08 11:28:50,393 INFO L74 IsIncluded]: Start isIncluded. First operand 217 states. Second operand has 206 states, 131 states have (on average 1.1450381679389312) internal successors, (150), 132 states have internal predecessors, (150), 52 states have call successors, (52), 24 states have call predecessors, (52), 22 states have return successors, (50), 49 states have call predecessors, (50), 50 states have call successors, (50) [2022-04-08 11:28:50,393 INFO L87 Difference]: Start difference. First operand 217 states. Second operand has 206 states, 131 states have (on average 1.1450381679389312) internal successors, (150), 132 states have internal predecessors, (150), 52 states have call successors, (52), 24 states have call predecessors, (52), 22 states have return successors, (50), 49 states have call predecessors, (50), 50 states have call successors, (50) [2022-04-08 11:28:50,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:28:50,397 INFO L93 Difference]: Finished difference Result 217 states and 264 transitions. [2022-04-08 11:28:50,397 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 264 transitions. [2022-04-08 11:28:50,397 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:28:50,398 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:28:50,398 INFO L74 IsIncluded]: Start isIncluded. First operand has 206 states, 131 states have (on average 1.1450381679389312) internal successors, (150), 132 states have internal predecessors, (150), 52 states have call successors, (52), 24 states have call predecessors, (52), 22 states have return successors, (50), 49 states have call predecessors, (50), 50 states have call successors, (50) Second operand 217 states. [2022-04-08 11:28:50,398 INFO L87 Difference]: Start difference. First operand has 206 states, 131 states have (on average 1.1450381679389312) internal successors, (150), 132 states have internal predecessors, (150), 52 states have call successors, (52), 24 states have call predecessors, (52), 22 states have return successors, (50), 49 states have call predecessors, (50), 50 states have call successors, (50) Second operand 217 states. [2022-04-08 11:28:50,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:28:50,401 INFO L93 Difference]: Finished difference Result 217 states and 264 transitions. [2022-04-08 11:28:50,402 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 264 transitions. [2022-04-08 11:28:50,402 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:28:50,402 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:28:50,402 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:28:50,402 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:28:50,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 131 states have (on average 1.1450381679389312) internal successors, (150), 132 states have internal predecessors, (150), 52 states have call successors, (52), 24 states have call predecessors, (52), 22 states have return successors, (50), 49 states have call predecessors, (50), 50 states have call successors, (50) [2022-04-08 11:28:50,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 252 transitions. [2022-04-08 11:28:50,406 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 252 transitions. Word has length 114 [2022-04-08 11:28:50,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:28:50,406 INFO L478 AbstractCegarLoop]: Abstraction has 206 states and 252 transitions. [2022-04-08 11:28:50,406 INFO L479 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-08 11:28:50,406 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 206 states and 252 transitions. [2022-04-08 11:28:50,809 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 252 edges. 252 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:28:50,810 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 252 transitions. [2022-04-08 11:28:50,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-04-08 11:28:50,821 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:28:50,821 INFO L499 BasicCegarLoop]: 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-08 11:28:50,839 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-08 11:28:51,027 WARN L460 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-08 11:28:51,030 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:28:51,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:28:51,030 INFO L85 PathProgramCache]: Analyzing trace with hash 1338024082, now seen corresponding path program 5 times [2022-04-08 11:28:51,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:28:51,030 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [79998220] [2022-04-08 11:29:19,800 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 11:29:19,800 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 11:29:19,800 INFO L85 PathProgramCache]: Analyzing trace with hash 1338024082, now seen corresponding path program 6 times [2022-04-08 11:29:19,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:29:19,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294387841] [2022-04-08 11:29:19,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:29:19,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:29:19,812 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:29:19,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1290496833] [2022-04-08 11:29:19,812 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 11:29:19,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:29:19,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:29:19,813 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-08 11:29:19,814 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-08 11:29:19,885 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2022-04-08 11:29:19,885 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:29:19,886 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-08 11:29:19,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:29:19,906 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:29:20,867 INFO L272 TraceCheckUtils]: 0: Hoare triple {18505#true} call ULTIMATE.init(); {18505#true} is VALID [2022-04-08 11:29:20,868 INFO L290 TraceCheckUtils]: 1: Hoare triple {18505#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; {18505#true} is VALID [2022-04-08 11:29:20,868 INFO L290 TraceCheckUtils]: 2: Hoare triple {18505#true} assume true; {18505#true} is VALID [2022-04-08 11:29:20,868 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18505#true} {18505#true} #93#return; {18505#true} is VALID [2022-04-08 11:29:20,868 INFO L272 TraceCheckUtils]: 4: Hoare triple {18505#true} call #t~ret8 := main(); {18505#true} is VALID [2022-04-08 11:29:20,868 INFO L290 TraceCheckUtils]: 5: Hoare triple {18505#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; {18505#true} is VALID [2022-04-08 11:29:20,868 INFO L272 TraceCheckUtils]: 6: Hoare triple {18505#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {18505#true} is VALID [2022-04-08 11:29:20,868 INFO L290 TraceCheckUtils]: 7: Hoare triple {18505#true} ~cond := #in~cond; {18505#true} is VALID [2022-04-08 11:29:20,868 INFO L290 TraceCheckUtils]: 8: Hoare triple {18505#true} assume !(0 == ~cond); {18505#true} is VALID [2022-04-08 11:29:20,868 INFO L290 TraceCheckUtils]: 9: Hoare triple {18505#true} assume true; {18505#true} is VALID [2022-04-08 11:29:20,868 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {18505#true} {18505#true} #77#return; {18505#true} is VALID [2022-04-08 11:29:20,869 INFO L290 TraceCheckUtils]: 11: Hoare triple {18505#true} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {18543#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 11:29:20,869 INFO L290 TraceCheckUtils]: 12: Hoare triple {18543#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {18543#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 11:29:20,869 INFO L290 TraceCheckUtils]: 13: Hoare triple {18543#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} assume !!(#t~post6 < 100);havoc #t~post6; {18543#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 11:29:20,869 INFO L272 TraceCheckUtils]: 14: Hoare triple {18543#(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)); {18505#true} is VALID [2022-04-08 11:29:20,869 INFO L290 TraceCheckUtils]: 15: Hoare triple {18505#true} ~cond := #in~cond; {18505#true} is VALID [2022-04-08 11:29:20,870 INFO L290 TraceCheckUtils]: 16: Hoare triple {18505#true} assume !(0 == ~cond); {18505#true} is VALID [2022-04-08 11:29:20,870 INFO L290 TraceCheckUtils]: 17: Hoare triple {18505#true} assume true; {18505#true} is VALID [2022-04-08 11:29:20,870 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {18505#true} {18543#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #79#return; {18543#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 11:29:20,870 INFO L272 TraceCheckUtils]: 19: Hoare triple {18543#(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)); {18505#true} is VALID [2022-04-08 11:29:20,870 INFO L290 TraceCheckUtils]: 20: Hoare triple {18505#true} ~cond := #in~cond; {18505#true} is VALID [2022-04-08 11:29:20,870 INFO L290 TraceCheckUtils]: 21: Hoare triple {18505#true} assume !(0 == ~cond); {18505#true} is VALID [2022-04-08 11:29:20,870 INFO L290 TraceCheckUtils]: 22: Hoare triple {18505#true} assume true; {18505#true} is VALID [2022-04-08 11:29:20,871 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {18505#true} {18543#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #81#return; {18543#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 11:29:20,871 INFO L290 TraceCheckUtils]: 24: Hoare triple {18543#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {18543#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 11:29:20,872 INFO L290 TraceCheckUtils]: 25: Hoare triple {18543#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {18543#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 11:29:20,872 INFO L290 TraceCheckUtils]: 26: Hoare triple {18543#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} assume !!(#t~post7 < 100);havoc #t~post7; {18543#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 11:29:20,872 INFO L272 TraceCheckUtils]: 27: Hoare triple {18543#(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)); {18505#true} is VALID [2022-04-08 11:29:20,872 INFO L290 TraceCheckUtils]: 28: Hoare triple {18505#true} ~cond := #in~cond; {18505#true} is VALID [2022-04-08 11:29:20,872 INFO L290 TraceCheckUtils]: 29: Hoare triple {18505#true} assume !(0 == ~cond); {18505#true} is VALID [2022-04-08 11:29:20,872 INFO L290 TraceCheckUtils]: 30: Hoare triple {18505#true} assume true; {18505#true} is VALID [2022-04-08 11:29:20,873 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {18505#true} {18543#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #83#return; {18543#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 11:29:20,873 INFO L272 TraceCheckUtils]: 32: Hoare triple {18543#(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)); {18505#true} is VALID [2022-04-08 11:29:20,873 INFO L290 TraceCheckUtils]: 33: Hoare triple {18505#true} ~cond := #in~cond; {18505#true} is VALID [2022-04-08 11:29:20,873 INFO L290 TraceCheckUtils]: 34: Hoare triple {18505#true} assume !(0 == ~cond); {18505#true} is VALID [2022-04-08 11:29:20,873 INFO L290 TraceCheckUtils]: 35: Hoare triple {18505#true} assume true; {18505#true} is VALID [2022-04-08 11:29:20,873 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {18505#true} {18543#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #85#return; {18543#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 11:29:20,874 INFO L272 TraceCheckUtils]: 37: Hoare triple {18543#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {18505#true} is VALID [2022-04-08 11:29:20,874 INFO L290 TraceCheckUtils]: 38: Hoare triple {18505#true} ~cond := #in~cond; {18505#true} is VALID [2022-04-08 11:29:20,874 INFO L290 TraceCheckUtils]: 39: Hoare triple {18505#true} assume !(0 == ~cond); {18505#true} is VALID [2022-04-08 11:29:20,874 INFO L290 TraceCheckUtils]: 40: Hoare triple {18505#true} assume true; {18505#true} is VALID [2022-04-08 11:29:20,874 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {18505#true} {18543#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #87#return; {18543#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 11:29:20,874 INFO L290 TraceCheckUtils]: 42: Hoare triple {18543#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} assume !!(~r~0 >= 2 * ~b~0); {18543#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 11:29:20,875 INFO L272 TraceCheckUtils]: 43: Hoare triple {18543#(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)); {18505#true} is VALID [2022-04-08 11:29:20,875 INFO L290 TraceCheckUtils]: 44: Hoare triple {18505#true} ~cond := #in~cond; {18505#true} is VALID [2022-04-08 11:29:20,875 INFO L290 TraceCheckUtils]: 45: Hoare triple {18505#true} assume !(0 == ~cond); {18505#true} is VALID [2022-04-08 11:29:20,875 INFO L290 TraceCheckUtils]: 46: Hoare triple {18505#true} assume true; {18505#true} is VALID [2022-04-08 11:29:20,875 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {18505#true} {18543#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #89#return; {18543#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 11:29:20,876 INFO L290 TraceCheckUtils]: 48: Hoare triple {18543#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} ~a~0 := 2 * ~a~0;~b~0 := 2 * ~b~0; {18543#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 11:29:20,876 INFO L290 TraceCheckUtils]: 49: Hoare triple {18543#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {18543#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 11:29:20,876 INFO L290 TraceCheckUtils]: 50: Hoare triple {18543#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} assume !!(#t~post7 < 100);havoc #t~post7; {18543#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 11:29:20,876 INFO L272 TraceCheckUtils]: 51: Hoare triple {18543#(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)); {18505#true} is VALID [2022-04-08 11:29:20,876 INFO L290 TraceCheckUtils]: 52: Hoare triple {18505#true} ~cond := #in~cond; {18505#true} is VALID [2022-04-08 11:29:20,877 INFO L290 TraceCheckUtils]: 53: Hoare triple {18505#true} assume !(0 == ~cond); {18505#true} is VALID [2022-04-08 11:29:20,877 INFO L290 TraceCheckUtils]: 54: Hoare triple {18505#true} assume true; {18505#true} is VALID [2022-04-08 11:29:20,877 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {18505#true} {18543#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #83#return; {18543#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 11:29:20,877 INFO L272 TraceCheckUtils]: 56: Hoare triple {18543#(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)); {18505#true} is VALID [2022-04-08 11:29:20,877 INFO L290 TraceCheckUtils]: 57: Hoare triple {18505#true} ~cond := #in~cond; {18505#true} is VALID [2022-04-08 11:29:20,877 INFO L290 TraceCheckUtils]: 58: Hoare triple {18505#true} assume !(0 == ~cond); {18505#true} is VALID [2022-04-08 11:29:20,877 INFO L290 TraceCheckUtils]: 59: Hoare triple {18505#true} assume true; {18505#true} is VALID [2022-04-08 11:29:20,878 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {18505#true} {18543#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #85#return; {18543#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 11:29:20,878 INFO L272 TraceCheckUtils]: 61: Hoare triple {18543#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {18505#true} is VALID [2022-04-08 11:29:20,878 INFO L290 TraceCheckUtils]: 62: Hoare triple {18505#true} ~cond := #in~cond; {18505#true} is VALID [2022-04-08 11:29:20,878 INFO L290 TraceCheckUtils]: 63: Hoare triple {18505#true} assume !(0 == ~cond); {18505#true} is VALID [2022-04-08 11:29:20,878 INFO L290 TraceCheckUtils]: 64: Hoare triple {18505#true} assume true; {18505#true} is VALID [2022-04-08 11:29:20,878 INFO L284 TraceCheckUtils]: 65: Hoare quadruple {18505#true} {18543#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #87#return; {18543#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 11:29:20,879 INFO L290 TraceCheckUtils]: 66: Hoare triple {18543#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} assume !!(~r~0 >= 2 * ~b~0); {18543#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 11:29:20,879 INFO L272 TraceCheckUtils]: 67: Hoare triple {18543#(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)); {18505#true} is VALID [2022-04-08 11:29:20,879 INFO L290 TraceCheckUtils]: 68: Hoare triple {18505#true} ~cond := #in~cond; {18505#true} is VALID [2022-04-08 11:29:20,879 INFO L290 TraceCheckUtils]: 69: Hoare triple {18505#true} assume !(0 == ~cond); {18505#true} is VALID [2022-04-08 11:29:20,879 INFO L290 TraceCheckUtils]: 70: Hoare triple {18505#true} assume true; {18505#true} is VALID [2022-04-08 11:29:20,880 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {18505#true} {18543#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #89#return; {18543#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 11:29:20,880 INFO L290 TraceCheckUtils]: 72: Hoare triple {18543#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} ~a~0 := 2 * ~a~0;~b~0 := 2 * ~b~0; {18543#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 11:29:20,880 INFO L290 TraceCheckUtils]: 73: Hoare triple {18543#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {18543#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 11:29:20,881 INFO L290 TraceCheckUtils]: 74: Hoare triple {18543#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} assume !!(#t~post7 < 100);havoc #t~post7; {18543#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 11:29:20,881 INFO L272 TraceCheckUtils]: 75: Hoare triple {18543#(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)); {18505#true} is VALID [2022-04-08 11:29:20,881 INFO L290 TraceCheckUtils]: 76: Hoare triple {18505#true} ~cond := #in~cond; {18505#true} is VALID [2022-04-08 11:29:20,881 INFO L290 TraceCheckUtils]: 77: Hoare triple {18505#true} assume !(0 == ~cond); {18505#true} is VALID [2022-04-08 11:29:20,881 INFO L290 TraceCheckUtils]: 78: Hoare triple {18505#true} assume true; {18505#true} is VALID [2022-04-08 11:29:20,881 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {18505#true} {18543#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #83#return; {18543#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 11:29:20,881 INFO L272 TraceCheckUtils]: 80: Hoare triple {18543#(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)); {18505#true} is VALID [2022-04-08 11:29:20,882 INFO L290 TraceCheckUtils]: 81: Hoare triple {18505#true} ~cond := #in~cond; {18505#true} is VALID [2022-04-08 11:29:20,882 INFO L290 TraceCheckUtils]: 82: Hoare triple {18505#true} assume !(0 == ~cond); {18505#true} is VALID [2022-04-08 11:29:20,882 INFO L290 TraceCheckUtils]: 83: Hoare triple {18505#true} assume true; {18505#true} is VALID [2022-04-08 11:29:20,882 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {18505#true} {18543#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #85#return; {18543#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 11:29:20,882 INFO L272 TraceCheckUtils]: 85: Hoare triple {18543#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {18505#true} is VALID [2022-04-08 11:29:20,882 INFO L290 TraceCheckUtils]: 86: Hoare triple {18505#true} ~cond := #in~cond; {18505#true} is VALID [2022-04-08 11:29:20,882 INFO L290 TraceCheckUtils]: 87: Hoare triple {18505#true} assume !(0 == ~cond); {18505#true} is VALID [2022-04-08 11:29:20,882 INFO L290 TraceCheckUtils]: 88: Hoare triple {18505#true} assume true; {18505#true} is VALID [2022-04-08 11:29:20,883 INFO L284 TraceCheckUtils]: 89: Hoare quadruple {18505#true} {18543#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #87#return; {18543#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 11:29:20,883 INFO L290 TraceCheckUtils]: 90: Hoare triple {18543#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} assume !!(~r~0 >= 2 * ~b~0); {18543#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 11:29:20,883 INFO L272 TraceCheckUtils]: 91: Hoare triple {18543#(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)); {18505#true} is VALID [2022-04-08 11:29:20,883 INFO L290 TraceCheckUtils]: 92: Hoare triple {18505#true} ~cond := #in~cond; {18505#true} is VALID [2022-04-08 11:29:20,883 INFO L290 TraceCheckUtils]: 93: Hoare triple {18505#true} assume !(0 == ~cond); {18505#true} is VALID [2022-04-08 11:29:20,883 INFO L290 TraceCheckUtils]: 94: Hoare triple {18505#true} assume true; {18505#true} is VALID [2022-04-08 11:29:20,884 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {18505#true} {18543#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #89#return; {18543#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 11:29:20,887 INFO L290 TraceCheckUtils]: 96: Hoare triple {18543#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} ~a~0 := 2 * ~a~0;~b~0 := 2 * ~b~0; {18799#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 11:29:20,896 INFO L290 TraceCheckUtils]: 97: Hoare triple {18799#(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; {18799#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 11:29:20,896 INFO L290 TraceCheckUtils]: 98: Hoare triple {18799#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (= main_~q~0 0))} assume !!(#t~post7 < 100);havoc #t~post7; {18799#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 11:29:20,896 INFO L272 TraceCheckUtils]: 99: Hoare triple {18799#(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)); {18505#true} is VALID [2022-04-08 11:29:20,897 INFO L290 TraceCheckUtils]: 100: Hoare triple {18505#true} ~cond := #in~cond; {18812#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:29:20,897 INFO L290 TraceCheckUtils]: 101: Hoare triple {18812#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {18816#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:29:20,897 INFO L290 TraceCheckUtils]: 102: Hoare triple {18816#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {18816#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:29:20,898 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {18816#(not (= |__VERIFIER_assert_#in~cond| 0))} {18799#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (= main_~q~0 0))} #83#return; {18823#(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-08 11:29:20,898 INFO L272 TraceCheckUtils]: 104: Hoare triple {18823#(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)); {18505#true} is VALID [2022-04-08 11:29:20,898 INFO L290 TraceCheckUtils]: 105: Hoare triple {18505#true} ~cond := #in~cond; {18505#true} is VALID [2022-04-08 11:29:20,898 INFO L290 TraceCheckUtils]: 106: Hoare triple {18505#true} assume !(0 == ~cond); {18505#true} is VALID [2022-04-08 11:29:20,898 INFO L290 TraceCheckUtils]: 107: Hoare triple {18505#true} assume true; {18505#true} is VALID [2022-04-08 11:29:20,899 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {18505#true} {18823#(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; {18823#(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-08 11:29:20,899 INFO L272 TraceCheckUtils]: 109: Hoare triple {18823#(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)); {18505#true} is VALID [2022-04-08 11:29:20,899 INFO L290 TraceCheckUtils]: 110: Hoare triple {18505#true} ~cond := #in~cond; {18505#true} is VALID [2022-04-08 11:29:20,899 INFO L290 TraceCheckUtils]: 111: Hoare triple {18505#true} assume !(0 == ~cond); {18505#true} is VALID [2022-04-08 11:29:20,899 INFO L290 TraceCheckUtils]: 112: Hoare triple {18505#true} assume true; {18505#true} is VALID [2022-04-08 11:29:20,900 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {18505#true} {18823#(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; {18823#(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-08 11:29:20,900 INFO L290 TraceCheckUtils]: 114: Hoare triple {18823#(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); {18823#(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-08 11:29:20,903 INFO L290 TraceCheckUtils]: 115: Hoare triple {18823#(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; {18860#(and (= (+ main_~x~0 (* (- 1) main_~r~0)) (* main_~q~0 main_~y~0)) (= (mod main_~q~0 2) 0))} is VALID [2022-04-08 11:29:20,903 INFO L290 TraceCheckUtils]: 116: Hoare triple {18860#(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; {18860#(and (= (+ main_~x~0 (* (- 1) main_~r~0)) (* main_~q~0 main_~y~0)) (= (mod main_~q~0 2) 0))} is VALID [2022-04-08 11:29:20,903 INFO L290 TraceCheckUtils]: 117: Hoare triple {18860#(and (= (+ main_~x~0 (* (- 1) main_~r~0)) (* main_~q~0 main_~y~0)) (= (mod main_~q~0 2) 0))} assume !(#t~post6 < 100);havoc #t~post6; {18860#(and (= (+ main_~x~0 (* (- 1) main_~r~0)) (* main_~q~0 main_~y~0)) (= (mod main_~q~0 2) 0))} is VALID [2022-04-08 11:29:20,904 INFO L272 TraceCheckUtils]: 118: Hoare triple {18860#(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)); {18870#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 11:29:20,904 INFO L290 TraceCheckUtils]: 119: Hoare triple {18870#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {18874#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:29:20,905 INFO L290 TraceCheckUtils]: 120: Hoare triple {18874#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {18506#false} is VALID [2022-04-08 11:29:20,905 INFO L290 TraceCheckUtils]: 121: Hoare triple {18506#false} assume !false; {18506#false} is VALID [2022-04-08 11:29:20,905 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-08 11:29:20,905 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 11:29:29,014 INFO L290 TraceCheckUtils]: 121: Hoare triple {18506#false} assume !false; {18506#false} is VALID [2022-04-08 11:29:29,015 INFO L290 TraceCheckUtils]: 120: Hoare triple {18874#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {18506#false} is VALID [2022-04-08 11:29:29,015 INFO L290 TraceCheckUtils]: 119: Hoare triple {18870#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {18874#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:29:29,016 INFO L272 TraceCheckUtils]: 118: Hoare triple {18890#(= (+ (* 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)); {18870#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 11:29:29,016 INFO L290 TraceCheckUtils]: 117: Hoare triple {18890#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} assume !(#t~post6 < 100);havoc #t~post6; {18890#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-08 11:29:29,016 INFO L290 TraceCheckUtils]: 116: Hoare triple {18890#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {18890#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-08 11:29:29,027 INFO L290 TraceCheckUtils]: 115: Hoare triple {18900#(= 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; {18890#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-08 11:29:29,027 INFO L290 TraceCheckUtils]: 114: Hoare triple {18900#(= 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); {18900#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} is VALID [2022-04-08 11:29:29,028 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {18505#true} {18900#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} #87#return; {18900#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} is VALID [2022-04-08 11:29:29,028 INFO L290 TraceCheckUtils]: 112: Hoare triple {18505#true} assume true; {18505#true} is VALID [2022-04-08 11:29:29,028 INFO L290 TraceCheckUtils]: 111: Hoare triple {18505#true} assume !(0 == ~cond); {18505#true} is VALID [2022-04-08 11:29:29,028 INFO L290 TraceCheckUtils]: 110: Hoare triple {18505#true} ~cond := #in~cond; {18505#true} is VALID [2022-04-08 11:29:29,028 INFO L272 TraceCheckUtils]: 109: Hoare triple {18900#(= 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)); {18505#true} is VALID [2022-04-08 11:29:29,042 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {18505#true} {18900#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} #85#return; {18900#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} is VALID [2022-04-08 11:29:29,042 INFO L290 TraceCheckUtils]: 107: Hoare triple {18505#true} assume true; {18505#true} is VALID [2022-04-08 11:29:29,042 INFO L290 TraceCheckUtils]: 106: Hoare triple {18505#true} assume !(0 == ~cond); {18505#true} is VALID [2022-04-08 11:29:29,042 INFO L290 TraceCheckUtils]: 105: Hoare triple {18505#true} ~cond := #in~cond; {18505#true} is VALID [2022-04-08 11:29:29,043 INFO L272 TraceCheckUtils]: 104: Hoare triple {18900#(= 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)); {18505#true} is VALID [2022-04-08 11:29:29,043 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {18816#(not (= |__VERIFIER_assert_#in~cond| 0))} {18890#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} #83#return; {18900#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} is VALID [2022-04-08 11:29:29,044 INFO L290 TraceCheckUtils]: 102: Hoare triple {18816#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {18816#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:29:29,044 INFO L290 TraceCheckUtils]: 101: Hoare triple {18946#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {18816#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:29:29,044 INFO L290 TraceCheckUtils]: 100: Hoare triple {18505#true} ~cond := #in~cond; {18946#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 11:29:29,044 INFO L272 TraceCheckUtils]: 99: Hoare triple {18890#(= (+ (* 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)); {18505#true} is VALID [2022-04-08 11:29:29,045 INFO L290 TraceCheckUtils]: 98: Hoare triple {18890#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} assume !!(#t~post7 < 100);havoc #t~post7; {18890#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-08 11:29:29,045 INFO L290 TraceCheckUtils]: 97: Hoare triple {18890#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {18890#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-08 11:29:29,045 INFO L290 TraceCheckUtils]: 96: Hoare triple {18890#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} ~a~0 := 2 * ~a~0;~b~0 := 2 * ~b~0; {18890#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-08 11:29:29,046 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {18505#true} {18890#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} #89#return; {18890#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-08 11:29:29,046 INFO L290 TraceCheckUtils]: 94: Hoare triple {18505#true} assume true; {18505#true} is VALID [2022-04-08 11:29:29,046 INFO L290 TraceCheckUtils]: 93: Hoare triple {18505#true} assume !(0 == ~cond); {18505#true} is VALID [2022-04-08 11:29:29,046 INFO L290 TraceCheckUtils]: 92: Hoare triple {18505#true} ~cond := #in~cond; {18505#true} is VALID [2022-04-08 11:29:29,046 INFO L272 TraceCheckUtils]: 91: Hoare triple {18890#(= (+ (* 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)); {18505#true} is VALID [2022-04-08 11:29:29,046 INFO L290 TraceCheckUtils]: 90: Hoare triple {18890#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} assume !!(~r~0 >= 2 * ~b~0); {18890#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-08 11:29:29,047 INFO L284 TraceCheckUtils]: 89: Hoare quadruple {18505#true} {18890#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} #87#return; {18890#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-08 11:29:29,047 INFO L290 TraceCheckUtils]: 88: Hoare triple {18505#true} assume true; {18505#true} is VALID [2022-04-08 11:29:29,047 INFO L290 TraceCheckUtils]: 87: Hoare triple {18505#true} assume !(0 == ~cond); {18505#true} is VALID [2022-04-08 11:29:29,047 INFO L290 TraceCheckUtils]: 86: Hoare triple {18505#true} ~cond := #in~cond; {18505#true} is VALID [2022-04-08 11:29:29,047 INFO L272 TraceCheckUtils]: 85: Hoare triple {18890#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {18505#true} is VALID [2022-04-08 11:29:29,047 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {18505#true} {18890#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} #85#return; {18890#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-08 11:29:29,047 INFO L290 TraceCheckUtils]: 83: Hoare triple {18505#true} assume true; {18505#true} is VALID [2022-04-08 11:29:29,048 INFO L290 TraceCheckUtils]: 82: Hoare triple {18505#true} assume !(0 == ~cond); {18505#true} is VALID [2022-04-08 11:29:29,048 INFO L290 TraceCheckUtils]: 81: Hoare triple {18505#true} ~cond := #in~cond; {18505#true} is VALID [2022-04-08 11:29:29,048 INFO L272 TraceCheckUtils]: 80: Hoare triple {18890#(= (+ (* 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)); {18505#true} is VALID [2022-04-08 11:29:29,048 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {18505#true} {18890#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} #83#return; {18890#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-08 11:29:29,048 INFO L290 TraceCheckUtils]: 78: Hoare triple {18505#true} assume true; {18505#true} is VALID [2022-04-08 11:29:29,048 INFO L290 TraceCheckUtils]: 77: Hoare triple {18505#true} assume !(0 == ~cond); {18505#true} is VALID [2022-04-08 11:29:29,048 INFO L290 TraceCheckUtils]: 76: Hoare triple {18505#true} ~cond := #in~cond; {18505#true} is VALID [2022-04-08 11:29:29,048 INFO L272 TraceCheckUtils]: 75: Hoare triple {18890#(= (+ (* 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)); {18505#true} is VALID [2022-04-08 11:29:29,049 INFO L290 TraceCheckUtils]: 74: Hoare triple {18890#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} assume !!(#t~post7 < 100);havoc #t~post7; {18890#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-08 11:29:29,049 INFO L290 TraceCheckUtils]: 73: Hoare triple {18890#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {18890#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-08 11:29:29,049 INFO L290 TraceCheckUtils]: 72: Hoare triple {18890#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} ~a~0 := 2 * ~a~0;~b~0 := 2 * ~b~0; {18890#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-08 11:29:29,050 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {18505#true} {18890#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} #89#return; {18890#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-08 11:29:29,050 INFO L290 TraceCheckUtils]: 70: Hoare triple {18505#true} assume true; {18505#true} is VALID [2022-04-08 11:29:29,050 INFO L290 TraceCheckUtils]: 69: Hoare triple {18505#true} assume !(0 == ~cond); {18505#true} is VALID [2022-04-08 11:29:29,050 INFO L290 TraceCheckUtils]: 68: Hoare triple {18505#true} ~cond := #in~cond; {18505#true} is VALID [2022-04-08 11:29:29,050 INFO L272 TraceCheckUtils]: 67: Hoare triple {18890#(= (+ (* 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)); {18505#true} is VALID [2022-04-08 11:29:29,050 INFO L290 TraceCheckUtils]: 66: Hoare triple {18890#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} assume !!(~r~0 >= 2 * ~b~0); {18890#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-08 11:29:29,051 INFO L284 TraceCheckUtils]: 65: Hoare quadruple {18505#true} {18890#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} #87#return; {18890#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-08 11:29:29,051 INFO L290 TraceCheckUtils]: 64: Hoare triple {18505#true} assume true; {18505#true} is VALID [2022-04-08 11:29:29,051 INFO L290 TraceCheckUtils]: 63: Hoare triple {18505#true} assume !(0 == ~cond); {18505#true} is VALID [2022-04-08 11:29:29,051 INFO L290 TraceCheckUtils]: 62: Hoare triple {18505#true} ~cond := #in~cond; {18505#true} is VALID [2022-04-08 11:29:29,051 INFO L272 TraceCheckUtils]: 61: Hoare triple {18890#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {18505#true} is VALID [2022-04-08 11:29:29,051 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {18505#true} {18890#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} #85#return; {18890#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-08 11:29:29,051 INFO L290 TraceCheckUtils]: 59: Hoare triple {18505#true} assume true; {18505#true} is VALID [2022-04-08 11:29:29,051 INFO L290 TraceCheckUtils]: 58: Hoare triple {18505#true} assume !(0 == ~cond); {18505#true} is VALID [2022-04-08 11:29:29,052 INFO L290 TraceCheckUtils]: 57: Hoare triple {18505#true} ~cond := #in~cond; {18505#true} is VALID [2022-04-08 11:29:29,052 INFO L272 TraceCheckUtils]: 56: Hoare triple {18890#(= (+ (* 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)); {18505#true} is VALID [2022-04-08 11:29:29,052 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {18505#true} {18890#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} #83#return; {18890#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-08 11:29:29,052 INFO L290 TraceCheckUtils]: 54: Hoare triple {18505#true} assume true; {18505#true} is VALID [2022-04-08 11:29:29,052 INFO L290 TraceCheckUtils]: 53: Hoare triple {18505#true} assume !(0 == ~cond); {18505#true} is VALID [2022-04-08 11:29:29,052 INFO L290 TraceCheckUtils]: 52: Hoare triple {18505#true} ~cond := #in~cond; {18505#true} is VALID [2022-04-08 11:29:29,052 INFO L272 TraceCheckUtils]: 51: Hoare triple {18890#(= (+ (* 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)); {18505#true} is VALID [2022-04-08 11:29:29,053 INFO L290 TraceCheckUtils]: 50: Hoare triple {18890#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} assume !!(#t~post7 < 100);havoc #t~post7; {18890#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-08 11:29:29,053 INFO L290 TraceCheckUtils]: 49: Hoare triple {18890#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {18890#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-08 11:29:29,053 INFO L290 TraceCheckUtils]: 48: Hoare triple {18890#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} ~a~0 := 2 * ~a~0;~b~0 := 2 * ~b~0; {18890#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-08 11:29:29,054 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {18505#true} {18890#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} #89#return; {18890#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-08 11:29:29,054 INFO L290 TraceCheckUtils]: 46: Hoare triple {18505#true} assume true; {18505#true} is VALID [2022-04-08 11:29:29,054 INFO L290 TraceCheckUtils]: 45: Hoare triple {18505#true} assume !(0 == ~cond); {18505#true} is VALID [2022-04-08 11:29:29,054 INFO L290 TraceCheckUtils]: 44: Hoare triple {18505#true} ~cond := #in~cond; {18505#true} is VALID [2022-04-08 11:29:29,054 INFO L272 TraceCheckUtils]: 43: Hoare triple {18890#(= (+ (* 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)); {18505#true} is VALID [2022-04-08 11:29:29,054 INFO L290 TraceCheckUtils]: 42: Hoare triple {18890#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} assume !!(~r~0 >= 2 * ~b~0); {18890#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-08 11:29:29,055 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {18505#true} {18890#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} #87#return; {18890#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-08 11:29:29,055 INFO L290 TraceCheckUtils]: 40: Hoare triple {18505#true} assume true; {18505#true} is VALID [2022-04-08 11:29:29,055 INFO L290 TraceCheckUtils]: 39: Hoare triple {18505#true} assume !(0 == ~cond); {18505#true} is VALID [2022-04-08 11:29:29,055 INFO L290 TraceCheckUtils]: 38: Hoare triple {18505#true} ~cond := #in~cond; {18505#true} is VALID [2022-04-08 11:29:29,055 INFO L272 TraceCheckUtils]: 37: Hoare triple {18890#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {18505#true} is VALID [2022-04-08 11:29:29,055 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {18505#true} {18890#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} #85#return; {18890#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-08 11:29:29,055 INFO L290 TraceCheckUtils]: 35: Hoare triple {18505#true} assume true; {18505#true} is VALID [2022-04-08 11:29:29,055 INFO L290 TraceCheckUtils]: 34: Hoare triple {18505#true} assume !(0 == ~cond); {18505#true} is VALID [2022-04-08 11:29:29,055 INFO L290 TraceCheckUtils]: 33: Hoare triple {18505#true} ~cond := #in~cond; {18505#true} is VALID [2022-04-08 11:29:29,056 INFO L272 TraceCheckUtils]: 32: Hoare triple {18890#(= (+ (* 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)); {18505#true} is VALID [2022-04-08 11:29:29,056 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {18505#true} {18890#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} #83#return; {18890#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-08 11:29:29,056 INFO L290 TraceCheckUtils]: 30: Hoare triple {18505#true} assume true; {18505#true} is VALID [2022-04-08 11:29:29,056 INFO L290 TraceCheckUtils]: 29: Hoare triple {18505#true} assume !(0 == ~cond); {18505#true} is VALID [2022-04-08 11:29:29,056 INFO L290 TraceCheckUtils]: 28: Hoare triple {18505#true} ~cond := #in~cond; {18505#true} is VALID [2022-04-08 11:29:29,056 INFO L272 TraceCheckUtils]: 27: Hoare triple {18890#(= (+ (* 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)); {18505#true} is VALID [2022-04-08 11:29:29,057 INFO L290 TraceCheckUtils]: 26: Hoare triple {18890#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} assume !!(#t~post7 < 100);havoc #t~post7; {18890#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-08 11:29:29,057 INFO L290 TraceCheckUtils]: 25: Hoare triple {18890#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {18890#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-08 11:29:29,057 INFO L290 TraceCheckUtils]: 24: Hoare triple {18890#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {18890#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-08 11:29:29,057 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {18505#true} {18890#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} #81#return; {18890#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-08 11:29:29,058 INFO L290 TraceCheckUtils]: 22: Hoare triple {18505#true} assume true; {18505#true} is VALID [2022-04-08 11:29:29,058 INFO L290 TraceCheckUtils]: 21: Hoare triple {18505#true} assume !(0 == ~cond); {18505#true} is VALID [2022-04-08 11:29:29,058 INFO L290 TraceCheckUtils]: 20: Hoare triple {18505#true} ~cond := #in~cond; {18505#true} is VALID [2022-04-08 11:29:29,058 INFO L272 TraceCheckUtils]: 19: Hoare triple {18890#(= (+ (* 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)); {18505#true} is VALID [2022-04-08 11:29:29,058 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {18505#true} {18890#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} #79#return; {18890#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-08 11:29:29,058 INFO L290 TraceCheckUtils]: 17: Hoare triple {18505#true} assume true; {18505#true} is VALID [2022-04-08 11:29:29,058 INFO L290 TraceCheckUtils]: 16: Hoare triple {18505#true} assume !(0 == ~cond); {18505#true} is VALID [2022-04-08 11:29:29,058 INFO L290 TraceCheckUtils]: 15: Hoare triple {18505#true} ~cond := #in~cond; {18505#true} is VALID [2022-04-08 11:29:29,059 INFO L272 TraceCheckUtils]: 14: Hoare triple {18890#(= (+ (* 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)); {18505#true} is VALID [2022-04-08 11:29:29,059 INFO L290 TraceCheckUtils]: 13: Hoare triple {18890#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} assume !!(#t~post6 < 100);havoc #t~post6; {18890#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-08 11:29:29,059 INFO L290 TraceCheckUtils]: 12: Hoare triple {18890#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {18890#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-08 11:29:29,059 INFO L290 TraceCheckUtils]: 11: Hoare triple {18505#true} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {18890#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-08 11:29:29,059 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {18505#true} {18505#true} #77#return; {18505#true} is VALID [2022-04-08 11:29:29,060 INFO L290 TraceCheckUtils]: 9: Hoare triple {18505#true} assume true; {18505#true} is VALID [2022-04-08 11:29:29,060 INFO L290 TraceCheckUtils]: 8: Hoare triple {18505#true} assume !(0 == ~cond); {18505#true} is VALID [2022-04-08 11:29:29,060 INFO L290 TraceCheckUtils]: 7: Hoare triple {18505#true} ~cond := #in~cond; {18505#true} is VALID [2022-04-08 11:29:29,060 INFO L272 TraceCheckUtils]: 6: Hoare triple {18505#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {18505#true} is VALID [2022-04-08 11:29:29,060 INFO L290 TraceCheckUtils]: 5: Hoare triple {18505#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; {18505#true} is VALID [2022-04-08 11:29:29,060 INFO L272 TraceCheckUtils]: 4: Hoare triple {18505#true} call #t~ret8 := main(); {18505#true} is VALID [2022-04-08 11:29:29,060 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18505#true} {18505#true} #93#return; {18505#true} is VALID [2022-04-08 11:29:29,060 INFO L290 TraceCheckUtils]: 2: Hoare triple {18505#true} assume true; {18505#true} is VALID [2022-04-08 11:29:29,060 INFO L290 TraceCheckUtils]: 1: Hoare triple {18505#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; {18505#true} is VALID [2022-04-08 11:29:29,060 INFO L272 TraceCheckUtils]: 0: Hoare triple {18505#true} call ULTIMATE.init(); {18505#true} is VALID [2022-04-08 11:29:29,061 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-08 11:29:29,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:29:29,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294387841] [2022-04-08 11:29:29,061 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:29:29,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1290496833] [2022-04-08 11:29:29,061 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1290496833] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 11:29:29,061 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 11:29:29,061 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 13 [2022-04-08 11:29:29,061 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:29:29,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [79998220] [2022-04-08 11:29:29,061 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [79998220] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:29:29,061 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:29:29,062 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-08 11:29:29,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917176810] [2022-04-08 11:29:29,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:29:29,062 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-08 11:29:29,062 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:29:29,062 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-08 11:29:29,104 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-08 11:29:29,104 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-08 11:29:29,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:29:29,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-08 11:29:29,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2022-04-08 11:29:29,105 INFO L87 Difference]: Start difference. First operand 206 states and 252 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-08 11:29:31,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:29:31,044 INFO L93 Difference]: Finished difference Result 240 states and 299 transitions. [2022-04-08 11:29:31,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-08 11:29:31,044 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-08 11:29:31,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:29:31,044 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-08 11:29:31,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 110 transitions. [2022-04-08 11:29:31,046 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-08 11:29:31,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 110 transitions. [2022-04-08 11:29:31,048 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 110 transitions. [2022-04-08 11:29:31,166 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-08 11:29:31,170 INFO L225 Difference]: With dead ends: 240 [2022-04-08 11:29:31,170 INFO L226 Difference]: Without dead ends: 237 [2022-04-08 11:29:31,171 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 230 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2022-04-08 11:29:31,171 INFO L913 BasicCegarLoop]: 38 mSDtfsCounter, 39 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-08 11:29:31,171 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 169 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-08 11:29:31,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2022-04-08 11:29:31,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 234. [2022-04-08 11:29:31,527 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:29:31,528 INFO L82 GeneralOperation]: Start isEquivalent. First operand 237 states. Second operand has 234 states, 148 states have (on average 1.1554054054054055) internal successors, (171), 149 states have internal predecessors, (171), 61 states have call successors, (61), 26 states have call predecessors, (61), 24 states have return successors, (59), 58 states have call predecessors, (59), 59 states have call successors, (59) [2022-04-08 11:29:31,528 INFO L74 IsIncluded]: Start isIncluded. First operand 237 states. Second operand has 234 states, 148 states have (on average 1.1554054054054055) internal successors, (171), 149 states have internal predecessors, (171), 61 states have call successors, (61), 26 states have call predecessors, (61), 24 states have return successors, (59), 58 states have call predecessors, (59), 59 states have call successors, (59) [2022-04-08 11:29:31,528 INFO L87 Difference]: Start difference. First operand 237 states. Second operand has 234 states, 148 states have (on average 1.1554054054054055) internal successors, (171), 149 states have internal predecessors, (171), 61 states have call successors, (61), 26 states have call predecessors, (61), 24 states have return successors, (59), 58 states have call predecessors, (59), 59 states have call successors, (59) [2022-04-08 11:29:31,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:29:31,533 INFO L93 Difference]: Finished difference Result 237 states and 294 transitions. [2022-04-08 11:29:31,533 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 294 transitions. [2022-04-08 11:29:31,533 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:29:31,533 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:29:31,534 INFO L74 IsIncluded]: Start isIncluded. First operand has 234 states, 148 states have (on average 1.1554054054054055) internal successors, (171), 149 states have internal predecessors, (171), 61 states have call successors, (61), 26 states have call predecessors, (61), 24 states have return successors, (59), 58 states have call predecessors, (59), 59 states have call successors, (59) Second operand 237 states. [2022-04-08 11:29:31,534 INFO L87 Difference]: Start difference. First operand has 234 states, 148 states have (on average 1.1554054054054055) internal successors, (171), 149 states have internal predecessors, (171), 61 states have call successors, (61), 26 states have call predecessors, (61), 24 states have return successors, (59), 58 states have call predecessors, (59), 59 states have call successors, (59) Second operand 237 states. [2022-04-08 11:29:31,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:29:31,537 INFO L93 Difference]: Finished difference Result 237 states and 294 transitions. [2022-04-08 11:29:31,538 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 294 transitions. [2022-04-08 11:29:31,538 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:29:31,538 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:29:31,538 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:29:31,538 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:29:31,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 148 states have (on average 1.1554054054054055) internal successors, (171), 149 states have internal predecessors, (171), 61 states have call successors, (61), 26 states have call predecessors, (61), 24 states have return successors, (59), 58 states have call predecessors, (59), 59 states have call successors, (59) [2022-04-08 11:29:31,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 291 transitions. [2022-04-08 11:29:31,543 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 291 transitions. Word has length 122 [2022-04-08 11:29:31,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:29:31,544 INFO L478 AbstractCegarLoop]: Abstraction has 234 states and 291 transitions. [2022-04-08 11:29:31,544 INFO L479 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-08 11:29:31,544 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 234 states and 291 transitions. [2022-04-08 11:29:31,969 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 291 edges. 291 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:29:31,970 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 291 transitions. [2022-04-08 11:29:31,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2022-04-08 11:29:31,970 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:29:31,971 INFO L499 BasicCegarLoop]: 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-08 11:29:31,992 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-04-08 11:29:32,187 WARN L460 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-08 11:29:32,188 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:29:32,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:29:32,188 INFO L85 PathProgramCache]: Analyzing trace with hash -877539457, now seen corresponding path program 5 times [2022-04-08 11:29:32,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:29:32,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1816213045] [2022-04-08 11:29:59,457 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 11:29:59,457 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 11:29:59,457 INFO L85 PathProgramCache]: Analyzing trace with hash -877539457, now seen corresponding path program 6 times [2022-04-08 11:29:59,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:29:59,458 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918875603] [2022-04-08 11:29:59,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:29:59,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:29:59,469 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:29:59,469 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [210522789] [2022-04-08 11:29:59,470 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 11:29:59,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:29:59,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:29:59,470 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-08 11:29:59,472 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-08 11:29:59,527 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-08 11:29:59,527 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:29:59,528 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-08 11:29:59,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:29:59,544 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:29:59,779 INFO L272 TraceCheckUtils]: 0: Hoare triple {20675#true} call ULTIMATE.init(); {20675#true} is VALID [2022-04-08 11:29:59,779 INFO L290 TraceCheckUtils]: 1: Hoare triple {20675#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; {20675#true} is VALID [2022-04-08 11:29:59,779 INFO L290 TraceCheckUtils]: 2: Hoare triple {20675#true} assume true; {20675#true} is VALID [2022-04-08 11:29:59,779 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20675#true} {20675#true} #93#return; {20675#true} is VALID [2022-04-08 11:29:59,779 INFO L272 TraceCheckUtils]: 4: Hoare triple {20675#true} call #t~ret8 := main(); {20675#true} is VALID [2022-04-08 11:29:59,780 INFO L290 TraceCheckUtils]: 5: Hoare triple {20675#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; {20675#true} is VALID [2022-04-08 11:29:59,780 INFO L272 TraceCheckUtils]: 6: Hoare triple {20675#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {20675#true} is VALID [2022-04-08 11:29:59,780 INFO L290 TraceCheckUtils]: 7: Hoare triple {20675#true} ~cond := #in~cond; {20675#true} is VALID [2022-04-08 11:29:59,780 INFO L290 TraceCheckUtils]: 8: Hoare triple {20675#true} assume !(0 == ~cond); {20675#true} is VALID [2022-04-08 11:29:59,780 INFO L290 TraceCheckUtils]: 9: Hoare triple {20675#true} assume true; {20675#true} is VALID [2022-04-08 11:29:59,780 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {20675#true} {20675#true} #77#return; {20675#true} is VALID [2022-04-08 11:29:59,780 INFO L290 TraceCheckUtils]: 11: Hoare triple {20675#true} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {20675#true} is VALID [2022-04-08 11:29:59,780 INFO L290 TraceCheckUtils]: 12: Hoare triple {20675#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {20675#true} is VALID [2022-04-08 11:29:59,780 INFO L290 TraceCheckUtils]: 13: Hoare triple {20675#true} assume !!(#t~post6 < 100);havoc #t~post6; {20675#true} is VALID [2022-04-08 11:29:59,780 INFO L272 TraceCheckUtils]: 14: Hoare triple {20675#true} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {20675#true} is VALID [2022-04-08 11:29:59,780 INFO L290 TraceCheckUtils]: 15: Hoare triple {20675#true} ~cond := #in~cond; {20675#true} is VALID [2022-04-08 11:29:59,780 INFO L290 TraceCheckUtils]: 16: Hoare triple {20675#true} assume !(0 == ~cond); {20675#true} is VALID [2022-04-08 11:29:59,780 INFO L290 TraceCheckUtils]: 17: Hoare triple {20675#true} assume true; {20675#true} is VALID [2022-04-08 11:29:59,780 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {20675#true} {20675#true} #79#return; {20675#true} is VALID [2022-04-08 11:29:59,781 INFO L272 TraceCheckUtils]: 19: Hoare triple {20675#true} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {20675#true} is VALID [2022-04-08 11:29:59,781 INFO L290 TraceCheckUtils]: 20: Hoare triple {20675#true} ~cond := #in~cond; {20675#true} is VALID [2022-04-08 11:29:59,781 INFO L290 TraceCheckUtils]: 21: Hoare triple {20675#true} assume !(0 == ~cond); {20675#true} is VALID [2022-04-08 11:29:59,781 INFO L290 TraceCheckUtils]: 22: Hoare triple {20675#true} assume true; {20675#true} is VALID [2022-04-08 11:29:59,781 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {20675#true} {20675#true} #81#return; {20675#true} is VALID [2022-04-08 11:29:59,781 INFO L290 TraceCheckUtils]: 24: Hoare triple {20675#true} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {20675#true} is VALID [2022-04-08 11:29:59,781 INFO L290 TraceCheckUtils]: 25: Hoare triple {20675#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {20675#true} is VALID [2022-04-08 11:29:59,781 INFO L290 TraceCheckUtils]: 26: Hoare triple {20675#true} assume !!(#t~post7 < 100);havoc #t~post7; {20675#true} is VALID [2022-04-08 11:29:59,781 INFO L272 TraceCheckUtils]: 27: Hoare triple {20675#true} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {20675#true} is VALID [2022-04-08 11:29:59,781 INFO L290 TraceCheckUtils]: 28: Hoare triple {20675#true} ~cond := #in~cond; {20675#true} is VALID [2022-04-08 11:29:59,781 INFO L290 TraceCheckUtils]: 29: Hoare triple {20675#true} assume !(0 == ~cond); {20675#true} is VALID [2022-04-08 11:29:59,781 INFO L290 TraceCheckUtils]: 30: Hoare triple {20675#true} assume true; {20675#true} is VALID [2022-04-08 11:29:59,781 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {20675#true} {20675#true} #83#return; {20675#true} is VALID [2022-04-08 11:29:59,781 INFO L272 TraceCheckUtils]: 32: Hoare triple {20675#true} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {20675#true} is VALID [2022-04-08 11:29:59,782 INFO L290 TraceCheckUtils]: 33: Hoare triple {20675#true} ~cond := #in~cond; {20675#true} is VALID [2022-04-08 11:29:59,782 INFO L290 TraceCheckUtils]: 34: Hoare triple {20675#true} assume !(0 == ~cond); {20675#true} is VALID [2022-04-08 11:29:59,782 INFO L290 TraceCheckUtils]: 35: Hoare triple {20675#true} assume true; {20675#true} is VALID [2022-04-08 11:29:59,782 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {20675#true} {20675#true} #85#return; {20675#true} is VALID [2022-04-08 11:29:59,782 INFO L272 TraceCheckUtils]: 37: Hoare triple {20675#true} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {20675#true} is VALID [2022-04-08 11:29:59,782 INFO L290 TraceCheckUtils]: 38: Hoare triple {20675#true} ~cond := #in~cond; {20675#true} is VALID [2022-04-08 11:29:59,782 INFO L290 TraceCheckUtils]: 39: Hoare triple {20675#true} assume !(0 == ~cond); {20675#true} is VALID [2022-04-08 11:29:59,782 INFO L290 TraceCheckUtils]: 40: Hoare triple {20675#true} assume true; {20675#true} is VALID [2022-04-08 11:29:59,782 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {20675#true} {20675#true} #87#return; {20675#true} is VALID [2022-04-08 11:29:59,782 INFO L290 TraceCheckUtils]: 42: Hoare triple {20675#true} assume !!(~r~0 >= 2 * ~b~0); {20675#true} is VALID [2022-04-08 11:29:59,782 INFO L272 TraceCheckUtils]: 43: Hoare triple {20675#true} call __VERIFIER_assert((if ~r~0 >= 2 * ~y~0 * ~a~0 then 1 else 0)); {20675#true} is VALID [2022-04-08 11:29:59,782 INFO L290 TraceCheckUtils]: 44: Hoare triple {20675#true} ~cond := #in~cond; {20675#true} is VALID [2022-04-08 11:29:59,782 INFO L290 TraceCheckUtils]: 45: Hoare triple {20675#true} assume !(0 == ~cond); {20675#true} is VALID [2022-04-08 11:29:59,782 INFO L290 TraceCheckUtils]: 46: Hoare triple {20675#true} assume true; {20675#true} is VALID [2022-04-08 11:29:59,783 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {20675#true} {20675#true} #89#return; {20675#true} is VALID [2022-04-08 11:29:59,783 INFO L290 TraceCheckUtils]: 48: Hoare triple {20675#true} ~a~0 := 2 * ~a~0;~b~0 := 2 * ~b~0; {20675#true} is VALID [2022-04-08 11:29:59,783 INFO L290 TraceCheckUtils]: 49: Hoare triple {20675#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {20675#true} is VALID [2022-04-08 11:29:59,783 INFO L290 TraceCheckUtils]: 50: Hoare triple {20675#true} assume !!(#t~post7 < 100);havoc #t~post7; {20675#true} is VALID [2022-04-08 11:29:59,783 INFO L272 TraceCheckUtils]: 51: Hoare triple {20675#true} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {20675#true} is VALID [2022-04-08 11:29:59,783 INFO L290 TraceCheckUtils]: 52: Hoare triple {20675#true} ~cond := #in~cond; {20675#true} is VALID [2022-04-08 11:29:59,783 INFO L290 TraceCheckUtils]: 53: Hoare triple {20675#true} assume !(0 == ~cond); {20675#true} is VALID [2022-04-08 11:29:59,783 INFO L290 TraceCheckUtils]: 54: Hoare triple {20675#true} assume true; {20675#true} is VALID [2022-04-08 11:29:59,783 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {20675#true} {20675#true} #83#return; {20675#true} is VALID [2022-04-08 11:29:59,783 INFO L272 TraceCheckUtils]: 56: Hoare triple {20675#true} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {20675#true} is VALID [2022-04-08 11:29:59,783 INFO L290 TraceCheckUtils]: 57: Hoare triple {20675#true} ~cond := #in~cond; {20675#true} is VALID [2022-04-08 11:29:59,783 INFO L290 TraceCheckUtils]: 58: Hoare triple {20675#true} assume !(0 == ~cond); {20675#true} is VALID [2022-04-08 11:29:59,783 INFO L290 TraceCheckUtils]: 59: Hoare triple {20675#true} assume true; {20675#true} is VALID [2022-04-08 11:29:59,784 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {20675#true} {20675#true} #85#return; {20675#true} is VALID [2022-04-08 11:29:59,784 INFO L272 TraceCheckUtils]: 61: Hoare triple {20675#true} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {20675#true} is VALID [2022-04-08 11:29:59,784 INFO L290 TraceCheckUtils]: 62: Hoare triple {20675#true} ~cond := #in~cond; {20675#true} is VALID [2022-04-08 11:29:59,784 INFO L290 TraceCheckUtils]: 63: Hoare triple {20675#true} assume !(0 == ~cond); {20675#true} is VALID [2022-04-08 11:29:59,784 INFO L290 TraceCheckUtils]: 64: Hoare triple {20675#true} assume true; {20675#true} is VALID [2022-04-08 11:29:59,784 INFO L284 TraceCheckUtils]: 65: Hoare quadruple {20675#true} {20675#true} #87#return; {20675#true} is VALID [2022-04-08 11:29:59,784 INFO L290 TraceCheckUtils]: 66: Hoare triple {20675#true} assume !!(~r~0 >= 2 * ~b~0); {20675#true} is VALID [2022-04-08 11:29:59,784 INFO L272 TraceCheckUtils]: 67: Hoare triple {20675#true} call __VERIFIER_assert((if ~r~0 >= 2 * ~y~0 * ~a~0 then 1 else 0)); {20675#true} is VALID [2022-04-08 11:29:59,784 INFO L290 TraceCheckUtils]: 68: Hoare triple {20675#true} ~cond := #in~cond; {20675#true} is VALID [2022-04-08 11:29:59,784 INFO L290 TraceCheckUtils]: 69: Hoare triple {20675#true} assume !(0 == ~cond); {20675#true} is VALID [2022-04-08 11:29:59,784 INFO L290 TraceCheckUtils]: 70: Hoare triple {20675#true} assume true; {20675#true} is VALID [2022-04-08 11:29:59,784 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {20675#true} {20675#true} #89#return; {20675#true} is VALID [2022-04-08 11:29:59,784 INFO L290 TraceCheckUtils]: 72: Hoare triple {20675#true} ~a~0 := 2 * ~a~0;~b~0 := 2 * ~b~0; {20675#true} is VALID [2022-04-08 11:29:59,784 INFO L290 TraceCheckUtils]: 73: Hoare triple {20675#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {20675#true} is VALID [2022-04-08 11:29:59,784 INFO L290 TraceCheckUtils]: 74: Hoare triple {20675#true} assume !!(#t~post7 < 100);havoc #t~post7; {20675#true} is VALID [2022-04-08 11:29:59,785 INFO L272 TraceCheckUtils]: 75: Hoare triple {20675#true} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {20675#true} is VALID [2022-04-08 11:29:59,785 INFO L290 TraceCheckUtils]: 76: Hoare triple {20675#true} ~cond := #in~cond; {20675#true} is VALID [2022-04-08 11:29:59,785 INFO L290 TraceCheckUtils]: 77: Hoare triple {20675#true} assume !(0 == ~cond); {20675#true} is VALID [2022-04-08 11:29:59,785 INFO L290 TraceCheckUtils]: 78: Hoare triple {20675#true} assume true; {20675#true} is VALID [2022-04-08 11:29:59,785 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {20675#true} {20675#true} #83#return; {20675#true} is VALID [2022-04-08 11:29:59,785 INFO L272 TraceCheckUtils]: 80: Hoare triple {20675#true} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {20675#true} is VALID [2022-04-08 11:29:59,785 INFO L290 TraceCheckUtils]: 81: Hoare triple {20675#true} ~cond := #in~cond; {20675#true} is VALID [2022-04-08 11:29:59,785 INFO L290 TraceCheckUtils]: 82: Hoare triple {20675#true} assume !(0 == ~cond); {20675#true} is VALID [2022-04-08 11:29:59,785 INFO L290 TraceCheckUtils]: 83: Hoare triple {20675#true} assume true; {20675#true} is VALID [2022-04-08 11:29:59,785 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {20675#true} {20675#true} #85#return; {20675#true} is VALID [2022-04-08 11:29:59,785 INFO L272 TraceCheckUtils]: 85: Hoare triple {20675#true} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {20675#true} is VALID [2022-04-08 11:29:59,785 INFO L290 TraceCheckUtils]: 86: Hoare triple {20675#true} ~cond := #in~cond; {20675#true} is VALID [2022-04-08 11:29:59,785 INFO L290 TraceCheckUtils]: 87: Hoare triple {20675#true} assume !(0 == ~cond); {20675#true} is VALID [2022-04-08 11:29:59,785 INFO L290 TraceCheckUtils]: 88: Hoare triple {20675#true} assume true; {20675#true} is VALID [2022-04-08 11:29:59,786 INFO L284 TraceCheckUtils]: 89: Hoare quadruple {20675#true} {20675#true} #87#return; {20675#true} is VALID [2022-04-08 11:29:59,786 INFO L290 TraceCheckUtils]: 90: Hoare triple {20675#true} assume !(~r~0 >= 2 * ~b~0); {20675#true} is VALID [2022-04-08 11:29:59,786 INFO L290 TraceCheckUtils]: 91: Hoare triple {20675#true} ~r~0 := ~r~0 - ~b~0;~q~0 := ~q~0 + ~a~0; {20675#true} is VALID [2022-04-08 11:29:59,786 INFO L290 TraceCheckUtils]: 92: Hoare triple {20675#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {20675#true} is VALID [2022-04-08 11:29:59,786 INFO L290 TraceCheckUtils]: 93: Hoare triple {20675#true} assume !!(#t~post6 < 100);havoc #t~post6; {20675#true} is VALID [2022-04-08 11:29:59,786 INFO L272 TraceCheckUtils]: 94: Hoare triple {20675#true} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {20675#true} is VALID [2022-04-08 11:29:59,786 INFO L290 TraceCheckUtils]: 95: Hoare triple {20675#true} ~cond := #in~cond; {20675#true} is VALID [2022-04-08 11:29:59,786 INFO L290 TraceCheckUtils]: 96: Hoare triple {20675#true} assume !(0 == ~cond); {20675#true} is VALID [2022-04-08 11:29:59,786 INFO L290 TraceCheckUtils]: 97: Hoare triple {20675#true} assume true; {20675#true} is VALID [2022-04-08 11:29:59,786 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {20675#true} {20675#true} #79#return; {20675#true} is VALID [2022-04-08 11:29:59,786 INFO L272 TraceCheckUtils]: 99: Hoare triple {20675#true} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {20675#true} is VALID [2022-04-08 11:29:59,786 INFO L290 TraceCheckUtils]: 100: Hoare triple {20675#true} ~cond := #in~cond; {20675#true} is VALID [2022-04-08 11:29:59,786 INFO L290 TraceCheckUtils]: 101: Hoare triple {20675#true} assume !(0 == ~cond); {20675#true} is VALID [2022-04-08 11:29:59,786 INFO L290 TraceCheckUtils]: 102: Hoare triple {20675#true} assume true; {20675#true} is VALID [2022-04-08 11:29:59,787 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {20675#true} {20675#true} #81#return; {20675#true} is VALID [2022-04-08 11:29:59,787 INFO L290 TraceCheckUtils]: 104: Hoare triple {20675#true} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {20675#true} is VALID [2022-04-08 11:29:59,787 INFO L290 TraceCheckUtils]: 105: Hoare triple {20675#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {20995#(<= (+ |main_#t~post7| 1) ~counter~0)} is VALID [2022-04-08 11:29:59,788 INFO L290 TraceCheckUtils]: 106: Hoare triple {20995#(<= (+ |main_#t~post7| 1) ~counter~0)} assume !(#t~post7 < 100);havoc #t~post7; {20999#(<= 101 ~counter~0)} is VALID [2022-04-08 11:29:59,788 INFO L290 TraceCheckUtils]: 107: Hoare triple {20999#(<= 101 ~counter~0)} ~r~0 := ~r~0 - ~b~0;~q~0 := ~q~0 + ~a~0; {20999#(<= 101 ~counter~0)} is VALID [2022-04-08 11:29:59,788 INFO L290 TraceCheckUtils]: 108: Hoare triple {20999#(<= 101 ~counter~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {21006#(<= 101 |main_#t~post6|)} is VALID [2022-04-08 11:29:59,796 INFO L290 TraceCheckUtils]: 109: Hoare triple {21006#(<= 101 |main_#t~post6|)} assume !!(#t~post6 < 100);havoc #t~post6; {20676#false} is VALID [2022-04-08 11:29:59,796 INFO L272 TraceCheckUtils]: 110: Hoare triple {20676#false} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {20676#false} is VALID [2022-04-08 11:29:59,796 INFO L290 TraceCheckUtils]: 111: Hoare triple {20676#false} ~cond := #in~cond; {20676#false} is VALID [2022-04-08 11:29:59,796 INFO L290 TraceCheckUtils]: 112: Hoare triple {20676#false} assume !(0 == ~cond); {20676#false} is VALID [2022-04-08 11:29:59,796 INFO L290 TraceCheckUtils]: 113: Hoare triple {20676#false} assume true; {20676#false} is VALID [2022-04-08 11:29:59,796 INFO L284 TraceCheckUtils]: 114: Hoare quadruple {20676#false} {20676#false} #79#return; {20676#false} is VALID [2022-04-08 11:29:59,796 INFO L272 TraceCheckUtils]: 115: Hoare triple {20676#false} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {20676#false} is VALID [2022-04-08 11:29:59,796 INFO L290 TraceCheckUtils]: 116: Hoare triple {20676#false} ~cond := #in~cond; {20676#false} is VALID [2022-04-08 11:29:59,797 INFO L290 TraceCheckUtils]: 117: Hoare triple {20676#false} assume !(0 == ~cond); {20676#false} is VALID [2022-04-08 11:29:59,797 INFO L290 TraceCheckUtils]: 118: Hoare triple {20676#false} assume true; {20676#false} is VALID [2022-04-08 11:29:59,797 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {20676#false} {20676#false} #81#return; {20676#false} is VALID [2022-04-08 11:29:59,797 INFO L290 TraceCheckUtils]: 120: Hoare triple {20676#false} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {20676#false} is VALID [2022-04-08 11:29:59,797 INFO L290 TraceCheckUtils]: 121: Hoare triple {20676#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {20676#false} is VALID [2022-04-08 11:29:59,797 INFO L290 TraceCheckUtils]: 122: Hoare triple {20676#false} assume !(#t~post7 < 100);havoc #t~post7; {20676#false} is VALID [2022-04-08 11:29:59,797 INFO L290 TraceCheckUtils]: 123: Hoare triple {20676#false} ~r~0 := ~r~0 - ~b~0;~q~0 := ~q~0 + ~a~0; {20676#false} is VALID [2022-04-08 11:29:59,797 INFO L290 TraceCheckUtils]: 124: Hoare triple {20676#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {20676#false} is VALID [2022-04-08 11:29:59,797 INFO L290 TraceCheckUtils]: 125: Hoare triple {20676#false} assume !(#t~post6 < 100);havoc #t~post6; {20676#false} is VALID [2022-04-08 11:29:59,797 INFO L272 TraceCheckUtils]: 126: Hoare triple {20676#false} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {20676#false} is VALID [2022-04-08 11:29:59,797 INFO L290 TraceCheckUtils]: 127: Hoare triple {20676#false} ~cond := #in~cond; {20676#false} is VALID [2022-04-08 11:29:59,797 INFO L290 TraceCheckUtils]: 128: Hoare triple {20676#false} assume 0 == ~cond; {20676#false} is VALID [2022-04-08 11:29:59,797 INFO L290 TraceCheckUtils]: 129: Hoare triple {20676#false} assume !false; {20676#false} is VALID [2022-04-08 11:29:59,798 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-08 11:29:59,798 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 11:29:59,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:29:59,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918875603] [2022-04-08 11:29:59,798 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:29:59,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [210522789] [2022-04-08 11:29:59,798 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [210522789] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:29:59,798 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:29:59,798 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 11:29:59,799 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:29:59,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1816213045] [2022-04-08 11:29:59,799 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1816213045] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:29:59,799 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:29:59,799 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 11:29:59,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390270633] [2022-04-08 11:29:59,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:29:59,800 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-08 11:29:59,800 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:29:59,801 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-08 11:29:59,837 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-08 11:29:59,837 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 11:29:59,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:29:59,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 11:29:59,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 11:29:59,837 INFO L87 Difference]: Start difference. First operand 234 states and 291 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-08 11:30:00,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:30:00,424 INFO L93 Difference]: Finished difference Result 316 states and 400 transitions. [2022-04-08 11:30:00,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 11:30:00,424 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-08 11:30:00,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:30:00,424 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-08 11:30:00,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 82 transitions. [2022-04-08 11:30:00,425 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-08 11:30:00,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 82 transitions. [2022-04-08 11:30:00,426 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 82 transitions. [2022-04-08 11:30:00,482 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-08 11:30:00,486 INFO L225 Difference]: With dead ends: 316 [2022-04-08 11:30:00,486 INFO L226 Difference]: Without dead ends: 219 [2022-04-08 11:30:00,486 INFO L912 BasicCegarLoop]: 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-08 11:30:00,486 INFO L913 BasicCegarLoop]: 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-08 11:30:00,487 INFO L914 BasicCegarLoop]: 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-08 11:30:00,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2022-04-08 11:30:00,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 211. [2022-04-08 11:30:00,773 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:30:00,774 INFO L82 GeneralOperation]: Start isEquivalent. First operand 219 states. Second operand has 211 states, 134 states have (on average 1.1194029850746268) internal successors, (150), 136 states have internal predecessors, (150), 52 states have call successors, (52), 26 states have call predecessors, (52), 24 states have return successors, (49), 48 states have call predecessors, (49), 49 states have call successors, (49) [2022-04-08 11:30:00,774 INFO L74 IsIncluded]: Start isIncluded. First operand 219 states. Second operand has 211 states, 134 states have (on average 1.1194029850746268) internal successors, (150), 136 states have internal predecessors, (150), 52 states have call successors, (52), 26 states have call predecessors, (52), 24 states have return successors, (49), 48 states have call predecessors, (49), 49 states have call successors, (49) [2022-04-08 11:30:00,775 INFO L87 Difference]: Start difference. First operand 219 states. Second operand has 211 states, 134 states have (on average 1.1194029850746268) internal successors, (150), 136 states have internal predecessors, (150), 52 states have call successors, (52), 26 states have call predecessors, (52), 24 states have return successors, (49), 48 states have call predecessors, (49), 49 states have call successors, (49) [2022-04-08 11:30:00,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:30:00,778 INFO L93 Difference]: Finished difference Result 219 states and 258 transitions. [2022-04-08 11:30:00,778 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 258 transitions. [2022-04-08 11:30:00,779 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:30:00,779 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:30:00,779 INFO L74 IsIncluded]: Start isIncluded. First operand has 211 states, 134 states have (on average 1.1194029850746268) internal successors, (150), 136 states have internal predecessors, (150), 52 states have call successors, (52), 26 states have call predecessors, (52), 24 states have return successors, (49), 48 states have call predecessors, (49), 49 states have call successors, (49) Second operand 219 states. [2022-04-08 11:30:00,779 INFO L87 Difference]: Start difference. First operand has 211 states, 134 states have (on average 1.1194029850746268) internal successors, (150), 136 states have internal predecessors, (150), 52 states have call successors, (52), 26 states have call predecessors, (52), 24 states have return successors, (49), 48 states have call predecessors, (49), 49 states have call successors, (49) Second operand 219 states. [2022-04-08 11:30:00,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:30:00,783 INFO L93 Difference]: Finished difference Result 219 states and 258 transitions. [2022-04-08 11:30:00,783 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 258 transitions. [2022-04-08 11:30:00,783 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:30:00,783 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:30:00,783 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:30:00,783 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:30:00,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 134 states have (on average 1.1194029850746268) internal successors, (150), 136 states have internal predecessors, (150), 52 states have call successors, (52), 26 states have call predecessors, (52), 24 states have return successors, (49), 48 states have call predecessors, (49), 49 states have call successors, (49) [2022-04-08 11:30:00,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 251 transitions. [2022-04-08 11:30:00,787 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 251 transitions. Word has length 130 [2022-04-08 11:30:00,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:30:00,787 INFO L478 AbstractCegarLoop]: Abstraction has 211 states and 251 transitions. [2022-04-08 11:30:00,788 INFO L479 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-08 11:30:00,788 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 211 states and 251 transitions. [2022-04-08 11:30:01,179 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 251 edges. 251 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:30:01,179 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 251 transitions. [2022-04-08 11:30:01,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-04-08 11:30:01,180 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:30:01,180 INFO L499 BasicCegarLoop]: 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-08 11:30:01,198 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2022-04-08 11:30:01,381 WARN L460 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-08 11:30:01,381 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:30:01,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:30:01,381 INFO L85 PathProgramCache]: Analyzing trace with hash 518951120, now seen corresponding path program 7 times [2022-04-08 11:30:01,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:30:01,381 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2124253156] [2022-04-08 11:30:38,828 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 11:30:38,828 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 11:30:38,829 INFO L85 PathProgramCache]: Analyzing trace with hash 518951120, now seen corresponding path program 8 times [2022-04-08 11:30:38,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:30:38,829 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881721744] [2022-04-08 11:30:38,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:30:38,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:30:38,842 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:30:38,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1317468008] [2022-04-08 11:30:38,843 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 11:30:38,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:30:38,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:30:38,844 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-08 11:30:38,845 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-08 11:30:38,936 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 11:30:38,936 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:30:38,937 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-08 11:30:38,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:30:38,961 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:30:39,701 INFO L272 TraceCheckUtils]: 0: Hoare triple {22563#true} call ULTIMATE.init(); {22563#true} is VALID [2022-04-08 11:30:39,702 INFO L290 TraceCheckUtils]: 1: Hoare triple {22563#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; {22571#(<= ~counter~0 0)} is VALID [2022-04-08 11:30:39,703 INFO L290 TraceCheckUtils]: 2: Hoare triple {22571#(<= ~counter~0 0)} assume true; {22571#(<= ~counter~0 0)} is VALID [2022-04-08 11:30:39,703 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22571#(<= ~counter~0 0)} {22563#true} #93#return; {22571#(<= ~counter~0 0)} is VALID [2022-04-08 11:30:39,703 INFO L272 TraceCheckUtils]: 4: Hoare triple {22571#(<= ~counter~0 0)} call #t~ret8 := main(); {22571#(<= ~counter~0 0)} is VALID [2022-04-08 11:30:39,703 INFO L290 TraceCheckUtils]: 5: Hoare triple {22571#(<= ~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; {22571#(<= ~counter~0 0)} is VALID [2022-04-08 11:30:39,704 INFO L272 TraceCheckUtils]: 6: Hoare triple {22571#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {22571#(<= ~counter~0 0)} is VALID [2022-04-08 11:30:39,704 INFO L290 TraceCheckUtils]: 7: Hoare triple {22571#(<= ~counter~0 0)} ~cond := #in~cond; {22571#(<= ~counter~0 0)} is VALID [2022-04-08 11:30:39,704 INFO L290 TraceCheckUtils]: 8: Hoare triple {22571#(<= ~counter~0 0)} assume !(0 == ~cond); {22571#(<= ~counter~0 0)} is VALID [2022-04-08 11:30:39,705 INFO L290 TraceCheckUtils]: 9: Hoare triple {22571#(<= ~counter~0 0)} assume true; {22571#(<= ~counter~0 0)} is VALID [2022-04-08 11:30:39,705 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {22571#(<= ~counter~0 0)} {22571#(<= ~counter~0 0)} #77#return; {22571#(<= ~counter~0 0)} is VALID [2022-04-08 11:30:39,705 INFO L290 TraceCheckUtils]: 11: Hoare triple {22571#(<= ~counter~0 0)} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {22571#(<= ~counter~0 0)} is VALID [2022-04-08 11:30:39,706 INFO L290 TraceCheckUtils]: 12: Hoare triple {22571#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {22605#(<= ~counter~0 1)} is VALID [2022-04-08 11:30:39,707 INFO L290 TraceCheckUtils]: 13: Hoare triple {22605#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {22605#(<= ~counter~0 1)} is VALID [2022-04-08 11:30:39,707 INFO L272 TraceCheckUtils]: 14: Hoare triple {22605#(<= ~counter~0 1)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {22605#(<= ~counter~0 1)} is VALID [2022-04-08 11:30:39,707 INFO L290 TraceCheckUtils]: 15: Hoare triple {22605#(<= ~counter~0 1)} ~cond := #in~cond; {22605#(<= ~counter~0 1)} is VALID [2022-04-08 11:30:39,708 INFO L290 TraceCheckUtils]: 16: Hoare triple {22605#(<= ~counter~0 1)} assume !(0 == ~cond); {22605#(<= ~counter~0 1)} is VALID [2022-04-08 11:30:39,708 INFO L290 TraceCheckUtils]: 17: Hoare triple {22605#(<= ~counter~0 1)} assume true; {22605#(<= ~counter~0 1)} is VALID [2022-04-08 11:30:39,708 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {22605#(<= ~counter~0 1)} {22605#(<= ~counter~0 1)} #79#return; {22605#(<= ~counter~0 1)} is VALID [2022-04-08 11:30:39,709 INFO L272 TraceCheckUtils]: 19: Hoare triple {22605#(<= ~counter~0 1)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {22605#(<= ~counter~0 1)} is VALID [2022-04-08 11:30:39,709 INFO L290 TraceCheckUtils]: 20: Hoare triple {22605#(<= ~counter~0 1)} ~cond := #in~cond; {22605#(<= ~counter~0 1)} is VALID [2022-04-08 11:30:39,709 INFO L290 TraceCheckUtils]: 21: Hoare triple {22605#(<= ~counter~0 1)} assume !(0 == ~cond); {22605#(<= ~counter~0 1)} is VALID [2022-04-08 11:30:39,710 INFO L290 TraceCheckUtils]: 22: Hoare triple {22605#(<= ~counter~0 1)} assume true; {22605#(<= ~counter~0 1)} is VALID [2022-04-08 11:30:39,710 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {22605#(<= ~counter~0 1)} {22605#(<= ~counter~0 1)} #81#return; {22605#(<= ~counter~0 1)} is VALID [2022-04-08 11:30:39,710 INFO L290 TraceCheckUtils]: 24: Hoare triple {22605#(<= ~counter~0 1)} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {22605#(<= ~counter~0 1)} is VALID [2022-04-08 11:30:39,711 INFO L290 TraceCheckUtils]: 25: Hoare triple {22605#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {22645#(<= ~counter~0 2)} is VALID [2022-04-08 11:30:39,711 INFO L290 TraceCheckUtils]: 26: Hoare triple {22645#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {22645#(<= ~counter~0 2)} is VALID [2022-04-08 11:30:39,712 INFO L272 TraceCheckUtils]: 27: Hoare triple {22645#(<= ~counter~0 2)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {22645#(<= ~counter~0 2)} is VALID [2022-04-08 11:30:39,712 INFO L290 TraceCheckUtils]: 28: Hoare triple {22645#(<= ~counter~0 2)} ~cond := #in~cond; {22645#(<= ~counter~0 2)} is VALID [2022-04-08 11:30:39,712 INFO L290 TraceCheckUtils]: 29: Hoare triple {22645#(<= ~counter~0 2)} assume !(0 == ~cond); {22645#(<= ~counter~0 2)} is VALID [2022-04-08 11:30:39,713 INFO L290 TraceCheckUtils]: 30: Hoare triple {22645#(<= ~counter~0 2)} assume true; {22645#(<= ~counter~0 2)} is VALID [2022-04-08 11:30:39,713 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {22645#(<= ~counter~0 2)} {22645#(<= ~counter~0 2)} #83#return; {22645#(<= ~counter~0 2)} is VALID [2022-04-08 11:30:39,714 INFO L272 TraceCheckUtils]: 32: Hoare triple {22645#(<= ~counter~0 2)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {22645#(<= ~counter~0 2)} is VALID [2022-04-08 11:30:39,714 INFO L290 TraceCheckUtils]: 33: Hoare triple {22645#(<= ~counter~0 2)} ~cond := #in~cond; {22645#(<= ~counter~0 2)} is VALID [2022-04-08 11:30:39,714 INFO L290 TraceCheckUtils]: 34: Hoare triple {22645#(<= ~counter~0 2)} assume !(0 == ~cond); {22645#(<= ~counter~0 2)} is VALID [2022-04-08 11:30:39,714 INFO L290 TraceCheckUtils]: 35: Hoare triple {22645#(<= ~counter~0 2)} assume true; {22645#(<= ~counter~0 2)} is VALID [2022-04-08 11:30:39,715 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {22645#(<= ~counter~0 2)} {22645#(<= ~counter~0 2)} #85#return; {22645#(<= ~counter~0 2)} is VALID [2022-04-08 11:30:39,715 INFO L272 TraceCheckUtils]: 37: Hoare triple {22645#(<= ~counter~0 2)} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {22645#(<= ~counter~0 2)} is VALID [2022-04-08 11:30:39,716 INFO L290 TraceCheckUtils]: 38: Hoare triple {22645#(<= ~counter~0 2)} ~cond := #in~cond; {22645#(<= ~counter~0 2)} is VALID [2022-04-08 11:30:39,716 INFO L290 TraceCheckUtils]: 39: Hoare triple {22645#(<= ~counter~0 2)} assume !(0 == ~cond); {22645#(<= ~counter~0 2)} is VALID [2022-04-08 11:30:39,716 INFO L290 TraceCheckUtils]: 40: Hoare triple {22645#(<= ~counter~0 2)} assume true; {22645#(<= ~counter~0 2)} is VALID [2022-04-08 11:30:39,716 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {22645#(<= ~counter~0 2)} {22645#(<= ~counter~0 2)} #87#return; {22645#(<= ~counter~0 2)} is VALID [2022-04-08 11:30:39,717 INFO L290 TraceCheckUtils]: 42: Hoare triple {22645#(<= ~counter~0 2)} assume !!(~r~0 >= 2 * ~b~0); {22645#(<= ~counter~0 2)} is VALID [2022-04-08 11:30:39,717 INFO L272 TraceCheckUtils]: 43: Hoare triple {22645#(<= ~counter~0 2)} call __VERIFIER_assert((if ~r~0 >= 2 * ~y~0 * ~a~0 then 1 else 0)); {22645#(<= ~counter~0 2)} is VALID [2022-04-08 11:30:39,718 INFO L290 TraceCheckUtils]: 44: Hoare triple {22645#(<= ~counter~0 2)} ~cond := #in~cond; {22645#(<= ~counter~0 2)} is VALID [2022-04-08 11:30:39,718 INFO L290 TraceCheckUtils]: 45: Hoare triple {22645#(<= ~counter~0 2)} assume !(0 == ~cond); {22645#(<= ~counter~0 2)} is VALID [2022-04-08 11:30:39,718 INFO L290 TraceCheckUtils]: 46: Hoare triple {22645#(<= ~counter~0 2)} assume true; {22645#(<= ~counter~0 2)} is VALID [2022-04-08 11:30:39,719 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {22645#(<= ~counter~0 2)} {22645#(<= ~counter~0 2)} #89#return; {22645#(<= ~counter~0 2)} is VALID [2022-04-08 11:30:39,719 INFO L290 TraceCheckUtils]: 48: Hoare triple {22645#(<= ~counter~0 2)} ~a~0 := 2 * ~a~0;~b~0 := 2 * ~b~0; {22645#(<= ~counter~0 2)} is VALID [2022-04-08 11:30:39,720 INFO L290 TraceCheckUtils]: 49: Hoare triple {22645#(<= ~counter~0 2)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {22718#(<= ~counter~0 3)} is VALID [2022-04-08 11:30:39,720 INFO L290 TraceCheckUtils]: 50: Hoare triple {22718#(<= ~counter~0 3)} assume !!(#t~post7 < 100);havoc #t~post7; {22718#(<= ~counter~0 3)} is VALID [2022-04-08 11:30:39,721 INFO L272 TraceCheckUtils]: 51: Hoare triple {22718#(<= ~counter~0 3)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {22718#(<= ~counter~0 3)} is VALID [2022-04-08 11:30:39,721 INFO L290 TraceCheckUtils]: 52: Hoare triple {22718#(<= ~counter~0 3)} ~cond := #in~cond; {22718#(<= ~counter~0 3)} is VALID [2022-04-08 11:30:39,721 INFO L290 TraceCheckUtils]: 53: Hoare triple {22718#(<= ~counter~0 3)} assume !(0 == ~cond); {22718#(<= ~counter~0 3)} is VALID [2022-04-08 11:30:39,722 INFO L290 TraceCheckUtils]: 54: Hoare triple {22718#(<= ~counter~0 3)} assume true; {22718#(<= ~counter~0 3)} is VALID [2022-04-08 11:30:39,722 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {22718#(<= ~counter~0 3)} {22718#(<= ~counter~0 3)} #83#return; {22718#(<= ~counter~0 3)} is VALID [2022-04-08 11:30:39,723 INFO L272 TraceCheckUtils]: 56: Hoare triple {22718#(<= ~counter~0 3)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {22718#(<= ~counter~0 3)} is VALID [2022-04-08 11:30:39,723 INFO L290 TraceCheckUtils]: 57: Hoare triple {22718#(<= ~counter~0 3)} ~cond := #in~cond; {22718#(<= ~counter~0 3)} is VALID [2022-04-08 11:30:39,723 INFO L290 TraceCheckUtils]: 58: Hoare triple {22718#(<= ~counter~0 3)} assume !(0 == ~cond); {22718#(<= ~counter~0 3)} is VALID [2022-04-08 11:30:39,724 INFO L290 TraceCheckUtils]: 59: Hoare triple {22718#(<= ~counter~0 3)} assume true; {22718#(<= ~counter~0 3)} is VALID [2022-04-08 11:30:39,724 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {22718#(<= ~counter~0 3)} {22718#(<= ~counter~0 3)} #85#return; {22718#(<= ~counter~0 3)} is VALID [2022-04-08 11:30:39,725 INFO L272 TraceCheckUtils]: 61: Hoare triple {22718#(<= ~counter~0 3)} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {22718#(<= ~counter~0 3)} is VALID [2022-04-08 11:30:39,725 INFO L290 TraceCheckUtils]: 62: Hoare triple {22718#(<= ~counter~0 3)} ~cond := #in~cond; {22718#(<= ~counter~0 3)} is VALID [2022-04-08 11:30:39,725 INFO L290 TraceCheckUtils]: 63: Hoare triple {22718#(<= ~counter~0 3)} assume !(0 == ~cond); {22718#(<= ~counter~0 3)} is VALID [2022-04-08 11:30:39,725 INFO L290 TraceCheckUtils]: 64: Hoare triple {22718#(<= ~counter~0 3)} assume true; {22718#(<= ~counter~0 3)} is VALID [2022-04-08 11:30:39,726 INFO L284 TraceCheckUtils]: 65: Hoare quadruple {22718#(<= ~counter~0 3)} {22718#(<= ~counter~0 3)} #87#return; {22718#(<= ~counter~0 3)} is VALID [2022-04-08 11:30:39,726 INFO L290 TraceCheckUtils]: 66: Hoare triple {22718#(<= ~counter~0 3)} assume !!(~r~0 >= 2 * ~b~0); {22718#(<= ~counter~0 3)} is VALID [2022-04-08 11:30:39,727 INFO L272 TraceCheckUtils]: 67: Hoare triple {22718#(<= ~counter~0 3)} call __VERIFIER_assert((if ~r~0 >= 2 * ~y~0 * ~a~0 then 1 else 0)); {22718#(<= ~counter~0 3)} is VALID [2022-04-08 11:30:39,727 INFO L290 TraceCheckUtils]: 68: Hoare triple {22718#(<= ~counter~0 3)} ~cond := #in~cond; {22718#(<= ~counter~0 3)} is VALID [2022-04-08 11:30:39,727 INFO L290 TraceCheckUtils]: 69: Hoare triple {22718#(<= ~counter~0 3)} assume !(0 == ~cond); {22718#(<= ~counter~0 3)} is VALID [2022-04-08 11:30:39,728 INFO L290 TraceCheckUtils]: 70: Hoare triple {22718#(<= ~counter~0 3)} assume true; {22718#(<= ~counter~0 3)} is VALID [2022-04-08 11:30:39,728 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {22718#(<= ~counter~0 3)} {22718#(<= ~counter~0 3)} #89#return; {22718#(<= ~counter~0 3)} is VALID [2022-04-08 11:30:39,728 INFO L290 TraceCheckUtils]: 72: Hoare triple {22718#(<= ~counter~0 3)} ~a~0 := 2 * ~a~0;~b~0 := 2 * ~b~0; {22718#(<= ~counter~0 3)} is VALID [2022-04-08 11:30:39,729 INFO L290 TraceCheckUtils]: 73: Hoare triple {22718#(<= ~counter~0 3)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {22791#(<= ~counter~0 4)} is VALID [2022-04-08 11:30:39,729 INFO L290 TraceCheckUtils]: 74: Hoare triple {22791#(<= ~counter~0 4)} assume !!(#t~post7 < 100);havoc #t~post7; {22791#(<= ~counter~0 4)} is VALID [2022-04-08 11:30:39,730 INFO L272 TraceCheckUtils]: 75: Hoare triple {22791#(<= ~counter~0 4)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {22791#(<= ~counter~0 4)} is VALID [2022-04-08 11:30:39,730 INFO L290 TraceCheckUtils]: 76: Hoare triple {22791#(<= ~counter~0 4)} ~cond := #in~cond; {22791#(<= ~counter~0 4)} is VALID [2022-04-08 11:30:39,731 INFO L290 TraceCheckUtils]: 77: Hoare triple {22791#(<= ~counter~0 4)} assume !(0 == ~cond); {22791#(<= ~counter~0 4)} is VALID [2022-04-08 11:30:39,731 INFO L290 TraceCheckUtils]: 78: Hoare triple {22791#(<= ~counter~0 4)} assume true; {22791#(<= ~counter~0 4)} is VALID [2022-04-08 11:30:39,731 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {22791#(<= ~counter~0 4)} {22791#(<= ~counter~0 4)} #83#return; {22791#(<= ~counter~0 4)} is VALID [2022-04-08 11:30:39,732 INFO L272 TraceCheckUtils]: 80: Hoare triple {22791#(<= ~counter~0 4)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {22791#(<= ~counter~0 4)} is VALID [2022-04-08 11:30:39,732 INFO L290 TraceCheckUtils]: 81: Hoare triple {22791#(<= ~counter~0 4)} ~cond := #in~cond; {22791#(<= ~counter~0 4)} is VALID [2022-04-08 11:30:39,733 INFO L290 TraceCheckUtils]: 82: Hoare triple {22791#(<= ~counter~0 4)} assume !(0 == ~cond); {22791#(<= ~counter~0 4)} is VALID [2022-04-08 11:30:39,733 INFO L290 TraceCheckUtils]: 83: Hoare triple {22791#(<= ~counter~0 4)} assume true; {22791#(<= ~counter~0 4)} is VALID [2022-04-08 11:30:39,733 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {22791#(<= ~counter~0 4)} {22791#(<= ~counter~0 4)} #85#return; {22791#(<= ~counter~0 4)} is VALID [2022-04-08 11:30:39,734 INFO L272 TraceCheckUtils]: 85: Hoare triple {22791#(<= ~counter~0 4)} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {22791#(<= ~counter~0 4)} is VALID [2022-04-08 11:30:39,734 INFO L290 TraceCheckUtils]: 86: Hoare triple {22791#(<= ~counter~0 4)} ~cond := #in~cond; {22791#(<= ~counter~0 4)} is VALID [2022-04-08 11:30:39,734 INFO L290 TraceCheckUtils]: 87: Hoare triple {22791#(<= ~counter~0 4)} assume !(0 == ~cond); {22791#(<= ~counter~0 4)} is VALID [2022-04-08 11:30:39,735 INFO L290 TraceCheckUtils]: 88: Hoare triple {22791#(<= ~counter~0 4)} assume true; {22791#(<= ~counter~0 4)} is VALID [2022-04-08 11:30:39,735 INFO L284 TraceCheckUtils]: 89: Hoare quadruple {22791#(<= ~counter~0 4)} {22791#(<= ~counter~0 4)} #87#return; {22791#(<= ~counter~0 4)} is VALID [2022-04-08 11:30:39,736 INFO L290 TraceCheckUtils]: 90: Hoare triple {22791#(<= ~counter~0 4)} assume !(~r~0 >= 2 * ~b~0); {22791#(<= ~counter~0 4)} is VALID [2022-04-08 11:30:39,736 INFO L290 TraceCheckUtils]: 91: Hoare triple {22791#(<= ~counter~0 4)} ~r~0 := ~r~0 - ~b~0;~q~0 := ~q~0 + ~a~0; {22791#(<= ~counter~0 4)} is VALID [2022-04-08 11:30:39,737 INFO L290 TraceCheckUtils]: 92: Hoare triple {22791#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {22849#(<= ~counter~0 5)} is VALID [2022-04-08 11:30:39,737 INFO L290 TraceCheckUtils]: 93: Hoare triple {22849#(<= ~counter~0 5)} assume !!(#t~post6 < 100);havoc #t~post6; {22849#(<= ~counter~0 5)} is VALID [2022-04-08 11:30:39,737 INFO L272 TraceCheckUtils]: 94: Hoare triple {22849#(<= ~counter~0 5)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {22849#(<= ~counter~0 5)} is VALID [2022-04-08 11:30:39,738 INFO L290 TraceCheckUtils]: 95: Hoare triple {22849#(<= ~counter~0 5)} ~cond := #in~cond; {22849#(<= ~counter~0 5)} is VALID [2022-04-08 11:30:39,738 INFO L290 TraceCheckUtils]: 96: Hoare triple {22849#(<= ~counter~0 5)} assume !(0 == ~cond); {22849#(<= ~counter~0 5)} is VALID [2022-04-08 11:30:39,738 INFO L290 TraceCheckUtils]: 97: Hoare triple {22849#(<= ~counter~0 5)} assume true; {22849#(<= ~counter~0 5)} is VALID [2022-04-08 11:30:39,739 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {22849#(<= ~counter~0 5)} {22849#(<= ~counter~0 5)} #79#return; {22849#(<= ~counter~0 5)} is VALID [2022-04-08 11:30:39,739 INFO L272 TraceCheckUtils]: 99: Hoare triple {22849#(<= ~counter~0 5)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {22849#(<= ~counter~0 5)} is VALID [2022-04-08 11:30:39,739 INFO L290 TraceCheckUtils]: 100: Hoare triple {22849#(<= ~counter~0 5)} ~cond := #in~cond; {22849#(<= ~counter~0 5)} is VALID [2022-04-08 11:30:39,740 INFO L290 TraceCheckUtils]: 101: Hoare triple {22849#(<= ~counter~0 5)} assume !(0 == ~cond); {22849#(<= ~counter~0 5)} is VALID [2022-04-08 11:30:39,740 INFO L290 TraceCheckUtils]: 102: Hoare triple {22849#(<= ~counter~0 5)} assume true; {22849#(<= ~counter~0 5)} is VALID [2022-04-08 11:30:39,741 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {22849#(<= ~counter~0 5)} {22849#(<= ~counter~0 5)} #81#return; {22849#(<= ~counter~0 5)} is VALID [2022-04-08 11:30:39,741 INFO L290 TraceCheckUtils]: 104: Hoare triple {22849#(<= ~counter~0 5)} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {22849#(<= ~counter~0 5)} is VALID [2022-04-08 11:30:39,742 INFO L290 TraceCheckUtils]: 105: Hoare triple {22849#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {22889#(<= ~counter~0 6)} is VALID [2022-04-08 11:30:39,742 INFO L290 TraceCheckUtils]: 106: Hoare triple {22889#(<= ~counter~0 6)} assume !!(#t~post7 < 100);havoc #t~post7; {22889#(<= ~counter~0 6)} is VALID [2022-04-08 11:30:39,743 INFO L272 TraceCheckUtils]: 107: Hoare triple {22889#(<= ~counter~0 6)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {22889#(<= ~counter~0 6)} is VALID [2022-04-08 11:30:39,743 INFO L290 TraceCheckUtils]: 108: Hoare triple {22889#(<= ~counter~0 6)} ~cond := #in~cond; {22889#(<= ~counter~0 6)} is VALID [2022-04-08 11:30:39,743 INFO L290 TraceCheckUtils]: 109: Hoare triple {22889#(<= ~counter~0 6)} assume !(0 == ~cond); {22889#(<= ~counter~0 6)} is VALID [2022-04-08 11:30:39,743 INFO L290 TraceCheckUtils]: 110: Hoare triple {22889#(<= ~counter~0 6)} assume true; {22889#(<= ~counter~0 6)} is VALID [2022-04-08 11:30:39,744 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {22889#(<= ~counter~0 6)} {22889#(<= ~counter~0 6)} #83#return; {22889#(<= ~counter~0 6)} is VALID [2022-04-08 11:30:39,745 INFO L272 TraceCheckUtils]: 112: Hoare triple {22889#(<= ~counter~0 6)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {22889#(<= ~counter~0 6)} is VALID [2022-04-08 11:30:39,745 INFO L290 TraceCheckUtils]: 113: Hoare triple {22889#(<= ~counter~0 6)} ~cond := #in~cond; {22889#(<= ~counter~0 6)} is VALID [2022-04-08 11:30:39,745 INFO L290 TraceCheckUtils]: 114: Hoare triple {22889#(<= ~counter~0 6)} assume !(0 == ~cond); {22889#(<= ~counter~0 6)} is VALID [2022-04-08 11:30:39,746 INFO L290 TraceCheckUtils]: 115: Hoare triple {22889#(<= ~counter~0 6)} assume true; {22889#(<= ~counter~0 6)} is VALID [2022-04-08 11:30:39,746 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {22889#(<= ~counter~0 6)} {22889#(<= ~counter~0 6)} #85#return; {22889#(<= ~counter~0 6)} is VALID [2022-04-08 11:30:39,747 INFO L272 TraceCheckUtils]: 117: Hoare triple {22889#(<= ~counter~0 6)} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {22889#(<= ~counter~0 6)} is VALID [2022-04-08 11:30:39,747 INFO L290 TraceCheckUtils]: 118: Hoare triple {22889#(<= ~counter~0 6)} ~cond := #in~cond; {22889#(<= ~counter~0 6)} is VALID [2022-04-08 11:30:39,747 INFO L290 TraceCheckUtils]: 119: Hoare triple {22889#(<= ~counter~0 6)} assume !(0 == ~cond); {22889#(<= ~counter~0 6)} is VALID [2022-04-08 11:30:39,748 INFO L290 TraceCheckUtils]: 120: Hoare triple {22889#(<= ~counter~0 6)} assume true; {22889#(<= ~counter~0 6)} is VALID [2022-04-08 11:30:39,748 INFO L284 TraceCheckUtils]: 121: Hoare quadruple {22889#(<= ~counter~0 6)} {22889#(<= ~counter~0 6)} #87#return; {22889#(<= ~counter~0 6)} is VALID [2022-04-08 11:30:39,749 INFO L290 TraceCheckUtils]: 122: Hoare triple {22889#(<= ~counter~0 6)} assume !!(~r~0 >= 2 * ~b~0); {22889#(<= ~counter~0 6)} is VALID [2022-04-08 11:30:39,749 INFO L272 TraceCheckUtils]: 123: Hoare triple {22889#(<= ~counter~0 6)} call __VERIFIER_assert((if ~r~0 >= 2 * ~y~0 * ~a~0 then 1 else 0)); {22889#(<= ~counter~0 6)} is VALID [2022-04-08 11:30:39,750 INFO L290 TraceCheckUtils]: 124: Hoare triple {22889#(<= ~counter~0 6)} ~cond := #in~cond; {22889#(<= ~counter~0 6)} is VALID [2022-04-08 11:30:39,750 INFO L290 TraceCheckUtils]: 125: Hoare triple {22889#(<= ~counter~0 6)} assume !(0 == ~cond); {22889#(<= ~counter~0 6)} is VALID [2022-04-08 11:30:39,750 INFO L290 TraceCheckUtils]: 126: Hoare triple {22889#(<= ~counter~0 6)} assume true; {22889#(<= ~counter~0 6)} is VALID [2022-04-08 11:30:39,751 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {22889#(<= ~counter~0 6)} {22889#(<= ~counter~0 6)} #89#return; {22889#(<= ~counter~0 6)} is VALID [2022-04-08 11:30:39,751 INFO L290 TraceCheckUtils]: 128: Hoare triple {22889#(<= ~counter~0 6)} ~a~0 := 2 * ~a~0;~b~0 := 2 * ~b~0; {22889#(<= ~counter~0 6)} is VALID [2022-04-08 11:30:39,752 INFO L290 TraceCheckUtils]: 129: Hoare triple {22889#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {22962#(<= |main_#t~post7| 6)} is VALID [2022-04-08 11:30:39,752 INFO L290 TraceCheckUtils]: 130: Hoare triple {22962#(<= |main_#t~post7| 6)} assume !(#t~post7 < 100);havoc #t~post7; {22564#false} is VALID [2022-04-08 11:30:39,752 INFO L290 TraceCheckUtils]: 131: Hoare triple {22564#false} ~r~0 := ~r~0 - ~b~0;~q~0 := ~q~0 + ~a~0; {22564#false} is VALID [2022-04-08 11:30:39,752 INFO L290 TraceCheckUtils]: 132: Hoare triple {22564#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {22564#false} is VALID [2022-04-08 11:30:39,752 INFO L290 TraceCheckUtils]: 133: Hoare triple {22564#false} assume !(#t~post6 < 100);havoc #t~post6; {22564#false} is VALID [2022-04-08 11:30:39,752 INFO L272 TraceCheckUtils]: 134: Hoare triple {22564#false} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {22564#false} is VALID [2022-04-08 11:30:39,753 INFO L290 TraceCheckUtils]: 135: Hoare triple {22564#false} ~cond := #in~cond; {22564#false} is VALID [2022-04-08 11:30:39,753 INFO L290 TraceCheckUtils]: 136: Hoare triple {22564#false} assume 0 == ~cond; {22564#false} is VALID [2022-04-08 11:30:39,753 INFO L290 TraceCheckUtils]: 137: Hoare triple {22564#false} assume !false; {22564#false} is VALID [2022-04-08 11:30:39,753 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-08 11:30:39,753 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 11:30:40,471 INFO L290 TraceCheckUtils]: 137: Hoare triple {22564#false} assume !false; {22564#false} is VALID [2022-04-08 11:30:40,472 INFO L290 TraceCheckUtils]: 136: Hoare triple {22564#false} assume 0 == ~cond; {22564#false} is VALID [2022-04-08 11:30:40,472 INFO L290 TraceCheckUtils]: 135: Hoare triple {22564#false} ~cond := #in~cond; {22564#false} is VALID [2022-04-08 11:30:40,472 INFO L272 TraceCheckUtils]: 134: Hoare triple {22564#false} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {22564#false} is VALID [2022-04-08 11:30:40,472 INFO L290 TraceCheckUtils]: 133: Hoare triple {22564#false} assume !(#t~post6 < 100);havoc #t~post6; {22564#false} is VALID [2022-04-08 11:30:40,472 INFO L290 TraceCheckUtils]: 132: Hoare triple {22564#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {22564#false} is VALID [2022-04-08 11:30:40,472 INFO L290 TraceCheckUtils]: 131: Hoare triple {22564#false} ~r~0 := ~r~0 - ~b~0;~q~0 := ~q~0 + ~a~0; {22564#false} is VALID [2022-04-08 11:30:40,472 INFO L290 TraceCheckUtils]: 130: Hoare triple {23008#(< |main_#t~post7| 100)} assume !(#t~post7 < 100);havoc #t~post7; {22564#false} is VALID [2022-04-08 11:30:40,473 INFO L290 TraceCheckUtils]: 129: Hoare triple {23012#(< ~counter~0 100)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {23008#(< |main_#t~post7| 100)} is VALID [2022-04-08 11:30:40,473 INFO L290 TraceCheckUtils]: 128: Hoare triple {23012#(< ~counter~0 100)} ~a~0 := 2 * ~a~0;~b~0 := 2 * ~b~0; {23012#(< ~counter~0 100)} is VALID [2022-04-08 11:30:40,473 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {22563#true} {23012#(< ~counter~0 100)} #89#return; {23012#(< ~counter~0 100)} is VALID [2022-04-08 11:30:40,474 INFO L290 TraceCheckUtils]: 126: Hoare triple {22563#true} assume true; {22563#true} is VALID [2022-04-08 11:30:40,474 INFO L290 TraceCheckUtils]: 125: Hoare triple {22563#true} assume !(0 == ~cond); {22563#true} is VALID [2022-04-08 11:30:40,474 INFO L290 TraceCheckUtils]: 124: Hoare triple {22563#true} ~cond := #in~cond; {22563#true} is VALID [2022-04-08 11:30:40,474 INFO L272 TraceCheckUtils]: 123: Hoare triple {23012#(< ~counter~0 100)} call __VERIFIER_assert((if ~r~0 >= 2 * ~y~0 * ~a~0 then 1 else 0)); {22563#true} is VALID [2022-04-08 11:30:40,474 INFO L290 TraceCheckUtils]: 122: Hoare triple {23012#(< ~counter~0 100)} assume !!(~r~0 >= 2 * ~b~0); {23012#(< ~counter~0 100)} is VALID [2022-04-08 11:30:40,474 INFO L284 TraceCheckUtils]: 121: Hoare quadruple {22563#true} {23012#(< ~counter~0 100)} #87#return; {23012#(< ~counter~0 100)} is VALID [2022-04-08 11:30:40,474 INFO L290 TraceCheckUtils]: 120: Hoare triple {22563#true} assume true; {22563#true} is VALID [2022-04-08 11:30:40,475 INFO L290 TraceCheckUtils]: 119: Hoare triple {22563#true} assume !(0 == ~cond); {22563#true} is VALID [2022-04-08 11:30:40,475 INFO L290 TraceCheckUtils]: 118: Hoare triple {22563#true} ~cond := #in~cond; {22563#true} is VALID [2022-04-08 11:30:40,475 INFO L272 TraceCheckUtils]: 117: Hoare triple {23012#(< ~counter~0 100)} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {22563#true} is VALID [2022-04-08 11:30:40,486 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {22563#true} {23012#(< ~counter~0 100)} #85#return; {23012#(< ~counter~0 100)} is VALID [2022-04-08 11:30:40,486 INFO L290 TraceCheckUtils]: 115: Hoare triple {22563#true} assume true; {22563#true} is VALID [2022-04-08 11:30:40,486 INFO L290 TraceCheckUtils]: 114: Hoare triple {22563#true} assume !(0 == ~cond); {22563#true} is VALID [2022-04-08 11:30:40,486 INFO L290 TraceCheckUtils]: 113: Hoare triple {22563#true} ~cond := #in~cond; {22563#true} is VALID [2022-04-08 11:30:40,486 INFO L272 TraceCheckUtils]: 112: Hoare triple {23012#(< ~counter~0 100)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {22563#true} is VALID [2022-04-08 11:30:40,486 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {22563#true} {23012#(< ~counter~0 100)} #83#return; {23012#(< ~counter~0 100)} is VALID [2022-04-08 11:30:40,487 INFO L290 TraceCheckUtils]: 110: Hoare triple {22563#true} assume true; {22563#true} is VALID [2022-04-08 11:30:40,487 INFO L290 TraceCheckUtils]: 109: Hoare triple {22563#true} assume !(0 == ~cond); {22563#true} is VALID [2022-04-08 11:30:40,487 INFO L290 TraceCheckUtils]: 108: Hoare triple {22563#true} ~cond := #in~cond; {22563#true} is VALID [2022-04-08 11:30:40,487 INFO L272 TraceCheckUtils]: 107: Hoare triple {23012#(< ~counter~0 100)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {22563#true} is VALID [2022-04-08 11:30:40,487 INFO L290 TraceCheckUtils]: 106: Hoare triple {23012#(< ~counter~0 100)} assume !!(#t~post7 < 100);havoc #t~post7; {23012#(< ~counter~0 100)} is VALID [2022-04-08 11:30:40,488 INFO L290 TraceCheckUtils]: 105: Hoare triple {23085#(< ~counter~0 99)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {23012#(< ~counter~0 100)} is VALID [2022-04-08 11:30:40,488 INFO L290 TraceCheckUtils]: 104: Hoare triple {23085#(< ~counter~0 99)} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {23085#(< ~counter~0 99)} is VALID [2022-04-08 11:30:40,489 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {22563#true} {23085#(< ~counter~0 99)} #81#return; {23085#(< ~counter~0 99)} is VALID [2022-04-08 11:30:40,489 INFO L290 TraceCheckUtils]: 102: Hoare triple {22563#true} assume true; {22563#true} is VALID [2022-04-08 11:30:40,489 INFO L290 TraceCheckUtils]: 101: Hoare triple {22563#true} assume !(0 == ~cond); {22563#true} is VALID [2022-04-08 11:30:40,489 INFO L290 TraceCheckUtils]: 100: Hoare triple {22563#true} ~cond := #in~cond; {22563#true} is VALID [2022-04-08 11:30:40,489 INFO L272 TraceCheckUtils]: 99: Hoare triple {23085#(< ~counter~0 99)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {22563#true} is VALID [2022-04-08 11:30:40,489 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {22563#true} {23085#(< ~counter~0 99)} #79#return; {23085#(< ~counter~0 99)} is VALID [2022-04-08 11:30:40,490 INFO L290 TraceCheckUtils]: 97: Hoare triple {22563#true} assume true; {22563#true} is VALID [2022-04-08 11:30:40,490 INFO L290 TraceCheckUtils]: 96: Hoare triple {22563#true} assume !(0 == ~cond); {22563#true} is VALID [2022-04-08 11:30:40,490 INFO L290 TraceCheckUtils]: 95: Hoare triple {22563#true} ~cond := #in~cond; {22563#true} is VALID [2022-04-08 11:30:40,490 INFO L272 TraceCheckUtils]: 94: Hoare triple {23085#(< ~counter~0 99)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {22563#true} is VALID [2022-04-08 11:30:40,490 INFO L290 TraceCheckUtils]: 93: Hoare triple {23085#(< ~counter~0 99)} assume !!(#t~post6 < 100);havoc #t~post6; {23085#(< ~counter~0 99)} is VALID [2022-04-08 11:30:40,491 INFO L290 TraceCheckUtils]: 92: Hoare triple {23125#(< ~counter~0 98)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {23085#(< ~counter~0 99)} is VALID [2022-04-08 11:30:40,491 INFO L290 TraceCheckUtils]: 91: Hoare triple {23125#(< ~counter~0 98)} ~r~0 := ~r~0 - ~b~0;~q~0 := ~q~0 + ~a~0; {23125#(< ~counter~0 98)} is VALID [2022-04-08 11:30:40,491 INFO L290 TraceCheckUtils]: 90: Hoare triple {23125#(< ~counter~0 98)} assume !(~r~0 >= 2 * ~b~0); {23125#(< ~counter~0 98)} is VALID [2022-04-08 11:30:40,491 INFO L284 TraceCheckUtils]: 89: Hoare quadruple {22563#true} {23125#(< ~counter~0 98)} #87#return; {23125#(< ~counter~0 98)} is VALID [2022-04-08 11:30:40,492 INFO L290 TraceCheckUtils]: 88: Hoare triple {22563#true} assume true; {22563#true} is VALID [2022-04-08 11:30:40,492 INFO L290 TraceCheckUtils]: 87: Hoare triple {22563#true} assume !(0 == ~cond); {22563#true} is VALID [2022-04-08 11:30:40,492 INFO L290 TraceCheckUtils]: 86: Hoare triple {22563#true} ~cond := #in~cond; {22563#true} is VALID [2022-04-08 11:30:40,492 INFO L272 TraceCheckUtils]: 85: Hoare triple {23125#(< ~counter~0 98)} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {22563#true} is VALID [2022-04-08 11:30:40,492 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {22563#true} {23125#(< ~counter~0 98)} #85#return; {23125#(< ~counter~0 98)} is VALID [2022-04-08 11:30:40,492 INFO L290 TraceCheckUtils]: 83: Hoare triple {22563#true} assume true; {22563#true} is VALID [2022-04-08 11:30:40,492 INFO L290 TraceCheckUtils]: 82: Hoare triple {22563#true} assume !(0 == ~cond); {22563#true} is VALID [2022-04-08 11:30:40,492 INFO L290 TraceCheckUtils]: 81: Hoare triple {22563#true} ~cond := #in~cond; {22563#true} is VALID [2022-04-08 11:30:40,493 INFO L272 TraceCheckUtils]: 80: Hoare triple {23125#(< ~counter~0 98)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {22563#true} is VALID [2022-04-08 11:30:40,493 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {22563#true} {23125#(< ~counter~0 98)} #83#return; {23125#(< ~counter~0 98)} is VALID [2022-04-08 11:30:40,493 INFO L290 TraceCheckUtils]: 78: Hoare triple {22563#true} assume true; {22563#true} is VALID [2022-04-08 11:30:40,493 INFO L290 TraceCheckUtils]: 77: Hoare triple {22563#true} assume !(0 == ~cond); {22563#true} is VALID [2022-04-08 11:30:40,493 INFO L290 TraceCheckUtils]: 76: Hoare triple {22563#true} ~cond := #in~cond; {22563#true} is VALID [2022-04-08 11:30:40,493 INFO L272 TraceCheckUtils]: 75: Hoare triple {23125#(< ~counter~0 98)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {22563#true} is VALID [2022-04-08 11:30:40,494 INFO L290 TraceCheckUtils]: 74: Hoare triple {23125#(< ~counter~0 98)} assume !!(#t~post7 < 100);havoc #t~post7; {23125#(< ~counter~0 98)} is VALID [2022-04-08 11:30:40,494 INFO L290 TraceCheckUtils]: 73: Hoare triple {23183#(< ~counter~0 97)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {23125#(< ~counter~0 98)} is VALID [2022-04-08 11:30:40,494 INFO L290 TraceCheckUtils]: 72: Hoare triple {23183#(< ~counter~0 97)} ~a~0 := 2 * ~a~0;~b~0 := 2 * ~b~0; {23183#(< ~counter~0 97)} is VALID [2022-04-08 11:30:40,495 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {22563#true} {23183#(< ~counter~0 97)} #89#return; {23183#(< ~counter~0 97)} is VALID [2022-04-08 11:30:40,495 INFO L290 TraceCheckUtils]: 70: Hoare triple {22563#true} assume true; {22563#true} is VALID [2022-04-08 11:30:40,495 INFO L290 TraceCheckUtils]: 69: Hoare triple {22563#true} assume !(0 == ~cond); {22563#true} is VALID [2022-04-08 11:30:40,495 INFO L290 TraceCheckUtils]: 68: Hoare triple {22563#true} ~cond := #in~cond; {22563#true} is VALID [2022-04-08 11:30:40,495 INFO L272 TraceCheckUtils]: 67: Hoare triple {23183#(< ~counter~0 97)} call __VERIFIER_assert((if ~r~0 >= 2 * ~y~0 * ~a~0 then 1 else 0)); {22563#true} is VALID [2022-04-08 11:30:40,495 INFO L290 TraceCheckUtils]: 66: Hoare triple {23183#(< ~counter~0 97)} assume !!(~r~0 >= 2 * ~b~0); {23183#(< ~counter~0 97)} is VALID [2022-04-08 11:30:40,496 INFO L284 TraceCheckUtils]: 65: Hoare quadruple {22563#true} {23183#(< ~counter~0 97)} #87#return; {23183#(< ~counter~0 97)} is VALID [2022-04-08 11:30:40,496 INFO L290 TraceCheckUtils]: 64: Hoare triple {22563#true} assume true; {22563#true} is VALID [2022-04-08 11:30:40,496 INFO L290 TraceCheckUtils]: 63: Hoare triple {22563#true} assume !(0 == ~cond); {22563#true} is VALID [2022-04-08 11:30:40,496 INFO L290 TraceCheckUtils]: 62: Hoare triple {22563#true} ~cond := #in~cond; {22563#true} is VALID [2022-04-08 11:30:40,496 INFO L272 TraceCheckUtils]: 61: Hoare triple {23183#(< ~counter~0 97)} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {22563#true} is VALID [2022-04-08 11:30:40,496 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {22563#true} {23183#(< ~counter~0 97)} #85#return; {23183#(< ~counter~0 97)} is VALID [2022-04-08 11:30:40,497 INFO L290 TraceCheckUtils]: 59: Hoare triple {22563#true} assume true; {22563#true} is VALID [2022-04-08 11:30:40,497 INFO L290 TraceCheckUtils]: 58: Hoare triple {22563#true} assume !(0 == ~cond); {22563#true} is VALID [2022-04-08 11:30:40,497 INFO L290 TraceCheckUtils]: 57: Hoare triple {22563#true} ~cond := #in~cond; {22563#true} is VALID [2022-04-08 11:30:40,497 INFO L272 TraceCheckUtils]: 56: Hoare triple {23183#(< ~counter~0 97)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {22563#true} is VALID [2022-04-08 11:30:40,497 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {22563#true} {23183#(< ~counter~0 97)} #83#return; {23183#(< ~counter~0 97)} is VALID [2022-04-08 11:30:40,497 INFO L290 TraceCheckUtils]: 54: Hoare triple {22563#true} assume true; {22563#true} is VALID [2022-04-08 11:30:40,497 INFO L290 TraceCheckUtils]: 53: Hoare triple {22563#true} assume !(0 == ~cond); {22563#true} is VALID [2022-04-08 11:30:40,497 INFO L290 TraceCheckUtils]: 52: Hoare triple {22563#true} ~cond := #in~cond; {22563#true} is VALID [2022-04-08 11:30:40,497 INFO L272 TraceCheckUtils]: 51: Hoare triple {23183#(< ~counter~0 97)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {22563#true} is VALID [2022-04-08 11:30:40,498 INFO L290 TraceCheckUtils]: 50: Hoare triple {23183#(< ~counter~0 97)} assume !!(#t~post7 < 100);havoc #t~post7; {23183#(< ~counter~0 97)} is VALID [2022-04-08 11:30:40,498 INFO L290 TraceCheckUtils]: 49: Hoare triple {23256#(< ~counter~0 96)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {23183#(< ~counter~0 97)} is VALID [2022-04-08 11:30:40,499 INFO L290 TraceCheckUtils]: 48: Hoare triple {23256#(< ~counter~0 96)} ~a~0 := 2 * ~a~0;~b~0 := 2 * ~b~0; {23256#(< ~counter~0 96)} is VALID [2022-04-08 11:30:40,499 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {22563#true} {23256#(< ~counter~0 96)} #89#return; {23256#(< ~counter~0 96)} is VALID [2022-04-08 11:30:40,499 INFO L290 TraceCheckUtils]: 46: Hoare triple {22563#true} assume true; {22563#true} is VALID [2022-04-08 11:30:40,499 INFO L290 TraceCheckUtils]: 45: Hoare triple {22563#true} assume !(0 == ~cond); {22563#true} is VALID [2022-04-08 11:30:40,499 INFO L290 TraceCheckUtils]: 44: Hoare triple {22563#true} ~cond := #in~cond; {22563#true} is VALID [2022-04-08 11:30:40,499 INFO L272 TraceCheckUtils]: 43: Hoare triple {23256#(< ~counter~0 96)} call __VERIFIER_assert((if ~r~0 >= 2 * ~y~0 * ~a~0 then 1 else 0)); {22563#true} is VALID [2022-04-08 11:30:40,500 INFO L290 TraceCheckUtils]: 42: Hoare triple {23256#(< ~counter~0 96)} assume !!(~r~0 >= 2 * ~b~0); {23256#(< ~counter~0 96)} is VALID [2022-04-08 11:30:40,500 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {22563#true} {23256#(< ~counter~0 96)} #87#return; {23256#(< ~counter~0 96)} is VALID [2022-04-08 11:30:40,500 INFO L290 TraceCheckUtils]: 40: Hoare triple {22563#true} assume true; {22563#true} is VALID [2022-04-08 11:30:40,500 INFO L290 TraceCheckUtils]: 39: Hoare triple {22563#true} assume !(0 == ~cond); {22563#true} is VALID [2022-04-08 11:30:40,500 INFO L290 TraceCheckUtils]: 38: Hoare triple {22563#true} ~cond := #in~cond; {22563#true} is VALID [2022-04-08 11:30:40,500 INFO L272 TraceCheckUtils]: 37: Hoare triple {23256#(< ~counter~0 96)} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {22563#true} is VALID [2022-04-08 11:30:40,501 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {22563#true} {23256#(< ~counter~0 96)} #85#return; {23256#(< ~counter~0 96)} is VALID [2022-04-08 11:30:40,501 INFO L290 TraceCheckUtils]: 35: Hoare triple {22563#true} assume true; {22563#true} is VALID [2022-04-08 11:30:40,501 INFO L290 TraceCheckUtils]: 34: Hoare triple {22563#true} assume !(0 == ~cond); {22563#true} is VALID [2022-04-08 11:30:40,501 INFO L290 TraceCheckUtils]: 33: Hoare triple {22563#true} ~cond := #in~cond; {22563#true} is VALID [2022-04-08 11:30:40,501 INFO L272 TraceCheckUtils]: 32: Hoare triple {23256#(< ~counter~0 96)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {22563#true} is VALID [2022-04-08 11:30:40,501 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {22563#true} {23256#(< ~counter~0 96)} #83#return; {23256#(< ~counter~0 96)} is VALID [2022-04-08 11:30:40,501 INFO L290 TraceCheckUtils]: 30: Hoare triple {22563#true} assume true; {22563#true} is VALID [2022-04-08 11:30:40,502 INFO L290 TraceCheckUtils]: 29: Hoare triple {22563#true} assume !(0 == ~cond); {22563#true} is VALID [2022-04-08 11:30:40,502 INFO L290 TraceCheckUtils]: 28: Hoare triple {22563#true} ~cond := #in~cond; {22563#true} is VALID [2022-04-08 11:30:40,502 INFO L272 TraceCheckUtils]: 27: Hoare triple {23256#(< ~counter~0 96)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {22563#true} is VALID [2022-04-08 11:30:40,502 INFO L290 TraceCheckUtils]: 26: Hoare triple {23256#(< ~counter~0 96)} assume !!(#t~post7 < 100);havoc #t~post7; {23256#(< ~counter~0 96)} is VALID [2022-04-08 11:30:40,502 INFO L290 TraceCheckUtils]: 25: Hoare triple {23329#(< ~counter~0 95)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {23256#(< ~counter~0 96)} is VALID [2022-04-08 11:30:40,503 INFO L290 TraceCheckUtils]: 24: Hoare triple {23329#(< ~counter~0 95)} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {23329#(< ~counter~0 95)} is VALID [2022-04-08 11:30:40,503 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {22563#true} {23329#(< ~counter~0 95)} #81#return; {23329#(< ~counter~0 95)} is VALID [2022-04-08 11:30:40,503 INFO L290 TraceCheckUtils]: 22: Hoare triple {22563#true} assume true; {22563#true} is VALID [2022-04-08 11:30:40,503 INFO L290 TraceCheckUtils]: 21: Hoare triple {22563#true} assume !(0 == ~cond); {22563#true} is VALID [2022-04-08 11:30:40,503 INFO L290 TraceCheckUtils]: 20: Hoare triple {22563#true} ~cond := #in~cond; {22563#true} is VALID [2022-04-08 11:30:40,504 INFO L272 TraceCheckUtils]: 19: Hoare triple {23329#(< ~counter~0 95)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {22563#true} is VALID [2022-04-08 11:30:40,504 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {22563#true} {23329#(< ~counter~0 95)} #79#return; {23329#(< ~counter~0 95)} is VALID [2022-04-08 11:30:40,504 INFO L290 TraceCheckUtils]: 17: Hoare triple {22563#true} assume true; {22563#true} is VALID [2022-04-08 11:30:40,504 INFO L290 TraceCheckUtils]: 16: Hoare triple {22563#true} assume !(0 == ~cond); {22563#true} is VALID [2022-04-08 11:30:40,504 INFO L290 TraceCheckUtils]: 15: Hoare triple {22563#true} ~cond := #in~cond; {22563#true} is VALID [2022-04-08 11:30:40,504 INFO L272 TraceCheckUtils]: 14: Hoare triple {23329#(< ~counter~0 95)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {22563#true} is VALID [2022-04-08 11:30:40,505 INFO L290 TraceCheckUtils]: 13: Hoare triple {23329#(< ~counter~0 95)} assume !!(#t~post6 < 100);havoc #t~post6; {23329#(< ~counter~0 95)} is VALID [2022-04-08 11:30:40,505 INFO L290 TraceCheckUtils]: 12: Hoare triple {23369#(< ~counter~0 94)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {23329#(< ~counter~0 95)} is VALID [2022-04-08 11:30:40,505 INFO L290 TraceCheckUtils]: 11: Hoare triple {23369#(< ~counter~0 94)} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {23369#(< ~counter~0 94)} is VALID [2022-04-08 11:30:40,506 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {22563#true} {23369#(< ~counter~0 94)} #77#return; {23369#(< ~counter~0 94)} is VALID [2022-04-08 11:30:40,508 INFO L290 TraceCheckUtils]: 9: Hoare triple {22563#true} assume true; {22563#true} is VALID [2022-04-08 11:30:40,508 INFO L290 TraceCheckUtils]: 8: Hoare triple {22563#true} assume !(0 == ~cond); {22563#true} is VALID [2022-04-08 11:30:40,508 INFO L290 TraceCheckUtils]: 7: Hoare triple {22563#true} ~cond := #in~cond; {22563#true} is VALID [2022-04-08 11:30:40,508 INFO L272 TraceCheckUtils]: 6: Hoare triple {23369#(< ~counter~0 94)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {22563#true} is VALID [2022-04-08 11:30:40,508 INFO L290 TraceCheckUtils]: 5: Hoare triple {23369#(< ~counter~0 94)} 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; {23369#(< ~counter~0 94)} is VALID [2022-04-08 11:30:40,508 INFO L272 TraceCheckUtils]: 4: Hoare triple {23369#(< ~counter~0 94)} call #t~ret8 := main(); {23369#(< ~counter~0 94)} is VALID [2022-04-08 11:30:40,509 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23369#(< ~counter~0 94)} {22563#true} #93#return; {23369#(< ~counter~0 94)} is VALID [2022-04-08 11:30:40,509 INFO L290 TraceCheckUtils]: 2: Hoare triple {23369#(< ~counter~0 94)} assume true; {23369#(< ~counter~0 94)} is VALID [2022-04-08 11:30:40,509 INFO L290 TraceCheckUtils]: 1: Hoare triple {22563#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; {23369#(< ~counter~0 94)} is VALID [2022-04-08 11:30:40,509 INFO L272 TraceCheckUtils]: 0: Hoare triple {22563#true} call ULTIMATE.init(); {22563#true} is VALID [2022-04-08 11:30:40,510 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-08 11:30:40,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:30:40,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881721744] [2022-04-08 11:30:40,510 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:30:40,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1317468008] [2022-04-08 11:30:40,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1317468008] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 11:30:40,510 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 11:30:40,510 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2022-04-08 11:30:40,511 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:30:40,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2124253156] [2022-04-08 11:30:40,511 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2124253156] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:30:40,511 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:30:40,511 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-08 11:30:40,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134261164] [2022-04-08 11:30:40,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:30:40,511 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-08 11:30:40,512 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:30:40,512 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-08 11:30:40,581 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-08 11:30:40,581 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-08 11:30:40,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:30:40,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-08 11:30:40,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2022-04-08 11:30:40,582 INFO L87 Difference]: Start difference. First operand 211 states and 251 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-08 11:30:41,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:30:41,857 INFO L93 Difference]: Finished difference Result 300 states and 342 transitions. [2022-04-08 11:30:41,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-08 11:30:41,858 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-08 11:30:41,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:30:41,858 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-08 11:30:41,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 158 transitions. [2022-04-08 11:30:41,860 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-08 11:30:41,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 158 transitions. [2022-04-08 11:30:41,861 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 158 transitions. [2022-04-08 11:30:41,985 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-08 11:30:41,989 INFO L225 Difference]: With dead ends: 300 [2022-04-08 11:30:41,989 INFO L226 Difference]: Without dead ends: 292 [2022-04-08 11:30:41,990 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 259 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=205, Invalid=301, Unknown=0, NotChecked=0, Total=506 [2022-04-08 11:30:41,990 INFO L913 BasicCegarLoop]: 65 mSDtfsCounter, 54 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 11:30:41,990 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [54 Valid, 246 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 11:30:41,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2022-04-08 11:30:42,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 287. [2022-04-08 11:30:42,391 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:30:42,391 INFO L82 GeneralOperation]: Start isEquivalent. First operand 292 states. Second operand has 287 states, 187 states have (on average 1.0962566844919786) internal successors, (205), 189 states have internal predecessors, (205), 63 states have call successors, (63), 38 states have call predecessors, (63), 36 states have return successors, (60), 59 states have call predecessors, (60), 60 states have call successors, (60) [2022-04-08 11:30:42,392 INFO L74 IsIncluded]: Start isIncluded. First operand 292 states. Second operand has 287 states, 187 states have (on average 1.0962566844919786) internal successors, (205), 189 states have internal predecessors, (205), 63 states have call successors, (63), 38 states have call predecessors, (63), 36 states have return successors, (60), 59 states have call predecessors, (60), 60 states have call successors, (60) [2022-04-08 11:30:42,392 INFO L87 Difference]: Start difference. First operand 292 states. Second operand has 287 states, 187 states have (on average 1.0962566844919786) internal successors, (205), 189 states have internal predecessors, (205), 63 states have call successors, (63), 38 states have call predecessors, (63), 36 states have return successors, (60), 59 states have call predecessors, (60), 60 states have call successors, (60) [2022-04-08 11:30:42,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:30:42,396 INFO L93 Difference]: Finished difference Result 292 states and 333 transitions. [2022-04-08 11:30:42,396 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 333 transitions. [2022-04-08 11:30:42,397 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:30:42,397 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:30:42,397 INFO L74 IsIncluded]: Start isIncluded. First operand has 287 states, 187 states have (on average 1.0962566844919786) internal successors, (205), 189 states have internal predecessors, (205), 63 states have call successors, (63), 38 states have call predecessors, (63), 36 states have return successors, (60), 59 states have call predecessors, (60), 60 states have call successors, (60) Second operand 292 states. [2022-04-08 11:30:42,397 INFO L87 Difference]: Start difference. First operand has 287 states, 187 states have (on average 1.0962566844919786) internal successors, (205), 189 states have internal predecessors, (205), 63 states have call successors, (63), 38 states have call predecessors, (63), 36 states have return successors, (60), 59 states have call predecessors, (60), 60 states have call successors, (60) Second operand 292 states. [2022-04-08 11:30:42,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:30:42,401 INFO L93 Difference]: Finished difference Result 292 states and 333 transitions. [2022-04-08 11:30:42,401 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 333 transitions. [2022-04-08 11:30:42,402 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:30:42,402 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:30:42,402 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:30:42,402 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:30:42,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 187 states have (on average 1.0962566844919786) internal successors, (205), 189 states have internal predecessors, (205), 63 states have call successors, (63), 38 states have call predecessors, (63), 36 states have return successors, (60), 59 states have call predecessors, (60), 60 states have call successors, (60) [2022-04-08 11:30:42,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 328 transitions. [2022-04-08 11:30:42,407 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 328 transitions. Word has length 138 [2022-04-08 11:30:42,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:30:42,407 INFO L478 AbstractCegarLoop]: Abstraction has 287 states and 328 transitions. [2022-04-08 11:30:42,407 INFO L479 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-08 11:30:42,407 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 287 states and 328 transitions. [2022-04-08 11:30:42,897 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 328 edges. 328 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:30:42,897 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 328 transitions. [2022-04-08 11:30:42,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2022-04-08 11:30:42,898 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:30:42,899 INFO L499 BasicCegarLoop]: 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-08 11:30:42,931 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-08 11:30:43,111 WARN L460 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-08 11:30:43,112 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:30:43,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:30:43,113 INFO L85 PathProgramCache]: Analyzing trace with hash -559679257, now seen corresponding path program 7 times [2022-04-08 11:30:43,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:30:43,113 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1932039602] [2022-04-08 11:31:22,730 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 11:31:22,730 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 11:31:22,730 INFO L85 PathProgramCache]: Analyzing trace with hash -559679257, now seen corresponding path program 8 times [2022-04-08 11:31:22,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:31:22,730 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449892455] [2022-04-08 11:31:22,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:31:22,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:31:22,743 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:31:22,743 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1583767143] [2022-04-08 11:31:22,743 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 11:31:22,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:31:22,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:31:22,744 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-08 11:31:22,745 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-08 11:31:22,818 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 11:31:22,818 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:31:22,819 INFO L263 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-08 11:31:22,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:31:22,842 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:31:23,637 INFO L272 TraceCheckUtils]: 0: Hoare triple {25176#true} call ULTIMATE.init(); {25176#true} is VALID [2022-04-08 11:31:23,647 INFO L290 TraceCheckUtils]: 1: Hoare triple {25176#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; {25184#(<= ~counter~0 0)} is VALID [2022-04-08 11:31:23,647 INFO L290 TraceCheckUtils]: 2: Hoare triple {25184#(<= ~counter~0 0)} assume true; {25184#(<= ~counter~0 0)} is VALID [2022-04-08 11:31:23,647 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25184#(<= ~counter~0 0)} {25176#true} #93#return; {25184#(<= ~counter~0 0)} is VALID [2022-04-08 11:31:23,648 INFO L272 TraceCheckUtils]: 4: Hoare triple {25184#(<= ~counter~0 0)} call #t~ret8 := main(); {25184#(<= ~counter~0 0)} is VALID [2022-04-08 11:31:23,648 INFO L290 TraceCheckUtils]: 5: Hoare triple {25184#(<= ~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; {25184#(<= ~counter~0 0)} is VALID [2022-04-08 11:31:23,648 INFO L272 TraceCheckUtils]: 6: Hoare triple {25184#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {25184#(<= ~counter~0 0)} is VALID [2022-04-08 11:31:23,649 INFO L290 TraceCheckUtils]: 7: Hoare triple {25184#(<= ~counter~0 0)} ~cond := #in~cond; {25184#(<= ~counter~0 0)} is VALID [2022-04-08 11:31:23,649 INFO L290 TraceCheckUtils]: 8: Hoare triple {25184#(<= ~counter~0 0)} assume !(0 == ~cond); {25184#(<= ~counter~0 0)} is VALID [2022-04-08 11:31:23,649 INFO L290 TraceCheckUtils]: 9: Hoare triple {25184#(<= ~counter~0 0)} assume true; {25184#(<= ~counter~0 0)} is VALID [2022-04-08 11:31:23,650 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {25184#(<= ~counter~0 0)} {25184#(<= ~counter~0 0)} #77#return; {25184#(<= ~counter~0 0)} is VALID [2022-04-08 11:31:23,650 INFO L290 TraceCheckUtils]: 11: Hoare triple {25184#(<= ~counter~0 0)} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {25184#(<= ~counter~0 0)} is VALID [2022-04-08 11:31:23,651 INFO L290 TraceCheckUtils]: 12: Hoare triple {25184#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {25218#(<= ~counter~0 1)} is VALID [2022-04-08 11:31:23,651 INFO L290 TraceCheckUtils]: 13: Hoare triple {25218#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {25218#(<= ~counter~0 1)} is VALID [2022-04-08 11:31:23,652 INFO L272 TraceCheckUtils]: 14: Hoare triple {25218#(<= ~counter~0 1)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {25218#(<= ~counter~0 1)} is VALID [2022-04-08 11:31:23,652 INFO L290 TraceCheckUtils]: 15: Hoare triple {25218#(<= ~counter~0 1)} ~cond := #in~cond; {25218#(<= ~counter~0 1)} is VALID [2022-04-08 11:31:23,652 INFO L290 TraceCheckUtils]: 16: Hoare triple {25218#(<= ~counter~0 1)} assume !(0 == ~cond); {25218#(<= ~counter~0 1)} is VALID [2022-04-08 11:31:23,652 INFO L290 TraceCheckUtils]: 17: Hoare triple {25218#(<= ~counter~0 1)} assume true; {25218#(<= ~counter~0 1)} is VALID [2022-04-08 11:31:23,653 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {25218#(<= ~counter~0 1)} {25218#(<= ~counter~0 1)} #79#return; {25218#(<= ~counter~0 1)} is VALID [2022-04-08 11:31:23,653 INFO L272 TraceCheckUtils]: 19: Hoare triple {25218#(<= ~counter~0 1)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {25218#(<= ~counter~0 1)} is VALID [2022-04-08 11:31:23,654 INFO L290 TraceCheckUtils]: 20: Hoare triple {25218#(<= ~counter~0 1)} ~cond := #in~cond; {25218#(<= ~counter~0 1)} is VALID [2022-04-08 11:31:23,654 INFO L290 TraceCheckUtils]: 21: Hoare triple {25218#(<= ~counter~0 1)} assume !(0 == ~cond); {25218#(<= ~counter~0 1)} is VALID [2022-04-08 11:31:23,654 INFO L290 TraceCheckUtils]: 22: Hoare triple {25218#(<= ~counter~0 1)} assume true; {25218#(<= ~counter~0 1)} is VALID [2022-04-08 11:31:23,655 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {25218#(<= ~counter~0 1)} {25218#(<= ~counter~0 1)} #81#return; {25218#(<= ~counter~0 1)} is VALID [2022-04-08 11:31:23,655 INFO L290 TraceCheckUtils]: 24: Hoare triple {25218#(<= ~counter~0 1)} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {25218#(<= ~counter~0 1)} is VALID [2022-04-08 11:31:23,655 INFO L290 TraceCheckUtils]: 25: Hoare triple {25218#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {25258#(<= ~counter~0 2)} is VALID [2022-04-08 11:31:23,656 INFO L290 TraceCheckUtils]: 26: Hoare triple {25258#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {25258#(<= ~counter~0 2)} is VALID [2022-04-08 11:31:23,656 INFO L272 TraceCheckUtils]: 27: Hoare triple {25258#(<= ~counter~0 2)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {25258#(<= ~counter~0 2)} is VALID [2022-04-08 11:31:23,656 INFO L290 TraceCheckUtils]: 28: Hoare triple {25258#(<= ~counter~0 2)} ~cond := #in~cond; {25258#(<= ~counter~0 2)} is VALID [2022-04-08 11:31:23,657 INFO L290 TraceCheckUtils]: 29: Hoare triple {25258#(<= ~counter~0 2)} assume !(0 == ~cond); {25258#(<= ~counter~0 2)} is VALID [2022-04-08 11:31:23,657 INFO L290 TraceCheckUtils]: 30: Hoare triple {25258#(<= ~counter~0 2)} assume true; {25258#(<= ~counter~0 2)} is VALID [2022-04-08 11:31:23,658 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {25258#(<= ~counter~0 2)} {25258#(<= ~counter~0 2)} #83#return; {25258#(<= ~counter~0 2)} is VALID [2022-04-08 11:31:23,658 INFO L272 TraceCheckUtils]: 32: Hoare triple {25258#(<= ~counter~0 2)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {25258#(<= ~counter~0 2)} is VALID [2022-04-08 11:31:23,658 INFO L290 TraceCheckUtils]: 33: Hoare triple {25258#(<= ~counter~0 2)} ~cond := #in~cond; {25258#(<= ~counter~0 2)} is VALID [2022-04-08 11:31:23,659 INFO L290 TraceCheckUtils]: 34: Hoare triple {25258#(<= ~counter~0 2)} assume !(0 == ~cond); {25258#(<= ~counter~0 2)} is VALID [2022-04-08 11:31:23,659 INFO L290 TraceCheckUtils]: 35: Hoare triple {25258#(<= ~counter~0 2)} assume true; {25258#(<= ~counter~0 2)} is VALID [2022-04-08 11:31:23,659 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {25258#(<= ~counter~0 2)} {25258#(<= ~counter~0 2)} #85#return; {25258#(<= ~counter~0 2)} is VALID [2022-04-08 11:31:23,660 INFO L272 TraceCheckUtils]: 37: Hoare triple {25258#(<= ~counter~0 2)} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {25258#(<= ~counter~0 2)} is VALID [2022-04-08 11:31:23,660 INFO L290 TraceCheckUtils]: 38: Hoare triple {25258#(<= ~counter~0 2)} ~cond := #in~cond; {25258#(<= ~counter~0 2)} is VALID [2022-04-08 11:31:23,660 INFO L290 TraceCheckUtils]: 39: Hoare triple {25258#(<= ~counter~0 2)} assume !(0 == ~cond); {25258#(<= ~counter~0 2)} is VALID [2022-04-08 11:31:23,660 INFO L290 TraceCheckUtils]: 40: Hoare triple {25258#(<= ~counter~0 2)} assume true; {25258#(<= ~counter~0 2)} is VALID [2022-04-08 11:31:23,661 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {25258#(<= ~counter~0 2)} {25258#(<= ~counter~0 2)} #87#return; {25258#(<= ~counter~0 2)} is VALID [2022-04-08 11:31:23,661 INFO L290 TraceCheckUtils]: 42: Hoare triple {25258#(<= ~counter~0 2)} assume !!(~r~0 >= 2 * ~b~0); {25258#(<= ~counter~0 2)} is VALID [2022-04-08 11:31:23,662 INFO L272 TraceCheckUtils]: 43: Hoare triple {25258#(<= ~counter~0 2)} call __VERIFIER_assert((if ~r~0 >= 2 * ~y~0 * ~a~0 then 1 else 0)); {25258#(<= ~counter~0 2)} is VALID [2022-04-08 11:31:23,662 INFO L290 TraceCheckUtils]: 44: Hoare triple {25258#(<= ~counter~0 2)} ~cond := #in~cond; {25258#(<= ~counter~0 2)} is VALID [2022-04-08 11:31:23,662 INFO L290 TraceCheckUtils]: 45: Hoare triple {25258#(<= ~counter~0 2)} assume !(0 == ~cond); {25258#(<= ~counter~0 2)} is VALID [2022-04-08 11:31:23,662 INFO L290 TraceCheckUtils]: 46: Hoare triple {25258#(<= ~counter~0 2)} assume true; {25258#(<= ~counter~0 2)} is VALID [2022-04-08 11:31:23,663 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {25258#(<= ~counter~0 2)} {25258#(<= ~counter~0 2)} #89#return; {25258#(<= ~counter~0 2)} is VALID [2022-04-08 11:31:23,663 INFO L290 TraceCheckUtils]: 48: Hoare triple {25258#(<= ~counter~0 2)} ~a~0 := 2 * ~a~0;~b~0 := 2 * ~b~0; {25258#(<= ~counter~0 2)} is VALID [2022-04-08 11:31:23,664 INFO L290 TraceCheckUtils]: 49: Hoare triple {25258#(<= ~counter~0 2)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {25331#(<= ~counter~0 3)} is VALID [2022-04-08 11:31:23,664 INFO L290 TraceCheckUtils]: 50: Hoare triple {25331#(<= ~counter~0 3)} assume !!(#t~post7 < 100);havoc #t~post7; {25331#(<= ~counter~0 3)} is VALID [2022-04-08 11:31:23,665 INFO L272 TraceCheckUtils]: 51: Hoare triple {25331#(<= ~counter~0 3)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {25331#(<= ~counter~0 3)} is VALID [2022-04-08 11:31:23,665 INFO L290 TraceCheckUtils]: 52: Hoare triple {25331#(<= ~counter~0 3)} ~cond := #in~cond; {25331#(<= ~counter~0 3)} is VALID [2022-04-08 11:31:23,665 INFO L290 TraceCheckUtils]: 53: Hoare triple {25331#(<= ~counter~0 3)} assume !(0 == ~cond); {25331#(<= ~counter~0 3)} is VALID [2022-04-08 11:31:23,665 INFO L290 TraceCheckUtils]: 54: Hoare triple {25331#(<= ~counter~0 3)} assume true; {25331#(<= ~counter~0 3)} is VALID [2022-04-08 11:31:23,666 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {25331#(<= ~counter~0 3)} {25331#(<= ~counter~0 3)} #83#return; {25331#(<= ~counter~0 3)} is VALID [2022-04-08 11:31:23,666 INFO L272 TraceCheckUtils]: 56: Hoare triple {25331#(<= ~counter~0 3)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {25331#(<= ~counter~0 3)} is VALID [2022-04-08 11:31:23,667 INFO L290 TraceCheckUtils]: 57: Hoare triple {25331#(<= ~counter~0 3)} ~cond := #in~cond; {25331#(<= ~counter~0 3)} is VALID [2022-04-08 11:31:23,667 INFO L290 TraceCheckUtils]: 58: Hoare triple {25331#(<= ~counter~0 3)} assume !(0 == ~cond); {25331#(<= ~counter~0 3)} is VALID [2022-04-08 11:31:23,667 INFO L290 TraceCheckUtils]: 59: Hoare triple {25331#(<= ~counter~0 3)} assume true; {25331#(<= ~counter~0 3)} is VALID [2022-04-08 11:31:23,668 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {25331#(<= ~counter~0 3)} {25331#(<= ~counter~0 3)} #85#return; {25331#(<= ~counter~0 3)} is VALID [2022-04-08 11:31:23,668 INFO L272 TraceCheckUtils]: 61: Hoare triple {25331#(<= ~counter~0 3)} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {25331#(<= ~counter~0 3)} is VALID [2022-04-08 11:31:23,668 INFO L290 TraceCheckUtils]: 62: Hoare triple {25331#(<= ~counter~0 3)} ~cond := #in~cond; {25331#(<= ~counter~0 3)} is VALID [2022-04-08 11:31:23,669 INFO L290 TraceCheckUtils]: 63: Hoare triple {25331#(<= ~counter~0 3)} assume !(0 == ~cond); {25331#(<= ~counter~0 3)} is VALID [2022-04-08 11:31:23,669 INFO L290 TraceCheckUtils]: 64: Hoare triple {25331#(<= ~counter~0 3)} assume true; {25331#(<= ~counter~0 3)} is VALID [2022-04-08 11:31:23,669 INFO L284 TraceCheckUtils]: 65: Hoare quadruple {25331#(<= ~counter~0 3)} {25331#(<= ~counter~0 3)} #87#return; {25331#(<= ~counter~0 3)} is VALID [2022-04-08 11:31:23,669 INFO L290 TraceCheckUtils]: 66: Hoare triple {25331#(<= ~counter~0 3)} assume !!(~r~0 >= 2 * ~b~0); {25331#(<= ~counter~0 3)} is VALID [2022-04-08 11:31:23,670 INFO L272 TraceCheckUtils]: 67: Hoare triple {25331#(<= ~counter~0 3)} call __VERIFIER_assert((if ~r~0 >= 2 * ~y~0 * ~a~0 then 1 else 0)); {25331#(<= ~counter~0 3)} is VALID [2022-04-08 11:31:23,670 INFO L290 TraceCheckUtils]: 68: Hoare triple {25331#(<= ~counter~0 3)} ~cond := #in~cond; {25331#(<= ~counter~0 3)} is VALID [2022-04-08 11:31:23,670 INFO L290 TraceCheckUtils]: 69: Hoare triple {25331#(<= ~counter~0 3)} assume !(0 == ~cond); {25331#(<= ~counter~0 3)} is VALID [2022-04-08 11:31:23,671 INFO L290 TraceCheckUtils]: 70: Hoare triple {25331#(<= ~counter~0 3)} assume true; {25331#(<= ~counter~0 3)} is VALID [2022-04-08 11:31:23,671 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {25331#(<= ~counter~0 3)} {25331#(<= ~counter~0 3)} #89#return; {25331#(<= ~counter~0 3)} is VALID [2022-04-08 11:31:23,671 INFO L290 TraceCheckUtils]: 72: Hoare triple {25331#(<= ~counter~0 3)} ~a~0 := 2 * ~a~0;~b~0 := 2 * ~b~0; {25331#(<= ~counter~0 3)} is VALID [2022-04-08 11:31:23,672 INFO L290 TraceCheckUtils]: 73: Hoare triple {25331#(<= ~counter~0 3)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {25404#(<= ~counter~0 4)} is VALID [2022-04-08 11:31:23,672 INFO L290 TraceCheckUtils]: 74: Hoare triple {25404#(<= ~counter~0 4)} assume !!(#t~post7 < 100);havoc #t~post7; {25404#(<= ~counter~0 4)} is VALID [2022-04-08 11:31:23,673 INFO L272 TraceCheckUtils]: 75: Hoare triple {25404#(<= ~counter~0 4)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {25404#(<= ~counter~0 4)} is VALID [2022-04-08 11:31:23,673 INFO L290 TraceCheckUtils]: 76: Hoare triple {25404#(<= ~counter~0 4)} ~cond := #in~cond; {25404#(<= ~counter~0 4)} is VALID [2022-04-08 11:31:23,674 INFO L290 TraceCheckUtils]: 77: Hoare triple {25404#(<= ~counter~0 4)} assume !(0 == ~cond); {25404#(<= ~counter~0 4)} is VALID [2022-04-08 11:31:23,674 INFO L290 TraceCheckUtils]: 78: Hoare triple {25404#(<= ~counter~0 4)} assume true; {25404#(<= ~counter~0 4)} is VALID [2022-04-08 11:31:23,675 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {25404#(<= ~counter~0 4)} {25404#(<= ~counter~0 4)} #83#return; {25404#(<= ~counter~0 4)} is VALID [2022-04-08 11:31:23,676 INFO L272 TraceCheckUtils]: 80: Hoare triple {25404#(<= ~counter~0 4)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {25404#(<= ~counter~0 4)} is VALID [2022-04-08 11:31:23,676 INFO L290 TraceCheckUtils]: 81: Hoare triple {25404#(<= ~counter~0 4)} ~cond := #in~cond; {25404#(<= ~counter~0 4)} is VALID [2022-04-08 11:31:23,676 INFO L290 TraceCheckUtils]: 82: Hoare triple {25404#(<= ~counter~0 4)} assume !(0 == ~cond); {25404#(<= ~counter~0 4)} is VALID [2022-04-08 11:31:23,677 INFO L290 TraceCheckUtils]: 83: Hoare triple {25404#(<= ~counter~0 4)} assume true; {25404#(<= ~counter~0 4)} is VALID [2022-04-08 11:31:23,677 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {25404#(<= ~counter~0 4)} {25404#(<= ~counter~0 4)} #85#return; {25404#(<= ~counter~0 4)} is VALID [2022-04-08 11:31:23,678 INFO L272 TraceCheckUtils]: 85: Hoare triple {25404#(<= ~counter~0 4)} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {25404#(<= ~counter~0 4)} is VALID [2022-04-08 11:31:23,678 INFO L290 TraceCheckUtils]: 86: Hoare triple {25404#(<= ~counter~0 4)} ~cond := #in~cond; {25404#(<= ~counter~0 4)} is VALID [2022-04-08 11:31:23,678 INFO L290 TraceCheckUtils]: 87: Hoare triple {25404#(<= ~counter~0 4)} assume !(0 == ~cond); {25404#(<= ~counter~0 4)} is VALID [2022-04-08 11:31:23,679 INFO L290 TraceCheckUtils]: 88: Hoare triple {25404#(<= ~counter~0 4)} assume true; {25404#(<= ~counter~0 4)} is VALID [2022-04-08 11:31:23,679 INFO L284 TraceCheckUtils]: 89: Hoare quadruple {25404#(<= ~counter~0 4)} {25404#(<= ~counter~0 4)} #87#return; {25404#(<= ~counter~0 4)} is VALID [2022-04-08 11:31:23,679 INFO L290 TraceCheckUtils]: 90: Hoare triple {25404#(<= ~counter~0 4)} assume !(~r~0 >= 2 * ~b~0); {25404#(<= ~counter~0 4)} is VALID [2022-04-08 11:31:23,679 INFO L290 TraceCheckUtils]: 91: Hoare triple {25404#(<= ~counter~0 4)} ~r~0 := ~r~0 - ~b~0;~q~0 := ~q~0 + ~a~0; {25404#(<= ~counter~0 4)} is VALID [2022-04-08 11:31:23,680 INFO L290 TraceCheckUtils]: 92: Hoare triple {25404#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {25462#(<= ~counter~0 5)} is VALID [2022-04-08 11:31:23,680 INFO L290 TraceCheckUtils]: 93: Hoare triple {25462#(<= ~counter~0 5)} assume !!(#t~post6 < 100);havoc #t~post6; {25462#(<= ~counter~0 5)} is VALID [2022-04-08 11:31:23,681 INFO L272 TraceCheckUtils]: 94: Hoare triple {25462#(<= ~counter~0 5)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {25462#(<= ~counter~0 5)} is VALID [2022-04-08 11:31:23,681 INFO L290 TraceCheckUtils]: 95: Hoare triple {25462#(<= ~counter~0 5)} ~cond := #in~cond; {25462#(<= ~counter~0 5)} is VALID [2022-04-08 11:31:23,681 INFO L290 TraceCheckUtils]: 96: Hoare triple {25462#(<= ~counter~0 5)} assume !(0 == ~cond); {25462#(<= ~counter~0 5)} is VALID [2022-04-08 11:31:23,682 INFO L290 TraceCheckUtils]: 97: Hoare triple {25462#(<= ~counter~0 5)} assume true; {25462#(<= ~counter~0 5)} is VALID [2022-04-08 11:31:23,682 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {25462#(<= ~counter~0 5)} {25462#(<= ~counter~0 5)} #79#return; {25462#(<= ~counter~0 5)} is VALID [2022-04-08 11:31:23,683 INFO L272 TraceCheckUtils]: 99: Hoare triple {25462#(<= ~counter~0 5)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {25462#(<= ~counter~0 5)} is VALID [2022-04-08 11:31:23,683 INFO L290 TraceCheckUtils]: 100: Hoare triple {25462#(<= ~counter~0 5)} ~cond := #in~cond; {25462#(<= ~counter~0 5)} is VALID [2022-04-08 11:31:23,683 INFO L290 TraceCheckUtils]: 101: Hoare triple {25462#(<= ~counter~0 5)} assume !(0 == ~cond); {25462#(<= ~counter~0 5)} is VALID [2022-04-08 11:31:23,683 INFO L290 TraceCheckUtils]: 102: Hoare triple {25462#(<= ~counter~0 5)} assume true; {25462#(<= ~counter~0 5)} is VALID [2022-04-08 11:31:23,684 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {25462#(<= ~counter~0 5)} {25462#(<= ~counter~0 5)} #81#return; {25462#(<= ~counter~0 5)} is VALID [2022-04-08 11:31:23,684 INFO L290 TraceCheckUtils]: 104: Hoare triple {25462#(<= ~counter~0 5)} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {25462#(<= ~counter~0 5)} is VALID [2022-04-08 11:31:23,685 INFO L290 TraceCheckUtils]: 105: Hoare triple {25462#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {25502#(<= ~counter~0 6)} is VALID [2022-04-08 11:31:23,685 INFO L290 TraceCheckUtils]: 106: Hoare triple {25502#(<= ~counter~0 6)} assume !!(#t~post7 < 100);havoc #t~post7; {25502#(<= ~counter~0 6)} is VALID [2022-04-08 11:31:23,686 INFO L272 TraceCheckUtils]: 107: Hoare triple {25502#(<= ~counter~0 6)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {25502#(<= ~counter~0 6)} is VALID [2022-04-08 11:31:23,686 INFO L290 TraceCheckUtils]: 108: Hoare triple {25502#(<= ~counter~0 6)} ~cond := #in~cond; {25502#(<= ~counter~0 6)} is VALID [2022-04-08 11:31:23,686 INFO L290 TraceCheckUtils]: 109: Hoare triple {25502#(<= ~counter~0 6)} assume !(0 == ~cond); {25502#(<= ~counter~0 6)} is VALID [2022-04-08 11:31:23,686 INFO L290 TraceCheckUtils]: 110: Hoare triple {25502#(<= ~counter~0 6)} assume true; {25502#(<= ~counter~0 6)} is VALID [2022-04-08 11:31:23,687 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {25502#(<= ~counter~0 6)} {25502#(<= ~counter~0 6)} #83#return; {25502#(<= ~counter~0 6)} is VALID [2022-04-08 11:31:23,687 INFO L272 TraceCheckUtils]: 112: Hoare triple {25502#(<= ~counter~0 6)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {25502#(<= ~counter~0 6)} is VALID [2022-04-08 11:31:23,688 INFO L290 TraceCheckUtils]: 113: Hoare triple {25502#(<= ~counter~0 6)} ~cond := #in~cond; {25502#(<= ~counter~0 6)} is VALID [2022-04-08 11:31:23,688 INFO L290 TraceCheckUtils]: 114: Hoare triple {25502#(<= ~counter~0 6)} assume !(0 == ~cond); {25502#(<= ~counter~0 6)} is VALID [2022-04-08 11:31:23,688 INFO L290 TraceCheckUtils]: 115: Hoare triple {25502#(<= ~counter~0 6)} assume true; {25502#(<= ~counter~0 6)} is VALID [2022-04-08 11:31:23,689 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {25502#(<= ~counter~0 6)} {25502#(<= ~counter~0 6)} #85#return; {25502#(<= ~counter~0 6)} is VALID [2022-04-08 11:31:23,689 INFO L272 TraceCheckUtils]: 117: Hoare triple {25502#(<= ~counter~0 6)} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {25502#(<= ~counter~0 6)} is VALID [2022-04-08 11:31:23,689 INFO L290 TraceCheckUtils]: 118: Hoare triple {25502#(<= ~counter~0 6)} ~cond := #in~cond; {25502#(<= ~counter~0 6)} is VALID [2022-04-08 11:31:23,689 INFO L290 TraceCheckUtils]: 119: Hoare triple {25502#(<= ~counter~0 6)} assume !(0 == ~cond); {25502#(<= ~counter~0 6)} is VALID [2022-04-08 11:31:23,690 INFO L290 TraceCheckUtils]: 120: Hoare triple {25502#(<= ~counter~0 6)} assume true; {25502#(<= ~counter~0 6)} is VALID [2022-04-08 11:31:23,690 INFO L284 TraceCheckUtils]: 121: Hoare quadruple {25502#(<= ~counter~0 6)} {25502#(<= ~counter~0 6)} #87#return; {25502#(<= ~counter~0 6)} is VALID [2022-04-08 11:31:23,690 INFO L290 TraceCheckUtils]: 122: Hoare triple {25502#(<= ~counter~0 6)} assume !!(~r~0 >= 2 * ~b~0); {25502#(<= ~counter~0 6)} is VALID [2022-04-08 11:31:23,691 INFO L272 TraceCheckUtils]: 123: Hoare triple {25502#(<= ~counter~0 6)} call __VERIFIER_assert((if ~r~0 >= 2 * ~y~0 * ~a~0 then 1 else 0)); {25502#(<= ~counter~0 6)} is VALID [2022-04-08 11:31:23,691 INFO L290 TraceCheckUtils]: 124: Hoare triple {25502#(<= ~counter~0 6)} ~cond := #in~cond; {25502#(<= ~counter~0 6)} is VALID [2022-04-08 11:31:23,692 INFO L290 TraceCheckUtils]: 125: Hoare triple {25502#(<= ~counter~0 6)} assume !(0 == ~cond); {25502#(<= ~counter~0 6)} is VALID [2022-04-08 11:31:23,692 INFO L290 TraceCheckUtils]: 126: Hoare triple {25502#(<= ~counter~0 6)} assume true; {25502#(<= ~counter~0 6)} is VALID [2022-04-08 11:31:23,692 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {25502#(<= ~counter~0 6)} {25502#(<= ~counter~0 6)} #89#return; {25502#(<= ~counter~0 6)} is VALID [2022-04-08 11:31:23,693 INFO L290 TraceCheckUtils]: 128: Hoare triple {25502#(<= ~counter~0 6)} ~a~0 := 2 * ~a~0;~b~0 := 2 * ~b~0; {25502#(<= ~counter~0 6)} is VALID [2022-04-08 11:31:23,693 INFO L290 TraceCheckUtils]: 129: Hoare triple {25502#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {25575#(<= ~counter~0 7)} is VALID [2022-04-08 11:31:23,694 INFO L290 TraceCheckUtils]: 130: Hoare triple {25575#(<= ~counter~0 7)} assume !!(#t~post7 < 100);havoc #t~post7; {25575#(<= ~counter~0 7)} is VALID [2022-04-08 11:31:23,694 INFO L272 TraceCheckUtils]: 131: Hoare triple {25575#(<= ~counter~0 7)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {25575#(<= ~counter~0 7)} is VALID [2022-04-08 11:31:23,694 INFO L290 TraceCheckUtils]: 132: Hoare triple {25575#(<= ~counter~0 7)} ~cond := #in~cond; {25575#(<= ~counter~0 7)} is VALID [2022-04-08 11:31:23,695 INFO L290 TraceCheckUtils]: 133: Hoare triple {25575#(<= ~counter~0 7)} assume !(0 == ~cond); {25575#(<= ~counter~0 7)} is VALID [2022-04-08 11:31:23,695 INFO L290 TraceCheckUtils]: 134: Hoare triple {25575#(<= ~counter~0 7)} assume true; {25575#(<= ~counter~0 7)} is VALID [2022-04-08 11:31:23,695 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {25575#(<= ~counter~0 7)} {25575#(<= ~counter~0 7)} #83#return; {25575#(<= ~counter~0 7)} is VALID [2022-04-08 11:31:23,696 INFO L272 TraceCheckUtils]: 136: Hoare triple {25575#(<= ~counter~0 7)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {25575#(<= ~counter~0 7)} is VALID [2022-04-08 11:31:23,696 INFO L290 TraceCheckUtils]: 137: Hoare triple {25575#(<= ~counter~0 7)} ~cond := #in~cond; {25575#(<= ~counter~0 7)} is VALID [2022-04-08 11:31:23,696 INFO L290 TraceCheckUtils]: 138: Hoare triple {25575#(<= ~counter~0 7)} assume !(0 == ~cond); {25575#(<= ~counter~0 7)} is VALID [2022-04-08 11:31:23,697 INFO L290 TraceCheckUtils]: 139: Hoare triple {25575#(<= ~counter~0 7)} assume true; {25575#(<= ~counter~0 7)} is VALID [2022-04-08 11:31:23,697 INFO L284 TraceCheckUtils]: 140: Hoare quadruple {25575#(<= ~counter~0 7)} {25575#(<= ~counter~0 7)} #85#return; {25575#(<= ~counter~0 7)} is VALID [2022-04-08 11:31:23,698 INFO L272 TraceCheckUtils]: 141: Hoare triple {25575#(<= ~counter~0 7)} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {25575#(<= ~counter~0 7)} is VALID [2022-04-08 11:31:23,698 INFO L290 TraceCheckUtils]: 142: Hoare triple {25575#(<= ~counter~0 7)} ~cond := #in~cond; {25575#(<= ~counter~0 7)} is VALID [2022-04-08 11:31:23,698 INFO L290 TraceCheckUtils]: 143: Hoare triple {25575#(<= ~counter~0 7)} assume !(0 == ~cond); {25575#(<= ~counter~0 7)} is VALID [2022-04-08 11:31:23,698 INFO L290 TraceCheckUtils]: 144: Hoare triple {25575#(<= ~counter~0 7)} assume true; {25575#(<= ~counter~0 7)} is VALID [2022-04-08 11:31:23,699 INFO L284 TraceCheckUtils]: 145: Hoare quadruple {25575#(<= ~counter~0 7)} {25575#(<= ~counter~0 7)} #87#return; {25575#(<= ~counter~0 7)} is VALID [2022-04-08 11:31:23,699 INFO L290 TraceCheckUtils]: 146: Hoare triple {25575#(<= ~counter~0 7)} assume !(~r~0 >= 2 * ~b~0); {25575#(<= ~counter~0 7)} is VALID [2022-04-08 11:31:23,699 INFO L290 TraceCheckUtils]: 147: Hoare triple {25575#(<= ~counter~0 7)} ~r~0 := ~r~0 - ~b~0;~q~0 := ~q~0 + ~a~0; {25575#(<= ~counter~0 7)} is VALID [2022-04-08 11:31:23,700 INFO L290 TraceCheckUtils]: 148: Hoare triple {25575#(<= ~counter~0 7)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {25633#(<= |main_#t~post6| 7)} is VALID [2022-04-08 11:31:23,700 INFO L290 TraceCheckUtils]: 149: Hoare triple {25633#(<= |main_#t~post6| 7)} assume !(#t~post6 < 100);havoc #t~post6; {25177#false} is VALID [2022-04-08 11:31:23,700 INFO L272 TraceCheckUtils]: 150: Hoare triple {25177#false} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {25177#false} is VALID [2022-04-08 11:31:23,700 INFO L290 TraceCheckUtils]: 151: Hoare triple {25177#false} ~cond := #in~cond; {25177#false} is VALID [2022-04-08 11:31:23,700 INFO L290 TraceCheckUtils]: 152: Hoare triple {25177#false} assume 0 == ~cond; {25177#false} is VALID [2022-04-08 11:31:23,700 INFO L290 TraceCheckUtils]: 153: Hoare triple {25177#false} assume !false; {25177#false} is VALID [2022-04-08 11:31:23,701 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-08 11:31:23,701 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 11:31:24,499 INFO L290 TraceCheckUtils]: 153: Hoare triple {25177#false} assume !false; {25177#false} is VALID [2022-04-08 11:31:24,500 INFO L290 TraceCheckUtils]: 152: Hoare triple {25177#false} assume 0 == ~cond; {25177#false} is VALID [2022-04-08 11:31:24,500 INFO L290 TraceCheckUtils]: 151: Hoare triple {25177#false} ~cond := #in~cond; {25177#false} is VALID [2022-04-08 11:31:24,500 INFO L272 TraceCheckUtils]: 150: Hoare triple {25177#false} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {25177#false} is VALID [2022-04-08 11:31:24,500 INFO L290 TraceCheckUtils]: 149: Hoare triple {25661#(< |main_#t~post6| 100)} assume !(#t~post6 < 100);havoc #t~post6; {25177#false} is VALID [2022-04-08 11:31:24,500 INFO L290 TraceCheckUtils]: 148: Hoare triple {25665#(< ~counter~0 100)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {25661#(< |main_#t~post6| 100)} is VALID [2022-04-08 11:31:24,501 INFO L290 TraceCheckUtils]: 147: Hoare triple {25665#(< ~counter~0 100)} ~r~0 := ~r~0 - ~b~0;~q~0 := ~q~0 + ~a~0; {25665#(< ~counter~0 100)} is VALID [2022-04-08 11:31:24,501 INFO L290 TraceCheckUtils]: 146: Hoare triple {25665#(< ~counter~0 100)} assume !(~r~0 >= 2 * ~b~0); {25665#(< ~counter~0 100)} is VALID [2022-04-08 11:31:24,501 INFO L284 TraceCheckUtils]: 145: Hoare quadruple {25176#true} {25665#(< ~counter~0 100)} #87#return; {25665#(< ~counter~0 100)} is VALID [2022-04-08 11:31:24,501 INFO L290 TraceCheckUtils]: 144: Hoare triple {25176#true} assume true; {25176#true} is VALID [2022-04-08 11:31:24,502 INFO L290 TraceCheckUtils]: 143: Hoare triple {25176#true} assume !(0 == ~cond); {25176#true} is VALID [2022-04-08 11:31:24,502 INFO L290 TraceCheckUtils]: 142: Hoare triple {25176#true} ~cond := #in~cond; {25176#true} is VALID [2022-04-08 11:31:24,502 INFO L272 TraceCheckUtils]: 141: Hoare triple {25665#(< ~counter~0 100)} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {25176#true} is VALID [2022-04-08 11:31:24,502 INFO L284 TraceCheckUtils]: 140: Hoare quadruple {25176#true} {25665#(< ~counter~0 100)} #85#return; {25665#(< ~counter~0 100)} is VALID [2022-04-08 11:31:24,502 INFO L290 TraceCheckUtils]: 139: Hoare triple {25176#true} assume true; {25176#true} is VALID [2022-04-08 11:31:24,502 INFO L290 TraceCheckUtils]: 138: Hoare triple {25176#true} assume !(0 == ~cond); {25176#true} is VALID [2022-04-08 11:31:24,502 INFO L290 TraceCheckUtils]: 137: Hoare triple {25176#true} ~cond := #in~cond; {25176#true} is VALID [2022-04-08 11:31:24,502 INFO L272 TraceCheckUtils]: 136: Hoare triple {25665#(< ~counter~0 100)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {25176#true} is VALID [2022-04-08 11:31:24,503 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {25176#true} {25665#(< ~counter~0 100)} #83#return; {25665#(< ~counter~0 100)} is VALID [2022-04-08 11:31:24,503 INFO L290 TraceCheckUtils]: 134: Hoare triple {25176#true} assume true; {25176#true} is VALID [2022-04-08 11:31:24,503 INFO L290 TraceCheckUtils]: 133: Hoare triple {25176#true} assume !(0 == ~cond); {25176#true} is VALID [2022-04-08 11:31:24,503 INFO L290 TraceCheckUtils]: 132: Hoare triple {25176#true} ~cond := #in~cond; {25176#true} is VALID [2022-04-08 11:31:24,503 INFO L272 TraceCheckUtils]: 131: Hoare triple {25665#(< ~counter~0 100)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {25176#true} is VALID [2022-04-08 11:31:24,503 INFO L290 TraceCheckUtils]: 130: Hoare triple {25665#(< ~counter~0 100)} assume !!(#t~post7 < 100);havoc #t~post7; {25665#(< ~counter~0 100)} is VALID [2022-04-08 11:31:24,504 INFO L290 TraceCheckUtils]: 129: Hoare triple {25723#(< ~counter~0 99)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {25665#(< ~counter~0 100)} is VALID [2022-04-08 11:31:24,505 INFO L290 TraceCheckUtils]: 128: Hoare triple {25723#(< ~counter~0 99)} ~a~0 := 2 * ~a~0;~b~0 := 2 * ~b~0; {25723#(< ~counter~0 99)} is VALID [2022-04-08 11:31:24,505 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {25176#true} {25723#(< ~counter~0 99)} #89#return; {25723#(< ~counter~0 99)} is VALID [2022-04-08 11:31:24,505 INFO L290 TraceCheckUtils]: 126: Hoare triple {25176#true} assume true; {25176#true} is VALID [2022-04-08 11:31:24,505 INFO L290 TraceCheckUtils]: 125: Hoare triple {25176#true} assume !(0 == ~cond); {25176#true} is VALID [2022-04-08 11:31:24,505 INFO L290 TraceCheckUtils]: 124: Hoare triple {25176#true} ~cond := #in~cond; {25176#true} is VALID [2022-04-08 11:31:24,505 INFO L272 TraceCheckUtils]: 123: Hoare triple {25723#(< ~counter~0 99)} call __VERIFIER_assert((if ~r~0 >= 2 * ~y~0 * ~a~0 then 1 else 0)); {25176#true} is VALID [2022-04-08 11:31:24,506 INFO L290 TraceCheckUtils]: 122: Hoare triple {25723#(< ~counter~0 99)} assume !!(~r~0 >= 2 * ~b~0); {25723#(< ~counter~0 99)} is VALID [2022-04-08 11:31:24,506 INFO L284 TraceCheckUtils]: 121: Hoare quadruple {25176#true} {25723#(< ~counter~0 99)} #87#return; {25723#(< ~counter~0 99)} is VALID [2022-04-08 11:31:24,506 INFO L290 TraceCheckUtils]: 120: Hoare triple {25176#true} assume true; {25176#true} is VALID [2022-04-08 11:31:24,506 INFO L290 TraceCheckUtils]: 119: Hoare triple {25176#true} assume !(0 == ~cond); {25176#true} is VALID [2022-04-08 11:31:24,506 INFO L290 TraceCheckUtils]: 118: Hoare triple {25176#true} ~cond := #in~cond; {25176#true} is VALID [2022-04-08 11:31:24,506 INFO L272 TraceCheckUtils]: 117: Hoare triple {25723#(< ~counter~0 99)} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {25176#true} is VALID [2022-04-08 11:31:24,507 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {25176#true} {25723#(< ~counter~0 99)} #85#return; {25723#(< ~counter~0 99)} is VALID [2022-04-08 11:31:24,507 INFO L290 TraceCheckUtils]: 115: Hoare triple {25176#true} assume true; {25176#true} is VALID [2022-04-08 11:31:24,507 INFO L290 TraceCheckUtils]: 114: Hoare triple {25176#true} assume !(0 == ~cond); {25176#true} is VALID [2022-04-08 11:31:24,507 INFO L290 TraceCheckUtils]: 113: Hoare triple {25176#true} ~cond := #in~cond; {25176#true} is VALID [2022-04-08 11:31:24,507 INFO L272 TraceCheckUtils]: 112: Hoare triple {25723#(< ~counter~0 99)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {25176#true} is VALID [2022-04-08 11:31:24,507 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {25176#true} {25723#(< ~counter~0 99)} #83#return; {25723#(< ~counter~0 99)} is VALID [2022-04-08 11:31:24,507 INFO L290 TraceCheckUtils]: 110: Hoare triple {25176#true} assume true; {25176#true} is VALID [2022-04-08 11:31:24,508 INFO L290 TraceCheckUtils]: 109: Hoare triple {25176#true} assume !(0 == ~cond); {25176#true} is VALID [2022-04-08 11:31:24,508 INFO L290 TraceCheckUtils]: 108: Hoare triple {25176#true} ~cond := #in~cond; {25176#true} is VALID [2022-04-08 11:31:24,508 INFO L272 TraceCheckUtils]: 107: Hoare triple {25723#(< ~counter~0 99)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {25176#true} is VALID [2022-04-08 11:31:24,508 INFO L290 TraceCheckUtils]: 106: Hoare triple {25723#(< ~counter~0 99)} assume !!(#t~post7 < 100);havoc #t~post7; {25723#(< ~counter~0 99)} is VALID [2022-04-08 11:31:24,508 INFO L290 TraceCheckUtils]: 105: Hoare triple {25796#(< ~counter~0 98)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {25723#(< ~counter~0 99)} is VALID [2022-04-08 11:31:24,519 INFO L290 TraceCheckUtils]: 104: Hoare triple {25796#(< ~counter~0 98)} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {25796#(< ~counter~0 98)} is VALID [2022-04-08 11:31:24,520 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {25176#true} {25796#(< ~counter~0 98)} #81#return; {25796#(< ~counter~0 98)} is VALID [2022-04-08 11:31:24,520 INFO L290 TraceCheckUtils]: 102: Hoare triple {25176#true} assume true; {25176#true} is VALID [2022-04-08 11:31:24,520 INFO L290 TraceCheckUtils]: 101: Hoare triple {25176#true} assume !(0 == ~cond); {25176#true} is VALID [2022-04-08 11:31:24,520 INFO L290 TraceCheckUtils]: 100: Hoare triple {25176#true} ~cond := #in~cond; {25176#true} is VALID [2022-04-08 11:31:24,520 INFO L272 TraceCheckUtils]: 99: Hoare triple {25796#(< ~counter~0 98)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {25176#true} is VALID [2022-04-08 11:31:24,521 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {25176#true} {25796#(< ~counter~0 98)} #79#return; {25796#(< ~counter~0 98)} is VALID [2022-04-08 11:31:24,521 INFO L290 TraceCheckUtils]: 97: Hoare triple {25176#true} assume true; {25176#true} is VALID [2022-04-08 11:31:24,521 INFO L290 TraceCheckUtils]: 96: Hoare triple {25176#true} assume !(0 == ~cond); {25176#true} is VALID [2022-04-08 11:31:24,521 INFO L290 TraceCheckUtils]: 95: Hoare triple {25176#true} ~cond := #in~cond; {25176#true} is VALID [2022-04-08 11:31:24,521 INFO L272 TraceCheckUtils]: 94: Hoare triple {25796#(< ~counter~0 98)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {25176#true} is VALID [2022-04-08 11:31:24,521 INFO L290 TraceCheckUtils]: 93: Hoare triple {25796#(< ~counter~0 98)} assume !!(#t~post6 < 100);havoc #t~post6; {25796#(< ~counter~0 98)} is VALID [2022-04-08 11:31:24,522 INFO L290 TraceCheckUtils]: 92: Hoare triple {25836#(< ~counter~0 97)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {25796#(< ~counter~0 98)} is VALID [2022-04-08 11:31:24,522 INFO L290 TraceCheckUtils]: 91: Hoare triple {25836#(< ~counter~0 97)} ~r~0 := ~r~0 - ~b~0;~q~0 := ~q~0 + ~a~0; {25836#(< ~counter~0 97)} is VALID [2022-04-08 11:31:24,523 INFO L290 TraceCheckUtils]: 90: Hoare triple {25836#(< ~counter~0 97)} assume !(~r~0 >= 2 * ~b~0); {25836#(< ~counter~0 97)} is VALID [2022-04-08 11:31:24,523 INFO L284 TraceCheckUtils]: 89: Hoare quadruple {25176#true} {25836#(< ~counter~0 97)} #87#return; {25836#(< ~counter~0 97)} is VALID [2022-04-08 11:31:24,523 INFO L290 TraceCheckUtils]: 88: Hoare triple {25176#true} assume true; {25176#true} is VALID [2022-04-08 11:31:24,523 INFO L290 TraceCheckUtils]: 87: Hoare triple {25176#true} assume !(0 == ~cond); {25176#true} is VALID [2022-04-08 11:31:24,523 INFO L290 TraceCheckUtils]: 86: Hoare triple {25176#true} ~cond := #in~cond; {25176#true} is VALID [2022-04-08 11:31:24,523 INFO L272 TraceCheckUtils]: 85: Hoare triple {25836#(< ~counter~0 97)} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {25176#true} is VALID [2022-04-08 11:31:24,524 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {25176#true} {25836#(< ~counter~0 97)} #85#return; {25836#(< ~counter~0 97)} is VALID [2022-04-08 11:31:24,524 INFO L290 TraceCheckUtils]: 83: Hoare triple {25176#true} assume true; {25176#true} is VALID [2022-04-08 11:31:24,524 INFO L290 TraceCheckUtils]: 82: Hoare triple {25176#true} assume !(0 == ~cond); {25176#true} is VALID [2022-04-08 11:31:24,524 INFO L290 TraceCheckUtils]: 81: Hoare triple {25176#true} ~cond := #in~cond; {25176#true} is VALID [2022-04-08 11:31:24,524 INFO L272 TraceCheckUtils]: 80: Hoare triple {25836#(< ~counter~0 97)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {25176#true} is VALID [2022-04-08 11:31:24,525 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {25176#true} {25836#(< ~counter~0 97)} #83#return; {25836#(< ~counter~0 97)} is VALID [2022-04-08 11:31:24,525 INFO L290 TraceCheckUtils]: 78: Hoare triple {25176#true} assume true; {25176#true} is VALID [2022-04-08 11:31:24,525 INFO L290 TraceCheckUtils]: 77: Hoare triple {25176#true} assume !(0 == ~cond); {25176#true} is VALID [2022-04-08 11:31:24,525 INFO L290 TraceCheckUtils]: 76: Hoare triple {25176#true} ~cond := #in~cond; {25176#true} is VALID [2022-04-08 11:31:24,525 INFO L272 TraceCheckUtils]: 75: Hoare triple {25836#(< ~counter~0 97)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {25176#true} is VALID [2022-04-08 11:31:24,525 INFO L290 TraceCheckUtils]: 74: Hoare triple {25836#(< ~counter~0 97)} assume !!(#t~post7 < 100);havoc #t~post7; {25836#(< ~counter~0 97)} is VALID [2022-04-08 11:31:24,526 INFO L290 TraceCheckUtils]: 73: Hoare triple {25894#(< ~counter~0 96)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {25836#(< ~counter~0 97)} is VALID [2022-04-08 11:31:24,526 INFO L290 TraceCheckUtils]: 72: Hoare triple {25894#(< ~counter~0 96)} ~a~0 := 2 * ~a~0;~b~0 := 2 * ~b~0; {25894#(< ~counter~0 96)} is VALID [2022-04-08 11:31:24,527 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {25176#true} {25894#(< ~counter~0 96)} #89#return; {25894#(< ~counter~0 96)} is VALID [2022-04-08 11:31:24,527 INFO L290 TraceCheckUtils]: 70: Hoare triple {25176#true} assume true; {25176#true} is VALID [2022-04-08 11:31:24,527 INFO L290 TraceCheckUtils]: 69: Hoare triple {25176#true} assume !(0 == ~cond); {25176#true} is VALID [2022-04-08 11:31:24,527 INFO L290 TraceCheckUtils]: 68: Hoare triple {25176#true} ~cond := #in~cond; {25176#true} is VALID [2022-04-08 11:31:24,527 INFO L272 TraceCheckUtils]: 67: Hoare triple {25894#(< ~counter~0 96)} call __VERIFIER_assert((if ~r~0 >= 2 * ~y~0 * ~a~0 then 1 else 0)); {25176#true} is VALID [2022-04-08 11:31:24,527 INFO L290 TraceCheckUtils]: 66: Hoare triple {25894#(< ~counter~0 96)} assume !!(~r~0 >= 2 * ~b~0); {25894#(< ~counter~0 96)} is VALID [2022-04-08 11:31:24,528 INFO L284 TraceCheckUtils]: 65: Hoare quadruple {25176#true} {25894#(< ~counter~0 96)} #87#return; {25894#(< ~counter~0 96)} is VALID [2022-04-08 11:31:24,528 INFO L290 TraceCheckUtils]: 64: Hoare triple {25176#true} assume true; {25176#true} is VALID [2022-04-08 11:31:24,528 INFO L290 TraceCheckUtils]: 63: Hoare triple {25176#true} assume !(0 == ~cond); {25176#true} is VALID [2022-04-08 11:31:24,528 INFO L290 TraceCheckUtils]: 62: Hoare triple {25176#true} ~cond := #in~cond; {25176#true} is VALID [2022-04-08 11:31:24,528 INFO L272 TraceCheckUtils]: 61: Hoare triple {25894#(< ~counter~0 96)} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {25176#true} is VALID [2022-04-08 11:31:24,529 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {25176#true} {25894#(< ~counter~0 96)} #85#return; {25894#(< ~counter~0 96)} is VALID [2022-04-08 11:31:24,529 INFO L290 TraceCheckUtils]: 59: Hoare triple {25176#true} assume true; {25176#true} is VALID [2022-04-08 11:31:24,529 INFO L290 TraceCheckUtils]: 58: Hoare triple {25176#true} assume !(0 == ~cond); {25176#true} is VALID [2022-04-08 11:31:24,529 INFO L290 TraceCheckUtils]: 57: Hoare triple {25176#true} ~cond := #in~cond; {25176#true} is VALID [2022-04-08 11:31:24,529 INFO L272 TraceCheckUtils]: 56: Hoare triple {25894#(< ~counter~0 96)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {25176#true} is VALID [2022-04-08 11:31:24,529 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {25176#true} {25894#(< ~counter~0 96)} #83#return; {25894#(< ~counter~0 96)} is VALID [2022-04-08 11:31:24,529 INFO L290 TraceCheckUtils]: 54: Hoare triple {25176#true} assume true; {25176#true} is VALID [2022-04-08 11:31:24,530 INFO L290 TraceCheckUtils]: 53: Hoare triple {25176#true} assume !(0 == ~cond); {25176#true} is VALID [2022-04-08 11:31:24,530 INFO L290 TraceCheckUtils]: 52: Hoare triple {25176#true} ~cond := #in~cond; {25176#true} is VALID [2022-04-08 11:31:24,530 INFO L272 TraceCheckUtils]: 51: Hoare triple {25894#(< ~counter~0 96)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {25176#true} is VALID [2022-04-08 11:31:24,530 INFO L290 TraceCheckUtils]: 50: Hoare triple {25894#(< ~counter~0 96)} assume !!(#t~post7 < 100);havoc #t~post7; {25894#(< ~counter~0 96)} is VALID [2022-04-08 11:31:24,531 INFO L290 TraceCheckUtils]: 49: Hoare triple {25967#(< ~counter~0 95)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {25894#(< ~counter~0 96)} is VALID [2022-04-08 11:31:24,531 INFO L290 TraceCheckUtils]: 48: Hoare triple {25967#(< ~counter~0 95)} ~a~0 := 2 * ~a~0;~b~0 := 2 * ~b~0; {25967#(< ~counter~0 95)} is VALID [2022-04-08 11:31:24,531 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {25176#true} {25967#(< ~counter~0 95)} #89#return; {25967#(< ~counter~0 95)} is VALID [2022-04-08 11:31:24,531 INFO L290 TraceCheckUtils]: 46: Hoare triple {25176#true} assume true; {25176#true} is VALID [2022-04-08 11:31:24,531 INFO L290 TraceCheckUtils]: 45: Hoare triple {25176#true} assume !(0 == ~cond); {25176#true} is VALID [2022-04-08 11:31:24,532 INFO L290 TraceCheckUtils]: 44: Hoare triple {25176#true} ~cond := #in~cond; {25176#true} is VALID [2022-04-08 11:31:24,532 INFO L272 TraceCheckUtils]: 43: Hoare triple {25967#(< ~counter~0 95)} call __VERIFIER_assert((if ~r~0 >= 2 * ~y~0 * ~a~0 then 1 else 0)); {25176#true} is VALID [2022-04-08 11:31:24,532 INFO L290 TraceCheckUtils]: 42: Hoare triple {25967#(< ~counter~0 95)} assume !!(~r~0 >= 2 * ~b~0); {25967#(< ~counter~0 95)} is VALID [2022-04-08 11:31:24,532 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {25176#true} {25967#(< ~counter~0 95)} #87#return; {25967#(< ~counter~0 95)} is VALID [2022-04-08 11:31:24,532 INFO L290 TraceCheckUtils]: 40: Hoare triple {25176#true} assume true; {25176#true} is VALID [2022-04-08 11:31:24,532 INFO L290 TraceCheckUtils]: 39: Hoare triple {25176#true} assume !(0 == ~cond); {25176#true} is VALID [2022-04-08 11:31:24,532 INFO L290 TraceCheckUtils]: 38: Hoare triple {25176#true} ~cond := #in~cond; {25176#true} is VALID [2022-04-08 11:31:24,532 INFO L272 TraceCheckUtils]: 37: Hoare triple {25967#(< ~counter~0 95)} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {25176#true} is VALID [2022-04-08 11:31:24,533 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {25176#true} {25967#(< ~counter~0 95)} #85#return; {25967#(< ~counter~0 95)} is VALID [2022-04-08 11:31:24,533 INFO L290 TraceCheckUtils]: 35: Hoare triple {25176#true} assume true; {25176#true} is VALID [2022-04-08 11:31:24,533 INFO L290 TraceCheckUtils]: 34: Hoare triple {25176#true} assume !(0 == ~cond); {25176#true} is VALID [2022-04-08 11:31:24,533 INFO L290 TraceCheckUtils]: 33: Hoare triple {25176#true} ~cond := #in~cond; {25176#true} is VALID [2022-04-08 11:31:24,533 INFO L272 TraceCheckUtils]: 32: Hoare triple {25967#(< ~counter~0 95)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {25176#true} is VALID [2022-04-08 11:31:24,534 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {25176#true} {25967#(< ~counter~0 95)} #83#return; {25967#(< ~counter~0 95)} is VALID [2022-04-08 11:31:24,534 INFO L290 TraceCheckUtils]: 30: Hoare triple {25176#true} assume true; {25176#true} is VALID [2022-04-08 11:31:24,534 INFO L290 TraceCheckUtils]: 29: Hoare triple {25176#true} assume !(0 == ~cond); {25176#true} is VALID [2022-04-08 11:31:24,534 INFO L290 TraceCheckUtils]: 28: Hoare triple {25176#true} ~cond := #in~cond; {25176#true} is VALID [2022-04-08 11:31:24,534 INFO L272 TraceCheckUtils]: 27: Hoare triple {25967#(< ~counter~0 95)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {25176#true} is VALID [2022-04-08 11:31:24,534 INFO L290 TraceCheckUtils]: 26: Hoare triple {25967#(< ~counter~0 95)} assume !!(#t~post7 < 100);havoc #t~post7; {25967#(< ~counter~0 95)} is VALID [2022-04-08 11:31:24,535 INFO L290 TraceCheckUtils]: 25: Hoare triple {26040#(< ~counter~0 94)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {25967#(< ~counter~0 95)} is VALID [2022-04-08 11:31:24,535 INFO L290 TraceCheckUtils]: 24: Hoare triple {26040#(< ~counter~0 94)} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {26040#(< ~counter~0 94)} is VALID [2022-04-08 11:31:24,535 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {25176#true} {26040#(< ~counter~0 94)} #81#return; {26040#(< ~counter~0 94)} is VALID [2022-04-08 11:31:24,536 INFO L290 TraceCheckUtils]: 22: Hoare triple {25176#true} assume true; {25176#true} is VALID [2022-04-08 11:31:24,536 INFO L290 TraceCheckUtils]: 21: Hoare triple {25176#true} assume !(0 == ~cond); {25176#true} is VALID [2022-04-08 11:31:24,536 INFO L290 TraceCheckUtils]: 20: Hoare triple {25176#true} ~cond := #in~cond; {25176#true} is VALID [2022-04-08 11:31:24,536 INFO L272 TraceCheckUtils]: 19: Hoare triple {26040#(< ~counter~0 94)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {25176#true} is VALID [2022-04-08 11:31:24,536 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {25176#true} {26040#(< ~counter~0 94)} #79#return; {26040#(< ~counter~0 94)} is VALID [2022-04-08 11:31:24,536 INFO L290 TraceCheckUtils]: 17: Hoare triple {25176#true} assume true; {25176#true} is VALID [2022-04-08 11:31:24,536 INFO L290 TraceCheckUtils]: 16: Hoare triple {25176#true} assume !(0 == ~cond); {25176#true} is VALID [2022-04-08 11:31:24,536 INFO L290 TraceCheckUtils]: 15: Hoare triple {25176#true} ~cond := #in~cond; {25176#true} is VALID [2022-04-08 11:31:24,536 INFO L272 TraceCheckUtils]: 14: Hoare triple {26040#(< ~counter~0 94)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {25176#true} is VALID [2022-04-08 11:31:24,537 INFO L290 TraceCheckUtils]: 13: Hoare triple {26040#(< ~counter~0 94)} assume !!(#t~post6 < 100);havoc #t~post6; {26040#(< ~counter~0 94)} is VALID [2022-04-08 11:31:24,537 INFO L290 TraceCheckUtils]: 12: Hoare triple {26080#(< ~counter~0 93)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {26040#(< ~counter~0 94)} is VALID [2022-04-08 11:31:24,538 INFO L290 TraceCheckUtils]: 11: Hoare triple {26080#(< ~counter~0 93)} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {26080#(< ~counter~0 93)} is VALID [2022-04-08 11:31:24,538 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {25176#true} {26080#(< ~counter~0 93)} #77#return; {26080#(< ~counter~0 93)} is VALID [2022-04-08 11:31:24,538 INFO L290 TraceCheckUtils]: 9: Hoare triple {25176#true} assume true; {25176#true} is VALID [2022-04-08 11:31:24,538 INFO L290 TraceCheckUtils]: 8: Hoare triple {25176#true} assume !(0 == ~cond); {25176#true} is VALID [2022-04-08 11:31:24,538 INFO L290 TraceCheckUtils]: 7: Hoare triple {25176#true} ~cond := #in~cond; {25176#true} is VALID [2022-04-08 11:31:24,538 INFO L272 TraceCheckUtils]: 6: Hoare triple {26080#(< ~counter~0 93)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {25176#true} is VALID [2022-04-08 11:31:24,538 INFO L290 TraceCheckUtils]: 5: Hoare triple {26080#(< ~counter~0 93)} 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; {26080#(< ~counter~0 93)} is VALID [2022-04-08 11:31:24,539 INFO L272 TraceCheckUtils]: 4: Hoare triple {26080#(< ~counter~0 93)} call #t~ret8 := main(); {26080#(< ~counter~0 93)} is VALID [2022-04-08 11:31:24,539 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26080#(< ~counter~0 93)} {25176#true} #93#return; {26080#(< ~counter~0 93)} is VALID [2022-04-08 11:31:24,539 INFO L290 TraceCheckUtils]: 2: Hoare triple {26080#(< ~counter~0 93)} assume true; {26080#(< ~counter~0 93)} is VALID [2022-04-08 11:31:24,540 INFO L290 TraceCheckUtils]: 1: Hoare triple {25176#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; {26080#(< ~counter~0 93)} is VALID [2022-04-08 11:31:24,540 INFO L272 TraceCheckUtils]: 0: Hoare triple {25176#true} call ULTIMATE.init(); {25176#true} is VALID [2022-04-08 11:31:24,540 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-08 11:31:24,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:31:24,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449892455] [2022-04-08 11:31:24,541 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:31:24,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1583767143] [2022-04-08 11:31:24,541 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1583767143] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 11:31:24,541 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 11:31:24,541 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2022-04-08 11:31:24,541 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:31:24,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1932039602] [2022-04-08 11:31:24,541 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1932039602] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:31:24,541 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:31:24,541 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-08 11:31:24,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451074947] [2022-04-08 11:31:24,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:31:24,542 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-08 11:31:24,542 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:31:24,542 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-08 11:31:24,630 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-08 11:31:24,630 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-08 11:31:24,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:31:24,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-08 11:31:24,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=222, Unknown=0, NotChecked=0, Total=380 [2022-04-08 11:31:24,631 INFO L87 Difference]: Start difference. First operand 287 states and 328 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-08 11:31:26,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:31:26,106 INFO L93 Difference]: Finished difference Result 362 states and 414 transitions. [2022-04-08 11:31:26,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-08 11:31:26,106 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-08 11:31:26,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:31:26,106 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-08 11:31:26,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 181 transitions. [2022-04-08 11:31:26,110 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-08 11:31:26,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 181 transitions. [2022-04-08 11:31:26,112 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 181 transitions. [2022-04-08 11:31:26,253 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-08 11:31:26,260 INFO L225 Difference]: With dead ends: 362 [2022-04-08 11:31:26,260 INFO L226 Difference]: Without dead ends: 355 [2022-04-08 11:31:26,260 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 311 GetRequests, 289 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=225, Invalid=327, Unknown=0, NotChecked=0, Total=552 [2022-04-08 11:31:26,261 INFO L913 BasicCegarLoop]: 71 mSDtfsCounter, 63 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-08 11:31:26,261 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [63 Valid, 258 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-08 11:31:26,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2022-04-08 11:31:26,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 344. [2022-04-08 11:31:26,777 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:31:26,778 INFO L82 GeneralOperation]: Start isEquivalent. First operand 355 states. Second operand has 344 states, 223 states have (on average 1.094170403587444) internal successors, (244), 228 states have internal predecessors, (244), 77 states have call successors, (77), 45 states have call predecessors, (77), 43 states have return successors, (74), 70 states have call predecessors, (74), 74 states have call successors, (74) [2022-04-08 11:31:26,778 INFO L74 IsIncluded]: Start isIncluded. First operand 355 states. Second operand has 344 states, 223 states have (on average 1.094170403587444) internal successors, (244), 228 states have internal predecessors, (244), 77 states have call successors, (77), 45 states have call predecessors, (77), 43 states have return successors, (74), 70 states have call predecessors, (74), 74 states have call successors, (74) [2022-04-08 11:31:26,779 INFO L87 Difference]: Start difference. First operand 355 states. Second operand has 344 states, 223 states have (on average 1.094170403587444) internal successors, (244), 228 states have internal predecessors, (244), 77 states have call successors, (77), 45 states have call predecessors, (77), 43 states have return successors, (74), 70 states have call predecessors, (74), 74 states have call successors, (74) [2022-04-08 11:31:26,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:31:26,784 INFO L93 Difference]: Finished difference Result 355 states and 406 transitions. [2022-04-08 11:31:26,784 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 406 transitions. [2022-04-08 11:31:26,784 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:31:26,784 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:31:26,785 INFO L74 IsIncluded]: Start isIncluded. First operand has 344 states, 223 states have (on average 1.094170403587444) internal successors, (244), 228 states have internal predecessors, (244), 77 states have call successors, (77), 45 states have call predecessors, (77), 43 states have return successors, (74), 70 states have call predecessors, (74), 74 states have call successors, (74) Second operand 355 states. [2022-04-08 11:31:26,785 INFO L87 Difference]: Start difference. First operand has 344 states, 223 states have (on average 1.094170403587444) internal successors, (244), 228 states have internal predecessors, (244), 77 states have call successors, (77), 45 states have call predecessors, (77), 43 states have return successors, (74), 70 states have call predecessors, (74), 74 states have call successors, (74) Second operand 355 states. [2022-04-08 11:31:26,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:31:26,790 INFO L93 Difference]: Finished difference Result 355 states and 406 transitions. [2022-04-08 11:31:26,790 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 406 transitions. [2022-04-08 11:31:26,791 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:31:26,791 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:31:26,791 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:31:26,791 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:31:26,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 223 states have (on average 1.094170403587444) internal successors, (244), 228 states have internal predecessors, (244), 77 states have call successors, (77), 45 states have call predecessors, (77), 43 states have return successors, (74), 70 states have call predecessors, (74), 74 states have call successors, (74) [2022-04-08 11:31:26,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 395 transitions. [2022-04-08 11:31:26,797 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 395 transitions. Word has length 154 [2022-04-08 11:31:26,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:31:26,798 INFO L478 AbstractCegarLoop]: Abstraction has 344 states and 395 transitions. [2022-04-08 11:31:26,798 INFO L479 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-08 11:31:26,798 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 344 states and 395 transitions. [2022-04-08 11:31:27,412 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 395 edges. 395 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:31:27,412 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 395 transitions. [2022-04-08 11:31:27,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2022-04-08 11:31:27,422 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:31:27,422 INFO L499 BasicCegarLoop]: 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-08 11:31:27,448 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-04-08 11:31:27,623 WARN L460 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-08 11:31:27,625 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:31:27,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:31:27,626 INFO L85 PathProgramCache]: Analyzing trace with hash -1775621107, now seen corresponding path program 3 times [2022-04-08 11:31:27,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:31:27,626 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1558762448] [2022-04-08 11:32:12,934 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 11:32:12,935 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 11:32:12,935 INFO L85 PathProgramCache]: Analyzing trace with hash -1775621107, now seen corresponding path program 4 times [2022-04-08 11:32:12,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:32:12,935 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370049141] [2022-04-08 11:32:12,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:32:12,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:32:12,953 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:32:12,953 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1276610572] [2022-04-08 11:32:12,953 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 11:32:12,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:32:12,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:32:12,954 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-08 11:32:12,967 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-08 11:32:13,060 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 11:32:13,061 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:32:13,062 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 51 conjunts are in the unsatisfiable core [2022-04-08 11:32:13,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:32:13,087 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:32:56,802 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-08 11:32:57,680 INFO L272 TraceCheckUtils]: 0: Hoare triple {28249#true} call ULTIMATE.init(); {28249#true} is VALID [2022-04-08 11:32:57,680 INFO L290 TraceCheckUtils]: 1: Hoare triple {28249#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; {28249#true} is VALID [2022-04-08 11:32:57,680 INFO L290 TraceCheckUtils]: 2: Hoare triple {28249#true} assume true; {28249#true} is VALID [2022-04-08 11:32:57,680 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28249#true} {28249#true} #93#return; {28249#true} is VALID [2022-04-08 11:32:57,680 INFO L272 TraceCheckUtils]: 4: Hoare triple {28249#true} call #t~ret8 := main(); {28249#true} is VALID [2022-04-08 11:32:57,680 INFO L290 TraceCheckUtils]: 5: Hoare triple {28249#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; {28249#true} is VALID [2022-04-08 11:32:57,680 INFO L272 TraceCheckUtils]: 6: Hoare triple {28249#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {28249#true} is VALID [2022-04-08 11:32:57,680 INFO L290 TraceCheckUtils]: 7: Hoare triple {28249#true} ~cond := #in~cond; {28249#true} is VALID [2022-04-08 11:32:57,681 INFO L290 TraceCheckUtils]: 8: Hoare triple {28249#true} assume !(0 == ~cond); {28249#true} is VALID [2022-04-08 11:32:57,681 INFO L290 TraceCheckUtils]: 9: Hoare triple {28249#true} assume true; {28249#true} is VALID [2022-04-08 11:32:57,681 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {28249#true} {28249#true} #77#return; {28249#true} is VALID [2022-04-08 11:32:57,681 INFO L290 TraceCheckUtils]: 11: Hoare triple {28249#true} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {28287#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 11:32:57,681 INFO L290 TraceCheckUtils]: 12: Hoare triple {28287#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {28287#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 11:32:57,682 INFO L290 TraceCheckUtils]: 13: Hoare triple {28287#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} assume !!(#t~post6 < 100);havoc #t~post6; {28287#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 11:32:57,682 INFO L272 TraceCheckUtils]: 14: Hoare triple {28287#(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)); {28249#true} is VALID [2022-04-08 11:32:57,682 INFO L290 TraceCheckUtils]: 15: Hoare triple {28249#true} ~cond := #in~cond; {28249#true} is VALID [2022-04-08 11:32:57,682 INFO L290 TraceCheckUtils]: 16: Hoare triple {28249#true} assume !(0 == ~cond); {28249#true} is VALID [2022-04-08 11:32:57,682 INFO L290 TraceCheckUtils]: 17: Hoare triple {28249#true} assume true; {28249#true} is VALID [2022-04-08 11:32:57,682 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {28249#true} {28287#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #79#return; {28287#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 11:32:57,683 INFO L272 TraceCheckUtils]: 19: Hoare triple {28287#(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)); {28249#true} is VALID [2022-04-08 11:32:57,683 INFO L290 TraceCheckUtils]: 20: Hoare triple {28249#true} ~cond := #in~cond; {28249#true} is VALID [2022-04-08 11:32:57,683 INFO L290 TraceCheckUtils]: 21: Hoare triple {28249#true} assume !(0 == ~cond); {28249#true} is VALID [2022-04-08 11:32:57,683 INFO L290 TraceCheckUtils]: 22: Hoare triple {28249#true} assume true; {28249#true} is VALID [2022-04-08 11:32:57,683 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {28249#true} {28287#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #81#return; {28287#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 11:32:57,683 INFO L290 TraceCheckUtils]: 24: Hoare triple {28287#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {28327#(and (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-08 11:32:57,684 INFO L290 TraceCheckUtils]: 25: Hoare triple {28327#(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; {28327#(and (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-08 11:32:57,684 INFO L290 TraceCheckUtils]: 26: Hoare triple {28327#(and (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} assume !!(#t~post7 < 100);havoc #t~post7; {28327#(and (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-08 11:32:57,684 INFO L272 TraceCheckUtils]: 27: Hoare triple {28327#(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)); {28249#true} is VALID [2022-04-08 11:32:57,684 INFO L290 TraceCheckUtils]: 28: Hoare triple {28249#true} ~cond := #in~cond; {28249#true} is VALID [2022-04-08 11:32:57,684 INFO L290 TraceCheckUtils]: 29: Hoare triple {28249#true} assume !(0 == ~cond); {28249#true} is VALID [2022-04-08 11:32:57,685 INFO L290 TraceCheckUtils]: 30: Hoare triple {28249#true} assume true; {28249#true} is VALID [2022-04-08 11:32:57,685 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {28249#true} {28327#(and (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #83#return; {28327#(and (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-08 11:32:57,685 INFO L272 TraceCheckUtils]: 32: Hoare triple {28327#(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)); {28249#true} is VALID [2022-04-08 11:32:57,685 INFO L290 TraceCheckUtils]: 33: Hoare triple {28249#true} ~cond := #in~cond; {28249#true} is VALID [2022-04-08 11:32:57,685 INFO L290 TraceCheckUtils]: 34: Hoare triple {28249#true} assume !(0 == ~cond); {28249#true} is VALID [2022-04-08 11:32:57,685 INFO L290 TraceCheckUtils]: 35: Hoare triple {28249#true} assume true; {28249#true} is VALID [2022-04-08 11:32:57,686 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {28249#true} {28327#(and (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #85#return; {28327#(and (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-08 11:32:57,686 INFO L272 TraceCheckUtils]: 37: Hoare triple {28327#(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)); {28249#true} is VALID [2022-04-08 11:32:57,686 INFO L290 TraceCheckUtils]: 38: Hoare triple {28249#true} ~cond := #in~cond; {28249#true} is VALID [2022-04-08 11:32:57,686 INFO L290 TraceCheckUtils]: 39: Hoare triple {28249#true} assume !(0 == ~cond); {28249#true} is VALID [2022-04-08 11:32:57,686 INFO L290 TraceCheckUtils]: 40: Hoare triple {28249#true} assume true; {28249#true} is VALID [2022-04-08 11:32:57,686 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {28249#true} {28327#(and (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #87#return; {28327#(and (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-08 11:32:57,687 INFO L290 TraceCheckUtils]: 42: Hoare triple {28327#(and (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} assume !!(~r~0 >= 2 * ~b~0); {28327#(and (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-08 11:32:57,687 INFO L272 TraceCheckUtils]: 43: Hoare triple {28327#(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)); {28249#true} is VALID [2022-04-08 11:32:57,687 INFO L290 TraceCheckUtils]: 44: Hoare triple {28249#true} ~cond := #in~cond; {28249#true} is VALID [2022-04-08 11:32:57,687 INFO L290 TraceCheckUtils]: 45: Hoare triple {28249#true} assume !(0 == ~cond); {28249#true} is VALID [2022-04-08 11:32:57,687 INFO L290 TraceCheckUtils]: 46: Hoare triple {28249#true} assume true; {28249#true} is VALID [2022-04-08 11:32:57,688 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {28249#true} {28327#(and (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #89#return; {28327#(and (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-08 11:32:57,689 INFO L290 TraceCheckUtils]: 48: Hoare triple {28327#(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; {28400#(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-08 11:32:57,689 INFO L290 TraceCheckUtils]: 49: Hoare triple {28400#(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; {28400#(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-08 11:32:57,689 INFO L290 TraceCheckUtils]: 50: Hoare triple {28400#(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 < 100);havoc #t~post7; {28400#(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-08 11:32:57,689 INFO L272 TraceCheckUtils]: 51: Hoare triple {28400#(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)); {28249#true} is VALID [2022-04-08 11:32:57,690 INFO L290 TraceCheckUtils]: 52: Hoare triple {28249#true} ~cond := #in~cond; {28413#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:32:57,690 INFO L290 TraceCheckUtils]: 53: Hoare triple {28413#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {28417#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:32:57,690 INFO L290 TraceCheckUtils]: 54: Hoare triple {28417#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {28417#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:32:57,691 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {28417#(not (= |__VERIFIER_assert_#in~cond| 0))} {28400#(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; {28424#(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-08 11:32:57,691 INFO L272 TraceCheckUtils]: 56: Hoare triple {28424#(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)); {28249#true} is VALID [2022-04-08 11:32:57,691 INFO L290 TraceCheckUtils]: 57: Hoare triple {28249#true} ~cond := #in~cond; {28249#true} is VALID [2022-04-08 11:32:57,691 INFO L290 TraceCheckUtils]: 58: Hoare triple {28249#true} assume !(0 == ~cond); {28249#true} is VALID [2022-04-08 11:32:57,691 INFO L290 TraceCheckUtils]: 59: Hoare triple {28249#true} assume true; {28249#true} is VALID [2022-04-08 11:32:57,692 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {28249#true} {28424#(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; {28424#(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-08 11:32:57,692 INFO L272 TraceCheckUtils]: 61: Hoare triple {28424#(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)); {28249#true} is VALID [2022-04-08 11:32:57,692 INFO L290 TraceCheckUtils]: 62: Hoare triple {28249#true} ~cond := #in~cond; {28249#true} is VALID [2022-04-08 11:32:57,692 INFO L290 TraceCheckUtils]: 63: Hoare triple {28249#true} assume !(0 == ~cond); {28249#true} is VALID [2022-04-08 11:32:57,692 INFO L290 TraceCheckUtils]: 64: Hoare triple {28249#true} assume true; {28249#true} is VALID [2022-04-08 11:32:57,697 INFO L284 TraceCheckUtils]: 65: Hoare quadruple {28249#true} {28424#(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; {28424#(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-08 11:32:57,698 INFO L290 TraceCheckUtils]: 66: Hoare triple {28424#(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); {28424#(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-08 11:32:57,698 INFO L272 TraceCheckUtils]: 67: Hoare triple {28424#(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)); {28249#true} is VALID [2022-04-08 11:32:57,698 INFO L290 TraceCheckUtils]: 68: Hoare triple {28249#true} ~cond := #in~cond; {28249#true} is VALID [2022-04-08 11:32:57,699 INFO L290 TraceCheckUtils]: 69: Hoare triple {28249#true} assume !(0 == ~cond); {28249#true} is VALID [2022-04-08 11:32:57,699 INFO L290 TraceCheckUtils]: 70: Hoare triple {28249#true} assume true; {28249#true} is VALID [2022-04-08 11:32:57,700 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {28249#true} {28424#(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; {28424#(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-08 11:32:57,704 INFO L290 TraceCheckUtils]: 72: Hoare triple {28424#(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; {28476#(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-08 11:32:57,704 INFO L290 TraceCheckUtils]: 73: Hoare triple {28476#(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; {28476#(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-08 11:32:57,705 INFO L290 TraceCheckUtils]: 74: Hoare triple {28476#(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 < 100);havoc #t~post7; {28476#(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-08 11:32:57,705 INFO L272 TraceCheckUtils]: 75: Hoare triple {28476#(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)); {28249#true} is VALID [2022-04-08 11:32:57,705 INFO L290 TraceCheckUtils]: 76: Hoare triple {28249#true} ~cond := #in~cond; {28249#true} is VALID [2022-04-08 11:32:57,705 INFO L290 TraceCheckUtils]: 77: Hoare triple {28249#true} assume !(0 == ~cond); {28249#true} is VALID [2022-04-08 11:32:57,705 INFO L290 TraceCheckUtils]: 78: Hoare triple {28249#true} assume true; {28249#true} is VALID [2022-04-08 11:32:57,706 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {28249#true} {28476#(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; {28476#(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-08 11:32:57,706 INFO L272 TraceCheckUtils]: 80: Hoare triple {28476#(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)); {28249#true} is VALID [2022-04-08 11:32:57,706 INFO L290 TraceCheckUtils]: 81: Hoare triple {28249#true} ~cond := #in~cond; {28249#true} is VALID [2022-04-08 11:32:57,706 INFO L290 TraceCheckUtils]: 82: Hoare triple {28249#true} assume !(0 == ~cond); {28249#true} is VALID [2022-04-08 11:32:57,706 INFO L290 TraceCheckUtils]: 83: Hoare triple {28249#true} assume true; {28249#true} is VALID [2022-04-08 11:32:57,707 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {28249#true} {28476#(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; {28476#(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-08 11:32:57,707 INFO L272 TraceCheckUtils]: 85: Hoare triple {28476#(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)); {28249#true} is VALID [2022-04-08 11:32:57,707 INFO L290 TraceCheckUtils]: 86: Hoare triple {28249#true} ~cond := #in~cond; {28249#true} is VALID [2022-04-08 11:32:57,707 INFO L290 TraceCheckUtils]: 87: Hoare triple {28249#true} assume !(0 == ~cond); {28249#true} is VALID [2022-04-08 11:32:57,707 INFO L290 TraceCheckUtils]: 88: Hoare triple {28249#true} assume true; {28249#true} is VALID [2022-04-08 11:32:57,707 INFO L284 TraceCheckUtils]: 89: Hoare quadruple {28249#true} {28476#(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; {28476#(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-08 11:32:57,708 INFO L290 TraceCheckUtils]: 90: Hoare triple {28476#(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); {28476#(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-08 11:32:57,710 INFO L290 TraceCheckUtils]: 91: Hoare triple {28476#(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; {28534#(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-08 11:32:57,710 INFO L290 TraceCheckUtils]: 92: Hoare triple {28534#(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; {28534#(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-08 11:32:57,711 INFO L290 TraceCheckUtils]: 93: Hoare triple {28534#(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 < 100);havoc #t~post6; {28534#(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-08 11:32:57,711 INFO L272 TraceCheckUtils]: 94: Hoare triple {28534#(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)); {28249#true} is VALID [2022-04-08 11:32:57,711 INFO L290 TraceCheckUtils]: 95: Hoare triple {28249#true} ~cond := #in~cond; {28413#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:32:57,712 INFO L290 TraceCheckUtils]: 96: Hoare triple {28413#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {28417#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:32:57,712 INFO L290 TraceCheckUtils]: 97: Hoare triple {28417#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {28417#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:32:57,714 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {28417#(not (= |__VERIFIER_assert_#in~cond| 0))} {28534#(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; {28556#(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-08 11:32:57,714 INFO L272 TraceCheckUtils]: 99: Hoare triple {28556#(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)); {28249#true} is VALID [2022-04-08 11:32:57,714 INFO L290 TraceCheckUtils]: 100: Hoare triple {28249#true} ~cond := #in~cond; {28249#true} is VALID [2022-04-08 11:32:57,714 INFO L290 TraceCheckUtils]: 101: Hoare triple {28249#true} assume !(0 == ~cond); {28249#true} is VALID [2022-04-08 11:32:57,714 INFO L290 TraceCheckUtils]: 102: Hoare triple {28249#true} assume true; {28249#true} is VALID [2022-04-08 11:32:57,715 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {28249#true} {28556#(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; {28556#(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-08 11:32:57,715 INFO L290 TraceCheckUtils]: 104: Hoare triple {28556#(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; {28575#(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-08 11:32:57,716 INFO L290 TraceCheckUtils]: 105: Hoare triple {28575#(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; {28575#(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-08 11:32:57,716 INFO L290 TraceCheckUtils]: 106: Hoare triple {28575#(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 < 100);havoc #t~post7; {28575#(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-08 11:32:57,716 INFO L272 TraceCheckUtils]: 107: Hoare triple {28575#(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)); {28249#true} is VALID [2022-04-08 11:32:57,716 INFO L290 TraceCheckUtils]: 108: Hoare triple {28249#true} ~cond := #in~cond; {28249#true} is VALID [2022-04-08 11:32:57,716 INFO L290 TraceCheckUtils]: 109: Hoare triple {28249#true} assume !(0 == ~cond); {28249#true} is VALID [2022-04-08 11:32:57,716 INFO L290 TraceCheckUtils]: 110: Hoare triple {28249#true} assume true; {28249#true} is VALID [2022-04-08 11:32:57,717 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {28249#true} {28575#(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; {28575#(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-08 11:32:57,717 INFO L272 TraceCheckUtils]: 112: Hoare triple {28575#(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)); {28249#true} is VALID [2022-04-08 11:32:57,717 INFO L290 TraceCheckUtils]: 113: Hoare triple {28249#true} ~cond := #in~cond; {28249#true} is VALID [2022-04-08 11:32:57,717 INFO L290 TraceCheckUtils]: 114: Hoare triple {28249#true} assume !(0 == ~cond); {28249#true} is VALID [2022-04-08 11:32:57,717 INFO L290 TraceCheckUtils]: 115: Hoare triple {28249#true} assume true; {28249#true} is VALID [2022-04-08 11:32:57,718 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {28249#true} {28575#(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; {28575#(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-08 11:32:57,718 INFO L272 TraceCheckUtils]: 117: Hoare triple {28575#(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)); {28249#true} is VALID [2022-04-08 11:32:57,718 INFO L290 TraceCheckUtils]: 118: Hoare triple {28249#true} ~cond := #in~cond; {28249#true} is VALID [2022-04-08 11:32:57,718 INFO L290 TraceCheckUtils]: 119: Hoare triple {28249#true} assume !(0 == ~cond); {28249#true} is VALID [2022-04-08 11:32:57,718 INFO L290 TraceCheckUtils]: 120: Hoare triple {28249#true} assume true; {28249#true} is VALID [2022-04-08 11:32:57,719 INFO L284 TraceCheckUtils]: 121: Hoare quadruple {28249#true} {28575#(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; {28575#(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-08 11:32:57,719 INFO L290 TraceCheckUtils]: 122: Hoare triple {28575#(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); {28575#(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-08 11:32:57,719 INFO L272 TraceCheckUtils]: 123: Hoare triple {28575#(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)); {28249#true} is VALID [2022-04-08 11:32:57,719 INFO L290 TraceCheckUtils]: 124: Hoare triple {28249#true} ~cond := #in~cond; {28249#true} is VALID [2022-04-08 11:32:57,719 INFO L290 TraceCheckUtils]: 125: Hoare triple {28249#true} assume !(0 == ~cond); {28249#true} is VALID [2022-04-08 11:32:57,719 INFO L290 TraceCheckUtils]: 126: Hoare triple {28249#true} assume true; {28249#true} is VALID [2022-04-08 11:32:57,720 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {28249#true} {28575#(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; {28575#(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-08 11:32:57,722 INFO L290 TraceCheckUtils]: 128: Hoare triple {28575#(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; {28648#(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-08 11:32:57,722 INFO L290 TraceCheckUtils]: 129: Hoare triple {28648#(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; {28648#(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-08 11:32:57,723 INFO L290 TraceCheckUtils]: 130: Hoare triple {28648#(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 < 100);havoc #t~post7; {28648#(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-08 11:32:57,723 INFO L272 TraceCheckUtils]: 131: Hoare triple {28648#(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)); {28249#true} is VALID [2022-04-08 11:32:57,723 INFO L290 TraceCheckUtils]: 132: Hoare triple {28249#true} ~cond := #in~cond; {28249#true} is VALID [2022-04-08 11:32:57,723 INFO L290 TraceCheckUtils]: 133: Hoare triple {28249#true} assume !(0 == ~cond); {28249#true} is VALID [2022-04-08 11:32:57,723 INFO L290 TraceCheckUtils]: 134: Hoare triple {28249#true} assume true; {28249#true} is VALID [2022-04-08 11:32:57,724 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {28249#true} {28648#(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; {28648#(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-08 11:32:57,724 INFO L272 TraceCheckUtils]: 136: Hoare triple {28648#(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)); {28249#true} is VALID [2022-04-08 11:32:57,724 INFO L290 TraceCheckUtils]: 137: Hoare triple {28249#true} ~cond := #in~cond; {28413#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:32:57,725 INFO L290 TraceCheckUtils]: 138: Hoare triple {28413#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {28417#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:32:57,725 INFO L290 TraceCheckUtils]: 139: Hoare triple {28417#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {28417#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:32:57,725 INFO L284 TraceCheckUtils]: 140: Hoare quadruple {28417#(not (= |__VERIFIER_assert_#in~cond| 0))} {28648#(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; {28648#(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-08 11:32:57,725 INFO L272 TraceCheckUtils]: 141: Hoare triple {28648#(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)); {28249#true} is VALID [2022-04-08 11:32:57,726 INFO L290 TraceCheckUtils]: 142: Hoare triple {28249#true} ~cond := #in~cond; {28249#true} is VALID [2022-04-08 11:32:57,726 INFO L290 TraceCheckUtils]: 143: Hoare triple {28249#true} assume !(0 == ~cond); {28249#true} is VALID [2022-04-08 11:32:57,726 INFO L290 TraceCheckUtils]: 144: Hoare triple {28249#true} assume true; {28249#true} is VALID [2022-04-08 11:32:57,726 INFO L284 TraceCheckUtils]: 145: Hoare quadruple {28249#true} {28648#(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; {28648#(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-08 11:32:57,727 INFO L290 TraceCheckUtils]: 146: Hoare triple {28648#(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); {28648#(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-08 11:32:57,735 INFO L290 TraceCheckUtils]: 147: Hoare triple {28648#(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; {28706#(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-08 11:32:57,736 INFO L290 TraceCheckUtils]: 148: Hoare triple {28706#(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; {28706#(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-08 11:32:57,736 INFO L290 TraceCheckUtils]: 149: Hoare triple {28706#(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 < 100);havoc #t~post6; {28706#(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-08 11:32:57,737 INFO L272 TraceCheckUtils]: 150: Hoare triple {28706#(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)); {28249#true} is VALID [2022-04-08 11:32:57,737 INFO L290 TraceCheckUtils]: 151: Hoare triple {28249#true} ~cond := #in~cond; {28413#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:32:57,737 INFO L290 TraceCheckUtils]: 152: Hoare triple {28413#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {28417#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:32:57,737 INFO L290 TraceCheckUtils]: 153: Hoare triple {28417#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {28417#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:32:57,748 INFO L284 TraceCheckUtils]: 154: Hoare quadruple {28417#(not (= |__VERIFIER_assert_#in~cond| 0))} {28706#(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; {28728#(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-08 11:32:57,758 INFO L272 TraceCheckUtils]: 155: Hoare triple {28728#(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)); {28732#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 11:32:57,758 INFO L290 TraceCheckUtils]: 156: Hoare triple {28732#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {28736#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:32:57,758 INFO L290 TraceCheckUtils]: 157: Hoare triple {28736#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {28250#false} is VALID [2022-04-08 11:32:57,758 INFO L290 TraceCheckUtils]: 158: Hoare triple {28250#false} assume !false; {28250#false} is VALID [2022-04-08 11:32:57,759 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-08 11:32:57,759 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 11:33:16,601 INFO L290 TraceCheckUtils]: 158: Hoare triple {28250#false} assume !false; {28250#false} is VALID [2022-04-08 11:33:16,602 INFO L290 TraceCheckUtils]: 157: Hoare triple {28736#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {28250#false} is VALID [2022-04-08 11:33:16,602 INFO L290 TraceCheckUtils]: 156: Hoare triple {28732#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {28736#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:33:16,602 INFO L272 TraceCheckUtils]: 155: Hoare triple {28752#(= (+ (* 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)); {28732#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 11:33:16,603 INFO L284 TraceCheckUtils]: 154: Hoare quadruple {28417#(not (= |__VERIFIER_assert_#in~cond| 0))} {28756#(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; {28752#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-08 11:33:16,603 INFO L290 TraceCheckUtils]: 153: Hoare triple {28417#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {28417#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:33:16,604 INFO L290 TraceCheckUtils]: 152: Hoare triple {28766#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {28417#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:33:16,604 INFO L290 TraceCheckUtils]: 151: Hoare triple {28249#true} ~cond := #in~cond; {28766#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 11:33:16,604 INFO L272 TraceCheckUtils]: 150: Hoare triple {28756#(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)); {28249#true} is VALID [2022-04-08 11:33:16,604 INFO L290 TraceCheckUtils]: 149: Hoare triple {28756#(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 < 100);havoc #t~post6; {28756#(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-08 11:33:16,605 INFO L290 TraceCheckUtils]: 148: Hoare triple {28756#(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; {28756#(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-08 11:33:16,633 INFO L290 TraceCheckUtils]: 147: Hoare triple {28756#(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; {28756#(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-08 11:33:16,633 INFO L290 TraceCheckUtils]: 146: Hoare triple {28756#(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); {28756#(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-08 11:33:16,634 INFO L284 TraceCheckUtils]: 145: Hoare quadruple {28249#true} {28756#(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; {28756#(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-08 11:33:16,634 INFO L290 TraceCheckUtils]: 144: Hoare triple {28249#true} assume true; {28249#true} is VALID [2022-04-08 11:33:16,634 INFO L290 TraceCheckUtils]: 143: Hoare triple {28249#true} assume !(0 == ~cond); {28249#true} is VALID [2022-04-08 11:33:16,634 INFO L290 TraceCheckUtils]: 142: Hoare triple {28249#true} ~cond := #in~cond; {28249#true} is VALID [2022-04-08 11:33:16,634 INFO L272 TraceCheckUtils]: 141: Hoare triple {28756#(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)); {28249#true} is VALID [2022-04-08 11:33:16,635 INFO L284 TraceCheckUtils]: 140: Hoare quadruple {28417#(not (= |__VERIFIER_assert_#in~cond| 0))} {28249#true} #85#return; {28756#(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-08 11:33:16,635 INFO L290 TraceCheckUtils]: 139: Hoare triple {28417#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {28417#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:33:16,635 INFO L290 TraceCheckUtils]: 138: Hoare triple {28766#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {28417#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:33:16,636 INFO L290 TraceCheckUtils]: 137: Hoare triple {28249#true} ~cond := #in~cond; {28766#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 11:33:16,636 INFO L272 TraceCheckUtils]: 136: Hoare triple {28249#true} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {28249#true} is VALID [2022-04-08 11:33:16,636 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {28249#true} {28249#true} #83#return; {28249#true} is VALID [2022-04-08 11:33:16,636 INFO L290 TraceCheckUtils]: 134: Hoare triple {28249#true} assume true; {28249#true} is VALID [2022-04-08 11:33:16,636 INFO L290 TraceCheckUtils]: 133: Hoare triple {28249#true} assume !(0 == ~cond); {28249#true} is VALID [2022-04-08 11:33:16,636 INFO L290 TraceCheckUtils]: 132: Hoare triple {28249#true} ~cond := #in~cond; {28249#true} is VALID [2022-04-08 11:33:16,636 INFO L272 TraceCheckUtils]: 131: Hoare triple {28249#true} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {28249#true} is VALID [2022-04-08 11:33:16,636 INFO L290 TraceCheckUtils]: 130: Hoare triple {28249#true} assume !!(#t~post7 < 100);havoc #t~post7; {28249#true} is VALID [2022-04-08 11:33:16,636 INFO L290 TraceCheckUtils]: 129: Hoare triple {28249#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {28249#true} is VALID [2022-04-08 11:33:16,636 INFO L290 TraceCheckUtils]: 128: Hoare triple {28249#true} ~a~0 := 2 * ~a~0;~b~0 := 2 * ~b~0; {28249#true} is VALID [2022-04-08 11:33:16,636 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {28249#true} {28249#true} #89#return; {28249#true} is VALID [2022-04-08 11:33:16,636 INFO L290 TraceCheckUtils]: 126: Hoare triple {28249#true} assume true; {28249#true} is VALID [2022-04-08 11:33:16,636 INFO L290 TraceCheckUtils]: 125: Hoare triple {28249#true} assume !(0 == ~cond); {28249#true} is VALID [2022-04-08 11:33:16,636 INFO L290 TraceCheckUtils]: 124: Hoare triple {28249#true} ~cond := #in~cond; {28249#true} is VALID [2022-04-08 11:33:16,637 INFO L272 TraceCheckUtils]: 123: Hoare triple {28249#true} call __VERIFIER_assert((if ~r~0 >= 2 * ~y~0 * ~a~0 then 1 else 0)); {28249#true} is VALID [2022-04-08 11:33:16,637 INFO L290 TraceCheckUtils]: 122: Hoare triple {28249#true} assume !!(~r~0 >= 2 * ~b~0); {28249#true} is VALID [2022-04-08 11:33:16,637 INFO L284 TraceCheckUtils]: 121: Hoare quadruple {28249#true} {28249#true} #87#return; {28249#true} is VALID [2022-04-08 11:33:16,637 INFO L290 TraceCheckUtils]: 120: Hoare triple {28249#true} assume true; {28249#true} is VALID [2022-04-08 11:33:16,637 INFO L290 TraceCheckUtils]: 119: Hoare triple {28249#true} assume !(0 == ~cond); {28249#true} is VALID [2022-04-08 11:33:16,637 INFO L290 TraceCheckUtils]: 118: Hoare triple {28249#true} ~cond := #in~cond; {28249#true} is VALID [2022-04-08 11:33:16,637 INFO L272 TraceCheckUtils]: 117: Hoare triple {28249#true} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {28249#true} is VALID [2022-04-08 11:33:16,637 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {28249#true} {28249#true} #85#return; {28249#true} is VALID [2022-04-08 11:33:16,637 INFO L290 TraceCheckUtils]: 115: Hoare triple {28249#true} assume true; {28249#true} is VALID [2022-04-08 11:33:16,637 INFO L290 TraceCheckUtils]: 114: Hoare triple {28249#true} assume !(0 == ~cond); {28249#true} is VALID [2022-04-08 11:33:16,637 INFO L290 TraceCheckUtils]: 113: Hoare triple {28249#true} ~cond := #in~cond; {28249#true} is VALID [2022-04-08 11:33:16,637 INFO L272 TraceCheckUtils]: 112: Hoare triple {28249#true} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {28249#true} is VALID [2022-04-08 11:33:16,637 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {28249#true} {28249#true} #83#return; {28249#true} is VALID [2022-04-08 11:33:16,637 INFO L290 TraceCheckUtils]: 110: Hoare triple {28249#true} assume true; {28249#true} is VALID [2022-04-08 11:33:16,637 INFO L290 TraceCheckUtils]: 109: Hoare triple {28249#true} assume !(0 == ~cond); {28249#true} is VALID [2022-04-08 11:33:16,638 INFO L290 TraceCheckUtils]: 108: Hoare triple {28249#true} ~cond := #in~cond; {28249#true} is VALID [2022-04-08 11:33:16,638 INFO L272 TraceCheckUtils]: 107: Hoare triple {28249#true} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {28249#true} is VALID [2022-04-08 11:33:16,638 INFO L290 TraceCheckUtils]: 106: Hoare triple {28249#true} assume !!(#t~post7 < 100);havoc #t~post7; {28249#true} is VALID [2022-04-08 11:33:16,638 INFO L290 TraceCheckUtils]: 105: Hoare triple {28249#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {28249#true} is VALID [2022-04-08 11:33:16,638 INFO L290 TraceCheckUtils]: 104: Hoare triple {28249#true} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {28249#true} is VALID [2022-04-08 11:33:16,638 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {28249#true} {28249#true} #81#return; {28249#true} is VALID [2022-04-08 11:33:16,638 INFO L290 TraceCheckUtils]: 102: Hoare triple {28249#true} assume true; {28249#true} is VALID [2022-04-08 11:33:16,638 INFO L290 TraceCheckUtils]: 101: Hoare triple {28249#true} assume !(0 == ~cond); {28249#true} is VALID [2022-04-08 11:33:16,638 INFO L290 TraceCheckUtils]: 100: Hoare triple {28249#true} ~cond := #in~cond; {28249#true} is VALID [2022-04-08 11:33:16,638 INFO L272 TraceCheckUtils]: 99: Hoare triple {28249#true} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {28249#true} is VALID [2022-04-08 11:33:16,638 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {28249#true} {28249#true} #79#return; {28249#true} is VALID [2022-04-08 11:33:16,638 INFO L290 TraceCheckUtils]: 97: Hoare triple {28249#true} assume true; {28249#true} is VALID [2022-04-08 11:33:16,638 INFO L290 TraceCheckUtils]: 96: Hoare triple {28249#true} assume !(0 == ~cond); {28249#true} is VALID [2022-04-08 11:33:16,638 INFO L290 TraceCheckUtils]: 95: Hoare triple {28249#true} ~cond := #in~cond; {28249#true} is VALID [2022-04-08 11:33:16,638 INFO L272 TraceCheckUtils]: 94: Hoare triple {28249#true} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {28249#true} is VALID [2022-04-08 11:33:16,639 INFO L290 TraceCheckUtils]: 93: Hoare triple {28249#true} assume !!(#t~post6 < 100);havoc #t~post6; {28249#true} is VALID [2022-04-08 11:33:16,639 INFO L290 TraceCheckUtils]: 92: Hoare triple {28249#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {28249#true} is VALID [2022-04-08 11:33:16,639 INFO L290 TraceCheckUtils]: 91: Hoare triple {28249#true} ~r~0 := ~r~0 - ~b~0;~q~0 := ~q~0 + ~a~0; {28249#true} is VALID [2022-04-08 11:33:16,639 INFO L290 TraceCheckUtils]: 90: Hoare triple {28249#true} assume !(~r~0 >= 2 * ~b~0); {28249#true} is VALID [2022-04-08 11:33:16,639 INFO L284 TraceCheckUtils]: 89: Hoare quadruple {28249#true} {28249#true} #87#return; {28249#true} is VALID [2022-04-08 11:33:16,639 INFO L290 TraceCheckUtils]: 88: Hoare triple {28249#true} assume true; {28249#true} is VALID [2022-04-08 11:33:16,639 INFO L290 TraceCheckUtils]: 87: Hoare triple {28249#true} assume !(0 == ~cond); {28249#true} is VALID [2022-04-08 11:33:16,639 INFO L290 TraceCheckUtils]: 86: Hoare triple {28249#true} ~cond := #in~cond; {28249#true} is VALID [2022-04-08 11:33:16,639 INFO L272 TraceCheckUtils]: 85: Hoare triple {28249#true} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {28249#true} is VALID [2022-04-08 11:33:16,639 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {28249#true} {28249#true} #85#return; {28249#true} is VALID [2022-04-08 11:33:16,639 INFO L290 TraceCheckUtils]: 83: Hoare triple {28249#true} assume true; {28249#true} is VALID [2022-04-08 11:33:16,639 INFO L290 TraceCheckUtils]: 82: Hoare triple {28249#true} assume !(0 == ~cond); {28249#true} is VALID [2022-04-08 11:33:16,639 INFO L290 TraceCheckUtils]: 81: Hoare triple {28249#true} ~cond := #in~cond; {28249#true} is VALID [2022-04-08 11:33:16,639 INFO L272 TraceCheckUtils]: 80: Hoare triple {28249#true} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {28249#true} is VALID [2022-04-08 11:33:16,639 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {28249#true} {28249#true} #83#return; {28249#true} is VALID [2022-04-08 11:33:16,640 INFO L290 TraceCheckUtils]: 78: Hoare triple {28249#true} assume true; {28249#true} is VALID [2022-04-08 11:33:16,640 INFO L290 TraceCheckUtils]: 77: Hoare triple {28249#true} assume !(0 == ~cond); {28249#true} is VALID [2022-04-08 11:33:16,640 INFO L290 TraceCheckUtils]: 76: Hoare triple {28249#true} ~cond := #in~cond; {28249#true} is VALID [2022-04-08 11:33:16,640 INFO L272 TraceCheckUtils]: 75: Hoare triple {28249#true} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {28249#true} is VALID [2022-04-08 11:33:16,640 INFO L290 TraceCheckUtils]: 74: Hoare triple {28249#true} assume !!(#t~post7 < 100);havoc #t~post7; {28249#true} is VALID [2022-04-08 11:33:16,640 INFO L290 TraceCheckUtils]: 73: Hoare triple {28249#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {28249#true} is VALID [2022-04-08 11:33:16,640 INFO L290 TraceCheckUtils]: 72: Hoare triple {28249#true} ~a~0 := 2 * ~a~0;~b~0 := 2 * ~b~0; {28249#true} is VALID [2022-04-08 11:33:16,640 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {28249#true} {28249#true} #89#return; {28249#true} is VALID [2022-04-08 11:33:16,640 INFO L290 TraceCheckUtils]: 70: Hoare triple {28249#true} assume true; {28249#true} is VALID [2022-04-08 11:33:16,640 INFO L290 TraceCheckUtils]: 69: Hoare triple {28249#true} assume !(0 == ~cond); {28249#true} is VALID [2022-04-08 11:33:16,640 INFO L290 TraceCheckUtils]: 68: Hoare triple {28249#true} ~cond := #in~cond; {28249#true} is VALID [2022-04-08 11:33:16,640 INFO L272 TraceCheckUtils]: 67: Hoare triple {28249#true} call __VERIFIER_assert((if ~r~0 >= 2 * ~y~0 * ~a~0 then 1 else 0)); {28249#true} is VALID [2022-04-08 11:33:16,640 INFO L290 TraceCheckUtils]: 66: Hoare triple {28249#true} assume !!(~r~0 >= 2 * ~b~0); {28249#true} is VALID [2022-04-08 11:33:16,640 INFO L284 TraceCheckUtils]: 65: Hoare quadruple {28249#true} {28249#true} #87#return; {28249#true} is VALID [2022-04-08 11:33:16,640 INFO L290 TraceCheckUtils]: 64: Hoare triple {28249#true} assume true; {28249#true} is VALID [2022-04-08 11:33:16,641 INFO L290 TraceCheckUtils]: 63: Hoare triple {28249#true} assume !(0 == ~cond); {28249#true} is VALID [2022-04-08 11:33:16,641 INFO L290 TraceCheckUtils]: 62: Hoare triple {28249#true} ~cond := #in~cond; {28249#true} is VALID [2022-04-08 11:33:16,641 INFO L272 TraceCheckUtils]: 61: Hoare triple {28249#true} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {28249#true} is VALID [2022-04-08 11:33:16,641 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {28249#true} {28249#true} #85#return; {28249#true} is VALID [2022-04-08 11:33:16,641 INFO L290 TraceCheckUtils]: 59: Hoare triple {28249#true} assume true; {28249#true} is VALID [2022-04-08 11:33:16,641 INFO L290 TraceCheckUtils]: 58: Hoare triple {28249#true} assume !(0 == ~cond); {28249#true} is VALID [2022-04-08 11:33:16,641 INFO L290 TraceCheckUtils]: 57: Hoare triple {28249#true} ~cond := #in~cond; {28249#true} is VALID [2022-04-08 11:33:16,641 INFO L272 TraceCheckUtils]: 56: Hoare triple {28249#true} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {28249#true} is VALID [2022-04-08 11:33:16,641 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {28249#true} {28249#true} #83#return; {28249#true} is VALID [2022-04-08 11:33:16,641 INFO L290 TraceCheckUtils]: 54: Hoare triple {28249#true} assume true; {28249#true} is VALID [2022-04-08 11:33:16,641 INFO L290 TraceCheckUtils]: 53: Hoare triple {28249#true} assume !(0 == ~cond); {28249#true} is VALID [2022-04-08 11:33:16,641 INFO L290 TraceCheckUtils]: 52: Hoare triple {28249#true} ~cond := #in~cond; {28249#true} is VALID [2022-04-08 11:33:16,641 INFO L272 TraceCheckUtils]: 51: Hoare triple {28249#true} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {28249#true} is VALID [2022-04-08 11:33:16,641 INFO L290 TraceCheckUtils]: 50: Hoare triple {28249#true} assume !!(#t~post7 < 100);havoc #t~post7; {28249#true} is VALID [2022-04-08 11:33:16,641 INFO L290 TraceCheckUtils]: 49: Hoare triple {28249#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {28249#true} is VALID [2022-04-08 11:33:16,642 INFO L290 TraceCheckUtils]: 48: Hoare triple {28249#true} ~a~0 := 2 * ~a~0;~b~0 := 2 * ~b~0; {28249#true} is VALID [2022-04-08 11:33:16,642 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {28249#true} {28249#true} #89#return; {28249#true} is VALID [2022-04-08 11:33:16,642 INFO L290 TraceCheckUtils]: 46: Hoare triple {28249#true} assume true; {28249#true} is VALID [2022-04-08 11:33:16,642 INFO L290 TraceCheckUtils]: 45: Hoare triple {28249#true} assume !(0 == ~cond); {28249#true} is VALID [2022-04-08 11:33:16,642 INFO L290 TraceCheckUtils]: 44: Hoare triple {28249#true} ~cond := #in~cond; {28249#true} is VALID [2022-04-08 11:33:16,642 INFO L272 TraceCheckUtils]: 43: Hoare triple {28249#true} call __VERIFIER_assert((if ~r~0 >= 2 * ~y~0 * ~a~0 then 1 else 0)); {28249#true} is VALID [2022-04-08 11:33:16,642 INFO L290 TraceCheckUtils]: 42: Hoare triple {28249#true} assume !!(~r~0 >= 2 * ~b~0); {28249#true} is VALID [2022-04-08 11:33:16,642 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {28249#true} {28249#true} #87#return; {28249#true} is VALID [2022-04-08 11:33:16,642 INFO L290 TraceCheckUtils]: 40: Hoare triple {28249#true} assume true; {28249#true} is VALID [2022-04-08 11:33:16,642 INFO L290 TraceCheckUtils]: 39: Hoare triple {28249#true} assume !(0 == ~cond); {28249#true} is VALID [2022-04-08 11:33:16,642 INFO L290 TraceCheckUtils]: 38: Hoare triple {28249#true} ~cond := #in~cond; {28249#true} is VALID [2022-04-08 11:33:16,642 INFO L272 TraceCheckUtils]: 37: Hoare triple {28249#true} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {28249#true} is VALID [2022-04-08 11:33:16,642 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {28249#true} {28249#true} #85#return; {28249#true} is VALID [2022-04-08 11:33:16,642 INFO L290 TraceCheckUtils]: 35: Hoare triple {28249#true} assume true; {28249#true} is VALID [2022-04-08 11:33:16,643 INFO L290 TraceCheckUtils]: 34: Hoare triple {28249#true} assume !(0 == ~cond); {28249#true} is VALID [2022-04-08 11:33:16,643 INFO L290 TraceCheckUtils]: 33: Hoare triple {28249#true} ~cond := #in~cond; {28249#true} is VALID [2022-04-08 11:33:16,643 INFO L272 TraceCheckUtils]: 32: Hoare triple {28249#true} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {28249#true} is VALID [2022-04-08 11:33:16,643 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {28249#true} {28249#true} #83#return; {28249#true} is VALID [2022-04-08 11:33:16,643 INFO L290 TraceCheckUtils]: 30: Hoare triple {28249#true} assume true; {28249#true} is VALID [2022-04-08 11:33:16,643 INFO L290 TraceCheckUtils]: 29: Hoare triple {28249#true} assume !(0 == ~cond); {28249#true} is VALID [2022-04-08 11:33:16,643 INFO L290 TraceCheckUtils]: 28: Hoare triple {28249#true} ~cond := #in~cond; {28249#true} is VALID [2022-04-08 11:33:16,643 INFO L272 TraceCheckUtils]: 27: Hoare triple {28249#true} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {28249#true} is VALID [2022-04-08 11:33:16,643 INFO L290 TraceCheckUtils]: 26: Hoare triple {28249#true} assume !!(#t~post7 < 100);havoc #t~post7; {28249#true} is VALID [2022-04-08 11:33:16,643 INFO L290 TraceCheckUtils]: 25: Hoare triple {28249#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {28249#true} is VALID [2022-04-08 11:33:16,643 INFO L290 TraceCheckUtils]: 24: Hoare triple {28249#true} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {28249#true} is VALID [2022-04-08 11:33:16,651 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {28249#true} {28249#true} #81#return; {28249#true} is VALID [2022-04-08 11:33:16,651 INFO L290 TraceCheckUtils]: 22: Hoare triple {28249#true} assume true; {28249#true} is VALID [2022-04-08 11:33:16,651 INFO L290 TraceCheckUtils]: 21: Hoare triple {28249#true} assume !(0 == ~cond); {28249#true} is VALID [2022-04-08 11:33:16,651 INFO L290 TraceCheckUtils]: 20: Hoare triple {28249#true} ~cond := #in~cond; {28249#true} is VALID [2022-04-08 11:33:16,651 INFO L272 TraceCheckUtils]: 19: Hoare triple {28249#true} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {28249#true} is VALID [2022-04-08 11:33:16,651 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {28249#true} {28249#true} #79#return; {28249#true} is VALID [2022-04-08 11:33:16,651 INFO L290 TraceCheckUtils]: 17: Hoare triple {28249#true} assume true; {28249#true} is VALID [2022-04-08 11:33:16,652 INFO L290 TraceCheckUtils]: 16: Hoare triple {28249#true} assume !(0 == ~cond); {28249#true} is VALID [2022-04-08 11:33:16,652 INFO L290 TraceCheckUtils]: 15: Hoare triple {28249#true} ~cond := #in~cond; {28249#true} is VALID [2022-04-08 11:33:16,652 INFO L272 TraceCheckUtils]: 14: Hoare triple {28249#true} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {28249#true} is VALID [2022-04-08 11:33:16,652 INFO L290 TraceCheckUtils]: 13: Hoare triple {28249#true} assume !!(#t~post6 < 100);havoc #t~post6; {28249#true} is VALID [2022-04-08 11:33:16,652 INFO L290 TraceCheckUtils]: 12: Hoare triple {28249#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {28249#true} is VALID [2022-04-08 11:33:16,652 INFO L290 TraceCheckUtils]: 11: Hoare triple {28249#true} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {28249#true} is VALID [2022-04-08 11:33:16,652 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {28249#true} {28249#true} #77#return; {28249#true} is VALID [2022-04-08 11:33:16,652 INFO L290 TraceCheckUtils]: 9: Hoare triple {28249#true} assume true; {28249#true} is VALID [2022-04-08 11:33:16,652 INFO L290 TraceCheckUtils]: 8: Hoare triple {28249#true} assume !(0 == ~cond); {28249#true} is VALID [2022-04-08 11:33:16,652 INFO L290 TraceCheckUtils]: 7: Hoare triple {28249#true} ~cond := #in~cond; {28249#true} is VALID [2022-04-08 11:33:16,652 INFO L272 TraceCheckUtils]: 6: Hoare triple {28249#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {28249#true} is VALID [2022-04-08 11:33:16,652 INFO L290 TraceCheckUtils]: 5: Hoare triple {28249#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; {28249#true} is VALID [2022-04-08 11:33:16,652 INFO L272 TraceCheckUtils]: 4: Hoare triple {28249#true} call #t~ret8 := main(); {28249#true} is VALID [2022-04-08 11:33:16,652 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28249#true} {28249#true} #93#return; {28249#true} is VALID [2022-04-08 11:33:16,653 INFO L290 TraceCheckUtils]: 2: Hoare triple {28249#true} assume true; {28249#true} is VALID [2022-04-08 11:33:16,653 INFO L290 TraceCheckUtils]: 1: Hoare triple {28249#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; {28249#true} is VALID [2022-04-08 11:33:16,653 INFO L272 TraceCheckUtils]: 0: Hoare triple {28249#true} call ULTIMATE.init(); {28249#true} is VALID [2022-04-08 11:33:16,653 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-08 11:33:16,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:33:16,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370049141] [2022-04-08 11:33:16,653 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:33:16,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1276610572] [2022-04-08 11:33:16,654 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1276610572] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 11:33:16,654 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 11:33:16,654 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 8] total 20 [2022-04-08 11:33:16,654 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:33:16,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1558762448] [2022-04-08 11:33:16,654 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1558762448] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:33:16,654 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:33:16,654 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-08 11:33:16,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330928913] [2022-04-08 11:33:16,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:33:16,655 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-08 11:33:16,655 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:33:16,655 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-08 11:33:16,787 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-08 11:33:16,787 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-08 11:33:16,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:33:16,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-08 11:33:16,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2022-04-08 11:33:16,788 INFO L87 Difference]: Start difference. First operand 344 states and 395 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-08 11:33:31,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:33:31,355 INFO L93 Difference]: Finished difference Result 378 states and 441 transitions. [2022-04-08 11:33:31,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-08 11:33:31,359 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-08 11:33:31,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:33:31,360 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-08 11:33:31,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 178 transitions. [2022-04-08 11:33:31,362 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-08 11:33:31,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 178 transitions. [2022-04-08 11:33:31,364 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 178 transitions. [2022-04-08 11:33:31,676 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-08 11:33:31,684 INFO L225 Difference]: With dead ends: 378 [2022-04-08 11:33:31,684 INFO L226 Difference]: Without dead ends: 375 [2022-04-08 11:33:31,684 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 320 GetRequests, 297 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=90, Invalid=416, Unknown=0, NotChecked=0, Total=506 [2022-04-08 11:33:31,684 INFO L913 BasicCegarLoop]: 72 mSDtfsCounter, 49 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 1338 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 525 SdHoareTripleChecker+Invalid, 1380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 1338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2022-04-08 11:33:31,685 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [67 Valid, 525 Invalid, 1380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 1338 Invalid, 0 Unknown, 0 Unchecked, 5.9s Time] [2022-04-08 11:33:31,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2022-04-08 11:33:32,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 345. [2022-04-08 11:33:32,205 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:33:32,205 INFO L82 GeneralOperation]: Start isEquivalent. First operand 375 states. Second operand has 345 states, 223 states have (on average 1.094170403587444) internal successors, (244), 228 states have internal predecessors, (244), 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-08 11:33:32,206 INFO L74 IsIncluded]: Start isIncluded. First operand 375 states. Second operand has 345 states, 223 states have (on average 1.094170403587444) internal successors, (244), 228 states have internal predecessors, (244), 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-08 11:33:32,206 INFO L87 Difference]: Start difference. First operand 375 states. Second operand has 345 states, 223 states have (on average 1.094170403587444) internal successors, (244), 228 states have internal predecessors, (244), 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-08 11:33:32,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:33:32,214 INFO L93 Difference]: Finished difference Result 375 states and 437 transitions. [2022-04-08 11:33:32,214 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 437 transitions. [2022-04-08 11:33:32,214 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:33:32,215 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:33:32,215 INFO L74 IsIncluded]: Start isIncluded. First operand has 345 states, 223 states have (on average 1.094170403587444) internal successors, (244), 228 states have internal predecessors, (244), 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 375 states. [2022-04-08 11:33:32,216 INFO L87 Difference]: Start difference. First operand has 345 states, 223 states have (on average 1.094170403587444) internal successors, (244), 228 states have internal predecessors, (244), 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 375 states. [2022-04-08 11:33:32,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:33:32,223 INFO L93 Difference]: Finished difference Result 375 states and 437 transitions. [2022-04-08 11:33:32,223 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 437 transitions. [2022-04-08 11:33:32,223 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:33:32,223 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:33:32,223 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:33:32,223 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:33:32,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 223 states have (on average 1.094170403587444) internal successors, (244), 228 states have internal predecessors, (244), 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-08 11:33:32,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 395 transitions. [2022-04-08 11:33:32,230 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 395 transitions. Word has length 159 [2022-04-08 11:33:32,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:33:32,231 INFO L478 AbstractCegarLoop]: Abstraction has 345 states and 395 transitions. [2022-04-08 11:33:32,231 INFO L479 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-08 11:33:32,231 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 345 states and 395 transitions. [2022-04-08 11:33:32,916 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 395 edges. 395 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:33:32,916 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 395 transitions. [2022-04-08 11:33:32,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2022-04-08 11:33:32,918 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:33:32,918 INFO L499 BasicCegarLoop]: 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-08 11:33:32,935 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-08 11:33:33,131 WARN L460 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-08 11:33:33,131 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:33:33,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:33:33,132 INFO L85 PathProgramCache]: Analyzing trace with hash -107439859, now seen corresponding path program 5 times [2022-04-08 11:33:33,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:33:33,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1744333709] [2022-04-08 11:34:12,531 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 11:34:12,531 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 11:34:12,532 INFO L85 PathProgramCache]: Analyzing trace with hash -107439859, now seen corresponding path program 6 times [2022-04-08 11:34:12,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:34:12,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560663640] [2022-04-08 11:34:12,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:34:12,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:34:12,544 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:34:12,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1438937921] [2022-04-08 11:34:12,544 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 11:34:12,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:34:12,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:34:12,545 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-08 11:34:12,546 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-08 11:34:12,633 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-08 11:34:12,633 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:34:12,634 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 34 conjunts are in the unsatisfiable core [2022-04-08 11:34:12,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:34:12,689 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:34:13,372 INFO L272 TraceCheckUtils]: 0: Hoare triple {31424#true} call ULTIMATE.init(); {31424#true} is VALID [2022-04-08 11:34:13,372 INFO L290 TraceCheckUtils]: 1: Hoare triple {31424#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; {31424#true} is VALID [2022-04-08 11:34:13,372 INFO L290 TraceCheckUtils]: 2: Hoare triple {31424#true} assume true; {31424#true} is VALID [2022-04-08 11:34:13,372 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31424#true} {31424#true} #93#return; {31424#true} is VALID [2022-04-08 11:34:13,372 INFO L272 TraceCheckUtils]: 4: Hoare triple {31424#true} call #t~ret8 := main(); {31424#true} is VALID [2022-04-08 11:34:13,372 INFO L290 TraceCheckUtils]: 5: Hoare triple {31424#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; {31424#true} is VALID [2022-04-08 11:34:13,372 INFO L272 TraceCheckUtils]: 6: Hoare triple {31424#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {31424#true} is VALID [2022-04-08 11:34:13,372 INFO L290 TraceCheckUtils]: 7: Hoare triple {31424#true} ~cond := #in~cond; {31424#true} is VALID [2022-04-08 11:34:13,372 INFO L290 TraceCheckUtils]: 8: Hoare triple {31424#true} assume !(0 == ~cond); {31424#true} is VALID [2022-04-08 11:34:13,373 INFO L290 TraceCheckUtils]: 9: Hoare triple {31424#true} assume true; {31424#true} is VALID [2022-04-08 11:34:13,373 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {31424#true} {31424#true} #77#return; {31424#true} is VALID [2022-04-08 11:34:13,373 INFO L290 TraceCheckUtils]: 11: Hoare triple {31424#true} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {31462#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 11:34:13,373 INFO L290 TraceCheckUtils]: 12: Hoare triple {31462#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {31462#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 11:34:13,374 INFO L290 TraceCheckUtils]: 13: Hoare triple {31462#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} assume !!(#t~post6 < 100);havoc #t~post6; {31462#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 11:34:13,374 INFO L272 TraceCheckUtils]: 14: Hoare triple {31462#(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)); {31424#true} is VALID [2022-04-08 11:34:13,374 INFO L290 TraceCheckUtils]: 15: Hoare triple {31424#true} ~cond := #in~cond; {31424#true} is VALID [2022-04-08 11:34:13,374 INFO L290 TraceCheckUtils]: 16: Hoare triple {31424#true} assume !(0 == ~cond); {31424#true} is VALID [2022-04-08 11:34:13,374 INFO L290 TraceCheckUtils]: 17: Hoare triple {31424#true} assume true; {31424#true} is VALID [2022-04-08 11:34:13,374 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {31424#true} {31462#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #79#return; {31462#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 11:34:13,374 INFO L272 TraceCheckUtils]: 19: Hoare triple {31462#(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)); {31424#true} is VALID [2022-04-08 11:34:13,375 INFO L290 TraceCheckUtils]: 20: Hoare triple {31424#true} ~cond := #in~cond; {31424#true} is VALID [2022-04-08 11:34:13,375 INFO L290 TraceCheckUtils]: 21: Hoare triple {31424#true} assume !(0 == ~cond); {31424#true} is VALID [2022-04-08 11:34:13,375 INFO L290 TraceCheckUtils]: 22: Hoare triple {31424#true} assume true; {31424#true} is VALID [2022-04-08 11:34:13,375 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {31424#true} {31462#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #81#return; {31462#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 11:34:13,375 INFO L290 TraceCheckUtils]: 24: Hoare triple {31462#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {31462#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 11:34:13,376 INFO L290 TraceCheckUtils]: 25: Hoare triple {31462#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {31462#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 11:34:13,376 INFO L290 TraceCheckUtils]: 26: Hoare triple {31462#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} assume !!(#t~post7 < 100);havoc #t~post7; {31462#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 11:34:13,376 INFO L272 TraceCheckUtils]: 27: Hoare triple {31462#(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)); {31424#true} is VALID [2022-04-08 11:34:13,376 INFO L290 TraceCheckUtils]: 28: Hoare triple {31424#true} ~cond := #in~cond; {31424#true} is VALID [2022-04-08 11:34:13,376 INFO L290 TraceCheckUtils]: 29: Hoare triple {31424#true} assume !(0 == ~cond); {31424#true} is VALID [2022-04-08 11:34:13,376 INFO L290 TraceCheckUtils]: 30: Hoare triple {31424#true} assume true; {31424#true} is VALID [2022-04-08 11:34:13,377 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {31424#true} {31462#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #83#return; {31462#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 11:34:13,377 INFO L272 TraceCheckUtils]: 32: Hoare triple {31462#(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)); {31424#true} is VALID [2022-04-08 11:34:13,377 INFO L290 TraceCheckUtils]: 33: Hoare triple {31424#true} ~cond := #in~cond; {31424#true} is VALID [2022-04-08 11:34:13,377 INFO L290 TraceCheckUtils]: 34: Hoare triple {31424#true} assume !(0 == ~cond); {31424#true} is VALID [2022-04-08 11:34:13,377 INFO L290 TraceCheckUtils]: 35: Hoare triple {31424#true} assume true; {31424#true} is VALID [2022-04-08 11:34:13,377 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {31424#true} {31462#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #85#return; {31462#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 11:34:13,378 INFO L272 TraceCheckUtils]: 37: Hoare triple {31462#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {31424#true} is VALID [2022-04-08 11:34:13,378 INFO L290 TraceCheckUtils]: 38: Hoare triple {31424#true} ~cond := #in~cond; {31424#true} is VALID [2022-04-08 11:34:13,378 INFO L290 TraceCheckUtils]: 39: Hoare triple {31424#true} assume !(0 == ~cond); {31424#true} is VALID [2022-04-08 11:34:13,378 INFO L290 TraceCheckUtils]: 40: Hoare triple {31424#true} assume true; {31424#true} is VALID [2022-04-08 11:34:13,378 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {31424#true} {31462#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #87#return; {31462#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 11:34:13,379 INFO L290 TraceCheckUtils]: 42: Hoare triple {31462#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} assume !!(~r~0 >= 2 * ~b~0); {31462#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 11:34:13,379 INFO L272 TraceCheckUtils]: 43: Hoare triple {31462#(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)); {31424#true} is VALID [2022-04-08 11:34:13,379 INFO L290 TraceCheckUtils]: 44: Hoare triple {31424#true} ~cond := #in~cond; {31424#true} is VALID [2022-04-08 11:34:13,379 INFO L290 TraceCheckUtils]: 45: Hoare triple {31424#true} assume !(0 == ~cond); {31424#true} is VALID [2022-04-08 11:34:13,379 INFO L290 TraceCheckUtils]: 46: Hoare triple {31424#true} assume true; {31424#true} is VALID [2022-04-08 11:34:13,379 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {31424#true} {31462#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #89#return; {31462#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 11:34:13,380 INFO L290 TraceCheckUtils]: 48: Hoare triple {31462#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} ~a~0 := 2 * ~a~0;~b~0 := 2 * ~b~0; {31462#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 11:34:13,380 INFO L290 TraceCheckUtils]: 49: Hoare triple {31462#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {31462#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 11:34:13,380 INFO L290 TraceCheckUtils]: 50: Hoare triple {31462#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} assume !!(#t~post7 < 100);havoc #t~post7; {31462#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 11:34:13,380 INFO L272 TraceCheckUtils]: 51: Hoare triple {31462#(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)); {31424#true} is VALID [2022-04-08 11:34:13,380 INFO L290 TraceCheckUtils]: 52: Hoare triple {31424#true} ~cond := #in~cond; {31424#true} is VALID [2022-04-08 11:34:13,380 INFO L290 TraceCheckUtils]: 53: Hoare triple {31424#true} assume !(0 == ~cond); {31424#true} is VALID [2022-04-08 11:34:13,381 INFO L290 TraceCheckUtils]: 54: Hoare triple {31424#true} assume true; {31424#true} is VALID [2022-04-08 11:34:13,381 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {31424#true} {31462#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #83#return; {31462#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 11:34:13,381 INFO L272 TraceCheckUtils]: 56: Hoare triple {31462#(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)); {31424#true} is VALID [2022-04-08 11:34:13,381 INFO L290 TraceCheckUtils]: 57: Hoare triple {31424#true} ~cond := #in~cond; {31424#true} is VALID [2022-04-08 11:34:13,381 INFO L290 TraceCheckUtils]: 58: Hoare triple {31424#true} assume !(0 == ~cond); {31424#true} is VALID [2022-04-08 11:34:13,381 INFO L290 TraceCheckUtils]: 59: Hoare triple {31424#true} assume true; {31424#true} is VALID [2022-04-08 11:34:13,382 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {31424#true} {31462#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #85#return; {31462#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 11:34:13,382 INFO L272 TraceCheckUtils]: 61: Hoare triple {31462#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {31424#true} is VALID [2022-04-08 11:34:13,382 INFO L290 TraceCheckUtils]: 62: Hoare triple {31424#true} ~cond := #in~cond; {31424#true} is VALID [2022-04-08 11:34:13,382 INFO L290 TraceCheckUtils]: 63: Hoare triple {31424#true} assume !(0 == ~cond); {31424#true} is VALID [2022-04-08 11:34:13,382 INFO L290 TraceCheckUtils]: 64: Hoare triple {31424#true} assume true; {31424#true} is VALID [2022-04-08 11:34:13,382 INFO L284 TraceCheckUtils]: 65: Hoare quadruple {31424#true} {31462#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #87#return; {31462#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 11:34:13,383 INFO L290 TraceCheckUtils]: 66: Hoare triple {31462#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} assume !!(~r~0 >= 2 * ~b~0); {31462#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 11:34:13,383 INFO L272 TraceCheckUtils]: 67: Hoare triple {31462#(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)); {31424#true} is VALID [2022-04-08 11:34:13,383 INFO L290 TraceCheckUtils]: 68: Hoare triple {31424#true} ~cond := #in~cond; {31424#true} is VALID [2022-04-08 11:34:13,383 INFO L290 TraceCheckUtils]: 69: Hoare triple {31424#true} assume !(0 == ~cond); {31424#true} is VALID [2022-04-08 11:34:13,383 INFO L290 TraceCheckUtils]: 70: Hoare triple {31424#true} assume true; {31424#true} is VALID [2022-04-08 11:34:13,383 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {31424#true} {31462#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #89#return; {31462#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 11:34:13,384 INFO L290 TraceCheckUtils]: 72: Hoare triple {31462#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} ~a~0 := 2 * ~a~0;~b~0 := 2 * ~b~0; {31462#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 11:34:13,384 INFO L290 TraceCheckUtils]: 73: Hoare triple {31462#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {31462#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 11:34:13,384 INFO L290 TraceCheckUtils]: 74: Hoare triple {31462#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} assume !!(#t~post7 < 100);havoc #t~post7; {31462#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 11:34:13,384 INFO L272 TraceCheckUtils]: 75: Hoare triple {31462#(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)); {31424#true} is VALID [2022-04-08 11:34:13,385 INFO L290 TraceCheckUtils]: 76: Hoare triple {31424#true} ~cond := #in~cond; {31424#true} is VALID [2022-04-08 11:34:13,385 INFO L290 TraceCheckUtils]: 77: Hoare triple {31424#true} assume !(0 == ~cond); {31424#true} is VALID [2022-04-08 11:34:13,385 INFO L290 TraceCheckUtils]: 78: Hoare triple {31424#true} assume true; {31424#true} is VALID [2022-04-08 11:34:13,385 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {31424#true} {31462#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #83#return; {31462#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 11:34:13,385 INFO L272 TraceCheckUtils]: 80: Hoare triple {31462#(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)); {31424#true} is VALID [2022-04-08 11:34:13,385 INFO L290 TraceCheckUtils]: 81: Hoare triple {31424#true} ~cond := #in~cond; {31424#true} is VALID [2022-04-08 11:34:13,385 INFO L290 TraceCheckUtils]: 82: Hoare triple {31424#true} assume !(0 == ~cond); {31424#true} is VALID [2022-04-08 11:34:13,385 INFO L290 TraceCheckUtils]: 83: Hoare triple {31424#true} assume true; {31424#true} is VALID [2022-04-08 11:34:13,386 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {31424#true} {31462#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #85#return; {31462#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 11:34:13,386 INFO L272 TraceCheckUtils]: 85: Hoare triple {31462#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {31424#true} is VALID [2022-04-08 11:34:13,386 INFO L290 TraceCheckUtils]: 86: Hoare triple {31424#true} ~cond := #in~cond; {31424#true} is VALID [2022-04-08 11:34:13,386 INFO L290 TraceCheckUtils]: 87: Hoare triple {31424#true} assume !(0 == ~cond); {31424#true} is VALID [2022-04-08 11:34:13,386 INFO L290 TraceCheckUtils]: 88: Hoare triple {31424#true} assume true; {31424#true} is VALID [2022-04-08 11:34:13,387 INFO L284 TraceCheckUtils]: 89: Hoare quadruple {31424#true} {31462#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #87#return; {31462#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 11:34:13,387 INFO L290 TraceCheckUtils]: 90: Hoare triple {31462#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} assume !!(~r~0 >= 2 * ~b~0); {31462#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 11:34:13,387 INFO L272 TraceCheckUtils]: 91: Hoare triple {31462#(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)); {31424#true} is VALID [2022-04-08 11:34:13,387 INFO L290 TraceCheckUtils]: 92: Hoare triple {31424#true} ~cond := #in~cond; {31424#true} is VALID [2022-04-08 11:34:13,387 INFO L290 TraceCheckUtils]: 93: Hoare triple {31424#true} assume !(0 == ~cond); {31424#true} is VALID [2022-04-08 11:34:13,387 INFO L290 TraceCheckUtils]: 94: Hoare triple {31424#true} assume true; {31424#true} is VALID [2022-04-08 11:34:13,388 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {31424#true} {31462#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #89#return; {31462#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 11:34:13,388 INFO L290 TraceCheckUtils]: 96: Hoare triple {31462#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} ~a~0 := 2 * ~a~0;~b~0 := 2 * ~b~0; {31462#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 11:34:13,388 INFO L290 TraceCheckUtils]: 97: Hoare triple {31462#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {31462#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 11:34:13,389 INFO L290 TraceCheckUtils]: 98: Hoare triple {31462#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} assume !!(#t~post7 < 100);havoc #t~post7; {31462#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 11:34:13,389 INFO L272 TraceCheckUtils]: 99: Hoare triple {31462#(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)); {31424#true} is VALID [2022-04-08 11:34:13,389 INFO L290 TraceCheckUtils]: 100: Hoare triple {31424#true} ~cond := #in~cond; {31424#true} is VALID [2022-04-08 11:34:13,389 INFO L290 TraceCheckUtils]: 101: Hoare triple {31424#true} assume !(0 == ~cond); {31424#true} is VALID [2022-04-08 11:34:13,389 INFO L290 TraceCheckUtils]: 102: Hoare triple {31424#true} assume true; {31424#true} is VALID [2022-04-08 11:34:13,389 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {31424#true} {31462#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #83#return; {31462#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 11:34:13,389 INFO L272 TraceCheckUtils]: 104: Hoare triple {31462#(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)); {31424#true} is VALID [2022-04-08 11:34:13,389 INFO L290 TraceCheckUtils]: 105: Hoare triple {31424#true} ~cond := #in~cond; {31424#true} is VALID [2022-04-08 11:34:13,390 INFO L290 TraceCheckUtils]: 106: Hoare triple {31424#true} assume !(0 == ~cond); {31424#true} is VALID [2022-04-08 11:34:13,390 INFO L290 TraceCheckUtils]: 107: Hoare triple {31424#true} assume true; {31424#true} is VALID [2022-04-08 11:34:13,390 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {31424#true} {31462#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #85#return; {31462#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 11:34:13,390 INFO L272 TraceCheckUtils]: 109: Hoare triple {31462#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {31424#true} is VALID [2022-04-08 11:34:13,390 INFO L290 TraceCheckUtils]: 110: Hoare triple {31424#true} ~cond := #in~cond; {31424#true} is VALID [2022-04-08 11:34:13,390 INFO L290 TraceCheckUtils]: 111: Hoare triple {31424#true} assume !(0 == ~cond); {31424#true} is VALID [2022-04-08 11:34:13,390 INFO L290 TraceCheckUtils]: 112: Hoare triple {31424#true} assume true; {31424#true} is VALID [2022-04-08 11:34:13,391 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {31424#true} {31462#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #87#return; {31462#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 11:34:13,391 INFO L290 TraceCheckUtils]: 114: Hoare triple {31462#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} assume !(~r~0 >= 2 * ~b~0); {31462#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 11:34:13,392 INFO L290 TraceCheckUtils]: 115: Hoare triple {31462#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} ~r~0 := ~r~0 - ~b~0;~q~0 := ~q~0 + ~a~0; {31775#(and (= main_~x~0 (+ main_~b~0 main_~r~0)) (= main_~a~0 main_~q~0))} is VALID [2022-04-08 11:34:13,392 INFO L290 TraceCheckUtils]: 116: Hoare triple {31775#(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; {31775#(and (= main_~x~0 (+ main_~b~0 main_~r~0)) (= main_~a~0 main_~q~0))} is VALID [2022-04-08 11:34:13,393 INFO L290 TraceCheckUtils]: 117: Hoare triple {31775#(and (= main_~x~0 (+ main_~b~0 main_~r~0)) (= main_~a~0 main_~q~0))} assume !!(#t~post6 < 100);havoc #t~post6; {31775#(and (= main_~x~0 (+ main_~b~0 main_~r~0)) (= main_~a~0 main_~q~0))} is VALID [2022-04-08 11:34:13,393 INFO L272 TraceCheckUtils]: 118: Hoare triple {31775#(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)); {31424#true} is VALID [2022-04-08 11:34:13,393 INFO L290 TraceCheckUtils]: 119: Hoare triple {31424#true} ~cond := #in~cond; {31788#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:34:13,393 INFO L290 TraceCheckUtils]: 120: Hoare triple {31788#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {31792#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:34:13,394 INFO L290 TraceCheckUtils]: 121: Hoare triple {31792#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {31792#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:34:13,395 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {31792#(not (= |__VERIFIER_assert_#in~cond| 0))} {31775#(and (= main_~x~0 (+ main_~b~0 main_~r~0)) (= main_~a~0 main_~q~0))} #79#return; {31799#(= (+ main_~x~0 (* (- 1) main_~r~0)) (* main_~q~0 main_~y~0))} is VALID [2022-04-08 11:34:13,395 INFO L272 TraceCheckUtils]: 123: Hoare triple {31799#(= (+ 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)); {31424#true} is VALID [2022-04-08 11:34:13,395 INFO L290 TraceCheckUtils]: 124: Hoare triple {31424#true} ~cond := #in~cond; {31424#true} is VALID [2022-04-08 11:34:13,395 INFO L290 TraceCheckUtils]: 125: Hoare triple {31424#true} assume !(0 == ~cond); {31424#true} is VALID [2022-04-08 11:34:13,395 INFO L290 TraceCheckUtils]: 126: Hoare triple {31424#true} assume true; {31424#true} is VALID [2022-04-08 11:34:13,395 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {31424#true} {31799#(= (+ main_~x~0 (* (- 1) main_~r~0)) (* main_~q~0 main_~y~0))} #81#return; {31799#(= (+ main_~x~0 (* (- 1) main_~r~0)) (* main_~q~0 main_~y~0))} is VALID [2022-04-08 11:34:13,396 INFO L290 TraceCheckUtils]: 128: Hoare triple {31799#(= (+ 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; {31799#(= (+ main_~x~0 (* (- 1) main_~r~0)) (* main_~q~0 main_~y~0))} is VALID [2022-04-08 11:34:13,396 INFO L290 TraceCheckUtils]: 129: Hoare triple {31799#(= (+ main_~x~0 (* (- 1) main_~r~0)) (* main_~q~0 main_~y~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {31799#(= (+ main_~x~0 (* (- 1) main_~r~0)) (* main_~q~0 main_~y~0))} is VALID [2022-04-08 11:34:13,396 INFO L290 TraceCheckUtils]: 130: Hoare triple {31799#(= (+ main_~x~0 (* (- 1) main_~r~0)) (* main_~q~0 main_~y~0))} assume !!(#t~post7 < 100);havoc #t~post7; {31799#(= (+ main_~x~0 (* (- 1) main_~r~0)) (* main_~q~0 main_~y~0))} is VALID [2022-04-08 11:34:13,396 INFO L272 TraceCheckUtils]: 131: Hoare triple {31799#(= (+ 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)); {31424#true} is VALID [2022-04-08 11:34:13,396 INFO L290 TraceCheckUtils]: 132: Hoare triple {31424#true} ~cond := #in~cond; {31424#true} is VALID [2022-04-08 11:34:13,397 INFO L290 TraceCheckUtils]: 133: Hoare triple {31424#true} assume !(0 == ~cond); {31424#true} is VALID [2022-04-08 11:34:13,397 INFO L290 TraceCheckUtils]: 134: Hoare triple {31424#true} assume true; {31424#true} is VALID [2022-04-08 11:34:13,397 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {31424#true} {31799#(= (+ main_~x~0 (* (- 1) main_~r~0)) (* main_~q~0 main_~y~0))} #83#return; {31799#(= (+ main_~x~0 (* (- 1) main_~r~0)) (* main_~q~0 main_~y~0))} is VALID [2022-04-08 11:34:13,397 INFO L272 TraceCheckUtils]: 136: Hoare triple {31799#(= (+ 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)); {31424#true} is VALID [2022-04-08 11:34:13,397 INFO L290 TraceCheckUtils]: 137: Hoare triple {31424#true} ~cond := #in~cond; {31788#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:34:13,398 INFO L290 TraceCheckUtils]: 138: Hoare triple {31788#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {31792#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:34:13,398 INFO L290 TraceCheckUtils]: 139: Hoare triple {31792#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {31792#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:34:13,398 INFO L284 TraceCheckUtils]: 140: Hoare quadruple {31792#(not (= |__VERIFIER_assert_#in~cond| 0))} {31799#(= (+ main_~x~0 (* (- 1) main_~r~0)) (* main_~q~0 main_~y~0))} #85#return; {31799#(= (+ main_~x~0 (* (- 1) main_~r~0)) (* main_~q~0 main_~y~0))} is VALID [2022-04-08 11:34:13,398 INFO L272 TraceCheckUtils]: 141: Hoare triple {31799#(= (+ main_~x~0 (* (- 1) main_~r~0)) (* main_~q~0 main_~y~0))} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {31424#true} is VALID [2022-04-08 11:34:13,399 INFO L290 TraceCheckUtils]: 142: Hoare triple {31424#true} ~cond := #in~cond; {31424#true} is VALID [2022-04-08 11:34:13,399 INFO L290 TraceCheckUtils]: 143: Hoare triple {31424#true} assume !(0 == ~cond); {31424#true} is VALID [2022-04-08 11:34:13,399 INFO L290 TraceCheckUtils]: 144: Hoare triple {31424#true} assume true; {31424#true} is VALID [2022-04-08 11:34:13,399 INFO L284 TraceCheckUtils]: 145: Hoare quadruple {31424#true} {31799#(= (+ main_~x~0 (* (- 1) main_~r~0)) (* main_~q~0 main_~y~0))} #87#return; {31799#(= (+ main_~x~0 (* (- 1) main_~r~0)) (* main_~q~0 main_~y~0))} is VALID [2022-04-08 11:34:13,399 INFO L290 TraceCheckUtils]: 146: Hoare triple {31799#(= (+ main_~x~0 (* (- 1) main_~r~0)) (* main_~q~0 main_~y~0))} assume !(~r~0 >= 2 * ~b~0); {31799#(= (+ main_~x~0 (* (- 1) main_~r~0)) (* main_~q~0 main_~y~0))} is VALID [2022-04-08 11:34:13,406 INFO L290 TraceCheckUtils]: 147: Hoare triple {31799#(= (+ 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; {31875#(= (+ 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-08 11:34:13,406 INFO L290 TraceCheckUtils]: 148: Hoare triple {31875#(= (+ 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; {31875#(= (+ 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-08 11:34:13,407 INFO L290 TraceCheckUtils]: 149: Hoare triple {31875#(= (+ main_~x~0 (* (- 1) main_~b~0) (* (- 1) main_~r~0)) (* (+ (* (- 1) main_~a~0) main_~q~0) main_~y~0))} assume !!(#t~post6 < 100);havoc #t~post6; {31875#(= (+ 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-08 11:34:13,407 INFO L272 TraceCheckUtils]: 150: Hoare triple {31875#(= (+ 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)); {31424#true} is VALID [2022-04-08 11:34:13,407 INFO L290 TraceCheckUtils]: 151: Hoare triple {31424#true} ~cond := #in~cond; {31788#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:34:13,407 INFO L290 TraceCheckUtils]: 152: Hoare triple {31788#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {31792#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:34:13,408 INFO L290 TraceCheckUtils]: 153: Hoare triple {31792#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {31792#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:34:13,409 INFO L284 TraceCheckUtils]: 154: Hoare quadruple {31792#(not (= |__VERIFIER_assert_#in~cond| 0))} {31875#(= (+ main_~x~0 (* (- 1) main_~b~0) (* (- 1) main_~r~0)) (* (+ (* (- 1) main_~a~0) main_~q~0) main_~y~0))} #79#return; {31799#(= (+ main_~x~0 (* (- 1) main_~r~0)) (* main_~q~0 main_~y~0))} is VALID [2022-04-08 11:34:13,410 INFO L272 TraceCheckUtils]: 155: Hoare triple {31799#(= (+ 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)); {31900#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 11:34:13,410 INFO L290 TraceCheckUtils]: 156: Hoare triple {31900#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {31904#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:34:13,410 INFO L290 TraceCheckUtils]: 157: Hoare triple {31904#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {31425#false} is VALID [2022-04-08 11:34:13,410 INFO L290 TraceCheckUtils]: 158: Hoare triple {31425#false} assume !false; {31425#false} is VALID [2022-04-08 11:34:13,411 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-08 11:34:13,411 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 11:34:30,482 INFO L290 TraceCheckUtils]: 158: Hoare triple {31425#false} assume !false; {31425#false} is VALID [2022-04-08 11:34:30,483 INFO L290 TraceCheckUtils]: 157: Hoare triple {31904#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {31425#false} is VALID [2022-04-08 11:34:30,483 INFO L290 TraceCheckUtils]: 156: Hoare triple {31900#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {31904#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:34:30,484 INFO L272 TraceCheckUtils]: 155: Hoare triple {31799#(= (+ 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)); {31900#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 11:34:30,484 INFO L284 TraceCheckUtils]: 154: Hoare quadruple {31792#(not (= |__VERIFIER_assert_#in~cond| 0))} {31923#(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; {31799#(= (+ main_~x~0 (* (- 1) main_~r~0)) (* main_~q~0 main_~y~0))} is VALID [2022-04-08 11:34:30,485 INFO L290 TraceCheckUtils]: 153: Hoare triple {31792#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {31792#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:34:30,485 INFO L290 TraceCheckUtils]: 152: Hoare triple {31933#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {31792#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:34:30,485 INFO L290 TraceCheckUtils]: 151: Hoare triple {31424#true} ~cond := #in~cond; {31933#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 11:34:30,485 INFO L272 TraceCheckUtils]: 150: Hoare triple {31923#(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)); {31424#true} is VALID [2022-04-08 11:34:30,486 INFO L290 TraceCheckUtils]: 149: Hoare triple {31923#(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 < 100);havoc #t~post6; {31923#(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-08 11:34:30,486 INFO L290 TraceCheckUtils]: 148: Hoare triple {31923#(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; {31923#(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-08 11:34:30,493 INFO L290 TraceCheckUtils]: 147: Hoare triple {31799#(= (+ 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; {31923#(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-08 11:34:30,493 INFO L290 TraceCheckUtils]: 146: Hoare triple {31799#(= (+ main_~x~0 (* (- 1) main_~r~0)) (* main_~q~0 main_~y~0))} assume !(~r~0 >= 2 * ~b~0); {31799#(= (+ main_~x~0 (* (- 1) main_~r~0)) (* main_~q~0 main_~y~0))} is VALID [2022-04-08 11:34:30,493 INFO L284 TraceCheckUtils]: 145: Hoare quadruple {31424#true} {31799#(= (+ main_~x~0 (* (- 1) main_~r~0)) (* main_~q~0 main_~y~0))} #87#return; {31799#(= (+ main_~x~0 (* (- 1) main_~r~0)) (* main_~q~0 main_~y~0))} is VALID [2022-04-08 11:34:30,494 INFO L290 TraceCheckUtils]: 144: Hoare triple {31424#true} assume true; {31424#true} is VALID [2022-04-08 11:34:30,494 INFO L290 TraceCheckUtils]: 143: Hoare triple {31424#true} assume !(0 == ~cond); {31424#true} is VALID [2022-04-08 11:34:30,494 INFO L290 TraceCheckUtils]: 142: Hoare triple {31424#true} ~cond := #in~cond; {31424#true} is VALID [2022-04-08 11:34:30,494 INFO L272 TraceCheckUtils]: 141: Hoare triple {31799#(= (+ main_~x~0 (* (- 1) main_~r~0)) (* main_~q~0 main_~y~0))} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {31424#true} is VALID [2022-04-08 11:34:30,494 INFO L284 TraceCheckUtils]: 140: Hoare quadruple {31792#(not (= |__VERIFIER_assert_#in~cond| 0))} {31424#true} #85#return; {31799#(= (+ main_~x~0 (* (- 1) main_~r~0)) (* main_~q~0 main_~y~0))} is VALID [2022-04-08 11:34:30,494 INFO L290 TraceCheckUtils]: 139: Hoare triple {31792#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {31792#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:34:30,495 INFO L290 TraceCheckUtils]: 138: Hoare triple {31933#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {31792#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:34:30,495 INFO L290 TraceCheckUtils]: 137: Hoare triple {31424#true} ~cond := #in~cond; {31933#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 11:34:30,495 INFO L272 TraceCheckUtils]: 136: Hoare triple {31424#true} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {31424#true} is VALID [2022-04-08 11:34:30,495 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {31424#true} {31424#true} #83#return; {31424#true} is VALID [2022-04-08 11:34:30,495 INFO L290 TraceCheckUtils]: 134: Hoare triple {31424#true} assume true; {31424#true} is VALID [2022-04-08 11:34:30,495 INFO L290 TraceCheckUtils]: 133: Hoare triple {31424#true} assume !(0 == ~cond); {31424#true} is VALID [2022-04-08 11:34:30,495 INFO L290 TraceCheckUtils]: 132: Hoare triple {31424#true} ~cond := #in~cond; {31424#true} is VALID [2022-04-08 11:34:30,496 INFO L272 TraceCheckUtils]: 131: Hoare triple {31424#true} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {31424#true} is VALID [2022-04-08 11:34:30,496 INFO L290 TraceCheckUtils]: 130: Hoare triple {31424#true} assume !!(#t~post7 < 100);havoc #t~post7; {31424#true} is VALID [2022-04-08 11:34:30,496 INFO L290 TraceCheckUtils]: 129: Hoare triple {31424#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {31424#true} is VALID [2022-04-08 11:34:30,496 INFO L290 TraceCheckUtils]: 128: Hoare triple {31424#true} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {31424#true} is VALID [2022-04-08 11:34:30,496 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {31424#true} {31424#true} #81#return; {31424#true} is VALID [2022-04-08 11:34:30,496 INFO L290 TraceCheckUtils]: 126: Hoare triple {31424#true} assume true; {31424#true} is VALID [2022-04-08 11:34:30,496 INFO L290 TraceCheckUtils]: 125: Hoare triple {31424#true} assume !(0 == ~cond); {31424#true} is VALID [2022-04-08 11:34:30,496 INFO L290 TraceCheckUtils]: 124: Hoare triple {31424#true} ~cond := #in~cond; {31424#true} is VALID [2022-04-08 11:34:30,496 INFO L272 TraceCheckUtils]: 123: Hoare triple {31424#true} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {31424#true} is VALID [2022-04-08 11:34:30,496 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {31424#true} {31424#true} #79#return; {31424#true} is VALID [2022-04-08 11:34:30,496 INFO L290 TraceCheckUtils]: 121: Hoare triple {31424#true} assume true; {31424#true} is VALID [2022-04-08 11:34:30,496 INFO L290 TraceCheckUtils]: 120: Hoare triple {31424#true} assume !(0 == ~cond); {31424#true} is VALID [2022-04-08 11:34:30,496 INFO L290 TraceCheckUtils]: 119: Hoare triple {31424#true} ~cond := #in~cond; {31424#true} is VALID [2022-04-08 11:34:30,496 INFO L272 TraceCheckUtils]: 118: Hoare triple {31424#true} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {31424#true} is VALID [2022-04-08 11:34:30,496 INFO L290 TraceCheckUtils]: 117: Hoare triple {31424#true} assume !!(#t~post6 < 100);havoc #t~post6; {31424#true} is VALID [2022-04-08 11:34:30,497 INFO L290 TraceCheckUtils]: 116: Hoare triple {31424#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {31424#true} is VALID [2022-04-08 11:34:30,497 INFO L290 TraceCheckUtils]: 115: Hoare triple {31424#true} ~r~0 := ~r~0 - ~b~0;~q~0 := ~q~0 + ~a~0; {31424#true} is VALID [2022-04-08 11:34:30,497 INFO L290 TraceCheckUtils]: 114: Hoare triple {31424#true} assume !(~r~0 >= 2 * ~b~0); {31424#true} is VALID [2022-04-08 11:34:30,497 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {31424#true} {31424#true} #87#return; {31424#true} is VALID [2022-04-08 11:34:30,497 INFO L290 TraceCheckUtils]: 112: Hoare triple {31424#true} assume true; {31424#true} is VALID [2022-04-08 11:34:30,497 INFO L290 TraceCheckUtils]: 111: Hoare triple {31424#true} assume !(0 == ~cond); {31424#true} is VALID [2022-04-08 11:34:30,497 INFO L290 TraceCheckUtils]: 110: Hoare triple {31424#true} ~cond := #in~cond; {31424#true} is VALID [2022-04-08 11:34:30,497 INFO L272 TraceCheckUtils]: 109: Hoare triple {31424#true} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {31424#true} is VALID [2022-04-08 11:34:30,497 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {31424#true} {31424#true} #85#return; {31424#true} is VALID [2022-04-08 11:34:30,497 INFO L290 TraceCheckUtils]: 107: Hoare triple {31424#true} assume true; {31424#true} is VALID [2022-04-08 11:34:30,497 INFO L290 TraceCheckUtils]: 106: Hoare triple {31424#true} assume !(0 == ~cond); {31424#true} is VALID [2022-04-08 11:34:30,497 INFO L290 TraceCheckUtils]: 105: Hoare triple {31424#true} ~cond := #in~cond; {31424#true} is VALID [2022-04-08 11:34:30,497 INFO L272 TraceCheckUtils]: 104: Hoare triple {31424#true} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {31424#true} is VALID [2022-04-08 11:34:30,497 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {31424#true} {31424#true} #83#return; {31424#true} is VALID [2022-04-08 11:34:30,497 INFO L290 TraceCheckUtils]: 102: Hoare triple {31424#true} assume true; {31424#true} is VALID [2022-04-08 11:34:30,498 INFO L290 TraceCheckUtils]: 101: Hoare triple {31424#true} assume !(0 == ~cond); {31424#true} is VALID [2022-04-08 11:34:30,498 INFO L290 TraceCheckUtils]: 100: Hoare triple {31424#true} ~cond := #in~cond; {31424#true} is VALID [2022-04-08 11:34:30,498 INFO L272 TraceCheckUtils]: 99: Hoare triple {31424#true} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {31424#true} is VALID [2022-04-08 11:34:30,498 INFO L290 TraceCheckUtils]: 98: Hoare triple {31424#true} assume !!(#t~post7 < 100);havoc #t~post7; {31424#true} is VALID [2022-04-08 11:34:30,498 INFO L290 TraceCheckUtils]: 97: Hoare triple {31424#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {31424#true} is VALID [2022-04-08 11:34:30,498 INFO L290 TraceCheckUtils]: 96: Hoare triple {31424#true} ~a~0 := 2 * ~a~0;~b~0 := 2 * ~b~0; {31424#true} is VALID [2022-04-08 11:34:30,498 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {31424#true} {31424#true} #89#return; {31424#true} is VALID [2022-04-08 11:34:30,498 INFO L290 TraceCheckUtils]: 94: Hoare triple {31424#true} assume true; {31424#true} is VALID [2022-04-08 11:34:30,498 INFO L290 TraceCheckUtils]: 93: Hoare triple {31424#true} assume !(0 == ~cond); {31424#true} is VALID [2022-04-08 11:34:30,498 INFO L290 TraceCheckUtils]: 92: Hoare triple {31424#true} ~cond := #in~cond; {31424#true} is VALID [2022-04-08 11:34:30,498 INFO L272 TraceCheckUtils]: 91: Hoare triple {31424#true} call __VERIFIER_assert((if ~r~0 >= 2 * ~y~0 * ~a~0 then 1 else 0)); {31424#true} is VALID [2022-04-08 11:34:30,498 INFO L290 TraceCheckUtils]: 90: Hoare triple {31424#true} assume !!(~r~0 >= 2 * ~b~0); {31424#true} is VALID [2022-04-08 11:34:30,498 INFO L284 TraceCheckUtils]: 89: Hoare quadruple {31424#true} {31424#true} #87#return; {31424#true} is VALID [2022-04-08 11:34:30,498 INFO L290 TraceCheckUtils]: 88: Hoare triple {31424#true} assume true; {31424#true} is VALID [2022-04-08 11:34:30,498 INFO L290 TraceCheckUtils]: 87: Hoare triple {31424#true} assume !(0 == ~cond); {31424#true} is VALID [2022-04-08 11:34:30,498 INFO L290 TraceCheckUtils]: 86: Hoare triple {31424#true} ~cond := #in~cond; {31424#true} is VALID [2022-04-08 11:34:30,499 INFO L272 TraceCheckUtils]: 85: Hoare triple {31424#true} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {31424#true} is VALID [2022-04-08 11:34:30,499 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {31424#true} {31424#true} #85#return; {31424#true} is VALID [2022-04-08 11:34:30,499 INFO L290 TraceCheckUtils]: 83: Hoare triple {31424#true} assume true; {31424#true} is VALID [2022-04-08 11:34:30,499 INFO L290 TraceCheckUtils]: 82: Hoare triple {31424#true} assume !(0 == ~cond); {31424#true} is VALID [2022-04-08 11:34:30,499 INFO L290 TraceCheckUtils]: 81: Hoare triple {31424#true} ~cond := #in~cond; {31424#true} is VALID [2022-04-08 11:34:30,499 INFO L272 TraceCheckUtils]: 80: Hoare triple {31424#true} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {31424#true} is VALID [2022-04-08 11:34:30,499 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {31424#true} {31424#true} #83#return; {31424#true} is VALID [2022-04-08 11:34:30,499 INFO L290 TraceCheckUtils]: 78: Hoare triple {31424#true} assume true; {31424#true} is VALID [2022-04-08 11:34:30,499 INFO L290 TraceCheckUtils]: 77: Hoare triple {31424#true} assume !(0 == ~cond); {31424#true} is VALID [2022-04-08 11:34:30,499 INFO L290 TraceCheckUtils]: 76: Hoare triple {31424#true} ~cond := #in~cond; {31424#true} is VALID [2022-04-08 11:34:30,499 INFO L272 TraceCheckUtils]: 75: Hoare triple {31424#true} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {31424#true} is VALID [2022-04-08 11:34:30,499 INFO L290 TraceCheckUtils]: 74: Hoare triple {31424#true} assume !!(#t~post7 < 100);havoc #t~post7; {31424#true} is VALID [2022-04-08 11:34:30,499 INFO L290 TraceCheckUtils]: 73: Hoare triple {31424#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {31424#true} is VALID [2022-04-08 11:34:30,499 INFO L290 TraceCheckUtils]: 72: Hoare triple {31424#true} ~a~0 := 2 * ~a~0;~b~0 := 2 * ~b~0; {31424#true} is VALID [2022-04-08 11:34:30,499 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {31424#true} {31424#true} #89#return; {31424#true} is VALID [2022-04-08 11:34:30,500 INFO L290 TraceCheckUtils]: 70: Hoare triple {31424#true} assume true; {31424#true} is VALID [2022-04-08 11:34:30,500 INFO L290 TraceCheckUtils]: 69: Hoare triple {31424#true} assume !(0 == ~cond); {31424#true} is VALID [2022-04-08 11:34:30,500 INFO L290 TraceCheckUtils]: 68: Hoare triple {31424#true} ~cond := #in~cond; {31424#true} is VALID [2022-04-08 11:34:30,500 INFO L272 TraceCheckUtils]: 67: Hoare triple {31424#true} call __VERIFIER_assert((if ~r~0 >= 2 * ~y~0 * ~a~0 then 1 else 0)); {31424#true} is VALID [2022-04-08 11:34:30,500 INFO L290 TraceCheckUtils]: 66: Hoare triple {31424#true} assume !!(~r~0 >= 2 * ~b~0); {31424#true} is VALID [2022-04-08 11:34:30,500 INFO L284 TraceCheckUtils]: 65: Hoare quadruple {31424#true} {31424#true} #87#return; {31424#true} is VALID [2022-04-08 11:34:30,500 INFO L290 TraceCheckUtils]: 64: Hoare triple {31424#true} assume true; {31424#true} is VALID [2022-04-08 11:34:30,500 INFO L290 TraceCheckUtils]: 63: Hoare triple {31424#true} assume !(0 == ~cond); {31424#true} is VALID [2022-04-08 11:34:30,500 INFO L290 TraceCheckUtils]: 62: Hoare triple {31424#true} ~cond := #in~cond; {31424#true} is VALID [2022-04-08 11:34:30,500 INFO L272 TraceCheckUtils]: 61: Hoare triple {31424#true} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {31424#true} is VALID [2022-04-08 11:34:30,500 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {31424#true} {31424#true} #85#return; {31424#true} is VALID [2022-04-08 11:34:30,500 INFO L290 TraceCheckUtils]: 59: Hoare triple {31424#true} assume true; {31424#true} is VALID [2022-04-08 11:34:30,500 INFO L290 TraceCheckUtils]: 58: Hoare triple {31424#true} assume !(0 == ~cond); {31424#true} is VALID [2022-04-08 11:34:30,500 INFO L290 TraceCheckUtils]: 57: Hoare triple {31424#true} ~cond := #in~cond; {31424#true} is VALID [2022-04-08 11:34:30,500 INFO L272 TraceCheckUtils]: 56: Hoare triple {31424#true} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {31424#true} is VALID [2022-04-08 11:34:30,501 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {31424#true} {31424#true} #83#return; {31424#true} is VALID [2022-04-08 11:34:30,501 INFO L290 TraceCheckUtils]: 54: Hoare triple {31424#true} assume true; {31424#true} is VALID [2022-04-08 11:34:30,501 INFO L290 TraceCheckUtils]: 53: Hoare triple {31424#true} assume !(0 == ~cond); {31424#true} is VALID [2022-04-08 11:34:30,501 INFO L290 TraceCheckUtils]: 52: Hoare triple {31424#true} ~cond := #in~cond; {31424#true} is VALID [2022-04-08 11:34:30,501 INFO L272 TraceCheckUtils]: 51: Hoare triple {31424#true} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {31424#true} is VALID [2022-04-08 11:34:30,501 INFO L290 TraceCheckUtils]: 50: Hoare triple {31424#true} assume !!(#t~post7 < 100);havoc #t~post7; {31424#true} is VALID [2022-04-08 11:34:30,501 INFO L290 TraceCheckUtils]: 49: Hoare triple {31424#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {31424#true} is VALID [2022-04-08 11:34:30,501 INFO L290 TraceCheckUtils]: 48: Hoare triple {31424#true} ~a~0 := 2 * ~a~0;~b~0 := 2 * ~b~0; {31424#true} is VALID [2022-04-08 11:34:30,501 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {31424#true} {31424#true} #89#return; {31424#true} is VALID [2022-04-08 11:34:30,501 INFO L290 TraceCheckUtils]: 46: Hoare triple {31424#true} assume true; {31424#true} is VALID [2022-04-08 11:34:30,501 INFO L290 TraceCheckUtils]: 45: Hoare triple {31424#true} assume !(0 == ~cond); {31424#true} is VALID [2022-04-08 11:34:30,501 INFO L290 TraceCheckUtils]: 44: Hoare triple {31424#true} ~cond := #in~cond; {31424#true} is VALID [2022-04-08 11:34:30,501 INFO L272 TraceCheckUtils]: 43: Hoare triple {31424#true} call __VERIFIER_assert((if ~r~0 >= 2 * ~y~0 * ~a~0 then 1 else 0)); {31424#true} is VALID [2022-04-08 11:34:30,501 INFO L290 TraceCheckUtils]: 42: Hoare triple {31424#true} assume !!(~r~0 >= 2 * ~b~0); {31424#true} is VALID [2022-04-08 11:34:30,501 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {31424#true} {31424#true} #87#return; {31424#true} is VALID [2022-04-08 11:34:30,502 INFO L290 TraceCheckUtils]: 40: Hoare triple {31424#true} assume true; {31424#true} is VALID [2022-04-08 11:34:30,502 INFO L290 TraceCheckUtils]: 39: Hoare triple {31424#true} assume !(0 == ~cond); {31424#true} is VALID [2022-04-08 11:34:30,502 INFO L290 TraceCheckUtils]: 38: Hoare triple {31424#true} ~cond := #in~cond; {31424#true} is VALID [2022-04-08 11:34:30,502 INFO L272 TraceCheckUtils]: 37: Hoare triple {31424#true} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {31424#true} is VALID [2022-04-08 11:34:30,502 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {31424#true} {31424#true} #85#return; {31424#true} is VALID [2022-04-08 11:34:30,502 INFO L290 TraceCheckUtils]: 35: Hoare triple {31424#true} assume true; {31424#true} is VALID [2022-04-08 11:34:30,502 INFO L290 TraceCheckUtils]: 34: Hoare triple {31424#true} assume !(0 == ~cond); {31424#true} is VALID [2022-04-08 11:34:30,502 INFO L290 TraceCheckUtils]: 33: Hoare triple {31424#true} ~cond := #in~cond; {31424#true} is VALID [2022-04-08 11:34:30,502 INFO L272 TraceCheckUtils]: 32: Hoare triple {31424#true} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {31424#true} is VALID [2022-04-08 11:34:30,502 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {31424#true} {31424#true} #83#return; {31424#true} is VALID [2022-04-08 11:34:30,502 INFO L290 TraceCheckUtils]: 30: Hoare triple {31424#true} assume true; {31424#true} is VALID [2022-04-08 11:34:30,502 INFO L290 TraceCheckUtils]: 29: Hoare triple {31424#true} assume !(0 == ~cond); {31424#true} is VALID [2022-04-08 11:34:30,502 INFO L290 TraceCheckUtils]: 28: Hoare triple {31424#true} ~cond := #in~cond; {31424#true} is VALID [2022-04-08 11:34:30,502 INFO L272 TraceCheckUtils]: 27: Hoare triple {31424#true} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {31424#true} is VALID [2022-04-08 11:34:30,502 INFO L290 TraceCheckUtils]: 26: Hoare triple {31424#true} assume !!(#t~post7 < 100);havoc #t~post7; {31424#true} is VALID [2022-04-08 11:34:30,503 INFO L290 TraceCheckUtils]: 25: Hoare triple {31424#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {31424#true} is VALID [2022-04-08 11:34:30,503 INFO L290 TraceCheckUtils]: 24: Hoare triple {31424#true} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {31424#true} is VALID [2022-04-08 11:34:30,503 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {31424#true} {31424#true} #81#return; {31424#true} is VALID [2022-04-08 11:34:30,503 INFO L290 TraceCheckUtils]: 22: Hoare triple {31424#true} assume true; {31424#true} is VALID [2022-04-08 11:34:30,503 INFO L290 TraceCheckUtils]: 21: Hoare triple {31424#true} assume !(0 == ~cond); {31424#true} is VALID [2022-04-08 11:34:30,503 INFO L290 TraceCheckUtils]: 20: Hoare triple {31424#true} ~cond := #in~cond; {31424#true} is VALID [2022-04-08 11:34:30,503 INFO L272 TraceCheckUtils]: 19: Hoare triple {31424#true} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {31424#true} is VALID [2022-04-08 11:34:30,503 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {31424#true} {31424#true} #79#return; {31424#true} is VALID [2022-04-08 11:34:30,503 INFO L290 TraceCheckUtils]: 17: Hoare triple {31424#true} assume true; {31424#true} is VALID [2022-04-08 11:34:30,503 INFO L290 TraceCheckUtils]: 16: Hoare triple {31424#true} assume !(0 == ~cond); {31424#true} is VALID [2022-04-08 11:34:30,503 INFO L290 TraceCheckUtils]: 15: Hoare triple {31424#true} ~cond := #in~cond; {31424#true} is VALID [2022-04-08 11:34:30,503 INFO L272 TraceCheckUtils]: 14: Hoare triple {31424#true} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {31424#true} is VALID [2022-04-08 11:34:30,503 INFO L290 TraceCheckUtils]: 13: Hoare triple {31424#true} assume !!(#t~post6 < 100);havoc #t~post6; {31424#true} is VALID [2022-04-08 11:34:30,503 INFO L290 TraceCheckUtils]: 12: Hoare triple {31424#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {31424#true} is VALID [2022-04-08 11:34:30,504 INFO L290 TraceCheckUtils]: 11: Hoare triple {31424#true} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {31424#true} is VALID [2022-04-08 11:34:30,504 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {31424#true} {31424#true} #77#return; {31424#true} is VALID [2022-04-08 11:34:30,504 INFO L290 TraceCheckUtils]: 9: Hoare triple {31424#true} assume true; {31424#true} is VALID [2022-04-08 11:34:30,504 INFO L290 TraceCheckUtils]: 8: Hoare triple {31424#true} assume !(0 == ~cond); {31424#true} is VALID [2022-04-08 11:34:30,504 INFO L290 TraceCheckUtils]: 7: Hoare triple {31424#true} ~cond := #in~cond; {31424#true} is VALID [2022-04-08 11:34:30,504 INFO L272 TraceCheckUtils]: 6: Hoare triple {31424#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {31424#true} is VALID [2022-04-08 11:34:30,504 INFO L290 TraceCheckUtils]: 5: Hoare triple {31424#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; {31424#true} is VALID [2022-04-08 11:34:30,504 INFO L272 TraceCheckUtils]: 4: Hoare triple {31424#true} call #t~ret8 := main(); {31424#true} is VALID [2022-04-08 11:34:30,504 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31424#true} {31424#true} #93#return; {31424#true} is VALID [2022-04-08 11:34:30,504 INFO L290 TraceCheckUtils]: 2: Hoare triple {31424#true} assume true; {31424#true} is VALID [2022-04-08 11:34:30,504 INFO L290 TraceCheckUtils]: 1: Hoare triple {31424#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; {31424#true} is VALID [2022-04-08 11:34:30,504 INFO L272 TraceCheckUtils]: 0: Hoare triple {31424#true} call ULTIMATE.init(); {31424#true} is VALID [2022-04-08 11:34:30,505 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-08 11:34:30,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:34:30,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560663640] [2022-04-08 11:34:30,505 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:34:30,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1438937921] [2022-04-08 11:34:30,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1438937921] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 11:34:30,505 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 11:34:30,505 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 12 [2022-04-08 11:34:30,505 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:34:30,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1744333709] [2022-04-08 11:34:30,506 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1744333709] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:34:30,506 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:34:30,506 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-08 11:34:30,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944831235] [2022-04-08 11:34:30,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:34:30,506 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-08 11:34:30,506 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:34:30,507 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-08 11:34:30,575 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-08 11:34:30,575 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-08 11:34:30,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:34:30,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-08 11:34:30,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-04-08 11:34:30,575 INFO L87 Difference]: Start difference. First operand 345 states and 395 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-08 11:34:32,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:34:32,362 INFO L93 Difference]: Finished difference Result 363 states and 412 transitions. [2022-04-08 11:34:32,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-08 11:34:32,362 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-08 11:34:32,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:34:32,363 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-08 11:34:32,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 73 transitions. [2022-04-08 11:34:32,363 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-08 11:34:32,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 73 transitions. [2022-04-08 11:34:32,364 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 73 transitions. [2022-04-08 11:34:32,447 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-08 11:34:32,447 INFO L225 Difference]: With dead ends: 363 [2022-04-08 11:34:32,448 INFO L226 Difference]: Without dead ends: 0 [2022-04-08 11:34:32,448 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 302 SyntacticMatches, 5 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=233, Unknown=0, NotChecked=0, Total=306 [2022-04-08 11:34:32,449 INFO L913 BasicCegarLoop]: 26 mSDtfsCounter, 32 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-08 11:34:32,449 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 125 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-08 11:34:32,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-08 11:34:32,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-08 11:34:32,449 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:34:32,449 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-08 11:34:32,449 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-08 11:34:32,450 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-08 11:34:32,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:34:32,450 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-08 11:34:32,450 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 11:34:32,450 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:34:32,450 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:34:32,450 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-08 11:34:32,450 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-08 11:34:32,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:34:32,450 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-08 11:34:32,450 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 11:34:32,450 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:34:32,450 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:34:32,450 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:34:32,450 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:34:32,450 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-08 11:34:32,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-08 11:34:32,451 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 159 [2022-04-08 11:34:32,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:34:32,451 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-08 11:34:32,451 INFO L479 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-08 11:34:32,451 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-08 11:34:32,451 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-08 11:34:32,451 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 11:34:32,451 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:34:32,453 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-08 11:34:32,469 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-08 11:34:32,669 WARN L460 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-08 11:34:32,671 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-08 11:34:46,387 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 8) no Hoare annotation was computed. [2022-04-08 11:34:46,387 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 8) no Hoare annotation was computed. [2022-04-08 11:34:46,388 INFO L882 garLoopResultBuilder]: For program point reach_errorFINAL(line 8) no Hoare annotation was computed. [2022-04-08 11:34:46,388 INFO L885 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 11 13) the Hoare annotation is: true [2022-04-08 11:34:46,388 INFO L878 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-08 11:34:46,388 INFO L878 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-08 11:34:46,388 INFO L878 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-08 11:34:46,388 INFO L878 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-08 11:34:46,388 INFO L885 garLoopResultBuilder]: At program point mainEXIT(lines 23 65) the Hoare annotation is: true [2022-04-08 11:34:46,388 INFO L878 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-08 11:34:46,388 INFO L878 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-08 11:34:46,388 INFO L878 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-08 11:34:46,388 INFO L878 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-08 11:34:46,388 INFO L885 garLoopResultBuilder]: At program point mainFINAL(lines 23 65) the Hoare annotation is: true [2022-04-08 11:34:46,388 INFO L878 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-08 11:34:46,389 INFO L878 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-08 11:34:46,389 INFO L878 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-08 11:34:46,389 INFO L878 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-08 11:34:46,389 INFO L885 garLoopResultBuilder]: At program point L63(line 63) the Hoare annotation is: true [2022-04-08 11:34:46,389 INFO L878 garLoopResultBuilder]: At program point L30(line 30) the Hoare annotation is: (or (= ~counter~0 |old(~counter~0)|) (not (<= |old(~counter~0)| 0))) [2022-04-08 11:34:46,389 INFO L878 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-08 11:34:46,389 INFO L878 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-08 11:34:46,389 INFO L878 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-08 11:34:46,389 INFO L878 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-08 11:34:46,389 INFO L878 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-08 11:34:46,389 INFO L878 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-08 11:34:46,389 INFO L878 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-08 11:34:46,389 INFO L878 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-08 11:34:46,389 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: (<= ~counter~0 0) [2022-04-08 11:34:46,389 INFO L878 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-08 11:34:46,389 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: (<= ~counter~0 0) [2022-04-08 11:34:46,390 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-08 11:34:46,390 INFO L878 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: (<= ~counter~0 0) [2022-04-08 11:34:46,390 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-08 11:34:46,390 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-08 11:34:46,390 INFO L878 garLoopResultBuilder]: At program point L16(lines 16 17) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-08 11:34:46,390 INFO L878 garLoopResultBuilder]: At program point L15(lines 15 18) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| 0)) [2022-04-08 11:34:46,390 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 14 20) the Hoare annotation is: true [2022-04-08 11:34:46,390 INFO L878 garLoopResultBuilder]: At program point L15-2(lines 14 20) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| 0)) [2022-04-08 11:34:46,390 INFO L878 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 14 20) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| 0)) [2022-04-08 11:34:46,390 INFO L878 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 17) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-08 11:34:46,392 INFO L719 BasicCegarLoop]: Path program histogram: [8, 8, 6, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2] [2022-04-08 11:34:46,393 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-08 11:34:46,395 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-08 11:34:46,405 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-08 11:34:46,438 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-08 11:34:46,446 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.04 11:34:46 BoogieIcfgContainer [2022-04-08 11:34:46,447 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-08 11:34:46,449 INFO L158 Benchmark]: Toolchain (without parser) took 855994.93ms. Allocated memory was 205.5MB in the beginning and 312.5MB in the end (delta: 107.0MB). Free memory was 151.5MB in the beginning and 155.1MB in the end (delta: -3.6MB). Peak memory consumption was 166.7MB. Max. memory is 8.0GB. [2022-04-08 11:34:46,449 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 205.5MB. Free memory was 167.5MB in the beginning and 167.5MB in the end (delta: 75.7kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-08 11:34:46,449 INFO L158 Benchmark]: CACSL2BoogieTranslator took 221.63ms. Allocated memory is still 205.5MB. Free memory was 151.3MB in the beginning and 175.3MB in the end (delta: -24.0MB). Peak memory consumption was 12.5MB. Max. memory is 8.0GB. [2022-04-08 11:34:46,449 INFO L158 Benchmark]: Boogie Preprocessor took 27.46ms. Allocated memory is still 205.5MB. Free memory was 175.3MB in the beginning and 173.8MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-08 11:34:46,449 INFO L158 Benchmark]: RCFGBuilder took 279.19ms. Allocated memory is still 205.5MB. Free memory was 173.8MB in the beginning and 161.2MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-08 11:34:46,450 INFO L158 Benchmark]: TraceAbstraction took 855461.37ms. Allocated memory was 205.5MB in the beginning and 312.5MB in the end (delta: 107.0MB). Free memory was 160.7MB in the beginning and 155.1MB in the end (delta: 5.6MB). Peak memory consumption was 176.1MB. Max. memory is 8.0GB. [2022-04-08 11:34:46,450 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 205.5MB. Free memory was 167.5MB in the beginning and 167.5MB in the end (delta: 75.7kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 221.63ms. Allocated memory is still 205.5MB. Free memory was 151.3MB in the beginning and 175.3MB in the end (delta: -24.0MB). Peak memory consumption was 12.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 27.46ms. Allocated memory is still 205.5MB. Free memory was 175.3MB in the beginning and 173.8MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 279.19ms. Allocated memory is still 205.5MB. Free memory was 173.8MB in the beginning and 161.2MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 855461.37ms. Allocated memory was 205.5MB in the beginning and 312.5MB in the end (delta: 107.0MB). Free memory was 160.7MB in the beginning and 155.1MB in the end (delta: 5.6MB). Peak memory consumption was 176.1MB. 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: 855.3s, OverallIterations: 24, TraceHistogramMax: 24, PathProgramHistogramMax: 8, EmptinessCheckTime: 0.1s, AutomataDifference: 46.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 13.7s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 736 SdHoareTripleChecker+Valid, 14.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 621 mSDsluCounter, 4559 SdHoareTripleChecker+Invalid, 14.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 16 IncrementalHoareTripleChecker+Unchecked, 3384 mSDsCounter, 501 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4874 IncrementalHoareTripleChecker+Invalid, 5391 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 501 mSolverCounterUnsat, 1175 mSDtfsCounter, 4874 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3345 GetRequests, 3058 SyntacticMatches, 20 SemanticMatches, 267 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 792 ImplicationChecksByTransitivity, 6.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=345occurred in iteration=23, InterpolantAutomatonStates: 216, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 4.5s AutomataMinimizationTime, 24 MinimizatonAttempts, 131 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 38 LocationsWithAnnotation, 1334 PreInvPairs, 1823 NumberOfFragments, 604 HoareAnnotationTreeSize, 1334 FomulaSimplifications, 8461 FormulaSimplificationTreeSizeReduction, 3.1s HoareSimplificationTime, 38 FomulaSimplificationsInter, 205190 FormulaSimplificationTreeSizeReductionInter, 10.3s 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 || \old(cond) == 0 RESULT: Ultimate proved your program to be correct! [2022-04-08 11:34:46,663 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-08 11:34:46,693 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 137 Received shutdown request...