java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_compound_exp_cong.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/gcd_2.i_4.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 16:38:35,916 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 16:38:35,918 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 16:38:35,930 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 16:38:35,930 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 16:38:35,932 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 16:38:35,933 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 16:38:35,935 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 16:38:35,936 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 16:38:35,937 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 16:38:35,938 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 16:38:35,938 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 16:38:35,939 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 16:38:35,940 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 16:38:35,942 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 16:38:35,942 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 16:38:35,943 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 16:38:35,945 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 16:38:35,947 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 16:38:35,949 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 16:38:35,950 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 16:38:35,953 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 16:38:35,960 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 16:38:35,961 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 16:38:35,961 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 16:38:35,962 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 16:38:35,965 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 16:38:35,966 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 16:38:35,967 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 16:38:35,968 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 16:38:35,968 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 16:38:35,969 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 16:38:35,969 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 16:38:35,969 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 16:38:35,970 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 16:38:35,971 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 16:38:35,971 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_compound_exp_cong.epf [2018-12-03 16:38:35,984 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 16:38:35,984 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 16:38:35,985 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 16:38:35,985 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 16:38:35,985 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 16:38:35,986 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 16:38:35,986 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 16:38:35,986 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 16:38:35,986 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 16:38:35,986 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 16:38:35,987 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 16:38:35,987 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 16:38:35,987 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 16:38:35,987 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 16:38:35,987 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 16:38:35,988 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 16:38:35,988 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 16:38:35,988 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 16:38:35,989 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 16:38:35,989 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 16:38:35,989 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 16:38:35,989 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 16:38:35,989 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 16:38:35,990 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 16:38:35,990 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 16:38:35,990 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 16:38:35,990 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 16:38:35,990 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 16:38:35,990 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 16:38:35,991 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 16:38:35,991 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 16:38:35,991 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 16:38:35,991 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 16:38:35,992 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 16:38:35,992 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 16:38:35,992 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 16:38:35,992 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 16:38:35,992 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 16:38:35,992 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 16:38:35,993 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 16:38:35,993 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 16:38:36,025 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 16:38:36,038 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 16:38:36,046 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 16:38:36,048 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 16:38:36,048 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 16:38:36,049 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/gcd_2.i_4.bpl [2018-12-03 16:38:36,049 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/gcd_2.i_4.bpl' [2018-12-03 16:38:36,102 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 16:38:36,104 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 16:38:36,104 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 16:38:36,105 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 16:38:36,105 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 16:38:36,122 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "gcd_2.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:38:36" (1/1) ... [2018-12-03 16:38:36,131 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "gcd_2.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:38:36" (1/1) ... [2018-12-03 16:38:36,141 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 16:38:36,142 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 16:38:36,142 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 16:38:36,142 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 16:38:36,155 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "gcd_2.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:38:36" (1/1) ... [2018-12-03 16:38:36,155 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "gcd_2.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:38:36" (1/1) ... [2018-12-03 16:38:36,156 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "gcd_2.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:38:36" (1/1) ... [2018-12-03 16:38:36,156 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "gcd_2.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:38:36" (1/1) ... [2018-12-03 16:38:36,160 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "gcd_2.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:38:36" (1/1) ... [2018-12-03 16:38:36,162 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "gcd_2.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:38:36" (1/1) ... [2018-12-03 16:38:36,163 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "gcd_2.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:38:36" (1/1) ... [2018-12-03 16:38:36,165 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 16:38:36,165 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 16:38:36,166 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 16:38:36,166 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 16:38:36,167 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "gcd_2.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:38:36" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 16:38:36,229 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 16:38:36,229 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 16:38:36,422 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 16:38:36,422 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-03 16:38:36,423 INFO L202 PluginConnector]: Adding new model gcd_2.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 04:38:36 BoogieIcfgContainer [2018-12-03 16:38:36,423 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 16:38:36,424 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 16:38:36,424 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 16:38:36,427 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 16:38:36,428 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "gcd_2.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:38:36" (1/2) ... [2018-12-03 16:38:36,429 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6559f18a and model type gcd_2.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 04:38:36, skipping insertion in model container [2018-12-03 16:38:36,429 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "gcd_2.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 04:38:36" (2/2) ... [2018-12-03 16:38:36,431 INFO L112 eAbstractionObserver]: Analyzing ICFG gcd_2.i_4.bpl [2018-12-03 16:38:36,441 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 16:38:36,452 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 16:38:36,470 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 16:38:36,506 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 16:38:36,506 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 16:38:36,506 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 16:38:36,507 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 16:38:36,507 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 16:38:36,507 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 16:38:36,507 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 16:38:36,507 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 16:38:36,523 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2018-12-03 16:38:36,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-12-03 16:38:36,530 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:38:36,531 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-12-03 16:38:36,533 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:38:36,540 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:38:36,540 INFO L82 PathProgramCache]: Analyzing trace with hash 29955, now seen corresponding path program 1 times [2018-12-03 16:38:36,543 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:38:36,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:38:36,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:38:36,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:38:36,597 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:38:36,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:38:36,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:38:36,714 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:38:36,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 16:38:36,715 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:38:36,719 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:38:36,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:38:36,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:38:36,735 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2018-12-03 16:38:36,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:38:36,778 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2018-12-03 16:38:36,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:38:36,780 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2018-12-03 16:38:36,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:38:36,791 INFO L225 Difference]: With dead ends: 9 [2018-12-03 16:38:36,791 INFO L226 Difference]: Without dead ends: 5 [2018-12-03 16:38:36,799 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:38:36,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2018-12-03 16:38:36,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2018-12-03 16:38:36,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-03 16:38:36,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2018-12-03 16:38:36,846 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2018-12-03 16:38:36,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:38:36,847 INFO L480 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2018-12-03 16:38:36,847 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:38:36,847 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2018-12-03 16:38:36,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-12-03 16:38:36,852 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:38:36,852 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-12-03 16:38:36,853 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:38:36,853 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:38:36,853 INFO L82 PathProgramCache]: Analyzing trace with hash 930412, now seen corresponding path program 1 times [2018-12-03 16:38:36,853 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:38:36,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:38:36,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:38:36,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:38:36,855 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:38:36,872 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-12-03 16:38:36,872 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-12-03 16:38:36,872 INFO L169 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-12-03 16:38:36,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:38:36,926 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2018-12-03 16:38:36,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:38:36,987 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2018-12-03 16:38:36,992 INFO L205 CegarAbsIntRunner]: [0], [5], [7], [9] [2018-12-03 16:38:37,032 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 16:38:37,032 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 16:38:37,200 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 16:38:37,202 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-03 16:38:37,219 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:38:37,220 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 16:38:37,221 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:38:37,221 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:38:37,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:38:37,234 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:38:37,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:38:37,275 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:38:37,355 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:38:37,355 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:38:37,404 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:38:37,426 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-03 16:38:37,426 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2018-12-03 16:38:37,426 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:38:37,427 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 16:38:37,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 16:38:37,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 16:38:37,428 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 4 states. [2018-12-03 16:38:37,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:38:37,477 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2018-12-03 16:38:37,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 16:38:37,478 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2018-12-03 16:38:37,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:38:37,479 INFO L225 Difference]: With dead ends: 8 [2018-12-03 16:38:37,479 INFO L226 Difference]: Without dead ends: 6 [2018-12-03 16:38:37,480 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 16:38:37,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2018-12-03 16:38:37,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2018-12-03 16:38:37,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-03 16:38:37,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2018-12-03 16:38:37,484 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2018-12-03 16:38:37,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:38:37,484 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2018-12-03 16:38:37,485 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 16:38:37,485 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2018-12-03 16:38:37,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-03 16:38:37,485 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:38:37,485 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2018-12-03 16:38:37,486 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:38:37,486 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:38:37,486 INFO L82 PathProgramCache]: Analyzing trace with hash 28844579, now seen corresponding path program 2 times [2018-12-03 16:38:37,486 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:38:37,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:38:37,488 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:38:37,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:38:37,488 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:38:37,493 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-12-03 16:38:37,493 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-12-03 16:38:37,493 INFO L169 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-12-03 16:38:37,504 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:38:37,504 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2018-12-03 16:38:37,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:38:37,549 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:38:37,549 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:38:37,549 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:38:37,550 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:38:37,560 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:38:37,560 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:38:37,593 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-03 16:38:37,593 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:38:37,596 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:38:38,124 WARN L180 SmtUtils]: Spent 373.00 ms on a formula simplification. DAG size of input: 197 DAG size of output: 41 [2018-12-03 16:38:39,183 WARN L180 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2018-12-03 16:38:39,206 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:38:39,206 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:38:42,034 WARN L180 SmtUtils]: Spent 2.18 s on a formula simplification. DAG size of input: 143 DAG size of output: 18 [2018-12-03 16:38:42,035 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:38:42,057 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-03 16:38:42,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2018-12-03 16:38:42,057 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:38:42,057 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 16:38:42,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 16:38:42,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-12-03 16:38:42,058 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 8 states. [2018-12-03 16:38:45,919 WARN L180 SmtUtils]: Spent 371.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 60 [2018-12-03 16:38:50,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:38:50,536 INFO L93 Difference]: Finished difference Result 11 states and 13 transitions. [2018-12-03 16:38:50,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 16:38:50,536 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2018-12-03 16:38:50,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:38:50,537 INFO L225 Difference]: With dead ends: 11 [2018-12-03 16:38:50,538 INFO L226 Difference]: Without dead ends: 9 [2018-12-03 16:38:50,538 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2018-12-03 16:38:50,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-12-03 16:38:50,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-12-03 16:38:50,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-12-03 16:38:50,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-12-03 16:38:50,543 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2018-12-03 16:38:50,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:38:50,543 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-12-03 16:38:50,544 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 16:38:50,544 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-12-03 16:38:50,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 16:38:50,544 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:38:50,544 INFO L402 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2018-12-03 16:38:50,545 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:38:50,545 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:38:50,545 INFO L82 PathProgramCache]: Analyzing trace with hash 317188140, now seen corresponding path program 3 times [2018-12-03 16:38:50,545 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:38:50,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:38:50,546 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:38:50,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:38:50,547 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:38:50,551 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-12-03 16:38:50,552 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-12-03 16:38:50,552 INFO L169 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-12-03 16:38:50,563 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:38:50,563 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2018-12-03 16:38:52,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2018-12-03 16:38:52,592 INFO L285 seRefinementStrategy]: Strategy TaipanRefinementStrategy was unsuccessful and could not determine trace feasibility. [2018-12-03 16:38:52,593 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-03 16:38:52,612 WARN L228 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2018-12-03 16:38:52,612 INFO L202 PluginConnector]: Adding new model gcd_2.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.12 04:38:52 BoogieIcfgContainer [2018-12-03 16:38:52,613 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-03 16:38:52,614 INFO L168 Benchmark]: Toolchain (without parser) took 16511.16 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.3 GB in the end (delta: 214.1 MB). Peak memory consumption was 214.1 MB. Max. memory is 7.1 GB. [2018-12-03 16:38:52,615 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-03 16:38:52,615 INFO L168 Benchmark]: Boogie Procedure Inliner took 36.80 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-03 16:38:52,616 INFO L168 Benchmark]: Boogie Preprocessor took 23.47 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-03 16:38:52,618 INFO L168 Benchmark]: RCFGBuilder took 257.63 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-12-03 16:38:52,619 INFO L168 Benchmark]: TraceAbstraction took 16188.79 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.3 GB in the end (delta: 193.0 MB). Peak memory consumption was 193.0 MB. Max. memory is 7.1 GB. [2018-12-03 16:38:52,624 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 36.80 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 23.47 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 257.63 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 16188.79 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.3 GB in the end (delta: 193.0 MB). Peak memory consumption was 193.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 64]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: unable to decide satisfiability of path constraint. Possible FailurePath: [L19] havoc main_#res; [L20] havoc main_#t~nondet0, main_#t~nondet1, main_#t~ret2, main_~x~7, main_~y~7, main_~g~7; [L21] assume -128 <= main_#t~nondet0 && main_#t~nondet0 <= 127; [L22] main_~x~7 := main_#t~nondet0; [L23] havoc main_#t~nondet0; [L24] assume -128 <= main_#t~nondet1 && main_#t~nondet1 <= 127; [L25] main_~y~7 := main_#t~nondet1; [L26] havoc main_#t~nondet1; [L27] havoc main_~g~7; [L28] gcd_test_#in~a, gcd_test_#in~b := main_~x~7, main_~y~7; [L29] havoc gcd_test_#res; [L30] havoc gcd_test_~a, gcd_test_~b, gcd_test_~t~5; [L31] gcd_test_~a := gcd_test_#in~a; [L32] gcd_test_~b := gcd_test_#in~b; [L33] havoc gcd_test_~t~5; [L34] assume gcd_test_~a < 0; [L35] gcd_test_~a := (if -gcd_test_~a % 256 <= 127 then -gcd_test_~a % 256 else -gcd_test_~a % 256 - 256); [L36] assume !(gcd_test_~b < 0); [L58] assume !!(gcd_test_~b != 0); [L59] gcd_test_~t~5 := gcd_test_~b; [L60] gcd_test_~b := (if (if gcd_test_~a < 0 && gcd_test_~a % gcd_test_~b != 0 then (if gcd_test_~b < 0 then gcd_test_~a % gcd_test_~b + gcd_test_~b else gcd_test_~a % gcd_test_~b - gcd_test_~b) else gcd_test_~a % gcd_test_~b) % 256 <= 127 then (if gcd_test_~a < 0 && gcd_test_~a % gcd_test_~b != 0 then (if gcd_test_~b < 0 then gcd_test_~a % gcd_test_~b + gcd_test_~b else gcd_test_~a % gcd_test_~b - gcd_test_~b) else gcd_test_~a % gcd_test_~b) % 256 else (if gcd_test_~a < 0 && gcd_test_~a % gcd_test_~b != 0 then (if gcd_test_~b < 0 then gcd_test_~a % gcd_test_~b + gcd_test_~b else gcd_test_~a % gcd_test_~b - gcd_test_~b) else gcd_test_~a % gcd_test_~b) % 256 - 256); [L61] gcd_test_~a := gcd_test_~t~5; [L58] assume !!(gcd_test_~b != 0); [L59] gcd_test_~t~5 := gcd_test_~b; [L60] gcd_test_~b := (if (if gcd_test_~a < 0 && gcd_test_~a % gcd_test_~b != 0 then (if gcd_test_~b < 0 then gcd_test_~a % gcd_test_~b + gcd_test_~b else gcd_test_~a % gcd_test_~b - gcd_test_~b) else gcd_test_~a % gcd_test_~b) % 256 <= 127 then (if gcd_test_~a < 0 && gcd_test_~a % gcd_test_~b != 0 then (if gcd_test_~b < 0 then gcd_test_~a % gcd_test_~b + gcd_test_~b else gcd_test_~a % gcd_test_~b - gcd_test_~b) else gcd_test_~a % gcd_test_~b) % 256 else (if gcd_test_~a < 0 && gcd_test_~a % gcd_test_~b != 0 then (if gcd_test_~b < 0 then gcd_test_~a % gcd_test_~b + gcd_test_~b else gcd_test_~a % gcd_test_~b - gcd_test_~b) else gcd_test_~a % gcd_test_~b) % 256 - 256); [L61] gcd_test_~a := gcd_test_~t~5; [L58] assume !!(gcd_test_~b != 0); [L59] gcd_test_~t~5 := gcd_test_~b; [L60] gcd_test_~b := (if (if gcd_test_~a < 0 && gcd_test_~a % gcd_test_~b != 0 then (if gcd_test_~b < 0 then gcd_test_~a % gcd_test_~b + gcd_test_~b else gcd_test_~a % gcd_test_~b - gcd_test_~b) else gcd_test_~a % gcd_test_~b) % 256 <= 127 then (if gcd_test_~a < 0 && gcd_test_~a % gcd_test_~b != 0 then (if gcd_test_~b < 0 then gcd_test_~a % gcd_test_~b + gcd_test_~b else gcd_test_~a % gcd_test_~b - gcd_test_~b) else gcd_test_~a % gcd_test_~b) % 256 else (if gcd_test_~a < 0 && gcd_test_~a % gcd_test_~b != 0 then (if gcd_test_~b < 0 then gcd_test_~a % gcd_test_~b + gcd_test_~b else gcd_test_~a % gcd_test_~b - gcd_test_~b) else gcd_test_~a % gcd_test_~b) % 256 - 256); [L61] gcd_test_~a := gcd_test_~t~5; [L58] assume !!(gcd_test_~b != 0); [L59] gcd_test_~t~5 := gcd_test_~b; [L60] gcd_test_~b := (if (if gcd_test_~a < 0 && gcd_test_~a % gcd_test_~b != 0 then (if gcd_test_~b < 0 then gcd_test_~a % gcd_test_~b + gcd_test_~b else gcd_test_~a % gcd_test_~b - gcd_test_~b) else gcd_test_~a % gcd_test_~b) % 256 <= 127 then (if gcd_test_~a < 0 && gcd_test_~a % gcd_test_~b != 0 then (if gcd_test_~b < 0 then gcd_test_~a % gcd_test_~b + gcd_test_~b else gcd_test_~a % gcd_test_~b - gcd_test_~b) else gcd_test_~a % gcd_test_~b) % 256 else (if gcd_test_~a < 0 && gcd_test_~a % gcd_test_~b != 0 then (if gcd_test_~b < 0 then gcd_test_~a % gcd_test_~b + gcd_test_~b else gcd_test_~a % gcd_test_~b - gcd_test_~b) else gcd_test_~a % gcd_test_~b) % 256 - 256); [L61] gcd_test_~a := gcd_test_~t~5; [L58] assume !!(gcd_test_~b != 0); [L59] gcd_test_~t~5 := gcd_test_~b; [L60] gcd_test_~b := (if (if gcd_test_~a < 0 && gcd_test_~a % gcd_test_~b != 0 then (if gcd_test_~b < 0 then gcd_test_~a % gcd_test_~b + gcd_test_~b else gcd_test_~a % gcd_test_~b - gcd_test_~b) else gcd_test_~a % gcd_test_~b) % 256 <= 127 then (if gcd_test_~a < 0 && gcd_test_~a % gcd_test_~b != 0 then (if gcd_test_~b < 0 then gcd_test_~a % gcd_test_~b + gcd_test_~b else gcd_test_~a % gcd_test_~b - gcd_test_~b) else gcd_test_~a % gcd_test_~b) % 256 else (if gcd_test_~a < 0 && gcd_test_~a % gcd_test_~b != 0 then (if gcd_test_~b < 0 then gcd_test_~a % gcd_test_~b + gcd_test_~b else gcd_test_~a % gcd_test_~b - gcd_test_~b) else gcd_test_~a % gcd_test_~b) % 256 - 256); [L61] gcd_test_~a := gcd_test_~t~5; [L44] assume !(gcd_test_~b != 0); [L45] gcd_test_#res := gcd_test_~a; [L46] main_#t~ret2 := gcd_test_#res; [L47] assume -128 <= main_#t~ret2 && main_#t~ret2 <= 127; [L48] main_~g~7 := main_#t~ret2; [L49] havoc main_#t~ret2; [L50] assume main_~y~7 > 0; [L51] __VERIFIER_assert_#in~cond := (if main_~y~7 >= main_~g~7 then 1 else 0); [L52] havoc __VERIFIER_assert_~cond; [L53] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; [L54] assume __VERIFIER_assert_~cond == 0; [L55] assume !false; [L64] assert false; - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 6 locations, 1 error locations. UNKNOWN Result, 16.1s OverallTime, 4 OverallIterations, 5 TraceHistogramMax, 8.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 9 SDtfs, 3 SDslu, 3 SDs, 0 SdLazy, 25 SolverSat, 6 SolverUnsat, 3 SolverUnknown, 0 SolverNotchecked, 7.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 4.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=9occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.2s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 2.1s SatisfiabilityAnalysisTime, 4.6s InterpolantComputationTime, 29 NumberOfCodeBlocks, 29 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 16 ConstructedInterpolants, 3 QuantifiedInterpolants, 986 SizeOfPredicates, 17 NumberOfNonLiveVariables, 93 ConjunctsInSsa, 36 ConjunctsInUnsatCore, 5 InterpolantComputations, 1 PerfectInterpolantSequences, 0/8 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request...