/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_unwindbound10.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 11:19:53,346 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 11:19:53,348 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 11:19:53,364 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 11:19:53,365 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 11:19:53,365 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 11:19:53,366 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 11:19:53,367 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 11:19:53,368 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 11:19:53,368 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 11:19:53,369 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 11:19:53,370 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 11:19:53,370 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 11:19:53,370 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 11:19:53,371 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 11:19:53,372 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 11:19:53,372 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 11:19:53,373 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 11:19:53,374 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 11:19:53,375 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 11:19:53,376 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 11:19:53,376 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 11:19:53,377 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 11:19:53,378 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 11:19:53,378 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 11:19:53,380 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 11:19:53,380 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 11:19:53,380 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 11:19:53,381 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 11:19:53,381 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 11:19:53,382 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 11:19:53,382 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 11:19:53,382 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 11:19:53,383 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 11:19:53,383 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 11:19:53,384 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 11:19:53,384 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 11:19:53,384 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 11:19:53,384 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 11:19:53,384 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 11:19:53,385 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 11:19:53,385 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 11:19:53,386 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-28 11:19:53,391 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 11:19:53,391 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 11:19:53,392 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 11:19:53,392 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 11:19:53,392 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 11:19:53,392 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 11:19:53,392 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 11:19:53,392 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 11:19:53,392 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 11:19:53,393 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 11:19:53,393 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 11:19:53,393 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 11:19:53,393 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 11:19:53,393 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 11:19:53,393 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 11:19:53,393 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 11:19:53,393 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 11:19:53,393 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 11:19:53,394 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 11:19:53,394 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 11:19:53,394 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 11:19:53,394 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-28 11:19:53,394 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-28 11:19:53,529 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 11:19:53,548 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 11:19:53,549 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 11:19:53,550 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 11:19:53,554 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 11:19:53,555 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/cohendiv-ll_unwindbound10.c [2022-04-28 11:19:53,589 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f79a5a259/937469823723426683c4a739fe66a66b/FLAG651a5be11 [2022-04-28 11:19:53,924 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 11:19:53,924 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/cohendiv-ll_unwindbound10.c [2022-04-28 11:19:53,929 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f79a5a259/937469823723426683c4a739fe66a66b/FLAG651a5be11 [2022-04-28 11:19:54,357 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f79a5a259/937469823723426683c4a739fe66a66b [2022-04-28 11:19:54,358 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 11:19:54,359 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 11:19:54,360 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 11:19:54,360 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 11:19:54,362 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 11:19:54,363 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 11:19:54" (1/1) ... [2022-04-28 11:19:54,364 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70a65029 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:19:54, skipping insertion in model container [2022-04-28 11:19:54,364 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 11:19:54" (1/1) ... [2022-04-28 11:19:54,375 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 11:19:54,387 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 11:19:54,557 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_unwindbound10.c[576,589] [2022-04-28 11:19:54,583 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 11:19:54,592 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 11:19:54,604 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/cohendiv-ll_unwindbound10.c[576,589] [2022-04-28 11:19:54,622 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 11:19:54,631 INFO L208 MainTranslator]: Completed translation [2022-04-28 11:19:54,631 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:19:54 WrapperNode [2022-04-28 11:19:54,632 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 11:19:54,632 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 11:19:54,632 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 11:19:54,632 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 11:19:54,639 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:19:54" (1/1) ... [2022-04-28 11:19:54,640 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:19:54" (1/1) ... [2022-04-28 11:19:54,643 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:19:54" (1/1) ... [2022-04-28 11:19:54,644 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:19:54" (1/1) ... [2022-04-28 11:19:54,648 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:19:54" (1/1) ... [2022-04-28 11:19:54,651 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:19:54" (1/1) ... [2022-04-28 11:19:54,652 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:19:54" (1/1) ... [2022-04-28 11:19:54,653 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 11:19:54,653 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 11:19:54,654 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 11:19:54,654 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 11:19:54,655 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:19:54" (1/1) ... [2022-04-28 11:19:54,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 11:19:54,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:19:54,680 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-28 11:19:54,696 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-28 11:19:54,709 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 11:19:54,709 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 11:19:54,709 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 11:19:54,709 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 11:19:54,709 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 11:19:54,709 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 11:19:54,710 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 11:19:54,710 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 11:19:54,710 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 11:19:54,710 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 11:19:54,710 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 11:19:54,710 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 11:19:54,710 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 11:19:54,711 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 11:19:54,711 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 11:19:54,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 11:19:54,711 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 11:19:54,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 11:19:54,711 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 11:19:54,711 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 11:19:54,753 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 11:19:54,754 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 11:19:54,879 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 11:19:54,884 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 11:19:54,884 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-28 11:19:54,885 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 11:19:54 BoogieIcfgContainer [2022-04-28 11:19:54,885 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 11:19:54,887 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 11:19:54,887 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 11:19:54,889 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 11:19:54,889 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 11:19:54" (1/3) ... [2022-04-28 11:19:54,890 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@605c1083 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 11:19:54, skipping insertion in model container [2022-04-28 11:19:54,890 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:19:54" (2/3) ... [2022-04-28 11:19:54,890 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@605c1083 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 11:19:54, skipping insertion in model container [2022-04-28 11:19:54,890 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 11:19:54" (3/3) ... [2022-04-28 11:19:54,891 INFO L111 eAbstractionObserver]: Analyzing ICFG cohendiv-ll_unwindbound10.c [2022-04-28 11:19:54,901 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 11:19:54,901 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 11:19:54,930 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 11:19:54,934 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1907a152, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@5b5d8177 [2022-04-28 11:19:54,934 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 11:19:54,940 INFO L276 IsEmpty]: Start isEmpty. Operand has 38 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 23 states have internal predecessors, (31), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 11:19:54,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-28 11:19:54,946 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:19:54,947 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:19:54,947 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:19:54,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:19:54,951 INFO L85 PathProgramCache]: Analyzing trace with hash -1588022502, now seen corresponding path program 1 times [2022-04-28 11:19:54,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:19:54,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1112187582] [2022-04-28 11:19:54,967 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 11:19:54,967 INFO L85 PathProgramCache]: Analyzing trace with hash -1588022502, now seen corresponding path program 2 times [2022-04-28 11:19:54,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:19:54,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724663970] [2022-04-28 11:19:54,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:19:54,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:19:55,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:19:55,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 11:19:55,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:19:55,139 INFO L290 TraceCheckUtils]: 0: Hoare triple {50#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {41#true} is VALID [2022-04-28 11:19:55,140 INFO L290 TraceCheckUtils]: 1: Hoare triple {41#true} assume true; {41#true} is VALID [2022-04-28 11:19:55,140 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {41#true} {41#true} #93#return; {41#true} is VALID [2022-04-28 11:19:55,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-28 11:19:55,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:19:55,147 INFO L290 TraceCheckUtils]: 0: Hoare triple {41#true} ~cond := #in~cond; {41#true} is VALID [2022-04-28 11:19:55,148 INFO L290 TraceCheckUtils]: 1: Hoare triple {41#true} assume 0 == ~cond;assume false; {42#false} is VALID [2022-04-28 11:19:55,148 INFO L290 TraceCheckUtils]: 2: Hoare triple {42#false} assume true; {42#false} is VALID [2022-04-28 11:19:55,149 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42#false} {41#true} #77#return; {42#false} is VALID [2022-04-28 11:19:55,150 INFO L272 TraceCheckUtils]: 0: Hoare triple {41#true} call ULTIMATE.init(); {50#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 11:19:55,150 INFO L290 TraceCheckUtils]: 1: Hoare triple {50#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {41#true} is VALID [2022-04-28 11:19:55,150 INFO L290 TraceCheckUtils]: 2: Hoare triple {41#true} assume true; {41#true} is VALID [2022-04-28 11:19:55,150 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41#true} {41#true} #93#return; {41#true} is VALID [2022-04-28 11:19:55,151 INFO L272 TraceCheckUtils]: 4: Hoare triple {41#true} call #t~ret8 := main(); {41#true} is VALID [2022-04-28 11:19:55,151 INFO L290 TraceCheckUtils]: 5: Hoare triple {41#true} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {41#true} is VALID [2022-04-28 11:19:55,151 INFO L272 TraceCheckUtils]: 6: Hoare triple {41#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {41#true} is VALID [2022-04-28 11:19:55,151 INFO L290 TraceCheckUtils]: 7: Hoare triple {41#true} ~cond := #in~cond; {41#true} is VALID [2022-04-28 11:19:55,152 INFO L290 TraceCheckUtils]: 8: Hoare triple {41#true} assume 0 == ~cond;assume false; {42#false} is VALID [2022-04-28 11:19:55,152 INFO L290 TraceCheckUtils]: 9: Hoare triple {42#false} assume true; {42#false} is VALID [2022-04-28 11:19:55,152 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {42#false} {41#true} #77#return; {42#false} is VALID [2022-04-28 11:19:55,152 INFO L290 TraceCheckUtils]: 11: Hoare triple {42#false} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {42#false} is VALID [2022-04-28 11:19:55,153 INFO L290 TraceCheckUtils]: 12: Hoare triple {42#false} assume !true; {42#false} is VALID [2022-04-28 11:19:55,153 INFO L272 TraceCheckUtils]: 13: Hoare triple {42#false} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {42#false} is VALID [2022-04-28 11:19:55,153 INFO L290 TraceCheckUtils]: 14: Hoare triple {42#false} ~cond := #in~cond; {42#false} is VALID [2022-04-28 11:19:55,153 INFO L290 TraceCheckUtils]: 15: Hoare triple {42#false} assume 0 == ~cond; {42#false} is VALID [2022-04-28 11:19:55,153 INFO L290 TraceCheckUtils]: 16: Hoare triple {42#false} assume !false; {42#false} is VALID [2022-04-28 11:19:55,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 11:19:55,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:19:55,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724663970] [2022-04-28 11:19:55,155 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724663970] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:19:55,155 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:19:55,155 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 11:19:55,157 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:19:55,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1112187582] [2022-04-28 11:19:55,157 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1112187582] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:19:55,157 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:19:55,158 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 11:19:55,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205999022] [2022-04-28 11:19:55,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:19:55,162 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-28 11:19:55,163 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:19:55,166 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 11:19:55,183 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:19:55,183 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 11:19:55,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:19:55,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 11:19:55,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 11:19:55,199 INFO L87 Difference]: Start difference. First operand has 38 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 23 states have internal predecessors, (31), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 11:19:55,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:19:55,324 INFO L93 Difference]: Finished difference Result 68 states and 101 transitions. [2022-04-28 11:19:55,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 11:19:55,324 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-28 11:19:55,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:19:55,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 11:19:55,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 101 transitions. [2022-04-28 11:19:55,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 11:19:55,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 101 transitions. [2022-04-28 11:19:55,335 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 101 transitions. [2022-04-28 11:19:55,418 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:19:55,428 INFO L225 Difference]: With dead ends: 68 [2022-04-28 11:19:55,428 INFO L226 Difference]: Without dead ends: 34 [2022-04-28 11:19:55,431 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 11:19:55,436 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 10 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 11:19:55,437 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 49 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 11:19:55,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-28 11:19:55,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2022-04-28 11:19:55,464 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:19:55,465 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 33 states, 19 states have (on average 1.263157894736842) internal successors, (24), 20 states have internal predecessors, (24), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 11:19:55,465 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 33 states, 19 states have (on average 1.263157894736842) internal successors, (24), 20 states have internal predecessors, (24), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 11:19:55,465 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 33 states, 19 states have (on average 1.263157894736842) internal successors, (24), 20 states have internal predecessors, (24), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 11:19:55,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:19:55,469 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2022-04-28 11:19:55,469 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2022-04-28 11:19:55,469 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:19:55,470 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:19:55,470 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 19 states have (on average 1.263157894736842) internal successors, (24), 20 states have internal predecessors, (24), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 34 states. [2022-04-28 11:19:55,470 INFO L87 Difference]: Start difference. First operand has 33 states, 19 states have (on average 1.263157894736842) internal successors, (24), 20 states have internal predecessors, (24), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 34 states. [2022-04-28 11:19:55,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:19:55,473 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2022-04-28 11:19:55,473 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2022-04-28 11:19:55,474 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:19:55,474 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:19:55,474 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:19:55,474 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:19:55,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 19 states have (on average 1.263157894736842) internal successors, (24), 20 states have internal predecessors, (24), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 11:19:55,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 42 transitions. [2022-04-28 11:19:55,477 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 42 transitions. Word has length 17 [2022-04-28 11:19:55,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:19:55,477 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 42 transitions. [2022-04-28 11:19:55,478 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 11:19:55,478 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 42 transitions. [2022-04-28 11:19:55,512 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:19:55,512 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 42 transitions. [2022-04-28 11:19:55,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-28 11:19:55,513 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:19:55,513 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:19:55,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 11:19:55,514 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:19:55,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:19:55,520 INFO L85 PathProgramCache]: Analyzing trace with hash 766070672, now seen corresponding path program 1 times [2022-04-28 11:19:55,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:19:55,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1184849549] [2022-04-28 11:19:55,521 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 11:19:55,521 INFO L85 PathProgramCache]: Analyzing trace with hash 766070672, now seen corresponding path program 2 times [2022-04-28 11:19:55,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:19:55,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787747964] [2022-04-28 11:19:55,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:19:55,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:19:55,562 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:19:55,562 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1027542084] [2022-04-28 11:19:55,562 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:19:55,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:19:55,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:19:55,569 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 11:19:55,576 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-28 11:19:55,618 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-28 11:19:55,619 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:19:55,620 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-28 11:19:55,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:19:55,648 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:19:55,791 INFO L272 TraceCheckUtils]: 0: Hoare triple {323#true} call ULTIMATE.init(); {323#true} is VALID [2022-04-28 11:19:55,792 INFO L290 TraceCheckUtils]: 1: Hoare triple {323#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {331#(<= ~counter~0 0)} is VALID [2022-04-28 11:19:55,793 INFO L290 TraceCheckUtils]: 2: Hoare triple {331#(<= ~counter~0 0)} assume true; {331#(<= ~counter~0 0)} is VALID [2022-04-28 11:19:55,793 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {331#(<= ~counter~0 0)} {323#true} #93#return; {331#(<= ~counter~0 0)} is VALID [2022-04-28 11:19:55,793 INFO L272 TraceCheckUtils]: 4: Hoare triple {331#(<= ~counter~0 0)} call #t~ret8 := main(); {331#(<= ~counter~0 0)} is VALID [2022-04-28 11:19:55,794 INFO L290 TraceCheckUtils]: 5: Hoare triple {331#(<= ~counter~0 0)} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {331#(<= ~counter~0 0)} is VALID [2022-04-28 11:19:55,794 INFO L272 TraceCheckUtils]: 6: Hoare triple {331#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {331#(<= ~counter~0 0)} is VALID [2022-04-28 11:19:55,795 INFO L290 TraceCheckUtils]: 7: Hoare triple {331#(<= ~counter~0 0)} ~cond := #in~cond; {331#(<= ~counter~0 0)} is VALID [2022-04-28 11:19:55,795 INFO L290 TraceCheckUtils]: 8: Hoare triple {331#(<= ~counter~0 0)} assume !(0 == ~cond); {331#(<= ~counter~0 0)} is VALID [2022-04-28 11:19:55,795 INFO L290 TraceCheckUtils]: 9: Hoare triple {331#(<= ~counter~0 0)} assume true; {331#(<= ~counter~0 0)} is VALID [2022-04-28 11:19:55,796 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {331#(<= ~counter~0 0)} {331#(<= ~counter~0 0)} #77#return; {331#(<= ~counter~0 0)} is VALID [2022-04-28 11:19:55,796 INFO L290 TraceCheckUtils]: 11: Hoare triple {331#(<= ~counter~0 0)} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {331#(<= ~counter~0 0)} is VALID [2022-04-28 11:19:55,797 INFO L290 TraceCheckUtils]: 12: Hoare triple {331#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {365#(<= |main_#t~post6| 0)} is VALID [2022-04-28 11:19:55,797 INFO L290 TraceCheckUtils]: 13: Hoare triple {365#(<= |main_#t~post6| 0)} assume !(#t~post6 < 10);havoc #t~post6; {324#false} is VALID [2022-04-28 11:19:55,798 INFO L272 TraceCheckUtils]: 14: Hoare triple {324#false} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {324#false} is VALID [2022-04-28 11:19:55,798 INFO L290 TraceCheckUtils]: 15: Hoare triple {324#false} ~cond := #in~cond; {324#false} is VALID [2022-04-28 11:19:55,798 INFO L290 TraceCheckUtils]: 16: Hoare triple {324#false} assume 0 == ~cond; {324#false} is VALID [2022-04-28 11:19:55,798 INFO L290 TraceCheckUtils]: 17: Hoare triple {324#false} assume !false; {324#false} is VALID [2022-04-28 11:19:55,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 11:19:55,798 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 11:19:55,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:19:55,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787747964] [2022-04-28 11:19:55,799 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:19:55,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1027542084] [2022-04-28 11:19:55,799 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1027542084] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:19:55,799 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:19:55,799 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 11:19:55,800 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:19:55,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1184849549] [2022-04-28 11:19:55,800 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1184849549] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:19:55,800 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:19:55,800 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 11:19:55,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778452824] [2022-04-28 11:19:55,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:19:55,801 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2022-04-28 11:19:55,801 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:19:55,801 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 11:19:55,814 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:19:55,814 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 11:19:55,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:19:55,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 11:19:55,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 11:19:55,815 INFO L87 Difference]: Start difference. First operand 33 states and 42 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 11:19:55,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:19:55,896 INFO L93 Difference]: Finished difference Result 42 states and 51 transitions. [2022-04-28 11:19:55,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 11:19:55,896 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2022-04-28 11:19:55,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:19:55,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 11:19:55,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 51 transitions. [2022-04-28 11:19:55,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 11:19:55,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 51 transitions. [2022-04-28 11:19:55,900 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 51 transitions. [2022-04-28 11:19:55,940 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:19:55,942 INFO L225 Difference]: With dead ends: 42 [2022-04-28 11:19:55,942 INFO L226 Difference]: Without dead ends: 35 [2022-04-28 11:19:55,942 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 11:19:55,943 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 0 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 11:19:55,943 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 107 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 11:19:55,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-28 11:19:55,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2022-04-28 11:19:55,958 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:19:55,958 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 35 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 11:19:55,958 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 35 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 11:19:55,959 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 35 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 11:19:55,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:19:55,961 INFO L93 Difference]: Finished difference Result 35 states and 44 transitions. [2022-04-28 11:19:55,961 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 44 transitions. [2022-04-28 11:19:55,961 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:19:55,961 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:19:55,962 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 35 states. [2022-04-28 11:19:55,962 INFO L87 Difference]: Start difference. First operand has 35 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 35 states. [2022-04-28 11:19:55,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:19:55,964 INFO L93 Difference]: Finished difference Result 35 states and 44 transitions. [2022-04-28 11:19:55,964 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 44 transitions. [2022-04-28 11:19:55,965 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:19:55,965 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:19:55,965 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:19:55,965 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:19:55,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 11:19:55,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 44 transitions. [2022-04-28 11:19:55,967 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 44 transitions. Word has length 18 [2022-04-28 11:19:55,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:19:55,967 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 44 transitions. [2022-04-28 11:19:55,967 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 11:19:55,967 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 44 transitions. [2022-04-28 11:19:56,000 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:19:56,000 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 44 transitions. [2022-04-28 11:19:56,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-28 11:19:56,003 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:19:56,005 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:19:56,024 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-28 11:19:56,224 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:19:56,224 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:19:56,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:19:56,225 INFO L85 PathProgramCache]: Analyzing trace with hash 767560222, now seen corresponding path program 1 times [2022-04-28 11:19:56,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:19:56,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1217581489] [2022-04-28 11:19:56,225 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 11:19:56,225 INFO L85 PathProgramCache]: Analyzing trace with hash 767560222, now seen corresponding path program 2 times [2022-04-28 11:19:56,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:19:56,226 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680983775] [2022-04-28 11:19:56,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:19:56,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:19:56,239 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:19:56,239 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1905194879] [2022-04-28 11:19:56,239 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:19:56,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:19:56,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:19:56,241 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 11:19:56,242 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-28 11:19:56,278 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-28 11:19:56,278 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:19:56,279 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 11:19:56,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:19:56,285 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:19:57,962 INFO L272 TraceCheckUtils]: 0: Hoare triple {604#true} call ULTIMATE.init(); {604#true} is VALID [2022-04-28 11:19:57,962 INFO L290 TraceCheckUtils]: 1: Hoare triple {604#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {604#true} is VALID [2022-04-28 11:19:57,962 INFO L290 TraceCheckUtils]: 2: Hoare triple {604#true} assume true; {604#true} is VALID [2022-04-28 11:19:57,962 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {604#true} {604#true} #93#return; {604#true} is VALID [2022-04-28 11:19:57,962 INFO L272 TraceCheckUtils]: 4: Hoare triple {604#true} call #t~ret8 := main(); {604#true} is VALID [2022-04-28 11:19:57,963 INFO L290 TraceCheckUtils]: 5: Hoare triple {604#true} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {604#true} is VALID [2022-04-28 11:19:57,963 INFO L272 TraceCheckUtils]: 6: Hoare triple {604#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {604#true} is VALID [2022-04-28 11:19:57,963 INFO L290 TraceCheckUtils]: 7: Hoare triple {604#true} ~cond := #in~cond; {604#true} is VALID [2022-04-28 11:19:57,963 INFO L290 TraceCheckUtils]: 8: Hoare triple {604#true} assume !(0 == ~cond); {604#true} is VALID [2022-04-28 11:19:57,963 INFO L290 TraceCheckUtils]: 9: Hoare triple {604#true} assume true; {604#true} is VALID [2022-04-28 11:19:57,963 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {604#true} {604#true} #77#return; {604#true} is VALID [2022-04-28 11:19:57,966 INFO L290 TraceCheckUtils]: 11: Hoare triple {604#true} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {642#(and (= main_~a~0 0) (= main_~b~0 0))} is VALID [2022-04-28 11:19:57,967 INFO L290 TraceCheckUtils]: 12: Hoare triple {642#(and (= main_~a~0 0) (= main_~b~0 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {642#(and (= main_~a~0 0) (= main_~b~0 0))} is VALID [2022-04-28 11:19:57,967 INFO L290 TraceCheckUtils]: 13: Hoare triple {642#(and (= main_~a~0 0) (= main_~b~0 0))} assume !!(#t~post6 < 10);havoc #t~post6; {642#(and (= main_~a~0 0) (= main_~b~0 0))} is VALID [2022-04-28 11:19:57,968 INFO L272 TraceCheckUtils]: 14: Hoare triple {642#(and (= main_~a~0 0) (= main_~b~0 0))} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {652#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:19:57,968 INFO L290 TraceCheckUtils]: 15: Hoare triple {652#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {656#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:19:57,969 INFO L290 TraceCheckUtils]: 16: Hoare triple {656#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {605#false} is VALID [2022-04-28 11:19:57,969 INFO L290 TraceCheckUtils]: 17: Hoare triple {605#false} assume !false; {605#false} is VALID [2022-04-28 11:19:57,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 11:19:57,969 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 11:19:57,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:19:57,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680983775] [2022-04-28 11:19:57,969 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:19:57,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1905194879] [2022-04-28 11:19:57,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1905194879] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:19:57,970 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:19:57,970 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 11:19:57,970 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:19:57,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1217581489] [2022-04-28 11:19:57,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1217581489] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:19:57,970 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:19:57,970 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 11:19:57,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243394043] [2022-04-28 11:19:57,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:19:57,971 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-04-28 11:19:57,971 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:19:57,971 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 11:19:57,989 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:19:57,989 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 11:19:57,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:19:57,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 11:19:57,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 11:19:57,990 INFO L87 Difference]: Start difference. First operand 35 states and 44 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 11:19:58,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:19:58,133 INFO L93 Difference]: Finished difference Result 45 states and 56 transitions. [2022-04-28 11:19:58,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 11:19:58,133 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-04-28 11:19:58,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:19:58,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 11:19:58,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 56 transitions. [2022-04-28 11:19:58,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 11:19:58,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 56 transitions. [2022-04-28 11:19:58,139 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 56 transitions. [2022-04-28 11:19:58,173 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:19:58,177 INFO L225 Difference]: With dead ends: 45 [2022-04-28 11:19:58,177 INFO L226 Difference]: Without dead ends: 43 [2022-04-28 11:19:58,178 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 11:19:58,185 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 6 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 11:19:58,185 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 145 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 11:19:58,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-04-28 11:19:58,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 40. [2022-04-28 11:19:58,201 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:19:58,202 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand has 40 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 26 states have internal predecessors, (29), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 11:19:58,202 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand has 40 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 26 states have internal predecessors, (29), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 11:19:58,202 INFO L87 Difference]: Start difference. First operand 43 states. Second operand has 40 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 26 states have internal predecessors, (29), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 11:19:58,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:19:58,204 INFO L93 Difference]: Finished difference Result 43 states and 54 transitions. [2022-04-28 11:19:58,204 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 54 transitions. [2022-04-28 11:19:58,204 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:19:58,204 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:19:58,205 INFO L74 IsIncluded]: Start isIncluded. First operand has 40 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 26 states have internal predecessors, (29), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) Second operand 43 states. [2022-04-28 11:19:58,205 INFO L87 Difference]: Start difference. First operand has 40 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 26 states have internal predecessors, (29), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) Second operand 43 states. [2022-04-28 11:19:58,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:19:58,206 INFO L93 Difference]: Finished difference Result 43 states and 54 transitions. [2022-04-28 11:19:58,207 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 54 transitions. [2022-04-28 11:19:58,207 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:19:58,207 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:19:58,207 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:19:58,207 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:19:58,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 26 states have internal predecessors, (29), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 11:19:58,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 49 transitions. [2022-04-28 11:19:58,209 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 49 transitions. Word has length 18 [2022-04-28 11:19:58,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:19:58,209 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 49 transitions. [2022-04-28 11:19:58,209 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 11:19:58,209 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 40 states and 49 transitions. [2022-04-28 11:19:58,251 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:19:58,251 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 49 transitions. [2022-04-28 11:19:58,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-28 11:19:58,252 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:19:58,252 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:19:58,269 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-28 11:19:58,469 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-28 11:19:58,469 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:19:58,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:19:58,469 INFO L85 PathProgramCache]: Analyzing trace with hash -1016228092, now seen corresponding path program 1 times [2022-04-28 11:19:58,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:19:58,470 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1897386698] [2022-04-28 11:19:58,470 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 11:19:58,470 INFO L85 PathProgramCache]: Analyzing trace with hash -1016228092, now seen corresponding path program 2 times [2022-04-28 11:19:58,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:19:58,470 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455957494] [2022-04-28 11:19:58,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:19:58,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:19:58,485 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:19:58,485 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1108587976] [2022-04-28 11:19:58,486 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:19:58,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:19:58,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:19:58,487 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 11:19:58,496 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-28 11:19:58,530 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 11:19:58,530 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:19:58,531 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 11:19:58,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:19:58,537 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:20:00,666 INFO L272 TraceCheckUtils]: 0: Hoare triple {920#true} call ULTIMATE.init(); {920#true} is VALID [2022-04-28 11:20:00,666 INFO L290 TraceCheckUtils]: 1: Hoare triple {920#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {920#true} is VALID [2022-04-28 11:20:00,666 INFO L290 TraceCheckUtils]: 2: Hoare triple {920#true} assume true; {920#true} is VALID [2022-04-28 11:20:00,666 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {920#true} {920#true} #93#return; {920#true} is VALID [2022-04-28 11:20:00,667 INFO L272 TraceCheckUtils]: 4: Hoare triple {920#true} call #t~ret8 := main(); {920#true} is VALID [2022-04-28 11:20:00,667 INFO L290 TraceCheckUtils]: 5: Hoare triple {920#true} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {920#true} is VALID [2022-04-28 11:20:00,667 INFO L272 TraceCheckUtils]: 6: Hoare triple {920#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {920#true} is VALID [2022-04-28 11:20:00,667 INFO L290 TraceCheckUtils]: 7: Hoare triple {920#true} ~cond := #in~cond; {920#true} is VALID [2022-04-28 11:20:00,667 INFO L290 TraceCheckUtils]: 8: Hoare triple {920#true} assume !(0 == ~cond); {920#true} is VALID [2022-04-28 11:20:00,667 INFO L290 TraceCheckUtils]: 9: Hoare triple {920#true} assume true; {920#true} is VALID [2022-04-28 11:20:00,667 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {920#true} {920#true} #77#return; {920#true} is VALID [2022-04-28 11:20:00,668 INFO L290 TraceCheckUtils]: 11: Hoare triple {920#true} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {958#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:20:00,668 INFO L290 TraceCheckUtils]: 12: Hoare triple {958#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {958#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:20:00,669 INFO L290 TraceCheckUtils]: 13: Hoare triple {958#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} assume !!(#t~post6 < 10);havoc #t~post6; {958#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:20:00,669 INFO L272 TraceCheckUtils]: 14: Hoare triple {958#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {920#true} is VALID [2022-04-28 11:20:00,669 INFO L290 TraceCheckUtils]: 15: Hoare triple {920#true} ~cond := #in~cond; {920#true} is VALID [2022-04-28 11:20:00,669 INFO L290 TraceCheckUtils]: 16: Hoare triple {920#true} assume !(0 == ~cond); {920#true} is VALID [2022-04-28 11:20:00,669 INFO L290 TraceCheckUtils]: 17: Hoare triple {920#true} assume true; {920#true} is VALID [2022-04-28 11:20:00,670 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {920#true} {958#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #79#return; {958#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:20:00,670 INFO L272 TraceCheckUtils]: 19: Hoare triple {958#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {983#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:20:00,671 INFO L290 TraceCheckUtils]: 20: Hoare triple {983#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {987#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:20:00,671 INFO L290 TraceCheckUtils]: 21: Hoare triple {987#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {921#false} is VALID [2022-04-28 11:20:00,671 INFO L290 TraceCheckUtils]: 22: Hoare triple {921#false} assume !false; {921#false} is VALID [2022-04-28 11:20:00,672 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 11:20:00,672 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 11:20:00,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:20:00,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455957494] [2022-04-28 11:20:00,672 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:20:00,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1108587976] [2022-04-28 11:20:00,672 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1108587976] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:20:00,672 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:20:00,672 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 11:20:00,672 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:20:00,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1897386698] [2022-04-28 11:20:00,673 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1897386698] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:20:00,673 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:20:00,673 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 11:20:00,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328314984] [2022-04-28 11:20:00,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:20:00,673 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-28 11:20:00,673 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:20:00,674 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 11:20:00,703 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:20:00,703 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 11:20:00,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:20:00,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 11:20:00,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 11:20:00,703 INFO L87 Difference]: Start difference. First operand 40 states and 49 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 11:20:00,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:20:00,861 INFO L93 Difference]: Finished difference Result 58 states and 74 transitions. [2022-04-28 11:20:00,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 11:20:00,862 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-28 11:20:00,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:20:00,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 11:20:00,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 71 transitions. [2022-04-28 11:20:00,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 11:20:00,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 71 transitions. [2022-04-28 11:20:00,865 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 71 transitions. [2022-04-28 11:20:00,905 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:20:00,907 INFO L225 Difference]: With dead ends: 58 [2022-04-28 11:20:00,907 INFO L226 Difference]: Without dead ends: 55 [2022-04-28 11:20:00,907 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 11:20:00,908 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 13 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 11:20:00,908 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 139 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 11:20:00,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-04-28 11:20:00,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 54. [2022-04-28 11:20:00,924 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:20:00,925 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand has 54 states, 32 states have (on average 1.21875) internal successors, (39), 33 states have internal predecessors, (39), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-28 11:20:00,925 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand has 54 states, 32 states have (on average 1.21875) internal successors, (39), 33 states have internal predecessors, (39), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-28 11:20:00,926 INFO L87 Difference]: Start difference. First operand 55 states. Second operand has 54 states, 32 states have (on average 1.21875) internal successors, (39), 33 states have internal predecessors, (39), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-28 11:20:00,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:20:00,928 INFO L93 Difference]: Finished difference Result 55 states and 70 transitions. [2022-04-28 11:20:00,928 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 70 transitions. [2022-04-28 11:20:00,928 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:20:00,928 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:20:00,929 INFO L74 IsIncluded]: Start isIncluded. First operand has 54 states, 32 states have (on average 1.21875) internal successors, (39), 33 states have internal predecessors, (39), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 55 states. [2022-04-28 11:20:00,929 INFO L87 Difference]: Start difference. First operand has 54 states, 32 states have (on average 1.21875) internal successors, (39), 33 states have internal predecessors, (39), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 55 states. [2022-04-28 11:20:00,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:20:00,931 INFO L93 Difference]: Finished difference Result 55 states and 70 transitions. [2022-04-28 11:20:00,931 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 70 transitions. [2022-04-28 11:20:00,931 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:20:00,931 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:20:00,931 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:20:00,931 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:20:00,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 32 states have (on average 1.21875) internal successors, (39), 33 states have internal predecessors, (39), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-28 11:20:00,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 69 transitions. [2022-04-28 11:20:00,933 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 69 transitions. Word has length 23 [2022-04-28 11:20:00,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:20:00,934 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 69 transitions. [2022-04-28 11:20:00,934 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 11:20:00,934 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 54 states and 69 transitions. [2022-04-28 11:20:00,986 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:20:00,986 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 69 transitions. [2022-04-28 11:20:00,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-28 11:20:00,987 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:20:00,987 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:20:01,019 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-28 11:20:01,206 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:20:01,206 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:20:01,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:20:01,206 INFO L85 PathProgramCache]: Analyzing trace with hash 2019703110, now seen corresponding path program 1 times [2022-04-28 11:20:01,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:20:01,206 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2010032633] [2022-04-28 11:20:01,207 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 11:20:01,207 INFO L85 PathProgramCache]: Analyzing trace with hash 2019703110, now seen corresponding path program 2 times [2022-04-28 11:20:01,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:20:01,207 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465629180] [2022-04-28 11:20:01,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:20:01,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:20:01,218 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:20:01,218 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [335419639] [2022-04-28 11:20:01,218 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:20:01,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:20:01,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:20:01,225 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 11:20:01,226 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-28 11:20:01,268 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 11:20:01,268 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:20:01,286 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 11:20:01,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:20:01,303 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:20:01,376 INFO L272 TraceCheckUtils]: 0: Hoare triple {1329#true} call ULTIMATE.init(); {1329#true} is VALID [2022-04-28 11:20:01,377 INFO L290 TraceCheckUtils]: 1: Hoare triple {1329#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1329#true} is VALID [2022-04-28 11:20:01,377 INFO L290 TraceCheckUtils]: 2: Hoare triple {1329#true} assume true; {1329#true} is VALID [2022-04-28 11:20:01,377 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1329#true} {1329#true} #93#return; {1329#true} is VALID [2022-04-28 11:20:01,377 INFO L272 TraceCheckUtils]: 4: Hoare triple {1329#true} call #t~ret8 := main(); {1329#true} is VALID [2022-04-28 11:20:01,377 INFO L290 TraceCheckUtils]: 5: Hoare triple {1329#true} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {1329#true} is VALID [2022-04-28 11:20:01,377 INFO L272 TraceCheckUtils]: 6: Hoare triple {1329#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1329#true} is VALID [2022-04-28 11:20:01,377 INFO L290 TraceCheckUtils]: 7: Hoare triple {1329#true} ~cond := #in~cond; {1329#true} is VALID [2022-04-28 11:20:01,377 INFO L290 TraceCheckUtils]: 8: Hoare triple {1329#true} assume !(0 == ~cond); {1329#true} is VALID [2022-04-28 11:20:01,377 INFO L290 TraceCheckUtils]: 9: Hoare triple {1329#true} assume true; {1329#true} is VALID [2022-04-28 11:20:01,378 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1329#true} {1329#true} #77#return; {1329#true} is VALID [2022-04-28 11:20:01,378 INFO L290 TraceCheckUtils]: 11: Hoare triple {1329#true} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {1329#true} is VALID [2022-04-28 11:20:01,378 INFO L290 TraceCheckUtils]: 12: Hoare triple {1329#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1329#true} is VALID [2022-04-28 11:20:01,378 INFO L290 TraceCheckUtils]: 13: Hoare triple {1329#true} assume !!(#t~post6 < 10);havoc #t~post6; {1329#true} is VALID [2022-04-28 11:20:01,378 INFO L272 TraceCheckUtils]: 14: Hoare triple {1329#true} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {1329#true} is VALID [2022-04-28 11:20:01,378 INFO L290 TraceCheckUtils]: 15: Hoare triple {1329#true} ~cond := #in~cond; {1329#true} is VALID [2022-04-28 11:20:01,378 INFO L290 TraceCheckUtils]: 16: Hoare triple {1329#true} assume !(0 == ~cond); {1329#true} is VALID [2022-04-28 11:20:01,378 INFO L290 TraceCheckUtils]: 17: Hoare triple {1329#true} assume true; {1329#true} is VALID [2022-04-28 11:20:01,378 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1329#true} {1329#true} #79#return; {1329#true} is VALID [2022-04-28 11:20:01,379 INFO L272 TraceCheckUtils]: 19: Hoare triple {1329#true} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {1329#true} is VALID [2022-04-28 11:20:01,379 INFO L290 TraceCheckUtils]: 20: Hoare triple {1329#true} ~cond := #in~cond; {1329#true} is VALID [2022-04-28 11:20:01,379 INFO L290 TraceCheckUtils]: 21: Hoare triple {1329#true} assume !(0 == ~cond); {1329#true} is VALID [2022-04-28 11:20:01,379 INFO L290 TraceCheckUtils]: 22: Hoare triple {1329#true} assume true; {1329#true} is VALID [2022-04-28 11:20:01,379 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1329#true} {1329#true} #81#return; {1329#true} is VALID [2022-04-28 11:20:01,380 INFO L290 TraceCheckUtils]: 24: Hoare triple {1329#true} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {1406#(and (= main_~a~0 1) (= main_~b~0 main_~y~0))} is VALID [2022-04-28 11:20:01,381 INFO L290 TraceCheckUtils]: 25: Hoare triple {1406#(and (= main_~a~0 1) (= main_~b~0 main_~y~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {1406#(and (= main_~a~0 1) (= main_~b~0 main_~y~0))} is VALID [2022-04-28 11:20:01,381 INFO L290 TraceCheckUtils]: 26: Hoare triple {1406#(and (= main_~a~0 1) (= main_~b~0 main_~y~0))} assume !!(#t~post7 < 10);havoc #t~post7; {1406#(and (= main_~a~0 1) (= main_~b~0 main_~y~0))} is VALID [2022-04-28 11:20:01,382 INFO L272 TraceCheckUtils]: 27: Hoare triple {1406#(and (= main_~a~0 1) (= main_~b~0 main_~y~0))} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {1416#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:20:01,382 INFO L290 TraceCheckUtils]: 28: Hoare triple {1416#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1420#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:20:01,382 INFO L290 TraceCheckUtils]: 29: Hoare triple {1420#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1330#false} is VALID [2022-04-28 11:20:01,382 INFO L290 TraceCheckUtils]: 30: Hoare triple {1330#false} assume !false; {1330#false} is VALID [2022-04-28 11:20:01,383 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 11:20:01,383 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 11:20:01,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:20:01,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465629180] [2022-04-28 11:20:01,383 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:20:01,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [335419639] [2022-04-28 11:20:01,383 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [335419639] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:20:01,383 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:20:01,383 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 11:20:01,383 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:20:01,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2010032633] [2022-04-28 11:20:01,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2010032633] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:20:01,384 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:20:01,384 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 11:20:01,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20380559] [2022-04-28 11:20:01,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:20:01,384 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 31 [2022-04-28 11:20:01,384 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:20:01,384 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-28 11:20:01,407 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:20:01,407 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 11:20:01,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:20:01,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 11:20:01,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 11:20:01,408 INFO L87 Difference]: Start difference. First operand 54 states and 69 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-28 11:20:01,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:20:01,602 INFO L93 Difference]: Finished difference Result 83 states and 113 transitions. [2022-04-28 11:20:01,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 11:20:01,603 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 31 [2022-04-28 11:20:01,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:20:01,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-28 11:20:01,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 72 transitions. [2022-04-28 11:20:01,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-28 11:20:01,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 72 transitions. [2022-04-28 11:20:01,605 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 72 transitions. [2022-04-28 11:20:01,651 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:20:01,653 INFO L225 Difference]: With dead ends: 83 [2022-04-28 11:20:01,653 INFO L226 Difference]: Without dead ends: 81 [2022-04-28 11:20:01,654 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 11:20:01,654 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 13 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 11:20:01,654 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 145 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 11:20:01,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-04-28 11:20:01,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 74. [2022-04-28 11:20:01,673 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:20:01,673 INFO L82 GeneralOperation]: Start isEquivalent. First operand 81 states. Second operand has 74 states, 44 states have (on average 1.2727272727272727) internal successors, (56), 46 states have internal predecessors, (56), 23 states have call successors, (23), 7 states have call predecessors, (23), 6 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-28 11:20:01,674 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand has 74 states, 44 states have (on average 1.2727272727272727) internal successors, (56), 46 states have internal predecessors, (56), 23 states have call successors, (23), 7 states have call predecessors, (23), 6 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-28 11:20:01,674 INFO L87 Difference]: Start difference. First operand 81 states. Second operand has 74 states, 44 states have (on average 1.2727272727272727) internal successors, (56), 46 states have internal predecessors, (56), 23 states have call successors, (23), 7 states have call predecessors, (23), 6 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-28 11:20:01,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:20:01,677 INFO L93 Difference]: Finished difference Result 81 states and 111 transitions. [2022-04-28 11:20:01,677 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 111 transitions. [2022-04-28 11:20:01,677 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:20:01,677 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:20:01,677 INFO L74 IsIncluded]: Start isIncluded. First operand has 74 states, 44 states have (on average 1.2727272727272727) internal successors, (56), 46 states have internal predecessors, (56), 23 states have call successors, (23), 7 states have call predecessors, (23), 6 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) Second operand 81 states. [2022-04-28 11:20:01,678 INFO L87 Difference]: Start difference. First operand has 74 states, 44 states have (on average 1.2727272727272727) internal successors, (56), 46 states have internal predecessors, (56), 23 states have call successors, (23), 7 states have call predecessors, (23), 6 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) Second operand 81 states. [2022-04-28 11:20:01,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:20:01,680 INFO L93 Difference]: Finished difference Result 81 states and 111 transitions. [2022-04-28 11:20:01,680 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 111 transitions. [2022-04-28 11:20:01,681 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:20:01,681 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:20:01,681 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:20:01,681 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:20:01,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 44 states have (on average 1.2727272727272727) internal successors, (56), 46 states have internal predecessors, (56), 23 states have call successors, (23), 7 states have call predecessors, (23), 6 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-28 11:20:01,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 100 transitions. [2022-04-28 11:20:01,683 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 100 transitions. Word has length 31 [2022-04-28 11:20:01,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:20:01,684 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 100 transitions. [2022-04-28 11:20:01,684 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-28 11:20:01,684 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 74 states and 100 transitions. [2022-04-28 11:20:01,784 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:20:01,784 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 100 transitions. [2022-04-28 11:20:01,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-28 11:20:01,784 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:20:01,784 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:20:01,803 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-28 11:20:01,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:20:01,995 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:20:01,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:20:01,996 INFO L85 PathProgramCache]: Analyzing trace with hash 202176206, now seen corresponding path program 1 times [2022-04-28 11:20:01,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:20:01,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [263777676] [2022-04-28 11:20:08,734 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:20:08,734 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:20:08,734 INFO L85 PathProgramCache]: Analyzing trace with hash 202176206, now seen corresponding path program 2 times [2022-04-28 11:20:08,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:20:08,734 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631165357] [2022-04-28 11:20:08,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:20:08,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:20:08,744 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:20:08,745 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1120695678] [2022-04-28 11:20:08,745 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:20:08,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:20:08,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:20:08,746 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 11:20:08,747 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-28 11:20:08,779 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 11:20:08,779 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:20:08,779 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 11:20:08,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:20:08,787 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:20:08,917 INFO L272 TraceCheckUtils]: 0: Hoare triple {1904#true} call ULTIMATE.init(); {1904#true} is VALID [2022-04-28 11:20:08,918 INFO L290 TraceCheckUtils]: 1: Hoare triple {1904#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1912#(<= ~counter~0 0)} is VALID [2022-04-28 11:20:08,918 INFO L290 TraceCheckUtils]: 2: Hoare triple {1912#(<= ~counter~0 0)} assume true; {1912#(<= ~counter~0 0)} is VALID [2022-04-28 11:20:08,919 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1912#(<= ~counter~0 0)} {1904#true} #93#return; {1912#(<= ~counter~0 0)} is VALID [2022-04-28 11:20:08,919 INFO L272 TraceCheckUtils]: 4: Hoare triple {1912#(<= ~counter~0 0)} call #t~ret8 := main(); {1912#(<= ~counter~0 0)} is VALID [2022-04-28 11:20:08,920 INFO L290 TraceCheckUtils]: 5: Hoare triple {1912#(<= ~counter~0 0)} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {1912#(<= ~counter~0 0)} is VALID [2022-04-28 11:20:08,920 INFO L272 TraceCheckUtils]: 6: Hoare triple {1912#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1912#(<= ~counter~0 0)} is VALID [2022-04-28 11:20:08,921 INFO L290 TraceCheckUtils]: 7: Hoare triple {1912#(<= ~counter~0 0)} ~cond := #in~cond; {1912#(<= ~counter~0 0)} is VALID [2022-04-28 11:20:08,921 INFO L290 TraceCheckUtils]: 8: Hoare triple {1912#(<= ~counter~0 0)} assume !(0 == ~cond); {1912#(<= ~counter~0 0)} is VALID [2022-04-28 11:20:08,921 INFO L290 TraceCheckUtils]: 9: Hoare triple {1912#(<= ~counter~0 0)} assume true; {1912#(<= ~counter~0 0)} is VALID [2022-04-28 11:20:08,922 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1912#(<= ~counter~0 0)} {1912#(<= ~counter~0 0)} #77#return; {1912#(<= ~counter~0 0)} is VALID [2022-04-28 11:20:08,922 INFO L290 TraceCheckUtils]: 11: Hoare triple {1912#(<= ~counter~0 0)} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {1912#(<= ~counter~0 0)} is VALID [2022-04-28 11:20:08,923 INFO L290 TraceCheckUtils]: 12: Hoare triple {1912#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1946#(<= ~counter~0 1)} is VALID [2022-04-28 11:20:08,927 INFO L290 TraceCheckUtils]: 13: Hoare triple {1946#(<= ~counter~0 1)} assume !!(#t~post6 < 10);havoc #t~post6; {1946#(<= ~counter~0 1)} is VALID [2022-04-28 11:20:08,928 INFO L272 TraceCheckUtils]: 14: Hoare triple {1946#(<= ~counter~0 1)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {1946#(<= ~counter~0 1)} is VALID [2022-04-28 11:20:08,928 INFO L290 TraceCheckUtils]: 15: Hoare triple {1946#(<= ~counter~0 1)} ~cond := #in~cond; {1946#(<= ~counter~0 1)} is VALID [2022-04-28 11:20:08,929 INFO L290 TraceCheckUtils]: 16: Hoare triple {1946#(<= ~counter~0 1)} assume !(0 == ~cond); {1946#(<= ~counter~0 1)} is VALID [2022-04-28 11:20:08,929 INFO L290 TraceCheckUtils]: 17: Hoare triple {1946#(<= ~counter~0 1)} assume true; {1946#(<= ~counter~0 1)} is VALID [2022-04-28 11:20:08,930 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1946#(<= ~counter~0 1)} {1946#(<= ~counter~0 1)} #79#return; {1946#(<= ~counter~0 1)} is VALID [2022-04-28 11:20:08,930 INFO L272 TraceCheckUtils]: 19: Hoare triple {1946#(<= ~counter~0 1)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {1946#(<= ~counter~0 1)} is VALID [2022-04-28 11:20:08,931 INFO L290 TraceCheckUtils]: 20: Hoare triple {1946#(<= ~counter~0 1)} ~cond := #in~cond; {1946#(<= ~counter~0 1)} is VALID [2022-04-28 11:20:08,931 INFO L290 TraceCheckUtils]: 21: Hoare triple {1946#(<= ~counter~0 1)} assume !(0 == ~cond); {1946#(<= ~counter~0 1)} is VALID [2022-04-28 11:20:08,932 INFO L290 TraceCheckUtils]: 22: Hoare triple {1946#(<= ~counter~0 1)} assume true; {1946#(<= ~counter~0 1)} is VALID [2022-04-28 11:20:08,932 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1946#(<= ~counter~0 1)} {1946#(<= ~counter~0 1)} #81#return; {1946#(<= ~counter~0 1)} is VALID [2022-04-28 11:20:08,933 INFO L290 TraceCheckUtils]: 24: Hoare triple {1946#(<= ~counter~0 1)} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {1946#(<= ~counter~0 1)} is VALID [2022-04-28 11:20:08,933 INFO L290 TraceCheckUtils]: 25: Hoare triple {1946#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {1986#(<= |main_#t~post7| 1)} is VALID [2022-04-28 11:20:08,933 INFO L290 TraceCheckUtils]: 26: Hoare triple {1986#(<= |main_#t~post7| 1)} assume !(#t~post7 < 10);havoc #t~post7; {1905#false} is VALID [2022-04-28 11:20:08,934 INFO L290 TraceCheckUtils]: 27: Hoare triple {1905#false} ~r~0 := ~r~0 - ~b~0;~q~0 := ~q~0 + ~a~0; {1905#false} is VALID [2022-04-28 11:20:08,934 INFO L290 TraceCheckUtils]: 28: Hoare triple {1905#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1905#false} is VALID [2022-04-28 11:20:08,934 INFO L290 TraceCheckUtils]: 29: Hoare triple {1905#false} assume !(#t~post6 < 10);havoc #t~post6; {1905#false} is VALID [2022-04-28 11:20:08,934 INFO L272 TraceCheckUtils]: 30: Hoare triple {1905#false} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {1905#false} is VALID [2022-04-28 11:20:08,934 INFO L290 TraceCheckUtils]: 31: Hoare triple {1905#false} ~cond := #in~cond; {1905#false} is VALID [2022-04-28 11:20:08,934 INFO L290 TraceCheckUtils]: 32: Hoare triple {1905#false} assume 0 == ~cond; {1905#false} is VALID [2022-04-28 11:20:08,934 INFO L290 TraceCheckUtils]: 33: Hoare triple {1905#false} assume !false; {1905#false} is VALID [2022-04-28 11:20:08,934 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 11:20:08,934 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 11:20:08,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:20:08,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631165357] [2022-04-28 11:20:08,935 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:20:08,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1120695678] [2022-04-28 11:20:08,935 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1120695678] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:20:08,935 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:20:08,935 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 11:20:08,935 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:20:08,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [263777676] [2022-04-28 11:20:08,935 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [263777676] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:20:08,935 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:20:08,936 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 11:20:08,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347789071] [2022-04-28 11:20:08,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:20:08,936 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 34 [2022-04-28 11:20:08,936 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:20:08,936 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 11:20:08,960 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:20:08,960 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 11:20:08,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:20:08,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 11:20:08,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-28 11:20:08,962 INFO L87 Difference]: Start difference. First operand 74 states and 100 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 11:20:09,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:20:09,085 INFO L93 Difference]: Finished difference Result 113 states and 153 transitions. [2022-04-28 11:20:09,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 11:20:09,085 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 34 [2022-04-28 11:20:09,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:20:09,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 11:20:09,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 85 transitions. [2022-04-28 11:20:09,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 11:20:09,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 85 transitions. [2022-04-28 11:20:09,088 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 85 transitions. [2022-04-28 11:20:09,148 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:20:09,150 INFO L225 Difference]: With dead ends: 113 [2022-04-28 11:20:09,150 INFO L226 Difference]: Without dead ends: 78 [2022-04-28 11:20:09,151 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-28 11:20:09,151 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 6 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 11:20:09,151 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 114 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 11:20:09,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-04-28 11:20:09,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2022-04-28 11:20:09,179 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:20:09,179 INFO L82 GeneralOperation]: Start isEquivalent. First operand 78 states. Second operand has 78 states, 47 states have (on average 1.2340425531914894) internal successors, (58), 49 states have internal predecessors, (58), 23 states have call successors, (23), 8 states have call predecessors, (23), 7 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-28 11:20:09,179 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand has 78 states, 47 states have (on average 1.2340425531914894) internal successors, (58), 49 states have internal predecessors, (58), 23 states have call successors, (23), 8 states have call predecessors, (23), 7 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-28 11:20:09,180 INFO L87 Difference]: Start difference. First operand 78 states. Second operand has 78 states, 47 states have (on average 1.2340425531914894) internal successors, (58), 49 states have internal predecessors, (58), 23 states have call successors, (23), 8 states have call predecessors, (23), 7 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-28 11:20:09,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:20:09,182 INFO L93 Difference]: Finished difference Result 78 states and 102 transitions. [2022-04-28 11:20:09,182 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 102 transitions. [2022-04-28 11:20:09,182 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:20:09,182 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:20:09,183 INFO L74 IsIncluded]: Start isIncluded. First operand has 78 states, 47 states have (on average 1.2340425531914894) internal successors, (58), 49 states have internal predecessors, (58), 23 states have call successors, (23), 8 states have call predecessors, (23), 7 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) Second operand 78 states. [2022-04-28 11:20:09,183 INFO L87 Difference]: Start difference. First operand has 78 states, 47 states have (on average 1.2340425531914894) internal successors, (58), 49 states have internal predecessors, (58), 23 states have call successors, (23), 8 states have call predecessors, (23), 7 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) Second operand 78 states. [2022-04-28 11:20:09,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:20:09,185 INFO L93 Difference]: Finished difference Result 78 states and 102 transitions. [2022-04-28 11:20:09,185 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 102 transitions. [2022-04-28 11:20:09,186 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:20:09,186 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:20:09,186 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:20:09,186 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:20:09,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 47 states have (on average 1.2340425531914894) internal successors, (58), 49 states have internal predecessors, (58), 23 states have call successors, (23), 8 states have call predecessors, (23), 7 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-28 11:20:09,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 102 transitions. [2022-04-28 11:20:09,188 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 102 transitions. Word has length 34 [2022-04-28 11:20:09,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:20:09,188 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 102 transitions. [2022-04-28 11:20:09,189 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 11:20:09,189 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 78 states and 102 transitions. [2022-04-28 11:20:09,270 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:20:09,270 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 102 transitions. [2022-04-28 11:20:09,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-28 11:20:09,271 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:20:09,271 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:20:09,288 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-28 11:20:09,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:20:09,484 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:20:09,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:20:09,484 INFO L85 PathProgramCache]: Analyzing trace with hash 1813008070, now seen corresponding path program 1 times [2022-04-28 11:20:09,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:20:09,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [894924956] [2022-04-28 11:20:09,484 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 11:20:09,484 INFO L85 PathProgramCache]: Analyzing trace with hash 1813008070, now seen corresponding path program 2 times [2022-04-28 11:20:09,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:20:09,485 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329891862] [2022-04-28 11:20:09,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:20:09,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:20:09,494 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:20:09,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1556255241] [2022-04-28 11:20:09,495 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:20:09,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:20:09,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:20:09,499 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 11:20:09,499 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-28 11:20:09,538 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 11:20:09,538 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:20:09,539 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 11:20:09,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:20:09,550 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:20:09,696 INFO L272 TraceCheckUtils]: 0: Hoare triple {2548#true} call ULTIMATE.init(); {2548#true} is VALID [2022-04-28 11:20:09,696 INFO L290 TraceCheckUtils]: 1: Hoare triple {2548#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2548#true} is VALID [2022-04-28 11:20:09,696 INFO L290 TraceCheckUtils]: 2: Hoare triple {2548#true} assume true; {2548#true} is VALID [2022-04-28 11:20:09,696 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2548#true} {2548#true} #93#return; {2548#true} is VALID [2022-04-28 11:20:09,696 INFO L272 TraceCheckUtils]: 4: Hoare triple {2548#true} call #t~ret8 := main(); {2548#true} is VALID [2022-04-28 11:20:09,696 INFO L290 TraceCheckUtils]: 5: Hoare triple {2548#true} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {2548#true} is VALID [2022-04-28 11:20:09,696 INFO L272 TraceCheckUtils]: 6: Hoare triple {2548#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {2548#true} is VALID [2022-04-28 11:20:09,697 INFO L290 TraceCheckUtils]: 7: Hoare triple {2548#true} ~cond := #in~cond; {2574#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 11:20:09,697 INFO L290 TraceCheckUtils]: 8: Hoare triple {2574#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {2578#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 11:20:09,697 INFO L290 TraceCheckUtils]: 9: Hoare triple {2578#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {2578#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 11:20:09,698 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2578#(not (= |assume_abort_if_not_#in~cond| 0))} {2548#true} #77#return; {2585#(<= 1 main_~y~0)} is VALID [2022-04-28 11:20:09,698 INFO L290 TraceCheckUtils]: 11: Hoare triple {2585#(<= 1 main_~y~0)} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {2585#(<= 1 main_~y~0)} is VALID [2022-04-28 11:20:09,698 INFO L290 TraceCheckUtils]: 12: Hoare triple {2585#(<= 1 main_~y~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2585#(<= 1 main_~y~0)} is VALID [2022-04-28 11:20:09,699 INFO L290 TraceCheckUtils]: 13: Hoare triple {2585#(<= 1 main_~y~0)} assume !!(#t~post6 < 10);havoc #t~post6; {2585#(<= 1 main_~y~0)} is VALID [2022-04-28 11:20:09,699 INFO L272 TraceCheckUtils]: 14: Hoare triple {2585#(<= 1 main_~y~0)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {2548#true} is VALID [2022-04-28 11:20:09,699 INFO L290 TraceCheckUtils]: 15: Hoare triple {2548#true} ~cond := #in~cond; {2548#true} is VALID [2022-04-28 11:20:09,699 INFO L290 TraceCheckUtils]: 16: Hoare triple {2548#true} assume !(0 == ~cond); {2548#true} is VALID [2022-04-28 11:20:09,699 INFO L290 TraceCheckUtils]: 17: Hoare triple {2548#true} assume true; {2548#true} is VALID [2022-04-28 11:20:09,700 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {2548#true} {2585#(<= 1 main_~y~0)} #79#return; {2585#(<= 1 main_~y~0)} is VALID [2022-04-28 11:20:09,700 INFO L272 TraceCheckUtils]: 19: Hoare triple {2585#(<= 1 main_~y~0)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {2548#true} is VALID [2022-04-28 11:20:09,700 INFO L290 TraceCheckUtils]: 20: Hoare triple {2548#true} ~cond := #in~cond; {2548#true} is VALID [2022-04-28 11:20:09,700 INFO L290 TraceCheckUtils]: 21: Hoare triple {2548#true} assume !(0 == ~cond); {2548#true} is VALID [2022-04-28 11:20:09,700 INFO L290 TraceCheckUtils]: 22: Hoare triple {2548#true} assume true; {2548#true} is VALID [2022-04-28 11:20:09,700 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2548#true} {2585#(<= 1 main_~y~0)} #81#return; {2585#(<= 1 main_~y~0)} is VALID [2022-04-28 11:20:09,701 INFO L290 TraceCheckUtils]: 24: Hoare triple {2585#(<= 1 main_~y~0)} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {2628#(<= 1 main_~r~0)} is VALID [2022-04-28 11:20:09,701 INFO L290 TraceCheckUtils]: 25: Hoare triple {2628#(<= 1 main_~r~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {2628#(<= 1 main_~r~0)} is VALID [2022-04-28 11:20:09,701 INFO L290 TraceCheckUtils]: 26: Hoare triple {2628#(<= 1 main_~r~0)} assume !!(#t~post7 < 10);havoc #t~post7; {2628#(<= 1 main_~r~0)} is VALID [2022-04-28 11:20:09,702 INFO L272 TraceCheckUtils]: 27: Hoare triple {2628#(<= 1 main_~r~0)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {2548#true} is VALID [2022-04-28 11:20:09,702 INFO L290 TraceCheckUtils]: 28: Hoare triple {2548#true} ~cond := #in~cond; {2548#true} is VALID [2022-04-28 11:20:09,702 INFO L290 TraceCheckUtils]: 29: Hoare triple {2548#true} assume !(0 == ~cond); {2548#true} is VALID [2022-04-28 11:20:09,702 INFO L290 TraceCheckUtils]: 30: Hoare triple {2548#true} assume true; {2548#true} is VALID [2022-04-28 11:20:09,702 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {2548#true} {2628#(<= 1 main_~r~0)} #83#return; {2628#(<= 1 main_~r~0)} is VALID [2022-04-28 11:20:09,702 INFO L272 TraceCheckUtils]: 32: Hoare triple {2628#(<= 1 main_~r~0)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {2548#true} is VALID [2022-04-28 11:20:09,703 INFO L290 TraceCheckUtils]: 33: Hoare triple {2548#true} ~cond := #in~cond; {2548#true} is VALID [2022-04-28 11:20:09,703 INFO L290 TraceCheckUtils]: 34: Hoare triple {2548#true} assume !(0 == ~cond); {2548#true} is VALID [2022-04-28 11:20:09,703 INFO L290 TraceCheckUtils]: 35: Hoare triple {2548#true} assume true; {2548#true} is VALID [2022-04-28 11:20:09,703 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {2548#true} {2628#(<= 1 main_~r~0)} #85#return; {2628#(<= 1 main_~r~0)} is VALID [2022-04-28 11:20:09,704 INFO L272 TraceCheckUtils]: 37: Hoare triple {2628#(<= 1 main_~r~0)} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {2668#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:20:09,704 INFO L290 TraceCheckUtils]: 38: Hoare triple {2668#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2672#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:20:09,705 INFO L290 TraceCheckUtils]: 39: Hoare triple {2672#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2549#false} is VALID [2022-04-28 11:20:09,705 INFO L290 TraceCheckUtils]: 40: Hoare triple {2549#false} assume !false; {2549#false} is VALID [2022-04-28 11:20:09,705 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-28 11:20:09,705 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 11:20:09,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:20:09,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329891862] [2022-04-28 11:20:09,705 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:20:09,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1556255241] [2022-04-28 11:20:09,705 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1556255241] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:20:09,705 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:20:09,706 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 11:20:09,706 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:20:09,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [894924956] [2022-04-28 11:20:09,706 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [894924956] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:20:09,706 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:20:09,706 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 11:20:09,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926357204] [2022-04-28 11:20:09,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:20:09,706 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 41 [2022-04-28 11:20:09,707 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:20:09,707 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-28 11:20:09,729 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:20:09,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 11:20:09,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:20:09,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 11:20:09,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-04-28 11:20:09,730 INFO L87 Difference]: Start difference. First operand 78 states and 102 transitions. Second operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-28 11:20:10,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:20:10,013 INFO L93 Difference]: Finished difference Result 84 states and 107 transitions. [2022-04-28 11:20:10,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 11:20:10,013 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 41 [2022-04-28 11:20:10,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:20:10,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-28 11:20:10,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 47 transitions. [2022-04-28 11:20:10,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-28 11:20:10,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 47 transitions. [2022-04-28 11:20:10,015 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 47 transitions. [2022-04-28 11:20:10,046 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:20:10,048 INFO L225 Difference]: With dead ends: 84 [2022-04-28 11:20:10,048 INFO L226 Difference]: Without dead ends: 82 [2022-04-28 11:20:10,048 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-04-28 11:20:10,049 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 20 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 11:20:10,049 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 167 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 11:20:10,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-04-28 11:20:10,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2022-04-28 11:20:10,117 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:20:10,117 INFO L82 GeneralOperation]: Start isEquivalent. First operand 82 states. Second operand has 82 states, 50 states have (on average 1.22) internal successors, (61), 52 states have internal predecessors, (61), 23 states have call successors, (23), 9 states have call predecessors, (23), 8 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-28 11:20:10,117 INFO L74 IsIncluded]: Start isIncluded. First operand 82 states. Second operand has 82 states, 50 states have (on average 1.22) internal successors, (61), 52 states have internal predecessors, (61), 23 states have call successors, (23), 9 states have call predecessors, (23), 8 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-28 11:20:10,118 INFO L87 Difference]: Start difference. First operand 82 states. Second operand has 82 states, 50 states have (on average 1.22) internal successors, (61), 52 states have internal predecessors, (61), 23 states have call successors, (23), 9 states have call predecessors, (23), 8 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-28 11:20:10,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:20:10,120 INFO L93 Difference]: Finished difference Result 82 states and 105 transitions. [2022-04-28 11:20:10,120 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 105 transitions. [2022-04-28 11:20:10,120 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:20:10,120 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:20:10,120 INFO L74 IsIncluded]: Start isIncluded. First operand has 82 states, 50 states have (on average 1.22) internal successors, (61), 52 states have internal predecessors, (61), 23 states have call successors, (23), 9 states have call predecessors, (23), 8 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) Second operand 82 states. [2022-04-28 11:20:10,121 INFO L87 Difference]: Start difference. First operand has 82 states, 50 states have (on average 1.22) internal successors, (61), 52 states have internal predecessors, (61), 23 states have call successors, (23), 9 states have call predecessors, (23), 8 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) Second operand 82 states. [2022-04-28 11:20:10,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:20:10,123 INFO L93 Difference]: Finished difference Result 82 states and 105 transitions. [2022-04-28 11:20:10,123 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 105 transitions. [2022-04-28 11:20:10,124 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:20:10,124 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:20:10,124 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:20:10,124 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:20:10,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 50 states have (on average 1.22) internal successors, (61), 52 states have internal predecessors, (61), 23 states have call successors, (23), 9 states have call predecessors, (23), 8 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-28 11:20:10,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 105 transitions. [2022-04-28 11:20:10,127 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 105 transitions. Word has length 41 [2022-04-28 11:20:10,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:20:10,127 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 105 transitions. [2022-04-28 11:20:10,128 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-28 11:20:10,128 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 82 states and 105 transitions. [2022-04-28 11:20:10,212 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:20:10,212 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 105 transitions. [2022-04-28 11:20:10,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-28 11:20:10,213 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:20:10,213 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:20:10,231 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-28 11:20:10,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:20:10,413 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:20:10,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:20:10,414 INFO L85 PathProgramCache]: Analyzing trace with hash -683043127, now seen corresponding path program 1 times [2022-04-28 11:20:10,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:20:10,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [606349004] [2022-04-28 11:20:10,414 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 11:20:10,414 INFO L85 PathProgramCache]: Analyzing trace with hash -683043127, now seen corresponding path program 2 times [2022-04-28 11:20:10,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:20:10,415 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525798746] [2022-04-28 11:20:10,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:20:10,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:20:10,428 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:20:10,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2044641405] [2022-04-28 11:20:10,428 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:20:10,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:20:10,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:20:10,434 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 11:20:10,435 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-28 11:20:10,472 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 11:20:10,472 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:20:10,472 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 11:20:10,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:20:10,487 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:20:10,670 INFO L272 TraceCheckUtils]: 0: Hoare triple {3180#true} call ULTIMATE.init(); {3180#true} is VALID [2022-04-28 11:20:10,670 INFO L290 TraceCheckUtils]: 1: Hoare triple {3180#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {3180#true} is VALID [2022-04-28 11:20:10,670 INFO L290 TraceCheckUtils]: 2: Hoare triple {3180#true} assume true; {3180#true} is VALID [2022-04-28 11:20:10,670 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3180#true} {3180#true} #93#return; {3180#true} is VALID [2022-04-28 11:20:10,670 INFO L272 TraceCheckUtils]: 4: Hoare triple {3180#true} call #t~ret8 := main(); {3180#true} is VALID [2022-04-28 11:20:10,670 INFO L290 TraceCheckUtils]: 5: Hoare triple {3180#true} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {3180#true} is VALID [2022-04-28 11:20:10,670 INFO L272 TraceCheckUtils]: 6: Hoare triple {3180#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {3180#true} is VALID [2022-04-28 11:20:10,671 INFO L290 TraceCheckUtils]: 7: Hoare triple {3180#true} ~cond := #in~cond; {3180#true} is VALID [2022-04-28 11:20:10,671 INFO L290 TraceCheckUtils]: 8: Hoare triple {3180#true} assume !(0 == ~cond); {3180#true} is VALID [2022-04-28 11:20:10,671 INFO L290 TraceCheckUtils]: 9: Hoare triple {3180#true} assume true; {3180#true} is VALID [2022-04-28 11:20:10,671 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3180#true} {3180#true} #77#return; {3180#true} is VALID [2022-04-28 11:20:10,671 INFO L290 TraceCheckUtils]: 11: Hoare triple {3180#true} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {3180#true} is VALID [2022-04-28 11:20:10,671 INFO L290 TraceCheckUtils]: 12: Hoare triple {3180#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3180#true} is VALID [2022-04-28 11:20:10,671 INFO L290 TraceCheckUtils]: 13: Hoare triple {3180#true} assume !!(#t~post6 < 10);havoc #t~post6; {3180#true} is VALID [2022-04-28 11:20:10,671 INFO L272 TraceCheckUtils]: 14: Hoare triple {3180#true} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {3180#true} is VALID [2022-04-28 11:20:10,671 INFO L290 TraceCheckUtils]: 15: Hoare triple {3180#true} ~cond := #in~cond; {3180#true} is VALID [2022-04-28 11:20:10,671 INFO L290 TraceCheckUtils]: 16: Hoare triple {3180#true} assume !(0 == ~cond); {3180#true} is VALID [2022-04-28 11:20:10,671 INFO L290 TraceCheckUtils]: 17: Hoare triple {3180#true} assume true; {3180#true} is VALID [2022-04-28 11:20:10,672 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {3180#true} {3180#true} #79#return; {3180#true} is VALID [2022-04-28 11:20:10,672 INFO L272 TraceCheckUtils]: 19: Hoare triple {3180#true} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {3180#true} is VALID [2022-04-28 11:20:10,672 INFO L290 TraceCheckUtils]: 20: Hoare triple {3180#true} ~cond := #in~cond; {3180#true} is VALID [2022-04-28 11:20:10,672 INFO L290 TraceCheckUtils]: 21: Hoare triple {3180#true} assume !(0 == ~cond); {3180#true} is VALID [2022-04-28 11:20:10,672 INFO L290 TraceCheckUtils]: 22: Hoare triple {3180#true} assume true; {3180#true} is VALID [2022-04-28 11:20:10,672 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {3180#true} {3180#true} #81#return; {3180#true} is VALID [2022-04-28 11:20:10,672 INFO L290 TraceCheckUtils]: 24: Hoare triple {3180#true} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {3180#true} is VALID [2022-04-28 11:20:10,672 INFO L290 TraceCheckUtils]: 25: Hoare triple {3180#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {3180#true} is VALID [2022-04-28 11:20:10,672 INFO L290 TraceCheckUtils]: 26: Hoare triple {3180#true} assume !!(#t~post7 < 10);havoc #t~post7; {3180#true} is VALID [2022-04-28 11:20:10,672 INFO L272 TraceCheckUtils]: 27: Hoare triple {3180#true} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {3180#true} is VALID [2022-04-28 11:20:10,674 INFO L290 TraceCheckUtils]: 28: Hoare triple {3180#true} ~cond := #in~cond; {3269#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:20:10,674 INFO L290 TraceCheckUtils]: 29: Hoare triple {3269#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {3273#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:20:10,675 INFO L290 TraceCheckUtils]: 30: Hoare triple {3273#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3273#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:20:10,675 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {3273#(not (= |__VERIFIER_assert_#in~cond| 0))} {3180#true} #83#return; {3280#(= main_~b~0 (* main_~a~0 main_~y~0))} is VALID [2022-04-28 11:20:10,675 INFO L272 TraceCheckUtils]: 32: Hoare triple {3280#(= main_~b~0 (* main_~a~0 main_~y~0))} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {3180#true} is VALID [2022-04-28 11:20:10,676 INFO L290 TraceCheckUtils]: 33: Hoare triple {3180#true} ~cond := #in~cond; {3180#true} is VALID [2022-04-28 11:20:10,676 INFO L290 TraceCheckUtils]: 34: Hoare triple {3180#true} assume !(0 == ~cond); {3180#true} is VALID [2022-04-28 11:20:10,676 INFO L290 TraceCheckUtils]: 35: Hoare triple {3180#true} assume true; {3180#true} is VALID [2022-04-28 11:20:10,676 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {3180#true} {3280#(= main_~b~0 (* main_~a~0 main_~y~0))} #85#return; {3280#(= main_~b~0 (* main_~a~0 main_~y~0))} is VALID [2022-04-28 11:20:10,676 INFO L272 TraceCheckUtils]: 37: Hoare triple {3280#(= main_~b~0 (* main_~a~0 main_~y~0))} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {3180#true} is VALID [2022-04-28 11:20:10,676 INFO L290 TraceCheckUtils]: 38: Hoare triple {3180#true} ~cond := #in~cond; {3180#true} is VALID [2022-04-28 11:20:10,677 INFO L290 TraceCheckUtils]: 39: Hoare triple {3180#true} assume !(0 == ~cond); {3180#true} is VALID [2022-04-28 11:20:10,677 INFO L290 TraceCheckUtils]: 40: Hoare triple {3180#true} assume true; {3180#true} is VALID [2022-04-28 11:20:10,677 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {3180#true} {3280#(= main_~b~0 (* main_~a~0 main_~y~0))} #87#return; {3280#(= main_~b~0 (* main_~a~0 main_~y~0))} is VALID [2022-04-28 11:20:10,678 INFO L290 TraceCheckUtils]: 42: Hoare triple {3280#(= main_~b~0 (* main_~a~0 main_~y~0))} assume !!(~r~0 >= 2 * ~b~0); {3314#(<= (* 2 (* main_~a~0 main_~y~0)) main_~r~0)} is VALID [2022-04-28 11:20:10,678 INFO L272 TraceCheckUtils]: 43: Hoare triple {3314#(<= (* 2 (* main_~a~0 main_~y~0)) main_~r~0)} call __VERIFIER_assert((if ~r~0 >= 2 * ~y~0 * ~a~0 then 1 else 0)); {3318#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:20:10,679 INFO L290 TraceCheckUtils]: 44: Hoare triple {3318#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3322#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:20:10,679 INFO L290 TraceCheckUtils]: 45: Hoare triple {3322#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3181#false} is VALID [2022-04-28 11:20:10,679 INFO L290 TraceCheckUtils]: 46: Hoare triple {3181#false} assume !false; {3181#false} is VALID [2022-04-28 11:20:10,679 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 15 proven. 7 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-28 11:20:10,679 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:20:17,596 INFO L290 TraceCheckUtils]: 46: Hoare triple {3181#false} assume !false; {3181#false} is VALID [2022-04-28 11:20:17,596 INFO L290 TraceCheckUtils]: 45: Hoare triple {3322#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3181#false} is VALID [2022-04-28 11:20:17,597 INFO L290 TraceCheckUtils]: 44: Hoare triple {3318#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3322#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:20:17,597 INFO L272 TraceCheckUtils]: 43: Hoare triple {3314#(<= (* 2 (* main_~a~0 main_~y~0)) main_~r~0)} call __VERIFIER_assert((if ~r~0 >= 2 * ~y~0 * ~a~0 then 1 else 0)); {3318#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:20:17,598 INFO L290 TraceCheckUtils]: 42: Hoare triple {3341#(<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))} assume !!(~r~0 >= 2 * ~b~0); {3314#(<= (* 2 (* main_~a~0 main_~y~0)) main_~r~0)} is VALID [2022-04-28 11:20:17,598 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {3180#true} {3341#(<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))} #87#return; {3341#(<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))} is VALID [2022-04-28 11:20:17,599 INFO L290 TraceCheckUtils]: 40: Hoare triple {3180#true} assume true; {3180#true} is VALID [2022-04-28 11:20:17,599 INFO L290 TraceCheckUtils]: 39: Hoare triple {3180#true} assume !(0 == ~cond); {3180#true} is VALID [2022-04-28 11:20:17,599 INFO L290 TraceCheckUtils]: 38: Hoare triple {3180#true} ~cond := #in~cond; {3180#true} is VALID [2022-04-28 11:20:17,599 INFO L272 TraceCheckUtils]: 37: Hoare triple {3341#(<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {3180#true} is VALID [2022-04-28 11:20:17,599 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {3180#true} {3341#(<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))} #85#return; {3341#(<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))} is VALID [2022-04-28 11:20:17,600 INFO L290 TraceCheckUtils]: 35: Hoare triple {3180#true} assume true; {3180#true} is VALID [2022-04-28 11:20:17,600 INFO L290 TraceCheckUtils]: 34: Hoare triple {3180#true} assume !(0 == ~cond); {3180#true} is VALID [2022-04-28 11:20:17,600 INFO L290 TraceCheckUtils]: 33: Hoare triple {3180#true} ~cond := #in~cond; {3180#true} is VALID [2022-04-28 11:20:17,600 INFO L272 TraceCheckUtils]: 32: Hoare triple {3341#(<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {3180#true} is VALID [2022-04-28 11:20:17,600 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {3273#(not (= |__VERIFIER_assert_#in~cond| 0))} {3180#true} #83#return; {3341#(<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))} is VALID [2022-04-28 11:20:17,601 INFO L290 TraceCheckUtils]: 30: Hoare triple {3273#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3273#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:20:17,601 INFO L290 TraceCheckUtils]: 29: Hoare triple {3384#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {3273#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:20:17,602 INFO L290 TraceCheckUtils]: 28: Hoare triple {3180#true} ~cond := #in~cond; {3384#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 11:20:17,602 INFO L272 TraceCheckUtils]: 27: Hoare triple {3180#true} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {3180#true} is VALID [2022-04-28 11:20:17,602 INFO L290 TraceCheckUtils]: 26: Hoare triple {3180#true} assume !!(#t~post7 < 10);havoc #t~post7; {3180#true} is VALID [2022-04-28 11:20:17,602 INFO L290 TraceCheckUtils]: 25: Hoare triple {3180#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {3180#true} is VALID [2022-04-28 11:20:17,602 INFO L290 TraceCheckUtils]: 24: Hoare triple {3180#true} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {3180#true} is VALID [2022-04-28 11:20:17,602 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {3180#true} {3180#true} #81#return; {3180#true} is VALID [2022-04-28 11:20:17,602 INFO L290 TraceCheckUtils]: 22: Hoare triple {3180#true} assume true; {3180#true} is VALID [2022-04-28 11:20:17,602 INFO L290 TraceCheckUtils]: 21: Hoare triple {3180#true} assume !(0 == ~cond); {3180#true} is VALID [2022-04-28 11:20:17,602 INFO L290 TraceCheckUtils]: 20: Hoare triple {3180#true} ~cond := #in~cond; {3180#true} is VALID [2022-04-28 11:20:17,602 INFO L272 TraceCheckUtils]: 19: Hoare triple {3180#true} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {3180#true} is VALID [2022-04-28 11:20:17,602 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {3180#true} {3180#true} #79#return; {3180#true} is VALID [2022-04-28 11:20:17,603 INFO L290 TraceCheckUtils]: 17: Hoare triple {3180#true} assume true; {3180#true} is VALID [2022-04-28 11:20:17,603 INFO L290 TraceCheckUtils]: 16: Hoare triple {3180#true} assume !(0 == ~cond); {3180#true} is VALID [2022-04-28 11:20:17,603 INFO L290 TraceCheckUtils]: 15: Hoare triple {3180#true} ~cond := #in~cond; {3180#true} is VALID [2022-04-28 11:20:17,603 INFO L272 TraceCheckUtils]: 14: Hoare triple {3180#true} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {3180#true} is VALID [2022-04-28 11:20:17,603 INFO L290 TraceCheckUtils]: 13: Hoare triple {3180#true} assume !!(#t~post6 < 10);havoc #t~post6; {3180#true} is VALID [2022-04-28 11:20:17,603 INFO L290 TraceCheckUtils]: 12: Hoare triple {3180#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3180#true} is VALID [2022-04-28 11:20:17,603 INFO L290 TraceCheckUtils]: 11: Hoare triple {3180#true} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {3180#true} is VALID [2022-04-28 11:20:17,603 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3180#true} {3180#true} #77#return; {3180#true} is VALID [2022-04-28 11:20:17,603 INFO L290 TraceCheckUtils]: 9: Hoare triple {3180#true} assume true; {3180#true} is VALID [2022-04-28 11:20:17,603 INFO L290 TraceCheckUtils]: 8: Hoare triple {3180#true} assume !(0 == ~cond); {3180#true} is VALID [2022-04-28 11:20:17,603 INFO L290 TraceCheckUtils]: 7: Hoare triple {3180#true} ~cond := #in~cond; {3180#true} is VALID [2022-04-28 11:20:17,603 INFO L272 TraceCheckUtils]: 6: Hoare triple {3180#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {3180#true} is VALID [2022-04-28 11:20:17,604 INFO L290 TraceCheckUtils]: 5: Hoare triple {3180#true} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {3180#true} is VALID [2022-04-28 11:20:17,604 INFO L272 TraceCheckUtils]: 4: Hoare triple {3180#true} call #t~ret8 := main(); {3180#true} is VALID [2022-04-28 11:20:17,604 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3180#true} {3180#true} #93#return; {3180#true} is VALID [2022-04-28 11:20:17,604 INFO L290 TraceCheckUtils]: 2: Hoare triple {3180#true} assume true; {3180#true} is VALID [2022-04-28 11:20:17,604 INFO L290 TraceCheckUtils]: 1: Hoare triple {3180#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {3180#true} is VALID [2022-04-28 11:20:17,604 INFO L272 TraceCheckUtils]: 0: Hoare triple {3180#true} call ULTIMATE.init(); {3180#true} is VALID [2022-04-28 11:20:17,604 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 15 proven. 7 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-28 11:20:17,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:20:17,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525798746] [2022-04-28 11:20:17,605 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:20:17,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2044641405] [2022-04-28 11:20:17,605 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2044641405] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 11:20:17,605 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 11:20:17,605 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2022-04-28 11:20:17,605 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:20:17,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [606349004] [2022-04-28 11:20:17,605 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [606349004] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:20:17,605 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:20:17,605 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 11:20:17,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585856573] [2022-04-28 11:20:17,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:20:17,606 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 47 [2022-04-28 11:20:17,606 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:20:17,606 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-28 11:20:17,633 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:20:17,633 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 11:20:17,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:20:17,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 11:20:17,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-04-28 11:20:17,634 INFO L87 Difference]: Start difference. First operand 82 states and 105 transitions. Second operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-28 11:20:17,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:20:17,947 INFO L93 Difference]: Finished difference Result 88 states and 110 transitions. [2022-04-28 11:20:17,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 11:20:17,947 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 47 [2022-04-28 11:20:17,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:20:17,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-28 11:20:17,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 47 transitions. [2022-04-28 11:20:17,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-28 11:20:17,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 47 transitions. [2022-04-28 11:20:17,949 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 47 transitions. [2022-04-28 11:20:17,988 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:20:17,990 INFO L225 Difference]: With dead ends: 88 [2022-04-28 11:20:17,990 INFO L226 Difference]: Without dead ends: 86 [2022-04-28 11:20:17,990 INFO L412 NwaCegarLoop]: 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-28 11:20:17,991 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 22 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 11:20:17,991 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 115 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 11:20:17,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-04-28 11:20:18,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2022-04-28 11:20:18,056 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:20:18,056 INFO L82 GeneralOperation]: Start isEquivalent. First operand 86 states. Second operand has 86 states, 53 states have (on average 1.2075471698113207) internal successors, (64), 55 states have internal predecessors, (64), 23 states have call successors, (23), 10 states have call predecessors, (23), 9 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-28 11:20:18,057 INFO L74 IsIncluded]: Start isIncluded. First operand 86 states. Second operand has 86 states, 53 states have (on average 1.2075471698113207) internal successors, (64), 55 states have internal predecessors, (64), 23 states have call successors, (23), 10 states have call predecessors, (23), 9 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-28 11:20:18,057 INFO L87 Difference]: Start difference. First operand 86 states. Second operand has 86 states, 53 states have (on average 1.2075471698113207) internal successors, (64), 55 states have internal predecessors, (64), 23 states have call successors, (23), 10 states have call predecessors, (23), 9 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-28 11:20:18,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:20:18,059 INFO L93 Difference]: Finished difference Result 86 states and 108 transitions. [2022-04-28 11:20:18,059 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 108 transitions. [2022-04-28 11:20:18,060 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:20:18,060 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:20:18,060 INFO L74 IsIncluded]: Start isIncluded. First operand has 86 states, 53 states have (on average 1.2075471698113207) internal successors, (64), 55 states have internal predecessors, (64), 23 states have call successors, (23), 10 states have call predecessors, (23), 9 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) Second operand 86 states. [2022-04-28 11:20:18,060 INFO L87 Difference]: Start difference. First operand has 86 states, 53 states have (on average 1.2075471698113207) internal successors, (64), 55 states have internal predecessors, (64), 23 states have call successors, (23), 10 states have call predecessors, (23), 9 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) Second operand 86 states. [2022-04-28 11:20:18,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:20:18,062 INFO L93 Difference]: Finished difference Result 86 states and 108 transitions. [2022-04-28 11:20:18,062 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 108 transitions. [2022-04-28 11:20:18,063 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:20:18,063 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:20:18,063 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:20:18,063 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:20:18,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 53 states have (on average 1.2075471698113207) internal successors, (64), 55 states have internal predecessors, (64), 23 states have call successors, (23), 10 states have call predecessors, (23), 9 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-28 11:20:18,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 108 transitions. [2022-04-28 11:20:18,065 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 108 transitions. Word has length 47 [2022-04-28 11:20:18,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:20:18,065 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 108 transitions. [2022-04-28 11:20:18,065 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-28 11:20:18,065 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 86 states and 108 transitions. [2022-04-28 11:20:18,152 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:20:18,153 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 108 transitions. [2022-04-28 11:20:18,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-28 11:20:18,153 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:20:18,153 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:20:18,169 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-28 11:20:18,369 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:20:18,369 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:20:18,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:20:18,370 INFO L85 PathProgramCache]: Analyzing trace with hash -589126939, now seen corresponding path program 1 times [2022-04-28 11:20:18,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:20:18,370 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2040818560] [2022-04-28 11:20:30,877 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:20:30,877 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:20:30,877 INFO L85 PathProgramCache]: Analyzing trace with hash -589126939, now seen corresponding path program 2 times [2022-04-28 11:20:30,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:20:30,878 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388197990] [2022-04-28 11:20:30,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:20:30,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:20:30,887 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:20:30,887 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [756487922] [2022-04-28 11:20:30,888 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:20:30,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:20:30,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:20:30,895 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 11:20:30,896 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-28 11:20:30,933 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 11:20:30,933 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:20:30,934 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 11:20:30,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:20:30,944 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:20:31,145 INFO L272 TraceCheckUtils]: 0: Hoare triple {3997#true} call ULTIMATE.init(); {3997#true} is VALID [2022-04-28 11:20:31,146 INFO L290 TraceCheckUtils]: 1: Hoare triple {3997#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {4005#(<= ~counter~0 0)} is VALID [2022-04-28 11:20:31,146 INFO L290 TraceCheckUtils]: 2: Hoare triple {4005#(<= ~counter~0 0)} assume true; {4005#(<= ~counter~0 0)} is VALID [2022-04-28 11:20:31,147 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4005#(<= ~counter~0 0)} {3997#true} #93#return; {4005#(<= ~counter~0 0)} is VALID [2022-04-28 11:20:31,147 INFO L272 TraceCheckUtils]: 4: Hoare triple {4005#(<= ~counter~0 0)} call #t~ret8 := main(); {4005#(<= ~counter~0 0)} is VALID [2022-04-28 11:20:31,147 INFO L290 TraceCheckUtils]: 5: Hoare triple {4005#(<= ~counter~0 0)} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {4005#(<= ~counter~0 0)} is VALID [2022-04-28 11:20:31,148 INFO L272 TraceCheckUtils]: 6: Hoare triple {4005#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {4005#(<= ~counter~0 0)} is VALID [2022-04-28 11:20:31,148 INFO L290 TraceCheckUtils]: 7: Hoare triple {4005#(<= ~counter~0 0)} ~cond := #in~cond; {4005#(<= ~counter~0 0)} is VALID [2022-04-28 11:20:31,148 INFO L290 TraceCheckUtils]: 8: Hoare triple {4005#(<= ~counter~0 0)} assume !(0 == ~cond); {4005#(<= ~counter~0 0)} is VALID [2022-04-28 11:20:31,148 INFO L290 TraceCheckUtils]: 9: Hoare triple {4005#(<= ~counter~0 0)} assume true; {4005#(<= ~counter~0 0)} is VALID [2022-04-28 11:20:31,149 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4005#(<= ~counter~0 0)} {4005#(<= ~counter~0 0)} #77#return; {4005#(<= ~counter~0 0)} is VALID [2022-04-28 11:20:31,149 INFO L290 TraceCheckUtils]: 11: Hoare triple {4005#(<= ~counter~0 0)} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {4005#(<= ~counter~0 0)} is VALID [2022-04-28 11:20:31,150 INFO L290 TraceCheckUtils]: 12: Hoare triple {4005#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4039#(<= ~counter~0 1)} is VALID [2022-04-28 11:20:31,150 INFO L290 TraceCheckUtils]: 13: Hoare triple {4039#(<= ~counter~0 1)} assume !!(#t~post6 < 10);havoc #t~post6; {4039#(<= ~counter~0 1)} is VALID [2022-04-28 11:20:31,150 INFO L272 TraceCheckUtils]: 14: Hoare triple {4039#(<= ~counter~0 1)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {4039#(<= ~counter~0 1)} is VALID [2022-04-28 11:20:31,151 INFO L290 TraceCheckUtils]: 15: Hoare triple {4039#(<= ~counter~0 1)} ~cond := #in~cond; {4039#(<= ~counter~0 1)} is VALID [2022-04-28 11:20:31,151 INFO L290 TraceCheckUtils]: 16: Hoare triple {4039#(<= ~counter~0 1)} assume !(0 == ~cond); {4039#(<= ~counter~0 1)} is VALID [2022-04-28 11:20:31,151 INFO L290 TraceCheckUtils]: 17: Hoare triple {4039#(<= ~counter~0 1)} assume true; {4039#(<= ~counter~0 1)} is VALID [2022-04-28 11:20:31,152 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {4039#(<= ~counter~0 1)} {4039#(<= ~counter~0 1)} #79#return; {4039#(<= ~counter~0 1)} is VALID [2022-04-28 11:20:31,152 INFO L272 TraceCheckUtils]: 19: Hoare triple {4039#(<= ~counter~0 1)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {4039#(<= ~counter~0 1)} is VALID [2022-04-28 11:20:31,152 INFO L290 TraceCheckUtils]: 20: Hoare triple {4039#(<= ~counter~0 1)} ~cond := #in~cond; {4039#(<= ~counter~0 1)} is VALID [2022-04-28 11:20:31,153 INFO L290 TraceCheckUtils]: 21: Hoare triple {4039#(<= ~counter~0 1)} assume !(0 == ~cond); {4039#(<= ~counter~0 1)} is VALID [2022-04-28 11:20:31,153 INFO L290 TraceCheckUtils]: 22: Hoare triple {4039#(<= ~counter~0 1)} assume true; {4039#(<= ~counter~0 1)} is VALID [2022-04-28 11:20:31,153 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {4039#(<= ~counter~0 1)} {4039#(<= ~counter~0 1)} #81#return; {4039#(<= ~counter~0 1)} is VALID [2022-04-28 11:20:31,154 INFO L290 TraceCheckUtils]: 24: Hoare triple {4039#(<= ~counter~0 1)} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {4039#(<= ~counter~0 1)} is VALID [2022-04-28 11:20:31,154 INFO L290 TraceCheckUtils]: 25: Hoare triple {4039#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {4079#(<= ~counter~0 2)} is VALID [2022-04-28 11:20:31,154 INFO L290 TraceCheckUtils]: 26: Hoare triple {4079#(<= ~counter~0 2)} assume !!(#t~post7 < 10);havoc #t~post7; {4079#(<= ~counter~0 2)} is VALID [2022-04-28 11:20:31,155 INFO L272 TraceCheckUtils]: 27: Hoare triple {4079#(<= ~counter~0 2)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {4079#(<= ~counter~0 2)} is VALID [2022-04-28 11:20:31,155 INFO L290 TraceCheckUtils]: 28: Hoare triple {4079#(<= ~counter~0 2)} ~cond := #in~cond; {4079#(<= ~counter~0 2)} is VALID [2022-04-28 11:20:31,155 INFO L290 TraceCheckUtils]: 29: Hoare triple {4079#(<= ~counter~0 2)} assume !(0 == ~cond); {4079#(<= ~counter~0 2)} is VALID [2022-04-28 11:20:31,156 INFO L290 TraceCheckUtils]: 30: Hoare triple {4079#(<= ~counter~0 2)} assume true; {4079#(<= ~counter~0 2)} is VALID [2022-04-28 11:20:31,156 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {4079#(<= ~counter~0 2)} {4079#(<= ~counter~0 2)} #83#return; {4079#(<= ~counter~0 2)} is VALID [2022-04-28 11:20:31,157 INFO L272 TraceCheckUtils]: 32: Hoare triple {4079#(<= ~counter~0 2)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {4079#(<= ~counter~0 2)} is VALID [2022-04-28 11:20:31,157 INFO L290 TraceCheckUtils]: 33: Hoare triple {4079#(<= ~counter~0 2)} ~cond := #in~cond; {4079#(<= ~counter~0 2)} is VALID [2022-04-28 11:20:31,157 INFO L290 TraceCheckUtils]: 34: Hoare triple {4079#(<= ~counter~0 2)} assume !(0 == ~cond); {4079#(<= ~counter~0 2)} is VALID [2022-04-28 11:20:31,157 INFO L290 TraceCheckUtils]: 35: Hoare triple {4079#(<= ~counter~0 2)} assume true; {4079#(<= ~counter~0 2)} is VALID [2022-04-28 11:20:31,158 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {4079#(<= ~counter~0 2)} {4079#(<= ~counter~0 2)} #85#return; {4079#(<= ~counter~0 2)} is VALID [2022-04-28 11:20:31,158 INFO L272 TraceCheckUtils]: 37: Hoare triple {4079#(<= ~counter~0 2)} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {4079#(<= ~counter~0 2)} is VALID [2022-04-28 11:20:31,159 INFO L290 TraceCheckUtils]: 38: Hoare triple {4079#(<= ~counter~0 2)} ~cond := #in~cond; {4079#(<= ~counter~0 2)} is VALID [2022-04-28 11:20:31,159 INFO L290 TraceCheckUtils]: 39: Hoare triple {4079#(<= ~counter~0 2)} assume !(0 == ~cond); {4079#(<= ~counter~0 2)} is VALID [2022-04-28 11:20:31,159 INFO L290 TraceCheckUtils]: 40: Hoare triple {4079#(<= ~counter~0 2)} assume true; {4079#(<= ~counter~0 2)} is VALID [2022-04-28 11:20:31,159 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {4079#(<= ~counter~0 2)} {4079#(<= ~counter~0 2)} #87#return; {4079#(<= ~counter~0 2)} is VALID [2022-04-28 11:20:31,160 INFO L290 TraceCheckUtils]: 42: Hoare triple {4079#(<= ~counter~0 2)} assume !(~r~0 >= 2 * ~b~0); {4079#(<= ~counter~0 2)} is VALID [2022-04-28 11:20:31,160 INFO L290 TraceCheckUtils]: 43: Hoare triple {4079#(<= ~counter~0 2)} ~r~0 := ~r~0 - ~b~0;~q~0 := ~q~0 + ~a~0; {4079#(<= ~counter~0 2)} is VALID [2022-04-28 11:20:31,160 INFO L290 TraceCheckUtils]: 44: Hoare triple {4079#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4137#(<= |main_#t~post6| 2)} is VALID [2022-04-28 11:20:31,161 INFO L290 TraceCheckUtils]: 45: Hoare triple {4137#(<= |main_#t~post6| 2)} assume !(#t~post6 < 10);havoc #t~post6; {3998#false} is VALID [2022-04-28 11:20:31,161 INFO L272 TraceCheckUtils]: 46: Hoare triple {3998#false} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {3998#false} is VALID [2022-04-28 11:20:31,161 INFO L290 TraceCheckUtils]: 47: Hoare triple {3998#false} ~cond := #in~cond; {3998#false} is VALID [2022-04-28 11:20:31,161 INFO L290 TraceCheckUtils]: 48: Hoare triple {3998#false} assume 0 == ~cond; {3998#false} is VALID [2022-04-28 11:20:31,161 INFO L290 TraceCheckUtils]: 49: Hoare triple {3998#false} assume !false; {3998#false} is VALID [2022-04-28 11:20:31,161 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 10 proven. 26 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-28 11:20:31,161 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:20:31,383 INFO L290 TraceCheckUtils]: 49: Hoare triple {3998#false} assume !false; {3998#false} is VALID [2022-04-28 11:20:31,383 INFO L290 TraceCheckUtils]: 48: Hoare triple {3998#false} assume 0 == ~cond; {3998#false} is VALID [2022-04-28 11:20:31,383 INFO L290 TraceCheckUtils]: 47: Hoare triple {3998#false} ~cond := #in~cond; {3998#false} is VALID [2022-04-28 11:20:31,383 INFO L272 TraceCheckUtils]: 46: Hoare triple {3998#false} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {3998#false} is VALID [2022-04-28 11:20:31,384 INFO L290 TraceCheckUtils]: 45: Hoare triple {4165#(< |main_#t~post6| 10)} assume !(#t~post6 < 10);havoc #t~post6; {3998#false} is VALID [2022-04-28 11:20:31,384 INFO L290 TraceCheckUtils]: 44: Hoare triple {4169#(< ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4165#(< |main_#t~post6| 10)} is VALID [2022-04-28 11:20:31,384 INFO L290 TraceCheckUtils]: 43: Hoare triple {4169#(< ~counter~0 10)} ~r~0 := ~r~0 - ~b~0;~q~0 := ~q~0 + ~a~0; {4169#(< ~counter~0 10)} is VALID [2022-04-28 11:20:31,385 INFO L290 TraceCheckUtils]: 42: Hoare triple {4169#(< ~counter~0 10)} assume !(~r~0 >= 2 * ~b~0); {4169#(< ~counter~0 10)} is VALID [2022-04-28 11:20:31,385 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {3997#true} {4169#(< ~counter~0 10)} #87#return; {4169#(< ~counter~0 10)} is VALID [2022-04-28 11:20:31,385 INFO L290 TraceCheckUtils]: 40: Hoare triple {3997#true} assume true; {3997#true} is VALID [2022-04-28 11:20:31,385 INFO L290 TraceCheckUtils]: 39: Hoare triple {3997#true} assume !(0 == ~cond); {3997#true} is VALID [2022-04-28 11:20:31,386 INFO L290 TraceCheckUtils]: 38: Hoare triple {3997#true} ~cond := #in~cond; {3997#true} is VALID [2022-04-28 11:20:31,386 INFO L272 TraceCheckUtils]: 37: Hoare triple {4169#(< ~counter~0 10)} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {3997#true} is VALID [2022-04-28 11:20:31,386 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {3997#true} {4169#(< ~counter~0 10)} #85#return; {4169#(< ~counter~0 10)} is VALID [2022-04-28 11:20:31,386 INFO L290 TraceCheckUtils]: 35: Hoare triple {3997#true} assume true; {3997#true} is VALID [2022-04-28 11:20:31,386 INFO L290 TraceCheckUtils]: 34: Hoare triple {3997#true} assume !(0 == ~cond); {3997#true} is VALID [2022-04-28 11:20:31,386 INFO L290 TraceCheckUtils]: 33: Hoare triple {3997#true} ~cond := #in~cond; {3997#true} is VALID [2022-04-28 11:20:31,386 INFO L272 TraceCheckUtils]: 32: Hoare triple {4169#(< ~counter~0 10)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {3997#true} is VALID [2022-04-28 11:20:31,387 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {3997#true} {4169#(< ~counter~0 10)} #83#return; {4169#(< ~counter~0 10)} is VALID [2022-04-28 11:20:31,387 INFO L290 TraceCheckUtils]: 30: Hoare triple {3997#true} assume true; {3997#true} is VALID [2022-04-28 11:20:31,387 INFO L290 TraceCheckUtils]: 29: Hoare triple {3997#true} assume !(0 == ~cond); {3997#true} is VALID [2022-04-28 11:20:31,387 INFO L290 TraceCheckUtils]: 28: Hoare triple {3997#true} ~cond := #in~cond; {3997#true} is VALID [2022-04-28 11:20:31,387 INFO L272 TraceCheckUtils]: 27: Hoare triple {4169#(< ~counter~0 10)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {3997#true} is VALID [2022-04-28 11:20:31,388 INFO L290 TraceCheckUtils]: 26: Hoare triple {4169#(< ~counter~0 10)} assume !!(#t~post7 < 10);havoc #t~post7; {4169#(< ~counter~0 10)} is VALID [2022-04-28 11:20:31,388 INFO L290 TraceCheckUtils]: 25: Hoare triple {4227#(< ~counter~0 9)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {4169#(< ~counter~0 10)} is VALID [2022-04-28 11:20:31,388 INFO L290 TraceCheckUtils]: 24: Hoare triple {4227#(< ~counter~0 9)} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {4227#(< ~counter~0 9)} is VALID [2022-04-28 11:20:31,389 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {3997#true} {4227#(< ~counter~0 9)} #81#return; {4227#(< ~counter~0 9)} is VALID [2022-04-28 11:20:31,389 INFO L290 TraceCheckUtils]: 22: Hoare triple {3997#true} assume true; {3997#true} is VALID [2022-04-28 11:20:31,389 INFO L290 TraceCheckUtils]: 21: Hoare triple {3997#true} assume !(0 == ~cond); {3997#true} is VALID [2022-04-28 11:20:31,389 INFO L290 TraceCheckUtils]: 20: Hoare triple {3997#true} ~cond := #in~cond; {3997#true} is VALID [2022-04-28 11:20:31,389 INFO L272 TraceCheckUtils]: 19: Hoare triple {4227#(< ~counter~0 9)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {3997#true} is VALID [2022-04-28 11:20:31,390 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {3997#true} {4227#(< ~counter~0 9)} #79#return; {4227#(< ~counter~0 9)} is VALID [2022-04-28 11:20:31,390 INFO L290 TraceCheckUtils]: 17: Hoare triple {3997#true} assume true; {3997#true} is VALID [2022-04-28 11:20:31,390 INFO L290 TraceCheckUtils]: 16: Hoare triple {3997#true} assume !(0 == ~cond); {3997#true} is VALID [2022-04-28 11:20:31,390 INFO L290 TraceCheckUtils]: 15: Hoare triple {3997#true} ~cond := #in~cond; {3997#true} is VALID [2022-04-28 11:20:31,390 INFO L272 TraceCheckUtils]: 14: Hoare triple {4227#(< ~counter~0 9)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {3997#true} is VALID [2022-04-28 11:20:31,390 INFO L290 TraceCheckUtils]: 13: Hoare triple {4227#(< ~counter~0 9)} assume !!(#t~post6 < 10);havoc #t~post6; {4227#(< ~counter~0 9)} is VALID [2022-04-28 11:20:31,391 INFO L290 TraceCheckUtils]: 12: Hoare triple {4267#(< ~counter~0 8)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4227#(< ~counter~0 9)} is VALID [2022-04-28 11:20:31,391 INFO L290 TraceCheckUtils]: 11: Hoare triple {4267#(< ~counter~0 8)} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {4267#(< ~counter~0 8)} is VALID [2022-04-28 11:20:31,392 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3997#true} {4267#(< ~counter~0 8)} #77#return; {4267#(< ~counter~0 8)} is VALID [2022-04-28 11:20:31,392 INFO L290 TraceCheckUtils]: 9: Hoare triple {3997#true} assume true; {3997#true} is VALID [2022-04-28 11:20:31,392 INFO L290 TraceCheckUtils]: 8: Hoare triple {3997#true} assume !(0 == ~cond); {3997#true} is VALID [2022-04-28 11:20:31,392 INFO L290 TraceCheckUtils]: 7: Hoare triple {3997#true} ~cond := #in~cond; {3997#true} is VALID [2022-04-28 11:20:31,392 INFO L272 TraceCheckUtils]: 6: Hoare triple {4267#(< ~counter~0 8)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {3997#true} is VALID [2022-04-28 11:20:31,392 INFO L290 TraceCheckUtils]: 5: Hoare triple {4267#(< ~counter~0 8)} 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 8)} is VALID [2022-04-28 11:20:31,393 INFO L272 TraceCheckUtils]: 4: Hoare triple {4267#(< ~counter~0 8)} call #t~ret8 := main(); {4267#(< ~counter~0 8)} is VALID [2022-04-28 11:20:31,393 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4267#(< ~counter~0 8)} {3997#true} #93#return; {4267#(< ~counter~0 8)} is VALID [2022-04-28 11:20:31,393 INFO L290 TraceCheckUtils]: 2: Hoare triple {4267#(< ~counter~0 8)} assume true; {4267#(< ~counter~0 8)} is VALID [2022-04-28 11:20:31,394 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 8)} is VALID [2022-04-28 11:20:31,394 INFO L272 TraceCheckUtils]: 0: Hoare triple {3997#true} call ULTIMATE.init(); {3997#true} is VALID [2022-04-28 11:20:31,394 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-04-28 11:20:31,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:20:31,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388197990] [2022-04-28 11:20:31,394 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:20:31,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [756487922] [2022-04-28 11:20:31,394 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [756487922] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 11:20:31,394 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 11:20:31,395 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-04-28 11:20:31,395 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:20:31,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2040818560] [2022-04-28 11:20:31,395 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2040818560] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:20:31,395 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:20:31,395 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 11:20:31,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47418190] [2022-04-28 11:20:31,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:20:31,395 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 5 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) Word has length 50 [2022-04-28 11:20:31,396 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:20:31,396 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 5 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2022-04-28 11:20:31,423 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:20:31,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 11:20:31,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:20:31,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 11:20:31,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-28 11:20:31,423 INFO L87 Difference]: Start difference. First operand 86 states and 108 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 5 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2022-04-28 11:20:31,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:20:31,635 INFO L93 Difference]: Finished difference Result 115 states and 134 transitions. [2022-04-28 11:20:31,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 11:20:31,635 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 5 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) Word has length 50 [2022-04-28 11:20:31,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:20:31,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 5 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2022-04-28 11:20:31,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 79 transitions. [2022-04-28 11:20:31,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 5 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2022-04-28 11:20:31,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 79 transitions. [2022-04-28 11:20:31,638 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 79 transitions. [2022-04-28 11:20:31,697 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:20:31,699 INFO L225 Difference]: With dead ends: 115 [2022-04-28 11:20:31,699 INFO L226 Difference]: Without dead ends: 108 [2022-04-28 11:20:31,699 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2022-04-28 11:20:31,699 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 11 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 11:20:31,700 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 145 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 11:20:31,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2022-04-28 11:20:31,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 106. [2022-04-28 11:20:31,790 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:20:31,791 INFO L82 GeneralOperation]: Start isEquivalent. First operand 108 states. Second operand has 106 states, 68 states have (on average 1.161764705882353) internal successors, (79), 71 states have internal predecessors, (79), 24 states have call successors, (24), 14 states have call predecessors, (24), 13 states have return successors, (22), 20 states have call predecessors, (22), 22 states have call successors, (22) [2022-04-28 11:20:31,791 INFO L74 IsIncluded]: Start isIncluded. First operand 108 states. Second operand has 106 states, 68 states have (on average 1.161764705882353) internal successors, (79), 71 states have internal predecessors, (79), 24 states have call successors, (24), 14 states have call predecessors, (24), 13 states have return successors, (22), 20 states have call predecessors, (22), 22 states have call successors, (22) [2022-04-28 11:20:31,791 INFO L87 Difference]: Start difference. First operand 108 states. Second operand has 106 states, 68 states have (on average 1.161764705882353) internal successors, (79), 71 states have internal predecessors, (79), 24 states have call successors, (24), 14 states have call predecessors, (24), 13 states have return successors, (22), 20 states have call predecessors, (22), 22 states have call successors, (22) [2022-04-28 11:20:31,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:20:31,795 INFO L93 Difference]: Finished difference Result 108 states and 127 transitions. [2022-04-28 11:20:31,795 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 127 transitions. [2022-04-28 11:20:31,796 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:20:31,796 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:20:31,796 INFO L74 IsIncluded]: Start isIncluded. First operand has 106 states, 68 states have (on average 1.161764705882353) internal successors, (79), 71 states have internal predecessors, (79), 24 states have call successors, (24), 14 states have call predecessors, (24), 13 states have return successors, (22), 20 states have call predecessors, (22), 22 states have call successors, (22) Second operand 108 states. [2022-04-28 11:20:31,796 INFO L87 Difference]: Start difference. First operand has 106 states, 68 states have (on average 1.161764705882353) internal successors, (79), 71 states have internal predecessors, (79), 24 states have call successors, (24), 14 states have call predecessors, (24), 13 states have return successors, (22), 20 states have call predecessors, (22), 22 states have call successors, (22) Second operand 108 states. [2022-04-28 11:20:31,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:20:31,807 INFO L93 Difference]: Finished difference Result 108 states and 127 transitions. [2022-04-28 11:20:31,807 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 127 transitions. [2022-04-28 11:20:31,807 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:20:31,807 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:20:31,807 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:20:31,807 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:20:31,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 68 states have (on average 1.161764705882353) internal successors, (79), 71 states have internal predecessors, (79), 24 states have call successors, (24), 14 states have call predecessors, (24), 13 states have return successors, (22), 20 states have call predecessors, (22), 22 states have call successors, (22) [2022-04-28 11:20:31,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 125 transitions. [2022-04-28 11:20:31,810 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 125 transitions. Word has length 50 [2022-04-28 11:20:31,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:20:31,810 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 125 transitions. [2022-04-28 11:20:31,810 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 5 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2022-04-28 11:20:31,810 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 106 states and 125 transitions. [2022-04-28 11:20:31,937 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 125 edges. 125 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:20:31,937 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 125 transitions. [2022-04-28 11:20:31,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-04-28 11:20:31,937 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:20:31,938 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:20:31,959 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-28 11:20:32,138 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-04-28 11:20:32,138 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:20:32,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:20:32,139 INFO L85 PathProgramCache]: Analyzing trace with hash -484699953, now seen corresponding path program 1 times [2022-04-28 11:20:32,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:20:32,139 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1523408821] [2022-04-28 11:20:45,484 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:20:45,484 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:20:45,484 INFO L85 PathProgramCache]: Analyzing trace with hash -484699953, now seen corresponding path program 2 times [2022-04-28 11:20:45,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:20:45,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706551652] [2022-04-28 11:20:45,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:20:45,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:20:45,505 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:20:45,505 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1518358878] [2022-04-28 11:20:45,505 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:20:45,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:20:45,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:20:45,520 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 11:20:45,521 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-04-28 11:20:45,561 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 11:20:45,561 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:20:45,562 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-28 11:20:45,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:20:45,570 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:20:45,753 INFO L272 TraceCheckUtils]: 0: Hoare triple {4966#true} call ULTIMATE.init(); {4966#true} is VALID [2022-04-28 11:20:45,754 INFO L290 TraceCheckUtils]: 1: Hoare triple {4966#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {4966#true} is VALID [2022-04-28 11:20:45,754 INFO L290 TraceCheckUtils]: 2: Hoare triple {4966#true} assume true; {4966#true} is VALID [2022-04-28 11:20:45,754 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4966#true} {4966#true} #93#return; {4966#true} is VALID [2022-04-28 11:20:45,754 INFO L272 TraceCheckUtils]: 4: Hoare triple {4966#true} call #t~ret8 := main(); {4966#true} is VALID [2022-04-28 11:20:45,754 INFO L290 TraceCheckUtils]: 5: Hoare triple {4966#true} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {4966#true} is VALID [2022-04-28 11:20:45,754 INFO L272 TraceCheckUtils]: 6: Hoare triple {4966#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {4966#true} is VALID [2022-04-28 11:20:45,754 INFO L290 TraceCheckUtils]: 7: Hoare triple {4966#true} ~cond := #in~cond; {4966#true} is VALID [2022-04-28 11:20:45,754 INFO L290 TraceCheckUtils]: 8: Hoare triple {4966#true} assume !(0 == ~cond); {4966#true} is VALID [2022-04-28 11:20:45,754 INFO L290 TraceCheckUtils]: 9: Hoare triple {4966#true} assume true; {4966#true} is VALID [2022-04-28 11:20:45,754 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4966#true} {4966#true} #77#return; {4966#true} is VALID [2022-04-28 11:20:45,755 INFO L290 TraceCheckUtils]: 11: Hoare triple {4966#true} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {5004#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:20:45,755 INFO L290 TraceCheckUtils]: 12: Hoare triple {5004#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5004#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:20:45,755 INFO L290 TraceCheckUtils]: 13: Hoare triple {5004#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} assume !!(#t~post6 < 10);havoc #t~post6; {5004#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:20:45,755 INFO L272 TraceCheckUtils]: 14: Hoare triple {5004#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {4966#true} is VALID [2022-04-28 11:20:45,755 INFO L290 TraceCheckUtils]: 15: Hoare triple {4966#true} ~cond := #in~cond; {4966#true} is VALID [2022-04-28 11:20:45,755 INFO L290 TraceCheckUtils]: 16: Hoare triple {4966#true} assume !(0 == ~cond); {4966#true} is VALID [2022-04-28 11:20:45,756 INFO L290 TraceCheckUtils]: 17: Hoare triple {4966#true} assume true; {4966#true} is VALID [2022-04-28 11:20:45,756 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {4966#true} {5004#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #79#return; {5004#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:20:45,756 INFO L272 TraceCheckUtils]: 19: Hoare triple {5004#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {4966#true} is VALID [2022-04-28 11:20:45,756 INFO L290 TraceCheckUtils]: 20: Hoare triple {4966#true} ~cond := #in~cond; {4966#true} is VALID [2022-04-28 11:20:45,756 INFO L290 TraceCheckUtils]: 21: Hoare triple {4966#true} assume !(0 == ~cond); {4966#true} is VALID [2022-04-28 11:20:45,756 INFO L290 TraceCheckUtils]: 22: Hoare triple {4966#true} assume true; {4966#true} is VALID [2022-04-28 11:20:45,757 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {4966#true} {5004#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #81#return; {5004#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:20:45,757 INFO L290 TraceCheckUtils]: 24: Hoare triple {5004#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {5044#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-28 11:20:45,757 INFO L290 TraceCheckUtils]: 25: Hoare triple {5044#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {5044#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-28 11:20:45,758 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 < 10);havoc #t~post7; {5044#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-28 11:20:45,758 INFO L272 TraceCheckUtils]: 27: Hoare triple {5044#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {4966#true} is VALID [2022-04-28 11:20:45,758 INFO L290 TraceCheckUtils]: 28: Hoare triple {4966#true} ~cond := #in~cond; {4966#true} is VALID [2022-04-28 11:20:45,758 INFO L290 TraceCheckUtils]: 29: Hoare triple {4966#true} assume !(0 == ~cond); {4966#true} is VALID [2022-04-28 11:20:45,758 INFO L290 TraceCheckUtils]: 30: Hoare triple {4966#true} assume true; {4966#true} is VALID [2022-04-28 11:20:45,758 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {4966#true} {5044#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #83#return; {5044#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-28 11:20:45,759 INFO L272 TraceCheckUtils]: 32: Hoare triple {5044#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {4966#true} is VALID [2022-04-28 11:20:45,759 INFO L290 TraceCheckUtils]: 33: Hoare triple {4966#true} ~cond := #in~cond; {4966#true} is VALID [2022-04-28 11:20:45,759 INFO L290 TraceCheckUtils]: 34: Hoare triple {4966#true} assume !(0 == ~cond); {4966#true} is VALID [2022-04-28 11:20:45,759 INFO L290 TraceCheckUtils]: 35: Hoare triple {4966#true} assume true; {4966#true} is VALID [2022-04-28 11:20:45,759 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {4966#true} {5044#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #85#return; {5044#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-28 11:20:45,759 INFO L272 TraceCheckUtils]: 37: Hoare triple {5044#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {4966#true} is VALID [2022-04-28 11:20:45,759 INFO L290 TraceCheckUtils]: 38: Hoare triple {4966#true} ~cond := #in~cond; {4966#true} is VALID [2022-04-28 11:20:45,759 INFO L290 TraceCheckUtils]: 39: Hoare triple {4966#true} assume !(0 == ~cond); {4966#true} is VALID [2022-04-28 11:20:45,759 INFO L290 TraceCheckUtils]: 40: Hoare triple {4966#true} assume true; {4966#true} is VALID [2022-04-28 11:20:45,760 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {4966#true} {5044#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #87#return; {5044#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-28 11:20:45,760 INFO L290 TraceCheckUtils]: 42: Hoare triple {5044#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} assume !(~r~0 >= 2 * ~b~0); {5044#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-28 11:20:45,761 INFO L290 TraceCheckUtils]: 43: Hoare triple {5044#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} ~r~0 := ~r~0 - ~b~0;~q~0 := ~q~0 + ~a~0; {5102#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~r~0) (= main_~q~0 1))} is VALID [2022-04-28 11:20:45,761 INFO L290 TraceCheckUtils]: 44: Hoare triple {5102#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~r~0) (= main_~q~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5102#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~r~0) (= main_~q~0 1))} is VALID [2022-04-28 11:20:45,761 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 < 10);havoc #t~post6; {5102#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~r~0) (= main_~q~0 1))} is VALID [2022-04-28 11:20:45,761 INFO L272 TraceCheckUtils]: 46: Hoare triple {5102#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~r~0) (= main_~q~0 1))} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {4966#true} is VALID [2022-04-28 11:20:45,761 INFO L290 TraceCheckUtils]: 47: Hoare triple {4966#true} ~cond := #in~cond; {4966#true} is VALID [2022-04-28 11:20:45,761 INFO L290 TraceCheckUtils]: 48: Hoare triple {4966#true} assume !(0 == ~cond); {4966#true} is VALID [2022-04-28 11:20:45,762 INFO L290 TraceCheckUtils]: 49: Hoare triple {4966#true} assume true; {4966#true} is VALID [2022-04-28 11:20:45,762 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {4966#true} {5102#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~r~0) (= main_~q~0 1))} #79#return; {5102#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~r~0) (= main_~q~0 1))} is VALID [2022-04-28 11:20:45,762 INFO L272 TraceCheckUtils]: 51: Hoare triple {5102#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~r~0) (= main_~q~0 1))} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {5127#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:20:45,763 INFO L290 TraceCheckUtils]: 52: Hoare triple {5127#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5131#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:20:45,763 INFO L290 TraceCheckUtils]: 53: Hoare triple {5131#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4967#false} is VALID [2022-04-28 11:20:45,763 INFO L290 TraceCheckUtils]: 54: Hoare triple {4967#false} assume !false; {4967#false} is VALID [2022-04-28 11:20:45,764 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-28 11:20:45,764 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:21:05,822 INFO L290 TraceCheckUtils]: 54: Hoare triple {4967#false} assume !false; {4967#false} is VALID [2022-04-28 11:21:05,822 INFO L290 TraceCheckUtils]: 53: Hoare triple {5131#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4967#false} is VALID [2022-04-28 11:21:05,823 INFO L290 TraceCheckUtils]: 52: Hoare triple {5127#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5131#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:21:05,823 INFO L272 TraceCheckUtils]: 51: Hoare triple {5147#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {5127#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:21:05,824 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {4966#true} {5147#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} #79#return; {5147#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:21:05,824 INFO L290 TraceCheckUtils]: 49: Hoare triple {4966#true} assume true; {4966#true} is VALID [2022-04-28 11:21:05,824 INFO L290 TraceCheckUtils]: 48: Hoare triple {4966#true} assume !(0 == ~cond); {4966#true} is VALID [2022-04-28 11:21:05,824 INFO L290 TraceCheckUtils]: 47: Hoare triple {4966#true} ~cond := #in~cond; {4966#true} is VALID [2022-04-28 11:21:05,824 INFO L272 TraceCheckUtils]: 46: Hoare triple {5147#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {4966#true} is VALID [2022-04-28 11:21:05,825 INFO L290 TraceCheckUtils]: 45: Hoare triple {5147#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} assume !!(#t~post6 < 10);havoc #t~post6; {5147#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:21:05,825 INFO L290 TraceCheckUtils]: 44: Hoare triple {5147#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5147#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:21:05,836 INFO L290 TraceCheckUtils]: 43: Hoare triple {5172#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} ~r~0 := ~r~0 - ~b~0;~q~0 := ~q~0 + ~a~0; {5147#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:21:05,836 INFO L290 TraceCheckUtils]: 42: Hoare triple {5172#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} assume !(~r~0 >= 2 * ~b~0); {5172#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} is VALID [2022-04-28 11:21:05,837 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {4966#true} {5172#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} #87#return; {5172#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} is VALID [2022-04-28 11:21:05,837 INFO L290 TraceCheckUtils]: 40: Hoare triple {4966#true} assume true; {4966#true} is VALID [2022-04-28 11:21:05,837 INFO L290 TraceCheckUtils]: 39: Hoare triple {4966#true} assume !(0 == ~cond); {4966#true} is VALID [2022-04-28 11:21:05,837 INFO L290 TraceCheckUtils]: 38: Hoare triple {4966#true} ~cond := #in~cond; {4966#true} is VALID [2022-04-28 11:21:05,837 INFO L272 TraceCheckUtils]: 37: Hoare triple {5172#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {4966#true} is VALID [2022-04-28 11:21:05,838 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {4966#true} {5172#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} #85#return; {5172#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} is VALID [2022-04-28 11:21:05,838 INFO L290 TraceCheckUtils]: 35: Hoare triple {4966#true} assume true; {4966#true} is VALID [2022-04-28 11:21:05,838 INFO L290 TraceCheckUtils]: 34: Hoare triple {4966#true} assume !(0 == ~cond); {4966#true} is VALID [2022-04-28 11:21:05,838 INFO L290 TraceCheckUtils]: 33: Hoare triple {4966#true} ~cond := #in~cond; {4966#true} is VALID [2022-04-28 11:21:05,838 INFO L272 TraceCheckUtils]: 32: Hoare triple {5172#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {4966#true} is VALID [2022-04-28 11:21:05,839 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {4966#true} {5172#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} #83#return; {5172#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} is VALID [2022-04-28 11:21:05,839 INFO L290 TraceCheckUtils]: 30: Hoare triple {4966#true} assume true; {4966#true} is VALID [2022-04-28 11:21:05,839 INFO L290 TraceCheckUtils]: 29: Hoare triple {4966#true} assume !(0 == ~cond); {4966#true} is VALID [2022-04-28 11:21:05,839 INFO L290 TraceCheckUtils]: 28: Hoare triple {4966#true} ~cond := #in~cond; {4966#true} is VALID [2022-04-28 11:21:05,839 INFO L272 TraceCheckUtils]: 27: Hoare triple {5172#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {4966#true} is VALID [2022-04-28 11:21:05,840 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 < 10);havoc #t~post7; {5172#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} is VALID [2022-04-28 11:21:05,840 INFO L290 TraceCheckUtils]: 25: Hoare triple {5172#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {5172#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} is VALID [2022-04-28 11:21:05,841 INFO L290 TraceCheckUtils]: 24: Hoare triple {5004#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {5172#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} is VALID [2022-04-28 11:21:05,841 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {4966#true} {5004#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #81#return; {5004#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:21:05,841 INFO L290 TraceCheckUtils]: 22: Hoare triple {4966#true} assume true; {4966#true} is VALID [2022-04-28 11:21:05,841 INFO L290 TraceCheckUtils]: 21: Hoare triple {4966#true} assume !(0 == ~cond); {4966#true} is VALID [2022-04-28 11:21:05,841 INFO L290 TraceCheckUtils]: 20: Hoare triple {4966#true} ~cond := #in~cond; {4966#true} is VALID [2022-04-28 11:21:05,841 INFO L272 TraceCheckUtils]: 19: Hoare triple {5004#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {4966#true} is VALID [2022-04-28 11:21:05,842 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {4966#true} {5004#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #79#return; {5004#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:21:05,842 INFO L290 TraceCheckUtils]: 17: Hoare triple {4966#true} assume true; {4966#true} is VALID [2022-04-28 11:21:05,842 INFO L290 TraceCheckUtils]: 16: Hoare triple {4966#true} assume !(0 == ~cond); {4966#true} is VALID [2022-04-28 11:21:05,842 INFO L290 TraceCheckUtils]: 15: Hoare triple {4966#true} ~cond := #in~cond; {4966#true} is VALID [2022-04-28 11:21:05,842 INFO L272 TraceCheckUtils]: 14: Hoare triple {5004#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {4966#true} is VALID [2022-04-28 11:21:05,843 INFO L290 TraceCheckUtils]: 13: Hoare triple {5004#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} assume !!(#t~post6 < 10);havoc #t~post6; {5004#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:21:05,843 INFO L290 TraceCheckUtils]: 12: Hoare triple {5004#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5004#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:21:05,843 INFO L290 TraceCheckUtils]: 11: Hoare triple {4966#true} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {5004#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:21:05,843 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4966#true} {4966#true} #77#return; {4966#true} is VALID [2022-04-28 11:21:05,844 INFO L290 TraceCheckUtils]: 9: Hoare triple {4966#true} assume true; {4966#true} is VALID [2022-04-28 11:21:05,844 INFO L290 TraceCheckUtils]: 8: Hoare triple {4966#true} assume !(0 == ~cond); {4966#true} is VALID [2022-04-28 11:21:05,844 INFO L290 TraceCheckUtils]: 7: Hoare triple {4966#true} ~cond := #in~cond; {4966#true} is VALID [2022-04-28 11:21:05,844 INFO L272 TraceCheckUtils]: 6: Hoare triple {4966#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {4966#true} is VALID [2022-04-28 11:21:05,844 INFO L290 TraceCheckUtils]: 5: Hoare triple {4966#true} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {4966#true} is VALID [2022-04-28 11:21:05,844 INFO L272 TraceCheckUtils]: 4: Hoare triple {4966#true} call #t~ret8 := main(); {4966#true} is VALID [2022-04-28 11:21:05,844 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4966#true} {4966#true} #93#return; {4966#true} is VALID [2022-04-28 11:21:05,844 INFO L290 TraceCheckUtils]: 2: Hoare triple {4966#true} assume true; {4966#true} is VALID [2022-04-28 11:21:05,844 INFO L290 TraceCheckUtils]: 1: Hoare triple {4966#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {4966#true} is VALID [2022-04-28 11:21:05,844 INFO L272 TraceCheckUtils]: 0: Hoare triple {4966#true} call ULTIMATE.init(); {4966#true} is VALID [2022-04-28 11:21:05,844 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-28 11:21:05,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:21:05,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706551652] [2022-04-28 11:21:05,845 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:21:05,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1518358878] [2022-04-28 11:21:05,845 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1518358878] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 11:21:05,845 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 11:21:05,845 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2022-04-28 11:21:05,845 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:21:05,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1523408821] [2022-04-28 11:21:05,845 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1523408821] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:21:05,845 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:21:05,845 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 11:21:05,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689608773] [2022-04-28 11:21:05,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:21:05,846 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 55 [2022-04-28 11:21:05,846 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:21:05,846 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-04-28 11:21:05,879 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:21:05,879 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 11:21:05,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:21:05,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 11:21:05,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-04-28 11:21:05,880 INFO L87 Difference]: Start difference. First operand 106 states and 125 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-04-28 11:21:06,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:21:06,440 INFO L93 Difference]: Finished difference Result 134 states and 166 transitions. [2022-04-28 11:21:06,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 11:21:06,440 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 55 [2022-04-28 11:21:06,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:21:06,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-04-28 11:21:06,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 107 transitions. [2022-04-28 11:21:06,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-04-28 11:21:06,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 107 transitions. [2022-04-28 11:21:06,443 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 107 transitions. [2022-04-28 11:21:06,531 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 107 edges. 107 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:21:06,533 INFO L225 Difference]: With dead ends: 134 [2022-04-28 11:21:06,533 INFO L226 Difference]: Without dead ends: 131 [2022-04-28 11:21:06,534 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 100 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-04-28 11:21:06,534 INFO L413 NwaCegarLoop]: 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-28 11:21:06,534 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 237 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 11:21:06,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2022-04-28 11:21:06,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 127. [2022-04-28 11:21:06,669 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:21:06,670 INFO L82 GeneralOperation]: Start isEquivalent. First operand 131 states. Second operand has 127 states, 79 states have (on average 1.1898734177215189) internal successors, (94), 82 states have internal predecessors, (94), 33 states have call successors, (33), 15 states have call predecessors, (33), 14 states have return successors, (31), 29 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-28 11:21:06,670 INFO L74 IsIncluded]: Start isIncluded. First operand 131 states. Second operand has 127 states, 79 states have (on average 1.1898734177215189) internal successors, (94), 82 states have internal predecessors, (94), 33 states have call successors, (33), 15 states have call predecessors, (33), 14 states have return successors, (31), 29 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-28 11:21:06,670 INFO L87 Difference]: Start difference. First operand 131 states. Second operand has 127 states, 79 states have (on average 1.1898734177215189) internal successors, (94), 82 states have internal predecessors, (94), 33 states have call successors, (33), 15 states have call predecessors, (33), 14 states have return successors, (31), 29 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-28 11:21:06,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:21:06,672 INFO L93 Difference]: Finished difference Result 131 states and 162 transitions. [2022-04-28 11:21:06,673 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 162 transitions. [2022-04-28 11:21:06,673 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:21:06,673 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:21:06,673 INFO L74 IsIncluded]: Start isIncluded. First operand has 127 states, 79 states have (on average 1.1898734177215189) internal successors, (94), 82 states have internal predecessors, (94), 33 states have call successors, (33), 15 states have call predecessors, (33), 14 states have return successors, (31), 29 states have call predecessors, (31), 31 states have call successors, (31) Second operand 131 states. [2022-04-28 11:21:06,673 INFO L87 Difference]: Start difference. First operand has 127 states, 79 states have (on average 1.1898734177215189) internal successors, (94), 82 states have internal predecessors, (94), 33 states have call successors, (33), 15 states have call predecessors, (33), 14 states have return successors, (31), 29 states have call predecessors, (31), 31 states have call successors, (31) Second operand 131 states. [2022-04-28 11:21:06,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:21:06,676 INFO L93 Difference]: Finished difference Result 131 states and 162 transitions. [2022-04-28 11:21:06,676 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 162 transitions. [2022-04-28 11:21:06,676 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:21:06,676 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:21:06,676 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:21:06,676 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:21:06,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 79 states have (on average 1.1898734177215189) internal successors, (94), 82 states have internal predecessors, (94), 33 states have call successors, (33), 15 states have call predecessors, (33), 14 states have return successors, (31), 29 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-28 11:21:06,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 158 transitions. [2022-04-28 11:21:06,679 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 158 transitions. Word has length 55 [2022-04-28 11:21:06,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:21:06,679 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 158 transitions. [2022-04-28 11:21:06,679 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-04-28 11:21:06,679 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 127 states and 158 transitions. [2022-04-28 11:21:06,815 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 158 edges. 158 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:21:06,815 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 158 transitions. [2022-04-28 11:21:06,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-04-28 11:21:06,816 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:21:06,816 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:21:06,834 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-04-28 11:21:07,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-04-28 11:21:07,031 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:21:07,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:21:07,032 INFO L85 PathProgramCache]: Analyzing trace with hash 765609565, now seen corresponding path program 1 times [2022-04-28 11:21:07,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:21:07,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [720923502] [2022-04-28 11:21:20,018 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:21:20,018 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:21:20,018 INFO L85 PathProgramCache]: Analyzing trace with hash 765609565, now seen corresponding path program 2 times [2022-04-28 11:21:20,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:21:20,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389480951] [2022-04-28 11:21:20,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:21:20,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:21:20,028 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:21:20,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1440890159] [2022-04-28 11:21:20,029 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:21:20,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:21:20,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:21:20,029 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 11:21:20,031 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-04-28 11:21:20,071 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 11:21:20,071 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:21:20,072 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 11:21:20,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:21:20,084 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:21:20,286 INFO L272 TraceCheckUtils]: 0: Hoare triple {6090#true} call ULTIMATE.init(); {6090#true} is VALID [2022-04-28 11:21:20,287 INFO L290 TraceCheckUtils]: 1: Hoare triple {6090#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {6098#(<= ~counter~0 0)} is VALID [2022-04-28 11:21:20,287 INFO L290 TraceCheckUtils]: 2: Hoare triple {6098#(<= ~counter~0 0)} assume true; {6098#(<= ~counter~0 0)} is VALID [2022-04-28 11:21:20,287 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6098#(<= ~counter~0 0)} {6090#true} #93#return; {6098#(<= ~counter~0 0)} is VALID [2022-04-28 11:21:20,288 INFO L272 TraceCheckUtils]: 4: Hoare triple {6098#(<= ~counter~0 0)} call #t~ret8 := main(); {6098#(<= ~counter~0 0)} is VALID [2022-04-28 11:21:20,288 INFO L290 TraceCheckUtils]: 5: Hoare triple {6098#(<= ~counter~0 0)} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {6098#(<= ~counter~0 0)} is VALID [2022-04-28 11:21:20,288 INFO L272 TraceCheckUtils]: 6: Hoare triple {6098#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {6098#(<= ~counter~0 0)} is VALID [2022-04-28 11:21:20,289 INFO L290 TraceCheckUtils]: 7: Hoare triple {6098#(<= ~counter~0 0)} ~cond := #in~cond; {6098#(<= ~counter~0 0)} is VALID [2022-04-28 11:21:20,289 INFO L290 TraceCheckUtils]: 8: Hoare triple {6098#(<= ~counter~0 0)} assume !(0 == ~cond); {6098#(<= ~counter~0 0)} is VALID [2022-04-28 11:21:20,289 INFO L290 TraceCheckUtils]: 9: Hoare triple {6098#(<= ~counter~0 0)} assume true; {6098#(<= ~counter~0 0)} is VALID [2022-04-28 11:21:20,290 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6098#(<= ~counter~0 0)} {6098#(<= ~counter~0 0)} #77#return; {6098#(<= ~counter~0 0)} is VALID [2022-04-28 11:21:20,290 INFO L290 TraceCheckUtils]: 11: Hoare triple {6098#(<= ~counter~0 0)} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {6098#(<= ~counter~0 0)} is VALID [2022-04-28 11:21:20,290 INFO L290 TraceCheckUtils]: 12: Hoare triple {6098#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6132#(<= ~counter~0 1)} is VALID [2022-04-28 11:21:20,291 INFO L290 TraceCheckUtils]: 13: Hoare triple {6132#(<= ~counter~0 1)} assume !!(#t~post6 < 10);havoc #t~post6; {6132#(<= ~counter~0 1)} is VALID [2022-04-28 11:21:20,294 INFO L272 TraceCheckUtils]: 14: Hoare triple {6132#(<= ~counter~0 1)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {6132#(<= ~counter~0 1)} is VALID [2022-04-28 11:21:20,295 INFO L290 TraceCheckUtils]: 15: Hoare triple {6132#(<= ~counter~0 1)} ~cond := #in~cond; {6132#(<= ~counter~0 1)} is VALID [2022-04-28 11:21:20,296 INFO L290 TraceCheckUtils]: 16: Hoare triple {6132#(<= ~counter~0 1)} assume !(0 == ~cond); {6132#(<= ~counter~0 1)} is VALID [2022-04-28 11:21:20,297 INFO L290 TraceCheckUtils]: 17: Hoare triple {6132#(<= ~counter~0 1)} assume true; {6132#(<= ~counter~0 1)} is VALID [2022-04-28 11:21:20,297 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {6132#(<= ~counter~0 1)} {6132#(<= ~counter~0 1)} #79#return; {6132#(<= ~counter~0 1)} is VALID [2022-04-28 11:21:20,298 INFO L272 TraceCheckUtils]: 19: Hoare triple {6132#(<= ~counter~0 1)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {6132#(<= ~counter~0 1)} is VALID [2022-04-28 11:21:20,298 INFO L290 TraceCheckUtils]: 20: Hoare triple {6132#(<= ~counter~0 1)} ~cond := #in~cond; {6132#(<= ~counter~0 1)} is VALID [2022-04-28 11:21:20,299 INFO L290 TraceCheckUtils]: 21: Hoare triple {6132#(<= ~counter~0 1)} assume !(0 == ~cond); {6132#(<= ~counter~0 1)} is VALID [2022-04-28 11:21:20,299 INFO L290 TraceCheckUtils]: 22: Hoare triple {6132#(<= ~counter~0 1)} assume true; {6132#(<= ~counter~0 1)} is VALID [2022-04-28 11:21:20,300 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {6132#(<= ~counter~0 1)} {6132#(<= ~counter~0 1)} #81#return; {6132#(<= ~counter~0 1)} is VALID [2022-04-28 11:21:20,300 INFO L290 TraceCheckUtils]: 24: Hoare triple {6132#(<= ~counter~0 1)} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {6132#(<= ~counter~0 1)} is VALID [2022-04-28 11:21:20,300 INFO L290 TraceCheckUtils]: 25: Hoare triple {6132#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {6172#(<= ~counter~0 2)} is VALID [2022-04-28 11:21:20,301 INFO L290 TraceCheckUtils]: 26: Hoare triple {6172#(<= ~counter~0 2)} assume !!(#t~post7 < 10);havoc #t~post7; {6172#(<= ~counter~0 2)} is VALID [2022-04-28 11:21:20,301 INFO L272 TraceCheckUtils]: 27: Hoare triple {6172#(<= ~counter~0 2)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {6172#(<= ~counter~0 2)} is VALID [2022-04-28 11:21:20,302 INFO L290 TraceCheckUtils]: 28: Hoare triple {6172#(<= ~counter~0 2)} ~cond := #in~cond; {6172#(<= ~counter~0 2)} is VALID [2022-04-28 11:21:20,302 INFO L290 TraceCheckUtils]: 29: Hoare triple {6172#(<= ~counter~0 2)} assume !(0 == ~cond); {6172#(<= ~counter~0 2)} is VALID [2022-04-28 11:21:20,302 INFO L290 TraceCheckUtils]: 30: Hoare triple {6172#(<= ~counter~0 2)} assume true; {6172#(<= ~counter~0 2)} is VALID [2022-04-28 11:21:20,303 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {6172#(<= ~counter~0 2)} {6172#(<= ~counter~0 2)} #83#return; {6172#(<= ~counter~0 2)} is VALID [2022-04-28 11:21:20,303 INFO L272 TraceCheckUtils]: 32: Hoare triple {6172#(<= ~counter~0 2)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {6172#(<= ~counter~0 2)} is VALID [2022-04-28 11:21:20,304 INFO L290 TraceCheckUtils]: 33: Hoare triple {6172#(<= ~counter~0 2)} ~cond := #in~cond; {6172#(<= ~counter~0 2)} is VALID [2022-04-28 11:21:20,304 INFO L290 TraceCheckUtils]: 34: Hoare triple {6172#(<= ~counter~0 2)} assume !(0 == ~cond); {6172#(<= ~counter~0 2)} is VALID [2022-04-28 11:21:20,304 INFO L290 TraceCheckUtils]: 35: Hoare triple {6172#(<= ~counter~0 2)} assume true; {6172#(<= ~counter~0 2)} is VALID [2022-04-28 11:21:20,305 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {6172#(<= ~counter~0 2)} {6172#(<= ~counter~0 2)} #85#return; {6172#(<= ~counter~0 2)} is VALID [2022-04-28 11:21:20,305 INFO L272 TraceCheckUtils]: 37: Hoare triple {6172#(<= ~counter~0 2)} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {6172#(<= ~counter~0 2)} is VALID [2022-04-28 11:21:20,306 INFO L290 TraceCheckUtils]: 38: Hoare triple {6172#(<= ~counter~0 2)} ~cond := #in~cond; {6172#(<= ~counter~0 2)} is VALID [2022-04-28 11:21:20,306 INFO L290 TraceCheckUtils]: 39: Hoare triple {6172#(<= ~counter~0 2)} assume !(0 == ~cond); {6172#(<= ~counter~0 2)} is VALID [2022-04-28 11:21:20,306 INFO L290 TraceCheckUtils]: 40: Hoare triple {6172#(<= ~counter~0 2)} assume true; {6172#(<= ~counter~0 2)} is VALID [2022-04-28 11:21:20,307 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {6172#(<= ~counter~0 2)} {6172#(<= ~counter~0 2)} #87#return; {6172#(<= ~counter~0 2)} is VALID [2022-04-28 11:21:20,307 INFO L290 TraceCheckUtils]: 42: Hoare triple {6172#(<= ~counter~0 2)} assume !!(~r~0 >= 2 * ~b~0); {6172#(<= ~counter~0 2)} is VALID [2022-04-28 11:21:20,308 INFO L272 TraceCheckUtils]: 43: Hoare triple {6172#(<= ~counter~0 2)} call __VERIFIER_assert((if ~r~0 >= 2 * ~y~0 * ~a~0 then 1 else 0)); {6172#(<= ~counter~0 2)} is VALID [2022-04-28 11:21:20,308 INFO L290 TraceCheckUtils]: 44: Hoare triple {6172#(<= ~counter~0 2)} ~cond := #in~cond; {6172#(<= ~counter~0 2)} is VALID [2022-04-28 11:21:20,308 INFO L290 TraceCheckUtils]: 45: Hoare triple {6172#(<= ~counter~0 2)} assume !(0 == ~cond); {6172#(<= ~counter~0 2)} is VALID [2022-04-28 11:21:20,309 INFO L290 TraceCheckUtils]: 46: Hoare triple {6172#(<= ~counter~0 2)} assume true; {6172#(<= ~counter~0 2)} is VALID [2022-04-28 11:21:20,309 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {6172#(<= ~counter~0 2)} {6172#(<= ~counter~0 2)} #89#return; {6172#(<= ~counter~0 2)} is VALID [2022-04-28 11:21:20,310 INFO L290 TraceCheckUtils]: 48: Hoare triple {6172#(<= ~counter~0 2)} ~a~0 := 2 * ~a~0;~b~0 := 2 * ~b~0; {6172#(<= ~counter~0 2)} is VALID [2022-04-28 11:21:20,310 INFO L290 TraceCheckUtils]: 49: Hoare triple {6172#(<= ~counter~0 2)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {6245#(<= |main_#t~post7| 2)} is VALID [2022-04-28 11:21:20,310 INFO L290 TraceCheckUtils]: 50: Hoare triple {6245#(<= |main_#t~post7| 2)} assume !(#t~post7 < 10);havoc #t~post7; {6091#false} is VALID [2022-04-28 11:21:20,310 INFO L290 TraceCheckUtils]: 51: Hoare triple {6091#false} ~r~0 := ~r~0 - ~b~0;~q~0 := ~q~0 + ~a~0; {6091#false} is VALID [2022-04-28 11:21:20,310 INFO L290 TraceCheckUtils]: 52: Hoare triple {6091#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6091#false} is VALID [2022-04-28 11:21:20,311 INFO L290 TraceCheckUtils]: 53: Hoare triple {6091#false} assume !(#t~post6 < 10);havoc #t~post6; {6091#false} is VALID [2022-04-28 11:21:20,311 INFO L272 TraceCheckUtils]: 54: Hoare triple {6091#false} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {6091#false} is VALID [2022-04-28 11:21:20,311 INFO L290 TraceCheckUtils]: 55: Hoare triple {6091#false} ~cond := #in~cond; {6091#false} is VALID [2022-04-28 11:21:20,311 INFO L290 TraceCheckUtils]: 56: Hoare triple {6091#false} assume 0 == ~cond; {6091#false} is VALID [2022-04-28 11:21:20,311 INFO L290 TraceCheckUtils]: 57: Hoare triple {6091#false} assume !false; {6091#false} is VALID [2022-04-28 11:21:20,311 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 14 proven. 34 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-28 11:21:20,311 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:21:20,556 INFO L290 TraceCheckUtils]: 57: Hoare triple {6091#false} assume !false; {6091#false} is VALID [2022-04-28 11:21:20,557 INFO L290 TraceCheckUtils]: 56: Hoare triple {6091#false} assume 0 == ~cond; {6091#false} is VALID [2022-04-28 11:21:20,557 INFO L290 TraceCheckUtils]: 55: Hoare triple {6091#false} ~cond := #in~cond; {6091#false} is VALID [2022-04-28 11:21:20,557 INFO L272 TraceCheckUtils]: 54: Hoare triple {6091#false} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {6091#false} is VALID [2022-04-28 11:21:20,557 INFO L290 TraceCheckUtils]: 53: Hoare triple {6091#false} assume !(#t~post6 < 10);havoc #t~post6; {6091#false} is VALID [2022-04-28 11:21:20,557 INFO L290 TraceCheckUtils]: 52: Hoare triple {6091#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6091#false} is VALID [2022-04-28 11:21:20,557 INFO L290 TraceCheckUtils]: 51: Hoare triple {6091#false} ~r~0 := ~r~0 - ~b~0;~q~0 := ~q~0 + ~a~0; {6091#false} is VALID [2022-04-28 11:21:20,557 INFO L290 TraceCheckUtils]: 50: Hoare triple {6291#(< |main_#t~post7| 10)} assume !(#t~post7 < 10);havoc #t~post7; {6091#false} is VALID [2022-04-28 11:21:20,558 INFO L290 TraceCheckUtils]: 49: Hoare triple {6295#(< ~counter~0 10)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {6291#(< |main_#t~post7| 10)} is VALID [2022-04-28 11:21:20,558 INFO L290 TraceCheckUtils]: 48: Hoare triple {6295#(< ~counter~0 10)} ~a~0 := 2 * ~a~0;~b~0 := 2 * ~b~0; {6295#(< ~counter~0 10)} is VALID [2022-04-28 11:21:20,558 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {6090#true} {6295#(< ~counter~0 10)} #89#return; {6295#(< ~counter~0 10)} is VALID [2022-04-28 11:21:20,559 INFO L290 TraceCheckUtils]: 46: Hoare triple {6090#true} assume true; {6090#true} is VALID [2022-04-28 11:21:20,559 INFO L290 TraceCheckUtils]: 45: Hoare triple {6090#true} assume !(0 == ~cond); {6090#true} is VALID [2022-04-28 11:21:20,559 INFO L290 TraceCheckUtils]: 44: Hoare triple {6090#true} ~cond := #in~cond; {6090#true} is VALID [2022-04-28 11:21:20,559 INFO L272 TraceCheckUtils]: 43: Hoare triple {6295#(< ~counter~0 10)} call __VERIFIER_assert((if ~r~0 >= 2 * ~y~0 * ~a~0 then 1 else 0)); {6090#true} is VALID [2022-04-28 11:21:20,559 INFO L290 TraceCheckUtils]: 42: Hoare triple {6295#(< ~counter~0 10)} assume !!(~r~0 >= 2 * ~b~0); {6295#(< ~counter~0 10)} is VALID [2022-04-28 11:21:20,560 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {6090#true} {6295#(< ~counter~0 10)} #87#return; {6295#(< ~counter~0 10)} is VALID [2022-04-28 11:21:20,560 INFO L290 TraceCheckUtils]: 40: Hoare triple {6090#true} assume true; {6090#true} is VALID [2022-04-28 11:21:20,560 INFO L290 TraceCheckUtils]: 39: Hoare triple {6090#true} assume !(0 == ~cond); {6090#true} is VALID [2022-04-28 11:21:20,560 INFO L290 TraceCheckUtils]: 38: Hoare triple {6090#true} ~cond := #in~cond; {6090#true} is VALID [2022-04-28 11:21:20,560 INFO L272 TraceCheckUtils]: 37: Hoare triple {6295#(< ~counter~0 10)} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {6090#true} is VALID [2022-04-28 11:21:20,561 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {6090#true} {6295#(< ~counter~0 10)} #85#return; {6295#(< ~counter~0 10)} is VALID [2022-04-28 11:21:20,561 INFO L290 TraceCheckUtils]: 35: Hoare triple {6090#true} assume true; {6090#true} is VALID [2022-04-28 11:21:20,561 INFO L290 TraceCheckUtils]: 34: Hoare triple {6090#true} assume !(0 == ~cond); {6090#true} is VALID [2022-04-28 11:21:20,561 INFO L290 TraceCheckUtils]: 33: Hoare triple {6090#true} ~cond := #in~cond; {6090#true} is VALID [2022-04-28 11:21:20,561 INFO L272 TraceCheckUtils]: 32: Hoare triple {6295#(< ~counter~0 10)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {6090#true} is VALID [2022-04-28 11:21:20,562 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {6090#true} {6295#(< ~counter~0 10)} #83#return; {6295#(< ~counter~0 10)} is VALID [2022-04-28 11:21:20,562 INFO L290 TraceCheckUtils]: 30: Hoare triple {6090#true} assume true; {6090#true} is VALID [2022-04-28 11:21:20,562 INFO L290 TraceCheckUtils]: 29: Hoare triple {6090#true} assume !(0 == ~cond); {6090#true} is VALID [2022-04-28 11:21:20,562 INFO L290 TraceCheckUtils]: 28: Hoare triple {6090#true} ~cond := #in~cond; {6090#true} is VALID [2022-04-28 11:21:20,562 INFO L272 TraceCheckUtils]: 27: Hoare triple {6295#(< ~counter~0 10)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {6090#true} is VALID [2022-04-28 11:21:20,562 INFO L290 TraceCheckUtils]: 26: Hoare triple {6295#(< ~counter~0 10)} assume !!(#t~post7 < 10);havoc #t~post7; {6295#(< ~counter~0 10)} is VALID [2022-04-28 11:21:20,563 INFO L290 TraceCheckUtils]: 25: Hoare triple {6368#(< ~counter~0 9)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {6295#(< ~counter~0 10)} is VALID [2022-04-28 11:21:20,563 INFO L290 TraceCheckUtils]: 24: Hoare triple {6368#(< ~counter~0 9)} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {6368#(< ~counter~0 9)} is VALID [2022-04-28 11:21:20,569 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {6090#true} {6368#(< ~counter~0 9)} #81#return; {6368#(< ~counter~0 9)} is VALID [2022-04-28 11:21:20,569 INFO L290 TraceCheckUtils]: 22: Hoare triple {6090#true} assume true; {6090#true} is VALID [2022-04-28 11:21:20,569 INFO L290 TraceCheckUtils]: 21: Hoare triple {6090#true} assume !(0 == ~cond); {6090#true} is VALID [2022-04-28 11:21:20,569 INFO L290 TraceCheckUtils]: 20: Hoare triple {6090#true} ~cond := #in~cond; {6090#true} is VALID [2022-04-28 11:21:20,569 INFO L272 TraceCheckUtils]: 19: Hoare triple {6368#(< ~counter~0 9)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {6090#true} is VALID [2022-04-28 11:21:20,570 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {6090#true} {6368#(< ~counter~0 9)} #79#return; {6368#(< ~counter~0 9)} is VALID [2022-04-28 11:21:20,570 INFO L290 TraceCheckUtils]: 17: Hoare triple {6090#true} assume true; {6090#true} is VALID [2022-04-28 11:21:20,570 INFO L290 TraceCheckUtils]: 16: Hoare triple {6090#true} assume !(0 == ~cond); {6090#true} is VALID [2022-04-28 11:21:20,570 INFO L290 TraceCheckUtils]: 15: Hoare triple {6090#true} ~cond := #in~cond; {6090#true} is VALID [2022-04-28 11:21:20,570 INFO L272 TraceCheckUtils]: 14: Hoare triple {6368#(< ~counter~0 9)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {6090#true} is VALID [2022-04-28 11:21:20,570 INFO L290 TraceCheckUtils]: 13: Hoare triple {6368#(< ~counter~0 9)} assume !!(#t~post6 < 10);havoc #t~post6; {6368#(< ~counter~0 9)} is VALID [2022-04-28 11:21:20,571 INFO L290 TraceCheckUtils]: 12: Hoare triple {6408#(< ~counter~0 8)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6368#(< ~counter~0 9)} is VALID [2022-04-28 11:21:20,571 INFO L290 TraceCheckUtils]: 11: Hoare triple {6408#(< ~counter~0 8)} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {6408#(< ~counter~0 8)} is VALID [2022-04-28 11:21:20,571 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6090#true} {6408#(< ~counter~0 8)} #77#return; {6408#(< ~counter~0 8)} is VALID [2022-04-28 11:21:20,572 INFO L290 TraceCheckUtils]: 9: Hoare triple {6090#true} assume true; {6090#true} is VALID [2022-04-28 11:21:20,572 INFO L290 TraceCheckUtils]: 8: Hoare triple {6090#true} assume !(0 == ~cond); {6090#true} is VALID [2022-04-28 11:21:20,572 INFO L290 TraceCheckUtils]: 7: Hoare triple {6090#true} ~cond := #in~cond; {6090#true} is VALID [2022-04-28 11:21:20,572 INFO L272 TraceCheckUtils]: 6: Hoare triple {6408#(< ~counter~0 8)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {6090#true} is VALID [2022-04-28 11:21:20,572 INFO L290 TraceCheckUtils]: 5: Hoare triple {6408#(< ~counter~0 8)} 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 8)} is VALID [2022-04-28 11:21:20,572 INFO L272 TraceCheckUtils]: 4: Hoare triple {6408#(< ~counter~0 8)} call #t~ret8 := main(); {6408#(< ~counter~0 8)} is VALID [2022-04-28 11:21:20,573 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6408#(< ~counter~0 8)} {6090#true} #93#return; {6408#(< ~counter~0 8)} is VALID [2022-04-28 11:21:20,573 INFO L290 TraceCheckUtils]: 2: Hoare triple {6408#(< ~counter~0 8)} assume true; {6408#(< ~counter~0 8)} is VALID [2022-04-28 11:21:20,574 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 8)} is VALID [2022-04-28 11:21:20,574 INFO L272 TraceCheckUtils]: 0: Hoare triple {6090#true} call ULTIMATE.init(); {6090#true} is VALID [2022-04-28 11:21:20,574 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-28 11:21:20,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:21:20,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389480951] [2022-04-28 11:21:20,574 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:21:20,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1440890159] [2022-04-28 11:21:20,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1440890159] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 11:21:20,574 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 11:21:20,574 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-04-28 11:21:20,575 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:21:20,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [720923502] [2022-04-28 11:21:20,575 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [720923502] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:21:20,575 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:21:20,575 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 11:21:20,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273189820] [2022-04-28 11:21:20,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:21:20,575 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) Word has length 58 [2022-04-28 11:21:20,575 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:21:20,575 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2022-04-28 11:21:20,608 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:21:20,608 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 11:21:20,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:21:20,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 11:21:20,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-28 11:21:20,609 INFO L87 Difference]: Start difference. First operand 127 states and 158 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2022-04-28 11:21:20,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:21:20,846 INFO L93 Difference]: Finished difference Result 173 states and 218 transitions. [2022-04-28 11:21:20,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 11:21:20,846 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) Word has length 58 [2022-04-28 11:21:20,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:21:20,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2022-04-28 11:21:20,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 103 transitions. [2022-04-28 11:21:20,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2022-04-28 11:21:20,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 103 transitions. [2022-04-28 11:21:20,849 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 103 transitions. [2022-04-28 11:21:20,931 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:21:20,937 INFO L225 Difference]: With dead ends: 173 [2022-04-28 11:21:20,937 INFO L226 Difference]: Without dead ends: 130 [2022-04-28 11:21:20,937 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2022-04-28 11:21:20,938 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 10 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 11:21:20,938 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 163 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 11:21:20,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-04-28 11:21:21,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2022-04-28 11:21:21,042 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:21:21,042 INFO L82 GeneralOperation]: Start isEquivalent. First operand 130 states. Second operand has 130 states, 82 states have (on average 1.1829268292682926) internal successors, (97), 84 states have internal predecessors, (97), 33 states have call successors, (33), 15 states have call predecessors, (33), 14 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-28 11:21:21,042 INFO L74 IsIncluded]: Start isIncluded. First operand 130 states. Second operand has 130 states, 82 states have (on average 1.1829268292682926) internal successors, (97), 84 states have internal predecessors, (97), 33 states have call successors, (33), 15 states have call predecessors, (33), 14 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-28 11:21:21,042 INFO L87 Difference]: Start difference. First operand 130 states. Second operand has 130 states, 82 states have (on average 1.1829268292682926) internal successors, (97), 84 states have internal predecessors, (97), 33 states have call successors, (33), 15 states have call predecessors, (33), 14 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-28 11:21:21,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:21:21,045 INFO L93 Difference]: Finished difference Result 130 states and 161 transitions. [2022-04-28 11:21:21,045 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 161 transitions. [2022-04-28 11:21:21,045 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:21:21,045 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:21:21,046 INFO L74 IsIncluded]: Start isIncluded. First operand has 130 states, 82 states have (on average 1.1829268292682926) internal successors, (97), 84 states have internal predecessors, (97), 33 states have call successors, (33), 15 states have call predecessors, (33), 14 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) Second operand 130 states. [2022-04-28 11:21:21,046 INFO L87 Difference]: Start difference. First operand has 130 states, 82 states have (on average 1.1829268292682926) internal successors, (97), 84 states have internal predecessors, (97), 33 states have call successors, (33), 15 states have call predecessors, (33), 14 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) Second operand 130 states. [2022-04-28 11:21:21,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:21:21,048 INFO L93 Difference]: Finished difference Result 130 states and 161 transitions. [2022-04-28 11:21:21,048 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 161 transitions. [2022-04-28 11:21:21,048 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:21:21,048 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:21:21,049 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:21:21,049 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:21:21,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 82 states have (on average 1.1829268292682926) internal successors, (97), 84 states have internal predecessors, (97), 33 states have call successors, (33), 15 states have call predecessors, (33), 14 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-28 11:21:21,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 161 transitions. [2022-04-28 11:21:21,051 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 161 transitions. Word has length 58 [2022-04-28 11:21:21,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:21:21,051 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 161 transitions. [2022-04-28 11:21:21,051 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2022-04-28 11:21:21,051 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 130 states and 161 transitions. [2022-04-28 11:21:21,196 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 161 edges. 161 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:21:21,196 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 161 transitions. [2022-04-28 11:21:21,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-04-28 11:21:21,196 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:21:21,196 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:21:21,212 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-04-28 11:21:21,403 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-04-28 11:21:21,403 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:21:21,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:21:21,404 INFO L85 PathProgramCache]: Analyzing trace with hash 78053411, now seen corresponding path program 1 times [2022-04-28 11:21:21,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:21:21,405 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1353549997] [2022-04-28 11:21:36,996 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:21:36,997 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:21:36,997 INFO L85 PathProgramCache]: Analyzing trace with hash 78053411, now seen corresponding path program 2 times [2022-04-28 11:21:36,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:21:36,997 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346474727] [2022-04-28 11:21:36,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:21:36,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:21:37,007 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:21:37,007 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1190464829] [2022-04-28 11:21:37,007 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:21:37,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:21:37,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:21:37,008 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 11:21:37,009 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-04-28 11:21:37,049 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 11:21:37,049 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:21:37,050 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-28 11:21:37,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:21:37,066 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:21:37,216 INFO L272 TraceCheckUtils]: 0: Hoare triple {7315#true} call ULTIMATE.init(); {7315#true} is VALID [2022-04-28 11:21:37,216 INFO L290 TraceCheckUtils]: 1: Hoare triple {7315#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {7315#true} is VALID [2022-04-28 11:21:37,216 INFO L290 TraceCheckUtils]: 2: Hoare triple {7315#true} assume true; {7315#true} is VALID [2022-04-28 11:21:37,216 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7315#true} {7315#true} #93#return; {7315#true} is VALID [2022-04-28 11:21:37,216 INFO L272 TraceCheckUtils]: 4: Hoare triple {7315#true} call #t~ret8 := main(); {7315#true} is VALID [2022-04-28 11:21:37,216 INFO L290 TraceCheckUtils]: 5: Hoare triple {7315#true} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {7315#true} is VALID [2022-04-28 11:21:37,216 INFO L272 TraceCheckUtils]: 6: Hoare triple {7315#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {7315#true} is VALID [2022-04-28 11:21:37,216 INFO L290 TraceCheckUtils]: 7: Hoare triple {7315#true} ~cond := #in~cond; {7315#true} is VALID [2022-04-28 11:21:37,216 INFO L290 TraceCheckUtils]: 8: Hoare triple {7315#true} assume !(0 == ~cond); {7315#true} is VALID [2022-04-28 11:21:37,216 INFO L290 TraceCheckUtils]: 9: Hoare triple {7315#true} assume true; {7315#true} is VALID [2022-04-28 11:21:37,216 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7315#true} {7315#true} #77#return; {7315#true} is VALID [2022-04-28 11:21:37,217 INFO L290 TraceCheckUtils]: 11: Hoare triple {7315#true} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {7315#true} is VALID [2022-04-28 11:21:37,217 INFO L290 TraceCheckUtils]: 12: Hoare triple {7315#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7315#true} is VALID [2022-04-28 11:21:37,217 INFO L290 TraceCheckUtils]: 13: Hoare triple {7315#true} assume !!(#t~post6 < 10);havoc #t~post6; {7315#true} is VALID [2022-04-28 11:21:37,217 INFO L272 TraceCheckUtils]: 14: Hoare triple {7315#true} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {7315#true} is VALID [2022-04-28 11:21:37,217 INFO L290 TraceCheckUtils]: 15: Hoare triple {7315#true} ~cond := #in~cond; {7315#true} is VALID [2022-04-28 11:21:37,217 INFO L290 TraceCheckUtils]: 16: Hoare triple {7315#true} assume !(0 == ~cond); {7315#true} is VALID [2022-04-28 11:21:37,217 INFO L290 TraceCheckUtils]: 17: Hoare triple {7315#true} assume true; {7315#true} is VALID [2022-04-28 11:21:37,217 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {7315#true} {7315#true} #79#return; {7315#true} is VALID [2022-04-28 11:21:37,217 INFO L272 TraceCheckUtils]: 19: Hoare triple {7315#true} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {7315#true} is VALID [2022-04-28 11:21:37,217 INFO L290 TraceCheckUtils]: 20: Hoare triple {7315#true} ~cond := #in~cond; {7315#true} is VALID [2022-04-28 11:21:37,217 INFO L290 TraceCheckUtils]: 21: Hoare triple {7315#true} assume !(0 == ~cond); {7315#true} is VALID [2022-04-28 11:21:37,217 INFO L290 TraceCheckUtils]: 22: Hoare triple {7315#true} assume true; {7315#true} is VALID [2022-04-28 11:21:37,217 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {7315#true} {7315#true} #81#return; {7315#true} is VALID [2022-04-28 11:21:37,218 INFO L290 TraceCheckUtils]: 24: Hoare triple {7315#true} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {7392#(<= main_~b~0 main_~y~0)} is VALID [2022-04-28 11:21:37,218 INFO L290 TraceCheckUtils]: 25: Hoare triple {7392#(<= main_~b~0 main_~y~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {7392#(<= main_~b~0 main_~y~0)} is VALID [2022-04-28 11:21:37,218 INFO L290 TraceCheckUtils]: 26: Hoare triple {7392#(<= main_~b~0 main_~y~0)} assume !!(#t~post7 < 10);havoc #t~post7; {7392#(<= main_~b~0 main_~y~0)} is VALID [2022-04-28 11:21:37,218 INFO L272 TraceCheckUtils]: 27: Hoare triple {7392#(<= main_~b~0 main_~y~0)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {7315#true} is VALID [2022-04-28 11:21:37,218 INFO L290 TraceCheckUtils]: 28: Hoare triple {7315#true} ~cond := #in~cond; {7315#true} is VALID [2022-04-28 11:21:37,218 INFO L290 TraceCheckUtils]: 29: Hoare triple {7315#true} assume !(0 == ~cond); {7315#true} is VALID [2022-04-28 11:21:37,219 INFO L290 TraceCheckUtils]: 30: Hoare triple {7315#true} assume true; {7315#true} is VALID [2022-04-28 11:21:37,219 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {7315#true} {7392#(<= main_~b~0 main_~y~0)} #83#return; {7392#(<= main_~b~0 main_~y~0)} is VALID [2022-04-28 11:21:37,219 INFO L272 TraceCheckUtils]: 32: Hoare triple {7392#(<= main_~b~0 main_~y~0)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {7315#true} is VALID [2022-04-28 11:21:37,219 INFO L290 TraceCheckUtils]: 33: Hoare triple {7315#true} ~cond := #in~cond; {7315#true} is VALID [2022-04-28 11:21:37,219 INFO L290 TraceCheckUtils]: 34: Hoare triple {7315#true} assume !(0 == ~cond); {7315#true} is VALID [2022-04-28 11:21:37,219 INFO L290 TraceCheckUtils]: 35: Hoare triple {7315#true} assume true; {7315#true} is VALID [2022-04-28 11:21:37,220 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {7315#true} {7392#(<= main_~b~0 main_~y~0)} #85#return; {7392#(<= main_~b~0 main_~y~0)} is VALID [2022-04-28 11:21:37,220 INFO L272 TraceCheckUtils]: 37: Hoare triple {7392#(<= main_~b~0 main_~y~0)} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {7315#true} is VALID [2022-04-28 11:21:37,220 INFO L290 TraceCheckUtils]: 38: Hoare triple {7315#true} ~cond := #in~cond; {7315#true} is VALID [2022-04-28 11:21:37,220 INFO L290 TraceCheckUtils]: 39: Hoare triple {7315#true} assume !(0 == ~cond); {7315#true} is VALID [2022-04-28 11:21:37,220 INFO L290 TraceCheckUtils]: 40: Hoare triple {7315#true} assume true; {7315#true} is VALID [2022-04-28 11:21:37,221 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {7315#true} {7392#(<= main_~b~0 main_~y~0)} #87#return; {7392#(<= main_~b~0 main_~y~0)} is VALID [2022-04-28 11:21:37,221 INFO L290 TraceCheckUtils]: 42: Hoare triple {7392#(<= main_~b~0 main_~y~0)} assume !(~r~0 >= 2 * ~b~0); {7447#(and (not (<= (* main_~b~0 2) main_~r~0)) (<= main_~b~0 main_~y~0))} is VALID [2022-04-28 11:21:37,221 INFO L290 TraceCheckUtils]: 43: Hoare triple {7447#(and (not (<= (* main_~b~0 2) main_~r~0)) (<= main_~b~0 main_~y~0))} ~r~0 := ~r~0 - ~b~0;~q~0 := ~q~0 + ~a~0; {7451#(< main_~r~0 main_~y~0)} is VALID [2022-04-28 11:21:37,222 INFO L290 TraceCheckUtils]: 44: Hoare triple {7451#(< main_~r~0 main_~y~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7451#(< main_~r~0 main_~y~0)} is VALID [2022-04-28 11:21:37,222 INFO L290 TraceCheckUtils]: 45: Hoare triple {7451#(< main_~r~0 main_~y~0)} assume !!(#t~post6 < 10);havoc #t~post6; {7451#(< main_~r~0 main_~y~0)} is VALID [2022-04-28 11:21:37,222 INFO L272 TraceCheckUtils]: 46: Hoare triple {7451#(< main_~r~0 main_~y~0)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {7315#true} is VALID [2022-04-28 11:21:37,222 INFO L290 TraceCheckUtils]: 47: Hoare triple {7315#true} ~cond := #in~cond; {7315#true} is VALID [2022-04-28 11:21:37,222 INFO L290 TraceCheckUtils]: 48: Hoare triple {7315#true} assume !(0 == ~cond); {7315#true} is VALID [2022-04-28 11:21:37,222 INFO L290 TraceCheckUtils]: 49: Hoare triple {7315#true} assume true; {7315#true} is VALID [2022-04-28 11:21:37,223 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {7315#true} {7451#(< main_~r~0 main_~y~0)} #79#return; {7451#(< main_~r~0 main_~y~0)} is VALID [2022-04-28 11:21:37,223 INFO L272 TraceCheckUtils]: 51: Hoare triple {7451#(< main_~r~0 main_~y~0)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {7315#true} is VALID [2022-04-28 11:21:37,223 INFO L290 TraceCheckUtils]: 52: Hoare triple {7315#true} ~cond := #in~cond; {7315#true} is VALID [2022-04-28 11:21:37,223 INFO L290 TraceCheckUtils]: 53: Hoare triple {7315#true} assume !(0 == ~cond); {7315#true} is VALID [2022-04-28 11:21:37,223 INFO L290 TraceCheckUtils]: 54: Hoare triple {7315#true} assume true; {7315#true} is VALID [2022-04-28 11:21:37,224 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {7315#true} {7451#(< main_~r~0 main_~y~0)} #81#return; {7451#(< main_~r~0 main_~y~0)} is VALID [2022-04-28 11:21:37,224 INFO L290 TraceCheckUtils]: 56: Hoare triple {7451#(< main_~r~0 main_~y~0)} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {7316#false} is VALID [2022-04-28 11:21:37,224 INFO L290 TraceCheckUtils]: 57: Hoare triple {7316#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {7316#false} is VALID [2022-04-28 11:21:37,224 INFO L290 TraceCheckUtils]: 58: Hoare triple {7316#false} assume !(#t~post7 < 10);havoc #t~post7; {7316#false} is VALID [2022-04-28 11:21:37,224 INFO L290 TraceCheckUtils]: 59: Hoare triple {7316#false} ~r~0 := ~r~0 - ~b~0;~q~0 := ~q~0 + ~a~0; {7316#false} is VALID [2022-04-28 11:21:37,224 INFO L290 TraceCheckUtils]: 60: Hoare triple {7316#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7316#false} is VALID [2022-04-28 11:21:37,224 INFO L290 TraceCheckUtils]: 61: Hoare triple {7316#false} assume !(#t~post6 < 10);havoc #t~post6; {7316#false} is VALID [2022-04-28 11:21:37,224 INFO L272 TraceCheckUtils]: 62: Hoare triple {7316#false} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {7316#false} is VALID [2022-04-28 11:21:37,224 INFO L290 TraceCheckUtils]: 63: Hoare triple {7316#false} ~cond := #in~cond; {7316#false} is VALID [2022-04-28 11:21:37,225 INFO L290 TraceCheckUtils]: 64: Hoare triple {7316#false} assume 0 == ~cond; {7316#false} is VALID [2022-04-28 11:21:37,225 INFO L290 TraceCheckUtils]: 65: Hoare triple {7316#false} assume !false; {7316#false} is VALID [2022-04-28 11:21:37,225 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-04-28 11:21:37,225 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 11:21:37,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:21:37,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346474727] [2022-04-28 11:21:37,225 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:21:37,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1190464829] [2022-04-28 11:21:37,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1190464829] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:21:37,225 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:21:37,225 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 11:21:37,226 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:21:37,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1353549997] [2022-04-28 11:21:37,226 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1353549997] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:21:37,226 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:21:37,226 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 11:21:37,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261267015] [2022-04-28 11:21:37,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:21:37,226 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 4 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 66 [2022-04-28 11:21:37,226 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:21:37,227 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 4 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-28 11:21:37,255 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:21:37,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 11:21:37,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:21:37,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 11:21:37,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-28 11:21:37,255 INFO L87 Difference]: Start difference. First operand 130 states and 161 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 4 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-28 11:21:37,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:21:37,517 INFO L93 Difference]: Finished difference Result 190 states and 240 transitions. [2022-04-28 11:21:37,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 11:21:37,517 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 4 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 66 [2022-04-28 11:21:37,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:21:37,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 4 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-28 11:21:37,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 109 transitions. [2022-04-28 11:21:37,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 4 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-28 11:21:37,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 109 transitions. [2022-04-28 11:21:37,520 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 109 transitions. [2022-04-28 11:21:37,591 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:21:37,593 INFO L225 Difference]: With dead ends: 190 [2022-04-28 11:21:37,593 INFO L226 Difference]: Without dead ends: 119 [2022-04-28 11:21:37,595 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-04-28 11:21:37,595 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 11 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 11:21:37,595 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 120 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 11:21:37,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-04-28 11:21:37,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 112. [2022-04-28 11:21:37,713 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:21:37,713 INFO L82 GeneralOperation]: Start isEquivalent. First operand 119 states. Second operand has 112 states, 72 states have (on average 1.1527777777777777) internal successors, (83), 74 states have internal predecessors, (83), 26 states have call successors, (26), 14 states have call predecessors, (26), 13 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-28 11:21:37,714 INFO L74 IsIncluded]: Start isIncluded. First operand 119 states. Second operand has 112 states, 72 states have (on average 1.1527777777777777) internal successors, (83), 74 states have internal predecessors, (83), 26 states have call successors, (26), 14 states have call predecessors, (26), 13 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-28 11:21:37,714 INFO L87 Difference]: Start difference. First operand 119 states. Second operand has 112 states, 72 states have (on average 1.1527777777777777) internal successors, (83), 74 states have internal predecessors, (83), 26 states have call successors, (26), 14 states have call predecessors, (26), 13 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-28 11:21:37,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:21:37,716 INFO L93 Difference]: Finished difference Result 119 states and 143 transitions. [2022-04-28 11:21:37,716 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 143 transitions. [2022-04-28 11:21:37,716 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:21:37,716 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:21:37,716 INFO L74 IsIncluded]: Start isIncluded. First operand has 112 states, 72 states have (on average 1.1527777777777777) internal successors, (83), 74 states have internal predecessors, (83), 26 states have call successors, (26), 14 states have call predecessors, (26), 13 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) Second operand 119 states. [2022-04-28 11:21:37,717 INFO L87 Difference]: Start difference. First operand has 112 states, 72 states have (on average 1.1527777777777777) internal successors, (83), 74 states have internal predecessors, (83), 26 states have call successors, (26), 14 states have call predecessors, (26), 13 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) Second operand 119 states. [2022-04-28 11:21:37,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:21:37,719 INFO L93 Difference]: Finished difference Result 119 states and 143 transitions. [2022-04-28 11:21:37,719 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 143 transitions. [2022-04-28 11:21:37,719 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:21:37,719 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:21:37,719 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:21:37,719 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:21:37,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 72 states have (on average 1.1527777777777777) internal successors, (83), 74 states have internal predecessors, (83), 26 states have call successors, (26), 14 states have call predecessors, (26), 13 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-28 11:21:37,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 133 transitions. [2022-04-28 11:21:37,721 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 133 transitions. Word has length 66 [2022-04-28 11:21:37,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:21:37,721 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 133 transitions. [2022-04-28 11:21:37,722 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 4 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-28 11:21:37,722 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 112 states and 133 transitions. [2022-04-28 11:21:37,859 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 133 edges. 133 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:21:37,860 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 133 transitions. [2022-04-28 11:21:37,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-04-28 11:21:37,860 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:21:37,860 INFO L195 NwaCegarLoop]: trace histogram [10, 9, 9, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:21:37,879 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-04-28 11:21:38,061 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-04-28 11:21:38,061 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:21:38,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:21:38,061 INFO L85 PathProgramCache]: Analyzing trace with hash -1361251212, now seen corresponding path program 1 times [2022-04-28 11:21:38,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:21:38,062 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [619187156] [2022-04-28 11:21:53,365 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:21:53,366 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:21:53,366 INFO L85 PathProgramCache]: Analyzing trace with hash -1361251212, now seen corresponding path program 2 times [2022-04-28 11:21:53,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:21:53,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161763277] [2022-04-28 11:21:53,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:21:53,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:21:53,376 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:21:53,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [783254604] [2022-04-28 11:21:53,376 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:21:53,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:21:53,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:21:53,377 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 11:21:53,378 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-04-28 11:21:53,423 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 11:21:53,423 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:21:53,424 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-28 11:21:53,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:21:53,436 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:21:53,684 INFO L272 TraceCheckUtils]: 0: Hoare triple {8362#true} call ULTIMATE.init(); {8362#true} is VALID [2022-04-28 11:21:53,685 INFO L290 TraceCheckUtils]: 1: Hoare triple {8362#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {8370#(<= ~counter~0 0)} is VALID [2022-04-28 11:21:53,685 INFO L290 TraceCheckUtils]: 2: Hoare triple {8370#(<= ~counter~0 0)} assume true; {8370#(<= ~counter~0 0)} is VALID [2022-04-28 11:21:53,686 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8370#(<= ~counter~0 0)} {8362#true} #93#return; {8370#(<= ~counter~0 0)} is VALID [2022-04-28 11:21:53,686 INFO L272 TraceCheckUtils]: 4: Hoare triple {8370#(<= ~counter~0 0)} call #t~ret8 := main(); {8370#(<= ~counter~0 0)} is VALID [2022-04-28 11:21:53,686 INFO L290 TraceCheckUtils]: 5: Hoare triple {8370#(<= ~counter~0 0)} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {8370#(<= ~counter~0 0)} is VALID [2022-04-28 11:21:53,687 INFO L272 TraceCheckUtils]: 6: Hoare triple {8370#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {8370#(<= ~counter~0 0)} is VALID [2022-04-28 11:21:53,687 INFO L290 TraceCheckUtils]: 7: Hoare triple {8370#(<= ~counter~0 0)} ~cond := #in~cond; {8370#(<= ~counter~0 0)} is VALID [2022-04-28 11:21:53,687 INFO L290 TraceCheckUtils]: 8: Hoare triple {8370#(<= ~counter~0 0)} assume !(0 == ~cond); {8370#(<= ~counter~0 0)} is VALID [2022-04-28 11:21:53,687 INFO L290 TraceCheckUtils]: 9: Hoare triple {8370#(<= ~counter~0 0)} assume true; {8370#(<= ~counter~0 0)} is VALID [2022-04-28 11:21:53,688 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8370#(<= ~counter~0 0)} {8370#(<= ~counter~0 0)} #77#return; {8370#(<= ~counter~0 0)} is VALID [2022-04-28 11:21:53,688 INFO L290 TraceCheckUtils]: 11: Hoare triple {8370#(<= ~counter~0 0)} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {8370#(<= ~counter~0 0)} is VALID [2022-04-28 11:21:53,689 INFO L290 TraceCheckUtils]: 12: Hoare triple {8370#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8404#(<= ~counter~0 1)} is VALID [2022-04-28 11:21:53,689 INFO L290 TraceCheckUtils]: 13: Hoare triple {8404#(<= ~counter~0 1)} assume !!(#t~post6 < 10);havoc #t~post6; {8404#(<= ~counter~0 1)} is VALID [2022-04-28 11:21:53,689 INFO L272 TraceCheckUtils]: 14: Hoare triple {8404#(<= ~counter~0 1)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {8404#(<= ~counter~0 1)} is VALID [2022-04-28 11:21:53,689 INFO L290 TraceCheckUtils]: 15: Hoare triple {8404#(<= ~counter~0 1)} ~cond := #in~cond; {8404#(<= ~counter~0 1)} is VALID [2022-04-28 11:21:53,690 INFO L290 TraceCheckUtils]: 16: Hoare triple {8404#(<= ~counter~0 1)} assume !(0 == ~cond); {8404#(<= ~counter~0 1)} is VALID [2022-04-28 11:21:53,690 INFO L290 TraceCheckUtils]: 17: Hoare triple {8404#(<= ~counter~0 1)} assume true; {8404#(<= ~counter~0 1)} is VALID [2022-04-28 11:21:53,691 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {8404#(<= ~counter~0 1)} {8404#(<= ~counter~0 1)} #79#return; {8404#(<= ~counter~0 1)} is VALID [2022-04-28 11:21:53,691 INFO L272 TraceCheckUtils]: 19: Hoare triple {8404#(<= ~counter~0 1)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {8404#(<= ~counter~0 1)} is VALID [2022-04-28 11:21:53,691 INFO L290 TraceCheckUtils]: 20: Hoare triple {8404#(<= ~counter~0 1)} ~cond := #in~cond; {8404#(<= ~counter~0 1)} is VALID [2022-04-28 11:21:53,692 INFO L290 TraceCheckUtils]: 21: Hoare triple {8404#(<= ~counter~0 1)} assume !(0 == ~cond); {8404#(<= ~counter~0 1)} is VALID [2022-04-28 11:21:53,692 INFO L290 TraceCheckUtils]: 22: Hoare triple {8404#(<= ~counter~0 1)} assume true; {8404#(<= ~counter~0 1)} is VALID [2022-04-28 11:21:53,692 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {8404#(<= ~counter~0 1)} {8404#(<= ~counter~0 1)} #81#return; {8404#(<= ~counter~0 1)} is VALID [2022-04-28 11:21:53,692 INFO L290 TraceCheckUtils]: 24: Hoare triple {8404#(<= ~counter~0 1)} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {8404#(<= ~counter~0 1)} is VALID [2022-04-28 11:21:53,693 INFO L290 TraceCheckUtils]: 25: Hoare triple {8404#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {8444#(<= ~counter~0 2)} is VALID [2022-04-28 11:21:53,693 INFO L290 TraceCheckUtils]: 26: Hoare triple {8444#(<= ~counter~0 2)} assume !!(#t~post7 < 10);havoc #t~post7; {8444#(<= ~counter~0 2)} is VALID [2022-04-28 11:21:53,694 INFO L272 TraceCheckUtils]: 27: Hoare triple {8444#(<= ~counter~0 2)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {8444#(<= ~counter~0 2)} is VALID [2022-04-28 11:21:53,694 INFO L290 TraceCheckUtils]: 28: Hoare triple {8444#(<= ~counter~0 2)} ~cond := #in~cond; {8444#(<= ~counter~0 2)} is VALID [2022-04-28 11:21:53,694 INFO L290 TraceCheckUtils]: 29: Hoare triple {8444#(<= ~counter~0 2)} assume !(0 == ~cond); {8444#(<= ~counter~0 2)} is VALID [2022-04-28 11:21:53,694 INFO L290 TraceCheckUtils]: 30: Hoare triple {8444#(<= ~counter~0 2)} assume true; {8444#(<= ~counter~0 2)} is VALID [2022-04-28 11:21:53,695 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {8444#(<= ~counter~0 2)} {8444#(<= ~counter~0 2)} #83#return; {8444#(<= ~counter~0 2)} is VALID [2022-04-28 11:21:53,695 INFO L272 TraceCheckUtils]: 32: Hoare triple {8444#(<= ~counter~0 2)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {8444#(<= ~counter~0 2)} is VALID [2022-04-28 11:21:53,695 INFO L290 TraceCheckUtils]: 33: Hoare triple {8444#(<= ~counter~0 2)} ~cond := #in~cond; {8444#(<= ~counter~0 2)} is VALID [2022-04-28 11:21:53,696 INFO L290 TraceCheckUtils]: 34: Hoare triple {8444#(<= ~counter~0 2)} assume !(0 == ~cond); {8444#(<= ~counter~0 2)} is VALID [2022-04-28 11:21:53,696 INFO L290 TraceCheckUtils]: 35: Hoare triple {8444#(<= ~counter~0 2)} assume true; {8444#(<= ~counter~0 2)} is VALID [2022-04-28 11:21:53,696 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {8444#(<= ~counter~0 2)} {8444#(<= ~counter~0 2)} #85#return; {8444#(<= ~counter~0 2)} is VALID [2022-04-28 11:21:53,697 INFO L272 TraceCheckUtils]: 37: Hoare triple {8444#(<= ~counter~0 2)} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {8444#(<= ~counter~0 2)} is VALID [2022-04-28 11:21:53,697 INFO L290 TraceCheckUtils]: 38: Hoare triple {8444#(<= ~counter~0 2)} ~cond := #in~cond; {8444#(<= ~counter~0 2)} is VALID [2022-04-28 11:21:53,697 INFO L290 TraceCheckUtils]: 39: Hoare triple {8444#(<= ~counter~0 2)} assume !(0 == ~cond); {8444#(<= ~counter~0 2)} is VALID [2022-04-28 11:21:53,698 INFO L290 TraceCheckUtils]: 40: Hoare triple {8444#(<= ~counter~0 2)} assume true; {8444#(<= ~counter~0 2)} is VALID [2022-04-28 11:21:53,698 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {8444#(<= ~counter~0 2)} {8444#(<= ~counter~0 2)} #87#return; {8444#(<= ~counter~0 2)} is VALID [2022-04-28 11:21:53,698 INFO L290 TraceCheckUtils]: 42: Hoare triple {8444#(<= ~counter~0 2)} assume !!(~r~0 >= 2 * ~b~0); {8444#(<= ~counter~0 2)} is VALID [2022-04-28 11:21:53,699 INFO L272 TraceCheckUtils]: 43: Hoare triple {8444#(<= ~counter~0 2)} call __VERIFIER_assert((if ~r~0 >= 2 * ~y~0 * ~a~0 then 1 else 0)); {8444#(<= ~counter~0 2)} is VALID [2022-04-28 11:21:53,699 INFO L290 TraceCheckUtils]: 44: Hoare triple {8444#(<= ~counter~0 2)} ~cond := #in~cond; {8444#(<= ~counter~0 2)} is VALID [2022-04-28 11:21:53,699 INFO L290 TraceCheckUtils]: 45: Hoare triple {8444#(<= ~counter~0 2)} assume !(0 == ~cond); {8444#(<= ~counter~0 2)} is VALID [2022-04-28 11:21:53,699 INFO L290 TraceCheckUtils]: 46: Hoare triple {8444#(<= ~counter~0 2)} assume true; {8444#(<= ~counter~0 2)} is VALID [2022-04-28 11:21:53,700 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {8444#(<= ~counter~0 2)} {8444#(<= ~counter~0 2)} #89#return; {8444#(<= ~counter~0 2)} is VALID [2022-04-28 11:21:53,700 INFO L290 TraceCheckUtils]: 48: Hoare triple {8444#(<= ~counter~0 2)} ~a~0 := 2 * ~a~0;~b~0 := 2 * ~b~0; {8444#(<= ~counter~0 2)} is VALID [2022-04-28 11:21:53,700 INFO L290 TraceCheckUtils]: 49: Hoare triple {8444#(<= ~counter~0 2)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {8517#(<= ~counter~0 3)} is VALID [2022-04-28 11:21:53,701 INFO L290 TraceCheckUtils]: 50: Hoare triple {8517#(<= ~counter~0 3)} assume !!(#t~post7 < 10);havoc #t~post7; {8517#(<= ~counter~0 3)} is VALID [2022-04-28 11:21:53,701 INFO L272 TraceCheckUtils]: 51: Hoare triple {8517#(<= ~counter~0 3)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {8517#(<= ~counter~0 3)} is VALID [2022-04-28 11:21:53,701 INFO L290 TraceCheckUtils]: 52: Hoare triple {8517#(<= ~counter~0 3)} ~cond := #in~cond; {8517#(<= ~counter~0 3)} is VALID [2022-04-28 11:21:53,702 INFO L290 TraceCheckUtils]: 53: Hoare triple {8517#(<= ~counter~0 3)} assume !(0 == ~cond); {8517#(<= ~counter~0 3)} is VALID [2022-04-28 11:21:53,702 INFO L290 TraceCheckUtils]: 54: Hoare triple {8517#(<= ~counter~0 3)} assume true; {8517#(<= ~counter~0 3)} is VALID [2022-04-28 11:21:53,702 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {8517#(<= ~counter~0 3)} {8517#(<= ~counter~0 3)} #83#return; {8517#(<= ~counter~0 3)} is VALID [2022-04-28 11:21:53,703 INFO L272 TraceCheckUtils]: 56: Hoare triple {8517#(<= ~counter~0 3)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {8517#(<= ~counter~0 3)} is VALID [2022-04-28 11:21:53,703 INFO L290 TraceCheckUtils]: 57: Hoare triple {8517#(<= ~counter~0 3)} ~cond := #in~cond; {8517#(<= ~counter~0 3)} is VALID [2022-04-28 11:21:53,703 INFO L290 TraceCheckUtils]: 58: Hoare triple {8517#(<= ~counter~0 3)} assume !(0 == ~cond); {8517#(<= ~counter~0 3)} is VALID [2022-04-28 11:21:53,703 INFO L290 TraceCheckUtils]: 59: Hoare triple {8517#(<= ~counter~0 3)} assume true; {8517#(<= ~counter~0 3)} is VALID [2022-04-28 11:21:53,704 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {8517#(<= ~counter~0 3)} {8517#(<= ~counter~0 3)} #85#return; {8517#(<= ~counter~0 3)} is VALID [2022-04-28 11:21:53,704 INFO L272 TraceCheckUtils]: 61: Hoare triple {8517#(<= ~counter~0 3)} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {8517#(<= ~counter~0 3)} is VALID [2022-04-28 11:21:53,705 INFO L290 TraceCheckUtils]: 62: Hoare triple {8517#(<= ~counter~0 3)} ~cond := #in~cond; {8517#(<= ~counter~0 3)} is VALID [2022-04-28 11:21:53,705 INFO L290 TraceCheckUtils]: 63: Hoare triple {8517#(<= ~counter~0 3)} assume !(0 == ~cond); {8517#(<= ~counter~0 3)} is VALID [2022-04-28 11:21:53,705 INFO L290 TraceCheckUtils]: 64: Hoare triple {8517#(<= ~counter~0 3)} assume true; {8517#(<= ~counter~0 3)} is VALID [2022-04-28 11:21:53,705 INFO L284 TraceCheckUtils]: 65: Hoare quadruple {8517#(<= ~counter~0 3)} {8517#(<= ~counter~0 3)} #87#return; {8517#(<= ~counter~0 3)} is VALID [2022-04-28 11:21:53,706 INFO L290 TraceCheckUtils]: 66: Hoare triple {8517#(<= ~counter~0 3)} assume !(~r~0 >= 2 * ~b~0); {8517#(<= ~counter~0 3)} is VALID [2022-04-28 11:21:53,706 INFO L290 TraceCheckUtils]: 67: Hoare triple {8517#(<= ~counter~0 3)} ~r~0 := ~r~0 - ~b~0;~q~0 := ~q~0 + ~a~0; {8517#(<= ~counter~0 3)} is VALID [2022-04-28 11:21:53,706 INFO L290 TraceCheckUtils]: 68: Hoare triple {8517#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8575#(<= |main_#t~post6| 3)} is VALID [2022-04-28 11:21:53,707 INFO L290 TraceCheckUtils]: 69: Hoare triple {8575#(<= |main_#t~post6| 3)} assume !(#t~post6 < 10);havoc #t~post6; {8363#false} is VALID [2022-04-28 11:21:53,707 INFO L272 TraceCheckUtils]: 70: Hoare triple {8363#false} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {8363#false} is VALID [2022-04-28 11:21:53,707 INFO L290 TraceCheckUtils]: 71: Hoare triple {8363#false} ~cond := #in~cond; {8363#false} is VALID [2022-04-28 11:21:53,707 INFO L290 TraceCheckUtils]: 72: Hoare triple {8363#false} assume 0 == ~cond; {8363#false} is VALID [2022-04-28 11:21:53,707 INFO L290 TraceCheckUtils]: 73: Hoare triple {8363#false} assume !false; {8363#false} is VALID [2022-04-28 11:21:53,707 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 18 proven. 112 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-04-28 11:21:53,707 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:21:53,990 INFO L290 TraceCheckUtils]: 73: Hoare triple {8363#false} assume !false; {8363#false} is VALID [2022-04-28 11:21:53,990 INFO L290 TraceCheckUtils]: 72: Hoare triple {8363#false} assume 0 == ~cond; {8363#false} is VALID [2022-04-28 11:21:53,991 INFO L290 TraceCheckUtils]: 71: Hoare triple {8363#false} ~cond := #in~cond; {8363#false} is VALID [2022-04-28 11:21:53,991 INFO L272 TraceCheckUtils]: 70: Hoare triple {8363#false} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {8363#false} is VALID [2022-04-28 11:21:53,991 INFO L290 TraceCheckUtils]: 69: Hoare triple {8603#(< |main_#t~post6| 10)} assume !(#t~post6 < 10);havoc #t~post6; {8363#false} is VALID [2022-04-28 11:21:53,991 INFO L290 TraceCheckUtils]: 68: Hoare triple {8607#(< ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8603#(< |main_#t~post6| 10)} is VALID [2022-04-28 11:21:53,991 INFO L290 TraceCheckUtils]: 67: Hoare triple {8607#(< ~counter~0 10)} ~r~0 := ~r~0 - ~b~0;~q~0 := ~q~0 + ~a~0; {8607#(< ~counter~0 10)} is VALID [2022-04-28 11:21:53,992 INFO L290 TraceCheckUtils]: 66: Hoare triple {8607#(< ~counter~0 10)} assume !(~r~0 >= 2 * ~b~0); {8607#(< ~counter~0 10)} is VALID [2022-04-28 11:21:53,992 INFO L284 TraceCheckUtils]: 65: Hoare quadruple {8362#true} {8607#(< ~counter~0 10)} #87#return; {8607#(< ~counter~0 10)} is VALID [2022-04-28 11:21:53,992 INFO L290 TraceCheckUtils]: 64: Hoare triple {8362#true} assume true; {8362#true} is VALID [2022-04-28 11:21:53,992 INFO L290 TraceCheckUtils]: 63: Hoare triple {8362#true} assume !(0 == ~cond); {8362#true} is VALID [2022-04-28 11:21:53,992 INFO L290 TraceCheckUtils]: 62: Hoare triple {8362#true} ~cond := #in~cond; {8362#true} is VALID [2022-04-28 11:21:53,992 INFO L272 TraceCheckUtils]: 61: Hoare triple {8607#(< ~counter~0 10)} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {8362#true} is VALID [2022-04-28 11:21:53,993 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {8362#true} {8607#(< ~counter~0 10)} #85#return; {8607#(< ~counter~0 10)} is VALID [2022-04-28 11:21:53,993 INFO L290 TraceCheckUtils]: 59: Hoare triple {8362#true} assume true; {8362#true} is VALID [2022-04-28 11:21:53,993 INFO L290 TraceCheckUtils]: 58: Hoare triple {8362#true} assume !(0 == ~cond); {8362#true} is VALID [2022-04-28 11:21:53,993 INFO L290 TraceCheckUtils]: 57: Hoare triple {8362#true} ~cond := #in~cond; {8362#true} is VALID [2022-04-28 11:21:53,993 INFO L272 TraceCheckUtils]: 56: Hoare triple {8607#(< ~counter~0 10)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {8362#true} is VALID [2022-04-28 11:21:53,994 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {8362#true} {8607#(< ~counter~0 10)} #83#return; {8607#(< ~counter~0 10)} is VALID [2022-04-28 11:21:53,994 INFO L290 TraceCheckUtils]: 54: Hoare triple {8362#true} assume true; {8362#true} is VALID [2022-04-28 11:21:53,994 INFO L290 TraceCheckUtils]: 53: Hoare triple {8362#true} assume !(0 == ~cond); {8362#true} is VALID [2022-04-28 11:21:53,994 INFO L290 TraceCheckUtils]: 52: Hoare triple {8362#true} ~cond := #in~cond; {8362#true} is VALID [2022-04-28 11:21:53,994 INFO L272 TraceCheckUtils]: 51: Hoare triple {8607#(< ~counter~0 10)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {8362#true} is VALID [2022-04-28 11:21:53,994 INFO L290 TraceCheckUtils]: 50: Hoare triple {8607#(< ~counter~0 10)} assume !!(#t~post7 < 10);havoc #t~post7; {8607#(< ~counter~0 10)} is VALID [2022-04-28 11:21:53,995 INFO L290 TraceCheckUtils]: 49: Hoare triple {8665#(< ~counter~0 9)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {8607#(< ~counter~0 10)} is VALID [2022-04-28 11:21:53,995 INFO L290 TraceCheckUtils]: 48: Hoare triple {8665#(< ~counter~0 9)} ~a~0 := 2 * ~a~0;~b~0 := 2 * ~b~0; {8665#(< ~counter~0 9)} is VALID [2022-04-28 11:21:53,995 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {8362#true} {8665#(< ~counter~0 9)} #89#return; {8665#(< ~counter~0 9)} is VALID [2022-04-28 11:21:53,995 INFO L290 TraceCheckUtils]: 46: Hoare triple {8362#true} assume true; {8362#true} is VALID [2022-04-28 11:21:53,996 INFO L290 TraceCheckUtils]: 45: Hoare triple {8362#true} assume !(0 == ~cond); {8362#true} is VALID [2022-04-28 11:21:53,996 INFO L290 TraceCheckUtils]: 44: Hoare triple {8362#true} ~cond := #in~cond; {8362#true} is VALID [2022-04-28 11:21:53,996 INFO L272 TraceCheckUtils]: 43: Hoare triple {8665#(< ~counter~0 9)} call __VERIFIER_assert((if ~r~0 >= 2 * ~y~0 * ~a~0 then 1 else 0)); {8362#true} is VALID [2022-04-28 11:21:53,996 INFO L290 TraceCheckUtils]: 42: Hoare triple {8665#(< ~counter~0 9)} assume !!(~r~0 >= 2 * ~b~0); {8665#(< ~counter~0 9)} is VALID [2022-04-28 11:21:53,996 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {8362#true} {8665#(< ~counter~0 9)} #87#return; {8665#(< ~counter~0 9)} is VALID [2022-04-28 11:21:53,996 INFO L290 TraceCheckUtils]: 40: Hoare triple {8362#true} assume true; {8362#true} is VALID [2022-04-28 11:21:53,996 INFO L290 TraceCheckUtils]: 39: Hoare triple {8362#true} assume !(0 == ~cond); {8362#true} is VALID [2022-04-28 11:21:53,997 INFO L290 TraceCheckUtils]: 38: Hoare triple {8362#true} ~cond := #in~cond; {8362#true} is VALID [2022-04-28 11:21:53,997 INFO L272 TraceCheckUtils]: 37: Hoare triple {8665#(< ~counter~0 9)} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {8362#true} is VALID [2022-04-28 11:21:53,997 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {8362#true} {8665#(< ~counter~0 9)} #85#return; {8665#(< ~counter~0 9)} is VALID [2022-04-28 11:21:53,997 INFO L290 TraceCheckUtils]: 35: Hoare triple {8362#true} assume true; {8362#true} is VALID [2022-04-28 11:21:53,997 INFO L290 TraceCheckUtils]: 34: Hoare triple {8362#true} assume !(0 == ~cond); {8362#true} is VALID [2022-04-28 11:21:53,997 INFO L290 TraceCheckUtils]: 33: Hoare triple {8362#true} ~cond := #in~cond; {8362#true} is VALID [2022-04-28 11:21:53,997 INFO L272 TraceCheckUtils]: 32: Hoare triple {8665#(< ~counter~0 9)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {8362#true} is VALID [2022-04-28 11:21:53,998 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {8362#true} {8665#(< ~counter~0 9)} #83#return; {8665#(< ~counter~0 9)} is VALID [2022-04-28 11:21:53,998 INFO L290 TraceCheckUtils]: 30: Hoare triple {8362#true} assume true; {8362#true} is VALID [2022-04-28 11:21:53,998 INFO L290 TraceCheckUtils]: 29: Hoare triple {8362#true} assume !(0 == ~cond); {8362#true} is VALID [2022-04-28 11:21:53,998 INFO L290 TraceCheckUtils]: 28: Hoare triple {8362#true} ~cond := #in~cond; {8362#true} is VALID [2022-04-28 11:21:53,998 INFO L272 TraceCheckUtils]: 27: Hoare triple {8665#(< ~counter~0 9)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {8362#true} is VALID [2022-04-28 11:21:53,998 INFO L290 TraceCheckUtils]: 26: Hoare triple {8665#(< ~counter~0 9)} assume !!(#t~post7 < 10);havoc #t~post7; {8665#(< ~counter~0 9)} is VALID [2022-04-28 11:21:53,999 INFO L290 TraceCheckUtils]: 25: Hoare triple {8738#(< ~counter~0 8)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {8665#(< ~counter~0 9)} is VALID [2022-04-28 11:21:53,999 INFO L290 TraceCheckUtils]: 24: Hoare triple {8738#(< ~counter~0 8)} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {8738#(< ~counter~0 8)} is VALID [2022-04-28 11:21:53,999 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {8362#true} {8738#(< ~counter~0 8)} #81#return; {8738#(< ~counter~0 8)} is VALID [2022-04-28 11:21:54,000 INFO L290 TraceCheckUtils]: 22: Hoare triple {8362#true} assume true; {8362#true} is VALID [2022-04-28 11:21:54,000 INFO L290 TraceCheckUtils]: 21: Hoare triple {8362#true} assume !(0 == ~cond); {8362#true} is VALID [2022-04-28 11:21:54,000 INFO L290 TraceCheckUtils]: 20: Hoare triple {8362#true} ~cond := #in~cond; {8362#true} is VALID [2022-04-28 11:21:54,000 INFO L272 TraceCheckUtils]: 19: Hoare triple {8738#(< ~counter~0 8)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {8362#true} is VALID [2022-04-28 11:21:54,003 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {8362#true} {8738#(< ~counter~0 8)} #79#return; {8738#(< ~counter~0 8)} is VALID [2022-04-28 11:21:54,003 INFO L290 TraceCheckUtils]: 17: Hoare triple {8362#true} assume true; {8362#true} is VALID [2022-04-28 11:21:54,003 INFO L290 TraceCheckUtils]: 16: Hoare triple {8362#true} assume !(0 == ~cond); {8362#true} is VALID [2022-04-28 11:21:54,003 INFO L290 TraceCheckUtils]: 15: Hoare triple {8362#true} ~cond := #in~cond; {8362#true} is VALID [2022-04-28 11:21:54,003 INFO L272 TraceCheckUtils]: 14: Hoare triple {8738#(< ~counter~0 8)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {8362#true} is VALID [2022-04-28 11:21:54,003 INFO L290 TraceCheckUtils]: 13: Hoare triple {8738#(< ~counter~0 8)} assume !!(#t~post6 < 10);havoc #t~post6; {8738#(< ~counter~0 8)} is VALID [2022-04-28 11:21:54,004 INFO L290 TraceCheckUtils]: 12: Hoare triple {8778#(< ~counter~0 7)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8738#(< ~counter~0 8)} is VALID [2022-04-28 11:21:54,004 INFO L290 TraceCheckUtils]: 11: Hoare triple {8778#(< ~counter~0 7)} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {8778#(< ~counter~0 7)} is VALID [2022-04-28 11:21:54,004 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8362#true} {8778#(< ~counter~0 7)} #77#return; {8778#(< ~counter~0 7)} is VALID [2022-04-28 11:21:54,004 INFO L290 TraceCheckUtils]: 9: Hoare triple {8362#true} assume true; {8362#true} is VALID [2022-04-28 11:21:54,005 INFO L290 TraceCheckUtils]: 8: Hoare triple {8362#true} assume !(0 == ~cond); {8362#true} is VALID [2022-04-28 11:21:54,005 INFO L290 TraceCheckUtils]: 7: Hoare triple {8362#true} ~cond := #in~cond; {8362#true} is VALID [2022-04-28 11:21:54,005 INFO L272 TraceCheckUtils]: 6: Hoare triple {8778#(< ~counter~0 7)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {8362#true} is VALID [2022-04-28 11:21:54,005 INFO L290 TraceCheckUtils]: 5: Hoare triple {8778#(< ~counter~0 7)} 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 7)} is VALID [2022-04-28 11:21:54,005 INFO L272 TraceCheckUtils]: 4: Hoare triple {8778#(< ~counter~0 7)} call #t~ret8 := main(); {8778#(< ~counter~0 7)} is VALID [2022-04-28 11:21:54,005 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8778#(< ~counter~0 7)} {8362#true} #93#return; {8778#(< ~counter~0 7)} is VALID [2022-04-28 11:21:54,006 INFO L290 TraceCheckUtils]: 2: Hoare triple {8778#(< ~counter~0 7)} assume true; {8778#(< ~counter~0 7)} is VALID [2022-04-28 11:21:54,006 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 7)} is VALID [2022-04-28 11:21:54,006 INFO L272 TraceCheckUtils]: 0: Hoare triple {8362#true} call ULTIMATE.init(); {8362#true} is VALID [2022-04-28 11:21:54,006 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 18 proven. 8 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2022-04-28 11:21:54,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:21:54,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161763277] [2022-04-28 11:21:54,007 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:21:54,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [783254604] [2022-04-28 11:21:54,007 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [783254604] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 11:21:54,007 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 11:21:54,007 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2022-04-28 11:21:54,007 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:21:54,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [619187156] [2022-04-28 11:21:54,007 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [619187156] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:21:54,007 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:21:54,008 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 11:21:54,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676919469] [2022-04-28 11:21:54,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:21:54,008 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 6 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (11), 4 states have call predecessors, (11), 5 states have call successors, (11) Word has length 74 [2022-04-28 11:21:54,008 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:21:54,008 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 6 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (11), 4 states have call predecessors, (11), 5 states have call successors, (11) [2022-04-28 11:21:54,060 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:21:54,061 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 11:21:54,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:21:54,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 11:21:54,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2022-04-28 11:21:54,061 INFO L87 Difference]: Start difference. First operand 112 states and 133 transitions. Second operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 6 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (11), 4 states have call predecessors, (11), 5 states have call successors, (11) [2022-04-28 11:21:54,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:21:54,345 INFO L93 Difference]: Finished difference Result 141 states and 164 transitions. [2022-04-28 11:21:54,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 11:21:54,345 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 6 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (11), 4 states have call predecessors, (11), 5 states have call successors, (11) Word has length 74 [2022-04-28 11:21:54,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:21:54,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 6 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (11), 4 states have call predecessors, (11), 5 states have call successors, (11) [2022-04-28 11:21:54,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 94 transitions. [2022-04-28 11:21:54,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 6 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (11), 4 states have call predecessors, (11), 5 states have call successors, (11) [2022-04-28 11:21:54,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 94 transitions. [2022-04-28 11:21:54,351 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 94 transitions. [2022-04-28 11:21:54,414 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:21:54,417 INFO L225 Difference]: With dead ends: 141 [2022-04-28 11:21:54,417 INFO L226 Difference]: Without dead ends: 134 [2022-04-28 11:21:54,418 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2022-04-28 11:21:54,419 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 14 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 11:21:54,420 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 161 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 11:21:54,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2022-04-28 11:21:54,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 132. [2022-04-28 11:21:54,570 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:21:54,570 INFO L82 GeneralOperation]: Start isEquivalent. First operand 134 states. Second operand has 132 states, 85 states have (on average 1.1411764705882352) internal successors, (97), 88 states have internal predecessors, (97), 30 states have call successors, (30), 17 states have call predecessors, (30), 16 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-28 11:21:54,570 INFO L74 IsIncluded]: Start isIncluded. First operand 134 states. Second operand has 132 states, 85 states have (on average 1.1411764705882352) internal successors, (97), 88 states have internal predecessors, (97), 30 states have call successors, (30), 17 states have call predecessors, (30), 16 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-28 11:21:54,570 INFO L87 Difference]: Start difference. First operand 134 states. Second operand has 132 states, 85 states have (on average 1.1411764705882352) internal successors, (97), 88 states have internal predecessors, (97), 30 states have call successors, (30), 17 states have call predecessors, (30), 16 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-28 11:21:54,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:21:54,573 INFO L93 Difference]: Finished difference Result 134 states and 157 transitions. [2022-04-28 11:21:54,573 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 157 transitions. [2022-04-28 11:21:54,573 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:21:54,573 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:21:54,573 INFO L74 IsIncluded]: Start isIncluded. First operand has 132 states, 85 states have (on average 1.1411764705882352) internal successors, (97), 88 states have internal predecessors, (97), 30 states have call successors, (30), 17 states have call predecessors, (30), 16 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) Second operand 134 states. [2022-04-28 11:21:54,574 INFO L87 Difference]: Start difference. First operand has 132 states, 85 states have (on average 1.1411764705882352) internal successors, (97), 88 states have internal predecessors, (97), 30 states have call successors, (30), 17 states have call predecessors, (30), 16 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) Second operand 134 states. [2022-04-28 11:21:54,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:21:54,576 INFO L93 Difference]: Finished difference Result 134 states and 157 transitions. [2022-04-28 11:21:54,576 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 157 transitions. [2022-04-28 11:21:54,576 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:21:54,576 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:21:54,576 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:21:54,576 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:21:54,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 85 states have (on average 1.1411764705882352) internal successors, (97), 88 states have internal predecessors, (97), 30 states have call successors, (30), 17 states have call predecessors, (30), 16 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-28 11:21:54,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 155 transitions. [2022-04-28 11:21:54,579 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 155 transitions. Word has length 74 [2022-04-28 11:21:54,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:21:54,579 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 155 transitions. [2022-04-28 11:21:54,579 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 6 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (11), 4 states have call predecessors, (11), 5 states have call successors, (11) [2022-04-28 11:21:54,579 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 132 states and 155 transitions. [2022-04-28 11:21:54,721 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 155 edges. 155 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:21:54,722 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 155 transitions. [2022-04-28 11:21:54,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-04-28 11:21:54,722 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:21:54,722 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:21:54,738 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-04-28 11:21:54,923 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-04-28 11:21:54,923 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:21:54,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:21:54,923 INFO L85 PathProgramCache]: Analyzing trace with hash 1777426592, now seen corresponding path program 1 times [2022-04-28 11:21:54,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:21:54,923 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [384924854] [2022-04-28 11:21:55,196 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:22:14,786 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:22:14,787 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:22:14,787 INFO L85 PathProgramCache]: Analyzing trace with hash 1777426592, now seen corresponding path program 2 times [2022-04-28 11:22:14,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:22:14,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490496619] [2022-04-28 11:22:14,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:22:14,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:22:14,797 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:22:14,797 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1248297130] [2022-04-28 11:22:14,797 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:22:14,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:22:14,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:22:14,798 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 11:22:14,799 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-04-28 11:22:14,847 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 11:22:14,848 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:22:14,850 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 26 conjunts are in the unsatisfiable core [2022-04-28 11:22:14,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:22:14,870 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:22:16,474 INFO L272 TraceCheckUtils]: 0: Hoare triple {9633#true} call ULTIMATE.init(); {9633#true} is VALID [2022-04-28 11:22:16,475 INFO L290 TraceCheckUtils]: 1: Hoare triple {9633#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {9633#true} is VALID [2022-04-28 11:22:16,475 INFO L290 TraceCheckUtils]: 2: Hoare triple {9633#true} assume true; {9633#true} is VALID [2022-04-28 11:22:16,475 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9633#true} {9633#true} #93#return; {9633#true} is VALID [2022-04-28 11:22:16,475 INFO L272 TraceCheckUtils]: 4: Hoare triple {9633#true} call #t~ret8 := main(); {9633#true} is VALID [2022-04-28 11:22:16,475 INFO L290 TraceCheckUtils]: 5: Hoare triple {9633#true} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {9633#true} is VALID [2022-04-28 11:22:16,475 INFO L272 TraceCheckUtils]: 6: Hoare triple {9633#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {9633#true} is VALID [2022-04-28 11:22:16,475 INFO L290 TraceCheckUtils]: 7: Hoare triple {9633#true} ~cond := #in~cond; {9659#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 11:22:16,476 INFO L290 TraceCheckUtils]: 8: Hoare triple {9659#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {9663#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 11:22:16,476 INFO L290 TraceCheckUtils]: 9: Hoare triple {9663#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {9663#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 11:22:16,476 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {9663#(not (= |assume_abort_if_not_#in~cond| 0))} {9633#true} #77#return; {9670#(<= 1 main_~y~0)} is VALID [2022-04-28 11:22:16,477 INFO L290 TraceCheckUtils]: 11: Hoare triple {9670#(<= 1 main_~y~0)} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {9674#(and (= main_~x~0 main_~r~0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-28 11:22:16,477 INFO L290 TraceCheckUtils]: 12: Hoare triple {9674#(and (= main_~x~0 main_~r~0) (= main_~q~0 0) (<= 1 main_~y~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9674#(and (= main_~x~0 main_~r~0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-28 11:22:16,477 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 < 10);havoc #t~post6; {9674#(and (= main_~x~0 main_~r~0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-28 11:22:16,477 INFO L272 TraceCheckUtils]: 14: Hoare triple {9674#(and (= main_~x~0 main_~r~0) (= main_~q~0 0) (<= 1 main_~y~0))} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {9633#true} is VALID [2022-04-28 11:22:16,477 INFO L290 TraceCheckUtils]: 15: Hoare triple {9633#true} ~cond := #in~cond; {9633#true} is VALID [2022-04-28 11:22:16,478 INFO L290 TraceCheckUtils]: 16: Hoare triple {9633#true} assume !(0 == ~cond); {9633#true} is VALID [2022-04-28 11:22:16,478 INFO L290 TraceCheckUtils]: 17: Hoare triple {9633#true} assume true; {9633#true} is VALID [2022-04-28 11:22:16,478 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {9633#true} {9674#(and (= main_~x~0 main_~r~0) (= main_~q~0 0) (<= 1 main_~y~0))} #79#return; {9674#(and (= main_~x~0 main_~r~0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-28 11:22:16,478 INFO L272 TraceCheckUtils]: 19: Hoare triple {9674#(and (= main_~x~0 main_~r~0) (= main_~q~0 0) (<= 1 main_~y~0))} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {9633#true} is VALID [2022-04-28 11:22:16,478 INFO L290 TraceCheckUtils]: 20: Hoare triple {9633#true} ~cond := #in~cond; {9633#true} is VALID [2022-04-28 11:22:16,478 INFO L290 TraceCheckUtils]: 21: Hoare triple {9633#true} assume !(0 == ~cond); {9633#true} is VALID [2022-04-28 11:22:16,478 INFO L290 TraceCheckUtils]: 22: Hoare triple {9633#true} assume true; {9633#true} is VALID [2022-04-28 11:22:16,479 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {9633#true} {9674#(and (= main_~x~0 main_~r~0) (= main_~q~0 0) (<= 1 main_~y~0))} #81#return; {9674#(and (= main_~x~0 main_~r~0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-28 11:22:16,479 INFO L290 TraceCheckUtils]: 24: Hoare triple {9674#(and (= main_~x~0 main_~r~0) (= main_~q~0 0) (<= 1 main_~y~0))} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {9714#(and (= main_~x~0 main_~r~0) (<= 1 main_~a~0) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-28 11:22:16,480 INFO L290 TraceCheckUtils]: 25: Hoare triple {9714#(and (= main_~x~0 main_~r~0) (<= 1 main_~a~0) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {9714#(and (= main_~x~0 main_~r~0) (<= 1 main_~a~0) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-28 11:22:16,480 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 < 10);havoc #t~post7; {9714#(and (= main_~x~0 main_~r~0) (<= 1 main_~a~0) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-28 11:22:16,480 INFO L272 TraceCheckUtils]: 27: Hoare triple {9714#(and (= main_~x~0 main_~r~0) (<= 1 main_~a~0) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {9633#true} is VALID [2022-04-28 11:22:16,480 INFO L290 TraceCheckUtils]: 28: Hoare triple {9633#true} ~cond := #in~cond; {9633#true} is VALID [2022-04-28 11:22:16,480 INFO L290 TraceCheckUtils]: 29: Hoare triple {9633#true} assume !(0 == ~cond); {9633#true} is VALID [2022-04-28 11:22:16,480 INFO L290 TraceCheckUtils]: 30: Hoare triple {9633#true} assume true; {9633#true} is VALID [2022-04-28 11:22:16,481 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {9633#true} {9714#(and (= main_~x~0 main_~r~0) (<= 1 main_~a~0) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} #83#return; {9714#(and (= main_~x~0 main_~r~0) (<= 1 main_~a~0) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-28 11:22:16,481 INFO L272 TraceCheckUtils]: 32: Hoare triple {9714#(and (= main_~x~0 main_~r~0) (<= 1 main_~a~0) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {9633#true} is VALID [2022-04-28 11:22:16,481 INFO L290 TraceCheckUtils]: 33: Hoare triple {9633#true} ~cond := #in~cond; {9633#true} is VALID [2022-04-28 11:22:16,481 INFO L290 TraceCheckUtils]: 34: Hoare triple {9633#true} assume !(0 == ~cond); {9633#true} is VALID [2022-04-28 11:22:16,481 INFO L290 TraceCheckUtils]: 35: Hoare triple {9633#true} assume true; {9633#true} is VALID [2022-04-28 11:22:16,482 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {9633#true} {9714#(and (= main_~x~0 main_~r~0) (<= 1 main_~a~0) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} #85#return; {9714#(and (= main_~x~0 main_~r~0) (<= 1 main_~a~0) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-28 11:22:16,482 INFO L272 TraceCheckUtils]: 37: Hoare triple {9714#(and (= main_~x~0 main_~r~0) (<= 1 main_~a~0) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {9633#true} is VALID [2022-04-28 11:22:16,482 INFO L290 TraceCheckUtils]: 38: Hoare triple {9633#true} ~cond := #in~cond; {9633#true} is VALID [2022-04-28 11:22:16,482 INFO L290 TraceCheckUtils]: 39: Hoare triple {9633#true} assume !(0 == ~cond); {9633#true} is VALID [2022-04-28 11:22:16,482 INFO L290 TraceCheckUtils]: 40: Hoare triple {9633#true} assume true; {9633#true} is VALID [2022-04-28 11:22:16,483 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {9633#true} {9714#(and (= main_~x~0 main_~r~0) (<= 1 main_~a~0) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} #87#return; {9714#(and (= main_~x~0 main_~r~0) (<= 1 main_~a~0) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-28 11:22:16,483 INFO L290 TraceCheckUtils]: 42: Hoare triple {9714#(and (= main_~x~0 main_~r~0) (<= 1 main_~a~0) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} assume !!(~r~0 >= 2 * ~b~0); {9714#(and (= main_~x~0 main_~r~0) (<= 1 main_~a~0) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-28 11:22:16,483 INFO L272 TraceCheckUtils]: 43: Hoare triple {9714#(and (= main_~x~0 main_~r~0) (<= 1 main_~a~0) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} call __VERIFIER_assert((if ~r~0 >= 2 * ~y~0 * ~a~0 then 1 else 0)); {9633#true} is VALID [2022-04-28 11:22:16,483 INFO L290 TraceCheckUtils]: 44: Hoare triple {9633#true} ~cond := #in~cond; {9633#true} is VALID [2022-04-28 11:22:16,483 INFO L290 TraceCheckUtils]: 45: Hoare triple {9633#true} assume !(0 == ~cond); {9633#true} is VALID [2022-04-28 11:22:16,483 INFO L290 TraceCheckUtils]: 46: Hoare triple {9633#true} assume true; {9633#true} is VALID [2022-04-28 11:22:16,484 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {9633#true} {9714#(and (= main_~x~0 main_~r~0) (<= 1 main_~a~0) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} #89#return; {9714#(and (= main_~x~0 main_~r~0) (<= 1 main_~a~0) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-28 11:22:16,485 INFO L290 TraceCheckUtils]: 48: Hoare triple {9714#(and (= main_~x~0 main_~r~0) (<= 1 main_~a~0) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} ~a~0 := 2 * ~a~0;~b~0 := 2 * ~b~0; {9787#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (<= 1 (div (* (- 1) main_~a~0) (- 2))) (<= (div (- main_~b~0) (- 2)) main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-28 11:22:16,486 INFO L290 TraceCheckUtils]: 49: Hoare triple {9787#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (<= 1 (div (* (- 1) main_~a~0) (- 2))) (<= (div (- main_~b~0) (- 2)) main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {9787#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (<= 1 (div (* (- 1) main_~a~0) (- 2))) (<= (div (- main_~b~0) (- 2)) main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-28 11:22:16,486 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 < 10);havoc #t~post7; {9787#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (<= 1 (div (* (- 1) main_~a~0) (- 2))) (<= (div (- main_~b~0) (- 2)) main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-28 11:22:16,486 INFO L272 TraceCheckUtils]: 51: Hoare triple {9787#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (<= 1 (div (* (- 1) main_~a~0) (- 2))) (<= (div (- main_~b~0) (- 2)) main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {9633#true} is VALID [2022-04-28 11:22:16,487 INFO L290 TraceCheckUtils]: 52: Hoare triple {9633#true} ~cond := #in~cond; {9633#true} is VALID [2022-04-28 11:22:16,487 INFO L290 TraceCheckUtils]: 53: Hoare triple {9633#true} assume !(0 == ~cond); {9633#true} is VALID [2022-04-28 11:22:16,487 INFO L290 TraceCheckUtils]: 54: Hoare triple {9633#true} assume true; {9633#true} is VALID [2022-04-28 11:22:16,487 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {9633#true} {9787#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (<= 1 (div (* (- 1) main_~a~0) (- 2))) (<= (div (- main_~b~0) (- 2)) main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} #83#return; {9787#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (<= 1 (div (* (- 1) main_~a~0) (- 2))) (<= (div (- main_~b~0) (- 2)) main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-28 11:22:16,487 INFO L272 TraceCheckUtils]: 56: Hoare triple {9787#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (<= 1 (div (* (- 1) main_~a~0) (- 2))) (<= (div (- main_~b~0) (- 2)) main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {9633#true} is VALID [2022-04-28 11:22:16,487 INFO L290 TraceCheckUtils]: 57: Hoare triple {9633#true} ~cond := #in~cond; {9633#true} is VALID [2022-04-28 11:22:16,487 INFO L290 TraceCheckUtils]: 58: Hoare triple {9633#true} assume !(0 == ~cond); {9633#true} is VALID [2022-04-28 11:22:16,488 INFO L290 TraceCheckUtils]: 59: Hoare triple {9633#true} assume true; {9633#true} is VALID [2022-04-28 11:22:16,488 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {9633#true} {9787#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (<= 1 (div (* (- 1) main_~a~0) (- 2))) (<= (div (- main_~b~0) (- 2)) main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} #85#return; {9787#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (<= 1 (div (* (- 1) main_~a~0) (- 2))) (<= (div (- main_~b~0) (- 2)) main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-28 11:22:16,488 INFO L272 TraceCheckUtils]: 61: Hoare triple {9787#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (<= 1 (div (* (- 1) main_~a~0) (- 2))) (<= (div (- main_~b~0) (- 2)) main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {9633#true} is VALID [2022-04-28 11:22:16,488 INFO L290 TraceCheckUtils]: 62: Hoare triple {9633#true} ~cond := #in~cond; {9633#true} is VALID [2022-04-28 11:22:16,488 INFO L290 TraceCheckUtils]: 63: Hoare triple {9633#true} assume !(0 == ~cond); {9633#true} is VALID [2022-04-28 11:22:16,488 INFO L290 TraceCheckUtils]: 64: Hoare triple {9633#true} assume true; {9633#true} is VALID [2022-04-28 11:22:16,489 INFO L284 TraceCheckUtils]: 65: Hoare quadruple {9633#true} {9787#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (<= 1 (div (* (- 1) main_~a~0) (- 2))) (<= (div (- main_~b~0) (- 2)) main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} #87#return; {9787#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (<= 1 (div (* (- 1) main_~a~0) (- 2))) (<= (div (- main_~b~0) (- 2)) main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-28 11:22:16,489 INFO L290 TraceCheckUtils]: 66: Hoare triple {9787#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (<= 1 (div (* (- 1) main_~a~0) (- 2))) (<= (div (- main_~b~0) (- 2)) main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} assume !(~r~0 >= 2 * ~b~0); {9787#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (<= 1 (div (* (- 1) main_~a~0) (- 2))) (<= (div (- main_~b~0) (- 2)) main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-28 11:22:16,490 INFO L290 TraceCheckUtils]: 67: Hoare triple {9787#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (<= 1 (div (* (- 1) main_~a~0) (- 2))) (<= (div (- main_~b~0) (- 2)) main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} ~r~0 := ~r~0 - ~b~0;~q~0 := ~q~0 + ~a~0; {9845#(and (= (+ (* (- 1) main_~a~0) main_~q~0) 0) (= (mod main_~a~0 2) 0) (<= 1 (div (* (- 1) main_~a~0) (- 2))) (<= (div (- main_~b~0) (- 2)) main_~y~0) (= main_~x~0 (+ main_~b~0 main_~r~0)) (<= 1 main_~y~0))} is VALID [2022-04-28 11:22:16,490 INFO L290 TraceCheckUtils]: 68: Hoare triple {9845#(and (= (+ (* (- 1) main_~a~0) main_~q~0) 0) (= (mod main_~a~0 2) 0) (<= 1 (div (* (- 1) main_~a~0) (- 2))) (<= (div (- main_~b~0) (- 2)) main_~y~0) (= main_~x~0 (+ main_~b~0 main_~r~0)) (<= 1 main_~y~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9845#(and (= (+ (* (- 1) main_~a~0) main_~q~0) 0) (= (mod main_~a~0 2) 0) (<= 1 (div (* (- 1) main_~a~0) (- 2))) (<= (div (- main_~b~0) (- 2)) main_~y~0) (= main_~x~0 (+ main_~b~0 main_~r~0)) (<= 1 main_~y~0))} is VALID [2022-04-28 11:22:16,491 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 < 10);havoc #t~post6; {9845#(and (= (+ (* (- 1) main_~a~0) main_~q~0) 0) (= (mod main_~a~0 2) 0) (<= 1 (div (* (- 1) main_~a~0) (- 2))) (<= (div (- main_~b~0) (- 2)) main_~y~0) (= main_~x~0 (+ main_~b~0 main_~r~0)) (<= 1 main_~y~0))} is VALID [2022-04-28 11:22:16,491 INFO L272 TraceCheckUtils]: 70: Hoare triple {9845#(and (= (+ (* (- 1) main_~a~0) main_~q~0) 0) (= (mod main_~a~0 2) 0) (<= 1 (div (* (- 1) main_~a~0) (- 2))) (<= (div (- main_~b~0) (- 2)) main_~y~0) (= main_~x~0 (+ main_~b~0 main_~r~0)) (<= 1 main_~y~0))} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {9633#true} is VALID [2022-04-28 11:22:16,491 INFO L290 TraceCheckUtils]: 71: Hoare triple {9633#true} ~cond := #in~cond; {9858#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:22:16,491 INFO L290 TraceCheckUtils]: 72: Hoare triple {9858#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {9862#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:22:16,492 INFO L290 TraceCheckUtils]: 73: Hoare triple {9862#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {9862#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:22:16,495 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {9862#(not (= |__VERIFIER_assert_#in~cond| 0))} {9845#(and (= (+ (* (- 1) main_~a~0) main_~q~0) 0) (= (mod main_~a~0 2) 0) (<= 1 (div (* (- 1) main_~a~0) (- 2))) (<= (div (- main_~b~0) (- 2)) main_~y~0) (= main_~x~0 (+ main_~b~0 main_~r~0)) (<= 1 main_~y~0))} #79#return; {9869#(and (<= 1 (div (* (- 1) main_~q~0) (- 2))) (= (+ main_~x~0 (* (- 1) main_~r~0)) (* main_~q~0 main_~y~0)) (= (mod main_~q~0 2) 0) (<= 1 main_~y~0) (<= (div (+ main_~r~0 (* (- 1) main_~x~0)) (- 2)) main_~y~0))} is VALID [2022-04-28 11:22:16,495 INFO L272 TraceCheckUtils]: 75: Hoare triple {9869#(and (<= 1 (div (* (- 1) main_~q~0) (- 2))) (= (+ main_~x~0 (* (- 1) main_~r~0)) (* main_~q~0 main_~y~0)) (= (mod main_~q~0 2) 0) (<= 1 main_~y~0) (<= (div (+ main_~r~0 (* (- 1) main_~x~0)) (- 2)) main_~y~0))} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {9873#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:22:16,496 INFO L290 TraceCheckUtils]: 76: Hoare triple {9873#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {9877#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:22:16,496 INFO L290 TraceCheckUtils]: 77: Hoare triple {9877#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {9634#false} is VALID [2022-04-28 11:22:16,496 INFO L290 TraceCheckUtils]: 78: Hoare triple {9634#false} assume !false; {9634#false} is VALID [2022-04-28 11:22:16,496 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 46 proven. 11 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2022-04-28 11:22:16,497 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:22:27,068 INFO L290 TraceCheckUtils]: 78: Hoare triple {9634#false} assume !false; {9634#false} is VALID [2022-04-28 11:22:27,069 INFO L290 TraceCheckUtils]: 77: Hoare triple {9877#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {9634#false} is VALID [2022-04-28 11:22:27,069 INFO L290 TraceCheckUtils]: 76: Hoare triple {9873#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {9877#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:22:27,069 INFO L272 TraceCheckUtils]: 75: Hoare triple {9893#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {9873#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:22:27,070 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {9862#(not (= |__VERIFIER_assert_#in~cond| 0))} {9897#(or (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (not (= main_~b~0 (* main_~a~0 main_~y~0))))} #79#return; {9893#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:22:27,070 INFO L290 TraceCheckUtils]: 73: Hoare triple {9862#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {9862#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:22:27,070 INFO L290 TraceCheckUtils]: 72: Hoare triple {9907#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {9862#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:22:27,071 INFO L290 TraceCheckUtils]: 71: Hoare triple {9633#true} ~cond := #in~cond; {9907#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 11:22:27,071 INFO L272 TraceCheckUtils]: 70: Hoare triple {9897#(or (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (not (= main_~b~0 (* main_~a~0 main_~y~0))))} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {9633#true} is VALID [2022-04-28 11:22:27,071 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 < 10);havoc #t~post6; {9897#(or (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (not (= main_~b~0 (* main_~a~0 main_~y~0))))} is VALID [2022-04-28 11:22:27,072 INFO L290 TraceCheckUtils]: 68: Hoare triple {9897#(or (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (not (= main_~b~0 (* main_~a~0 main_~y~0))))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9897#(or (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (not (= main_~b~0 (* main_~a~0 main_~y~0))))} is VALID [2022-04-28 11:22:27,079 INFO L290 TraceCheckUtils]: 67: Hoare triple {9897#(or (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (not (= main_~b~0 (* main_~a~0 main_~y~0))))} ~r~0 := ~r~0 - ~b~0;~q~0 := ~q~0 + ~a~0; {9897#(or (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (not (= main_~b~0 (* main_~a~0 main_~y~0))))} is VALID [2022-04-28 11:22:27,079 INFO L290 TraceCheckUtils]: 66: Hoare triple {9897#(or (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (not (= main_~b~0 (* main_~a~0 main_~y~0))))} assume !(~r~0 >= 2 * ~b~0); {9897#(or (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (not (= main_~b~0 (* main_~a~0 main_~y~0))))} is VALID [2022-04-28 11:22:27,104 INFO L284 TraceCheckUtils]: 65: Hoare quadruple {9633#true} {9897#(or (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (not (= main_~b~0 (* main_~a~0 main_~y~0))))} #87#return; {9897#(or (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (not (= main_~b~0 (* main_~a~0 main_~y~0))))} is VALID [2022-04-28 11:22:27,104 INFO L290 TraceCheckUtils]: 64: Hoare triple {9633#true} assume true; {9633#true} is VALID [2022-04-28 11:22:27,104 INFO L290 TraceCheckUtils]: 63: Hoare triple {9633#true} assume !(0 == ~cond); {9633#true} is VALID [2022-04-28 11:22:27,104 INFO L290 TraceCheckUtils]: 62: Hoare triple {9633#true} ~cond := #in~cond; {9633#true} is VALID [2022-04-28 11:22:27,104 INFO L272 TraceCheckUtils]: 61: Hoare triple {9897#(or (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (not (= main_~b~0 (* main_~a~0 main_~y~0))))} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {9633#true} is VALID [2022-04-28 11:22:27,105 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {9633#true} {9897#(or (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (not (= main_~b~0 (* main_~a~0 main_~y~0))))} #85#return; {9897#(or (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (not (= main_~b~0 (* main_~a~0 main_~y~0))))} is VALID [2022-04-28 11:22:27,105 INFO L290 TraceCheckUtils]: 59: Hoare triple {9633#true} assume true; {9633#true} is VALID [2022-04-28 11:22:27,105 INFO L290 TraceCheckUtils]: 58: Hoare triple {9633#true} assume !(0 == ~cond); {9633#true} is VALID [2022-04-28 11:22:27,105 INFO L290 TraceCheckUtils]: 57: Hoare triple {9633#true} ~cond := #in~cond; {9633#true} is VALID [2022-04-28 11:22:27,105 INFO L272 TraceCheckUtils]: 56: Hoare triple {9897#(or (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (not (= main_~b~0 (* main_~a~0 main_~y~0))))} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {9633#true} is VALID [2022-04-28 11:22:27,106 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {9633#true} {9897#(or (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (not (= main_~b~0 (* main_~a~0 main_~y~0))))} #83#return; {9897#(or (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (not (= main_~b~0 (* main_~a~0 main_~y~0))))} is VALID [2022-04-28 11:22:27,106 INFO L290 TraceCheckUtils]: 54: Hoare triple {9633#true} assume true; {9633#true} is VALID [2022-04-28 11:22:27,106 INFO L290 TraceCheckUtils]: 53: Hoare triple {9633#true} assume !(0 == ~cond); {9633#true} is VALID [2022-04-28 11:22:27,106 INFO L290 TraceCheckUtils]: 52: Hoare triple {9633#true} ~cond := #in~cond; {9633#true} is VALID [2022-04-28 11:22:27,106 INFO L272 TraceCheckUtils]: 51: Hoare triple {9897#(or (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (not (= main_~b~0 (* main_~a~0 main_~y~0))))} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {9633#true} is VALID [2022-04-28 11:22:27,107 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 < 10);havoc #t~post7; {9897#(or (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (not (= main_~b~0 (* main_~a~0 main_~y~0))))} is VALID [2022-04-28 11:22:27,107 INFO L290 TraceCheckUtils]: 49: Hoare triple {9897#(or (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (not (= main_~b~0 (* main_~a~0 main_~y~0))))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {9897#(or (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (not (= main_~b~0 (* main_~a~0 main_~y~0))))} is VALID [2022-04-28 11:22:27,108 INFO L290 TraceCheckUtils]: 48: Hoare triple {9977#(or (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (not (<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))))} ~a~0 := 2 * ~a~0;~b~0 := 2 * ~b~0; {9897#(or (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (not (= main_~b~0 (* main_~a~0 main_~y~0))))} is VALID [2022-04-28 11:22:27,109 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {9633#true} {9977#(or (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (not (<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))))} #89#return; {9977#(or (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (not (<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))))} is VALID [2022-04-28 11:22:27,109 INFO L290 TraceCheckUtils]: 46: Hoare triple {9633#true} assume true; {9633#true} is VALID [2022-04-28 11:22:27,109 INFO L290 TraceCheckUtils]: 45: Hoare triple {9633#true} assume !(0 == ~cond); {9633#true} is VALID [2022-04-28 11:22:27,109 INFO L290 TraceCheckUtils]: 44: Hoare triple {9633#true} ~cond := #in~cond; {9633#true} is VALID [2022-04-28 11:22:27,109 INFO L272 TraceCheckUtils]: 43: Hoare triple {9977#(or (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (not (<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))))} call __VERIFIER_assert((if ~r~0 >= 2 * ~y~0 * ~a~0 then 1 else 0)); {9633#true} is VALID [2022-04-28 11:22:27,110 INFO L290 TraceCheckUtils]: 42: Hoare triple {9977#(or (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (not (<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))))} assume !!(~r~0 >= 2 * ~b~0); {9977#(or (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (not (<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))))} is VALID [2022-04-28 11:22:27,110 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {9633#true} {9977#(or (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (not (<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))))} #87#return; {9977#(or (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (not (<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))))} is VALID [2022-04-28 11:22:27,110 INFO L290 TraceCheckUtils]: 40: Hoare triple {9633#true} assume true; {9633#true} is VALID [2022-04-28 11:22:27,110 INFO L290 TraceCheckUtils]: 39: Hoare triple {9633#true} assume !(0 == ~cond); {9633#true} is VALID [2022-04-28 11:22:27,110 INFO L290 TraceCheckUtils]: 38: Hoare triple {9633#true} ~cond := #in~cond; {9633#true} is VALID [2022-04-28 11:22:27,110 INFO L272 TraceCheckUtils]: 37: Hoare triple {9977#(or (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (not (<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))))} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {9633#true} is VALID [2022-04-28 11:22:27,111 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {9633#true} {9977#(or (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (not (<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))))} #85#return; {9977#(or (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (not (<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))))} is VALID [2022-04-28 11:22:27,111 INFO L290 TraceCheckUtils]: 35: Hoare triple {9633#true} assume true; {9633#true} is VALID [2022-04-28 11:22:27,111 INFO L290 TraceCheckUtils]: 34: Hoare triple {9633#true} assume !(0 == ~cond); {9633#true} is VALID [2022-04-28 11:22:27,111 INFO L290 TraceCheckUtils]: 33: Hoare triple {9633#true} ~cond := #in~cond; {9633#true} is VALID [2022-04-28 11:22:27,111 INFO L272 TraceCheckUtils]: 32: Hoare triple {9977#(or (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (not (<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))))} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {9633#true} is VALID [2022-04-28 11:22:27,112 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {9633#true} {9977#(or (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (not (<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))))} #83#return; {9977#(or (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (not (<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))))} is VALID [2022-04-28 11:22:27,112 INFO L290 TraceCheckUtils]: 30: Hoare triple {9633#true} assume true; {9633#true} is VALID [2022-04-28 11:22:27,112 INFO L290 TraceCheckUtils]: 29: Hoare triple {9633#true} assume !(0 == ~cond); {9633#true} is VALID [2022-04-28 11:22:27,112 INFO L290 TraceCheckUtils]: 28: Hoare triple {9633#true} ~cond := #in~cond; {9633#true} is VALID [2022-04-28 11:22:27,112 INFO L272 TraceCheckUtils]: 27: Hoare triple {9977#(or (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (not (<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))))} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {9633#true} is VALID [2022-04-28 11:22:27,113 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 < 10);havoc #t~post7; {9977#(or (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (not (<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))))} is VALID [2022-04-28 11:22:27,113 INFO L290 TraceCheckUtils]: 25: Hoare triple {9977#(or (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (not (<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {9977#(or (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (not (<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))))} is VALID [2022-04-28 11:22:27,114 INFO L290 TraceCheckUtils]: 24: Hoare triple {9893#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {9977#(or (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (not (<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))))} is VALID [2022-04-28 11:22:27,114 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {9633#true} {9893#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} #81#return; {9893#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:22:27,114 INFO L290 TraceCheckUtils]: 22: Hoare triple {9633#true} assume true; {9633#true} is VALID [2022-04-28 11:22:27,114 INFO L290 TraceCheckUtils]: 21: Hoare triple {9633#true} assume !(0 == ~cond); {9633#true} is VALID [2022-04-28 11:22:27,114 INFO L290 TraceCheckUtils]: 20: Hoare triple {9633#true} ~cond := #in~cond; {9633#true} is VALID [2022-04-28 11:22:27,114 INFO L272 TraceCheckUtils]: 19: Hoare triple {9893#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {9633#true} is VALID [2022-04-28 11:22:27,115 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {9633#true} {9893#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} #79#return; {9893#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:22:27,115 INFO L290 TraceCheckUtils]: 17: Hoare triple {9633#true} assume true; {9633#true} is VALID [2022-04-28 11:22:27,115 INFO L290 TraceCheckUtils]: 16: Hoare triple {9633#true} assume !(0 == ~cond); {9633#true} is VALID [2022-04-28 11:22:27,115 INFO L290 TraceCheckUtils]: 15: Hoare triple {9633#true} ~cond := #in~cond; {9633#true} is VALID [2022-04-28 11:22:27,115 INFO L272 TraceCheckUtils]: 14: Hoare triple {9893#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {9633#true} is VALID [2022-04-28 11:22:27,116 INFO L290 TraceCheckUtils]: 13: Hoare triple {9893#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} assume !!(#t~post6 < 10);havoc #t~post6; {9893#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:22:27,116 INFO L290 TraceCheckUtils]: 12: Hoare triple {9893#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9893#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:22:27,116 INFO L290 TraceCheckUtils]: 11: Hoare triple {9633#true} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {9893#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:22:27,116 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {9633#true} {9633#true} #77#return; {9633#true} is VALID [2022-04-28 11:22:27,117 INFO L290 TraceCheckUtils]: 9: Hoare triple {9633#true} assume true; {9633#true} is VALID [2022-04-28 11:22:27,117 INFO L290 TraceCheckUtils]: 8: Hoare triple {9633#true} assume !(0 == ~cond); {9633#true} is VALID [2022-04-28 11:22:27,117 INFO L290 TraceCheckUtils]: 7: Hoare triple {9633#true} ~cond := #in~cond; {9633#true} is VALID [2022-04-28 11:22:27,117 INFO L272 TraceCheckUtils]: 6: Hoare triple {9633#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {9633#true} is VALID [2022-04-28 11:22:27,117 INFO L290 TraceCheckUtils]: 5: Hoare triple {9633#true} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {9633#true} is VALID [2022-04-28 11:22:27,117 INFO L272 TraceCheckUtils]: 4: Hoare triple {9633#true} call #t~ret8 := main(); {9633#true} is VALID [2022-04-28 11:22:27,117 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9633#true} {9633#true} #93#return; {9633#true} is VALID [2022-04-28 11:22:27,117 INFO L290 TraceCheckUtils]: 2: Hoare triple {9633#true} assume true; {9633#true} is VALID [2022-04-28 11:22:27,117 INFO L290 TraceCheckUtils]: 1: Hoare triple {9633#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {9633#true} is VALID [2022-04-28 11:22:27,117 INFO L272 TraceCheckUtils]: 0: Hoare triple {9633#true} call ULTIMATE.init(); {9633#true} is VALID [2022-04-28 11:22:27,117 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 46 proven. 10 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2022-04-28 11:22:27,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:22:27,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490496619] [2022-04-28 11:22:27,118 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:22:27,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1248297130] [2022-04-28 11:22:27,118 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1248297130] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 11:22:27,118 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 11:22:27,118 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9] total 18 [2022-04-28 11:22:27,120 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:22:27,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [384924854] [2022-04-28 11:22:27,120 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [384924854] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:22:27,120 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:22:27,120 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-28 11:22:27,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992032848] [2022-04-28 11:22:27,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:22:27,121 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.230769230769231) internal successors, (29), 11 states have internal predecessors, (29), 6 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 6 states have call predecessors, (12), 5 states have call successors, (12) Word has length 79 [2022-04-28 11:22:27,121 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:22:27,121 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 13 states have (on average 2.230769230769231) internal successors, (29), 11 states have internal predecessors, (29), 6 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 6 states have call predecessors, (12), 5 states have call successors, (12) [2022-04-28 11:22:27,170 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:22:27,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-28 11:22:27,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:22:27,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-28 11:22:27,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2022-04-28 11:22:27,171 INFO L87 Difference]: Start difference. First operand 132 states and 155 transitions. Second operand has 14 states, 13 states have (on average 2.230769230769231) internal successors, (29), 11 states have internal predecessors, (29), 6 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 6 states have call predecessors, (12), 5 states have call successors, (12) [2022-04-28 11:22:31,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:22:31,403 INFO L93 Difference]: Finished difference Result 161 states and 197 transitions. [2022-04-28 11:22:31,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-28 11:22:31,403 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.230769230769231) internal successors, (29), 11 states have internal predecessors, (29), 6 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 6 states have call predecessors, (12), 5 states have call successors, (12) Word has length 79 [2022-04-28 11:22:31,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:22:31,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 2.230769230769231) internal successors, (29), 11 states have internal predecessors, (29), 6 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 6 states have call predecessors, (12), 5 states have call successors, (12) [2022-04-28 11:22:31,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 119 transitions. [2022-04-28 11:22:31,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 2.230769230769231) internal successors, (29), 11 states have internal predecessors, (29), 6 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 6 states have call predecessors, (12), 5 states have call successors, (12) [2022-04-28 11:22:31,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 119 transitions. [2022-04-28 11:22:31,406 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 119 transitions. [2022-04-28 11:22:31,506 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 119 edges. 119 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:22:31,508 INFO L225 Difference]: With dead ends: 161 [2022-04-28 11:22:31,509 INFO L226 Difference]: Without dead ends: 158 [2022-04-28 11:22:31,509 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 138 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=86, Invalid=376, Unknown=0, NotChecked=0, Total=462 [2022-04-28 11:22:31,509 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 51 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 576 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 607 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 576 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-04-28 11:22:31,509 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 259 Invalid, 607 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 576 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-04-28 11:22:31,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2022-04-28 11:22:31,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 153. [2022-04-28 11:22:31,701 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:22:31,701 INFO L82 GeneralOperation]: Start isEquivalent. First operand 158 states. Second operand has 153 states, 96 states have (on average 1.1666666666666667) internal successors, (112), 99 states have internal predecessors, (112), 39 states have call successors, (39), 18 states have call predecessors, (39), 17 states have return successors, (37), 35 states have call predecessors, (37), 37 states have call successors, (37) [2022-04-28 11:22:31,702 INFO L74 IsIncluded]: Start isIncluded. First operand 158 states. Second operand has 153 states, 96 states have (on average 1.1666666666666667) internal successors, (112), 99 states have internal predecessors, (112), 39 states have call successors, (39), 18 states have call predecessors, (39), 17 states have return successors, (37), 35 states have call predecessors, (37), 37 states have call successors, (37) [2022-04-28 11:22:31,702 INFO L87 Difference]: Start difference. First operand 158 states. Second operand has 153 states, 96 states have (on average 1.1666666666666667) internal successors, (112), 99 states have internal predecessors, (112), 39 states have call successors, (39), 18 states have call predecessors, (39), 17 states have return successors, (37), 35 states have call predecessors, (37), 37 states have call successors, (37) [2022-04-28 11:22:31,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:22:31,705 INFO L93 Difference]: Finished difference Result 158 states and 193 transitions. [2022-04-28 11:22:31,705 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 193 transitions. [2022-04-28 11:22:31,705 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:22:31,705 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:22:31,705 INFO L74 IsIncluded]: Start isIncluded. First operand has 153 states, 96 states have (on average 1.1666666666666667) internal successors, (112), 99 states have internal predecessors, (112), 39 states have call successors, (39), 18 states have call predecessors, (39), 17 states have return successors, (37), 35 states have call predecessors, (37), 37 states have call successors, (37) Second operand 158 states. [2022-04-28 11:22:31,706 INFO L87 Difference]: Start difference. First operand has 153 states, 96 states have (on average 1.1666666666666667) internal successors, (112), 99 states have internal predecessors, (112), 39 states have call successors, (39), 18 states have call predecessors, (39), 17 states have return successors, (37), 35 states have call predecessors, (37), 37 states have call successors, (37) Second operand 158 states. [2022-04-28 11:22:31,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:22:31,708 INFO L93 Difference]: Finished difference Result 158 states and 193 transitions. [2022-04-28 11:22:31,708 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 193 transitions. [2022-04-28 11:22:31,709 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:22:31,709 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:22:31,709 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:22:31,709 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:22:31,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 96 states have (on average 1.1666666666666667) internal successors, (112), 99 states have internal predecessors, (112), 39 states have call successors, (39), 18 states have call predecessors, (39), 17 states have return successors, (37), 35 states have call predecessors, (37), 37 states have call successors, (37) [2022-04-28 11:22:31,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 188 transitions. [2022-04-28 11:22:31,712 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 188 transitions. Word has length 79 [2022-04-28 11:22:31,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:22:31,714 INFO L495 AbstractCegarLoop]: Abstraction has 153 states and 188 transitions. [2022-04-28 11:22:31,714 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.230769230769231) internal successors, (29), 11 states have internal predecessors, (29), 6 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 6 states have call predecessors, (12), 5 states have call successors, (12) [2022-04-28 11:22:31,714 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 153 states and 188 transitions. [2022-04-28 11:22:31,914 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 188 edges. 188 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:22:31,914 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 188 transitions. [2022-04-28 11:22:31,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-04-28 11:22:31,915 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:22:31,915 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:22:31,931 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-04-28 11:22:32,127 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-04-28 11:22:32,128 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:22:32,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:22:32,128 INFO L85 PathProgramCache]: Analyzing trace with hash -554329876, now seen corresponding path program 3 times [2022-04-28 11:22:32,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:22:32,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1530422756] [2022-04-28 11:22:46,798 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:22:46,798 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:22:46,798 INFO L85 PathProgramCache]: Analyzing trace with hash -554329876, now seen corresponding path program 4 times [2022-04-28 11:22:46,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:22:46,799 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181020407] [2022-04-28 11:22:46,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:22:46,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:22:46,809 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:22:46,809 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1021469991] [2022-04-28 11:22:46,809 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 11:22:46,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:22:46,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:22:46,810 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 11:22:46,811 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-04-28 11:22:46,858 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 11:22:46,858 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:22:46,859 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-28 11:22:46,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:22:46,872 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:22:47,385 INFO L272 TraceCheckUtils]: 0: Hoare triple {11076#true} call ULTIMATE.init(); {11076#true} is VALID [2022-04-28 11:22:47,385 INFO L290 TraceCheckUtils]: 1: Hoare triple {11076#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {11076#true} is VALID [2022-04-28 11:22:47,385 INFO L290 TraceCheckUtils]: 2: Hoare triple {11076#true} assume true; {11076#true} is VALID [2022-04-28 11:22:47,385 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11076#true} {11076#true} #93#return; {11076#true} is VALID [2022-04-28 11:22:47,386 INFO L272 TraceCheckUtils]: 4: Hoare triple {11076#true} call #t~ret8 := main(); {11076#true} is VALID [2022-04-28 11:22:47,386 INFO L290 TraceCheckUtils]: 5: Hoare triple {11076#true} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {11076#true} is VALID [2022-04-28 11:22:47,386 INFO L272 TraceCheckUtils]: 6: Hoare triple {11076#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {11076#true} is VALID [2022-04-28 11:22:47,386 INFO L290 TraceCheckUtils]: 7: Hoare triple {11076#true} ~cond := #in~cond; {11102#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 11:22:47,386 INFO L290 TraceCheckUtils]: 8: Hoare triple {11102#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {11106#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 11:22:47,386 INFO L290 TraceCheckUtils]: 9: Hoare triple {11106#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {11106#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 11:22:47,387 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {11106#(not (= |assume_abort_if_not_#in~cond| 0))} {11076#true} #77#return; {11113#(<= 1 main_~y~0)} is VALID [2022-04-28 11:22:47,387 INFO L290 TraceCheckUtils]: 11: Hoare triple {11113#(<= 1 main_~y~0)} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {11117#(and (= main_~x~0 main_~r~0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-28 11:22:47,388 INFO L290 TraceCheckUtils]: 12: Hoare triple {11117#(and (= main_~x~0 main_~r~0) (= main_~q~0 0) (<= 1 main_~y~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {11117#(and (= main_~x~0 main_~r~0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-28 11:22:47,388 INFO L290 TraceCheckUtils]: 13: Hoare triple {11117#(and (= main_~x~0 main_~r~0) (= main_~q~0 0) (<= 1 main_~y~0))} assume !!(#t~post6 < 10);havoc #t~post6; {11117#(and (= main_~x~0 main_~r~0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-28 11:22:47,388 INFO L272 TraceCheckUtils]: 14: Hoare triple {11117#(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)); {11076#true} is VALID [2022-04-28 11:22:47,388 INFO L290 TraceCheckUtils]: 15: Hoare triple {11076#true} ~cond := #in~cond; {11076#true} is VALID [2022-04-28 11:22:47,388 INFO L290 TraceCheckUtils]: 16: Hoare triple {11076#true} assume !(0 == ~cond); {11076#true} is VALID [2022-04-28 11:22:47,388 INFO L290 TraceCheckUtils]: 17: Hoare triple {11076#true} assume true; {11076#true} is VALID [2022-04-28 11:22:47,389 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {11076#true} {11117#(and (= main_~x~0 main_~r~0) (= main_~q~0 0) (<= 1 main_~y~0))} #79#return; {11117#(and (= main_~x~0 main_~r~0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-28 11:22:47,389 INFO L272 TraceCheckUtils]: 19: Hoare triple {11117#(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)); {11076#true} is VALID [2022-04-28 11:22:47,389 INFO L290 TraceCheckUtils]: 20: Hoare triple {11076#true} ~cond := #in~cond; {11076#true} is VALID [2022-04-28 11:22:47,389 INFO L290 TraceCheckUtils]: 21: Hoare triple {11076#true} assume !(0 == ~cond); {11076#true} is VALID [2022-04-28 11:22:47,389 INFO L290 TraceCheckUtils]: 22: Hoare triple {11076#true} assume true; {11076#true} is VALID [2022-04-28 11:22:47,389 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {11076#true} {11117#(and (= main_~x~0 main_~r~0) (= main_~q~0 0) (<= 1 main_~y~0))} #81#return; {11117#(and (= main_~x~0 main_~r~0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-28 11:22:47,390 INFO L290 TraceCheckUtils]: 24: Hoare triple {11117#(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; {11157#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-28 11:22:47,390 INFO L290 TraceCheckUtils]: 25: Hoare triple {11157#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {11157#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-28 11:22:47,390 INFO L290 TraceCheckUtils]: 26: Hoare triple {11157#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} assume !!(#t~post7 < 10);havoc #t~post7; {11157#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-28 11:22:47,391 INFO L272 TraceCheckUtils]: 27: Hoare triple {11157#(and (= main_~a~0 1) (= main_~x~0 main_~r~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)); {11076#true} is VALID [2022-04-28 11:22:47,391 INFO L290 TraceCheckUtils]: 28: Hoare triple {11076#true} ~cond := #in~cond; {11076#true} is VALID [2022-04-28 11:22:47,391 INFO L290 TraceCheckUtils]: 29: Hoare triple {11076#true} assume !(0 == ~cond); {11076#true} is VALID [2022-04-28 11:22:47,391 INFO L290 TraceCheckUtils]: 30: Hoare triple {11076#true} assume true; {11076#true} is VALID [2022-04-28 11:22:47,391 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {11076#true} {11157#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} #83#return; {11157#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-28 11:22:47,391 INFO L272 TraceCheckUtils]: 32: Hoare triple {11157#(and (= main_~a~0 1) (= main_~x~0 main_~r~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)); {11076#true} is VALID [2022-04-28 11:22:47,391 INFO L290 TraceCheckUtils]: 33: Hoare triple {11076#true} ~cond := #in~cond; {11076#true} is VALID [2022-04-28 11:22:47,392 INFO L290 TraceCheckUtils]: 34: Hoare triple {11076#true} assume !(0 == ~cond); {11076#true} is VALID [2022-04-28 11:22:47,392 INFO L290 TraceCheckUtils]: 35: Hoare triple {11076#true} assume true; {11076#true} is VALID [2022-04-28 11:22:47,392 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {11076#true} {11157#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} #85#return; {11157#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-28 11:22:47,392 INFO L272 TraceCheckUtils]: 37: Hoare triple {11157#(and (= main_~a~0 1) (= main_~x~0 main_~r~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)); {11076#true} is VALID [2022-04-28 11:22:47,392 INFO L290 TraceCheckUtils]: 38: Hoare triple {11076#true} ~cond := #in~cond; {11076#true} is VALID [2022-04-28 11:22:47,392 INFO L290 TraceCheckUtils]: 39: Hoare triple {11076#true} assume !(0 == ~cond); {11076#true} is VALID [2022-04-28 11:22:47,392 INFO L290 TraceCheckUtils]: 40: Hoare triple {11076#true} assume true; {11076#true} is VALID [2022-04-28 11:22:47,393 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {11076#true} {11157#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} #87#return; {11157#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-28 11:22:47,393 INFO L290 TraceCheckUtils]: 42: Hoare triple {11157#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} assume !!(~r~0 >= 2 * ~b~0); {11157#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-28 11:22:47,394 INFO L272 TraceCheckUtils]: 43: Hoare triple {11157#(and (= main_~a~0 1) (= main_~x~0 main_~r~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)); {11076#true} is VALID [2022-04-28 11:22:47,394 INFO L290 TraceCheckUtils]: 44: Hoare triple {11076#true} ~cond := #in~cond; {11076#true} is VALID [2022-04-28 11:22:47,394 INFO L290 TraceCheckUtils]: 45: Hoare triple {11076#true} assume !(0 == ~cond); {11076#true} is VALID [2022-04-28 11:22:47,394 INFO L290 TraceCheckUtils]: 46: Hoare triple {11076#true} assume true; {11076#true} is VALID [2022-04-28 11:22:47,394 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {11076#true} {11157#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} #89#return; {11157#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-28 11:22:47,395 INFO L290 TraceCheckUtils]: 48: Hoare triple {11157#(and (= main_~a~0 1) (= main_~x~0 main_~r~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; {11230#(and (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (= main_~q~0 0) (= main_~a~0 2) (<= 1 main_~y~0))} is VALID [2022-04-28 11:22:47,395 INFO L290 TraceCheckUtils]: 49: Hoare triple {11230#(and (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (= main_~q~0 0) (= main_~a~0 2) (<= 1 main_~y~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {11230#(and (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (= main_~q~0 0) (= main_~a~0 2) (<= 1 main_~y~0))} is VALID [2022-04-28 11:22:47,395 INFO L290 TraceCheckUtils]: 50: Hoare triple {11230#(and (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (= main_~q~0 0) (= main_~a~0 2) (<= 1 main_~y~0))} assume !!(#t~post7 < 10);havoc #t~post7; {11230#(and (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (= main_~q~0 0) (= main_~a~0 2) (<= 1 main_~y~0))} is VALID [2022-04-28 11:22:47,396 INFO L272 TraceCheckUtils]: 51: Hoare triple {11230#(and (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (= main_~q~0 0) (= main_~a~0 2) (<= 1 main_~y~0))} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {11076#true} is VALID [2022-04-28 11:22:47,396 INFO L290 TraceCheckUtils]: 52: Hoare triple {11076#true} ~cond := #in~cond; {11076#true} is VALID [2022-04-28 11:22:47,396 INFO L290 TraceCheckUtils]: 53: Hoare triple {11076#true} assume !(0 == ~cond); {11076#true} is VALID [2022-04-28 11:22:47,396 INFO L290 TraceCheckUtils]: 54: Hoare triple {11076#true} assume true; {11076#true} is VALID [2022-04-28 11:22:47,396 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {11076#true} {11230#(and (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (= main_~q~0 0) (= main_~a~0 2) (<= 1 main_~y~0))} #83#return; {11230#(and (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (= main_~q~0 0) (= main_~a~0 2) (<= 1 main_~y~0))} is VALID [2022-04-28 11:22:47,396 INFO L272 TraceCheckUtils]: 56: Hoare triple {11230#(and (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (= main_~q~0 0) (= main_~a~0 2) (<= 1 main_~y~0))} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {11076#true} is VALID [2022-04-28 11:22:47,396 INFO L290 TraceCheckUtils]: 57: Hoare triple {11076#true} ~cond := #in~cond; {11076#true} is VALID [2022-04-28 11:22:47,396 INFO L290 TraceCheckUtils]: 58: Hoare triple {11076#true} assume !(0 == ~cond); {11076#true} is VALID [2022-04-28 11:22:47,397 INFO L290 TraceCheckUtils]: 59: Hoare triple {11076#true} assume true; {11076#true} is VALID [2022-04-28 11:22:47,397 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {11076#true} {11230#(and (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (= main_~q~0 0) (= main_~a~0 2) (<= 1 main_~y~0))} #85#return; {11230#(and (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (= main_~q~0 0) (= main_~a~0 2) (<= 1 main_~y~0))} is VALID [2022-04-28 11:22:47,397 INFO L272 TraceCheckUtils]: 61: Hoare triple {11230#(and (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (= main_~q~0 0) (= main_~a~0 2) (<= 1 main_~y~0))} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {11076#true} is VALID [2022-04-28 11:22:47,397 INFO L290 TraceCheckUtils]: 62: Hoare triple {11076#true} ~cond := #in~cond; {11076#true} is VALID [2022-04-28 11:22:47,397 INFO L290 TraceCheckUtils]: 63: Hoare triple {11076#true} assume !(0 == ~cond); {11076#true} is VALID [2022-04-28 11:22:47,397 INFO L290 TraceCheckUtils]: 64: Hoare triple {11076#true} assume true; {11076#true} is VALID [2022-04-28 11:22:47,398 INFO L284 TraceCheckUtils]: 65: Hoare quadruple {11076#true} {11230#(and (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (= main_~q~0 0) (= main_~a~0 2) (<= 1 main_~y~0))} #87#return; {11230#(and (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (= main_~q~0 0) (= main_~a~0 2) (<= 1 main_~y~0))} is VALID [2022-04-28 11:22:47,398 INFO L290 TraceCheckUtils]: 66: Hoare triple {11230#(and (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (= main_~q~0 0) (= main_~a~0 2) (<= 1 main_~y~0))} assume !!(~r~0 >= 2 * ~b~0); {11230#(and (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (= main_~q~0 0) (= main_~a~0 2) (<= 1 main_~y~0))} is VALID [2022-04-28 11:22:47,398 INFO L272 TraceCheckUtils]: 67: Hoare triple {11230#(and (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (= main_~q~0 0) (= main_~a~0 2) (<= 1 main_~y~0))} call __VERIFIER_assert((if ~r~0 >= 2 * ~y~0 * ~a~0 then 1 else 0)); {11076#true} is VALID [2022-04-28 11:22:47,398 INFO L290 TraceCheckUtils]: 68: Hoare triple {11076#true} ~cond := #in~cond; {11076#true} is VALID [2022-04-28 11:22:47,399 INFO L290 TraceCheckUtils]: 69: Hoare triple {11076#true} assume !(0 == ~cond); {11076#true} is VALID [2022-04-28 11:22:47,399 INFO L290 TraceCheckUtils]: 70: Hoare triple {11076#true} assume true; {11076#true} is VALID [2022-04-28 11:22:47,399 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {11076#true} {11230#(and (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (= main_~q~0 0) (= main_~a~0 2) (<= 1 main_~y~0))} #89#return; {11230#(and (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (= main_~q~0 0) (= main_~a~0 2) (<= 1 main_~y~0))} is VALID [2022-04-28 11:22:47,400 INFO L290 TraceCheckUtils]: 72: Hoare triple {11230#(and (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (= main_~q~0 0) (= main_~a~0 2) (<= 1 main_~y~0))} ~a~0 := 2 * ~a~0;~b~0 := 2 * ~b~0; {11303#(and (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 4)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 4))} is VALID [2022-04-28 11:22:47,400 INFO L290 TraceCheckUtils]: 73: Hoare triple {11303#(and (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 4)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 4))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {11303#(and (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 4)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 4))} is VALID [2022-04-28 11:22:47,400 INFO L290 TraceCheckUtils]: 74: Hoare triple {11303#(and (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 4)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 4))} assume !(#t~post7 < 10);havoc #t~post7; {11303#(and (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 4)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 4))} is VALID [2022-04-28 11:22:47,401 INFO L290 TraceCheckUtils]: 75: Hoare triple {11303#(and (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 4)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 4))} ~r~0 := ~r~0 - ~b~0;~q~0 := ~q~0 + ~a~0; {11313#(and (= main_~x~0 (+ main_~r~0 (* main_~y~0 4))) (= main_~q~0 4) (<= 1 main_~y~0))} is VALID [2022-04-28 11:22:47,401 INFO L290 TraceCheckUtils]: 76: Hoare triple {11313#(and (= main_~x~0 (+ main_~r~0 (* main_~y~0 4))) (= main_~q~0 4) (<= 1 main_~y~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {11313#(and (= main_~x~0 (+ main_~r~0 (* main_~y~0 4))) (= main_~q~0 4) (<= 1 main_~y~0))} is VALID [2022-04-28 11:22:47,402 INFO L290 TraceCheckUtils]: 77: Hoare triple {11313#(and (= main_~x~0 (+ main_~r~0 (* main_~y~0 4))) (= main_~q~0 4) (<= 1 main_~y~0))} assume !(#t~post6 < 10);havoc #t~post6; {11313#(and (= main_~x~0 (+ main_~r~0 (* main_~y~0 4))) (= main_~q~0 4) (<= 1 main_~y~0))} is VALID [2022-04-28 11:22:47,402 INFO L272 TraceCheckUtils]: 78: Hoare triple {11313#(and (= main_~x~0 (+ main_~r~0 (* main_~y~0 4))) (= main_~q~0 4) (<= 1 main_~y~0))} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {11323#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:22:47,403 INFO L290 TraceCheckUtils]: 79: Hoare triple {11323#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {11327#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:22:47,403 INFO L290 TraceCheckUtils]: 80: Hoare triple {11327#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {11077#false} is VALID [2022-04-28 11:22:47,403 INFO L290 TraceCheckUtils]: 81: Hoare triple {11077#false} assume !false; {11077#false} is VALID [2022-04-28 11:22:47,403 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 20 proven. 14 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-04-28 11:22:47,403 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:22:47,799 INFO L290 TraceCheckUtils]: 81: Hoare triple {11077#false} assume !false; {11077#false} is VALID [2022-04-28 11:22:47,800 INFO L290 TraceCheckUtils]: 80: Hoare triple {11327#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {11077#false} is VALID [2022-04-28 11:22:47,800 INFO L290 TraceCheckUtils]: 79: Hoare triple {11323#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {11327#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:22:47,801 INFO L272 TraceCheckUtils]: 78: Hoare triple {11343#(= (+ (* 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)); {11323#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:22:47,801 INFO L290 TraceCheckUtils]: 77: Hoare triple {11343#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} assume !(#t~post6 < 10);havoc #t~post6; {11343#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:22:47,801 INFO L290 TraceCheckUtils]: 76: Hoare triple {11343#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {11343#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:22:47,809 INFO L290 TraceCheckUtils]: 75: Hoare triple {11353#(= 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; {11343#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:22:47,809 INFO L290 TraceCheckUtils]: 74: Hoare triple {11353#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} assume !(#t~post7 < 10);havoc #t~post7; {11353#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} is VALID [2022-04-28 11:22:47,809 INFO L290 TraceCheckUtils]: 73: Hoare triple {11353#(= 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; {11353#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} is VALID [2022-04-28 11:22:47,812 INFO L290 TraceCheckUtils]: 72: Hoare triple {11363#(= (+ (* (- 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; {11353#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} is VALID [2022-04-28 11:22:47,813 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {11076#true} {11363#(= (+ (* (- 2) main_~b~0) (* (+ (* main_~a~0 2) main_~q~0) main_~y~0) main_~r~0) main_~x~0)} #89#return; {11363#(= (+ (* (- 2) main_~b~0) (* (+ (* main_~a~0 2) main_~q~0) main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:22:47,813 INFO L290 TraceCheckUtils]: 70: Hoare triple {11076#true} assume true; {11076#true} is VALID [2022-04-28 11:22:47,813 INFO L290 TraceCheckUtils]: 69: Hoare triple {11076#true} assume !(0 == ~cond); {11076#true} is VALID [2022-04-28 11:22:47,813 INFO L290 TraceCheckUtils]: 68: Hoare triple {11076#true} ~cond := #in~cond; {11076#true} is VALID [2022-04-28 11:22:47,813 INFO L272 TraceCheckUtils]: 67: Hoare triple {11363#(= (+ (* (- 2) main_~b~0) (* (+ (* main_~a~0 2) main_~q~0) main_~y~0) main_~r~0) main_~x~0)} call __VERIFIER_assert((if ~r~0 >= 2 * ~y~0 * ~a~0 then 1 else 0)); {11076#true} is VALID [2022-04-28 11:22:47,813 INFO L290 TraceCheckUtils]: 66: Hoare triple {11363#(= (+ (* (- 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); {11363#(= (+ (* (- 2) main_~b~0) (* (+ (* main_~a~0 2) main_~q~0) main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:22:47,814 INFO L284 TraceCheckUtils]: 65: Hoare quadruple {11076#true} {11363#(= (+ (* (- 2) main_~b~0) (* (+ (* main_~a~0 2) main_~q~0) main_~y~0) main_~r~0) main_~x~0)} #87#return; {11363#(= (+ (* (- 2) main_~b~0) (* (+ (* main_~a~0 2) main_~q~0) main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:22:47,814 INFO L290 TraceCheckUtils]: 64: Hoare triple {11076#true} assume true; {11076#true} is VALID [2022-04-28 11:22:47,814 INFO L290 TraceCheckUtils]: 63: Hoare triple {11076#true} assume !(0 == ~cond); {11076#true} is VALID [2022-04-28 11:22:47,814 INFO L290 TraceCheckUtils]: 62: Hoare triple {11076#true} ~cond := #in~cond; {11076#true} is VALID [2022-04-28 11:22:47,814 INFO L272 TraceCheckUtils]: 61: Hoare triple {11363#(= (+ (* (- 2) main_~b~0) (* (+ (* main_~a~0 2) main_~q~0) main_~y~0) main_~r~0) main_~x~0)} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {11076#true} is VALID [2022-04-28 11:22:47,815 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {11076#true} {11363#(= (+ (* (- 2) main_~b~0) (* (+ (* main_~a~0 2) main_~q~0) main_~y~0) main_~r~0) main_~x~0)} #85#return; {11363#(= (+ (* (- 2) main_~b~0) (* (+ (* main_~a~0 2) main_~q~0) main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:22:47,815 INFO L290 TraceCheckUtils]: 59: Hoare triple {11076#true} assume true; {11076#true} is VALID [2022-04-28 11:22:47,815 INFO L290 TraceCheckUtils]: 58: Hoare triple {11076#true} assume !(0 == ~cond); {11076#true} is VALID [2022-04-28 11:22:47,815 INFO L290 TraceCheckUtils]: 57: Hoare triple {11076#true} ~cond := #in~cond; {11076#true} is VALID [2022-04-28 11:22:47,815 INFO L272 TraceCheckUtils]: 56: Hoare triple {11363#(= (+ (* (- 2) main_~b~0) (* (+ (* main_~a~0 2) main_~q~0) main_~y~0) main_~r~0) main_~x~0)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {11076#true} is VALID [2022-04-28 11:22:47,815 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {11076#true} {11363#(= (+ (* (- 2) main_~b~0) (* (+ (* main_~a~0 2) main_~q~0) main_~y~0) main_~r~0) main_~x~0)} #83#return; {11363#(= (+ (* (- 2) main_~b~0) (* (+ (* main_~a~0 2) main_~q~0) main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:22:47,816 INFO L290 TraceCheckUtils]: 54: Hoare triple {11076#true} assume true; {11076#true} is VALID [2022-04-28 11:22:47,816 INFO L290 TraceCheckUtils]: 53: Hoare triple {11076#true} assume !(0 == ~cond); {11076#true} is VALID [2022-04-28 11:22:47,816 INFO L290 TraceCheckUtils]: 52: Hoare triple {11076#true} ~cond := #in~cond; {11076#true} is VALID [2022-04-28 11:22:47,816 INFO L272 TraceCheckUtils]: 51: Hoare triple {11363#(= (+ (* (- 2) main_~b~0) (* (+ (* main_~a~0 2) main_~q~0) main_~y~0) main_~r~0) main_~x~0)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {11076#true} is VALID [2022-04-28 11:22:47,816 INFO L290 TraceCheckUtils]: 50: Hoare triple {11363#(= (+ (* (- 2) main_~b~0) (* (+ (* main_~a~0 2) main_~q~0) main_~y~0) main_~r~0) main_~x~0)} assume !!(#t~post7 < 10);havoc #t~post7; {11363#(= (+ (* (- 2) main_~b~0) (* (+ (* main_~a~0 2) main_~q~0) main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:22:47,817 INFO L290 TraceCheckUtils]: 49: Hoare triple {11363#(= (+ (* (- 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; {11363#(= (+ (* (- 2) main_~b~0) (* (+ (* main_~a~0 2) main_~q~0) main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:22:47,819 INFO L290 TraceCheckUtils]: 48: Hoare triple {11436#(= (+ (* 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; {11363#(= (+ (* (- 2) main_~b~0) (* (+ (* main_~a~0 2) main_~q~0) main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:22:47,820 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {11076#true} {11436#(= (+ (* main_~b~0 (- 4)) main_~r~0 (* main_~y~0 (+ (* main_~a~0 4) main_~q~0))) main_~x~0)} #89#return; {11436#(= (+ (* main_~b~0 (- 4)) main_~r~0 (* main_~y~0 (+ (* main_~a~0 4) main_~q~0))) main_~x~0)} is VALID [2022-04-28 11:22:47,820 INFO L290 TraceCheckUtils]: 46: Hoare triple {11076#true} assume true; {11076#true} is VALID [2022-04-28 11:22:47,820 INFO L290 TraceCheckUtils]: 45: Hoare triple {11076#true} assume !(0 == ~cond); {11076#true} is VALID [2022-04-28 11:22:47,820 INFO L290 TraceCheckUtils]: 44: Hoare triple {11076#true} ~cond := #in~cond; {11076#true} is VALID [2022-04-28 11:22:47,820 INFO L272 TraceCheckUtils]: 43: Hoare triple {11436#(= (+ (* main_~b~0 (- 4)) main_~r~0 (* main_~y~0 (+ (* main_~a~0 4) main_~q~0))) main_~x~0)} call __VERIFIER_assert((if ~r~0 >= 2 * ~y~0 * ~a~0 then 1 else 0)); {11076#true} is VALID [2022-04-28 11:22:47,820 INFO L290 TraceCheckUtils]: 42: Hoare triple {11436#(= (+ (* 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); {11436#(= (+ (* main_~b~0 (- 4)) main_~r~0 (* main_~y~0 (+ (* main_~a~0 4) main_~q~0))) main_~x~0)} is VALID [2022-04-28 11:22:47,821 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {11076#true} {11436#(= (+ (* main_~b~0 (- 4)) main_~r~0 (* main_~y~0 (+ (* main_~a~0 4) main_~q~0))) main_~x~0)} #87#return; {11436#(= (+ (* main_~b~0 (- 4)) main_~r~0 (* main_~y~0 (+ (* main_~a~0 4) main_~q~0))) main_~x~0)} is VALID [2022-04-28 11:22:47,821 INFO L290 TraceCheckUtils]: 40: Hoare triple {11076#true} assume true; {11076#true} is VALID [2022-04-28 11:22:47,821 INFO L290 TraceCheckUtils]: 39: Hoare triple {11076#true} assume !(0 == ~cond); {11076#true} is VALID [2022-04-28 11:22:47,821 INFO L290 TraceCheckUtils]: 38: Hoare triple {11076#true} ~cond := #in~cond; {11076#true} is VALID [2022-04-28 11:22:47,821 INFO L272 TraceCheckUtils]: 37: Hoare triple {11436#(= (+ (* main_~b~0 (- 4)) main_~r~0 (* main_~y~0 (+ (* main_~a~0 4) main_~q~0))) main_~x~0)} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {11076#true} is VALID [2022-04-28 11:22:47,822 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {11076#true} {11436#(= (+ (* main_~b~0 (- 4)) main_~r~0 (* main_~y~0 (+ (* main_~a~0 4) main_~q~0))) main_~x~0)} #85#return; {11436#(= (+ (* main_~b~0 (- 4)) main_~r~0 (* main_~y~0 (+ (* main_~a~0 4) main_~q~0))) main_~x~0)} is VALID [2022-04-28 11:22:47,822 INFO L290 TraceCheckUtils]: 35: Hoare triple {11076#true} assume true; {11076#true} is VALID [2022-04-28 11:22:47,822 INFO L290 TraceCheckUtils]: 34: Hoare triple {11076#true} assume !(0 == ~cond); {11076#true} is VALID [2022-04-28 11:22:47,822 INFO L290 TraceCheckUtils]: 33: Hoare triple {11076#true} ~cond := #in~cond; {11076#true} is VALID [2022-04-28 11:22:47,822 INFO L272 TraceCheckUtils]: 32: Hoare triple {11436#(= (+ (* main_~b~0 (- 4)) main_~r~0 (* main_~y~0 (+ (* main_~a~0 4) main_~q~0))) main_~x~0)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {11076#true} is VALID [2022-04-28 11:22:47,823 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {11076#true} {11436#(= (+ (* main_~b~0 (- 4)) main_~r~0 (* main_~y~0 (+ (* main_~a~0 4) main_~q~0))) main_~x~0)} #83#return; {11436#(= (+ (* main_~b~0 (- 4)) main_~r~0 (* main_~y~0 (+ (* main_~a~0 4) main_~q~0))) main_~x~0)} is VALID [2022-04-28 11:22:47,823 INFO L290 TraceCheckUtils]: 30: Hoare triple {11076#true} assume true; {11076#true} is VALID [2022-04-28 11:22:47,823 INFO L290 TraceCheckUtils]: 29: Hoare triple {11076#true} assume !(0 == ~cond); {11076#true} is VALID [2022-04-28 11:22:47,823 INFO L290 TraceCheckUtils]: 28: Hoare triple {11076#true} ~cond := #in~cond; {11076#true} is VALID [2022-04-28 11:22:47,823 INFO L272 TraceCheckUtils]: 27: Hoare triple {11436#(= (+ (* main_~b~0 (- 4)) main_~r~0 (* main_~y~0 (+ (* main_~a~0 4) main_~q~0))) main_~x~0)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {11076#true} is VALID [2022-04-28 11:22:47,823 INFO L290 TraceCheckUtils]: 26: Hoare triple {11436#(= (+ (* main_~b~0 (- 4)) main_~r~0 (* main_~y~0 (+ (* main_~a~0 4) main_~q~0))) main_~x~0)} assume !!(#t~post7 < 10);havoc #t~post7; {11436#(= (+ (* main_~b~0 (- 4)) main_~r~0 (* main_~y~0 (+ (* main_~a~0 4) main_~q~0))) main_~x~0)} is VALID [2022-04-28 11:22:47,824 INFO L290 TraceCheckUtils]: 25: Hoare triple {11436#(= (+ (* 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; {11436#(= (+ (* main_~b~0 (- 4)) main_~r~0 (* main_~y~0 (+ (* main_~a~0 4) main_~q~0))) main_~x~0)} is VALID [2022-04-28 11:22:47,824 INFO L290 TraceCheckUtils]: 24: Hoare triple {11343#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {11436#(= (+ (* main_~b~0 (- 4)) main_~r~0 (* main_~y~0 (+ (* main_~a~0 4) main_~q~0))) main_~x~0)} is VALID [2022-04-28 11:22:47,824 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {11076#true} {11343#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} #81#return; {11343#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:22:47,825 INFO L290 TraceCheckUtils]: 22: Hoare triple {11076#true} assume true; {11076#true} is VALID [2022-04-28 11:22:47,825 INFO L290 TraceCheckUtils]: 21: Hoare triple {11076#true} assume !(0 == ~cond); {11076#true} is VALID [2022-04-28 11:22:47,825 INFO L290 TraceCheckUtils]: 20: Hoare triple {11076#true} ~cond := #in~cond; {11076#true} is VALID [2022-04-28 11:22:47,825 INFO L272 TraceCheckUtils]: 19: Hoare triple {11343#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {11076#true} is VALID [2022-04-28 11:22:47,825 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {11076#true} {11343#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} #79#return; {11343#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:22:47,825 INFO L290 TraceCheckUtils]: 17: Hoare triple {11076#true} assume true; {11076#true} is VALID [2022-04-28 11:22:47,825 INFO L290 TraceCheckUtils]: 16: Hoare triple {11076#true} assume !(0 == ~cond); {11076#true} is VALID [2022-04-28 11:22:47,826 INFO L290 TraceCheckUtils]: 15: Hoare triple {11076#true} ~cond := #in~cond; {11076#true} is VALID [2022-04-28 11:22:47,826 INFO L272 TraceCheckUtils]: 14: Hoare triple {11343#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {11076#true} is VALID [2022-04-28 11:22:47,826 INFO L290 TraceCheckUtils]: 13: Hoare triple {11343#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} assume !!(#t~post6 < 10);havoc #t~post6; {11343#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:22:47,826 INFO L290 TraceCheckUtils]: 12: Hoare triple {11343#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {11343#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:22:47,826 INFO L290 TraceCheckUtils]: 11: Hoare triple {11076#true} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {11343#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:22:47,827 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {11076#true} {11076#true} #77#return; {11076#true} is VALID [2022-04-28 11:22:47,827 INFO L290 TraceCheckUtils]: 9: Hoare triple {11076#true} assume true; {11076#true} is VALID [2022-04-28 11:22:47,827 INFO L290 TraceCheckUtils]: 8: Hoare triple {11076#true} assume !(0 == ~cond); {11076#true} is VALID [2022-04-28 11:22:47,827 INFO L290 TraceCheckUtils]: 7: Hoare triple {11076#true} ~cond := #in~cond; {11076#true} is VALID [2022-04-28 11:22:47,827 INFO L272 TraceCheckUtils]: 6: Hoare triple {11076#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {11076#true} is VALID [2022-04-28 11:22:47,827 INFO L290 TraceCheckUtils]: 5: Hoare triple {11076#true} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {11076#true} is VALID [2022-04-28 11:22:47,827 INFO L272 TraceCheckUtils]: 4: Hoare triple {11076#true} call #t~ret8 := main(); {11076#true} is VALID [2022-04-28 11:22:47,827 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11076#true} {11076#true} #93#return; {11076#true} is VALID [2022-04-28 11:22:47,827 INFO L290 TraceCheckUtils]: 2: Hoare triple {11076#true} assume true; {11076#true} is VALID [2022-04-28 11:22:47,827 INFO L290 TraceCheckUtils]: 1: Hoare triple {11076#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {11076#true} is VALID [2022-04-28 11:22:47,827 INFO L272 TraceCheckUtils]: 0: Hoare triple {11076#true} call ULTIMATE.init(); {11076#true} is VALID [2022-04-28 11:22:47,828 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 20 proven. 12 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2022-04-28 11:22:47,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:22:47,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181020407] [2022-04-28 11:22:47,828 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:22:47,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1021469991] [2022-04-28 11:22:47,828 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1021469991] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 11:22:47,828 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 11:22:47,828 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 16 [2022-04-28 11:22:47,828 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:22:47,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1530422756] [2022-04-28 11:22:47,828 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1530422756] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:22:47,828 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:22:47,828 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-28 11:22:47,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907669437] [2022-04-28 11:22:47,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:22:47,829 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 10 states have internal predecessors, (29), 5 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 5 states have call predecessors, (12), 4 states have call successors, (12) Word has length 82 [2022-04-28 11:22:47,829 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:22:47,829 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 10 states have internal predecessors, (29), 5 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 5 states have call predecessors, (12), 4 states have call successors, (12) [2022-04-28 11:22:47,872 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:22:47,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-28 11:22:47,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:22:47,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-28 11:22:47,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2022-04-28 11:22:47,873 INFO L87 Difference]: Start difference. First operand 153 states and 188 transitions. Second operand has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 10 states have internal predecessors, (29), 5 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 5 states have call predecessors, (12), 4 states have call successors, (12) [2022-04-28 11:22:49,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:22:49,024 INFO L93 Difference]: Finished difference Result 201 states and 254 transitions. [2022-04-28 11:22:49,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-28 11:22:49,024 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 10 states have internal predecessors, (29), 5 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 5 states have call predecessors, (12), 4 states have call successors, (12) Word has length 82 [2022-04-28 11:22:49,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:22:49,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 10 states have internal predecessors, (29), 5 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 5 states have call predecessors, (12), 4 states have call successors, (12) [2022-04-28 11:22:49,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 135 transitions. [2022-04-28 11:22:49,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 10 states have internal predecessors, (29), 5 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 5 states have call predecessors, (12), 4 states have call successors, (12) [2022-04-28 11:22:49,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 135 transitions. [2022-04-28 11:22:49,030 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 135 transitions. [2022-04-28 11:22:49,138 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 135 edges. 135 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:22:49,141 INFO L225 Difference]: With dead ends: 201 [2022-04-28 11:22:49,141 INFO L226 Difference]: Without dead ends: 198 [2022-04-28 11:22:49,141 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 147 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2022-04-28 11:22:49,142 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 68 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 407 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-28 11:22:49,142 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 339 Invalid, 455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 407 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 11:22:49,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2022-04-28 11:22:49,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 168. [2022-04-28 11:22:49,375 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:22:49,376 INFO L82 GeneralOperation]: Start isEquivalent. First operand 198 states. Second operand has 168 states, 106 states have (on average 1.169811320754717) internal successors, (124), 108 states have internal predecessors, (124), 42 states have call successors, (42), 20 states have call predecessors, (42), 19 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) [2022-04-28 11:22:49,376 INFO L74 IsIncluded]: Start isIncluded. First operand 198 states. Second operand has 168 states, 106 states have (on average 1.169811320754717) internal successors, (124), 108 states have internal predecessors, (124), 42 states have call successors, (42), 20 states have call predecessors, (42), 19 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) [2022-04-28 11:22:49,376 INFO L87 Difference]: Start difference. First operand 198 states. Second operand has 168 states, 106 states have (on average 1.169811320754717) internal successors, (124), 108 states have internal predecessors, (124), 42 states have call successors, (42), 20 states have call predecessors, (42), 19 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) [2022-04-28 11:22:49,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:22:49,381 INFO L93 Difference]: Finished difference Result 198 states and 249 transitions. [2022-04-28 11:22:49,381 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 249 transitions. [2022-04-28 11:22:49,382 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:22:49,382 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:22:49,382 INFO L74 IsIncluded]: Start isIncluded. First operand has 168 states, 106 states have (on average 1.169811320754717) internal successors, (124), 108 states have internal predecessors, (124), 42 states have call successors, (42), 20 states have call predecessors, (42), 19 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) Second operand 198 states. [2022-04-28 11:22:49,383 INFO L87 Difference]: Start difference. First operand has 168 states, 106 states have (on average 1.169811320754717) internal successors, (124), 108 states have internal predecessors, (124), 42 states have call successors, (42), 20 states have call predecessors, (42), 19 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) Second operand 198 states. [2022-04-28 11:22:49,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:22:49,387 INFO L93 Difference]: Finished difference Result 198 states and 249 transitions. [2022-04-28 11:22:49,387 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 249 transitions. [2022-04-28 11:22:49,387 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:22:49,388 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:22:49,388 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:22:49,388 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:22:49,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 106 states have (on average 1.169811320754717) internal successors, (124), 108 states have internal predecessors, (124), 42 states have call successors, (42), 20 states have call predecessors, (42), 19 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) [2022-04-28 11:22:49,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 206 transitions. [2022-04-28 11:22:49,391 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 206 transitions. Word has length 82 [2022-04-28 11:22:49,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:22:49,392 INFO L495 AbstractCegarLoop]: Abstraction has 168 states and 206 transitions. [2022-04-28 11:22:49,392 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 10 states have internal predecessors, (29), 5 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 5 states have call predecessors, (12), 4 states have call successors, (12) [2022-04-28 11:22:49,392 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 168 states and 206 transitions. [2022-04-28 11:22:49,612 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 206 edges. 206 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:22:49,612 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 206 transitions. [2022-04-28 11:22:49,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-04-28 11:22:49,613 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:22:49,613 INFO L195 NwaCegarLoop]: trace histogram [12, 11, 11, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:22:49,631 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-04-28 11:22:49,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:22:49,827 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:22:49,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:22:49,828 INFO L85 PathProgramCache]: Analyzing trace with hash 1891783602, now seen corresponding path program 1 times [2022-04-28 11:22:49,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:22:49,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [980771978] [2022-04-28 11:23:11,716 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:23:11,716 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:23:11,716 INFO L85 PathProgramCache]: Analyzing trace with hash 1891783602, now seen corresponding path program 2 times [2022-04-28 11:23:11,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:23:11,717 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791135676] [2022-04-28 11:23:11,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:23:11,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:23:11,735 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:23:11,735 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1349999800] [2022-04-28 11:23:11,735 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:23:11,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:23:11,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:23:11,736 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 11:23:11,736 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-04-28 11:23:11,785 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 11:23:11,786 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:23:11,786 INFO L263 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-28 11:23:11,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:23:11,801 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:23:12,092 INFO L272 TraceCheckUtils]: 0: Hoare triple {12721#true} call ULTIMATE.init(); {12721#true} is VALID [2022-04-28 11:23:12,092 INFO L290 TraceCheckUtils]: 1: Hoare triple {12721#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; {12729#(<= ~counter~0 0)} is VALID [2022-04-28 11:23:12,093 INFO L290 TraceCheckUtils]: 2: Hoare triple {12729#(<= ~counter~0 0)} assume true; {12729#(<= ~counter~0 0)} is VALID [2022-04-28 11:23:12,093 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12729#(<= ~counter~0 0)} {12721#true} #93#return; {12729#(<= ~counter~0 0)} is VALID [2022-04-28 11:23:12,093 INFO L272 TraceCheckUtils]: 4: Hoare triple {12729#(<= ~counter~0 0)} call #t~ret8 := main(); {12729#(<= ~counter~0 0)} is VALID [2022-04-28 11:23:12,093 INFO L290 TraceCheckUtils]: 5: Hoare triple {12729#(<= ~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; {12729#(<= ~counter~0 0)} is VALID [2022-04-28 11:23:12,094 INFO L272 TraceCheckUtils]: 6: Hoare triple {12729#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {12729#(<= ~counter~0 0)} is VALID [2022-04-28 11:23:12,094 INFO L290 TraceCheckUtils]: 7: Hoare triple {12729#(<= ~counter~0 0)} ~cond := #in~cond; {12729#(<= ~counter~0 0)} is VALID [2022-04-28 11:23:12,094 INFO L290 TraceCheckUtils]: 8: Hoare triple {12729#(<= ~counter~0 0)} assume !(0 == ~cond); {12729#(<= ~counter~0 0)} is VALID [2022-04-28 11:23:12,095 INFO L290 TraceCheckUtils]: 9: Hoare triple {12729#(<= ~counter~0 0)} assume true; {12729#(<= ~counter~0 0)} is VALID [2022-04-28 11:23:12,095 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {12729#(<= ~counter~0 0)} {12729#(<= ~counter~0 0)} #77#return; {12729#(<= ~counter~0 0)} is VALID [2022-04-28 11:23:12,095 INFO L290 TraceCheckUtils]: 11: Hoare triple {12729#(<= ~counter~0 0)} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {12729#(<= ~counter~0 0)} is VALID [2022-04-28 11:23:12,096 INFO L290 TraceCheckUtils]: 12: Hoare triple {12729#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12763#(<= ~counter~0 1)} is VALID [2022-04-28 11:23:12,096 INFO L290 TraceCheckUtils]: 13: Hoare triple {12763#(<= ~counter~0 1)} assume !!(#t~post6 < 10);havoc #t~post6; {12763#(<= ~counter~0 1)} is VALID [2022-04-28 11:23:12,096 INFO L272 TraceCheckUtils]: 14: Hoare triple {12763#(<= ~counter~0 1)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {12763#(<= ~counter~0 1)} is VALID [2022-04-28 11:23:12,097 INFO L290 TraceCheckUtils]: 15: Hoare triple {12763#(<= ~counter~0 1)} ~cond := #in~cond; {12763#(<= ~counter~0 1)} is VALID [2022-04-28 11:23:12,097 INFO L290 TraceCheckUtils]: 16: Hoare triple {12763#(<= ~counter~0 1)} assume !(0 == ~cond); {12763#(<= ~counter~0 1)} is VALID [2022-04-28 11:23:12,097 INFO L290 TraceCheckUtils]: 17: Hoare triple {12763#(<= ~counter~0 1)} assume true; {12763#(<= ~counter~0 1)} is VALID [2022-04-28 11:23:12,098 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {12763#(<= ~counter~0 1)} {12763#(<= ~counter~0 1)} #79#return; {12763#(<= ~counter~0 1)} is VALID [2022-04-28 11:23:12,098 INFO L272 TraceCheckUtils]: 19: Hoare triple {12763#(<= ~counter~0 1)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {12763#(<= ~counter~0 1)} is VALID [2022-04-28 11:23:12,098 INFO L290 TraceCheckUtils]: 20: Hoare triple {12763#(<= ~counter~0 1)} ~cond := #in~cond; {12763#(<= ~counter~0 1)} is VALID [2022-04-28 11:23:12,099 INFO L290 TraceCheckUtils]: 21: Hoare triple {12763#(<= ~counter~0 1)} assume !(0 == ~cond); {12763#(<= ~counter~0 1)} is VALID [2022-04-28 11:23:12,099 INFO L290 TraceCheckUtils]: 22: Hoare triple {12763#(<= ~counter~0 1)} assume true; {12763#(<= ~counter~0 1)} is VALID [2022-04-28 11:23:12,099 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {12763#(<= ~counter~0 1)} {12763#(<= ~counter~0 1)} #81#return; {12763#(<= ~counter~0 1)} is VALID [2022-04-28 11:23:12,100 INFO L290 TraceCheckUtils]: 24: Hoare triple {12763#(<= ~counter~0 1)} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {12763#(<= ~counter~0 1)} is VALID [2022-04-28 11:23:12,100 INFO L290 TraceCheckUtils]: 25: Hoare triple {12763#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {12803#(<= ~counter~0 2)} is VALID [2022-04-28 11:23:12,100 INFO L290 TraceCheckUtils]: 26: Hoare triple {12803#(<= ~counter~0 2)} assume !!(#t~post7 < 10);havoc #t~post7; {12803#(<= ~counter~0 2)} is VALID [2022-04-28 11:23:12,101 INFO L272 TraceCheckUtils]: 27: Hoare triple {12803#(<= ~counter~0 2)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {12803#(<= ~counter~0 2)} is VALID [2022-04-28 11:23:12,101 INFO L290 TraceCheckUtils]: 28: Hoare triple {12803#(<= ~counter~0 2)} ~cond := #in~cond; {12803#(<= ~counter~0 2)} is VALID [2022-04-28 11:23:12,101 INFO L290 TraceCheckUtils]: 29: Hoare triple {12803#(<= ~counter~0 2)} assume !(0 == ~cond); {12803#(<= ~counter~0 2)} is VALID [2022-04-28 11:23:12,101 INFO L290 TraceCheckUtils]: 30: Hoare triple {12803#(<= ~counter~0 2)} assume true; {12803#(<= ~counter~0 2)} is VALID [2022-04-28 11:23:12,102 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {12803#(<= ~counter~0 2)} {12803#(<= ~counter~0 2)} #83#return; {12803#(<= ~counter~0 2)} is VALID [2022-04-28 11:23:12,102 INFO L272 TraceCheckUtils]: 32: Hoare triple {12803#(<= ~counter~0 2)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {12803#(<= ~counter~0 2)} is VALID [2022-04-28 11:23:12,103 INFO L290 TraceCheckUtils]: 33: Hoare triple {12803#(<= ~counter~0 2)} ~cond := #in~cond; {12803#(<= ~counter~0 2)} is VALID [2022-04-28 11:23:12,103 INFO L290 TraceCheckUtils]: 34: Hoare triple {12803#(<= ~counter~0 2)} assume !(0 == ~cond); {12803#(<= ~counter~0 2)} is VALID [2022-04-28 11:23:12,103 INFO L290 TraceCheckUtils]: 35: Hoare triple {12803#(<= ~counter~0 2)} assume true; {12803#(<= ~counter~0 2)} is VALID [2022-04-28 11:23:12,104 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {12803#(<= ~counter~0 2)} {12803#(<= ~counter~0 2)} #85#return; {12803#(<= ~counter~0 2)} is VALID [2022-04-28 11:23:12,104 INFO L272 TraceCheckUtils]: 37: Hoare triple {12803#(<= ~counter~0 2)} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {12803#(<= ~counter~0 2)} is VALID [2022-04-28 11:23:12,104 INFO L290 TraceCheckUtils]: 38: Hoare triple {12803#(<= ~counter~0 2)} ~cond := #in~cond; {12803#(<= ~counter~0 2)} is VALID [2022-04-28 11:23:12,104 INFO L290 TraceCheckUtils]: 39: Hoare triple {12803#(<= ~counter~0 2)} assume !(0 == ~cond); {12803#(<= ~counter~0 2)} is VALID [2022-04-28 11:23:12,105 INFO L290 TraceCheckUtils]: 40: Hoare triple {12803#(<= ~counter~0 2)} assume true; {12803#(<= ~counter~0 2)} is VALID [2022-04-28 11:23:12,105 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {12803#(<= ~counter~0 2)} {12803#(<= ~counter~0 2)} #87#return; {12803#(<= ~counter~0 2)} is VALID [2022-04-28 11:23:12,105 INFO L290 TraceCheckUtils]: 42: Hoare triple {12803#(<= ~counter~0 2)} assume !!(~r~0 >= 2 * ~b~0); {12803#(<= ~counter~0 2)} is VALID [2022-04-28 11:23:12,106 INFO L272 TraceCheckUtils]: 43: Hoare triple {12803#(<= ~counter~0 2)} call __VERIFIER_assert((if ~r~0 >= 2 * ~y~0 * ~a~0 then 1 else 0)); {12803#(<= ~counter~0 2)} is VALID [2022-04-28 11:23:12,106 INFO L290 TraceCheckUtils]: 44: Hoare triple {12803#(<= ~counter~0 2)} ~cond := #in~cond; {12803#(<= ~counter~0 2)} is VALID [2022-04-28 11:23:12,106 INFO L290 TraceCheckUtils]: 45: Hoare triple {12803#(<= ~counter~0 2)} assume !(0 == ~cond); {12803#(<= ~counter~0 2)} is VALID [2022-04-28 11:23:12,106 INFO L290 TraceCheckUtils]: 46: Hoare triple {12803#(<= ~counter~0 2)} assume true; {12803#(<= ~counter~0 2)} is VALID [2022-04-28 11:23:12,107 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {12803#(<= ~counter~0 2)} {12803#(<= ~counter~0 2)} #89#return; {12803#(<= ~counter~0 2)} is VALID [2022-04-28 11:23:12,107 INFO L290 TraceCheckUtils]: 48: Hoare triple {12803#(<= ~counter~0 2)} ~a~0 := 2 * ~a~0;~b~0 := 2 * ~b~0; {12803#(<= ~counter~0 2)} is VALID [2022-04-28 11:23:12,108 INFO L290 TraceCheckUtils]: 49: Hoare triple {12803#(<= ~counter~0 2)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {12876#(<= ~counter~0 3)} is VALID [2022-04-28 11:23:12,108 INFO L290 TraceCheckUtils]: 50: Hoare triple {12876#(<= ~counter~0 3)} assume !!(#t~post7 < 10);havoc #t~post7; {12876#(<= ~counter~0 3)} is VALID [2022-04-28 11:23:12,108 INFO L272 TraceCheckUtils]: 51: Hoare triple {12876#(<= ~counter~0 3)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {12876#(<= ~counter~0 3)} is VALID [2022-04-28 11:23:12,109 INFO L290 TraceCheckUtils]: 52: Hoare triple {12876#(<= ~counter~0 3)} ~cond := #in~cond; {12876#(<= ~counter~0 3)} is VALID [2022-04-28 11:23:12,109 INFO L290 TraceCheckUtils]: 53: Hoare triple {12876#(<= ~counter~0 3)} assume !(0 == ~cond); {12876#(<= ~counter~0 3)} is VALID [2022-04-28 11:23:12,109 INFO L290 TraceCheckUtils]: 54: Hoare triple {12876#(<= ~counter~0 3)} assume true; {12876#(<= ~counter~0 3)} is VALID [2022-04-28 11:23:12,109 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {12876#(<= ~counter~0 3)} {12876#(<= ~counter~0 3)} #83#return; {12876#(<= ~counter~0 3)} is VALID [2022-04-28 11:23:12,110 INFO L272 TraceCheckUtils]: 56: Hoare triple {12876#(<= ~counter~0 3)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {12876#(<= ~counter~0 3)} is VALID [2022-04-28 11:23:12,110 INFO L290 TraceCheckUtils]: 57: Hoare triple {12876#(<= ~counter~0 3)} ~cond := #in~cond; {12876#(<= ~counter~0 3)} is VALID [2022-04-28 11:23:12,110 INFO L290 TraceCheckUtils]: 58: Hoare triple {12876#(<= ~counter~0 3)} assume !(0 == ~cond); {12876#(<= ~counter~0 3)} is VALID [2022-04-28 11:23:12,111 INFO L290 TraceCheckUtils]: 59: Hoare triple {12876#(<= ~counter~0 3)} assume true; {12876#(<= ~counter~0 3)} is VALID [2022-04-28 11:23:12,111 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {12876#(<= ~counter~0 3)} {12876#(<= ~counter~0 3)} #85#return; {12876#(<= ~counter~0 3)} is VALID [2022-04-28 11:23:12,111 INFO L272 TraceCheckUtils]: 61: Hoare triple {12876#(<= ~counter~0 3)} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {12876#(<= ~counter~0 3)} is VALID [2022-04-28 11:23:12,112 INFO L290 TraceCheckUtils]: 62: Hoare triple {12876#(<= ~counter~0 3)} ~cond := #in~cond; {12876#(<= ~counter~0 3)} is VALID [2022-04-28 11:23:12,112 INFO L290 TraceCheckUtils]: 63: Hoare triple {12876#(<= ~counter~0 3)} assume !(0 == ~cond); {12876#(<= ~counter~0 3)} is VALID [2022-04-28 11:23:12,112 INFO L290 TraceCheckUtils]: 64: Hoare triple {12876#(<= ~counter~0 3)} assume true; {12876#(<= ~counter~0 3)} is VALID [2022-04-28 11:23:12,113 INFO L284 TraceCheckUtils]: 65: Hoare quadruple {12876#(<= ~counter~0 3)} {12876#(<= ~counter~0 3)} #87#return; {12876#(<= ~counter~0 3)} is VALID [2022-04-28 11:23:12,113 INFO L290 TraceCheckUtils]: 66: Hoare triple {12876#(<= ~counter~0 3)} assume !(~r~0 >= 2 * ~b~0); {12876#(<= ~counter~0 3)} is VALID [2022-04-28 11:23:12,113 INFO L290 TraceCheckUtils]: 67: Hoare triple {12876#(<= ~counter~0 3)} ~r~0 := ~r~0 - ~b~0;~q~0 := ~q~0 + ~a~0; {12876#(<= ~counter~0 3)} is VALID [2022-04-28 11:23:12,113 INFO L290 TraceCheckUtils]: 68: Hoare triple {12876#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12934#(<= ~counter~0 4)} is VALID [2022-04-28 11:23:12,114 INFO L290 TraceCheckUtils]: 69: Hoare triple {12934#(<= ~counter~0 4)} assume !!(#t~post6 < 10);havoc #t~post6; {12934#(<= ~counter~0 4)} is VALID [2022-04-28 11:23:12,114 INFO L272 TraceCheckUtils]: 70: Hoare triple {12934#(<= ~counter~0 4)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {12934#(<= ~counter~0 4)} is VALID [2022-04-28 11:23:12,114 INFO L290 TraceCheckUtils]: 71: Hoare triple {12934#(<= ~counter~0 4)} ~cond := #in~cond; {12934#(<= ~counter~0 4)} is VALID [2022-04-28 11:23:12,115 INFO L290 TraceCheckUtils]: 72: Hoare triple {12934#(<= ~counter~0 4)} assume !(0 == ~cond); {12934#(<= ~counter~0 4)} is VALID [2022-04-28 11:23:12,115 INFO L290 TraceCheckUtils]: 73: Hoare triple {12934#(<= ~counter~0 4)} assume true; {12934#(<= ~counter~0 4)} is VALID [2022-04-28 11:23:12,115 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {12934#(<= ~counter~0 4)} {12934#(<= ~counter~0 4)} #79#return; {12934#(<= ~counter~0 4)} is VALID [2022-04-28 11:23:12,116 INFO L272 TraceCheckUtils]: 75: Hoare triple {12934#(<= ~counter~0 4)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {12934#(<= ~counter~0 4)} is VALID [2022-04-28 11:23:12,116 INFO L290 TraceCheckUtils]: 76: Hoare triple {12934#(<= ~counter~0 4)} ~cond := #in~cond; {12934#(<= ~counter~0 4)} is VALID [2022-04-28 11:23:12,117 INFO L290 TraceCheckUtils]: 77: Hoare triple {12934#(<= ~counter~0 4)} assume !(0 == ~cond); {12934#(<= ~counter~0 4)} is VALID [2022-04-28 11:23:12,117 INFO L290 TraceCheckUtils]: 78: Hoare triple {12934#(<= ~counter~0 4)} assume true; {12934#(<= ~counter~0 4)} is VALID [2022-04-28 11:23:12,117 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {12934#(<= ~counter~0 4)} {12934#(<= ~counter~0 4)} #81#return; {12934#(<= ~counter~0 4)} is VALID [2022-04-28 11:23:12,118 INFO L290 TraceCheckUtils]: 80: Hoare triple {12934#(<= ~counter~0 4)} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {12934#(<= ~counter~0 4)} is VALID [2022-04-28 11:23:12,118 INFO L290 TraceCheckUtils]: 81: Hoare triple {12934#(<= ~counter~0 4)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {12974#(<= |main_#t~post7| 4)} is VALID [2022-04-28 11:23:12,118 INFO L290 TraceCheckUtils]: 82: Hoare triple {12974#(<= |main_#t~post7| 4)} assume !(#t~post7 < 10);havoc #t~post7; {12722#false} is VALID [2022-04-28 11:23:12,118 INFO L290 TraceCheckUtils]: 83: Hoare triple {12722#false} ~r~0 := ~r~0 - ~b~0;~q~0 := ~q~0 + ~a~0; {12722#false} is VALID [2022-04-28 11:23:12,118 INFO L290 TraceCheckUtils]: 84: Hoare triple {12722#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12722#false} is VALID [2022-04-28 11:23:12,118 INFO L290 TraceCheckUtils]: 85: Hoare triple {12722#false} assume !(#t~post6 < 10);havoc #t~post6; {12722#false} is VALID [2022-04-28 11:23:12,119 INFO L272 TraceCheckUtils]: 86: Hoare triple {12722#false} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {12722#false} is VALID [2022-04-28 11:23:12,119 INFO L290 TraceCheckUtils]: 87: Hoare triple {12722#false} ~cond := #in~cond; {12722#false} is VALID [2022-04-28 11:23:12,119 INFO L290 TraceCheckUtils]: 88: Hoare triple {12722#false} assume 0 == ~cond; {12722#false} is VALID [2022-04-28 11:23:12,119 INFO L290 TraceCheckUtils]: 89: Hoare triple {12722#false} assume !false; {12722#false} is VALID [2022-04-28 11:23:12,119 INFO L134 CoverageAnalysis]: Checked inductivity of 262 backedges. 27 proven. 191 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-04-28 11:23:12,119 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:23:12,417 INFO L290 TraceCheckUtils]: 89: Hoare triple {12722#false} assume !false; {12722#false} is VALID [2022-04-28 11:23:12,417 INFO L290 TraceCheckUtils]: 88: Hoare triple {12722#false} assume 0 == ~cond; {12722#false} is VALID [2022-04-28 11:23:12,418 INFO L290 TraceCheckUtils]: 87: Hoare triple {12722#false} ~cond := #in~cond; {12722#false} is VALID [2022-04-28 11:23:12,418 INFO L272 TraceCheckUtils]: 86: Hoare triple {12722#false} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {12722#false} is VALID [2022-04-28 11:23:12,418 INFO L290 TraceCheckUtils]: 85: Hoare triple {12722#false} assume !(#t~post6 < 10);havoc #t~post6; {12722#false} is VALID [2022-04-28 11:23:12,418 INFO L290 TraceCheckUtils]: 84: Hoare triple {12722#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12722#false} is VALID [2022-04-28 11:23:12,418 INFO L290 TraceCheckUtils]: 83: Hoare triple {12722#false} ~r~0 := ~r~0 - ~b~0;~q~0 := ~q~0 + ~a~0; {12722#false} is VALID [2022-04-28 11:23:12,418 INFO L290 TraceCheckUtils]: 82: Hoare triple {13020#(< |main_#t~post7| 10)} assume !(#t~post7 < 10);havoc #t~post7; {12722#false} is VALID [2022-04-28 11:23:12,418 INFO L290 TraceCheckUtils]: 81: Hoare triple {13024#(< ~counter~0 10)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {13020#(< |main_#t~post7| 10)} is VALID [2022-04-28 11:23:12,419 INFO L290 TraceCheckUtils]: 80: Hoare triple {13024#(< ~counter~0 10)} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {13024#(< ~counter~0 10)} is VALID [2022-04-28 11:23:12,419 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {12721#true} {13024#(< ~counter~0 10)} #81#return; {13024#(< ~counter~0 10)} is VALID [2022-04-28 11:23:12,419 INFO L290 TraceCheckUtils]: 78: Hoare triple {12721#true} assume true; {12721#true} is VALID [2022-04-28 11:23:12,419 INFO L290 TraceCheckUtils]: 77: Hoare triple {12721#true} assume !(0 == ~cond); {12721#true} is VALID [2022-04-28 11:23:12,419 INFO L290 TraceCheckUtils]: 76: Hoare triple {12721#true} ~cond := #in~cond; {12721#true} is VALID [2022-04-28 11:23:12,419 INFO L272 TraceCheckUtils]: 75: Hoare triple {13024#(< ~counter~0 10)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {12721#true} is VALID [2022-04-28 11:23:12,420 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {12721#true} {13024#(< ~counter~0 10)} #79#return; {13024#(< ~counter~0 10)} is VALID [2022-04-28 11:23:12,420 INFO L290 TraceCheckUtils]: 73: Hoare triple {12721#true} assume true; {12721#true} is VALID [2022-04-28 11:23:12,420 INFO L290 TraceCheckUtils]: 72: Hoare triple {12721#true} assume !(0 == ~cond); {12721#true} is VALID [2022-04-28 11:23:12,420 INFO L290 TraceCheckUtils]: 71: Hoare triple {12721#true} ~cond := #in~cond; {12721#true} is VALID [2022-04-28 11:23:12,420 INFO L272 TraceCheckUtils]: 70: Hoare triple {13024#(< ~counter~0 10)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {12721#true} is VALID [2022-04-28 11:23:12,420 INFO L290 TraceCheckUtils]: 69: Hoare triple {13024#(< ~counter~0 10)} assume !!(#t~post6 < 10);havoc #t~post6; {13024#(< ~counter~0 10)} is VALID [2022-04-28 11:23:12,421 INFO L290 TraceCheckUtils]: 68: Hoare triple {13064#(< ~counter~0 9)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {13024#(< ~counter~0 10)} is VALID [2022-04-28 11:23:12,421 INFO L290 TraceCheckUtils]: 67: Hoare triple {13064#(< ~counter~0 9)} ~r~0 := ~r~0 - ~b~0;~q~0 := ~q~0 + ~a~0; {13064#(< ~counter~0 9)} is VALID [2022-04-28 11:23:12,421 INFO L290 TraceCheckUtils]: 66: Hoare triple {13064#(< ~counter~0 9)} assume !(~r~0 >= 2 * ~b~0); {13064#(< ~counter~0 9)} is VALID [2022-04-28 11:23:12,422 INFO L284 TraceCheckUtils]: 65: Hoare quadruple {12721#true} {13064#(< ~counter~0 9)} #87#return; {13064#(< ~counter~0 9)} is VALID [2022-04-28 11:23:12,422 INFO L290 TraceCheckUtils]: 64: Hoare triple {12721#true} assume true; {12721#true} is VALID [2022-04-28 11:23:12,422 INFO L290 TraceCheckUtils]: 63: Hoare triple {12721#true} assume !(0 == ~cond); {12721#true} is VALID [2022-04-28 11:23:12,422 INFO L290 TraceCheckUtils]: 62: Hoare triple {12721#true} ~cond := #in~cond; {12721#true} is VALID [2022-04-28 11:23:12,422 INFO L272 TraceCheckUtils]: 61: Hoare triple {13064#(< ~counter~0 9)} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {12721#true} is VALID [2022-04-28 11:23:12,423 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {12721#true} {13064#(< ~counter~0 9)} #85#return; {13064#(< ~counter~0 9)} is VALID [2022-04-28 11:23:12,423 INFO L290 TraceCheckUtils]: 59: Hoare triple {12721#true} assume true; {12721#true} is VALID [2022-04-28 11:23:12,423 INFO L290 TraceCheckUtils]: 58: Hoare triple {12721#true} assume !(0 == ~cond); {12721#true} is VALID [2022-04-28 11:23:12,423 INFO L290 TraceCheckUtils]: 57: Hoare triple {12721#true} ~cond := #in~cond; {12721#true} is VALID [2022-04-28 11:23:12,423 INFO L272 TraceCheckUtils]: 56: Hoare triple {13064#(< ~counter~0 9)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {12721#true} is VALID [2022-04-28 11:23:12,423 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {12721#true} {13064#(< ~counter~0 9)} #83#return; {13064#(< ~counter~0 9)} is VALID [2022-04-28 11:23:12,423 INFO L290 TraceCheckUtils]: 54: Hoare triple {12721#true} assume true; {12721#true} is VALID [2022-04-28 11:23:12,423 INFO L290 TraceCheckUtils]: 53: Hoare triple {12721#true} assume !(0 == ~cond); {12721#true} is VALID [2022-04-28 11:23:12,423 INFO L290 TraceCheckUtils]: 52: Hoare triple {12721#true} ~cond := #in~cond; {12721#true} is VALID [2022-04-28 11:23:12,424 INFO L272 TraceCheckUtils]: 51: Hoare triple {13064#(< ~counter~0 9)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {12721#true} is VALID [2022-04-28 11:23:12,424 INFO L290 TraceCheckUtils]: 50: Hoare triple {13064#(< ~counter~0 9)} assume !!(#t~post7 < 10);havoc #t~post7; {13064#(< ~counter~0 9)} is VALID [2022-04-28 11:23:12,424 INFO L290 TraceCheckUtils]: 49: Hoare triple {13122#(< ~counter~0 8)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {13064#(< ~counter~0 9)} is VALID [2022-04-28 11:23:12,424 INFO L290 TraceCheckUtils]: 48: Hoare triple {13122#(< ~counter~0 8)} ~a~0 := 2 * ~a~0;~b~0 := 2 * ~b~0; {13122#(< ~counter~0 8)} is VALID [2022-04-28 11:23:12,425 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {12721#true} {13122#(< ~counter~0 8)} #89#return; {13122#(< ~counter~0 8)} is VALID [2022-04-28 11:23:12,425 INFO L290 TraceCheckUtils]: 46: Hoare triple {12721#true} assume true; {12721#true} is VALID [2022-04-28 11:23:12,425 INFO L290 TraceCheckUtils]: 45: Hoare triple {12721#true} assume !(0 == ~cond); {12721#true} is VALID [2022-04-28 11:23:12,425 INFO L290 TraceCheckUtils]: 44: Hoare triple {12721#true} ~cond := #in~cond; {12721#true} is VALID [2022-04-28 11:23:12,425 INFO L272 TraceCheckUtils]: 43: Hoare triple {13122#(< ~counter~0 8)} call __VERIFIER_assert((if ~r~0 >= 2 * ~y~0 * ~a~0 then 1 else 0)); {12721#true} is VALID [2022-04-28 11:23:12,425 INFO L290 TraceCheckUtils]: 42: Hoare triple {13122#(< ~counter~0 8)} assume !!(~r~0 >= 2 * ~b~0); {13122#(< ~counter~0 8)} is VALID [2022-04-28 11:23:12,426 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {12721#true} {13122#(< ~counter~0 8)} #87#return; {13122#(< ~counter~0 8)} is VALID [2022-04-28 11:23:12,426 INFO L290 TraceCheckUtils]: 40: Hoare triple {12721#true} assume true; {12721#true} is VALID [2022-04-28 11:23:12,426 INFO L290 TraceCheckUtils]: 39: Hoare triple {12721#true} assume !(0 == ~cond); {12721#true} is VALID [2022-04-28 11:23:12,426 INFO L290 TraceCheckUtils]: 38: Hoare triple {12721#true} ~cond := #in~cond; {12721#true} is VALID [2022-04-28 11:23:12,426 INFO L272 TraceCheckUtils]: 37: Hoare triple {13122#(< ~counter~0 8)} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {12721#true} is VALID [2022-04-28 11:23:12,427 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {12721#true} {13122#(< ~counter~0 8)} #85#return; {13122#(< ~counter~0 8)} is VALID [2022-04-28 11:23:12,427 INFO L290 TraceCheckUtils]: 35: Hoare triple {12721#true} assume true; {12721#true} is VALID [2022-04-28 11:23:12,427 INFO L290 TraceCheckUtils]: 34: Hoare triple {12721#true} assume !(0 == ~cond); {12721#true} is VALID [2022-04-28 11:23:12,427 INFO L290 TraceCheckUtils]: 33: Hoare triple {12721#true} ~cond := #in~cond; {12721#true} is VALID [2022-04-28 11:23:12,427 INFO L272 TraceCheckUtils]: 32: Hoare triple {13122#(< ~counter~0 8)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {12721#true} is VALID [2022-04-28 11:23:12,427 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {12721#true} {13122#(< ~counter~0 8)} #83#return; {13122#(< ~counter~0 8)} is VALID [2022-04-28 11:23:12,427 INFO L290 TraceCheckUtils]: 30: Hoare triple {12721#true} assume true; {12721#true} is VALID [2022-04-28 11:23:12,427 INFO L290 TraceCheckUtils]: 29: Hoare triple {12721#true} assume !(0 == ~cond); {12721#true} is VALID [2022-04-28 11:23:12,427 INFO L290 TraceCheckUtils]: 28: Hoare triple {12721#true} ~cond := #in~cond; {12721#true} is VALID [2022-04-28 11:23:12,428 INFO L272 TraceCheckUtils]: 27: Hoare triple {13122#(< ~counter~0 8)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {12721#true} is VALID [2022-04-28 11:23:12,428 INFO L290 TraceCheckUtils]: 26: Hoare triple {13122#(< ~counter~0 8)} assume !!(#t~post7 < 10);havoc #t~post7; {13122#(< ~counter~0 8)} is VALID [2022-04-28 11:23:12,428 INFO L290 TraceCheckUtils]: 25: Hoare triple {13195#(< ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {13122#(< ~counter~0 8)} is VALID [2022-04-28 11:23:12,428 INFO L290 TraceCheckUtils]: 24: Hoare triple {13195#(< ~counter~0 7)} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {13195#(< ~counter~0 7)} is VALID [2022-04-28 11:23:12,429 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {12721#true} {13195#(< ~counter~0 7)} #81#return; {13195#(< ~counter~0 7)} is VALID [2022-04-28 11:23:12,429 INFO L290 TraceCheckUtils]: 22: Hoare triple {12721#true} assume true; {12721#true} is VALID [2022-04-28 11:23:12,429 INFO L290 TraceCheckUtils]: 21: Hoare triple {12721#true} assume !(0 == ~cond); {12721#true} is VALID [2022-04-28 11:23:12,429 INFO L290 TraceCheckUtils]: 20: Hoare triple {12721#true} ~cond := #in~cond; {12721#true} is VALID [2022-04-28 11:23:12,429 INFO L272 TraceCheckUtils]: 19: Hoare triple {13195#(< ~counter~0 7)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {12721#true} is VALID [2022-04-28 11:23:12,434 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {12721#true} {13195#(< ~counter~0 7)} #79#return; {13195#(< ~counter~0 7)} is VALID [2022-04-28 11:23:12,434 INFO L290 TraceCheckUtils]: 17: Hoare triple {12721#true} assume true; {12721#true} is VALID [2022-04-28 11:23:12,434 INFO L290 TraceCheckUtils]: 16: Hoare triple {12721#true} assume !(0 == ~cond); {12721#true} is VALID [2022-04-28 11:23:12,434 INFO L290 TraceCheckUtils]: 15: Hoare triple {12721#true} ~cond := #in~cond; {12721#true} is VALID [2022-04-28 11:23:12,434 INFO L272 TraceCheckUtils]: 14: Hoare triple {13195#(< ~counter~0 7)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {12721#true} is VALID [2022-04-28 11:23:12,434 INFO L290 TraceCheckUtils]: 13: Hoare triple {13195#(< ~counter~0 7)} assume !!(#t~post6 < 10);havoc #t~post6; {13195#(< ~counter~0 7)} is VALID [2022-04-28 11:23:12,435 INFO L290 TraceCheckUtils]: 12: Hoare triple {13235#(< ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {13195#(< ~counter~0 7)} is VALID [2022-04-28 11:23:12,435 INFO L290 TraceCheckUtils]: 11: Hoare triple {13235#(< ~counter~0 6)} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {13235#(< ~counter~0 6)} is VALID [2022-04-28 11:23:12,435 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {12721#true} {13235#(< ~counter~0 6)} #77#return; {13235#(< ~counter~0 6)} is VALID [2022-04-28 11:23:12,435 INFO L290 TraceCheckUtils]: 9: Hoare triple {12721#true} assume true; {12721#true} is VALID [2022-04-28 11:23:12,435 INFO L290 TraceCheckUtils]: 8: Hoare triple {12721#true} assume !(0 == ~cond); {12721#true} is VALID [2022-04-28 11:23:12,436 INFO L290 TraceCheckUtils]: 7: Hoare triple {12721#true} ~cond := #in~cond; {12721#true} is VALID [2022-04-28 11:23:12,436 INFO L272 TraceCheckUtils]: 6: Hoare triple {13235#(< ~counter~0 6)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {12721#true} is VALID [2022-04-28 11:23:12,436 INFO L290 TraceCheckUtils]: 5: Hoare triple {13235#(< ~counter~0 6)} 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; {13235#(< ~counter~0 6)} is VALID [2022-04-28 11:23:12,436 INFO L272 TraceCheckUtils]: 4: Hoare triple {13235#(< ~counter~0 6)} call #t~ret8 := main(); {13235#(< ~counter~0 6)} is VALID [2022-04-28 11:23:12,436 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13235#(< ~counter~0 6)} {12721#true} #93#return; {13235#(< ~counter~0 6)} is VALID [2022-04-28 11:23:12,437 INFO L290 TraceCheckUtils]: 2: Hoare triple {13235#(< ~counter~0 6)} assume true; {13235#(< ~counter~0 6)} is VALID [2022-04-28 11:23:12,437 INFO L290 TraceCheckUtils]: 1: Hoare triple {12721#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; {13235#(< ~counter~0 6)} is VALID [2022-04-28 11:23:12,437 INFO L272 TraceCheckUtils]: 0: Hoare triple {12721#true} call ULTIMATE.init(); {12721#true} is VALID [2022-04-28 11:23:12,437 INFO L134 CoverageAnalysis]: Checked inductivity of 262 backedges. 27 proven. 15 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2022-04-28 11:23:12,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:23:12,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791135676] [2022-04-28 11:23:12,438 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:23:12,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1349999800] [2022-04-28 11:23:12,438 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1349999800] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 11:23:12,438 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 11:23:12,438 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-04-28 11:23:12,438 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:23:12,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [980771978] [2022-04-28 11:23:12,438 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [980771978] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:23:12,438 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:23:12,438 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 11:23:12,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391004884] [2022-04-28 11:23:12,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:23:12,439 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 7 states have internal predecessors, (41), 7 states have call successors, (15), 7 states have call predecessors, (15), 5 states have return successors, (13), 5 states have call predecessors, (13), 6 states have call successors, (13) Word has length 90 [2022-04-28 11:23:12,439 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:23:12,439 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 5.125) internal successors, (41), 7 states have internal predecessors, (41), 7 states have call successors, (15), 7 states have call predecessors, (15), 5 states have return successors, (13), 5 states have call predecessors, (13), 6 states have call successors, (13) [2022-04-28 11:23:12,489 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:23:12,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 11:23:12,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:23:12,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 11:23:12,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-28 11:23:12,490 INFO L87 Difference]: Start difference. First operand 168 states and 206 transitions. Second operand has 8 states, 8 states have (on average 5.125) internal successors, (41), 7 states have internal predecessors, (41), 7 states have call successors, (15), 7 states have call predecessors, (15), 5 states have return successors, (13), 5 states have call predecessors, (13), 6 states have call successors, (13) [2022-04-28 11:23:12,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:23:12,960 INFO L93 Difference]: Finished difference Result 269 states and 336 transitions. [2022-04-28 11:23:12,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-28 11:23:12,960 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 7 states have internal predecessors, (41), 7 states have call successors, (15), 7 states have call predecessors, (15), 5 states have return successors, (13), 5 states have call predecessors, (13), 6 states have call successors, (13) Word has length 90 [2022-04-28 11:23:12,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:23:12,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 5.125) internal successors, (41), 7 states have internal predecessors, (41), 7 states have call successors, (15), 7 states have call predecessors, (15), 5 states have return successors, (13), 5 states have call predecessors, (13), 6 states have call successors, (13) [2022-04-28 11:23:12,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 143 transitions. [2022-04-28 11:23:12,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 5.125) internal successors, (41), 7 states have internal predecessors, (41), 7 states have call successors, (15), 7 states have call predecessors, (15), 5 states have return successors, (13), 5 states have call predecessors, (13), 6 states have call successors, (13) [2022-04-28 11:23:12,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 143 transitions. [2022-04-28 11:23:12,963 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 143 transitions. [2022-04-28 11:23:13,064 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 143 edges. 143 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:23:13,067 INFO L225 Difference]: With dead ends: 269 [2022-04-28 11:23:13,068 INFO L226 Difference]: Without dead ends: 196 [2022-04-28 11:23:13,068 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=107, Invalid=165, Unknown=0, NotChecked=0, Total=272 [2022-04-28 11:23:13,069 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 30 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 11:23:13,069 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 193 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 11:23:13,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2022-04-28 11:23:13,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 196. [2022-04-28 11:23:13,320 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:23:13,321 INFO L82 GeneralOperation]: Start isEquivalent. First operand 196 states. Second operand has 196 states, 127 states have (on average 1.1338582677165354) internal successors, (144), 129 states have internal predecessors, (144), 45 states have call successors, (45), 24 states have call predecessors, (45), 23 states have return successors, (43), 42 states have call predecessors, (43), 43 states have call successors, (43) [2022-04-28 11:23:13,321 INFO L74 IsIncluded]: Start isIncluded. First operand 196 states. Second operand has 196 states, 127 states have (on average 1.1338582677165354) internal successors, (144), 129 states have internal predecessors, (144), 45 states have call successors, (45), 24 states have call predecessors, (45), 23 states have return successors, (43), 42 states have call predecessors, (43), 43 states have call successors, (43) [2022-04-28 11:23:13,321 INFO L87 Difference]: Start difference. First operand 196 states. Second operand has 196 states, 127 states have (on average 1.1338582677165354) internal successors, (144), 129 states have internal predecessors, (144), 45 states have call successors, (45), 24 states have call predecessors, (45), 23 states have return successors, (43), 42 states have call predecessors, (43), 43 states have call successors, (43) [2022-04-28 11:23:13,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:23:13,325 INFO L93 Difference]: Finished difference Result 196 states and 232 transitions. [2022-04-28 11:23:13,325 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 232 transitions. [2022-04-28 11:23:13,325 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:23:13,325 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:23:13,325 INFO L74 IsIncluded]: Start isIncluded. First operand has 196 states, 127 states have (on average 1.1338582677165354) internal successors, (144), 129 states have internal predecessors, (144), 45 states have call successors, (45), 24 states have call predecessors, (45), 23 states have return successors, (43), 42 states have call predecessors, (43), 43 states have call successors, (43) Second operand 196 states. [2022-04-28 11:23:13,326 INFO L87 Difference]: Start difference. First operand has 196 states, 127 states have (on average 1.1338582677165354) internal successors, (144), 129 states have internal predecessors, (144), 45 states have call successors, (45), 24 states have call predecessors, (45), 23 states have return successors, (43), 42 states have call predecessors, (43), 43 states have call successors, (43) Second operand 196 states. [2022-04-28 11:23:13,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:23:13,329 INFO L93 Difference]: Finished difference Result 196 states and 232 transitions. [2022-04-28 11:23:13,329 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 232 transitions. [2022-04-28 11:23:13,329 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:23:13,329 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:23:13,329 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:23:13,329 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:23:13,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 127 states have (on average 1.1338582677165354) internal successors, (144), 129 states have internal predecessors, (144), 45 states have call successors, (45), 24 states have call predecessors, (45), 23 states have return successors, (43), 42 states have call predecessors, (43), 43 states have call successors, (43) [2022-04-28 11:23:13,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 232 transitions. [2022-04-28 11:23:13,333 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 232 transitions. Word has length 90 [2022-04-28 11:23:13,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:23:13,333 INFO L495 AbstractCegarLoop]: Abstraction has 196 states and 232 transitions. [2022-04-28 11:23:13,334 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 7 states have internal predecessors, (41), 7 states have call successors, (15), 7 states have call predecessors, (15), 5 states have return successors, (13), 5 states have call predecessors, (13), 6 states have call successors, (13) [2022-04-28 11:23:13,334 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 196 states and 232 transitions. [2022-04-28 11:23:13,614 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 232 edges. 232 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:23:13,615 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 232 transitions. [2022-04-28 11:23:13,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-04-28 11:23:13,617 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:23:13,617 INFO L195 NwaCegarLoop]: trace histogram [15, 14, 14, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:23:13,633 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-04-28 11:23:13,831 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-04-28 11:23:13,832 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:23:13,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:23:13,832 INFO L85 PathProgramCache]: Analyzing trace with hash 447330249, now seen corresponding path program 3 times [2022-04-28 11:23:13,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:23:13,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1736934422] [2022-04-28 11:23:47,301 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:23:47,302 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:23:47,302 INFO L85 PathProgramCache]: Analyzing trace with hash 447330249, now seen corresponding path program 4 times [2022-04-28 11:23:47,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:23:47,302 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362817018] [2022-04-28 11:23:47,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:23:47,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:23:47,311 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:23:47,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [403758092] [2022-04-28 11:23:47,312 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 11:23:47,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:23:47,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:23:47,313 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 11:23:47,339 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-04-28 11:23:47,381 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 11:23:47,381 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:23:47,382 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-28 11:23:47,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:23:47,399 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:23:49,039 INFO L272 TraceCheckUtils]: 0: Hoare triple {14602#true} call ULTIMATE.init(); {14602#true} is VALID [2022-04-28 11:23:49,039 INFO L290 TraceCheckUtils]: 1: Hoare triple {14602#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; {14602#true} is VALID [2022-04-28 11:23:49,039 INFO L290 TraceCheckUtils]: 2: Hoare triple {14602#true} assume true; {14602#true} is VALID [2022-04-28 11:23:49,039 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14602#true} {14602#true} #93#return; {14602#true} is VALID [2022-04-28 11:23:49,039 INFO L272 TraceCheckUtils]: 4: Hoare triple {14602#true} call #t~ret8 := main(); {14602#true} is VALID [2022-04-28 11:23:49,039 INFO L290 TraceCheckUtils]: 5: Hoare triple {14602#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; {14602#true} is VALID [2022-04-28 11:23:49,040 INFO L272 TraceCheckUtils]: 6: Hoare triple {14602#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {14602#true} is VALID [2022-04-28 11:23:49,040 INFO L290 TraceCheckUtils]: 7: Hoare triple {14602#true} ~cond := #in~cond; {14602#true} is VALID [2022-04-28 11:23:49,040 INFO L290 TraceCheckUtils]: 8: Hoare triple {14602#true} assume !(0 == ~cond); {14602#true} is VALID [2022-04-28 11:23:49,040 INFO L290 TraceCheckUtils]: 9: Hoare triple {14602#true} assume true; {14602#true} is VALID [2022-04-28 11:23:49,040 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {14602#true} {14602#true} #77#return; {14602#true} is VALID [2022-04-28 11:23:49,040 INFO L290 TraceCheckUtils]: 11: Hoare triple {14602#true} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {14640#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:23:49,041 INFO L290 TraceCheckUtils]: 12: Hoare triple {14640#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {14640#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:23:49,041 INFO L290 TraceCheckUtils]: 13: Hoare triple {14640#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} assume !!(#t~post6 < 10);havoc #t~post6; {14640#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:23:49,041 INFO L272 TraceCheckUtils]: 14: Hoare triple {14640#(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)); {14602#true} is VALID [2022-04-28 11:23:49,041 INFO L290 TraceCheckUtils]: 15: Hoare triple {14602#true} ~cond := #in~cond; {14602#true} is VALID [2022-04-28 11:23:49,041 INFO L290 TraceCheckUtils]: 16: Hoare triple {14602#true} assume !(0 == ~cond); {14602#true} is VALID [2022-04-28 11:23:49,041 INFO L290 TraceCheckUtils]: 17: Hoare triple {14602#true} assume true; {14602#true} is VALID [2022-04-28 11:23:49,042 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {14602#true} {14640#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #79#return; {14640#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:23:49,042 INFO L272 TraceCheckUtils]: 19: Hoare triple {14640#(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)); {14602#true} is VALID [2022-04-28 11:23:49,042 INFO L290 TraceCheckUtils]: 20: Hoare triple {14602#true} ~cond := #in~cond; {14602#true} is VALID [2022-04-28 11:23:49,042 INFO L290 TraceCheckUtils]: 21: Hoare triple {14602#true} assume !(0 == ~cond); {14602#true} is VALID [2022-04-28 11:23:49,042 INFO L290 TraceCheckUtils]: 22: Hoare triple {14602#true} assume true; {14602#true} is VALID [2022-04-28 11:23:49,042 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {14602#true} {14640#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #81#return; {14640#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:23:49,043 INFO L290 TraceCheckUtils]: 24: Hoare triple {14640#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {14680#(and (<= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-28 11:23:49,043 INFO L290 TraceCheckUtils]: 25: Hoare triple {14680#(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; {14680#(and (<= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-28 11:23:49,044 INFO L290 TraceCheckUtils]: 26: Hoare triple {14680#(and (<= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} assume !!(#t~post7 < 10);havoc #t~post7; {14680#(and (<= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-28 11:23:49,044 INFO L272 TraceCheckUtils]: 27: Hoare triple {14680#(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)); {14602#true} is VALID [2022-04-28 11:23:49,044 INFO L290 TraceCheckUtils]: 28: Hoare triple {14602#true} ~cond := #in~cond; {14602#true} is VALID [2022-04-28 11:23:49,044 INFO L290 TraceCheckUtils]: 29: Hoare triple {14602#true} assume !(0 == ~cond); {14602#true} is VALID [2022-04-28 11:23:49,044 INFO L290 TraceCheckUtils]: 30: Hoare triple {14602#true} assume true; {14602#true} is VALID [2022-04-28 11:23:49,044 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {14602#true} {14680#(and (<= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #83#return; {14680#(and (<= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-28 11:23:49,044 INFO L272 TraceCheckUtils]: 32: Hoare triple {14680#(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)); {14602#true} is VALID [2022-04-28 11:23:49,045 INFO L290 TraceCheckUtils]: 33: Hoare triple {14602#true} ~cond := #in~cond; {14602#true} is VALID [2022-04-28 11:23:49,045 INFO L290 TraceCheckUtils]: 34: Hoare triple {14602#true} assume !(0 == ~cond); {14602#true} is VALID [2022-04-28 11:23:49,045 INFO L290 TraceCheckUtils]: 35: Hoare triple {14602#true} assume true; {14602#true} is VALID [2022-04-28 11:23:49,045 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {14602#true} {14680#(and (<= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #85#return; {14680#(and (<= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-28 11:23:49,045 INFO L272 TraceCheckUtils]: 37: Hoare triple {14680#(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)); {14602#true} is VALID [2022-04-28 11:23:49,045 INFO L290 TraceCheckUtils]: 38: Hoare triple {14602#true} ~cond := #in~cond; {14602#true} is VALID [2022-04-28 11:23:49,045 INFO L290 TraceCheckUtils]: 39: Hoare triple {14602#true} assume !(0 == ~cond); {14602#true} is VALID [2022-04-28 11:23:49,045 INFO L290 TraceCheckUtils]: 40: Hoare triple {14602#true} assume true; {14602#true} is VALID [2022-04-28 11:23:49,046 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {14602#true} {14680#(and (<= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #87#return; {14680#(and (<= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-28 11:23:49,046 INFO L290 TraceCheckUtils]: 42: Hoare triple {14680#(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); {14680#(and (<= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-28 11:23:49,046 INFO L272 TraceCheckUtils]: 43: Hoare triple {14680#(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)); {14602#true} is VALID [2022-04-28 11:23:49,047 INFO L290 TraceCheckUtils]: 44: Hoare triple {14602#true} ~cond := #in~cond; {14602#true} is VALID [2022-04-28 11:23:49,047 INFO L290 TraceCheckUtils]: 45: Hoare triple {14602#true} assume !(0 == ~cond); {14602#true} is VALID [2022-04-28 11:23:49,047 INFO L290 TraceCheckUtils]: 46: Hoare triple {14602#true} assume true; {14602#true} is VALID [2022-04-28 11:23:49,047 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {14602#true} {14680#(and (<= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #89#return; {14680#(and (<= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-28 11:23:49,048 INFO L290 TraceCheckUtils]: 48: Hoare triple {14680#(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; {14753#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (<= (div main_~a~0 2) 1) (= main_~q~0 0))} is VALID [2022-04-28 11:23:49,048 INFO L290 TraceCheckUtils]: 49: Hoare triple {14753#(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; {14753#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (<= (div main_~a~0 2) 1) (= main_~q~0 0))} is VALID [2022-04-28 11:23:49,049 INFO L290 TraceCheckUtils]: 50: Hoare triple {14753#(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 < 10);havoc #t~post7; {14753#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (<= (div main_~a~0 2) 1) (= main_~q~0 0))} is VALID [2022-04-28 11:23:49,049 INFO L272 TraceCheckUtils]: 51: Hoare triple {14753#(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)); {14602#true} is VALID [2022-04-28 11:23:49,049 INFO L290 TraceCheckUtils]: 52: Hoare triple {14602#true} ~cond := #in~cond; {14602#true} is VALID [2022-04-28 11:23:49,049 INFO L290 TraceCheckUtils]: 53: Hoare triple {14602#true} assume !(0 == ~cond); {14602#true} is VALID [2022-04-28 11:23:49,049 INFO L290 TraceCheckUtils]: 54: Hoare triple {14602#true} assume true; {14602#true} is VALID [2022-04-28 11:23:49,050 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {14602#true} {14753#(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; {14753#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (<= (div main_~a~0 2) 1) (= main_~q~0 0))} is VALID [2022-04-28 11:23:49,050 INFO L272 TraceCheckUtils]: 56: Hoare triple {14753#(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)); {14602#true} is VALID [2022-04-28 11:23:49,050 INFO L290 TraceCheckUtils]: 57: Hoare triple {14602#true} ~cond := #in~cond; {14602#true} is VALID [2022-04-28 11:23:49,050 INFO L290 TraceCheckUtils]: 58: Hoare triple {14602#true} assume !(0 == ~cond); {14602#true} is VALID [2022-04-28 11:23:49,050 INFO L290 TraceCheckUtils]: 59: Hoare triple {14602#true} assume true; {14602#true} is VALID [2022-04-28 11:23:49,050 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {14602#true} {14753#(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; {14753#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (<= (div main_~a~0 2) 1) (= main_~q~0 0))} is VALID [2022-04-28 11:23:49,051 INFO L272 TraceCheckUtils]: 61: Hoare triple {14753#(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)); {14602#true} is VALID [2022-04-28 11:23:49,051 INFO L290 TraceCheckUtils]: 62: Hoare triple {14602#true} ~cond := #in~cond; {14602#true} is VALID [2022-04-28 11:23:49,051 INFO L290 TraceCheckUtils]: 63: Hoare triple {14602#true} assume !(0 == ~cond); {14602#true} is VALID [2022-04-28 11:23:49,051 INFO L290 TraceCheckUtils]: 64: Hoare triple {14602#true} assume true; {14602#true} is VALID [2022-04-28 11:23:49,051 INFO L284 TraceCheckUtils]: 65: Hoare quadruple {14602#true} {14753#(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; {14753#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (<= (div main_~a~0 2) 1) (= main_~q~0 0))} is VALID [2022-04-28 11:23:49,052 INFO L290 TraceCheckUtils]: 66: Hoare triple {14753#(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); {14808#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (not (<= (* main_~b~0 2) main_~r~0)) (<= (div main_~a~0 2) 1) (= main_~q~0 0))} is VALID [2022-04-28 11:23:49,053 INFO L290 TraceCheckUtils]: 67: Hoare triple {14808#(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; {14812#(and (not (<= (* main_~y~0 4) main_~x~0)) (<= (div main_~q~0 2) 1) (= (mod main_~q~0 2) 0) (= main_~r~0 (+ main_~x~0 (* (- 2) main_~y~0))))} is VALID [2022-04-28 11:23:49,053 INFO L290 TraceCheckUtils]: 68: Hoare triple {14812#(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; {14812#(and (not (<= (* main_~y~0 4) main_~x~0)) (<= (div main_~q~0 2) 1) (= (mod main_~q~0 2) 0) (= main_~r~0 (+ main_~x~0 (* (- 2) main_~y~0))))} is VALID [2022-04-28 11:23:49,053 INFO L290 TraceCheckUtils]: 69: Hoare triple {14812#(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 < 10);havoc #t~post6; {14812#(and (not (<= (* main_~y~0 4) main_~x~0)) (<= (div main_~q~0 2) 1) (= (mod main_~q~0 2) 0) (= main_~r~0 (+ main_~x~0 (* (- 2) main_~y~0))))} is VALID [2022-04-28 11:23:49,054 INFO L272 TraceCheckUtils]: 70: Hoare triple {14812#(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)); {14602#true} is VALID [2022-04-28 11:23:49,054 INFO L290 TraceCheckUtils]: 71: Hoare triple {14602#true} ~cond := #in~cond; {14602#true} is VALID [2022-04-28 11:23:49,054 INFO L290 TraceCheckUtils]: 72: Hoare triple {14602#true} assume !(0 == ~cond); {14602#true} is VALID [2022-04-28 11:23:49,054 INFO L290 TraceCheckUtils]: 73: Hoare triple {14602#true} assume true; {14602#true} is VALID [2022-04-28 11:23:49,054 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {14602#true} {14812#(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; {14812#(and (not (<= (* main_~y~0 4) main_~x~0)) (<= (div main_~q~0 2) 1) (= (mod main_~q~0 2) 0) (= main_~r~0 (+ main_~x~0 (* (- 2) main_~y~0))))} is VALID [2022-04-28 11:23:49,054 INFO L272 TraceCheckUtils]: 75: Hoare triple {14812#(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)); {14602#true} is VALID [2022-04-28 11:23:49,055 INFO L290 TraceCheckUtils]: 76: Hoare triple {14602#true} ~cond := #in~cond; {14602#true} is VALID [2022-04-28 11:23:49,055 INFO L290 TraceCheckUtils]: 77: Hoare triple {14602#true} assume !(0 == ~cond); {14602#true} is VALID [2022-04-28 11:23:49,055 INFO L290 TraceCheckUtils]: 78: Hoare triple {14602#true} assume true; {14602#true} is VALID [2022-04-28 11:23:49,055 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {14602#true} {14812#(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; {14812#(and (not (<= (* main_~y~0 4) main_~x~0)) (<= (div main_~q~0 2) 1) (= (mod main_~q~0 2) 0) (= main_~r~0 (+ main_~x~0 (* (- 2) main_~y~0))))} is VALID [2022-04-28 11:23:49,056 INFO L290 TraceCheckUtils]: 80: Hoare triple {14812#(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; {14852#(and (= main_~a~0 1) (not (<= (* main_~y~0 4) main_~x~0)) (<= main_~y~0 main_~r~0) (= main_~b~0 main_~y~0) (<= (div main_~q~0 2) 1) (= (mod main_~q~0 2) 0) (= main_~r~0 (+ main_~x~0 (* (- 2) main_~y~0))))} is VALID [2022-04-28 11:23:49,056 INFO L290 TraceCheckUtils]: 81: Hoare triple {14852#(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; {14852#(and (= main_~a~0 1) (not (<= (* main_~y~0 4) main_~x~0)) (<= main_~y~0 main_~r~0) (= main_~b~0 main_~y~0) (<= (div main_~q~0 2) 1) (= (mod main_~q~0 2) 0) (= main_~r~0 (+ main_~x~0 (* (- 2) main_~y~0))))} is VALID [2022-04-28 11:23:49,057 INFO L290 TraceCheckUtils]: 82: Hoare triple {14852#(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 < 10);havoc #t~post7; {14852#(and (= main_~a~0 1) (not (<= (* main_~y~0 4) main_~x~0)) (<= main_~y~0 main_~r~0) (= main_~b~0 main_~y~0) (<= (div main_~q~0 2) 1) (= (mod main_~q~0 2) 0) (= main_~r~0 (+ main_~x~0 (* (- 2) main_~y~0))))} is VALID [2022-04-28 11:23:49,057 INFO L272 TraceCheckUtils]: 83: Hoare triple {14852#(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)); {14602#true} is VALID [2022-04-28 11:23:49,057 INFO L290 TraceCheckUtils]: 84: Hoare triple {14602#true} ~cond := #in~cond; {14602#true} is VALID [2022-04-28 11:23:49,057 INFO L290 TraceCheckUtils]: 85: Hoare triple {14602#true} assume !(0 == ~cond); {14602#true} is VALID [2022-04-28 11:23:49,057 INFO L290 TraceCheckUtils]: 86: Hoare triple {14602#true} assume true; {14602#true} is VALID [2022-04-28 11:23:49,057 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {14602#true} {14852#(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; {14852#(and (= main_~a~0 1) (not (<= (* main_~y~0 4) main_~x~0)) (<= main_~y~0 main_~r~0) (= main_~b~0 main_~y~0) (<= (div main_~q~0 2) 1) (= (mod main_~q~0 2) 0) (= main_~r~0 (+ main_~x~0 (* (- 2) main_~y~0))))} is VALID [2022-04-28 11:23:49,057 INFO L272 TraceCheckUtils]: 88: Hoare triple {14852#(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)); {14602#true} is VALID [2022-04-28 11:23:49,058 INFO L290 TraceCheckUtils]: 89: Hoare triple {14602#true} ~cond := #in~cond; {14880#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:23:49,058 INFO L290 TraceCheckUtils]: 90: Hoare triple {14880#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {14884#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:23:49,058 INFO L290 TraceCheckUtils]: 91: Hoare triple {14884#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {14884#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:23:49,059 INFO L284 TraceCheckUtils]: 92: Hoare quadruple {14884#(not (= |__VERIFIER_assert_#in~cond| 0))} {14852#(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; {14891#(and (= main_~a~0 1) (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (<= main_~y~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~x~0 (+ main_~r~0 (* main_~y~0 2))) (< main_~x~0 (* main_~y~0 4)))} is VALID [2022-04-28 11:23:49,059 INFO L272 TraceCheckUtils]: 93: Hoare triple {14891#(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)); {14602#true} is VALID [2022-04-28 11:23:49,059 INFO L290 TraceCheckUtils]: 94: Hoare triple {14602#true} ~cond := #in~cond; {14602#true} is VALID [2022-04-28 11:23:49,059 INFO L290 TraceCheckUtils]: 95: Hoare triple {14602#true} assume !(0 == ~cond); {14602#true} is VALID [2022-04-28 11:23:49,059 INFO L290 TraceCheckUtils]: 96: Hoare triple {14602#true} assume true; {14602#true} is VALID [2022-04-28 11:23:49,060 INFO L284 TraceCheckUtils]: 97: Hoare quadruple {14602#true} {14891#(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; {14891#(and (= main_~a~0 1) (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (<= main_~y~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~x~0 (+ main_~r~0 (* main_~y~0 2))) (< main_~x~0 (* main_~y~0 4)))} is VALID [2022-04-28 11:23:49,060 INFO L290 TraceCheckUtils]: 98: Hoare triple {14891#(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); {14891#(and (= main_~a~0 1) (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (<= main_~y~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~x~0 (+ main_~r~0 (* main_~y~0 2))) (< main_~x~0 (* main_~y~0 4)))} is VALID [2022-04-28 11:23:49,062 INFO L290 TraceCheckUtils]: 99: Hoare triple {14891#(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; {14913#(and (<= 0 main_~r~0) (= (+ (* main_~y~0 (+ (- 1) main_~q~0)) main_~y~0 main_~r~0) main_~x~0) (< main_~x~0 (* main_~y~0 4)) (= (+ main_~r~0 (* main_~y~0 3)) main_~x~0))} is VALID [2022-04-28 11:23:49,062 INFO L290 TraceCheckUtils]: 100: Hoare triple {14913#(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; {14913#(and (<= 0 main_~r~0) (= (+ (* main_~y~0 (+ (- 1) main_~q~0)) main_~y~0 main_~r~0) main_~x~0) (< main_~x~0 (* main_~y~0 4)) (= (+ main_~r~0 (* main_~y~0 3)) main_~x~0))} is VALID [2022-04-28 11:23:49,063 INFO L290 TraceCheckUtils]: 101: Hoare triple {14913#(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 < 10);havoc #t~post6; {14913#(and (<= 0 main_~r~0) (= (+ (* main_~y~0 (+ (- 1) main_~q~0)) main_~y~0 main_~r~0) main_~x~0) (< main_~x~0 (* main_~y~0 4)) (= (+ main_~r~0 (* main_~y~0 3)) main_~x~0))} is VALID [2022-04-28 11:23:49,063 INFO L272 TraceCheckUtils]: 102: Hoare triple {14913#(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)); {14923#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:23:49,064 INFO L290 TraceCheckUtils]: 103: Hoare triple {14923#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {14927#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:23:49,064 INFO L290 TraceCheckUtils]: 104: Hoare triple {14927#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {14603#false} is VALID [2022-04-28 11:23:49,064 INFO L290 TraceCheckUtils]: 105: Hoare triple {14603#false} assume !false; {14603#false} is VALID [2022-04-28 11:23:49,065 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 63 proven. 32 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2022-04-28 11:23:49,065 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:23:57,068 INFO L290 TraceCheckUtils]: 105: Hoare triple {14603#false} assume !false; {14603#false} is VALID [2022-04-28 11:23:57,068 INFO L290 TraceCheckUtils]: 104: Hoare triple {14927#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {14603#false} is VALID [2022-04-28 11:23:57,069 INFO L290 TraceCheckUtils]: 103: Hoare triple {14923#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {14927#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:23:57,069 INFO L272 TraceCheckUtils]: 102: Hoare triple {14943#(= (+ (* 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)); {14923#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:23:57,069 INFO L290 TraceCheckUtils]: 101: Hoare triple {14943#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} assume !(#t~post6 < 10);havoc #t~post6; {14943#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:23:57,070 INFO L290 TraceCheckUtils]: 100: Hoare triple {14943#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {14943#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:23:57,076 INFO L290 TraceCheckUtils]: 99: Hoare triple {14953#(= 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; {14943#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:23:57,077 INFO L290 TraceCheckUtils]: 98: Hoare triple {14953#(= 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); {14953#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} is VALID [2022-04-28 11:23:57,077 INFO L284 TraceCheckUtils]: 97: Hoare quadruple {14602#true} {14953#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} #87#return; {14953#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} is VALID [2022-04-28 11:23:57,078 INFO L290 TraceCheckUtils]: 96: Hoare triple {14602#true} assume true; {14602#true} is VALID [2022-04-28 11:23:57,078 INFO L290 TraceCheckUtils]: 95: Hoare triple {14602#true} assume !(0 == ~cond); {14602#true} is VALID [2022-04-28 11:23:57,078 INFO L290 TraceCheckUtils]: 94: Hoare triple {14602#true} ~cond := #in~cond; {14602#true} is VALID [2022-04-28 11:23:57,078 INFO L272 TraceCheckUtils]: 93: Hoare triple {14953#(= 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)); {14602#true} is VALID [2022-04-28 11:23:57,080 INFO L284 TraceCheckUtils]: 92: Hoare quadruple {14884#(not (= |__VERIFIER_assert_#in~cond| 0))} {14975#(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; {14953#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} is VALID [2022-04-28 11:23:57,080 INFO L290 TraceCheckUtils]: 91: Hoare triple {14884#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {14884#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:23:57,081 INFO L290 TraceCheckUtils]: 90: Hoare triple {14985#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {14884#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:23:57,081 INFO L290 TraceCheckUtils]: 89: Hoare triple {14602#true} ~cond := #in~cond; {14985#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 11:23:57,081 INFO L272 TraceCheckUtils]: 88: Hoare triple {14975#(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)); {14602#true} is VALID [2022-04-28 11:23:57,082 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {14602#true} {14975#(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; {14975#(or (= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0)))) (not (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)))} is VALID [2022-04-28 11:23:57,082 INFO L290 TraceCheckUtils]: 86: Hoare triple {14602#true} assume true; {14602#true} is VALID [2022-04-28 11:23:57,082 INFO L290 TraceCheckUtils]: 85: Hoare triple {14602#true} assume !(0 == ~cond); {14602#true} is VALID [2022-04-28 11:23:57,082 INFO L290 TraceCheckUtils]: 84: Hoare triple {14602#true} ~cond := #in~cond; {14602#true} is VALID [2022-04-28 11:23:57,082 INFO L272 TraceCheckUtils]: 83: Hoare triple {14975#(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)); {14602#true} is VALID [2022-04-28 11:23:57,082 INFO L290 TraceCheckUtils]: 82: Hoare triple {14975#(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 < 10);havoc #t~post7; {14975#(or (= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0)))) (not (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)))} is VALID [2022-04-28 11:23:57,083 INFO L290 TraceCheckUtils]: 81: Hoare triple {14975#(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; {14975#(or (= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0)))) (not (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)))} is VALID [2022-04-28 11:23:57,083 INFO L290 TraceCheckUtils]: 80: Hoare triple {14602#true} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {14975#(or (= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0)))) (not (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)))} is VALID [2022-04-28 11:23:57,083 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {14602#true} {14602#true} #81#return; {14602#true} is VALID [2022-04-28 11:23:57,083 INFO L290 TraceCheckUtils]: 78: Hoare triple {14602#true} assume true; {14602#true} is VALID [2022-04-28 11:23:57,083 INFO L290 TraceCheckUtils]: 77: Hoare triple {14602#true} assume !(0 == ~cond); {14602#true} is VALID [2022-04-28 11:23:57,083 INFO L290 TraceCheckUtils]: 76: Hoare triple {14602#true} ~cond := #in~cond; {14602#true} is VALID [2022-04-28 11:23:57,083 INFO L272 TraceCheckUtils]: 75: Hoare triple {14602#true} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {14602#true} is VALID [2022-04-28 11:23:57,083 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {14602#true} {14602#true} #79#return; {14602#true} is VALID [2022-04-28 11:23:57,083 INFO L290 TraceCheckUtils]: 73: Hoare triple {14602#true} assume true; {14602#true} is VALID [2022-04-28 11:23:57,084 INFO L290 TraceCheckUtils]: 72: Hoare triple {14602#true} assume !(0 == ~cond); {14602#true} is VALID [2022-04-28 11:23:57,084 INFO L290 TraceCheckUtils]: 71: Hoare triple {14602#true} ~cond := #in~cond; {14602#true} is VALID [2022-04-28 11:23:57,084 INFO L272 TraceCheckUtils]: 70: Hoare triple {14602#true} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {14602#true} is VALID [2022-04-28 11:23:57,084 INFO L290 TraceCheckUtils]: 69: Hoare triple {14602#true} assume !!(#t~post6 < 10);havoc #t~post6; {14602#true} is VALID [2022-04-28 11:23:57,084 INFO L290 TraceCheckUtils]: 68: Hoare triple {14602#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {14602#true} is VALID [2022-04-28 11:23:57,084 INFO L290 TraceCheckUtils]: 67: Hoare triple {14602#true} ~r~0 := ~r~0 - ~b~0;~q~0 := ~q~0 + ~a~0; {14602#true} is VALID [2022-04-28 11:23:57,084 INFO L290 TraceCheckUtils]: 66: Hoare triple {14602#true} assume !(~r~0 >= 2 * ~b~0); {14602#true} is VALID [2022-04-28 11:23:57,084 INFO L284 TraceCheckUtils]: 65: Hoare quadruple {14602#true} {14602#true} #87#return; {14602#true} is VALID [2022-04-28 11:23:57,084 INFO L290 TraceCheckUtils]: 64: Hoare triple {14602#true} assume true; {14602#true} is VALID [2022-04-28 11:23:57,084 INFO L290 TraceCheckUtils]: 63: Hoare triple {14602#true} assume !(0 == ~cond); {14602#true} is VALID [2022-04-28 11:23:57,084 INFO L290 TraceCheckUtils]: 62: Hoare triple {14602#true} ~cond := #in~cond; {14602#true} is VALID [2022-04-28 11:23:57,084 INFO L272 TraceCheckUtils]: 61: Hoare triple {14602#true} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {14602#true} is VALID [2022-04-28 11:23:57,084 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {14602#true} {14602#true} #85#return; {14602#true} is VALID [2022-04-28 11:23:57,084 INFO L290 TraceCheckUtils]: 59: Hoare triple {14602#true} assume true; {14602#true} is VALID [2022-04-28 11:23:57,084 INFO L290 TraceCheckUtils]: 58: Hoare triple {14602#true} assume !(0 == ~cond); {14602#true} is VALID [2022-04-28 11:23:57,085 INFO L290 TraceCheckUtils]: 57: Hoare triple {14602#true} ~cond := #in~cond; {14602#true} is VALID [2022-04-28 11:23:57,085 INFO L272 TraceCheckUtils]: 56: Hoare triple {14602#true} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {14602#true} is VALID [2022-04-28 11:23:57,085 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {14602#true} {14602#true} #83#return; {14602#true} is VALID [2022-04-28 11:23:57,085 INFO L290 TraceCheckUtils]: 54: Hoare triple {14602#true} assume true; {14602#true} is VALID [2022-04-28 11:23:57,085 INFO L290 TraceCheckUtils]: 53: Hoare triple {14602#true} assume !(0 == ~cond); {14602#true} is VALID [2022-04-28 11:23:57,085 INFO L290 TraceCheckUtils]: 52: Hoare triple {14602#true} ~cond := #in~cond; {14602#true} is VALID [2022-04-28 11:23:57,085 INFO L272 TraceCheckUtils]: 51: Hoare triple {14602#true} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {14602#true} is VALID [2022-04-28 11:23:57,085 INFO L290 TraceCheckUtils]: 50: Hoare triple {14602#true} assume !!(#t~post7 < 10);havoc #t~post7; {14602#true} is VALID [2022-04-28 11:23:57,085 INFO L290 TraceCheckUtils]: 49: Hoare triple {14602#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {14602#true} is VALID [2022-04-28 11:23:57,085 INFO L290 TraceCheckUtils]: 48: Hoare triple {14602#true} ~a~0 := 2 * ~a~0;~b~0 := 2 * ~b~0; {14602#true} is VALID [2022-04-28 11:23:57,085 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {14602#true} {14602#true} #89#return; {14602#true} is VALID [2022-04-28 11:23:57,085 INFO L290 TraceCheckUtils]: 46: Hoare triple {14602#true} assume true; {14602#true} is VALID [2022-04-28 11:23:57,085 INFO L290 TraceCheckUtils]: 45: Hoare triple {14602#true} assume !(0 == ~cond); {14602#true} is VALID [2022-04-28 11:23:57,085 INFO L290 TraceCheckUtils]: 44: Hoare triple {14602#true} ~cond := #in~cond; {14602#true} is VALID [2022-04-28 11:23:57,086 INFO L272 TraceCheckUtils]: 43: Hoare triple {14602#true} call __VERIFIER_assert((if ~r~0 >= 2 * ~y~0 * ~a~0 then 1 else 0)); {14602#true} is VALID [2022-04-28 11:23:57,086 INFO L290 TraceCheckUtils]: 42: Hoare triple {14602#true} assume !!(~r~0 >= 2 * ~b~0); {14602#true} is VALID [2022-04-28 11:23:57,086 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {14602#true} {14602#true} #87#return; {14602#true} is VALID [2022-04-28 11:23:57,086 INFO L290 TraceCheckUtils]: 40: Hoare triple {14602#true} assume true; {14602#true} is VALID [2022-04-28 11:23:57,086 INFO L290 TraceCheckUtils]: 39: Hoare triple {14602#true} assume !(0 == ~cond); {14602#true} is VALID [2022-04-28 11:23:57,086 INFO L290 TraceCheckUtils]: 38: Hoare triple {14602#true} ~cond := #in~cond; {14602#true} is VALID [2022-04-28 11:23:57,086 INFO L272 TraceCheckUtils]: 37: Hoare triple {14602#true} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {14602#true} is VALID [2022-04-28 11:23:57,086 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {14602#true} {14602#true} #85#return; {14602#true} is VALID [2022-04-28 11:23:57,086 INFO L290 TraceCheckUtils]: 35: Hoare triple {14602#true} assume true; {14602#true} is VALID [2022-04-28 11:23:57,086 INFO L290 TraceCheckUtils]: 34: Hoare triple {14602#true} assume !(0 == ~cond); {14602#true} is VALID [2022-04-28 11:23:57,086 INFO L290 TraceCheckUtils]: 33: Hoare triple {14602#true} ~cond := #in~cond; {14602#true} is VALID [2022-04-28 11:23:57,086 INFO L272 TraceCheckUtils]: 32: Hoare triple {14602#true} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {14602#true} is VALID [2022-04-28 11:23:57,086 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {14602#true} {14602#true} #83#return; {14602#true} is VALID [2022-04-28 11:23:57,087 INFO L290 TraceCheckUtils]: 30: Hoare triple {14602#true} assume true; {14602#true} is VALID [2022-04-28 11:23:57,087 INFO L290 TraceCheckUtils]: 29: Hoare triple {14602#true} assume !(0 == ~cond); {14602#true} is VALID [2022-04-28 11:23:57,087 INFO L290 TraceCheckUtils]: 28: Hoare triple {14602#true} ~cond := #in~cond; {14602#true} is VALID [2022-04-28 11:23:57,087 INFO L272 TraceCheckUtils]: 27: Hoare triple {14602#true} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {14602#true} is VALID [2022-04-28 11:23:57,087 INFO L290 TraceCheckUtils]: 26: Hoare triple {14602#true} assume !!(#t~post7 < 10);havoc #t~post7; {14602#true} is VALID [2022-04-28 11:23:57,087 INFO L290 TraceCheckUtils]: 25: Hoare triple {14602#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {14602#true} is VALID [2022-04-28 11:23:57,087 INFO L290 TraceCheckUtils]: 24: Hoare triple {14602#true} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {14602#true} is VALID [2022-04-28 11:23:57,087 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {14602#true} {14602#true} #81#return; {14602#true} is VALID [2022-04-28 11:23:57,087 INFO L290 TraceCheckUtils]: 22: Hoare triple {14602#true} assume true; {14602#true} is VALID [2022-04-28 11:23:57,087 INFO L290 TraceCheckUtils]: 21: Hoare triple {14602#true} assume !(0 == ~cond); {14602#true} is VALID [2022-04-28 11:23:57,087 INFO L290 TraceCheckUtils]: 20: Hoare triple {14602#true} ~cond := #in~cond; {14602#true} is VALID [2022-04-28 11:23:57,087 INFO L272 TraceCheckUtils]: 19: Hoare triple {14602#true} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {14602#true} is VALID [2022-04-28 11:23:57,087 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {14602#true} {14602#true} #79#return; {14602#true} is VALID [2022-04-28 11:23:57,087 INFO L290 TraceCheckUtils]: 17: Hoare triple {14602#true} assume true; {14602#true} is VALID [2022-04-28 11:23:57,088 INFO L290 TraceCheckUtils]: 16: Hoare triple {14602#true} assume !(0 == ~cond); {14602#true} is VALID [2022-04-28 11:23:57,088 INFO L290 TraceCheckUtils]: 15: Hoare triple {14602#true} ~cond := #in~cond; {14602#true} is VALID [2022-04-28 11:23:57,088 INFO L272 TraceCheckUtils]: 14: Hoare triple {14602#true} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {14602#true} is VALID [2022-04-28 11:23:57,088 INFO L290 TraceCheckUtils]: 13: Hoare triple {14602#true} assume !!(#t~post6 < 10);havoc #t~post6; {14602#true} is VALID [2022-04-28 11:23:57,088 INFO L290 TraceCheckUtils]: 12: Hoare triple {14602#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {14602#true} is VALID [2022-04-28 11:23:57,088 INFO L290 TraceCheckUtils]: 11: Hoare triple {14602#true} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {14602#true} is VALID [2022-04-28 11:23:57,088 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {14602#true} {14602#true} #77#return; {14602#true} is VALID [2022-04-28 11:23:57,088 INFO L290 TraceCheckUtils]: 9: Hoare triple {14602#true} assume true; {14602#true} is VALID [2022-04-28 11:23:57,088 INFO L290 TraceCheckUtils]: 8: Hoare triple {14602#true} assume !(0 == ~cond); {14602#true} is VALID [2022-04-28 11:23:57,088 INFO L290 TraceCheckUtils]: 7: Hoare triple {14602#true} ~cond := #in~cond; {14602#true} is VALID [2022-04-28 11:23:57,088 INFO L272 TraceCheckUtils]: 6: Hoare triple {14602#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {14602#true} is VALID [2022-04-28 11:23:57,088 INFO L290 TraceCheckUtils]: 5: Hoare triple {14602#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; {14602#true} is VALID [2022-04-28 11:23:57,088 INFO L272 TraceCheckUtils]: 4: Hoare triple {14602#true} call #t~ret8 := main(); {14602#true} is VALID [2022-04-28 11:23:57,088 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14602#true} {14602#true} #93#return; {14602#true} is VALID [2022-04-28 11:23:57,088 INFO L290 TraceCheckUtils]: 2: Hoare triple {14602#true} assume true; {14602#true} is VALID [2022-04-28 11:23:57,089 INFO L290 TraceCheckUtils]: 1: Hoare triple {14602#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; {14602#true} is VALID [2022-04-28 11:23:57,089 INFO L272 TraceCheckUtils]: 0: Hoare triple {14602#true} call ULTIMATE.init(); {14602#true} is VALID [2022-04-28 11:23:57,089 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 80 proven. 4 refuted. 0 times theorem prover too weak. 336 trivial. 0 not checked. [2022-04-28 11:23:57,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:23:57,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362817018] [2022-04-28 11:23:57,089 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:23:57,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [403758092] [2022-04-28 11:23:57,089 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [403758092] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 11:23:57,089 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 11:23:57,090 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9] total 18 [2022-04-28 11:23:57,090 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:23:57,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1736934422] [2022-04-28 11:23:57,090 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1736934422] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:23:57,090 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:23:57,090 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-28 11:23:57,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901071996] [2022-04-28 11:23:57,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:23:57,091 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 13 states have internal predecessors, (36), 8 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 7 states have call predecessors, (16), 7 states have call successors, (16) Word has length 106 [2022-04-28 11:23:57,091 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:23:57,092 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 13 states have internal predecessors, (36), 8 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 7 states have call predecessors, (16), 7 states have call successors, (16) [2022-04-28 11:23:57,149 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:23:57,149 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-28 11:23:57,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:23:57,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-28 11:23:57,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2022-04-28 11:23:57,150 INFO L87 Difference]: Start difference. First operand 196 states and 232 transitions. Second operand has 14 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 13 states have internal predecessors, (36), 8 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 7 states have call predecessors, (16), 7 states have call successors, (16) [2022-04-28 11:23:59,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:23:59,857 INFO L93 Difference]: Finished difference Result 281 states and 343 transitions. [2022-04-28 11:23:59,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-28 11:23:59,857 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 13 states have internal predecessors, (36), 8 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 7 states have call predecessors, (16), 7 states have call successors, (16) Word has length 106 [2022-04-28 11:23:59,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:23:59,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 13 states have internal predecessors, (36), 8 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 7 states have call predecessors, (16), 7 states have call successors, (16) [2022-04-28 11:23:59,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 151 transitions. [2022-04-28 11:23:59,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 13 states have internal predecessors, (36), 8 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 7 states have call predecessors, (16), 7 states have call successors, (16) [2022-04-28 11:23:59,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 151 transitions. [2022-04-28 11:23:59,861 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 151 transitions. [2022-04-28 11:23:59,994 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 151 edges. 151 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:23:59,997 INFO L225 Difference]: With dead ends: 281 [2022-04-28 11:23:59,997 INFO L226 Difference]: Without dead ends: 185 [2022-04-28 11:23:59,998 INFO L412 NwaCegarLoop]: 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-28 11:23:59,998 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 31 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 491 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-04-28 11:23:59,998 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 267 Invalid, 520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 491 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-28 11:23:59,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2022-04-28 11:24:00,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 184. [2022-04-28 11:24:00,230 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:24:00,233 INFO L82 GeneralOperation]: Start isEquivalent. First operand 185 states. Second operand has 184 states, 118 states have (on average 1.1355932203389831) internal successors, (134), 120 states have internal predecessors, (134), 43 states have call successors, (43), 23 states have call predecessors, (43), 22 states have return successors, (41), 40 states have call predecessors, (41), 41 states have call successors, (41) [2022-04-28 11:24:00,233 INFO L74 IsIncluded]: Start isIncluded. First operand 185 states. Second operand has 184 states, 118 states have (on average 1.1355932203389831) internal successors, (134), 120 states have internal predecessors, (134), 43 states have call successors, (43), 23 states have call predecessors, (43), 22 states have return successors, (41), 40 states have call predecessors, (41), 41 states have call successors, (41) [2022-04-28 11:24:00,233 INFO L87 Difference]: Start difference. First operand 185 states. Second operand has 184 states, 118 states have (on average 1.1355932203389831) internal successors, (134), 120 states have internal predecessors, (134), 43 states have call successors, (43), 23 states have call predecessors, (43), 22 states have return successors, (41), 40 states have call predecessors, (41), 41 states have call successors, (41) [2022-04-28 11:24:00,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:24:00,236 INFO L93 Difference]: Finished difference Result 185 states and 219 transitions. [2022-04-28 11:24:00,236 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 219 transitions. [2022-04-28 11:24:00,236 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:24:00,236 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:24:00,237 INFO L74 IsIncluded]: Start isIncluded. First operand has 184 states, 118 states have (on average 1.1355932203389831) internal successors, (134), 120 states have internal predecessors, (134), 43 states have call successors, (43), 23 states have call predecessors, (43), 22 states have return successors, (41), 40 states have call predecessors, (41), 41 states have call successors, (41) Second operand 185 states. [2022-04-28 11:24:00,237 INFO L87 Difference]: Start difference. First operand has 184 states, 118 states have (on average 1.1355932203389831) internal successors, (134), 120 states have internal predecessors, (134), 43 states have call successors, (43), 23 states have call predecessors, (43), 22 states have return successors, (41), 40 states have call predecessors, (41), 41 states have call successors, (41) Second operand 185 states. [2022-04-28 11:24:00,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:24:00,240 INFO L93 Difference]: Finished difference Result 185 states and 219 transitions. [2022-04-28 11:24:00,240 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 219 transitions. [2022-04-28 11:24:00,240 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:24:00,240 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:24:00,240 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:24:00,240 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:24:00,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 118 states have (on average 1.1355932203389831) internal successors, (134), 120 states have internal predecessors, (134), 43 states have call successors, (43), 23 states have call predecessors, (43), 22 states have return successors, (41), 40 states have call predecessors, (41), 41 states have call successors, (41) [2022-04-28 11:24:00,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 218 transitions. [2022-04-28 11:24:00,243 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 218 transitions. Word has length 106 [2022-04-28 11:24:00,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:24:00,244 INFO L495 AbstractCegarLoop]: Abstraction has 184 states and 218 transitions. [2022-04-28 11:24:00,244 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 13 states have internal predecessors, (36), 8 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 7 states have call predecessors, (16), 7 states have call successors, (16) [2022-04-28 11:24:00,244 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 184 states and 218 transitions. [2022-04-28 11:24:00,466 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 218 edges. 218 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:24:00,466 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 218 transitions. [2022-04-28 11:24:00,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-04-28 11:24:00,467 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:24:00,467 INFO L195 NwaCegarLoop]: trace histogram [16, 15, 15, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:24:00,485 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-04-28 11:24:00,667 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-04-28 11:24:00,668 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:24:00,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:24:00,668 INFO L85 PathProgramCache]: Analyzing trace with hash 2077207105, now seen corresponding path program 3 times [2022-04-28 11:24:00,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:24:00,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1931207064] [2022-04-28 11:24:31,590 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:24:31,590 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:24:31,590 INFO L85 PathProgramCache]: Analyzing trace with hash 2077207105, now seen corresponding path program 4 times [2022-04-28 11:24:31,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:24:31,591 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647700036] [2022-04-28 11:24:31,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:24:31,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:24:31,601 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:24:31,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1524849595] [2022-04-28 11:24:31,601 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 11:24:31,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:24:31,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:24:31,602 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 11:24:31,603 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-04-28 11:24:31,663 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 11:24:31,663 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:24:31,664 INFO L263 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 37 conjunts are in the unsatisfiable core [2022-04-28 11:24:31,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:24:31,694 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:26:01,460 INFO L272 TraceCheckUtils]: 0: Hoare triple {16559#true} call ULTIMATE.init(); {16559#true} is VALID [2022-04-28 11:26:01,460 INFO L290 TraceCheckUtils]: 1: Hoare triple {16559#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; {16559#true} is VALID [2022-04-28 11:26:01,460 INFO L290 TraceCheckUtils]: 2: Hoare triple {16559#true} assume true; {16559#true} is VALID [2022-04-28 11:26:01,460 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16559#true} {16559#true} #93#return; {16559#true} is VALID [2022-04-28 11:26:01,460 INFO L272 TraceCheckUtils]: 4: Hoare triple {16559#true} call #t~ret8 := main(); {16559#true} is VALID [2022-04-28 11:26:01,460 INFO L290 TraceCheckUtils]: 5: Hoare triple {16559#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; {16559#true} is VALID [2022-04-28 11:26:01,460 INFO L272 TraceCheckUtils]: 6: Hoare triple {16559#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {16559#true} is VALID [2022-04-28 11:26:01,460 INFO L290 TraceCheckUtils]: 7: Hoare triple {16559#true} ~cond := #in~cond; {16559#true} is VALID [2022-04-28 11:26:01,460 INFO L290 TraceCheckUtils]: 8: Hoare triple {16559#true} assume !(0 == ~cond); {16559#true} is VALID [2022-04-28 11:26:01,461 INFO L290 TraceCheckUtils]: 9: Hoare triple {16559#true} assume true; {16559#true} is VALID [2022-04-28 11:26:01,461 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {16559#true} {16559#true} #77#return; {16559#true} is VALID [2022-04-28 11:26:01,461 INFO L290 TraceCheckUtils]: 11: Hoare triple {16559#true} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {16597#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:26:01,461 INFO L290 TraceCheckUtils]: 12: Hoare triple {16597#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {16597#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:26:01,462 INFO L290 TraceCheckUtils]: 13: Hoare triple {16597#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} assume !!(#t~post6 < 10);havoc #t~post6; {16597#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:26:01,462 INFO L272 TraceCheckUtils]: 14: Hoare triple {16597#(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)); {16559#true} is VALID [2022-04-28 11:26:01,462 INFO L290 TraceCheckUtils]: 15: Hoare triple {16559#true} ~cond := #in~cond; {16559#true} is VALID [2022-04-28 11:26:01,462 INFO L290 TraceCheckUtils]: 16: Hoare triple {16559#true} assume !(0 == ~cond); {16559#true} is VALID [2022-04-28 11:26:01,462 INFO L290 TraceCheckUtils]: 17: Hoare triple {16559#true} assume true; {16559#true} is VALID [2022-04-28 11:26:01,462 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {16559#true} {16597#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #79#return; {16597#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:26:01,462 INFO L272 TraceCheckUtils]: 19: Hoare triple {16597#(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)); {16559#true} is VALID [2022-04-28 11:26:01,462 INFO L290 TraceCheckUtils]: 20: Hoare triple {16559#true} ~cond := #in~cond; {16559#true} is VALID [2022-04-28 11:26:01,463 INFO L290 TraceCheckUtils]: 21: Hoare triple {16559#true} assume !(0 == ~cond); {16559#true} is VALID [2022-04-28 11:26:01,463 INFO L290 TraceCheckUtils]: 22: Hoare triple {16559#true} assume true; {16559#true} is VALID [2022-04-28 11:26:01,463 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {16559#true} {16597#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #81#return; {16597#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:26:01,463 INFO L290 TraceCheckUtils]: 24: Hoare triple {16597#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {16637#(and (<= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-28 11:26:01,464 INFO L290 TraceCheckUtils]: 25: Hoare triple {16637#(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; {16637#(and (<= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-28 11:26:01,464 INFO L290 TraceCheckUtils]: 26: Hoare triple {16637#(and (<= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} assume !!(#t~post7 < 10);havoc #t~post7; {16637#(and (<= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-28 11:26:01,464 INFO L272 TraceCheckUtils]: 27: Hoare triple {16637#(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)); {16559#true} is VALID [2022-04-28 11:26:01,464 INFO L290 TraceCheckUtils]: 28: Hoare triple {16559#true} ~cond := #in~cond; {16559#true} is VALID [2022-04-28 11:26:01,464 INFO L290 TraceCheckUtils]: 29: Hoare triple {16559#true} assume !(0 == ~cond); {16559#true} is VALID [2022-04-28 11:26:01,464 INFO L290 TraceCheckUtils]: 30: Hoare triple {16559#true} assume true; {16559#true} is VALID [2022-04-28 11:26:01,465 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {16559#true} {16637#(and (<= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #83#return; {16637#(and (<= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-28 11:26:01,465 INFO L272 TraceCheckUtils]: 32: Hoare triple {16637#(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)); {16559#true} is VALID [2022-04-28 11:26:01,465 INFO L290 TraceCheckUtils]: 33: Hoare triple {16559#true} ~cond := #in~cond; {16559#true} is VALID [2022-04-28 11:26:01,465 INFO L290 TraceCheckUtils]: 34: Hoare triple {16559#true} assume !(0 == ~cond); {16559#true} is VALID [2022-04-28 11:26:01,465 INFO L290 TraceCheckUtils]: 35: Hoare triple {16559#true} assume true; {16559#true} is VALID [2022-04-28 11:26:01,466 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {16559#true} {16637#(and (<= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #85#return; {16637#(and (<= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-28 11:26:01,466 INFO L272 TraceCheckUtils]: 37: Hoare triple {16637#(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)); {16559#true} is VALID [2022-04-28 11:26:01,466 INFO L290 TraceCheckUtils]: 38: Hoare triple {16559#true} ~cond := #in~cond; {16559#true} is VALID [2022-04-28 11:26:01,466 INFO L290 TraceCheckUtils]: 39: Hoare triple {16559#true} assume !(0 == ~cond); {16559#true} is VALID [2022-04-28 11:26:01,466 INFO L290 TraceCheckUtils]: 40: Hoare triple {16559#true} assume true; {16559#true} is VALID [2022-04-28 11:26:01,466 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {16559#true} {16637#(and (<= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #87#return; {16637#(and (<= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-28 11:26:01,467 INFO L290 TraceCheckUtils]: 42: Hoare triple {16637#(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); {16637#(and (<= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-28 11:26:01,467 INFO L272 TraceCheckUtils]: 43: Hoare triple {16637#(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)); {16559#true} is VALID [2022-04-28 11:26:01,467 INFO L290 TraceCheckUtils]: 44: Hoare triple {16559#true} ~cond := #in~cond; {16559#true} is VALID [2022-04-28 11:26:01,467 INFO L290 TraceCheckUtils]: 45: Hoare triple {16559#true} assume !(0 == ~cond); {16559#true} is VALID [2022-04-28 11:26:01,467 INFO L290 TraceCheckUtils]: 46: Hoare triple {16559#true} assume true; {16559#true} is VALID [2022-04-28 11:26:01,467 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {16559#true} {16637#(and (<= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #89#return; {16637#(and (<= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-28 11:26:01,468 INFO L290 TraceCheckUtils]: 48: Hoare triple {16637#(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; {16710#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (<= (div (* (- 1) main_~a~0) (- 2)) 1) (= main_~q~0 0))} is VALID [2022-04-28 11:26:01,469 INFO L290 TraceCheckUtils]: 49: Hoare triple {16710#(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; {16710#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (<= (div (* (- 1) main_~a~0) (- 2)) 1) (= main_~q~0 0))} is VALID [2022-04-28 11:26:01,469 INFO L290 TraceCheckUtils]: 50: Hoare triple {16710#(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 < 10);havoc #t~post7; {16710#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (<= (div (* (- 1) main_~a~0) (- 2)) 1) (= main_~q~0 0))} is VALID [2022-04-28 11:26:01,469 INFO L272 TraceCheckUtils]: 51: Hoare triple {16710#(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)); {16559#true} is VALID [2022-04-28 11:26:01,469 INFO L290 TraceCheckUtils]: 52: Hoare triple {16559#true} ~cond := #in~cond; {16723#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:26:01,470 INFO L290 TraceCheckUtils]: 53: Hoare triple {16723#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {16727#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:26:01,470 INFO L290 TraceCheckUtils]: 54: Hoare triple {16727#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {16727#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:26:01,471 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {16727#(not (= |__VERIFIER_assert_#in~cond| 0))} {16710#(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; {16734#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (<= (div (* (- 1) main_~a~0) (- 2)) 1) (= main_~q~0 0) (= main_~b~0 (* main_~a~0 main_~y~0)))} is VALID [2022-04-28 11:26:01,471 INFO L272 TraceCheckUtils]: 56: Hoare triple {16734#(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)); {16559#true} is VALID [2022-04-28 11:26:01,471 INFO L290 TraceCheckUtils]: 57: Hoare triple {16559#true} ~cond := #in~cond; {16559#true} is VALID [2022-04-28 11:26:01,471 INFO L290 TraceCheckUtils]: 58: Hoare triple {16559#true} assume !(0 == ~cond); {16559#true} is VALID [2022-04-28 11:26:01,471 INFO L290 TraceCheckUtils]: 59: Hoare triple {16559#true} assume true; {16559#true} is VALID [2022-04-28 11:26:01,472 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {16559#true} {16734#(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; {16734#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (<= (div (* (- 1) main_~a~0) (- 2)) 1) (= main_~q~0 0) (= main_~b~0 (* main_~a~0 main_~y~0)))} is VALID [2022-04-28 11:26:01,472 INFO L272 TraceCheckUtils]: 61: Hoare triple {16734#(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)); {16559#true} is VALID [2022-04-28 11:26:01,472 INFO L290 TraceCheckUtils]: 62: Hoare triple {16559#true} ~cond := #in~cond; {16559#true} is VALID [2022-04-28 11:26:01,472 INFO L290 TraceCheckUtils]: 63: Hoare triple {16559#true} assume !(0 == ~cond); {16559#true} is VALID [2022-04-28 11:26:01,472 INFO L290 TraceCheckUtils]: 64: Hoare triple {16559#true} assume true; {16559#true} is VALID [2022-04-28 11:26:01,472 INFO L284 TraceCheckUtils]: 65: Hoare quadruple {16559#true} {16734#(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; {16734#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (<= (div (* (- 1) main_~a~0) (- 2)) 1) (= main_~q~0 0) (= main_~b~0 (* main_~a~0 main_~y~0)))} is VALID [2022-04-28 11:26:01,473 INFO L290 TraceCheckUtils]: 66: Hoare triple {16734#(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); {16734#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (<= (div (* (- 1) main_~a~0) (- 2)) 1) (= main_~q~0 0) (= main_~b~0 (* main_~a~0 main_~y~0)))} is VALID [2022-04-28 11:26:01,473 INFO L272 TraceCheckUtils]: 67: Hoare triple {16734#(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)); {16559#true} is VALID [2022-04-28 11:26:01,473 INFO L290 TraceCheckUtils]: 68: Hoare triple {16559#true} ~cond := #in~cond; {16559#true} is VALID [2022-04-28 11:26:01,473 INFO L290 TraceCheckUtils]: 69: Hoare triple {16559#true} assume !(0 == ~cond); {16559#true} is VALID [2022-04-28 11:26:01,473 INFO L290 TraceCheckUtils]: 70: Hoare triple {16559#true} assume true; {16559#true} is VALID [2022-04-28 11:26:01,474 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {16559#true} {16734#(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; {16734#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (<= (div (* (- 1) main_~a~0) (- 2)) 1) (= main_~q~0 0) (= main_~b~0 (* main_~a~0 main_~y~0)))} is VALID [2022-04-28 11:26:01,478 INFO L290 TraceCheckUtils]: 72: Hoare triple {16734#(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; {16786#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (<= (div (* (- 1) (div (* (- 1) main_~a~0) (- 2))) (- 2)) 1) (= (mod (div (- main_~a~0) (- 2)) 2) 0) (= (* (div (- main_~a~0) (- 2)) main_~y~0) (* main_~y~0 2)) (= main_~q~0 0) (= (* (* (div (- main_~a~0) (- 2)) main_~y~0) 2) main_~b~0))} is VALID [2022-04-28 11:26:01,478 INFO L290 TraceCheckUtils]: 73: Hoare triple {16786#(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; {16786#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (<= (div (* (- 1) (div (* (- 1) main_~a~0) (- 2))) (- 2)) 1) (= (mod (div (- main_~a~0) (- 2)) 2) 0) (= (* (div (- main_~a~0) (- 2)) main_~y~0) (* main_~y~0 2)) (= main_~q~0 0) (= (* (* (div (- main_~a~0) (- 2)) main_~y~0) 2) main_~b~0))} is VALID [2022-04-28 11:26:01,479 INFO L290 TraceCheckUtils]: 74: Hoare triple {16786#(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 < 10);havoc #t~post7; {16786#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (<= (div (* (- 1) (div (* (- 1) main_~a~0) (- 2))) (- 2)) 1) (= (mod (div (- main_~a~0) (- 2)) 2) 0) (= (* (div (- main_~a~0) (- 2)) main_~y~0) (* main_~y~0 2)) (= main_~q~0 0) (= (* (* (div (- main_~a~0) (- 2)) main_~y~0) 2) main_~b~0))} is VALID [2022-04-28 11:26:01,479 INFO L272 TraceCheckUtils]: 75: Hoare triple {16786#(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)); {16559#true} is VALID [2022-04-28 11:26:01,479 INFO L290 TraceCheckUtils]: 76: Hoare triple {16559#true} ~cond := #in~cond; {16559#true} is VALID [2022-04-28 11:26:01,479 INFO L290 TraceCheckUtils]: 77: Hoare triple {16559#true} assume !(0 == ~cond); {16559#true} is VALID [2022-04-28 11:26:01,479 INFO L290 TraceCheckUtils]: 78: Hoare triple {16559#true} assume true; {16559#true} is VALID [2022-04-28 11:26:01,480 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {16559#true} {16786#(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; {16786#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (<= (div (* (- 1) (div (* (- 1) main_~a~0) (- 2))) (- 2)) 1) (= (mod (div (- main_~a~0) (- 2)) 2) 0) (= (* (div (- main_~a~0) (- 2)) main_~y~0) (* main_~y~0 2)) (= main_~q~0 0) (= (* (* (div (- main_~a~0) (- 2)) main_~y~0) 2) main_~b~0))} is VALID [2022-04-28 11:26:01,480 INFO L272 TraceCheckUtils]: 80: Hoare triple {16786#(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)); {16559#true} is VALID [2022-04-28 11:26:01,480 INFO L290 TraceCheckUtils]: 81: Hoare triple {16559#true} ~cond := #in~cond; {16559#true} is VALID [2022-04-28 11:26:01,480 INFO L290 TraceCheckUtils]: 82: Hoare triple {16559#true} assume !(0 == ~cond); {16559#true} is VALID [2022-04-28 11:26:01,480 INFO L290 TraceCheckUtils]: 83: Hoare triple {16559#true} assume true; {16559#true} is VALID [2022-04-28 11:26:01,480 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {16559#true} {16786#(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; {16786#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (<= (div (* (- 1) (div (* (- 1) main_~a~0) (- 2))) (- 2)) 1) (= (mod (div (- main_~a~0) (- 2)) 2) 0) (= (* (div (- main_~a~0) (- 2)) main_~y~0) (* main_~y~0 2)) (= main_~q~0 0) (= (* (* (div (- main_~a~0) (- 2)) main_~y~0) 2) main_~b~0))} is VALID [2022-04-28 11:26:01,480 INFO L272 TraceCheckUtils]: 85: Hoare triple {16786#(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)); {16559#true} is VALID [2022-04-28 11:26:01,481 INFO L290 TraceCheckUtils]: 86: Hoare triple {16559#true} ~cond := #in~cond; {16559#true} is VALID [2022-04-28 11:26:01,481 INFO L290 TraceCheckUtils]: 87: Hoare triple {16559#true} assume !(0 == ~cond); {16559#true} is VALID [2022-04-28 11:26:01,481 INFO L290 TraceCheckUtils]: 88: Hoare triple {16559#true} assume true; {16559#true} is VALID [2022-04-28 11:26:01,481 INFO L284 TraceCheckUtils]: 89: Hoare quadruple {16559#true} {16786#(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; {16786#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (<= (div (* (- 1) (div (* (- 1) main_~a~0) (- 2))) (- 2)) 1) (= (mod (div (- main_~a~0) (- 2)) 2) 0) (= (* (div (- main_~a~0) (- 2)) main_~y~0) (* main_~y~0 2)) (= main_~q~0 0) (= (* (* (div (- main_~a~0) (- 2)) main_~y~0) 2) main_~b~0))} is VALID [2022-04-28 11:26:01,482 INFO L290 TraceCheckUtils]: 90: Hoare triple {16786#(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); {16841#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (<= (div (* (- 1) (div (* (- 1) main_~a~0) (- 2))) (- 2)) 1) (= (mod (div (- main_~a~0) (- 2)) 2) 0) (not (<= (* main_~b~0 2) main_~r~0)) (= (* (div (- main_~a~0) (- 2)) main_~y~0) (* main_~y~0 2)) (= main_~q~0 0) (= (* (* (div (- main_~a~0) (- 2)) main_~y~0) 2) main_~b~0))} is VALID [2022-04-28 11:26:01,486 INFO L290 TraceCheckUtils]: 91: Hoare triple {16841#(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; {16845#(and (not (<= main_~x~0 (* main_~r~0 2))) (= (* 2 (* (div (- main_~q~0) (- 2)) main_~y~0)) (+ main_~x~0 (* (- 1) main_~r~0))) (<= (div (* (- 1) (div (* (- 1) main_~q~0) (- 2))) (- 2)) 1) (= (mod (div (- main_~q~0) (- 2)) 2) 0) (= (mod main_~q~0 2) 0) (= (* main_~y~0 2) (* (div (- main_~q~0) (- 2)) main_~y~0)))} is VALID [2022-04-28 11:26:01,487 INFO L290 TraceCheckUtils]: 92: Hoare triple {16845#(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; {16845#(and (not (<= main_~x~0 (* main_~r~0 2))) (= (* 2 (* (div (- main_~q~0) (- 2)) main_~y~0)) (+ main_~x~0 (* (- 1) main_~r~0))) (<= (div (* (- 1) (div (* (- 1) main_~q~0) (- 2))) (- 2)) 1) (= (mod (div (- main_~q~0) (- 2)) 2) 0) (= (mod main_~q~0 2) 0) (= (* main_~y~0 2) (* (div (- main_~q~0) (- 2)) main_~y~0)))} is VALID [2022-04-28 11:26:01,488 INFO L290 TraceCheckUtils]: 93: Hoare triple {16845#(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 < 10);havoc #t~post6; {16845#(and (not (<= main_~x~0 (* main_~r~0 2))) (= (* 2 (* (div (- main_~q~0) (- 2)) main_~y~0)) (+ main_~x~0 (* (- 1) main_~r~0))) (<= (div (* (- 1) (div (* (- 1) main_~q~0) (- 2))) (- 2)) 1) (= (mod (div (- main_~q~0) (- 2)) 2) 0) (= (mod main_~q~0 2) 0) (= (* main_~y~0 2) (* (div (- main_~q~0) (- 2)) main_~y~0)))} is VALID [2022-04-28 11:26:01,488 INFO L272 TraceCheckUtils]: 94: Hoare triple {16845#(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)); {16559#true} is VALID [2022-04-28 11:26:01,488 INFO L290 TraceCheckUtils]: 95: Hoare triple {16559#true} ~cond := #in~cond; {16559#true} is VALID [2022-04-28 11:26:01,488 INFO L290 TraceCheckUtils]: 96: Hoare triple {16559#true} assume !(0 == ~cond); {16559#true} is VALID [2022-04-28 11:26:01,488 INFO L290 TraceCheckUtils]: 97: Hoare triple {16559#true} assume true; {16559#true} is VALID [2022-04-28 11:26:01,488 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {16559#true} {16845#(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; {16845#(and (not (<= main_~x~0 (* main_~r~0 2))) (= (* 2 (* (div (- main_~q~0) (- 2)) main_~y~0)) (+ main_~x~0 (* (- 1) main_~r~0))) (<= (div (* (- 1) (div (* (- 1) main_~q~0) (- 2))) (- 2)) 1) (= (mod (div (- main_~q~0) (- 2)) 2) 0) (= (mod main_~q~0 2) 0) (= (* main_~y~0 2) (* (div (- main_~q~0) (- 2)) main_~y~0)))} is VALID [2022-04-28 11:26:01,488 INFO L272 TraceCheckUtils]: 99: Hoare triple {16845#(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)); {16559#true} is VALID [2022-04-28 11:26:01,488 INFO L290 TraceCheckUtils]: 100: Hoare triple {16559#true} ~cond := #in~cond; {16559#true} is VALID [2022-04-28 11:26:01,489 INFO L290 TraceCheckUtils]: 101: Hoare triple {16559#true} assume !(0 == ~cond); {16559#true} is VALID [2022-04-28 11:26:01,489 INFO L290 TraceCheckUtils]: 102: Hoare triple {16559#true} assume true; {16559#true} is VALID [2022-04-28 11:26:01,489 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {16559#true} {16845#(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; {16845#(and (not (<= main_~x~0 (* main_~r~0 2))) (= (* 2 (* (div (- main_~q~0) (- 2)) main_~y~0)) (+ main_~x~0 (* (- 1) main_~r~0))) (<= (div (* (- 1) (div (* (- 1) main_~q~0) (- 2))) (- 2)) 1) (= (mod (div (- main_~q~0) (- 2)) 2) 0) (= (mod main_~q~0 2) 0) (= (* main_~y~0 2) (* (div (- main_~q~0) (- 2)) main_~y~0)))} is VALID [2022-04-28 11:26:01,490 INFO L290 TraceCheckUtils]: 104: Hoare triple {16845#(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; {16885#(and (= main_~a~0 1) (<= main_~y~0 main_~r~0) (= (* main_~y~0 (div (* (- 1) main_~q~0) (- 2))) (* main_~y~0 2)) (= main_~b~0 main_~y~0) (= (mod main_~q~0 2) 0) (= main_~x~0 (+ (* 2 (* main_~y~0 (div (* (- 1) main_~q~0) (- 2)))) main_~r~0)) (< (* main_~r~0 2) main_~x~0))} is VALID [2022-04-28 11:26:01,490 INFO L290 TraceCheckUtils]: 105: Hoare triple {16885#(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; {16885#(and (= main_~a~0 1) (<= main_~y~0 main_~r~0) (= (* main_~y~0 (div (* (- 1) main_~q~0) (- 2))) (* main_~y~0 2)) (= main_~b~0 main_~y~0) (= (mod main_~q~0 2) 0) (= main_~x~0 (+ (* 2 (* main_~y~0 (div (* (- 1) main_~q~0) (- 2)))) main_~r~0)) (< (* main_~r~0 2) main_~x~0))} is VALID [2022-04-28 11:26:01,491 INFO L290 TraceCheckUtils]: 106: Hoare triple {16885#(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 < 10);havoc #t~post7; {16885#(and (= main_~a~0 1) (<= main_~y~0 main_~r~0) (= (* main_~y~0 (div (* (- 1) main_~q~0) (- 2))) (* main_~y~0 2)) (= main_~b~0 main_~y~0) (= (mod main_~q~0 2) 0) (= main_~x~0 (+ (* 2 (* main_~y~0 (div (* (- 1) main_~q~0) (- 2)))) main_~r~0)) (< (* main_~r~0 2) main_~x~0))} is VALID [2022-04-28 11:26:01,494 INFO L290 TraceCheckUtils]: 107: Hoare triple {16885#(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; {16895#(and (= (* main_~y~0 2) (* (div (+ (* (- 1) main_~q~0) 1) (- 2)) main_~y~0)) (< main_~x~0 (* 4 (* (div (+ (* (- 1) main_~q~0) 1) (- 2)) main_~y~0))) (<= (+ main_~y~0 (* 2 (* (div (+ (* (- 1) main_~q~0) 1) (- 2)) main_~y~0))) main_~x~0) (= (mod (+ main_~q~0 1) 2) 0) (= (+ main_~x~0 (* (- 2) (div (+ (* (- 1) main_~q~0) 1) (- 2)) main_~y~0) (* (- 1) main_~y~0)) main_~r~0))} is VALID [2022-04-28 11:26:01,494 INFO L290 TraceCheckUtils]: 108: Hoare triple {16895#(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; {16895#(and (= (* main_~y~0 2) (* (div (+ (* (- 1) main_~q~0) 1) (- 2)) main_~y~0)) (< main_~x~0 (* 4 (* (div (+ (* (- 1) main_~q~0) 1) (- 2)) main_~y~0))) (<= (+ main_~y~0 (* 2 (* (div (+ (* (- 1) main_~q~0) 1) (- 2)) main_~y~0))) main_~x~0) (= (mod (+ main_~q~0 1) 2) 0) (= (+ main_~x~0 (* (- 2) (div (+ (* (- 1) main_~q~0) 1) (- 2)) main_~y~0) (* (- 1) main_~y~0)) main_~r~0))} is VALID [2022-04-28 11:26:01,495 INFO L290 TraceCheckUtils]: 109: Hoare triple {16895#(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 < 10);havoc #t~post6; {16895#(and (= (* main_~y~0 2) (* (div (+ (* (- 1) main_~q~0) 1) (- 2)) main_~y~0)) (< main_~x~0 (* 4 (* (div (+ (* (- 1) main_~q~0) 1) (- 2)) main_~y~0))) (<= (+ main_~y~0 (* 2 (* (div (+ (* (- 1) main_~q~0) 1) (- 2)) main_~y~0))) main_~x~0) (= (mod (+ main_~q~0 1) 2) 0) (= (+ main_~x~0 (* (- 2) (div (+ (* (- 1) main_~q~0) 1) (- 2)) main_~y~0) (* (- 1) main_~y~0)) main_~r~0))} is VALID [2022-04-28 11:26:01,497 INFO L272 TraceCheckUtils]: 110: Hoare triple {16895#(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)); {16905#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:26:01,498 INFO L290 TraceCheckUtils]: 111: Hoare triple {16905#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {16909#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:26:01,498 INFO L290 TraceCheckUtils]: 112: Hoare triple {16909#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {16560#false} is VALID [2022-04-28 11:26:01,498 INFO L290 TraceCheckUtils]: 113: Hoare triple {16560#false} assume !false; {16560#false} is VALID [2022-04-28 11:26:01,499 INFO L134 CoverageAnalysis]: Checked inductivity of 486 backedges. 47 proven. 61 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2022-04-28 11:26:01,499 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:26:12,967 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 11:26:59,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:26:59,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647700036] [2022-04-28 11:26:59,442 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:26:59,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1524849595] [2022-04-28 11:26:59,442 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1524849595] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 11:26:59,442 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 11:26:59,442 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2022-04-28 11:26:59,443 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:26:59,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1931207064] [2022-04-28 11:26:59,443 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1931207064] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:26:59,443 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:26:59,443 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-28 11:26:59,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904444350] [2022-04-28 11:26:59,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:26:59,444 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.6) internal successors, (39), 14 states have internal predecessors, (39), 8 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 6 states have call predecessors, (17), 7 states have call successors, (17) Word has length 114 [2022-04-28 11:26:59,444 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:26:59,444 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 2.6) internal successors, (39), 14 states have internal predecessors, (39), 8 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 6 states have call predecessors, (17), 7 states have call successors, (17) [2022-04-28 11:26:59,523 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:26:59,523 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-28 11:26:59,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:26:59,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-28 11:26:59,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=469, Unknown=0, NotChecked=0, Total=600 [2022-04-28 11:26:59,524 INFO L87 Difference]: Start difference. First operand 184 states and 218 transitions. Second operand has 15 states, 15 states have (on average 2.6) internal successors, (39), 14 states have internal predecessors, (39), 8 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 6 states have call predecessors, (17), 7 states have call successors, (17) [2022-04-28 11:27:10,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:27:10,122 INFO L93 Difference]: Finished difference Result 232 states and 282 transitions. [2022-04-28 11:27:10,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-28 11:27:10,122 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.6) internal successors, (39), 14 states have internal predecessors, (39), 8 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 6 states have call predecessors, (17), 7 states have call successors, (17) Word has length 114 [2022-04-28 11:27:10,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:27:10,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 2.6) internal successors, (39), 14 states have internal predecessors, (39), 8 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 6 states have call predecessors, (17), 7 states have call successors, (17) [2022-04-28 11:27:10,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 169 transitions. [2022-04-28 11:27:10,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 2.6) internal successors, (39), 14 states have internal predecessors, (39), 8 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 6 states have call predecessors, (17), 7 states have call successors, (17) [2022-04-28 11:27:10,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 169 transitions. [2022-04-28 11:27:10,126 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 169 transitions. [2022-04-28 11:27:10,352 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 169 edges. 169 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:27:10,355 INFO L225 Difference]: With dead ends: 232 [2022-04-28 11:27:10,355 INFO L226 Difference]: Without dead ends: 223 [2022-04-28 11:27:10,356 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 180 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=144, Invalid=558, Unknown=0, NotChecked=0, Total=702 [2022-04-28 11:27:10,356 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 48 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 993 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 1036 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 993 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2022-04-28 11:27:10,356 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 413 Invalid, 1036 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 993 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2022-04-28 11:27:10,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2022-04-28 11:27:10,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 216. [2022-04-28 11:27:10,647 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:27:10,647 INFO L82 GeneralOperation]: Start isEquivalent. First operand 223 states. Second operand has 216 states, 138 states have (on average 1.1376811594202898) internal successors, (157), 140 states have internal predecessors, (157), 52 states have call successors, (52), 26 states have call predecessors, (52), 25 states have return successors, (50), 49 states have call predecessors, (50), 50 states have call successors, (50) [2022-04-28 11:27:10,647 INFO L74 IsIncluded]: Start isIncluded. First operand 223 states. Second operand has 216 states, 138 states have (on average 1.1376811594202898) internal successors, (157), 140 states have internal predecessors, (157), 52 states have call successors, (52), 26 states have call predecessors, (52), 25 states have return successors, (50), 49 states have call predecessors, (50), 50 states have call successors, (50) [2022-04-28 11:27:10,648 INFO L87 Difference]: Start difference. First operand 223 states. Second operand has 216 states, 138 states have (on average 1.1376811594202898) internal successors, (157), 140 states have internal predecessors, (157), 52 states have call successors, (52), 26 states have call predecessors, (52), 25 states have return successors, (50), 49 states have call predecessors, (50), 50 states have call successors, (50) [2022-04-28 11:27:10,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:27:10,651 INFO L93 Difference]: Finished difference Result 223 states and 267 transitions. [2022-04-28 11:27:10,651 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 267 transitions. [2022-04-28 11:27:10,652 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:27:10,652 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:27:10,652 INFO L74 IsIncluded]: Start isIncluded. First operand has 216 states, 138 states have (on average 1.1376811594202898) internal successors, (157), 140 states have internal predecessors, (157), 52 states have call successors, (52), 26 states have call predecessors, (52), 25 states have return successors, (50), 49 states have call predecessors, (50), 50 states have call successors, (50) Second operand 223 states. [2022-04-28 11:27:10,652 INFO L87 Difference]: Start difference. First operand has 216 states, 138 states have (on average 1.1376811594202898) internal successors, (157), 140 states have internal predecessors, (157), 52 states have call successors, (52), 26 states have call predecessors, (52), 25 states have return successors, (50), 49 states have call predecessors, (50), 50 states have call successors, (50) Second operand 223 states. [2022-04-28 11:27:10,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:27:10,656 INFO L93 Difference]: Finished difference Result 223 states and 267 transitions. [2022-04-28 11:27:10,656 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 267 transitions. [2022-04-28 11:27:10,656 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:27:10,656 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:27:10,656 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:27:10,656 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:27:10,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 138 states have (on average 1.1376811594202898) internal successors, (157), 140 states have internal predecessors, (157), 52 states have call successors, (52), 26 states have call predecessors, (52), 25 states have return successors, (50), 49 states have call predecessors, (50), 50 states have call successors, (50) [2022-04-28 11:27:10,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 259 transitions. [2022-04-28 11:27:10,660 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 259 transitions. Word has length 114 [2022-04-28 11:27:10,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:27:10,660 INFO L495 AbstractCegarLoop]: Abstraction has 216 states and 259 transitions. [2022-04-28 11:27:10,661 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.6) internal successors, (39), 14 states have internal predecessors, (39), 8 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 6 states have call predecessors, (17), 7 states have call successors, (17) [2022-04-28 11:27:10,661 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 216 states and 259 transitions. [2022-04-28 11:27:11,040 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 259 edges. 259 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:27:11,041 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 259 transitions. [2022-04-28 11:27:11,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-04-28 11:27:11,041 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:27:11,041 INFO L195 NwaCegarLoop]: trace histogram [18, 17, 17, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:27:11,058 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-04-28 11:27:11,242 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-04-28 11:27:11,242 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:27:11,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:27:11,242 INFO L85 PathProgramCache]: Analyzing trace with hash 1338024082, now seen corresponding path program 5 times [2022-04-28 11:27:11,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:27:11,243 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [375134004] [2022-04-28 11:27:44,118 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:27:44,118 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:27:44,118 INFO L85 PathProgramCache]: Analyzing trace with hash 1338024082, now seen corresponding path program 6 times [2022-04-28 11:27:44,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:27:44,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356525049] [2022-04-28 11:27:44,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:27:44,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:27:44,130 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:27:44,130 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1579399770] [2022-04-28 11:27:44,130 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 11:27:44,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:27:44,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:27:44,131 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 11:27:44,135 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-04-28 11:27:44,195 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2022-04-28 11:27:44,195 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:27:44,196 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-28 11:27:44,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:27:44,219 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:27:44,745 INFO L272 TraceCheckUtils]: 0: Hoare triple {18544#true} call ULTIMATE.init(); {18544#true} is VALID [2022-04-28 11:27:44,746 INFO L290 TraceCheckUtils]: 1: Hoare triple {18544#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; {18544#true} is VALID [2022-04-28 11:27:44,746 INFO L290 TraceCheckUtils]: 2: Hoare triple {18544#true} assume true; {18544#true} is VALID [2022-04-28 11:27:44,746 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18544#true} {18544#true} #93#return; {18544#true} is VALID [2022-04-28 11:27:44,746 INFO L272 TraceCheckUtils]: 4: Hoare triple {18544#true} call #t~ret8 := main(); {18544#true} is VALID [2022-04-28 11:27:44,746 INFO L290 TraceCheckUtils]: 5: Hoare triple {18544#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; {18544#true} is VALID [2022-04-28 11:27:44,746 INFO L272 TraceCheckUtils]: 6: Hoare triple {18544#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {18544#true} is VALID [2022-04-28 11:27:44,746 INFO L290 TraceCheckUtils]: 7: Hoare triple {18544#true} ~cond := #in~cond; {18544#true} is VALID [2022-04-28 11:27:44,746 INFO L290 TraceCheckUtils]: 8: Hoare triple {18544#true} assume !(0 == ~cond); {18544#true} is VALID [2022-04-28 11:27:44,746 INFO L290 TraceCheckUtils]: 9: Hoare triple {18544#true} assume true; {18544#true} is VALID [2022-04-28 11:27:44,746 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {18544#true} {18544#true} #77#return; {18544#true} is VALID [2022-04-28 11:27:44,746 INFO L290 TraceCheckUtils]: 11: Hoare triple {18544#true} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {18582#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:27:44,747 INFO L290 TraceCheckUtils]: 12: Hoare triple {18582#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {18582#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:27:44,747 INFO L290 TraceCheckUtils]: 13: Hoare triple {18582#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} assume !!(#t~post6 < 10);havoc #t~post6; {18582#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:27:44,747 INFO L272 TraceCheckUtils]: 14: Hoare triple {18582#(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)); {18544#true} is VALID [2022-04-28 11:27:44,747 INFO L290 TraceCheckUtils]: 15: Hoare triple {18544#true} ~cond := #in~cond; {18544#true} is VALID [2022-04-28 11:27:44,747 INFO L290 TraceCheckUtils]: 16: Hoare triple {18544#true} assume !(0 == ~cond); {18544#true} is VALID [2022-04-28 11:27:44,747 INFO L290 TraceCheckUtils]: 17: Hoare triple {18544#true} assume true; {18544#true} is VALID [2022-04-28 11:27:44,748 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {18544#true} {18582#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #79#return; {18582#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:27:44,748 INFO L272 TraceCheckUtils]: 19: Hoare triple {18582#(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)); {18544#true} is VALID [2022-04-28 11:27:44,748 INFO L290 TraceCheckUtils]: 20: Hoare triple {18544#true} ~cond := #in~cond; {18544#true} is VALID [2022-04-28 11:27:44,748 INFO L290 TraceCheckUtils]: 21: Hoare triple {18544#true} assume !(0 == ~cond); {18544#true} is VALID [2022-04-28 11:27:44,748 INFO L290 TraceCheckUtils]: 22: Hoare triple {18544#true} assume true; {18544#true} is VALID [2022-04-28 11:27:44,749 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {18544#true} {18582#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #81#return; {18582#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:27:44,749 INFO L290 TraceCheckUtils]: 24: Hoare triple {18582#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {18582#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:27:44,749 INFO L290 TraceCheckUtils]: 25: Hoare triple {18582#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {18582#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:27:44,750 INFO L290 TraceCheckUtils]: 26: Hoare triple {18582#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} assume !!(#t~post7 < 10);havoc #t~post7; {18582#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:27:44,750 INFO L272 TraceCheckUtils]: 27: Hoare triple {18582#(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)); {18544#true} is VALID [2022-04-28 11:27:44,750 INFO L290 TraceCheckUtils]: 28: Hoare triple {18544#true} ~cond := #in~cond; {18544#true} is VALID [2022-04-28 11:27:44,750 INFO L290 TraceCheckUtils]: 29: Hoare triple {18544#true} assume !(0 == ~cond); {18544#true} is VALID [2022-04-28 11:27:44,750 INFO L290 TraceCheckUtils]: 30: Hoare triple {18544#true} assume true; {18544#true} is VALID [2022-04-28 11:27:44,750 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {18544#true} {18582#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #83#return; {18582#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:27:44,750 INFO L272 TraceCheckUtils]: 32: Hoare triple {18582#(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)); {18544#true} is VALID [2022-04-28 11:27:44,750 INFO L290 TraceCheckUtils]: 33: Hoare triple {18544#true} ~cond := #in~cond; {18544#true} is VALID [2022-04-28 11:27:44,751 INFO L290 TraceCheckUtils]: 34: Hoare triple {18544#true} assume !(0 == ~cond); {18544#true} is VALID [2022-04-28 11:27:44,751 INFO L290 TraceCheckUtils]: 35: Hoare triple {18544#true} assume true; {18544#true} is VALID [2022-04-28 11:27:44,751 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {18544#true} {18582#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #85#return; {18582#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:27:44,751 INFO L272 TraceCheckUtils]: 37: Hoare triple {18582#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {18544#true} is VALID [2022-04-28 11:27:44,751 INFO L290 TraceCheckUtils]: 38: Hoare triple {18544#true} ~cond := #in~cond; {18544#true} is VALID [2022-04-28 11:27:44,751 INFO L290 TraceCheckUtils]: 39: Hoare triple {18544#true} assume !(0 == ~cond); {18544#true} is VALID [2022-04-28 11:27:44,751 INFO L290 TraceCheckUtils]: 40: Hoare triple {18544#true} assume true; {18544#true} is VALID [2022-04-28 11:27:44,752 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {18544#true} {18582#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #87#return; {18582#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:27:44,752 INFO L290 TraceCheckUtils]: 42: Hoare triple {18582#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} assume !!(~r~0 >= 2 * ~b~0); {18582#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:27:44,752 INFO L272 TraceCheckUtils]: 43: Hoare triple {18582#(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)); {18544#true} is VALID [2022-04-28 11:27:44,752 INFO L290 TraceCheckUtils]: 44: Hoare triple {18544#true} ~cond := #in~cond; {18544#true} is VALID [2022-04-28 11:27:44,752 INFO L290 TraceCheckUtils]: 45: Hoare triple {18544#true} assume !(0 == ~cond); {18544#true} is VALID [2022-04-28 11:27:44,752 INFO L290 TraceCheckUtils]: 46: Hoare triple {18544#true} assume true; {18544#true} is VALID [2022-04-28 11:27:44,753 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {18544#true} {18582#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #89#return; {18582#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:27:44,753 INFO L290 TraceCheckUtils]: 48: Hoare triple {18582#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} ~a~0 := 2 * ~a~0;~b~0 := 2 * ~b~0; {18582#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:27:44,753 INFO L290 TraceCheckUtils]: 49: Hoare triple {18582#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {18582#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:27:44,754 INFO L290 TraceCheckUtils]: 50: Hoare triple {18582#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} assume !!(#t~post7 < 10);havoc #t~post7; {18582#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:27:44,754 INFO L272 TraceCheckUtils]: 51: Hoare triple {18582#(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)); {18544#true} is VALID [2022-04-28 11:27:44,754 INFO L290 TraceCheckUtils]: 52: Hoare triple {18544#true} ~cond := #in~cond; {18544#true} is VALID [2022-04-28 11:27:44,754 INFO L290 TraceCheckUtils]: 53: Hoare triple {18544#true} assume !(0 == ~cond); {18544#true} is VALID [2022-04-28 11:27:44,754 INFO L290 TraceCheckUtils]: 54: Hoare triple {18544#true} assume true; {18544#true} is VALID [2022-04-28 11:27:44,754 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {18544#true} {18582#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #83#return; {18582#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:27:44,755 INFO L272 TraceCheckUtils]: 56: Hoare triple {18582#(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)); {18544#true} is VALID [2022-04-28 11:27:44,755 INFO L290 TraceCheckUtils]: 57: Hoare triple {18544#true} ~cond := #in~cond; {18544#true} is VALID [2022-04-28 11:27:44,755 INFO L290 TraceCheckUtils]: 58: Hoare triple {18544#true} assume !(0 == ~cond); {18544#true} is VALID [2022-04-28 11:27:44,755 INFO L290 TraceCheckUtils]: 59: Hoare triple {18544#true} assume true; {18544#true} is VALID [2022-04-28 11:27:44,755 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {18544#true} {18582#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #85#return; {18582#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:27:44,755 INFO L272 TraceCheckUtils]: 61: Hoare triple {18582#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {18544#true} is VALID [2022-04-28 11:27:44,755 INFO L290 TraceCheckUtils]: 62: Hoare triple {18544#true} ~cond := #in~cond; {18544#true} is VALID [2022-04-28 11:27:44,755 INFO L290 TraceCheckUtils]: 63: Hoare triple {18544#true} assume !(0 == ~cond); {18544#true} is VALID [2022-04-28 11:27:44,755 INFO L290 TraceCheckUtils]: 64: Hoare triple {18544#true} assume true; {18544#true} is VALID [2022-04-28 11:27:44,756 INFO L284 TraceCheckUtils]: 65: Hoare quadruple {18544#true} {18582#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #87#return; {18582#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:27:44,756 INFO L290 TraceCheckUtils]: 66: Hoare triple {18582#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} assume !!(~r~0 >= 2 * ~b~0); {18582#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:27:44,756 INFO L272 TraceCheckUtils]: 67: Hoare triple {18582#(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)); {18544#true} is VALID [2022-04-28 11:27:44,756 INFO L290 TraceCheckUtils]: 68: Hoare triple {18544#true} ~cond := #in~cond; {18544#true} is VALID [2022-04-28 11:27:44,756 INFO L290 TraceCheckUtils]: 69: Hoare triple {18544#true} assume !(0 == ~cond); {18544#true} is VALID [2022-04-28 11:27:44,756 INFO L290 TraceCheckUtils]: 70: Hoare triple {18544#true} assume true; {18544#true} is VALID [2022-04-28 11:27:44,757 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {18544#true} {18582#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #89#return; {18582#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:27:44,757 INFO L290 TraceCheckUtils]: 72: Hoare triple {18582#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} ~a~0 := 2 * ~a~0;~b~0 := 2 * ~b~0; {18582#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:27:44,758 INFO L290 TraceCheckUtils]: 73: Hoare triple {18582#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {18582#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:27:44,758 INFO L290 TraceCheckUtils]: 74: Hoare triple {18582#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} assume !!(#t~post7 < 10);havoc #t~post7; {18582#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:27:44,758 INFO L272 TraceCheckUtils]: 75: Hoare triple {18582#(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)); {18544#true} is VALID [2022-04-28 11:27:44,758 INFO L290 TraceCheckUtils]: 76: Hoare triple {18544#true} ~cond := #in~cond; {18544#true} is VALID [2022-04-28 11:27:44,758 INFO L290 TraceCheckUtils]: 77: Hoare triple {18544#true} assume !(0 == ~cond); {18544#true} is VALID [2022-04-28 11:27:44,758 INFO L290 TraceCheckUtils]: 78: Hoare triple {18544#true} assume true; {18544#true} is VALID [2022-04-28 11:27:44,759 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {18544#true} {18582#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #83#return; {18582#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:27:44,759 INFO L272 TraceCheckUtils]: 80: Hoare triple {18582#(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)); {18544#true} is VALID [2022-04-28 11:27:44,759 INFO L290 TraceCheckUtils]: 81: Hoare triple {18544#true} ~cond := #in~cond; {18544#true} is VALID [2022-04-28 11:27:44,759 INFO L290 TraceCheckUtils]: 82: Hoare triple {18544#true} assume !(0 == ~cond); {18544#true} is VALID [2022-04-28 11:27:44,759 INFO L290 TraceCheckUtils]: 83: Hoare triple {18544#true} assume true; {18544#true} is VALID [2022-04-28 11:27:44,759 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {18544#true} {18582#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #85#return; {18582#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:27:44,759 INFO L272 TraceCheckUtils]: 85: Hoare triple {18582#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {18544#true} is VALID [2022-04-28 11:27:44,759 INFO L290 TraceCheckUtils]: 86: Hoare triple {18544#true} ~cond := #in~cond; {18544#true} is VALID [2022-04-28 11:27:44,760 INFO L290 TraceCheckUtils]: 87: Hoare triple {18544#true} assume !(0 == ~cond); {18544#true} is VALID [2022-04-28 11:27:44,760 INFO L290 TraceCheckUtils]: 88: Hoare triple {18544#true} assume true; {18544#true} is VALID [2022-04-28 11:27:44,760 INFO L284 TraceCheckUtils]: 89: Hoare quadruple {18544#true} {18582#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #87#return; {18582#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:27:44,760 INFO L290 TraceCheckUtils]: 90: Hoare triple {18582#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} assume !!(~r~0 >= 2 * ~b~0); {18582#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:27:44,760 INFO L272 TraceCheckUtils]: 91: Hoare triple {18582#(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)); {18544#true} is VALID [2022-04-28 11:27:44,760 INFO L290 TraceCheckUtils]: 92: Hoare triple {18544#true} ~cond := #in~cond; {18544#true} is VALID [2022-04-28 11:27:44,760 INFO L290 TraceCheckUtils]: 93: Hoare triple {18544#true} assume !(0 == ~cond); {18544#true} is VALID [2022-04-28 11:27:44,761 INFO L290 TraceCheckUtils]: 94: Hoare triple {18544#true} assume true; {18544#true} is VALID [2022-04-28 11:27:44,761 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {18544#true} {18582#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #89#return; {18582#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:27:44,762 INFO L290 TraceCheckUtils]: 96: Hoare triple {18582#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} ~a~0 := 2 * ~a~0;~b~0 := 2 * ~b~0; {18838#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:27:44,762 INFO L290 TraceCheckUtils]: 97: Hoare triple {18838#(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; {18838#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:27:44,762 INFO L290 TraceCheckUtils]: 98: Hoare triple {18838#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (= main_~q~0 0))} assume !!(#t~post7 < 10);havoc #t~post7; {18838#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:27:44,763 INFO L272 TraceCheckUtils]: 99: Hoare triple {18838#(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)); {18544#true} is VALID [2022-04-28 11:27:44,763 INFO L290 TraceCheckUtils]: 100: Hoare triple {18544#true} ~cond := #in~cond; {18851#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:27:44,763 INFO L290 TraceCheckUtils]: 101: Hoare triple {18851#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {18855#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:27:44,763 INFO L290 TraceCheckUtils]: 102: Hoare triple {18855#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {18855#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:27:44,764 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {18855#(not (= |__VERIFIER_assert_#in~cond| 0))} {18838#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (= main_~q~0 0))} #83#return; {18862#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (= main_~q~0 0) (= main_~b~0 (* main_~a~0 main_~y~0)))} is VALID [2022-04-28 11:27:44,764 INFO L272 TraceCheckUtils]: 104: Hoare triple {18862#(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)); {18544#true} is VALID [2022-04-28 11:27:44,764 INFO L290 TraceCheckUtils]: 105: Hoare triple {18544#true} ~cond := #in~cond; {18544#true} is VALID [2022-04-28 11:27:44,764 INFO L290 TraceCheckUtils]: 106: Hoare triple {18544#true} assume !(0 == ~cond); {18544#true} is VALID [2022-04-28 11:27:44,764 INFO L290 TraceCheckUtils]: 107: Hoare triple {18544#true} assume true; {18544#true} is VALID [2022-04-28 11:27:44,765 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {18544#true} {18862#(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; {18862#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (= main_~q~0 0) (= main_~b~0 (* main_~a~0 main_~y~0)))} is VALID [2022-04-28 11:27:44,765 INFO L272 TraceCheckUtils]: 109: Hoare triple {18862#(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)); {18544#true} is VALID [2022-04-28 11:27:44,765 INFO L290 TraceCheckUtils]: 110: Hoare triple {18544#true} ~cond := #in~cond; {18544#true} is VALID [2022-04-28 11:27:44,765 INFO L290 TraceCheckUtils]: 111: Hoare triple {18544#true} assume !(0 == ~cond); {18544#true} is VALID [2022-04-28 11:27:44,765 INFO L290 TraceCheckUtils]: 112: Hoare triple {18544#true} assume true; {18544#true} is VALID [2022-04-28 11:27:44,766 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {18544#true} {18862#(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; {18862#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (= main_~q~0 0) (= main_~b~0 (* main_~a~0 main_~y~0)))} is VALID [2022-04-28 11:27:44,766 INFO L290 TraceCheckUtils]: 114: Hoare triple {18862#(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); {18862#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (= main_~q~0 0) (= main_~b~0 (* main_~a~0 main_~y~0)))} is VALID [2022-04-28 11:27:44,768 INFO L290 TraceCheckUtils]: 115: Hoare triple {18862#(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; {18899#(and (= (+ main_~x~0 (* (- 1) main_~r~0)) (* main_~q~0 main_~y~0)) (= (mod main_~q~0 2) 0))} is VALID [2022-04-28 11:27:44,769 INFO L290 TraceCheckUtils]: 116: Hoare triple {18899#(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; {18899#(and (= (+ main_~x~0 (* (- 1) main_~r~0)) (* main_~q~0 main_~y~0)) (= (mod main_~q~0 2) 0))} is VALID [2022-04-28 11:27:44,769 INFO L290 TraceCheckUtils]: 117: Hoare triple {18899#(and (= (+ main_~x~0 (* (- 1) main_~r~0)) (* main_~q~0 main_~y~0)) (= (mod main_~q~0 2) 0))} assume !(#t~post6 < 10);havoc #t~post6; {18899#(and (= (+ main_~x~0 (* (- 1) main_~r~0)) (* main_~q~0 main_~y~0)) (= (mod main_~q~0 2) 0))} is VALID [2022-04-28 11:27:44,770 INFO L272 TraceCheckUtils]: 118: Hoare triple {18899#(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)); {18909#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:27:44,770 INFO L290 TraceCheckUtils]: 119: Hoare triple {18909#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {18913#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:27:44,770 INFO L290 TraceCheckUtils]: 120: Hoare triple {18913#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {18545#false} is VALID [2022-04-28 11:27:44,770 INFO L290 TraceCheckUtils]: 121: Hoare triple {18545#false} assume !false; {18545#false} is VALID [2022-04-28 11:27:44,771 INFO L134 CoverageAnalysis]: Checked inductivity of 622 backedges. 93 proven. 9 refuted. 0 times theorem prover too weak. 520 trivial. 0 not checked. [2022-04-28 11:27:44,771 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:27:51,570 INFO L290 TraceCheckUtils]: 121: Hoare triple {18545#false} assume !false; {18545#false} is VALID [2022-04-28 11:27:51,571 INFO L290 TraceCheckUtils]: 120: Hoare triple {18913#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {18545#false} is VALID [2022-04-28 11:27:51,571 INFO L290 TraceCheckUtils]: 119: Hoare triple {18909#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {18913#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:27:51,572 INFO L272 TraceCheckUtils]: 118: Hoare triple {18929#(= (+ (* 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)); {18909#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:27:51,572 INFO L290 TraceCheckUtils]: 117: Hoare triple {18929#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} assume !(#t~post6 < 10);havoc #t~post6; {18929#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:27:51,572 INFO L290 TraceCheckUtils]: 116: Hoare triple {18929#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {18929#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:27:51,579 INFO L290 TraceCheckUtils]: 115: Hoare triple {18939#(= 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; {18929#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:27:51,579 INFO L290 TraceCheckUtils]: 114: Hoare triple {18939#(= 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); {18939#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} is VALID [2022-04-28 11:27:51,580 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {18544#true} {18939#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} #87#return; {18939#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} is VALID [2022-04-28 11:27:51,580 INFO L290 TraceCheckUtils]: 112: Hoare triple {18544#true} assume true; {18544#true} is VALID [2022-04-28 11:27:51,580 INFO L290 TraceCheckUtils]: 111: Hoare triple {18544#true} assume !(0 == ~cond); {18544#true} is VALID [2022-04-28 11:27:51,580 INFO L290 TraceCheckUtils]: 110: Hoare triple {18544#true} ~cond := #in~cond; {18544#true} is VALID [2022-04-28 11:27:51,580 INFO L272 TraceCheckUtils]: 109: Hoare triple {18939#(= 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)); {18544#true} is VALID [2022-04-28 11:27:51,581 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {18544#true} {18939#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} #85#return; {18939#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} is VALID [2022-04-28 11:27:51,581 INFO L290 TraceCheckUtils]: 107: Hoare triple {18544#true} assume true; {18544#true} is VALID [2022-04-28 11:27:51,581 INFO L290 TraceCheckUtils]: 106: Hoare triple {18544#true} assume !(0 == ~cond); {18544#true} is VALID [2022-04-28 11:27:51,581 INFO L290 TraceCheckUtils]: 105: Hoare triple {18544#true} ~cond := #in~cond; {18544#true} is VALID [2022-04-28 11:27:51,581 INFO L272 TraceCheckUtils]: 104: Hoare triple {18939#(= 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)); {18544#true} is VALID [2022-04-28 11:27:51,582 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {18855#(not (= |__VERIFIER_assert_#in~cond| 0))} {18929#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} #83#return; {18939#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} is VALID [2022-04-28 11:27:51,582 INFO L290 TraceCheckUtils]: 102: Hoare triple {18855#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {18855#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:27:51,583 INFO L290 TraceCheckUtils]: 101: Hoare triple {18985#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {18855#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:27:51,583 INFO L290 TraceCheckUtils]: 100: Hoare triple {18544#true} ~cond := #in~cond; {18985#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 11:27:51,583 INFO L272 TraceCheckUtils]: 99: Hoare triple {18929#(= (+ (* 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)); {18544#true} is VALID [2022-04-28 11:27:51,584 INFO L290 TraceCheckUtils]: 98: Hoare triple {18929#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} assume !!(#t~post7 < 10);havoc #t~post7; {18929#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:27:51,584 INFO L290 TraceCheckUtils]: 97: Hoare triple {18929#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {18929#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:27:51,584 INFO L290 TraceCheckUtils]: 96: Hoare triple {18929#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} ~a~0 := 2 * ~a~0;~b~0 := 2 * ~b~0; {18929#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:27:51,585 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {18544#true} {18929#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} #89#return; {18929#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:27:51,585 INFO L290 TraceCheckUtils]: 94: Hoare triple {18544#true} assume true; {18544#true} is VALID [2022-04-28 11:27:51,585 INFO L290 TraceCheckUtils]: 93: Hoare triple {18544#true} assume !(0 == ~cond); {18544#true} is VALID [2022-04-28 11:27:51,585 INFO L290 TraceCheckUtils]: 92: Hoare triple {18544#true} ~cond := #in~cond; {18544#true} is VALID [2022-04-28 11:27:51,585 INFO L272 TraceCheckUtils]: 91: Hoare triple {18929#(= (+ (* 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)); {18544#true} is VALID [2022-04-28 11:27:51,585 INFO L290 TraceCheckUtils]: 90: Hoare triple {18929#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} assume !!(~r~0 >= 2 * ~b~0); {18929#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:27:51,586 INFO L284 TraceCheckUtils]: 89: Hoare quadruple {18544#true} {18929#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} #87#return; {18929#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:27:51,586 INFO L290 TraceCheckUtils]: 88: Hoare triple {18544#true} assume true; {18544#true} is VALID [2022-04-28 11:27:51,586 INFO L290 TraceCheckUtils]: 87: Hoare triple {18544#true} assume !(0 == ~cond); {18544#true} is VALID [2022-04-28 11:27:51,586 INFO L290 TraceCheckUtils]: 86: Hoare triple {18544#true} ~cond := #in~cond; {18544#true} is VALID [2022-04-28 11:27:51,586 INFO L272 TraceCheckUtils]: 85: Hoare triple {18929#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {18544#true} is VALID [2022-04-28 11:27:51,587 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {18544#true} {18929#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} #85#return; {18929#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:27:51,587 INFO L290 TraceCheckUtils]: 83: Hoare triple {18544#true} assume true; {18544#true} is VALID [2022-04-28 11:27:51,587 INFO L290 TraceCheckUtils]: 82: Hoare triple {18544#true} assume !(0 == ~cond); {18544#true} is VALID [2022-04-28 11:27:51,587 INFO L290 TraceCheckUtils]: 81: Hoare triple {18544#true} ~cond := #in~cond; {18544#true} is VALID [2022-04-28 11:27:51,587 INFO L272 TraceCheckUtils]: 80: Hoare triple {18929#(= (+ (* 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)); {18544#true} is VALID [2022-04-28 11:27:51,588 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {18544#true} {18929#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} #83#return; {18929#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:27:51,588 INFO L290 TraceCheckUtils]: 78: Hoare triple {18544#true} assume true; {18544#true} is VALID [2022-04-28 11:27:51,588 INFO L290 TraceCheckUtils]: 77: Hoare triple {18544#true} assume !(0 == ~cond); {18544#true} is VALID [2022-04-28 11:27:51,588 INFO L290 TraceCheckUtils]: 76: Hoare triple {18544#true} ~cond := #in~cond; {18544#true} is VALID [2022-04-28 11:27:51,588 INFO L272 TraceCheckUtils]: 75: Hoare triple {18929#(= (+ (* 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)); {18544#true} is VALID [2022-04-28 11:27:51,588 INFO L290 TraceCheckUtils]: 74: Hoare triple {18929#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} assume !!(#t~post7 < 10);havoc #t~post7; {18929#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:27:51,588 INFO L290 TraceCheckUtils]: 73: Hoare triple {18929#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {18929#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:27:51,589 INFO L290 TraceCheckUtils]: 72: Hoare triple {18929#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} ~a~0 := 2 * ~a~0;~b~0 := 2 * ~b~0; {18929#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:27:51,589 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {18544#true} {18929#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} #89#return; {18929#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:27:51,589 INFO L290 TraceCheckUtils]: 70: Hoare triple {18544#true} assume true; {18544#true} is VALID [2022-04-28 11:27:51,590 INFO L290 TraceCheckUtils]: 69: Hoare triple {18544#true} assume !(0 == ~cond); {18544#true} is VALID [2022-04-28 11:27:51,590 INFO L290 TraceCheckUtils]: 68: Hoare triple {18544#true} ~cond := #in~cond; {18544#true} is VALID [2022-04-28 11:27:51,590 INFO L272 TraceCheckUtils]: 67: Hoare triple {18929#(= (+ (* 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)); {18544#true} is VALID [2022-04-28 11:27:51,590 INFO L290 TraceCheckUtils]: 66: Hoare triple {18929#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} assume !!(~r~0 >= 2 * ~b~0); {18929#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:27:51,590 INFO L284 TraceCheckUtils]: 65: Hoare quadruple {18544#true} {18929#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} #87#return; {18929#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:27:51,591 INFO L290 TraceCheckUtils]: 64: Hoare triple {18544#true} assume true; {18544#true} is VALID [2022-04-28 11:27:51,591 INFO L290 TraceCheckUtils]: 63: Hoare triple {18544#true} assume !(0 == ~cond); {18544#true} is VALID [2022-04-28 11:27:51,591 INFO L290 TraceCheckUtils]: 62: Hoare triple {18544#true} ~cond := #in~cond; {18544#true} is VALID [2022-04-28 11:27:51,591 INFO L272 TraceCheckUtils]: 61: Hoare triple {18929#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {18544#true} is VALID [2022-04-28 11:27:51,591 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {18544#true} {18929#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} #85#return; {18929#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:27:51,591 INFO L290 TraceCheckUtils]: 59: Hoare triple {18544#true} assume true; {18544#true} is VALID [2022-04-28 11:27:51,591 INFO L290 TraceCheckUtils]: 58: Hoare triple {18544#true} assume !(0 == ~cond); {18544#true} is VALID [2022-04-28 11:27:51,592 INFO L290 TraceCheckUtils]: 57: Hoare triple {18544#true} ~cond := #in~cond; {18544#true} is VALID [2022-04-28 11:27:51,592 INFO L272 TraceCheckUtils]: 56: Hoare triple {18929#(= (+ (* 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)); {18544#true} is VALID [2022-04-28 11:27:51,592 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {18544#true} {18929#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} #83#return; {18929#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:27:51,592 INFO L290 TraceCheckUtils]: 54: Hoare triple {18544#true} assume true; {18544#true} is VALID [2022-04-28 11:27:51,592 INFO L290 TraceCheckUtils]: 53: Hoare triple {18544#true} assume !(0 == ~cond); {18544#true} is VALID [2022-04-28 11:27:51,592 INFO L290 TraceCheckUtils]: 52: Hoare triple {18544#true} ~cond := #in~cond; {18544#true} is VALID [2022-04-28 11:27:51,592 INFO L272 TraceCheckUtils]: 51: Hoare triple {18929#(= (+ (* 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)); {18544#true} is VALID [2022-04-28 11:27:51,593 INFO L290 TraceCheckUtils]: 50: Hoare triple {18929#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} assume !!(#t~post7 < 10);havoc #t~post7; {18929#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:27:51,593 INFO L290 TraceCheckUtils]: 49: Hoare triple {18929#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {18929#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:27:51,593 INFO L290 TraceCheckUtils]: 48: Hoare triple {18929#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} ~a~0 := 2 * ~a~0;~b~0 := 2 * ~b~0; {18929#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:27:51,594 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {18544#true} {18929#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} #89#return; {18929#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:27:51,594 INFO L290 TraceCheckUtils]: 46: Hoare triple {18544#true} assume true; {18544#true} is VALID [2022-04-28 11:27:51,594 INFO L290 TraceCheckUtils]: 45: Hoare triple {18544#true} assume !(0 == ~cond); {18544#true} is VALID [2022-04-28 11:27:51,594 INFO L290 TraceCheckUtils]: 44: Hoare triple {18544#true} ~cond := #in~cond; {18544#true} is VALID [2022-04-28 11:27:51,594 INFO L272 TraceCheckUtils]: 43: Hoare triple {18929#(= (+ (* 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)); {18544#true} is VALID [2022-04-28 11:27:51,594 INFO L290 TraceCheckUtils]: 42: Hoare triple {18929#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} assume !!(~r~0 >= 2 * ~b~0); {18929#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:27:51,595 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {18544#true} {18929#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} #87#return; {18929#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:27:51,595 INFO L290 TraceCheckUtils]: 40: Hoare triple {18544#true} assume true; {18544#true} is VALID [2022-04-28 11:27:51,595 INFO L290 TraceCheckUtils]: 39: Hoare triple {18544#true} assume !(0 == ~cond); {18544#true} is VALID [2022-04-28 11:27:51,595 INFO L290 TraceCheckUtils]: 38: Hoare triple {18544#true} ~cond := #in~cond; {18544#true} is VALID [2022-04-28 11:27:51,595 INFO L272 TraceCheckUtils]: 37: Hoare triple {18929#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {18544#true} is VALID [2022-04-28 11:27:51,596 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {18544#true} {18929#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} #85#return; {18929#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:27:51,596 INFO L290 TraceCheckUtils]: 35: Hoare triple {18544#true} assume true; {18544#true} is VALID [2022-04-28 11:27:51,596 INFO L290 TraceCheckUtils]: 34: Hoare triple {18544#true} assume !(0 == ~cond); {18544#true} is VALID [2022-04-28 11:27:51,596 INFO L290 TraceCheckUtils]: 33: Hoare triple {18544#true} ~cond := #in~cond; {18544#true} is VALID [2022-04-28 11:27:51,596 INFO L272 TraceCheckUtils]: 32: Hoare triple {18929#(= (+ (* 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)); {18544#true} is VALID [2022-04-28 11:27:51,596 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {18544#true} {18929#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} #83#return; {18929#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:27:51,596 INFO L290 TraceCheckUtils]: 30: Hoare triple {18544#true} assume true; {18544#true} is VALID [2022-04-28 11:27:51,596 INFO L290 TraceCheckUtils]: 29: Hoare triple {18544#true} assume !(0 == ~cond); {18544#true} is VALID [2022-04-28 11:27:51,597 INFO L290 TraceCheckUtils]: 28: Hoare triple {18544#true} ~cond := #in~cond; {18544#true} is VALID [2022-04-28 11:27:51,597 INFO L272 TraceCheckUtils]: 27: Hoare triple {18929#(= (+ (* 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)); {18544#true} is VALID [2022-04-28 11:27:51,597 INFO L290 TraceCheckUtils]: 26: Hoare triple {18929#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} assume !!(#t~post7 < 10);havoc #t~post7; {18929#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:27:51,597 INFO L290 TraceCheckUtils]: 25: Hoare triple {18929#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {18929#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:27:51,597 INFO L290 TraceCheckUtils]: 24: Hoare triple {18929#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {18929#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:27:51,598 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {18544#true} {18929#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} #81#return; {18929#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:27:51,598 INFO L290 TraceCheckUtils]: 22: Hoare triple {18544#true} assume true; {18544#true} is VALID [2022-04-28 11:27:51,598 INFO L290 TraceCheckUtils]: 21: Hoare triple {18544#true} assume !(0 == ~cond); {18544#true} is VALID [2022-04-28 11:27:51,598 INFO L290 TraceCheckUtils]: 20: Hoare triple {18544#true} ~cond := #in~cond; {18544#true} is VALID [2022-04-28 11:27:51,598 INFO L272 TraceCheckUtils]: 19: Hoare triple {18929#(= (+ (* 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)); {18544#true} is VALID [2022-04-28 11:27:51,598 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {18544#true} {18929#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} #79#return; {18929#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:27:51,599 INFO L290 TraceCheckUtils]: 17: Hoare triple {18544#true} assume true; {18544#true} is VALID [2022-04-28 11:27:51,599 INFO L290 TraceCheckUtils]: 16: Hoare triple {18544#true} assume !(0 == ~cond); {18544#true} is VALID [2022-04-28 11:27:51,599 INFO L290 TraceCheckUtils]: 15: Hoare triple {18544#true} ~cond := #in~cond; {18544#true} is VALID [2022-04-28 11:27:51,599 INFO L272 TraceCheckUtils]: 14: Hoare triple {18929#(= (+ (* 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)); {18544#true} is VALID [2022-04-28 11:27:51,599 INFO L290 TraceCheckUtils]: 13: Hoare triple {18929#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} assume !!(#t~post6 < 10);havoc #t~post6; {18929#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:27:51,599 INFO L290 TraceCheckUtils]: 12: Hoare triple {18929#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {18929#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:27:51,600 INFO L290 TraceCheckUtils]: 11: Hoare triple {18544#true} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {18929#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:27:51,600 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {18544#true} {18544#true} #77#return; {18544#true} is VALID [2022-04-28 11:27:51,600 INFO L290 TraceCheckUtils]: 9: Hoare triple {18544#true} assume true; {18544#true} is VALID [2022-04-28 11:27:51,600 INFO L290 TraceCheckUtils]: 8: Hoare triple {18544#true} assume !(0 == ~cond); {18544#true} is VALID [2022-04-28 11:27:51,600 INFO L290 TraceCheckUtils]: 7: Hoare triple {18544#true} ~cond := #in~cond; {18544#true} is VALID [2022-04-28 11:27:51,600 INFO L272 TraceCheckUtils]: 6: Hoare triple {18544#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {18544#true} is VALID [2022-04-28 11:27:51,600 INFO L290 TraceCheckUtils]: 5: Hoare triple {18544#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; {18544#true} is VALID [2022-04-28 11:27:51,600 INFO L272 TraceCheckUtils]: 4: Hoare triple {18544#true} call #t~ret8 := main(); {18544#true} is VALID [2022-04-28 11:27:51,600 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18544#true} {18544#true} #93#return; {18544#true} is VALID [2022-04-28 11:27:51,600 INFO L290 TraceCheckUtils]: 2: Hoare triple {18544#true} assume true; {18544#true} is VALID [2022-04-28 11:27:51,600 INFO L290 TraceCheckUtils]: 1: Hoare triple {18544#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; {18544#true} is VALID [2022-04-28 11:27:51,600 INFO L272 TraceCheckUtils]: 0: Hoare triple {18544#true} call ULTIMATE.init(); {18544#true} is VALID [2022-04-28 11:27:51,601 INFO L134 CoverageAnalysis]: Checked inductivity of 622 backedges. 75 proven. 16 refuted. 0 times theorem prover too weak. 531 trivial. 0 not checked. [2022-04-28 11:27:51,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:27:51,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356525049] [2022-04-28 11:27:51,601 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:27:51,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1579399770] [2022-04-28 11:27:51,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1579399770] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 11:27:51,601 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 11:27:51,601 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 13 [2022-04-28 11:27:51,602 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:27:51,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [375134004] [2022-04-28 11:27:51,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [375134004] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:27:51,602 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:27:51,602 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 11:27:51,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431821283] [2022-04-28 11:27:51,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:27:51,602 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 9 states have internal predecessors, (30), 5 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) Word has length 122 [2022-04-28 11:27:51,602 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:27:51,603 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 3.0) internal successors, (30), 9 states have internal predecessors, (30), 5 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2022-04-28 11:27:51,643 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:27:51,644 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 11:27:51,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:27:51,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 11:27:51,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2022-04-28 11:27:51,644 INFO L87 Difference]: Start difference. First operand 216 states and 259 transitions. Second operand has 10 states, 10 states have (on average 3.0) internal successors, (30), 9 states have internal predecessors, (30), 5 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2022-04-28 11:27:52,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:27:52,818 INFO L93 Difference]: Finished difference Result 250 states and 306 transitions. [2022-04-28 11:27:52,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 11:27:52,818 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 9 states have internal predecessors, (30), 5 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) Word has length 122 [2022-04-28 11:27:52,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:27:52,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.0) internal successors, (30), 9 states have internal predecessors, (30), 5 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2022-04-28 11:27:52,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 110 transitions. [2022-04-28 11:27:52,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.0) internal successors, (30), 9 states have internal predecessors, (30), 5 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2022-04-28 11:27:52,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 110 transitions. [2022-04-28 11:27:52,821 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 110 transitions. [2022-04-28 11:27:52,931 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:27:52,935 INFO L225 Difference]: With dead ends: 250 [2022-04-28 11:27:52,935 INFO L226 Difference]: Without dead ends: 247 [2022-04-28 11:27:52,935 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 230 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2022-04-28 11:27:52,935 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 37 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 11:27:52,936 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 182 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 272 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 11:27:52,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2022-04-28 11:27:53,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 244. [2022-04-28 11:27:53,254 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:27:53,254 INFO L82 GeneralOperation]: Start isEquivalent. First operand 247 states. Second operand has 244 states, 155 states have (on average 1.1483870967741936) internal successors, (178), 157 states have internal predecessors, (178), 61 states have call successors, (61), 28 states have call predecessors, (61), 27 states have return successors, (59), 58 states have call predecessors, (59), 59 states have call successors, (59) [2022-04-28 11:27:53,254 INFO L74 IsIncluded]: Start isIncluded. First operand 247 states. Second operand has 244 states, 155 states have (on average 1.1483870967741936) internal successors, (178), 157 states have internal predecessors, (178), 61 states have call successors, (61), 28 states have call predecessors, (61), 27 states have return successors, (59), 58 states have call predecessors, (59), 59 states have call successors, (59) [2022-04-28 11:27:53,255 INFO L87 Difference]: Start difference. First operand 247 states. Second operand has 244 states, 155 states have (on average 1.1483870967741936) internal successors, (178), 157 states have internal predecessors, (178), 61 states have call successors, (61), 28 states have call predecessors, (61), 27 states have return successors, (59), 58 states have call predecessors, (59), 59 states have call successors, (59) [2022-04-28 11:27:53,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:27:53,259 INFO L93 Difference]: Finished difference Result 247 states and 301 transitions. [2022-04-28 11:27:53,259 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 301 transitions. [2022-04-28 11:27:53,259 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:27:53,259 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:27:53,260 INFO L74 IsIncluded]: Start isIncluded. First operand has 244 states, 155 states have (on average 1.1483870967741936) internal successors, (178), 157 states have internal predecessors, (178), 61 states have call successors, (61), 28 states have call predecessors, (61), 27 states have return successors, (59), 58 states have call predecessors, (59), 59 states have call successors, (59) Second operand 247 states. [2022-04-28 11:27:53,260 INFO L87 Difference]: Start difference. First operand has 244 states, 155 states have (on average 1.1483870967741936) internal successors, (178), 157 states have internal predecessors, (178), 61 states have call successors, (61), 28 states have call predecessors, (61), 27 states have return successors, (59), 58 states have call predecessors, (59), 59 states have call successors, (59) Second operand 247 states. [2022-04-28 11:27:53,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:27:53,263 INFO L93 Difference]: Finished difference Result 247 states and 301 transitions. [2022-04-28 11:27:53,264 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 301 transitions. [2022-04-28 11:27:53,264 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:27:53,264 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:27:53,264 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:27:53,264 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:27:53,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 155 states have (on average 1.1483870967741936) internal successors, (178), 157 states have internal predecessors, (178), 61 states have call successors, (61), 28 states have call predecessors, (61), 27 states have return successors, (59), 58 states have call predecessors, (59), 59 states have call successors, (59) [2022-04-28 11:27:53,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 298 transitions. [2022-04-28 11:27:53,268 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 298 transitions. Word has length 122 [2022-04-28 11:27:53,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:27:53,269 INFO L495 AbstractCegarLoop]: Abstraction has 244 states and 298 transitions. [2022-04-28 11:27:53,269 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 9 states have internal predecessors, (30), 5 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2022-04-28 11:27:53,269 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 244 states and 298 transitions. [2022-04-28 11:27:53,667 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 298 edges. 298 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:27:53,668 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 298 transitions. [2022-04-28 11:27:53,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2022-04-28 11:27:53,668 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:27:53,669 INFO L195 NwaCegarLoop]: trace histogram [18, 17, 17, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:27:53,685 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-28 11:27:53,873 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:27:53,874 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:27:53,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:27:53,874 INFO L85 PathProgramCache]: Analyzing trace with hash -877539457, now seen corresponding path program 5 times [2022-04-28 11:27:53,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:27:53,874 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1768174863] [2022-04-28 11:28:24,736 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:28:24,736 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:28:24,736 INFO L85 PathProgramCache]: Analyzing trace with hash -877539457, now seen corresponding path program 6 times [2022-04-28 11:28:24,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:28:24,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665839241] [2022-04-28 11:28:24,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:28:24,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:28:24,753 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:28:24,753 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1613169868] [2022-04-28 11:28:24,753 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 11:28:24,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:28:24,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:28:24,754 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 11:28:24,755 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-04-28 11:28:24,819 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-28 11:28:24,819 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:28:24,820 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-28 11:28:24,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:28:24,836 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:28:25,052 INFO L272 TraceCheckUtils]: 0: Hoare triple {20774#true} call ULTIMATE.init(); {20774#true} is VALID [2022-04-28 11:28:25,053 INFO L290 TraceCheckUtils]: 1: Hoare triple {20774#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; {20774#true} is VALID [2022-04-28 11:28:25,053 INFO L290 TraceCheckUtils]: 2: Hoare triple {20774#true} assume true; {20774#true} is VALID [2022-04-28 11:28:25,053 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20774#true} {20774#true} #93#return; {20774#true} is VALID [2022-04-28 11:28:25,053 INFO L272 TraceCheckUtils]: 4: Hoare triple {20774#true} call #t~ret8 := main(); {20774#true} is VALID [2022-04-28 11:28:25,053 INFO L290 TraceCheckUtils]: 5: Hoare triple {20774#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; {20774#true} is VALID [2022-04-28 11:28:25,053 INFO L272 TraceCheckUtils]: 6: Hoare triple {20774#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {20774#true} is VALID [2022-04-28 11:28:25,053 INFO L290 TraceCheckUtils]: 7: Hoare triple {20774#true} ~cond := #in~cond; {20774#true} is VALID [2022-04-28 11:28:25,053 INFO L290 TraceCheckUtils]: 8: Hoare triple {20774#true} assume !(0 == ~cond); {20774#true} is VALID [2022-04-28 11:28:25,053 INFO L290 TraceCheckUtils]: 9: Hoare triple {20774#true} assume true; {20774#true} is VALID [2022-04-28 11:28:25,053 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {20774#true} {20774#true} #77#return; {20774#true} is VALID [2022-04-28 11:28:25,053 INFO L290 TraceCheckUtils]: 11: Hoare triple {20774#true} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {20774#true} is VALID [2022-04-28 11:28:25,053 INFO L290 TraceCheckUtils]: 12: Hoare triple {20774#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {20774#true} is VALID [2022-04-28 11:28:25,054 INFO L290 TraceCheckUtils]: 13: Hoare triple {20774#true} assume !!(#t~post6 < 10);havoc #t~post6; {20774#true} is VALID [2022-04-28 11:28:25,054 INFO L272 TraceCheckUtils]: 14: Hoare triple {20774#true} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {20774#true} is VALID [2022-04-28 11:28:25,054 INFO L290 TraceCheckUtils]: 15: Hoare triple {20774#true} ~cond := #in~cond; {20774#true} is VALID [2022-04-28 11:28:25,054 INFO L290 TraceCheckUtils]: 16: Hoare triple {20774#true} assume !(0 == ~cond); {20774#true} is VALID [2022-04-28 11:28:25,054 INFO L290 TraceCheckUtils]: 17: Hoare triple {20774#true} assume true; {20774#true} is VALID [2022-04-28 11:28:25,054 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {20774#true} {20774#true} #79#return; {20774#true} is VALID [2022-04-28 11:28:25,054 INFO L272 TraceCheckUtils]: 19: Hoare triple {20774#true} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {20774#true} is VALID [2022-04-28 11:28:25,054 INFO L290 TraceCheckUtils]: 20: Hoare triple {20774#true} ~cond := #in~cond; {20774#true} is VALID [2022-04-28 11:28:25,054 INFO L290 TraceCheckUtils]: 21: Hoare triple {20774#true} assume !(0 == ~cond); {20774#true} is VALID [2022-04-28 11:28:25,054 INFO L290 TraceCheckUtils]: 22: Hoare triple {20774#true} assume true; {20774#true} is VALID [2022-04-28 11:28:25,054 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {20774#true} {20774#true} #81#return; {20774#true} is VALID [2022-04-28 11:28:25,054 INFO L290 TraceCheckUtils]: 24: Hoare triple {20774#true} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {20774#true} is VALID [2022-04-28 11:28:25,054 INFO L290 TraceCheckUtils]: 25: Hoare triple {20774#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {20774#true} is VALID [2022-04-28 11:28:25,054 INFO L290 TraceCheckUtils]: 26: Hoare triple {20774#true} assume !!(#t~post7 < 10);havoc #t~post7; {20774#true} is VALID [2022-04-28 11:28:25,054 INFO L272 TraceCheckUtils]: 27: Hoare triple {20774#true} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {20774#true} is VALID [2022-04-28 11:28:25,055 INFO L290 TraceCheckUtils]: 28: Hoare triple {20774#true} ~cond := #in~cond; {20774#true} is VALID [2022-04-28 11:28:25,055 INFO L290 TraceCheckUtils]: 29: Hoare triple {20774#true} assume !(0 == ~cond); {20774#true} is VALID [2022-04-28 11:28:25,055 INFO L290 TraceCheckUtils]: 30: Hoare triple {20774#true} assume true; {20774#true} is VALID [2022-04-28 11:28:25,055 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {20774#true} {20774#true} #83#return; {20774#true} is VALID [2022-04-28 11:28:25,055 INFO L272 TraceCheckUtils]: 32: Hoare triple {20774#true} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {20774#true} is VALID [2022-04-28 11:28:25,055 INFO L290 TraceCheckUtils]: 33: Hoare triple {20774#true} ~cond := #in~cond; {20774#true} is VALID [2022-04-28 11:28:25,055 INFO L290 TraceCheckUtils]: 34: Hoare triple {20774#true} assume !(0 == ~cond); {20774#true} is VALID [2022-04-28 11:28:25,055 INFO L290 TraceCheckUtils]: 35: Hoare triple {20774#true} assume true; {20774#true} is VALID [2022-04-28 11:28:25,055 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {20774#true} {20774#true} #85#return; {20774#true} is VALID [2022-04-28 11:28:25,055 INFO L272 TraceCheckUtils]: 37: Hoare triple {20774#true} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {20774#true} is VALID [2022-04-28 11:28:25,055 INFO L290 TraceCheckUtils]: 38: Hoare triple {20774#true} ~cond := #in~cond; {20774#true} is VALID [2022-04-28 11:28:25,055 INFO L290 TraceCheckUtils]: 39: Hoare triple {20774#true} assume !(0 == ~cond); {20774#true} is VALID [2022-04-28 11:28:25,055 INFO L290 TraceCheckUtils]: 40: Hoare triple {20774#true} assume true; {20774#true} is VALID [2022-04-28 11:28:25,055 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {20774#true} {20774#true} #87#return; {20774#true} is VALID [2022-04-28 11:28:25,056 INFO L290 TraceCheckUtils]: 42: Hoare triple {20774#true} assume !!(~r~0 >= 2 * ~b~0); {20774#true} is VALID [2022-04-28 11:28:25,056 INFO L272 TraceCheckUtils]: 43: Hoare triple {20774#true} call __VERIFIER_assert((if ~r~0 >= 2 * ~y~0 * ~a~0 then 1 else 0)); {20774#true} is VALID [2022-04-28 11:28:25,056 INFO L290 TraceCheckUtils]: 44: Hoare triple {20774#true} ~cond := #in~cond; {20774#true} is VALID [2022-04-28 11:28:25,056 INFO L290 TraceCheckUtils]: 45: Hoare triple {20774#true} assume !(0 == ~cond); {20774#true} is VALID [2022-04-28 11:28:25,056 INFO L290 TraceCheckUtils]: 46: Hoare triple {20774#true} assume true; {20774#true} is VALID [2022-04-28 11:28:25,056 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {20774#true} {20774#true} #89#return; {20774#true} is VALID [2022-04-28 11:28:25,056 INFO L290 TraceCheckUtils]: 48: Hoare triple {20774#true} ~a~0 := 2 * ~a~0;~b~0 := 2 * ~b~0; {20774#true} is VALID [2022-04-28 11:28:25,056 INFO L290 TraceCheckUtils]: 49: Hoare triple {20774#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {20774#true} is VALID [2022-04-28 11:28:25,056 INFO L290 TraceCheckUtils]: 50: Hoare triple {20774#true} assume !!(#t~post7 < 10);havoc #t~post7; {20774#true} is VALID [2022-04-28 11:28:25,056 INFO L272 TraceCheckUtils]: 51: Hoare triple {20774#true} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {20774#true} is VALID [2022-04-28 11:28:25,056 INFO L290 TraceCheckUtils]: 52: Hoare triple {20774#true} ~cond := #in~cond; {20774#true} is VALID [2022-04-28 11:28:25,056 INFO L290 TraceCheckUtils]: 53: Hoare triple {20774#true} assume !(0 == ~cond); {20774#true} is VALID [2022-04-28 11:28:25,056 INFO L290 TraceCheckUtils]: 54: Hoare triple {20774#true} assume true; {20774#true} is VALID [2022-04-28 11:28:25,056 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {20774#true} {20774#true} #83#return; {20774#true} is VALID [2022-04-28 11:28:25,056 INFO L272 TraceCheckUtils]: 56: Hoare triple {20774#true} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {20774#true} is VALID [2022-04-28 11:28:25,056 INFO L290 TraceCheckUtils]: 57: Hoare triple {20774#true} ~cond := #in~cond; {20774#true} is VALID [2022-04-28 11:28:25,057 INFO L290 TraceCheckUtils]: 58: Hoare triple {20774#true} assume !(0 == ~cond); {20774#true} is VALID [2022-04-28 11:28:25,057 INFO L290 TraceCheckUtils]: 59: Hoare triple {20774#true} assume true; {20774#true} is VALID [2022-04-28 11:28:25,057 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {20774#true} {20774#true} #85#return; {20774#true} is VALID [2022-04-28 11:28:25,057 INFO L272 TraceCheckUtils]: 61: Hoare triple {20774#true} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {20774#true} is VALID [2022-04-28 11:28:25,057 INFO L290 TraceCheckUtils]: 62: Hoare triple {20774#true} ~cond := #in~cond; {20774#true} is VALID [2022-04-28 11:28:25,057 INFO L290 TraceCheckUtils]: 63: Hoare triple {20774#true} assume !(0 == ~cond); {20774#true} is VALID [2022-04-28 11:28:25,057 INFO L290 TraceCheckUtils]: 64: Hoare triple {20774#true} assume true; {20774#true} is VALID [2022-04-28 11:28:25,057 INFO L284 TraceCheckUtils]: 65: Hoare quadruple {20774#true} {20774#true} #87#return; {20774#true} is VALID [2022-04-28 11:28:25,057 INFO L290 TraceCheckUtils]: 66: Hoare triple {20774#true} assume !!(~r~0 >= 2 * ~b~0); {20774#true} is VALID [2022-04-28 11:28:25,057 INFO L272 TraceCheckUtils]: 67: Hoare triple {20774#true} call __VERIFIER_assert((if ~r~0 >= 2 * ~y~0 * ~a~0 then 1 else 0)); {20774#true} is VALID [2022-04-28 11:28:25,057 INFO L290 TraceCheckUtils]: 68: Hoare triple {20774#true} ~cond := #in~cond; {20774#true} is VALID [2022-04-28 11:28:25,057 INFO L290 TraceCheckUtils]: 69: Hoare triple {20774#true} assume !(0 == ~cond); {20774#true} is VALID [2022-04-28 11:28:25,057 INFO L290 TraceCheckUtils]: 70: Hoare triple {20774#true} assume true; {20774#true} is VALID [2022-04-28 11:28:25,057 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {20774#true} {20774#true} #89#return; {20774#true} is VALID [2022-04-28 11:28:25,057 INFO L290 TraceCheckUtils]: 72: Hoare triple {20774#true} ~a~0 := 2 * ~a~0;~b~0 := 2 * ~b~0; {20774#true} is VALID [2022-04-28 11:28:25,058 INFO L290 TraceCheckUtils]: 73: Hoare triple {20774#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {20774#true} is VALID [2022-04-28 11:28:25,058 INFO L290 TraceCheckUtils]: 74: Hoare triple {20774#true} assume !!(#t~post7 < 10);havoc #t~post7; {20774#true} is VALID [2022-04-28 11:28:25,058 INFO L272 TraceCheckUtils]: 75: Hoare triple {20774#true} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {20774#true} is VALID [2022-04-28 11:28:25,058 INFO L290 TraceCheckUtils]: 76: Hoare triple {20774#true} ~cond := #in~cond; {20774#true} is VALID [2022-04-28 11:28:25,058 INFO L290 TraceCheckUtils]: 77: Hoare triple {20774#true} assume !(0 == ~cond); {20774#true} is VALID [2022-04-28 11:28:25,058 INFO L290 TraceCheckUtils]: 78: Hoare triple {20774#true} assume true; {20774#true} is VALID [2022-04-28 11:28:25,058 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {20774#true} {20774#true} #83#return; {20774#true} is VALID [2022-04-28 11:28:25,058 INFO L272 TraceCheckUtils]: 80: Hoare triple {20774#true} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {20774#true} is VALID [2022-04-28 11:28:25,058 INFO L290 TraceCheckUtils]: 81: Hoare triple {20774#true} ~cond := #in~cond; {20774#true} is VALID [2022-04-28 11:28:25,058 INFO L290 TraceCheckUtils]: 82: Hoare triple {20774#true} assume !(0 == ~cond); {20774#true} is VALID [2022-04-28 11:28:25,058 INFO L290 TraceCheckUtils]: 83: Hoare triple {20774#true} assume true; {20774#true} is VALID [2022-04-28 11:28:25,058 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {20774#true} {20774#true} #85#return; {20774#true} is VALID [2022-04-28 11:28:25,058 INFO L272 TraceCheckUtils]: 85: Hoare triple {20774#true} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {20774#true} is VALID [2022-04-28 11:28:25,058 INFO L290 TraceCheckUtils]: 86: Hoare triple {20774#true} ~cond := #in~cond; {20774#true} is VALID [2022-04-28 11:28:25,058 INFO L290 TraceCheckUtils]: 87: Hoare triple {20774#true} assume !(0 == ~cond); {20774#true} is VALID [2022-04-28 11:28:25,059 INFO L290 TraceCheckUtils]: 88: Hoare triple {20774#true} assume true; {20774#true} is VALID [2022-04-28 11:28:25,059 INFO L284 TraceCheckUtils]: 89: Hoare quadruple {20774#true} {20774#true} #87#return; {20774#true} is VALID [2022-04-28 11:28:25,059 INFO L290 TraceCheckUtils]: 90: Hoare triple {20774#true} assume !(~r~0 >= 2 * ~b~0); {20774#true} is VALID [2022-04-28 11:28:25,059 INFO L290 TraceCheckUtils]: 91: Hoare triple {20774#true} ~r~0 := ~r~0 - ~b~0;~q~0 := ~q~0 + ~a~0; {20774#true} is VALID [2022-04-28 11:28:25,059 INFO L290 TraceCheckUtils]: 92: Hoare triple {20774#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {20774#true} is VALID [2022-04-28 11:28:25,059 INFO L290 TraceCheckUtils]: 93: Hoare triple {20774#true} assume !!(#t~post6 < 10);havoc #t~post6; {20774#true} is VALID [2022-04-28 11:28:25,059 INFO L272 TraceCheckUtils]: 94: Hoare triple {20774#true} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {20774#true} is VALID [2022-04-28 11:28:25,059 INFO L290 TraceCheckUtils]: 95: Hoare triple {20774#true} ~cond := #in~cond; {20774#true} is VALID [2022-04-28 11:28:25,059 INFO L290 TraceCheckUtils]: 96: Hoare triple {20774#true} assume !(0 == ~cond); {20774#true} is VALID [2022-04-28 11:28:25,059 INFO L290 TraceCheckUtils]: 97: Hoare triple {20774#true} assume true; {20774#true} is VALID [2022-04-28 11:28:25,059 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {20774#true} {20774#true} #79#return; {20774#true} is VALID [2022-04-28 11:28:25,059 INFO L272 TraceCheckUtils]: 99: Hoare triple {20774#true} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {20774#true} is VALID [2022-04-28 11:28:25,059 INFO L290 TraceCheckUtils]: 100: Hoare triple {20774#true} ~cond := #in~cond; {20774#true} is VALID [2022-04-28 11:28:25,059 INFO L290 TraceCheckUtils]: 101: Hoare triple {20774#true} assume !(0 == ~cond); {20774#true} is VALID [2022-04-28 11:28:25,059 INFO L290 TraceCheckUtils]: 102: Hoare triple {20774#true} assume true; {20774#true} is VALID [2022-04-28 11:28:25,060 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {20774#true} {20774#true} #81#return; {20774#true} is VALID [2022-04-28 11:28:25,060 INFO L290 TraceCheckUtils]: 104: Hoare triple {20774#true} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {20774#true} is VALID [2022-04-28 11:28:25,060 INFO L290 TraceCheckUtils]: 105: Hoare triple {20774#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {21094#(<= (+ |main_#t~post7| 1) ~counter~0)} is VALID [2022-04-28 11:28:25,061 INFO L290 TraceCheckUtils]: 106: Hoare triple {21094#(<= (+ |main_#t~post7| 1) ~counter~0)} assume !(#t~post7 < 10);havoc #t~post7; {21098#(<= 11 ~counter~0)} is VALID [2022-04-28 11:28:25,061 INFO L290 TraceCheckUtils]: 107: Hoare triple {21098#(<= 11 ~counter~0)} ~r~0 := ~r~0 - ~b~0;~q~0 := ~q~0 + ~a~0; {21098#(<= 11 ~counter~0)} is VALID [2022-04-28 11:28:25,061 INFO L290 TraceCheckUtils]: 108: Hoare triple {21098#(<= 11 ~counter~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {21105#(<= 11 |main_#t~post6|)} is VALID [2022-04-28 11:28:25,062 INFO L290 TraceCheckUtils]: 109: Hoare triple {21105#(<= 11 |main_#t~post6|)} assume !!(#t~post6 < 10);havoc #t~post6; {20775#false} is VALID [2022-04-28 11:28:25,062 INFO L272 TraceCheckUtils]: 110: Hoare triple {20775#false} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {20775#false} is VALID [2022-04-28 11:28:25,062 INFO L290 TraceCheckUtils]: 111: Hoare triple {20775#false} ~cond := #in~cond; {20775#false} is VALID [2022-04-28 11:28:25,062 INFO L290 TraceCheckUtils]: 112: Hoare triple {20775#false} assume !(0 == ~cond); {20775#false} is VALID [2022-04-28 11:28:25,062 INFO L290 TraceCheckUtils]: 113: Hoare triple {20775#false} assume true; {20775#false} is VALID [2022-04-28 11:28:25,062 INFO L284 TraceCheckUtils]: 114: Hoare quadruple {20775#false} {20775#false} #79#return; {20775#false} is VALID [2022-04-28 11:28:25,062 INFO L272 TraceCheckUtils]: 115: Hoare triple {20775#false} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {20775#false} is VALID [2022-04-28 11:28:25,062 INFO L290 TraceCheckUtils]: 116: Hoare triple {20775#false} ~cond := #in~cond; {20775#false} is VALID [2022-04-28 11:28:25,062 INFO L290 TraceCheckUtils]: 117: Hoare triple {20775#false} assume !(0 == ~cond); {20775#false} is VALID [2022-04-28 11:28:25,062 INFO L290 TraceCheckUtils]: 118: Hoare triple {20775#false} assume true; {20775#false} is VALID [2022-04-28 11:28:25,062 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {20775#false} {20775#false} #81#return; {20775#false} is VALID [2022-04-28 11:28:25,062 INFO L290 TraceCheckUtils]: 120: Hoare triple {20775#false} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {20775#false} is VALID [2022-04-28 11:28:25,062 INFO L290 TraceCheckUtils]: 121: Hoare triple {20775#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {20775#false} is VALID [2022-04-28 11:28:25,063 INFO L290 TraceCheckUtils]: 122: Hoare triple {20775#false} assume !(#t~post7 < 10);havoc #t~post7; {20775#false} is VALID [2022-04-28 11:28:25,063 INFO L290 TraceCheckUtils]: 123: Hoare triple {20775#false} ~r~0 := ~r~0 - ~b~0;~q~0 := ~q~0 + ~a~0; {20775#false} is VALID [2022-04-28 11:28:25,063 INFO L290 TraceCheckUtils]: 124: Hoare triple {20775#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {20775#false} is VALID [2022-04-28 11:28:25,063 INFO L290 TraceCheckUtils]: 125: Hoare triple {20775#false} assume !(#t~post6 < 10);havoc #t~post6; {20775#false} is VALID [2022-04-28 11:28:25,063 INFO L272 TraceCheckUtils]: 126: Hoare triple {20775#false} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {20775#false} is VALID [2022-04-28 11:28:25,063 INFO L290 TraceCheckUtils]: 127: Hoare triple {20775#false} ~cond := #in~cond; {20775#false} is VALID [2022-04-28 11:28:25,063 INFO L290 TraceCheckUtils]: 128: Hoare triple {20775#false} assume 0 == ~cond; {20775#false} is VALID [2022-04-28 11:28:25,063 INFO L290 TraceCheckUtils]: 129: Hoare triple {20775#false} assume !false; {20775#false} is VALID [2022-04-28 11:28:25,063 INFO L134 CoverageAnalysis]: Checked inductivity of 636 backedges. 180 proven. 0 refuted. 0 times theorem prover too weak. 456 trivial. 0 not checked. [2022-04-28 11:28:25,063 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 11:28:25,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:28:25,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665839241] [2022-04-28 11:28:25,064 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:28:25,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1613169868] [2022-04-28 11:28:25,064 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1613169868] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:28:25,064 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:28:25,064 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 11:28:25,064 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:28:25,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1768174863] [2022-04-28 11:28:25,064 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1768174863] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:28:25,064 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:28:25,064 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 11:28:25,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443572171] [2022-04-28 11:28:25,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:28:25,065 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 130 [2022-04-28 11:28:25,065 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:28:25,065 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-04-28 11:28:25,103 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:28:25,103 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 11:28:25,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:28:25,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 11:28:25,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 11:28:25,104 INFO L87 Difference]: Start difference. First operand 244 states and 298 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-04-28 11:28:25,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:28:25,553 INFO L93 Difference]: Finished difference Result 330 states and 410 transitions. [2022-04-28 11:28:25,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 11:28:25,553 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 130 [2022-04-28 11:28:25,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:28:25,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-04-28 11:28:25,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 82 transitions. [2022-04-28 11:28:25,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-04-28 11:28:25,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 82 transitions. [2022-04-28 11:28:25,555 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 82 transitions. [2022-04-28 11:28:25,618 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:28:25,622 INFO L225 Difference]: With dead ends: 330 [2022-04-28 11:28:25,622 INFO L226 Difference]: Without dead ends: 227 [2022-04-28 11:28:25,622 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 11:28:25,623 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 6 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 11:28:25,623 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 160 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 11:28:25,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2022-04-28 11:28:25,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 219. [2022-04-28 11:28:25,914 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:28:25,914 INFO L82 GeneralOperation]: Start isEquivalent. First operand 227 states. Second operand has 219 states, 140 states have (on average 1.1142857142857143) internal successors, (156), 142 states have internal predecessors, (156), 52 states have call successors, (52), 28 states have call predecessors, (52), 26 states have return successors, (49), 48 states have call predecessors, (49), 49 states have call successors, (49) [2022-04-28 11:28:25,915 INFO L74 IsIncluded]: Start isIncluded. First operand 227 states. Second operand has 219 states, 140 states have (on average 1.1142857142857143) internal successors, (156), 142 states have internal predecessors, (156), 52 states have call successors, (52), 28 states have call predecessors, (52), 26 states have return successors, (49), 48 states have call predecessors, (49), 49 states have call successors, (49) [2022-04-28 11:28:25,915 INFO L87 Difference]: Start difference. First operand 227 states. Second operand has 219 states, 140 states have (on average 1.1142857142857143) internal successors, (156), 142 states have internal predecessors, (156), 52 states have call successors, (52), 28 states have call predecessors, (52), 26 states have return successors, (49), 48 states have call predecessors, (49), 49 states have call successors, (49) [2022-04-28 11:28:25,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:28:25,918 INFO L93 Difference]: Finished difference Result 227 states and 264 transitions. [2022-04-28 11:28:25,918 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 264 transitions. [2022-04-28 11:28:25,919 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:28:25,919 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:28:25,919 INFO L74 IsIncluded]: Start isIncluded. First operand has 219 states, 140 states have (on average 1.1142857142857143) internal successors, (156), 142 states have internal predecessors, (156), 52 states have call successors, (52), 28 states have call predecessors, (52), 26 states have return successors, (49), 48 states have call predecessors, (49), 49 states have call successors, (49) Second operand 227 states. [2022-04-28 11:28:25,919 INFO L87 Difference]: Start difference. First operand has 219 states, 140 states have (on average 1.1142857142857143) internal successors, (156), 142 states have internal predecessors, (156), 52 states have call successors, (52), 28 states have call predecessors, (52), 26 states have return successors, (49), 48 states have call predecessors, (49), 49 states have call successors, (49) Second operand 227 states. [2022-04-28 11:28:25,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:28:25,922 INFO L93 Difference]: Finished difference Result 227 states and 264 transitions. [2022-04-28 11:28:25,922 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 264 transitions. [2022-04-28 11:28:25,923 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:28:25,923 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:28:25,923 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:28:25,923 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:28:25,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 140 states have (on average 1.1142857142857143) internal successors, (156), 142 states have internal predecessors, (156), 52 states have call successors, (52), 28 states have call predecessors, (52), 26 states have return successors, (49), 48 states have call predecessors, (49), 49 states have call successors, (49) [2022-04-28 11:28:25,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 257 transitions. [2022-04-28 11:28:25,927 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 257 transitions. Word has length 130 [2022-04-28 11:28:25,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:28:25,927 INFO L495 AbstractCegarLoop]: Abstraction has 219 states and 257 transitions. [2022-04-28 11:28:25,927 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-04-28 11:28:25,927 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 219 states and 257 transitions. [2022-04-28 11:28:26,259 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 257 edges. 257 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:28:26,259 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 257 transitions. [2022-04-28 11:28:26,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-04-28 11:28:26,275 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:28:26,275 INFO L195 NwaCegarLoop]: trace histogram [20, 19, 19, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:28:26,291 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-04-28 11:28:26,476 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:28:26,476 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:28:26,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:28:26,476 INFO L85 PathProgramCache]: Analyzing trace with hash 518951120, now seen corresponding path program 7 times [2022-04-28 11:28:26,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:28:26,477 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1112480360] [2022-04-28 11:29:05,800 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:29:05,800 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:29:05,800 INFO L85 PathProgramCache]: Analyzing trace with hash 518951120, now seen corresponding path program 8 times [2022-04-28 11:29:05,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:29:05,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169915776] [2022-04-28 11:29:05,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:29:05,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:29:05,812 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:29:05,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1481866173] [2022-04-28 11:29:05,812 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:29:05,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:29:05,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:29:05,813 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 11:29:05,814 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-04-28 11:29:05,895 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 11:29:05,895 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:29:05,896 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-28 11:29:05,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:29:05,915 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:29:06,379 INFO L272 TraceCheckUtils]: 0: Hoare triple {22722#true} call ULTIMATE.init(); {22722#true} is VALID [2022-04-28 11:29:06,379 INFO L290 TraceCheckUtils]: 1: Hoare triple {22722#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; {22730#(<= ~counter~0 0)} is VALID [2022-04-28 11:29:06,380 INFO L290 TraceCheckUtils]: 2: Hoare triple {22730#(<= ~counter~0 0)} assume true; {22730#(<= ~counter~0 0)} is VALID [2022-04-28 11:29:06,380 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22730#(<= ~counter~0 0)} {22722#true} #93#return; {22730#(<= ~counter~0 0)} is VALID [2022-04-28 11:29:06,380 INFO L272 TraceCheckUtils]: 4: Hoare triple {22730#(<= ~counter~0 0)} call #t~ret8 := main(); {22730#(<= ~counter~0 0)} is VALID [2022-04-28 11:29:06,381 INFO L290 TraceCheckUtils]: 5: Hoare triple {22730#(<= ~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; {22730#(<= ~counter~0 0)} is VALID [2022-04-28 11:29:06,381 INFO L272 TraceCheckUtils]: 6: Hoare triple {22730#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {22730#(<= ~counter~0 0)} is VALID [2022-04-28 11:29:06,381 INFO L290 TraceCheckUtils]: 7: Hoare triple {22730#(<= ~counter~0 0)} ~cond := #in~cond; {22730#(<= ~counter~0 0)} is VALID [2022-04-28 11:29:06,381 INFO L290 TraceCheckUtils]: 8: Hoare triple {22730#(<= ~counter~0 0)} assume !(0 == ~cond); {22730#(<= ~counter~0 0)} is VALID [2022-04-28 11:29:06,382 INFO L290 TraceCheckUtils]: 9: Hoare triple {22730#(<= ~counter~0 0)} assume true; {22730#(<= ~counter~0 0)} is VALID [2022-04-28 11:29:06,382 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {22730#(<= ~counter~0 0)} {22730#(<= ~counter~0 0)} #77#return; {22730#(<= ~counter~0 0)} is VALID [2022-04-28 11:29:06,382 INFO L290 TraceCheckUtils]: 11: Hoare triple {22730#(<= ~counter~0 0)} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {22730#(<= ~counter~0 0)} is VALID [2022-04-28 11:29:06,383 INFO L290 TraceCheckUtils]: 12: Hoare triple {22730#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {22764#(<= ~counter~0 1)} is VALID [2022-04-28 11:29:06,383 INFO L290 TraceCheckUtils]: 13: Hoare triple {22764#(<= ~counter~0 1)} assume !!(#t~post6 < 10);havoc #t~post6; {22764#(<= ~counter~0 1)} is VALID [2022-04-28 11:29:06,384 INFO L272 TraceCheckUtils]: 14: Hoare triple {22764#(<= ~counter~0 1)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {22764#(<= ~counter~0 1)} is VALID [2022-04-28 11:29:06,384 INFO L290 TraceCheckUtils]: 15: Hoare triple {22764#(<= ~counter~0 1)} ~cond := #in~cond; {22764#(<= ~counter~0 1)} is VALID [2022-04-28 11:29:06,384 INFO L290 TraceCheckUtils]: 16: Hoare triple {22764#(<= ~counter~0 1)} assume !(0 == ~cond); {22764#(<= ~counter~0 1)} is VALID [2022-04-28 11:29:06,385 INFO L290 TraceCheckUtils]: 17: Hoare triple {22764#(<= ~counter~0 1)} assume true; {22764#(<= ~counter~0 1)} is VALID [2022-04-28 11:29:06,385 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {22764#(<= ~counter~0 1)} {22764#(<= ~counter~0 1)} #79#return; {22764#(<= ~counter~0 1)} is VALID [2022-04-28 11:29:06,385 INFO L272 TraceCheckUtils]: 19: Hoare triple {22764#(<= ~counter~0 1)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {22764#(<= ~counter~0 1)} is VALID [2022-04-28 11:29:06,386 INFO L290 TraceCheckUtils]: 20: Hoare triple {22764#(<= ~counter~0 1)} ~cond := #in~cond; {22764#(<= ~counter~0 1)} is VALID [2022-04-28 11:29:06,386 INFO L290 TraceCheckUtils]: 21: Hoare triple {22764#(<= ~counter~0 1)} assume !(0 == ~cond); {22764#(<= ~counter~0 1)} is VALID [2022-04-28 11:29:06,386 INFO L290 TraceCheckUtils]: 22: Hoare triple {22764#(<= ~counter~0 1)} assume true; {22764#(<= ~counter~0 1)} is VALID [2022-04-28 11:29:06,387 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {22764#(<= ~counter~0 1)} {22764#(<= ~counter~0 1)} #81#return; {22764#(<= ~counter~0 1)} is VALID [2022-04-28 11:29:06,387 INFO L290 TraceCheckUtils]: 24: Hoare triple {22764#(<= ~counter~0 1)} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {22764#(<= ~counter~0 1)} is VALID [2022-04-28 11:29:06,387 INFO L290 TraceCheckUtils]: 25: Hoare triple {22764#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {22804#(<= ~counter~0 2)} is VALID [2022-04-28 11:29:06,388 INFO L290 TraceCheckUtils]: 26: Hoare triple {22804#(<= ~counter~0 2)} assume !!(#t~post7 < 10);havoc #t~post7; {22804#(<= ~counter~0 2)} is VALID [2022-04-28 11:29:06,388 INFO L272 TraceCheckUtils]: 27: Hoare triple {22804#(<= ~counter~0 2)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {22804#(<= ~counter~0 2)} is VALID [2022-04-28 11:29:06,388 INFO L290 TraceCheckUtils]: 28: Hoare triple {22804#(<= ~counter~0 2)} ~cond := #in~cond; {22804#(<= ~counter~0 2)} is VALID [2022-04-28 11:29:06,389 INFO L290 TraceCheckUtils]: 29: Hoare triple {22804#(<= ~counter~0 2)} assume !(0 == ~cond); {22804#(<= ~counter~0 2)} is VALID [2022-04-28 11:29:06,389 INFO L290 TraceCheckUtils]: 30: Hoare triple {22804#(<= ~counter~0 2)} assume true; {22804#(<= ~counter~0 2)} is VALID [2022-04-28 11:29:06,389 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {22804#(<= ~counter~0 2)} {22804#(<= ~counter~0 2)} #83#return; {22804#(<= ~counter~0 2)} is VALID [2022-04-28 11:29:06,390 INFO L272 TraceCheckUtils]: 32: Hoare triple {22804#(<= ~counter~0 2)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {22804#(<= ~counter~0 2)} is VALID [2022-04-28 11:29:06,390 INFO L290 TraceCheckUtils]: 33: Hoare triple {22804#(<= ~counter~0 2)} ~cond := #in~cond; {22804#(<= ~counter~0 2)} is VALID [2022-04-28 11:29:06,390 INFO L290 TraceCheckUtils]: 34: Hoare triple {22804#(<= ~counter~0 2)} assume !(0 == ~cond); {22804#(<= ~counter~0 2)} is VALID [2022-04-28 11:29:06,390 INFO L290 TraceCheckUtils]: 35: Hoare triple {22804#(<= ~counter~0 2)} assume true; {22804#(<= ~counter~0 2)} is VALID [2022-04-28 11:29:06,391 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {22804#(<= ~counter~0 2)} {22804#(<= ~counter~0 2)} #85#return; {22804#(<= ~counter~0 2)} is VALID [2022-04-28 11:29:06,391 INFO L272 TraceCheckUtils]: 37: Hoare triple {22804#(<= ~counter~0 2)} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {22804#(<= ~counter~0 2)} is VALID [2022-04-28 11:29:06,392 INFO L290 TraceCheckUtils]: 38: Hoare triple {22804#(<= ~counter~0 2)} ~cond := #in~cond; {22804#(<= ~counter~0 2)} is VALID [2022-04-28 11:29:06,392 INFO L290 TraceCheckUtils]: 39: Hoare triple {22804#(<= ~counter~0 2)} assume !(0 == ~cond); {22804#(<= ~counter~0 2)} is VALID [2022-04-28 11:29:06,392 INFO L290 TraceCheckUtils]: 40: Hoare triple {22804#(<= ~counter~0 2)} assume true; {22804#(<= ~counter~0 2)} is VALID [2022-04-28 11:29:06,392 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {22804#(<= ~counter~0 2)} {22804#(<= ~counter~0 2)} #87#return; {22804#(<= ~counter~0 2)} is VALID [2022-04-28 11:29:06,393 INFO L290 TraceCheckUtils]: 42: Hoare triple {22804#(<= ~counter~0 2)} assume !!(~r~0 >= 2 * ~b~0); {22804#(<= ~counter~0 2)} is VALID [2022-04-28 11:29:06,393 INFO L272 TraceCheckUtils]: 43: Hoare triple {22804#(<= ~counter~0 2)} call __VERIFIER_assert((if ~r~0 >= 2 * ~y~0 * ~a~0 then 1 else 0)); {22804#(<= ~counter~0 2)} is VALID [2022-04-28 11:29:06,393 INFO L290 TraceCheckUtils]: 44: Hoare triple {22804#(<= ~counter~0 2)} ~cond := #in~cond; {22804#(<= ~counter~0 2)} is VALID [2022-04-28 11:29:06,394 INFO L290 TraceCheckUtils]: 45: Hoare triple {22804#(<= ~counter~0 2)} assume !(0 == ~cond); {22804#(<= ~counter~0 2)} is VALID [2022-04-28 11:29:06,394 INFO L290 TraceCheckUtils]: 46: Hoare triple {22804#(<= ~counter~0 2)} assume true; {22804#(<= ~counter~0 2)} is VALID [2022-04-28 11:29:06,394 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {22804#(<= ~counter~0 2)} {22804#(<= ~counter~0 2)} #89#return; {22804#(<= ~counter~0 2)} is VALID [2022-04-28 11:29:06,394 INFO L290 TraceCheckUtils]: 48: Hoare triple {22804#(<= ~counter~0 2)} ~a~0 := 2 * ~a~0;~b~0 := 2 * ~b~0; {22804#(<= ~counter~0 2)} is VALID [2022-04-28 11:29:06,395 INFO L290 TraceCheckUtils]: 49: Hoare triple {22804#(<= ~counter~0 2)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {22877#(<= ~counter~0 3)} is VALID [2022-04-28 11:29:06,395 INFO L290 TraceCheckUtils]: 50: Hoare triple {22877#(<= ~counter~0 3)} assume !!(#t~post7 < 10);havoc #t~post7; {22877#(<= ~counter~0 3)} is VALID [2022-04-28 11:29:06,396 INFO L272 TraceCheckUtils]: 51: Hoare triple {22877#(<= ~counter~0 3)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {22877#(<= ~counter~0 3)} is VALID [2022-04-28 11:29:06,396 INFO L290 TraceCheckUtils]: 52: Hoare triple {22877#(<= ~counter~0 3)} ~cond := #in~cond; {22877#(<= ~counter~0 3)} is VALID [2022-04-28 11:29:06,396 INFO L290 TraceCheckUtils]: 53: Hoare triple {22877#(<= ~counter~0 3)} assume !(0 == ~cond); {22877#(<= ~counter~0 3)} is VALID [2022-04-28 11:29:06,396 INFO L290 TraceCheckUtils]: 54: Hoare triple {22877#(<= ~counter~0 3)} assume true; {22877#(<= ~counter~0 3)} is VALID [2022-04-28 11:29:06,397 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {22877#(<= ~counter~0 3)} {22877#(<= ~counter~0 3)} #83#return; {22877#(<= ~counter~0 3)} is VALID [2022-04-28 11:29:06,397 INFO L272 TraceCheckUtils]: 56: Hoare triple {22877#(<= ~counter~0 3)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {22877#(<= ~counter~0 3)} is VALID [2022-04-28 11:29:06,398 INFO L290 TraceCheckUtils]: 57: Hoare triple {22877#(<= ~counter~0 3)} ~cond := #in~cond; {22877#(<= ~counter~0 3)} is VALID [2022-04-28 11:29:06,398 INFO L290 TraceCheckUtils]: 58: Hoare triple {22877#(<= ~counter~0 3)} assume !(0 == ~cond); {22877#(<= ~counter~0 3)} is VALID [2022-04-28 11:29:06,398 INFO L290 TraceCheckUtils]: 59: Hoare triple {22877#(<= ~counter~0 3)} assume true; {22877#(<= ~counter~0 3)} is VALID [2022-04-28 11:29:06,399 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {22877#(<= ~counter~0 3)} {22877#(<= ~counter~0 3)} #85#return; {22877#(<= ~counter~0 3)} is VALID [2022-04-28 11:29:06,399 INFO L272 TraceCheckUtils]: 61: Hoare triple {22877#(<= ~counter~0 3)} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {22877#(<= ~counter~0 3)} is VALID [2022-04-28 11:29:06,399 INFO L290 TraceCheckUtils]: 62: Hoare triple {22877#(<= ~counter~0 3)} ~cond := #in~cond; {22877#(<= ~counter~0 3)} is VALID [2022-04-28 11:29:06,399 INFO L290 TraceCheckUtils]: 63: Hoare triple {22877#(<= ~counter~0 3)} assume !(0 == ~cond); {22877#(<= ~counter~0 3)} is VALID [2022-04-28 11:29:06,400 INFO L290 TraceCheckUtils]: 64: Hoare triple {22877#(<= ~counter~0 3)} assume true; {22877#(<= ~counter~0 3)} is VALID [2022-04-28 11:29:06,400 INFO L284 TraceCheckUtils]: 65: Hoare quadruple {22877#(<= ~counter~0 3)} {22877#(<= ~counter~0 3)} #87#return; {22877#(<= ~counter~0 3)} is VALID [2022-04-28 11:29:06,400 INFO L290 TraceCheckUtils]: 66: Hoare triple {22877#(<= ~counter~0 3)} assume !!(~r~0 >= 2 * ~b~0); {22877#(<= ~counter~0 3)} is VALID [2022-04-28 11:29:06,401 INFO L272 TraceCheckUtils]: 67: Hoare triple {22877#(<= ~counter~0 3)} call __VERIFIER_assert((if ~r~0 >= 2 * ~y~0 * ~a~0 then 1 else 0)); {22877#(<= ~counter~0 3)} is VALID [2022-04-28 11:29:06,401 INFO L290 TraceCheckUtils]: 68: Hoare triple {22877#(<= ~counter~0 3)} ~cond := #in~cond; {22877#(<= ~counter~0 3)} is VALID [2022-04-28 11:29:06,401 INFO L290 TraceCheckUtils]: 69: Hoare triple {22877#(<= ~counter~0 3)} assume !(0 == ~cond); {22877#(<= ~counter~0 3)} is VALID [2022-04-28 11:29:06,401 INFO L290 TraceCheckUtils]: 70: Hoare triple {22877#(<= ~counter~0 3)} assume true; {22877#(<= ~counter~0 3)} is VALID [2022-04-28 11:29:06,402 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {22877#(<= ~counter~0 3)} {22877#(<= ~counter~0 3)} #89#return; {22877#(<= ~counter~0 3)} is VALID [2022-04-28 11:29:06,402 INFO L290 TraceCheckUtils]: 72: Hoare triple {22877#(<= ~counter~0 3)} ~a~0 := 2 * ~a~0;~b~0 := 2 * ~b~0; {22877#(<= ~counter~0 3)} is VALID [2022-04-28 11:29:06,403 INFO L290 TraceCheckUtils]: 73: Hoare triple {22877#(<= ~counter~0 3)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {22950#(<= ~counter~0 4)} is VALID [2022-04-28 11:29:06,403 INFO L290 TraceCheckUtils]: 74: Hoare triple {22950#(<= ~counter~0 4)} assume !!(#t~post7 < 10);havoc #t~post7; {22950#(<= ~counter~0 4)} is VALID [2022-04-28 11:29:06,403 INFO L272 TraceCheckUtils]: 75: Hoare triple {22950#(<= ~counter~0 4)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {22950#(<= ~counter~0 4)} is VALID [2022-04-28 11:29:06,404 INFO L290 TraceCheckUtils]: 76: Hoare triple {22950#(<= ~counter~0 4)} ~cond := #in~cond; {22950#(<= ~counter~0 4)} is VALID [2022-04-28 11:29:06,404 INFO L290 TraceCheckUtils]: 77: Hoare triple {22950#(<= ~counter~0 4)} assume !(0 == ~cond); {22950#(<= ~counter~0 4)} is VALID [2022-04-28 11:29:06,404 INFO L290 TraceCheckUtils]: 78: Hoare triple {22950#(<= ~counter~0 4)} assume true; {22950#(<= ~counter~0 4)} is VALID [2022-04-28 11:29:06,404 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {22950#(<= ~counter~0 4)} {22950#(<= ~counter~0 4)} #83#return; {22950#(<= ~counter~0 4)} is VALID [2022-04-28 11:29:06,405 INFO L272 TraceCheckUtils]: 80: Hoare triple {22950#(<= ~counter~0 4)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {22950#(<= ~counter~0 4)} is VALID [2022-04-28 11:29:06,405 INFO L290 TraceCheckUtils]: 81: Hoare triple {22950#(<= ~counter~0 4)} ~cond := #in~cond; {22950#(<= ~counter~0 4)} is VALID [2022-04-28 11:29:06,405 INFO L290 TraceCheckUtils]: 82: Hoare triple {22950#(<= ~counter~0 4)} assume !(0 == ~cond); {22950#(<= ~counter~0 4)} is VALID [2022-04-28 11:29:06,406 INFO L290 TraceCheckUtils]: 83: Hoare triple {22950#(<= ~counter~0 4)} assume true; {22950#(<= ~counter~0 4)} is VALID [2022-04-28 11:29:06,406 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {22950#(<= ~counter~0 4)} {22950#(<= ~counter~0 4)} #85#return; {22950#(<= ~counter~0 4)} is VALID [2022-04-28 11:29:06,407 INFO L272 TraceCheckUtils]: 85: Hoare triple {22950#(<= ~counter~0 4)} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {22950#(<= ~counter~0 4)} is VALID [2022-04-28 11:29:06,407 INFO L290 TraceCheckUtils]: 86: Hoare triple {22950#(<= ~counter~0 4)} ~cond := #in~cond; {22950#(<= ~counter~0 4)} is VALID [2022-04-28 11:29:06,407 INFO L290 TraceCheckUtils]: 87: Hoare triple {22950#(<= ~counter~0 4)} assume !(0 == ~cond); {22950#(<= ~counter~0 4)} is VALID [2022-04-28 11:29:06,407 INFO L290 TraceCheckUtils]: 88: Hoare triple {22950#(<= ~counter~0 4)} assume true; {22950#(<= ~counter~0 4)} is VALID [2022-04-28 11:29:06,408 INFO L284 TraceCheckUtils]: 89: Hoare quadruple {22950#(<= ~counter~0 4)} {22950#(<= ~counter~0 4)} #87#return; {22950#(<= ~counter~0 4)} is VALID [2022-04-28 11:29:06,408 INFO L290 TraceCheckUtils]: 90: Hoare triple {22950#(<= ~counter~0 4)} assume !(~r~0 >= 2 * ~b~0); {22950#(<= ~counter~0 4)} is VALID [2022-04-28 11:29:06,408 INFO L290 TraceCheckUtils]: 91: Hoare triple {22950#(<= ~counter~0 4)} ~r~0 := ~r~0 - ~b~0;~q~0 := ~q~0 + ~a~0; {22950#(<= ~counter~0 4)} is VALID [2022-04-28 11:29:06,409 INFO L290 TraceCheckUtils]: 92: Hoare triple {22950#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {23008#(<= ~counter~0 5)} is VALID [2022-04-28 11:29:06,409 INFO L290 TraceCheckUtils]: 93: Hoare triple {23008#(<= ~counter~0 5)} assume !!(#t~post6 < 10);havoc #t~post6; {23008#(<= ~counter~0 5)} is VALID [2022-04-28 11:29:06,409 INFO L272 TraceCheckUtils]: 94: Hoare triple {23008#(<= ~counter~0 5)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {23008#(<= ~counter~0 5)} is VALID [2022-04-28 11:29:06,410 INFO L290 TraceCheckUtils]: 95: Hoare triple {23008#(<= ~counter~0 5)} ~cond := #in~cond; {23008#(<= ~counter~0 5)} is VALID [2022-04-28 11:29:06,410 INFO L290 TraceCheckUtils]: 96: Hoare triple {23008#(<= ~counter~0 5)} assume !(0 == ~cond); {23008#(<= ~counter~0 5)} is VALID [2022-04-28 11:29:06,410 INFO L290 TraceCheckUtils]: 97: Hoare triple {23008#(<= ~counter~0 5)} assume true; {23008#(<= ~counter~0 5)} is VALID [2022-04-28 11:29:06,410 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {23008#(<= ~counter~0 5)} {23008#(<= ~counter~0 5)} #79#return; {23008#(<= ~counter~0 5)} is VALID [2022-04-28 11:29:06,411 INFO L272 TraceCheckUtils]: 99: Hoare triple {23008#(<= ~counter~0 5)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {23008#(<= ~counter~0 5)} is VALID [2022-04-28 11:29:06,411 INFO L290 TraceCheckUtils]: 100: Hoare triple {23008#(<= ~counter~0 5)} ~cond := #in~cond; {23008#(<= ~counter~0 5)} is VALID [2022-04-28 11:29:06,413 INFO L290 TraceCheckUtils]: 101: Hoare triple {23008#(<= ~counter~0 5)} assume !(0 == ~cond); {23008#(<= ~counter~0 5)} is VALID [2022-04-28 11:29:06,413 INFO L290 TraceCheckUtils]: 102: Hoare triple {23008#(<= ~counter~0 5)} assume true; {23008#(<= ~counter~0 5)} is VALID [2022-04-28 11:29:06,414 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {23008#(<= ~counter~0 5)} {23008#(<= ~counter~0 5)} #81#return; {23008#(<= ~counter~0 5)} is VALID [2022-04-28 11:29:06,414 INFO L290 TraceCheckUtils]: 104: Hoare triple {23008#(<= ~counter~0 5)} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {23008#(<= ~counter~0 5)} is VALID [2022-04-28 11:29:06,415 INFO L290 TraceCheckUtils]: 105: Hoare triple {23008#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {23048#(<= ~counter~0 6)} is VALID [2022-04-28 11:29:06,415 INFO L290 TraceCheckUtils]: 106: Hoare triple {23048#(<= ~counter~0 6)} assume !!(#t~post7 < 10);havoc #t~post7; {23048#(<= ~counter~0 6)} is VALID [2022-04-28 11:29:06,415 INFO L272 TraceCheckUtils]: 107: Hoare triple {23048#(<= ~counter~0 6)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {23048#(<= ~counter~0 6)} is VALID [2022-04-28 11:29:06,416 INFO L290 TraceCheckUtils]: 108: Hoare triple {23048#(<= ~counter~0 6)} ~cond := #in~cond; {23048#(<= ~counter~0 6)} is VALID [2022-04-28 11:29:06,416 INFO L290 TraceCheckUtils]: 109: Hoare triple {23048#(<= ~counter~0 6)} assume !(0 == ~cond); {23048#(<= ~counter~0 6)} is VALID [2022-04-28 11:29:06,416 INFO L290 TraceCheckUtils]: 110: Hoare triple {23048#(<= ~counter~0 6)} assume true; {23048#(<= ~counter~0 6)} is VALID [2022-04-28 11:29:06,416 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {23048#(<= ~counter~0 6)} {23048#(<= ~counter~0 6)} #83#return; {23048#(<= ~counter~0 6)} is VALID [2022-04-28 11:29:06,417 INFO L272 TraceCheckUtils]: 112: Hoare triple {23048#(<= ~counter~0 6)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {23048#(<= ~counter~0 6)} is VALID [2022-04-28 11:29:06,417 INFO L290 TraceCheckUtils]: 113: Hoare triple {23048#(<= ~counter~0 6)} ~cond := #in~cond; {23048#(<= ~counter~0 6)} is VALID [2022-04-28 11:29:06,417 INFO L290 TraceCheckUtils]: 114: Hoare triple {23048#(<= ~counter~0 6)} assume !(0 == ~cond); {23048#(<= ~counter~0 6)} is VALID [2022-04-28 11:29:06,418 INFO L290 TraceCheckUtils]: 115: Hoare triple {23048#(<= ~counter~0 6)} assume true; {23048#(<= ~counter~0 6)} is VALID [2022-04-28 11:29:06,418 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {23048#(<= ~counter~0 6)} {23048#(<= ~counter~0 6)} #85#return; {23048#(<= ~counter~0 6)} is VALID [2022-04-28 11:29:06,419 INFO L272 TraceCheckUtils]: 117: Hoare triple {23048#(<= ~counter~0 6)} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {23048#(<= ~counter~0 6)} is VALID [2022-04-28 11:29:06,419 INFO L290 TraceCheckUtils]: 118: Hoare triple {23048#(<= ~counter~0 6)} ~cond := #in~cond; {23048#(<= ~counter~0 6)} is VALID [2022-04-28 11:29:06,419 INFO L290 TraceCheckUtils]: 119: Hoare triple {23048#(<= ~counter~0 6)} assume !(0 == ~cond); {23048#(<= ~counter~0 6)} is VALID [2022-04-28 11:29:06,419 INFO L290 TraceCheckUtils]: 120: Hoare triple {23048#(<= ~counter~0 6)} assume true; {23048#(<= ~counter~0 6)} is VALID [2022-04-28 11:29:06,420 INFO L284 TraceCheckUtils]: 121: Hoare quadruple {23048#(<= ~counter~0 6)} {23048#(<= ~counter~0 6)} #87#return; {23048#(<= ~counter~0 6)} is VALID [2022-04-28 11:29:06,420 INFO L290 TraceCheckUtils]: 122: Hoare triple {23048#(<= ~counter~0 6)} assume !!(~r~0 >= 2 * ~b~0); {23048#(<= ~counter~0 6)} is VALID [2022-04-28 11:29:06,420 INFO L272 TraceCheckUtils]: 123: Hoare triple {23048#(<= ~counter~0 6)} call __VERIFIER_assert((if ~r~0 >= 2 * ~y~0 * ~a~0 then 1 else 0)); {23048#(<= ~counter~0 6)} is VALID [2022-04-28 11:29:06,421 INFO L290 TraceCheckUtils]: 124: Hoare triple {23048#(<= ~counter~0 6)} ~cond := #in~cond; {23048#(<= ~counter~0 6)} is VALID [2022-04-28 11:29:06,421 INFO L290 TraceCheckUtils]: 125: Hoare triple {23048#(<= ~counter~0 6)} assume !(0 == ~cond); {23048#(<= ~counter~0 6)} is VALID [2022-04-28 11:29:06,421 INFO L290 TraceCheckUtils]: 126: Hoare triple {23048#(<= ~counter~0 6)} assume true; {23048#(<= ~counter~0 6)} is VALID [2022-04-28 11:29:06,422 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {23048#(<= ~counter~0 6)} {23048#(<= ~counter~0 6)} #89#return; {23048#(<= ~counter~0 6)} is VALID [2022-04-28 11:29:06,422 INFO L290 TraceCheckUtils]: 128: Hoare triple {23048#(<= ~counter~0 6)} ~a~0 := 2 * ~a~0;~b~0 := 2 * ~b~0; {23048#(<= ~counter~0 6)} is VALID [2022-04-28 11:29:06,422 INFO L290 TraceCheckUtils]: 129: Hoare triple {23048#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {23121#(<= |main_#t~post7| 6)} is VALID [2022-04-28 11:29:06,422 INFO L290 TraceCheckUtils]: 130: Hoare triple {23121#(<= |main_#t~post7| 6)} assume !(#t~post7 < 10);havoc #t~post7; {22723#false} is VALID [2022-04-28 11:29:06,423 INFO L290 TraceCheckUtils]: 131: Hoare triple {22723#false} ~r~0 := ~r~0 - ~b~0;~q~0 := ~q~0 + ~a~0; {22723#false} is VALID [2022-04-28 11:29:06,423 INFO L290 TraceCheckUtils]: 132: Hoare triple {22723#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {22723#false} is VALID [2022-04-28 11:29:06,423 INFO L290 TraceCheckUtils]: 133: Hoare triple {22723#false} assume !(#t~post6 < 10);havoc #t~post6; {22723#false} is VALID [2022-04-28 11:29:06,423 INFO L272 TraceCheckUtils]: 134: Hoare triple {22723#false} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {22723#false} is VALID [2022-04-28 11:29:06,423 INFO L290 TraceCheckUtils]: 135: Hoare triple {22723#false} ~cond := #in~cond; {22723#false} is VALID [2022-04-28 11:29:06,423 INFO L290 TraceCheckUtils]: 136: Hoare triple {22723#false} assume 0 == ~cond; {22723#false} is VALID [2022-04-28 11:29:06,423 INFO L290 TraceCheckUtils]: 137: Hoare triple {22723#false} assume !false; {22723#false} is VALID [2022-04-28 11:29:06,423 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 43 proven. 647 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2022-04-28 11:29:06,424 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:29:06,876 INFO L290 TraceCheckUtils]: 137: Hoare triple {22723#false} assume !false; {22723#false} is VALID [2022-04-28 11:29:06,876 INFO L290 TraceCheckUtils]: 136: Hoare triple {22723#false} assume 0 == ~cond; {22723#false} is VALID [2022-04-28 11:29:06,876 INFO L290 TraceCheckUtils]: 135: Hoare triple {22723#false} ~cond := #in~cond; {22723#false} is VALID [2022-04-28 11:29:06,876 INFO L272 TraceCheckUtils]: 134: Hoare triple {22723#false} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {22723#false} is VALID [2022-04-28 11:29:06,876 INFO L290 TraceCheckUtils]: 133: Hoare triple {22723#false} assume !(#t~post6 < 10);havoc #t~post6; {22723#false} is VALID [2022-04-28 11:29:06,877 INFO L290 TraceCheckUtils]: 132: Hoare triple {22723#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {22723#false} is VALID [2022-04-28 11:29:06,877 INFO L290 TraceCheckUtils]: 131: Hoare triple {22723#false} ~r~0 := ~r~0 - ~b~0;~q~0 := ~q~0 + ~a~0; {22723#false} is VALID [2022-04-28 11:29:06,877 INFO L290 TraceCheckUtils]: 130: Hoare triple {23167#(< |main_#t~post7| 10)} assume !(#t~post7 < 10);havoc #t~post7; {22723#false} is VALID [2022-04-28 11:29:06,877 INFO L290 TraceCheckUtils]: 129: Hoare triple {23171#(< ~counter~0 10)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {23167#(< |main_#t~post7| 10)} is VALID [2022-04-28 11:29:06,877 INFO L290 TraceCheckUtils]: 128: Hoare triple {23171#(< ~counter~0 10)} ~a~0 := 2 * ~a~0;~b~0 := 2 * ~b~0; {23171#(< ~counter~0 10)} is VALID [2022-04-28 11:29:06,878 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {22722#true} {23171#(< ~counter~0 10)} #89#return; {23171#(< ~counter~0 10)} is VALID [2022-04-28 11:29:06,878 INFO L290 TraceCheckUtils]: 126: Hoare triple {22722#true} assume true; {22722#true} is VALID [2022-04-28 11:29:06,878 INFO L290 TraceCheckUtils]: 125: Hoare triple {22722#true} assume !(0 == ~cond); {22722#true} is VALID [2022-04-28 11:29:06,878 INFO L290 TraceCheckUtils]: 124: Hoare triple {22722#true} ~cond := #in~cond; {22722#true} is VALID [2022-04-28 11:29:06,878 INFO L272 TraceCheckUtils]: 123: Hoare triple {23171#(< ~counter~0 10)} call __VERIFIER_assert((if ~r~0 >= 2 * ~y~0 * ~a~0 then 1 else 0)); {22722#true} is VALID [2022-04-28 11:29:06,878 INFO L290 TraceCheckUtils]: 122: Hoare triple {23171#(< ~counter~0 10)} assume !!(~r~0 >= 2 * ~b~0); {23171#(< ~counter~0 10)} is VALID [2022-04-28 11:29:06,879 INFO L284 TraceCheckUtils]: 121: Hoare quadruple {22722#true} {23171#(< ~counter~0 10)} #87#return; {23171#(< ~counter~0 10)} is VALID [2022-04-28 11:29:06,879 INFO L290 TraceCheckUtils]: 120: Hoare triple {22722#true} assume true; {22722#true} is VALID [2022-04-28 11:29:06,879 INFO L290 TraceCheckUtils]: 119: Hoare triple {22722#true} assume !(0 == ~cond); {22722#true} is VALID [2022-04-28 11:29:06,879 INFO L290 TraceCheckUtils]: 118: Hoare triple {22722#true} ~cond := #in~cond; {22722#true} is VALID [2022-04-28 11:29:06,879 INFO L272 TraceCheckUtils]: 117: Hoare triple {23171#(< ~counter~0 10)} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {22722#true} is VALID [2022-04-28 11:29:06,880 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {22722#true} {23171#(< ~counter~0 10)} #85#return; {23171#(< ~counter~0 10)} is VALID [2022-04-28 11:29:06,880 INFO L290 TraceCheckUtils]: 115: Hoare triple {22722#true} assume true; {22722#true} is VALID [2022-04-28 11:29:06,880 INFO L290 TraceCheckUtils]: 114: Hoare triple {22722#true} assume !(0 == ~cond); {22722#true} is VALID [2022-04-28 11:29:06,880 INFO L290 TraceCheckUtils]: 113: Hoare triple {22722#true} ~cond := #in~cond; {22722#true} is VALID [2022-04-28 11:29:06,880 INFO L272 TraceCheckUtils]: 112: Hoare triple {23171#(< ~counter~0 10)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {22722#true} is VALID [2022-04-28 11:29:06,880 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {22722#true} {23171#(< ~counter~0 10)} #83#return; {23171#(< ~counter~0 10)} is VALID [2022-04-28 11:29:06,880 INFO L290 TraceCheckUtils]: 110: Hoare triple {22722#true} assume true; {22722#true} is VALID [2022-04-28 11:29:06,880 INFO L290 TraceCheckUtils]: 109: Hoare triple {22722#true} assume !(0 == ~cond); {22722#true} is VALID [2022-04-28 11:29:06,880 INFO L290 TraceCheckUtils]: 108: Hoare triple {22722#true} ~cond := #in~cond; {22722#true} is VALID [2022-04-28 11:29:06,881 INFO L272 TraceCheckUtils]: 107: Hoare triple {23171#(< ~counter~0 10)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {22722#true} is VALID [2022-04-28 11:29:06,881 INFO L290 TraceCheckUtils]: 106: Hoare triple {23171#(< ~counter~0 10)} assume !!(#t~post7 < 10);havoc #t~post7; {23171#(< ~counter~0 10)} is VALID [2022-04-28 11:29:06,882 INFO L290 TraceCheckUtils]: 105: Hoare triple {23244#(< ~counter~0 9)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {23171#(< ~counter~0 10)} is VALID [2022-04-28 11:29:06,882 INFO L290 TraceCheckUtils]: 104: Hoare triple {23244#(< ~counter~0 9)} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {23244#(< ~counter~0 9)} is VALID [2022-04-28 11:29:06,882 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {22722#true} {23244#(< ~counter~0 9)} #81#return; {23244#(< ~counter~0 9)} is VALID [2022-04-28 11:29:06,882 INFO L290 TraceCheckUtils]: 102: Hoare triple {22722#true} assume true; {22722#true} is VALID [2022-04-28 11:29:06,882 INFO L290 TraceCheckUtils]: 101: Hoare triple {22722#true} assume !(0 == ~cond); {22722#true} is VALID [2022-04-28 11:29:06,882 INFO L290 TraceCheckUtils]: 100: Hoare triple {22722#true} ~cond := #in~cond; {22722#true} is VALID [2022-04-28 11:29:06,883 INFO L272 TraceCheckUtils]: 99: Hoare triple {23244#(< ~counter~0 9)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {22722#true} is VALID [2022-04-28 11:29:06,883 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {22722#true} {23244#(< ~counter~0 9)} #79#return; {23244#(< ~counter~0 9)} is VALID [2022-04-28 11:29:06,883 INFO L290 TraceCheckUtils]: 97: Hoare triple {22722#true} assume true; {22722#true} is VALID [2022-04-28 11:29:06,883 INFO L290 TraceCheckUtils]: 96: Hoare triple {22722#true} assume !(0 == ~cond); {22722#true} is VALID [2022-04-28 11:29:06,883 INFO L290 TraceCheckUtils]: 95: Hoare triple {22722#true} ~cond := #in~cond; {22722#true} is VALID [2022-04-28 11:29:06,883 INFO L272 TraceCheckUtils]: 94: Hoare triple {23244#(< ~counter~0 9)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {22722#true} is VALID [2022-04-28 11:29:06,883 INFO L290 TraceCheckUtils]: 93: Hoare triple {23244#(< ~counter~0 9)} assume !!(#t~post6 < 10);havoc #t~post6; {23244#(< ~counter~0 9)} is VALID [2022-04-28 11:29:06,884 INFO L290 TraceCheckUtils]: 92: Hoare triple {23284#(< ~counter~0 8)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {23244#(< ~counter~0 9)} is VALID [2022-04-28 11:29:06,884 INFO L290 TraceCheckUtils]: 91: Hoare triple {23284#(< ~counter~0 8)} ~r~0 := ~r~0 - ~b~0;~q~0 := ~q~0 + ~a~0; {23284#(< ~counter~0 8)} is VALID [2022-04-28 11:29:06,884 INFO L290 TraceCheckUtils]: 90: Hoare triple {23284#(< ~counter~0 8)} assume !(~r~0 >= 2 * ~b~0); {23284#(< ~counter~0 8)} is VALID [2022-04-28 11:29:06,885 INFO L284 TraceCheckUtils]: 89: Hoare quadruple {22722#true} {23284#(< ~counter~0 8)} #87#return; {23284#(< ~counter~0 8)} is VALID [2022-04-28 11:29:06,885 INFO L290 TraceCheckUtils]: 88: Hoare triple {22722#true} assume true; {22722#true} is VALID [2022-04-28 11:29:06,885 INFO L290 TraceCheckUtils]: 87: Hoare triple {22722#true} assume !(0 == ~cond); {22722#true} is VALID [2022-04-28 11:29:06,885 INFO L290 TraceCheckUtils]: 86: Hoare triple {22722#true} ~cond := #in~cond; {22722#true} is VALID [2022-04-28 11:29:06,885 INFO L272 TraceCheckUtils]: 85: Hoare triple {23284#(< ~counter~0 8)} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {22722#true} is VALID [2022-04-28 11:29:06,886 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {22722#true} {23284#(< ~counter~0 8)} #85#return; {23284#(< ~counter~0 8)} is VALID [2022-04-28 11:29:06,886 INFO L290 TraceCheckUtils]: 83: Hoare triple {22722#true} assume true; {22722#true} is VALID [2022-04-28 11:29:06,886 INFO L290 TraceCheckUtils]: 82: Hoare triple {22722#true} assume !(0 == ~cond); {22722#true} is VALID [2022-04-28 11:29:06,886 INFO L290 TraceCheckUtils]: 81: Hoare triple {22722#true} ~cond := #in~cond; {22722#true} is VALID [2022-04-28 11:29:06,886 INFO L272 TraceCheckUtils]: 80: Hoare triple {23284#(< ~counter~0 8)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {22722#true} is VALID [2022-04-28 11:29:06,886 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {22722#true} {23284#(< ~counter~0 8)} #83#return; {23284#(< ~counter~0 8)} is VALID [2022-04-28 11:29:06,886 INFO L290 TraceCheckUtils]: 78: Hoare triple {22722#true} assume true; {22722#true} is VALID [2022-04-28 11:29:06,886 INFO L290 TraceCheckUtils]: 77: Hoare triple {22722#true} assume !(0 == ~cond); {22722#true} is VALID [2022-04-28 11:29:06,887 INFO L290 TraceCheckUtils]: 76: Hoare triple {22722#true} ~cond := #in~cond; {22722#true} is VALID [2022-04-28 11:29:06,887 INFO L272 TraceCheckUtils]: 75: Hoare triple {23284#(< ~counter~0 8)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {22722#true} is VALID [2022-04-28 11:29:06,887 INFO L290 TraceCheckUtils]: 74: Hoare triple {23284#(< ~counter~0 8)} assume !!(#t~post7 < 10);havoc #t~post7; {23284#(< ~counter~0 8)} is VALID [2022-04-28 11:29:06,887 INFO L290 TraceCheckUtils]: 73: Hoare triple {23048#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {23284#(< ~counter~0 8)} is VALID [2022-04-28 11:29:06,888 INFO L290 TraceCheckUtils]: 72: Hoare triple {23048#(<= ~counter~0 6)} ~a~0 := 2 * ~a~0;~b~0 := 2 * ~b~0; {23048#(<= ~counter~0 6)} is VALID [2022-04-28 11:29:06,888 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {22722#true} {23048#(<= ~counter~0 6)} #89#return; {23048#(<= ~counter~0 6)} is VALID [2022-04-28 11:29:06,888 INFO L290 TraceCheckUtils]: 70: Hoare triple {22722#true} assume true; {22722#true} is VALID [2022-04-28 11:29:06,888 INFO L290 TraceCheckUtils]: 69: Hoare triple {22722#true} assume !(0 == ~cond); {22722#true} is VALID [2022-04-28 11:29:06,888 INFO L290 TraceCheckUtils]: 68: Hoare triple {22722#true} ~cond := #in~cond; {22722#true} is VALID [2022-04-28 11:29:06,888 INFO L272 TraceCheckUtils]: 67: Hoare triple {23048#(<= ~counter~0 6)} call __VERIFIER_assert((if ~r~0 >= 2 * ~y~0 * ~a~0 then 1 else 0)); {22722#true} is VALID [2022-04-28 11:29:06,889 INFO L290 TraceCheckUtils]: 66: Hoare triple {23048#(<= ~counter~0 6)} assume !!(~r~0 >= 2 * ~b~0); {23048#(<= ~counter~0 6)} is VALID [2022-04-28 11:29:06,889 INFO L284 TraceCheckUtils]: 65: Hoare quadruple {22722#true} {23048#(<= ~counter~0 6)} #87#return; {23048#(<= ~counter~0 6)} is VALID [2022-04-28 11:29:06,889 INFO L290 TraceCheckUtils]: 64: Hoare triple {22722#true} assume true; {22722#true} is VALID [2022-04-28 11:29:06,889 INFO L290 TraceCheckUtils]: 63: Hoare triple {22722#true} assume !(0 == ~cond); {22722#true} is VALID [2022-04-28 11:29:06,889 INFO L290 TraceCheckUtils]: 62: Hoare triple {22722#true} ~cond := #in~cond; {22722#true} is VALID [2022-04-28 11:29:06,889 INFO L272 TraceCheckUtils]: 61: Hoare triple {23048#(<= ~counter~0 6)} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {22722#true} is VALID [2022-04-28 11:29:06,890 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {22722#true} {23048#(<= ~counter~0 6)} #85#return; {23048#(<= ~counter~0 6)} is VALID [2022-04-28 11:29:06,890 INFO L290 TraceCheckUtils]: 59: Hoare triple {22722#true} assume true; {22722#true} is VALID [2022-04-28 11:29:06,890 INFO L290 TraceCheckUtils]: 58: Hoare triple {22722#true} assume !(0 == ~cond); {22722#true} is VALID [2022-04-28 11:29:06,890 INFO L290 TraceCheckUtils]: 57: Hoare triple {22722#true} ~cond := #in~cond; {22722#true} is VALID [2022-04-28 11:29:06,890 INFO L272 TraceCheckUtils]: 56: Hoare triple {23048#(<= ~counter~0 6)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {22722#true} is VALID [2022-04-28 11:29:06,890 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {22722#true} {23048#(<= ~counter~0 6)} #83#return; {23048#(<= ~counter~0 6)} is VALID [2022-04-28 11:29:06,890 INFO L290 TraceCheckUtils]: 54: Hoare triple {22722#true} assume true; {22722#true} is VALID [2022-04-28 11:29:06,891 INFO L290 TraceCheckUtils]: 53: Hoare triple {22722#true} assume !(0 == ~cond); {22722#true} is VALID [2022-04-28 11:29:06,891 INFO L290 TraceCheckUtils]: 52: Hoare triple {22722#true} ~cond := #in~cond; {22722#true} is VALID [2022-04-28 11:29:06,891 INFO L272 TraceCheckUtils]: 51: Hoare triple {23048#(<= ~counter~0 6)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {22722#true} is VALID [2022-04-28 11:29:06,891 INFO L290 TraceCheckUtils]: 50: Hoare triple {23048#(<= ~counter~0 6)} assume !!(#t~post7 < 10);havoc #t~post7; {23048#(<= ~counter~0 6)} is VALID [2022-04-28 11:29:06,891 INFO L290 TraceCheckUtils]: 49: Hoare triple {23008#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {23048#(<= ~counter~0 6)} is VALID [2022-04-28 11:29:06,892 INFO L290 TraceCheckUtils]: 48: Hoare triple {23008#(<= ~counter~0 5)} ~a~0 := 2 * ~a~0;~b~0 := 2 * ~b~0; {23008#(<= ~counter~0 5)} is VALID [2022-04-28 11:29:06,892 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {22722#true} {23008#(<= ~counter~0 5)} #89#return; {23008#(<= ~counter~0 5)} is VALID [2022-04-28 11:29:06,892 INFO L290 TraceCheckUtils]: 46: Hoare triple {22722#true} assume true; {22722#true} is VALID [2022-04-28 11:29:06,892 INFO L290 TraceCheckUtils]: 45: Hoare triple {22722#true} assume !(0 == ~cond); {22722#true} is VALID [2022-04-28 11:29:06,892 INFO L290 TraceCheckUtils]: 44: Hoare triple {22722#true} ~cond := #in~cond; {22722#true} is VALID [2022-04-28 11:29:06,892 INFO L272 TraceCheckUtils]: 43: Hoare triple {23008#(<= ~counter~0 5)} call __VERIFIER_assert((if ~r~0 >= 2 * ~y~0 * ~a~0 then 1 else 0)); {22722#true} is VALID [2022-04-28 11:29:06,893 INFO L290 TraceCheckUtils]: 42: Hoare triple {23008#(<= ~counter~0 5)} assume !!(~r~0 >= 2 * ~b~0); {23008#(<= ~counter~0 5)} is VALID [2022-04-28 11:29:06,893 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {22722#true} {23008#(<= ~counter~0 5)} #87#return; {23008#(<= ~counter~0 5)} is VALID [2022-04-28 11:29:06,893 INFO L290 TraceCheckUtils]: 40: Hoare triple {22722#true} assume true; {22722#true} is VALID [2022-04-28 11:29:06,893 INFO L290 TraceCheckUtils]: 39: Hoare triple {22722#true} assume !(0 == ~cond); {22722#true} is VALID [2022-04-28 11:29:06,893 INFO L290 TraceCheckUtils]: 38: Hoare triple {22722#true} ~cond := #in~cond; {22722#true} is VALID [2022-04-28 11:29:06,893 INFO L272 TraceCheckUtils]: 37: Hoare triple {23008#(<= ~counter~0 5)} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {22722#true} is VALID [2022-04-28 11:29:06,894 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {22722#true} {23008#(<= ~counter~0 5)} #85#return; {23008#(<= ~counter~0 5)} is VALID [2022-04-28 11:29:06,894 INFO L290 TraceCheckUtils]: 35: Hoare triple {22722#true} assume true; {22722#true} is VALID [2022-04-28 11:29:06,894 INFO L290 TraceCheckUtils]: 34: Hoare triple {22722#true} assume !(0 == ~cond); {22722#true} is VALID [2022-04-28 11:29:06,894 INFO L290 TraceCheckUtils]: 33: Hoare triple {22722#true} ~cond := #in~cond; {22722#true} is VALID [2022-04-28 11:29:06,894 INFO L272 TraceCheckUtils]: 32: Hoare triple {23008#(<= ~counter~0 5)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {22722#true} is VALID [2022-04-28 11:29:06,894 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {22722#true} {23008#(<= ~counter~0 5)} #83#return; {23008#(<= ~counter~0 5)} is VALID [2022-04-28 11:29:06,895 INFO L290 TraceCheckUtils]: 30: Hoare triple {22722#true} assume true; {22722#true} is VALID [2022-04-28 11:29:06,895 INFO L290 TraceCheckUtils]: 29: Hoare triple {22722#true} assume !(0 == ~cond); {22722#true} is VALID [2022-04-28 11:29:06,895 INFO L290 TraceCheckUtils]: 28: Hoare triple {22722#true} ~cond := #in~cond; {22722#true} is VALID [2022-04-28 11:29:06,895 INFO L272 TraceCheckUtils]: 27: Hoare triple {23008#(<= ~counter~0 5)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {22722#true} is VALID [2022-04-28 11:29:06,895 INFO L290 TraceCheckUtils]: 26: Hoare triple {23008#(<= ~counter~0 5)} assume !!(#t~post7 < 10);havoc #t~post7; {23008#(<= ~counter~0 5)} is VALID [2022-04-28 11:29:06,895 INFO L290 TraceCheckUtils]: 25: Hoare triple {22950#(<= ~counter~0 4)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {23008#(<= ~counter~0 5)} is VALID [2022-04-28 11:29:06,896 INFO L290 TraceCheckUtils]: 24: Hoare triple {22950#(<= ~counter~0 4)} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {22950#(<= ~counter~0 4)} is VALID [2022-04-28 11:29:06,896 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {22722#true} {22950#(<= ~counter~0 4)} #81#return; {22950#(<= ~counter~0 4)} is VALID [2022-04-28 11:29:06,896 INFO L290 TraceCheckUtils]: 22: Hoare triple {22722#true} assume true; {22722#true} is VALID [2022-04-28 11:29:06,896 INFO L290 TraceCheckUtils]: 21: Hoare triple {22722#true} assume !(0 == ~cond); {22722#true} is VALID [2022-04-28 11:29:06,896 INFO L290 TraceCheckUtils]: 20: Hoare triple {22722#true} ~cond := #in~cond; {22722#true} is VALID [2022-04-28 11:29:06,896 INFO L272 TraceCheckUtils]: 19: Hoare triple {22950#(<= ~counter~0 4)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {22722#true} is VALID [2022-04-28 11:29:06,897 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {22722#true} {22950#(<= ~counter~0 4)} #79#return; {22950#(<= ~counter~0 4)} is VALID [2022-04-28 11:29:06,897 INFO L290 TraceCheckUtils]: 17: Hoare triple {22722#true} assume true; {22722#true} is VALID [2022-04-28 11:29:06,897 INFO L290 TraceCheckUtils]: 16: Hoare triple {22722#true} assume !(0 == ~cond); {22722#true} is VALID [2022-04-28 11:29:06,897 INFO L290 TraceCheckUtils]: 15: Hoare triple {22722#true} ~cond := #in~cond; {22722#true} is VALID [2022-04-28 11:29:06,897 INFO L272 TraceCheckUtils]: 14: Hoare triple {22950#(<= ~counter~0 4)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {22722#true} is VALID [2022-04-28 11:29:06,897 INFO L290 TraceCheckUtils]: 13: Hoare triple {22950#(<= ~counter~0 4)} assume !!(#t~post6 < 10);havoc #t~post6; {22950#(<= ~counter~0 4)} is VALID [2022-04-28 11:29:06,898 INFO L290 TraceCheckUtils]: 12: Hoare triple {22877#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {22950#(<= ~counter~0 4)} is VALID [2022-04-28 11:29:06,898 INFO L290 TraceCheckUtils]: 11: Hoare triple {22877#(<= ~counter~0 3)} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {22877#(<= ~counter~0 3)} is VALID [2022-04-28 11:29:06,898 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {22722#true} {22877#(<= ~counter~0 3)} #77#return; {22877#(<= ~counter~0 3)} is VALID [2022-04-28 11:29:06,899 INFO L290 TraceCheckUtils]: 9: Hoare triple {22722#true} assume true; {22722#true} is VALID [2022-04-28 11:29:06,899 INFO L290 TraceCheckUtils]: 8: Hoare triple {22722#true} assume !(0 == ~cond); {22722#true} is VALID [2022-04-28 11:29:06,899 INFO L290 TraceCheckUtils]: 7: Hoare triple {22722#true} ~cond := #in~cond; {22722#true} is VALID [2022-04-28 11:29:06,899 INFO L272 TraceCheckUtils]: 6: Hoare triple {22877#(<= ~counter~0 3)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {22722#true} is VALID [2022-04-28 11:29:06,899 INFO L290 TraceCheckUtils]: 5: Hoare triple {22877#(<= ~counter~0 3)} 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; {22877#(<= ~counter~0 3)} is VALID [2022-04-28 11:29:06,899 INFO L272 TraceCheckUtils]: 4: Hoare triple {22877#(<= ~counter~0 3)} call #t~ret8 := main(); {22877#(<= ~counter~0 3)} is VALID [2022-04-28 11:29:06,900 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22877#(<= ~counter~0 3)} {22722#true} #93#return; {22877#(<= ~counter~0 3)} is VALID [2022-04-28 11:29:06,900 INFO L290 TraceCheckUtils]: 2: Hoare triple {22877#(<= ~counter~0 3)} assume true; {22877#(<= ~counter~0 3)} is VALID [2022-04-28 11:29:06,900 INFO L290 TraceCheckUtils]: 1: Hoare triple {22722#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; {22877#(<= ~counter~0 3)} is VALID [2022-04-28 11:29:06,900 INFO L272 TraceCheckUtils]: 0: Hoare triple {22722#true} call ULTIMATE.init(); {22722#true} is VALID [2022-04-28 11:29:06,901 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 43 proven. 55 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2022-04-28 11:29:06,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:29:06,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169915776] [2022-04-28 11:29:06,901 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:29:06,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1481866173] [2022-04-28 11:29:06,901 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1481866173] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 11:29:06,901 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 11:29:06,901 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 14 [2022-04-28 11:29:06,901 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:29:06,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1112480360] [2022-04-28 11:29:06,902 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1112480360] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:29:06,902 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:29:06,902 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 11:29:06,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38057970] [2022-04-28 11:29:06,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:29:06,902 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 9 states have internal predecessors, (55), 9 states have call successors, (23), 9 states have call predecessors, (23), 7 states have return successors, (21), 7 states have call predecessors, (21), 8 states have call successors, (21) Word has length 138 [2022-04-28 11:29:06,902 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:29:06,903 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 5.5) internal successors, (55), 9 states have internal predecessors, (55), 9 states have call successors, (23), 9 states have call predecessors, (23), 7 states have return successors, (21), 7 states have call predecessors, (21), 8 states have call successors, (21) [2022-04-28 11:29:06,979 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:29:06,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 11:29:06,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:29:06,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 11:29:06,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-28 11:29:06,980 INFO L87 Difference]: Start difference. First operand 219 states and 257 transitions. Second operand has 10 states, 10 states have (on average 5.5) internal successors, (55), 9 states have internal predecessors, (55), 9 states have call successors, (23), 9 states have call predecessors, (23), 7 states have return successors, (21), 7 states have call predecessors, (21), 8 states have call successors, (21) [2022-04-28 11:29:07,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:29:07,880 INFO L93 Difference]: Finished difference Result 304 states and 345 transitions. [2022-04-28 11:29:07,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-28 11:29:07,880 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 9 states have internal predecessors, (55), 9 states have call successors, (23), 9 states have call predecessors, (23), 7 states have return successors, (21), 7 states have call predecessors, (21), 8 states have call successors, (21) Word has length 138 [2022-04-28 11:29:07,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:29:07,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 5.5) internal successors, (55), 9 states have internal predecessors, (55), 9 states have call successors, (23), 9 states have call predecessors, (23), 7 states have return successors, (21), 7 states have call predecessors, (21), 8 states have call successors, (21) [2022-04-28 11:29:07,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 158 transitions. [2022-04-28 11:29:07,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 5.5) internal successors, (55), 9 states have internal predecessors, (55), 9 states have call successors, (23), 9 states have call predecessors, (23), 7 states have return successors, (21), 7 states have call predecessors, (21), 8 states have call successors, (21) [2022-04-28 11:29:07,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 158 transitions. [2022-04-28 11:29:07,883 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 158 transitions. [2022-04-28 11:29:08,008 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 158 edges. 158 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:29:08,013 INFO L225 Difference]: With dead ends: 304 [2022-04-28 11:29:08,014 INFO L226 Difference]: Without dead ends: 296 [2022-04-28 11:29:08,014 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 262 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=131, Invalid=211, Unknown=0, NotChecked=0, Total=342 [2022-04-28 11:29:08,014 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 68 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 11:29:08,015 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 201 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 11:29:08,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2022-04-28 11:29:08,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 291. [2022-04-28 11:29:08,417 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:29:08,417 INFO L82 GeneralOperation]: Start isEquivalent. First operand 296 states. Second operand has 291 states, 190 states have (on average 1.0947368421052632) internal successors, (208), 192 states have internal predecessors, (208), 63 states have call successors, (63), 39 states have call predecessors, (63), 37 states have return successors, (60), 59 states have call predecessors, (60), 60 states have call successors, (60) [2022-04-28 11:29:08,418 INFO L74 IsIncluded]: Start isIncluded. First operand 296 states. Second operand has 291 states, 190 states have (on average 1.0947368421052632) internal successors, (208), 192 states have internal predecessors, (208), 63 states have call successors, (63), 39 states have call predecessors, (63), 37 states have return successors, (60), 59 states have call predecessors, (60), 60 states have call successors, (60) [2022-04-28 11:29:08,418 INFO L87 Difference]: Start difference. First operand 296 states. Second operand has 291 states, 190 states have (on average 1.0947368421052632) internal successors, (208), 192 states have internal predecessors, (208), 63 states have call successors, (63), 39 states have call predecessors, (63), 37 states have return successors, (60), 59 states have call predecessors, (60), 60 states have call successors, (60) [2022-04-28 11:29:08,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:29:08,422 INFO L93 Difference]: Finished difference Result 296 states and 336 transitions. [2022-04-28 11:29:08,422 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 336 transitions. [2022-04-28 11:29:08,423 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:29:08,423 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:29:08,423 INFO L74 IsIncluded]: Start isIncluded. First operand has 291 states, 190 states have (on average 1.0947368421052632) internal successors, (208), 192 states have internal predecessors, (208), 63 states have call successors, (63), 39 states have call predecessors, (63), 37 states have return successors, (60), 59 states have call predecessors, (60), 60 states have call successors, (60) Second operand 296 states. [2022-04-28 11:29:08,423 INFO L87 Difference]: Start difference. First operand has 291 states, 190 states have (on average 1.0947368421052632) internal successors, (208), 192 states have internal predecessors, (208), 63 states have call successors, (63), 39 states have call predecessors, (63), 37 states have return successors, (60), 59 states have call predecessors, (60), 60 states have call successors, (60) Second operand 296 states. [2022-04-28 11:29:08,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:29:08,428 INFO L93 Difference]: Finished difference Result 296 states and 336 transitions. [2022-04-28 11:29:08,428 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 336 transitions. [2022-04-28 11:29:08,429 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:29:08,429 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:29:08,429 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:29:08,429 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:29:08,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 190 states have (on average 1.0947368421052632) internal successors, (208), 192 states have internal predecessors, (208), 63 states have call successors, (63), 39 states have call predecessors, (63), 37 states have return successors, (60), 59 states have call predecessors, (60), 60 states have call successors, (60) [2022-04-28 11:29:08,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 331 transitions. [2022-04-28 11:29:08,434 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 331 transitions. Word has length 138 [2022-04-28 11:29:08,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:29:08,434 INFO L495 AbstractCegarLoop]: Abstraction has 291 states and 331 transitions. [2022-04-28 11:29:08,434 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 9 states have internal predecessors, (55), 9 states have call successors, (23), 9 states have call predecessors, (23), 7 states have return successors, (21), 7 states have call predecessors, (21), 8 states have call successors, (21) [2022-04-28 11:29:08,434 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 291 states and 331 transitions. [2022-04-28 11:29:08,890 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 331 edges. 331 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:29:08,890 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 331 transitions. [2022-04-28 11:29:08,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2022-04-28 11:29:08,891 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:29:08,891 INFO L195 NwaCegarLoop]: trace histogram [23, 22, 22, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:29:08,908 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2022-04-28 11:29:09,108 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-04-28 11:29:09,108 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:29:09,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:29:09,108 INFO L85 PathProgramCache]: Analyzing trace with hash -559679257, now seen corresponding path program 7 times [2022-04-28 11:29:09,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:29:09,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [391030996] [2022-04-28 11:29:54,091 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:29:54,091 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:29:54,091 INFO L85 PathProgramCache]: Analyzing trace with hash -559679257, now seen corresponding path program 8 times [2022-04-28 11:29:54,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:29:54,091 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321732060] [2022-04-28 11:29:54,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:29:54,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:29:54,104 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:29:54,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1924247923] [2022-04-28 11:29:54,104 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:29:54,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:29:54,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:29:54,105 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 11:29:54,106 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-04-28 11:29:54,181 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 11:29:54,182 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:29:54,183 INFO L263 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-28 11:29:54,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:29:54,206 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:29:54,738 INFO L272 TraceCheckUtils]: 0: Hoare triple {25355#true} call ULTIMATE.init(); {25355#true} is VALID [2022-04-28 11:29:54,739 INFO L290 TraceCheckUtils]: 1: Hoare triple {25355#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; {25363#(<= ~counter~0 0)} is VALID [2022-04-28 11:29:54,739 INFO L290 TraceCheckUtils]: 2: Hoare triple {25363#(<= ~counter~0 0)} assume true; {25363#(<= ~counter~0 0)} is VALID [2022-04-28 11:29:54,740 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25363#(<= ~counter~0 0)} {25355#true} #93#return; {25363#(<= ~counter~0 0)} is VALID [2022-04-28 11:29:54,740 INFO L272 TraceCheckUtils]: 4: Hoare triple {25363#(<= ~counter~0 0)} call #t~ret8 := main(); {25363#(<= ~counter~0 0)} is VALID [2022-04-28 11:29:54,740 INFO L290 TraceCheckUtils]: 5: Hoare triple {25363#(<= ~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; {25363#(<= ~counter~0 0)} is VALID [2022-04-28 11:29:54,741 INFO L272 TraceCheckUtils]: 6: Hoare triple {25363#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {25363#(<= ~counter~0 0)} is VALID [2022-04-28 11:29:54,741 INFO L290 TraceCheckUtils]: 7: Hoare triple {25363#(<= ~counter~0 0)} ~cond := #in~cond; {25363#(<= ~counter~0 0)} is VALID [2022-04-28 11:29:54,741 INFO L290 TraceCheckUtils]: 8: Hoare triple {25363#(<= ~counter~0 0)} assume !(0 == ~cond); {25363#(<= ~counter~0 0)} is VALID [2022-04-28 11:29:54,741 INFO L290 TraceCheckUtils]: 9: Hoare triple {25363#(<= ~counter~0 0)} assume true; {25363#(<= ~counter~0 0)} is VALID [2022-04-28 11:29:54,742 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {25363#(<= ~counter~0 0)} {25363#(<= ~counter~0 0)} #77#return; {25363#(<= ~counter~0 0)} is VALID [2022-04-28 11:29:54,742 INFO L290 TraceCheckUtils]: 11: Hoare triple {25363#(<= ~counter~0 0)} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {25363#(<= ~counter~0 0)} is VALID [2022-04-28 11:29:54,743 INFO L290 TraceCheckUtils]: 12: Hoare triple {25363#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {25397#(<= ~counter~0 1)} is VALID [2022-04-28 11:29:54,743 INFO L290 TraceCheckUtils]: 13: Hoare triple {25397#(<= ~counter~0 1)} assume !!(#t~post6 < 10);havoc #t~post6; {25397#(<= ~counter~0 1)} is VALID [2022-04-28 11:29:54,744 INFO L272 TraceCheckUtils]: 14: Hoare triple {25397#(<= ~counter~0 1)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {25397#(<= ~counter~0 1)} is VALID [2022-04-28 11:29:54,748 INFO L290 TraceCheckUtils]: 15: Hoare triple {25397#(<= ~counter~0 1)} ~cond := #in~cond; {25397#(<= ~counter~0 1)} is VALID [2022-04-28 11:29:54,748 INFO L290 TraceCheckUtils]: 16: Hoare triple {25397#(<= ~counter~0 1)} assume !(0 == ~cond); {25397#(<= ~counter~0 1)} is VALID [2022-04-28 11:29:54,748 INFO L290 TraceCheckUtils]: 17: Hoare triple {25397#(<= ~counter~0 1)} assume true; {25397#(<= ~counter~0 1)} is VALID [2022-04-28 11:29:54,749 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {25397#(<= ~counter~0 1)} {25397#(<= ~counter~0 1)} #79#return; {25397#(<= ~counter~0 1)} is VALID [2022-04-28 11:29:54,749 INFO L272 TraceCheckUtils]: 19: Hoare triple {25397#(<= ~counter~0 1)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {25397#(<= ~counter~0 1)} is VALID [2022-04-28 11:29:54,750 INFO L290 TraceCheckUtils]: 20: Hoare triple {25397#(<= ~counter~0 1)} ~cond := #in~cond; {25397#(<= ~counter~0 1)} is VALID [2022-04-28 11:29:54,750 INFO L290 TraceCheckUtils]: 21: Hoare triple {25397#(<= ~counter~0 1)} assume !(0 == ~cond); {25397#(<= ~counter~0 1)} is VALID [2022-04-28 11:29:54,750 INFO L290 TraceCheckUtils]: 22: Hoare triple {25397#(<= ~counter~0 1)} assume true; {25397#(<= ~counter~0 1)} is VALID [2022-04-28 11:29:54,751 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {25397#(<= ~counter~0 1)} {25397#(<= ~counter~0 1)} #81#return; {25397#(<= ~counter~0 1)} is VALID [2022-04-28 11:29:54,751 INFO L290 TraceCheckUtils]: 24: Hoare triple {25397#(<= ~counter~0 1)} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {25397#(<= ~counter~0 1)} is VALID [2022-04-28 11:29:54,752 INFO L290 TraceCheckUtils]: 25: Hoare triple {25397#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {25437#(<= ~counter~0 2)} is VALID [2022-04-28 11:29:54,752 INFO L290 TraceCheckUtils]: 26: Hoare triple {25437#(<= ~counter~0 2)} assume !!(#t~post7 < 10);havoc #t~post7; {25437#(<= ~counter~0 2)} is VALID [2022-04-28 11:29:54,752 INFO L272 TraceCheckUtils]: 27: Hoare triple {25437#(<= ~counter~0 2)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {25437#(<= ~counter~0 2)} is VALID [2022-04-28 11:29:54,753 INFO L290 TraceCheckUtils]: 28: Hoare triple {25437#(<= ~counter~0 2)} ~cond := #in~cond; {25437#(<= ~counter~0 2)} is VALID [2022-04-28 11:29:54,753 INFO L290 TraceCheckUtils]: 29: Hoare triple {25437#(<= ~counter~0 2)} assume !(0 == ~cond); {25437#(<= ~counter~0 2)} is VALID [2022-04-28 11:29:54,753 INFO L290 TraceCheckUtils]: 30: Hoare triple {25437#(<= ~counter~0 2)} assume true; {25437#(<= ~counter~0 2)} is VALID [2022-04-28 11:29:54,754 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {25437#(<= ~counter~0 2)} {25437#(<= ~counter~0 2)} #83#return; {25437#(<= ~counter~0 2)} is VALID [2022-04-28 11:29:54,754 INFO L272 TraceCheckUtils]: 32: Hoare triple {25437#(<= ~counter~0 2)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {25437#(<= ~counter~0 2)} is VALID [2022-04-28 11:29:54,754 INFO L290 TraceCheckUtils]: 33: Hoare triple {25437#(<= ~counter~0 2)} ~cond := #in~cond; {25437#(<= ~counter~0 2)} is VALID [2022-04-28 11:29:54,755 INFO L290 TraceCheckUtils]: 34: Hoare triple {25437#(<= ~counter~0 2)} assume !(0 == ~cond); {25437#(<= ~counter~0 2)} is VALID [2022-04-28 11:29:54,755 INFO L290 TraceCheckUtils]: 35: Hoare triple {25437#(<= ~counter~0 2)} assume true; {25437#(<= ~counter~0 2)} is VALID [2022-04-28 11:29:54,755 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {25437#(<= ~counter~0 2)} {25437#(<= ~counter~0 2)} #85#return; {25437#(<= ~counter~0 2)} is VALID [2022-04-28 11:29:54,756 INFO L272 TraceCheckUtils]: 37: Hoare triple {25437#(<= ~counter~0 2)} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {25437#(<= ~counter~0 2)} is VALID [2022-04-28 11:29:54,756 INFO L290 TraceCheckUtils]: 38: Hoare triple {25437#(<= ~counter~0 2)} ~cond := #in~cond; {25437#(<= ~counter~0 2)} is VALID [2022-04-28 11:29:54,756 INFO L290 TraceCheckUtils]: 39: Hoare triple {25437#(<= ~counter~0 2)} assume !(0 == ~cond); {25437#(<= ~counter~0 2)} is VALID [2022-04-28 11:29:54,756 INFO L290 TraceCheckUtils]: 40: Hoare triple {25437#(<= ~counter~0 2)} assume true; {25437#(<= ~counter~0 2)} is VALID [2022-04-28 11:29:54,757 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {25437#(<= ~counter~0 2)} {25437#(<= ~counter~0 2)} #87#return; {25437#(<= ~counter~0 2)} is VALID [2022-04-28 11:29:54,757 INFO L290 TraceCheckUtils]: 42: Hoare triple {25437#(<= ~counter~0 2)} assume !!(~r~0 >= 2 * ~b~0); {25437#(<= ~counter~0 2)} is VALID [2022-04-28 11:29:54,757 INFO L272 TraceCheckUtils]: 43: Hoare triple {25437#(<= ~counter~0 2)} call __VERIFIER_assert((if ~r~0 >= 2 * ~y~0 * ~a~0 then 1 else 0)); {25437#(<= ~counter~0 2)} is VALID [2022-04-28 11:29:54,758 INFO L290 TraceCheckUtils]: 44: Hoare triple {25437#(<= ~counter~0 2)} ~cond := #in~cond; {25437#(<= ~counter~0 2)} is VALID [2022-04-28 11:29:54,758 INFO L290 TraceCheckUtils]: 45: Hoare triple {25437#(<= ~counter~0 2)} assume !(0 == ~cond); {25437#(<= ~counter~0 2)} is VALID [2022-04-28 11:29:54,758 INFO L290 TraceCheckUtils]: 46: Hoare triple {25437#(<= ~counter~0 2)} assume true; {25437#(<= ~counter~0 2)} is VALID [2022-04-28 11:29:54,759 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {25437#(<= ~counter~0 2)} {25437#(<= ~counter~0 2)} #89#return; {25437#(<= ~counter~0 2)} is VALID [2022-04-28 11:29:54,759 INFO L290 TraceCheckUtils]: 48: Hoare triple {25437#(<= ~counter~0 2)} ~a~0 := 2 * ~a~0;~b~0 := 2 * ~b~0; {25437#(<= ~counter~0 2)} is VALID [2022-04-28 11:29:54,760 INFO L290 TraceCheckUtils]: 49: Hoare triple {25437#(<= ~counter~0 2)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {25510#(<= ~counter~0 3)} is VALID [2022-04-28 11:29:54,760 INFO L290 TraceCheckUtils]: 50: Hoare triple {25510#(<= ~counter~0 3)} assume !!(#t~post7 < 10);havoc #t~post7; {25510#(<= ~counter~0 3)} is VALID [2022-04-28 11:29:54,760 INFO L272 TraceCheckUtils]: 51: Hoare triple {25510#(<= ~counter~0 3)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {25510#(<= ~counter~0 3)} is VALID [2022-04-28 11:29:54,761 INFO L290 TraceCheckUtils]: 52: Hoare triple {25510#(<= ~counter~0 3)} ~cond := #in~cond; {25510#(<= ~counter~0 3)} is VALID [2022-04-28 11:29:54,761 INFO L290 TraceCheckUtils]: 53: Hoare triple {25510#(<= ~counter~0 3)} assume !(0 == ~cond); {25510#(<= ~counter~0 3)} is VALID [2022-04-28 11:29:54,761 INFO L290 TraceCheckUtils]: 54: Hoare triple {25510#(<= ~counter~0 3)} assume true; {25510#(<= ~counter~0 3)} is VALID [2022-04-28 11:29:54,762 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {25510#(<= ~counter~0 3)} {25510#(<= ~counter~0 3)} #83#return; {25510#(<= ~counter~0 3)} is VALID [2022-04-28 11:29:54,762 INFO L272 TraceCheckUtils]: 56: Hoare triple {25510#(<= ~counter~0 3)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {25510#(<= ~counter~0 3)} is VALID [2022-04-28 11:29:54,762 INFO L290 TraceCheckUtils]: 57: Hoare triple {25510#(<= ~counter~0 3)} ~cond := #in~cond; {25510#(<= ~counter~0 3)} is VALID [2022-04-28 11:29:54,763 INFO L290 TraceCheckUtils]: 58: Hoare triple {25510#(<= ~counter~0 3)} assume !(0 == ~cond); {25510#(<= ~counter~0 3)} is VALID [2022-04-28 11:29:54,763 INFO L290 TraceCheckUtils]: 59: Hoare triple {25510#(<= ~counter~0 3)} assume true; {25510#(<= ~counter~0 3)} is VALID [2022-04-28 11:29:54,763 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {25510#(<= ~counter~0 3)} {25510#(<= ~counter~0 3)} #85#return; {25510#(<= ~counter~0 3)} is VALID [2022-04-28 11:29:54,764 INFO L272 TraceCheckUtils]: 61: Hoare triple {25510#(<= ~counter~0 3)} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {25510#(<= ~counter~0 3)} is VALID [2022-04-28 11:29:54,764 INFO L290 TraceCheckUtils]: 62: Hoare triple {25510#(<= ~counter~0 3)} ~cond := #in~cond; {25510#(<= ~counter~0 3)} is VALID [2022-04-28 11:29:54,764 INFO L290 TraceCheckUtils]: 63: Hoare triple {25510#(<= ~counter~0 3)} assume !(0 == ~cond); {25510#(<= ~counter~0 3)} is VALID [2022-04-28 11:29:54,764 INFO L290 TraceCheckUtils]: 64: Hoare triple {25510#(<= ~counter~0 3)} assume true; {25510#(<= ~counter~0 3)} is VALID [2022-04-28 11:29:54,765 INFO L284 TraceCheckUtils]: 65: Hoare quadruple {25510#(<= ~counter~0 3)} {25510#(<= ~counter~0 3)} #87#return; {25510#(<= ~counter~0 3)} is VALID [2022-04-28 11:29:54,765 INFO L290 TraceCheckUtils]: 66: Hoare triple {25510#(<= ~counter~0 3)} assume !!(~r~0 >= 2 * ~b~0); {25510#(<= ~counter~0 3)} is VALID [2022-04-28 11:29:54,771 INFO L272 TraceCheckUtils]: 67: Hoare triple {25510#(<= ~counter~0 3)} call __VERIFIER_assert((if ~r~0 >= 2 * ~y~0 * ~a~0 then 1 else 0)); {25510#(<= ~counter~0 3)} is VALID [2022-04-28 11:29:54,772 INFO L290 TraceCheckUtils]: 68: Hoare triple {25510#(<= ~counter~0 3)} ~cond := #in~cond; {25510#(<= ~counter~0 3)} is VALID [2022-04-28 11:29:54,772 INFO L290 TraceCheckUtils]: 69: Hoare triple {25510#(<= ~counter~0 3)} assume !(0 == ~cond); {25510#(<= ~counter~0 3)} is VALID [2022-04-28 11:29:54,772 INFO L290 TraceCheckUtils]: 70: Hoare triple {25510#(<= ~counter~0 3)} assume true; {25510#(<= ~counter~0 3)} is VALID [2022-04-28 11:29:54,773 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {25510#(<= ~counter~0 3)} {25510#(<= ~counter~0 3)} #89#return; {25510#(<= ~counter~0 3)} is VALID [2022-04-28 11:29:54,773 INFO L290 TraceCheckUtils]: 72: Hoare triple {25510#(<= ~counter~0 3)} ~a~0 := 2 * ~a~0;~b~0 := 2 * ~b~0; {25510#(<= ~counter~0 3)} is VALID [2022-04-28 11:29:54,774 INFO L290 TraceCheckUtils]: 73: Hoare triple {25510#(<= ~counter~0 3)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {25583#(<= ~counter~0 4)} is VALID [2022-04-28 11:29:54,774 INFO L290 TraceCheckUtils]: 74: Hoare triple {25583#(<= ~counter~0 4)} assume !!(#t~post7 < 10);havoc #t~post7; {25583#(<= ~counter~0 4)} is VALID [2022-04-28 11:29:54,775 INFO L272 TraceCheckUtils]: 75: Hoare triple {25583#(<= ~counter~0 4)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {25583#(<= ~counter~0 4)} is VALID [2022-04-28 11:29:54,775 INFO L290 TraceCheckUtils]: 76: Hoare triple {25583#(<= ~counter~0 4)} ~cond := #in~cond; {25583#(<= ~counter~0 4)} is VALID [2022-04-28 11:29:54,775 INFO L290 TraceCheckUtils]: 77: Hoare triple {25583#(<= ~counter~0 4)} assume !(0 == ~cond); {25583#(<= ~counter~0 4)} is VALID [2022-04-28 11:29:54,775 INFO L290 TraceCheckUtils]: 78: Hoare triple {25583#(<= ~counter~0 4)} assume true; {25583#(<= ~counter~0 4)} is VALID [2022-04-28 11:29:54,776 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {25583#(<= ~counter~0 4)} {25583#(<= ~counter~0 4)} #83#return; {25583#(<= ~counter~0 4)} is VALID [2022-04-28 11:29:54,776 INFO L272 TraceCheckUtils]: 80: Hoare triple {25583#(<= ~counter~0 4)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {25583#(<= ~counter~0 4)} is VALID [2022-04-28 11:29:54,777 INFO L290 TraceCheckUtils]: 81: Hoare triple {25583#(<= ~counter~0 4)} ~cond := #in~cond; {25583#(<= ~counter~0 4)} is VALID [2022-04-28 11:29:54,777 INFO L290 TraceCheckUtils]: 82: Hoare triple {25583#(<= ~counter~0 4)} assume !(0 == ~cond); {25583#(<= ~counter~0 4)} is VALID [2022-04-28 11:29:54,777 INFO L290 TraceCheckUtils]: 83: Hoare triple {25583#(<= ~counter~0 4)} assume true; {25583#(<= ~counter~0 4)} is VALID [2022-04-28 11:29:54,778 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {25583#(<= ~counter~0 4)} {25583#(<= ~counter~0 4)} #85#return; {25583#(<= ~counter~0 4)} is VALID [2022-04-28 11:29:54,778 INFO L272 TraceCheckUtils]: 85: Hoare triple {25583#(<= ~counter~0 4)} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {25583#(<= ~counter~0 4)} is VALID [2022-04-28 11:29:54,778 INFO L290 TraceCheckUtils]: 86: Hoare triple {25583#(<= ~counter~0 4)} ~cond := #in~cond; {25583#(<= ~counter~0 4)} is VALID [2022-04-28 11:29:54,778 INFO L290 TraceCheckUtils]: 87: Hoare triple {25583#(<= ~counter~0 4)} assume !(0 == ~cond); {25583#(<= ~counter~0 4)} is VALID [2022-04-28 11:29:54,779 INFO L290 TraceCheckUtils]: 88: Hoare triple {25583#(<= ~counter~0 4)} assume true; {25583#(<= ~counter~0 4)} is VALID [2022-04-28 11:29:54,779 INFO L284 TraceCheckUtils]: 89: Hoare quadruple {25583#(<= ~counter~0 4)} {25583#(<= ~counter~0 4)} #87#return; {25583#(<= ~counter~0 4)} is VALID [2022-04-28 11:29:54,779 INFO L290 TraceCheckUtils]: 90: Hoare triple {25583#(<= ~counter~0 4)} assume !(~r~0 >= 2 * ~b~0); {25583#(<= ~counter~0 4)} is VALID [2022-04-28 11:29:54,780 INFO L290 TraceCheckUtils]: 91: Hoare triple {25583#(<= ~counter~0 4)} ~r~0 := ~r~0 - ~b~0;~q~0 := ~q~0 + ~a~0; {25583#(<= ~counter~0 4)} is VALID [2022-04-28 11:29:54,780 INFO L290 TraceCheckUtils]: 92: Hoare triple {25583#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {25641#(<= ~counter~0 5)} is VALID [2022-04-28 11:29:54,781 INFO L290 TraceCheckUtils]: 93: Hoare triple {25641#(<= ~counter~0 5)} assume !!(#t~post6 < 10);havoc #t~post6; {25641#(<= ~counter~0 5)} is VALID [2022-04-28 11:29:54,781 INFO L272 TraceCheckUtils]: 94: Hoare triple {25641#(<= ~counter~0 5)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {25641#(<= ~counter~0 5)} is VALID [2022-04-28 11:29:54,781 INFO L290 TraceCheckUtils]: 95: Hoare triple {25641#(<= ~counter~0 5)} ~cond := #in~cond; {25641#(<= ~counter~0 5)} is VALID [2022-04-28 11:29:54,782 INFO L290 TraceCheckUtils]: 96: Hoare triple {25641#(<= ~counter~0 5)} assume !(0 == ~cond); {25641#(<= ~counter~0 5)} is VALID [2022-04-28 11:29:54,782 INFO L290 TraceCheckUtils]: 97: Hoare triple {25641#(<= ~counter~0 5)} assume true; {25641#(<= ~counter~0 5)} is VALID [2022-04-28 11:29:54,782 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {25641#(<= ~counter~0 5)} {25641#(<= ~counter~0 5)} #79#return; {25641#(<= ~counter~0 5)} is VALID [2022-04-28 11:29:54,783 INFO L272 TraceCheckUtils]: 99: Hoare triple {25641#(<= ~counter~0 5)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {25641#(<= ~counter~0 5)} is VALID [2022-04-28 11:29:54,783 INFO L290 TraceCheckUtils]: 100: Hoare triple {25641#(<= ~counter~0 5)} ~cond := #in~cond; {25641#(<= ~counter~0 5)} is VALID [2022-04-28 11:29:54,783 INFO L290 TraceCheckUtils]: 101: Hoare triple {25641#(<= ~counter~0 5)} assume !(0 == ~cond); {25641#(<= ~counter~0 5)} is VALID [2022-04-28 11:29:54,784 INFO L290 TraceCheckUtils]: 102: Hoare triple {25641#(<= ~counter~0 5)} assume true; {25641#(<= ~counter~0 5)} is VALID [2022-04-28 11:29:54,784 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {25641#(<= ~counter~0 5)} {25641#(<= ~counter~0 5)} #81#return; {25641#(<= ~counter~0 5)} is VALID [2022-04-28 11:29:54,784 INFO L290 TraceCheckUtils]: 104: Hoare triple {25641#(<= ~counter~0 5)} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {25641#(<= ~counter~0 5)} is VALID [2022-04-28 11:29:54,785 INFO L290 TraceCheckUtils]: 105: Hoare triple {25641#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {25681#(<= ~counter~0 6)} is VALID [2022-04-28 11:29:54,785 INFO L290 TraceCheckUtils]: 106: Hoare triple {25681#(<= ~counter~0 6)} assume !!(#t~post7 < 10);havoc #t~post7; {25681#(<= ~counter~0 6)} is VALID [2022-04-28 11:29:54,786 INFO L272 TraceCheckUtils]: 107: Hoare triple {25681#(<= ~counter~0 6)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {25681#(<= ~counter~0 6)} is VALID [2022-04-28 11:29:54,786 INFO L290 TraceCheckUtils]: 108: Hoare triple {25681#(<= ~counter~0 6)} ~cond := #in~cond; {25681#(<= ~counter~0 6)} is VALID [2022-04-28 11:29:54,786 INFO L290 TraceCheckUtils]: 109: Hoare triple {25681#(<= ~counter~0 6)} assume !(0 == ~cond); {25681#(<= ~counter~0 6)} is VALID [2022-04-28 11:29:54,787 INFO L290 TraceCheckUtils]: 110: Hoare triple {25681#(<= ~counter~0 6)} assume true; {25681#(<= ~counter~0 6)} is VALID [2022-04-28 11:29:54,787 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {25681#(<= ~counter~0 6)} {25681#(<= ~counter~0 6)} #83#return; {25681#(<= ~counter~0 6)} is VALID [2022-04-28 11:29:54,787 INFO L272 TraceCheckUtils]: 112: Hoare triple {25681#(<= ~counter~0 6)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {25681#(<= ~counter~0 6)} is VALID [2022-04-28 11:29:54,788 INFO L290 TraceCheckUtils]: 113: Hoare triple {25681#(<= ~counter~0 6)} ~cond := #in~cond; {25681#(<= ~counter~0 6)} is VALID [2022-04-28 11:29:54,788 INFO L290 TraceCheckUtils]: 114: Hoare triple {25681#(<= ~counter~0 6)} assume !(0 == ~cond); {25681#(<= ~counter~0 6)} is VALID [2022-04-28 11:29:54,788 INFO L290 TraceCheckUtils]: 115: Hoare triple {25681#(<= ~counter~0 6)} assume true; {25681#(<= ~counter~0 6)} is VALID [2022-04-28 11:29:54,789 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {25681#(<= ~counter~0 6)} {25681#(<= ~counter~0 6)} #85#return; {25681#(<= ~counter~0 6)} is VALID [2022-04-28 11:29:54,789 INFO L272 TraceCheckUtils]: 117: Hoare triple {25681#(<= ~counter~0 6)} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {25681#(<= ~counter~0 6)} is VALID [2022-04-28 11:29:54,789 INFO L290 TraceCheckUtils]: 118: Hoare triple {25681#(<= ~counter~0 6)} ~cond := #in~cond; {25681#(<= ~counter~0 6)} is VALID [2022-04-28 11:29:54,789 INFO L290 TraceCheckUtils]: 119: Hoare triple {25681#(<= ~counter~0 6)} assume !(0 == ~cond); {25681#(<= ~counter~0 6)} is VALID [2022-04-28 11:29:54,790 INFO L290 TraceCheckUtils]: 120: Hoare triple {25681#(<= ~counter~0 6)} assume true; {25681#(<= ~counter~0 6)} is VALID [2022-04-28 11:29:54,790 INFO L284 TraceCheckUtils]: 121: Hoare quadruple {25681#(<= ~counter~0 6)} {25681#(<= ~counter~0 6)} #87#return; {25681#(<= ~counter~0 6)} is VALID [2022-04-28 11:29:54,790 INFO L290 TraceCheckUtils]: 122: Hoare triple {25681#(<= ~counter~0 6)} assume !!(~r~0 >= 2 * ~b~0); {25681#(<= ~counter~0 6)} is VALID [2022-04-28 11:29:54,791 INFO L272 TraceCheckUtils]: 123: Hoare triple {25681#(<= ~counter~0 6)} call __VERIFIER_assert((if ~r~0 >= 2 * ~y~0 * ~a~0 then 1 else 0)); {25681#(<= ~counter~0 6)} is VALID [2022-04-28 11:29:54,791 INFO L290 TraceCheckUtils]: 124: Hoare triple {25681#(<= ~counter~0 6)} ~cond := #in~cond; {25681#(<= ~counter~0 6)} is VALID [2022-04-28 11:29:54,791 INFO L290 TraceCheckUtils]: 125: Hoare triple {25681#(<= ~counter~0 6)} assume !(0 == ~cond); {25681#(<= ~counter~0 6)} is VALID [2022-04-28 11:29:54,791 INFO L290 TraceCheckUtils]: 126: Hoare triple {25681#(<= ~counter~0 6)} assume true; {25681#(<= ~counter~0 6)} is VALID [2022-04-28 11:29:54,792 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {25681#(<= ~counter~0 6)} {25681#(<= ~counter~0 6)} #89#return; {25681#(<= ~counter~0 6)} is VALID [2022-04-28 11:29:54,792 INFO L290 TraceCheckUtils]: 128: Hoare triple {25681#(<= ~counter~0 6)} ~a~0 := 2 * ~a~0;~b~0 := 2 * ~b~0; {25681#(<= ~counter~0 6)} is VALID [2022-04-28 11:29:54,793 INFO L290 TraceCheckUtils]: 129: Hoare triple {25681#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {25754#(<= ~counter~0 7)} is VALID [2022-04-28 11:29:54,793 INFO L290 TraceCheckUtils]: 130: Hoare triple {25754#(<= ~counter~0 7)} assume !!(#t~post7 < 10);havoc #t~post7; {25754#(<= ~counter~0 7)} is VALID [2022-04-28 11:29:54,794 INFO L272 TraceCheckUtils]: 131: Hoare triple {25754#(<= ~counter~0 7)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {25754#(<= ~counter~0 7)} is VALID [2022-04-28 11:29:54,794 INFO L290 TraceCheckUtils]: 132: Hoare triple {25754#(<= ~counter~0 7)} ~cond := #in~cond; {25754#(<= ~counter~0 7)} is VALID [2022-04-28 11:29:54,794 INFO L290 TraceCheckUtils]: 133: Hoare triple {25754#(<= ~counter~0 7)} assume !(0 == ~cond); {25754#(<= ~counter~0 7)} is VALID [2022-04-28 11:29:54,794 INFO L290 TraceCheckUtils]: 134: Hoare triple {25754#(<= ~counter~0 7)} assume true; {25754#(<= ~counter~0 7)} is VALID [2022-04-28 11:29:54,795 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {25754#(<= ~counter~0 7)} {25754#(<= ~counter~0 7)} #83#return; {25754#(<= ~counter~0 7)} is VALID [2022-04-28 11:29:54,795 INFO L272 TraceCheckUtils]: 136: Hoare triple {25754#(<= ~counter~0 7)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {25754#(<= ~counter~0 7)} is VALID [2022-04-28 11:29:54,795 INFO L290 TraceCheckUtils]: 137: Hoare triple {25754#(<= ~counter~0 7)} ~cond := #in~cond; {25754#(<= ~counter~0 7)} is VALID [2022-04-28 11:29:54,796 INFO L290 TraceCheckUtils]: 138: Hoare triple {25754#(<= ~counter~0 7)} assume !(0 == ~cond); {25754#(<= ~counter~0 7)} is VALID [2022-04-28 11:29:54,796 INFO L290 TraceCheckUtils]: 139: Hoare triple {25754#(<= ~counter~0 7)} assume true; {25754#(<= ~counter~0 7)} is VALID [2022-04-28 11:29:54,796 INFO L284 TraceCheckUtils]: 140: Hoare quadruple {25754#(<= ~counter~0 7)} {25754#(<= ~counter~0 7)} #85#return; {25754#(<= ~counter~0 7)} is VALID [2022-04-28 11:29:54,797 INFO L272 TraceCheckUtils]: 141: Hoare triple {25754#(<= ~counter~0 7)} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {25754#(<= ~counter~0 7)} is VALID [2022-04-28 11:29:54,797 INFO L290 TraceCheckUtils]: 142: Hoare triple {25754#(<= ~counter~0 7)} ~cond := #in~cond; {25754#(<= ~counter~0 7)} is VALID [2022-04-28 11:29:54,797 INFO L290 TraceCheckUtils]: 143: Hoare triple {25754#(<= ~counter~0 7)} assume !(0 == ~cond); {25754#(<= ~counter~0 7)} is VALID [2022-04-28 11:29:54,797 INFO L290 TraceCheckUtils]: 144: Hoare triple {25754#(<= ~counter~0 7)} assume true; {25754#(<= ~counter~0 7)} is VALID [2022-04-28 11:29:54,798 INFO L284 TraceCheckUtils]: 145: Hoare quadruple {25754#(<= ~counter~0 7)} {25754#(<= ~counter~0 7)} #87#return; {25754#(<= ~counter~0 7)} is VALID [2022-04-28 11:29:54,798 INFO L290 TraceCheckUtils]: 146: Hoare triple {25754#(<= ~counter~0 7)} assume !(~r~0 >= 2 * ~b~0); {25754#(<= ~counter~0 7)} is VALID [2022-04-28 11:29:54,798 INFO L290 TraceCheckUtils]: 147: Hoare triple {25754#(<= ~counter~0 7)} ~r~0 := ~r~0 - ~b~0;~q~0 := ~q~0 + ~a~0; {25754#(<= ~counter~0 7)} is VALID [2022-04-28 11:29:54,799 INFO L290 TraceCheckUtils]: 148: Hoare triple {25754#(<= ~counter~0 7)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {25812#(<= |main_#t~post6| 7)} is VALID [2022-04-28 11:29:54,799 INFO L290 TraceCheckUtils]: 149: Hoare triple {25812#(<= |main_#t~post6| 7)} assume !(#t~post6 < 10);havoc #t~post6; {25356#false} is VALID [2022-04-28 11:29:54,799 INFO L272 TraceCheckUtils]: 150: Hoare triple {25356#false} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {25356#false} is VALID [2022-04-28 11:29:54,799 INFO L290 TraceCheckUtils]: 151: Hoare triple {25356#false} ~cond := #in~cond; {25356#false} is VALID [2022-04-28 11:29:54,799 INFO L290 TraceCheckUtils]: 152: Hoare triple {25356#false} assume 0 == ~cond; {25356#false} is VALID [2022-04-28 11:29:54,799 INFO L290 TraceCheckUtils]: 153: Hoare triple {25356#false} assume !false; {25356#false} is VALID [2022-04-28 11:29:54,800 INFO L134 CoverageAnalysis]: Checked inductivity of 1044 backedges. 44 proven. 896 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2022-04-28 11:29:54,800 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:29:55,306 INFO L290 TraceCheckUtils]: 153: Hoare triple {25356#false} assume !false; {25356#false} is VALID [2022-04-28 11:29:55,306 INFO L290 TraceCheckUtils]: 152: Hoare triple {25356#false} assume 0 == ~cond; {25356#false} is VALID [2022-04-28 11:29:55,306 INFO L290 TraceCheckUtils]: 151: Hoare triple {25356#false} ~cond := #in~cond; {25356#false} is VALID [2022-04-28 11:29:55,306 INFO L272 TraceCheckUtils]: 150: Hoare triple {25356#false} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {25356#false} is VALID [2022-04-28 11:29:55,306 INFO L290 TraceCheckUtils]: 149: Hoare triple {25840#(< |main_#t~post6| 10)} assume !(#t~post6 < 10);havoc #t~post6; {25356#false} is VALID [2022-04-28 11:29:55,307 INFO L290 TraceCheckUtils]: 148: Hoare triple {25844#(< ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {25840#(< |main_#t~post6| 10)} is VALID [2022-04-28 11:29:55,307 INFO L290 TraceCheckUtils]: 147: Hoare triple {25844#(< ~counter~0 10)} ~r~0 := ~r~0 - ~b~0;~q~0 := ~q~0 + ~a~0; {25844#(< ~counter~0 10)} is VALID [2022-04-28 11:29:55,307 INFO L290 TraceCheckUtils]: 146: Hoare triple {25844#(< ~counter~0 10)} assume !(~r~0 >= 2 * ~b~0); {25844#(< ~counter~0 10)} is VALID [2022-04-28 11:29:55,308 INFO L284 TraceCheckUtils]: 145: Hoare quadruple {25355#true} {25844#(< ~counter~0 10)} #87#return; {25844#(< ~counter~0 10)} is VALID [2022-04-28 11:29:55,308 INFO L290 TraceCheckUtils]: 144: Hoare triple {25355#true} assume true; {25355#true} is VALID [2022-04-28 11:29:55,308 INFO L290 TraceCheckUtils]: 143: Hoare triple {25355#true} assume !(0 == ~cond); {25355#true} is VALID [2022-04-28 11:29:55,308 INFO L290 TraceCheckUtils]: 142: Hoare triple {25355#true} ~cond := #in~cond; {25355#true} is VALID [2022-04-28 11:29:55,308 INFO L272 TraceCheckUtils]: 141: Hoare triple {25844#(< ~counter~0 10)} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {25355#true} is VALID [2022-04-28 11:29:55,308 INFO L284 TraceCheckUtils]: 140: Hoare quadruple {25355#true} {25844#(< ~counter~0 10)} #85#return; {25844#(< ~counter~0 10)} is VALID [2022-04-28 11:29:55,308 INFO L290 TraceCheckUtils]: 139: Hoare triple {25355#true} assume true; {25355#true} is VALID [2022-04-28 11:29:55,308 INFO L290 TraceCheckUtils]: 138: Hoare triple {25355#true} assume !(0 == ~cond); {25355#true} is VALID [2022-04-28 11:29:55,309 INFO L290 TraceCheckUtils]: 137: Hoare triple {25355#true} ~cond := #in~cond; {25355#true} is VALID [2022-04-28 11:29:55,309 INFO L272 TraceCheckUtils]: 136: Hoare triple {25844#(< ~counter~0 10)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {25355#true} is VALID [2022-04-28 11:29:55,309 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {25355#true} {25844#(< ~counter~0 10)} #83#return; {25844#(< ~counter~0 10)} is VALID [2022-04-28 11:29:55,309 INFO L290 TraceCheckUtils]: 134: Hoare triple {25355#true} assume true; {25355#true} is VALID [2022-04-28 11:29:55,309 INFO L290 TraceCheckUtils]: 133: Hoare triple {25355#true} assume !(0 == ~cond); {25355#true} is VALID [2022-04-28 11:29:55,309 INFO L290 TraceCheckUtils]: 132: Hoare triple {25355#true} ~cond := #in~cond; {25355#true} is VALID [2022-04-28 11:29:55,309 INFO L272 TraceCheckUtils]: 131: Hoare triple {25844#(< ~counter~0 10)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {25355#true} is VALID [2022-04-28 11:29:55,310 INFO L290 TraceCheckUtils]: 130: Hoare triple {25844#(< ~counter~0 10)} assume !!(#t~post7 < 10);havoc #t~post7; {25844#(< ~counter~0 10)} is VALID [2022-04-28 11:29:55,310 INFO L290 TraceCheckUtils]: 129: Hoare triple {25902#(< ~counter~0 9)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {25844#(< ~counter~0 10)} is VALID [2022-04-28 11:29:55,311 INFO L290 TraceCheckUtils]: 128: Hoare triple {25902#(< ~counter~0 9)} ~a~0 := 2 * ~a~0;~b~0 := 2 * ~b~0; {25902#(< ~counter~0 9)} is VALID [2022-04-28 11:29:55,311 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {25355#true} {25902#(< ~counter~0 9)} #89#return; {25902#(< ~counter~0 9)} is VALID [2022-04-28 11:29:55,311 INFO L290 TraceCheckUtils]: 126: Hoare triple {25355#true} assume true; {25355#true} is VALID [2022-04-28 11:29:55,311 INFO L290 TraceCheckUtils]: 125: Hoare triple {25355#true} assume !(0 == ~cond); {25355#true} is VALID [2022-04-28 11:29:55,311 INFO L290 TraceCheckUtils]: 124: Hoare triple {25355#true} ~cond := #in~cond; {25355#true} is VALID [2022-04-28 11:29:55,311 INFO L272 TraceCheckUtils]: 123: Hoare triple {25902#(< ~counter~0 9)} call __VERIFIER_assert((if ~r~0 >= 2 * ~y~0 * ~a~0 then 1 else 0)); {25355#true} is VALID [2022-04-28 11:29:55,312 INFO L290 TraceCheckUtils]: 122: Hoare triple {25902#(< ~counter~0 9)} assume !!(~r~0 >= 2 * ~b~0); {25902#(< ~counter~0 9)} is VALID [2022-04-28 11:29:55,312 INFO L284 TraceCheckUtils]: 121: Hoare quadruple {25355#true} {25902#(< ~counter~0 9)} #87#return; {25902#(< ~counter~0 9)} is VALID [2022-04-28 11:29:55,312 INFO L290 TraceCheckUtils]: 120: Hoare triple {25355#true} assume true; {25355#true} is VALID [2022-04-28 11:29:55,312 INFO L290 TraceCheckUtils]: 119: Hoare triple {25355#true} assume !(0 == ~cond); {25355#true} is VALID [2022-04-28 11:29:55,312 INFO L290 TraceCheckUtils]: 118: Hoare triple {25355#true} ~cond := #in~cond; {25355#true} is VALID [2022-04-28 11:29:55,312 INFO L272 TraceCheckUtils]: 117: Hoare triple {25902#(< ~counter~0 9)} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {25355#true} is VALID [2022-04-28 11:29:55,313 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {25355#true} {25902#(< ~counter~0 9)} #85#return; {25902#(< ~counter~0 9)} is VALID [2022-04-28 11:29:55,313 INFO L290 TraceCheckUtils]: 115: Hoare triple {25355#true} assume true; {25355#true} is VALID [2022-04-28 11:29:55,313 INFO L290 TraceCheckUtils]: 114: Hoare triple {25355#true} assume !(0 == ~cond); {25355#true} is VALID [2022-04-28 11:29:55,313 INFO L290 TraceCheckUtils]: 113: Hoare triple {25355#true} ~cond := #in~cond; {25355#true} is VALID [2022-04-28 11:29:55,313 INFO L272 TraceCheckUtils]: 112: Hoare triple {25902#(< ~counter~0 9)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {25355#true} is VALID [2022-04-28 11:29:55,313 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {25355#true} {25902#(< ~counter~0 9)} #83#return; {25902#(< ~counter~0 9)} is VALID [2022-04-28 11:29:55,313 INFO L290 TraceCheckUtils]: 110: Hoare triple {25355#true} assume true; {25355#true} is VALID [2022-04-28 11:29:55,314 INFO L290 TraceCheckUtils]: 109: Hoare triple {25355#true} assume !(0 == ~cond); {25355#true} is VALID [2022-04-28 11:29:55,314 INFO L290 TraceCheckUtils]: 108: Hoare triple {25355#true} ~cond := #in~cond; {25355#true} is VALID [2022-04-28 11:29:55,314 INFO L272 TraceCheckUtils]: 107: Hoare triple {25902#(< ~counter~0 9)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {25355#true} is VALID [2022-04-28 11:29:55,314 INFO L290 TraceCheckUtils]: 106: Hoare triple {25902#(< ~counter~0 9)} assume !!(#t~post7 < 10);havoc #t~post7; {25902#(< ~counter~0 9)} is VALID [2022-04-28 11:29:55,315 INFO L290 TraceCheckUtils]: 105: Hoare triple {25754#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {25902#(< ~counter~0 9)} is VALID [2022-04-28 11:29:55,323 INFO L290 TraceCheckUtils]: 104: Hoare triple {25754#(<= ~counter~0 7)} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {25754#(<= ~counter~0 7)} is VALID [2022-04-28 11:29:55,324 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {25355#true} {25754#(<= ~counter~0 7)} #81#return; {25754#(<= ~counter~0 7)} is VALID [2022-04-28 11:29:55,324 INFO L290 TraceCheckUtils]: 102: Hoare triple {25355#true} assume true; {25355#true} is VALID [2022-04-28 11:29:55,324 INFO L290 TraceCheckUtils]: 101: Hoare triple {25355#true} assume !(0 == ~cond); {25355#true} is VALID [2022-04-28 11:29:55,324 INFO L290 TraceCheckUtils]: 100: Hoare triple {25355#true} ~cond := #in~cond; {25355#true} is VALID [2022-04-28 11:29:55,324 INFO L272 TraceCheckUtils]: 99: Hoare triple {25754#(<= ~counter~0 7)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {25355#true} is VALID [2022-04-28 11:29:55,325 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {25355#true} {25754#(<= ~counter~0 7)} #79#return; {25754#(<= ~counter~0 7)} is VALID [2022-04-28 11:29:55,325 INFO L290 TraceCheckUtils]: 97: Hoare triple {25355#true} assume true; {25355#true} is VALID [2022-04-28 11:29:55,325 INFO L290 TraceCheckUtils]: 96: Hoare triple {25355#true} assume !(0 == ~cond); {25355#true} is VALID [2022-04-28 11:29:55,325 INFO L290 TraceCheckUtils]: 95: Hoare triple {25355#true} ~cond := #in~cond; {25355#true} is VALID [2022-04-28 11:29:55,325 INFO L272 TraceCheckUtils]: 94: Hoare triple {25754#(<= ~counter~0 7)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {25355#true} is VALID [2022-04-28 11:29:55,325 INFO L290 TraceCheckUtils]: 93: Hoare triple {25754#(<= ~counter~0 7)} assume !!(#t~post6 < 10);havoc #t~post6; {25754#(<= ~counter~0 7)} is VALID [2022-04-28 11:29:55,326 INFO L290 TraceCheckUtils]: 92: Hoare triple {25681#(<= ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {25754#(<= ~counter~0 7)} is VALID [2022-04-28 11:29:55,327 INFO L290 TraceCheckUtils]: 91: Hoare triple {25681#(<= ~counter~0 6)} ~r~0 := ~r~0 - ~b~0;~q~0 := ~q~0 + ~a~0; {25681#(<= ~counter~0 6)} is VALID [2022-04-28 11:29:55,327 INFO L290 TraceCheckUtils]: 90: Hoare triple {25681#(<= ~counter~0 6)} assume !(~r~0 >= 2 * ~b~0); {25681#(<= ~counter~0 6)} is VALID [2022-04-28 11:29:55,327 INFO L284 TraceCheckUtils]: 89: Hoare quadruple {25355#true} {25681#(<= ~counter~0 6)} #87#return; {25681#(<= ~counter~0 6)} is VALID [2022-04-28 11:29:55,327 INFO L290 TraceCheckUtils]: 88: Hoare triple {25355#true} assume true; {25355#true} is VALID [2022-04-28 11:29:55,327 INFO L290 TraceCheckUtils]: 87: Hoare triple {25355#true} assume !(0 == ~cond); {25355#true} is VALID [2022-04-28 11:29:55,328 INFO L290 TraceCheckUtils]: 86: Hoare triple {25355#true} ~cond := #in~cond; {25355#true} is VALID [2022-04-28 11:29:55,328 INFO L272 TraceCheckUtils]: 85: Hoare triple {25681#(<= ~counter~0 6)} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {25355#true} is VALID [2022-04-28 11:29:55,328 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {25355#true} {25681#(<= ~counter~0 6)} #85#return; {25681#(<= ~counter~0 6)} is VALID [2022-04-28 11:29:55,328 INFO L290 TraceCheckUtils]: 83: Hoare triple {25355#true} assume true; {25355#true} is VALID [2022-04-28 11:29:55,328 INFO L290 TraceCheckUtils]: 82: Hoare triple {25355#true} assume !(0 == ~cond); {25355#true} is VALID [2022-04-28 11:29:55,328 INFO L290 TraceCheckUtils]: 81: Hoare triple {25355#true} ~cond := #in~cond; {25355#true} is VALID [2022-04-28 11:29:55,328 INFO L272 TraceCheckUtils]: 80: Hoare triple {25681#(<= ~counter~0 6)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {25355#true} is VALID [2022-04-28 11:29:55,329 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {25355#true} {25681#(<= ~counter~0 6)} #83#return; {25681#(<= ~counter~0 6)} is VALID [2022-04-28 11:29:55,329 INFO L290 TraceCheckUtils]: 78: Hoare triple {25355#true} assume true; {25355#true} is VALID [2022-04-28 11:29:55,329 INFO L290 TraceCheckUtils]: 77: Hoare triple {25355#true} assume !(0 == ~cond); {25355#true} is VALID [2022-04-28 11:29:55,329 INFO L290 TraceCheckUtils]: 76: Hoare triple {25355#true} ~cond := #in~cond; {25355#true} is VALID [2022-04-28 11:29:55,329 INFO L272 TraceCheckUtils]: 75: Hoare triple {25681#(<= ~counter~0 6)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {25355#true} is VALID [2022-04-28 11:29:55,330 INFO L290 TraceCheckUtils]: 74: Hoare triple {25681#(<= ~counter~0 6)} assume !!(#t~post7 < 10);havoc #t~post7; {25681#(<= ~counter~0 6)} is VALID [2022-04-28 11:29:55,330 INFO L290 TraceCheckUtils]: 73: Hoare triple {25641#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {25681#(<= ~counter~0 6)} is VALID [2022-04-28 11:29:55,331 INFO L290 TraceCheckUtils]: 72: Hoare triple {25641#(<= ~counter~0 5)} ~a~0 := 2 * ~a~0;~b~0 := 2 * ~b~0; {25641#(<= ~counter~0 5)} is VALID [2022-04-28 11:29:55,331 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {25355#true} {25641#(<= ~counter~0 5)} #89#return; {25641#(<= ~counter~0 5)} is VALID [2022-04-28 11:29:55,331 INFO L290 TraceCheckUtils]: 70: Hoare triple {25355#true} assume true; {25355#true} is VALID [2022-04-28 11:29:55,331 INFO L290 TraceCheckUtils]: 69: Hoare triple {25355#true} assume !(0 == ~cond); {25355#true} is VALID [2022-04-28 11:29:55,331 INFO L290 TraceCheckUtils]: 68: Hoare triple {25355#true} ~cond := #in~cond; {25355#true} is VALID [2022-04-28 11:29:55,332 INFO L272 TraceCheckUtils]: 67: Hoare triple {25641#(<= ~counter~0 5)} call __VERIFIER_assert((if ~r~0 >= 2 * ~y~0 * ~a~0 then 1 else 0)); {25355#true} is VALID [2022-04-28 11:29:55,332 INFO L290 TraceCheckUtils]: 66: Hoare triple {25641#(<= ~counter~0 5)} assume !!(~r~0 >= 2 * ~b~0); {25641#(<= ~counter~0 5)} is VALID [2022-04-28 11:29:55,332 INFO L284 TraceCheckUtils]: 65: Hoare quadruple {25355#true} {25641#(<= ~counter~0 5)} #87#return; {25641#(<= ~counter~0 5)} is VALID [2022-04-28 11:29:55,332 INFO L290 TraceCheckUtils]: 64: Hoare triple {25355#true} assume true; {25355#true} is VALID [2022-04-28 11:29:55,332 INFO L290 TraceCheckUtils]: 63: Hoare triple {25355#true} assume !(0 == ~cond); {25355#true} is VALID [2022-04-28 11:29:55,332 INFO L290 TraceCheckUtils]: 62: Hoare triple {25355#true} ~cond := #in~cond; {25355#true} is VALID [2022-04-28 11:29:55,333 INFO L272 TraceCheckUtils]: 61: Hoare triple {25641#(<= ~counter~0 5)} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {25355#true} is VALID [2022-04-28 11:29:55,333 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {25355#true} {25641#(<= ~counter~0 5)} #85#return; {25641#(<= ~counter~0 5)} is VALID [2022-04-28 11:29:55,333 INFO L290 TraceCheckUtils]: 59: Hoare triple {25355#true} assume true; {25355#true} is VALID [2022-04-28 11:29:55,333 INFO L290 TraceCheckUtils]: 58: Hoare triple {25355#true} assume !(0 == ~cond); {25355#true} is VALID [2022-04-28 11:29:55,333 INFO L290 TraceCheckUtils]: 57: Hoare triple {25355#true} ~cond := #in~cond; {25355#true} is VALID [2022-04-28 11:29:55,333 INFO L272 TraceCheckUtils]: 56: Hoare triple {25641#(<= ~counter~0 5)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {25355#true} is VALID [2022-04-28 11:29:55,334 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {25355#true} {25641#(<= ~counter~0 5)} #83#return; {25641#(<= ~counter~0 5)} is VALID [2022-04-28 11:29:55,334 INFO L290 TraceCheckUtils]: 54: Hoare triple {25355#true} assume true; {25355#true} is VALID [2022-04-28 11:29:55,334 INFO L290 TraceCheckUtils]: 53: Hoare triple {25355#true} assume !(0 == ~cond); {25355#true} is VALID [2022-04-28 11:29:55,334 INFO L290 TraceCheckUtils]: 52: Hoare triple {25355#true} ~cond := #in~cond; {25355#true} is VALID [2022-04-28 11:29:55,334 INFO L272 TraceCheckUtils]: 51: Hoare triple {25641#(<= ~counter~0 5)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {25355#true} is VALID [2022-04-28 11:29:55,334 INFO L290 TraceCheckUtils]: 50: Hoare triple {25641#(<= ~counter~0 5)} assume !!(#t~post7 < 10);havoc #t~post7; {25641#(<= ~counter~0 5)} is VALID [2022-04-28 11:29:55,335 INFO L290 TraceCheckUtils]: 49: Hoare triple {25583#(<= ~counter~0 4)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {25641#(<= ~counter~0 5)} is VALID [2022-04-28 11:29:55,336 INFO L290 TraceCheckUtils]: 48: Hoare triple {25583#(<= ~counter~0 4)} ~a~0 := 2 * ~a~0;~b~0 := 2 * ~b~0; {25583#(<= ~counter~0 4)} is VALID [2022-04-28 11:29:55,336 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {25355#true} {25583#(<= ~counter~0 4)} #89#return; {25583#(<= ~counter~0 4)} is VALID [2022-04-28 11:29:55,336 INFO L290 TraceCheckUtils]: 46: Hoare triple {25355#true} assume true; {25355#true} is VALID [2022-04-28 11:29:55,336 INFO L290 TraceCheckUtils]: 45: Hoare triple {25355#true} assume !(0 == ~cond); {25355#true} is VALID [2022-04-28 11:29:55,336 INFO L290 TraceCheckUtils]: 44: Hoare triple {25355#true} ~cond := #in~cond; {25355#true} is VALID [2022-04-28 11:29:55,337 INFO L272 TraceCheckUtils]: 43: Hoare triple {25583#(<= ~counter~0 4)} call __VERIFIER_assert((if ~r~0 >= 2 * ~y~0 * ~a~0 then 1 else 0)); {25355#true} is VALID [2022-04-28 11:29:55,337 INFO L290 TraceCheckUtils]: 42: Hoare triple {25583#(<= ~counter~0 4)} assume !!(~r~0 >= 2 * ~b~0); {25583#(<= ~counter~0 4)} is VALID [2022-04-28 11:29:55,337 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {25355#true} {25583#(<= ~counter~0 4)} #87#return; {25583#(<= ~counter~0 4)} is VALID [2022-04-28 11:29:55,337 INFO L290 TraceCheckUtils]: 40: Hoare triple {25355#true} assume true; {25355#true} is VALID [2022-04-28 11:29:55,337 INFO L290 TraceCheckUtils]: 39: Hoare triple {25355#true} assume !(0 == ~cond); {25355#true} is VALID [2022-04-28 11:29:55,337 INFO L290 TraceCheckUtils]: 38: Hoare triple {25355#true} ~cond := #in~cond; {25355#true} is VALID [2022-04-28 11:29:55,338 INFO L272 TraceCheckUtils]: 37: Hoare triple {25583#(<= ~counter~0 4)} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {25355#true} is VALID [2022-04-28 11:29:55,338 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {25355#true} {25583#(<= ~counter~0 4)} #85#return; {25583#(<= ~counter~0 4)} is VALID [2022-04-28 11:29:55,338 INFO L290 TraceCheckUtils]: 35: Hoare triple {25355#true} assume true; {25355#true} is VALID [2022-04-28 11:29:55,338 INFO L290 TraceCheckUtils]: 34: Hoare triple {25355#true} assume !(0 == ~cond); {25355#true} is VALID [2022-04-28 11:29:55,338 INFO L290 TraceCheckUtils]: 33: Hoare triple {25355#true} ~cond := #in~cond; {25355#true} is VALID [2022-04-28 11:29:55,338 INFO L272 TraceCheckUtils]: 32: Hoare triple {25583#(<= ~counter~0 4)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {25355#true} is VALID [2022-04-28 11:29:55,339 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {25355#true} {25583#(<= ~counter~0 4)} #83#return; {25583#(<= ~counter~0 4)} is VALID [2022-04-28 11:29:55,339 INFO L290 TraceCheckUtils]: 30: Hoare triple {25355#true} assume true; {25355#true} is VALID [2022-04-28 11:29:55,339 INFO L290 TraceCheckUtils]: 29: Hoare triple {25355#true} assume !(0 == ~cond); {25355#true} is VALID [2022-04-28 11:29:55,339 INFO L290 TraceCheckUtils]: 28: Hoare triple {25355#true} ~cond := #in~cond; {25355#true} is VALID [2022-04-28 11:29:55,339 INFO L272 TraceCheckUtils]: 27: Hoare triple {25583#(<= ~counter~0 4)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {25355#true} is VALID [2022-04-28 11:29:55,339 INFO L290 TraceCheckUtils]: 26: Hoare triple {25583#(<= ~counter~0 4)} assume !!(#t~post7 < 10);havoc #t~post7; {25583#(<= ~counter~0 4)} is VALID [2022-04-28 11:29:55,340 INFO L290 TraceCheckUtils]: 25: Hoare triple {25510#(<= ~counter~0 3)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {25583#(<= ~counter~0 4)} is VALID [2022-04-28 11:29:55,340 INFO L290 TraceCheckUtils]: 24: Hoare triple {25510#(<= ~counter~0 3)} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {25510#(<= ~counter~0 3)} is VALID [2022-04-28 11:29:55,341 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {25355#true} {25510#(<= ~counter~0 3)} #81#return; {25510#(<= ~counter~0 3)} is VALID [2022-04-28 11:29:55,341 INFO L290 TraceCheckUtils]: 22: Hoare triple {25355#true} assume true; {25355#true} is VALID [2022-04-28 11:29:55,341 INFO L290 TraceCheckUtils]: 21: Hoare triple {25355#true} assume !(0 == ~cond); {25355#true} is VALID [2022-04-28 11:29:55,341 INFO L290 TraceCheckUtils]: 20: Hoare triple {25355#true} ~cond := #in~cond; {25355#true} is VALID [2022-04-28 11:29:55,341 INFO L272 TraceCheckUtils]: 19: Hoare triple {25510#(<= ~counter~0 3)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {25355#true} is VALID [2022-04-28 11:29:55,342 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {25355#true} {25510#(<= ~counter~0 3)} #79#return; {25510#(<= ~counter~0 3)} is VALID [2022-04-28 11:29:55,342 INFO L290 TraceCheckUtils]: 17: Hoare triple {25355#true} assume true; {25355#true} is VALID [2022-04-28 11:29:55,342 INFO L290 TraceCheckUtils]: 16: Hoare triple {25355#true} assume !(0 == ~cond); {25355#true} is VALID [2022-04-28 11:29:55,342 INFO L290 TraceCheckUtils]: 15: Hoare triple {25355#true} ~cond := #in~cond; {25355#true} is VALID [2022-04-28 11:29:55,342 INFO L272 TraceCheckUtils]: 14: Hoare triple {25510#(<= ~counter~0 3)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {25355#true} is VALID [2022-04-28 11:29:55,342 INFO L290 TraceCheckUtils]: 13: Hoare triple {25510#(<= ~counter~0 3)} assume !!(#t~post6 < 10);havoc #t~post6; {25510#(<= ~counter~0 3)} is VALID [2022-04-28 11:29:55,343 INFO L290 TraceCheckUtils]: 12: Hoare triple {25437#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {25510#(<= ~counter~0 3)} is VALID [2022-04-28 11:29:55,343 INFO L290 TraceCheckUtils]: 11: Hoare triple {25437#(<= ~counter~0 2)} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {25437#(<= ~counter~0 2)} is VALID [2022-04-28 11:29:55,343 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {25355#true} {25437#(<= ~counter~0 2)} #77#return; {25437#(<= ~counter~0 2)} is VALID [2022-04-28 11:29:55,343 INFO L290 TraceCheckUtils]: 9: Hoare triple {25355#true} assume true; {25355#true} is VALID [2022-04-28 11:29:55,343 INFO L290 TraceCheckUtils]: 8: Hoare triple {25355#true} assume !(0 == ~cond); {25355#true} is VALID [2022-04-28 11:29:55,344 INFO L290 TraceCheckUtils]: 7: Hoare triple {25355#true} ~cond := #in~cond; {25355#true} is VALID [2022-04-28 11:29:55,344 INFO L272 TraceCheckUtils]: 6: Hoare triple {25437#(<= ~counter~0 2)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {25355#true} is VALID [2022-04-28 11:29:55,344 INFO L290 TraceCheckUtils]: 5: Hoare triple {25437#(<= ~counter~0 2)} 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; {25437#(<= ~counter~0 2)} is VALID [2022-04-28 11:29:55,344 INFO L272 TraceCheckUtils]: 4: Hoare triple {25437#(<= ~counter~0 2)} call #t~ret8 := main(); {25437#(<= ~counter~0 2)} is VALID [2022-04-28 11:29:55,344 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25437#(<= ~counter~0 2)} {25355#true} #93#return; {25437#(<= ~counter~0 2)} is VALID [2022-04-28 11:29:55,345 INFO L290 TraceCheckUtils]: 2: Hoare triple {25437#(<= ~counter~0 2)} assume true; {25437#(<= ~counter~0 2)} is VALID [2022-04-28 11:29:55,345 INFO L290 TraceCheckUtils]: 1: Hoare triple {25355#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; {25437#(<= ~counter~0 2)} is VALID [2022-04-28 11:29:55,345 INFO L272 TraceCheckUtils]: 0: Hoare triple {25355#true} call ULTIMATE.init(); {25355#true} is VALID [2022-04-28 11:29:55,346 INFO L134 CoverageAnalysis]: Checked inductivity of 1044 backedges. 44 proven. 76 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2022-04-28 11:29:55,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:29:55,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321732060] [2022-04-28 11:29:55,346 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:29:55,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1924247923] [2022-04-28 11:29:55,346 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1924247923] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 11:29:55,346 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 11:29:55,346 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 14 [2022-04-28 11:29:55,346 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:29:55,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [391030996] [2022-04-28 11:29:55,346 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [391030996] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:29:55,347 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:29:55,347 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 11:29:55,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859193937] [2022-04-28 11:29:55,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:29:55,347 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 10 states have internal predecessors, (59), 10 states have call successors, (26), 10 states have call predecessors, (26), 8 states have return successors, (24), 8 states have call predecessors, (24), 9 states have call successors, (24) Word has length 154 [2022-04-28 11:29:55,347 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:29:55,347 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 10 states have internal predecessors, (59), 10 states have call successors, (26), 10 states have call predecessors, (26), 8 states have return successors, (24), 8 states have call predecessors, (24), 9 states have call successors, (24) [2022-04-28 11:29:55,429 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:29:55,429 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 11:29:55,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:29:55,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 11:29:55,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-28 11:29:55,430 INFO L87 Difference]: Start difference. First operand 291 states and 331 transitions. Second operand has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 10 states have internal predecessors, (59), 10 states have call successors, (26), 10 states have call predecessors, (26), 8 states have return successors, (24), 8 states have call predecessors, (24), 9 states have call successors, (24) [2022-04-28 11:29:56,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:29:56,500 INFO L93 Difference]: Finished difference Result 366 states and 417 transitions. [2022-04-28 11:29:56,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-28 11:29:56,500 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 10 states have internal predecessors, (59), 10 states have call successors, (26), 10 states have call predecessors, (26), 8 states have return successors, (24), 8 states have call predecessors, (24), 9 states have call successors, (24) Word has length 154 [2022-04-28 11:29:56,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:29:56,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 10 states have internal predecessors, (59), 10 states have call successors, (26), 10 states have call predecessors, (26), 8 states have return successors, (24), 8 states have call predecessors, (24), 9 states have call successors, (24) [2022-04-28 11:29:56,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 181 transitions. [2022-04-28 11:29:56,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 10 states have internal predecessors, (59), 10 states have call successors, (26), 10 states have call predecessors, (26), 8 states have return successors, (24), 8 states have call predecessors, (24), 9 states have call successors, (24) [2022-04-28 11:29:56,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 181 transitions. [2022-04-28 11:29:56,504 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 181 transitions. [2022-04-28 11:29:56,653 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 181 edges. 181 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:29:56,659 INFO L225 Difference]: With dead ends: 366 [2022-04-28 11:29:56,659 INFO L226 Difference]: Without dead ends: 359 [2022-04-28 11:29:56,660 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 311 GetRequests, 294 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=114, Invalid=192, Unknown=0, NotChecked=0, Total=306 [2022-04-28 11:29:56,660 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 62 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 11:29:56,660 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 244 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 11:29:56,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2022-04-28 11:29:57,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 348. [2022-04-28 11:29:57,146 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:29:57,147 INFO L82 GeneralOperation]: Start isEquivalent. First operand 359 states. Second operand has 348 states, 226 states have (on average 1.092920353982301) internal successors, (247), 231 states have internal predecessors, (247), 77 states have call successors, (77), 46 states have call predecessors, (77), 44 states have return successors, (74), 70 states have call predecessors, (74), 74 states have call successors, (74) [2022-04-28 11:29:57,147 INFO L74 IsIncluded]: Start isIncluded. First operand 359 states. Second operand has 348 states, 226 states have (on average 1.092920353982301) internal successors, (247), 231 states have internal predecessors, (247), 77 states have call successors, (77), 46 states have call predecessors, (77), 44 states have return successors, (74), 70 states have call predecessors, (74), 74 states have call successors, (74) [2022-04-28 11:29:57,148 INFO L87 Difference]: Start difference. First operand 359 states. Second operand has 348 states, 226 states have (on average 1.092920353982301) internal successors, (247), 231 states have internal predecessors, (247), 77 states have call successors, (77), 46 states have call predecessors, (77), 44 states have return successors, (74), 70 states have call predecessors, (74), 74 states have call successors, (74) [2022-04-28 11:29:57,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:29:57,153 INFO L93 Difference]: Finished difference Result 359 states and 409 transitions. [2022-04-28 11:29:57,153 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 409 transitions. [2022-04-28 11:29:57,154 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:29:57,154 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:29:57,154 INFO L74 IsIncluded]: Start isIncluded. First operand has 348 states, 226 states have (on average 1.092920353982301) internal successors, (247), 231 states have internal predecessors, (247), 77 states have call successors, (77), 46 states have call predecessors, (77), 44 states have return successors, (74), 70 states have call predecessors, (74), 74 states have call successors, (74) Second operand 359 states. [2022-04-28 11:29:57,155 INFO L87 Difference]: Start difference. First operand has 348 states, 226 states have (on average 1.092920353982301) internal successors, (247), 231 states have internal predecessors, (247), 77 states have call successors, (77), 46 states have call predecessors, (77), 44 states have return successors, (74), 70 states have call predecessors, (74), 74 states have call successors, (74) Second operand 359 states. [2022-04-28 11:29:57,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:29:57,160 INFO L93 Difference]: Finished difference Result 359 states and 409 transitions. [2022-04-28 11:29:57,160 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 409 transitions. [2022-04-28 11:29:57,161 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:29:57,161 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:29:57,161 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:29:57,161 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:29:57,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 348 states, 226 states have (on average 1.092920353982301) internal successors, (247), 231 states have internal predecessors, (247), 77 states have call successors, (77), 46 states have call predecessors, (77), 44 states have return successors, (74), 70 states have call predecessors, (74), 74 states have call successors, (74) [2022-04-28 11:29:57,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 398 transitions. [2022-04-28 11:29:57,168 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 398 transitions. Word has length 154 [2022-04-28 11:29:57,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:29:57,169 INFO L495 AbstractCegarLoop]: Abstraction has 348 states and 398 transitions. [2022-04-28 11:29:57,169 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 10 states have internal predecessors, (59), 10 states have call successors, (26), 10 states have call predecessors, (26), 8 states have return successors, (24), 8 states have call predecessors, (24), 9 states have call successors, (24) [2022-04-28 11:29:57,169 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 348 states and 398 transitions. [2022-04-28 11:29:57,748 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 398 edges. 398 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:29:57,748 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 398 transitions. [2022-04-28 11:29:57,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2022-04-28 11:29:57,750 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:29:57,750 INFO L195 NwaCegarLoop]: trace histogram [24, 23, 23, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:29:57,781 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-28 11:29:57,963 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-04-28 11:29:57,963 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:29:57,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:29:57,963 INFO L85 PathProgramCache]: Analyzing trace with hash -1775621107, now seen corresponding path program 3 times [2022-04-28 11:29:57,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:29:57,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2032226761] [2022-04-28 11:30:42,142 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:30:42,143 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:30:42,143 INFO L85 PathProgramCache]: Analyzing trace with hash -1775621107, now seen corresponding path program 4 times [2022-04-28 11:30:42,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:30:42,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139384477] [2022-04-28 11:30:42,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:30:42,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:30:42,166 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:30:42,166 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [218117267] [2022-04-28 11:30:42,166 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 11:30:42,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:30:42,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:30:42,167 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 11:30:42,168 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-04-28 11:30:42,246 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 11:30:42,247 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:30:42,248 INFO L263 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 44 conjunts are in the unsatisfiable core [2022-04-28 11:30:42,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:30:42,274 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:31:19,045 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 11:31:24,145 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful