/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/cohendiv-ll_unwindbound20.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 11:21:34,967 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 11:21:34,969 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 11:21:35,017 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 11:21:35,017 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 11:21:35,018 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 11:21:35,019 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 11:21:35,021 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 11:21:35,022 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 11:21:35,026 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 11:21:35,027 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 11:21:35,029 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 11:21:35,030 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 11:21:35,034 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 11:21:35,035 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 11:21:35,038 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 11:21:35,039 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 11:21:35,041 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 11:21:35,043 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 11:21:35,048 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 11:21:35,050 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 11:21:35,052 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 11:21:35,053 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 11:21:35,053 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 11:21:35,054 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 11:21:35,057 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 11:21:35,057 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 11:21:35,058 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 11:21:35,058 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 11:21:35,059 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 11:21:35,060 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 11:21:35,060 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 11:21:35,062 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 11:21:35,062 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 11:21:35,063 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 11:21:35,063 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 11:21:35,063 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 11:21:35,064 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 11:21:35,064 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 11:21:35,064 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 11:21:35,065 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 11:21:35,066 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 11:21:35,067 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:21:35,077 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 11:21:35,077 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 11:21:35,078 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 11:21:35,078 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 11:21:35,079 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 11:21:35,079 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 11:21:35,079 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 11:21:35,079 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 11:21:35,079 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 11:21:35,080 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 11:21:35,080 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 11:21:35,080 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 11:21:35,080 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 11:21:35,080 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 11:21:35,080 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 11:21:35,080 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 11:21:35,081 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 11:21:35,081 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 11:21:35,081 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 11:21:35,081 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 11:21:35,081 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 11:21:35,081 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-08 11:21:35,081 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:21:35,322 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 11:21:35,345 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 11:21:35,347 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 11:21:35,348 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 11:21:35,349 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 11:21:35,350 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/cohendiv-ll_unwindbound20.c [2022-04-08 11:21:35,405 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03b639e72/057f24c22b254507a31d34fc7af5ff22/FLAGaf3cf9ccd [2022-04-08 11:21:35,795 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 11:21:35,796 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/cohendiv-ll_unwindbound20.c [2022-04-08 11:21:35,802 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03b639e72/057f24c22b254507a31d34fc7af5ff22/FLAGaf3cf9ccd [2022-04-08 11:21:36,203 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03b639e72/057f24c22b254507a31d34fc7af5ff22 [2022-04-08 11:21:36,206 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 11:21:36,207 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 11:21:36,210 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 11:21:36,210 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 11:21:36,213 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 11:21:36,214 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 11:21:36" (1/1) ... [2022-04-08 11:21:36,215 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44087fb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 11:21:36, skipping insertion in model container [2022-04-08 11:21:36,215 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 11:21:36" (1/1) ... [2022-04-08 11:21:36,222 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 11:21:36,234 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 11:21:36,369 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/cohendiv-ll_unwindbound20.c[576,589] [2022-04-08 11:21:36,398 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 11:21:36,405 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 11:21:36,424 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/cohendiv-ll_unwindbound20.c[576,589] [2022-04-08 11:21:36,432 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 11:21:36,443 INFO L208 MainTranslator]: Completed translation [2022-04-08 11:21:36,443 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 11:21:36 WrapperNode [2022-04-08 11:21:36,444 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 11:21:36,445 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 11:21:36,445 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 11:21:36,445 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 11:21:36,453 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 11:21:36" (1/1) ... [2022-04-08 11:21:36,454 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 11:21:36" (1/1) ... [2022-04-08 11:21:36,460 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 11:21:36" (1/1) ... [2022-04-08 11:21:36,460 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 11:21:36" (1/1) ... [2022-04-08 11:21:36,465 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 11:21:36" (1/1) ... [2022-04-08 11:21:36,469 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 11:21:36" (1/1) ... [2022-04-08 11:21:36,470 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 11:21:36" (1/1) ... [2022-04-08 11:21:36,471 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 11:21:36,472 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 11:21:36,472 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 11:21:36,472 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 11:21:36,473 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 11:21:36" (1/1) ... [2022-04-08 11:21:36,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 11:21:36,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:21:36,500 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:21:36,509 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:21:36,530 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 11:21:36,531 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 11:21:36,531 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 11:21:36,531 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-08 11:21:36,531 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 11:21:36,531 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 11:21:36,531 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 11:21:36,532 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 11:21:36,532 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 11:21:36,532 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 11:21:36,532 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-08 11:21:36,532 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-08 11:21:36,532 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 11:21:36,532 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 11:21:36,532 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 11:21:36,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 11:21:36,533 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 11:21:36,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 11:21:36,533 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 11:21:36,533 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 11:21:36,587 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 11:21:36,589 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 11:21:36,800 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 11:21:36,806 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 11:21:36,806 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-08 11:21:36,807 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 11:21:36 BoogieIcfgContainer [2022-04-08 11:21:36,807 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 11:21:36,809 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 11:21:36,809 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 11:21:36,832 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 11:21:36,832 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 11:21:36" (1/3) ... [2022-04-08 11:21:36,833 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62c5e6ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 11:21:36, skipping insertion in model container [2022-04-08 11:21:36,838 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 11:21:36" (2/3) ... [2022-04-08 11:21:36,838 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62c5e6ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 11:21:36, skipping insertion in model container [2022-04-08 11:21:36,839 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 11:21:36" (3/3) ... [2022-04-08 11:21:36,848 INFO L111 eAbstractionObserver]: Analyzing ICFG cohendiv-ll_unwindbound20.c [2022-04-08 11:21:36,852 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 11:21:36,852 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 11:21:36,895 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 11:21:36,908 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:21:36,908 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 11:21:36,929 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:21:36,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-08 11:21:36,936 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:21:36,936 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:21:36,937 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:21:36,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:21:36,942 INFO L85 PathProgramCache]: Analyzing trace with hash -1588022502, now seen corresponding path program 1 times [2022-04-08 11:21:36,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:21:36,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [666023920] [2022-04-08 11:21:36,962 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 11:21:36,962 INFO L85 PathProgramCache]: Analyzing trace with hash -1588022502, now seen corresponding path program 2 times [2022-04-08 11:21:36,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:21:36,966 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086478922] [2022-04-08 11:21:36,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:21:36,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:21:37,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:21:37,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 11:21:37,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:21:37,195 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:21:37,195 INFO L290 TraceCheckUtils]: 1: Hoare triple {41#true} assume true; {41#true} is VALID [2022-04-08 11:21:37,195 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {41#true} {41#true} #93#return; {41#true} is VALID [2022-04-08 11:21:37,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-08 11:21:37,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:21:37,213 INFO L290 TraceCheckUtils]: 0: Hoare triple {41#true} ~cond := #in~cond; {41#true} is VALID [2022-04-08 11:21:37,213 INFO L290 TraceCheckUtils]: 1: Hoare triple {41#true} assume 0 == ~cond;assume false; {42#false} is VALID [2022-04-08 11:21:37,214 INFO L290 TraceCheckUtils]: 2: Hoare triple {42#false} assume true; {42#false} is VALID [2022-04-08 11:21:37,214 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42#false} {41#true} #77#return; {42#false} is VALID [2022-04-08 11:21:37,217 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:21:37,217 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:21:37,218 INFO L290 TraceCheckUtils]: 2: Hoare triple {41#true} assume true; {41#true} is VALID [2022-04-08 11:21:37,218 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41#true} {41#true} #93#return; {41#true} is VALID [2022-04-08 11:21:37,218 INFO L272 TraceCheckUtils]: 4: Hoare triple {41#true} call #t~ret8 := main(); {41#true} is VALID [2022-04-08 11:21:37,219 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:21:37,219 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:21:37,220 INFO L290 TraceCheckUtils]: 7: Hoare triple {41#true} ~cond := #in~cond; {41#true} is VALID [2022-04-08 11:21:37,220 INFO L290 TraceCheckUtils]: 8: Hoare triple {41#true} assume 0 == ~cond;assume false; {42#false} is VALID [2022-04-08 11:21:37,221 INFO L290 TraceCheckUtils]: 9: Hoare triple {42#false} assume true; {42#false} is VALID [2022-04-08 11:21:37,221 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {42#false} {41#true} #77#return; {42#false} is VALID [2022-04-08 11:21:37,222 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:21:37,222 INFO L290 TraceCheckUtils]: 12: Hoare triple {42#false} assume !true; {42#false} is VALID [2022-04-08 11:21:37,222 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:21:37,223 INFO L290 TraceCheckUtils]: 14: Hoare triple {42#false} ~cond := #in~cond; {42#false} is VALID [2022-04-08 11:21:37,224 INFO L290 TraceCheckUtils]: 15: Hoare triple {42#false} assume 0 == ~cond; {42#false} is VALID [2022-04-08 11:21:37,224 INFO L290 TraceCheckUtils]: 16: Hoare triple {42#false} assume !false; {42#false} is VALID [2022-04-08 11:21:37,225 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:21:37,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:21:37,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086478922] [2022-04-08 11:21:37,226 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086478922] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:21:37,226 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:21:37,226 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 11:21:37,231 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:21:37,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [666023920] [2022-04-08 11:21:37,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [666023920] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:21:37,232 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:21:37,232 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 11:21:37,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837408000] [2022-04-08 11:21:37,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:21:37,238 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:21:37,239 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:21:37,242 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:21:37,275 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:21:37,276 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-08 11:21:37,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:21:37,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-08 11:21:37,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 11:21:37,303 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:21:37,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:21:37,545 INFO L93 Difference]: Finished difference Result 68 states and 101 transitions. [2022-04-08 11:21:37,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-08 11:21:37,546 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:21:37,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:21:37,548 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:21:37,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 101 transitions. [2022-04-08 11:21:37,555 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:21:37,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 101 transitions. [2022-04-08 11:21:37,560 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 101 transitions. [2022-04-08 11:21:37,661 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:21:37,670 INFO L225 Difference]: With dead ends: 68 [2022-04-08 11:21:37,671 INFO L226 Difference]: Without dead ends: 34 [2022-04-08 11:21:37,673 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:21:37,676 INFO L913 BasicCegarLoop]: 45 mSDtfsCounter, 10 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2022-04-08 11:21:37,677 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.1s Time] [2022-04-08 11:21:37,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-08 11:21:37,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2022-04-08 11:21:37,703 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:21:37,703 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:21:37,704 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:21:37,704 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:21:37,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:21:37,708 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2022-04-08 11:21:37,709 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2022-04-08 11:21:37,709 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:21:37,709 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:21:37,710 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:21:37,710 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:21:37,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:21:37,714 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2022-04-08 11:21:37,714 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2022-04-08 11:21:37,714 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:21:37,715 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:21:37,715 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:21:37,715 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:21:37,715 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:21:37,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 42 transitions. [2022-04-08 11:21:37,719 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 42 transitions. Word has length 17 [2022-04-08 11:21:37,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:21:37,719 INFO L478 AbstractCegarLoop]: Abstraction has 33 states and 42 transitions. [2022-04-08 11:21:37,720 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:21:37,720 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 42 transitions. [2022-04-08 11:21:37,763 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:21:37,764 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 42 transitions. [2022-04-08 11:21:37,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-08 11:21:37,764 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:21:37,764 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:21:37,765 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 11:21:37,765 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:21:37,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:21:37,765 INFO L85 PathProgramCache]: Analyzing trace with hash 766070672, now seen corresponding path program 1 times [2022-04-08 11:21:37,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:21:37,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1131173166] [2022-04-08 11:21:37,766 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 11:21:37,766 INFO L85 PathProgramCache]: Analyzing trace with hash 766070672, now seen corresponding path program 2 times [2022-04-08 11:21:37,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:21:37,767 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106485346] [2022-04-08 11:21:37,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:21:37,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:21:37,783 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:21:37,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [259253165] [2022-04-08 11:21:37,784 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 11:21:37,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:21:37,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:21:37,791 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:21:37,829 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:21:37,845 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-08 11:21:37,845 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:21:37,847 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-08 11:21:37,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:21:37,859 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:21:37,995 INFO L272 TraceCheckUtils]: 0: Hoare triple {323#true} call ULTIMATE.init(); {323#true} is VALID [2022-04-08 11:21:37,996 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:21:37,996 INFO L290 TraceCheckUtils]: 2: Hoare triple {331#(<= ~counter~0 0)} assume true; {331#(<= ~counter~0 0)} is VALID [2022-04-08 11:21:37,997 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {331#(<= ~counter~0 0)} {323#true} #93#return; {331#(<= ~counter~0 0)} is VALID [2022-04-08 11:21:37,997 INFO L272 TraceCheckUtils]: 4: Hoare triple {331#(<= ~counter~0 0)} call #t~ret8 := main(); {331#(<= ~counter~0 0)} is VALID [2022-04-08 11:21:37,998 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:21:37,998 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:21:37,999 INFO L290 TraceCheckUtils]: 7: Hoare triple {331#(<= ~counter~0 0)} ~cond := #in~cond; {331#(<= ~counter~0 0)} is VALID [2022-04-08 11:21:37,999 INFO L290 TraceCheckUtils]: 8: Hoare triple {331#(<= ~counter~0 0)} assume !(0 == ~cond); {331#(<= ~counter~0 0)} is VALID [2022-04-08 11:21:38,000 INFO L290 TraceCheckUtils]: 9: Hoare triple {331#(<= ~counter~0 0)} assume true; {331#(<= ~counter~0 0)} is VALID [2022-04-08 11:21:38,000 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:21:38,001 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:21:38,001 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:21:38,002 INFO L290 TraceCheckUtils]: 13: Hoare triple {365#(<= |main_#t~post6| 0)} assume !(#t~post6 < 20);havoc #t~post6; {324#false} is VALID [2022-04-08 11:21:38,002 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:21:38,002 INFO L290 TraceCheckUtils]: 15: Hoare triple {324#false} ~cond := #in~cond; {324#false} is VALID [2022-04-08 11:21:38,003 INFO L290 TraceCheckUtils]: 16: Hoare triple {324#false} assume 0 == ~cond; {324#false} is VALID [2022-04-08 11:21:38,003 INFO L290 TraceCheckUtils]: 17: Hoare triple {324#false} assume !false; {324#false} is VALID [2022-04-08 11:21:38,003 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:21:38,003 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 11:21:38,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:21:38,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106485346] [2022-04-08 11:21:38,004 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:21:38,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [259253165] [2022-04-08 11:21:38,004 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [259253165] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:21:38,004 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:21:38,004 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 11:21:38,005 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:21:38,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1131173166] [2022-04-08 11:21:38,005 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1131173166] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:21:38,006 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:21:38,006 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 11:21:38,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389902639] [2022-04-08 11:21:38,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:21:38,007 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:21:38,007 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:21:38,007 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:21:38,023 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:21:38,023 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 11:21:38,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:21:38,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 11:21:38,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 11:21:38,024 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:21:38,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:21:38,108 INFO L93 Difference]: Finished difference Result 42 states and 51 transitions. [2022-04-08 11:21:38,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 11:21:38,109 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:21:38,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:21:38,109 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:21:38,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 51 transitions. [2022-04-08 11:21:38,111 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:21:38,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 51 transitions. [2022-04-08 11:21:38,113 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 51 transitions. [2022-04-08 11:21:38,156 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:21:38,158 INFO L225 Difference]: With dead ends: 42 [2022-04-08 11:21:38,158 INFO L226 Difference]: Without dead ends: 35 [2022-04-08 11:21:38,159 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:21:38,160 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:21:38,160 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:21:38,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-08 11:21:38,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2022-04-08 11:21:38,172 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:21:38,173 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:21:38,173 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:21:38,174 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:21:38,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:21:38,176 INFO L93 Difference]: Finished difference Result 35 states and 44 transitions. [2022-04-08 11:21:38,176 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 44 transitions. [2022-04-08 11:21:38,177 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:21:38,177 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:21:38,177 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:21:38,177 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:21:38,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:21:38,180 INFO L93 Difference]: Finished difference Result 35 states and 44 transitions. [2022-04-08 11:21:38,180 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 44 transitions. [2022-04-08 11:21:38,180 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:21:38,180 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:21:38,181 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:21:38,181 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:21:38,181 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:21:38,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 44 transitions. [2022-04-08 11:21:38,183 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 44 transitions. Word has length 18 [2022-04-08 11:21:38,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:21:38,183 INFO L478 AbstractCegarLoop]: Abstraction has 35 states and 44 transitions. [2022-04-08 11:21:38,183 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:21:38,183 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 44 transitions. [2022-04-08 11:21:38,225 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:21:38,225 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 44 transitions. [2022-04-08 11:21:38,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-08 11:21:38,226 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:21:38,226 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:21:38,252 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:21:38,443 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:21:38,444 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:21:38,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:21:38,444 INFO L85 PathProgramCache]: Analyzing trace with hash 767560222, now seen corresponding path program 1 times [2022-04-08 11:21:38,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:21:38,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1835705174] [2022-04-08 11:21:38,445 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 11:21:38,445 INFO L85 PathProgramCache]: Analyzing trace with hash 767560222, now seen corresponding path program 2 times [2022-04-08 11:21:38,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:21:38,445 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690366779] [2022-04-08 11:21:38,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:21:38,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:21:38,461 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:21:38,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1204273766] [2022-04-08 11:21:38,461 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 11:21:38,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:21:38,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:21:38,464 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:21:38,491 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:21:38,519 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-08 11:21:38,519 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:21:38,520 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-08 11:21:38,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:21:38,530 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:21:38,691 INFO L272 TraceCheckUtils]: 0: Hoare triple {604#true} call ULTIMATE.init(); {604#true} is VALID [2022-04-08 11:21:38,692 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:21:38,692 INFO L290 TraceCheckUtils]: 2: Hoare triple {604#true} assume true; {604#true} is VALID [2022-04-08 11:21:38,692 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {604#true} {604#true} #93#return; {604#true} is VALID [2022-04-08 11:21:38,692 INFO L272 TraceCheckUtils]: 4: Hoare triple {604#true} call #t~ret8 := main(); {604#true} is VALID [2022-04-08 11:21:38,693 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:21:38,693 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:21:38,693 INFO L290 TraceCheckUtils]: 7: Hoare triple {604#true} ~cond := #in~cond; {604#true} is VALID [2022-04-08 11:21:38,693 INFO L290 TraceCheckUtils]: 8: Hoare triple {604#true} assume !(0 == ~cond); {604#true} is VALID [2022-04-08 11:21:38,693 INFO L290 TraceCheckUtils]: 9: Hoare triple {604#true} assume true; {604#true} is VALID [2022-04-08 11:21:38,693 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {604#true} {604#true} #77#return; {604#true} is VALID [2022-04-08 11:21:38,694 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:21:38,695 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:21:38,695 INFO L290 TraceCheckUtils]: 13: Hoare triple {642#(and (= main_~a~0 0) (= main_~b~0 0))} assume !!(#t~post6 < 20);havoc #t~post6; {642#(and (= main_~a~0 0) (= main_~b~0 0))} is VALID [2022-04-08 11:21:38,696 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:21:38,697 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:21:38,697 INFO L290 TraceCheckUtils]: 16: Hoare triple {656#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {605#false} is VALID [2022-04-08 11:21:38,697 INFO L290 TraceCheckUtils]: 17: Hoare triple {605#false} assume !false; {605#false} is VALID [2022-04-08 11:21:38,698 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:21:38,698 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 11:21:38,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:21:38,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690366779] [2022-04-08 11:21:38,698 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:21:38,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1204273766] [2022-04-08 11:21:38,699 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1204273766] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:21:38,699 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:21:38,699 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 11:21:38,699 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:21:38,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1835705174] [2022-04-08 11:21:38,699 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1835705174] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:21:38,699 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:21:38,699 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 11:21:38,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126103227] [2022-04-08 11:21:38,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:21:38,700 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:21:38,700 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:21:38,701 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:21:38,715 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:21:38,715 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 11:21:38,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:21:38,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 11:21:38,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 11:21:38,716 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:21:38,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:21:38,872 INFO L93 Difference]: Finished difference Result 45 states and 56 transitions. [2022-04-08 11:21:38,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 11:21:38,873 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:21:38,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:21:38,873 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:21:38,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 56 transitions. [2022-04-08 11:21:38,875 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:21:38,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 56 transitions. [2022-04-08 11:21:38,877 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 56 transitions. [2022-04-08 11:21:38,930 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:21:38,932 INFO L225 Difference]: With dead ends: 45 [2022-04-08 11:21:38,932 INFO L226 Difference]: Without dead ends: 43 [2022-04-08 11:21:38,932 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:21:38,941 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:21:38,941 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:21:38,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-04-08 11:21:38,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 40. [2022-04-08 11:21:38,961 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:21:38,962 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:21:38,962 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:21:38,963 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:21:38,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:21:38,965 INFO L93 Difference]: Finished difference Result 43 states and 54 transitions. [2022-04-08 11:21:38,965 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 54 transitions. [2022-04-08 11:21:38,966 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:21:38,966 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:21:38,967 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:21:38,967 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:21:38,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:21:38,969 INFO L93 Difference]: Finished difference Result 43 states and 54 transitions. [2022-04-08 11:21:38,969 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 54 transitions. [2022-04-08 11:21:38,970 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:21:38,970 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:21:38,970 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:21:38,970 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:21:38,970 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:21:38,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 49 transitions. [2022-04-08 11:21:38,975 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 49 transitions. Word has length 18 [2022-04-08 11:21:38,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:21:38,975 INFO L478 AbstractCegarLoop]: Abstraction has 40 states and 49 transitions. [2022-04-08 11:21:38,976 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:21:38,976 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 40 states and 49 transitions. [2022-04-08 11:21:39,030 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:21:39,031 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 49 transitions. [2022-04-08 11:21:39,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-08 11:21:39,031 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:21:39,032 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:21:39,058 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:21:39,255 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:21:39,256 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:21:39,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:21:39,256 INFO L85 PathProgramCache]: Analyzing trace with hash -1016228092, now seen corresponding path program 1 times [2022-04-08 11:21:39,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:21:39,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [844271485] [2022-04-08 11:21:39,257 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 11:21:39,257 INFO L85 PathProgramCache]: Analyzing trace with hash -1016228092, now seen corresponding path program 2 times [2022-04-08 11:21:39,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:21:39,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405705752] [2022-04-08 11:21:39,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:21:39,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:21:39,275 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:21:39,275 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1637607950] [2022-04-08 11:21:39,275 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 11:21:39,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:21:39,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:21:39,276 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:21:39,285 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:21:39,333 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 11:21:39,333 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:21:39,334 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-08 11:21:39,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:21:39,345 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:21:39,446 INFO L272 TraceCheckUtils]: 0: Hoare triple {920#true} call ULTIMATE.init(); {920#true} is VALID [2022-04-08 11:21:39,446 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:21:39,446 INFO L290 TraceCheckUtils]: 2: Hoare triple {920#true} assume true; {920#true} is VALID [2022-04-08 11:21:39,446 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {920#true} {920#true} #93#return; {920#true} is VALID [2022-04-08 11:21:39,447 INFO L272 TraceCheckUtils]: 4: Hoare triple {920#true} call #t~ret8 := main(); {920#true} is VALID [2022-04-08 11:21:39,447 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:21:39,447 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:21:39,447 INFO L290 TraceCheckUtils]: 7: Hoare triple {920#true} ~cond := #in~cond; {920#true} is VALID [2022-04-08 11:21:39,447 INFO L290 TraceCheckUtils]: 8: Hoare triple {920#true} assume !(0 == ~cond); {920#true} is VALID [2022-04-08 11:21:39,447 INFO L290 TraceCheckUtils]: 9: Hoare triple {920#true} assume true; {920#true} is VALID [2022-04-08 11:21:39,448 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {920#true} {920#true} #77#return; {920#true} is VALID [2022-04-08 11:21:39,448 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:21:39,449 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:21:39,449 INFO L290 TraceCheckUtils]: 13: Hoare triple {958#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} assume !!(#t~post6 < 20);havoc #t~post6; {958#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 11:21:39,449 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:21:39,449 INFO L290 TraceCheckUtils]: 15: Hoare triple {920#true} ~cond := #in~cond; {920#true} is VALID [2022-04-08 11:21:39,450 INFO L290 TraceCheckUtils]: 16: Hoare triple {920#true} assume !(0 == ~cond); {920#true} is VALID [2022-04-08 11:21:39,450 INFO L290 TraceCheckUtils]: 17: Hoare triple {920#true} assume true; {920#true} is VALID [2022-04-08 11:21:39,451 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:21:39,452 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:21:39,452 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:21:39,452 INFO L290 TraceCheckUtils]: 21: Hoare triple {987#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {921#false} is VALID [2022-04-08 11:21:39,453 INFO L290 TraceCheckUtils]: 22: Hoare triple {921#false} assume !false; {921#false} is VALID [2022-04-08 11:21:39,454 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:21:39,454 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 11:21:39,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:21:39,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405705752] [2022-04-08 11:21:39,454 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:21:39,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1637607950] [2022-04-08 11:21:39,454 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1637607950] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:21:39,455 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:21:39,455 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 11:21:39,455 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:21:39,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [844271485] [2022-04-08 11:21:39,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [844271485] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:21:39,457 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:21:39,457 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 11:21:39,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387777850] [2022-04-08 11:21:39,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:21:39,458 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:21:39,458 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:21:39,458 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:21:39,476 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:21:39,476 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 11:21:39,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:21:39,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 11:21:39,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 11:21:39,478 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:21:39,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:21:39,694 INFO L93 Difference]: Finished difference Result 58 states and 74 transitions. [2022-04-08 11:21:39,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 11:21:39,694 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:21:39,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:21:39,694 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:21:39,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 71 transitions. [2022-04-08 11:21:39,699 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:21:39,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 71 transitions. [2022-04-08 11:21:39,705 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 71 transitions. [2022-04-08 11:21:39,758 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:21:39,760 INFO L225 Difference]: With dead ends: 58 [2022-04-08 11:21:39,760 INFO L226 Difference]: Without dead ends: 55 [2022-04-08 11:21:39,761 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:21:39,762 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:21:39,762 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:21:39,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-04-08 11:21:39,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 54. [2022-04-08 11:21:39,781 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:21:39,782 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:21:39,782 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:21:39,783 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:21:39,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:21:39,785 INFO L93 Difference]: Finished difference Result 55 states and 70 transitions. [2022-04-08 11:21:39,786 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 70 transitions. [2022-04-08 11:21:39,786 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:21:39,786 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:21:39,787 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:21:39,787 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:21:39,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:21:39,790 INFO L93 Difference]: Finished difference Result 55 states and 70 transitions. [2022-04-08 11:21:39,790 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 70 transitions. [2022-04-08 11:21:39,791 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:21:39,791 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:21:39,791 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:21:39,791 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:21:39,791 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:21:39,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 69 transitions. [2022-04-08 11:21:39,794 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 69 transitions. Word has length 23 [2022-04-08 11:21:39,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:21:39,794 INFO L478 AbstractCegarLoop]: Abstraction has 54 states and 69 transitions. [2022-04-08 11:21:39,794 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:21:39,794 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 54 states and 69 transitions. [2022-04-08 11:21:39,861 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:21:39,861 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 69 transitions. [2022-04-08 11:21:39,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-08 11:21:39,862 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:21:39,862 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:21:39,890 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:21:40,087 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:21:40,088 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:21:40,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:21:40,088 INFO L85 PathProgramCache]: Analyzing trace with hash 2019703110, now seen corresponding path program 1 times [2022-04-08 11:21:40,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:21:40,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1287823788] [2022-04-08 11:21:40,089 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 11:21:40,089 INFO L85 PathProgramCache]: Analyzing trace with hash 2019703110, now seen corresponding path program 2 times [2022-04-08 11:21:40,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:21:40,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880070950] [2022-04-08 11:21:40,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:21:40,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:21:40,110 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:21:40,110 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [206911032] [2022-04-08 11:21:40,110 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 11:21:40,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:21:40,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:21:40,112 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:21:40,114 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:21:40,165 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 11:21:40,165 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:21:40,166 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-08 11:21:40,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:21:40,184 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:21:40,359 INFO L272 TraceCheckUtils]: 0: Hoare triple {1329#true} call ULTIMATE.init(); {1329#true} is VALID [2022-04-08 11:21:40,359 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:21:40,359 INFO L290 TraceCheckUtils]: 2: Hoare triple {1329#true} assume true; {1329#true} is VALID [2022-04-08 11:21:40,359 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1329#true} {1329#true} #93#return; {1329#true} is VALID [2022-04-08 11:21:40,360 INFO L272 TraceCheckUtils]: 4: Hoare triple {1329#true} call #t~ret8 := main(); {1329#true} is VALID [2022-04-08 11:21:40,360 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:21:40,360 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:21:40,360 INFO L290 TraceCheckUtils]: 7: Hoare triple {1329#true} ~cond := #in~cond; {1329#true} is VALID [2022-04-08 11:21:40,360 INFO L290 TraceCheckUtils]: 8: Hoare triple {1329#true} assume !(0 == ~cond); {1329#true} is VALID [2022-04-08 11:21:40,360 INFO L290 TraceCheckUtils]: 9: Hoare triple {1329#true} assume true; {1329#true} is VALID [2022-04-08 11:21:40,360 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1329#true} {1329#true} #77#return; {1329#true} is VALID [2022-04-08 11:21:40,360 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:21:40,361 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:21:40,361 INFO L290 TraceCheckUtils]: 13: Hoare triple {1329#true} assume !!(#t~post6 < 20);havoc #t~post6; {1329#true} is VALID [2022-04-08 11:21:40,361 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:21:40,361 INFO L290 TraceCheckUtils]: 15: Hoare triple {1329#true} ~cond := #in~cond; {1329#true} is VALID [2022-04-08 11:21:40,361 INFO L290 TraceCheckUtils]: 16: Hoare triple {1329#true} assume !(0 == ~cond); {1329#true} is VALID [2022-04-08 11:21:40,361 INFO L290 TraceCheckUtils]: 17: Hoare triple {1329#true} assume true; {1329#true} is VALID [2022-04-08 11:21:40,361 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1329#true} {1329#true} #79#return; {1329#true} is VALID [2022-04-08 11:21:40,361 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:21:40,362 INFO L290 TraceCheckUtils]: 20: Hoare triple {1329#true} ~cond := #in~cond; {1329#true} is VALID [2022-04-08 11:21:40,362 INFO L290 TraceCheckUtils]: 21: Hoare triple {1329#true} assume !(0 == ~cond); {1329#true} is VALID [2022-04-08 11:21:40,362 INFO L290 TraceCheckUtils]: 22: Hoare triple {1329#true} assume true; {1329#true} is VALID [2022-04-08 11:21:40,362 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1329#true} {1329#true} #81#return; {1329#true} is VALID [2022-04-08 11:21:40,363 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:21:40,363 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:21:40,364 INFO L290 TraceCheckUtils]: 26: Hoare triple {1406#(and (= main_~a~0 1) (= main_~b~0 main_~y~0))} assume !!(#t~post7 < 20);havoc #t~post7; {1406#(and (= main_~a~0 1) (= main_~b~0 main_~y~0))} is VALID [2022-04-08 11:21:40,365 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:21:40,365 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:21:40,365 INFO L290 TraceCheckUtils]: 29: Hoare triple {1420#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1330#false} is VALID [2022-04-08 11:21:40,366 INFO L290 TraceCheckUtils]: 30: Hoare triple {1330#false} assume !false; {1330#false} is VALID [2022-04-08 11:21:40,366 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:21:40,366 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 11:21:40,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:21:40,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880070950] [2022-04-08 11:21:40,366 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:21:40,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [206911032] [2022-04-08 11:21:40,366 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [206911032] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:21:40,366 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:21:40,367 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 11:21:40,367 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:21:40,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1287823788] [2022-04-08 11:21:40,367 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1287823788] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:21:40,367 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:21:40,367 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 11:21:40,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579162590] [2022-04-08 11:21:40,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:21:40,368 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:21:40,368 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:21:40,368 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:21:40,398 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:21:40,398 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 11:21:40,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:21:40,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 11:21:40,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 11:21:40,399 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:21:40,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:21:40,646 INFO L93 Difference]: Finished difference Result 83 states and 113 transitions. [2022-04-08 11:21:40,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 11:21:40,647 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:21:40,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:21:40,647 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:21:40,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 72 transitions. [2022-04-08 11:21:40,649 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:21:40,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 72 transitions. [2022-04-08 11:21:40,651 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 72 transitions. [2022-04-08 11:21:40,720 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:21:40,722 INFO L225 Difference]: With dead ends: 83 [2022-04-08 11:21:40,723 INFO L226 Difference]: Without dead ends: 81 [2022-04-08 11:21:40,723 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:21:40,724 INFO L913 BasicCegarLoop]: 46 mSDtfsCounter, 13 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2022-04-08 11:21:40,724 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.1s Time] [2022-04-08 11:21:40,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-04-08 11:21:40,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 74. [2022-04-08 11:21:40,751 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:21:40,752 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:21:40,752 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:21:40,752 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:21:40,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:21:40,757 INFO L93 Difference]: Finished difference Result 81 states and 111 transitions. [2022-04-08 11:21:40,757 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 111 transitions. [2022-04-08 11:21:40,757 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:21:40,757 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:21:40,758 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:21:40,758 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:21:40,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:21:40,762 INFO L93 Difference]: Finished difference Result 81 states and 111 transitions. [2022-04-08 11:21:40,762 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 111 transitions. [2022-04-08 11:21:40,762 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:21:40,763 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:21:40,763 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:21:40,763 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:21:40,763 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:21:40,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 100 transitions. [2022-04-08 11:21:40,766 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 100 transitions. Word has length 31 [2022-04-08 11:21:40,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:21:40,767 INFO L478 AbstractCegarLoop]: Abstraction has 74 states and 100 transitions. [2022-04-08 11:21:40,767 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:21:40,767 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 74 states and 100 transitions. [2022-04-08 11:21:40,880 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:21:40,881 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 100 transitions. [2022-04-08 11:21:40,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-08 11:21:40,881 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:21:40,882 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:21:40,907 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:21:41,082 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:21:41,082 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:21:41,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:21:41,083 INFO L85 PathProgramCache]: Analyzing trace with hash 202176206, now seen corresponding path program 1 times [2022-04-08 11:21:41,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:21:41,083 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [953034993] [2022-04-08 11:21:49,080 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 11:21:49,080 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 11:21:49,081 INFO L85 PathProgramCache]: Analyzing trace with hash 202176206, now seen corresponding path program 2 times [2022-04-08 11:21:49,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:21:49,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520563598] [2022-04-08 11:21:49,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:21:49,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:21:49,113 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:21:49,114 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1547819660] [2022-04-08 11:21:49,114 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 11:21:49,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:21:49,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:21:49,124 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:21:49,139 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:21:49,182 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 11:21:49,182 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:21:49,183 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-08 11:21:49,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:21:49,202 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:21:49,366 INFO L272 TraceCheckUtils]: 0: Hoare triple {1904#true} call ULTIMATE.init(); {1904#true} is VALID [2022-04-08 11:21:49,371 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:21:49,372 INFO L290 TraceCheckUtils]: 2: Hoare triple {1912#(<= ~counter~0 0)} assume true; {1912#(<= ~counter~0 0)} is VALID [2022-04-08 11:21:49,373 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1912#(<= ~counter~0 0)} {1904#true} #93#return; {1912#(<= ~counter~0 0)} is VALID [2022-04-08 11:21:49,374 INFO L272 TraceCheckUtils]: 4: Hoare triple {1912#(<= ~counter~0 0)} call #t~ret8 := main(); {1912#(<= ~counter~0 0)} is VALID [2022-04-08 11:21:49,375 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:21:49,376 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:21:49,377 INFO L290 TraceCheckUtils]: 7: Hoare triple {1912#(<= ~counter~0 0)} ~cond := #in~cond; {1912#(<= ~counter~0 0)} is VALID [2022-04-08 11:21:49,383 INFO L290 TraceCheckUtils]: 8: Hoare triple {1912#(<= ~counter~0 0)} assume !(0 == ~cond); {1912#(<= ~counter~0 0)} is VALID [2022-04-08 11:21:49,384 INFO L290 TraceCheckUtils]: 9: Hoare triple {1912#(<= ~counter~0 0)} assume true; {1912#(<= ~counter~0 0)} is VALID [2022-04-08 11:21:49,384 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:21:49,385 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:21:49,385 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:21:49,386 INFO L290 TraceCheckUtils]: 13: Hoare triple {1946#(<= ~counter~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {1946#(<= ~counter~0 1)} is VALID [2022-04-08 11:21:49,386 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:21:49,387 INFO L290 TraceCheckUtils]: 15: Hoare triple {1946#(<= ~counter~0 1)} ~cond := #in~cond; {1946#(<= ~counter~0 1)} is VALID [2022-04-08 11:21:49,387 INFO L290 TraceCheckUtils]: 16: Hoare triple {1946#(<= ~counter~0 1)} assume !(0 == ~cond); {1946#(<= ~counter~0 1)} is VALID [2022-04-08 11:21:49,387 INFO L290 TraceCheckUtils]: 17: Hoare triple {1946#(<= ~counter~0 1)} assume true; {1946#(<= ~counter~0 1)} is VALID [2022-04-08 11:21:49,388 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:21:49,389 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:21:49,389 INFO L290 TraceCheckUtils]: 20: Hoare triple {1946#(<= ~counter~0 1)} ~cond := #in~cond; {1946#(<= ~counter~0 1)} is VALID [2022-04-08 11:21:49,389 INFO L290 TraceCheckUtils]: 21: Hoare triple {1946#(<= ~counter~0 1)} assume !(0 == ~cond); {1946#(<= ~counter~0 1)} is VALID [2022-04-08 11:21:49,389 INFO L290 TraceCheckUtils]: 22: Hoare triple {1946#(<= ~counter~0 1)} assume true; {1946#(<= ~counter~0 1)} is VALID [2022-04-08 11:21:49,390 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:21:49,390 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:21:49,391 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:21:49,391 INFO L290 TraceCheckUtils]: 26: Hoare triple {1986#(<= |main_#t~post7| 1)} assume !(#t~post7 < 20);havoc #t~post7; {1905#false} is VALID [2022-04-08 11:21:49,391 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:21:49,391 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:21:49,391 INFO L290 TraceCheckUtils]: 29: Hoare triple {1905#false} assume !(#t~post6 < 20);havoc #t~post6; {1905#false} is VALID [2022-04-08 11:21:49,392 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:21:49,392 INFO L290 TraceCheckUtils]: 31: Hoare triple {1905#false} ~cond := #in~cond; {1905#false} is VALID [2022-04-08 11:21:49,392 INFO L290 TraceCheckUtils]: 32: Hoare triple {1905#false} assume 0 == ~cond; {1905#false} is VALID [2022-04-08 11:21:49,392 INFO L290 TraceCheckUtils]: 33: Hoare triple {1905#false} assume !false; {1905#false} is VALID [2022-04-08 11:21:49,392 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:21:49,392 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 11:21:49,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:21:49,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520563598] [2022-04-08 11:21:49,393 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:21:49,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1547819660] [2022-04-08 11:21:49,393 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1547819660] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:21:49,393 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:21:49,393 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 11:21:49,393 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:21:49,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [953034993] [2022-04-08 11:21:49,393 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [953034993] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:21:49,394 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:21:49,394 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 11:21:49,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921545684] [2022-04-08 11:21:49,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:21:49,394 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:21:49,394 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:21:49,395 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:21:49,423 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:21:49,423 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 11:21:49,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:21:49,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 11:21:49,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-08 11:21:49,425 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:21:49,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:21:49,566 INFO L93 Difference]: Finished difference Result 113 states and 153 transitions. [2022-04-08 11:21:49,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 11:21:49,567 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:21:49,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:21:49,567 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:21:49,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 85 transitions. [2022-04-08 11:21:49,569 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:21:49,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 85 transitions. [2022-04-08 11:21:49,570 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 85 transitions. [2022-04-08 11:21:49,645 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:21:49,647 INFO L225 Difference]: With dead ends: 113 [2022-04-08 11:21:49,647 INFO L226 Difference]: Without dead ends: 78 [2022-04-08 11:21:49,648 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:21:49,649 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:21:49,649 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:21:49,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-04-08 11:21:49,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2022-04-08 11:21:49,689 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:21:49,689 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:21:49,690 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:21:49,690 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:21:49,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:21:49,693 INFO L93 Difference]: Finished difference Result 78 states and 102 transitions. [2022-04-08 11:21:49,693 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 102 transitions. [2022-04-08 11:21:49,694 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:21:49,694 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:21:49,694 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:21:49,695 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:21:49,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:21:49,698 INFO L93 Difference]: Finished difference Result 78 states and 102 transitions. [2022-04-08 11:21:49,698 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 102 transitions. [2022-04-08 11:21:49,698 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:21:49,698 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:21:49,698 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:21:49,698 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:21:49,699 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:21:49,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 102 transitions. [2022-04-08 11:21:49,702 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 102 transitions. Word has length 34 [2022-04-08 11:21:49,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:21:49,702 INFO L478 AbstractCegarLoop]: Abstraction has 78 states and 102 transitions. [2022-04-08 11:21:49,702 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:21:49,702 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 78 states and 102 transitions. [2022-04-08 11:21:49,808 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:21:49,808 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 102 transitions. [2022-04-08 11:21:49,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-08 11:21:49,809 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:21:49,809 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:21:49,837 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:21:50,019 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:21:50,020 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:21:50,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:21:50,020 INFO L85 PathProgramCache]: Analyzing trace with hash 1813008070, now seen corresponding path program 1 times [2022-04-08 11:21:50,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:21:50,020 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [404325008] [2022-04-08 11:21:50,021 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 11:21:50,021 INFO L85 PathProgramCache]: Analyzing trace with hash 1813008070, now seen corresponding path program 2 times [2022-04-08 11:21:50,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:21:50,021 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236836669] [2022-04-08 11:21:50,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:21:50,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:21:50,034 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:21:50,034 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1945238997] [2022-04-08 11:21:50,035 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 11:21:50,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:21:50,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:21:50,036 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:21:50,060 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:21:50,086 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 11:21:50,086 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:21:50,087 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-08 11:21:50,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:21:50,102 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:21:50,307 INFO L272 TraceCheckUtils]: 0: Hoare triple {2548#true} call ULTIMATE.init(); {2548#true} is VALID [2022-04-08 11:21:50,307 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:21:50,307 INFO L290 TraceCheckUtils]: 2: Hoare triple {2548#true} assume true; {2548#true} is VALID [2022-04-08 11:21:50,308 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2548#true} {2548#true} #93#return; {2548#true} is VALID [2022-04-08 11:21:50,308 INFO L272 TraceCheckUtils]: 4: Hoare triple {2548#true} call #t~ret8 := main(); {2548#true} is VALID [2022-04-08 11:21:50,308 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:21:50,308 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:21:50,308 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:21:50,309 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:21:50,309 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:21:50,310 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:21:50,310 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:21:50,310 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:21:50,311 INFO L290 TraceCheckUtils]: 13: Hoare triple {2585#(<= 1 main_~y~0)} assume !!(#t~post6 < 20);havoc #t~post6; {2585#(<= 1 main_~y~0)} is VALID [2022-04-08 11:21:50,311 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:21:50,311 INFO L290 TraceCheckUtils]: 15: Hoare triple {2548#true} ~cond := #in~cond; {2548#true} is VALID [2022-04-08 11:21:50,311 INFO L290 TraceCheckUtils]: 16: Hoare triple {2548#true} assume !(0 == ~cond); {2548#true} is VALID [2022-04-08 11:21:50,311 INFO L290 TraceCheckUtils]: 17: Hoare triple {2548#true} assume true; {2548#true} is VALID [2022-04-08 11:21:50,312 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:21:50,312 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:21:50,312 INFO L290 TraceCheckUtils]: 20: Hoare triple {2548#true} ~cond := #in~cond; {2548#true} is VALID [2022-04-08 11:21:50,312 INFO L290 TraceCheckUtils]: 21: Hoare triple {2548#true} assume !(0 == ~cond); {2548#true} is VALID [2022-04-08 11:21:50,312 INFO L290 TraceCheckUtils]: 22: Hoare triple {2548#true} assume true; {2548#true} is VALID [2022-04-08 11:21:50,313 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:21:50,313 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:21:50,314 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:21:50,314 INFO L290 TraceCheckUtils]: 26: Hoare triple {2628#(<= 1 main_~r~0)} assume !!(#t~post7 < 20);havoc #t~post7; {2628#(<= 1 main_~r~0)} is VALID [2022-04-08 11:21:50,314 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:21:50,314 INFO L290 TraceCheckUtils]: 28: Hoare triple {2548#true} ~cond := #in~cond; {2548#true} is VALID [2022-04-08 11:21:50,314 INFO L290 TraceCheckUtils]: 29: Hoare triple {2548#true} assume !(0 == ~cond); {2548#true} is VALID [2022-04-08 11:21:50,314 INFO L290 TraceCheckUtils]: 30: Hoare triple {2548#true} assume true; {2548#true} is VALID [2022-04-08 11:21:50,315 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:21:50,316 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:21:50,316 INFO L290 TraceCheckUtils]: 33: Hoare triple {2548#true} ~cond := #in~cond; {2548#true} is VALID [2022-04-08 11:21:50,316 INFO L290 TraceCheckUtils]: 34: Hoare triple {2548#true} assume !(0 == ~cond); {2548#true} is VALID [2022-04-08 11:21:50,317 INFO L290 TraceCheckUtils]: 35: Hoare triple {2548#true} assume true; {2548#true} is VALID [2022-04-08 11:21:50,317 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:21:50,318 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:21:50,318 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:21:50,322 INFO L290 TraceCheckUtils]: 39: Hoare triple {2672#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2549#false} is VALID [2022-04-08 11:21:50,322 INFO L290 TraceCheckUtils]: 40: Hoare triple {2549#false} assume !false; {2549#false} is VALID [2022-04-08 11:21:50,323 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:21:50,323 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 11:21:50,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:21:50,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236836669] [2022-04-08 11:21:50,323 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:21:50,324 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1945238997] [2022-04-08 11:21:50,324 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1945238997] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:21:50,324 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:21:50,324 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 11:21:50,324 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:21:50,324 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [404325008] [2022-04-08 11:21:50,324 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [404325008] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:21:50,324 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:21:50,324 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 11:21:50,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695390046] [2022-04-08 11:21:50,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:21:50,325 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:21:50,325 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:21:50,325 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:21:50,348 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:21:50,348 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 11:21:50,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:21:50,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 11:21:50,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-04-08 11:21:50,350 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:21:50,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:21:50,767 INFO L93 Difference]: Finished difference Result 84 states and 107 transitions. [2022-04-08 11:21:50,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 11:21:50,768 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:21:50,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:21:50,768 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:21:50,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 47 transitions. [2022-04-08 11:21:50,769 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:21:50,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 47 transitions. [2022-04-08 11:21:50,770 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 47 transitions. [2022-04-08 11:21:50,814 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:21:50,816 INFO L225 Difference]: With dead ends: 84 [2022-04-08 11:21:50,816 INFO L226 Difference]: Without dead ends: 82 [2022-04-08 11:21:50,816 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:21:50,817 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:21:50,818 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:21:50,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-04-08 11:21:50,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2022-04-08 11:21:50,910 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:21:50,911 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:21:50,911 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:21:50,912 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:21:50,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:21:50,915 INFO L93 Difference]: Finished difference Result 82 states and 105 transitions. [2022-04-08 11:21:50,915 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 105 transitions. [2022-04-08 11:21:50,915 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:21:50,915 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:21:50,916 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:21:50,916 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:21:50,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:21:50,919 INFO L93 Difference]: Finished difference Result 82 states and 105 transitions. [2022-04-08 11:21:50,919 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 105 transitions. [2022-04-08 11:21:50,920 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:21:50,920 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:21:50,920 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:21:50,920 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:21:50,920 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:21:50,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 105 transitions. [2022-04-08 11:21:50,923 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 105 transitions. Word has length 41 [2022-04-08 11:21:50,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:21:50,924 INFO L478 AbstractCegarLoop]: Abstraction has 82 states and 105 transitions. [2022-04-08 11:21:50,924 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:21:50,924 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 82 states and 105 transitions. [2022-04-08 11:21:51,028 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:21:51,028 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 105 transitions. [2022-04-08 11:21:51,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-08 11:21:51,029 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:21:51,029 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:21:51,045 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:21:51,231 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:21:51,232 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:21:51,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:21:51,232 INFO L85 PathProgramCache]: Analyzing trace with hash -683043127, now seen corresponding path program 1 times [2022-04-08 11:21:51,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:21:51,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1847676422] [2022-04-08 11:21:51,233 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 11:21:51,234 INFO L85 PathProgramCache]: Analyzing trace with hash -683043127, now seen corresponding path program 2 times [2022-04-08 11:21:51,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:21:51,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112672001] [2022-04-08 11:21:51,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:21:51,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:21:51,262 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:21:51,262 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1040306523] [2022-04-08 11:21:51,263 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 11:21:51,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:21:51,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:21:51,264 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:21:51,283 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:21:51,317 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 11:21:51,318 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:21:51,318 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-08 11:21:51,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:21:51,337 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:21:51,524 INFO L272 TraceCheckUtils]: 0: Hoare triple {3180#true} call ULTIMATE.init(); {3180#true} is VALID [2022-04-08 11:21:51,525 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:21:51,525 INFO L290 TraceCheckUtils]: 2: Hoare triple {3180#true} assume true; {3180#true} is VALID [2022-04-08 11:21:51,525 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3180#true} {3180#true} #93#return; {3180#true} is VALID [2022-04-08 11:21:51,525 INFO L272 TraceCheckUtils]: 4: Hoare triple {3180#true} call #t~ret8 := main(); {3180#true} is VALID [2022-04-08 11:21:51,525 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:21:51,525 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:21:51,525 INFO L290 TraceCheckUtils]: 7: Hoare triple {3180#true} ~cond := #in~cond; {3180#true} is VALID [2022-04-08 11:21:51,526 INFO L290 TraceCheckUtils]: 8: Hoare triple {3180#true} assume !(0 == ~cond); {3180#true} is VALID [2022-04-08 11:21:51,526 INFO L290 TraceCheckUtils]: 9: Hoare triple {3180#true} assume true; {3180#true} is VALID [2022-04-08 11:21:51,526 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3180#true} {3180#true} #77#return; {3180#true} is VALID [2022-04-08 11:21:51,526 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:21:51,526 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:21:51,526 INFO L290 TraceCheckUtils]: 13: Hoare triple {3180#true} assume !!(#t~post6 < 20);havoc #t~post6; {3180#true} is VALID [2022-04-08 11:21:51,526 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:21:51,526 INFO L290 TraceCheckUtils]: 15: Hoare triple {3180#true} ~cond := #in~cond; {3180#true} is VALID [2022-04-08 11:21:51,526 INFO L290 TraceCheckUtils]: 16: Hoare triple {3180#true} assume !(0 == ~cond); {3180#true} is VALID [2022-04-08 11:21:51,527 INFO L290 TraceCheckUtils]: 17: Hoare triple {3180#true} assume true; {3180#true} is VALID [2022-04-08 11:21:51,527 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {3180#true} {3180#true} #79#return; {3180#true} is VALID [2022-04-08 11:21:51,527 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:21:51,527 INFO L290 TraceCheckUtils]: 20: Hoare triple {3180#true} ~cond := #in~cond; {3180#true} is VALID [2022-04-08 11:21:51,527 INFO L290 TraceCheckUtils]: 21: Hoare triple {3180#true} assume !(0 == ~cond); {3180#true} is VALID [2022-04-08 11:21:51,527 INFO L290 TraceCheckUtils]: 22: Hoare triple {3180#true} assume true; {3180#true} is VALID [2022-04-08 11:21:51,527 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {3180#true} {3180#true} #81#return; {3180#true} is VALID [2022-04-08 11:21:51,527 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:21:51,528 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:21:51,528 INFO L290 TraceCheckUtils]: 26: Hoare triple {3180#true} assume !!(#t~post7 < 20);havoc #t~post7; {3180#true} is VALID [2022-04-08 11:21:51,528 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:21:51,530 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:21:51,530 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:21:51,530 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:21:51,531 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:21:51,531 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:21:51,531 INFO L290 TraceCheckUtils]: 33: Hoare triple {3180#true} ~cond := #in~cond; {3180#true} is VALID [2022-04-08 11:21:51,531 INFO L290 TraceCheckUtils]: 34: Hoare triple {3180#true} assume !(0 == ~cond); {3180#true} is VALID [2022-04-08 11:21:51,531 INFO L290 TraceCheckUtils]: 35: Hoare triple {3180#true} assume true; {3180#true} is VALID [2022-04-08 11:21:51,532 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:21:51,532 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:21:51,532 INFO L290 TraceCheckUtils]: 38: Hoare triple {3180#true} ~cond := #in~cond; {3180#true} is VALID [2022-04-08 11:21:51,532 INFO L290 TraceCheckUtils]: 39: Hoare triple {3180#true} assume !(0 == ~cond); {3180#true} is VALID [2022-04-08 11:21:51,533 INFO L290 TraceCheckUtils]: 40: Hoare triple {3180#true} assume true; {3180#true} is VALID [2022-04-08 11:21:51,533 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:21:51,534 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:21:51,534 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:21:51,535 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:21:51,535 INFO L290 TraceCheckUtils]: 45: Hoare triple {3322#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3181#false} is VALID [2022-04-08 11:21:51,535 INFO L290 TraceCheckUtils]: 46: Hoare triple {3181#false} assume !false; {3181#false} is VALID [2022-04-08 11:21:51,535 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:21:51,536 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 11:21:57,972 INFO L290 TraceCheckUtils]: 46: Hoare triple {3181#false} assume !false; {3181#false} is VALID [2022-04-08 11:21:57,972 INFO L290 TraceCheckUtils]: 45: Hoare triple {3322#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3181#false} is VALID [2022-04-08 11:21:57,973 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:21:57,974 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:21:57,974 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:21:57,975 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:21:57,975 INFO L290 TraceCheckUtils]: 40: Hoare triple {3180#true} assume true; {3180#true} is VALID [2022-04-08 11:21:57,975 INFO L290 TraceCheckUtils]: 39: Hoare triple {3180#true} assume !(0 == ~cond); {3180#true} is VALID [2022-04-08 11:21:57,975 INFO L290 TraceCheckUtils]: 38: Hoare triple {3180#true} ~cond := #in~cond; {3180#true} is VALID [2022-04-08 11:21:57,975 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:21:57,976 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:21:57,976 INFO L290 TraceCheckUtils]: 35: Hoare triple {3180#true} assume true; {3180#true} is VALID [2022-04-08 11:21:57,977 INFO L290 TraceCheckUtils]: 34: Hoare triple {3180#true} assume !(0 == ~cond); {3180#true} is VALID [2022-04-08 11:21:57,980 INFO L290 TraceCheckUtils]: 33: Hoare triple {3180#true} ~cond := #in~cond; {3180#true} is VALID [2022-04-08 11:21:58,013 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:21:58,021 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:21:58,022 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:21:58,023 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:21:58,023 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:21:58,024 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:21:58,024 INFO L290 TraceCheckUtils]: 26: Hoare triple {3180#true} assume !!(#t~post7 < 20);havoc #t~post7; {3180#true} is VALID [2022-04-08 11:21:58,024 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:21:58,024 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:21:58,024 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {3180#true} {3180#true} #81#return; {3180#true} is VALID [2022-04-08 11:21:58,024 INFO L290 TraceCheckUtils]: 22: Hoare triple {3180#true} assume true; {3180#true} is VALID [2022-04-08 11:21:58,024 INFO L290 TraceCheckUtils]: 21: Hoare triple {3180#true} assume !(0 == ~cond); {3180#true} is VALID [2022-04-08 11:21:58,024 INFO L290 TraceCheckUtils]: 20: Hoare triple {3180#true} ~cond := #in~cond; {3180#true} is VALID [2022-04-08 11:21:58,024 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:21:58,025 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {3180#true} {3180#true} #79#return; {3180#true} is VALID [2022-04-08 11:21:58,025 INFO L290 TraceCheckUtils]: 17: Hoare triple {3180#true} assume true; {3180#true} is VALID [2022-04-08 11:21:58,025 INFO L290 TraceCheckUtils]: 16: Hoare triple {3180#true} assume !(0 == ~cond); {3180#true} is VALID [2022-04-08 11:21:58,025 INFO L290 TraceCheckUtils]: 15: Hoare triple {3180#true} ~cond := #in~cond; {3180#true} is VALID [2022-04-08 11:21:58,025 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:21:58,025 INFO L290 TraceCheckUtils]: 13: Hoare triple {3180#true} assume !!(#t~post6 < 20);havoc #t~post6; {3180#true} is VALID [2022-04-08 11:21:58,025 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:21:58,025 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:21:58,025 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3180#true} {3180#true} #77#return; {3180#true} is VALID [2022-04-08 11:21:58,025 INFO L290 TraceCheckUtils]: 9: Hoare triple {3180#true} assume true; {3180#true} is VALID [2022-04-08 11:21:58,026 INFO L290 TraceCheckUtils]: 8: Hoare triple {3180#true} assume !(0 == ~cond); {3180#true} is VALID [2022-04-08 11:21:58,026 INFO L290 TraceCheckUtils]: 7: Hoare triple {3180#true} ~cond := #in~cond; {3180#true} is VALID [2022-04-08 11:21:58,026 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:21:58,026 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:21:58,026 INFO L272 TraceCheckUtils]: 4: Hoare triple {3180#true} call #t~ret8 := main(); {3180#true} is VALID [2022-04-08 11:21:58,026 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3180#true} {3180#true} #93#return; {3180#true} is VALID [2022-04-08 11:21:58,026 INFO L290 TraceCheckUtils]: 2: Hoare triple {3180#true} assume true; {3180#true} is VALID [2022-04-08 11:21:58,026 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:21:58,026 INFO L272 TraceCheckUtils]: 0: Hoare triple {3180#true} call ULTIMATE.init(); {3180#true} is VALID [2022-04-08 11:21:58,027 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:21:58,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:21:58,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112672001] [2022-04-08 11:21:58,027 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:21:58,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1040306523] [2022-04-08 11:21:58,027 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1040306523] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 11:21:58,027 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 11:21:58,027 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2022-04-08 11:21:58,028 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:21:58,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1847676422] [2022-04-08 11:21:58,028 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1847676422] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:21:58,028 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:21:58,028 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 11:21:58,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800936893] [2022-04-08 11:21:58,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:21:58,029 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:21:58,029 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:21:58,029 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:21:58,059 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:21:58,059 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 11:21:58,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:21:58,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 11:21:58,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-04-08 11:21:58,060 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:21:58,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:21:58,484 INFO L93 Difference]: Finished difference Result 88 states and 110 transitions. [2022-04-08 11:21:58,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 11:21:58,485 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:21:58,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:21:58,485 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:21:58,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 47 transitions. [2022-04-08 11:21:58,486 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:21:58,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 47 transitions. [2022-04-08 11:21:58,488 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 47 transitions. [2022-04-08 11:21:58,529 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:21:58,532 INFO L225 Difference]: With dead ends: 88 [2022-04-08 11:21:58,532 INFO L226 Difference]: Without dead ends: 86 [2022-04-08 11:21:58,532 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:21:58,533 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:21:58,533 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:21:58,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-04-08 11:21:58,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2022-04-08 11:21:58,616 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:21:58,617 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:21:58,617 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:21:58,617 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:21:58,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:21:58,621 INFO L93 Difference]: Finished difference Result 86 states and 108 transitions. [2022-04-08 11:21:58,621 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 108 transitions. [2022-04-08 11:21:58,621 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:21:58,621 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:21:58,621 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:21:58,622 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:21:58,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:21:58,625 INFO L93 Difference]: Finished difference Result 86 states and 108 transitions. [2022-04-08 11:21:58,625 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 108 transitions. [2022-04-08 11:21:58,625 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:21:58,625 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:21:58,625 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:21:58,625 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:21:58,626 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:21:58,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 108 transitions. [2022-04-08 11:21:58,629 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 108 transitions. Word has length 47 [2022-04-08 11:21:58,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:21:58,629 INFO L478 AbstractCegarLoop]: Abstraction has 86 states and 108 transitions. [2022-04-08 11:21:58,630 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:21:58,630 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 86 states and 108 transitions. [2022-04-08 11:21:58,741 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:21:58,741 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 108 transitions. [2022-04-08 11:21:58,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-08 11:21:58,741 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:21:58,742 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:21:58,758 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:21:58,947 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:21:58,947 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:21:58,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:21:58,948 INFO L85 PathProgramCache]: Analyzing trace with hash -589126939, now seen corresponding path program 1 times [2022-04-08 11:21:58,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:21:58,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [826198448] [2022-04-08 11:22:10,491 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 11:22:10,491 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 11:22:10,491 INFO L85 PathProgramCache]: Analyzing trace with hash -589126939, now seen corresponding path program 2 times [2022-04-08 11:22:10,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:22:10,491 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605385957] [2022-04-08 11:22:10,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:22:10,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:22:10,520 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:22:10,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1658864606] [2022-04-08 11:22:10,520 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 11:22:10,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:22:10,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:22:10,522 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:22:10,534 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:22:10,577 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 11:22:10,578 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:22:10,578 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-08 11:22:10,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:22:10,591 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:22:10,845 INFO L272 TraceCheckUtils]: 0: Hoare triple {3997#true} call ULTIMATE.init(); {3997#true} is VALID [2022-04-08 11:22:10,846 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:22:10,846 INFO L290 TraceCheckUtils]: 2: Hoare triple {4005#(<= ~counter~0 0)} assume true; {4005#(<= ~counter~0 0)} is VALID [2022-04-08 11:22:10,846 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4005#(<= ~counter~0 0)} {3997#true} #93#return; {4005#(<= ~counter~0 0)} is VALID [2022-04-08 11:22:10,847 INFO L272 TraceCheckUtils]: 4: Hoare triple {4005#(<= ~counter~0 0)} call #t~ret8 := main(); {4005#(<= ~counter~0 0)} is VALID [2022-04-08 11:22:10,847 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:22:10,848 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:22:10,848 INFO L290 TraceCheckUtils]: 7: Hoare triple {4005#(<= ~counter~0 0)} ~cond := #in~cond; {4005#(<= ~counter~0 0)} is VALID [2022-04-08 11:22:10,849 INFO L290 TraceCheckUtils]: 8: Hoare triple {4005#(<= ~counter~0 0)} assume !(0 == ~cond); {4005#(<= ~counter~0 0)} is VALID [2022-04-08 11:22:10,849 INFO L290 TraceCheckUtils]: 9: Hoare triple {4005#(<= ~counter~0 0)} assume true; {4005#(<= ~counter~0 0)} is VALID [2022-04-08 11:22:10,850 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:22:10,850 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:22:10,851 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:22:10,851 INFO L290 TraceCheckUtils]: 13: Hoare triple {4039#(<= ~counter~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {4039#(<= ~counter~0 1)} is VALID [2022-04-08 11:22:10,851 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:22:10,852 INFO L290 TraceCheckUtils]: 15: Hoare triple {4039#(<= ~counter~0 1)} ~cond := #in~cond; {4039#(<= ~counter~0 1)} is VALID [2022-04-08 11:22:10,852 INFO L290 TraceCheckUtils]: 16: Hoare triple {4039#(<= ~counter~0 1)} assume !(0 == ~cond); {4039#(<= ~counter~0 1)} is VALID [2022-04-08 11:22:10,852 INFO L290 TraceCheckUtils]: 17: Hoare triple {4039#(<= ~counter~0 1)} assume true; {4039#(<= ~counter~0 1)} is VALID [2022-04-08 11:22:10,853 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:22:10,853 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:22:10,854 INFO L290 TraceCheckUtils]: 20: Hoare triple {4039#(<= ~counter~0 1)} ~cond := #in~cond; {4039#(<= ~counter~0 1)} is VALID [2022-04-08 11:22:10,854 INFO L290 TraceCheckUtils]: 21: Hoare triple {4039#(<= ~counter~0 1)} assume !(0 == ~cond); {4039#(<= ~counter~0 1)} is VALID [2022-04-08 11:22:10,854 INFO L290 TraceCheckUtils]: 22: Hoare triple {4039#(<= ~counter~0 1)} assume true; {4039#(<= ~counter~0 1)} is VALID [2022-04-08 11:22:10,856 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:22:10,856 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:22:10,857 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:22:10,858 INFO L290 TraceCheckUtils]: 26: Hoare triple {4079#(<= ~counter~0 2)} assume !!(#t~post7 < 20);havoc #t~post7; {4079#(<= ~counter~0 2)} is VALID [2022-04-08 11:22:10,859 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:22:10,859 INFO L290 TraceCheckUtils]: 28: Hoare triple {4079#(<= ~counter~0 2)} ~cond := #in~cond; {4079#(<= ~counter~0 2)} is VALID [2022-04-08 11:22:10,859 INFO L290 TraceCheckUtils]: 29: Hoare triple {4079#(<= ~counter~0 2)} assume !(0 == ~cond); {4079#(<= ~counter~0 2)} is VALID [2022-04-08 11:22:10,860 INFO L290 TraceCheckUtils]: 30: Hoare triple {4079#(<= ~counter~0 2)} assume true; {4079#(<= ~counter~0 2)} is VALID [2022-04-08 11:22:10,860 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:22:10,861 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:22:10,861 INFO L290 TraceCheckUtils]: 33: Hoare triple {4079#(<= ~counter~0 2)} ~cond := #in~cond; {4079#(<= ~counter~0 2)} is VALID [2022-04-08 11:22:10,862 INFO L290 TraceCheckUtils]: 34: Hoare triple {4079#(<= ~counter~0 2)} assume !(0 == ~cond); {4079#(<= ~counter~0 2)} is VALID [2022-04-08 11:22:10,862 INFO L290 TraceCheckUtils]: 35: Hoare triple {4079#(<= ~counter~0 2)} assume true; {4079#(<= ~counter~0 2)} is VALID [2022-04-08 11:22:10,863 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:22:10,863 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:22:10,864 INFO L290 TraceCheckUtils]: 38: Hoare triple {4079#(<= ~counter~0 2)} ~cond := #in~cond; {4079#(<= ~counter~0 2)} is VALID [2022-04-08 11:22:10,864 INFO L290 TraceCheckUtils]: 39: Hoare triple {4079#(<= ~counter~0 2)} assume !(0 == ~cond); {4079#(<= ~counter~0 2)} is VALID [2022-04-08 11:22:10,864 INFO L290 TraceCheckUtils]: 40: Hoare triple {4079#(<= ~counter~0 2)} assume true; {4079#(<= ~counter~0 2)} is VALID [2022-04-08 11:22:10,865 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:22:10,866 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:22:10,866 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:22:10,867 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:22:10,867 INFO L290 TraceCheckUtils]: 45: Hoare triple {4137#(<= |main_#t~post6| 2)} assume !(#t~post6 < 20);havoc #t~post6; {3998#false} is VALID [2022-04-08 11:22:10,867 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:22:10,867 INFO L290 TraceCheckUtils]: 47: Hoare triple {3998#false} ~cond := #in~cond; {3998#false} is VALID [2022-04-08 11:22:10,867 INFO L290 TraceCheckUtils]: 48: Hoare triple {3998#false} assume 0 == ~cond; {3998#false} is VALID [2022-04-08 11:22:10,868 INFO L290 TraceCheckUtils]: 49: Hoare triple {3998#false} assume !false; {3998#false} is VALID [2022-04-08 11:22:10,868 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:22:10,868 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 11:22:11,148 INFO L290 TraceCheckUtils]: 49: Hoare triple {3998#false} assume !false; {3998#false} is VALID [2022-04-08 11:22:11,149 INFO L290 TraceCheckUtils]: 48: Hoare triple {3998#false} assume 0 == ~cond; {3998#false} is VALID [2022-04-08 11:22:11,149 INFO L290 TraceCheckUtils]: 47: Hoare triple {3998#false} ~cond := #in~cond; {3998#false} is VALID [2022-04-08 11:22:11,149 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:22:11,149 INFO L290 TraceCheckUtils]: 45: Hoare triple {4165#(< |main_#t~post6| 20)} assume !(#t~post6 < 20);havoc #t~post6; {3998#false} is VALID [2022-04-08 11:22:11,150 INFO L290 TraceCheckUtils]: 44: Hoare triple {4169#(< ~counter~0 20)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4165#(< |main_#t~post6| 20)} is VALID [2022-04-08 11:22:11,150 INFO L290 TraceCheckUtils]: 43: Hoare triple {4169#(< ~counter~0 20)} ~r~0 := ~r~0 - ~b~0;~q~0 := ~q~0 + ~a~0; {4169#(< ~counter~0 20)} is VALID [2022-04-08 11:22:11,150 INFO L290 TraceCheckUtils]: 42: Hoare triple {4169#(< ~counter~0 20)} assume !(~r~0 >= 2 * ~b~0); {4169#(< ~counter~0 20)} is VALID [2022-04-08 11:22:11,151 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {3997#true} {4169#(< ~counter~0 20)} #87#return; {4169#(< ~counter~0 20)} is VALID [2022-04-08 11:22:11,151 INFO L290 TraceCheckUtils]: 40: Hoare triple {3997#true} assume true; {3997#true} is VALID [2022-04-08 11:22:11,151 INFO L290 TraceCheckUtils]: 39: Hoare triple {3997#true} assume !(0 == ~cond); {3997#true} is VALID [2022-04-08 11:22:11,151 INFO L290 TraceCheckUtils]: 38: Hoare triple {3997#true} ~cond := #in~cond; {3997#true} is VALID [2022-04-08 11:22:11,151 INFO L272 TraceCheckUtils]: 37: Hoare triple {4169#(< ~counter~0 20)} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {3997#true} is VALID [2022-04-08 11:22:11,152 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {3997#true} {4169#(< ~counter~0 20)} #85#return; {4169#(< ~counter~0 20)} is VALID [2022-04-08 11:22:11,152 INFO L290 TraceCheckUtils]: 35: Hoare triple {3997#true} assume true; {3997#true} is VALID [2022-04-08 11:22:11,152 INFO L290 TraceCheckUtils]: 34: Hoare triple {3997#true} assume !(0 == ~cond); {3997#true} is VALID [2022-04-08 11:22:11,152 INFO L290 TraceCheckUtils]: 33: Hoare triple {3997#true} ~cond := #in~cond; {3997#true} is VALID [2022-04-08 11:22:11,152 INFO L272 TraceCheckUtils]: 32: Hoare triple {4169#(< ~counter~0 20)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {3997#true} is VALID [2022-04-08 11:22:11,153 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {3997#true} {4169#(< ~counter~0 20)} #83#return; {4169#(< ~counter~0 20)} is VALID [2022-04-08 11:22:11,153 INFO L290 TraceCheckUtils]: 30: Hoare triple {3997#true} assume true; {3997#true} is VALID [2022-04-08 11:22:11,153 INFO L290 TraceCheckUtils]: 29: Hoare triple {3997#true} assume !(0 == ~cond); {3997#true} is VALID [2022-04-08 11:22:11,153 INFO L290 TraceCheckUtils]: 28: Hoare triple {3997#true} ~cond := #in~cond; {3997#true} is VALID [2022-04-08 11:22:11,153 INFO L272 TraceCheckUtils]: 27: Hoare triple {4169#(< ~counter~0 20)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {3997#true} is VALID [2022-04-08 11:22:11,154 INFO L290 TraceCheckUtils]: 26: Hoare triple {4169#(< ~counter~0 20)} assume !!(#t~post7 < 20);havoc #t~post7; {4169#(< ~counter~0 20)} is VALID [2022-04-08 11:22:11,154 INFO L290 TraceCheckUtils]: 25: Hoare triple {4227#(< ~counter~0 19)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {4169#(< ~counter~0 20)} is VALID [2022-04-08 11:22:11,155 INFO L290 TraceCheckUtils]: 24: Hoare triple {4227#(< ~counter~0 19)} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {4227#(< ~counter~0 19)} is VALID [2022-04-08 11:22:11,155 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {3997#true} {4227#(< ~counter~0 19)} #81#return; {4227#(< ~counter~0 19)} is VALID [2022-04-08 11:22:11,156 INFO L290 TraceCheckUtils]: 22: Hoare triple {3997#true} assume true; {3997#true} is VALID [2022-04-08 11:22:11,156 INFO L290 TraceCheckUtils]: 21: Hoare triple {3997#true} assume !(0 == ~cond); {3997#true} is VALID [2022-04-08 11:22:11,156 INFO L290 TraceCheckUtils]: 20: Hoare triple {3997#true} ~cond := #in~cond; {3997#true} is VALID [2022-04-08 11:22:11,156 INFO L272 TraceCheckUtils]: 19: Hoare triple {4227#(< ~counter~0 19)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {3997#true} is VALID [2022-04-08 11:22:11,156 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {3997#true} {4227#(< ~counter~0 19)} #79#return; {4227#(< ~counter~0 19)} is VALID [2022-04-08 11:22:11,156 INFO L290 TraceCheckUtils]: 17: Hoare triple {3997#true} assume true; {3997#true} is VALID [2022-04-08 11:22:11,157 INFO L290 TraceCheckUtils]: 16: Hoare triple {3997#true} assume !(0 == ~cond); {3997#true} is VALID [2022-04-08 11:22:11,157 INFO L290 TraceCheckUtils]: 15: Hoare triple {3997#true} ~cond := #in~cond; {3997#true} is VALID [2022-04-08 11:22:11,157 INFO L272 TraceCheckUtils]: 14: Hoare triple {4227#(< ~counter~0 19)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {3997#true} is VALID [2022-04-08 11:22:11,157 INFO L290 TraceCheckUtils]: 13: Hoare triple {4227#(< ~counter~0 19)} assume !!(#t~post6 < 20);havoc #t~post6; {4227#(< ~counter~0 19)} is VALID [2022-04-08 11:22:11,158 INFO L290 TraceCheckUtils]: 12: Hoare triple {4267#(< ~counter~0 18)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4227#(< ~counter~0 19)} is VALID [2022-04-08 11:22:11,158 INFO L290 TraceCheckUtils]: 11: Hoare triple {4267#(< ~counter~0 18)} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {4267#(< ~counter~0 18)} is VALID [2022-04-08 11:22:11,159 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3997#true} {4267#(< ~counter~0 18)} #77#return; {4267#(< ~counter~0 18)} is VALID [2022-04-08 11:22:11,159 INFO L290 TraceCheckUtils]: 9: Hoare triple {3997#true} assume true; {3997#true} is VALID [2022-04-08 11:22:11,159 INFO L290 TraceCheckUtils]: 8: Hoare triple {3997#true} assume !(0 == ~cond); {3997#true} is VALID [2022-04-08 11:22:11,159 INFO L290 TraceCheckUtils]: 7: Hoare triple {3997#true} ~cond := #in~cond; {3997#true} is VALID [2022-04-08 11:22:11,159 INFO L272 TraceCheckUtils]: 6: Hoare triple {4267#(< ~counter~0 18)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {3997#true} is VALID [2022-04-08 11:22:11,162 INFO L290 TraceCheckUtils]: 5: Hoare triple {4267#(< ~counter~0 18)} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {4267#(< ~counter~0 18)} is VALID [2022-04-08 11:22:11,163 INFO L272 TraceCheckUtils]: 4: Hoare triple {4267#(< ~counter~0 18)} call #t~ret8 := main(); {4267#(< ~counter~0 18)} is VALID [2022-04-08 11:22:11,165 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4267#(< ~counter~0 18)} {3997#true} #93#return; {4267#(< ~counter~0 18)} is VALID [2022-04-08 11:22:11,165 INFO L290 TraceCheckUtils]: 2: Hoare triple {4267#(< ~counter~0 18)} assume true; {4267#(< ~counter~0 18)} is VALID [2022-04-08 11:22:11,166 INFO L290 TraceCheckUtils]: 1: Hoare triple {3997#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {4267#(< ~counter~0 18)} is VALID [2022-04-08 11:22:11,167 INFO L272 TraceCheckUtils]: 0: Hoare triple {3997#true} call ULTIMATE.init(); {3997#true} is VALID [2022-04-08 11:22:11,167 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:22:11,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:22:11,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605385957] [2022-04-08 11:22:11,167 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:22:11,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1658864606] [2022-04-08 11:22:11,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1658864606] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 11:22:11,167 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 11:22:11,167 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-04-08 11:22:11,168 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:22:11,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [826198448] [2022-04-08 11:22:11,168 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [826198448] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:22:11,168 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:22:11,168 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 11:22:11,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572061017] [2022-04-08 11:22:11,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:22:11,169 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:22:11,169 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:22:11,169 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:22:11,246 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:22:11,246 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 11:22:11,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:22:11,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 11:22:11,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-08 11:22:11,247 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:22:11,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:22:11,509 INFO L93 Difference]: Finished difference Result 115 states and 134 transitions. [2022-04-08 11:22:11,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 11:22:11,509 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:22:11,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:22:11,510 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:22:11,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 79 transitions. [2022-04-08 11:22:11,511 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:22:11,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 79 transitions. [2022-04-08 11:22:11,513 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 79 transitions. [2022-04-08 11:22:11,580 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:22:11,582 INFO L225 Difference]: With dead ends: 115 [2022-04-08 11:22:11,582 INFO L226 Difference]: Without dead ends: 108 [2022-04-08 11:22:11,583 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:22:11,583 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:22:11,583 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:22:11,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2022-04-08 11:22:11,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 106. [2022-04-08 11:22:11,702 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:22:11,702 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:22:11,704 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:22:11,704 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:22:11,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:22:11,711 INFO L93 Difference]: Finished difference Result 108 states and 127 transitions. [2022-04-08 11:22:11,711 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 127 transitions. [2022-04-08 11:22:11,712 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:22:11,712 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:22:11,712 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:22:11,713 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:22:11,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:22:11,717 INFO L93 Difference]: Finished difference Result 108 states and 127 transitions. [2022-04-08 11:22:11,717 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 127 transitions. [2022-04-08 11:22:11,717 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:22:11,717 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:22:11,717 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:22:11,717 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:22:11,718 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:22:11,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 125 transitions. [2022-04-08 11:22:11,720 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 125 transitions. Word has length 50 [2022-04-08 11:22:11,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:22:11,720 INFO L478 AbstractCegarLoop]: Abstraction has 106 states and 125 transitions. [2022-04-08 11:22:11,721 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:22:11,721 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 106 states and 125 transitions. [2022-04-08 11:22:11,868 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:22:11,869 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 125 transitions. [2022-04-08 11:22:11,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-04-08 11:22:11,869 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:22:11,869 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:22:11,895 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:22:12,070 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:22:12,070 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:22:12,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:22:12,071 INFO L85 PathProgramCache]: Analyzing trace with hash -484699953, now seen corresponding path program 1 times [2022-04-08 11:22:12,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:22:12,071 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1622776701] [2022-04-08 11:22:24,138 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 11:22:24,138 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 11:22:24,138 INFO L85 PathProgramCache]: Analyzing trace with hash -484699953, now seen corresponding path program 2 times [2022-04-08 11:22:24,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:22:24,139 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792546730] [2022-04-08 11:22:24,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:22:24,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:22:24,150 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:22:24,151 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1794219521] [2022-04-08 11:22:24,151 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 11:22:24,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:22:24,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:22:24,155 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:22:24,160 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:22:24,203 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 11:22:24,203 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:22:24,204 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-08 11:22:24,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:22:24,214 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:22:24,517 INFO L272 TraceCheckUtils]: 0: Hoare triple {4966#true} call ULTIMATE.init(); {4966#true} is VALID [2022-04-08 11:22:24,517 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:22:24,517 INFO L290 TraceCheckUtils]: 2: Hoare triple {4966#true} assume true; {4966#true} is VALID [2022-04-08 11:22:24,517 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4966#true} {4966#true} #93#return; {4966#true} is VALID [2022-04-08 11:22:24,518 INFO L272 TraceCheckUtils]: 4: Hoare triple {4966#true} call #t~ret8 := main(); {4966#true} is VALID [2022-04-08 11:22:24,518 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:22:24,518 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:22:24,518 INFO L290 TraceCheckUtils]: 7: Hoare triple {4966#true} ~cond := #in~cond; {4966#true} is VALID [2022-04-08 11:22:24,518 INFO L290 TraceCheckUtils]: 8: Hoare triple {4966#true} assume !(0 == ~cond); {4966#true} is VALID [2022-04-08 11:22:24,518 INFO L290 TraceCheckUtils]: 9: Hoare triple {4966#true} assume true; {4966#true} is VALID [2022-04-08 11:22:24,518 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4966#true} {4966#true} #77#return; {4966#true} is VALID [2022-04-08 11:22:24,518 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:22:24,519 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:22:24,519 INFO L290 TraceCheckUtils]: 13: Hoare triple {5004#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} assume !!(#t~post6 < 20);havoc #t~post6; {5004#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 11:22:24,519 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:22:24,519 INFO L290 TraceCheckUtils]: 15: Hoare triple {4966#true} ~cond := #in~cond; {4966#true} is VALID [2022-04-08 11:22:24,520 INFO L290 TraceCheckUtils]: 16: Hoare triple {4966#true} assume !(0 == ~cond); {4966#true} is VALID [2022-04-08 11:22:24,520 INFO L290 TraceCheckUtils]: 17: Hoare triple {4966#true} assume true; {4966#true} is VALID [2022-04-08 11:22:24,520 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:22:24,520 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:22:24,524 INFO L290 TraceCheckUtils]: 20: Hoare triple {4966#true} ~cond := #in~cond; {4966#true} is VALID [2022-04-08 11:22:24,524 INFO L290 TraceCheckUtils]: 21: Hoare triple {4966#true} assume !(0 == ~cond); {4966#true} is VALID [2022-04-08 11:22:24,524 INFO L290 TraceCheckUtils]: 22: Hoare triple {4966#true} assume true; {4966#true} is VALID [2022-04-08 11:22:24,525 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:22:24,525 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:22:24,526 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:22:24,526 INFO L290 TraceCheckUtils]: 26: Hoare triple {5044#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} assume !!(#t~post7 < 20);havoc #t~post7; {5044#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-08 11:22:24,526 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:22:24,527 INFO L290 TraceCheckUtils]: 28: Hoare triple {4966#true} ~cond := #in~cond; {4966#true} is VALID [2022-04-08 11:22:24,527 INFO L290 TraceCheckUtils]: 29: Hoare triple {4966#true} assume !(0 == ~cond); {4966#true} is VALID [2022-04-08 11:22:24,527 INFO L290 TraceCheckUtils]: 30: Hoare triple {4966#true} assume true; {4966#true} is VALID [2022-04-08 11:22:24,528 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:22:24,528 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:22:24,528 INFO L290 TraceCheckUtils]: 33: Hoare triple {4966#true} ~cond := #in~cond; {4966#true} is VALID [2022-04-08 11:22:24,528 INFO L290 TraceCheckUtils]: 34: Hoare triple {4966#true} assume !(0 == ~cond); {4966#true} is VALID [2022-04-08 11:22:24,528 INFO L290 TraceCheckUtils]: 35: Hoare triple {4966#true} assume true; {4966#true} is VALID [2022-04-08 11:22:24,529 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:22:24,529 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:22:24,529 INFO L290 TraceCheckUtils]: 38: Hoare triple {4966#true} ~cond := #in~cond; {4966#true} is VALID [2022-04-08 11:22:24,529 INFO L290 TraceCheckUtils]: 39: Hoare triple {4966#true} assume !(0 == ~cond); {4966#true} is VALID [2022-04-08 11:22:24,529 INFO L290 TraceCheckUtils]: 40: Hoare triple {4966#true} assume true; {4966#true} is VALID [2022-04-08 11:22:24,530 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:22:24,530 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:22:24,531 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:22:24,531 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:22:24,531 INFO L290 TraceCheckUtils]: 45: Hoare triple {5102#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~r~0) (= main_~q~0 1))} assume !!(#t~post6 < 20);havoc #t~post6; {5102#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~r~0) (= main_~q~0 1))} is VALID [2022-04-08 11:22:24,531 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:22:24,532 INFO L290 TraceCheckUtils]: 47: Hoare triple {4966#true} ~cond := #in~cond; {4966#true} is VALID [2022-04-08 11:22:24,532 INFO L290 TraceCheckUtils]: 48: Hoare triple {4966#true} assume !(0 == ~cond); {4966#true} is VALID [2022-04-08 11:22:24,532 INFO L290 TraceCheckUtils]: 49: Hoare triple {4966#true} assume true; {4966#true} is VALID [2022-04-08 11:22:24,533 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:22:24,534 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:22:24,534 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:22:24,535 INFO L290 TraceCheckUtils]: 53: Hoare triple {5131#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4967#false} is VALID [2022-04-08 11:22:24,535 INFO L290 TraceCheckUtils]: 54: Hoare triple {4967#false} assume !false; {4967#false} is VALID [2022-04-08 11:22:24,536 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:22:24,536 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 11:22:40,666 INFO L290 TraceCheckUtils]: 54: Hoare triple {4967#false} assume !false; {4967#false} is VALID [2022-04-08 11:22:40,667 INFO L290 TraceCheckUtils]: 53: Hoare triple {5131#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4967#false} is VALID [2022-04-08 11:22:40,667 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:22:40,668 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:22:40,669 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:22:40,669 INFO L290 TraceCheckUtils]: 49: Hoare triple {4966#true} assume true; {4966#true} is VALID [2022-04-08 11:22:40,669 INFO L290 TraceCheckUtils]: 48: Hoare triple {4966#true} assume !(0 == ~cond); {4966#true} is VALID [2022-04-08 11:22:40,669 INFO L290 TraceCheckUtils]: 47: Hoare triple {4966#true} ~cond := #in~cond; {4966#true} is VALID [2022-04-08 11:22:40,669 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:22:40,669 INFO L290 TraceCheckUtils]: 45: Hoare triple {5147#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} assume !!(#t~post6 < 20);havoc #t~post6; {5147#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-08 11:22:40,670 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:22:40,679 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:22:40,680 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:22:40,680 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:22:40,680 INFO L290 TraceCheckUtils]: 40: Hoare triple {4966#true} assume true; {4966#true} is VALID [2022-04-08 11:22:40,681 INFO L290 TraceCheckUtils]: 39: Hoare triple {4966#true} assume !(0 == ~cond); {4966#true} is VALID [2022-04-08 11:22:40,681 INFO L290 TraceCheckUtils]: 38: Hoare triple {4966#true} ~cond := #in~cond; {4966#true} is VALID [2022-04-08 11:22:40,681 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:22:40,681 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:22:40,682 INFO L290 TraceCheckUtils]: 35: Hoare triple {4966#true} assume true; {4966#true} is VALID [2022-04-08 11:22:40,682 INFO L290 TraceCheckUtils]: 34: Hoare triple {4966#true} assume !(0 == ~cond); {4966#true} is VALID [2022-04-08 11:22:40,682 INFO L290 TraceCheckUtils]: 33: Hoare triple {4966#true} ~cond := #in~cond; {4966#true} is VALID [2022-04-08 11:22:40,682 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:22:40,682 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:22:40,683 INFO L290 TraceCheckUtils]: 30: Hoare triple {4966#true} assume true; {4966#true} is VALID [2022-04-08 11:22:40,683 INFO L290 TraceCheckUtils]: 29: Hoare triple {4966#true} assume !(0 == ~cond); {4966#true} is VALID [2022-04-08 11:22:40,683 INFO L290 TraceCheckUtils]: 28: Hoare triple {4966#true} ~cond := #in~cond; {4966#true} is VALID [2022-04-08 11:22:40,683 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:22:40,683 INFO L290 TraceCheckUtils]: 26: Hoare triple {5172#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} assume !!(#t~post7 < 20);havoc #t~post7; {5172#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} is VALID [2022-04-08 11:22:40,684 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:22:40,684 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:22:40,685 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:22:40,685 INFO L290 TraceCheckUtils]: 22: Hoare triple {4966#true} assume true; {4966#true} is VALID [2022-04-08 11:22:40,685 INFO L290 TraceCheckUtils]: 21: Hoare triple {4966#true} assume !(0 == ~cond); {4966#true} is VALID [2022-04-08 11:22:40,685 INFO L290 TraceCheckUtils]: 20: Hoare triple {4966#true} ~cond := #in~cond; {4966#true} is VALID [2022-04-08 11:22:40,685 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:22:40,686 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:22:40,686 INFO L290 TraceCheckUtils]: 17: Hoare triple {4966#true} assume true; {4966#true} is VALID [2022-04-08 11:22:40,686 INFO L290 TraceCheckUtils]: 16: Hoare triple {4966#true} assume !(0 == ~cond); {4966#true} is VALID [2022-04-08 11:22:40,686 INFO L290 TraceCheckUtils]: 15: Hoare triple {4966#true} ~cond := #in~cond; {4966#true} is VALID [2022-04-08 11:22:40,686 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:22:40,687 INFO L290 TraceCheckUtils]: 13: Hoare triple {5004#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} assume !!(#t~post6 < 20);havoc #t~post6; {5004#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 11:22:40,687 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:22:40,688 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:22:40,688 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4966#true} {4966#true} #77#return; {4966#true} is VALID [2022-04-08 11:22:40,688 INFO L290 TraceCheckUtils]: 9: Hoare triple {4966#true} assume true; {4966#true} is VALID [2022-04-08 11:22:40,688 INFO L290 TraceCheckUtils]: 8: Hoare triple {4966#true} assume !(0 == ~cond); {4966#true} is VALID [2022-04-08 11:22:40,688 INFO L290 TraceCheckUtils]: 7: Hoare triple {4966#true} ~cond := #in~cond; {4966#true} is VALID [2022-04-08 11:22:40,688 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:22:40,688 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:22:40,688 INFO L272 TraceCheckUtils]: 4: Hoare triple {4966#true} call #t~ret8 := main(); {4966#true} is VALID [2022-04-08 11:22:40,689 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4966#true} {4966#true} #93#return; {4966#true} is VALID [2022-04-08 11:22:40,689 INFO L290 TraceCheckUtils]: 2: Hoare triple {4966#true} assume true; {4966#true} is VALID [2022-04-08 11:22:40,689 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:22:40,689 INFO L272 TraceCheckUtils]: 0: Hoare triple {4966#true} call ULTIMATE.init(); {4966#true} is VALID [2022-04-08 11:22:40,689 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:22:40,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:22:40,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792546730] [2022-04-08 11:22:40,689 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:22:40,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1794219521] [2022-04-08 11:22:40,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1794219521] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 11:22:40,690 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 11:22:40,690 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2022-04-08 11:22:40,690 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:22:40,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1622776701] [2022-04-08 11:22:40,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1622776701] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:22:40,690 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:22:40,690 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 11:22:40,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345550742] [2022-04-08 11:22:40,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:22:40,691 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:22:40,691 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:22:40,691 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:22:40,728 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:22:40,728 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 11:22:40,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:22:40,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 11:22:40,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-04-08 11:22:40,728 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:22:41,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:22:41,463 INFO L93 Difference]: Finished difference Result 134 states and 166 transitions. [2022-04-08 11:22:41,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 11:22:41,464 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:22:41,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:22:41,464 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:22:41,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 107 transitions. [2022-04-08 11:22:41,466 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:22:41,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 107 transitions. [2022-04-08 11:22:41,468 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 107 transitions. [2022-04-08 11:22:41,580 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:22:41,583 INFO L225 Difference]: With dead ends: 134 [2022-04-08 11:22:41,583 INFO L226 Difference]: Without dead ends: 131 [2022-04-08 11:22:41,584 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:22:41,584 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:22:41,584 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:22:41,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2022-04-08 11:22:41,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 127. [2022-04-08 11:22:41,715 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:22:41,715 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:22:41,715 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:22:41,715 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:22:41,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:22:41,724 INFO L93 Difference]: Finished difference Result 131 states and 162 transitions. [2022-04-08 11:22:41,724 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 162 transitions. [2022-04-08 11:22:41,724 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:22:41,724 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:22:41,725 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:22:41,725 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:22:41,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:22:41,730 INFO L93 Difference]: Finished difference Result 131 states and 162 transitions. [2022-04-08 11:22:41,730 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 162 transitions. [2022-04-08 11:22:41,731 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:22:41,731 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:22:41,731 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:22:41,731 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:22:41,732 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:22:41,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 158 transitions. [2022-04-08 11:22:41,743 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 158 transitions. Word has length 55 [2022-04-08 11:22:41,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:22:41,743 INFO L478 AbstractCegarLoop]: Abstraction has 127 states and 158 transitions. [2022-04-08 11:22:41,743 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:22:41,744 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 127 states and 158 transitions. [2022-04-08 11:22:41,912 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:22:41,913 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 158 transitions. [2022-04-08 11:22:41,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-04-08 11:22:41,916 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:22:41,916 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:22:41,933 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-04-08 11:22:42,117 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:22:42,117 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:22:42,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:22:42,118 INFO L85 PathProgramCache]: Analyzing trace with hash 765609565, now seen corresponding path program 1 times [2022-04-08 11:22:42,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:22:42,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [794024241] [2022-04-08 11:22:50,821 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 11:22:50,821 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 11:22:50,822 INFO L85 PathProgramCache]: Analyzing trace with hash 765609565, now seen corresponding path program 2 times [2022-04-08 11:22:50,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:22:50,822 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335891914] [2022-04-08 11:22:50,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:22:50,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:22:50,834 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:22:50,834 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1015292661] [2022-04-08 11:22:50,835 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 11:22:50,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:22:50,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:22:50,839 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:22:50,856 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:22:50,889 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 11:22:50,890 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:22:50,890 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-08 11:22:50,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:22:50,904 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:22:51,152 INFO L272 TraceCheckUtils]: 0: Hoare triple {6090#true} call ULTIMATE.init(); {6090#true} is VALID [2022-04-08 11:22:51,153 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:22:51,154 INFO L290 TraceCheckUtils]: 2: Hoare triple {6098#(<= ~counter~0 0)} assume true; {6098#(<= ~counter~0 0)} is VALID [2022-04-08 11:22:51,154 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6098#(<= ~counter~0 0)} {6090#true} #93#return; {6098#(<= ~counter~0 0)} is VALID [2022-04-08 11:22:51,155 INFO L272 TraceCheckUtils]: 4: Hoare triple {6098#(<= ~counter~0 0)} call #t~ret8 := main(); {6098#(<= ~counter~0 0)} is VALID [2022-04-08 11:22:51,155 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:22:51,155 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:22:51,156 INFO L290 TraceCheckUtils]: 7: Hoare triple {6098#(<= ~counter~0 0)} ~cond := #in~cond; {6098#(<= ~counter~0 0)} is VALID [2022-04-08 11:22:51,156 INFO L290 TraceCheckUtils]: 8: Hoare triple {6098#(<= ~counter~0 0)} assume !(0 == ~cond); {6098#(<= ~counter~0 0)} is VALID [2022-04-08 11:22:51,156 INFO L290 TraceCheckUtils]: 9: Hoare triple {6098#(<= ~counter~0 0)} assume true; {6098#(<= ~counter~0 0)} is VALID [2022-04-08 11:22:51,157 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:22:51,157 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:22:51,158 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:22:51,158 INFO L290 TraceCheckUtils]: 13: Hoare triple {6132#(<= ~counter~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {6132#(<= ~counter~0 1)} is VALID [2022-04-08 11:22:51,161 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:22:51,161 INFO L290 TraceCheckUtils]: 15: Hoare triple {6132#(<= ~counter~0 1)} ~cond := #in~cond; {6132#(<= ~counter~0 1)} is VALID [2022-04-08 11:22:51,161 INFO L290 TraceCheckUtils]: 16: Hoare triple {6132#(<= ~counter~0 1)} assume !(0 == ~cond); {6132#(<= ~counter~0 1)} is VALID [2022-04-08 11:22:51,162 INFO L290 TraceCheckUtils]: 17: Hoare triple {6132#(<= ~counter~0 1)} assume true; {6132#(<= ~counter~0 1)} is VALID [2022-04-08 11:22:51,162 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:22:51,163 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:22:51,163 INFO L290 TraceCheckUtils]: 20: Hoare triple {6132#(<= ~counter~0 1)} ~cond := #in~cond; {6132#(<= ~counter~0 1)} is VALID [2022-04-08 11:22:51,163 INFO L290 TraceCheckUtils]: 21: Hoare triple {6132#(<= ~counter~0 1)} assume !(0 == ~cond); {6132#(<= ~counter~0 1)} is VALID [2022-04-08 11:22:51,164 INFO L290 TraceCheckUtils]: 22: Hoare triple {6132#(<= ~counter~0 1)} assume true; {6132#(<= ~counter~0 1)} is VALID [2022-04-08 11:22:51,164 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:22:51,165 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:22:51,165 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:22:51,166 INFO L290 TraceCheckUtils]: 26: Hoare triple {6172#(<= ~counter~0 2)} assume !!(#t~post7 < 20);havoc #t~post7; {6172#(<= ~counter~0 2)} is VALID [2022-04-08 11:22:51,166 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:22:51,166 INFO L290 TraceCheckUtils]: 28: Hoare triple {6172#(<= ~counter~0 2)} ~cond := #in~cond; {6172#(<= ~counter~0 2)} is VALID [2022-04-08 11:22:51,167 INFO L290 TraceCheckUtils]: 29: Hoare triple {6172#(<= ~counter~0 2)} assume !(0 == ~cond); {6172#(<= ~counter~0 2)} is VALID [2022-04-08 11:22:51,167 INFO L290 TraceCheckUtils]: 30: Hoare triple {6172#(<= ~counter~0 2)} assume true; {6172#(<= ~counter~0 2)} is VALID [2022-04-08 11:22:51,168 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:22:51,168 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:22:51,169 INFO L290 TraceCheckUtils]: 33: Hoare triple {6172#(<= ~counter~0 2)} ~cond := #in~cond; {6172#(<= ~counter~0 2)} is VALID [2022-04-08 11:22:51,169 INFO L290 TraceCheckUtils]: 34: Hoare triple {6172#(<= ~counter~0 2)} assume !(0 == ~cond); {6172#(<= ~counter~0 2)} is VALID [2022-04-08 11:22:51,169 INFO L290 TraceCheckUtils]: 35: Hoare triple {6172#(<= ~counter~0 2)} assume true; {6172#(<= ~counter~0 2)} is VALID [2022-04-08 11:22:51,170 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:22:51,170 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:22:51,171 INFO L290 TraceCheckUtils]: 38: Hoare triple {6172#(<= ~counter~0 2)} ~cond := #in~cond; {6172#(<= ~counter~0 2)} is VALID [2022-04-08 11:22:51,171 INFO L290 TraceCheckUtils]: 39: Hoare triple {6172#(<= ~counter~0 2)} assume !(0 == ~cond); {6172#(<= ~counter~0 2)} is VALID [2022-04-08 11:22:51,171 INFO L290 TraceCheckUtils]: 40: Hoare triple {6172#(<= ~counter~0 2)} assume true; {6172#(<= ~counter~0 2)} is VALID [2022-04-08 11:22:51,172 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:22:51,172 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:22:51,173 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:22:51,173 INFO L290 TraceCheckUtils]: 44: Hoare triple {6172#(<= ~counter~0 2)} ~cond := #in~cond; {6172#(<= ~counter~0 2)} is VALID [2022-04-08 11:22:51,173 INFO L290 TraceCheckUtils]: 45: Hoare triple {6172#(<= ~counter~0 2)} assume !(0 == ~cond); {6172#(<= ~counter~0 2)} is VALID [2022-04-08 11:22:51,174 INFO L290 TraceCheckUtils]: 46: Hoare triple {6172#(<= ~counter~0 2)} assume true; {6172#(<= ~counter~0 2)} is VALID [2022-04-08 11:22:51,174 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:22:51,175 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:22:51,175 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:22:51,175 INFO L290 TraceCheckUtils]: 50: Hoare triple {6245#(<= |main_#t~post7| 2)} assume !(#t~post7 < 20);havoc #t~post7; {6091#false} is VALID [2022-04-08 11:22:51,176 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:22:51,176 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:22:51,176 INFO L290 TraceCheckUtils]: 53: Hoare triple {6091#false} assume !(#t~post6 < 20);havoc #t~post6; {6091#false} is VALID [2022-04-08 11:22:51,176 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:22:51,176 INFO L290 TraceCheckUtils]: 55: Hoare triple {6091#false} ~cond := #in~cond; {6091#false} is VALID [2022-04-08 11:22:51,176 INFO L290 TraceCheckUtils]: 56: Hoare triple {6091#false} assume 0 == ~cond; {6091#false} is VALID [2022-04-08 11:22:51,176 INFO L290 TraceCheckUtils]: 57: Hoare triple {6091#false} assume !false; {6091#false} is VALID [2022-04-08 11:22:51,176 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:22:51,176 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 11:22:51,422 INFO L290 TraceCheckUtils]: 57: Hoare triple {6091#false} assume !false; {6091#false} is VALID [2022-04-08 11:22:51,423 INFO L290 TraceCheckUtils]: 56: Hoare triple {6091#false} assume 0 == ~cond; {6091#false} is VALID [2022-04-08 11:22:51,423 INFO L290 TraceCheckUtils]: 55: Hoare triple {6091#false} ~cond := #in~cond; {6091#false} is VALID [2022-04-08 11:22:51,423 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:22:51,423 INFO L290 TraceCheckUtils]: 53: Hoare triple {6091#false} assume !(#t~post6 < 20);havoc #t~post6; {6091#false} is VALID [2022-04-08 11:22:51,423 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:22:51,423 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:22:51,423 INFO L290 TraceCheckUtils]: 50: Hoare triple {6291#(< |main_#t~post7| 20)} assume !(#t~post7 < 20);havoc #t~post7; {6091#false} is VALID [2022-04-08 11:22:51,424 INFO L290 TraceCheckUtils]: 49: Hoare triple {6295#(< ~counter~0 20)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {6291#(< |main_#t~post7| 20)} is VALID [2022-04-08 11:22:51,424 INFO L290 TraceCheckUtils]: 48: Hoare triple {6295#(< ~counter~0 20)} ~a~0 := 2 * ~a~0;~b~0 := 2 * ~b~0; {6295#(< ~counter~0 20)} is VALID [2022-04-08 11:22:51,424 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {6090#true} {6295#(< ~counter~0 20)} #89#return; {6295#(< ~counter~0 20)} is VALID [2022-04-08 11:22:51,424 INFO L290 TraceCheckUtils]: 46: Hoare triple {6090#true} assume true; {6090#true} is VALID [2022-04-08 11:22:51,425 INFO L290 TraceCheckUtils]: 45: Hoare triple {6090#true} assume !(0 == ~cond); {6090#true} is VALID [2022-04-08 11:22:51,425 INFO L290 TraceCheckUtils]: 44: Hoare triple {6090#true} ~cond := #in~cond; {6090#true} is VALID [2022-04-08 11:22:51,425 INFO L272 TraceCheckUtils]: 43: Hoare triple {6295#(< ~counter~0 20)} call __VERIFIER_assert((if ~r~0 >= 2 * ~y~0 * ~a~0 then 1 else 0)); {6090#true} is VALID [2022-04-08 11:22:51,425 INFO L290 TraceCheckUtils]: 42: Hoare triple {6295#(< ~counter~0 20)} assume !!(~r~0 >= 2 * ~b~0); {6295#(< ~counter~0 20)} is VALID [2022-04-08 11:22:51,425 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {6090#true} {6295#(< ~counter~0 20)} #87#return; {6295#(< ~counter~0 20)} is VALID [2022-04-08 11:22:51,425 INFO L290 TraceCheckUtils]: 40: Hoare triple {6090#true} assume true; {6090#true} is VALID [2022-04-08 11:22:51,425 INFO L290 TraceCheckUtils]: 39: Hoare triple {6090#true} assume !(0 == ~cond); {6090#true} is VALID [2022-04-08 11:22:51,425 INFO L290 TraceCheckUtils]: 38: Hoare triple {6090#true} ~cond := #in~cond; {6090#true} is VALID [2022-04-08 11:22:51,426 INFO L272 TraceCheckUtils]: 37: Hoare triple {6295#(< ~counter~0 20)} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {6090#true} is VALID [2022-04-08 11:22:51,426 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {6090#true} {6295#(< ~counter~0 20)} #85#return; {6295#(< ~counter~0 20)} is VALID [2022-04-08 11:22:51,426 INFO L290 TraceCheckUtils]: 35: Hoare triple {6090#true} assume true; {6090#true} is VALID [2022-04-08 11:22:51,426 INFO L290 TraceCheckUtils]: 34: Hoare triple {6090#true} assume !(0 == ~cond); {6090#true} is VALID [2022-04-08 11:22:51,426 INFO L290 TraceCheckUtils]: 33: Hoare triple {6090#true} ~cond := #in~cond; {6090#true} is VALID [2022-04-08 11:22:51,426 INFO L272 TraceCheckUtils]: 32: Hoare triple {6295#(< ~counter~0 20)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {6090#true} is VALID [2022-04-08 11:22:51,427 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {6090#true} {6295#(< ~counter~0 20)} #83#return; {6295#(< ~counter~0 20)} is VALID [2022-04-08 11:22:51,427 INFO L290 TraceCheckUtils]: 30: Hoare triple {6090#true} assume true; {6090#true} is VALID [2022-04-08 11:22:51,427 INFO L290 TraceCheckUtils]: 29: Hoare triple {6090#true} assume !(0 == ~cond); {6090#true} is VALID [2022-04-08 11:22:51,427 INFO L290 TraceCheckUtils]: 28: Hoare triple {6090#true} ~cond := #in~cond; {6090#true} is VALID [2022-04-08 11:22:51,427 INFO L272 TraceCheckUtils]: 27: Hoare triple {6295#(< ~counter~0 20)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {6090#true} is VALID [2022-04-08 11:22:51,427 INFO L290 TraceCheckUtils]: 26: Hoare triple {6295#(< ~counter~0 20)} assume !!(#t~post7 < 20);havoc #t~post7; {6295#(< ~counter~0 20)} is VALID [2022-04-08 11:22:51,428 INFO L290 TraceCheckUtils]: 25: Hoare triple {6368#(< ~counter~0 19)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {6295#(< ~counter~0 20)} is VALID [2022-04-08 11:22:51,428 INFO L290 TraceCheckUtils]: 24: Hoare triple {6368#(< ~counter~0 19)} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {6368#(< ~counter~0 19)} is VALID [2022-04-08 11:22:51,441 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {6090#true} {6368#(< ~counter~0 19)} #81#return; {6368#(< ~counter~0 19)} is VALID [2022-04-08 11:22:51,441 INFO L290 TraceCheckUtils]: 22: Hoare triple {6090#true} assume true; {6090#true} is VALID [2022-04-08 11:22:51,441 INFO L290 TraceCheckUtils]: 21: Hoare triple {6090#true} assume !(0 == ~cond); {6090#true} is VALID [2022-04-08 11:22:51,441 INFO L290 TraceCheckUtils]: 20: Hoare triple {6090#true} ~cond := #in~cond; {6090#true} is VALID [2022-04-08 11:22:51,441 INFO L272 TraceCheckUtils]: 19: Hoare triple {6368#(< ~counter~0 19)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {6090#true} is VALID [2022-04-08 11:22:51,442 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {6090#true} {6368#(< ~counter~0 19)} #79#return; {6368#(< ~counter~0 19)} is VALID [2022-04-08 11:22:51,442 INFO L290 TraceCheckUtils]: 17: Hoare triple {6090#true} assume true; {6090#true} is VALID [2022-04-08 11:22:51,442 INFO L290 TraceCheckUtils]: 16: Hoare triple {6090#true} assume !(0 == ~cond); {6090#true} is VALID [2022-04-08 11:22:51,442 INFO L290 TraceCheckUtils]: 15: Hoare triple {6090#true} ~cond := #in~cond; {6090#true} is VALID [2022-04-08 11:22:51,442 INFO L272 TraceCheckUtils]: 14: Hoare triple {6368#(< ~counter~0 19)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {6090#true} is VALID [2022-04-08 11:22:51,442 INFO L290 TraceCheckUtils]: 13: Hoare triple {6368#(< ~counter~0 19)} assume !!(#t~post6 < 20);havoc #t~post6; {6368#(< ~counter~0 19)} is VALID [2022-04-08 11:22:51,443 INFO L290 TraceCheckUtils]: 12: Hoare triple {6408#(< ~counter~0 18)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6368#(< ~counter~0 19)} is VALID [2022-04-08 11:22:51,443 INFO L290 TraceCheckUtils]: 11: Hoare triple {6408#(< ~counter~0 18)} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {6408#(< ~counter~0 18)} is VALID [2022-04-08 11:22:51,444 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6090#true} {6408#(< ~counter~0 18)} #77#return; {6408#(< ~counter~0 18)} is VALID [2022-04-08 11:22:51,444 INFO L290 TraceCheckUtils]: 9: Hoare triple {6090#true} assume true; {6090#true} is VALID [2022-04-08 11:22:51,444 INFO L290 TraceCheckUtils]: 8: Hoare triple {6090#true} assume !(0 == ~cond); {6090#true} is VALID [2022-04-08 11:22:51,444 INFO L290 TraceCheckUtils]: 7: Hoare triple {6090#true} ~cond := #in~cond; {6090#true} is VALID [2022-04-08 11:22:51,444 INFO L272 TraceCheckUtils]: 6: Hoare triple {6408#(< ~counter~0 18)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {6090#true} is VALID [2022-04-08 11:22:51,445 INFO L290 TraceCheckUtils]: 5: Hoare triple {6408#(< ~counter~0 18)} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {6408#(< ~counter~0 18)} is VALID [2022-04-08 11:22:51,445 INFO L272 TraceCheckUtils]: 4: Hoare triple {6408#(< ~counter~0 18)} call #t~ret8 := main(); {6408#(< ~counter~0 18)} is VALID [2022-04-08 11:22:51,445 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6408#(< ~counter~0 18)} {6090#true} #93#return; {6408#(< ~counter~0 18)} is VALID [2022-04-08 11:22:51,446 INFO L290 TraceCheckUtils]: 2: Hoare triple {6408#(< ~counter~0 18)} assume true; {6408#(< ~counter~0 18)} is VALID [2022-04-08 11:22:51,446 INFO L290 TraceCheckUtils]: 1: Hoare triple {6090#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {6408#(< ~counter~0 18)} is VALID [2022-04-08 11:22:51,446 INFO L272 TraceCheckUtils]: 0: Hoare triple {6090#true} call ULTIMATE.init(); {6090#true} is VALID [2022-04-08 11:22:51,447 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:22:51,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:22:51,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335891914] [2022-04-08 11:22:51,447 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:22:51,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1015292661] [2022-04-08 11:22:51,447 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1015292661] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 11:22:51,447 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 11:22:51,447 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-04-08 11:22:51,448 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:22:51,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [794024241] [2022-04-08 11:22:51,448 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [794024241] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:22:51,448 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:22:51,448 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 11:22:51,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964956232] [2022-04-08 11:22:51,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:22:51,448 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:22:51,449 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:22:51,449 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:22:51,487 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:22:51,487 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 11:22:51,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:22:51,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 11:22:51,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-08 11:22:51,488 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:22:51,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:22:51,851 INFO L93 Difference]: Finished difference Result 173 states and 218 transitions. [2022-04-08 11:22:51,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 11:22:51,851 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:22:51,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:22:51,852 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:22:51,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 103 transitions. [2022-04-08 11:22:51,854 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:22:51,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 103 transitions. [2022-04-08 11:22:51,859 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 103 transitions. [2022-04-08 11:22:51,936 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:22:51,938 INFO L225 Difference]: With dead ends: 173 [2022-04-08 11:22:51,938 INFO L226 Difference]: Without dead ends: 130 [2022-04-08 11:22:51,939 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:22:51,940 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:22:51,940 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:22:51,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-04-08 11:22:52,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2022-04-08 11:22:52,064 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:22:52,065 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:22:52,065 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:22:52,065 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:22:52,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:22:52,069 INFO L93 Difference]: Finished difference Result 130 states and 161 transitions. [2022-04-08 11:22:52,069 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 161 transitions. [2022-04-08 11:22:52,070 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:22:52,070 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:22:52,071 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:22:52,071 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:22:52,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:22:52,074 INFO L93 Difference]: Finished difference Result 130 states and 161 transitions. [2022-04-08 11:22:52,075 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 161 transitions. [2022-04-08 11:22:52,075 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:22:52,075 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:22:52,075 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:22:52,075 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:22:52,076 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:22:52,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 161 transitions. [2022-04-08 11:22:52,079 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 161 transitions. Word has length 58 [2022-04-08 11:22:52,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:22:52,079 INFO L478 AbstractCegarLoop]: Abstraction has 130 states and 161 transitions. [2022-04-08 11:22:52,079 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:22:52,079 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 130 states and 161 transitions. [2022-04-08 11:22:52,234 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:22:52,235 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 161 transitions. [2022-04-08 11:22:52,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-04-08 11:22:52,235 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:22:52,235 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:22:52,252 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-04-08 11:22:52,439 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:22:52,440 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:22:52,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:22:52,440 INFO L85 PathProgramCache]: Analyzing trace with hash 78053411, now seen corresponding path program 1 times [2022-04-08 11:22:52,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:22:52,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1798108135] [2022-04-08 11:23:13,787 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 11:23:13,788 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 11:23:13,788 INFO L85 PathProgramCache]: Analyzing trace with hash 78053411, now seen corresponding path program 2 times [2022-04-08 11:23:13,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:23:13,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133636294] [2022-04-08 11:23:13,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:23:13,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:23:13,814 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:23:13,814 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [910398829] [2022-04-08 11:23:13,814 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 11:23:13,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:23:13,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:23:13,820 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:23:13,843 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:23:13,875 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 11:23:13,876 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:23:13,876 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-08 11:23:13,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:23:13,888 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:23:14,108 INFO L272 TraceCheckUtils]: 0: Hoare triple {7315#true} call ULTIMATE.init(); {7315#true} is VALID [2022-04-08 11:23:14,109 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:23:14,109 INFO L290 TraceCheckUtils]: 2: Hoare triple {7315#true} assume true; {7315#true} is VALID [2022-04-08 11:23:14,109 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7315#true} {7315#true} #93#return; {7315#true} is VALID [2022-04-08 11:23:14,109 INFO L272 TraceCheckUtils]: 4: Hoare triple {7315#true} call #t~ret8 := main(); {7315#true} is VALID [2022-04-08 11:23:14,109 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:23:14,109 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:23:14,109 INFO L290 TraceCheckUtils]: 7: Hoare triple {7315#true} ~cond := #in~cond; {7315#true} is VALID [2022-04-08 11:23:14,109 INFO L290 TraceCheckUtils]: 8: Hoare triple {7315#true} assume !(0 == ~cond); {7315#true} is VALID [2022-04-08 11:23:14,109 INFO L290 TraceCheckUtils]: 9: Hoare triple {7315#true} assume true; {7315#true} is VALID [2022-04-08 11:23:14,109 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7315#true} {7315#true} #77#return; {7315#true} is VALID [2022-04-08 11:23:14,110 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:23:14,110 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:23:14,110 INFO L290 TraceCheckUtils]: 13: Hoare triple {7315#true} assume !!(#t~post6 < 20);havoc #t~post6; {7315#true} is VALID [2022-04-08 11:23:14,110 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:23:14,110 INFO L290 TraceCheckUtils]: 15: Hoare triple {7315#true} ~cond := #in~cond; {7315#true} is VALID [2022-04-08 11:23:14,119 INFO L290 TraceCheckUtils]: 16: Hoare triple {7315#true} assume !(0 == ~cond); {7315#true} is VALID [2022-04-08 11:23:14,119 INFO L290 TraceCheckUtils]: 17: Hoare triple {7315#true} assume true; {7315#true} is VALID [2022-04-08 11:23:14,119 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {7315#true} {7315#true} #79#return; {7315#true} is VALID [2022-04-08 11:23:14,119 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:23:14,119 INFO L290 TraceCheckUtils]: 20: Hoare triple {7315#true} ~cond := #in~cond; {7315#true} is VALID [2022-04-08 11:23:14,119 INFO L290 TraceCheckUtils]: 21: Hoare triple {7315#true} assume !(0 == ~cond); {7315#true} is VALID [2022-04-08 11:23:14,119 INFO L290 TraceCheckUtils]: 22: Hoare triple {7315#true} assume true; {7315#true} is VALID [2022-04-08 11:23:14,120 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {7315#true} {7315#true} #81#return; {7315#true} is VALID [2022-04-08 11:23:14,120 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:23:14,120 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:23:14,121 INFO L290 TraceCheckUtils]: 26: Hoare triple {7392#(<= main_~b~0 main_~y~0)} assume !!(#t~post7 < 20);havoc #t~post7; {7392#(<= main_~b~0 main_~y~0)} is VALID [2022-04-08 11:23:14,121 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:23:14,121 INFO L290 TraceCheckUtils]: 28: Hoare triple {7315#true} ~cond := #in~cond; {7315#true} is VALID [2022-04-08 11:23:14,121 INFO L290 TraceCheckUtils]: 29: Hoare triple {7315#true} assume !(0 == ~cond); {7315#true} is VALID [2022-04-08 11:23:14,121 INFO L290 TraceCheckUtils]: 30: Hoare triple {7315#true} assume true; {7315#true} is VALID [2022-04-08 11:23:14,121 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:23:14,121 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:23:14,122 INFO L290 TraceCheckUtils]: 33: Hoare triple {7315#true} ~cond := #in~cond; {7315#true} is VALID [2022-04-08 11:23:14,122 INFO L290 TraceCheckUtils]: 34: Hoare triple {7315#true} assume !(0 == ~cond); {7315#true} is VALID [2022-04-08 11:23:14,122 INFO L290 TraceCheckUtils]: 35: Hoare triple {7315#true} assume true; {7315#true} is VALID [2022-04-08 11:23:14,122 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:23:14,122 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:23:14,122 INFO L290 TraceCheckUtils]: 38: Hoare triple {7315#true} ~cond := #in~cond; {7315#true} is VALID [2022-04-08 11:23:14,122 INFO L290 TraceCheckUtils]: 39: Hoare triple {7315#true} assume !(0 == ~cond); {7315#true} is VALID [2022-04-08 11:23:14,122 INFO L290 TraceCheckUtils]: 40: Hoare triple {7315#true} assume true; {7315#true} is VALID [2022-04-08 11:23:14,123 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:23:14,124 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:23:14,124 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:23:14,125 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:23:14,125 INFO L290 TraceCheckUtils]: 45: Hoare triple {7451#(< main_~r~0 main_~y~0)} assume !!(#t~post6 < 20);havoc #t~post6; {7451#(< main_~r~0 main_~y~0)} is VALID [2022-04-08 11:23:14,125 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:23:14,125 INFO L290 TraceCheckUtils]: 47: Hoare triple {7315#true} ~cond := #in~cond; {7315#true} is VALID [2022-04-08 11:23:14,125 INFO L290 TraceCheckUtils]: 48: Hoare triple {7315#true} assume !(0 == ~cond); {7315#true} is VALID [2022-04-08 11:23:14,125 INFO L290 TraceCheckUtils]: 49: Hoare triple {7315#true} assume true; {7315#true} is VALID [2022-04-08 11:23:14,125 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:23:14,126 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:23:14,126 INFO L290 TraceCheckUtils]: 52: Hoare triple {7315#true} ~cond := #in~cond; {7315#true} is VALID [2022-04-08 11:23:14,126 INFO L290 TraceCheckUtils]: 53: Hoare triple {7315#true} assume !(0 == ~cond); {7315#true} is VALID [2022-04-08 11:23:14,126 INFO L290 TraceCheckUtils]: 54: Hoare triple {7315#true} assume true; {7315#true} is VALID [2022-04-08 11:23:14,126 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:23:14,126 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:23:14,127 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:23:14,127 INFO L290 TraceCheckUtils]: 58: Hoare triple {7316#false} assume !(#t~post7 < 20);havoc #t~post7; {7316#false} is VALID [2022-04-08 11:23:14,127 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:23:14,127 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:23:14,127 INFO L290 TraceCheckUtils]: 61: Hoare triple {7316#false} assume !(#t~post6 < 20);havoc #t~post6; {7316#false} is VALID [2022-04-08 11:23:14,127 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:23:14,127 INFO L290 TraceCheckUtils]: 63: Hoare triple {7316#false} ~cond := #in~cond; {7316#false} is VALID [2022-04-08 11:23:14,127 INFO L290 TraceCheckUtils]: 64: Hoare triple {7316#false} assume 0 == ~cond; {7316#false} is VALID [2022-04-08 11:23:14,127 INFO L290 TraceCheckUtils]: 65: Hoare triple {7316#false} assume !false; {7316#false} is VALID [2022-04-08 11:23:14,127 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:23:14,127 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 11:23:14,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:23:14,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133636294] [2022-04-08 11:23:14,128 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:23:14,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [910398829] [2022-04-08 11:23:14,128 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [910398829] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:23:14,128 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:23:14,128 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 11:23:14,128 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:23:14,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1798108135] [2022-04-08 11:23:14,128 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1798108135] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:23:14,128 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:23:14,129 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 11:23:14,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575525160] [2022-04-08 11:23:14,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:23:14,129 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:23:14,130 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:23:14,130 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:23:14,199 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:23:14,200 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 11:23:14,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:23:14,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 11:23:14,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-08 11:23:14,204 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:23:14,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:23:14,548 INFO L93 Difference]: Finished difference Result 190 states and 240 transitions. [2022-04-08 11:23:14,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 11:23:14,548 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:23:14,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:23:14,549 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:23:14,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 109 transitions. [2022-04-08 11:23:14,551 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:23:14,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 109 transitions. [2022-04-08 11:23:14,552 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 109 transitions. [2022-04-08 11:23:14,629 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:23:14,632 INFO L225 Difference]: With dead ends: 190 [2022-04-08 11:23:14,632 INFO L226 Difference]: Without dead ends: 119 [2022-04-08 11:23:14,633 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:23:14,633 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:23:14,633 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:23:14,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-04-08 11:23:14,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 112. [2022-04-08 11:23:14,762 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:23:14,762 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:23:14,763 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:23:14,763 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:23:14,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:23:14,766 INFO L93 Difference]: Finished difference Result 119 states and 143 transitions. [2022-04-08 11:23:14,766 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 143 transitions. [2022-04-08 11:23:14,766 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:23:14,767 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:23:14,767 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:23:14,767 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:23:14,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:23:14,770 INFO L93 Difference]: Finished difference Result 119 states and 143 transitions. [2022-04-08 11:23:14,770 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 143 transitions. [2022-04-08 11:23:14,770 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:23:14,771 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:23:14,771 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:23:14,771 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:23:14,771 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:23:14,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 133 transitions. [2022-04-08 11:23:14,774 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 133 transitions. Word has length 66 [2022-04-08 11:23:14,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:23:14,774 INFO L478 AbstractCegarLoop]: Abstraction has 112 states and 133 transitions. [2022-04-08 11:23:14,774 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:23:14,774 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 112 states and 133 transitions. [2022-04-08 11:23:14,910 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:23:14,910 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 133 transitions. [2022-04-08 11:23:14,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-04-08 11:23:14,911 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:23:14,911 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:23:14,927 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:23:15,115 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:23:15,116 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:23:15,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:23:15,116 INFO L85 PathProgramCache]: Analyzing trace with hash -1361251212, now seen corresponding path program 1 times [2022-04-08 11:23:15,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:23:15,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [767374255] [2022-04-08 11:23:30,969 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 11:23:30,969 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 11:23:30,970 INFO L85 PathProgramCache]: Analyzing trace with hash -1361251212, now seen corresponding path program 2 times [2022-04-08 11:23:30,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:23:30,970 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252319314] [2022-04-08 11:23:30,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:23:30,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:23:30,980 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:23:30,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [136197696] [2022-04-08 11:23:30,980 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 11:23:30,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:23:30,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:23:30,987 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:23:31,012 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:23:31,043 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 11:23:31,043 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:23:31,044 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-08 11:23:31,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:23:31,059 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:23:31,329 INFO L272 TraceCheckUtils]: 0: Hoare triple {8362#true} call ULTIMATE.init(); {8362#true} is VALID [2022-04-08 11:23:31,331 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:23:31,331 INFO L290 TraceCheckUtils]: 2: Hoare triple {8370#(<= ~counter~0 0)} assume true; {8370#(<= ~counter~0 0)} is VALID [2022-04-08 11:23:31,332 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8370#(<= ~counter~0 0)} {8362#true} #93#return; {8370#(<= ~counter~0 0)} is VALID [2022-04-08 11:23:31,332 INFO L272 TraceCheckUtils]: 4: Hoare triple {8370#(<= ~counter~0 0)} call #t~ret8 := main(); {8370#(<= ~counter~0 0)} is VALID [2022-04-08 11:23:31,332 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:23:31,332 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:23:31,333 INFO L290 TraceCheckUtils]: 7: Hoare triple {8370#(<= ~counter~0 0)} ~cond := #in~cond; {8370#(<= ~counter~0 0)} is VALID [2022-04-08 11:23:31,333 INFO L290 TraceCheckUtils]: 8: Hoare triple {8370#(<= ~counter~0 0)} assume !(0 == ~cond); {8370#(<= ~counter~0 0)} is VALID [2022-04-08 11:23:31,333 INFO L290 TraceCheckUtils]: 9: Hoare triple {8370#(<= ~counter~0 0)} assume true; {8370#(<= ~counter~0 0)} is VALID [2022-04-08 11:23:31,334 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:23:31,334 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:23:31,334 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:23:31,335 INFO L290 TraceCheckUtils]: 13: Hoare triple {8404#(<= ~counter~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {8404#(<= ~counter~0 1)} is VALID [2022-04-08 11:23:31,335 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:23:31,336 INFO L290 TraceCheckUtils]: 15: Hoare triple {8404#(<= ~counter~0 1)} ~cond := #in~cond; {8404#(<= ~counter~0 1)} is VALID [2022-04-08 11:23:31,336 INFO L290 TraceCheckUtils]: 16: Hoare triple {8404#(<= ~counter~0 1)} assume !(0 == ~cond); {8404#(<= ~counter~0 1)} is VALID [2022-04-08 11:23:31,336 INFO L290 TraceCheckUtils]: 17: Hoare triple {8404#(<= ~counter~0 1)} assume true; {8404#(<= ~counter~0 1)} is VALID [2022-04-08 11:23:31,337 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:23:31,338 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:23:31,338 INFO L290 TraceCheckUtils]: 20: Hoare triple {8404#(<= ~counter~0 1)} ~cond := #in~cond; {8404#(<= ~counter~0 1)} is VALID [2022-04-08 11:23:31,338 INFO L290 TraceCheckUtils]: 21: Hoare triple {8404#(<= ~counter~0 1)} assume !(0 == ~cond); {8404#(<= ~counter~0 1)} is VALID [2022-04-08 11:23:31,339 INFO L290 TraceCheckUtils]: 22: Hoare triple {8404#(<= ~counter~0 1)} assume true; {8404#(<= ~counter~0 1)} is VALID [2022-04-08 11:23:31,339 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:23:31,340 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:23:31,340 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:23:31,341 INFO L290 TraceCheckUtils]: 26: Hoare triple {8444#(<= ~counter~0 2)} assume !!(#t~post7 < 20);havoc #t~post7; {8444#(<= ~counter~0 2)} is VALID [2022-04-08 11:23:31,341 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:23:31,342 INFO L290 TraceCheckUtils]: 28: Hoare triple {8444#(<= ~counter~0 2)} ~cond := #in~cond; {8444#(<= ~counter~0 2)} is VALID [2022-04-08 11:23:31,342 INFO L290 TraceCheckUtils]: 29: Hoare triple {8444#(<= ~counter~0 2)} assume !(0 == ~cond); {8444#(<= ~counter~0 2)} is VALID [2022-04-08 11:23:31,342 INFO L290 TraceCheckUtils]: 30: Hoare triple {8444#(<= ~counter~0 2)} assume true; {8444#(<= ~counter~0 2)} is VALID [2022-04-08 11:23:31,343 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:23:31,343 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:23:31,343 INFO L290 TraceCheckUtils]: 33: Hoare triple {8444#(<= ~counter~0 2)} ~cond := #in~cond; {8444#(<= ~counter~0 2)} is VALID [2022-04-08 11:23:31,344 INFO L290 TraceCheckUtils]: 34: Hoare triple {8444#(<= ~counter~0 2)} assume !(0 == ~cond); {8444#(<= ~counter~0 2)} is VALID [2022-04-08 11:23:31,344 INFO L290 TraceCheckUtils]: 35: Hoare triple {8444#(<= ~counter~0 2)} assume true; {8444#(<= ~counter~0 2)} is VALID [2022-04-08 11:23:31,344 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:23:31,345 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:23:31,345 INFO L290 TraceCheckUtils]: 38: Hoare triple {8444#(<= ~counter~0 2)} ~cond := #in~cond; {8444#(<= ~counter~0 2)} is VALID [2022-04-08 11:23:31,346 INFO L290 TraceCheckUtils]: 39: Hoare triple {8444#(<= ~counter~0 2)} assume !(0 == ~cond); {8444#(<= ~counter~0 2)} is VALID [2022-04-08 11:23:31,346 INFO L290 TraceCheckUtils]: 40: Hoare triple {8444#(<= ~counter~0 2)} assume true; {8444#(<= ~counter~0 2)} is VALID [2022-04-08 11:23:31,346 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:23:31,347 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:23:31,347 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:23:31,348 INFO L290 TraceCheckUtils]: 44: Hoare triple {8444#(<= ~counter~0 2)} ~cond := #in~cond; {8444#(<= ~counter~0 2)} is VALID [2022-04-08 11:23:31,348 INFO L290 TraceCheckUtils]: 45: Hoare triple {8444#(<= ~counter~0 2)} assume !(0 == ~cond); {8444#(<= ~counter~0 2)} is VALID [2022-04-08 11:23:31,348 INFO L290 TraceCheckUtils]: 46: Hoare triple {8444#(<= ~counter~0 2)} assume true; {8444#(<= ~counter~0 2)} is VALID [2022-04-08 11:23:31,349 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:23:31,349 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:23:31,350 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:23:31,350 INFO L290 TraceCheckUtils]: 50: Hoare triple {8517#(<= ~counter~0 3)} assume !!(#t~post7 < 20);havoc #t~post7; {8517#(<= ~counter~0 3)} is VALID [2022-04-08 11:23:31,351 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:23:31,351 INFO L290 TraceCheckUtils]: 52: Hoare triple {8517#(<= ~counter~0 3)} ~cond := #in~cond; {8517#(<= ~counter~0 3)} is VALID [2022-04-08 11:23:31,352 INFO L290 TraceCheckUtils]: 53: Hoare triple {8517#(<= ~counter~0 3)} assume !(0 == ~cond); {8517#(<= ~counter~0 3)} is VALID [2022-04-08 11:23:31,352 INFO L290 TraceCheckUtils]: 54: Hoare triple {8517#(<= ~counter~0 3)} assume true; {8517#(<= ~counter~0 3)} is VALID [2022-04-08 11:23:31,353 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:23:31,353 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:23:31,354 INFO L290 TraceCheckUtils]: 57: Hoare triple {8517#(<= ~counter~0 3)} ~cond := #in~cond; {8517#(<= ~counter~0 3)} is VALID [2022-04-08 11:23:31,354 INFO L290 TraceCheckUtils]: 58: Hoare triple {8517#(<= ~counter~0 3)} assume !(0 == ~cond); {8517#(<= ~counter~0 3)} is VALID [2022-04-08 11:23:31,354 INFO L290 TraceCheckUtils]: 59: Hoare triple {8517#(<= ~counter~0 3)} assume true; {8517#(<= ~counter~0 3)} is VALID [2022-04-08 11:23:31,355 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:23:31,355 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:23:31,356 INFO L290 TraceCheckUtils]: 62: Hoare triple {8517#(<= ~counter~0 3)} ~cond := #in~cond; {8517#(<= ~counter~0 3)} is VALID [2022-04-08 11:23:31,356 INFO L290 TraceCheckUtils]: 63: Hoare triple {8517#(<= ~counter~0 3)} assume !(0 == ~cond); {8517#(<= ~counter~0 3)} is VALID [2022-04-08 11:23:31,356 INFO L290 TraceCheckUtils]: 64: Hoare triple {8517#(<= ~counter~0 3)} assume true; {8517#(<= ~counter~0 3)} is VALID [2022-04-08 11:23:31,357 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:23:31,357 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:23:31,358 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:23:31,358 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:23:31,358 INFO L290 TraceCheckUtils]: 69: Hoare triple {8575#(<= |main_#t~post6| 3)} assume !(#t~post6 < 20);havoc #t~post6; {8363#false} is VALID [2022-04-08 11:23:31,358 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:23:31,359 INFO L290 TraceCheckUtils]: 71: Hoare triple {8363#false} ~cond := #in~cond; {8363#false} is VALID [2022-04-08 11:23:31,359 INFO L290 TraceCheckUtils]: 72: Hoare triple {8363#false} assume 0 == ~cond; {8363#false} is VALID [2022-04-08 11:23:31,359 INFO L290 TraceCheckUtils]: 73: Hoare triple {8363#false} assume !false; {8363#false} is VALID [2022-04-08 11:23:31,359 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:23:31,359 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 11:23:31,655 INFO L290 TraceCheckUtils]: 73: Hoare triple {8363#false} assume !false; {8363#false} is VALID [2022-04-08 11:23:31,655 INFO L290 TraceCheckUtils]: 72: Hoare triple {8363#false} assume 0 == ~cond; {8363#false} is VALID [2022-04-08 11:23:31,655 INFO L290 TraceCheckUtils]: 71: Hoare triple {8363#false} ~cond := #in~cond; {8363#false} is VALID [2022-04-08 11:23:31,655 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:23:31,656 INFO L290 TraceCheckUtils]: 69: Hoare triple {8603#(< |main_#t~post6| 20)} assume !(#t~post6 < 20);havoc #t~post6; {8363#false} is VALID [2022-04-08 11:23:31,656 INFO L290 TraceCheckUtils]: 68: Hoare triple {8607#(< ~counter~0 20)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8603#(< |main_#t~post6| 20)} is VALID [2022-04-08 11:23:31,656 INFO L290 TraceCheckUtils]: 67: Hoare triple {8607#(< ~counter~0 20)} ~r~0 := ~r~0 - ~b~0;~q~0 := ~q~0 + ~a~0; {8607#(< ~counter~0 20)} is VALID [2022-04-08 11:23:31,656 INFO L290 TraceCheckUtils]: 66: Hoare triple {8607#(< ~counter~0 20)} assume !(~r~0 >= 2 * ~b~0); {8607#(< ~counter~0 20)} is VALID [2022-04-08 11:23:31,657 INFO L284 TraceCheckUtils]: 65: Hoare quadruple {8362#true} {8607#(< ~counter~0 20)} #87#return; {8607#(< ~counter~0 20)} is VALID [2022-04-08 11:23:31,657 INFO L290 TraceCheckUtils]: 64: Hoare triple {8362#true} assume true; {8362#true} is VALID [2022-04-08 11:23:31,657 INFO L290 TraceCheckUtils]: 63: Hoare triple {8362#true} assume !(0 == ~cond); {8362#true} is VALID [2022-04-08 11:23:31,657 INFO L290 TraceCheckUtils]: 62: Hoare triple {8362#true} ~cond := #in~cond; {8362#true} is VALID [2022-04-08 11:23:31,657 INFO L272 TraceCheckUtils]: 61: Hoare triple {8607#(< ~counter~0 20)} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {8362#true} is VALID [2022-04-08 11:23:31,658 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {8362#true} {8607#(< ~counter~0 20)} #85#return; {8607#(< ~counter~0 20)} is VALID [2022-04-08 11:23:31,658 INFO L290 TraceCheckUtils]: 59: Hoare triple {8362#true} assume true; {8362#true} is VALID [2022-04-08 11:23:31,658 INFO L290 TraceCheckUtils]: 58: Hoare triple {8362#true} assume !(0 == ~cond); {8362#true} is VALID [2022-04-08 11:23:31,658 INFO L290 TraceCheckUtils]: 57: Hoare triple {8362#true} ~cond := #in~cond; {8362#true} is VALID [2022-04-08 11:23:31,658 INFO L272 TraceCheckUtils]: 56: Hoare triple {8607#(< ~counter~0 20)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {8362#true} is VALID [2022-04-08 11:23:31,659 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {8362#true} {8607#(< ~counter~0 20)} #83#return; {8607#(< ~counter~0 20)} is VALID [2022-04-08 11:23:31,659 INFO L290 TraceCheckUtils]: 54: Hoare triple {8362#true} assume true; {8362#true} is VALID [2022-04-08 11:23:31,659 INFO L290 TraceCheckUtils]: 53: Hoare triple {8362#true} assume !(0 == ~cond); {8362#true} is VALID [2022-04-08 11:23:31,659 INFO L290 TraceCheckUtils]: 52: Hoare triple {8362#true} ~cond := #in~cond; {8362#true} is VALID [2022-04-08 11:23:31,659 INFO L272 TraceCheckUtils]: 51: Hoare triple {8607#(< ~counter~0 20)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {8362#true} is VALID [2022-04-08 11:23:31,659 INFO L290 TraceCheckUtils]: 50: Hoare triple {8607#(< ~counter~0 20)} assume !!(#t~post7 < 20);havoc #t~post7; {8607#(< ~counter~0 20)} is VALID [2022-04-08 11:23:31,660 INFO L290 TraceCheckUtils]: 49: Hoare triple {8665#(< ~counter~0 19)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {8607#(< ~counter~0 20)} is VALID [2022-04-08 11:23:31,660 INFO L290 TraceCheckUtils]: 48: Hoare triple {8665#(< ~counter~0 19)} ~a~0 := 2 * ~a~0;~b~0 := 2 * ~b~0; {8665#(< ~counter~0 19)} is VALID [2022-04-08 11:23:31,660 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {8362#true} {8665#(< ~counter~0 19)} #89#return; {8665#(< ~counter~0 19)} is VALID [2022-04-08 11:23:31,660 INFO L290 TraceCheckUtils]: 46: Hoare triple {8362#true} assume true; {8362#true} is VALID [2022-04-08 11:23:31,660 INFO L290 TraceCheckUtils]: 45: Hoare triple {8362#true} assume !(0 == ~cond); {8362#true} is VALID [2022-04-08 11:23:31,660 INFO L290 TraceCheckUtils]: 44: Hoare triple {8362#true} ~cond := #in~cond; {8362#true} is VALID [2022-04-08 11:23:31,661 INFO L272 TraceCheckUtils]: 43: Hoare triple {8665#(< ~counter~0 19)} call __VERIFIER_assert((if ~r~0 >= 2 * ~y~0 * ~a~0 then 1 else 0)); {8362#true} is VALID [2022-04-08 11:23:31,661 INFO L290 TraceCheckUtils]: 42: Hoare triple {8665#(< ~counter~0 19)} assume !!(~r~0 >= 2 * ~b~0); {8665#(< ~counter~0 19)} is VALID [2022-04-08 11:23:31,661 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {8362#true} {8665#(< ~counter~0 19)} #87#return; {8665#(< ~counter~0 19)} is VALID [2022-04-08 11:23:31,661 INFO L290 TraceCheckUtils]: 40: Hoare triple {8362#true} assume true; {8362#true} is VALID [2022-04-08 11:23:31,661 INFO L290 TraceCheckUtils]: 39: Hoare triple {8362#true} assume !(0 == ~cond); {8362#true} is VALID [2022-04-08 11:23:31,661 INFO L290 TraceCheckUtils]: 38: Hoare triple {8362#true} ~cond := #in~cond; {8362#true} is VALID [2022-04-08 11:23:31,661 INFO L272 TraceCheckUtils]: 37: Hoare triple {8665#(< ~counter~0 19)} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {8362#true} is VALID [2022-04-08 11:23:31,680 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {8362#true} {8665#(< ~counter~0 19)} #85#return; {8665#(< ~counter~0 19)} is VALID [2022-04-08 11:23:31,680 INFO L290 TraceCheckUtils]: 35: Hoare triple {8362#true} assume true; {8362#true} is VALID [2022-04-08 11:23:31,680 INFO L290 TraceCheckUtils]: 34: Hoare triple {8362#true} assume !(0 == ~cond); {8362#true} is VALID [2022-04-08 11:23:31,680 INFO L290 TraceCheckUtils]: 33: Hoare triple {8362#true} ~cond := #in~cond; {8362#true} is VALID [2022-04-08 11:23:31,680 INFO L272 TraceCheckUtils]: 32: Hoare triple {8665#(< ~counter~0 19)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {8362#true} is VALID [2022-04-08 11:23:31,681 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {8362#true} {8665#(< ~counter~0 19)} #83#return; {8665#(< ~counter~0 19)} is VALID [2022-04-08 11:23:31,682 INFO L290 TraceCheckUtils]: 30: Hoare triple {8362#true} assume true; {8362#true} is VALID [2022-04-08 11:23:31,682 INFO L290 TraceCheckUtils]: 29: Hoare triple {8362#true} assume !(0 == ~cond); {8362#true} is VALID [2022-04-08 11:23:31,682 INFO L290 TraceCheckUtils]: 28: Hoare triple {8362#true} ~cond := #in~cond; {8362#true} is VALID [2022-04-08 11:23:31,682 INFO L272 TraceCheckUtils]: 27: Hoare triple {8665#(< ~counter~0 19)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {8362#true} is VALID [2022-04-08 11:23:31,682 INFO L290 TraceCheckUtils]: 26: Hoare triple {8665#(< ~counter~0 19)} assume !!(#t~post7 < 20);havoc #t~post7; {8665#(< ~counter~0 19)} is VALID [2022-04-08 11:23:31,683 INFO L290 TraceCheckUtils]: 25: Hoare triple {8738#(< ~counter~0 18)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {8665#(< ~counter~0 19)} is VALID [2022-04-08 11:23:31,684 INFO L290 TraceCheckUtils]: 24: Hoare triple {8738#(< ~counter~0 18)} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {8738#(< ~counter~0 18)} is VALID [2022-04-08 11:23:31,685 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {8362#true} {8738#(< ~counter~0 18)} #81#return; {8738#(< ~counter~0 18)} is VALID [2022-04-08 11:23:31,685 INFO L290 TraceCheckUtils]: 22: Hoare triple {8362#true} assume true; {8362#true} is VALID [2022-04-08 11:23:31,685 INFO L290 TraceCheckUtils]: 21: Hoare triple {8362#true} assume !(0 == ~cond); {8362#true} is VALID [2022-04-08 11:23:31,685 INFO L290 TraceCheckUtils]: 20: Hoare triple {8362#true} ~cond := #in~cond; {8362#true} is VALID [2022-04-08 11:23:31,685 INFO L272 TraceCheckUtils]: 19: Hoare triple {8738#(< ~counter~0 18)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {8362#true} is VALID [2022-04-08 11:23:31,686 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {8362#true} {8738#(< ~counter~0 18)} #79#return; {8738#(< ~counter~0 18)} is VALID [2022-04-08 11:23:31,686 INFO L290 TraceCheckUtils]: 17: Hoare triple {8362#true} assume true; {8362#true} is VALID [2022-04-08 11:23:31,686 INFO L290 TraceCheckUtils]: 16: Hoare triple {8362#true} assume !(0 == ~cond); {8362#true} is VALID [2022-04-08 11:23:31,686 INFO L290 TraceCheckUtils]: 15: Hoare triple {8362#true} ~cond := #in~cond; {8362#true} is VALID [2022-04-08 11:23:31,686 INFO L272 TraceCheckUtils]: 14: Hoare triple {8738#(< ~counter~0 18)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {8362#true} is VALID [2022-04-08 11:23:31,687 INFO L290 TraceCheckUtils]: 13: Hoare triple {8738#(< ~counter~0 18)} assume !!(#t~post6 < 20);havoc #t~post6; {8738#(< ~counter~0 18)} is VALID [2022-04-08 11:23:31,687 INFO L290 TraceCheckUtils]: 12: Hoare triple {8778#(< ~counter~0 17)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8738#(< ~counter~0 18)} is VALID [2022-04-08 11:23:31,688 INFO L290 TraceCheckUtils]: 11: Hoare triple {8778#(< ~counter~0 17)} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {8778#(< ~counter~0 17)} is VALID [2022-04-08 11:23:31,689 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8362#true} {8778#(< ~counter~0 17)} #77#return; {8778#(< ~counter~0 17)} is VALID [2022-04-08 11:23:31,689 INFO L290 TraceCheckUtils]: 9: Hoare triple {8362#true} assume true; {8362#true} is VALID [2022-04-08 11:23:31,689 INFO L290 TraceCheckUtils]: 8: Hoare triple {8362#true} assume !(0 == ~cond); {8362#true} is VALID [2022-04-08 11:23:31,689 INFO L290 TraceCheckUtils]: 7: Hoare triple {8362#true} ~cond := #in~cond; {8362#true} is VALID [2022-04-08 11:23:31,689 INFO L272 TraceCheckUtils]: 6: Hoare triple {8778#(< ~counter~0 17)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {8362#true} is VALID [2022-04-08 11:23:31,690 INFO L290 TraceCheckUtils]: 5: Hoare triple {8778#(< ~counter~0 17)} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {8778#(< ~counter~0 17)} is VALID [2022-04-08 11:23:31,691 INFO L272 TraceCheckUtils]: 4: Hoare triple {8778#(< ~counter~0 17)} call #t~ret8 := main(); {8778#(< ~counter~0 17)} is VALID [2022-04-08 11:23:31,691 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8778#(< ~counter~0 17)} {8362#true} #93#return; {8778#(< ~counter~0 17)} is VALID [2022-04-08 11:23:31,692 INFO L290 TraceCheckUtils]: 2: Hoare triple {8778#(< ~counter~0 17)} assume true; {8778#(< ~counter~0 17)} is VALID [2022-04-08 11:23:31,693 INFO L290 TraceCheckUtils]: 1: Hoare triple {8362#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {8778#(< ~counter~0 17)} is VALID [2022-04-08 11:23:31,693 INFO L272 TraceCheckUtils]: 0: Hoare triple {8362#true} call ULTIMATE.init(); {8362#true} is VALID [2022-04-08 11:23:31,693 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:23:31,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:23:31,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252319314] [2022-04-08 11:23:31,694 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:23:31,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [136197696] [2022-04-08 11:23:31,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [136197696] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 11:23:31,694 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 11:23:31,694 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2022-04-08 11:23:31,694 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:23:31,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [767374255] [2022-04-08 11:23:31,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [767374255] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:23:31,694 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:23:31,694 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 11:23:31,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770142699] [2022-04-08 11:23:31,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:23:31,695 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:23:31,695 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:23:31,696 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:23:31,736 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:23:31,736 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 11:23:31,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:23:31,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 11:23:31,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2022-04-08 11:23:31,737 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:23:32,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:23:32,052 INFO L93 Difference]: Finished difference Result 141 states and 164 transitions. [2022-04-08 11:23:32,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 11:23:32,052 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:23:32,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:23:32,052 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:23:32,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 94 transitions. [2022-04-08 11:23:32,054 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:23:32,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 94 transitions. [2022-04-08 11:23:32,072 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 94 transitions. [2022-04-08 11:23:32,137 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:23:32,139 INFO L225 Difference]: With dead ends: 141 [2022-04-08 11:23:32,139 INFO L226 Difference]: Without dead ends: 134 [2022-04-08 11:23:32,140 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2022-04-08 11:23:32,140 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:23:32,140 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:23:32,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2022-04-08 11:23:32,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 132. [2022-04-08 11:23:32,303 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:23:32,303 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:23:32,303 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:23:32,304 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:23:32,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:23:32,307 INFO L93 Difference]: Finished difference Result 134 states and 157 transitions. [2022-04-08 11:23:32,307 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 157 transitions. [2022-04-08 11:23:32,307 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:23:32,308 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:23:32,308 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:23:32,308 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:23:32,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:23:32,312 INFO L93 Difference]: Finished difference Result 134 states and 157 transitions. [2022-04-08 11:23:32,312 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 157 transitions. [2022-04-08 11:23:32,312 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:23:32,312 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:23:32,312 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:23:32,312 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:23:32,313 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:23:32,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 155 transitions. [2022-04-08 11:23:32,316 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 155 transitions. Word has length 74 [2022-04-08 11:23:32,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:23:32,316 INFO L478 AbstractCegarLoop]: Abstraction has 132 states and 155 transitions. [2022-04-08 11:23:32,316 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:23:32,316 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 132 states and 155 transitions. [2022-04-08 11:23:32,502 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:23:32,502 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 155 transitions. [2022-04-08 11:23:32,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-04-08 11:23:32,503 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:23:32,503 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:23:32,527 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:23:32,703 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:23:32,703 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:23:32,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:23:32,704 INFO L85 PathProgramCache]: Analyzing trace with hash 1777426592, now seen corresponding path program 1 times [2022-04-08 11:23:32,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:23:32,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1617568867] [2022-04-08 11:23:32,921 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 11:23:53,542 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 11:23:53,542 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 11:23:53,542 INFO L85 PathProgramCache]: Analyzing trace with hash 1777426592, now seen corresponding path program 2 times [2022-04-08 11:23:53,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:23:53,543 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180551147] [2022-04-08 11:23:53,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:23:53,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:23:53,552 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:23:53,553 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1868829885] [2022-04-08 11:23:53,553 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 11:23:53,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:23:53,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:23:53,555 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:23:53,556 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:23:53,613 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 11:23:53,614 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:23:53,615 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 26 conjunts are in the unsatisfiable core [2022-04-08 11:23:53,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:23:53,633 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:23:56,408 INFO L272 TraceCheckUtils]: 0: Hoare triple {9633#true} call ULTIMATE.init(); {9633#true} is VALID [2022-04-08 11:23:56,408 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:56,408 INFO L290 TraceCheckUtils]: 2: Hoare triple {9633#true} assume true; {9633#true} is VALID [2022-04-08 11:23:56,409 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9633#true} {9633#true} #93#return; {9633#true} is VALID [2022-04-08 11:23:56,409 INFO L272 TraceCheckUtils]: 4: Hoare triple {9633#true} call #t~ret8 := main(); {9633#true} is VALID [2022-04-08 11:23:56,409 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:56,409 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:56,409 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:23:56,409 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:23:56,410 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:23:56,410 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:23:56,410 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:23:56,411 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:23:56,411 INFO L290 TraceCheckUtils]: 13: Hoare triple {9674#(and (= main_~x~0 main_~r~0) (= main_~q~0 0) (<= 1 main_~y~0))} assume !!(#t~post6 < 20);havoc #t~post6; {9674#(and (= main_~x~0 main_~r~0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-08 11:23:56,411 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:23:56,411 INFO L290 TraceCheckUtils]: 15: Hoare triple {9633#true} ~cond := #in~cond; {9633#true} is VALID [2022-04-08 11:23:56,427 INFO L290 TraceCheckUtils]: 16: Hoare triple {9633#true} assume !(0 == ~cond); {9633#true} is VALID [2022-04-08 11:23:56,427 INFO L290 TraceCheckUtils]: 17: Hoare triple {9633#true} assume true; {9633#true} is VALID [2022-04-08 11:23:56,428 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:23:56,428 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:23:56,428 INFO L290 TraceCheckUtils]: 20: Hoare triple {9633#true} ~cond := #in~cond; {9633#true} is VALID [2022-04-08 11:23:56,428 INFO L290 TraceCheckUtils]: 21: Hoare triple {9633#true} assume !(0 == ~cond); {9633#true} is VALID [2022-04-08 11:23:56,428 INFO L290 TraceCheckUtils]: 22: Hoare triple {9633#true} assume true; {9633#true} is VALID [2022-04-08 11:23:56,429 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:23:56,429 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:23:56,430 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:23:56,430 INFO L290 TraceCheckUtils]: 26: Hoare triple {9714#(and (= main_~x~0 main_~r~0) (<= 1 main_~a~0) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} assume !!(#t~post7 < 20);havoc #t~post7; {9714#(and (= main_~x~0 main_~r~0) (<= 1 main_~a~0) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-08 11:23:56,430 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:23:56,430 INFO L290 TraceCheckUtils]: 28: Hoare triple {9633#true} ~cond := #in~cond; {9633#true} is VALID [2022-04-08 11:23:56,430 INFO L290 TraceCheckUtils]: 29: Hoare triple {9633#true} assume !(0 == ~cond); {9633#true} is VALID [2022-04-08 11:23:56,430 INFO L290 TraceCheckUtils]: 30: Hoare triple {9633#true} assume true; {9633#true} is VALID [2022-04-08 11:23:56,431 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:23:56,431 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:23:56,431 INFO L290 TraceCheckUtils]: 33: Hoare triple {9633#true} ~cond := #in~cond; {9633#true} is VALID [2022-04-08 11:23:56,431 INFO L290 TraceCheckUtils]: 34: Hoare triple {9633#true} assume !(0 == ~cond); {9633#true} is VALID [2022-04-08 11:23:56,431 INFO L290 TraceCheckUtils]: 35: Hoare triple {9633#true} assume true; {9633#true} is VALID [2022-04-08 11:23:56,432 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:23:56,432 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:23:56,432 INFO L290 TraceCheckUtils]: 38: Hoare triple {9633#true} ~cond := #in~cond; {9633#true} is VALID [2022-04-08 11:23:56,432 INFO L290 TraceCheckUtils]: 39: Hoare triple {9633#true} assume !(0 == ~cond); {9633#true} is VALID [2022-04-08 11:23:56,432 INFO L290 TraceCheckUtils]: 40: Hoare triple {9633#true} assume true; {9633#true} is VALID [2022-04-08 11:23:56,432 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:23:56,433 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:23:56,433 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:23:56,433 INFO L290 TraceCheckUtils]: 44: Hoare triple {9633#true} ~cond := #in~cond; {9633#true} is VALID [2022-04-08 11:23:56,433 INFO L290 TraceCheckUtils]: 45: Hoare triple {9633#true} assume !(0 == ~cond); {9633#true} is VALID [2022-04-08 11:23:56,433 INFO L290 TraceCheckUtils]: 46: Hoare triple {9633#true} assume true; {9633#true} is VALID [2022-04-08 11:23:56,433 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:23:56,434 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:23:56,435 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:23:56,435 INFO L290 TraceCheckUtils]: 50: Hoare triple {9787#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (<= 1 (div (* (- 1) main_~a~0) (- 2))) (<= (div (- main_~b~0) (- 2)) main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} assume !!(#t~post7 < 20);havoc #t~post7; {9787#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (<= 1 (div (* (- 1) main_~a~0) (- 2))) (<= (div (- main_~b~0) (- 2)) main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-08 11:23:56,435 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:23:56,435 INFO L290 TraceCheckUtils]: 52: Hoare triple {9633#true} ~cond := #in~cond; {9633#true} is VALID [2022-04-08 11:23:56,436 INFO L290 TraceCheckUtils]: 53: Hoare triple {9633#true} assume !(0 == ~cond); {9633#true} is VALID [2022-04-08 11:23:56,436 INFO L290 TraceCheckUtils]: 54: Hoare triple {9633#true} assume true; {9633#true} is VALID [2022-04-08 11:23:56,436 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:23:56,436 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:23:56,436 INFO L290 TraceCheckUtils]: 57: Hoare triple {9633#true} ~cond := #in~cond; {9633#true} is VALID [2022-04-08 11:23:56,436 INFO L290 TraceCheckUtils]: 58: Hoare triple {9633#true} assume !(0 == ~cond); {9633#true} is VALID [2022-04-08 11:23:56,436 INFO L290 TraceCheckUtils]: 59: Hoare triple {9633#true} assume true; {9633#true} is VALID [2022-04-08 11:23:56,437 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:23:56,437 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:23:56,437 INFO L290 TraceCheckUtils]: 62: Hoare triple {9633#true} ~cond := #in~cond; {9633#true} is VALID [2022-04-08 11:23:56,437 INFO L290 TraceCheckUtils]: 63: Hoare triple {9633#true} assume !(0 == ~cond); {9633#true} is VALID [2022-04-08 11:23:56,437 INFO L290 TraceCheckUtils]: 64: Hoare triple {9633#true} assume true; {9633#true} is VALID [2022-04-08 11:23:56,438 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:23:56,438 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:23:56,439 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:23:56,439 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:23:56,447 INFO L290 TraceCheckUtils]: 69: Hoare triple {9845#(and (= (+ (* (- 1) main_~a~0) main_~q~0) 0) (= (mod main_~a~0 2) 0) (<= 1 (div (* (- 1) main_~a~0) (- 2))) (<= (div (- main_~b~0) (- 2)) main_~y~0) (= main_~x~0 (+ main_~b~0 main_~r~0)) (<= 1 main_~y~0))} assume !!(#t~post6 < 20);havoc #t~post6; {9845#(and (= (+ (* (- 1) main_~a~0) main_~q~0) 0) (= (mod main_~a~0 2) 0) (<= 1 (div (* (- 1) main_~a~0) (- 2))) (<= (div (- main_~b~0) (- 2)) main_~y~0) (= main_~x~0 (+ main_~b~0 main_~r~0)) (<= 1 main_~y~0))} is VALID [2022-04-08 11:23:56,448 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:23:56,448 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:23:56,448 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:23:56,449 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:56,452 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:23:56,453 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:23:56,454 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:56,454 INFO L290 TraceCheckUtils]: 77: Hoare triple {9877#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {9634#false} is VALID [2022-04-08 11:23:56,454 INFO L290 TraceCheckUtils]: 78: Hoare triple {9634#false} assume !false; {9634#false} is VALID [2022-04-08 11:23:56,455 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:23:56,455 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 11:24:02,566 INFO L290 TraceCheckUtils]: 78: Hoare triple {9634#false} assume !false; {9634#false} is VALID [2022-04-08 11:24:02,567 INFO L290 TraceCheckUtils]: 77: Hoare triple {9877#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {9634#false} is VALID [2022-04-08 11:24:02,567 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:24:02,568 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:24:02,569 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:24:02,569 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:24:02,570 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:24:02,570 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:24:02,570 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:24:02,571 INFO L290 TraceCheckUtils]: 69: Hoare triple {9897#(or (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (not (= main_~b~0 (* main_~a~0 main_~y~0))))} assume !!(#t~post6 < 20);havoc #t~post6; {9897#(or (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (not (= main_~b~0 (* main_~a~0 main_~y~0))))} is VALID [2022-04-08 11:24:02,571 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:24:02,581 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:24:02,581 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:24:02,582 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:24:02,582 INFO L290 TraceCheckUtils]: 64: Hoare triple {9633#true} assume true; {9633#true} is VALID [2022-04-08 11:24:02,582 INFO L290 TraceCheckUtils]: 63: Hoare triple {9633#true} assume !(0 == ~cond); {9633#true} is VALID [2022-04-08 11:24:02,582 INFO L290 TraceCheckUtils]: 62: Hoare triple {9633#true} ~cond := #in~cond; {9633#true} is VALID [2022-04-08 11:24:02,582 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:24:02,583 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:24:02,583 INFO L290 TraceCheckUtils]: 59: Hoare triple {9633#true} assume true; {9633#true} is VALID [2022-04-08 11:24:02,583 INFO L290 TraceCheckUtils]: 58: Hoare triple {9633#true} assume !(0 == ~cond); {9633#true} is VALID [2022-04-08 11:24:02,583 INFO L290 TraceCheckUtils]: 57: Hoare triple {9633#true} ~cond := #in~cond; {9633#true} is VALID [2022-04-08 11:24:02,583 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:24:02,584 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:24:02,584 INFO L290 TraceCheckUtils]: 54: Hoare triple {9633#true} assume true; {9633#true} is VALID [2022-04-08 11:24:02,584 INFO L290 TraceCheckUtils]: 53: Hoare triple {9633#true} assume !(0 == ~cond); {9633#true} is VALID [2022-04-08 11:24:02,584 INFO L290 TraceCheckUtils]: 52: Hoare triple {9633#true} ~cond := #in~cond; {9633#true} is VALID [2022-04-08 11:24:02,584 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:24:02,585 INFO L290 TraceCheckUtils]: 50: Hoare triple {9897#(or (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (not (= main_~b~0 (* main_~a~0 main_~y~0))))} assume !!(#t~post7 < 20);havoc #t~post7; {9897#(or (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (not (= main_~b~0 (* main_~a~0 main_~y~0))))} is VALID [2022-04-08 11:24:02,585 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:24:02,587 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:24:02,588 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:24:02,588 INFO L290 TraceCheckUtils]: 46: Hoare triple {9633#true} assume true; {9633#true} is VALID [2022-04-08 11:24:02,588 INFO L290 TraceCheckUtils]: 45: Hoare triple {9633#true} assume !(0 == ~cond); {9633#true} is VALID [2022-04-08 11:24:02,588 INFO L290 TraceCheckUtils]: 44: Hoare triple {9633#true} ~cond := #in~cond; {9633#true} is VALID [2022-04-08 11:24:02,588 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:24:02,589 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:24:02,589 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:24:02,589 INFO L290 TraceCheckUtils]: 40: Hoare triple {9633#true} assume true; {9633#true} is VALID [2022-04-08 11:24:02,589 INFO L290 TraceCheckUtils]: 39: Hoare triple {9633#true} assume !(0 == ~cond); {9633#true} is VALID [2022-04-08 11:24:02,590 INFO L290 TraceCheckUtils]: 38: Hoare triple {9633#true} ~cond := #in~cond; {9633#true} is VALID [2022-04-08 11:24:02,590 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:24:02,590 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:24:02,590 INFO L290 TraceCheckUtils]: 35: Hoare triple {9633#true} assume true; {9633#true} is VALID [2022-04-08 11:24:02,591 INFO L290 TraceCheckUtils]: 34: Hoare triple {9633#true} assume !(0 == ~cond); {9633#true} is VALID [2022-04-08 11:24:02,591 INFO L290 TraceCheckUtils]: 33: Hoare triple {9633#true} ~cond := #in~cond; {9633#true} is VALID [2022-04-08 11:24:02,591 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:24:02,591 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:24:02,591 INFO L290 TraceCheckUtils]: 30: Hoare triple {9633#true} assume true; {9633#true} is VALID [2022-04-08 11:24:02,592 INFO L290 TraceCheckUtils]: 29: Hoare triple {9633#true} assume !(0 == ~cond); {9633#true} is VALID [2022-04-08 11:24:02,592 INFO L290 TraceCheckUtils]: 28: Hoare triple {9633#true} ~cond := #in~cond; {9633#true} is VALID [2022-04-08 11:24:02,592 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:24:02,592 INFO L290 TraceCheckUtils]: 26: Hoare triple {9977#(or (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (not (<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))))} assume !!(#t~post7 < 20);havoc #t~post7; {9977#(or (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (not (<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))))} is VALID [2022-04-08 11:24:02,593 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:24:02,593 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:24:02,594 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:24:02,594 INFO L290 TraceCheckUtils]: 22: Hoare triple {9633#true} assume true; {9633#true} is VALID [2022-04-08 11:24:02,594 INFO L290 TraceCheckUtils]: 21: Hoare triple {9633#true} assume !(0 == ~cond); {9633#true} is VALID [2022-04-08 11:24:02,594 INFO L290 TraceCheckUtils]: 20: Hoare triple {9633#true} ~cond := #in~cond; {9633#true} is VALID [2022-04-08 11:24:02,594 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:24:02,595 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:24:02,595 INFO L290 TraceCheckUtils]: 17: Hoare triple {9633#true} assume true; {9633#true} is VALID [2022-04-08 11:24:02,595 INFO L290 TraceCheckUtils]: 16: Hoare triple {9633#true} assume !(0 == ~cond); {9633#true} is VALID [2022-04-08 11:24:02,595 INFO L290 TraceCheckUtils]: 15: Hoare triple {9633#true} ~cond := #in~cond; {9633#true} is VALID [2022-04-08 11:24:02,595 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:24:02,595 INFO L290 TraceCheckUtils]: 13: Hoare triple {9893#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} assume !!(#t~post6 < 20);havoc #t~post6; {9893#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-08 11:24:02,596 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:24:02,596 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:24:02,596 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {9633#true} {9633#true} #77#return; {9633#true} is VALID [2022-04-08 11:24:02,596 INFO L290 TraceCheckUtils]: 9: Hoare triple {9633#true} assume true; {9633#true} is VALID [2022-04-08 11:24:02,596 INFO L290 TraceCheckUtils]: 8: Hoare triple {9633#true} assume !(0 == ~cond); {9633#true} is VALID [2022-04-08 11:24:02,597 INFO L290 TraceCheckUtils]: 7: Hoare triple {9633#true} ~cond := #in~cond; {9633#true} is VALID [2022-04-08 11:24:02,597 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:24:02,597 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:24:02,597 INFO L272 TraceCheckUtils]: 4: Hoare triple {9633#true} call #t~ret8 := main(); {9633#true} is VALID [2022-04-08 11:24:02,597 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9633#true} {9633#true} #93#return; {9633#true} is VALID [2022-04-08 11:24:02,597 INFO L290 TraceCheckUtils]: 2: Hoare triple {9633#true} assume true; {9633#true} is VALID [2022-04-08 11:24:02,597 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:24:02,597 INFO L272 TraceCheckUtils]: 0: Hoare triple {9633#true} call ULTIMATE.init(); {9633#true} is VALID [2022-04-08 11:24:02,598 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:24:02,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:24:02,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180551147] [2022-04-08 11:24:02,598 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:24:02,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1868829885] [2022-04-08 11:24:02,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1868829885] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 11:24:02,598 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 11:24:02,598 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9] total 18 [2022-04-08 11:24:02,598 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:24:02,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1617568867] [2022-04-08 11:24:02,599 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1617568867] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:24:02,599 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:24:02,599 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-08 11:24:02,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509334436] [2022-04-08 11:24:02,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:24:02,600 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:24:02,600 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:24:02,600 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:24:02,651 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:24:02,651 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-08 11:24:02,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:24:02,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-08 11:24:02,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2022-04-08 11:24:02,651 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:24:07,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:24:07,288 INFO L93 Difference]: Finished difference Result 161 states and 197 transitions. [2022-04-08 11:24:07,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-08 11:24:07,288 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:24:07,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:24:07,288 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:24:07,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 119 transitions. [2022-04-08 11:24:07,291 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:24:07,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 119 transitions. [2022-04-08 11:24:07,292 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 119 transitions. [2022-04-08 11:24:07,422 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:24:07,425 INFO L225 Difference]: With dead ends: 161 [2022-04-08 11:24:07,425 INFO L226 Difference]: Without dead ends: 158 [2022-04-08 11:24:07,426 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 138 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=86, Invalid=376, Unknown=0, NotChecked=0, Total=462 [2022-04-08 11:24:07,426 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.8s IncrementalHoareTripleChecker+Time [2022-04-08 11:24:07,427 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.8s Time] [2022-04-08 11:24:07,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2022-04-08 11:24:07,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 153. [2022-04-08 11:24:07,651 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:24:07,651 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:24:07,651 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:24:07,651 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:24:07,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:24:07,655 INFO L93 Difference]: Finished difference Result 158 states and 193 transitions. [2022-04-08 11:24:07,655 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 193 transitions. [2022-04-08 11:24:07,656 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:24:07,656 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:24:07,656 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:24:07,657 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:24:07,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:24:07,661 INFO L93 Difference]: Finished difference Result 158 states and 193 transitions. [2022-04-08 11:24:07,661 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 193 transitions. [2022-04-08 11:24:07,661 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:24:07,661 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:24:07,661 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:24:07,662 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:24:07,662 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:24:07,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 188 transitions. [2022-04-08 11:24:07,666 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 188 transitions. Word has length 79 [2022-04-08 11:24:07,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:24:07,666 INFO L478 AbstractCegarLoop]: Abstraction has 153 states and 188 transitions. [2022-04-08 11:24:07,666 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:24:07,666 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 153 states and 188 transitions. [2022-04-08 11:24:07,929 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:24:07,929 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 188 transitions. [2022-04-08 11:24:07,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-04-08 11:24:07,930 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:24:07,930 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:24:07,959 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:24:08,134 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:24:08,134 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:24:08,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:24:08,134 INFO L85 PathProgramCache]: Analyzing trace with hash -554329876, now seen corresponding path program 3 times [2022-04-08 11:24:08,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:24:08,135 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [524065945] [2022-04-08 11:24:24,520 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 11:24:24,520 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 11:24:24,520 INFO L85 PathProgramCache]: Analyzing trace with hash -554329876, now seen corresponding path program 4 times [2022-04-08 11:24:24,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:24:24,521 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803198360] [2022-04-08 11:24:24,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:24:24,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:24:24,536 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:24:24,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [201487089] [2022-04-08 11:24:24,536 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 11:24:24,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:24:24,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:24:24,543 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:24:24,569 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:24:24,622 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 11:24:24,622 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:24:24,624 INFO L263 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-08 11:24:24,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:24:24,638 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:24:25,090 INFO L272 TraceCheckUtils]: 0: Hoare triple {11076#true} call ULTIMATE.init(); {11076#true} is VALID [2022-04-08 11:24:25,090 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:24:25,090 INFO L290 TraceCheckUtils]: 2: Hoare triple {11076#true} assume true; {11076#true} is VALID [2022-04-08 11:24:25,090 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11076#true} {11076#true} #93#return; {11076#true} is VALID [2022-04-08 11:24:25,090 INFO L272 TraceCheckUtils]: 4: Hoare triple {11076#true} call #t~ret8 := main(); {11076#true} is VALID [2022-04-08 11:24:25,090 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:24:25,090 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:24:25,090 INFO L290 TraceCheckUtils]: 7: Hoare triple {11076#true} ~cond := #in~cond; {11076#true} is VALID [2022-04-08 11:24:25,090 INFO L290 TraceCheckUtils]: 8: Hoare triple {11076#true} assume !(0 == ~cond); {11076#true} is VALID [2022-04-08 11:24:25,090 INFO L290 TraceCheckUtils]: 9: Hoare triple {11076#true} assume true; {11076#true} is VALID [2022-04-08 11:24:25,091 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {11076#true} {11076#true} #77#return; {11076#true} is VALID [2022-04-08 11:24:25,091 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:24:25,091 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:24:25,092 INFO L290 TraceCheckUtils]: 13: Hoare triple {11114#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} assume !!(#t~post6 < 20);havoc #t~post6; {11114#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 11:24:25,092 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:24:25,092 INFO L290 TraceCheckUtils]: 15: Hoare triple {11076#true} ~cond := #in~cond; {11076#true} is VALID [2022-04-08 11:24:25,092 INFO L290 TraceCheckUtils]: 16: Hoare triple {11076#true} assume !(0 == ~cond); {11076#true} is VALID [2022-04-08 11:24:25,092 INFO L290 TraceCheckUtils]: 17: Hoare triple {11076#true} assume true; {11076#true} is VALID [2022-04-08 11:24:25,096 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:24:25,096 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:24:25,096 INFO L290 TraceCheckUtils]: 20: Hoare triple {11076#true} ~cond := #in~cond; {11076#true} is VALID [2022-04-08 11:24:25,096 INFO L290 TraceCheckUtils]: 21: Hoare triple {11076#true} assume !(0 == ~cond); {11076#true} is VALID [2022-04-08 11:24:25,096 INFO L290 TraceCheckUtils]: 22: Hoare triple {11076#true} assume true; {11076#true} is VALID [2022-04-08 11:24:25,097 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:24:25,097 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:24:25,098 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:24:25,098 INFO L290 TraceCheckUtils]: 26: Hoare triple {11154#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} assume !!(#t~post7 < 20);havoc #t~post7; {11154#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-08 11:24:25,098 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:24:25,099 INFO L290 TraceCheckUtils]: 28: Hoare triple {11076#true} ~cond := #in~cond; {11076#true} is VALID [2022-04-08 11:24:25,099 INFO L290 TraceCheckUtils]: 29: Hoare triple {11076#true} assume !(0 == ~cond); {11076#true} is VALID [2022-04-08 11:24:25,099 INFO L290 TraceCheckUtils]: 30: Hoare triple {11076#true} assume true; {11076#true} is VALID [2022-04-08 11:24:25,100 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:24:25,100 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:24:25,100 INFO L290 TraceCheckUtils]: 33: Hoare triple {11076#true} ~cond := #in~cond; {11076#true} is VALID [2022-04-08 11:24:25,100 INFO L290 TraceCheckUtils]: 34: Hoare triple {11076#true} assume !(0 == ~cond); {11076#true} is VALID [2022-04-08 11:24:25,100 INFO L290 TraceCheckUtils]: 35: Hoare triple {11076#true} assume true; {11076#true} is VALID [2022-04-08 11:24:25,101 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:24:25,101 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:24:25,101 INFO L290 TraceCheckUtils]: 38: Hoare triple {11076#true} ~cond := #in~cond; {11076#true} is VALID [2022-04-08 11:24:25,101 INFO L290 TraceCheckUtils]: 39: Hoare triple {11076#true} assume !(0 == ~cond); {11076#true} is VALID [2022-04-08 11:24:25,101 INFO L290 TraceCheckUtils]: 40: Hoare triple {11076#true} assume true; {11076#true} is VALID [2022-04-08 11:24:25,102 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:24:25,103 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:24:25,103 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:24:25,103 INFO L290 TraceCheckUtils]: 44: Hoare triple {11076#true} ~cond := #in~cond; {11076#true} is VALID [2022-04-08 11:24:25,103 INFO L290 TraceCheckUtils]: 45: Hoare triple {11076#true} assume !(0 == ~cond); {11076#true} is VALID [2022-04-08 11:24:25,103 INFO L290 TraceCheckUtils]: 46: Hoare triple {11076#true} assume true; {11076#true} is VALID [2022-04-08 11:24:25,104 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:24:25,104 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:24:25,105 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:24:25,105 INFO L290 TraceCheckUtils]: 50: Hoare triple {11227#(and (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (= main_~q~0 0) (= main_~a~0 2))} assume !!(#t~post7 < 20);havoc #t~post7; {11227#(and (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (= main_~q~0 0) (= main_~a~0 2))} is VALID [2022-04-08 11:24:25,105 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:24:25,106 INFO L290 TraceCheckUtils]: 52: Hoare triple {11076#true} ~cond := #in~cond; {11076#true} is VALID [2022-04-08 11:24:25,106 INFO L290 TraceCheckUtils]: 53: Hoare triple {11076#true} assume !(0 == ~cond); {11076#true} is VALID [2022-04-08 11:24:25,106 INFO L290 TraceCheckUtils]: 54: Hoare triple {11076#true} assume true; {11076#true} is VALID [2022-04-08 11:24:25,106 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:24:25,106 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:24:25,107 INFO L290 TraceCheckUtils]: 57: Hoare triple {11076#true} ~cond := #in~cond; {11076#true} is VALID [2022-04-08 11:24:25,107 INFO L290 TraceCheckUtils]: 58: Hoare triple {11076#true} assume !(0 == ~cond); {11076#true} is VALID [2022-04-08 11:24:25,107 INFO L290 TraceCheckUtils]: 59: Hoare triple {11076#true} assume true; {11076#true} is VALID [2022-04-08 11:24:25,107 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:24:25,108 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:24:25,108 INFO L290 TraceCheckUtils]: 62: Hoare triple {11076#true} ~cond := #in~cond; {11076#true} is VALID [2022-04-08 11:24:25,108 INFO L290 TraceCheckUtils]: 63: Hoare triple {11076#true} assume !(0 == ~cond); {11076#true} is VALID [2022-04-08 11:24:25,108 INFO L290 TraceCheckUtils]: 64: Hoare triple {11076#true} assume true; {11076#true} is VALID [2022-04-08 11:24:25,109 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:24:25,109 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:24:25,109 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:24:25,109 INFO L290 TraceCheckUtils]: 68: Hoare triple {11076#true} ~cond := #in~cond; {11076#true} is VALID [2022-04-08 11:24:25,109 INFO L290 TraceCheckUtils]: 69: Hoare triple {11076#true} assume !(0 == ~cond); {11076#true} is VALID [2022-04-08 11:24:25,109 INFO L290 TraceCheckUtils]: 70: Hoare triple {11076#true} assume true; {11076#true} is VALID [2022-04-08 11:24:25,110 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:24:25,111 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:24:25,111 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:24:25,112 INFO L290 TraceCheckUtils]: 74: Hoare triple {11300#(and (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 4)) (= main_~q~0 0) (= main_~a~0 4))} assume !(#t~post7 < 20);havoc #t~post7; {11300#(and (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 4)) (= main_~q~0 0) (= main_~a~0 4))} is VALID [2022-04-08 11:24:25,113 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:24:25,113 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:24:25,114 INFO L290 TraceCheckUtils]: 77: Hoare triple {11310#(and (= main_~x~0 (+ main_~r~0 (* main_~y~0 4))) (= main_~q~0 4))} assume !(#t~post6 < 20);havoc #t~post6; {11310#(and (= main_~x~0 (+ main_~r~0 (* main_~y~0 4))) (= main_~q~0 4))} is VALID [2022-04-08 11:24:25,114 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:24:25,115 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:24:25,115 INFO L290 TraceCheckUtils]: 80: Hoare triple {11324#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {11077#false} is VALID [2022-04-08 11:24:25,115 INFO L290 TraceCheckUtils]: 81: Hoare triple {11077#false} assume !false; {11077#false} is VALID [2022-04-08 11:24:25,116 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:24:25,116 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 11:24:39,890 INFO L290 TraceCheckUtils]: 81: Hoare triple {11077#false} assume !false; {11077#false} is VALID [2022-04-08 11:24:39,891 INFO L290 TraceCheckUtils]: 80: Hoare triple {11324#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {11077#false} is VALID [2022-04-08 11:24:39,891 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:24:39,892 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:24:39,892 INFO L290 TraceCheckUtils]: 77: Hoare triple {11340#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} assume !(#t~post6 < 20);havoc #t~post6; {11340#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-08 11:24:39,892 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:24:39,899 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:24:39,900 INFO L290 TraceCheckUtils]: 74: Hoare triple {11350#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} assume !(#t~post7 < 20);havoc #t~post7; {11350#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} is VALID [2022-04-08 11:24:39,900 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:24:39,903 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:24:39,903 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:24:39,903 INFO L290 TraceCheckUtils]: 70: Hoare triple {11076#true} assume true; {11076#true} is VALID [2022-04-08 11:24:39,903 INFO L290 TraceCheckUtils]: 69: Hoare triple {11076#true} assume !(0 == ~cond); {11076#true} is VALID [2022-04-08 11:24:39,903 INFO L290 TraceCheckUtils]: 68: Hoare triple {11076#true} ~cond := #in~cond; {11076#true} is VALID [2022-04-08 11:24:39,903 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:24:39,904 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:24:39,904 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:24:39,904 INFO L290 TraceCheckUtils]: 64: Hoare triple {11076#true} assume true; {11076#true} is VALID [2022-04-08 11:24:39,905 INFO L290 TraceCheckUtils]: 63: Hoare triple {11076#true} assume !(0 == ~cond); {11076#true} is VALID [2022-04-08 11:24:39,905 INFO L290 TraceCheckUtils]: 62: Hoare triple {11076#true} ~cond := #in~cond; {11076#true} is VALID [2022-04-08 11:24:39,905 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:24:39,905 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:24:39,905 INFO L290 TraceCheckUtils]: 59: Hoare triple {11076#true} assume true; {11076#true} is VALID [2022-04-08 11:24:39,905 INFO L290 TraceCheckUtils]: 58: Hoare triple {11076#true} assume !(0 == ~cond); {11076#true} is VALID [2022-04-08 11:24:39,905 INFO L290 TraceCheckUtils]: 57: Hoare triple {11076#true} ~cond := #in~cond; {11076#true} is VALID [2022-04-08 11:24:39,905 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:24:39,906 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:24:39,906 INFO L290 TraceCheckUtils]: 54: Hoare triple {11076#true} assume true; {11076#true} is VALID [2022-04-08 11:24:39,906 INFO L290 TraceCheckUtils]: 53: Hoare triple {11076#true} assume !(0 == ~cond); {11076#true} is VALID [2022-04-08 11:24:39,906 INFO L290 TraceCheckUtils]: 52: Hoare triple {11076#true} ~cond := #in~cond; {11076#true} is VALID [2022-04-08 11:24:39,906 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:24:39,907 INFO L290 TraceCheckUtils]: 50: Hoare triple {11360#(= (+ (* (- 2) main_~b~0) (* (+ (* main_~a~0 2) main_~q~0) main_~y~0) main_~r~0) main_~x~0)} assume !!(#t~post7 < 20);havoc #t~post7; {11360#(= (+ (* (- 2) main_~b~0) (* (+ (* main_~a~0 2) main_~q~0) main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-08 11:24:39,907 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:24:39,909 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:24:39,910 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:24:39,910 INFO L290 TraceCheckUtils]: 46: Hoare triple {11076#true} assume true; {11076#true} is VALID [2022-04-08 11:24:39,910 INFO L290 TraceCheckUtils]: 45: Hoare triple {11076#true} assume !(0 == ~cond); {11076#true} is VALID [2022-04-08 11:24:39,910 INFO L290 TraceCheckUtils]: 44: Hoare triple {11076#true} ~cond := #in~cond; {11076#true} is VALID [2022-04-08 11:24:39,910 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:24:39,911 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:24:39,911 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:24:39,911 INFO L290 TraceCheckUtils]: 40: Hoare triple {11076#true} assume true; {11076#true} is VALID [2022-04-08 11:24:39,911 INFO L290 TraceCheckUtils]: 39: Hoare triple {11076#true} assume !(0 == ~cond); {11076#true} is VALID [2022-04-08 11:24:39,911 INFO L290 TraceCheckUtils]: 38: Hoare triple {11076#true} ~cond := #in~cond; {11076#true} is VALID [2022-04-08 11:24:39,911 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:24:39,912 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:24:39,912 INFO L290 TraceCheckUtils]: 35: Hoare triple {11076#true} assume true; {11076#true} is VALID [2022-04-08 11:24:39,912 INFO L290 TraceCheckUtils]: 34: Hoare triple {11076#true} assume !(0 == ~cond); {11076#true} is VALID [2022-04-08 11:24:39,912 INFO L290 TraceCheckUtils]: 33: Hoare triple {11076#true} ~cond := #in~cond; {11076#true} is VALID [2022-04-08 11:24:39,912 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:24:39,913 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:24:39,913 INFO L290 TraceCheckUtils]: 30: Hoare triple {11076#true} assume true; {11076#true} is VALID [2022-04-08 11:24:39,913 INFO L290 TraceCheckUtils]: 29: Hoare triple {11076#true} assume !(0 == ~cond); {11076#true} is VALID [2022-04-08 11:24:39,913 INFO L290 TraceCheckUtils]: 28: Hoare triple {11076#true} ~cond := #in~cond; {11076#true} is VALID [2022-04-08 11:24:39,913 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:24:39,913 INFO L290 TraceCheckUtils]: 26: Hoare triple {11433#(= (+ (* main_~b~0 (- 4)) main_~r~0 (* main_~y~0 (+ (* main_~a~0 4) main_~q~0))) main_~x~0)} assume !!(#t~post7 < 20);havoc #t~post7; {11433#(= (+ (* main_~b~0 (- 4)) main_~r~0 (* main_~y~0 (+ (* main_~a~0 4) main_~q~0))) main_~x~0)} is VALID [2022-04-08 11:24:39,914 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:24:39,914 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:24:39,914 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:24:39,915 INFO L290 TraceCheckUtils]: 22: Hoare triple {11076#true} assume true; {11076#true} is VALID [2022-04-08 11:24:39,915 INFO L290 TraceCheckUtils]: 21: Hoare triple {11076#true} assume !(0 == ~cond); {11076#true} is VALID [2022-04-08 11:24:39,915 INFO L290 TraceCheckUtils]: 20: Hoare triple {11076#true} ~cond := #in~cond; {11076#true} is VALID [2022-04-08 11:24:39,915 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:24:39,915 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:24:39,915 INFO L290 TraceCheckUtils]: 17: Hoare triple {11076#true} assume true; {11076#true} is VALID [2022-04-08 11:24:39,915 INFO L290 TraceCheckUtils]: 16: Hoare triple {11076#true} assume !(0 == ~cond); {11076#true} is VALID [2022-04-08 11:24:39,915 INFO L290 TraceCheckUtils]: 15: Hoare triple {11076#true} ~cond := #in~cond; {11076#true} is VALID [2022-04-08 11:24:39,916 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:24:39,916 INFO L290 TraceCheckUtils]: 13: Hoare triple {11114#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} assume !!(#t~post6 < 20);havoc #t~post6; {11114#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 11:24:39,916 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:24:39,916 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:24:39,917 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {11076#true} {11076#true} #77#return; {11076#true} is VALID [2022-04-08 11:24:39,917 INFO L290 TraceCheckUtils]: 9: Hoare triple {11076#true} assume true; {11076#true} is VALID [2022-04-08 11:24:39,917 INFO L290 TraceCheckUtils]: 8: Hoare triple {11076#true} assume !(0 == ~cond); {11076#true} is VALID [2022-04-08 11:24:39,917 INFO L290 TraceCheckUtils]: 7: Hoare triple {11076#true} ~cond := #in~cond; {11076#true} is VALID [2022-04-08 11:24:39,917 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:24:39,917 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:24:39,917 INFO L272 TraceCheckUtils]: 4: Hoare triple {11076#true} call #t~ret8 := main(); {11076#true} is VALID [2022-04-08 11:24:39,917 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11076#true} {11076#true} #93#return; {11076#true} is VALID [2022-04-08 11:24:39,917 INFO L290 TraceCheckUtils]: 2: Hoare triple {11076#true} assume true; {11076#true} is VALID [2022-04-08 11:24:39,917 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:24:39,917 INFO L272 TraceCheckUtils]: 0: Hoare triple {11076#true} call ULTIMATE.init(); {11076#true} is VALID [2022-04-08 11:24:39,917 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:24:39,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:24:39,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803198360] [2022-04-08 11:24:39,918 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:24:39,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [201487089] [2022-04-08 11:24:39,918 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [201487089] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 11:24:39,918 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 11:24:39,918 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2022-04-08 11:24:39,918 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:24:39,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [524065945] [2022-04-08 11:24:39,919 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [524065945] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:24:39,919 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:24:39,919 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-08 11:24:39,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438611840] [2022-04-08 11:24:39,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:24:39,919 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:24:39,920 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:24:39,920 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:24:39,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:24:39,965 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-08 11:24:39,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:24:39,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-08 11:24:39,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2022-04-08 11:24:39,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:24:40,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:24:40,966 INFO L93 Difference]: Finished difference Result 201 states and 254 transitions. [2022-04-08 11:24:40,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-08 11:24:40,966 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:24:40,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:24:40,967 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:24:40,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 135 transitions. [2022-04-08 11:24:40,969 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:24:40,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 135 transitions. [2022-04-08 11:24:40,971 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 135 transitions. [2022-04-08 11:24:41,134 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:24:41,139 INFO L225 Difference]: With dead ends: 201 [2022-04-08 11:24:41,139 INFO L226 Difference]: Without dead ends: 198 [2022-04-08 11:24:41,139 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:24:41,140 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:24:41,140 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:24:41,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2022-04-08 11:24:41,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 168. [2022-04-08 11:24:41,386 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:24:41,387 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:24:41,387 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:24:41,387 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:24:41,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:24:41,392 INFO L93 Difference]: Finished difference Result 198 states and 249 transitions. [2022-04-08 11:24:41,393 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 249 transitions. [2022-04-08 11:24:41,393 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:24:41,393 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:24:41,394 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:24:41,394 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:24:41,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:24:41,399 INFO L93 Difference]: Finished difference Result 198 states and 249 transitions. [2022-04-08 11:24:41,399 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 249 transitions. [2022-04-08 11:24:41,400 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:24:41,400 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:24:41,400 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:24:41,400 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:24:41,401 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:24:41,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 206 transitions. [2022-04-08 11:24:41,405 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 206 transitions. Word has length 82 [2022-04-08 11:24:41,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:24:41,405 INFO L478 AbstractCegarLoop]: Abstraction has 168 states and 206 transitions. [2022-04-08 11:24:41,405 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:24:41,406 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 168 states and 206 transitions. [2022-04-08 11:24:41,689 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:24:41,689 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 206 transitions. [2022-04-08 11:24:41,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-04-08 11:24:41,690 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:24:41,690 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:24:41,708 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:24:41,891 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:24:41,891 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:24:41,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:24:41,892 INFO L85 PathProgramCache]: Analyzing trace with hash 1891783602, now seen corresponding path program 1 times [2022-04-08 11:24:41,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:24:41,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1073074799] [2022-04-08 11:25:08,957 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 11:25:08,957 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 11:25:08,958 INFO L85 PathProgramCache]: Analyzing trace with hash 1891783602, now seen corresponding path program 2 times [2022-04-08 11:25:08,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:25:08,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875667873] [2022-04-08 11:25:08,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:25:08,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:25:08,969 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:25:08,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [200608438] [2022-04-08 11:25:08,970 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 11:25:08,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:25:08,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:25:08,976 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:25:08,977 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:25:09,040 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 11:25:09,040 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:25:09,041 INFO L263 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-08 11:25:09,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:25:09,059 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:25:09,422 INFO L272 TraceCheckUtils]: 0: Hoare triple {12716#true} call ULTIMATE.init(); {12716#true} is VALID [2022-04-08 11:25:09,422 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:25:09,423 INFO L290 TraceCheckUtils]: 2: Hoare triple {12724#(<= ~counter~0 0)} assume true; {12724#(<= ~counter~0 0)} is VALID [2022-04-08 11:25:09,423 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12724#(<= ~counter~0 0)} {12716#true} #93#return; {12724#(<= ~counter~0 0)} is VALID [2022-04-08 11:25:09,423 INFO L272 TraceCheckUtils]: 4: Hoare triple {12724#(<= ~counter~0 0)} call #t~ret8 := main(); {12724#(<= ~counter~0 0)} is VALID [2022-04-08 11:25:09,424 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:25:09,424 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:25:09,424 INFO L290 TraceCheckUtils]: 7: Hoare triple {12724#(<= ~counter~0 0)} ~cond := #in~cond; {12724#(<= ~counter~0 0)} is VALID [2022-04-08 11:25:09,425 INFO L290 TraceCheckUtils]: 8: Hoare triple {12724#(<= ~counter~0 0)} assume !(0 == ~cond); {12724#(<= ~counter~0 0)} is VALID [2022-04-08 11:25:09,425 INFO L290 TraceCheckUtils]: 9: Hoare triple {12724#(<= ~counter~0 0)} assume true; {12724#(<= ~counter~0 0)} is VALID [2022-04-08 11:25:09,425 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:25:09,426 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:25:09,426 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:25:09,426 INFO L290 TraceCheckUtils]: 13: Hoare triple {12758#(<= ~counter~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {12758#(<= ~counter~0 1)} is VALID [2022-04-08 11:25:09,427 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:25:09,427 INFO L290 TraceCheckUtils]: 15: Hoare triple {12758#(<= ~counter~0 1)} ~cond := #in~cond; {12758#(<= ~counter~0 1)} is VALID [2022-04-08 11:25:09,427 INFO L290 TraceCheckUtils]: 16: Hoare triple {12758#(<= ~counter~0 1)} assume !(0 == ~cond); {12758#(<= ~counter~0 1)} is VALID [2022-04-08 11:25:09,428 INFO L290 TraceCheckUtils]: 17: Hoare triple {12758#(<= ~counter~0 1)} assume true; {12758#(<= ~counter~0 1)} is VALID [2022-04-08 11:25:09,428 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:25:09,429 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:25:09,429 INFO L290 TraceCheckUtils]: 20: Hoare triple {12758#(<= ~counter~0 1)} ~cond := #in~cond; {12758#(<= ~counter~0 1)} is VALID [2022-04-08 11:25:09,429 INFO L290 TraceCheckUtils]: 21: Hoare triple {12758#(<= ~counter~0 1)} assume !(0 == ~cond); {12758#(<= ~counter~0 1)} is VALID [2022-04-08 11:25:09,429 INFO L290 TraceCheckUtils]: 22: Hoare triple {12758#(<= ~counter~0 1)} assume true; {12758#(<= ~counter~0 1)} is VALID [2022-04-08 11:25:09,430 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:25:09,430 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:25:09,431 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:25:09,431 INFO L290 TraceCheckUtils]: 26: Hoare triple {12798#(<= ~counter~0 2)} assume !!(#t~post7 < 20);havoc #t~post7; {12798#(<= ~counter~0 2)} is VALID [2022-04-08 11:25:09,431 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:25:09,431 INFO L290 TraceCheckUtils]: 28: Hoare triple {12798#(<= ~counter~0 2)} ~cond := #in~cond; {12798#(<= ~counter~0 2)} is VALID [2022-04-08 11:25:09,432 INFO L290 TraceCheckUtils]: 29: Hoare triple {12798#(<= ~counter~0 2)} assume !(0 == ~cond); {12798#(<= ~counter~0 2)} is VALID [2022-04-08 11:25:09,432 INFO L290 TraceCheckUtils]: 30: Hoare triple {12798#(<= ~counter~0 2)} assume true; {12798#(<= ~counter~0 2)} is VALID [2022-04-08 11:25:09,432 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:25:09,433 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:25:09,433 INFO L290 TraceCheckUtils]: 33: Hoare triple {12798#(<= ~counter~0 2)} ~cond := #in~cond; {12798#(<= ~counter~0 2)} is VALID [2022-04-08 11:25:09,433 INFO L290 TraceCheckUtils]: 34: Hoare triple {12798#(<= ~counter~0 2)} assume !(0 == ~cond); {12798#(<= ~counter~0 2)} is VALID [2022-04-08 11:25:09,434 INFO L290 TraceCheckUtils]: 35: Hoare triple {12798#(<= ~counter~0 2)} assume true; {12798#(<= ~counter~0 2)} is VALID [2022-04-08 11:25:09,434 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:25:09,435 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:25:09,435 INFO L290 TraceCheckUtils]: 38: Hoare triple {12798#(<= ~counter~0 2)} ~cond := #in~cond; {12798#(<= ~counter~0 2)} is VALID [2022-04-08 11:25:09,435 INFO L290 TraceCheckUtils]: 39: Hoare triple {12798#(<= ~counter~0 2)} assume !(0 == ~cond); {12798#(<= ~counter~0 2)} is VALID [2022-04-08 11:25:09,435 INFO L290 TraceCheckUtils]: 40: Hoare triple {12798#(<= ~counter~0 2)} assume true; {12798#(<= ~counter~0 2)} is VALID [2022-04-08 11:25:09,436 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:25:09,436 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:25:09,436 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:25:09,437 INFO L290 TraceCheckUtils]: 44: Hoare triple {12798#(<= ~counter~0 2)} ~cond := #in~cond; {12798#(<= ~counter~0 2)} is VALID [2022-04-08 11:25:09,437 INFO L290 TraceCheckUtils]: 45: Hoare triple {12798#(<= ~counter~0 2)} assume !(0 == ~cond); {12798#(<= ~counter~0 2)} is VALID [2022-04-08 11:25:09,437 INFO L290 TraceCheckUtils]: 46: Hoare triple {12798#(<= ~counter~0 2)} assume true; {12798#(<= ~counter~0 2)} is VALID [2022-04-08 11:25:09,438 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:25:09,438 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:25:09,439 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:25:09,439 INFO L290 TraceCheckUtils]: 50: Hoare triple {12871#(<= ~counter~0 3)} assume !!(#t~post7 < 20);havoc #t~post7; {12871#(<= ~counter~0 3)} is VALID [2022-04-08 11:25:09,440 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:25:09,440 INFO L290 TraceCheckUtils]: 52: Hoare triple {12871#(<= ~counter~0 3)} ~cond := #in~cond; {12871#(<= ~counter~0 3)} is VALID [2022-04-08 11:25:09,441 INFO L290 TraceCheckUtils]: 53: Hoare triple {12871#(<= ~counter~0 3)} assume !(0 == ~cond); {12871#(<= ~counter~0 3)} is VALID [2022-04-08 11:25:09,441 INFO L290 TraceCheckUtils]: 54: Hoare triple {12871#(<= ~counter~0 3)} assume true; {12871#(<= ~counter~0 3)} is VALID [2022-04-08 11:25:09,441 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:25:09,442 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:25:09,442 INFO L290 TraceCheckUtils]: 57: Hoare triple {12871#(<= ~counter~0 3)} ~cond := #in~cond; {12871#(<= ~counter~0 3)} is VALID [2022-04-08 11:25:09,442 INFO L290 TraceCheckUtils]: 58: Hoare triple {12871#(<= ~counter~0 3)} assume !(0 == ~cond); {12871#(<= ~counter~0 3)} is VALID [2022-04-08 11:25:09,443 INFO L290 TraceCheckUtils]: 59: Hoare triple {12871#(<= ~counter~0 3)} assume true; {12871#(<= ~counter~0 3)} is VALID [2022-04-08 11:25:09,443 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:25:09,444 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:25:09,444 INFO L290 TraceCheckUtils]: 62: Hoare triple {12871#(<= ~counter~0 3)} ~cond := #in~cond; {12871#(<= ~counter~0 3)} is VALID [2022-04-08 11:25:09,444 INFO L290 TraceCheckUtils]: 63: Hoare triple {12871#(<= ~counter~0 3)} assume !(0 == ~cond); {12871#(<= ~counter~0 3)} is VALID [2022-04-08 11:25:09,444 INFO L290 TraceCheckUtils]: 64: Hoare triple {12871#(<= ~counter~0 3)} assume true; {12871#(<= ~counter~0 3)} is VALID [2022-04-08 11:25:09,445 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:25:09,445 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:25:09,445 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:25:09,446 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:25:09,446 INFO L290 TraceCheckUtils]: 69: Hoare triple {12929#(<= ~counter~0 4)} assume !!(#t~post6 < 20);havoc #t~post6; {12929#(<= ~counter~0 4)} is VALID [2022-04-08 11:25:09,447 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:25:09,447 INFO L290 TraceCheckUtils]: 71: Hoare triple {12929#(<= ~counter~0 4)} ~cond := #in~cond; {12929#(<= ~counter~0 4)} is VALID [2022-04-08 11:25:09,447 INFO L290 TraceCheckUtils]: 72: Hoare triple {12929#(<= ~counter~0 4)} assume !(0 == ~cond); {12929#(<= ~counter~0 4)} is VALID [2022-04-08 11:25:09,448 INFO L290 TraceCheckUtils]: 73: Hoare triple {12929#(<= ~counter~0 4)} assume true; {12929#(<= ~counter~0 4)} is VALID [2022-04-08 11:25:09,448 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:25:09,449 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:25:09,449 INFO L290 TraceCheckUtils]: 76: Hoare triple {12929#(<= ~counter~0 4)} ~cond := #in~cond; {12929#(<= ~counter~0 4)} is VALID [2022-04-08 11:25:09,449 INFO L290 TraceCheckUtils]: 77: Hoare triple {12929#(<= ~counter~0 4)} assume !(0 == ~cond); {12929#(<= ~counter~0 4)} is VALID [2022-04-08 11:25:09,449 INFO L290 TraceCheckUtils]: 78: Hoare triple {12929#(<= ~counter~0 4)} assume true; {12929#(<= ~counter~0 4)} is VALID [2022-04-08 11:25:09,450 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:25:09,450 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:25:09,450 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:25:09,451 INFO L290 TraceCheckUtils]: 82: Hoare triple {12969#(<= |main_#t~post7| 4)} assume !(#t~post7 < 20);havoc #t~post7; {12717#false} is VALID [2022-04-08 11:25:09,451 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:25:09,451 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:25:09,451 INFO L290 TraceCheckUtils]: 85: Hoare triple {12717#false} assume !(#t~post6 < 20);havoc #t~post6; {12717#false} is VALID [2022-04-08 11:25:09,451 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:25:09,451 INFO L290 TraceCheckUtils]: 87: Hoare triple {12717#false} ~cond := #in~cond; {12717#false} is VALID [2022-04-08 11:25:09,451 INFO L290 TraceCheckUtils]: 88: Hoare triple {12717#false} assume 0 == ~cond; {12717#false} is VALID [2022-04-08 11:25:09,451 INFO L290 TraceCheckUtils]: 89: Hoare triple {12717#false} assume !false; {12717#false} is VALID [2022-04-08 11:25:09,451 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:25:09,452 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 11:25:09,839 INFO L290 TraceCheckUtils]: 89: Hoare triple {12717#false} assume !false; {12717#false} is VALID [2022-04-08 11:25:09,840 INFO L290 TraceCheckUtils]: 88: Hoare triple {12717#false} assume 0 == ~cond; {12717#false} is VALID [2022-04-08 11:25:09,840 INFO L290 TraceCheckUtils]: 87: Hoare triple {12717#false} ~cond := #in~cond; {12717#false} is VALID [2022-04-08 11:25:09,840 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:25:09,840 INFO L290 TraceCheckUtils]: 85: Hoare triple {12717#false} assume !(#t~post6 < 20);havoc #t~post6; {12717#false} is VALID [2022-04-08 11:25:09,840 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:25:09,840 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:25:09,840 INFO L290 TraceCheckUtils]: 82: Hoare triple {13015#(< |main_#t~post7| 20)} assume !(#t~post7 < 20);havoc #t~post7; {12717#false} is VALID [2022-04-08 11:25:09,840 INFO L290 TraceCheckUtils]: 81: Hoare triple {13019#(< ~counter~0 20)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {13015#(< |main_#t~post7| 20)} is VALID [2022-04-08 11:25:09,841 INFO L290 TraceCheckUtils]: 80: Hoare triple {13019#(< ~counter~0 20)} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {13019#(< ~counter~0 20)} is VALID [2022-04-08 11:25:09,841 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {12716#true} {13019#(< ~counter~0 20)} #81#return; {13019#(< ~counter~0 20)} is VALID [2022-04-08 11:25:09,841 INFO L290 TraceCheckUtils]: 78: Hoare triple {12716#true} assume true; {12716#true} is VALID [2022-04-08 11:25:09,841 INFO L290 TraceCheckUtils]: 77: Hoare triple {12716#true} assume !(0 == ~cond); {12716#true} is VALID [2022-04-08 11:25:09,841 INFO L290 TraceCheckUtils]: 76: Hoare triple {12716#true} ~cond := #in~cond; {12716#true} is VALID [2022-04-08 11:25:09,842 INFO L272 TraceCheckUtils]: 75: Hoare triple {13019#(< ~counter~0 20)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {12716#true} is VALID [2022-04-08 11:25:09,842 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {12716#true} {13019#(< ~counter~0 20)} #79#return; {13019#(< ~counter~0 20)} is VALID [2022-04-08 11:25:09,842 INFO L290 TraceCheckUtils]: 73: Hoare triple {12716#true} assume true; {12716#true} is VALID [2022-04-08 11:25:09,842 INFO L290 TraceCheckUtils]: 72: Hoare triple {12716#true} assume !(0 == ~cond); {12716#true} is VALID [2022-04-08 11:25:09,842 INFO L290 TraceCheckUtils]: 71: Hoare triple {12716#true} ~cond := #in~cond; {12716#true} is VALID [2022-04-08 11:25:09,842 INFO L272 TraceCheckUtils]: 70: Hoare triple {13019#(< ~counter~0 20)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {12716#true} is VALID [2022-04-08 11:25:09,842 INFO L290 TraceCheckUtils]: 69: Hoare triple {13019#(< ~counter~0 20)} assume !!(#t~post6 < 20);havoc #t~post6; {13019#(< ~counter~0 20)} is VALID [2022-04-08 11:25:09,843 INFO L290 TraceCheckUtils]: 68: Hoare triple {13059#(< ~counter~0 19)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {13019#(< ~counter~0 20)} is VALID [2022-04-08 11:25:09,843 INFO L290 TraceCheckUtils]: 67: Hoare triple {13059#(< ~counter~0 19)} ~r~0 := ~r~0 - ~b~0;~q~0 := ~q~0 + ~a~0; {13059#(< ~counter~0 19)} is VALID [2022-04-08 11:25:09,844 INFO L290 TraceCheckUtils]: 66: Hoare triple {13059#(< ~counter~0 19)} assume !(~r~0 >= 2 * ~b~0); {13059#(< ~counter~0 19)} is VALID [2022-04-08 11:25:09,844 INFO L284 TraceCheckUtils]: 65: Hoare quadruple {12716#true} {13059#(< ~counter~0 19)} #87#return; {13059#(< ~counter~0 19)} is VALID [2022-04-08 11:25:09,844 INFO L290 TraceCheckUtils]: 64: Hoare triple {12716#true} assume true; {12716#true} is VALID [2022-04-08 11:25:09,844 INFO L290 TraceCheckUtils]: 63: Hoare triple {12716#true} assume !(0 == ~cond); {12716#true} is VALID [2022-04-08 11:25:09,844 INFO L290 TraceCheckUtils]: 62: Hoare triple {12716#true} ~cond := #in~cond; {12716#true} is VALID [2022-04-08 11:25:09,844 INFO L272 TraceCheckUtils]: 61: Hoare triple {13059#(< ~counter~0 19)} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {12716#true} is VALID [2022-04-08 11:25:09,845 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {12716#true} {13059#(< ~counter~0 19)} #85#return; {13059#(< ~counter~0 19)} is VALID [2022-04-08 11:25:09,845 INFO L290 TraceCheckUtils]: 59: Hoare triple {12716#true} assume true; {12716#true} is VALID [2022-04-08 11:25:09,845 INFO L290 TraceCheckUtils]: 58: Hoare triple {12716#true} assume !(0 == ~cond); {12716#true} is VALID [2022-04-08 11:25:09,845 INFO L290 TraceCheckUtils]: 57: Hoare triple {12716#true} ~cond := #in~cond; {12716#true} is VALID [2022-04-08 11:25:09,845 INFO L272 TraceCheckUtils]: 56: Hoare triple {13059#(< ~counter~0 19)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {12716#true} is VALID [2022-04-08 11:25:09,846 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {12716#true} {13059#(< ~counter~0 19)} #83#return; {13059#(< ~counter~0 19)} is VALID [2022-04-08 11:25:09,846 INFO L290 TraceCheckUtils]: 54: Hoare triple {12716#true} assume true; {12716#true} is VALID [2022-04-08 11:25:09,846 INFO L290 TraceCheckUtils]: 53: Hoare triple {12716#true} assume !(0 == ~cond); {12716#true} is VALID [2022-04-08 11:25:09,846 INFO L290 TraceCheckUtils]: 52: Hoare triple {12716#true} ~cond := #in~cond; {12716#true} is VALID [2022-04-08 11:25:09,846 INFO L272 TraceCheckUtils]: 51: Hoare triple {13059#(< ~counter~0 19)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {12716#true} is VALID [2022-04-08 11:25:09,846 INFO L290 TraceCheckUtils]: 50: Hoare triple {13059#(< ~counter~0 19)} assume !!(#t~post7 < 20);havoc #t~post7; {13059#(< ~counter~0 19)} is VALID [2022-04-08 11:25:09,847 INFO L290 TraceCheckUtils]: 49: Hoare triple {13117#(< ~counter~0 18)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {13059#(< ~counter~0 19)} is VALID [2022-04-08 11:25:09,847 INFO L290 TraceCheckUtils]: 48: Hoare triple {13117#(< ~counter~0 18)} ~a~0 := 2 * ~a~0;~b~0 := 2 * ~b~0; {13117#(< ~counter~0 18)} is VALID [2022-04-08 11:25:09,848 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {12716#true} {13117#(< ~counter~0 18)} #89#return; {13117#(< ~counter~0 18)} is VALID [2022-04-08 11:25:09,848 INFO L290 TraceCheckUtils]: 46: Hoare triple {12716#true} assume true; {12716#true} is VALID [2022-04-08 11:25:09,848 INFO L290 TraceCheckUtils]: 45: Hoare triple {12716#true} assume !(0 == ~cond); {12716#true} is VALID [2022-04-08 11:25:09,848 INFO L290 TraceCheckUtils]: 44: Hoare triple {12716#true} ~cond := #in~cond; {12716#true} is VALID [2022-04-08 11:25:09,848 INFO L272 TraceCheckUtils]: 43: Hoare triple {13117#(< ~counter~0 18)} call __VERIFIER_assert((if ~r~0 >= 2 * ~y~0 * ~a~0 then 1 else 0)); {12716#true} is VALID [2022-04-08 11:25:09,848 INFO L290 TraceCheckUtils]: 42: Hoare triple {13117#(< ~counter~0 18)} assume !!(~r~0 >= 2 * ~b~0); {13117#(< ~counter~0 18)} is VALID [2022-04-08 11:25:09,849 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {12716#true} {13117#(< ~counter~0 18)} #87#return; {13117#(< ~counter~0 18)} is VALID [2022-04-08 11:25:09,849 INFO L290 TraceCheckUtils]: 40: Hoare triple {12716#true} assume true; {12716#true} is VALID [2022-04-08 11:25:09,849 INFO L290 TraceCheckUtils]: 39: Hoare triple {12716#true} assume !(0 == ~cond); {12716#true} is VALID [2022-04-08 11:25:09,849 INFO L290 TraceCheckUtils]: 38: Hoare triple {12716#true} ~cond := #in~cond; {12716#true} is VALID [2022-04-08 11:25:09,849 INFO L272 TraceCheckUtils]: 37: Hoare triple {13117#(< ~counter~0 18)} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {12716#true} is VALID [2022-04-08 11:25:09,850 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {12716#true} {13117#(< ~counter~0 18)} #85#return; {13117#(< ~counter~0 18)} is VALID [2022-04-08 11:25:09,850 INFO L290 TraceCheckUtils]: 35: Hoare triple {12716#true} assume true; {12716#true} is VALID [2022-04-08 11:25:09,850 INFO L290 TraceCheckUtils]: 34: Hoare triple {12716#true} assume !(0 == ~cond); {12716#true} is VALID [2022-04-08 11:25:09,850 INFO L290 TraceCheckUtils]: 33: Hoare triple {12716#true} ~cond := #in~cond; {12716#true} is VALID [2022-04-08 11:25:09,850 INFO L272 TraceCheckUtils]: 32: Hoare triple {13117#(< ~counter~0 18)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {12716#true} is VALID [2022-04-08 11:25:09,850 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {12716#true} {13117#(< ~counter~0 18)} #83#return; {13117#(< ~counter~0 18)} is VALID [2022-04-08 11:25:09,850 INFO L290 TraceCheckUtils]: 30: Hoare triple {12716#true} assume true; {12716#true} is VALID [2022-04-08 11:25:09,850 INFO L290 TraceCheckUtils]: 29: Hoare triple {12716#true} assume !(0 == ~cond); {12716#true} is VALID [2022-04-08 11:25:09,850 INFO L290 TraceCheckUtils]: 28: Hoare triple {12716#true} ~cond := #in~cond; {12716#true} is VALID [2022-04-08 11:25:09,850 INFO L272 TraceCheckUtils]: 27: Hoare triple {13117#(< ~counter~0 18)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {12716#true} is VALID [2022-04-08 11:25:09,851 INFO L290 TraceCheckUtils]: 26: Hoare triple {13117#(< ~counter~0 18)} assume !!(#t~post7 < 20);havoc #t~post7; {13117#(< ~counter~0 18)} is VALID [2022-04-08 11:25:09,851 INFO L290 TraceCheckUtils]: 25: Hoare triple {13190#(< ~counter~0 17)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {13117#(< ~counter~0 18)} is VALID [2022-04-08 11:25:09,852 INFO L290 TraceCheckUtils]: 24: Hoare triple {13190#(< ~counter~0 17)} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {13190#(< ~counter~0 17)} is VALID [2022-04-08 11:25:09,852 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {12716#true} {13190#(< ~counter~0 17)} #81#return; {13190#(< ~counter~0 17)} is VALID [2022-04-08 11:25:09,852 INFO L290 TraceCheckUtils]: 22: Hoare triple {12716#true} assume true; {12716#true} is VALID [2022-04-08 11:25:09,852 INFO L290 TraceCheckUtils]: 21: Hoare triple {12716#true} assume !(0 == ~cond); {12716#true} is VALID [2022-04-08 11:25:09,852 INFO L290 TraceCheckUtils]: 20: Hoare triple {12716#true} ~cond := #in~cond; {12716#true} is VALID [2022-04-08 11:25:09,852 INFO L272 TraceCheckUtils]: 19: Hoare triple {13190#(< ~counter~0 17)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {12716#true} is VALID [2022-04-08 11:25:09,853 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {12716#true} {13190#(< ~counter~0 17)} #79#return; {13190#(< ~counter~0 17)} is VALID [2022-04-08 11:25:09,853 INFO L290 TraceCheckUtils]: 17: Hoare triple {12716#true} assume true; {12716#true} is VALID [2022-04-08 11:25:09,853 INFO L290 TraceCheckUtils]: 16: Hoare triple {12716#true} assume !(0 == ~cond); {12716#true} is VALID [2022-04-08 11:25:09,853 INFO L290 TraceCheckUtils]: 15: Hoare triple {12716#true} ~cond := #in~cond; {12716#true} is VALID [2022-04-08 11:25:09,853 INFO L272 TraceCheckUtils]: 14: Hoare triple {13190#(< ~counter~0 17)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {12716#true} is VALID [2022-04-08 11:25:09,853 INFO L290 TraceCheckUtils]: 13: Hoare triple {13190#(< ~counter~0 17)} assume !!(#t~post6 < 20);havoc #t~post6; {13190#(< ~counter~0 17)} is VALID [2022-04-08 11:25:09,854 INFO L290 TraceCheckUtils]: 12: Hoare triple {13230#(< ~counter~0 16)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {13190#(< ~counter~0 17)} is VALID [2022-04-08 11:25:09,854 INFO L290 TraceCheckUtils]: 11: Hoare triple {13230#(< ~counter~0 16)} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {13230#(< ~counter~0 16)} is VALID [2022-04-08 11:25:09,854 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {12716#true} {13230#(< ~counter~0 16)} #77#return; {13230#(< ~counter~0 16)} is VALID [2022-04-08 11:25:09,854 INFO L290 TraceCheckUtils]: 9: Hoare triple {12716#true} assume true; {12716#true} is VALID [2022-04-08 11:25:09,855 INFO L290 TraceCheckUtils]: 8: Hoare triple {12716#true} assume !(0 == ~cond); {12716#true} is VALID [2022-04-08 11:25:09,855 INFO L290 TraceCheckUtils]: 7: Hoare triple {12716#true} ~cond := #in~cond; {12716#true} is VALID [2022-04-08 11:25:09,855 INFO L272 TraceCheckUtils]: 6: Hoare triple {13230#(< ~counter~0 16)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {12716#true} is VALID [2022-04-08 11:25:09,855 INFO L290 TraceCheckUtils]: 5: Hoare triple {13230#(< ~counter~0 16)} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {13230#(< ~counter~0 16)} is VALID [2022-04-08 11:25:09,863 INFO L272 TraceCheckUtils]: 4: Hoare triple {13230#(< ~counter~0 16)} call #t~ret8 := main(); {13230#(< ~counter~0 16)} is VALID [2022-04-08 11:25:09,864 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13230#(< ~counter~0 16)} {12716#true} #93#return; {13230#(< ~counter~0 16)} is VALID [2022-04-08 11:25:09,864 INFO L290 TraceCheckUtils]: 2: Hoare triple {13230#(< ~counter~0 16)} assume true; {13230#(< ~counter~0 16)} is VALID [2022-04-08 11:25:09,865 INFO L290 TraceCheckUtils]: 1: Hoare triple {12716#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {13230#(< ~counter~0 16)} is VALID [2022-04-08 11:25:09,865 INFO L272 TraceCheckUtils]: 0: Hoare triple {12716#true} call ULTIMATE.init(); {12716#true} is VALID [2022-04-08 11:25:09,865 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:25:09,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:25:09,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875667873] [2022-04-08 11:25:09,865 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:25:09,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [200608438] [2022-04-08 11:25:09,865 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [200608438] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 11:25:09,865 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 11:25:09,865 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-04-08 11:25:09,866 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:25:09,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1073074799] [2022-04-08 11:25:09,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1073074799] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:25:09,866 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:25:09,866 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 11:25:09,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662247763] [2022-04-08 11:25:09,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:25:09,866 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:25:09,867 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:25:09,867 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:25:09,919 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:25:09,919 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 11:25:09,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:25:09,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 11:25:09,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-08 11:25:09,920 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:25:10,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:25:10,539 INFO L93 Difference]: Finished difference Result 269 states and 336 transitions. [2022-04-08 11:25:10,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-08 11:25:10,539 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:25:10,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:25:10,540 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:25:10,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 143 transitions. [2022-04-08 11:25:10,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:25:10,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 143 transitions. [2022-04-08 11:25:10,544 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 143 transitions. [2022-04-08 11:25:10,673 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:25:10,677 INFO L225 Difference]: With dead ends: 269 [2022-04-08 11:25:10,677 INFO L226 Difference]: Without dead ends: 196 [2022-04-08 11:25:10,678 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:25:10,679 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:25:10,679 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:25:10,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2022-04-08 11:25:10,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 196. [2022-04-08 11:25:10,995 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:25:10,996 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:25:10,996 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:25:10,996 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:25:11,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:25:11,001 INFO L93 Difference]: Finished difference Result 196 states and 232 transitions. [2022-04-08 11:25:11,001 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 232 transitions. [2022-04-08 11:25:11,002 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:25:11,002 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:25:11,003 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:25:11,003 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:25:11,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:25:11,008 INFO L93 Difference]: Finished difference Result 196 states and 232 transitions. [2022-04-08 11:25:11,008 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 232 transitions. [2022-04-08 11:25:11,008 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:25:11,008 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:25:11,008 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:25:11,008 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:25:11,009 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:25:11,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 232 transitions. [2022-04-08 11:25:11,014 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 232 transitions. Word has length 90 [2022-04-08 11:25:11,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:25:11,014 INFO L478 AbstractCegarLoop]: Abstraction has 196 states and 232 transitions. [2022-04-08 11:25:11,014 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:25:11,014 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 196 states and 232 transitions. [2022-04-08 11:25:11,364 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:25:11,365 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 232 transitions. [2022-04-08 11:25:11,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-04-08 11:25:11,365 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:25:11,366 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:25:11,392 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-04-08 11:25:11,566 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:25:11,566 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:25:11,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:25:11,567 INFO L85 PathProgramCache]: Analyzing trace with hash 447330249, now seen corresponding path program 3 times [2022-04-08 11:25:11,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:25:11,567 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [926114154] [2022-04-08 11:25:47,288 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 11:25:47,288 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 11:25:47,289 INFO L85 PathProgramCache]: Analyzing trace with hash 447330249, now seen corresponding path program 4 times [2022-04-08 11:25:47,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:25:47,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551523548] [2022-04-08 11:25:47,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:25:47,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:25:47,302 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:25:47,302 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2105024312] [2022-04-08 11:25:47,302 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 11:25:47,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:25:47,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:25:47,308 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:25:47,317 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:25:47,377 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 11:25:47,377 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:25:47,378 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-08 11:25:47,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:25:47,399 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:25:49,404 INFO L272 TraceCheckUtils]: 0: Hoare triple {14597#true} call ULTIMATE.init(); {14597#true} is VALID [2022-04-08 11:25:49,404 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:49,404 INFO L290 TraceCheckUtils]: 2: Hoare triple {14597#true} assume true; {14597#true} is VALID [2022-04-08 11:25:49,405 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14597#true} {14597#true} #93#return; {14597#true} is VALID [2022-04-08 11:25:49,405 INFO L272 TraceCheckUtils]: 4: Hoare triple {14597#true} call #t~ret8 := main(); {14597#true} is VALID [2022-04-08 11:25:49,405 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:49,405 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:49,405 INFO L290 TraceCheckUtils]: 7: Hoare triple {14597#true} ~cond := #in~cond; {14597#true} is VALID [2022-04-08 11:25:49,405 INFO L290 TraceCheckUtils]: 8: Hoare triple {14597#true} assume !(0 == ~cond); {14597#true} is VALID [2022-04-08 11:25:49,405 INFO L290 TraceCheckUtils]: 9: Hoare triple {14597#true} assume true; {14597#true} is VALID [2022-04-08 11:25:49,405 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {14597#true} {14597#true} #77#return; {14597#true} is VALID [2022-04-08 11:25:49,406 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:25:49,406 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:25:49,407 INFO L290 TraceCheckUtils]: 13: Hoare triple {14635#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} assume !!(#t~post6 < 20);havoc #t~post6; {14635#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 11:25:49,407 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:25:49,407 INFO L290 TraceCheckUtils]: 15: Hoare triple {14597#true} ~cond := #in~cond; {14597#true} is VALID [2022-04-08 11:25:49,407 INFO L290 TraceCheckUtils]: 16: Hoare triple {14597#true} assume !(0 == ~cond); {14597#true} is VALID [2022-04-08 11:25:49,407 INFO L290 TraceCheckUtils]: 17: Hoare triple {14597#true} assume true; {14597#true} is VALID [2022-04-08 11:25:49,408 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:25:49,408 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:25:49,408 INFO L290 TraceCheckUtils]: 20: Hoare triple {14597#true} ~cond := #in~cond; {14597#true} is VALID [2022-04-08 11:25:49,408 INFO L290 TraceCheckUtils]: 21: Hoare triple {14597#true} assume !(0 == ~cond); {14597#true} is VALID [2022-04-08 11:25:49,408 INFO L290 TraceCheckUtils]: 22: Hoare triple {14597#true} assume true; {14597#true} is VALID [2022-04-08 11:25:49,409 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:25:49,409 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:25:49,410 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:25:49,410 INFO L290 TraceCheckUtils]: 26: Hoare triple {14675#(and (<= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} assume !!(#t~post7 < 20);havoc #t~post7; {14675#(and (<= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-08 11:25:49,410 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:25:49,410 INFO L290 TraceCheckUtils]: 28: Hoare triple {14597#true} ~cond := #in~cond; {14597#true} is VALID [2022-04-08 11:25:49,410 INFO L290 TraceCheckUtils]: 29: Hoare triple {14597#true} assume !(0 == ~cond); {14597#true} is VALID [2022-04-08 11:25:49,410 INFO L290 TraceCheckUtils]: 30: Hoare triple {14597#true} assume true; {14597#true} is VALID [2022-04-08 11:25:49,411 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:25:49,411 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:25:49,411 INFO L290 TraceCheckUtils]: 33: Hoare triple {14597#true} ~cond := #in~cond; {14597#true} is VALID [2022-04-08 11:25:49,411 INFO L290 TraceCheckUtils]: 34: Hoare triple {14597#true} assume !(0 == ~cond); {14597#true} is VALID [2022-04-08 11:25:49,411 INFO L290 TraceCheckUtils]: 35: Hoare triple {14597#true} assume true; {14597#true} is VALID [2022-04-08 11:25:49,412 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:25:49,412 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:25:49,412 INFO L290 TraceCheckUtils]: 38: Hoare triple {14597#true} ~cond := #in~cond; {14597#true} is VALID [2022-04-08 11:25:49,412 INFO L290 TraceCheckUtils]: 39: Hoare triple {14597#true} assume !(0 == ~cond); {14597#true} is VALID [2022-04-08 11:25:49,412 INFO L290 TraceCheckUtils]: 40: Hoare triple {14597#true} assume true; {14597#true} is VALID [2022-04-08 11:25:49,413 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:25:49,413 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:25:49,414 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:25:49,414 INFO L290 TraceCheckUtils]: 44: Hoare triple {14597#true} ~cond := #in~cond; {14597#true} is VALID [2022-04-08 11:25:49,414 INFO L290 TraceCheckUtils]: 45: Hoare triple {14597#true} assume !(0 == ~cond); {14597#true} is VALID [2022-04-08 11:25:49,414 INFO L290 TraceCheckUtils]: 46: Hoare triple {14597#true} assume true; {14597#true} is VALID [2022-04-08 11:25:49,414 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:25:49,415 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:25:49,416 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:25:49,416 INFO L290 TraceCheckUtils]: 50: Hoare triple {14748#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (<= (div main_~a~0 2) 1) (= main_~q~0 0))} assume !!(#t~post7 < 20);havoc #t~post7; {14748#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (<= (div main_~a~0 2) 1) (= main_~q~0 0))} is VALID [2022-04-08 11:25:49,417 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:25:49,417 INFO L290 TraceCheckUtils]: 52: Hoare triple {14597#true} ~cond := #in~cond; {14597#true} is VALID [2022-04-08 11:25:49,417 INFO L290 TraceCheckUtils]: 53: Hoare triple {14597#true} assume !(0 == ~cond); {14597#true} is VALID [2022-04-08 11:25:49,417 INFO L290 TraceCheckUtils]: 54: Hoare triple {14597#true} assume true; {14597#true} is VALID [2022-04-08 11:25:49,417 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:25:49,418 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:25:49,418 INFO L290 TraceCheckUtils]: 57: Hoare triple {14597#true} ~cond := #in~cond; {14597#true} is VALID [2022-04-08 11:25:49,418 INFO L290 TraceCheckUtils]: 58: Hoare triple {14597#true} assume !(0 == ~cond); {14597#true} is VALID [2022-04-08 11:25:49,418 INFO L290 TraceCheckUtils]: 59: Hoare triple {14597#true} assume true; {14597#true} is VALID [2022-04-08 11:25:49,418 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:25:49,419 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:25:49,419 INFO L290 TraceCheckUtils]: 62: Hoare triple {14597#true} ~cond := #in~cond; {14597#true} is VALID [2022-04-08 11:25:49,419 INFO L290 TraceCheckUtils]: 63: Hoare triple {14597#true} assume !(0 == ~cond); {14597#true} is VALID [2022-04-08 11:25:49,419 INFO L290 TraceCheckUtils]: 64: Hoare triple {14597#true} assume true; {14597#true} is VALID [2022-04-08 11:25:49,419 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:25:49,420 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:25:49,421 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:25:49,422 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:25:49,422 INFO L290 TraceCheckUtils]: 69: Hoare triple {14807#(and (not (<= (* main_~y~0 4) main_~x~0)) (<= (div main_~q~0 2) 1) (= (mod main_~q~0 2) 0) (= main_~r~0 (+ main_~x~0 (* (- 2) main_~y~0))))} assume !!(#t~post6 < 20);havoc #t~post6; {14807#(and (not (<= (* main_~y~0 4) main_~x~0)) (<= (div main_~q~0 2) 1) (= (mod main_~q~0 2) 0) (= main_~r~0 (+ main_~x~0 (* (- 2) main_~y~0))))} is VALID [2022-04-08 11:25:49,422 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:25:49,422 INFO L290 TraceCheckUtils]: 71: Hoare triple {14597#true} ~cond := #in~cond; {14597#true} is VALID [2022-04-08 11:25:49,423 INFO L290 TraceCheckUtils]: 72: Hoare triple {14597#true} assume !(0 == ~cond); {14597#true} is VALID [2022-04-08 11:25:49,423 INFO L290 TraceCheckUtils]: 73: Hoare triple {14597#true} assume true; {14597#true} is VALID [2022-04-08 11:25:49,423 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:25:49,423 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:25:49,423 INFO L290 TraceCheckUtils]: 76: Hoare triple {14597#true} ~cond := #in~cond; {14597#true} is VALID [2022-04-08 11:25:49,424 INFO L290 TraceCheckUtils]: 77: Hoare triple {14597#true} assume !(0 == ~cond); {14597#true} is VALID [2022-04-08 11:25:49,424 INFO L290 TraceCheckUtils]: 78: Hoare triple {14597#true} assume true; {14597#true} is VALID [2022-04-08 11:25:49,424 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:25:49,425 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:25:49,425 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:25:49,426 INFO L290 TraceCheckUtils]: 82: Hoare triple {14847#(and (= main_~a~0 1) (not (<= (* main_~y~0 4) main_~x~0)) (<= main_~y~0 main_~r~0) (= main_~b~0 main_~y~0) (<= (div main_~q~0 2) 1) (= (mod main_~q~0 2) 0) (= main_~r~0 (+ main_~x~0 (* (- 2) main_~y~0))))} assume !!(#t~post7 < 20);havoc #t~post7; {14847#(and (= main_~a~0 1) (not (<= (* main_~y~0 4) main_~x~0)) (<= main_~y~0 main_~r~0) (= main_~b~0 main_~y~0) (<= (div main_~q~0 2) 1) (= (mod main_~q~0 2) 0) (= main_~r~0 (+ main_~x~0 (* (- 2) main_~y~0))))} is VALID [2022-04-08 11:25:49,426 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:25:49,426 INFO L290 TraceCheckUtils]: 84: Hoare triple {14597#true} ~cond := #in~cond; {14597#true} is VALID [2022-04-08 11:25:49,426 INFO L290 TraceCheckUtils]: 85: Hoare triple {14597#true} assume !(0 == ~cond); {14597#true} is VALID [2022-04-08 11:25:49,426 INFO L290 TraceCheckUtils]: 86: Hoare triple {14597#true} assume true; {14597#true} is VALID [2022-04-08 11:25:49,427 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:25:49,427 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:25:49,427 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:25:49,428 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:25:49,428 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:49,429 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:25:49,429 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:25:49,429 INFO L290 TraceCheckUtils]: 94: Hoare triple {14597#true} ~cond := #in~cond; {14597#true} is VALID [2022-04-08 11:25:49,429 INFO L290 TraceCheckUtils]: 95: Hoare triple {14597#true} assume !(0 == ~cond); {14597#true} is VALID [2022-04-08 11:25:49,429 INFO L290 TraceCheckUtils]: 96: Hoare triple {14597#true} assume true; {14597#true} is VALID [2022-04-08 11:25:49,430 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:25:49,443 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:25:49,447 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:25:49,448 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:25:49,448 INFO L290 TraceCheckUtils]: 101: Hoare triple {14908#(and (<= 0 main_~r~0) (= (+ (* main_~y~0 (+ (- 1) main_~q~0)) main_~y~0 main_~r~0) main_~x~0) (< main_~x~0 (* main_~y~0 4)) (= (+ main_~r~0 (* main_~y~0 3)) main_~x~0))} assume !(#t~post6 < 20);havoc #t~post6; {14908#(and (<= 0 main_~r~0) (= (+ (* main_~y~0 (+ (- 1) main_~q~0)) main_~y~0 main_~r~0) main_~x~0) (< main_~x~0 (* main_~y~0 4)) (= (+ main_~r~0 (* main_~y~0 3)) main_~x~0))} is VALID [2022-04-08 11:25:49,449 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:25:49,450 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:49,450 INFO L290 TraceCheckUtils]: 104: Hoare triple {14922#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {14598#false} is VALID [2022-04-08 11:25:49,450 INFO L290 TraceCheckUtils]: 105: Hoare triple {14598#false} assume !false; {14598#false} is VALID [2022-04-08 11:25:49,451 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:25:49,451 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 11:26:08,001 INFO L290 TraceCheckUtils]: 105: Hoare triple {14598#false} assume !false; {14598#false} is VALID [2022-04-08 11:26:08,002 INFO L290 TraceCheckUtils]: 104: Hoare triple {14922#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {14598#false} is VALID [2022-04-08 11:26:08,002 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:26:08,003 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:26:08,003 INFO L290 TraceCheckUtils]: 101: Hoare triple {14938#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} assume !(#t~post6 < 20);havoc #t~post6; {14938#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-08 11:26:08,003 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:26:08,010 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:26:08,010 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:26:08,011 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:26:08,011 INFO L290 TraceCheckUtils]: 96: Hoare triple {14597#true} assume true; {14597#true} is VALID [2022-04-08 11:26:08,011 INFO L290 TraceCheckUtils]: 95: Hoare triple {14597#true} assume !(0 == ~cond); {14597#true} is VALID [2022-04-08 11:26:08,011 INFO L290 TraceCheckUtils]: 94: Hoare triple {14597#true} ~cond := #in~cond; {14597#true} is VALID [2022-04-08 11:26:08,011 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:26:08,013 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:26:08,013 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:26:08,013 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:26:08,014 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:26:08,014 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:26:08,014 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:26:08,014 INFO L290 TraceCheckUtils]: 86: Hoare triple {14597#true} assume true; {14597#true} is VALID [2022-04-08 11:26:08,014 INFO L290 TraceCheckUtils]: 85: Hoare triple {14597#true} assume !(0 == ~cond); {14597#true} is VALID [2022-04-08 11:26:08,014 INFO L290 TraceCheckUtils]: 84: Hoare triple {14597#true} ~cond := #in~cond; {14597#true} is VALID [2022-04-08 11:26:08,014 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:26:08,015 INFO L290 TraceCheckUtils]: 82: Hoare triple {14970#(or (= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0)))) (not (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)))} assume !!(#t~post7 < 20);havoc #t~post7; {14970#(or (= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0)))) (not (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)))} is VALID [2022-04-08 11:26:08,015 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:26:08,016 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:26:08,016 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {14597#true} {14597#true} #81#return; {14597#true} is VALID [2022-04-08 11:26:08,016 INFO L290 TraceCheckUtils]: 78: Hoare triple {14597#true} assume true; {14597#true} is VALID [2022-04-08 11:26:08,016 INFO L290 TraceCheckUtils]: 77: Hoare triple {14597#true} assume !(0 == ~cond); {14597#true} is VALID [2022-04-08 11:26:08,016 INFO L290 TraceCheckUtils]: 76: Hoare triple {14597#true} ~cond := #in~cond; {14597#true} is VALID [2022-04-08 11:26:08,016 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:26:08,016 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {14597#true} {14597#true} #79#return; {14597#true} is VALID [2022-04-08 11:26:08,016 INFO L290 TraceCheckUtils]: 73: Hoare triple {14597#true} assume true; {14597#true} is VALID [2022-04-08 11:26:08,016 INFO L290 TraceCheckUtils]: 72: Hoare triple {14597#true} assume !(0 == ~cond); {14597#true} is VALID [2022-04-08 11:26:08,016 INFO L290 TraceCheckUtils]: 71: Hoare triple {14597#true} ~cond := #in~cond; {14597#true} is VALID [2022-04-08 11:26:08,016 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:26:08,016 INFO L290 TraceCheckUtils]: 69: Hoare triple {14597#true} assume !!(#t~post6 < 20);havoc #t~post6; {14597#true} is VALID [2022-04-08 11:26:08,016 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:26:08,016 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:26:08,016 INFO L290 TraceCheckUtils]: 66: Hoare triple {14597#true} assume !(~r~0 >= 2 * ~b~0); {14597#true} is VALID [2022-04-08 11:26:08,016 INFO L284 TraceCheckUtils]: 65: Hoare quadruple {14597#true} {14597#true} #87#return; {14597#true} is VALID [2022-04-08 11:26:08,016 INFO L290 TraceCheckUtils]: 64: Hoare triple {14597#true} assume true; {14597#true} is VALID [2022-04-08 11:26:08,017 INFO L290 TraceCheckUtils]: 63: Hoare triple {14597#true} assume !(0 == ~cond); {14597#true} is VALID [2022-04-08 11:26:08,017 INFO L290 TraceCheckUtils]: 62: Hoare triple {14597#true} ~cond := #in~cond; {14597#true} is VALID [2022-04-08 11:26:08,017 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:26:08,017 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {14597#true} {14597#true} #85#return; {14597#true} is VALID [2022-04-08 11:26:08,017 INFO L290 TraceCheckUtils]: 59: Hoare triple {14597#true} assume true; {14597#true} is VALID [2022-04-08 11:26:08,017 INFO L290 TraceCheckUtils]: 58: Hoare triple {14597#true} assume !(0 == ~cond); {14597#true} is VALID [2022-04-08 11:26:08,017 INFO L290 TraceCheckUtils]: 57: Hoare triple {14597#true} ~cond := #in~cond; {14597#true} is VALID [2022-04-08 11:26:08,017 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:26:08,017 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {14597#true} {14597#true} #83#return; {14597#true} is VALID [2022-04-08 11:26:08,017 INFO L290 TraceCheckUtils]: 54: Hoare triple {14597#true} assume true; {14597#true} is VALID [2022-04-08 11:26:08,017 INFO L290 TraceCheckUtils]: 53: Hoare triple {14597#true} assume !(0 == ~cond); {14597#true} is VALID [2022-04-08 11:26:08,017 INFO L290 TraceCheckUtils]: 52: Hoare triple {14597#true} ~cond := #in~cond; {14597#true} is VALID [2022-04-08 11:26:08,017 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:26:08,017 INFO L290 TraceCheckUtils]: 50: Hoare triple {14597#true} assume !!(#t~post7 < 20);havoc #t~post7; {14597#true} is VALID [2022-04-08 11:26:08,017 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:26:08,017 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:26:08,017 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {14597#true} {14597#true} #89#return; {14597#true} is VALID [2022-04-08 11:26:08,017 INFO L290 TraceCheckUtils]: 46: Hoare triple {14597#true} assume true; {14597#true} is VALID [2022-04-08 11:26:08,018 INFO L290 TraceCheckUtils]: 45: Hoare triple {14597#true} assume !(0 == ~cond); {14597#true} is VALID [2022-04-08 11:26:08,018 INFO L290 TraceCheckUtils]: 44: Hoare triple {14597#true} ~cond := #in~cond; {14597#true} is VALID [2022-04-08 11:26:08,018 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:26:08,018 INFO L290 TraceCheckUtils]: 42: Hoare triple {14597#true} assume !!(~r~0 >= 2 * ~b~0); {14597#true} is VALID [2022-04-08 11:26:08,018 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {14597#true} {14597#true} #87#return; {14597#true} is VALID [2022-04-08 11:26:08,018 INFO L290 TraceCheckUtils]: 40: Hoare triple {14597#true} assume true; {14597#true} is VALID [2022-04-08 11:26:08,018 INFO L290 TraceCheckUtils]: 39: Hoare triple {14597#true} assume !(0 == ~cond); {14597#true} is VALID [2022-04-08 11:26:08,018 INFO L290 TraceCheckUtils]: 38: Hoare triple {14597#true} ~cond := #in~cond; {14597#true} is VALID [2022-04-08 11:26:08,018 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:26:08,018 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {14597#true} {14597#true} #85#return; {14597#true} is VALID [2022-04-08 11:26:08,018 INFO L290 TraceCheckUtils]: 35: Hoare triple {14597#true} assume true; {14597#true} is VALID [2022-04-08 11:26:08,018 INFO L290 TraceCheckUtils]: 34: Hoare triple {14597#true} assume !(0 == ~cond); {14597#true} is VALID [2022-04-08 11:26:08,018 INFO L290 TraceCheckUtils]: 33: Hoare triple {14597#true} ~cond := #in~cond; {14597#true} is VALID [2022-04-08 11:26:08,018 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:26:08,018 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {14597#true} {14597#true} #83#return; {14597#true} is VALID [2022-04-08 11:26:08,018 INFO L290 TraceCheckUtils]: 30: Hoare triple {14597#true} assume true; {14597#true} is VALID [2022-04-08 11:26:08,018 INFO L290 TraceCheckUtils]: 29: Hoare triple {14597#true} assume !(0 == ~cond); {14597#true} is VALID [2022-04-08 11:26:08,019 INFO L290 TraceCheckUtils]: 28: Hoare triple {14597#true} ~cond := #in~cond; {14597#true} is VALID [2022-04-08 11:26:08,019 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:26:08,019 INFO L290 TraceCheckUtils]: 26: Hoare triple {14597#true} assume !!(#t~post7 < 20);havoc #t~post7; {14597#true} is VALID [2022-04-08 11:26:08,019 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:26:08,019 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:26:08,019 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {14597#true} {14597#true} #81#return; {14597#true} is VALID [2022-04-08 11:26:08,019 INFO L290 TraceCheckUtils]: 22: Hoare triple {14597#true} assume true; {14597#true} is VALID [2022-04-08 11:26:08,019 INFO L290 TraceCheckUtils]: 21: Hoare triple {14597#true} assume !(0 == ~cond); {14597#true} is VALID [2022-04-08 11:26:08,019 INFO L290 TraceCheckUtils]: 20: Hoare triple {14597#true} ~cond := #in~cond; {14597#true} is VALID [2022-04-08 11:26:08,019 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:26:08,019 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {14597#true} {14597#true} #79#return; {14597#true} is VALID [2022-04-08 11:26:08,019 INFO L290 TraceCheckUtils]: 17: Hoare triple {14597#true} assume true; {14597#true} is VALID [2022-04-08 11:26:08,019 INFO L290 TraceCheckUtils]: 16: Hoare triple {14597#true} assume !(0 == ~cond); {14597#true} is VALID [2022-04-08 11:26:08,019 INFO L290 TraceCheckUtils]: 15: Hoare triple {14597#true} ~cond := #in~cond; {14597#true} is VALID [2022-04-08 11:26:08,019 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:26:08,019 INFO L290 TraceCheckUtils]: 13: Hoare triple {14597#true} assume !!(#t~post6 < 20);havoc #t~post6; {14597#true} is VALID [2022-04-08 11:26:08,019 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:26:08,019 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:26:08,020 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {14597#true} {14597#true} #77#return; {14597#true} is VALID [2022-04-08 11:26:08,020 INFO L290 TraceCheckUtils]: 9: Hoare triple {14597#true} assume true; {14597#true} is VALID [2022-04-08 11:26:08,020 INFO L290 TraceCheckUtils]: 8: Hoare triple {14597#true} assume !(0 == ~cond); {14597#true} is VALID [2022-04-08 11:26:08,020 INFO L290 TraceCheckUtils]: 7: Hoare triple {14597#true} ~cond := #in~cond; {14597#true} is VALID [2022-04-08 11:26:08,020 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:26:08,020 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:26:08,020 INFO L272 TraceCheckUtils]: 4: Hoare triple {14597#true} call #t~ret8 := main(); {14597#true} is VALID [2022-04-08 11:26:08,020 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14597#true} {14597#true} #93#return; {14597#true} is VALID [2022-04-08 11:26:08,020 INFO L290 TraceCheckUtils]: 2: Hoare triple {14597#true} assume true; {14597#true} is VALID [2022-04-08 11:26:08,020 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:26:08,020 INFO L272 TraceCheckUtils]: 0: Hoare triple {14597#true} call ULTIMATE.init(); {14597#true} is VALID [2022-04-08 11:26:08,020 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:26:08,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:26:08,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551523548] [2022-04-08 11:26:08,021 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:26:08,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2105024312] [2022-04-08 11:26:08,021 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2105024312] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 11:26:08,021 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 11:26:08,021 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9] total 18 [2022-04-08 11:26:08,021 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:26:08,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [926114154] [2022-04-08 11:26:08,021 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [926114154] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:26:08,021 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:26:08,021 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-08 11:26:08,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632890856] [2022-04-08 11:26:08,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:26:08,022 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:26:08,022 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:26:08,022 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:26:08,082 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:26:08,082 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-08 11:26:08,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:26:08,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-08 11:26:08,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2022-04-08 11:26:08,083 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:26:11,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:26:11,287 INFO L93 Difference]: Finished difference Result 281 states and 343 transitions. [2022-04-08 11:26:11,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-08 11:26:11,287 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:26:11,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:26:11,288 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:26:11,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 151 transitions. [2022-04-08 11:26:11,290 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:26:11,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 151 transitions. [2022-04-08 11:26:11,293 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 151 transitions. [2022-04-08 11:26:11,455 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:26:11,459 INFO L225 Difference]: With dead ends: 281 [2022-04-08 11:26:11,459 INFO L226 Difference]: Without dead ends: 185 [2022-04-08 11:26:11,460 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 194 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=67, Invalid=313, Unknown=0, NotChecked=0, Total=380 [2022-04-08 11:26:11,460 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:26:11,460 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:26:11,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2022-04-08 11:26:11,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 184. [2022-04-08 11:26:11,752 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:26:11,752 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:26:11,752 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:26:11,753 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:26:11,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:26:11,757 INFO L93 Difference]: Finished difference Result 185 states and 219 transitions. [2022-04-08 11:26:11,757 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 219 transitions. [2022-04-08 11:26:11,757 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:26:11,757 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:26:11,758 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:26:11,758 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:26:11,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:26:11,762 INFO L93 Difference]: Finished difference Result 185 states and 219 transitions. [2022-04-08 11:26:11,762 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 219 transitions. [2022-04-08 11:26:11,763 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:26:11,763 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:26:11,763 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:26:11,763 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:26:11,764 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:26:11,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 218 transitions. [2022-04-08 11:26:11,768 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 218 transitions. Word has length 106 [2022-04-08 11:26:11,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:26:11,768 INFO L478 AbstractCegarLoop]: Abstraction has 184 states and 218 transitions. [2022-04-08 11:26:11,769 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:26:11,769 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 184 states and 218 transitions. [2022-04-08 11:26:12,124 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:26:12,125 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 218 transitions. [2022-04-08 11:26:12,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-04-08 11:26:12,126 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:26:12,126 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:26:12,150 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:26:12,326 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:26:12,326 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:26:12,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:26:12,327 INFO L85 PathProgramCache]: Analyzing trace with hash 2077207105, now seen corresponding path program 3 times [2022-04-08 11:26:12,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:26:12,327 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [897721079] [2022-04-08 11:26:41,220 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 11:26:41,220 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 11:26:41,220 INFO L85 PathProgramCache]: Analyzing trace with hash 2077207105, now seen corresponding path program 4 times [2022-04-08 11:26:41,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:26:41,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593608409] [2022-04-08 11:26:41,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:26:41,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:26:41,233 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:26:41,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [527415215] [2022-04-08 11:26:41,234 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 11:26:41,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:26:41,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:26:41,240 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:26:41,240 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:26:41,300 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 11:26:41,300 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:26:41,301 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 37 conjunts are in the unsatisfiable core [2022-04-08 11:26:41,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:26:41,325 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:28:31,136 INFO L272 TraceCheckUtils]: 0: Hoare triple {16554#true} call ULTIMATE.init(); {16554#true} is VALID [2022-04-08 11:28:31,137 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:28:31,137 INFO L290 TraceCheckUtils]: 2: Hoare triple {16554#true} assume true; {16554#true} is VALID [2022-04-08 11:28:31,137 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16554#true} {16554#true} #93#return; {16554#true} is VALID [2022-04-08 11:28:31,137 INFO L272 TraceCheckUtils]: 4: Hoare triple {16554#true} call #t~ret8 := main(); {16554#true} is VALID [2022-04-08 11:28:31,137 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:28:31,137 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:28:31,137 INFO L290 TraceCheckUtils]: 7: Hoare triple {16554#true} ~cond := #in~cond; {16554#true} is VALID [2022-04-08 11:28:31,137 INFO L290 TraceCheckUtils]: 8: Hoare triple {16554#true} assume !(0 == ~cond); {16554#true} is VALID [2022-04-08 11:28:31,137 INFO L290 TraceCheckUtils]: 9: Hoare triple {16554#true} assume true; {16554#true} is VALID [2022-04-08 11:28:31,137 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {16554#true} {16554#true} #77#return; {16554#true} is VALID [2022-04-08 11:28:31,138 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:28:31,138 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:28:31,138 INFO L290 TraceCheckUtils]: 13: Hoare triple {16592#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} assume !!(#t~post6 < 20);havoc #t~post6; {16592#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 11:28:31,138 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:28:31,138 INFO L290 TraceCheckUtils]: 15: Hoare triple {16554#true} ~cond := #in~cond; {16554#true} is VALID [2022-04-08 11:28:31,139 INFO L290 TraceCheckUtils]: 16: Hoare triple {16554#true} assume !(0 == ~cond); {16554#true} is VALID [2022-04-08 11:28:31,139 INFO L290 TraceCheckUtils]: 17: Hoare triple {16554#true} assume true; {16554#true} is VALID [2022-04-08 11:28:31,139 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:28:31,139 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:28:31,139 INFO L290 TraceCheckUtils]: 20: Hoare triple {16554#true} ~cond := #in~cond; {16554#true} is VALID [2022-04-08 11:28:31,139 INFO L290 TraceCheckUtils]: 21: Hoare triple {16554#true} assume !(0 == ~cond); {16554#true} is VALID [2022-04-08 11:28:31,139 INFO L290 TraceCheckUtils]: 22: Hoare triple {16554#true} assume true; {16554#true} is VALID [2022-04-08 11:28:31,140 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:28:31,140 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:28:31,141 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:28:31,141 INFO L290 TraceCheckUtils]: 26: Hoare triple {16632#(and (<= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} assume !!(#t~post7 < 20);havoc #t~post7; {16632#(and (<= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-08 11:28:31,141 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:28:31,141 INFO L290 TraceCheckUtils]: 28: Hoare triple {16554#true} ~cond := #in~cond; {16554#true} is VALID [2022-04-08 11:28:31,141 INFO L290 TraceCheckUtils]: 29: Hoare triple {16554#true} assume !(0 == ~cond); {16554#true} is VALID [2022-04-08 11:28:31,141 INFO L290 TraceCheckUtils]: 30: Hoare triple {16554#true} assume true; {16554#true} is VALID [2022-04-08 11:28:31,142 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:28:31,142 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:28:31,142 INFO L290 TraceCheckUtils]: 33: Hoare triple {16554#true} ~cond := #in~cond; {16554#true} is VALID [2022-04-08 11:28:31,142 INFO L290 TraceCheckUtils]: 34: Hoare triple {16554#true} assume !(0 == ~cond); {16554#true} is VALID [2022-04-08 11:28:31,142 INFO L290 TraceCheckUtils]: 35: Hoare triple {16554#true} assume true; {16554#true} is VALID [2022-04-08 11:28:31,142 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:28:31,142 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:28:31,143 INFO L290 TraceCheckUtils]: 38: Hoare triple {16554#true} ~cond := #in~cond; {16554#true} is VALID [2022-04-08 11:28:31,143 INFO L290 TraceCheckUtils]: 39: Hoare triple {16554#true} assume !(0 == ~cond); {16554#true} is VALID [2022-04-08 11:28:31,143 INFO L290 TraceCheckUtils]: 40: Hoare triple {16554#true} assume true; {16554#true} is VALID [2022-04-08 11:28:31,143 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:28:31,144 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:28:31,144 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:28:31,144 INFO L290 TraceCheckUtils]: 44: Hoare triple {16554#true} ~cond := #in~cond; {16554#true} is VALID [2022-04-08 11:28:31,144 INFO L290 TraceCheckUtils]: 45: Hoare triple {16554#true} assume !(0 == ~cond); {16554#true} is VALID [2022-04-08 11:28:31,144 INFO L290 TraceCheckUtils]: 46: Hoare triple {16554#true} assume true; {16554#true} is VALID [2022-04-08 11:28:31,144 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:28:31,145 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:28:31,146 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:28:31,146 INFO L290 TraceCheckUtils]: 50: Hoare triple {16705#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (<= (div (* (- 1) main_~a~0) (- 2)) 1) (= main_~q~0 0))} assume !!(#t~post7 < 20);havoc #t~post7; {16705#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (<= (div (* (- 1) main_~a~0) (- 2)) 1) (= main_~q~0 0))} is VALID [2022-04-08 11:28:31,146 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:28:31,146 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:28:31,147 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:28:31,147 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:28:31,148 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:28:31,148 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:28:31,148 INFO L290 TraceCheckUtils]: 57: Hoare triple {16554#true} ~cond := #in~cond; {16554#true} is VALID [2022-04-08 11:28:31,148 INFO L290 TraceCheckUtils]: 58: Hoare triple {16554#true} assume !(0 == ~cond); {16554#true} is VALID [2022-04-08 11:28:31,148 INFO L290 TraceCheckUtils]: 59: Hoare triple {16554#true} assume true; {16554#true} is VALID [2022-04-08 11:28:31,149 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:28:31,149 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:28:31,149 INFO L290 TraceCheckUtils]: 62: Hoare triple {16554#true} ~cond := #in~cond; {16554#true} is VALID [2022-04-08 11:28:31,149 INFO L290 TraceCheckUtils]: 63: Hoare triple {16554#true} assume !(0 == ~cond); {16554#true} is VALID [2022-04-08 11:28:31,149 INFO L290 TraceCheckUtils]: 64: Hoare triple {16554#true} assume true; {16554#true} is VALID [2022-04-08 11:28:31,149 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:28:31,150 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:28:31,150 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:28:31,150 INFO L290 TraceCheckUtils]: 68: Hoare triple {16554#true} ~cond := #in~cond; {16554#true} is VALID [2022-04-08 11:28:31,150 INFO L290 TraceCheckUtils]: 69: Hoare triple {16554#true} assume !(0 == ~cond); {16554#true} is VALID [2022-04-08 11:28:31,150 INFO L290 TraceCheckUtils]: 70: Hoare triple {16554#true} assume true; {16554#true} is VALID [2022-04-08 11:28:31,151 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:28:31,154 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:28:31,155 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:28:31,156 INFO L290 TraceCheckUtils]: 74: Hoare triple {16781#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (<= (div (* (- 1) (div (* (- 1) main_~a~0) (- 2))) (- 2)) 1) (= (mod (div (- main_~a~0) (- 2)) 2) 0) (= (* (div (- main_~a~0) (- 2)) main_~y~0) (* main_~y~0 2)) (= main_~q~0 0) (= (* (* (div (- main_~a~0) (- 2)) main_~y~0) 2) main_~b~0))} assume !!(#t~post7 < 20);havoc #t~post7; {16781#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (<= (div (* (- 1) (div (* (- 1) main_~a~0) (- 2))) (- 2)) 1) (= (mod (div (- main_~a~0) (- 2)) 2) 0) (= (* (div (- main_~a~0) (- 2)) main_~y~0) (* main_~y~0 2)) (= main_~q~0 0) (= (* (* (div (- main_~a~0) (- 2)) main_~y~0) 2) main_~b~0))} is VALID [2022-04-08 11:28:31,156 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:28:31,156 INFO L290 TraceCheckUtils]: 76: Hoare triple {16554#true} ~cond := #in~cond; {16554#true} is VALID [2022-04-08 11:28:31,156 INFO L290 TraceCheckUtils]: 77: Hoare triple {16554#true} assume !(0 == ~cond); {16554#true} is VALID [2022-04-08 11:28:31,156 INFO L290 TraceCheckUtils]: 78: Hoare triple {16554#true} assume true; {16554#true} is VALID [2022-04-08 11:28:31,156 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:28:31,156 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:28:31,156 INFO L290 TraceCheckUtils]: 81: Hoare triple {16554#true} ~cond := #in~cond; {16554#true} is VALID [2022-04-08 11:28:31,157 INFO L290 TraceCheckUtils]: 82: Hoare triple {16554#true} assume !(0 == ~cond); {16554#true} is VALID [2022-04-08 11:28:31,157 INFO L290 TraceCheckUtils]: 83: Hoare triple {16554#true} assume true; {16554#true} is VALID [2022-04-08 11:28:31,157 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:28:31,157 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:28:31,157 INFO L290 TraceCheckUtils]: 86: Hoare triple {16554#true} ~cond := #in~cond; {16554#true} is VALID [2022-04-08 11:28:31,157 INFO L290 TraceCheckUtils]: 87: Hoare triple {16554#true} assume !(0 == ~cond); {16554#true} is VALID [2022-04-08 11:28:31,157 INFO L290 TraceCheckUtils]: 88: Hoare triple {16554#true} assume true; {16554#true} is VALID [2022-04-08 11:28:31,158 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:28:31,158 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:28:31,165 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:28:31,165 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:28:31,166 INFO L290 TraceCheckUtils]: 93: Hoare triple {16840#(and (not (<= main_~x~0 (* main_~r~0 2))) (= (* 2 (* (div (- main_~q~0) (- 2)) main_~y~0)) (+ main_~x~0 (* (- 1) main_~r~0))) (<= (div (* (- 1) (div (* (- 1) main_~q~0) (- 2))) (- 2)) 1) (= (mod (div (- main_~q~0) (- 2)) 2) 0) (= (mod main_~q~0 2) 0) (= (* main_~y~0 2) (* (div (- main_~q~0) (- 2)) main_~y~0)))} assume !!(#t~post6 < 20);havoc #t~post6; {16840#(and (not (<= main_~x~0 (* main_~r~0 2))) (= (* 2 (* (div (- main_~q~0) (- 2)) main_~y~0)) (+ main_~x~0 (* (- 1) main_~r~0))) (<= (div (* (- 1) (div (* (- 1) main_~q~0) (- 2))) (- 2)) 1) (= (mod (div (- main_~q~0) (- 2)) 2) 0) (= (mod main_~q~0 2) 0) (= (* main_~y~0 2) (* (div (- main_~q~0) (- 2)) main_~y~0)))} is VALID [2022-04-08 11:28:31,166 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:28:31,166 INFO L290 TraceCheckUtils]: 95: Hoare triple {16554#true} ~cond := #in~cond; {16554#true} is VALID [2022-04-08 11:28:31,166 INFO L290 TraceCheckUtils]: 96: Hoare triple {16554#true} assume !(0 == ~cond); {16554#true} is VALID [2022-04-08 11:28:31,166 INFO L290 TraceCheckUtils]: 97: Hoare triple {16554#true} assume true; {16554#true} is VALID [2022-04-08 11:28:31,167 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:28:31,167 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:28:31,167 INFO L290 TraceCheckUtils]: 100: Hoare triple {16554#true} ~cond := #in~cond; {16554#true} is VALID [2022-04-08 11:28:31,167 INFO L290 TraceCheckUtils]: 101: Hoare triple {16554#true} assume !(0 == ~cond); {16554#true} is VALID [2022-04-08 11:28:31,167 INFO L290 TraceCheckUtils]: 102: Hoare triple {16554#true} assume true; {16554#true} is VALID [2022-04-08 11:28:31,167 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:28:31,168 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:28:31,168 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:28:31,169 INFO L290 TraceCheckUtils]: 106: Hoare triple {16880#(and (= main_~a~0 1) (<= main_~y~0 main_~r~0) (= (* main_~y~0 (div (* (- 1) main_~q~0) (- 2))) (* main_~y~0 2)) (= main_~b~0 main_~y~0) (= (mod main_~q~0 2) 0) (= main_~x~0 (+ (* 2 (* main_~y~0 (div (* (- 1) main_~q~0) (- 2)))) main_~r~0)) (< (* main_~r~0 2) main_~x~0))} assume !(#t~post7 < 20);havoc #t~post7; {16880#(and (= main_~a~0 1) (<= main_~y~0 main_~r~0) (= (* main_~y~0 (div (* (- 1) main_~q~0) (- 2))) (* main_~y~0 2)) (= main_~b~0 main_~y~0) (= (mod main_~q~0 2) 0) (= main_~x~0 (+ (* 2 (* main_~y~0 (div (* (- 1) main_~q~0) (- 2)))) main_~r~0)) (< (* main_~r~0 2) main_~x~0))} is VALID [2022-04-08 11:28:31,172 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:28:31,172 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:28:31,173 INFO L290 TraceCheckUtils]: 109: Hoare triple {16890#(and (= (* main_~y~0 2) (* (div (+ (* (- 1) main_~q~0) 1) (- 2)) main_~y~0)) (< main_~x~0 (* 4 (* (div (+ (* (- 1) main_~q~0) 1) (- 2)) main_~y~0))) (<= (+ main_~y~0 (* 2 (* (div (+ (* (- 1) main_~q~0) 1) (- 2)) main_~y~0))) main_~x~0) (= (mod (+ main_~q~0 1) 2) 0) (= (+ main_~x~0 (* (- 2) (div (+ (* (- 1) main_~q~0) 1) (- 2)) main_~y~0) (* (- 1) main_~y~0)) main_~r~0))} assume !(#t~post6 < 20);havoc #t~post6; {16890#(and (= (* main_~y~0 2) (* (div (+ (* (- 1) main_~q~0) 1) (- 2)) main_~y~0)) (< main_~x~0 (* 4 (* (div (+ (* (- 1) main_~q~0) 1) (- 2)) main_~y~0))) (<= (+ main_~y~0 (* 2 (* (div (+ (* (- 1) main_~q~0) 1) (- 2)) main_~y~0))) main_~x~0) (= (mod (+ main_~q~0 1) 2) 0) (= (+ main_~x~0 (* (- 2) (div (+ (* (- 1) main_~q~0) 1) (- 2)) main_~y~0) (* (- 1) main_~y~0)) main_~r~0))} is VALID [2022-04-08 11:28:31,308 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:28:31,309 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:28:31,309 INFO L290 TraceCheckUtils]: 112: Hoare triple {16904#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {16555#false} is VALID [2022-04-08 11:28:31,309 INFO L290 TraceCheckUtils]: 113: Hoare triple {16555#false} assume !false; {16555#false} is VALID [2022-04-08 11:28:31,310 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:28:31,310 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 11:28:51,256 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-08 11:29:29,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:29:29,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593608409] [2022-04-08 11:29:29,791 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:29:29,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [527415215] [2022-04-08 11:29:29,792 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [527415215] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 11:29:29,792 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 11:29:29,792 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2022-04-08 11:29:29,792 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:29:29,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [897721079] [2022-04-08 11:29:29,792 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [897721079] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:29:29,792 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:29:29,792 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-08 11:29:29,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025499590] [2022-04-08 11:29:29,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:29:29,793 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:29:29,793 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:29:29,793 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:29:30,059 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:29:30,059 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-08 11:29:30,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:29:30,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-08 11:29:30,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=513, Unknown=0, NotChecked=0, Total=650 [2022-04-08 11:29:30,060 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:29:38,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:29:38,248 INFO L93 Difference]: Finished difference Result 230 states and 283 transitions. [2022-04-08 11:29:38,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-08 11:29:38,248 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:29:38,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:29:38,248 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:29:38,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 172 transitions. [2022-04-08 11:29:38,265 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:29:38,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 172 transitions. [2022-04-08 11:29:38,268 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 172 transitions. [2022-04-08 11:29:38,689 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:29:38,693 INFO L225 Difference]: With dead ends: 230 [2022-04-08 11:29:38,693 INFO L226 Difference]: Without dead ends: 217 [2022-04-08 11:29:38,693 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 179 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=151, Invalid=605, Unknown=0, NotChecked=0, Total=756 [2022-04-08 11:29:38,693 INFO L913 BasicCegarLoop]: 64 mSDtfsCounter, 53 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 630 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s 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.1s IncrementalHoareTripleChecker+Time [2022-04-08 11:29:38,693 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.1s Time] [2022-04-08 11:29:38,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2022-04-08 11:29:39,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 206. [2022-04-08 11:29:39,022 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:29:39,023 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:29:39,023 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:29:39,023 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:29:39,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:29:39,029 INFO L93 Difference]: Finished difference Result 217 states and 264 transitions. [2022-04-08 11:29:39,029 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 264 transitions. [2022-04-08 11:29:39,029 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:29:39,029 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:29:39,031 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:29:39,031 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:29:39,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:29:39,037 INFO L93 Difference]: Finished difference Result 217 states and 264 transitions. [2022-04-08 11:29:39,037 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 264 transitions. [2022-04-08 11:29:39,037 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:29:39,037 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:29:39,037 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:29:39,038 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:29:39,038 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:29:39,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 252 transitions. [2022-04-08 11:29:39,043 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 252 transitions. Word has length 114 [2022-04-08 11:29:39,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:29:39,044 INFO L478 AbstractCegarLoop]: Abstraction has 206 states and 252 transitions. [2022-04-08 11:29:39,044 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:29:39,044 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 206 states and 252 transitions. [2022-04-08 11:29:39,526 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:29:39,527 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 252 transitions. [2022-04-08 11:29:39,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-04-08 11:29:39,528 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:29:39,528 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:29:39,553 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:29:39,728 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:29:39,729 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:29:39,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:29:39,729 INFO L85 PathProgramCache]: Analyzing trace with hash 1338024082, now seen corresponding path program 5 times [2022-04-08 11:29:39,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:29:39,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1548836828] [2022-04-08 11:30:13,187 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 11:30:13,187 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 11:30:13,187 INFO L85 PathProgramCache]: Analyzing trace with hash 1338024082, now seen corresponding path program 6 times [2022-04-08 11:30:13,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:30:13,187 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437366634] [2022-04-08 11:30:13,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:30:13,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:30:13,199 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:30:13,199 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1916146539] [2022-04-08 11:30:13,200 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 11:30:13,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:30:13,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:30:13,202 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:30:13,203 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:30:13,276 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2022-04-08 11:30:13,276 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:30:13,277 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-08 11:30:13,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:30:13,297 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:30:13,971 INFO L272 TraceCheckUtils]: 0: Hoare triple {18505#true} call ULTIMATE.init(); {18505#true} is VALID [2022-04-08 11:30:13,971 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:30:13,971 INFO L290 TraceCheckUtils]: 2: Hoare triple {18505#true} assume true; {18505#true} is VALID [2022-04-08 11:30:13,972 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18505#true} {18505#true} #93#return; {18505#true} is VALID [2022-04-08 11:30:13,972 INFO L272 TraceCheckUtils]: 4: Hoare triple {18505#true} call #t~ret8 := main(); {18505#true} is VALID [2022-04-08 11:30:13,972 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:30:13,972 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:30:13,972 INFO L290 TraceCheckUtils]: 7: Hoare triple {18505#true} ~cond := #in~cond; {18505#true} is VALID [2022-04-08 11:30:13,972 INFO L290 TraceCheckUtils]: 8: Hoare triple {18505#true} assume !(0 == ~cond); {18505#true} is VALID [2022-04-08 11:30:13,972 INFO L290 TraceCheckUtils]: 9: Hoare triple {18505#true} assume true; {18505#true} is VALID [2022-04-08 11:30:13,972 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {18505#true} {18505#true} #77#return; {18505#true} is VALID [2022-04-08 11:30:13,972 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:30:13,973 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:30:13,973 INFO L290 TraceCheckUtils]: 13: Hoare triple {18543#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} assume !!(#t~post6 < 20);havoc #t~post6; {18543#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 11:30:13,973 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:30:13,973 INFO L290 TraceCheckUtils]: 15: Hoare triple {18505#true} ~cond := #in~cond; {18505#true} is VALID [2022-04-08 11:30:13,973 INFO L290 TraceCheckUtils]: 16: Hoare triple {18505#true} assume !(0 == ~cond); {18505#true} is VALID [2022-04-08 11:30:13,973 INFO L290 TraceCheckUtils]: 17: Hoare triple {18505#true} assume true; {18505#true} is VALID [2022-04-08 11:30:13,974 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:30:13,974 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:30:13,974 INFO L290 TraceCheckUtils]: 20: Hoare triple {18505#true} ~cond := #in~cond; {18505#true} is VALID [2022-04-08 11:30:13,974 INFO L290 TraceCheckUtils]: 21: Hoare triple {18505#true} assume !(0 == ~cond); {18505#true} is VALID [2022-04-08 11:30:13,974 INFO L290 TraceCheckUtils]: 22: Hoare triple {18505#true} assume true; {18505#true} is VALID [2022-04-08 11:30:13,975 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:30:13,975 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:30:13,975 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:30:13,976 INFO L290 TraceCheckUtils]: 26: Hoare triple {18543#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} assume !!(#t~post7 < 20);havoc #t~post7; {18543#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 11:30:13,976 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:30:13,976 INFO L290 TraceCheckUtils]: 28: Hoare triple {18505#true} ~cond := #in~cond; {18505#true} is VALID [2022-04-08 11:30:13,976 INFO L290 TraceCheckUtils]: 29: Hoare triple {18505#true} assume !(0 == ~cond); {18505#true} is VALID [2022-04-08 11:30:13,976 INFO L290 TraceCheckUtils]: 30: Hoare triple {18505#true} assume true; {18505#true} is VALID [2022-04-08 11:30:13,976 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:30:13,976 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:30:13,977 INFO L290 TraceCheckUtils]: 33: Hoare triple {18505#true} ~cond := #in~cond; {18505#true} is VALID [2022-04-08 11:30:13,977 INFO L290 TraceCheckUtils]: 34: Hoare triple {18505#true} assume !(0 == ~cond); {18505#true} is VALID [2022-04-08 11:30:13,977 INFO L290 TraceCheckUtils]: 35: Hoare triple {18505#true} assume true; {18505#true} is VALID [2022-04-08 11:30:13,977 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:30:13,977 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:30:13,977 INFO L290 TraceCheckUtils]: 38: Hoare triple {18505#true} ~cond := #in~cond; {18505#true} is VALID [2022-04-08 11:30:13,977 INFO L290 TraceCheckUtils]: 39: Hoare triple {18505#true} assume !(0 == ~cond); {18505#true} is VALID [2022-04-08 11:30:13,977 INFO L290 TraceCheckUtils]: 40: Hoare triple {18505#true} assume true; {18505#true} is VALID [2022-04-08 11:30:13,978 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:30:13,978 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:30:13,978 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:30:13,978 INFO L290 TraceCheckUtils]: 44: Hoare triple {18505#true} ~cond := #in~cond; {18505#true} is VALID [2022-04-08 11:30:13,978 INFO L290 TraceCheckUtils]: 45: Hoare triple {18505#true} assume !(0 == ~cond); {18505#true} is VALID [2022-04-08 11:30:13,978 INFO L290 TraceCheckUtils]: 46: Hoare triple {18505#true} assume true; {18505#true} is VALID [2022-04-08 11:30:13,979 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:30:13,979 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:30:13,980 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:30:13,980 INFO L290 TraceCheckUtils]: 50: Hoare triple {18543#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} assume !!(#t~post7 < 20);havoc #t~post7; {18543#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 11:30:13,980 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:30:13,980 INFO L290 TraceCheckUtils]: 52: Hoare triple {18505#true} ~cond := #in~cond; {18505#true} is VALID [2022-04-08 11:30:13,980 INFO L290 TraceCheckUtils]: 53: Hoare triple {18505#true} assume !(0 == ~cond); {18505#true} is VALID [2022-04-08 11:30:13,980 INFO L290 TraceCheckUtils]: 54: Hoare triple {18505#true} assume true; {18505#true} is VALID [2022-04-08 11:30:13,981 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:30:13,981 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:30:13,981 INFO L290 TraceCheckUtils]: 57: Hoare triple {18505#true} ~cond := #in~cond; {18505#true} is VALID [2022-04-08 11:30:13,981 INFO L290 TraceCheckUtils]: 58: Hoare triple {18505#true} assume !(0 == ~cond); {18505#true} is VALID [2022-04-08 11:30:13,981 INFO L290 TraceCheckUtils]: 59: Hoare triple {18505#true} assume true; {18505#true} is VALID [2022-04-08 11:30:13,981 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:30:13,981 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:30:13,981 INFO L290 TraceCheckUtils]: 62: Hoare triple {18505#true} ~cond := #in~cond; {18505#true} is VALID [2022-04-08 11:30:13,981 INFO L290 TraceCheckUtils]: 63: Hoare triple {18505#true} assume !(0 == ~cond); {18505#true} is VALID [2022-04-08 11:30:13,982 INFO L290 TraceCheckUtils]: 64: Hoare triple {18505#true} assume true; {18505#true} is VALID [2022-04-08 11:30:13,982 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:30:13,982 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:30:13,982 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:30:13,982 INFO L290 TraceCheckUtils]: 68: Hoare triple {18505#true} ~cond := #in~cond; {18505#true} is VALID [2022-04-08 11:30:13,982 INFO L290 TraceCheckUtils]: 69: Hoare triple {18505#true} assume !(0 == ~cond); {18505#true} is VALID [2022-04-08 11:30:13,983 INFO L290 TraceCheckUtils]: 70: Hoare triple {18505#true} assume true; {18505#true} is VALID [2022-04-08 11:30:13,983 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:30:13,983 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:30:13,984 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:30:13,984 INFO L290 TraceCheckUtils]: 74: Hoare triple {18543#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} assume !!(#t~post7 < 20);havoc #t~post7; {18543#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 11:30:13,984 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:30:13,984 INFO L290 TraceCheckUtils]: 76: Hoare triple {18505#true} ~cond := #in~cond; {18505#true} is VALID [2022-04-08 11:30:13,984 INFO L290 TraceCheckUtils]: 77: Hoare triple {18505#true} assume !(0 == ~cond); {18505#true} is VALID [2022-04-08 11:30:13,984 INFO L290 TraceCheckUtils]: 78: Hoare triple {18505#true} assume true; {18505#true} is VALID [2022-04-08 11:30:13,985 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:30:13,985 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:30:13,985 INFO L290 TraceCheckUtils]: 81: Hoare triple {18505#true} ~cond := #in~cond; {18505#true} is VALID [2022-04-08 11:30:13,985 INFO L290 TraceCheckUtils]: 82: Hoare triple {18505#true} assume !(0 == ~cond); {18505#true} is VALID [2022-04-08 11:30:13,985 INFO L290 TraceCheckUtils]: 83: Hoare triple {18505#true} assume true; {18505#true} is VALID [2022-04-08 11:30:13,985 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:30:13,986 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:30:13,986 INFO L290 TraceCheckUtils]: 86: Hoare triple {18505#true} ~cond := #in~cond; {18505#true} is VALID [2022-04-08 11:30:13,986 INFO L290 TraceCheckUtils]: 87: Hoare triple {18505#true} assume !(0 == ~cond); {18505#true} is VALID [2022-04-08 11:30:13,986 INFO L290 TraceCheckUtils]: 88: Hoare triple {18505#true} assume true; {18505#true} is VALID [2022-04-08 11:30:13,986 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:30:13,986 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:30:13,987 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:30:13,987 INFO L290 TraceCheckUtils]: 92: Hoare triple {18505#true} ~cond := #in~cond; {18505#true} is VALID [2022-04-08 11:30:13,987 INFO L290 TraceCheckUtils]: 93: Hoare triple {18505#true} assume !(0 == ~cond); {18505#true} is VALID [2022-04-08 11:30:13,987 INFO L290 TraceCheckUtils]: 94: Hoare triple {18505#true} assume true; {18505#true} is VALID [2022-04-08 11:30:13,987 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:30:13,988 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:30:13,988 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:30:13,989 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 < 20);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:30:13,989 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:30:13,989 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:30:13,989 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:30:13,990 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:30:13,990 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:30:13,991 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:30:13,991 INFO L290 TraceCheckUtils]: 105: Hoare triple {18505#true} ~cond := #in~cond; {18505#true} is VALID [2022-04-08 11:30:13,991 INFO L290 TraceCheckUtils]: 106: Hoare triple {18505#true} assume !(0 == ~cond); {18505#true} is VALID [2022-04-08 11:30:13,991 INFO L290 TraceCheckUtils]: 107: Hoare triple {18505#true} assume true; {18505#true} is VALID [2022-04-08 11:30:13,992 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:30:13,994 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:30:13,994 INFO L290 TraceCheckUtils]: 110: Hoare triple {18505#true} ~cond := #in~cond; {18505#true} is VALID [2022-04-08 11:30:13,994 INFO L290 TraceCheckUtils]: 111: Hoare triple {18505#true} assume !(0 == ~cond); {18505#true} is VALID [2022-04-08 11:30:13,994 INFO L290 TraceCheckUtils]: 112: Hoare triple {18505#true} assume true; {18505#true} is VALID [2022-04-08 11:30:13,995 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:30:13,995 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:30:13,997 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:30:13,998 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:30:13,999 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 < 20);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:30:13,999 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:30:14,000 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:30:14,000 INFO L290 TraceCheckUtils]: 120: Hoare triple {18874#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {18506#false} is VALID [2022-04-08 11:30:14,000 INFO L290 TraceCheckUtils]: 121: Hoare triple {18506#false} assume !false; {18506#false} is VALID [2022-04-08 11:30:14,001 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:30:14,001 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 11:30:20,389 INFO L290 TraceCheckUtils]: 121: Hoare triple {18506#false} assume !false; {18506#false} is VALID [2022-04-08 11:30:20,389 INFO L290 TraceCheckUtils]: 120: Hoare triple {18874#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {18506#false} is VALID [2022-04-08 11:30:20,390 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:30:20,390 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:30:20,390 INFO L290 TraceCheckUtils]: 117: Hoare triple {18890#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} assume !(#t~post6 < 20);havoc #t~post6; {18890#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-08 11:30:20,391 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:30:20,398 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:30:20,398 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:30:20,399 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:30:20,399 INFO L290 TraceCheckUtils]: 112: Hoare triple {18505#true} assume true; {18505#true} is VALID [2022-04-08 11:30:20,399 INFO L290 TraceCheckUtils]: 111: Hoare triple {18505#true} assume !(0 == ~cond); {18505#true} is VALID [2022-04-08 11:30:20,399 INFO L290 TraceCheckUtils]: 110: Hoare triple {18505#true} ~cond := #in~cond; {18505#true} is VALID [2022-04-08 11:30:20,399 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:30:20,399 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:30:20,399 INFO L290 TraceCheckUtils]: 107: Hoare triple {18505#true} assume true; {18505#true} is VALID [2022-04-08 11:30:20,400 INFO L290 TraceCheckUtils]: 106: Hoare triple {18505#true} assume !(0 == ~cond); {18505#true} is VALID [2022-04-08 11:30:20,400 INFO L290 TraceCheckUtils]: 105: Hoare triple {18505#true} ~cond := #in~cond; {18505#true} is VALID [2022-04-08 11:30:20,400 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:30:20,416 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:30:20,416 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:30:20,417 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:30:20,417 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:30:20,417 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:30:20,418 INFO L290 TraceCheckUtils]: 98: Hoare triple {18890#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} assume !!(#t~post7 < 20);havoc #t~post7; {18890#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-08 11:30:20,418 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:30:20,418 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:30:20,419 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:30:20,419 INFO L290 TraceCheckUtils]: 94: Hoare triple {18505#true} assume true; {18505#true} is VALID [2022-04-08 11:30:20,419 INFO L290 TraceCheckUtils]: 93: Hoare triple {18505#true} assume !(0 == ~cond); {18505#true} is VALID [2022-04-08 11:30:20,419 INFO L290 TraceCheckUtils]: 92: Hoare triple {18505#true} ~cond := #in~cond; {18505#true} is VALID [2022-04-08 11:30:20,419 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:30:20,419 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:30:20,420 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:30:20,420 INFO L290 TraceCheckUtils]: 88: Hoare triple {18505#true} assume true; {18505#true} is VALID [2022-04-08 11:30:20,420 INFO L290 TraceCheckUtils]: 87: Hoare triple {18505#true} assume !(0 == ~cond); {18505#true} is VALID [2022-04-08 11:30:20,420 INFO L290 TraceCheckUtils]: 86: Hoare triple {18505#true} ~cond := #in~cond; {18505#true} is VALID [2022-04-08 11:30:20,420 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:30:20,420 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:30:20,420 INFO L290 TraceCheckUtils]: 83: Hoare triple {18505#true} assume true; {18505#true} is VALID [2022-04-08 11:30:20,420 INFO L290 TraceCheckUtils]: 82: Hoare triple {18505#true} assume !(0 == ~cond); {18505#true} is VALID [2022-04-08 11:30:20,421 INFO L290 TraceCheckUtils]: 81: Hoare triple {18505#true} ~cond := #in~cond; {18505#true} is VALID [2022-04-08 11:30:20,421 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:30:20,421 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:30:20,421 INFO L290 TraceCheckUtils]: 78: Hoare triple {18505#true} assume true; {18505#true} is VALID [2022-04-08 11:30:20,421 INFO L290 TraceCheckUtils]: 77: Hoare triple {18505#true} assume !(0 == ~cond); {18505#true} is VALID [2022-04-08 11:30:20,421 INFO L290 TraceCheckUtils]: 76: Hoare triple {18505#true} ~cond := #in~cond; {18505#true} is VALID [2022-04-08 11:30:20,421 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:30:20,422 INFO L290 TraceCheckUtils]: 74: Hoare triple {18890#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} assume !!(#t~post7 < 20);havoc #t~post7; {18890#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-08 11:30:20,422 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:30:20,422 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:30:20,423 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:30:20,423 INFO L290 TraceCheckUtils]: 70: Hoare triple {18505#true} assume true; {18505#true} is VALID [2022-04-08 11:30:20,423 INFO L290 TraceCheckUtils]: 69: Hoare triple {18505#true} assume !(0 == ~cond); {18505#true} is VALID [2022-04-08 11:30:20,423 INFO L290 TraceCheckUtils]: 68: Hoare triple {18505#true} ~cond := #in~cond; {18505#true} is VALID [2022-04-08 11:30:20,423 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:30:20,423 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:30:20,424 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:30:20,424 INFO L290 TraceCheckUtils]: 64: Hoare triple {18505#true} assume true; {18505#true} is VALID [2022-04-08 11:30:20,424 INFO L290 TraceCheckUtils]: 63: Hoare triple {18505#true} assume !(0 == ~cond); {18505#true} is VALID [2022-04-08 11:30:20,424 INFO L290 TraceCheckUtils]: 62: Hoare triple {18505#true} ~cond := #in~cond; {18505#true} is VALID [2022-04-08 11:30:20,424 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:30:20,424 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:30:20,424 INFO L290 TraceCheckUtils]: 59: Hoare triple {18505#true} assume true; {18505#true} is VALID [2022-04-08 11:30:20,424 INFO L290 TraceCheckUtils]: 58: Hoare triple {18505#true} assume !(0 == ~cond); {18505#true} is VALID [2022-04-08 11:30:20,424 INFO L290 TraceCheckUtils]: 57: Hoare triple {18505#true} ~cond := #in~cond; {18505#true} is VALID [2022-04-08 11:30:20,424 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:30:20,425 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:30:20,425 INFO L290 TraceCheckUtils]: 54: Hoare triple {18505#true} assume true; {18505#true} is VALID [2022-04-08 11:30:20,425 INFO L290 TraceCheckUtils]: 53: Hoare triple {18505#true} assume !(0 == ~cond); {18505#true} is VALID [2022-04-08 11:30:20,425 INFO L290 TraceCheckUtils]: 52: Hoare triple {18505#true} ~cond := #in~cond; {18505#true} is VALID [2022-04-08 11:30:20,425 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:30:20,425 INFO L290 TraceCheckUtils]: 50: Hoare triple {18890#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} assume !!(#t~post7 < 20);havoc #t~post7; {18890#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-08 11:30:20,426 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:30:20,426 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:30:20,426 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:30:20,427 INFO L290 TraceCheckUtils]: 46: Hoare triple {18505#true} assume true; {18505#true} is VALID [2022-04-08 11:30:20,427 INFO L290 TraceCheckUtils]: 45: Hoare triple {18505#true} assume !(0 == ~cond); {18505#true} is VALID [2022-04-08 11:30:20,427 INFO L290 TraceCheckUtils]: 44: Hoare triple {18505#true} ~cond := #in~cond; {18505#true} is VALID [2022-04-08 11:30:20,427 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:30:20,427 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:30:20,427 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:30:20,428 INFO L290 TraceCheckUtils]: 40: Hoare triple {18505#true} assume true; {18505#true} is VALID [2022-04-08 11:30:20,428 INFO L290 TraceCheckUtils]: 39: Hoare triple {18505#true} assume !(0 == ~cond); {18505#true} is VALID [2022-04-08 11:30:20,428 INFO L290 TraceCheckUtils]: 38: Hoare triple {18505#true} ~cond := #in~cond; {18505#true} is VALID [2022-04-08 11:30:20,428 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:30:20,428 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:30:20,428 INFO L290 TraceCheckUtils]: 35: Hoare triple {18505#true} assume true; {18505#true} is VALID [2022-04-08 11:30:20,428 INFO L290 TraceCheckUtils]: 34: Hoare triple {18505#true} assume !(0 == ~cond); {18505#true} is VALID [2022-04-08 11:30:20,428 INFO L290 TraceCheckUtils]: 33: Hoare triple {18505#true} ~cond := #in~cond; {18505#true} is VALID [2022-04-08 11:30:20,428 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:30:20,429 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:30:20,429 INFO L290 TraceCheckUtils]: 30: Hoare triple {18505#true} assume true; {18505#true} is VALID [2022-04-08 11:30:20,429 INFO L290 TraceCheckUtils]: 29: Hoare triple {18505#true} assume !(0 == ~cond); {18505#true} is VALID [2022-04-08 11:30:20,429 INFO L290 TraceCheckUtils]: 28: Hoare triple {18505#true} ~cond := #in~cond; {18505#true} is VALID [2022-04-08 11:30:20,429 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:30:20,429 INFO L290 TraceCheckUtils]: 26: Hoare triple {18890#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} assume !!(#t~post7 < 20);havoc #t~post7; {18890#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-08 11:30:20,430 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:30:20,430 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:30:20,430 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:30:20,430 INFO L290 TraceCheckUtils]: 22: Hoare triple {18505#true} assume true; {18505#true} is VALID [2022-04-08 11:30:20,430 INFO L290 TraceCheckUtils]: 21: Hoare triple {18505#true} assume !(0 == ~cond); {18505#true} is VALID [2022-04-08 11:30:20,430 INFO L290 TraceCheckUtils]: 20: Hoare triple {18505#true} ~cond := #in~cond; {18505#true} is VALID [2022-04-08 11:30:20,431 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:30:20,431 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:30:20,431 INFO L290 TraceCheckUtils]: 17: Hoare triple {18505#true} assume true; {18505#true} is VALID [2022-04-08 11:30:20,431 INFO L290 TraceCheckUtils]: 16: Hoare triple {18505#true} assume !(0 == ~cond); {18505#true} is VALID [2022-04-08 11:30:20,431 INFO L290 TraceCheckUtils]: 15: Hoare triple {18505#true} ~cond := #in~cond; {18505#true} is VALID [2022-04-08 11:30:20,431 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:30:20,432 INFO L290 TraceCheckUtils]: 13: Hoare triple {18890#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} assume !!(#t~post6 < 20);havoc #t~post6; {18890#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-08 11:30:20,432 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:30:20,432 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:30:20,432 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {18505#true} {18505#true} #77#return; {18505#true} is VALID [2022-04-08 11:30:20,432 INFO L290 TraceCheckUtils]: 9: Hoare triple {18505#true} assume true; {18505#true} is VALID [2022-04-08 11:30:20,432 INFO L290 TraceCheckUtils]: 8: Hoare triple {18505#true} assume !(0 == ~cond); {18505#true} is VALID [2022-04-08 11:30:20,432 INFO L290 TraceCheckUtils]: 7: Hoare triple {18505#true} ~cond := #in~cond; {18505#true} is VALID [2022-04-08 11:30:20,432 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:30:20,433 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:30:20,433 INFO L272 TraceCheckUtils]: 4: Hoare triple {18505#true} call #t~ret8 := main(); {18505#true} is VALID [2022-04-08 11:30:20,433 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18505#true} {18505#true} #93#return; {18505#true} is VALID [2022-04-08 11:30:20,433 INFO L290 TraceCheckUtils]: 2: Hoare triple {18505#true} assume true; {18505#true} is VALID [2022-04-08 11:30:20,433 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:30:20,433 INFO L272 TraceCheckUtils]: 0: Hoare triple {18505#true} call ULTIMATE.init(); {18505#true} is VALID [2022-04-08 11:30:20,433 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:30:20,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:30:20,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437366634] [2022-04-08 11:30:20,433 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:30:20,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1916146539] [2022-04-08 11:30:20,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1916146539] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 11:30:20,434 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 11:30:20,434 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 13 [2022-04-08 11:30:20,434 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:30:20,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1548836828] [2022-04-08 11:30:20,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1548836828] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:30:20,434 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:30:20,434 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-08 11:30:20,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908876011] [2022-04-08 11:30:20,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:30:20,435 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:30:20,435 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:30:20,435 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:30:20,479 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:30:20,480 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-08 11:30:20,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:30:20,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-08 11:30:20,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2022-04-08 11:30:20,480 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:30:22,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:30:22,045 INFO L93 Difference]: Finished difference Result 240 states and 299 transitions. [2022-04-08 11:30:22,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-08 11:30:22,046 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:30:22,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:30:22,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:30:22,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 110 transitions. [2022-04-08 11:30:22,048 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:30:22,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 110 transitions. [2022-04-08 11:30:22,051 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 110 transitions. [2022-04-08 11:30:22,192 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:30:22,197 INFO L225 Difference]: With dead ends: 240 [2022-04-08 11:30:22,197 INFO L226 Difference]: Without dead ends: 237 [2022-04-08 11:30:22,198 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 230 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2022-04-08 11:30:22,199 INFO L913 BasicCegarLoop]: 38 mSDtfsCounter, 39 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.5s IncrementalHoareTripleChecker+Time [2022-04-08 11:30:22,199 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.5s Time] [2022-04-08 11:30:22,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2022-04-08 11:30:22,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 234. [2022-04-08 11:30:22,586 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:30:22,586 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:30:22,587 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:30:22,587 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:30:22,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:30:22,593 INFO L93 Difference]: Finished difference Result 237 states and 294 transitions. [2022-04-08 11:30:22,593 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 294 transitions. [2022-04-08 11:30:22,594 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:30:22,594 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:30:22,594 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:30:22,595 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:30:22,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:30:22,601 INFO L93 Difference]: Finished difference Result 237 states and 294 transitions. [2022-04-08 11:30:22,601 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 294 transitions. [2022-04-08 11:30:22,602 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:30:22,602 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:30:22,602 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:30:22,602 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:30:22,603 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:30:22,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 291 transitions. [2022-04-08 11:30:22,609 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 291 transitions. Word has length 122 [2022-04-08 11:30:22,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:30:22,609 INFO L478 AbstractCegarLoop]: Abstraction has 234 states and 291 transitions. [2022-04-08 11:30:22,610 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:30:22,610 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 234 states and 291 transitions. [2022-04-08 11:30:23,176 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:30:23,176 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 291 transitions. [2022-04-08 11:30:23,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2022-04-08 11:30:23,177 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:30:23,177 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:30:23,203 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:30:23,377 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:30:23,378 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:30:23,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:30:23,378 INFO L85 PathProgramCache]: Analyzing trace with hash -877539457, now seen corresponding path program 5 times [2022-04-08 11:30:23,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:30:23,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1611579179] [2022-04-08 11:30:49,989 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 11:30:49,989 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 11:30:49,989 INFO L85 PathProgramCache]: Analyzing trace with hash -877539457, now seen corresponding path program 6 times [2022-04-08 11:30:49,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:30:49,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360537775] [2022-04-08 11:30:49,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:30:49,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:30:50,004 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:30:50,005 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1818703626] [2022-04-08 11:30:50,005 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 11:30:50,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:30:50,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:30:50,006 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:30:50,009 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:30:50,071 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-08 11:30:50,071 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:30:50,072 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-08 11:30:50,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:30:50,092 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:30:50,373 INFO L272 TraceCheckUtils]: 0: Hoare triple {20675#true} call ULTIMATE.init(); {20675#true} is VALID [2022-04-08 11:30:50,374 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:30:50,374 INFO L290 TraceCheckUtils]: 2: Hoare triple {20675#true} assume true; {20675#true} is VALID [2022-04-08 11:30:50,374 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20675#true} {20675#true} #93#return; {20675#true} is VALID [2022-04-08 11:30:50,374 INFO L272 TraceCheckUtils]: 4: Hoare triple {20675#true} call #t~ret8 := main(); {20675#true} is VALID [2022-04-08 11:30:50,374 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:30:50,374 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:30:50,374 INFO L290 TraceCheckUtils]: 7: Hoare triple {20675#true} ~cond := #in~cond; {20675#true} is VALID [2022-04-08 11:30:50,374 INFO L290 TraceCheckUtils]: 8: Hoare triple {20675#true} assume !(0 == ~cond); {20675#true} is VALID [2022-04-08 11:30:50,374 INFO L290 TraceCheckUtils]: 9: Hoare triple {20675#true} assume true; {20675#true} is VALID [2022-04-08 11:30:50,374 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {20675#true} {20675#true} #77#return; {20675#true} is VALID [2022-04-08 11:30:50,374 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:30:50,374 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:30:50,374 INFO L290 TraceCheckUtils]: 13: Hoare triple {20675#true} assume !!(#t~post6 < 20);havoc #t~post6; {20675#true} is VALID [2022-04-08 11:30:50,374 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:30:50,374 INFO L290 TraceCheckUtils]: 15: Hoare triple {20675#true} ~cond := #in~cond; {20675#true} is VALID [2022-04-08 11:30:50,375 INFO L290 TraceCheckUtils]: 16: Hoare triple {20675#true} assume !(0 == ~cond); {20675#true} is VALID [2022-04-08 11:30:50,375 INFO L290 TraceCheckUtils]: 17: Hoare triple {20675#true} assume true; {20675#true} is VALID [2022-04-08 11:30:50,375 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {20675#true} {20675#true} #79#return; {20675#true} is VALID [2022-04-08 11:30:50,375 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:30:50,375 INFO L290 TraceCheckUtils]: 20: Hoare triple {20675#true} ~cond := #in~cond; {20675#true} is VALID [2022-04-08 11:30:50,375 INFO L290 TraceCheckUtils]: 21: Hoare triple {20675#true} assume !(0 == ~cond); {20675#true} is VALID [2022-04-08 11:30:50,375 INFO L290 TraceCheckUtils]: 22: Hoare triple {20675#true} assume true; {20675#true} is VALID [2022-04-08 11:30:50,375 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {20675#true} {20675#true} #81#return; {20675#true} is VALID [2022-04-08 11:30:50,375 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:30:50,375 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:30:50,375 INFO L290 TraceCheckUtils]: 26: Hoare triple {20675#true} assume !!(#t~post7 < 20);havoc #t~post7; {20675#true} is VALID [2022-04-08 11:30:50,375 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:30:50,375 INFO L290 TraceCheckUtils]: 28: Hoare triple {20675#true} ~cond := #in~cond; {20675#true} is VALID [2022-04-08 11:30:50,375 INFO L290 TraceCheckUtils]: 29: Hoare triple {20675#true} assume !(0 == ~cond); {20675#true} is VALID [2022-04-08 11:30:50,375 INFO L290 TraceCheckUtils]: 30: Hoare triple {20675#true} assume true; {20675#true} is VALID [2022-04-08 11:30:50,375 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {20675#true} {20675#true} #83#return; {20675#true} is VALID [2022-04-08 11:30:50,375 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:30:50,376 INFO L290 TraceCheckUtils]: 33: Hoare triple {20675#true} ~cond := #in~cond; {20675#true} is VALID [2022-04-08 11:30:50,376 INFO L290 TraceCheckUtils]: 34: Hoare triple {20675#true} assume !(0 == ~cond); {20675#true} is VALID [2022-04-08 11:30:50,376 INFO L290 TraceCheckUtils]: 35: Hoare triple {20675#true} assume true; {20675#true} is VALID [2022-04-08 11:30:50,376 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {20675#true} {20675#true} #85#return; {20675#true} is VALID [2022-04-08 11:30:50,376 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:30:50,376 INFO L290 TraceCheckUtils]: 38: Hoare triple {20675#true} ~cond := #in~cond; {20675#true} is VALID [2022-04-08 11:30:50,376 INFO L290 TraceCheckUtils]: 39: Hoare triple {20675#true} assume !(0 == ~cond); {20675#true} is VALID [2022-04-08 11:30:50,376 INFO L290 TraceCheckUtils]: 40: Hoare triple {20675#true} assume true; {20675#true} is VALID [2022-04-08 11:30:50,376 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {20675#true} {20675#true} #87#return; {20675#true} is VALID [2022-04-08 11:30:50,376 INFO L290 TraceCheckUtils]: 42: Hoare triple {20675#true} assume !!(~r~0 >= 2 * ~b~0); {20675#true} is VALID [2022-04-08 11:30:50,376 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:30:50,376 INFO L290 TraceCheckUtils]: 44: Hoare triple {20675#true} ~cond := #in~cond; {20675#true} is VALID [2022-04-08 11:30:50,376 INFO L290 TraceCheckUtils]: 45: Hoare triple {20675#true} assume !(0 == ~cond); {20675#true} is VALID [2022-04-08 11:30:50,376 INFO L290 TraceCheckUtils]: 46: Hoare triple {20675#true} assume true; {20675#true} is VALID [2022-04-08 11:30:50,376 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {20675#true} {20675#true} #89#return; {20675#true} is VALID [2022-04-08 11:30:50,376 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:30:50,376 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:30:50,376 INFO L290 TraceCheckUtils]: 50: Hoare triple {20675#true} assume !!(#t~post7 < 20);havoc #t~post7; {20675#true} is VALID [2022-04-08 11:30:50,377 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:30:50,377 INFO L290 TraceCheckUtils]: 52: Hoare triple {20675#true} ~cond := #in~cond; {20675#true} is VALID [2022-04-08 11:30:50,377 INFO L290 TraceCheckUtils]: 53: Hoare triple {20675#true} assume !(0 == ~cond); {20675#true} is VALID [2022-04-08 11:30:50,377 INFO L290 TraceCheckUtils]: 54: Hoare triple {20675#true} assume true; {20675#true} is VALID [2022-04-08 11:30:50,377 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {20675#true} {20675#true} #83#return; {20675#true} is VALID [2022-04-08 11:30:50,377 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:30:50,377 INFO L290 TraceCheckUtils]: 57: Hoare triple {20675#true} ~cond := #in~cond; {20675#true} is VALID [2022-04-08 11:30:50,377 INFO L290 TraceCheckUtils]: 58: Hoare triple {20675#true} assume !(0 == ~cond); {20675#true} is VALID [2022-04-08 11:30:50,377 INFO L290 TraceCheckUtils]: 59: Hoare triple {20675#true} assume true; {20675#true} is VALID [2022-04-08 11:30:50,377 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {20675#true} {20675#true} #85#return; {20675#true} is VALID [2022-04-08 11:30:50,377 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:30:50,377 INFO L290 TraceCheckUtils]: 62: Hoare triple {20675#true} ~cond := #in~cond; {20675#true} is VALID [2022-04-08 11:30:50,377 INFO L290 TraceCheckUtils]: 63: Hoare triple {20675#true} assume !(0 == ~cond); {20675#true} is VALID [2022-04-08 11:30:50,377 INFO L290 TraceCheckUtils]: 64: Hoare triple {20675#true} assume true; {20675#true} is VALID [2022-04-08 11:30:50,377 INFO L284 TraceCheckUtils]: 65: Hoare quadruple {20675#true} {20675#true} #87#return; {20675#true} is VALID [2022-04-08 11:30:50,377 INFO L290 TraceCheckUtils]: 66: Hoare triple {20675#true} assume !!(~r~0 >= 2 * ~b~0); {20675#true} is VALID [2022-04-08 11:30:50,377 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:30:50,378 INFO L290 TraceCheckUtils]: 68: Hoare triple {20675#true} ~cond := #in~cond; {20675#true} is VALID [2022-04-08 11:30:50,378 INFO L290 TraceCheckUtils]: 69: Hoare triple {20675#true} assume !(0 == ~cond); {20675#true} is VALID [2022-04-08 11:30:50,378 INFO L290 TraceCheckUtils]: 70: Hoare triple {20675#true} assume true; {20675#true} is VALID [2022-04-08 11:30:50,378 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {20675#true} {20675#true} #89#return; {20675#true} is VALID [2022-04-08 11:30:50,378 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:30:50,378 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:30:50,378 INFO L290 TraceCheckUtils]: 74: Hoare triple {20675#true} assume !!(#t~post7 < 20);havoc #t~post7; {20675#true} is VALID [2022-04-08 11:30:50,378 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:30:50,378 INFO L290 TraceCheckUtils]: 76: Hoare triple {20675#true} ~cond := #in~cond; {20675#true} is VALID [2022-04-08 11:30:50,378 INFO L290 TraceCheckUtils]: 77: Hoare triple {20675#true} assume !(0 == ~cond); {20675#true} is VALID [2022-04-08 11:30:50,378 INFO L290 TraceCheckUtils]: 78: Hoare triple {20675#true} assume true; {20675#true} is VALID [2022-04-08 11:30:50,378 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {20675#true} {20675#true} #83#return; {20675#true} is VALID [2022-04-08 11:30:50,378 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:30:50,378 INFO L290 TraceCheckUtils]: 81: Hoare triple {20675#true} ~cond := #in~cond; {20675#true} is VALID [2022-04-08 11:30:50,378 INFO L290 TraceCheckUtils]: 82: Hoare triple {20675#true} assume !(0 == ~cond); {20675#true} is VALID [2022-04-08 11:30:50,378 INFO L290 TraceCheckUtils]: 83: Hoare triple {20675#true} assume true; {20675#true} is VALID [2022-04-08 11:30:50,378 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {20675#true} {20675#true} #85#return; {20675#true} is VALID [2022-04-08 11:30:50,378 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:30:50,379 INFO L290 TraceCheckUtils]: 86: Hoare triple {20675#true} ~cond := #in~cond; {20675#true} is VALID [2022-04-08 11:30:50,379 INFO L290 TraceCheckUtils]: 87: Hoare triple {20675#true} assume !(0 == ~cond); {20675#true} is VALID [2022-04-08 11:30:50,379 INFO L290 TraceCheckUtils]: 88: Hoare triple {20675#true} assume true; {20675#true} is VALID [2022-04-08 11:30:50,379 INFO L284 TraceCheckUtils]: 89: Hoare quadruple {20675#true} {20675#true} #87#return; {20675#true} is VALID [2022-04-08 11:30:50,379 INFO L290 TraceCheckUtils]: 90: Hoare triple {20675#true} assume !(~r~0 >= 2 * ~b~0); {20675#true} is VALID [2022-04-08 11:30:50,379 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:30:50,379 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:30:50,379 INFO L290 TraceCheckUtils]: 93: Hoare triple {20675#true} assume !!(#t~post6 < 20);havoc #t~post6; {20675#true} is VALID [2022-04-08 11:30:50,379 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:30:50,379 INFO L290 TraceCheckUtils]: 95: Hoare triple {20675#true} ~cond := #in~cond; {20675#true} is VALID [2022-04-08 11:30:50,379 INFO L290 TraceCheckUtils]: 96: Hoare triple {20675#true} assume !(0 == ~cond); {20675#true} is VALID [2022-04-08 11:30:50,379 INFO L290 TraceCheckUtils]: 97: Hoare triple {20675#true} assume true; {20675#true} is VALID [2022-04-08 11:30:50,379 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {20675#true} {20675#true} #79#return; {20675#true} is VALID [2022-04-08 11:30:50,379 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:30:50,379 INFO L290 TraceCheckUtils]: 100: Hoare triple {20675#true} ~cond := #in~cond; {20675#true} is VALID [2022-04-08 11:30:50,379 INFO L290 TraceCheckUtils]: 101: Hoare triple {20675#true} assume !(0 == ~cond); {20675#true} is VALID [2022-04-08 11:30:50,379 INFO L290 TraceCheckUtils]: 102: Hoare triple {20675#true} assume true; {20675#true} is VALID [2022-04-08 11:30:50,380 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {20675#true} {20675#true} #81#return; {20675#true} is VALID [2022-04-08 11:30:50,380 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:30:50,380 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:30:50,381 INFO L290 TraceCheckUtils]: 106: Hoare triple {20995#(<= (+ |main_#t~post7| 1) ~counter~0)} assume !(#t~post7 < 20);havoc #t~post7; {20999#(<= 21 ~counter~0)} is VALID [2022-04-08 11:30:50,381 INFO L290 TraceCheckUtils]: 107: Hoare triple {20999#(<= 21 ~counter~0)} ~r~0 := ~r~0 - ~b~0;~q~0 := ~q~0 + ~a~0; {20999#(<= 21 ~counter~0)} is VALID [2022-04-08 11:30:50,382 INFO L290 TraceCheckUtils]: 108: Hoare triple {20999#(<= 21 ~counter~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {21006#(<= 21 |main_#t~post6|)} is VALID [2022-04-08 11:30:50,382 INFO L290 TraceCheckUtils]: 109: Hoare triple {21006#(<= 21 |main_#t~post6|)} assume !!(#t~post6 < 20);havoc #t~post6; {20676#false} is VALID [2022-04-08 11:30:50,382 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:30:50,382 INFO L290 TraceCheckUtils]: 111: Hoare triple {20676#false} ~cond := #in~cond; {20676#false} is VALID [2022-04-08 11:30:50,382 INFO L290 TraceCheckUtils]: 112: Hoare triple {20676#false} assume !(0 == ~cond); {20676#false} is VALID [2022-04-08 11:30:50,382 INFO L290 TraceCheckUtils]: 113: Hoare triple {20676#false} assume true; {20676#false} is VALID [2022-04-08 11:30:50,382 INFO L284 TraceCheckUtils]: 114: Hoare quadruple {20676#false} {20676#false} #79#return; {20676#false} is VALID [2022-04-08 11:30:50,383 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:30:50,383 INFO L290 TraceCheckUtils]: 116: Hoare triple {20676#false} ~cond := #in~cond; {20676#false} is VALID [2022-04-08 11:30:50,383 INFO L290 TraceCheckUtils]: 117: Hoare triple {20676#false} assume !(0 == ~cond); {20676#false} is VALID [2022-04-08 11:30:50,383 INFO L290 TraceCheckUtils]: 118: Hoare triple {20676#false} assume true; {20676#false} is VALID [2022-04-08 11:30:50,383 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {20676#false} {20676#false} #81#return; {20676#false} is VALID [2022-04-08 11:30:50,383 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:30:50,383 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:30:50,383 INFO L290 TraceCheckUtils]: 122: Hoare triple {20676#false} assume !(#t~post7 < 20);havoc #t~post7; {20676#false} is VALID [2022-04-08 11:30:50,383 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:30:50,383 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:30:50,383 INFO L290 TraceCheckUtils]: 125: Hoare triple {20676#false} assume !(#t~post6 < 20);havoc #t~post6; {20676#false} is VALID [2022-04-08 11:30:50,383 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:30:50,383 INFO L290 TraceCheckUtils]: 127: Hoare triple {20676#false} ~cond := #in~cond; {20676#false} is VALID [2022-04-08 11:30:50,383 INFO L290 TraceCheckUtils]: 128: Hoare triple {20676#false} assume 0 == ~cond; {20676#false} is VALID [2022-04-08 11:30:50,383 INFO L290 TraceCheckUtils]: 129: Hoare triple {20676#false} assume !false; {20676#false} is VALID [2022-04-08 11:30:50,384 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:30:50,384 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 11:30:50,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:30:50,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360537775] [2022-04-08 11:30:50,384 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:30:50,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1818703626] [2022-04-08 11:30:50,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1818703626] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:30:50,384 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:30:50,384 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 11:30:50,385 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:30:50,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1611579179] [2022-04-08 11:30:50,385 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1611579179] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:30:50,385 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:30:50,385 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 11:30:50,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477011288] [2022-04-08 11:30:50,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:30:50,385 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:50,386 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:30:50,386 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:30:50,451 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:30:50,451 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 11:30:50,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:30:50,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 11:30:50,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 11:30:50,452 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:51,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:30:51,156 INFO L93 Difference]: Finished difference Result 316 states and 400 transitions. [2022-04-08 11:30:51,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 11:30:51,156 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:51,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:30:51,156 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:51,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 82 transitions. [2022-04-08 11:30:51,158 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:51,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 82 transitions. [2022-04-08 11:30:51,159 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 82 transitions. [2022-04-08 11:30:51,245 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:51,250 INFO L225 Difference]: With dead ends: 316 [2022-04-08 11:30:51,250 INFO L226 Difference]: Without dead ends: 219 [2022-04-08 11:30:51,251 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:51,251 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:51,251 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:51,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2022-04-08 11:30:51,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 211. [2022-04-08 11:30:51,576 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:30:51,576 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:51,577 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:51,577 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:51,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:30:51,582 INFO L93 Difference]: Finished difference Result 219 states and 258 transitions. [2022-04-08 11:30:51,583 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 258 transitions. [2022-04-08 11:30:51,583 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:30:51,583 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:30:51,584 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:51,584 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:51,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:30:51,589 INFO L93 Difference]: Finished difference Result 219 states and 258 transitions. [2022-04-08 11:30:51,589 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 258 transitions. [2022-04-08 11:30:51,590 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:30:51,590 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:30:51,590 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:30:51,590 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:30:51,591 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:51,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 251 transitions. [2022-04-08 11:30:51,596 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 251 transitions. Word has length 130 [2022-04-08 11:30:51,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:30:51,597 INFO L478 AbstractCegarLoop]: Abstraction has 211 states and 251 transitions. [2022-04-08 11:30:51,597 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:51,597 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 211 states and 251 transitions. [2022-04-08 11:30:52,176 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:52,176 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 251 transitions. [2022-04-08 11:30:52,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-04-08 11:30:52,178 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:30:52,178 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:52,205 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:52,378 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:52,379 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:30:52,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:30:52,379 INFO L85 PathProgramCache]: Analyzing trace with hash 518951120, now seen corresponding path program 7 times [2022-04-08 11:30:52,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:30:52,379 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [850049515] [2022-04-08 11:31:24,734 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 11:31:24,735 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 11:31:24,735 INFO L85 PathProgramCache]: Analyzing trace with hash 518951120, now seen corresponding path program 8 times [2022-04-08 11:31:24,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:31:24,735 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238613345] [2022-04-08 11:31:24,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:31:24,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:31:24,755 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:31:24,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1540206705] [2022-04-08 11:31:24,756 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 11:31:24,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:31:24,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:31:24,757 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:31:24,757 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:31:24,858 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 11:31:24,858 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:31:24,860 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-08 11:31:24,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:31:24,888 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:31:25,702 INFO L272 TraceCheckUtils]: 0: Hoare triple {22563#true} call ULTIMATE.init(); {22563#true} is VALID [2022-04-08 11:31:25,703 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:31:25,703 INFO L290 TraceCheckUtils]: 2: Hoare triple {22571#(<= ~counter~0 0)} assume true; {22571#(<= ~counter~0 0)} is VALID [2022-04-08 11:31:25,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:31:25,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:31:25,704 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:31:25,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:31:25,704 INFO L290 TraceCheckUtils]: 7: Hoare triple {22571#(<= ~counter~0 0)} ~cond := #in~cond; {22571#(<= ~counter~0 0)} is VALID [2022-04-08 11:31:25,705 INFO L290 TraceCheckUtils]: 8: Hoare triple {22571#(<= ~counter~0 0)} assume !(0 == ~cond); {22571#(<= ~counter~0 0)} is VALID [2022-04-08 11:31:25,705 INFO L290 TraceCheckUtils]: 9: Hoare triple {22571#(<= ~counter~0 0)} assume true; {22571#(<= ~counter~0 0)} is VALID [2022-04-08 11:31:25,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:31:25,706 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:31:25,707 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:31:25,707 INFO L290 TraceCheckUtils]: 13: Hoare triple {22605#(<= ~counter~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {22605#(<= ~counter~0 1)} is VALID [2022-04-08 11:31:25,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:31:25,708 INFO L290 TraceCheckUtils]: 15: Hoare triple {22605#(<= ~counter~0 1)} ~cond := #in~cond; {22605#(<= ~counter~0 1)} is VALID [2022-04-08 11:31:25,708 INFO L290 TraceCheckUtils]: 16: Hoare triple {22605#(<= ~counter~0 1)} assume !(0 == ~cond); {22605#(<= ~counter~0 1)} is VALID [2022-04-08 11:31:25,708 INFO L290 TraceCheckUtils]: 17: Hoare triple {22605#(<= ~counter~0 1)} assume true; {22605#(<= ~counter~0 1)} is VALID [2022-04-08 11:31:25,709 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:31:25,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:31:25,710 INFO L290 TraceCheckUtils]: 20: Hoare triple {22605#(<= ~counter~0 1)} ~cond := #in~cond; {22605#(<= ~counter~0 1)} is VALID [2022-04-08 11:31:25,715 INFO L290 TraceCheckUtils]: 21: Hoare triple {22605#(<= ~counter~0 1)} assume !(0 == ~cond); {22605#(<= ~counter~0 1)} is VALID [2022-04-08 11:31:25,715 INFO L290 TraceCheckUtils]: 22: Hoare triple {22605#(<= ~counter~0 1)} assume true; {22605#(<= ~counter~0 1)} is VALID [2022-04-08 11:31:25,716 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:31:25,716 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:31:25,717 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:31:25,718 INFO L290 TraceCheckUtils]: 26: Hoare triple {22645#(<= ~counter~0 2)} assume !!(#t~post7 < 20);havoc #t~post7; {22645#(<= ~counter~0 2)} is VALID [2022-04-08 11:31:25,719 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:31:25,719 INFO L290 TraceCheckUtils]: 28: Hoare triple {22645#(<= ~counter~0 2)} ~cond := #in~cond; {22645#(<= ~counter~0 2)} is VALID [2022-04-08 11:31:25,719 INFO L290 TraceCheckUtils]: 29: Hoare triple {22645#(<= ~counter~0 2)} assume !(0 == ~cond); {22645#(<= ~counter~0 2)} is VALID [2022-04-08 11:31:25,720 INFO L290 TraceCheckUtils]: 30: Hoare triple {22645#(<= ~counter~0 2)} assume true; {22645#(<= ~counter~0 2)} is VALID [2022-04-08 11:31:25,720 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:31:25,721 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:31:25,721 INFO L290 TraceCheckUtils]: 33: Hoare triple {22645#(<= ~counter~0 2)} ~cond := #in~cond; {22645#(<= ~counter~0 2)} is VALID [2022-04-08 11:31:25,721 INFO L290 TraceCheckUtils]: 34: Hoare triple {22645#(<= ~counter~0 2)} assume !(0 == ~cond); {22645#(<= ~counter~0 2)} is VALID [2022-04-08 11:31:25,722 INFO L290 TraceCheckUtils]: 35: Hoare triple {22645#(<= ~counter~0 2)} assume true; {22645#(<= ~counter~0 2)} is VALID [2022-04-08 11:31:25,722 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:31:25,723 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:31:25,723 INFO L290 TraceCheckUtils]: 38: Hoare triple {22645#(<= ~counter~0 2)} ~cond := #in~cond; {22645#(<= ~counter~0 2)} is VALID [2022-04-08 11:31:25,724 INFO L290 TraceCheckUtils]: 39: Hoare triple {22645#(<= ~counter~0 2)} assume !(0 == ~cond); {22645#(<= ~counter~0 2)} is VALID [2022-04-08 11:31:25,724 INFO L290 TraceCheckUtils]: 40: Hoare triple {22645#(<= ~counter~0 2)} assume true; {22645#(<= ~counter~0 2)} is VALID [2022-04-08 11:31:25,724 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:31:25,725 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:31:25,725 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:31:25,725 INFO L290 TraceCheckUtils]: 44: Hoare triple {22645#(<= ~counter~0 2)} ~cond := #in~cond; {22645#(<= ~counter~0 2)} is VALID [2022-04-08 11:31:25,726 INFO L290 TraceCheckUtils]: 45: Hoare triple {22645#(<= ~counter~0 2)} assume !(0 == ~cond); {22645#(<= ~counter~0 2)} is VALID [2022-04-08 11:31:25,726 INFO L290 TraceCheckUtils]: 46: Hoare triple {22645#(<= ~counter~0 2)} assume true; {22645#(<= ~counter~0 2)} is VALID [2022-04-08 11:31:25,726 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:31:25,727 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:31:25,728 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:31:25,728 INFO L290 TraceCheckUtils]: 50: Hoare triple {22718#(<= ~counter~0 3)} assume !!(#t~post7 < 20);havoc #t~post7; {22718#(<= ~counter~0 3)} is VALID [2022-04-08 11:31:25,728 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:31:25,729 INFO L290 TraceCheckUtils]: 52: Hoare triple {22718#(<= ~counter~0 3)} ~cond := #in~cond; {22718#(<= ~counter~0 3)} is VALID [2022-04-08 11:31:25,729 INFO L290 TraceCheckUtils]: 53: Hoare triple {22718#(<= ~counter~0 3)} assume !(0 == ~cond); {22718#(<= ~counter~0 3)} is VALID [2022-04-08 11:31:25,729 INFO L290 TraceCheckUtils]: 54: Hoare triple {22718#(<= ~counter~0 3)} assume true; {22718#(<= ~counter~0 3)} is VALID [2022-04-08 11:31:25,730 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:31:25,730 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:31:25,731 INFO L290 TraceCheckUtils]: 57: Hoare triple {22718#(<= ~counter~0 3)} ~cond := #in~cond; {22718#(<= ~counter~0 3)} is VALID [2022-04-08 11:31:25,731 INFO L290 TraceCheckUtils]: 58: Hoare triple {22718#(<= ~counter~0 3)} assume !(0 == ~cond); {22718#(<= ~counter~0 3)} is VALID [2022-04-08 11:31:25,731 INFO L290 TraceCheckUtils]: 59: Hoare triple {22718#(<= ~counter~0 3)} assume true; {22718#(<= ~counter~0 3)} is VALID [2022-04-08 11:31:25,732 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:31:25,732 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:31:25,732 INFO L290 TraceCheckUtils]: 62: Hoare triple {22718#(<= ~counter~0 3)} ~cond := #in~cond; {22718#(<= ~counter~0 3)} is VALID [2022-04-08 11:31:25,732 INFO L290 TraceCheckUtils]: 63: Hoare triple {22718#(<= ~counter~0 3)} assume !(0 == ~cond); {22718#(<= ~counter~0 3)} is VALID [2022-04-08 11:31:25,733 INFO L290 TraceCheckUtils]: 64: Hoare triple {22718#(<= ~counter~0 3)} assume true; {22718#(<= ~counter~0 3)} is VALID [2022-04-08 11:31:25,733 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:31:25,733 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:31:25,734 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:31:25,734 INFO L290 TraceCheckUtils]: 68: Hoare triple {22718#(<= ~counter~0 3)} ~cond := #in~cond; {22718#(<= ~counter~0 3)} is VALID [2022-04-08 11:31:25,734 INFO L290 TraceCheckUtils]: 69: Hoare triple {22718#(<= ~counter~0 3)} assume !(0 == ~cond); {22718#(<= ~counter~0 3)} is VALID [2022-04-08 11:31:25,735 INFO L290 TraceCheckUtils]: 70: Hoare triple {22718#(<= ~counter~0 3)} assume true; {22718#(<= ~counter~0 3)} is VALID [2022-04-08 11:31:25,735 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:31:25,735 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:31:25,736 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:31:25,737 INFO L290 TraceCheckUtils]: 74: Hoare triple {22791#(<= ~counter~0 4)} assume !!(#t~post7 < 20);havoc #t~post7; {22791#(<= ~counter~0 4)} is VALID [2022-04-08 11:31:25,737 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:31:25,737 INFO L290 TraceCheckUtils]: 76: Hoare triple {22791#(<= ~counter~0 4)} ~cond := #in~cond; {22791#(<= ~counter~0 4)} is VALID [2022-04-08 11:31:25,738 INFO L290 TraceCheckUtils]: 77: Hoare triple {22791#(<= ~counter~0 4)} assume !(0 == ~cond); {22791#(<= ~counter~0 4)} is VALID [2022-04-08 11:31:25,738 INFO L290 TraceCheckUtils]: 78: Hoare triple {22791#(<= ~counter~0 4)} assume true; {22791#(<= ~counter~0 4)} is VALID [2022-04-08 11:31:25,738 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:31:25,739 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:31:25,739 INFO L290 TraceCheckUtils]: 81: Hoare triple {22791#(<= ~counter~0 4)} ~cond := #in~cond; {22791#(<= ~counter~0 4)} is VALID [2022-04-08 11:31:25,740 INFO L290 TraceCheckUtils]: 82: Hoare triple {22791#(<= ~counter~0 4)} assume !(0 == ~cond); {22791#(<= ~counter~0 4)} is VALID [2022-04-08 11:31:25,740 INFO L290 TraceCheckUtils]: 83: Hoare triple {22791#(<= ~counter~0 4)} assume true; {22791#(<= ~counter~0 4)} is VALID [2022-04-08 11:31:25,740 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:31:25,741 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:31:25,741 INFO L290 TraceCheckUtils]: 86: Hoare triple {22791#(<= ~counter~0 4)} ~cond := #in~cond; {22791#(<= ~counter~0 4)} is VALID [2022-04-08 11:31:25,741 INFO L290 TraceCheckUtils]: 87: Hoare triple {22791#(<= ~counter~0 4)} assume !(0 == ~cond); {22791#(<= ~counter~0 4)} is VALID [2022-04-08 11:31:25,742 INFO L290 TraceCheckUtils]: 88: Hoare triple {22791#(<= ~counter~0 4)} assume true; {22791#(<= ~counter~0 4)} is VALID [2022-04-08 11:31:25,742 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:31:25,742 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:31:25,742 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:31:25,743 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:31:25,744 INFO L290 TraceCheckUtils]: 93: Hoare triple {22849#(<= ~counter~0 5)} assume !!(#t~post6 < 20);havoc #t~post6; {22849#(<= ~counter~0 5)} is VALID [2022-04-08 11:31:25,744 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:31:25,744 INFO L290 TraceCheckUtils]: 95: Hoare triple {22849#(<= ~counter~0 5)} ~cond := #in~cond; {22849#(<= ~counter~0 5)} is VALID [2022-04-08 11:31:25,745 INFO L290 TraceCheckUtils]: 96: Hoare triple {22849#(<= ~counter~0 5)} assume !(0 == ~cond); {22849#(<= ~counter~0 5)} is VALID [2022-04-08 11:31:25,745 INFO L290 TraceCheckUtils]: 97: Hoare triple {22849#(<= ~counter~0 5)} assume true; {22849#(<= ~counter~0 5)} is VALID [2022-04-08 11:31:25,745 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:31:25,746 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:31:25,746 INFO L290 TraceCheckUtils]: 100: Hoare triple {22849#(<= ~counter~0 5)} ~cond := #in~cond; {22849#(<= ~counter~0 5)} is VALID [2022-04-08 11:31:25,747 INFO L290 TraceCheckUtils]: 101: Hoare triple {22849#(<= ~counter~0 5)} assume !(0 == ~cond); {22849#(<= ~counter~0 5)} is VALID [2022-04-08 11:31:25,747 INFO L290 TraceCheckUtils]: 102: Hoare triple {22849#(<= ~counter~0 5)} assume true; {22849#(<= ~counter~0 5)} is VALID [2022-04-08 11:31:25,748 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:31:25,748 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:31:25,749 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:31:25,750 INFO L290 TraceCheckUtils]: 106: Hoare triple {22889#(<= ~counter~0 6)} assume !!(#t~post7 < 20);havoc #t~post7; {22889#(<= ~counter~0 6)} is VALID [2022-04-08 11:31:25,750 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:31:25,751 INFO L290 TraceCheckUtils]: 108: Hoare triple {22889#(<= ~counter~0 6)} ~cond := #in~cond; {22889#(<= ~counter~0 6)} is VALID [2022-04-08 11:31:25,751 INFO L290 TraceCheckUtils]: 109: Hoare triple {22889#(<= ~counter~0 6)} assume !(0 == ~cond); {22889#(<= ~counter~0 6)} is VALID [2022-04-08 11:31:25,751 INFO L290 TraceCheckUtils]: 110: Hoare triple {22889#(<= ~counter~0 6)} assume true; {22889#(<= ~counter~0 6)} is VALID [2022-04-08 11:31:25,752 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:31:25,752 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:31:25,752 INFO L290 TraceCheckUtils]: 113: Hoare triple {22889#(<= ~counter~0 6)} ~cond := #in~cond; {22889#(<= ~counter~0 6)} is VALID [2022-04-08 11:31:25,753 INFO L290 TraceCheckUtils]: 114: Hoare triple {22889#(<= ~counter~0 6)} assume !(0 == ~cond); {22889#(<= ~counter~0 6)} is VALID [2022-04-08 11:31:25,753 INFO L290 TraceCheckUtils]: 115: Hoare triple {22889#(<= ~counter~0 6)} assume true; {22889#(<= ~counter~0 6)} is VALID [2022-04-08 11:31:25,753 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:31:25,754 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:31:25,754 INFO L290 TraceCheckUtils]: 118: Hoare triple {22889#(<= ~counter~0 6)} ~cond := #in~cond; {22889#(<= ~counter~0 6)} is VALID [2022-04-08 11:31:25,754 INFO L290 TraceCheckUtils]: 119: Hoare triple {22889#(<= ~counter~0 6)} assume !(0 == ~cond); {22889#(<= ~counter~0 6)} is VALID [2022-04-08 11:31:25,755 INFO L290 TraceCheckUtils]: 120: Hoare triple {22889#(<= ~counter~0 6)} assume true; {22889#(<= ~counter~0 6)} is VALID [2022-04-08 11:31:25,755 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:31:25,755 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:31:25,756 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:31:25,756 INFO L290 TraceCheckUtils]: 124: Hoare triple {22889#(<= ~counter~0 6)} ~cond := #in~cond; {22889#(<= ~counter~0 6)} is VALID [2022-04-08 11:31:25,756 INFO L290 TraceCheckUtils]: 125: Hoare triple {22889#(<= ~counter~0 6)} assume !(0 == ~cond); {22889#(<= ~counter~0 6)} is VALID [2022-04-08 11:31:25,757 INFO L290 TraceCheckUtils]: 126: Hoare triple {22889#(<= ~counter~0 6)} assume true; {22889#(<= ~counter~0 6)} is VALID [2022-04-08 11:31:25,757 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:31:25,757 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:31:25,758 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:31:25,758 INFO L290 TraceCheckUtils]: 130: Hoare triple {22962#(<= |main_#t~post7| 6)} assume !(#t~post7 < 20);havoc #t~post7; {22564#false} is VALID [2022-04-08 11:31:25,758 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:31:25,758 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:31:25,758 INFO L290 TraceCheckUtils]: 133: Hoare triple {22564#false} assume !(#t~post6 < 20);havoc #t~post6; {22564#false} is VALID [2022-04-08 11:31:25,758 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:31:25,758 INFO L290 TraceCheckUtils]: 135: Hoare triple {22564#false} ~cond := #in~cond; {22564#false} is VALID [2022-04-08 11:31:25,758 INFO L290 TraceCheckUtils]: 136: Hoare triple {22564#false} assume 0 == ~cond; {22564#false} is VALID [2022-04-08 11:31:25,758 INFO L290 TraceCheckUtils]: 137: Hoare triple {22564#false} assume !false; {22564#false} is VALID [2022-04-08 11:31:25,759 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:31:25,759 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 11:31:26,469 INFO L290 TraceCheckUtils]: 137: Hoare triple {22564#false} assume !false; {22564#false} is VALID [2022-04-08 11:31:26,470 INFO L290 TraceCheckUtils]: 136: Hoare triple {22564#false} assume 0 == ~cond; {22564#false} is VALID [2022-04-08 11:31:26,470 INFO L290 TraceCheckUtils]: 135: Hoare triple {22564#false} ~cond := #in~cond; {22564#false} is VALID [2022-04-08 11:31:26,470 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:31:26,470 INFO L290 TraceCheckUtils]: 133: Hoare triple {22564#false} assume !(#t~post6 < 20);havoc #t~post6; {22564#false} is VALID [2022-04-08 11:31:26,470 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:31:26,470 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:31:26,470 INFO L290 TraceCheckUtils]: 130: Hoare triple {23008#(< |main_#t~post7| 20)} assume !(#t~post7 < 20);havoc #t~post7; {22564#false} is VALID [2022-04-08 11:31:26,470 INFO L290 TraceCheckUtils]: 129: Hoare triple {23012#(< ~counter~0 20)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {23008#(< |main_#t~post7| 20)} is VALID [2022-04-08 11:31:26,471 INFO L290 TraceCheckUtils]: 128: Hoare triple {23012#(< ~counter~0 20)} ~a~0 := 2 * ~a~0;~b~0 := 2 * ~b~0; {23012#(< ~counter~0 20)} is VALID [2022-04-08 11:31:26,471 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {22563#true} {23012#(< ~counter~0 20)} #89#return; {23012#(< ~counter~0 20)} is VALID [2022-04-08 11:31:26,471 INFO L290 TraceCheckUtils]: 126: Hoare triple {22563#true} assume true; {22563#true} is VALID [2022-04-08 11:31:26,471 INFO L290 TraceCheckUtils]: 125: Hoare triple {22563#true} assume !(0 == ~cond); {22563#true} is VALID [2022-04-08 11:31:26,472 INFO L290 TraceCheckUtils]: 124: Hoare triple {22563#true} ~cond := #in~cond; {22563#true} is VALID [2022-04-08 11:31:26,472 INFO L272 TraceCheckUtils]: 123: Hoare triple {23012#(< ~counter~0 20)} call __VERIFIER_assert((if ~r~0 >= 2 * ~y~0 * ~a~0 then 1 else 0)); {22563#true} is VALID [2022-04-08 11:31:26,472 INFO L290 TraceCheckUtils]: 122: Hoare triple {23012#(< ~counter~0 20)} assume !!(~r~0 >= 2 * ~b~0); {23012#(< ~counter~0 20)} is VALID [2022-04-08 11:31:26,472 INFO L284 TraceCheckUtils]: 121: Hoare quadruple {22563#true} {23012#(< ~counter~0 20)} #87#return; {23012#(< ~counter~0 20)} is VALID [2022-04-08 11:31:26,472 INFO L290 TraceCheckUtils]: 120: Hoare triple {22563#true} assume true; {22563#true} is VALID [2022-04-08 11:31:26,472 INFO L290 TraceCheckUtils]: 119: Hoare triple {22563#true} assume !(0 == ~cond); {22563#true} is VALID [2022-04-08 11:31:26,472 INFO L290 TraceCheckUtils]: 118: Hoare triple {22563#true} ~cond := #in~cond; {22563#true} is VALID [2022-04-08 11:31:26,472 INFO L272 TraceCheckUtils]: 117: Hoare triple {23012#(< ~counter~0 20)} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {22563#true} is VALID [2022-04-08 11:31:26,473 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {22563#true} {23012#(< ~counter~0 20)} #85#return; {23012#(< ~counter~0 20)} is VALID [2022-04-08 11:31:26,473 INFO L290 TraceCheckUtils]: 115: Hoare triple {22563#true} assume true; {22563#true} is VALID [2022-04-08 11:31:26,473 INFO L290 TraceCheckUtils]: 114: Hoare triple {22563#true} assume !(0 == ~cond); {22563#true} is VALID [2022-04-08 11:31:26,473 INFO L290 TraceCheckUtils]: 113: Hoare triple {22563#true} ~cond := #in~cond; {22563#true} is VALID [2022-04-08 11:31:26,473 INFO L272 TraceCheckUtils]: 112: Hoare triple {23012#(< ~counter~0 20)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {22563#true} is VALID [2022-04-08 11:31:26,474 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {22563#true} {23012#(< ~counter~0 20)} #83#return; {23012#(< ~counter~0 20)} is VALID [2022-04-08 11:31:26,474 INFO L290 TraceCheckUtils]: 110: Hoare triple {22563#true} assume true; {22563#true} is VALID [2022-04-08 11:31:26,474 INFO L290 TraceCheckUtils]: 109: Hoare triple {22563#true} assume !(0 == ~cond); {22563#true} is VALID [2022-04-08 11:31:26,474 INFO L290 TraceCheckUtils]: 108: Hoare triple {22563#true} ~cond := #in~cond; {22563#true} is VALID [2022-04-08 11:31:26,474 INFO L272 TraceCheckUtils]: 107: Hoare triple {23012#(< ~counter~0 20)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {22563#true} is VALID [2022-04-08 11:31:26,474 INFO L290 TraceCheckUtils]: 106: Hoare triple {23012#(< ~counter~0 20)} assume !!(#t~post7 < 20);havoc #t~post7; {23012#(< ~counter~0 20)} is VALID [2022-04-08 11:31:26,475 INFO L290 TraceCheckUtils]: 105: Hoare triple {23085#(< ~counter~0 19)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {23012#(< ~counter~0 20)} is VALID [2022-04-08 11:31:26,476 INFO L290 TraceCheckUtils]: 104: Hoare triple {23085#(< ~counter~0 19)} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {23085#(< ~counter~0 19)} is VALID [2022-04-08 11:31:26,476 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {22563#true} {23085#(< ~counter~0 19)} #81#return; {23085#(< ~counter~0 19)} is VALID [2022-04-08 11:31:26,476 INFO L290 TraceCheckUtils]: 102: Hoare triple {22563#true} assume true; {22563#true} is VALID [2022-04-08 11:31:26,476 INFO L290 TraceCheckUtils]: 101: Hoare triple {22563#true} assume !(0 == ~cond); {22563#true} is VALID [2022-04-08 11:31:26,476 INFO L290 TraceCheckUtils]: 100: Hoare triple {22563#true} ~cond := #in~cond; {22563#true} is VALID [2022-04-08 11:31:26,476 INFO L272 TraceCheckUtils]: 99: Hoare triple {23085#(< ~counter~0 19)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {22563#true} is VALID [2022-04-08 11:31:26,477 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {22563#true} {23085#(< ~counter~0 19)} #79#return; {23085#(< ~counter~0 19)} is VALID [2022-04-08 11:31:26,477 INFO L290 TraceCheckUtils]: 97: Hoare triple {22563#true} assume true; {22563#true} is VALID [2022-04-08 11:31:26,477 INFO L290 TraceCheckUtils]: 96: Hoare triple {22563#true} assume !(0 == ~cond); {22563#true} is VALID [2022-04-08 11:31:26,477 INFO L290 TraceCheckUtils]: 95: Hoare triple {22563#true} ~cond := #in~cond; {22563#true} is VALID [2022-04-08 11:31:26,477 INFO L272 TraceCheckUtils]: 94: Hoare triple {23085#(< ~counter~0 19)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {22563#true} is VALID [2022-04-08 11:31:26,477 INFO L290 TraceCheckUtils]: 93: Hoare triple {23085#(< ~counter~0 19)} assume !!(#t~post6 < 20);havoc #t~post6; {23085#(< ~counter~0 19)} is VALID [2022-04-08 11:31:26,478 INFO L290 TraceCheckUtils]: 92: Hoare triple {23125#(< ~counter~0 18)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {23085#(< ~counter~0 19)} is VALID [2022-04-08 11:31:26,479 INFO L290 TraceCheckUtils]: 91: Hoare triple {23125#(< ~counter~0 18)} ~r~0 := ~r~0 - ~b~0;~q~0 := ~q~0 + ~a~0; {23125#(< ~counter~0 18)} is VALID [2022-04-08 11:31:26,479 INFO L290 TraceCheckUtils]: 90: Hoare triple {23125#(< ~counter~0 18)} assume !(~r~0 >= 2 * ~b~0); {23125#(< ~counter~0 18)} is VALID [2022-04-08 11:31:26,479 INFO L284 TraceCheckUtils]: 89: Hoare quadruple {22563#true} {23125#(< ~counter~0 18)} #87#return; {23125#(< ~counter~0 18)} is VALID [2022-04-08 11:31:26,479 INFO L290 TraceCheckUtils]: 88: Hoare triple {22563#true} assume true; {22563#true} is VALID [2022-04-08 11:31:26,479 INFO L290 TraceCheckUtils]: 87: Hoare triple {22563#true} assume !(0 == ~cond); {22563#true} is VALID [2022-04-08 11:31:26,479 INFO L290 TraceCheckUtils]: 86: Hoare triple {22563#true} ~cond := #in~cond; {22563#true} is VALID [2022-04-08 11:31:26,480 INFO L272 TraceCheckUtils]: 85: Hoare triple {23125#(< ~counter~0 18)} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {22563#true} is VALID [2022-04-08 11:31:26,480 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {22563#true} {23125#(< ~counter~0 18)} #85#return; {23125#(< ~counter~0 18)} is VALID [2022-04-08 11:31:26,480 INFO L290 TraceCheckUtils]: 83: Hoare triple {22563#true} assume true; {22563#true} is VALID [2022-04-08 11:31:26,480 INFO L290 TraceCheckUtils]: 82: Hoare triple {22563#true} assume !(0 == ~cond); {22563#true} is VALID [2022-04-08 11:31:26,480 INFO L290 TraceCheckUtils]: 81: Hoare triple {22563#true} ~cond := #in~cond; {22563#true} is VALID [2022-04-08 11:31:26,480 INFO L272 TraceCheckUtils]: 80: Hoare triple {23125#(< ~counter~0 18)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {22563#true} is VALID [2022-04-08 11:31:26,481 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {22563#true} {23125#(< ~counter~0 18)} #83#return; {23125#(< ~counter~0 18)} is VALID [2022-04-08 11:31:26,481 INFO L290 TraceCheckUtils]: 78: Hoare triple {22563#true} assume true; {22563#true} is VALID [2022-04-08 11:31:26,481 INFO L290 TraceCheckUtils]: 77: Hoare triple {22563#true} assume !(0 == ~cond); {22563#true} is VALID [2022-04-08 11:31:26,481 INFO L290 TraceCheckUtils]: 76: Hoare triple {22563#true} ~cond := #in~cond; {22563#true} is VALID [2022-04-08 11:31:26,481 INFO L272 TraceCheckUtils]: 75: Hoare triple {23125#(< ~counter~0 18)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {22563#true} is VALID [2022-04-08 11:31:26,481 INFO L290 TraceCheckUtils]: 74: Hoare triple {23125#(< ~counter~0 18)} assume !!(#t~post7 < 20);havoc #t~post7; {23125#(< ~counter~0 18)} is VALID [2022-04-08 11:31:26,482 INFO L290 TraceCheckUtils]: 73: Hoare triple {23183#(< ~counter~0 17)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {23125#(< ~counter~0 18)} is VALID [2022-04-08 11:31:26,483 INFO L290 TraceCheckUtils]: 72: Hoare triple {23183#(< ~counter~0 17)} ~a~0 := 2 * ~a~0;~b~0 := 2 * ~b~0; {23183#(< ~counter~0 17)} is VALID [2022-04-08 11:31:26,483 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {22563#true} {23183#(< ~counter~0 17)} #89#return; {23183#(< ~counter~0 17)} is VALID [2022-04-08 11:31:26,483 INFO L290 TraceCheckUtils]: 70: Hoare triple {22563#true} assume true; {22563#true} is VALID [2022-04-08 11:31:26,483 INFO L290 TraceCheckUtils]: 69: Hoare triple {22563#true} assume !(0 == ~cond); {22563#true} is VALID [2022-04-08 11:31:26,483 INFO L290 TraceCheckUtils]: 68: Hoare triple {22563#true} ~cond := #in~cond; {22563#true} is VALID [2022-04-08 11:31:26,483 INFO L272 TraceCheckUtils]: 67: Hoare triple {23183#(< ~counter~0 17)} call __VERIFIER_assert((if ~r~0 >= 2 * ~y~0 * ~a~0 then 1 else 0)); {22563#true} is VALID [2022-04-08 11:31:26,484 INFO L290 TraceCheckUtils]: 66: Hoare triple {23183#(< ~counter~0 17)} assume !!(~r~0 >= 2 * ~b~0); {23183#(< ~counter~0 17)} is VALID [2022-04-08 11:31:26,484 INFO L284 TraceCheckUtils]: 65: Hoare quadruple {22563#true} {23183#(< ~counter~0 17)} #87#return; {23183#(< ~counter~0 17)} is VALID [2022-04-08 11:31:26,484 INFO L290 TraceCheckUtils]: 64: Hoare triple {22563#true} assume true; {22563#true} is VALID [2022-04-08 11:31:26,484 INFO L290 TraceCheckUtils]: 63: Hoare triple {22563#true} assume !(0 == ~cond); {22563#true} is VALID [2022-04-08 11:31:26,484 INFO L290 TraceCheckUtils]: 62: Hoare triple {22563#true} ~cond := #in~cond; {22563#true} is VALID [2022-04-08 11:31:26,484 INFO L272 TraceCheckUtils]: 61: Hoare triple {23183#(< ~counter~0 17)} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {22563#true} is VALID [2022-04-08 11:31:26,485 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {22563#true} {23183#(< ~counter~0 17)} #85#return; {23183#(< ~counter~0 17)} is VALID [2022-04-08 11:31:26,485 INFO L290 TraceCheckUtils]: 59: Hoare triple {22563#true} assume true; {22563#true} is VALID [2022-04-08 11:31:26,485 INFO L290 TraceCheckUtils]: 58: Hoare triple {22563#true} assume !(0 == ~cond); {22563#true} is VALID [2022-04-08 11:31:26,485 INFO L290 TraceCheckUtils]: 57: Hoare triple {22563#true} ~cond := #in~cond; {22563#true} is VALID [2022-04-08 11:31:26,485 INFO L272 TraceCheckUtils]: 56: Hoare triple {23183#(< ~counter~0 17)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {22563#true} is VALID [2022-04-08 11:31:26,485 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {22563#true} {23183#(< ~counter~0 17)} #83#return; {23183#(< ~counter~0 17)} is VALID [2022-04-08 11:31:26,485 INFO L290 TraceCheckUtils]: 54: Hoare triple {22563#true} assume true; {22563#true} is VALID [2022-04-08 11:31:26,486 INFO L290 TraceCheckUtils]: 53: Hoare triple {22563#true} assume !(0 == ~cond); {22563#true} is VALID [2022-04-08 11:31:26,486 INFO L290 TraceCheckUtils]: 52: Hoare triple {22563#true} ~cond := #in~cond; {22563#true} is VALID [2022-04-08 11:31:26,486 INFO L272 TraceCheckUtils]: 51: Hoare triple {23183#(< ~counter~0 17)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {22563#true} is VALID [2022-04-08 11:31:26,486 INFO L290 TraceCheckUtils]: 50: Hoare triple {23183#(< ~counter~0 17)} assume !!(#t~post7 < 20);havoc #t~post7; {23183#(< ~counter~0 17)} is VALID [2022-04-08 11:31:26,487 INFO L290 TraceCheckUtils]: 49: Hoare triple {23256#(< ~counter~0 16)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {23183#(< ~counter~0 17)} is VALID [2022-04-08 11:31:26,487 INFO L290 TraceCheckUtils]: 48: Hoare triple {23256#(< ~counter~0 16)} ~a~0 := 2 * ~a~0;~b~0 := 2 * ~b~0; {23256#(< ~counter~0 16)} is VALID [2022-04-08 11:31:26,488 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {22563#true} {23256#(< ~counter~0 16)} #89#return; {23256#(< ~counter~0 16)} is VALID [2022-04-08 11:31:26,488 INFO L290 TraceCheckUtils]: 46: Hoare triple {22563#true} assume true; {22563#true} is VALID [2022-04-08 11:31:26,488 INFO L290 TraceCheckUtils]: 45: Hoare triple {22563#true} assume !(0 == ~cond); {22563#true} is VALID [2022-04-08 11:31:26,488 INFO L290 TraceCheckUtils]: 44: Hoare triple {22563#true} ~cond := #in~cond; {22563#true} is VALID [2022-04-08 11:31:26,488 INFO L272 TraceCheckUtils]: 43: Hoare triple {23256#(< ~counter~0 16)} call __VERIFIER_assert((if ~r~0 >= 2 * ~y~0 * ~a~0 then 1 else 0)); {22563#true} is VALID [2022-04-08 11:31:26,488 INFO L290 TraceCheckUtils]: 42: Hoare triple {23256#(< ~counter~0 16)} assume !!(~r~0 >= 2 * ~b~0); {23256#(< ~counter~0 16)} is VALID [2022-04-08 11:31:26,489 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {22563#true} {23256#(< ~counter~0 16)} #87#return; {23256#(< ~counter~0 16)} is VALID [2022-04-08 11:31:26,489 INFO L290 TraceCheckUtils]: 40: Hoare triple {22563#true} assume true; {22563#true} is VALID [2022-04-08 11:31:26,489 INFO L290 TraceCheckUtils]: 39: Hoare triple {22563#true} assume !(0 == ~cond); {22563#true} is VALID [2022-04-08 11:31:26,489 INFO L290 TraceCheckUtils]: 38: Hoare triple {22563#true} ~cond := #in~cond; {22563#true} is VALID [2022-04-08 11:31:26,489 INFO L272 TraceCheckUtils]: 37: Hoare triple {23256#(< ~counter~0 16)} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {22563#true} is VALID [2022-04-08 11:31:26,489 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {22563#true} {23256#(< ~counter~0 16)} #85#return; {23256#(< ~counter~0 16)} is VALID [2022-04-08 11:31:26,490 INFO L290 TraceCheckUtils]: 35: Hoare triple {22563#true} assume true; {22563#true} is VALID [2022-04-08 11:31:26,490 INFO L290 TraceCheckUtils]: 34: Hoare triple {22563#true} assume !(0 == ~cond); {22563#true} is VALID [2022-04-08 11:31:26,490 INFO L290 TraceCheckUtils]: 33: Hoare triple {22563#true} ~cond := #in~cond; {22563#true} is VALID [2022-04-08 11:31:26,490 INFO L272 TraceCheckUtils]: 32: Hoare triple {23256#(< ~counter~0 16)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {22563#true} is VALID [2022-04-08 11:31:26,490 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {22563#true} {23256#(< ~counter~0 16)} #83#return; {23256#(< ~counter~0 16)} is VALID [2022-04-08 11:31:26,490 INFO L290 TraceCheckUtils]: 30: Hoare triple {22563#true} assume true; {22563#true} is VALID [2022-04-08 11:31:26,490 INFO L290 TraceCheckUtils]: 29: Hoare triple {22563#true} assume !(0 == ~cond); {22563#true} is VALID [2022-04-08 11:31:26,490 INFO L290 TraceCheckUtils]: 28: Hoare triple {22563#true} ~cond := #in~cond; {22563#true} is VALID [2022-04-08 11:31:26,490 INFO L272 TraceCheckUtils]: 27: Hoare triple {23256#(< ~counter~0 16)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {22563#true} is VALID [2022-04-08 11:31:26,491 INFO L290 TraceCheckUtils]: 26: Hoare triple {23256#(< ~counter~0 16)} assume !!(#t~post7 < 20);havoc #t~post7; {23256#(< ~counter~0 16)} is VALID [2022-04-08 11:31:26,492 INFO L290 TraceCheckUtils]: 25: Hoare triple {23329#(< ~counter~0 15)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {23256#(< ~counter~0 16)} is VALID [2022-04-08 11:31:26,492 INFO L290 TraceCheckUtils]: 24: Hoare triple {23329#(< ~counter~0 15)} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {23329#(< ~counter~0 15)} is VALID [2022-04-08 11:31:26,493 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {22563#true} {23329#(< ~counter~0 15)} #81#return; {23329#(< ~counter~0 15)} is VALID [2022-04-08 11:31:26,493 INFO L290 TraceCheckUtils]: 22: Hoare triple {22563#true} assume true; {22563#true} is VALID [2022-04-08 11:31:26,493 INFO L290 TraceCheckUtils]: 21: Hoare triple {22563#true} assume !(0 == ~cond); {22563#true} is VALID [2022-04-08 11:31:26,493 INFO L290 TraceCheckUtils]: 20: Hoare triple {22563#true} ~cond := #in~cond; {22563#true} is VALID [2022-04-08 11:31:26,493 INFO L272 TraceCheckUtils]: 19: Hoare triple {23329#(< ~counter~0 15)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {22563#true} is VALID [2022-04-08 11:31:26,493 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {22563#true} {23329#(< ~counter~0 15)} #79#return; {23329#(< ~counter~0 15)} is VALID [2022-04-08 11:31:26,493 INFO L290 TraceCheckUtils]: 17: Hoare triple {22563#true} assume true; {22563#true} is VALID [2022-04-08 11:31:26,493 INFO L290 TraceCheckUtils]: 16: Hoare triple {22563#true} assume !(0 == ~cond); {22563#true} is VALID [2022-04-08 11:31:26,493 INFO L290 TraceCheckUtils]: 15: Hoare triple {22563#true} ~cond := #in~cond; {22563#true} is VALID [2022-04-08 11:31:26,494 INFO L272 TraceCheckUtils]: 14: Hoare triple {23329#(< ~counter~0 15)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {22563#true} is VALID [2022-04-08 11:31:26,494 INFO L290 TraceCheckUtils]: 13: Hoare triple {23329#(< ~counter~0 15)} assume !!(#t~post6 < 20);havoc #t~post6; {23329#(< ~counter~0 15)} is VALID [2022-04-08 11:31:26,495 INFO L290 TraceCheckUtils]: 12: Hoare triple {23369#(< ~counter~0 14)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {23329#(< ~counter~0 15)} is VALID [2022-04-08 11:31:26,495 INFO L290 TraceCheckUtils]: 11: Hoare triple {23369#(< ~counter~0 14)} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {23369#(< ~counter~0 14)} is VALID [2022-04-08 11:31:26,495 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {22563#true} {23369#(< ~counter~0 14)} #77#return; {23369#(< ~counter~0 14)} is VALID [2022-04-08 11:31:26,495 INFO L290 TraceCheckUtils]: 9: Hoare triple {22563#true} assume true; {22563#true} is VALID [2022-04-08 11:31:26,496 INFO L290 TraceCheckUtils]: 8: Hoare triple {22563#true} assume !(0 == ~cond); {22563#true} is VALID [2022-04-08 11:31:26,496 INFO L290 TraceCheckUtils]: 7: Hoare triple {22563#true} ~cond := #in~cond; {22563#true} is VALID [2022-04-08 11:31:26,496 INFO L272 TraceCheckUtils]: 6: Hoare triple {23369#(< ~counter~0 14)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {22563#true} is VALID [2022-04-08 11:31:26,496 INFO L290 TraceCheckUtils]: 5: Hoare triple {23369#(< ~counter~0 14)} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {23369#(< ~counter~0 14)} is VALID [2022-04-08 11:31:26,496 INFO L272 TraceCheckUtils]: 4: Hoare triple {23369#(< ~counter~0 14)} call #t~ret8 := main(); {23369#(< ~counter~0 14)} is VALID [2022-04-08 11:31:26,496 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23369#(< ~counter~0 14)} {22563#true} #93#return; {23369#(< ~counter~0 14)} is VALID [2022-04-08 11:31:26,497 INFO L290 TraceCheckUtils]: 2: Hoare triple {23369#(< ~counter~0 14)} assume true; {23369#(< ~counter~0 14)} is VALID [2022-04-08 11:31:26,497 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 14)} is VALID [2022-04-08 11:31:26,497 INFO L272 TraceCheckUtils]: 0: Hoare triple {22563#true} call ULTIMATE.init(); {22563#true} is VALID [2022-04-08 11:31:26,498 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:31:26,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:31:26,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238613345] [2022-04-08 11:31:26,498 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:31:26,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1540206705] [2022-04-08 11:31:26,498 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1540206705] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 11:31:26,498 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 11:31:26,498 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2022-04-08 11:31:26,499 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:31:26,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [850049515] [2022-04-08 11:31:26,499 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [850049515] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:31:26,499 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:31:26,499 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-08 11:31:26,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229449120] [2022-04-08 11:31:26,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:31:26,500 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:31:26,500 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:31:26,500 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:31:26,595 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:31:26,595 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-08 11:31:26,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:31:26,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-08 11:31:26,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2022-04-08 11:31:26,596 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:31:28,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:31:28,184 INFO L93 Difference]: Finished difference Result 300 states and 342 transitions. [2022-04-08 11:31:28,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-08 11:31:28,185 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:31:28,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:31:28,185 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:31:28,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 158 transitions. [2022-04-08 11:31:28,188 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:31:28,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 158 transitions. [2022-04-08 11:31:28,190 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 158 transitions. [2022-04-08 11:31:28,371 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:31:28,378 INFO L225 Difference]: With dead ends: 300 [2022-04-08 11:31:28,378 INFO L226 Difference]: Without dead ends: 292 [2022-04-08 11:31:28,379 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:31:28,380 INFO L913 BasicCegarLoop]: 65 mSDtfsCounter, 54 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.3s IncrementalHoareTripleChecker+Time [2022-04-08 11:31:28,380 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.3s Time] [2022-04-08 11:31:28,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2022-04-08 11:31:28,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 287. [2022-04-08 11:31:28,914 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:31:28,915 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:31:28,915 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:31:28,915 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:31:28,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:31:28,922 INFO L93 Difference]: Finished difference Result 292 states and 333 transitions. [2022-04-08 11:31:28,922 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 333 transitions. [2022-04-08 11:31:28,923 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:31:28,923 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:31:28,924 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:31:28,924 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:31:28,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:31:28,931 INFO L93 Difference]: Finished difference Result 292 states and 333 transitions. [2022-04-08 11:31:28,931 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 333 transitions. [2022-04-08 11:31:28,932 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:31:28,932 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:31:28,932 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:31:28,932 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:31:28,933 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:31:28,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 328 transitions. [2022-04-08 11:31:28,941 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 328 transitions. Word has length 138 [2022-04-08 11:31:28,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:31:28,942 INFO L478 AbstractCegarLoop]: Abstraction has 287 states and 328 transitions. [2022-04-08 11:31:28,942 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:31:28,942 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 287 states and 328 transitions. [2022-04-08 11:31:29,708 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:31:29,708 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 328 transitions. [2022-04-08 11:31:29,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2022-04-08 11:31:29,710 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:31:29,710 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:31:29,739 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:31:29,910 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:31:29,911 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:31:29,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:31:29,911 INFO L85 PathProgramCache]: Analyzing trace with hash -559679257, now seen corresponding path program 7 times [2022-04-08 11:31:29,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:31:29,911 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [735629055] [2022-04-08 11:32:16,655 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 11:32:16,656 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 11:32:16,656 INFO L85 PathProgramCache]: Analyzing trace with hash -559679257, now seen corresponding path program 8 times [2022-04-08 11:32:16,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:32:16,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170184123] [2022-04-08 11:32:16,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:32:16,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:32:16,672 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:32:16,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [304119849] [2022-04-08 11:32:16,672 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 11:32:16,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:32:16,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:32:16,676 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:32:16,677 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:32:16,765 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 11:32:16,766 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:32:16,767 INFO L263 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-08 11:32:16,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:32:16,795 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:32:17,694 INFO L272 TraceCheckUtils]: 0: Hoare triple {25176#true} call ULTIMATE.init(); {25176#true} is VALID [2022-04-08 11:32:17,695 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:32:17,695 INFO L290 TraceCheckUtils]: 2: Hoare triple {25184#(<= ~counter~0 0)} assume true; {25184#(<= ~counter~0 0)} is VALID [2022-04-08 11:32:17,696 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25184#(<= ~counter~0 0)} {25176#true} #93#return; {25184#(<= ~counter~0 0)} is VALID [2022-04-08 11:32:17,696 INFO L272 TraceCheckUtils]: 4: Hoare triple {25184#(<= ~counter~0 0)} call #t~ret8 := main(); {25184#(<= ~counter~0 0)} is VALID [2022-04-08 11:32:17,697 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:32:17,697 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:32:17,698 INFO L290 TraceCheckUtils]: 7: Hoare triple {25184#(<= ~counter~0 0)} ~cond := #in~cond; {25184#(<= ~counter~0 0)} is VALID [2022-04-08 11:32:17,698 INFO L290 TraceCheckUtils]: 8: Hoare triple {25184#(<= ~counter~0 0)} assume !(0 == ~cond); {25184#(<= ~counter~0 0)} is VALID [2022-04-08 11:32:17,698 INFO L290 TraceCheckUtils]: 9: Hoare triple {25184#(<= ~counter~0 0)} assume true; {25184#(<= ~counter~0 0)} is VALID [2022-04-08 11:32:17,699 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:32:17,699 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:32:17,701 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:32:17,701 INFO L290 TraceCheckUtils]: 13: Hoare triple {25218#(<= ~counter~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {25218#(<= ~counter~0 1)} is VALID [2022-04-08 11:32:17,702 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:32:17,702 INFO L290 TraceCheckUtils]: 15: Hoare triple {25218#(<= ~counter~0 1)} ~cond := #in~cond; {25218#(<= ~counter~0 1)} is VALID [2022-04-08 11:32:17,703 INFO L290 TraceCheckUtils]: 16: Hoare triple {25218#(<= ~counter~0 1)} assume !(0 == ~cond); {25218#(<= ~counter~0 1)} is VALID [2022-04-08 11:32:17,703 INFO L290 TraceCheckUtils]: 17: Hoare triple {25218#(<= ~counter~0 1)} assume true; {25218#(<= ~counter~0 1)} is VALID [2022-04-08 11:32:17,704 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:32:17,705 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:32:17,705 INFO L290 TraceCheckUtils]: 20: Hoare triple {25218#(<= ~counter~0 1)} ~cond := #in~cond; {25218#(<= ~counter~0 1)} is VALID [2022-04-08 11:32:17,705 INFO L290 TraceCheckUtils]: 21: Hoare triple {25218#(<= ~counter~0 1)} assume !(0 == ~cond); {25218#(<= ~counter~0 1)} is VALID [2022-04-08 11:32:17,706 INFO L290 TraceCheckUtils]: 22: Hoare triple {25218#(<= ~counter~0 1)} assume true; {25218#(<= ~counter~0 1)} is VALID [2022-04-08 11:32:17,706 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:32:17,707 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:32:17,708 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:32:17,709 INFO L290 TraceCheckUtils]: 26: Hoare triple {25258#(<= ~counter~0 2)} assume !!(#t~post7 < 20);havoc #t~post7; {25258#(<= ~counter~0 2)} is VALID [2022-04-08 11:32:17,709 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:32:17,710 INFO L290 TraceCheckUtils]: 28: Hoare triple {25258#(<= ~counter~0 2)} ~cond := #in~cond; {25258#(<= ~counter~0 2)} is VALID [2022-04-08 11:32:17,710 INFO L290 TraceCheckUtils]: 29: Hoare triple {25258#(<= ~counter~0 2)} assume !(0 == ~cond); {25258#(<= ~counter~0 2)} is VALID [2022-04-08 11:32:17,710 INFO L290 TraceCheckUtils]: 30: Hoare triple {25258#(<= ~counter~0 2)} assume true; {25258#(<= ~counter~0 2)} is VALID [2022-04-08 11:32:17,711 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:32:17,712 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:32:17,712 INFO L290 TraceCheckUtils]: 33: Hoare triple {25258#(<= ~counter~0 2)} ~cond := #in~cond; {25258#(<= ~counter~0 2)} is VALID [2022-04-08 11:32:17,713 INFO L290 TraceCheckUtils]: 34: Hoare triple {25258#(<= ~counter~0 2)} assume !(0 == ~cond); {25258#(<= ~counter~0 2)} is VALID [2022-04-08 11:32:17,713 INFO L290 TraceCheckUtils]: 35: Hoare triple {25258#(<= ~counter~0 2)} assume true; {25258#(<= ~counter~0 2)} is VALID [2022-04-08 11:32:17,714 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:32:17,714 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:32:17,715 INFO L290 TraceCheckUtils]: 38: Hoare triple {25258#(<= ~counter~0 2)} ~cond := #in~cond; {25258#(<= ~counter~0 2)} is VALID [2022-04-08 11:32:17,715 INFO L290 TraceCheckUtils]: 39: Hoare triple {25258#(<= ~counter~0 2)} assume !(0 == ~cond); {25258#(<= ~counter~0 2)} is VALID [2022-04-08 11:32:17,716 INFO L290 TraceCheckUtils]: 40: Hoare triple {25258#(<= ~counter~0 2)} assume true; {25258#(<= ~counter~0 2)} is VALID [2022-04-08 11:32:17,716 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:32:17,716 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:32:17,717 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:32:17,717 INFO L290 TraceCheckUtils]: 44: Hoare triple {25258#(<= ~counter~0 2)} ~cond := #in~cond; {25258#(<= ~counter~0 2)} is VALID [2022-04-08 11:32:17,718 INFO L290 TraceCheckUtils]: 45: Hoare triple {25258#(<= ~counter~0 2)} assume !(0 == ~cond); {25258#(<= ~counter~0 2)} is VALID [2022-04-08 11:32:17,718 INFO L290 TraceCheckUtils]: 46: Hoare triple {25258#(<= ~counter~0 2)} assume true; {25258#(<= ~counter~0 2)} is VALID [2022-04-08 11:32:17,719 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:32:17,719 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:32:17,720 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:32:17,721 INFO L290 TraceCheckUtils]: 50: Hoare triple {25331#(<= ~counter~0 3)} assume !!(#t~post7 < 20);havoc #t~post7; {25331#(<= ~counter~0 3)} is VALID [2022-04-08 11:32:17,721 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:32:17,722 INFO L290 TraceCheckUtils]: 52: Hoare triple {25331#(<= ~counter~0 3)} ~cond := #in~cond; {25331#(<= ~counter~0 3)} is VALID [2022-04-08 11:32:17,722 INFO L290 TraceCheckUtils]: 53: Hoare triple {25331#(<= ~counter~0 3)} assume !(0 == ~cond); {25331#(<= ~counter~0 3)} is VALID [2022-04-08 11:32:17,723 INFO L290 TraceCheckUtils]: 54: Hoare triple {25331#(<= ~counter~0 3)} assume true; {25331#(<= ~counter~0 3)} is VALID [2022-04-08 11:32:17,723 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:32:17,724 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:32:17,724 INFO L290 TraceCheckUtils]: 57: Hoare triple {25331#(<= ~counter~0 3)} ~cond := #in~cond; {25331#(<= ~counter~0 3)} is VALID [2022-04-08 11:32:17,725 INFO L290 TraceCheckUtils]: 58: Hoare triple {25331#(<= ~counter~0 3)} assume !(0 == ~cond); {25331#(<= ~counter~0 3)} is VALID [2022-04-08 11:32:17,725 INFO L290 TraceCheckUtils]: 59: Hoare triple {25331#(<= ~counter~0 3)} assume true; {25331#(<= ~counter~0 3)} is VALID [2022-04-08 11:32:17,726 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:32:17,726 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:32:17,726 INFO L290 TraceCheckUtils]: 62: Hoare triple {25331#(<= ~counter~0 3)} ~cond := #in~cond; {25331#(<= ~counter~0 3)} is VALID [2022-04-08 11:32:17,727 INFO L290 TraceCheckUtils]: 63: Hoare triple {25331#(<= ~counter~0 3)} assume !(0 == ~cond); {25331#(<= ~counter~0 3)} is VALID [2022-04-08 11:32:17,727 INFO L290 TraceCheckUtils]: 64: Hoare triple {25331#(<= ~counter~0 3)} assume true; {25331#(<= ~counter~0 3)} is VALID [2022-04-08 11:32:17,728 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:32:17,728 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:32:17,729 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:32:17,729 INFO L290 TraceCheckUtils]: 68: Hoare triple {25331#(<= ~counter~0 3)} ~cond := #in~cond; {25331#(<= ~counter~0 3)} is VALID [2022-04-08 11:32:17,729 INFO L290 TraceCheckUtils]: 69: Hoare triple {25331#(<= ~counter~0 3)} assume !(0 == ~cond); {25331#(<= ~counter~0 3)} is VALID [2022-04-08 11:32:17,730 INFO L290 TraceCheckUtils]: 70: Hoare triple {25331#(<= ~counter~0 3)} assume true; {25331#(<= ~counter~0 3)} is VALID [2022-04-08 11:32:17,730 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:32:17,731 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:32:17,732 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:32:17,732 INFO L290 TraceCheckUtils]: 74: Hoare triple {25404#(<= ~counter~0 4)} assume !!(#t~post7 < 20);havoc #t~post7; {25404#(<= ~counter~0 4)} is VALID [2022-04-08 11:32:17,733 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:32:17,733 INFO L290 TraceCheckUtils]: 76: Hoare triple {25404#(<= ~counter~0 4)} ~cond := #in~cond; {25404#(<= ~counter~0 4)} is VALID [2022-04-08 11:32:17,734 INFO L290 TraceCheckUtils]: 77: Hoare triple {25404#(<= ~counter~0 4)} assume !(0 == ~cond); {25404#(<= ~counter~0 4)} is VALID [2022-04-08 11:32:17,734 INFO L290 TraceCheckUtils]: 78: Hoare triple {25404#(<= ~counter~0 4)} assume true; {25404#(<= ~counter~0 4)} is VALID [2022-04-08 11:32:17,735 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:32:17,735 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:32:17,736 INFO L290 TraceCheckUtils]: 81: Hoare triple {25404#(<= ~counter~0 4)} ~cond := #in~cond; {25404#(<= ~counter~0 4)} is VALID [2022-04-08 11:32:17,736 INFO L290 TraceCheckUtils]: 82: Hoare triple {25404#(<= ~counter~0 4)} assume !(0 == ~cond); {25404#(<= ~counter~0 4)} is VALID [2022-04-08 11:32:17,736 INFO L290 TraceCheckUtils]: 83: Hoare triple {25404#(<= ~counter~0 4)} assume true; {25404#(<= ~counter~0 4)} is VALID [2022-04-08 11:32:17,737 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:32:17,738 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:32:17,738 INFO L290 TraceCheckUtils]: 86: Hoare triple {25404#(<= ~counter~0 4)} ~cond := #in~cond; {25404#(<= ~counter~0 4)} is VALID [2022-04-08 11:32:17,738 INFO L290 TraceCheckUtils]: 87: Hoare triple {25404#(<= ~counter~0 4)} assume !(0 == ~cond); {25404#(<= ~counter~0 4)} is VALID [2022-04-08 11:32:17,739 INFO L290 TraceCheckUtils]: 88: Hoare triple {25404#(<= ~counter~0 4)} assume true; {25404#(<= ~counter~0 4)} is VALID [2022-04-08 11:32:17,739 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:32:17,739 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:32:17,740 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:32:17,741 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:32:17,742 INFO L290 TraceCheckUtils]: 93: Hoare triple {25462#(<= ~counter~0 5)} assume !!(#t~post6 < 20);havoc #t~post6; {25462#(<= ~counter~0 5)} is VALID [2022-04-08 11:32:17,742 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:32:17,743 INFO L290 TraceCheckUtils]: 95: Hoare triple {25462#(<= ~counter~0 5)} ~cond := #in~cond; {25462#(<= ~counter~0 5)} is VALID [2022-04-08 11:32:17,743 INFO L290 TraceCheckUtils]: 96: Hoare triple {25462#(<= ~counter~0 5)} assume !(0 == ~cond); {25462#(<= ~counter~0 5)} is VALID [2022-04-08 11:32:17,743 INFO L290 TraceCheckUtils]: 97: Hoare triple {25462#(<= ~counter~0 5)} assume true; {25462#(<= ~counter~0 5)} is VALID [2022-04-08 11:32:17,744 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:32:17,745 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:32:17,745 INFO L290 TraceCheckUtils]: 100: Hoare triple {25462#(<= ~counter~0 5)} ~cond := #in~cond; {25462#(<= ~counter~0 5)} is VALID [2022-04-08 11:32:17,745 INFO L290 TraceCheckUtils]: 101: Hoare triple {25462#(<= ~counter~0 5)} assume !(0 == ~cond); {25462#(<= ~counter~0 5)} is VALID [2022-04-08 11:32:17,746 INFO L290 TraceCheckUtils]: 102: Hoare triple {25462#(<= ~counter~0 5)} assume true; {25462#(<= ~counter~0 5)} is VALID [2022-04-08 11:32:17,746 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:32:17,747 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:32:17,748 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:32:17,748 INFO L290 TraceCheckUtils]: 106: Hoare triple {25502#(<= ~counter~0 6)} assume !!(#t~post7 < 20);havoc #t~post7; {25502#(<= ~counter~0 6)} is VALID [2022-04-08 11:32:17,749 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:32:17,749 INFO L290 TraceCheckUtils]: 108: Hoare triple {25502#(<= ~counter~0 6)} ~cond := #in~cond; {25502#(<= ~counter~0 6)} is VALID [2022-04-08 11:32:17,750 INFO L290 TraceCheckUtils]: 109: Hoare triple {25502#(<= ~counter~0 6)} assume !(0 == ~cond); {25502#(<= ~counter~0 6)} is VALID [2022-04-08 11:32:17,750 INFO L290 TraceCheckUtils]: 110: Hoare triple {25502#(<= ~counter~0 6)} assume true; {25502#(<= ~counter~0 6)} is VALID [2022-04-08 11:32:17,751 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:32:17,751 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:32:17,752 INFO L290 TraceCheckUtils]: 113: Hoare triple {25502#(<= ~counter~0 6)} ~cond := #in~cond; {25502#(<= ~counter~0 6)} is VALID [2022-04-08 11:32:17,752 INFO L290 TraceCheckUtils]: 114: Hoare triple {25502#(<= ~counter~0 6)} assume !(0 == ~cond); {25502#(<= ~counter~0 6)} is VALID [2022-04-08 11:32:17,752 INFO L290 TraceCheckUtils]: 115: Hoare triple {25502#(<= ~counter~0 6)} assume true; {25502#(<= ~counter~0 6)} is VALID [2022-04-08 11:32:17,753 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:32:17,753 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:32:17,753 INFO L290 TraceCheckUtils]: 118: Hoare triple {25502#(<= ~counter~0 6)} ~cond := #in~cond; {25502#(<= ~counter~0 6)} is VALID [2022-04-08 11:32:17,754 INFO L290 TraceCheckUtils]: 119: Hoare triple {25502#(<= ~counter~0 6)} assume !(0 == ~cond); {25502#(<= ~counter~0 6)} is VALID [2022-04-08 11:32:17,754 INFO L290 TraceCheckUtils]: 120: Hoare triple {25502#(<= ~counter~0 6)} assume true; {25502#(<= ~counter~0 6)} is VALID [2022-04-08 11:32:17,755 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:32:17,755 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:32:17,755 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:32:17,756 INFO L290 TraceCheckUtils]: 124: Hoare triple {25502#(<= ~counter~0 6)} ~cond := #in~cond; {25502#(<= ~counter~0 6)} is VALID [2022-04-08 11:32:17,756 INFO L290 TraceCheckUtils]: 125: Hoare triple {25502#(<= ~counter~0 6)} assume !(0 == ~cond); {25502#(<= ~counter~0 6)} is VALID [2022-04-08 11:32:17,756 INFO L290 TraceCheckUtils]: 126: Hoare triple {25502#(<= ~counter~0 6)} assume true; {25502#(<= ~counter~0 6)} is VALID [2022-04-08 11:32:17,757 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:32:17,757 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:32:17,758 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:32:17,759 INFO L290 TraceCheckUtils]: 130: Hoare triple {25575#(<= ~counter~0 7)} assume !!(#t~post7 < 20);havoc #t~post7; {25575#(<= ~counter~0 7)} is VALID [2022-04-08 11:32:17,759 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:32:17,759 INFO L290 TraceCheckUtils]: 132: Hoare triple {25575#(<= ~counter~0 7)} ~cond := #in~cond; {25575#(<= ~counter~0 7)} is VALID [2022-04-08 11:32:17,760 INFO L290 TraceCheckUtils]: 133: Hoare triple {25575#(<= ~counter~0 7)} assume !(0 == ~cond); {25575#(<= ~counter~0 7)} is VALID [2022-04-08 11:32:17,760 INFO L290 TraceCheckUtils]: 134: Hoare triple {25575#(<= ~counter~0 7)} assume true; {25575#(<= ~counter~0 7)} is VALID [2022-04-08 11:32:17,761 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:32:17,761 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:32:17,761 INFO L290 TraceCheckUtils]: 137: Hoare triple {25575#(<= ~counter~0 7)} ~cond := #in~cond; {25575#(<= ~counter~0 7)} is VALID [2022-04-08 11:32:17,762 INFO L290 TraceCheckUtils]: 138: Hoare triple {25575#(<= ~counter~0 7)} assume !(0 == ~cond); {25575#(<= ~counter~0 7)} is VALID [2022-04-08 11:32:17,762 INFO L290 TraceCheckUtils]: 139: Hoare triple {25575#(<= ~counter~0 7)} assume true; {25575#(<= ~counter~0 7)} is VALID [2022-04-08 11:32:17,763 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:32:17,763 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:32:17,763 INFO L290 TraceCheckUtils]: 142: Hoare triple {25575#(<= ~counter~0 7)} ~cond := #in~cond; {25575#(<= ~counter~0 7)} is VALID [2022-04-08 11:32:17,764 INFO L290 TraceCheckUtils]: 143: Hoare triple {25575#(<= ~counter~0 7)} assume !(0 == ~cond); {25575#(<= ~counter~0 7)} is VALID [2022-04-08 11:32:17,764 INFO L290 TraceCheckUtils]: 144: Hoare triple {25575#(<= ~counter~0 7)} assume true; {25575#(<= ~counter~0 7)} is VALID [2022-04-08 11:32:17,764 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:32:17,765 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:32:17,765 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:32:17,765 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:32:17,766 INFO L290 TraceCheckUtils]: 149: Hoare triple {25633#(<= |main_#t~post6| 7)} assume !(#t~post6 < 20);havoc #t~post6; {25177#false} is VALID [2022-04-08 11:32:17,766 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:32:17,766 INFO L290 TraceCheckUtils]: 151: Hoare triple {25177#false} ~cond := #in~cond; {25177#false} is VALID [2022-04-08 11:32:17,766 INFO L290 TraceCheckUtils]: 152: Hoare triple {25177#false} assume 0 == ~cond; {25177#false} is VALID [2022-04-08 11:32:17,766 INFO L290 TraceCheckUtils]: 153: Hoare triple {25177#false} assume !false; {25177#false} is VALID [2022-04-08 11:32:17,767 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:32:17,767 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 11:32:18,626 INFO L290 TraceCheckUtils]: 153: Hoare triple {25177#false} assume !false; {25177#false} is VALID [2022-04-08 11:32:18,626 INFO L290 TraceCheckUtils]: 152: Hoare triple {25177#false} assume 0 == ~cond; {25177#false} is VALID [2022-04-08 11:32:18,626 INFO L290 TraceCheckUtils]: 151: Hoare triple {25177#false} ~cond := #in~cond; {25177#false} is VALID [2022-04-08 11:32:18,626 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:32:18,626 INFO L290 TraceCheckUtils]: 149: Hoare triple {25661#(< |main_#t~post6| 20)} assume !(#t~post6 < 20);havoc #t~post6; {25177#false} is VALID [2022-04-08 11:32:18,627 INFO L290 TraceCheckUtils]: 148: Hoare triple {25665#(< ~counter~0 20)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {25661#(< |main_#t~post6| 20)} is VALID [2022-04-08 11:32:18,627 INFO L290 TraceCheckUtils]: 147: Hoare triple {25665#(< ~counter~0 20)} ~r~0 := ~r~0 - ~b~0;~q~0 := ~q~0 + ~a~0; {25665#(< ~counter~0 20)} is VALID [2022-04-08 11:32:18,627 INFO L290 TraceCheckUtils]: 146: Hoare triple {25665#(< ~counter~0 20)} assume !(~r~0 >= 2 * ~b~0); {25665#(< ~counter~0 20)} is VALID [2022-04-08 11:32:18,628 INFO L284 TraceCheckUtils]: 145: Hoare quadruple {25176#true} {25665#(< ~counter~0 20)} #87#return; {25665#(< ~counter~0 20)} is VALID [2022-04-08 11:32:18,628 INFO L290 TraceCheckUtils]: 144: Hoare triple {25176#true} assume true; {25176#true} is VALID [2022-04-08 11:32:18,628 INFO L290 TraceCheckUtils]: 143: Hoare triple {25176#true} assume !(0 == ~cond); {25176#true} is VALID [2022-04-08 11:32:18,628 INFO L290 TraceCheckUtils]: 142: Hoare triple {25176#true} ~cond := #in~cond; {25176#true} is VALID [2022-04-08 11:32:18,628 INFO L272 TraceCheckUtils]: 141: Hoare triple {25665#(< ~counter~0 20)} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {25176#true} is VALID [2022-04-08 11:32:18,629 INFO L284 TraceCheckUtils]: 140: Hoare quadruple {25176#true} {25665#(< ~counter~0 20)} #85#return; {25665#(< ~counter~0 20)} is VALID [2022-04-08 11:32:18,629 INFO L290 TraceCheckUtils]: 139: Hoare triple {25176#true} assume true; {25176#true} is VALID [2022-04-08 11:32:18,629 INFO L290 TraceCheckUtils]: 138: Hoare triple {25176#true} assume !(0 == ~cond); {25176#true} is VALID [2022-04-08 11:32:18,629 INFO L290 TraceCheckUtils]: 137: Hoare triple {25176#true} ~cond := #in~cond; {25176#true} is VALID [2022-04-08 11:32:18,629 INFO L272 TraceCheckUtils]: 136: Hoare triple {25665#(< ~counter~0 20)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {25176#true} is VALID [2022-04-08 11:32:18,629 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {25176#true} {25665#(< ~counter~0 20)} #83#return; {25665#(< ~counter~0 20)} is VALID [2022-04-08 11:32:18,629 INFO L290 TraceCheckUtils]: 134: Hoare triple {25176#true} assume true; {25176#true} is VALID [2022-04-08 11:32:18,629 INFO L290 TraceCheckUtils]: 133: Hoare triple {25176#true} assume !(0 == ~cond); {25176#true} is VALID [2022-04-08 11:32:18,629 INFO L290 TraceCheckUtils]: 132: Hoare triple {25176#true} ~cond := #in~cond; {25176#true} is VALID [2022-04-08 11:32:18,630 INFO L272 TraceCheckUtils]: 131: Hoare triple {25665#(< ~counter~0 20)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {25176#true} is VALID [2022-04-08 11:32:18,630 INFO L290 TraceCheckUtils]: 130: Hoare triple {25665#(< ~counter~0 20)} assume !!(#t~post7 < 20);havoc #t~post7; {25665#(< ~counter~0 20)} is VALID [2022-04-08 11:32:18,631 INFO L290 TraceCheckUtils]: 129: Hoare triple {25723#(< ~counter~0 19)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {25665#(< ~counter~0 20)} is VALID [2022-04-08 11:32:18,631 INFO L290 TraceCheckUtils]: 128: Hoare triple {25723#(< ~counter~0 19)} ~a~0 := 2 * ~a~0;~b~0 := 2 * ~b~0; {25723#(< ~counter~0 19)} is VALID [2022-04-08 11:32:18,632 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {25176#true} {25723#(< ~counter~0 19)} #89#return; {25723#(< ~counter~0 19)} is VALID [2022-04-08 11:32:18,632 INFO L290 TraceCheckUtils]: 126: Hoare triple {25176#true} assume true; {25176#true} is VALID [2022-04-08 11:32:18,632 INFO L290 TraceCheckUtils]: 125: Hoare triple {25176#true} assume !(0 == ~cond); {25176#true} is VALID [2022-04-08 11:32:18,632 INFO L290 TraceCheckUtils]: 124: Hoare triple {25176#true} ~cond := #in~cond; {25176#true} is VALID [2022-04-08 11:32:18,632 INFO L272 TraceCheckUtils]: 123: Hoare triple {25723#(< ~counter~0 19)} call __VERIFIER_assert((if ~r~0 >= 2 * ~y~0 * ~a~0 then 1 else 0)); {25176#true} is VALID [2022-04-08 11:32:18,632 INFO L290 TraceCheckUtils]: 122: Hoare triple {25723#(< ~counter~0 19)} assume !!(~r~0 >= 2 * ~b~0); {25723#(< ~counter~0 19)} is VALID [2022-04-08 11:32:18,633 INFO L284 TraceCheckUtils]: 121: Hoare quadruple {25176#true} {25723#(< ~counter~0 19)} #87#return; {25723#(< ~counter~0 19)} is VALID [2022-04-08 11:32:18,633 INFO L290 TraceCheckUtils]: 120: Hoare triple {25176#true} assume true; {25176#true} is VALID [2022-04-08 11:32:18,633 INFO L290 TraceCheckUtils]: 119: Hoare triple {25176#true} assume !(0 == ~cond); {25176#true} is VALID [2022-04-08 11:32:18,633 INFO L290 TraceCheckUtils]: 118: Hoare triple {25176#true} ~cond := #in~cond; {25176#true} is VALID [2022-04-08 11:32:18,633 INFO L272 TraceCheckUtils]: 117: Hoare triple {25723#(< ~counter~0 19)} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {25176#true} is VALID [2022-04-08 11:32:18,633 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {25176#true} {25723#(< ~counter~0 19)} #85#return; {25723#(< ~counter~0 19)} is VALID [2022-04-08 11:32:18,633 INFO L290 TraceCheckUtils]: 115: Hoare triple {25176#true} assume true; {25176#true} is VALID [2022-04-08 11:32:18,634 INFO L290 TraceCheckUtils]: 114: Hoare triple {25176#true} assume !(0 == ~cond); {25176#true} is VALID [2022-04-08 11:32:18,634 INFO L290 TraceCheckUtils]: 113: Hoare triple {25176#true} ~cond := #in~cond; {25176#true} is VALID [2022-04-08 11:32:18,634 INFO L272 TraceCheckUtils]: 112: Hoare triple {25723#(< ~counter~0 19)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {25176#true} is VALID [2022-04-08 11:32:18,634 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {25176#true} {25723#(< ~counter~0 19)} #83#return; {25723#(< ~counter~0 19)} is VALID [2022-04-08 11:32:18,634 INFO L290 TraceCheckUtils]: 110: Hoare triple {25176#true} assume true; {25176#true} is VALID [2022-04-08 11:32:18,634 INFO L290 TraceCheckUtils]: 109: Hoare triple {25176#true} assume !(0 == ~cond); {25176#true} is VALID [2022-04-08 11:32:18,634 INFO L290 TraceCheckUtils]: 108: Hoare triple {25176#true} ~cond := #in~cond; {25176#true} is VALID [2022-04-08 11:32:18,634 INFO L272 TraceCheckUtils]: 107: Hoare triple {25723#(< ~counter~0 19)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {25176#true} is VALID [2022-04-08 11:32:18,635 INFO L290 TraceCheckUtils]: 106: Hoare triple {25723#(< ~counter~0 19)} assume !!(#t~post7 < 20);havoc #t~post7; {25723#(< ~counter~0 19)} is VALID [2022-04-08 11:32:18,636 INFO L290 TraceCheckUtils]: 105: Hoare triple {25796#(< ~counter~0 18)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {25723#(< ~counter~0 19)} is VALID [2022-04-08 11:32:18,636 INFO L290 TraceCheckUtils]: 104: Hoare triple {25796#(< ~counter~0 18)} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {25796#(< ~counter~0 18)} is VALID [2022-04-08 11:32:18,636 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {25176#true} {25796#(< ~counter~0 18)} #81#return; {25796#(< ~counter~0 18)} is VALID [2022-04-08 11:32:18,637 INFO L290 TraceCheckUtils]: 102: Hoare triple {25176#true} assume true; {25176#true} is VALID [2022-04-08 11:32:18,637 INFO L290 TraceCheckUtils]: 101: Hoare triple {25176#true} assume !(0 == ~cond); {25176#true} is VALID [2022-04-08 11:32:18,637 INFO L290 TraceCheckUtils]: 100: Hoare triple {25176#true} ~cond := #in~cond; {25176#true} is VALID [2022-04-08 11:32:18,637 INFO L272 TraceCheckUtils]: 99: Hoare triple {25796#(< ~counter~0 18)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {25176#true} is VALID [2022-04-08 11:32:18,637 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {25176#true} {25796#(< ~counter~0 18)} #79#return; {25796#(< ~counter~0 18)} is VALID [2022-04-08 11:32:18,637 INFO L290 TraceCheckUtils]: 97: Hoare triple {25176#true} assume true; {25176#true} is VALID [2022-04-08 11:32:18,637 INFO L290 TraceCheckUtils]: 96: Hoare triple {25176#true} assume !(0 == ~cond); {25176#true} is VALID [2022-04-08 11:32:18,637 INFO L290 TraceCheckUtils]: 95: Hoare triple {25176#true} ~cond := #in~cond; {25176#true} is VALID [2022-04-08 11:32:18,637 INFO L272 TraceCheckUtils]: 94: Hoare triple {25796#(< ~counter~0 18)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {25176#true} is VALID [2022-04-08 11:32:18,638 INFO L290 TraceCheckUtils]: 93: Hoare triple {25796#(< ~counter~0 18)} assume !!(#t~post6 < 20);havoc #t~post6; {25796#(< ~counter~0 18)} is VALID [2022-04-08 11:32:18,639 INFO L290 TraceCheckUtils]: 92: Hoare triple {25836#(< ~counter~0 17)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {25796#(< ~counter~0 18)} is VALID [2022-04-08 11:32:18,639 INFO L290 TraceCheckUtils]: 91: Hoare triple {25836#(< ~counter~0 17)} ~r~0 := ~r~0 - ~b~0;~q~0 := ~q~0 + ~a~0; {25836#(< ~counter~0 17)} is VALID [2022-04-08 11:32:18,639 INFO L290 TraceCheckUtils]: 90: Hoare triple {25836#(< ~counter~0 17)} assume !(~r~0 >= 2 * ~b~0); {25836#(< ~counter~0 17)} is VALID [2022-04-08 11:32:18,640 INFO L284 TraceCheckUtils]: 89: Hoare quadruple {25176#true} {25836#(< ~counter~0 17)} #87#return; {25836#(< ~counter~0 17)} is VALID [2022-04-08 11:32:18,640 INFO L290 TraceCheckUtils]: 88: Hoare triple {25176#true} assume true; {25176#true} is VALID [2022-04-08 11:32:18,640 INFO L290 TraceCheckUtils]: 87: Hoare triple {25176#true} assume !(0 == ~cond); {25176#true} is VALID [2022-04-08 11:32:18,640 INFO L290 TraceCheckUtils]: 86: Hoare triple {25176#true} ~cond := #in~cond; {25176#true} is VALID [2022-04-08 11:32:18,640 INFO L272 TraceCheckUtils]: 85: Hoare triple {25836#(< ~counter~0 17)} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {25176#true} is VALID [2022-04-08 11:32:18,640 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {25176#true} {25836#(< ~counter~0 17)} #85#return; {25836#(< ~counter~0 17)} is VALID [2022-04-08 11:32:18,641 INFO L290 TraceCheckUtils]: 83: Hoare triple {25176#true} assume true; {25176#true} is VALID [2022-04-08 11:32:18,641 INFO L290 TraceCheckUtils]: 82: Hoare triple {25176#true} assume !(0 == ~cond); {25176#true} is VALID [2022-04-08 11:32:18,641 INFO L290 TraceCheckUtils]: 81: Hoare triple {25176#true} ~cond := #in~cond; {25176#true} is VALID [2022-04-08 11:32:18,641 INFO L272 TraceCheckUtils]: 80: Hoare triple {25836#(< ~counter~0 17)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {25176#true} is VALID [2022-04-08 11:32:18,641 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {25176#true} {25836#(< ~counter~0 17)} #83#return; {25836#(< ~counter~0 17)} is VALID [2022-04-08 11:32:18,641 INFO L290 TraceCheckUtils]: 78: Hoare triple {25176#true} assume true; {25176#true} is VALID [2022-04-08 11:32:18,641 INFO L290 TraceCheckUtils]: 77: Hoare triple {25176#true} assume !(0 == ~cond); {25176#true} is VALID [2022-04-08 11:32:18,641 INFO L290 TraceCheckUtils]: 76: Hoare triple {25176#true} ~cond := #in~cond; {25176#true} is VALID [2022-04-08 11:32:18,641 INFO L272 TraceCheckUtils]: 75: Hoare triple {25836#(< ~counter~0 17)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {25176#true} is VALID [2022-04-08 11:32:18,642 INFO L290 TraceCheckUtils]: 74: Hoare triple {25836#(< ~counter~0 17)} assume !!(#t~post7 < 20);havoc #t~post7; {25836#(< ~counter~0 17)} is VALID [2022-04-08 11:32:18,643 INFO L290 TraceCheckUtils]: 73: Hoare triple {25894#(< ~counter~0 16)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {25836#(< ~counter~0 17)} is VALID [2022-04-08 11:32:18,643 INFO L290 TraceCheckUtils]: 72: Hoare triple {25894#(< ~counter~0 16)} ~a~0 := 2 * ~a~0;~b~0 := 2 * ~b~0; {25894#(< ~counter~0 16)} is VALID [2022-04-08 11:32:18,644 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {25176#true} {25894#(< ~counter~0 16)} #89#return; {25894#(< ~counter~0 16)} is VALID [2022-04-08 11:32:18,644 INFO L290 TraceCheckUtils]: 70: Hoare triple {25176#true} assume true; {25176#true} is VALID [2022-04-08 11:32:18,644 INFO L290 TraceCheckUtils]: 69: Hoare triple {25176#true} assume !(0 == ~cond); {25176#true} is VALID [2022-04-08 11:32:18,644 INFO L290 TraceCheckUtils]: 68: Hoare triple {25176#true} ~cond := #in~cond; {25176#true} is VALID [2022-04-08 11:32:18,644 INFO L272 TraceCheckUtils]: 67: Hoare triple {25894#(< ~counter~0 16)} call __VERIFIER_assert((if ~r~0 >= 2 * ~y~0 * ~a~0 then 1 else 0)); {25176#true} is VALID [2022-04-08 11:32:18,644 INFO L290 TraceCheckUtils]: 66: Hoare triple {25894#(< ~counter~0 16)} assume !!(~r~0 >= 2 * ~b~0); {25894#(< ~counter~0 16)} is VALID [2022-04-08 11:32:18,644 INFO L284 TraceCheckUtils]: 65: Hoare quadruple {25176#true} {25894#(< ~counter~0 16)} #87#return; {25894#(< ~counter~0 16)} is VALID [2022-04-08 11:32:18,644 INFO L290 TraceCheckUtils]: 64: Hoare triple {25176#true} assume true; {25176#true} is VALID [2022-04-08 11:32:18,645 INFO L290 TraceCheckUtils]: 63: Hoare triple {25176#true} assume !(0 == ~cond); {25176#true} is VALID [2022-04-08 11:32:18,645 INFO L290 TraceCheckUtils]: 62: Hoare triple {25176#true} ~cond := #in~cond; {25176#true} is VALID [2022-04-08 11:32:18,645 INFO L272 TraceCheckUtils]: 61: Hoare triple {25894#(< ~counter~0 16)} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {25176#true} is VALID [2022-04-08 11:32:18,645 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {25176#true} {25894#(< ~counter~0 16)} #85#return; {25894#(< ~counter~0 16)} is VALID [2022-04-08 11:32:18,645 INFO L290 TraceCheckUtils]: 59: Hoare triple {25176#true} assume true; {25176#true} is VALID [2022-04-08 11:32:18,645 INFO L290 TraceCheckUtils]: 58: Hoare triple {25176#true} assume !(0 == ~cond); {25176#true} is VALID [2022-04-08 11:32:18,645 INFO L290 TraceCheckUtils]: 57: Hoare triple {25176#true} ~cond := #in~cond; {25176#true} is VALID [2022-04-08 11:32:18,645 INFO L272 TraceCheckUtils]: 56: Hoare triple {25894#(< ~counter~0 16)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {25176#true} is VALID [2022-04-08 11:32:18,646 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {25176#true} {25894#(< ~counter~0 16)} #83#return; {25894#(< ~counter~0 16)} is VALID [2022-04-08 11:32:18,646 INFO L290 TraceCheckUtils]: 54: Hoare triple {25176#true} assume true; {25176#true} is VALID [2022-04-08 11:32:18,646 INFO L290 TraceCheckUtils]: 53: Hoare triple {25176#true} assume !(0 == ~cond); {25176#true} is VALID [2022-04-08 11:32:18,646 INFO L290 TraceCheckUtils]: 52: Hoare triple {25176#true} ~cond := #in~cond; {25176#true} is VALID [2022-04-08 11:32:18,646 INFO L272 TraceCheckUtils]: 51: Hoare triple {25894#(< ~counter~0 16)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {25176#true} is VALID [2022-04-08 11:32:18,646 INFO L290 TraceCheckUtils]: 50: Hoare triple {25894#(< ~counter~0 16)} assume !!(#t~post7 < 20);havoc #t~post7; {25894#(< ~counter~0 16)} is VALID [2022-04-08 11:32:18,647 INFO L290 TraceCheckUtils]: 49: Hoare triple {25967#(< ~counter~0 15)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {25894#(< ~counter~0 16)} is VALID [2022-04-08 11:32:18,648 INFO L290 TraceCheckUtils]: 48: Hoare triple {25967#(< ~counter~0 15)} ~a~0 := 2 * ~a~0;~b~0 := 2 * ~b~0; {25967#(< ~counter~0 15)} is VALID [2022-04-08 11:32:18,648 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {25176#true} {25967#(< ~counter~0 15)} #89#return; {25967#(< ~counter~0 15)} is VALID [2022-04-08 11:32:18,648 INFO L290 TraceCheckUtils]: 46: Hoare triple {25176#true} assume true; {25176#true} is VALID [2022-04-08 11:32:18,648 INFO L290 TraceCheckUtils]: 45: Hoare triple {25176#true} assume !(0 == ~cond); {25176#true} is VALID [2022-04-08 11:32:18,648 INFO L290 TraceCheckUtils]: 44: Hoare triple {25176#true} ~cond := #in~cond; {25176#true} is VALID [2022-04-08 11:32:18,649 INFO L272 TraceCheckUtils]: 43: Hoare triple {25967#(< ~counter~0 15)} call __VERIFIER_assert((if ~r~0 >= 2 * ~y~0 * ~a~0 then 1 else 0)); {25176#true} is VALID [2022-04-08 11:32:18,649 INFO L290 TraceCheckUtils]: 42: Hoare triple {25967#(< ~counter~0 15)} assume !!(~r~0 >= 2 * ~b~0); {25967#(< ~counter~0 15)} is VALID [2022-04-08 11:32:18,649 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {25176#true} {25967#(< ~counter~0 15)} #87#return; {25967#(< ~counter~0 15)} is VALID [2022-04-08 11:32:18,649 INFO L290 TraceCheckUtils]: 40: Hoare triple {25176#true} assume true; {25176#true} is VALID [2022-04-08 11:32:18,649 INFO L290 TraceCheckUtils]: 39: Hoare triple {25176#true} assume !(0 == ~cond); {25176#true} is VALID [2022-04-08 11:32:18,649 INFO L290 TraceCheckUtils]: 38: Hoare triple {25176#true} ~cond := #in~cond; {25176#true} is VALID [2022-04-08 11:32:18,649 INFO L272 TraceCheckUtils]: 37: Hoare triple {25967#(< ~counter~0 15)} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {25176#true} is VALID [2022-04-08 11:32:18,650 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {25176#true} {25967#(< ~counter~0 15)} #85#return; {25967#(< ~counter~0 15)} is VALID [2022-04-08 11:32:18,650 INFO L290 TraceCheckUtils]: 35: Hoare triple {25176#true} assume true; {25176#true} is VALID [2022-04-08 11:32:18,650 INFO L290 TraceCheckUtils]: 34: Hoare triple {25176#true} assume !(0 == ~cond); {25176#true} is VALID [2022-04-08 11:32:18,650 INFO L290 TraceCheckUtils]: 33: Hoare triple {25176#true} ~cond := #in~cond; {25176#true} is VALID [2022-04-08 11:32:18,650 INFO L272 TraceCheckUtils]: 32: Hoare triple {25967#(< ~counter~0 15)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {25176#true} is VALID [2022-04-08 11:32:18,651 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {25176#true} {25967#(< ~counter~0 15)} #83#return; {25967#(< ~counter~0 15)} is VALID [2022-04-08 11:32:18,651 INFO L290 TraceCheckUtils]: 30: Hoare triple {25176#true} assume true; {25176#true} is VALID [2022-04-08 11:32:18,651 INFO L290 TraceCheckUtils]: 29: Hoare triple {25176#true} assume !(0 == ~cond); {25176#true} is VALID [2022-04-08 11:32:18,651 INFO L290 TraceCheckUtils]: 28: Hoare triple {25176#true} ~cond := #in~cond; {25176#true} is VALID [2022-04-08 11:32:18,651 INFO L272 TraceCheckUtils]: 27: Hoare triple {25967#(< ~counter~0 15)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {25176#true} is VALID [2022-04-08 11:32:18,651 INFO L290 TraceCheckUtils]: 26: Hoare triple {25967#(< ~counter~0 15)} assume !!(#t~post7 < 20);havoc #t~post7; {25967#(< ~counter~0 15)} is VALID [2022-04-08 11:32:18,652 INFO L290 TraceCheckUtils]: 25: Hoare triple {26040#(< ~counter~0 14)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {25967#(< ~counter~0 15)} is VALID [2022-04-08 11:32:18,652 INFO L290 TraceCheckUtils]: 24: Hoare triple {26040#(< ~counter~0 14)} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {26040#(< ~counter~0 14)} is VALID [2022-04-08 11:32:18,653 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {25176#true} {26040#(< ~counter~0 14)} #81#return; {26040#(< ~counter~0 14)} is VALID [2022-04-08 11:32:18,653 INFO L290 TraceCheckUtils]: 22: Hoare triple {25176#true} assume true; {25176#true} is VALID [2022-04-08 11:32:18,653 INFO L290 TraceCheckUtils]: 21: Hoare triple {25176#true} assume !(0 == ~cond); {25176#true} is VALID [2022-04-08 11:32:18,653 INFO L290 TraceCheckUtils]: 20: Hoare triple {25176#true} ~cond := #in~cond; {25176#true} is VALID [2022-04-08 11:32:18,653 INFO L272 TraceCheckUtils]: 19: Hoare triple {26040#(< ~counter~0 14)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {25176#true} is VALID [2022-04-08 11:32:18,654 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {25176#true} {26040#(< ~counter~0 14)} #79#return; {26040#(< ~counter~0 14)} is VALID [2022-04-08 11:32:18,654 INFO L290 TraceCheckUtils]: 17: Hoare triple {25176#true} assume true; {25176#true} is VALID [2022-04-08 11:32:18,654 INFO L290 TraceCheckUtils]: 16: Hoare triple {25176#true} assume !(0 == ~cond); {25176#true} is VALID [2022-04-08 11:32:18,654 INFO L290 TraceCheckUtils]: 15: Hoare triple {25176#true} ~cond := #in~cond; {25176#true} is VALID [2022-04-08 11:32:18,654 INFO L272 TraceCheckUtils]: 14: Hoare triple {26040#(< ~counter~0 14)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {25176#true} is VALID [2022-04-08 11:32:18,654 INFO L290 TraceCheckUtils]: 13: Hoare triple {26040#(< ~counter~0 14)} assume !!(#t~post6 < 20);havoc #t~post6; {26040#(< ~counter~0 14)} is VALID [2022-04-08 11:32:18,655 INFO L290 TraceCheckUtils]: 12: Hoare triple {26080#(< ~counter~0 13)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {26040#(< ~counter~0 14)} is VALID [2022-04-08 11:32:18,656 INFO L290 TraceCheckUtils]: 11: Hoare triple {26080#(< ~counter~0 13)} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {26080#(< ~counter~0 13)} is VALID [2022-04-08 11:32:18,656 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {25176#true} {26080#(< ~counter~0 13)} #77#return; {26080#(< ~counter~0 13)} is VALID [2022-04-08 11:32:18,656 INFO L290 TraceCheckUtils]: 9: Hoare triple {25176#true} assume true; {25176#true} is VALID [2022-04-08 11:32:18,656 INFO L290 TraceCheckUtils]: 8: Hoare triple {25176#true} assume !(0 == ~cond); {25176#true} is VALID [2022-04-08 11:32:18,656 INFO L290 TraceCheckUtils]: 7: Hoare triple {25176#true} ~cond := #in~cond; {25176#true} is VALID [2022-04-08 11:32:18,656 INFO L272 TraceCheckUtils]: 6: Hoare triple {26080#(< ~counter~0 13)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {25176#true} is VALID [2022-04-08 11:32:18,657 INFO L290 TraceCheckUtils]: 5: Hoare triple {26080#(< ~counter~0 13)} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {26080#(< ~counter~0 13)} is VALID [2022-04-08 11:32:18,657 INFO L272 TraceCheckUtils]: 4: Hoare triple {26080#(< ~counter~0 13)} call #t~ret8 := main(); {26080#(< ~counter~0 13)} is VALID [2022-04-08 11:32:18,657 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26080#(< ~counter~0 13)} {25176#true} #93#return; {26080#(< ~counter~0 13)} is VALID [2022-04-08 11:32:18,658 INFO L290 TraceCheckUtils]: 2: Hoare triple {26080#(< ~counter~0 13)} assume true; {26080#(< ~counter~0 13)} is VALID [2022-04-08 11:32:18,659 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 13)} is VALID [2022-04-08 11:32:18,659 INFO L272 TraceCheckUtils]: 0: Hoare triple {25176#true} call ULTIMATE.init(); {25176#true} is VALID [2022-04-08 11:32:18,659 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:32:18,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:32:18,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170184123] [2022-04-08 11:32:18,659 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:32:18,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [304119849] [2022-04-08 11:32:18,660 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [304119849] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 11:32:18,660 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 11:32:18,660 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2022-04-08 11:32:18,660 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:32:18,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [735629055] [2022-04-08 11:32:18,660 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [735629055] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:32:18,660 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:32:18,660 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-08 11:32:18,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625270102] [2022-04-08 11:32:18,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:32:18,661 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:32:18,661 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:32:18,661 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:32:18,785 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:32:18,785 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-08 11:32:18,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:32:18,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-08 11:32:18,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=222, Unknown=0, NotChecked=0, Total=380 [2022-04-08 11:32:18,786 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:32:20,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:32:20,505 INFO L93 Difference]: Finished difference Result 362 states and 414 transitions. [2022-04-08 11:32:20,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-08 11:32:20,506 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:32:20,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:32:20,506 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:32:20,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 181 transitions. [2022-04-08 11:32:20,509 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:32:20,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 181 transitions. [2022-04-08 11:32:20,512 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 181 transitions. [2022-04-08 11:32:20,725 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:32:20,735 INFO L225 Difference]: With dead ends: 362 [2022-04-08 11:32:20,735 INFO L226 Difference]: Without dead ends: 355 [2022-04-08 11:32:20,736 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:32:20,737 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:32:20,737 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:32:20,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2022-04-08 11:32:21,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 344. [2022-04-08 11:32:21,431 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:32:21,432 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:32:21,435 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:32:21,435 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:32:21,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:32:21,444 INFO L93 Difference]: Finished difference Result 355 states and 406 transitions. [2022-04-08 11:32:21,444 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 406 transitions. [2022-04-08 11:32:21,445 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:32:21,445 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:32:21,446 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:32:21,446 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:32:21,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:32:21,457 INFO L93 Difference]: Finished difference Result 355 states and 406 transitions. [2022-04-08 11:32:21,457 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 406 transitions. [2022-04-08 11:32:21,458 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:32:21,458 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:32:21,458 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:32:21,458 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:32:21,459 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:32:21,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 395 transitions. [2022-04-08 11:32:21,468 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 395 transitions. Word has length 154 [2022-04-08 11:32:21,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:32:21,469 INFO L478 AbstractCegarLoop]: Abstraction has 344 states and 395 transitions. [2022-04-08 11:32:21,469 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:32:21,469 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 344 states and 395 transitions. [2022-04-08 11:32:22,409 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:32:22,409 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 395 transitions. [2022-04-08 11:32:22,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2022-04-08 11:32:22,412 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:32:22,412 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:32:22,435 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:32:22,631 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:32:22,631 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:32:22,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:32:22,632 INFO L85 PathProgramCache]: Analyzing trace with hash -1775621107, now seen corresponding path program 3 times [2022-04-08 11:32:22,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:32:22,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1317352868] [2022-04-08 11:33:05,740 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 11:33:05,741 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 11:33:05,741 INFO L85 PathProgramCache]: Analyzing trace with hash -1775621107, now seen corresponding path program 4 times [2022-04-08 11:33:05,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:33:05,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483156818] [2022-04-08 11:33:05,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:33:05,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:33:05,758 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:33:05,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1939498969] [2022-04-08 11:33:05,758 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 11:33:05,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:33:05,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:33:05,764 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:33:05,765 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:33:05,861 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 11:33:05,862 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:33:05,864 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 51 conjunts are in the unsatisfiable core [2022-04-08 11:33:05,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:33:05,902 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:33:46,757 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-08 11:33:49,241 INFO L272 TraceCheckUtils]: 0: Hoare triple {28249#true} call ULTIMATE.init(); {28249#true} is VALID [2022-04-08 11:33:49,241 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:49,241 INFO L290 TraceCheckUtils]: 2: Hoare triple {28249#true} assume true; {28249#true} is VALID [2022-04-08 11:33:49,241 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28249#true} {28249#true} #93#return; {28249#true} is VALID [2022-04-08 11:33:49,241 INFO L272 TraceCheckUtils]: 4: Hoare triple {28249#true} call #t~ret8 := main(); {28249#true} is VALID [2022-04-08 11:33:49,241 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:49,241 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:49,241 INFO L290 TraceCheckUtils]: 7: Hoare triple {28249#true} ~cond := #in~cond; {28249#true} is VALID [2022-04-08 11:33:49,242 INFO L290 TraceCheckUtils]: 8: Hoare triple {28249#true} assume !(0 == ~cond); {28249#true} is VALID [2022-04-08 11:33:49,242 INFO L290 TraceCheckUtils]: 9: Hoare triple {28249#true} assume true; {28249#true} is VALID [2022-04-08 11:33:49,242 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {28249#true} {28249#true} #77#return; {28249#true} is VALID [2022-04-08 11:33:49,242 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:33:49,242 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:33:49,243 INFO L290 TraceCheckUtils]: 13: Hoare triple {28287#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} assume !!(#t~post6 < 20);havoc #t~post6; {28287#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 11:33:49,243 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:33:49,243 INFO L290 TraceCheckUtils]: 15: Hoare triple {28249#true} ~cond := #in~cond; {28249#true} is VALID [2022-04-08 11:33:49,243 INFO L290 TraceCheckUtils]: 16: Hoare triple {28249#true} assume !(0 == ~cond); {28249#true} is VALID [2022-04-08 11:33:49,243 INFO L290 TraceCheckUtils]: 17: Hoare triple {28249#true} assume true; {28249#true} is VALID [2022-04-08 11:33:49,244 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:33:49,244 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:33:49,244 INFO L290 TraceCheckUtils]: 20: Hoare triple {28249#true} ~cond := #in~cond; {28249#true} is VALID [2022-04-08 11:33:49,244 INFO L290 TraceCheckUtils]: 21: Hoare triple {28249#true} assume !(0 == ~cond); {28249#true} is VALID [2022-04-08 11:33:49,244 INFO L290 TraceCheckUtils]: 22: Hoare triple {28249#true} assume true; {28249#true} is VALID [2022-04-08 11:33:49,244 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:33:49,245 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:33:49,245 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:33:49,245 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 < 20);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:33:49,245 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:33:49,245 INFO L290 TraceCheckUtils]: 28: Hoare triple {28249#true} ~cond := #in~cond; {28249#true} is VALID [2022-04-08 11:33:49,246 INFO L290 TraceCheckUtils]: 29: Hoare triple {28249#true} assume !(0 == ~cond); {28249#true} is VALID [2022-04-08 11:33:49,246 INFO L290 TraceCheckUtils]: 30: Hoare triple {28249#true} assume true; {28249#true} is VALID [2022-04-08 11:33:49,246 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:33:49,246 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:33:49,246 INFO L290 TraceCheckUtils]: 33: Hoare triple {28249#true} ~cond := #in~cond; {28249#true} is VALID [2022-04-08 11:33:49,246 INFO L290 TraceCheckUtils]: 34: Hoare triple {28249#true} assume !(0 == ~cond); {28249#true} is VALID [2022-04-08 11:33:49,246 INFO L290 TraceCheckUtils]: 35: Hoare triple {28249#true} assume true; {28249#true} is VALID [2022-04-08 11:33:49,247 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:33:49,247 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:33:49,247 INFO L290 TraceCheckUtils]: 38: Hoare triple {28249#true} ~cond := #in~cond; {28249#true} is VALID [2022-04-08 11:33:49,247 INFO L290 TraceCheckUtils]: 39: Hoare triple {28249#true} assume !(0 == ~cond); {28249#true} is VALID [2022-04-08 11:33:49,247 INFO L290 TraceCheckUtils]: 40: Hoare triple {28249#true} assume true; {28249#true} is VALID [2022-04-08 11:33:49,248 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:33:49,248 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:33:49,248 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:33:49,248 INFO L290 TraceCheckUtils]: 44: Hoare triple {28249#true} ~cond := #in~cond; {28249#true} is VALID [2022-04-08 11:33:49,248 INFO L290 TraceCheckUtils]: 45: Hoare triple {28249#true} assume !(0 == ~cond); {28249#true} is VALID [2022-04-08 11:33:49,248 INFO L290 TraceCheckUtils]: 46: Hoare triple {28249#true} assume true; {28249#true} is VALID [2022-04-08 11:33:49,249 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:33:49,250 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:33:49,250 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:33:49,251 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 < 20);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:33:49,251 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:33:49,251 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:33:49,251 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:33:49,252 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:33:49,252 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:33:49,252 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:33:49,253 INFO L290 TraceCheckUtils]: 57: Hoare triple {28249#true} ~cond := #in~cond; {28249#true} is VALID [2022-04-08 11:33:49,253 INFO L290 TraceCheckUtils]: 58: Hoare triple {28249#true} assume !(0 == ~cond); {28249#true} is VALID [2022-04-08 11:33:49,253 INFO L290 TraceCheckUtils]: 59: Hoare triple {28249#true} assume true; {28249#true} is VALID [2022-04-08 11:33:49,253 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:33:49,253 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:33:49,253 INFO L290 TraceCheckUtils]: 62: Hoare triple {28249#true} ~cond := #in~cond; {28249#true} is VALID [2022-04-08 11:33:49,253 INFO L290 TraceCheckUtils]: 63: Hoare triple {28249#true} assume !(0 == ~cond); {28249#true} is VALID [2022-04-08 11:33:49,253 INFO L290 TraceCheckUtils]: 64: Hoare triple {28249#true} assume true; {28249#true} is VALID [2022-04-08 11:33:49,254 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:33:49,254 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:33:49,254 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:33:49,255 INFO L290 TraceCheckUtils]: 68: Hoare triple {28249#true} ~cond := #in~cond; {28249#true} is VALID [2022-04-08 11:33:49,255 INFO L290 TraceCheckUtils]: 69: Hoare triple {28249#true} assume !(0 == ~cond); {28249#true} is VALID [2022-04-08 11:33:49,255 INFO L290 TraceCheckUtils]: 70: Hoare triple {28249#true} assume true; {28249#true} is VALID [2022-04-08 11:33:49,255 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:33:49,260 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:33:49,261 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:33:49,261 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 < 20);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:33:49,261 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:33:49,261 INFO L290 TraceCheckUtils]: 76: Hoare triple {28249#true} ~cond := #in~cond; {28249#true} is VALID [2022-04-08 11:33:49,261 INFO L290 TraceCheckUtils]: 77: Hoare triple {28249#true} assume !(0 == ~cond); {28249#true} is VALID [2022-04-08 11:33:49,261 INFO L290 TraceCheckUtils]: 78: Hoare triple {28249#true} assume true; {28249#true} is VALID [2022-04-08 11:33:49,262 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:33:49,262 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:33:49,262 INFO L290 TraceCheckUtils]: 81: Hoare triple {28249#true} ~cond := #in~cond; {28249#true} is VALID [2022-04-08 11:33:49,262 INFO L290 TraceCheckUtils]: 82: Hoare triple {28249#true} assume !(0 == ~cond); {28249#true} is VALID [2022-04-08 11:33:49,262 INFO L290 TraceCheckUtils]: 83: Hoare triple {28249#true} assume true; {28249#true} is VALID [2022-04-08 11:33:49,263 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:33:49,263 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:33:49,263 INFO L290 TraceCheckUtils]: 86: Hoare triple {28249#true} ~cond := #in~cond; {28249#true} is VALID [2022-04-08 11:33:49,263 INFO L290 TraceCheckUtils]: 87: Hoare triple {28249#true} assume !(0 == ~cond); {28249#true} is VALID [2022-04-08 11:33:49,263 INFO L290 TraceCheckUtils]: 88: Hoare triple {28249#true} assume true; {28249#true} is VALID [2022-04-08 11:33:49,264 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:33:49,265 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:33:49,267 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:33:49,268 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:33:49,269 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 < 20);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:33:49,269 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:33:49,269 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:33:49,270 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:33:49,270 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:33:49,272 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:33:49,273 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:33:49,273 INFO L290 TraceCheckUtils]: 100: Hoare triple {28249#true} ~cond := #in~cond; {28249#true} is VALID [2022-04-08 11:33:49,273 INFO L290 TraceCheckUtils]: 101: Hoare triple {28249#true} assume !(0 == ~cond); {28249#true} is VALID [2022-04-08 11:33:49,273 INFO L290 TraceCheckUtils]: 102: Hoare triple {28249#true} assume true; {28249#true} is VALID [2022-04-08 11:33:49,274 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:33:49,274 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:33:49,275 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:33:49,275 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 < 20);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:33:49,275 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:33:49,275 INFO L290 TraceCheckUtils]: 108: Hoare triple {28249#true} ~cond := #in~cond; {28249#true} is VALID [2022-04-08 11:33:49,275 INFO L290 TraceCheckUtils]: 109: Hoare triple {28249#true} assume !(0 == ~cond); {28249#true} is VALID [2022-04-08 11:33:49,275 INFO L290 TraceCheckUtils]: 110: Hoare triple {28249#true} assume true; {28249#true} is VALID [2022-04-08 11:33:49,276 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:33:49,276 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:33:49,276 INFO L290 TraceCheckUtils]: 113: Hoare triple {28249#true} ~cond := #in~cond; {28249#true} is VALID [2022-04-08 11:33:49,276 INFO L290 TraceCheckUtils]: 114: Hoare triple {28249#true} assume !(0 == ~cond); {28249#true} is VALID [2022-04-08 11:33:49,276 INFO L290 TraceCheckUtils]: 115: Hoare triple {28249#true} assume true; {28249#true} is VALID [2022-04-08 11:33:49,277 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:33:49,277 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:33:49,277 INFO L290 TraceCheckUtils]: 118: Hoare triple {28249#true} ~cond := #in~cond; {28249#true} is VALID [2022-04-08 11:33:49,277 INFO L290 TraceCheckUtils]: 119: Hoare triple {28249#true} assume !(0 == ~cond); {28249#true} is VALID [2022-04-08 11:33:49,277 INFO L290 TraceCheckUtils]: 120: Hoare triple {28249#true} assume true; {28249#true} is VALID [2022-04-08 11:33:49,277 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:33:49,278 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:33:49,278 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:33:49,278 INFO L290 TraceCheckUtils]: 124: Hoare triple {28249#true} ~cond := #in~cond; {28249#true} is VALID [2022-04-08 11:33:49,278 INFO L290 TraceCheckUtils]: 125: Hoare triple {28249#true} assume !(0 == ~cond); {28249#true} is VALID [2022-04-08 11:33:49,278 INFO L290 TraceCheckUtils]: 126: Hoare triple {28249#true} assume true; {28249#true} is VALID [2022-04-08 11:33:49,279 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:33:49,281 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:33:49,281 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:33:49,282 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 < 20);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:33:49,282 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:33:49,282 INFO L290 TraceCheckUtils]: 132: Hoare triple {28249#true} ~cond := #in~cond; {28249#true} is VALID [2022-04-08 11:33:49,282 INFO L290 TraceCheckUtils]: 133: Hoare triple {28249#true} assume !(0 == ~cond); {28249#true} is VALID [2022-04-08 11:33:49,282 INFO L290 TraceCheckUtils]: 134: Hoare triple {28249#true} assume true; {28249#true} is VALID [2022-04-08 11:33:49,283 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:33:49,283 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:33:49,283 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:33:49,284 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:33:49,284 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:49,285 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:33:49,285 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:33:49,285 INFO L290 TraceCheckUtils]: 142: Hoare triple {28249#true} ~cond := #in~cond; {28249#true} is VALID [2022-04-08 11:33:49,285 INFO L290 TraceCheckUtils]: 143: Hoare triple {28249#true} assume !(0 == ~cond); {28249#true} is VALID [2022-04-08 11:33:49,285 INFO L290 TraceCheckUtils]: 144: Hoare triple {28249#true} assume true; {28249#true} is VALID [2022-04-08 11:33:49,286 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:33:49,287 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:33:49,296 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:33:49,297 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:33:49,297 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 < 20);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:33:49,297 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:33:49,298 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:33:49,307 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:33:49,307 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:49,320 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:33:49,330 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:33:49,330 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:49,331 INFO L290 TraceCheckUtils]: 157: Hoare triple {28736#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {28250#false} is VALID [2022-04-08 11:33:49,331 INFO L290 TraceCheckUtils]: 158: Hoare triple {28250#false} assume !false; {28250#false} is VALID [2022-04-08 11:33:49,332 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:33:49,332 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 11:34:08,719 INFO L290 TraceCheckUtils]: 158: Hoare triple {28250#false} assume !false; {28250#false} is VALID [2022-04-08 11:34:08,719 INFO L290 TraceCheckUtils]: 157: Hoare triple {28736#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {28250#false} is VALID [2022-04-08 11:34:08,720 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:34:08,721 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:34:08,722 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:34:08,722 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:34:08,722 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:34:08,723 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:34:08,723 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:34:08,724 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 < 20);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:34:08,724 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:34:08,754 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:34:08,755 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:34:08,756 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:34:08,756 INFO L290 TraceCheckUtils]: 144: Hoare triple {28249#true} assume true; {28249#true} is VALID [2022-04-08 11:34:08,756 INFO L290 TraceCheckUtils]: 143: Hoare triple {28249#true} assume !(0 == ~cond); {28249#true} is VALID [2022-04-08 11:34:08,756 INFO L290 TraceCheckUtils]: 142: Hoare triple {28249#true} ~cond := #in~cond; {28249#true} is VALID [2022-04-08 11:34:08,756 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:34:08,757 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:34:08,758 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:34:08,758 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:34:08,767 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:34:08,767 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:34:08,767 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {28249#true} {28249#true} #83#return; {28249#true} is VALID [2022-04-08 11:34:08,767 INFO L290 TraceCheckUtils]: 134: Hoare triple {28249#true} assume true; {28249#true} is VALID [2022-04-08 11:34:08,767 INFO L290 TraceCheckUtils]: 133: Hoare triple {28249#true} assume !(0 == ~cond); {28249#true} is VALID [2022-04-08 11:34:08,767 INFO L290 TraceCheckUtils]: 132: Hoare triple {28249#true} ~cond := #in~cond; {28249#true} is VALID [2022-04-08 11:34:08,767 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:34:08,767 INFO L290 TraceCheckUtils]: 130: Hoare triple {28249#true} assume !!(#t~post7 < 20);havoc #t~post7; {28249#true} is VALID [2022-04-08 11:34:08,767 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:34:08,768 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:34:08,768 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {28249#true} {28249#true} #89#return; {28249#true} is VALID [2022-04-08 11:34:08,768 INFO L290 TraceCheckUtils]: 126: Hoare triple {28249#true} assume true; {28249#true} is VALID [2022-04-08 11:34:08,768 INFO L290 TraceCheckUtils]: 125: Hoare triple {28249#true} assume !(0 == ~cond); {28249#true} is VALID [2022-04-08 11:34:08,768 INFO L290 TraceCheckUtils]: 124: Hoare triple {28249#true} ~cond := #in~cond; {28249#true} is VALID [2022-04-08 11:34:08,768 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:34:08,768 INFO L290 TraceCheckUtils]: 122: Hoare triple {28249#true} assume !!(~r~0 >= 2 * ~b~0); {28249#true} is VALID [2022-04-08 11:34:08,768 INFO L284 TraceCheckUtils]: 121: Hoare quadruple {28249#true} {28249#true} #87#return; {28249#true} is VALID [2022-04-08 11:34:08,768 INFO L290 TraceCheckUtils]: 120: Hoare triple {28249#true} assume true; {28249#true} is VALID [2022-04-08 11:34:08,768 INFO L290 TraceCheckUtils]: 119: Hoare triple {28249#true} assume !(0 == ~cond); {28249#true} is VALID [2022-04-08 11:34:08,768 INFO L290 TraceCheckUtils]: 118: Hoare triple {28249#true} ~cond := #in~cond; {28249#true} is VALID [2022-04-08 11:34:08,768 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:34:08,768 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {28249#true} {28249#true} #85#return; {28249#true} is VALID [2022-04-08 11:34:08,769 INFO L290 TraceCheckUtils]: 115: Hoare triple {28249#true} assume true; {28249#true} is VALID [2022-04-08 11:34:08,769 INFO L290 TraceCheckUtils]: 114: Hoare triple {28249#true} assume !(0 == ~cond); {28249#true} is VALID [2022-04-08 11:34:08,769 INFO L290 TraceCheckUtils]: 113: Hoare triple {28249#true} ~cond := #in~cond; {28249#true} is VALID [2022-04-08 11:34:08,769 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:34:08,769 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {28249#true} {28249#true} #83#return; {28249#true} is VALID [2022-04-08 11:34:08,769 INFO L290 TraceCheckUtils]: 110: Hoare triple {28249#true} assume true; {28249#true} is VALID [2022-04-08 11:34:08,769 INFO L290 TraceCheckUtils]: 109: Hoare triple {28249#true} assume !(0 == ~cond); {28249#true} is VALID [2022-04-08 11:34:08,769 INFO L290 TraceCheckUtils]: 108: Hoare triple {28249#true} ~cond := #in~cond; {28249#true} is VALID [2022-04-08 11:34:08,769 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:34:08,769 INFO L290 TraceCheckUtils]: 106: Hoare triple {28249#true} assume !!(#t~post7 < 20);havoc #t~post7; {28249#true} is VALID [2022-04-08 11:34:08,769 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:34:08,769 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:34:08,769 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {28249#true} {28249#true} #81#return; {28249#true} is VALID [2022-04-08 11:34:08,770 INFO L290 TraceCheckUtils]: 102: Hoare triple {28249#true} assume true; {28249#true} is VALID [2022-04-08 11:34:08,770 INFO L290 TraceCheckUtils]: 101: Hoare triple {28249#true} assume !(0 == ~cond); {28249#true} is VALID [2022-04-08 11:34:08,770 INFO L290 TraceCheckUtils]: 100: Hoare triple {28249#true} ~cond := #in~cond; {28249#true} is VALID [2022-04-08 11:34:08,770 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:34:08,770 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {28249#true} {28249#true} #79#return; {28249#true} is VALID [2022-04-08 11:34:08,770 INFO L290 TraceCheckUtils]: 97: Hoare triple {28249#true} assume true; {28249#true} is VALID [2022-04-08 11:34:08,770 INFO L290 TraceCheckUtils]: 96: Hoare triple {28249#true} assume !(0 == ~cond); {28249#true} is VALID [2022-04-08 11:34:08,770 INFO L290 TraceCheckUtils]: 95: Hoare triple {28249#true} ~cond := #in~cond; {28249#true} is VALID [2022-04-08 11:34:08,770 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:34:08,770 INFO L290 TraceCheckUtils]: 93: Hoare triple {28249#true} assume !!(#t~post6 < 20);havoc #t~post6; {28249#true} is VALID [2022-04-08 11:34:08,770 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:34:08,770 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:34:08,770 INFO L290 TraceCheckUtils]: 90: Hoare triple {28249#true} assume !(~r~0 >= 2 * ~b~0); {28249#true} is VALID [2022-04-08 11:34:08,770 INFO L284 TraceCheckUtils]: 89: Hoare quadruple {28249#true} {28249#true} #87#return; {28249#true} is VALID [2022-04-08 11:34:08,771 INFO L290 TraceCheckUtils]: 88: Hoare triple {28249#true} assume true; {28249#true} is VALID [2022-04-08 11:34:08,771 INFO L290 TraceCheckUtils]: 87: Hoare triple {28249#true} assume !(0 == ~cond); {28249#true} is VALID [2022-04-08 11:34:08,771 INFO L290 TraceCheckUtils]: 86: Hoare triple {28249#true} ~cond := #in~cond; {28249#true} is VALID [2022-04-08 11:34:08,771 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:34:08,771 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {28249#true} {28249#true} #85#return; {28249#true} is VALID [2022-04-08 11:34:08,771 INFO L290 TraceCheckUtils]: 83: Hoare triple {28249#true} assume true; {28249#true} is VALID [2022-04-08 11:34:08,771 INFO L290 TraceCheckUtils]: 82: Hoare triple {28249#true} assume !(0 == ~cond); {28249#true} is VALID [2022-04-08 11:34:08,771 INFO L290 TraceCheckUtils]: 81: Hoare triple {28249#true} ~cond := #in~cond; {28249#true} is VALID [2022-04-08 11:34:08,771 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:34:08,771 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {28249#true} {28249#true} #83#return; {28249#true} is VALID [2022-04-08 11:34:08,771 INFO L290 TraceCheckUtils]: 78: Hoare triple {28249#true} assume true; {28249#true} is VALID [2022-04-08 11:34:08,771 INFO L290 TraceCheckUtils]: 77: Hoare triple {28249#true} assume !(0 == ~cond); {28249#true} is VALID [2022-04-08 11:34:08,771 INFO L290 TraceCheckUtils]: 76: Hoare triple {28249#true} ~cond := #in~cond; {28249#true} is VALID [2022-04-08 11:34:08,772 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:34:08,772 INFO L290 TraceCheckUtils]: 74: Hoare triple {28249#true} assume !!(#t~post7 < 20);havoc #t~post7; {28249#true} is VALID [2022-04-08 11:34:08,772 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:34:08,772 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:34:08,772 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {28249#true} {28249#true} #89#return; {28249#true} is VALID [2022-04-08 11:34:08,772 INFO L290 TraceCheckUtils]: 70: Hoare triple {28249#true} assume true; {28249#true} is VALID [2022-04-08 11:34:08,772 INFO L290 TraceCheckUtils]: 69: Hoare triple {28249#true} assume !(0 == ~cond); {28249#true} is VALID [2022-04-08 11:34:08,772 INFO L290 TraceCheckUtils]: 68: Hoare triple {28249#true} ~cond := #in~cond; {28249#true} is VALID [2022-04-08 11:34:08,772 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:34:08,772 INFO L290 TraceCheckUtils]: 66: Hoare triple {28249#true} assume !!(~r~0 >= 2 * ~b~0); {28249#true} is VALID [2022-04-08 11:34:08,772 INFO L284 TraceCheckUtils]: 65: Hoare quadruple {28249#true} {28249#true} #87#return; {28249#true} is VALID [2022-04-08 11:34:08,772 INFO L290 TraceCheckUtils]: 64: Hoare triple {28249#true} assume true; {28249#true} is VALID [2022-04-08 11:34:08,772 INFO L290 TraceCheckUtils]: 63: Hoare triple {28249#true} assume !(0 == ~cond); {28249#true} is VALID [2022-04-08 11:34:08,773 INFO L290 TraceCheckUtils]: 62: Hoare triple {28249#true} ~cond := #in~cond; {28249#true} is VALID [2022-04-08 11:34:08,773 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:34:08,773 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {28249#true} {28249#true} #85#return; {28249#true} is VALID [2022-04-08 11:34:08,773 INFO L290 TraceCheckUtils]: 59: Hoare triple {28249#true} assume true; {28249#true} is VALID [2022-04-08 11:34:08,773 INFO L290 TraceCheckUtils]: 58: Hoare triple {28249#true} assume !(0 == ~cond); {28249#true} is VALID [2022-04-08 11:34:08,773 INFO L290 TraceCheckUtils]: 57: Hoare triple {28249#true} ~cond := #in~cond; {28249#true} is VALID [2022-04-08 11:34:08,773 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:34:08,773 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {28249#true} {28249#true} #83#return; {28249#true} is VALID [2022-04-08 11:34:08,773 INFO L290 TraceCheckUtils]: 54: Hoare triple {28249#true} assume true; {28249#true} is VALID [2022-04-08 11:34:08,773 INFO L290 TraceCheckUtils]: 53: Hoare triple {28249#true} assume !(0 == ~cond); {28249#true} is VALID [2022-04-08 11:34:08,773 INFO L290 TraceCheckUtils]: 52: Hoare triple {28249#true} ~cond := #in~cond; {28249#true} is VALID [2022-04-08 11:34:08,773 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:34:08,773 INFO L290 TraceCheckUtils]: 50: Hoare triple {28249#true} assume !!(#t~post7 < 20);havoc #t~post7; {28249#true} is VALID [2022-04-08 11:34:08,773 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:34:08,774 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:34:08,774 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {28249#true} {28249#true} #89#return; {28249#true} is VALID [2022-04-08 11:34:08,774 INFO L290 TraceCheckUtils]: 46: Hoare triple {28249#true} assume true; {28249#true} is VALID [2022-04-08 11:34:08,774 INFO L290 TraceCheckUtils]: 45: Hoare triple {28249#true} assume !(0 == ~cond); {28249#true} is VALID [2022-04-08 11:34:08,774 INFO L290 TraceCheckUtils]: 44: Hoare triple {28249#true} ~cond := #in~cond; {28249#true} is VALID [2022-04-08 11:34:08,774 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:34:08,774 INFO L290 TraceCheckUtils]: 42: Hoare triple {28249#true} assume !!(~r~0 >= 2 * ~b~0); {28249#true} is VALID [2022-04-08 11:34:08,774 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {28249#true} {28249#true} #87#return; {28249#true} is VALID [2022-04-08 11:34:08,774 INFO L290 TraceCheckUtils]: 40: Hoare triple {28249#true} assume true; {28249#true} is VALID [2022-04-08 11:34:08,774 INFO L290 TraceCheckUtils]: 39: Hoare triple {28249#true} assume !(0 == ~cond); {28249#true} is VALID [2022-04-08 11:34:08,774 INFO L290 TraceCheckUtils]: 38: Hoare triple {28249#true} ~cond := #in~cond; {28249#true} is VALID [2022-04-08 11:34:08,774 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:34:08,774 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {28249#true} {28249#true} #85#return; {28249#true} is VALID [2022-04-08 11:34:08,775 INFO L290 TraceCheckUtils]: 35: Hoare triple {28249#true} assume true; {28249#true} is VALID [2022-04-08 11:34:08,775 INFO L290 TraceCheckUtils]: 34: Hoare triple {28249#true} assume !(0 == ~cond); {28249#true} is VALID [2022-04-08 11:34:08,775 INFO L290 TraceCheckUtils]: 33: Hoare triple {28249#true} ~cond := #in~cond; {28249#true} is VALID [2022-04-08 11:34:08,775 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:34:08,775 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {28249#true} {28249#true} #83#return; {28249#true} is VALID [2022-04-08 11:34:08,775 INFO L290 TraceCheckUtils]: 30: Hoare triple {28249#true} assume true; {28249#true} is VALID [2022-04-08 11:34:08,775 INFO L290 TraceCheckUtils]: 29: Hoare triple {28249#true} assume !(0 == ~cond); {28249#true} is VALID [2022-04-08 11:34:08,775 INFO L290 TraceCheckUtils]: 28: Hoare triple {28249#true} ~cond := #in~cond; {28249#true} is VALID [2022-04-08 11:34:08,775 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:34:08,775 INFO L290 TraceCheckUtils]: 26: Hoare triple {28249#true} assume !!(#t~post7 < 20);havoc #t~post7; {28249#true} is VALID [2022-04-08 11:34:08,775 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:34:08,775 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:34:08,775 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {28249#true} {28249#true} #81#return; {28249#true} is VALID [2022-04-08 11:34:08,776 INFO L290 TraceCheckUtils]: 22: Hoare triple {28249#true} assume true; {28249#true} is VALID [2022-04-08 11:34:08,776 INFO L290 TraceCheckUtils]: 21: Hoare triple {28249#true} assume !(0 == ~cond); {28249#true} is VALID [2022-04-08 11:34:08,776 INFO L290 TraceCheckUtils]: 20: Hoare triple {28249#true} ~cond := #in~cond; {28249#true} is VALID [2022-04-08 11:34:08,776 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:34:08,776 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {28249#true} {28249#true} #79#return; {28249#true} is VALID [2022-04-08 11:34:08,776 INFO L290 TraceCheckUtils]: 17: Hoare triple {28249#true} assume true; {28249#true} is VALID [2022-04-08 11:34:08,776 INFO L290 TraceCheckUtils]: 16: Hoare triple {28249#true} assume !(0 == ~cond); {28249#true} is VALID [2022-04-08 11:34:08,776 INFO L290 TraceCheckUtils]: 15: Hoare triple {28249#true} ~cond := #in~cond; {28249#true} is VALID [2022-04-08 11:34:08,776 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:34:08,776 INFO L290 TraceCheckUtils]: 13: Hoare triple {28249#true} assume !!(#t~post6 < 20);havoc #t~post6; {28249#true} is VALID [2022-04-08 11:34:08,776 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:34:08,776 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:34:08,776 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {28249#true} {28249#true} #77#return; {28249#true} is VALID [2022-04-08 11:34:08,777 INFO L290 TraceCheckUtils]: 9: Hoare triple {28249#true} assume true; {28249#true} is VALID [2022-04-08 11:34:08,777 INFO L290 TraceCheckUtils]: 8: Hoare triple {28249#true} assume !(0 == ~cond); {28249#true} is VALID [2022-04-08 11:34:08,777 INFO L290 TraceCheckUtils]: 7: Hoare triple {28249#true} ~cond := #in~cond; {28249#true} is VALID [2022-04-08 11:34:08,777 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:34:08,777 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:34:08,777 INFO L272 TraceCheckUtils]: 4: Hoare triple {28249#true} call #t~ret8 := main(); {28249#true} is VALID [2022-04-08 11:34:08,777 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28249#true} {28249#true} #93#return; {28249#true} is VALID [2022-04-08 11:34:08,777 INFO L290 TraceCheckUtils]: 2: Hoare triple {28249#true} assume true; {28249#true} is VALID [2022-04-08 11:34:08,777 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:34:08,777 INFO L272 TraceCheckUtils]: 0: Hoare triple {28249#true} call ULTIMATE.init(); {28249#true} is VALID [2022-04-08 11:34:08,778 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:08,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:34:08,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483156818] [2022-04-08 11:34:08,778 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:34:08,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1939498969] [2022-04-08 11:34:08,778 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1939498969] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 11:34:08,778 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 11:34:08,778 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 8] total 20 [2022-04-08 11:34:08,779 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:34:08,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1317352868] [2022-04-08 11:34:08,779 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1317352868] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:34:08,779 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:34:08,779 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-08 11:34:08,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571854760] [2022-04-08 11:34:08,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:34:08,780 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:34:08,780 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:34:08,780 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:34:09,003 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:34:09,004 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-08 11:34:09,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:34:09,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-08 11:34:09,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2022-04-08 11:34:09,004 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:34:26,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:34:26,148 INFO L93 Difference]: Finished difference Result 378 states and 441 transitions. [2022-04-08 11:34:26,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-08 11:34:26,148 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:34:26,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:34:26,149 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:34:26,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 178 transitions. [2022-04-08 11:34:26,166 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:34:26,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 178 transitions. [2022-04-08 11:34:26,169 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 178 transitions. [2022-04-08 11:34:26,566 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:34:26,577 INFO L225 Difference]: With dead ends: 378 [2022-04-08 11:34:26,577 INFO L226 Difference]: Without dead ends: 375 [2022-04-08 11:34:26,578 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:34:26,578 INFO L913 BasicCegarLoop]: 72 mSDtfsCounter, 49 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 1338 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s 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, 6.2s IncrementalHoareTripleChecker+Time [2022-04-08 11:34:26,578 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [67 Valid, 525 Invalid, 1380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 1338 Invalid, 0 Unknown, 0 Unchecked, 6.2s Time] [2022-04-08 11:34:26,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2022-04-08 11:34:27,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 345. [2022-04-08 11:34:27,214 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:34:27,215 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:34:27,215 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:34:27,216 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:34:27,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:34:27,225 INFO L93 Difference]: Finished difference Result 375 states and 437 transitions. [2022-04-08 11:34:27,225 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 437 transitions. [2022-04-08 11:34:27,226 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:34:27,226 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:34:27,226 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:34:27,227 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:34:27,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:34:27,236 INFO L93 Difference]: Finished difference Result 375 states and 437 transitions. [2022-04-08 11:34:27,236 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 437 transitions. [2022-04-08 11:34:27,237 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:34:27,237 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:34:27,237 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:34:27,237 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:34:27,238 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:34:27,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 395 transitions. [2022-04-08 11:34:27,248 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 395 transitions. Word has length 159 [2022-04-08 11:34:27,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:34:27,248 INFO L478 AbstractCegarLoop]: Abstraction has 345 states and 395 transitions. [2022-04-08 11:34:27,248 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:34:27,248 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 345 states and 395 transitions. [2022-04-08 11:34:28,142 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:34:28,142 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 395 transitions. [2022-04-08 11:34:28,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2022-04-08 11:34:28,145 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:34:28,146 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:34:28,175 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:34:28,371 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:34:28,371 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:34:28,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:34:28,372 INFO L85 PathProgramCache]: Analyzing trace with hash -107439859, now seen corresponding path program 5 times [2022-04-08 11:34:28,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:34:28,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1644177191] [2022-04-08 11:35:10,158 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 11:35:10,159 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 11:35:10,159 INFO L85 PathProgramCache]: Analyzing trace with hash -107439859, now seen corresponding path program 6 times [2022-04-08 11:35:10,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:35:10,159 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328748851] [2022-04-08 11:35:10,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:35:10,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:35:10,176 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:35:10,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [630764478] [2022-04-08 11:35:10,176 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 11:35:10,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:35:10,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:35:10,180 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:35:10,184 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:35:10,288 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-08 11:35:10,289 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:35:10,290 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 34 conjunts are in the unsatisfiable core [2022-04-08 11:35:10,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:35:10,337 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:35:11,199 INFO L272 TraceCheckUtils]: 0: Hoare triple {31424#true} call ULTIMATE.init(); {31424#true} is VALID [2022-04-08 11:35:11,199 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:35:11,199 INFO L290 TraceCheckUtils]: 2: Hoare triple {31424#true} assume true; {31424#true} is VALID [2022-04-08 11:35:11,199 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31424#true} {31424#true} #93#return; {31424#true} is VALID [2022-04-08 11:35:11,199 INFO L272 TraceCheckUtils]: 4: Hoare triple {31424#true} call #t~ret8 := main(); {31424#true} is VALID [2022-04-08 11:35:11,199 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:35:11,199 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:35:11,199 INFO L290 TraceCheckUtils]: 7: Hoare triple {31424#true} ~cond := #in~cond; {31424#true} is VALID [2022-04-08 11:35:11,200 INFO L290 TraceCheckUtils]: 8: Hoare triple {31424#true} assume !(0 == ~cond); {31424#true} is VALID [2022-04-08 11:35:11,200 INFO L290 TraceCheckUtils]: 9: Hoare triple {31424#true} assume true; {31424#true} is VALID [2022-04-08 11:35:11,200 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {31424#true} {31424#true} #77#return; {31424#true} is VALID [2022-04-08 11:35:11,200 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:35:11,201 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:35:11,201 INFO L290 TraceCheckUtils]: 13: Hoare triple {31462#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} assume !!(#t~post6 < 20);havoc #t~post6; {31462#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 11:35:11,201 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:35:11,201 INFO L290 TraceCheckUtils]: 15: Hoare triple {31424#true} ~cond := #in~cond; {31424#true} is VALID [2022-04-08 11:35:11,201 INFO L290 TraceCheckUtils]: 16: Hoare triple {31424#true} assume !(0 == ~cond); {31424#true} is VALID [2022-04-08 11:35:11,201 INFO L290 TraceCheckUtils]: 17: Hoare triple {31424#true} assume true; {31424#true} is VALID [2022-04-08 11:35:11,202 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:35:11,202 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:35:11,202 INFO L290 TraceCheckUtils]: 20: Hoare triple {31424#true} ~cond := #in~cond; {31424#true} is VALID [2022-04-08 11:35:11,202 INFO L290 TraceCheckUtils]: 21: Hoare triple {31424#true} assume !(0 == ~cond); {31424#true} is VALID [2022-04-08 11:35:11,202 INFO L290 TraceCheckUtils]: 22: Hoare triple {31424#true} assume true; {31424#true} is VALID [2022-04-08 11:35:11,203 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:35:11,203 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:35:11,204 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:35:11,204 INFO L290 TraceCheckUtils]: 26: Hoare triple {31462#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} assume !!(#t~post7 < 20);havoc #t~post7; {31462#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 11:35:11,204 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:35:11,204 INFO L290 TraceCheckUtils]: 28: Hoare triple {31424#true} ~cond := #in~cond; {31424#true} is VALID [2022-04-08 11:35:11,204 INFO L290 TraceCheckUtils]: 29: Hoare triple {31424#true} assume !(0 == ~cond); {31424#true} is VALID [2022-04-08 11:35:11,204 INFO L290 TraceCheckUtils]: 30: Hoare triple {31424#true} assume true; {31424#true} is VALID [2022-04-08 11:35:11,205 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:35:11,205 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:35:11,205 INFO L290 TraceCheckUtils]: 33: Hoare triple {31424#true} ~cond := #in~cond; {31424#true} is VALID [2022-04-08 11:35:11,205 INFO L290 TraceCheckUtils]: 34: Hoare triple {31424#true} assume !(0 == ~cond); {31424#true} is VALID [2022-04-08 11:35:11,205 INFO L290 TraceCheckUtils]: 35: Hoare triple {31424#true} assume true; {31424#true} is VALID [2022-04-08 11:35:11,206 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:35:11,206 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:35:11,206 INFO L290 TraceCheckUtils]: 38: Hoare triple {31424#true} ~cond := #in~cond; {31424#true} is VALID [2022-04-08 11:35:11,206 INFO L290 TraceCheckUtils]: 39: Hoare triple {31424#true} assume !(0 == ~cond); {31424#true} is VALID [2022-04-08 11:35:11,206 INFO L290 TraceCheckUtils]: 40: Hoare triple {31424#true} assume true; {31424#true} is VALID [2022-04-08 11:35:11,207 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:35:11,207 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:35:11,207 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:35:11,208 INFO L290 TraceCheckUtils]: 44: Hoare triple {31424#true} ~cond := #in~cond; {31424#true} is VALID [2022-04-08 11:35:11,208 INFO L290 TraceCheckUtils]: 45: Hoare triple {31424#true} assume !(0 == ~cond); {31424#true} is VALID [2022-04-08 11:35:11,208 INFO L290 TraceCheckUtils]: 46: Hoare triple {31424#true} assume true; {31424#true} is VALID [2022-04-08 11:35:11,208 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:35:11,209 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:35:11,209 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:35:11,209 INFO L290 TraceCheckUtils]: 50: Hoare triple {31462#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} assume !!(#t~post7 < 20);havoc #t~post7; {31462#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 11:35:11,210 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:35:11,210 INFO L290 TraceCheckUtils]: 52: Hoare triple {31424#true} ~cond := #in~cond; {31424#true} is VALID [2022-04-08 11:35:11,210 INFO L290 TraceCheckUtils]: 53: Hoare triple {31424#true} assume !(0 == ~cond); {31424#true} is VALID [2022-04-08 11:35:11,210 INFO L290 TraceCheckUtils]: 54: Hoare triple {31424#true} assume true; {31424#true} is VALID [2022-04-08 11:35:11,211 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:35:11,211 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:35:11,211 INFO L290 TraceCheckUtils]: 57: Hoare triple {31424#true} ~cond := #in~cond; {31424#true} is VALID [2022-04-08 11:35:11,211 INFO L290 TraceCheckUtils]: 58: Hoare triple {31424#true} assume !(0 == ~cond); {31424#true} is VALID [2022-04-08 11:35:11,211 INFO L290 TraceCheckUtils]: 59: Hoare triple {31424#true} assume true; {31424#true} is VALID [2022-04-08 11:35:11,211 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:35:11,212 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:35:11,212 INFO L290 TraceCheckUtils]: 62: Hoare triple {31424#true} ~cond := #in~cond; {31424#true} is VALID [2022-04-08 11:35:11,212 INFO L290 TraceCheckUtils]: 63: Hoare triple {31424#true} assume !(0 == ~cond); {31424#true} is VALID [2022-04-08 11:35:11,212 INFO L290 TraceCheckUtils]: 64: Hoare triple {31424#true} assume true; {31424#true} is VALID [2022-04-08 11:35:11,212 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:35:11,213 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:35:11,213 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:35:11,213 INFO L290 TraceCheckUtils]: 68: Hoare triple {31424#true} ~cond := #in~cond; {31424#true} is VALID [2022-04-08 11:35:11,213 INFO L290 TraceCheckUtils]: 69: Hoare triple {31424#true} assume !(0 == ~cond); {31424#true} is VALID [2022-04-08 11:35:11,213 INFO L290 TraceCheckUtils]: 70: Hoare triple {31424#true} assume true; {31424#true} is VALID [2022-04-08 11:35:11,214 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:35:11,214 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:35:11,215 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:35:11,215 INFO L290 TraceCheckUtils]: 74: Hoare triple {31462#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} assume !!(#t~post7 < 20);havoc #t~post7; {31462#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 11:35:11,215 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:35:11,215 INFO L290 TraceCheckUtils]: 76: Hoare triple {31424#true} ~cond := #in~cond; {31424#true} is VALID [2022-04-08 11:35:11,215 INFO L290 TraceCheckUtils]: 77: Hoare triple {31424#true} assume !(0 == ~cond); {31424#true} is VALID [2022-04-08 11:35:11,215 INFO L290 TraceCheckUtils]: 78: Hoare triple {31424#true} assume true; {31424#true} is VALID [2022-04-08 11:35:11,216 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:35:11,216 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:35:11,216 INFO L290 TraceCheckUtils]: 81: Hoare triple {31424#true} ~cond := #in~cond; {31424#true} is VALID [2022-04-08 11:35:11,216 INFO L290 TraceCheckUtils]: 82: Hoare triple {31424#true} assume !(0 == ~cond); {31424#true} is VALID [2022-04-08 11:35:11,216 INFO L290 TraceCheckUtils]: 83: Hoare triple {31424#true} assume true; {31424#true} is VALID [2022-04-08 11:35:11,217 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:35:11,217 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:35:11,217 INFO L290 TraceCheckUtils]: 86: Hoare triple {31424#true} ~cond := #in~cond; {31424#true} is VALID [2022-04-08 11:35:11,217 INFO L290 TraceCheckUtils]: 87: Hoare triple {31424#true} assume !(0 == ~cond); {31424#true} is VALID [2022-04-08 11:35:11,217 INFO L290 TraceCheckUtils]: 88: Hoare triple {31424#true} assume true; {31424#true} is VALID [2022-04-08 11:35:11,218 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:35:11,218 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:35:11,218 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:35:11,218 INFO L290 TraceCheckUtils]: 92: Hoare triple {31424#true} ~cond := #in~cond; {31424#true} is VALID [2022-04-08 11:35:11,218 INFO L290 TraceCheckUtils]: 93: Hoare triple {31424#true} assume !(0 == ~cond); {31424#true} is VALID [2022-04-08 11:35:11,218 INFO L290 TraceCheckUtils]: 94: Hoare triple {31424#true} assume true; {31424#true} is VALID [2022-04-08 11:35:11,219 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:35:11,220 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:35:11,220 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:35:11,220 INFO L290 TraceCheckUtils]: 98: Hoare triple {31462#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} assume !!(#t~post7 < 20);havoc #t~post7; {31462#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 11:35:11,220 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:35:11,221 INFO L290 TraceCheckUtils]: 100: Hoare triple {31424#true} ~cond := #in~cond; {31424#true} is VALID [2022-04-08 11:35:11,221 INFO L290 TraceCheckUtils]: 101: Hoare triple {31424#true} assume !(0 == ~cond); {31424#true} is VALID [2022-04-08 11:35:11,221 INFO L290 TraceCheckUtils]: 102: Hoare triple {31424#true} assume true; {31424#true} is VALID [2022-04-08 11:35:11,221 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:35:11,221 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:35:11,222 INFO L290 TraceCheckUtils]: 105: Hoare triple {31424#true} ~cond := #in~cond; {31424#true} is VALID [2022-04-08 11:35:11,222 INFO L290 TraceCheckUtils]: 106: Hoare triple {31424#true} assume !(0 == ~cond); {31424#true} is VALID [2022-04-08 11:35:11,222 INFO L290 TraceCheckUtils]: 107: Hoare triple {31424#true} assume true; {31424#true} is VALID [2022-04-08 11:35:11,222 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:35:11,222 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:35:11,222 INFO L290 TraceCheckUtils]: 110: Hoare triple {31424#true} ~cond := #in~cond; {31424#true} is VALID [2022-04-08 11:35:11,223 INFO L290 TraceCheckUtils]: 111: Hoare triple {31424#true} assume !(0 == ~cond); {31424#true} is VALID [2022-04-08 11:35:11,223 INFO L290 TraceCheckUtils]: 112: Hoare triple {31424#true} assume true; {31424#true} is VALID [2022-04-08 11:35:11,223 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:35:11,224 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:35:11,225 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:35:11,225 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:35:11,226 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 < 20);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:35:11,226 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:35:11,226 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:35:11,227 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:35:11,227 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:35:11,228 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:35:11,229 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:35:11,229 INFO L290 TraceCheckUtils]: 124: Hoare triple {31424#true} ~cond := #in~cond; {31424#true} is VALID [2022-04-08 11:35:11,229 INFO L290 TraceCheckUtils]: 125: Hoare triple {31424#true} assume !(0 == ~cond); {31424#true} is VALID [2022-04-08 11:35:11,229 INFO L290 TraceCheckUtils]: 126: Hoare triple {31424#true} assume true; {31424#true} is VALID [2022-04-08 11:35:11,229 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:35:11,230 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:35:11,230 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:35:11,231 INFO L290 TraceCheckUtils]: 130: Hoare triple {31799#(= (+ main_~x~0 (* (- 1) main_~r~0)) (* main_~q~0 main_~y~0))} assume !!(#t~post7 < 20);havoc #t~post7; {31799#(= (+ main_~x~0 (* (- 1) main_~r~0)) (* main_~q~0 main_~y~0))} is VALID [2022-04-08 11:35:11,231 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:35:11,231 INFO L290 TraceCheckUtils]: 132: Hoare triple {31424#true} ~cond := #in~cond; {31424#true} is VALID [2022-04-08 11:35:11,231 INFO L290 TraceCheckUtils]: 133: Hoare triple {31424#true} assume !(0 == ~cond); {31424#true} is VALID [2022-04-08 11:35:11,231 INFO L290 TraceCheckUtils]: 134: Hoare triple {31424#true} assume true; {31424#true} is VALID [2022-04-08 11:35:11,232 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:35:11,232 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:35:11,232 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:35:11,233 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:35:11,233 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:35:11,233 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:35:11,234 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:35:11,234 INFO L290 TraceCheckUtils]: 142: Hoare triple {31424#true} ~cond := #in~cond; {31424#true} is VALID [2022-04-08 11:35:11,234 INFO L290 TraceCheckUtils]: 143: Hoare triple {31424#true} assume !(0 == ~cond); {31424#true} is VALID [2022-04-08 11:35:11,234 INFO L290 TraceCheckUtils]: 144: Hoare triple {31424#true} assume true; {31424#true} is VALID [2022-04-08 11:35:11,234 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:35:11,235 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:35:11,244 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:35:11,245 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:35:11,245 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 < 20);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:35:11,245 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:35:11,246 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:35:11,246 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:35:11,247 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:35:11,249 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:35:11,250 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:35:11,250 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:35:11,251 INFO L290 TraceCheckUtils]: 157: Hoare triple {31904#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {31425#false} is VALID [2022-04-08 11:35:11,251 INFO L290 TraceCheckUtils]: 158: Hoare triple {31425#false} assume !false; {31425#false} is VALID [2022-04-08 11:35:11,251 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:35:11,251 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 11:35:26,936 INFO L290 TraceCheckUtils]: 158: Hoare triple {31425#false} assume !false; {31425#false} is VALID [2022-04-08 11:35:26,936 INFO L290 TraceCheckUtils]: 157: Hoare triple {31904#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {31425#false} is VALID [2022-04-08 11:35:26,937 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:35:26,937 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:35:26,938 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:35:26,938 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:35:26,939 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:35:26,939 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:35:26,939 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:35:26,940 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 < 20);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:35:26,940 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:35:26,948 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:35:26,948 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:35:26,949 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:35:26,949 INFO L290 TraceCheckUtils]: 144: Hoare triple {31424#true} assume true; {31424#true} is VALID [2022-04-08 11:35:26,949 INFO L290 TraceCheckUtils]: 143: Hoare triple {31424#true} assume !(0 == ~cond); {31424#true} is VALID [2022-04-08 11:35:26,949 INFO L290 TraceCheckUtils]: 142: Hoare triple {31424#true} ~cond := #in~cond; {31424#true} is VALID [2022-04-08 11:35:26,949 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:35:26,950 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:35:26,950 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:35:26,950 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:35:26,950 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:35:26,950 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:35:26,951 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {31424#true} {31424#true} #83#return; {31424#true} is VALID [2022-04-08 11:35:26,951 INFO L290 TraceCheckUtils]: 134: Hoare triple {31424#true} assume true; {31424#true} is VALID [2022-04-08 11:35:26,951 INFO L290 TraceCheckUtils]: 133: Hoare triple {31424#true} assume !(0 == ~cond); {31424#true} is VALID [2022-04-08 11:35:26,951 INFO L290 TraceCheckUtils]: 132: Hoare triple {31424#true} ~cond := #in~cond; {31424#true} is VALID [2022-04-08 11:35:26,951 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:35:26,951 INFO L290 TraceCheckUtils]: 130: Hoare triple {31424#true} assume !!(#t~post7 < 20);havoc #t~post7; {31424#true} is VALID [2022-04-08 11:35:26,951 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:35:26,951 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:35:26,951 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {31424#true} {31424#true} #81#return; {31424#true} is VALID [2022-04-08 11:35:26,951 INFO L290 TraceCheckUtils]: 126: Hoare triple {31424#true} assume true; {31424#true} is VALID [2022-04-08 11:35:26,951 INFO L290 TraceCheckUtils]: 125: Hoare triple {31424#true} assume !(0 == ~cond); {31424#true} is VALID [2022-04-08 11:35:26,951 INFO L290 TraceCheckUtils]: 124: Hoare triple {31424#true} ~cond := #in~cond; {31424#true} is VALID [2022-04-08 11:35:26,951 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:35:26,951 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {31424#true} {31424#true} #79#return; {31424#true} is VALID [2022-04-08 11:35:26,951 INFO L290 TraceCheckUtils]: 121: Hoare triple {31424#true} assume true; {31424#true} is VALID [2022-04-08 11:35:26,951 INFO L290 TraceCheckUtils]: 120: Hoare triple {31424#true} assume !(0 == ~cond); {31424#true} is VALID [2022-04-08 11:35:26,951 INFO L290 TraceCheckUtils]: 119: Hoare triple {31424#true} ~cond := #in~cond; {31424#true} is VALID [2022-04-08 11:35:26,952 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:35:26,952 INFO L290 TraceCheckUtils]: 117: Hoare triple {31424#true} assume !!(#t~post6 < 20);havoc #t~post6; {31424#true} is VALID [2022-04-08 11:35:26,952 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:35:26,952 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:35:26,952 INFO L290 TraceCheckUtils]: 114: Hoare triple {31424#true} assume !(~r~0 >= 2 * ~b~0); {31424#true} is VALID [2022-04-08 11:35:26,952 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {31424#true} {31424#true} #87#return; {31424#true} is VALID [2022-04-08 11:35:26,952 INFO L290 TraceCheckUtils]: 112: Hoare triple {31424#true} assume true; {31424#true} is VALID [2022-04-08 11:35:26,952 INFO L290 TraceCheckUtils]: 111: Hoare triple {31424#true} assume !(0 == ~cond); {31424#true} is VALID [2022-04-08 11:35:26,952 INFO L290 TraceCheckUtils]: 110: Hoare triple {31424#true} ~cond := #in~cond; {31424#true} is VALID [2022-04-08 11:35:26,952 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:35:26,952 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {31424#true} {31424#true} #85#return; {31424#true} is VALID [2022-04-08 11:35:26,952 INFO L290 TraceCheckUtils]: 107: Hoare triple {31424#true} assume true; {31424#true} is VALID [2022-04-08 11:35:26,952 INFO L290 TraceCheckUtils]: 106: Hoare triple {31424#true} assume !(0 == ~cond); {31424#true} is VALID [2022-04-08 11:35:26,953 INFO L290 TraceCheckUtils]: 105: Hoare triple {31424#true} ~cond := #in~cond; {31424#true} is VALID [2022-04-08 11:35:26,953 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:35:26,953 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {31424#true} {31424#true} #83#return; {31424#true} is VALID [2022-04-08 11:35:26,953 INFO L290 TraceCheckUtils]: 102: Hoare triple {31424#true} assume true; {31424#true} is VALID [2022-04-08 11:35:26,953 INFO L290 TraceCheckUtils]: 101: Hoare triple {31424#true} assume !(0 == ~cond); {31424#true} is VALID [2022-04-08 11:35:26,953 INFO L290 TraceCheckUtils]: 100: Hoare triple {31424#true} ~cond := #in~cond; {31424#true} is VALID [2022-04-08 11:35:26,953 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:35:26,953 INFO L290 TraceCheckUtils]: 98: Hoare triple {31424#true} assume !!(#t~post7 < 20);havoc #t~post7; {31424#true} is VALID [2022-04-08 11:35:26,953 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:35:26,967 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:35:26,967 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {31424#true} {31424#true} #89#return; {31424#true} is VALID [2022-04-08 11:35:26,967 INFO L290 TraceCheckUtils]: 94: Hoare triple {31424#true} assume true; {31424#true} is VALID [2022-04-08 11:35:26,967 INFO L290 TraceCheckUtils]: 93: Hoare triple {31424#true} assume !(0 == ~cond); {31424#true} is VALID [2022-04-08 11:35:26,968 INFO L290 TraceCheckUtils]: 92: Hoare triple {31424#true} ~cond := #in~cond; {31424#true} is VALID [2022-04-08 11:35:26,968 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:35:26,968 INFO L290 TraceCheckUtils]: 90: Hoare triple {31424#true} assume !!(~r~0 >= 2 * ~b~0); {31424#true} is VALID [2022-04-08 11:35:26,968 INFO L284 TraceCheckUtils]: 89: Hoare quadruple {31424#true} {31424#true} #87#return; {31424#true} is VALID [2022-04-08 11:35:26,968 INFO L290 TraceCheckUtils]: 88: Hoare triple {31424#true} assume true; {31424#true} is VALID [2022-04-08 11:35:26,968 INFO L290 TraceCheckUtils]: 87: Hoare triple {31424#true} assume !(0 == ~cond); {31424#true} is VALID [2022-04-08 11:35:26,968 INFO L290 TraceCheckUtils]: 86: Hoare triple {31424#true} ~cond := #in~cond; {31424#true} is VALID [2022-04-08 11:35:26,968 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:35:26,968 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {31424#true} {31424#true} #85#return; {31424#true} is VALID [2022-04-08 11:35:26,968 INFO L290 TraceCheckUtils]: 83: Hoare triple {31424#true} assume true; {31424#true} is VALID [2022-04-08 11:35:26,968 INFO L290 TraceCheckUtils]: 82: Hoare triple {31424#true} assume !(0 == ~cond); {31424#true} is VALID [2022-04-08 11:35:26,968 INFO L290 TraceCheckUtils]: 81: Hoare triple {31424#true} ~cond := #in~cond; {31424#true} is VALID [2022-04-08 11:35:26,968 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:35:26,969 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {31424#true} {31424#true} #83#return; {31424#true} is VALID [2022-04-08 11:35:26,969 INFO L290 TraceCheckUtils]: 78: Hoare triple {31424#true} assume true; {31424#true} is VALID [2022-04-08 11:35:26,969 INFO L290 TraceCheckUtils]: 77: Hoare triple {31424#true} assume !(0 == ~cond); {31424#true} is VALID [2022-04-08 11:35:26,969 INFO L290 TraceCheckUtils]: 76: Hoare triple {31424#true} ~cond := #in~cond; {31424#true} is VALID [2022-04-08 11:35:26,969 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:35:26,969 INFO L290 TraceCheckUtils]: 74: Hoare triple {31424#true} assume !!(#t~post7 < 20);havoc #t~post7; {31424#true} is VALID [2022-04-08 11:35:26,969 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:35:26,969 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:35:26,969 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {31424#true} {31424#true} #89#return; {31424#true} is VALID [2022-04-08 11:35:26,969 INFO L290 TraceCheckUtils]: 70: Hoare triple {31424#true} assume true; {31424#true} is VALID [2022-04-08 11:35:26,969 INFO L290 TraceCheckUtils]: 69: Hoare triple {31424#true} assume !(0 == ~cond); {31424#true} is VALID [2022-04-08 11:35:26,969 INFO L290 TraceCheckUtils]: 68: Hoare triple {31424#true} ~cond := #in~cond; {31424#true} is VALID [2022-04-08 11:35:26,970 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:35:26,970 INFO L290 TraceCheckUtils]: 66: Hoare triple {31424#true} assume !!(~r~0 >= 2 * ~b~0); {31424#true} is VALID [2022-04-08 11:35:26,970 INFO L284 TraceCheckUtils]: 65: Hoare quadruple {31424#true} {31424#true} #87#return; {31424#true} is VALID [2022-04-08 11:35:26,970 INFO L290 TraceCheckUtils]: 64: Hoare triple {31424#true} assume true; {31424#true} is VALID [2022-04-08 11:35:26,970 INFO L290 TraceCheckUtils]: 63: Hoare triple {31424#true} assume !(0 == ~cond); {31424#true} is VALID [2022-04-08 11:35:26,970 INFO L290 TraceCheckUtils]: 62: Hoare triple {31424#true} ~cond := #in~cond; {31424#true} is VALID [2022-04-08 11:35:26,970 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:35:26,970 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {31424#true} {31424#true} #85#return; {31424#true} is VALID [2022-04-08 11:35:26,970 INFO L290 TraceCheckUtils]: 59: Hoare triple {31424#true} assume true; {31424#true} is VALID [2022-04-08 11:35:26,970 INFO L290 TraceCheckUtils]: 58: Hoare triple {31424#true} assume !(0 == ~cond); {31424#true} is VALID [2022-04-08 11:35:26,970 INFO L290 TraceCheckUtils]: 57: Hoare triple {31424#true} ~cond := #in~cond; {31424#true} is VALID [2022-04-08 11:35:26,970 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:35:26,970 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {31424#true} {31424#true} #83#return; {31424#true} is VALID [2022-04-08 11:35:26,971 INFO L290 TraceCheckUtils]: 54: Hoare triple {31424#true} assume true; {31424#true} is VALID [2022-04-08 11:35:26,971 INFO L290 TraceCheckUtils]: 53: Hoare triple {31424#true} assume !(0 == ~cond); {31424#true} is VALID [2022-04-08 11:35:26,971 INFO L290 TraceCheckUtils]: 52: Hoare triple {31424#true} ~cond := #in~cond; {31424#true} is VALID [2022-04-08 11:35:26,971 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:35:26,971 INFO L290 TraceCheckUtils]: 50: Hoare triple {31424#true} assume !!(#t~post7 < 20);havoc #t~post7; {31424#true} is VALID [2022-04-08 11:35:26,971 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:35:26,971 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:35:26,971 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {31424#true} {31424#true} #89#return; {31424#true} is VALID [2022-04-08 11:35:26,971 INFO L290 TraceCheckUtils]: 46: Hoare triple {31424#true} assume true; {31424#true} is VALID [2022-04-08 11:35:26,971 INFO L290 TraceCheckUtils]: 45: Hoare triple {31424#true} assume !(0 == ~cond); {31424#true} is VALID [2022-04-08 11:35:26,971 INFO L290 TraceCheckUtils]: 44: Hoare triple {31424#true} ~cond := #in~cond; {31424#true} is VALID [2022-04-08 11:35:26,972 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:35:26,972 INFO L290 TraceCheckUtils]: 42: Hoare triple {31424#true} assume !!(~r~0 >= 2 * ~b~0); {31424#true} is VALID [2022-04-08 11:35:26,972 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {31424#true} {31424#true} #87#return; {31424#true} is VALID [2022-04-08 11:35:26,972 INFO L290 TraceCheckUtils]: 40: Hoare triple {31424#true} assume true; {31424#true} is VALID [2022-04-08 11:35:26,972 INFO L290 TraceCheckUtils]: 39: Hoare triple {31424#true} assume !(0 == ~cond); {31424#true} is VALID [2022-04-08 11:35:26,972 INFO L290 TraceCheckUtils]: 38: Hoare triple {31424#true} ~cond := #in~cond; {31424#true} is VALID [2022-04-08 11:35:26,972 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:35:26,972 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {31424#true} {31424#true} #85#return; {31424#true} is VALID [2022-04-08 11:35:26,972 INFO L290 TraceCheckUtils]: 35: Hoare triple {31424#true} assume true; {31424#true} is VALID [2022-04-08 11:35:26,972 INFO L290 TraceCheckUtils]: 34: Hoare triple {31424#true} assume !(0 == ~cond); {31424#true} is VALID [2022-04-08 11:35:26,972 INFO L290 TraceCheckUtils]: 33: Hoare triple {31424#true} ~cond := #in~cond; {31424#true} is VALID [2022-04-08 11:35:26,972 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:35:26,972 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {31424#true} {31424#true} #83#return; {31424#true} is VALID [2022-04-08 11:35:26,973 INFO L290 TraceCheckUtils]: 30: Hoare triple {31424#true} assume true; {31424#true} is VALID [2022-04-08 11:35:26,973 INFO L290 TraceCheckUtils]: 29: Hoare triple {31424#true} assume !(0 == ~cond); {31424#true} is VALID [2022-04-08 11:35:26,973 INFO L290 TraceCheckUtils]: 28: Hoare triple {31424#true} ~cond := #in~cond; {31424#true} is VALID [2022-04-08 11:35:26,973 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:35:26,973 INFO L290 TraceCheckUtils]: 26: Hoare triple {31424#true} assume !!(#t~post7 < 20);havoc #t~post7; {31424#true} is VALID [2022-04-08 11:35:26,973 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:35:26,973 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:35:26,973 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {31424#true} {31424#true} #81#return; {31424#true} is VALID [2022-04-08 11:35:26,973 INFO L290 TraceCheckUtils]: 22: Hoare triple {31424#true} assume true; {31424#true} is VALID [2022-04-08 11:35:26,973 INFO L290 TraceCheckUtils]: 21: Hoare triple {31424#true} assume !(0 == ~cond); {31424#true} is VALID [2022-04-08 11:35:26,973 INFO L290 TraceCheckUtils]: 20: Hoare triple {31424#true} ~cond := #in~cond; {31424#true} is VALID [2022-04-08 11:35:26,973 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:35:26,974 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {31424#true} {31424#true} #79#return; {31424#true} is VALID [2022-04-08 11:35:26,974 INFO L290 TraceCheckUtils]: 17: Hoare triple {31424#true} assume true; {31424#true} is VALID [2022-04-08 11:35:26,974 INFO L290 TraceCheckUtils]: 16: Hoare triple {31424#true} assume !(0 == ~cond); {31424#true} is VALID [2022-04-08 11:35:26,974 INFO L290 TraceCheckUtils]: 15: Hoare triple {31424#true} ~cond := #in~cond; {31424#true} is VALID [2022-04-08 11:35:26,974 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:35:26,974 INFO L290 TraceCheckUtils]: 13: Hoare triple {31424#true} assume !!(#t~post6 < 20);havoc #t~post6; {31424#true} is VALID [2022-04-08 11:35:26,974 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:35:26,974 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:35:26,974 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {31424#true} {31424#true} #77#return; {31424#true} is VALID [2022-04-08 11:35:26,974 INFO L290 TraceCheckUtils]: 9: Hoare triple {31424#true} assume true; {31424#true} is VALID [2022-04-08 11:35:26,974 INFO L290 TraceCheckUtils]: 8: Hoare triple {31424#true} assume !(0 == ~cond); {31424#true} is VALID [2022-04-08 11:35:26,974 INFO L290 TraceCheckUtils]: 7: Hoare triple {31424#true} ~cond := #in~cond; {31424#true} is VALID [2022-04-08 11:35:26,975 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:35:26,975 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:35:26,975 INFO L272 TraceCheckUtils]: 4: Hoare triple {31424#true} call #t~ret8 := main(); {31424#true} is VALID [2022-04-08 11:35:26,975 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31424#true} {31424#true} #93#return; {31424#true} is VALID [2022-04-08 11:35:26,975 INFO L290 TraceCheckUtils]: 2: Hoare triple {31424#true} assume true; {31424#true} is VALID [2022-04-08 11:35:26,975 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:35:26,975 INFO L272 TraceCheckUtils]: 0: Hoare triple {31424#true} call ULTIMATE.init(); {31424#true} is VALID [2022-04-08 11:35:26,976 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:35:26,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:35:26,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328748851] [2022-04-08 11:35:26,976 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:35:26,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [630764478] [2022-04-08 11:35:26,976 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [630764478] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 11:35:26,976 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 11:35:26,976 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 12 [2022-04-08 11:35:26,977 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:35:26,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1644177191] [2022-04-08 11:35:26,977 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1644177191] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:35:26,977 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:35:26,977 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-08 11:35:26,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146072493] [2022-04-08 11:35:26,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:35:26,977 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:35:26,978 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:35:26,978 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:35:27,077 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:35:27,077 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-08 11:35:27,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:35:27,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-08 11:35:27,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-04-08 11:35:27,078 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:35:29,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:35:29,319 INFO L93 Difference]: Finished difference Result 363 states and 412 transitions. [2022-04-08 11:35:29,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-08 11:35:29,320 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:35:29,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:35:29,320 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:35:29,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 73 transitions. [2022-04-08 11:35:29,321 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:35:29,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 73 transitions. [2022-04-08 11:35:29,323 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 73 transitions. [2022-04-08 11:35:29,450 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:35:29,450 INFO L225 Difference]: With dead ends: 363 [2022-04-08 11:35:29,450 INFO L226 Difference]: Without dead ends: 0 [2022-04-08 11:35:29,451 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 302 SyntacticMatches, 5 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=73, Invalid=233, Unknown=0, NotChecked=0, Total=306 [2022-04-08 11:35:29,452 INFO L913 BasicCegarLoop]: 26 mSDtfsCounter, 32 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s 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.6s IncrementalHoareTripleChecker+Time [2022-04-08 11:35:29,452 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.6s Time] [2022-04-08 11:35:29,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-08 11:35:29,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-08 11:35:29,452 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:35:29,452 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:35:29,452 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:35:29,452 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:35:29,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:35:29,453 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-08 11:35:29,453 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 11:35:29,453 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:35:29,453 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:35:29,453 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:35:29,453 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:35:29,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:35:29,453 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-08 11:35:29,453 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 11:35:29,453 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:35:29,453 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:35:29,453 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:35:29,453 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:35:29,453 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:35:29,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-08 11:35:29,453 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 159 [2022-04-08 11:35:29,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:35:29,453 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-08 11:35:29,454 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:35:29,454 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-08 11:35:29,454 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:35:29,454 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 11:35:29,454 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:35:29,457 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-08 11:35:29,483 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2022-04-08 11:35:29,672 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:35:29,674 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.