java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf -i ../../../trunk/examples/programs/real-life/RailwayCrossing.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cc990c [2018-10-01 00:24:34,782 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-01 00:24:34,784 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-01 00:24:34,796 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-01 00:24:34,797 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-01 00:24:34,798 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-01 00:24:34,799 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-01 00:24:34,801 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-01 00:24:34,803 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-01 00:24:34,804 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-01 00:24:34,805 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-01 00:24:34,805 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-01 00:24:34,806 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-01 00:24:34,807 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-01 00:24:34,809 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-01 00:24:34,809 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-01 00:24:34,810 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-01 00:24:34,813 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-01 00:24:34,815 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-01 00:24:34,817 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-01 00:24:34,818 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-01 00:24:34,819 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-01 00:24:34,822 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-01 00:24:34,822 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-01 00:24:34,823 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-01 00:24:34,824 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-01 00:24:34,825 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-01 00:24:34,826 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-01 00:24:34,827 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-01 00:24:34,828 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-01 00:24:34,828 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-01 00:24:34,829 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-01 00:24:34,830 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-01 00:24:34,830 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-01 00:24:34,831 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-01 00:24:34,832 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-01 00:24:34,832 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf [2018-10-01 00:24:34,849 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-01 00:24:34,849 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-01 00:24:34,850 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-01 00:24:34,850 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-01 00:24:34,851 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-01 00:24:34,851 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-01 00:24:34,851 INFO L133 SettingsManager]: * Use SBE=true [2018-10-01 00:24:34,851 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-01 00:24:34,852 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-01 00:24:34,852 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-01 00:24:34,852 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-01 00:24:34,852 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-01 00:24:34,852 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-01 00:24:34,853 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-01 00:24:34,853 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-01 00:24:34,853 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-01 00:24:34,853 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-01 00:24:34,853 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-01 00:24:34,854 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-01 00:24:34,855 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-01 00:24:34,855 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-01 00:24:34,855 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-01 00:24:34,855 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-01 00:24:34,855 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-01 00:24:34,856 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-01 00:24:34,856 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-01 00:24:34,856 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-01 00:24:34,856 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-01 00:24:34,857 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-01 00:24:34,857 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-01 00:24:34,857 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-10-01 00:24:34,926 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-01 00:24:34,939 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-01 00:24:34,943 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-01 00:24:34,944 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-01 00:24:34,945 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-01 00:24:34,946 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/RailwayCrossing.bpl [2018-10-01 00:24:34,946 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/RailwayCrossing.bpl' [2018-10-01 00:24:34,990 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-01 00:24:34,993 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-01 00:24:34,994 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-01 00:24:34,994 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-01 00:24:34,995 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-01 00:24:35,015 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "RailwayCrossing.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:24:34" (1/1) ... [2018-10-01 00:24:35,028 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "RailwayCrossing.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:24:34" (1/1) ... [2018-10-01 00:24:35,033 WARN L165 Inliner]: Program contained no entry procedure! [2018-10-01 00:24:35,033 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-10-01 00:24:35,033 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-10-01 00:24:35,036 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-01 00:24:35,037 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-01 00:24:35,037 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-01 00:24:35,037 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-01 00:24:35,048 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "RailwayCrossing.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:24:34" (1/1) ... [2018-10-01 00:24:35,049 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "RailwayCrossing.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:24:34" (1/1) ... [2018-10-01 00:24:35,049 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "RailwayCrossing.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:24:34" (1/1) ... [2018-10-01 00:24:35,049 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "RailwayCrossing.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:24:34" (1/1) ... [2018-10-01 00:24:35,052 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "RailwayCrossing.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:24:34" (1/1) ... [2018-10-01 00:24:35,057 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "RailwayCrossing.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:24:34" (1/1) ... [2018-10-01 00:24:35,058 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "RailwayCrossing.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:24:34" (1/1) ... [2018-10-01 00:24:35,059 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-01 00:24:35,061 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-01 00:24:35,061 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-01 00:24:35,061 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-01 00:24:35,062 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "RailwayCrossing.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:24:34" (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-10-01 00:24:35,134 INFO L124 BoogieDeclarations]: Specification and implementation of procedure GateController given in one single declaration [2018-10-01 00:24:35,134 INFO L130 BoogieDeclarations]: Found specification of procedure GateController [2018-10-01 00:24:35,134 INFO L138 BoogieDeclarations]: Found implementation of procedure GateController [2018-10-01 00:24:35,458 INFO L345 CfgBuilder]: Using library mode [2018-10-01 00:24:35,458 INFO L202 PluginConnector]: Adding new model RailwayCrossing.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.10 12:24:35 BoogieIcfgContainer [2018-10-01 00:24:35,459 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-01 00:24:35,460 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-01 00:24:35,460 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-01 00:24:35,467 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-01 00:24:35,467 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "RailwayCrossing.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:24:34" (1/2) ... [2018-10-01 00:24:35,468 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5dbc01ab and model type RailwayCrossing.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.10 12:24:35, skipping insertion in model container [2018-10-01 00:24:35,469 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "RailwayCrossing.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.10 12:24:35" (2/2) ... [2018-10-01 00:24:35,471 INFO L112 eAbstractionObserver]: Analyzing ICFG RailwayCrossing.bpl [2018-10-01 00:24:35,479 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-01 00:24:35,487 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-01 00:24:35,537 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-01 00:24:35,538 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-01 00:24:35,538 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-01 00:24:35,538 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-01 00:24:35,539 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-01 00:24:35,539 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-01 00:24:35,539 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-01 00:24:35,539 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-01 00:24:35,539 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-01 00:24:35,555 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states. [2018-10-01 00:24:35,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-10-01 00:24:35,562 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:24:35,563 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-10-01 00:24:35,564 INFO L423 AbstractCegarLoop]: === Iteration 1 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:24:35,571 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:24:35,571 INFO L82 PathProgramCache]: Analyzing trace with hash 30496, now seen corresponding path program 1 times [2018-10-01 00:24:35,573 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:24:35,574 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:24:35,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:24:35,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:24:35,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:24:35,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:24:35,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:24:35,735 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:24:35,736 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-01 00:24:35,742 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-01 00:24:35,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-01 00:24:35,763 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:24:35,767 INFO L87 Difference]: Start difference. First operand 10 states. Second operand 3 states. [2018-10-01 00:24:35,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:24:35,942 INFO L93 Difference]: Finished difference Result 19 states and 25 transitions. [2018-10-01 00:24:35,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-01 00:24:35,949 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2018-10-01 00:24:35,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:24:35,961 INFO L225 Difference]: With dead ends: 19 [2018-10-01 00:24:35,961 INFO L226 Difference]: Without dead ends: 13 [2018-10-01 00:24:35,964 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-10-01 00:24:35,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-10-01 00:24:35,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 9. [2018-10-01 00:24:35,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-10-01 00:24:35,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 12 transitions. [2018-10-01 00:24:35,996 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 12 transitions. Word has length 3 [2018-10-01 00:24:35,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:24:35,996 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 12 transitions. [2018-10-01 00:24:35,996 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-01 00:24:35,997 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 12 transitions. [2018-10-01 00:24:35,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-10-01 00:24:35,997 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:24:35,997 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:24:35,998 INFO L423 AbstractCegarLoop]: === Iteration 2 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:24:35,998 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:24:35,998 INFO L82 PathProgramCache]: Analyzing trace with hash 1863215691, now seen corresponding path program 1 times [2018-10-01 00:24:35,998 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:24:35,999 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:24:36,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:24:36,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:24:36,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:24:36,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:24:36,041 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:24:36,042 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:24:36,042 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-01 00:24:36,044 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-01 00:24:36,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-01 00:24:36,044 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:24:36,044 INFO L87 Difference]: Start difference. First operand 9 states and 12 transitions. Second operand 3 states. [2018-10-01 00:24:36,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:24:36,091 INFO L93 Difference]: Finished difference Result 16 states and 22 transitions. [2018-10-01 00:24:36,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-01 00:24:36,092 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-10-01 00:24:36,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:24:36,093 INFO L225 Difference]: With dead ends: 16 [2018-10-01 00:24:36,093 INFO L226 Difference]: Without dead ends: 9 [2018-10-01 00:24:36,094 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-10-01 00:24:36,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-10-01 00:24:36,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-10-01 00:24:36,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-10-01 00:24:36,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 11 transitions. [2018-10-01 00:24:36,097 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 11 transitions. Word has length 7 [2018-10-01 00:24:36,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:24:36,097 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 11 transitions. [2018-10-01 00:24:36,098 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-01 00:24:36,098 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 11 transitions. [2018-10-01 00:24:36,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-01 00:24:36,098 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:24:36,099 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:24:36,099 INFO L423 AbstractCegarLoop]: === Iteration 3 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:24:36,099 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:24:36,099 INFO L82 PathProgramCache]: Analyzing trace with hash 1926837521, now seen corresponding path program 1 times [2018-10-01 00:24:36,099 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:24:36,100 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:24:36,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:24:36,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:24:36,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:24:36,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:24:36,218 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:24:36,219 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:24:36,219 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:24:36,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:24:36,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:24:36,251 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:24:36,415 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:24:36,440 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:24:36,441 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2018-10-01 00:24:36,441 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-01 00:24:36,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-01 00:24:36,442 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:24:36,442 INFO L87 Difference]: Start difference. First operand 9 states and 11 transitions. Second operand 6 states. [2018-10-01 00:24:36,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:24:36,668 INFO L93 Difference]: Finished difference Result 20 states and 26 transitions. [2018-10-01 00:24:36,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-01 00:24:36,669 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 8 [2018-10-01 00:24:36,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:24:36,670 INFO L225 Difference]: With dead ends: 20 [2018-10-01 00:24:36,670 INFO L226 Difference]: Without dead ends: 18 [2018-10-01 00:24:36,671 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time [2018-10-01 00:24:36,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-10-01 00:24:36,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 14. [2018-10-01 00:24:36,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-10-01 00:24:36,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 18 transitions. [2018-10-01 00:24:36,675 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 18 transitions. Word has length 8 [2018-10-01 00:24:36,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:24:36,676 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 18 transitions. [2018-10-01 00:24:36,676 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-01 00:24:36,676 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 18 transitions. [2018-10-01 00:24:36,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-01 00:24:36,677 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:24:36,677 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1] [2018-10-01 00:24:36,677 INFO L423 AbstractCegarLoop]: === Iteration 4 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:24:36,677 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:24:36,678 INFO L82 PathProgramCache]: Analyzing trace with hash 640583104, now seen corresponding path program 2 times [2018-10-01 00:24:36,678 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:24:36,678 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:24:36,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:24:36,679 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:24:36,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:24:36,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:24:36,817 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:24:36,817 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:24:36,817 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP 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-10-01 00:24:36,829 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:24:36,842 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:24:36,842 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:24:36,845 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:24:37,148 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:24:37,170 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:24:37,171 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2018-10-01 00:24:37,171 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-01 00:24:37,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-01 00:24:37,172 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:24:37,172 INFO L87 Difference]: Start difference. First operand 14 states and 18 transitions. Second operand 8 states. [2018-10-01 00:24:37,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:24:37,429 INFO L93 Difference]: Finished difference Result 25 states and 33 transitions. [2018-10-01 00:24:37,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-01 00:24:37,430 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2018-10-01 00:24:37,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:24:37,432 INFO L225 Difference]: With dead ends: 25 [2018-10-01 00:24:37,432 INFO L226 Difference]: Without dead ends: 23 [2018-10-01 00:24:37,433 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time [2018-10-01 00:24:37,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-10-01 00:24:37,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 19. [2018-10-01 00:24:37,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-10-01 00:24:37,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 25 transitions. [2018-10-01 00:24:37,438 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 25 transitions. Word has length 13 [2018-10-01 00:24:37,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:24:37,439 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 25 transitions. [2018-10-01 00:24:37,439 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-01 00:24:37,439 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 25 transitions. [2018-10-01 00:24:37,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-01 00:24:37,440 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:24:37,440 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1] [2018-10-01 00:24:37,440 INFO L423 AbstractCegarLoop]: === Iteration 5 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:24:37,440 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:24:37,440 INFO L82 PathProgramCache]: Analyzing trace with hash -297055631, now seen corresponding path program 3 times [2018-10-01 00:24:37,441 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:24:37,441 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:24:37,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:24:37,442 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:24:37,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:24:37,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:24:37,569 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:24:37,569 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:24:37,569 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:24:37,577 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:24:37,611 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-10-01 00:24:37,611 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:24:37,613 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:24:37,875 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:24:37,907 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:24:37,908 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2018-10-01 00:24:37,908 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-01 00:24:37,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-01 00:24:37,909 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:24:37,909 INFO L87 Difference]: Start difference. First operand 19 states and 25 transitions. Second operand 10 states. [2018-10-01 00:24:38,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:24:38,530 INFO L93 Difference]: Finished difference Result 30 states and 40 transitions. [2018-10-01 00:24:38,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-01 00:24:38,531 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2018-10-01 00:24:38,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:24:38,532 INFO L225 Difference]: With dead ends: 30 [2018-10-01 00:24:38,533 INFO L226 Difference]: Without dead ends: 28 [2018-10-01 00:24:38,533 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time [2018-10-01 00:24:38,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-10-01 00:24:38,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 24. [2018-10-01 00:24:38,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-10-01 00:24:38,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 32 transitions. [2018-10-01 00:24:38,539 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 32 transitions. Word has length 18 [2018-10-01 00:24:38,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:24:38,539 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 32 transitions. [2018-10-01 00:24:38,539 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-01 00:24:38,539 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 32 transitions. [2018-10-01 00:24:38,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-10-01 00:24:38,540 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:24:38,540 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1] [2018-10-01 00:24:38,541 INFO L423 AbstractCegarLoop]: === Iteration 6 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:24:38,541 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:24:38,541 INFO L82 PathProgramCache]: Analyzing trace with hash 2073218144, now seen corresponding path program 4 times [2018-10-01 00:24:38,541 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:24:38,541 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:24:38,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:24:38,542 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:24:38,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:24:38,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:24:38,654 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:24:38,655 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:24:38,655 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP 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-10-01 00:24:38,670 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:24:38,691 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:24:38,692 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:24:38,694 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:24:39,072 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:24:39,093 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:24:39,094 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2018-10-01 00:24:39,094 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-01 00:24:39,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-01 00:24:39,095 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:24:39,095 INFO L87 Difference]: Start difference. First operand 24 states and 32 transitions. Second operand 12 states. [2018-10-01 00:24:39,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:24:39,236 INFO L93 Difference]: Finished difference Result 35 states and 47 transitions. [2018-10-01 00:24:39,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-01 00:24:39,236 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 23 [2018-10-01 00:24:39,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:24:39,237 INFO L225 Difference]: With dead ends: 35 [2018-10-01 00:24:39,238 INFO L226 Difference]: Without dead ends: 33 [2018-10-01 00:24:39,238 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time [2018-10-01 00:24:39,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-10-01 00:24:39,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 29. [2018-10-01 00:24:39,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-10-01 00:24:39,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 39 transitions. [2018-10-01 00:24:39,244 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 39 transitions. Word has length 23 [2018-10-01 00:24:39,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:24:39,244 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 39 transitions. [2018-10-01 00:24:39,244 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-01 00:24:39,245 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 39 transitions. [2018-10-01 00:24:39,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-10-01 00:24:39,245 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:24:39,246 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 1, 1, 1] [2018-10-01 00:24:39,246 INFO L423 AbstractCegarLoop]: === Iteration 7 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:24:39,246 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:24:39,246 INFO L82 PathProgramCache]: Analyzing trace with hash -609605679, now seen corresponding path program 5 times [2018-10-01 00:24:39,247 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:24:39,247 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:24:39,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:24:39,248 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:24:39,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:24:39,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:24:39,341 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:24:39,342 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:24:39,342 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:24:39,351 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:24:39,387 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-10-01 00:24:39,387 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:24:39,390 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:24:39,806 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:24:39,827 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:24:39,827 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2018-10-01 00:24:39,828 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-01 00:24:39,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-01 00:24:39,828 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:24:39,829 INFO L87 Difference]: Start difference. First operand 29 states and 39 transitions. Second operand 14 states. [2018-10-01 00:24:40,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:24:40,170 INFO L93 Difference]: Finished difference Result 40 states and 54 transitions. [2018-10-01 00:24:40,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-01 00:24:40,172 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 28 [2018-10-01 00:24:40,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:24:40,173 INFO L225 Difference]: With dead ends: 40 [2018-10-01 00:24:40,174 INFO L226 Difference]: Without dead ends: 38 [2018-10-01 00:24:40,174 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time [2018-10-01 00:24:40,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-10-01 00:24:40,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 34. [2018-10-01 00:24:40,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-01 00:24:40,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 46 transitions. [2018-10-01 00:24:40,180 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 46 transitions. Word has length 28 [2018-10-01 00:24:40,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:24:40,181 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 46 transitions. [2018-10-01 00:24:40,181 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-01 00:24:40,181 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 46 transitions. [2018-10-01 00:24:40,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-10-01 00:24:40,182 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:24:40,182 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 1, 1, 1] [2018-10-01 00:24:40,182 INFO L423 AbstractCegarLoop]: === Iteration 8 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:24:40,183 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:24:40,183 INFO L82 PathProgramCache]: Analyzing trace with hash -70825216, now seen corresponding path program 6 times [2018-10-01 00:24:40,183 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:24:40,183 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:24:40,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:24:40,184 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:24:40,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:24:40,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:24:40,348 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:24:40,348 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:24:40,348 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:24:40,357 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:24:40,399 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-10-01 00:24:40,400 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:24:40,402 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:24:40,813 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:24:40,835 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:24:40,835 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2018-10-01 00:24:40,836 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-01 00:24:40,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-01 00:24:40,836 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:24:40,837 INFO L87 Difference]: Start difference. First operand 34 states and 46 transitions. Second operand 16 states. [2018-10-01 00:24:41,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:24:41,075 INFO L93 Difference]: Finished difference Result 45 states and 61 transitions. [2018-10-01 00:24:41,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-01 00:24:41,076 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 33 [2018-10-01 00:24:41,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:24:41,077 INFO L225 Difference]: With dead ends: 45 [2018-10-01 00:24:41,077 INFO L226 Difference]: Without dead ends: 43 [2018-10-01 00:24:41,078 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time [2018-10-01 00:24:41,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-10-01 00:24:41,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 39. [2018-10-01 00:24:41,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-10-01 00:24:41,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 53 transitions. [2018-10-01 00:24:41,084 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 53 transitions. Word has length 33 [2018-10-01 00:24:41,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:24:41,085 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 53 transitions. [2018-10-01 00:24:41,085 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-01 00:24:41,085 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 53 transitions. [2018-10-01 00:24:41,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-10-01 00:24:41,086 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:24:41,086 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 1, 1, 1] [2018-10-01 00:24:41,086 INFO L423 AbstractCegarLoop]: === Iteration 9 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:24:41,087 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:24:41,087 INFO L82 PathProgramCache]: Analyzing trace with hash 1872481585, now seen corresponding path program 7 times [2018-10-01 00:24:41,087 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:24:41,087 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:24:41,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:24:41,088 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:24:41,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:24:41,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:24:41,189 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:24:41,189 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:24:41,189 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:24:41,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:24:41,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:24:41,235 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:24:41,565 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:24:41,587 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:24:41,587 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2018-10-01 00:24:41,588 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-01 00:24:41,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-01 00:24:41,588 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:24:41,588 INFO L87 Difference]: Start difference. First operand 39 states and 53 transitions. Second operand 18 states. [2018-10-01 00:24:41,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:24:41,938 INFO L93 Difference]: Finished difference Result 50 states and 68 transitions. [2018-10-01 00:24:41,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-01 00:24:41,938 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 38 [2018-10-01 00:24:41,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:24:41,940 INFO L225 Difference]: With dead ends: 50 [2018-10-01 00:24:41,940 INFO L226 Difference]: Without dead ends: 48 [2018-10-01 00:24:41,941 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time [2018-10-01 00:24:41,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-10-01 00:24:41,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 44. [2018-10-01 00:24:41,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-10-01 00:24:41,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 60 transitions. [2018-10-01 00:24:41,948 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 60 transitions. Word has length 38 [2018-10-01 00:24:41,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:24:41,948 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 60 transitions. [2018-10-01 00:24:41,948 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-01 00:24:41,948 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 60 transitions. [2018-10-01 00:24:41,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-10-01 00:24:41,950 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:24:41,950 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 1, 1, 1] [2018-10-01 00:24:41,950 INFO L423 AbstractCegarLoop]: === Iteration 10 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:24:41,950 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:24:41,950 INFO L82 PathProgramCache]: Analyzing trace with hash 1776681376, now seen corresponding path program 8 times [2018-10-01 00:24:41,951 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:24:41,951 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:24:41,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:24:41,952 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:24:41,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:24:41,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:24:42,072 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 148 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:24:42,073 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:24:42,073 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:24:42,084 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:24:42,101 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:24:42,101 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:24:42,105 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:24:42,517 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 148 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:24:42,538 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:24:42,539 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 19 [2018-10-01 00:24:42,539 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-01 00:24:42,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-01 00:24:42,540 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:24:42,540 INFO L87 Difference]: Start difference. First operand 44 states and 60 transitions. Second operand 20 states. [2018-10-01 00:24:42,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:24:42,844 INFO L93 Difference]: Finished difference Result 55 states and 75 transitions. [2018-10-01 00:24:42,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-01 00:24:42,844 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 43 [2018-10-01 00:24:42,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:24:42,845 INFO L225 Difference]: With dead ends: 55 [2018-10-01 00:24:42,845 INFO L226 Difference]: Without dead ends: 53 [2018-10-01 00:24:42,846 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time [2018-10-01 00:24:42,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-10-01 00:24:42,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 49. [2018-10-01 00:24:42,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-10-01 00:24:42,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 67 transitions. [2018-10-01 00:24:42,853 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 67 transitions. Word has length 43 [2018-10-01 00:24:42,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:24:42,853 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 67 transitions. [2018-10-01 00:24:42,853 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-01 00:24:42,853 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 67 transitions. [2018-10-01 00:24:42,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-10-01 00:24:42,854 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:24:42,855 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 1, 1, 1] [2018-10-01 00:24:42,855 INFO L423 AbstractCegarLoop]: === Iteration 11 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:24:42,855 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:24:42,855 INFO L82 PathProgramCache]: Analyzing trace with hash -951698799, now seen corresponding path program 9 times [2018-10-01 00:24:42,855 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:24:42,855 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:24:42,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:24:42,856 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:24:42,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:24:42,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:24:42,997 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 0 proven. 189 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:24:42,997 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:24:42,997 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:24:43,005 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:24:43,031 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-10-01 00:24:43,031 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:24:43,034 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:24:44,551 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 0 proven. 189 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:24:44,572 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:24:44,572 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 21 [2018-10-01 00:24:44,573 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-10-01 00:24:44,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-10-01 00:24:44,573 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:24:44,573 INFO L87 Difference]: Start difference. First operand 49 states and 67 transitions. Second operand 22 states. [2018-10-01 00:24:44,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:24:44,853 INFO L93 Difference]: Finished difference Result 60 states and 82 transitions. [2018-10-01 00:24:44,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-01 00:24:44,853 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 48 [2018-10-01 00:24:44,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:24:44,855 INFO L225 Difference]: With dead ends: 60 [2018-10-01 00:24:44,855 INFO L226 Difference]: Without dead ends: 58 [2018-10-01 00:24:44,856 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s Time [2018-10-01 00:24:44,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-10-01 00:24:44,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 54. [2018-10-01 00:24:44,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-10-01 00:24:44,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 74 transitions. [2018-10-01 00:24:44,863 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 74 transitions. Word has length 48 [2018-10-01 00:24:44,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:24:44,863 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 74 transitions. [2018-10-01 00:24:44,863 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-10-01 00:24:44,864 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 74 transitions. [2018-10-01 00:24:44,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-10-01 00:24:44,865 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:24:44,865 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1] [2018-10-01 00:24:44,865 INFO L423 AbstractCegarLoop]: === Iteration 12 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:24:44,865 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:24:44,866 INFO L82 PathProgramCache]: Analyzing trace with hash -259461056, now seen corresponding path program 10 times [2018-10-01 00:24:44,866 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:24:44,866 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:24:44,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:24:44,867 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:24:44,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:24:44,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:24:45,022 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 235 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:24:45,022 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:24:45,022 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:24:45,031 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:24:45,053 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:24:45,053 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:24:45,056 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:24:45,626 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 235 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:24:45,658 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:24:45,658 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 23 [2018-10-01 00:24:45,658 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-10-01 00:24:45,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-10-01 00:24:45,659 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:24:45,659 INFO L87 Difference]: Start difference. First operand 54 states and 74 transitions. Second operand 24 states. [2018-10-01 00:24:45,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:24:45,910 INFO L93 Difference]: Finished difference Result 65 states and 89 transitions. [2018-10-01 00:24:45,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-01 00:24:45,910 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 53 [2018-10-01 00:24:45,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:24:45,911 INFO L225 Difference]: With dead ends: 65 [2018-10-01 00:24:45,911 INFO L226 Difference]: Without dead ends: 63 [2018-10-01 00:24:45,912 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time [2018-10-01 00:24:45,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-10-01 00:24:45,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 59. [2018-10-01 00:24:45,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-10-01 00:24:45,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 81 transitions. [2018-10-01 00:24:45,918 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 81 transitions. Word has length 53 [2018-10-01 00:24:45,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:24:45,919 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 81 transitions. [2018-10-01 00:24:45,919 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-10-01 00:24:45,919 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 81 transitions. [2018-10-01 00:24:45,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-10-01 00:24:45,920 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:24:45,920 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 1, 1, 1] [2018-10-01 00:24:45,920 INFO L423 AbstractCegarLoop]: === Iteration 13 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:24:45,920 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:24:45,921 INFO L82 PathProgramCache]: Analyzing trace with hash 1213165553, now seen corresponding path program 11 times [2018-10-01 00:24:45,921 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:24:45,921 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:24:45,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:24:45,922 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:24:45,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:24:45,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:24:46,054 INFO L134 CoverageAnalysis]: Checked inductivity of 286 backedges. 0 proven. 286 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:24:46,055 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:24:46,055 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:24:46,066 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:24:46,101 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-10-01 00:24:46,101 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:24:46,106 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:24:47,014 INFO L134 CoverageAnalysis]: Checked inductivity of 286 backedges. 0 proven. 286 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:24:47,035 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:24:47,036 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 25 [2018-10-01 00:24:47,036 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-10-01 00:24:47,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-10-01 00:24:47,037 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:24:47,037 INFO L87 Difference]: Start difference. First operand 59 states and 81 transitions. Second operand 26 states. [2018-10-01 00:24:47,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:24:47,258 INFO L93 Difference]: Finished difference Result 70 states and 96 transitions. [2018-10-01 00:24:47,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-01 00:24:47,258 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 58 [2018-10-01 00:24:47,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:24:47,259 INFO L225 Difference]: With dead ends: 70 [2018-10-01 00:24:47,259 INFO L226 Difference]: Without dead ends: 68 [2018-10-01 00:24:47,259 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s Time [2018-10-01 00:24:47,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-10-01 00:24:47,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 64. [2018-10-01 00:24:47,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-10-01 00:24:47,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 88 transitions. [2018-10-01 00:24:47,266 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 88 transitions. Word has length 58 [2018-10-01 00:24:47,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:24:47,266 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 88 transitions. [2018-10-01 00:24:47,266 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-10-01 00:24:47,266 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 88 transitions. [2018-10-01 00:24:47,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-10-01 00:24:47,267 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:24:47,267 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 1, 1, 1] [2018-10-01 00:24:47,268 INFO L423 AbstractCegarLoop]: === Iteration 14 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:24:47,268 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:24:47,268 INFO L82 PathProgramCache]: Analyzing trace with hash -1043720480, now seen corresponding path program 12 times [2018-10-01 00:24:47,268 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:24:47,268 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:24:47,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:24:47,269 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:24:47,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:24:47,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:24:47,720 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:24:47,721 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:24:47,721 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:24:47,729 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:24:47,754 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-10-01 00:24:47,755 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:24:47,759 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:24:48,232 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:24:48,255 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:24:48,255 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 27 [2018-10-01 00:24:48,255 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-10-01 00:24:48,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-10-01 00:24:48,256 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:24:48,256 INFO L87 Difference]: Start difference. First operand 64 states and 88 transitions. Second operand 28 states. [2018-10-01 00:24:48,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:24:48,571 INFO L93 Difference]: Finished difference Result 75 states and 103 transitions. [2018-10-01 00:24:48,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-01 00:24:48,572 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 63 [2018-10-01 00:24:48,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:24:48,574 INFO L225 Difference]: With dead ends: 75 [2018-10-01 00:24:48,574 INFO L226 Difference]: Without dead ends: 73 [2018-10-01 00:24:48,574 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s Time [2018-10-01 00:24:48,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-10-01 00:24:48,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 69. [2018-10-01 00:24:48,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-10-01 00:24:48,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 95 transitions. [2018-10-01 00:24:48,581 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 95 transitions. Word has length 63 [2018-10-01 00:24:48,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:24:48,582 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 95 transitions. [2018-10-01 00:24:48,582 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-10-01 00:24:48,582 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 95 transitions. [2018-10-01 00:24:48,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-10-01 00:24:48,583 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:24:48,583 INFO L375 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 1, 1, 1] [2018-10-01 00:24:48,583 INFO L423 AbstractCegarLoop]: === Iteration 15 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:24:48,583 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:24:48,584 INFO L82 PathProgramCache]: Analyzing trace with hash 14511441, now seen corresponding path program 13 times [2018-10-01 00:24:48,584 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:24:48,584 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:24:48,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:24:48,585 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:24:48,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:24:48,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:24:48,983 INFO L134 CoverageAnalysis]: Checked inductivity of 403 backedges. 0 proven. 403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:24:48,984 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:24:48,984 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:24:48,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:24:49,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:24:49,014 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:24:49,474 INFO L134 CoverageAnalysis]: Checked inductivity of 403 backedges. 0 proven. 403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:24:49,495 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:24:49,495 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 29 [2018-10-01 00:24:49,496 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-10-01 00:24:49,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-10-01 00:24:49,496 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:24:49,497 INFO L87 Difference]: Start difference. First operand 69 states and 95 transitions. Second operand 30 states. [2018-10-01 00:24:49,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:24:49,764 INFO L93 Difference]: Finished difference Result 80 states and 110 transitions. [2018-10-01 00:24:49,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-01 00:24:49,765 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 68 [2018-10-01 00:24:49,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:24:49,766 INFO L225 Difference]: With dead ends: 80 [2018-10-01 00:24:49,766 INFO L226 Difference]: Without dead ends: 78 [2018-10-01 00:24:49,767 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time [2018-10-01 00:24:49,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-10-01 00:24:49,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 74. [2018-10-01 00:24:49,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-10-01 00:24:49,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 102 transitions. [2018-10-01 00:24:49,775 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 102 transitions. Word has length 68 [2018-10-01 00:24:49,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:24:49,776 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 102 transitions. [2018-10-01 00:24:49,776 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-10-01 00:24:49,776 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 102 transitions. [2018-10-01 00:24:49,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-10-01 00:24:49,777 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:24:49,777 INFO L375 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 1, 1, 1] [2018-10-01 00:24:49,778 INFO L423 AbstractCegarLoop]: === Iteration 16 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:24:49,778 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:24:49,778 INFO L82 PathProgramCache]: Analyzing trace with hash -1220315776, now seen corresponding path program 14 times [2018-10-01 00:24:49,778 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:24:49,778 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:24:49,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:24:49,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:24:49,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:24:49,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:24:49,984 INFO L134 CoverageAnalysis]: Checked inductivity of 469 backedges. 0 proven. 469 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:24:49,985 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:24:49,985 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:24:49,992 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:24:50,034 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:24:50,035 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:24:50,038 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:24:50,487 INFO L134 CoverageAnalysis]: Checked inductivity of 469 backedges. 0 proven. 469 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:24:50,507 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:24:50,508 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 31 [2018-10-01 00:24:50,508 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-10-01 00:24:50,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-10-01 00:24:50,509 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:24:50,509 INFO L87 Difference]: Start difference. First operand 74 states and 102 transitions. Second operand 32 states. [2018-10-01 00:24:50,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:24:50,770 INFO L93 Difference]: Finished difference Result 85 states and 117 transitions. [2018-10-01 00:24:50,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-01 00:24:50,770 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 73 [2018-10-01 00:24:50,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:24:50,771 INFO L225 Difference]: With dead ends: 85 [2018-10-01 00:24:50,771 INFO L226 Difference]: Without dead ends: 83 [2018-10-01 00:24:50,771 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time [2018-10-01 00:24:50,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-10-01 00:24:50,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 79. [2018-10-01 00:24:50,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-10-01 00:24:50,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 109 transitions. [2018-10-01 00:24:50,777 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 109 transitions. Word has length 73 [2018-10-01 00:24:50,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:24:50,778 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 109 transitions. [2018-10-01 00:24:50,778 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-10-01 00:24:50,778 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 109 transitions. [2018-10-01 00:24:50,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-10-01 00:24:50,779 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:24:50,779 INFO L375 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 1, 1, 1] [2018-10-01 00:24:50,779 INFO L423 AbstractCegarLoop]: === Iteration 17 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:24:50,779 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:24:50,779 INFO L82 PathProgramCache]: Analyzing trace with hash 127283889, now seen corresponding path program 15 times [2018-10-01 00:24:50,779 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:24:50,780 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:24:50,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:24:50,780 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:24:50,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:24:50,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:24:51,791 INFO L134 CoverageAnalysis]: Checked inductivity of 540 backedges. 0 proven. 540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:24:51,792 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:24:51,792 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:24:51,800 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:24:51,880 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-10-01 00:24:51,881 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:24:51,883 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:24:52,421 INFO L134 CoverageAnalysis]: Checked inductivity of 540 backedges. 0 proven. 540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:24:52,442 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:24:52,442 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 33 [2018-10-01 00:24:52,443 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-10-01 00:24:52,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-10-01 00:24:52,443 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:24:52,443 INFO L87 Difference]: Start difference. First operand 79 states and 109 transitions. Second operand 34 states. [2018-10-01 00:24:52,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:24:52,739 INFO L93 Difference]: Finished difference Result 90 states and 124 transitions. [2018-10-01 00:24:52,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-01 00:24:52,739 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 78 [2018-10-01 00:24:52,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:24:52,740 INFO L225 Difference]: With dead ends: 90 [2018-10-01 00:24:52,740 INFO L226 Difference]: Without dead ends: 88 [2018-10-01 00:24:52,740 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s Time [2018-10-01 00:24:52,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-10-01 00:24:52,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 84. [2018-10-01 00:24:52,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-10-01 00:24:52,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 116 transitions. [2018-10-01 00:24:52,745 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 116 transitions. Word has length 78 [2018-10-01 00:24:52,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:24:52,745 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 116 transitions. [2018-10-01 00:24:52,745 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-10-01 00:24:52,745 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 116 transitions. [2018-10-01 00:24:52,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-10-01 00:24:52,746 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:24:52,746 INFO L375 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 16, 1, 1, 1] [2018-10-01 00:24:52,747 INFO L423 AbstractCegarLoop]: === Iteration 18 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:24:52,747 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:24:52,747 INFO L82 PathProgramCache]: Analyzing trace with hash -233894880, now seen corresponding path program 16 times [2018-10-01 00:24:52,747 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:24:52,747 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:24:52,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:24:52,748 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:24:52,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:24:52,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:24:52,972 INFO L134 CoverageAnalysis]: Checked inductivity of 616 backedges. 0 proven. 616 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:24:52,972 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:24:52,972 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:24:52,987 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:24:53,007 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:24:53,008 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:24:53,010 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:24:53,436 INFO L134 CoverageAnalysis]: Checked inductivity of 616 backedges. 0 proven. 616 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:24:53,457 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:24:53,457 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 35 [2018-10-01 00:24:53,458 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-10-01 00:24:53,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-10-01 00:24:53,458 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:24:53,458 INFO L87 Difference]: Start difference. First operand 84 states and 116 transitions. Second operand 36 states. [2018-10-01 00:24:53,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:24:53,857 INFO L93 Difference]: Finished difference Result 95 states and 131 transitions. [2018-10-01 00:24:53,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-01 00:24:53,857 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 83 [2018-10-01 00:24:53,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:24:53,858 INFO L225 Difference]: With dead ends: 95 [2018-10-01 00:24:53,858 INFO L226 Difference]: Without dead ends: 93 [2018-10-01 00:24:53,858 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time [2018-10-01 00:24:53,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-10-01 00:24:53,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 89. [2018-10-01 00:24:53,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-10-01 00:24:53,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 123 transitions. [2018-10-01 00:24:53,863 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 123 transitions. Word has length 83 [2018-10-01 00:24:53,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:24:53,864 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 123 transitions. [2018-10-01 00:24:53,864 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-10-01 00:24:53,864 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 123 transitions. [2018-10-01 00:24:53,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-10-01 00:24:53,865 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:24:53,865 INFO L375 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 17, 1, 1, 1] [2018-10-01 00:24:53,865 INFO L423 AbstractCegarLoop]: === Iteration 19 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:24:53,865 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:24:53,865 INFO L82 PathProgramCache]: Analyzing trace with hash -610287599, now seen corresponding path program 17 times [2018-10-01 00:24:53,866 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:24:53,866 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:24:53,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:24:53,866 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:24:53,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:24:53,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:24:54,050 INFO L134 CoverageAnalysis]: Checked inductivity of 697 backedges. 0 proven. 697 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:24:54,050 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:24:54,051 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:24:54,058 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:24:54,093 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2018-10-01 00:24:54,093 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:24:54,095 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:24:54,863 INFO L134 CoverageAnalysis]: Checked inductivity of 697 backedges. 0 proven. 697 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:24:54,884 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:24:54,884 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 37 [2018-10-01 00:24:54,885 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-10-01 00:24:54,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-10-01 00:24:54,885 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:24:54,885 INFO L87 Difference]: Start difference. First operand 89 states and 123 transitions. Second operand 38 states. [2018-10-01 00:24:55,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:24:55,201 INFO L93 Difference]: Finished difference Result 100 states and 138 transitions. [2018-10-01 00:24:55,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-01 00:24:55,202 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 88 [2018-10-01 00:24:55,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:24:55,202 INFO L225 Difference]: With dead ends: 100 [2018-10-01 00:24:55,202 INFO L226 Difference]: Without dead ends: 98 [2018-10-01 00:24:55,203 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s Time [2018-10-01 00:24:55,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-10-01 00:24:55,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 94. [2018-10-01 00:24:55,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-10-01 00:24:55,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 130 transitions. [2018-10-01 00:24:55,208 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 130 transitions. Word has length 88 [2018-10-01 00:24:55,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:24:55,209 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 130 transitions. [2018-10-01 00:24:55,209 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-10-01 00:24:55,209 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 130 transitions. [2018-10-01 00:24:55,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-10-01 00:24:55,210 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:24:55,210 INFO L375 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 18, 1, 1, 1] [2018-10-01 00:24:55,210 INFO L423 AbstractCegarLoop]: === Iteration 20 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:24:55,211 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:24:55,211 INFO L82 PathProgramCache]: Analyzing trace with hash 2059852480, now seen corresponding path program 18 times [2018-10-01 00:24:55,211 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:24:55,211 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:24:55,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:24:55,212 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:24:55,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:24:55,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:24:55,495 INFO L134 CoverageAnalysis]: Checked inductivity of 783 backedges. 0 proven. 783 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:24:55,496 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:24:55,496 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:24:55,505 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:24:55,543 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2018-10-01 00:24:55,543 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:24:55,547 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:24:56,144 INFO L134 CoverageAnalysis]: Checked inductivity of 783 backedges. 0 proven. 783 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:24:56,165 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:24:56,166 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 39 [2018-10-01 00:24:56,166 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-10-01 00:24:56,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-10-01 00:24:56,166 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:24:56,167 INFO L87 Difference]: Start difference. First operand 94 states and 130 transitions. Second operand 40 states. [2018-10-01 00:24:56,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:24:56,538 INFO L93 Difference]: Finished difference Result 105 states and 145 transitions. [2018-10-01 00:24:56,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-01 00:24:56,538 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 93 [2018-10-01 00:24:56,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:24:56,539 INFO L225 Difference]: With dead ends: 105 [2018-10-01 00:24:56,539 INFO L226 Difference]: Without dead ends: 103 [2018-10-01 00:24:56,540 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time [2018-10-01 00:24:56,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-10-01 00:24:56,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 99. [2018-10-01 00:24:56,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-10-01 00:24:56,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 137 transitions. [2018-10-01 00:24:56,543 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 137 transitions. Word has length 93 [2018-10-01 00:24:56,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:24:56,544 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 137 transitions. [2018-10-01 00:24:56,544 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-10-01 00:24:56,544 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 137 transitions. [2018-10-01 00:24:56,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-10-01 00:24:56,545 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:24:56,545 INFO L375 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 19, 1, 1, 1] [2018-10-01 00:24:56,545 INFO L423 AbstractCegarLoop]: === Iteration 21 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:24:56,545 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:24:56,545 INFO L82 PathProgramCache]: Analyzing trace with hash -996141711, now seen corresponding path program 19 times [2018-10-01 00:24:56,545 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:24:56,546 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:24:56,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:24:56,546 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:24:56,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:24:56,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:24:56,771 INFO L134 CoverageAnalysis]: Checked inductivity of 874 backedges. 0 proven. 874 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:24:56,771 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:24:56,772 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:24:56,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:24:56,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:24:56,808 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:24:57,485 INFO L134 CoverageAnalysis]: Checked inductivity of 874 backedges. 0 proven. 874 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:24:57,506 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:24:57,506 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 41 [2018-10-01 00:24:57,506 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-10-01 00:24:57,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-10-01 00:24:57,507 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:24:57,507 INFO L87 Difference]: Start difference. First operand 99 states and 137 transitions. Second operand 42 states. [2018-10-01 00:24:57,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:24:57,881 INFO L93 Difference]: Finished difference Result 110 states and 152 transitions. [2018-10-01 00:24:57,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-01 00:24:57,882 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 98 [2018-10-01 00:24:57,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:24:57,882 INFO L225 Difference]: With dead ends: 110 [2018-10-01 00:24:57,883 INFO L226 Difference]: Without dead ends: 108 [2018-10-01 00:24:57,883 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time [2018-10-01 00:24:57,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-10-01 00:24:57,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 104. [2018-10-01 00:24:57,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-10-01 00:24:57,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 144 transitions. [2018-10-01 00:24:57,889 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 144 transitions. Word has length 98 [2018-10-01 00:24:57,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:24:57,890 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 144 transitions. [2018-10-01 00:24:57,890 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-10-01 00:24:57,890 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 144 transitions. [2018-10-01 00:24:57,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-10-01 00:24:57,891 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:24:57,891 INFO L375 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 20, 1, 1, 1] [2018-10-01 00:24:57,891 INFO L423 AbstractCegarLoop]: === Iteration 22 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:24:57,891 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:24:57,891 INFO L82 PathProgramCache]: Analyzing trace with hash -511385248, now seen corresponding path program 20 times [2018-10-01 00:24:57,892 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:24:57,892 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:24:57,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:24:57,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:24:57,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:24:57,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:24:58,208 INFO L134 CoverageAnalysis]: Checked inductivity of 970 backedges. 0 proven. 970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:24:58,208 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:24:58,208 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:24:58,216 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:24:58,244 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:24:58,244 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:24:58,247 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:25:00,511 INFO L134 CoverageAnalysis]: Checked inductivity of 970 backedges. 0 proven. 970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:25:00,532 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:25:00,532 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 43 [2018-10-01 00:25:00,532 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-10-01 00:25:00,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-10-01 00:25:00,533 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:25:00,533 INFO L87 Difference]: Start difference. First operand 104 states and 144 transitions. Second operand 44 states. [2018-10-01 00:25:00,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:25:00,930 INFO L93 Difference]: Finished difference Result 115 states and 159 transitions. [2018-10-01 00:25:00,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-01 00:25:00,933 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 103 [2018-10-01 00:25:00,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:25:00,934 INFO L225 Difference]: With dead ends: 115 [2018-10-01 00:25:00,934 INFO L226 Difference]: Without dead ends: 113 [2018-10-01 00:25:00,935 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s Time [2018-10-01 00:25:00,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-10-01 00:25:00,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 109. [2018-10-01 00:25:00,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-10-01 00:25:00,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 151 transitions. [2018-10-01 00:25:00,940 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 151 transitions. Word has length 103 [2018-10-01 00:25:00,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:25:00,940 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 151 transitions. [2018-10-01 00:25:00,940 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-10-01 00:25:00,940 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 151 transitions. [2018-10-01 00:25:00,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-10-01 00:25:00,941 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:25:00,941 INFO L375 BasicCegarLoop]: trace histogram [21, 21, 21, 21, 21, 1, 1, 1] [2018-10-01 00:25:00,941 INFO L423 AbstractCegarLoop]: === Iteration 23 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:25:00,941 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:25:00,941 INFO L82 PathProgramCache]: Analyzing trace with hash 851260113, now seen corresponding path program 21 times [2018-10-01 00:25:00,942 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:25:00,942 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:25:00,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:00,942 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:25:00,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:00,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:25:01,167 INFO L134 CoverageAnalysis]: Checked inductivity of 1071 backedges. 0 proven. 1071 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:25:01,167 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:25:01,167 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:25:01,175 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:25:01,249 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2018-10-01 00:25:01,250 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:25:01,254 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:25:01,895 INFO L134 CoverageAnalysis]: Checked inductivity of 1071 backedges. 0 proven. 1071 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:25:01,916 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:25:01,917 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 45 [2018-10-01 00:25:01,917 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-10-01 00:25:01,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-10-01 00:25:01,917 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:25:01,918 INFO L87 Difference]: Start difference. First operand 109 states and 151 transitions. Second operand 46 states. [2018-10-01 00:25:02,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:25:02,367 INFO L93 Difference]: Finished difference Result 120 states and 166 transitions. [2018-10-01 00:25:02,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-01 00:25:02,368 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 108 [2018-10-01 00:25:02,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:25:02,369 INFO L225 Difference]: With dead ends: 120 [2018-10-01 00:25:02,369 INFO L226 Difference]: Without dead ends: 118 [2018-10-01 00:25:02,369 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time [2018-10-01 00:25:02,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-10-01 00:25:02,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 114. [2018-10-01 00:25:02,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-10-01 00:25:02,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 158 transitions. [2018-10-01 00:25:02,374 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 158 transitions. Word has length 108 [2018-10-01 00:25:02,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:25:02,374 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 158 transitions. [2018-10-01 00:25:02,374 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-10-01 00:25:02,374 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 158 transitions. [2018-10-01 00:25:02,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-10-01 00:25:02,375 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:25:02,375 INFO L375 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 22, 1, 1, 1] [2018-10-01 00:25:02,376 INFO L423 AbstractCegarLoop]: === Iteration 24 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:25:02,376 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:25:02,376 INFO L82 PathProgramCache]: Analyzing trace with hash -572317696, now seen corresponding path program 22 times [2018-10-01 00:25:02,376 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:25:02,376 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:25:02,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:02,377 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:25:02,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:02,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:25:02,668 INFO L134 CoverageAnalysis]: Checked inductivity of 1177 backedges. 0 proven. 1177 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:25:02,668 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:25:02,668 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:25:02,677 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:25:02,705 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:25:02,705 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:25:02,707 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:25:03,335 INFO L134 CoverageAnalysis]: Checked inductivity of 1177 backedges. 0 proven. 1177 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:25:03,356 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:25:03,357 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 47 [2018-10-01 00:25:03,357 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-10-01 00:25:03,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-10-01 00:25:03,358 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:25:03,358 INFO L87 Difference]: Start difference. First operand 114 states and 158 transitions. Second operand 48 states. [2018-10-01 00:25:03,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:25:03,835 INFO L93 Difference]: Finished difference Result 125 states and 173 transitions. [2018-10-01 00:25:03,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-01 00:25:03,836 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 113 [2018-10-01 00:25:03,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:25:03,837 INFO L225 Difference]: With dead ends: 125 [2018-10-01 00:25:03,837 INFO L226 Difference]: Without dead ends: 123 [2018-10-01 00:25:03,837 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time [2018-10-01 00:25:03,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-10-01 00:25:03,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 119. [2018-10-01 00:25:03,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-10-01 00:25:03,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 165 transitions. [2018-10-01 00:25:03,843 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 165 transitions. Word has length 113 [2018-10-01 00:25:03,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:25:03,843 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 165 transitions. [2018-10-01 00:25:03,843 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-10-01 00:25:03,843 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 165 transitions. [2018-10-01 00:25:03,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-10-01 00:25:03,844 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:25:03,844 INFO L375 BasicCegarLoop]: trace histogram [23, 23, 23, 23, 23, 1, 1, 1] [2018-10-01 00:25:03,844 INFO L423 AbstractCegarLoop]: === Iteration 25 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:25:03,844 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:25:03,844 INFO L82 PathProgramCache]: Analyzing trace with hash 513611825, now seen corresponding path program 23 times [2018-10-01 00:25:03,844 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:25:03,844 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:25:03,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:03,845 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:25:03,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:03,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:25:04,217 INFO L134 CoverageAnalysis]: Checked inductivity of 1288 backedges. 0 proven. 1288 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:25:04,217 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:25:04,218 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:25:04,225 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:25:04,272 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2018-10-01 00:25:04,272 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:25:04,275 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:25:04,947 INFO L134 CoverageAnalysis]: Checked inductivity of 1288 backedges. 0 proven. 1288 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:25:04,967 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:25:04,967 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 49 [2018-10-01 00:25:04,967 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-10-01 00:25:04,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-10-01 00:25:04,968 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:25:04,968 INFO L87 Difference]: Start difference. First operand 119 states and 165 transitions. Second operand 50 states. [2018-10-01 00:25:05,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:25:05,323 INFO L93 Difference]: Finished difference Result 130 states and 180 transitions. [2018-10-01 00:25:05,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-10-01 00:25:05,323 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 118 [2018-10-01 00:25:05,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:25:05,324 INFO L225 Difference]: With dead ends: 130 [2018-10-01 00:25:05,324 INFO L226 Difference]: Without dead ends: 128 [2018-10-01 00:25:05,324 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s Time [2018-10-01 00:25:05,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-10-01 00:25:05,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 124. [2018-10-01 00:25:05,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-10-01 00:25:05,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 172 transitions. [2018-10-01 00:25:05,329 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 172 transitions. Word has length 118 [2018-10-01 00:25:05,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:25:05,330 INFO L480 AbstractCegarLoop]: Abstraction has 124 states and 172 transitions. [2018-10-01 00:25:05,330 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-10-01 00:25:05,330 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 172 transitions. [2018-10-01 00:25:05,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-10-01 00:25:05,331 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:25:05,331 INFO L375 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 24, 1, 1, 1] [2018-10-01 00:25:05,331 INFO L423 AbstractCegarLoop]: === Iteration 26 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:25:05,331 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:25:05,331 INFO L82 PathProgramCache]: Analyzing trace with hash -285501792, now seen corresponding path program 24 times [2018-10-01 00:25:05,332 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:25:05,332 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:25:05,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:05,332 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:25:05,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:05,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:25:05,614 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 1404 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:25:05,614 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:25:05,614 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:25:05,621 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:25:05,679 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2018-10-01 00:25:05,680 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:25:05,683 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:25:06,476 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 1404 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:25:06,497 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:25:06,497 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 51 [2018-10-01 00:25:06,497 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-10-01 00:25:06,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-10-01 00:25:06,498 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:25:06,498 INFO L87 Difference]: Start difference. First operand 124 states and 172 transitions. Second operand 52 states. [2018-10-01 00:25:06,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:25:06,913 INFO L93 Difference]: Finished difference Result 135 states and 187 transitions. [2018-10-01 00:25:06,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-01 00:25:06,913 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 123 [2018-10-01 00:25:06,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:25:06,914 INFO L225 Difference]: With dead ends: 135 [2018-10-01 00:25:06,914 INFO L226 Difference]: Without dead ends: 133 [2018-10-01 00:25:06,914 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s Time [2018-10-01 00:25:06,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-10-01 00:25:06,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 129. [2018-10-01 00:25:06,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-10-01 00:25:06,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 179 transitions. [2018-10-01 00:25:06,919 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 179 transitions. Word has length 123 [2018-10-01 00:25:06,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:25:06,919 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 179 transitions. [2018-10-01 00:25:06,919 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-10-01 00:25:06,920 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 179 transitions. [2018-10-01 00:25:06,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-10-01 00:25:06,920 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:25:06,920 INFO L375 BasicCegarLoop]: trace histogram [25, 25, 25, 25, 25, 1, 1, 1] [2018-10-01 00:25:06,921 INFO L423 AbstractCegarLoop]: === Iteration 27 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:25:06,921 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:25:06,921 INFO L82 PathProgramCache]: Analyzing trace with hash 1768277393, now seen corresponding path program 25 times [2018-10-01 00:25:06,921 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:25:06,921 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:25:06,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:06,922 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:25:06,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:06,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:25:07,170 INFO L134 CoverageAnalysis]: Checked inductivity of 1525 backedges. 0 proven. 1525 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:25:07,171 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:25:07,171 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:25:07,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:25:07,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:25:07,214 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:25:07,889 INFO L134 CoverageAnalysis]: Checked inductivity of 1525 backedges. 0 proven. 1525 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:25:07,910 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:25:07,910 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 53 [2018-10-01 00:25:07,911 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-10-01 00:25:07,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-10-01 00:25:07,911 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:25:07,911 INFO L87 Difference]: Start difference. First operand 129 states and 179 transitions. Second operand 54 states. [2018-10-01 00:25:08,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:25:08,514 INFO L93 Difference]: Finished difference Result 140 states and 194 transitions. [2018-10-01 00:25:08,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-10-01 00:25:08,515 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 128 [2018-10-01 00:25:08,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:25:08,516 INFO L225 Difference]: With dead ends: 140 [2018-10-01 00:25:08,516 INFO L226 Difference]: Without dead ends: 138 [2018-10-01 00:25:08,516 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time [2018-10-01 00:25:08,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-10-01 00:25:08,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 134. [2018-10-01 00:25:08,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-10-01 00:25:08,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 186 transitions. [2018-10-01 00:25:08,521 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 186 transitions. Word has length 128 [2018-10-01 00:25:08,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:25:08,522 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 186 transitions. [2018-10-01 00:25:08,522 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-10-01 00:25:08,522 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 186 transitions. [2018-10-01 00:25:08,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-10-01 00:25:08,523 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:25:08,523 INFO L375 BasicCegarLoop]: trace histogram [26, 26, 26, 26, 26, 1, 1, 1] [2018-10-01 00:25:08,523 INFO L423 AbstractCegarLoop]: === Iteration 28 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:25:08,523 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:25:08,523 INFO L82 PathProgramCache]: Analyzing trace with hash -77052608, now seen corresponding path program 26 times [2018-10-01 00:25:08,523 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:25:08,523 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:25:08,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:08,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:25:08,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:08,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:25:09,611 INFO L134 CoverageAnalysis]: Checked inductivity of 1651 backedges. 0 proven. 1651 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:25:09,612 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:25:09,612 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:25:09,619 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:25:09,655 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:25:09,656 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:25:09,658 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:25:10,870 INFO L134 CoverageAnalysis]: Checked inductivity of 1651 backedges. 0 proven. 1651 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:25:10,891 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:25:10,892 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 55 [2018-10-01 00:25:10,892 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-10-01 00:25:10,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-10-01 00:25:10,893 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:25:10,893 INFO L87 Difference]: Start difference. First operand 134 states and 186 transitions. Second operand 56 states. [2018-10-01 00:25:11,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:25:11,318 INFO L93 Difference]: Finished difference Result 145 states and 201 transitions. [2018-10-01 00:25:11,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-01 00:25:11,318 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 133 [2018-10-01 00:25:11,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:25:11,319 INFO L225 Difference]: With dead ends: 145 [2018-10-01 00:25:11,319 INFO L226 Difference]: Without dead ends: 143 [2018-10-01 00:25:11,319 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s Time [2018-10-01 00:25:11,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-10-01 00:25:11,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 139. [2018-10-01 00:25:11,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-10-01 00:25:11,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 193 transitions. [2018-10-01 00:25:11,323 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 193 transitions. Word has length 133 [2018-10-01 00:25:11,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:25:11,324 INFO L480 AbstractCegarLoop]: Abstraction has 139 states and 193 transitions. [2018-10-01 00:25:11,324 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-10-01 00:25:11,324 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 193 transitions. [2018-10-01 00:25:11,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-10-01 00:25:11,324 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:25:11,324 INFO L375 BasicCegarLoop]: trace histogram [27, 27, 27, 27, 27, 1, 1, 1] [2018-10-01 00:25:11,325 INFO L423 AbstractCegarLoop]: === Iteration 29 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:25:11,325 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:25:11,325 INFO L82 PathProgramCache]: Analyzing trace with hash 1019034353, now seen corresponding path program 27 times [2018-10-01 00:25:11,325 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:25:11,325 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:25:11,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:11,326 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:25:11,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:11,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:25:11,722 INFO L134 CoverageAnalysis]: Checked inductivity of 1782 backedges. 0 proven. 1782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:25:11,722 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:25:11,722 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:25:11,731 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:25:11,793 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2018-10-01 00:25:11,793 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:25:11,797 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:25:12,537 INFO L134 CoverageAnalysis]: Checked inductivity of 1782 backedges. 0 proven. 1782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:25:12,557 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:25:12,557 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 57 [2018-10-01 00:25:12,558 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-10-01 00:25:12,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-10-01 00:25:12,558 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:25:12,558 INFO L87 Difference]: Start difference. First operand 139 states and 193 transitions. Second operand 58 states. [2018-10-01 00:25:13,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:25:13,097 INFO L93 Difference]: Finished difference Result 150 states and 208 transitions. [2018-10-01 00:25:13,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-01 00:25:13,098 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 138 [2018-10-01 00:25:13,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:25:13,098 INFO L225 Difference]: With dead ends: 150 [2018-10-01 00:25:13,098 INFO L226 Difference]: Without dead ends: 148 [2018-10-01 00:25:13,099 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s Time [2018-10-01 00:25:13,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-10-01 00:25:13,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 144. [2018-10-01 00:25:13,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-10-01 00:25:13,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 200 transitions. [2018-10-01 00:25:13,105 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 200 transitions. Word has length 138 [2018-10-01 00:25:13,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:25:13,106 INFO L480 AbstractCegarLoop]: Abstraction has 144 states and 200 transitions. [2018-10-01 00:25:13,106 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-10-01 00:25:13,106 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 200 transitions. [2018-10-01 00:25:13,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-10-01 00:25:13,107 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:25:13,107 INFO L375 BasicCegarLoop]: trace histogram [28, 28, 28, 28, 28, 1, 1, 1] [2018-10-01 00:25:13,107 INFO L423 AbstractCegarLoop]: === Iteration 30 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:25:13,107 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:25:13,107 INFO L82 PathProgramCache]: Analyzing trace with hash -247256096, now seen corresponding path program 28 times [2018-10-01 00:25:13,108 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:25:13,108 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:25:13,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:13,108 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:25:13,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:13,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:25:13,608 INFO L134 CoverageAnalysis]: Checked inductivity of 1918 backedges. 0 proven. 1918 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:25:13,608 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:25:13,608 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:25:13,618 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:25:13,655 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:25:13,655 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:25:13,660 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:25:14,624 INFO L134 CoverageAnalysis]: Checked inductivity of 1918 backedges. 0 proven. 1918 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:25:14,645 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:25:14,645 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 59 [2018-10-01 00:25:14,646 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-10-01 00:25:14,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-10-01 00:25:14,646 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:25:14,646 INFO L87 Difference]: Start difference. First operand 144 states and 200 transitions. Second operand 60 states. [2018-10-01 00:25:15,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:25:15,272 INFO L93 Difference]: Finished difference Result 155 states and 215 transitions. [2018-10-01 00:25:15,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-10-01 00:25:15,272 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 143 [2018-10-01 00:25:15,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:25:15,273 INFO L225 Difference]: With dead ends: 155 [2018-10-01 00:25:15,274 INFO L226 Difference]: Without dead ends: 153 [2018-10-01 00:25:15,274 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s Time [2018-10-01 00:25:15,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-10-01 00:25:15,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 149. [2018-10-01 00:25:15,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-10-01 00:25:15,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 207 transitions. [2018-10-01 00:25:15,280 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 207 transitions. Word has length 143 [2018-10-01 00:25:15,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:25:15,280 INFO L480 AbstractCegarLoop]: Abstraction has 149 states and 207 transitions. [2018-10-01 00:25:15,281 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-10-01 00:25:15,281 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 207 transitions. [2018-10-01 00:25:15,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-10-01 00:25:15,281 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:25:15,282 INFO L375 BasicCegarLoop]: trace histogram [29, 29, 29, 29, 29, 1, 1, 1] [2018-10-01 00:25:15,282 INFO L423 AbstractCegarLoop]: === Iteration 31 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:25:15,282 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:25:15,282 INFO L82 PathProgramCache]: Analyzing trace with hash 1791588433, now seen corresponding path program 29 times [2018-10-01 00:25:15,282 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:25:15,282 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:25:15,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:15,283 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:25:15,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:15,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:25:16,402 INFO L134 CoverageAnalysis]: Checked inductivity of 2059 backedges. 0 proven. 2059 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:25:16,402 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:25:16,402 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:25:16,410 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:25:16,473 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 30 check-sat command(s) [2018-10-01 00:25:16,473 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:25:16,476 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:25:17,282 INFO L134 CoverageAnalysis]: Checked inductivity of 2059 backedges. 0 proven. 2059 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:25:17,303 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:25:17,303 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 61 [2018-10-01 00:25:17,303 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-10-01 00:25:17,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-10-01 00:25:17,304 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:25:17,304 INFO L87 Difference]: Start difference. First operand 149 states and 207 transitions. Second operand 62 states. [2018-10-01 00:25:17,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:25:17,934 INFO L93 Difference]: Finished difference Result 160 states and 222 transitions. [2018-10-01 00:25:17,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-10-01 00:25:17,935 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 148 [2018-10-01 00:25:17,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:25:17,936 INFO L225 Difference]: With dead ends: 160 [2018-10-01 00:25:17,936 INFO L226 Difference]: Without dead ends: 158 [2018-10-01 00:25:17,936 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s Time [2018-10-01 00:25:17,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-10-01 00:25:17,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 154. [2018-10-01 00:25:17,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-10-01 00:25:17,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 214 transitions. [2018-10-01 00:25:17,942 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 214 transitions. Word has length 148 [2018-10-01 00:25:17,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:25:17,942 INFO L480 AbstractCegarLoop]: Abstraction has 154 states and 214 transitions. [2018-10-01 00:25:17,942 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-10-01 00:25:17,942 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 214 transitions. [2018-10-01 00:25:17,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-10-01 00:25:17,943 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:25:17,943 INFO L375 BasicCegarLoop]: trace histogram [30, 30, 30, 30, 30, 1, 1, 1] [2018-10-01 00:25:17,943 INFO L423 AbstractCegarLoop]: === Iteration 32 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:25:17,944 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:25:17,944 INFO L82 PathProgramCache]: Analyzing trace with hash 1713785472, now seen corresponding path program 30 times [2018-10-01 00:25:17,944 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:25:17,944 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:25:17,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:17,945 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:25:17,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:17,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:25:18,303 INFO L134 CoverageAnalysis]: Checked inductivity of 2205 backedges. 0 proven. 2205 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:25:18,303 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:25:18,304 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:25:18,313 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:25:18,389 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 31 check-sat command(s) [2018-10-01 00:25:18,390 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:25:18,393 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:25:19,311 INFO L134 CoverageAnalysis]: Checked inductivity of 2205 backedges. 0 proven. 2205 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:25:19,332 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:25:19,333 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 63 [2018-10-01 00:25:19,333 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-10-01 00:25:19,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-10-01 00:25:19,334 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:25:19,334 INFO L87 Difference]: Start difference. First operand 154 states and 214 transitions. Second operand 64 states. [2018-10-01 00:25:19,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:25:19,986 INFO L93 Difference]: Finished difference Result 165 states and 229 transitions. [2018-10-01 00:25:19,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-10-01 00:25:19,987 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 153 [2018-10-01 00:25:19,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:25:19,988 INFO L225 Difference]: With dead ends: 165 [2018-10-01 00:25:19,988 INFO L226 Difference]: Without dead ends: 163 [2018-10-01 00:25:19,988 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s Time [2018-10-01 00:25:19,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-10-01 00:25:19,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 159. [2018-10-01 00:25:19,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-10-01 00:25:19,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 221 transitions. [2018-10-01 00:25:19,994 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 221 transitions. Word has length 153 [2018-10-01 00:25:19,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:25:19,995 INFO L480 AbstractCegarLoop]: Abstraction has 159 states and 221 transitions. [2018-10-01 00:25:19,995 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-10-01 00:25:19,995 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 221 transitions. [2018-10-01 00:25:19,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-10-01 00:25:19,996 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:25:19,996 INFO L375 BasicCegarLoop]: trace histogram [31, 31, 31, 31, 31, 1, 1, 1] [2018-10-01 00:25:19,996 INFO L423 AbstractCegarLoop]: === Iteration 33 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:25:19,997 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:25:19,997 INFO L82 PathProgramCache]: Analyzing trace with hash -835682895, now seen corresponding path program 31 times [2018-10-01 00:25:19,997 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:25:19,997 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:25:19,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:19,998 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:25:19,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:20,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:25:20,306 INFO L134 CoverageAnalysis]: Checked inductivity of 2356 backedges. 0 proven. 2356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:25:20,306 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:25:20,306 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:25:20,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:25:20,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:25:20,358 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:25:21,471 INFO L134 CoverageAnalysis]: Checked inductivity of 2356 backedges. 0 proven. 2356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:25:21,491 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:25:21,492 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 65 [2018-10-01 00:25:21,492 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-10-01 00:25:21,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-10-01 00:25:21,493 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:25:21,493 INFO L87 Difference]: Start difference. First operand 159 states and 221 transitions. Second operand 66 states. [2018-10-01 00:25:22,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:25:22,698 INFO L93 Difference]: Finished difference Result 170 states and 236 transitions. [2018-10-01 00:25:22,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-10-01 00:25:22,698 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 158 [2018-10-01 00:25:22,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:25:22,699 INFO L225 Difference]: With dead ends: 170 [2018-10-01 00:25:22,699 INFO L226 Difference]: Without dead ends: 168 [2018-10-01 00:25:22,700 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s Time [2018-10-01 00:25:22,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2018-10-01 00:25:22,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 164. [2018-10-01 00:25:22,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-10-01 00:25:22,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 228 transitions. [2018-10-01 00:25:22,706 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 228 transitions. Word has length 158 [2018-10-01 00:25:22,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:25:22,706 INFO L480 AbstractCegarLoop]: Abstraction has 164 states and 228 transitions. [2018-10-01 00:25:22,706 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-10-01 00:25:22,706 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 228 transitions. [2018-10-01 00:25:22,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-10-01 00:25:22,707 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:25:22,707 INFO L375 BasicCegarLoop]: trace histogram [32, 32, 32, 32, 32, 1, 1, 1] [2018-10-01 00:25:22,708 INFO L423 AbstractCegarLoop]: === Iteration 34 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:25:22,708 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:25:22,708 INFO L82 PathProgramCache]: Analyzing trace with hash 925606176, now seen corresponding path program 32 times [2018-10-01 00:25:22,708 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:25:22,708 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:25:22,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:22,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:25:22,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:22,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:25:23,063 INFO L134 CoverageAnalysis]: Checked inductivity of 2512 backedges. 0 proven. 2512 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:25:23,064 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:25:23,064 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:25:23,071 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:25:23,136 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:25:23,137 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:25:23,160 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:25:24,534 INFO L134 CoverageAnalysis]: Checked inductivity of 2512 backedges. 0 proven. 2512 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:25:24,555 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:25:24,556 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 67 [2018-10-01 00:25:24,556 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-10-01 00:25:24,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-10-01 00:25:24,557 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:25:24,557 INFO L87 Difference]: Start difference. First operand 164 states and 228 transitions. Second operand 68 states. [2018-10-01 00:25:25,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:25:25,200 INFO L93 Difference]: Finished difference Result 175 states and 243 transitions. [2018-10-01 00:25:25,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-10-01 00:25:25,200 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 163 [2018-10-01 00:25:25,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:25:25,201 INFO L225 Difference]: With dead ends: 175 [2018-10-01 00:25:25,201 INFO L226 Difference]: Without dead ends: 173 [2018-10-01 00:25:25,201 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s Time [2018-10-01 00:25:25,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-10-01 00:25:25,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 169. [2018-10-01 00:25:25,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-10-01 00:25:25,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 235 transitions. [2018-10-01 00:25:25,208 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 235 transitions. Word has length 163 [2018-10-01 00:25:25,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:25:25,208 INFO L480 AbstractCegarLoop]: Abstraction has 169 states and 235 transitions. [2018-10-01 00:25:25,208 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-10-01 00:25:25,208 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 235 transitions. [2018-10-01 00:25:25,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-10-01 00:25:25,209 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:25:25,209 INFO L375 BasicCegarLoop]: trace histogram [33, 33, 33, 33, 33, 1, 1, 1] [2018-10-01 00:25:25,210 INFO L423 AbstractCegarLoop]: === Iteration 35 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:25:25,210 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:25:25,210 INFO L82 PathProgramCache]: Analyzing trace with hash -1441248495, now seen corresponding path program 33 times [2018-10-01 00:25:25,210 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:25:25,210 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:25:25,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:25,211 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:25:25,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:25,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:25:26,063 INFO L134 CoverageAnalysis]: Checked inductivity of 2673 backedges. 0 proven. 2673 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:25:26,063 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:25:26,063 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:25:26,071 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:25:26,153 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2018-10-01 00:25:26,153 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:25:26,157 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:25:27,047 INFO L134 CoverageAnalysis]: Checked inductivity of 2673 backedges. 0 proven. 2673 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:25:27,068 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:25:27,068 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 69 [2018-10-01 00:25:27,068 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-10-01 00:25:27,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-10-01 00:25:27,069 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:25:27,069 INFO L87 Difference]: Start difference. First operand 169 states and 235 transitions. Second operand 70 states. [2018-10-01 00:25:27,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:25:27,710 INFO L93 Difference]: Finished difference Result 180 states and 250 transitions. [2018-10-01 00:25:27,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-10-01 00:25:27,711 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 168 [2018-10-01 00:25:27,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:25:27,712 INFO L225 Difference]: With dead ends: 180 [2018-10-01 00:25:27,712 INFO L226 Difference]: Without dead ends: 178 [2018-10-01 00:25:27,713 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s Time [2018-10-01 00:25:27,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-10-01 00:25:27,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 174. [2018-10-01 00:25:27,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-10-01 00:25:27,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 242 transitions. [2018-10-01 00:25:27,718 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 242 transitions. Word has length 168 [2018-10-01 00:25:27,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:25:27,719 INFO L480 AbstractCegarLoop]: Abstraction has 174 states and 242 transitions. [2018-10-01 00:25:27,719 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-10-01 00:25:27,719 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 242 transitions. [2018-10-01 00:25:27,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-10-01 00:25:27,720 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:25:27,720 INFO L375 BasicCegarLoop]: trace histogram [34, 34, 34, 34, 34, 1, 1, 1] [2018-10-01 00:25:27,720 INFO L423 AbstractCegarLoop]: === Iteration 36 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:25:27,720 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:25:27,720 INFO L82 PathProgramCache]: Analyzing trace with hash 686632896, now seen corresponding path program 34 times [2018-10-01 00:25:27,721 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:25:27,721 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:25:27,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:27,721 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:25:27,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:27,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:25:28,049 INFO L134 CoverageAnalysis]: Checked inductivity of 2839 backedges. 0 proven. 2839 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:25:28,050 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:25:28,050 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:25:28,058 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:25:28,103 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:25:28,104 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:25:28,107 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:25:29,156 INFO L134 CoverageAnalysis]: Checked inductivity of 2839 backedges. 0 proven. 2839 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:25:29,177 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:25:29,177 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 71 [2018-10-01 00:25:29,177 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-10-01 00:25:29,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-10-01 00:25:29,178 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:25:29,178 INFO L87 Difference]: Start difference. First operand 174 states and 242 transitions. Second operand 72 states. [2018-10-01 00:25:29,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:25:29,831 INFO L93 Difference]: Finished difference Result 185 states and 257 transitions. [2018-10-01 00:25:29,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-10-01 00:25:29,832 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 173 [2018-10-01 00:25:29,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:25:29,832 INFO L225 Difference]: With dead ends: 185 [2018-10-01 00:25:29,833 INFO L226 Difference]: Without dead ends: 183 [2018-10-01 00:25:29,833 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s Time [2018-10-01 00:25:29,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-10-01 00:25:29,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 179. [2018-10-01 00:25:29,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-10-01 00:25:29,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 249 transitions. [2018-10-01 00:25:29,838 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 249 transitions. Word has length 173 [2018-10-01 00:25:29,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:25:29,839 INFO L480 AbstractCegarLoop]: Abstraction has 179 states and 249 transitions. [2018-10-01 00:25:29,839 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-10-01 00:25:29,839 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 249 transitions. [2018-10-01 00:25:29,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-10-01 00:25:29,840 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:25:29,840 INFO L375 BasicCegarLoop]: trace histogram [35, 35, 35, 35, 35, 1, 1, 1] [2018-10-01 00:25:29,840 INFO L423 AbstractCegarLoop]: === Iteration 37 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:25:29,840 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:25:29,840 INFO L82 PathProgramCache]: Analyzing trace with hash 170319985, now seen corresponding path program 35 times [2018-10-01 00:25:29,841 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:25:29,841 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:25:29,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:29,841 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:25:29,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:29,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:25:30,176 INFO L134 CoverageAnalysis]: Checked inductivity of 3010 backedges. 0 proven. 3010 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:25:30,176 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:25:30,176 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:25:30,184 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:25:30,287 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 36 check-sat command(s) [2018-10-01 00:25:30,287 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:25:30,291 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:25:32,794 INFO L134 CoverageAnalysis]: Checked inductivity of 3010 backedges. 0 proven. 3010 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:25:32,814 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:25:32,814 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 73 [2018-10-01 00:25:32,815 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-10-01 00:25:32,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-10-01 00:25:32,815 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:25:32,816 INFO L87 Difference]: Start difference. First operand 179 states and 249 transitions. Second operand 74 states. [2018-10-01 00:25:33,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:25:33,601 INFO L93 Difference]: Finished difference Result 190 states and 264 transitions. [2018-10-01 00:25:33,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-10-01 00:25:33,602 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 178 [2018-10-01 00:25:33,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:25:33,603 INFO L225 Difference]: With dead ends: 190 [2018-10-01 00:25:33,603 INFO L226 Difference]: Without dead ends: 188 [2018-10-01 00:25:33,603 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s Time [2018-10-01 00:25:33,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-10-01 00:25:33,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 184. [2018-10-01 00:25:33,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-10-01 00:25:33,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 256 transitions. [2018-10-01 00:25:33,612 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 256 transitions. Word has length 178 [2018-10-01 00:25:33,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:25:33,612 INFO L480 AbstractCegarLoop]: Abstraction has 184 states and 256 transitions. [2018-10-01 00:25:33,612 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-10-01 00:25:33,612 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 256 transitions. [2018-10-01 00:25:33,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-10-01 00:25:33,613 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:25:33,613 INFO L375 BasicCegarLoop]: trace histogram [36, 36, 36, 36, 36, 1, 1, 1] [2018-10-01 00:25:33,615 INFO L423 AbstractCegarLoop]: === Iteration 38 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:25:33,615 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:25:33,616 INFO L82 PathProgramCache]: Analyzing trace with hash -2021329312, now seen corresponding path program 36 times [2018-10-01 00:25:33,616 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:25:33,616 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:25:33,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:33,616 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:25:33,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:33,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:25:34,133 INFO L134 CoverageAnalysis]: Checked inductivity of 3186 backedges. 0 proven. 3186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:25:34,133 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:25:34,133 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:25:34,142 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:25:34,218 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 37 check-sat command(s) [2018-10-01 00:25:34,218 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:25:34,223 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:25:35,872 INFO L134 CoverageAnalysis]: Checked inductivity of 3186 backedges. 0 proven. 3186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:25:35,893 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:25:35,893 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 75 [2018-10-01 00:25:35,894 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-10-01 00:25:35,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-10-01 00:25:35,894 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:25:35,894 INFO L87 Difference]: Start difference. First operand 184 states and 256 transitions. Second operand 76 states. [2018-10-01 00:25:36,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:25:36,583 INFO L93 Difference]: Finished difference Result 195 states and 271 transitions. [2018-10-01 00:25:36,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-01 00:25:36,584 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 183 [2018-10-01 00:25:36,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:25:36,585 INFO L225 Difference]: With dead ends: 195 [2018-10-01 00:25:36,585 INFO L226 Difference]: Without dead ends: 193 [2018-10-01 00:25:36,585 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s Time [2018-10-01 00:25:36,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-10-01 00:25:36,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 189. [2018-10-01 00:25:36,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-10-01 00:25:36,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 263 transitions. [2018-10-01 00:25:36,590 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 263 transitions. Word has length 183 [2018-10-01 00:25:36,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:25:36,591 INFO L480 AbstractCegarLoop]: Abstraction has 189 states and 263 transitions. [2018-10-01 00:25:36,591 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-10-01 00:25:36,591 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 263 transitions. [2018-10-01 00:25:36,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-10-01 00:25:36,592 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:25:36,592 INFO L375 BasicCegarLoop]: trace histogram [37, 37, 37, 37, 37, 1, 1, 1] [2018-10-01 00:25:36,592 INFO L423 AbstractCegarLoop]: === Iteration 39 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:25:36,592 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:25:36,593 INFO L82 PathProgramCache]: Analyzing trace with hash 578960849, now seen corresponding path program 37 times [2018-10-01 00:25:36,593 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:25:36,593 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:25:36,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:36,594 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:25:36,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:36,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:25:36,958 INFO L134 CoverageAnalysis]: Checked inductivity of 3367 backedges. 0 proven. 3367 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:25:36,959 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:25:36,959 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:25:36,966 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:25:37,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:25:37,015 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:25:38,090 INFO L134 CoverageAnalysis]: Checked inductivity of 3367 backedges. 0 proven. 3367 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:25:38,110 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:25:38,110 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 77 [2018-10-01 00:25:38,111 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-10-01 00:25:38,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-10-01 00:25:38,111 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:25:38,112 INFO L87 Difference]: Start difference. First operand 189 states and 263 transitions. Second operand 78 states. [2018-10-01 00:25:38,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:25:38,800 INFO L93 Difference]: Finished difference Result 200 states and 278 transitions. [2018-10-01 00:25:38,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-10-01 00:25:38,801 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 188 [2018-10-01 00:25:38,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:25:38,802 INFO L225 Difference]: With dead ends: 200 [2018-10-01 00:25:38,802 INFO L226 Difference]: Without dead ends: 198 [2018-10-01 00:25:38,802 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s Time [2018-10-01 00:25:38,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-10-01 00:25:38,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 194. [2018-10-01 00:25:38,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-10-01 00:25:38,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 270 transitions. [2018-10-01 00:25:38,810 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 270 transitions. Word has length 188 [2018-10-01 00:25:38,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:25:38,810 INFO L480 AbstractCegarLoop]: Abstraction has 194 states and 270 transitions. [2018-10-01 00:25:38,810 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-10-01 00:25:38,810 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 270 transitions. [2018-10-01 00:25:38,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2018-10-01 00:25:38,811 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:25:38,811 INFO L375 BasicCegarLoop]: trace histogram [38, 38, 38, 38, 38, 1, 1, 1] [2018-10-01 00:25:38,811 INFO L423 AbstractCegarLoop]: === Iteration 40 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:25:38,812 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:25:38,812 INFO L82 PathProgramCache]: Analyzing trace with hash -963840768, now seen corresponding path program 38 times [2018-10-01 00:25:38,812 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:25:38,812 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:25:38,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:38,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:25:38,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:38,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:25:39,324 INFO L134 CoverageAnalysis]: Checked inductivity of 3553 backedges. 0 proven. 3553 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:25:39,325 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:25:39,325 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:25:39,332 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:25:39,377 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:25:39,377 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:25:39,381 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:25:40,428 INFO L134 CoverageAnalysis]: Checked inductivity of 3553 backedges. 0 proven. 3553 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:25:40,458 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:25:40,459 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 79 [2018-10-01 00:25:40,459 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-10-01 00:25:40,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-10-01 00:25:40,460 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:25:40,460 INFO L87 Difference]: Start difference. First operand 194 states and 270 transitions. Second operand 80 states. [2018-10-01 00:25:41,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:25:41,289 INFO L93 Difference]: Finished difference Result 205 states and 285 transitions. [2018-10-01 00:25:41,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-10-01 00:25:41,289 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 193 [2018-10-01 00:25:41,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:25:41,290 INFO L225 Difference]: With dead ends: 205 [2018-10-01 00:25:41,290 INFO L226 Difference]: Without dead ends: 203 [2018-10-01 00:25:41,290 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s Time [2018-10-01 00:25:41,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-10-01 00:25:41,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 199. [2018-10-01 00:25:41,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-10-01 00:25:41,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 277 transitions. [2018-10-01 00:25:41,295 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 277 transitions. Word has length 193 [2018-10-01 00:25:41,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:25:41,296 INFO L480 AbstractCegarLoop]: Abstraction has 199 states and 277 transitions. [2018-10-01 00:25:41,296 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-10-01 00:25:41,296 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 277 transitions. [2018-10-01 00:25:41,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-10-01 00:25:41,297 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:25:41,297 INFO L375 BasicCegarLoop]: trace histogram [39, 39, 39, 39, 39, 1, 1, 1] [2018-10-01 00:25:41,297 INFO L423 AbstractCegarLoop]: === Iteration 41 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:25:41,297 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:25:41,298 INFO L82 PathProgramCache]: Analyzing trace with hash -1345297615, now seen corresponding path program 39 times [2018-10-01 00:25:41,298 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:25:41,298 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:25:41,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:41,299 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:25:41,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:41,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:25:41,674 INFO L134 CoverageAnalysis]: Checked inductivity of 3744 backedges. 0 proven. 3744 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:25:41,675 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:25:41,675 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:25:41,684 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:25:41,772 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2018-10-01 00:25:41,773 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:25:41,777 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:25:42,854 INFO L134 CoverageAnalysis]: Checked inductivity of 3744 backedges. 0 proven. 3744 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:25:42,885 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:25:42,885 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 81 [2018-10-01 00:25:42,886 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-10-01 00:25:42,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-10-01 00:25:42,887 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:25:42,887 INFO L87 Difference]: Start difference. First operand 199 states and 277 transitions. Second operand 82 states. [2018-10-01 00:25:43,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:25:43,882 INFO L93 Difference]: Finished difference Result 210 states and 292 transitions. [2018-10-01 00:25:43,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-10-01 00:25:43,883 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 198 [2018-10-01 00:25:43,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:25:43,884 INFO L225 Difference]: With dead ends: 210 [2018-10-01 00:25:43,884 INFO L226 Difference]: Without dead ends: 208 [2018-10-01 00:25:43,884 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s Time [2018-10-01 00:25:43,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2018-10-01 00:25:43,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 204. [2018-10-01 00:25:43,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2018-10-01 00:25:43,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 284 transitions. [2018-10-01 00:25:43,888 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 284 transitions. Word has length 198 [2018-10-01 00:25:43,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:25:43,888 INFO L480 AbstractCegarLoop]: Abstraction has 204 states and 284 transitions. [2018-10-01 00:25:43,888 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-10-01 00:25:43,889 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 284 transitions. [2018-10-01 00:25:43,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2018-10-01 00:25:43,889 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:25:43,889 INFO L375 BasicCegarLoop]: trace histogram [40, 40, 40, 40, 40, 1, 1, 1] [2018-10-01 00:25:43,890 INFO L423 AbstractCegarLoop]: === Iteration 42 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:25:43,890 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:25:43,890 INFO L82 PathProgramCache]: Analyzing trace with hash 555690912, now seen corresponding path program 40 times [2018-10-01 00:25:43,890 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:25:43,890 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:25:43,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:43,891 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:25:43,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:43,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:25:44,983 INFO L134 CoverageAnalysis]: Checked inductivity of 3940 backedges. 0 proven. 3940 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:25:44,984 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:25:44,984 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:25:44,991 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:25:45,039 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:25:45,039 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:25:45,043 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:25:46,102 INFO L134 CoverageAnalysis]: Checked inductivity of 3940 backedges. 0 proven. 3940 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:25:46,123 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:25:46,123 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42] total 83 [2018-10-01 00:25:46,123 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-10-01 00:25:46,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-10-01 00:25:46,124 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:25:46,124 INFO L87 Difference]: Start difference. First operand 204 states and 284 transitions. Second operand 84 states. [2018-10-01 00:25:46,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:25:46,983 INFO L93 Difference]: Finished difference Result 215 states and 299 transitions. [2018-10-01 00:25:46,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-10-01 00:25:46,983 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 203 [2018-10-01 00:25:46,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:25:46,984 INFO L225 Difference]: With dead ends: 215 [2018-10-01 00:25:46,984 INFO L226 Difference]: Without dead ends: 213 [2018-10-01 00:25:46,985 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s Time [2018-10-01 00:25:46,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2018-10-01 00:25:46,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 209. [2018-10-01 00:25:46,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-10-01 00:25:46,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 291 transitions. [2018-10-01 00:25:46,991 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 291 transitions. Word has length 203 [2018-10-01 00:25:46,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:25:46,991 INFO L480 AbstractCegarLoop]: Abstraction has 209 states and 291 transitions. [2018-10-01 00:25:46,991 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-10-01 00:25:46,991 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 291 transitions. [2018-10-01 00:25:46,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2018-10-01 00:25:46,992 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:25:46,992 INFO L375 BasicCegarLoop]: trace histogram [41, 41, 41, 41, 41, 1, 1, 1] [2018-10-01 00:25:46,992 INFO L423 AbstractCegarLoop]: === Iteration 43 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:25:46,992 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:25:46,992 INFO L82 PathProgramCache]: Analyzing trace with hash 1463242897, now seen corresponding path program 41 times [2018-10-01 00:25:46,992 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:25:46,993 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:25:46,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:46,993 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:25:46,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:47,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:25:47,371 INFO L134 CoverageAnalysis]: Checked inductivity of 4141 backedges. 0 proven. 4141 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:25:47,371 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:25:47,372 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:25:47,383 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:25:47,469 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 42 check-sat command(s) [2018-10-01 00:25:47,469 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:25:47,474 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:25:51,102 INFO L134 CoverageAnalysis]: Checked inductivity of 4141 backedges. 0 proven. 4141 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:25:51,133 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:25:51,134 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 85 [2018-10-01 00:25:51,134 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-10-01 00:25:51,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-10-01 00:25:51,135 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:25:51,135 INFO L87 Difference]: Start difference. First operand 209 states and 291 transitions. Second operand 86 states. [2018-10-01 00:25:52,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:25:52,025 INFO L93 Difference]: Finished difference Result 220 states and 306 transitions. [2018-10-01 00:25:52,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-10-01 00:25:52,025 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 208 [2018-10-01 00:25:52,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:25:52,026 INFO L225 Difference]: With dead ends: 220 [2018-10-01 00:25:52,026 INFO L226 Difference]: Without dead ends: 218 [2018-10-01 00:25:52,026 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s Time [2018-10-01 00:25:52,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2018-10-01 00:25:52,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 214. [2018-10-01 00:25:52,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2018-10-01 00:25:52,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 298 transitions. [2018-10-01 00:25:52,032 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 298 transitions. Word has length 208 [2018-10-01 00:25:52,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:25:52,032 INFO L480 AbstractCegarLoop]: Abstraction has 214 states and 298 transitions. [2018-10-01 00:25:52,032 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-10-01 00:25:52,032 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 298 transitions. [2018-10-01 00:25:52,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2018-10-01 00:25:52,033 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:25:52,033 INFO L375 BasicCegarLoop]: trace histogram [42, 42, 42, 42, 42, 1, 1, 1] [2018-10-01 00:25:52,033 INFO L423 AbstractCegarLoop]: === Iteration 44 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:25:52,034 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:25:52,034 INFO L82 PathProgramCache]: Analyzing trace with hash 970299968, now seen corresponding path program 42 times [2018-10-01 00:25:52,034 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:25:52,034 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:25:52,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:52,035 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:25:52,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:52,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:25:52,507 INFO L134 CoverageAnalysis]: Checked inductivity of 4347 backedges. 0 proven. 4347 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:25:52,507 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:25:52,507 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:25:52,515 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:25:52,610 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 43 check-sat command(s) [2018-10-01 00:25:52,610 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:25:52,615 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:25:53,943 INFO L134 CoverageAnalysis]: Checked inductivity of 4347 backedges. 0 proven. 4347 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:25:53,963 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:25:53,964 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44] total 87 [2018-10-01 00:25:53,964 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-10-01 00:25:53,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-10-01 00:25:53,965 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:25:53,965 INFO L87 Difference]: Start difference. First operand 214 states and 298 transitions. Second operand 88 states. [2018-10-01 00:25:55,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:25:55,061 INFO L93 Difference]: Finished difference Result 225 states and 313 transitions. [2018-10-01 00:25:55,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-10-01 00:25:55,062 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 213 [2018-10-01 00:25:55,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:25:55,063 INFO L225 Difference]: With dead ends: 225 [2018-10-01 00:25:55,063 INFO L226 Difference]: Without dead ends: 223 [2018-10-01 00:25:55,063 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s Time [2018-10-01 00:25:55,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2018-10-01 00:25:55,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 219. [2018-10-01 00:25:55,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2018-10-01 00:25:55,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 305 transitions. [2018-10-01 00:25:55,068 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 305 transitions. Word has length 213 [2018-10-01 00:25:55,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:25:55,068 INFO L480 AbstractCegarLoop]: Abstraction has 219 states and 305 transitions. [2018-10-01 00:25:55,068 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-10-01 00:25:55,069 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 305 transitions. [2018-10-01 00:25:55,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2018-10-01 00:25:55,070 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:25:55,070 INFO L375 BasicCegarLoop]: trace histogram [43, 43, 43, 43, 43, 1, 1, 1] [2018-10-01 00:25:55,070 INFO L423 AbstractCegarLoop]: === Iteration 45 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:25:55,070 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:25:55,070 INFO L82 PathProgramCache]: Analyzing trace with hash 106759665, now seen corresponding path program 43 times [2018-10-01 00:25:55,070 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:25:55,070 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:25:55,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:55,071 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:25:55,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:55,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:25:56,872 INFO L134 CoverageAnalysis]: Checked inductivity of 4558 backedges. 0 proven. 4558 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:25:56,872 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:25:56,872 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:25:56,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:25:56,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:25:56,938 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:25:58,150 INFO L134 CoverageAnalysis]: Checked inductivity of 4558 backedges. 0 proven. 4558 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:25:58,170 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:25:58,171 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45] total 89 [2018-10-01 00:25:58,171 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-10-01 00:25:58,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-10-01 00:25:58,172 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:25:58,172 INFO L87 Difference]: Start difference. First operand 219 states and 305 transitions. Second operand 90 states. [2018-10-01 00:25:58,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:25:58,993 INFO L93 Difference]: Finished difference Result 230 states and 320 transitions. [2018-10-01 00:25:58,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-10-01 00:25:58,993 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 218 [2018-10-01 00:25:58,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:25:58,994 INFO L225 Difference]: With dead ends: 230 [2018-10-01 00:25:58,994 INFO L226 Difference]: Without dead ends: 228 [2018-10-01 00:25:58,994 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s Time [2018-10-01 00:25:58,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2018-10-01 00:25:58,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 224. [2018-10-01 00:25:58,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2018-10-01 00:25:58,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 312 transitions. [2018-10-01 00:25:58,999 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 312 transitions. Word has length 218 [2018-10-01 00:25:58,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:25:58,999 INFO L480 AbstractCegarLoop]: Abstraction has 224 states and 312 transitions. [2018-10-01 00:25:58,999 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-10-01 00:25:58,999 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 312 transitions. [2018-10-01 00:25:59,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2018-10-01 00:25:59,000 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:25:59,000 INFO L375 BasicCegarLoop]: trace histogram [44, 44, 44, 44, 44, 1, 1, 1] [2018-10-01 00:25:59,000 INFO L423 AbstractCegarLoop]: === Iteration 46 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:25:59,001 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:25:59,001 INFO L82 PathProgramCache]: Analyzing trace with hash -1161150240, now seen corresponding path program 44 times [2018-10-01 00:25:59,001 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:25:59,001 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:25:59,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:59,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:25:59,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:59,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:25:59,500 INFO L134 CoverageAnalysis]: Checked inductivity of 4774 backedges. 0 proven. 4774 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:25:59,500 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:25:59,500 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:25:59,508 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:25:59,560 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:25:59,560 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:25:59,564 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:26:00,780 INFO L134 CoverageAnalysis]: Checked inductivity of 4774 backedges. 0 proven. 4774 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:26:00,801 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:26:00,802 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46] total 91 [2018-10-01 00:26:00,802 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-10-01 00:26:00,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-10-01 00:26:00,803 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:26:00,803 INFO L87 Difference]: Start difference. First operand 224 states and 312 transitions. Second operand 92 states. [2018-10-01 00:26:01,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:26:01,803 INFO L93 Difference]: Finished difference Result 235 states and 327 transitions. [2018-10-01 00:26:01,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-10-01 00:26:01,804 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 223 [2018-10-01 00:26:01,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:26:01,805 INFO L225 Difference]: With dead ends: 235 [2018-10-01 00:26:01,805 INFO L226 Difference]: Without dead ends: 233 [2018-10-01 00:26:01,805 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s Time [2018-10-01 00:26:01,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2018-10-01 00:26:01,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 229. [2018-10-01 00:26:01,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2018-10-01 00:26:01,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 319 transitions. [2018-10-01 00:26:01,810 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 319 transitions. Word has length 223 [2018-10-01 00:26:01,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:26:01,810 INFO L480 AbstractCegarLoop]: Abstraction has 229 states and 319 transitions. [2018-10-01 00:26:01,810 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-10-01 00:26:01,810 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 319 transitions. [2018-10-01 00:26:01,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2018-10-01 00:26:01,811 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:26:01,812 INFO L375 BasicCegarLoop]: trace histogram [45, 45, 45, 45, 45, 1, 1, 1] [2018-10-01 00:26:01,812 INFO L423 AbstractCegarLoop]: === Iteration 47 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:26:01,812 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:26:01,812 INFO L82 PathProgramCache]: Analyzing trace with hash 1399292753, now seen corresponding path program 45 times [2018-10-01 00:26:01,812 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:26:01,812 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:26:01,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:26:01,813 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:26:01,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:26:01,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:26:02,162 INFO L134 CoverageAnalysis]: Checked inductivity of 4995 backedges. 0 proven. 4995 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:26:02,162 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:26:02,162 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:26:02,170 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:26:02,272 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 46 check-sat command(s) [2018-10-01 00:26:02,272 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:26:02,277 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:26:03,489 INFO L134 CoverageAnalysis]: Checked inductivity of 4995 backedges. 0 proven. 4995 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:26:03,509 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:26:03,510 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47] total 93 [2018-10-01 00:26:03,510 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-10-01 00:26:03,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-10-01 00:26:03,511 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:26:03,511 INFO L87 Difference]: Start difference. First operand 229 states and 319 transitions. Second operand 94 states. [2018-10-01 00:26:04,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:26:04,628 INFO L93 Difference]: Finished difference Result 240 states and 334 transitions. [2018-10-01 00:26:04,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-10-01 00:26:04,628 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 228 [2018-10-01 00:26:04,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:26:04,629 INFO L225 Difference]: With dead ends: 240 [2018-10-01 00:26:04,629 INFO L226 Difference]: Without dead ends: 238 [2018-10-01 00:26:04,630 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s Time [2018-10-01 00:26:04,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2018-10-01 00:26:04,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 234. [2018-10-01 00:26:04,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2018-10-01 00:26:04,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 326 transitions. [2018-10-01 00:26:04,637 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 326 transitions. Word has length 228 [2018-10-01 00:26:04,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:26:04,637 INFO L480 AbstractCegarLoop]: Abstraction has 234 states and 326 transitions. [2018-10-01 00:26:04,637 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-10-01 00:26:04,637 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 326 transitions. [2018-10-01 00:26:04,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2018-10-01 00:26:04,638 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:26:04,639 INFO L375 BasicCegarLoop]: trace histogram [46, 46, 46, 46, 46, 1, 1, 1] [2018-10-01 00:26:04,639 INFO L423 AbstractCegarLoop]: === Iteration 48 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:26:04,639 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:26:04,639 INFO L82 PathProgramCache]: Analyzing trace with hash -174645376, now seen corresponding path program 46 times [2018-10-01 00:26:04,639 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:26:04,639 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:26:04,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:26:04,640 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:26:04,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:26:04,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:26:05,152 INFO L134 CoverageAnalysis]: Checked inductivity of 5221 backedges. 0 proven. 5221 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:26:05,152 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:26:05,152 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:26:05,161 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:26:05,235 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:26:05,236 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:26:05,241 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:26:06,785 INFO L134 CoverageAnalysis]: Checked inductivity of 5221 backedges. 0 proven. 5221 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:26:06,805 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:26:06,805 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48] total 95 [2018-10-01 00:26:06,806 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-10-01 00:26:06,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-10-01 00:26:06,807 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:26:06,807 INFO L87 Difference]: Start difference. First operand 234 states and 326 transitions. Second operand 96 states. [2018-10-01 00:26:07,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:26:07,794 INFO L93 Difference]: Finished difference Result 245 states and 341 transitions. [2018-10-01 00:26:07,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-10-01 00:26:07,795 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 233 [2018-10-01 00:26:07,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:26:07,796 INFO L225 Difference]: With dead ends: 245 [2018-10-01 00:26:07,796 INFO L226 Difference]: Without dead ends: 243 [2018-10-01 00:26:07,797 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s Time [2018-10-01 00:26:07,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2018-10-01 00:26:07,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 239. [2018-10-01 00:26:07,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2018-10-01 00:26:07,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 333 transitions. [2018-10-01 00:26:07,803 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 333 transitions. Word has length 233 [2018-10-01 00:26:07,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:26:07,804 INFO L480 AbstractCegarLoop]: Abstraction has 239 states and 333 transitions. [2018-10-01 00:26:07,804 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-10-01 00:26:07,804 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 333 transitions. [2018-10-01 00:26:07,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2018-10-01 00:26:07,805 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:26:07,805 INFO L375 BasicCegarLoop]: trace histogram [47, 47, 47, 47, 47, 1, 1, 1] [2018-10-01 00:26:07,806 INFO L423 AbstractCegarLoop]: === Iteration 49 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:26:07,806 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:26:07,806 INFO L82 PathProgramCache]: Analyzing trace with hash -587413327, now seen corresponding path program 47 times [2018-10-01 00:26:07,806 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:26:07,806 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:26:07,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:26:07,808 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:26:07,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:26:07,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:26:08,190 INFO L134 CoverageAnalysis]: Checked inductivity of 5452 backedges. 0 proven. 5452 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:26:08,190 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:26:08,190 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:26:08,198 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:26:08,300 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 48 check-sat command(s) [2018-10-01 00:26:08,301 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:26:08,306 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:26:09,740 INFO L134 CoverageAnalysis]: Checked inductivity of 5452 backedges. 0 proven. 5452 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:26:09,761 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:26:09,761 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49] total 97 [2018-10-01 00:26:09,761 INFO L459 AbstractCegarLoop]: Interpolant automaton has 98 states [2018-10-01 00:26:09,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2018-10-01 00:26:09,762 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:26:09,763 INFO L87 Difference]: Start difference. First operand 239 states and 333 transitions. Second operand 98 states. [2018-10-01 00:26:11,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:26:11,029 INFO L93 Difference]: Finished difference Result 250 states and 348 transitions. [2018-10-01 00:26:11,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-10-01 00:26:11,030 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 238 [2018-10-01 00:26:11,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:26:11,031 INFO L225 Difference]: With dead ends: 250 [2018-10-01 00:26:11,031 INFO L226 Difference]: Without dead ends: 248 [2018-10-01 00:26:11,031 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s Time [2018-10-01 00:26:11,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2018-10-01 00:26:11,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 244. [2018-10-01 00:26:11,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2018-10-01 00:26:11,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 340 transitions. [2018-10-01 00:26:11,039 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 340 transitions. Word has length 238 [2018-10-01 00:26:11,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:26:11,039 INFO L480 AbstractCegarLoop]: Abstraction has 244 states and 340 transitions. [2018-10-01 00:26:11,039 INFO L481 AbstractCegarLoop]: Interpolant automaton has 98 states. [2018-10-01 00:26:11,039 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 340 transitions. [2018-10-01 00:26:11,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2018-10-01 00:26:11,040 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:26:11,041 INFO L375 BasicCegarLoop]: trace histogram [48, 48, 48, 48, 48, 1, 1, 1] [2018-10-01 00:26:11,041 INFO L423 AbstractCegarLoop]: === Iteration 50 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:26:11,041 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:26:11,041 INFO L82 PathProgramCache]: Analyzing trace with hash -2091502048, now seen corresponding path program 48 times [2018-10-01 00:26:11,041 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:26:11,041 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:26:11,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:26:11,042 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:26:11,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:26:11,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:26:11,455 INFO L134 CoverageAnalysis]: Checked inductivity of 5688 backedges. 0 proven. 5688 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:26:11,456 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:26:11,456 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:26:11,463 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:26:11,571 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 49 check-sat command(s) [2018-10-01 00:26:11,571 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:26:11,576 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:26:12,978 INFO L134 CoverageAnalysis]: Checked inductivity of 5688 backedges. 0 proven. 5688 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:26:12,998 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:26:12,998 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50] total 99 [2018-10-01 00:26:12,999 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2018-10-01 00:26:12,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2018-10-01 00:26:13,000 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:26:13,000 INFO L87 Difference]: Start difference. First operand 244 states and 340 transitions. Second operand 100 states. [2018-10-01 00:26:14,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:26:14,336 INFO L93 Difference]: Finished difference Result 255 states and 355 transitions. [2018-10-01 00:26:14,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-10-01 00:26:14,336 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 243 [2018-10-01 00:26:14,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:26:14,337 INFO L225 Difference]: With dead ends: 255 [2018-10-01 00:26:14,338 INFO L226 Difference]: Without dead ends: 253 [2018-10-01 00:26:14,338 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s Time [2018-10-01 00:26:14,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2018-10-01 00:26:14,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 249. [2018-10-01 00:26:14,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2018-10-01 00:26:14,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 347 transitions. [2018-10-01 00:26:14,343 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 347 transitions. Word has length 243 [2018-10-01 00:26:14,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:26:14,343 INFO L480 AbstractCegarLoop]: Abstraction has 249 states and 347 transitions. [2018-10-01 00:26:14,343 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2018-10-01 00:26:14,343 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 347 transitions. [2018-10-01 00:26:14,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2018-10-01 00:26:14,344 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:26:14,344 INFO L375 BasicCegarLoop]: trace histogram [49, 49, 49, 49, 49, 1, 1, 1] [2018-10-01 00:26:14,344 INFO L423 AbstractCegarLoop]: === Iteration 51 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:26:14,344 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:26:14,345 INFO L82 PathProgramCache]: Analyzing trace with hash -1438460399, now seen corresponding path program 49 times [2018-10-01 00:26:14,345 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:26:14,345 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:26:14,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:26:14,345 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:26:14,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:26:14,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:26:14,737 INFO L134 CoverageAnalysis]: Checked inductivity of 5929 backedges. 0 proven. 5929 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:26:14,738 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:26:14,738 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:26:14,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:26:14,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:26:14,810 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:26:16,315 INFO L134 CoverageAnalysis]: Checked inductivity of 5929 backedges. 0 proven. 5929 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:26:16,336 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:26:16,336 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51] total 101 [2018-10-01 00:26:16,337 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2018-10-01 00:26:16,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2018-10-01 00:26:16,338 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:26:16,338 INFO L87 Difference]: Start difference. First operand 249 states and 347 transitions. Second operand 102 states. [2018-10-01 00:26:17,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:26:17,703 INFO L93 Difference]: Finished difference Result 260 states and 362 transitions. [2018-10-01 00:26:17,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-10-01 00:26:17,703 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 248 [2018-10-01 00:26:17,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:26:17,705 INFO L225 Difference]: With dead ends: 260 [2018-10-01 00:26:17,705 INFO L226 Difference]: Without dead ends: 258 [2018-10-01 00:26:17,705 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 298 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s Time [2018-10-01 00:26:17,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2018-10-01 00:26:17,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 254. [2018-10-01 00:26:17,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2018-10-01 00:26:17,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 354 transitions. [2018-10-01 00:26:17,716 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 354 transitions. Word has length 248 [2018-10-01 00:26:17,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:26:17,716 INFO L480 AbstractCegarLoop]: Abstraction has 254 states and 354 transitions. [2018-10-01 00:26:17,716 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2018-10-01 00:26:17,716 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 354 transitions. [2018-10-01 00:26:17,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2018-10-01 00:26:17,718 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:26:17,718 INFO L375 BasicCegarLoop]: trace histogram [50, 50, 50, 50, 50, 1, 1, 1] [2018-10-01 00:26:17,718 INFO L423 AbstractCegarLoop]: === Iteration 52 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:26:17,724 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:26:17,725 INFO L82 PathProgramCache]: Analyzing trace with hash -459176768, now seen corresponding path program 50 times [2018-10-01 00:26:17,725 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:26:17,725 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:26:17,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:26:17,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:26:17,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:26:17,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:26:18,598 INFO L134 CoverageAnalysis]: Checked inductivity of 6175 backedges. 0 proven. 6175 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:26:18,598 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:26:18,599 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:26:18,609 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:26:18,666 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:26:18,666 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:26:18,670 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:26:20,183 INFO L134 CoverageAnalysis]: Checked inductivity of 6175 backedges. 0 proven. 6175 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:26:20,205 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:26:20,205 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 103 [2018-10-01 00:26:20,205 INFO L459 AbstractCegarLoop]: Interpolant automaton has 104 states [2018-10-01 00:26:20,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2018-10-01 00:26:20,207 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:26:20,207 INFO L87 Difference]: Start difference. First operand 254 states and 354 transitions. Second operand 104 states. [2018-10-01 00:26:21,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:26:21,457 INFO L93 Difference]: Finished difference Result 265 states and 369 transitions. [2018-10-01 00:26:21,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-10-01 00:26:21,458 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 253 [2018-10-01 00:26:21,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:26:21,459 INFO L225 Difference]: With dead ends: 265 [2018-10-01 00:26:21,459 INFO L226 Difference]: Without dead ends: 263 [2018-10-01 00:26:21,459 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s Time [2018-10-01 00:26:21,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2018-10-01 00:26:21,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 259. [2018-10-01 00:26:21,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2018-10-01 00:26:21,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 361 transitions. [2018-10-01 00:26:21,469 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 361 transitions. Word has length 253 [2018-10-01 00:26:21,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:26:21,469 INFO L480 AbstractCegarLoop]: Abstraction has 259 states and 361 transitions. [2018-10-01 00:26:21,469 INFO L481 AbstractCegarLoop]: Interpolant automaton has 104 states. [2018-10-01 00:26:21,469 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 361 transitions. [2018-10-01 00:26:21,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2018-10-01 00:26:21,471 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:26:21,471 INFO L375 BasicCegarLoop]: trace histogram [51, 51, 51, 51, 51, 1, 1, 1] [2018-10-01 00:26:21,471 INFO L423 AbstractCegarLoop]: === Iteration 53 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:26:21,471 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:26:21,471 INFO L82 PathProgramCache]: Analyzing trace with hash -1965053071, now seen corresponding path program 51 times [2018-10-01 00:26:21,472 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:26:21,472 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:26:21,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:26:21,472 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:26:21,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:26:21,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:26:21,943 INFO L134 CoverageAnalysis]: Checked inductivity of 6426 backedges. 0 proven. 6426 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:26:21,943 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:26:21,943 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:26:21,952 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:26:22,089 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 52 check-sat command(s) [2018-10-01 00:26:22,089 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:26:22,094 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:26:23,585 INFO L134 CoverageAnalysis]: Checked inductivity of 6426 backedges. 0 proven. 6426 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:26:23,605 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:26:23,605 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53] total 105 [2018-10-01 00:26:23,606 INFO L459 AbstractCegarLoop]: Interpolant automaton has 106 states [2018-10-01 00:26:23,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2018-10-01 00:26:23,607 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:26:23,607 INFO L87 Difference]: Start difference. First operand 259 states and 361 transitions. Second operand 106 states. [2018-10-01 00:26:25,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:26:25,189 INFO L93 Difference]: Finished difference Result 270 states and 376 transitions. [2018-10-01 00:26:25,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-10-01 00:26:25,189 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 258 [2018-10-01 00:26:25,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:26:25,190 INFO L225 Difference]: With dead ends: 270 [2018-10-01 00:26:25,190 INFO L226 Difference]: Without dead ends: 268 [2018-10-01 00:26:25,191 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 310 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s Time [2018-10-01 00:26:25,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2018-10-01 00:26:25,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 264. [2018-10-01 00:26:25,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2018-10-01 00:26:25,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 368 transitions. [2018-10-01 00:26:25,197 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 368 transitions. Word has length 258 [2018-10-01 00:26:25,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:26:25,197 INFO L480 AbstractCegarLoop]: Abstraction has 264 states and 368 transitions. [2018-10-01 00:26:25,197 INFO L481 AbstractCegarLoop]: Interpolant automaton has 106 states. [2018-10-01 00:26:25,198 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 368 transitions. [2018-10-01 00:26:25,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2018-10-01 00:26:25,198 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:26:25,199 INFO L375 BasicCegarLoop]: trace histogram [52, 52, 52, 52, 52, 1, 1, 1] [2018-10-01 00:26:25,199 INFO L423 AbstractCegarLoop]: === Iteration 54 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:26:25,199 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:26:25,199 INFO L82 PathProgramCache]: Analyzing trace with hash 563284832, now seen corresponding path program 52 times [2018-10-01 00:26:25,199 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:26:25,199 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:26:25,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:26:25,200 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:26:25,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:26:25,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:26:25,693 INFO L134 CoverageAnalysis]: Checked inductivity of 6682 backedges. 0 proven. 6682 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:26:25,694 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:26:25,694 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:26:25,701 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:26:25,761 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:26:25,762 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:26:25,766 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:26:27,267 INFO L134 CoverageAnalysis]: Checked inductivity of 6682 backedges. 0 proven. 6682 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:26:27,289 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:26:27,289 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54] total 107 [2018-10-01 00:26:27,290 INFO L459 AbstractCegarLoop]: Interpolant automaton has 108 states [2018-10-01 00:26:27,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2018-10-01 00:26:27,291 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:26:27,291 INFO L87 Difference]: Start difference. First operand 264 states and 368 transitions. Second operand 108 states. [2018-10-01 00:26:28,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:26:28,756 INFO L93 Difference]: Finished difference Result 275 states and 383 transitions. [2018-10-01 00:26:28,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-10-01 00:26:28,756 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 263 [2018-10-01 00:26:28,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:26:28,757 INFO L225 Difference]: With dead ends: 275 [2018-10-01 00:26:28,757 INFO L226 Difference]: Without dead ends: 273 [2018-10-01 00:26:28,757 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 316 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s Time [2018-10-01 00:26:28,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2018-10-01 00:26:28,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 269. [2018-10-01 00:26:28,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2018-10-01 00:26:28,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 375 transitions. [2018-10-01 00:26:28,763 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 375 transitions. Word has length 263 [2018-10-01 00:26:28,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:26:28,763 INFO L480 AbstractCegarLoop]: Abstraction has 269 states and 375 transitions. [2018-10-01 00:26:28,763 INFO L481 AbstractCegarLoop]: Interpolant automaton has 108 states. [2018-10-01 00:26:28,763 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 375 transitions. [2018-10-01 00:26:28,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2018-10-01 00:26:28,764 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:26:28,764 INFO L375 BasicCegarLoop]: trace histogram [53, 53, 53, 53, 53, 1, 1, 1] [2018-10-01 00:26:28,764 INFO L423 AbstractCegarLoop]: === Iteration 55 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:26:28,765 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:26:28,765 INFO L82 PathProgramCache]: Analyzing trace with hash 1996048593, now seen corresponding path program 53 times [2018-10-01 00:26:28,765 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:26:28,765 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:26:28,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:26:28,765 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:26:28,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:26:28,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:26:29,191 INFO L134 CoverageAnalysis]: Checked inductivity of 6943 backedges. 0 proven. 6943 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:26:29,191 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:26:29,191 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:26:29,199 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:26:29,314 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 54 check-sat command(s) [2018-10-01 00:26:29,315 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:26:29,320 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:26:30,993 INFO L134 CoverageAnalysis]: Checked inductivity of 6943 backedges. 0 proven. 6943 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:26:31,013 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:26:31,014 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55] total 109 [2018-10-01 00:26:31,014 INFO L459 AbstractCegarLoop]: Interpolant automaton has 110 states [2018-10-01 00:26:31,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2018-10-01 00:26:31,015 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:26:31,016 INFO L87 Difference]: Start difference. First operand 269 states and 375 transitions. Second operand 110 states. [2018-10-01 00:26:32,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:26:32,509 INFO L93 Difference]: Finished difference Result 280 states and 390 transitions. [2018-10-01 00:26:32,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-10-01 00:26:32,509 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 268 [2018-10-01 00:26:32,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:26:32,511 INFO L225 Difference]: With dead ends: 280 [2018-10-01 00:26:32,511 INFO L226 Difference]: Without dead ends: 278 [2018-10-01 00:26:32,511 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 322 GetRequests, 214 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s Time [2018-10-01 00:26:32,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2018-10-01 00:26:32,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 274. [2018-10-01 00:26:32,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2018-10-01 00:26:32,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 382 transitions. [2018-10-01 00:26:32,518 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 382 transitions. Word has length 268 [2018-10-01 00:26:32,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:26:32,519 INFO L480 AbstractCegarLoop]: Abstraction has 274 states and 382 transitions. [2018-10-01 00:26:32,519 INFO L481 AbstractCegarLoop]: Interpolant automaton has 110 states. [2018-10-01 00:26:32,519 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 382 transitions. [2018-10-01 00:26:32,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2018-10-01 00:26:32,520 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:26:32,520 INFO L375 BasicCegarLoop]: trace histogram [54, 54, 54, 54, 54, 1, 1, 1] [2018-10-01 00:26:32,521 INFO L423 AbstractCegarLoop]: === Iteration 56 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:26:32,521 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:26:32,521 INFO L82 PathProgramCache]: Analyzing trace with hash 1774504448, now seen corresponding path program 54 times [2018-10-01 00:26:32,521 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:26:32,521 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:26:32,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:26:32,522 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:26:32,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:26:32,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:26:32,992 INFO L134 CoverageAnalysis]: Checked inductivity of 7209 backedges. 0 proven. 7209 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:26:32,993 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:26:32,993 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:26:32,999 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:26:33,121 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 55 check-sat command(s) [2018-10-01 00:26:33,122 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:26:33,126 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:26:34,738 INFO L134 CoverageAnalysis]: Checked inductivity of 7209 backedges. 0 proven. 7209 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:26:34,757 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:26:34,758 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56] total 111 [2018-10-01 00:26:34,758 INFO L459 AbstractCegarLoop]: Interpolant automaton has 112 states [2018-10-01 00:26:34,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2018-10-01 00:26:34,759 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:26:34,759 INFO L87 Difference]: Start difference. First operand 274 states and 382 transitions. Second operand 112 states. [2018-10-01 00:26:36,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:26:36,237 INFO L93 Difference]: Finished difference Result 285 states and 397 transitions. [2018-10-01 00:26:36,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-10-01 00:26:36,237 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 273 [2018-10-01 00:26:36,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:26:36,238 INFO L225 Difference]: With dead ends: 285 [2018-10-01 00:26:36,238 INFO L226 Difference]: Without dead ends: 283 [2018-10-01 00:26:36,239 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 328 GetRequests, 218 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s Time [2018-10-01 00:26:36,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2018-10-01 00:26:36,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 279. [2018-10-01 00:26:36,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2018-10-01 00:26:36,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 389 transitions. [2018-10-01 00:26:36,246 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 389 transitions. Word has length 273 [2018-10-01 00:26:36,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:26:36,247 INFO L480 AbstractCegarLoop]: Abstraction has 279 states and 389 transitions. [2018-10-01 00:26:36,247 INFO L481 AbstractCegarLoop]: Interpolant automaton has 112 states. [2018-10-01 00:26:36,247 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 389 transitions. [2018-10-01 00:26:36,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2018-10-01 00:26:36,248 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:26:36,248 INFO L375 BasicCegarLoop]: trace histogram [55, 55, 55, 55, 55, 1, 1, 1] [2018-10-01 00:26:36,249 INFO L423 AbstractCegarLoop]: === Iteration 57 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:26:36,249 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:26:36,249 INFO L82 PathProgramCache]: Analyzing trace with hash -281694671, now seen corresponding path program 55 times [2018-10-01 00:26:36,249 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:26:36,249 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:26:36,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:26:36,250 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:26:36,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:26:36,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:26:36,695 INFO L134 CoverageAnalysis]: Checked inductivity of 7480 backedges. 0 proven. 7480 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:26:36,695 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:26:36,695 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:26:36,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:26:36,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:26:36,775 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:26:38,431 INFO L134 CoverageAnalysis]: Checked inductivity of 7480 backedges. 0 proven. 7480 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:26:38,451 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:26:38,451 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57] total 113 [2018-10-01 00:26:38,451 INFO L459 AbstractCegarLoop]: Interpolant automaton has 114 states [2018-10-01 00:26:38,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2018-10-01 00:26:38,453 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:26:38,453 INFO L87 Difference]: Start difference. First operand 279 states and 389 transitions. Second operand 114 states. [2018-10-01 00:26:39,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:26:39,882 INFO L93 Difference]: Finished difference Result 290 states and 404 transitions. [2018-10-01 00:26:39,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-10-01 00:26:39,882 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 278 [2018-10-01 00:26:39,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:26:39,883 INFO L225 Difference]: With dead ends: 290 [2018-10-01 00:26:39,884 INFO L226 Difference]: Without dead ends: 288 [2018-10-01 00:26:39,884 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 222 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s Time [2018-10-01 00:26:39,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2018-10-01 00:26:39,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 284. [2018-10-01 00:26:39,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2018-10-01 00:26:39,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 396 transitions. [2018-10-01 00:26:39,889 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 396 transitions. Word has length 278 [2018-10-01 00:26:39,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:26:39,890 INFO L480 AbstractCegarLoop]: Abstraction has 284 states and 396 transitions. [2018-10-01 00:26:39,890 INFO L481 AbstractCegarLoop]: Interpolant automaton has 114 states. [2018-10-01 00:26:39,890 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 396 transitions. [2018-10-01 00:26:39,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2018-10-01 00:26:39,891 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:26:39,891 INFO L375 BasicCegarLoop]: trace histogram [56, 56, 56, 56, 56, 1, 1, 1] [2018-10-01 00:26:39,891 INFO L423 AbstractCegarLoop]: === Iteration 58 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:26:39,891 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:26:39,891 INFO L82 PathProgramCache]: Analyzing trace with hash -1269776224, now seen corresponding path program 56 times [2018-10-01 00:26:39,892 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:26:39,892 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:26:39,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:26:39,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:26:39,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:26:39,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:26:40,503 INFO L134 CoverageAnalysis]: Checked inductivity of 7756 backedges. 0 proven. 7756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:26:40,503 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:26:40,504 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:26:40,511 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:26:40,578 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:26:40,578 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:26:40,584 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:26:42,272 INFO L134 CoverageAnalysis]: Checked inductivity of 7756 backedges. 0 proven. 7756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:26:42,292 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:26:42,293 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58] total 115 [2018-10-01 00:26:42,293 INFO L459 AbstractCegarLoop]: Interpolant automaton has 116 states [2018-10-01 00:26:42,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2018-10-01 00:26:42,294 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:26:42,294 INFO L87 Difference]: Start difference. First operand 284 states and 396 transitions. Second operand 116 states. [2018-10-01 00:26:43,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:26:43,957 INFO L93 Difference]: Finished difference Result 295 states and 411 transitions. [2018-10-01 00:26:43,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-10-01 00:26:43,958 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 283 [2018-10-01 00:26:43,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:26:43,959 INFO L225 Difference]: With dead ends: 295 [2018-10-01 00:26:43,959 INFO L226 Difference]: Without dead ends: 293 [2018-10-01 00:26:43,959 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 340 GetRequests, 226 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s Time [2018-10-01 00:26:43,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2018-10-01 00:26:43,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 289. [2018-10-01 00:26:43,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2018-10-01 00:26:43,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 403 transitions. [2018-10-01 00:26:43,965 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 403 transitions. Word has length 283 [2018-10-01 00:26:43,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:26:43,966 INFO L480 AbstractCegarLoop]: Abstraction has 289 states and 403 transitions. [2018-10-01 00:26:43,966 INFO L481 AbstractCegarLoop]: Interpolant automaton has 116 states. [2018-10-01 00:26:43,966 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 403 transitions. [2018-10-01 00:26:43,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2018-10-01 00:26:43,967 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:26:43,967 INFO L375 BasicCegarLoop]: trace histogram [57, 57, 57, 57, 57, 1, 1, 1] [2018-10-01 00:26:43,967 INFO L423 AbstractCegarLoop]: === Iteration 59 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:26:43,967 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:26:43,967 INFO L82 PathProgramCache]: Analyzing trace with hash 1555749777, now seen corresponding path program 57 times [2018-10-01 00:26:43,967 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:26:43,968 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:26:43,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:26:43,968 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:26:43,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:26:43,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:26:44,518 INFO L134 CoverageAnalysis]: Checked inductivity of 8037 backedges. 0 proven. 8037 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:26:44,518 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:26:44,518 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:26:44,526 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:26:44,665 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 58 check-sat command(s) [2018-10-01 00:26:44,665 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:26:44,670 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:26:46,517 INFO L134 CoverageAnalysis]: Checked inductivity of 8037 backedges. 0 proven. 8037 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:26:46,538 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:26:46,538 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59] total 117 [2018-10-01 00:26:46,539 INFO L459 AbstractCegarLoop]: Interpolant automaton has 118 states [2018-10-01 00:26:46,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2018-10-01 00:26:46,540 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:26:46,540 INFO L87 Difference]: Start difference. First operand 289 states and 403 transitions. Second operand 118 states. [2018-10-01 00:26:48,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:26:48,108 INFO L93 Difference]: Finished difference Result 300 states and 418 transitions. [2018-10-01 00:26:48,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-10-01 00:26:48,109 INFO L78 Accepts]: Start accepts. Automaton has 118 states. Word has length 288 [2018-10-01 00:26:48,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:26:48,110 INFO L225 Difference]: With dead ends: 300 [2018-10-01 00:26:48,110 INFO L226 Difference]: Without dead ends: 298 [2018-10-01 00:26:48,110 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 346 GetRequests, 230 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s Time [2018-10-01 00:26:48,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2018-10-01 00:26:48,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 294. [2018-10-01 00:26:48,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2018-10-01 00:26:48,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 410 transitions. [2018-10-01 00:26:48,118 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 410 transitions. Word has length 288 [2018-10-01 00:26:48,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:26:48,119 INFO L480 AbstractCegarLoop]: Abstraction has 294 states and 410 transitions. [2018-10-01 00:26:48,119 INFO L481 AbstractCegarLoop]: Interpolant automaton has 118 states. [2018-10-01 00:26:48,119 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 410 transitions. [2018-10-01 00:26:48,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2018-10-01 00:26:48,120 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:26:48,120 INFO L375 BasicCegarLoop]: trace histogram [58, 58, 58, 58, 58, 1, 1, 1] [2018-10-01 00:26:48,121 INFO L423 AbstractCegarLoop]: === Iteration 60 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:26:48,121 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:26:48,121 INFO L82 PathProgramCache]: Analyzing trace with hash 1607528256, now seen corresponding path program 58 times [2018-10-01 00:26:48,121 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:26:48,121 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:26:48,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:26:48,122 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:26:48,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:26:48,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:26:48,641 INFO L134 CoverageAnalysis]: Checked inductivity of 8323 backedges. 0 proven. 8323 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:26:48,641 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:26:48,641 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:26:48,650 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:26:48,723 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:26:48,723 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:26:48,728 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:26:50,445 INFO L134 CoverageAnalysis]: Checked inductivity of 8323 backedges. 0 proven. 8323 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:26:50,467 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:26:50,467 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60] total 119 [2018-10-01 00:26:50,468 INFO L459 AbstractCegarLoop]: Interpolant automaton has 120 states [2018-10-01 00:26:50,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 120 interpolants. [2018-10-01 00:26:50,469 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:26:50,469 INFO L87 Difference]: Start difference. First operand 294 states and 410 transitions. Second operand 120 states. [2018-10-01 00:26:52,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:26:52,019 INFO L93 Difference]: Finished difference Result 305 states and 425 transitions. [2018-10-01 00:26:52,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-10-01 00:26:52,023 INFO L78 Accepts]: Start accepts. Automaton has 120 states. Word has length 293 [2018-10-01 00:26:52,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:26:52,024 INFO L225 Difference]: With dead ends: 305 [2018-10-01 00:26:52,024 INFO L226 Difference]: Without dead ends: 303 [2018-10-01 00:26:52,024 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 352 GetRequests, 234 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s Time [2018-10-01 00:26:52,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2018-10-01 00:26:52,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 299. [2018-10-01 00:26:52,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299 states. [2018-10-01 00:26:52,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 417 transitions. [2018-10-01 00:26:52,032 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 417 transitions. Word has length 293 [2018-10-01 00:26:52,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:26:52,033 INFO L480 AbstractCegarLoop]: Abstraction has 299 states and 417 transitions. [2018-10-01 00:26:52,033 INFO L481 AbstractCegarLoop]: Interpolant automaton has 120 states. [2018-10-01 00:26:52,033 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 417 transitions. [2018-10-01 00:26:52,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2018-10-01 00:26:52,034 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:26:52,035 INFO L375 BasicCegarLoop]: trace histogram [59, 59, 59, 59, 59, 1, 1, 1] [2018-10-01 00:26:52,035 INFO L423 AbstractCegarLoop]: === Iteration 61 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:26:52,035 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:26:52,035 INFO L82 PathProgramCache]: Analyzing trace with hash 1898893553, now seen corresponding path program 59 times [2018-10-01 00:26:52,035 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:26:52,035 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:26:52,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:26:52,036 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:26:52,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:26:52,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:26:52,544 INFO L134 CoverageAnalysis]: Checked inductivity of 8614 backedges. 0 proven. 8614 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:26:52,544 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:26:52,544 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:26:52,552 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:26:52,689 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 60 check-sat command(s) [2018-10-01 00:26:52,689 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:26:52,695 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:26:54,467 INFO L134 CoverageAnalysis]: Checked inductivity of 8614 backedges. 0 proven. 8614 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:26:54,487 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:26:54,487 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61] total 121 [2018-10-01 00:26:54,488 INFO L459 AbstractCegarLoop]: Interpolant automaton has 122 states [2018-10-01 00:26:54,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 122 interpolants. [2018-10-01 00:26:54,489 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:26:54,489 INFO L87 Difference]: Start difference. First operand 299 states and 417 transitions. Second operand 122 states. [2018-10-01 00:26:56,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:26:56,171 INFO L93 Difference]: Finished difference Result 310 states and 432 transitions. [2018-10-01 00:26:56,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-10-01 00:26:56,171 INFO L78 Accepts]: Start accepts. Automaton has 122 states. Word has length 298 [2018-10-01 00:26:56,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:26:56,172 INFO L225 Difference]: With dead ends: 310 [2018-10-01 00:26:56,172 INFO L226 Difference]: Without dead ends: 308 [2018-10-01 00:26:56,173 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 238 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s Time [2018-10-01 00:26:56,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2018-10-01 00:26:56,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 304. [2018-10-01 00:26:56,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2018-10-01 00:26:56,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 424 transitions. [2018-10-01 00:26:56,178 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 424 transitions. Word has length 298 [2018-10-01 00:26:56,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:26:56,178 INFO L480 AbstractCegarLoop]: Abstraction has 304 states and 424 transitions. [2018-10-01 00:26:56,178 INFO L481 AbstractCegarLoop]: Interpolant automaton has 122 states. [2018-10-01 00:26:56,178 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 424 transitions. [2018-10-01 00:26:56,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2018-10-01 00:26:56,179 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:26:56,179 INFO L375 BasicCegarLoop]: trace histogram [60, 60, 60, 60, 60, 1, 1, 1] [2018-10-01 00:26:56,179 INFO L423 AbstractCegarLoop]: === Iteration 62 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:26:56,179 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:26:56,180 INFO L82 PathProgramCache]: Analyzing trace with hash -765504032, now seen corresponding path program 60 times [2018-10-01 00:26:56,180 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:26:56,180 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:26:56,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:26:56,180 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:26:56,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:26:56,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:26:56,680 INFO L134 CoverageAnalysis]: Checked inductivity of 8910 backedges. 0 proven. 8910 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:26:56,680 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:26:56,680 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:26:56,687 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:26:56,827 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 61 check-sat command(s) [2018-10-01 00:26:56,827 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:26:56,834 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:26:58,626 INFO L134 CoverageAnalysis]: Checked inductivity of 8910 backedges. 0 proven. 8910 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:26:58,646 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:26:58,647 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62] total 123 [2018-10-01 00:26:58,647 INFO L459 AbstractCegarLoop]: Interpolant automaton has 124 states [2018-10-01 00:26:58,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 124 interpolants. [2018-10-01 00:26:58,648 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:26:58,648 INFO L87 Difference]: Start difference. First operand 304 states and 424 transitions. Second operand 124 states. [2018-10-01 00:27:00,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:27:00,391 INFO L93 Difference]: Finished difference Result 315 states and 439 transitions. [2018-10-01 00:27:00,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-10-01 00:27:00,392 INFO L78 Accepts]: Start accepts. Automaton has 124 states. Word has length 303 [2018-10-01 00:27:00,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:27:00,393 INFO L225 Difference]: With dead ends: 315 [2018-10-01 00:27:00,393 INFO L226 Difference]: Without dead ends: 313 [2018-10-01 00:27:00,393 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 364 GetRequests, 242 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s Time [2018-10-01 00:27:00,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2018-10-01 00:27:00,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 309. [2018-10-01 00:27:00,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states. [2018-10-01 00:27:00,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 431 transitions. [2018-10-01 00:27:00,399 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 431 transitions. Word has length 303 [2018-10-01 00:27:00,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:27:00,399 INFO L480 AbstractCegarLoop]: Abstraction has 309 states and 431 transitions. [2018-10-01 00:27:00,399 INFO L481 AbstractCegarLoop]: Interpolant automaton has 124 states. [2018-10-01 00:27:00,399 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 431 transitions. [2018-10-01 00:27:00,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2018-10-01 00:27:00,400 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:27:00,400 INFO L375 BasicCegarLoop]: trace histogram [61, 61, 61, 61, 61, 1, 1, 1] [2018-10-01 00:27:00,401 INFO L423 AbstractCegarLoop]: === Iteration 63 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:27:00,401 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:27:00,401 INFO L82 PathProgramCache]: Analyzing trace with hash -2034790831, now seen corresponding path program 61 times [2018-10-01 00:27:00,401 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:27:00,401 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:27:00,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:27:00,402 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:27:00,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:27:00,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:27:00,978 INFO L134 CoverageAnalysis]: Checked inductivity of 9211 backedges. 0 proven. 9211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:27:00,979 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:27:00,979 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:27:00,987 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:27:01,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:27:01,064 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:27:02,954 INFO L134 CoverageAnalysis]: Checked inductivity of 9211 backedges. 0 proven. 9211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:27:02,975 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:27:02,975 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63] total 125 [2018-10-01 00:27:02,976 INFO L459 AbstractCegarLoop]: Interpolant automaton has 126 states [2018-10-01 00:27:02,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 126 interpolants. [2018-10-01 00:27:02,977 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:27:02,977 INFO L87 Difference]: Start difference. First operand 309 states and 431 transitions. Second operand 126 states. [2018-10-01 00:27:04,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:27:04,598 INFO L93 Difference]: Finished difference Result 320 states and 446 transitions. [2018-10-01 00:27:04,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-10-01 00:27:04,598 INFO L78 Accepts]: Start accepts. Automaton has 126 states. Word has length 308 [2018-10-01 00:27:04,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:27:04,600 INFO L225 Difference]: With dead ends: 320 [2018-10-01 00:27:04,600 INFO L226 Difference]: Without dead ends: 318 [2018-10-01 00:27:04,600 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 370 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s Time [2018-10-01 00:27:04,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2018-10-01 00:27:04,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 314. [2018-10-01 00:27:04,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2018-10-01 00:27:04,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 438 transitions. [2018-10-01 00:27:04,608 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 438 transitions. Word has length 308 [2018-10-01 00:27:04,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:27:04,608 INFO L480 AbstractCegarLoop]: Abstraction has 314 states and 438 transitions. [2018-10-01 00:27:04,608 INFO L481 AbstractCegarLoop]: Interpolant automaton has 126 states. [2018-10-01 00:27:04,608 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 438 transitions. [2018-10-01 00:27:04,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2018-10-01 00:27:04,610 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:27:04,610 INFO L375 BasicCegarLoop]: trace histogram [62, 62, 62, 62, 62, 1, 1, 1] [2018-10-01 00:27:04,610 INFO L423 AbstractCegarLoop]: === Iteration 64 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:27:04,610 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:27:04,611 INFO L82 PathProgramCache]: Analyzing trace with hash 429257856, now seen corresponding path program 62 times [2018-10-01 00:27:04,611 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:27:04,611 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:27:04,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:27:04,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:27:04,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:27:04,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:27:05,145 INFO L134 CoverageAnalysis]: Checked inductivity of 9517 backedges. 0 proven. 9517 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:27:05,145 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:27:05,145 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:27:05,154 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:27:05,222 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:27:05,222 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:27:05,229 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:27:07,235 INFO L134 CoverageAnalysis]: Checked inductivity of 9517 backedges. 0 proven. 9517 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:27:07,256 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:27:07,256 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64] total 127 [2018-10-01 00:27:07,257 INFO L459 AbstractCegarLoop]: Interpolant automaton has 128 states [2018-10-01 00:27:07,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 128 interpolants. [2018-10-01 00:27:07,259 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:27:07,259 INFO L87 Difference]: Start difference. First operand 314 states and 438 transitions. Second operand 128 states. [2018-10-01 00:27:09,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:27:09,011 INFO L93 Difference]: Finished difference Result 325 states and 453 transitions. [2018-10-01 00:27:09,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-10-01 00:27:09,011 INFO L78 Accepts]: Start accepts. Automaton has 128 states. Word has length 313 [2018-10-01 00:27:09,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:27:09,013 INFO L225 Difference]: With dead ends: 325 [2018-10-01 00:27:09,013 INFO L226 Difference]: Without dead ends: 323 [2018-10-01 00:27:09,013 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 376 GetRequests, 250 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s Time [2018-10-01 00:27:09,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2018-10-01 00:27:09,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 319. [2018-10-01 00:27:09,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319 states. [2018-10-01 00:27:09,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 445 transitions. [2018-10-01 00:27:09,020 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 445 transitions. Word has length 313 [2018-10-01 00:27:09,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:27:09,020 INFO L480 AbstractCegarLoop]: Abstraction has 319 states and 445 transitions. [2018-10-01 00:27:09,020 INFO L481 AbstractCegarLoop]: Interpolant automaton has 128 states. [2018-10-01 00:27:09,020 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 445 transitions. [2018-10-01 00:27:09,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2018-10-01 00:27:09,022 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:27:09,022 INFO L375 BasicCegarLoop]: trace histogram [63, 63, 63, 63, 63, 1, 1, 1] [2018-10-01 00:27:09,022 INFO L423 AbstractCegarLoop]: === Iteration 65 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:27:09,022 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:27:09,023 INFO L82 PathProgramCache]: Analyzing trace with hash -322639, now seen corresponding path program 63 times [2018-10-01 00:27:09,023 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:27:09,023 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:27:09,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:27:09,023 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:27:09,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:27:09,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:27:09,562 INFO L134 CoverageAnalysis]: Checked inductivity of 9828 backedges. 0 proven. 9828 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:27:09,562 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:27:09,562 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:27:09,573 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:27:09,719 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 64 check-sat command(s) [2018-10-01 00:27:09,720 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:27:09,726 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:27:11,762 INFO L134 CoverageAnalysis]: Checked inductivity of 9828 backedges. 0 proven. 9828 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:27:11,783 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:27:11,783 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65] total 129 [2018-10-01 00:27:11,784 INFO L459 AbstractCegarLoop]: Interpolant automaton has 130 states [2018-10-01 00:27:11,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 130 interpolants. [2018-10-01 00:27:11,785 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:27:11,785 INFO L87 Difference]: Start difference. First operand 319 states and 445 transitions. Second operand 130 states. [2018-10-01 00:27:13,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:27:13,765 INFO L93 Difference]: Finished difference Result 330 states and 460 transitions. [2018-10-01 00:27:13,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-10-01 00:27:13,766 INFO L78 Accepts]: Start accepts. Automaton has 130 states. Word has length 318 [2018-10-01 00:27:13,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:27:13,767 INFO L225 Difference]: With dead ends: 330 [2018-10-01 00:27:13,767 INFO L226 Difference]: Without dead ends: 328 [2018-10-01 00:27:13,767 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 382 GetRequests, 254 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s Time [2018-10-01 00:27:13,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2018-10-01 00:27:13,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 324. [2018-10-01 00:27:13,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 324 states. [2018-10-01 00:27:13,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 452 transitions. [2018-10-01 00:27:13,773 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 452 transitions. Word has length 318 [2018-10-01 00:27:13,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:27:13,774 INFO L480 AbstractCegarLoop]: Abstraction has 324 states and 452 transitions. [2018-10-01 00:27:13,774 INFO L481 AbstractCegarLoop]: Interpolant automaton has 130 states. [2018-10-01 00:27:13,774 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 452 transitions. [2018-10-01 00:27:13,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2018-10-01 00:27:13,775 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:27:13,775 INFO L375 BasicCegarLoop]: trace histogram [64, 64, 64, 64, 64, 1, 1, 1] [2018-10-01 00:27:13,775 INFO L423 AbstractCegarLoop]: === Iteration 66 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:27:13,775 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:27:13,775 INFO L82 PathProgramCache]: Analyzing trace with hash -1970353376, now seen corresponding path program 64 times [2018-10-01 00:27:13,776 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:27:13,776 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:27:13,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:27:13,776 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:27:13,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:27:13,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:27:14,309 INFO L134 CoverageAnalysis]: Checked inductivity of 10144 backedges. 0 proven. 10144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:27:14,309 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:27:14,309 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:27:14,316 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:27:14,396 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:27:14,396 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:27:14,402 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:27:16,453 INFO L134 CoverageAnalysis]: Checked inductivity of 10144 backedges. 0 proven. 10144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:27:16,474 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:27:16,475 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66] total 131 [2018-10-01 00:27:16,475 INFO L459 AbstractCegarLoop]: Interpolant automaton has 132 states [2018-10-01 00:27:16,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 132 interpolants. [2018-10-01 00:27:16,477 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:27:16,477 INFO L87 Difference]: Start difference. First operand 324 states and 452 transitions. Second operand 132 states. [2018-10-01 00:27:18,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:27:18,297 INFO L93 Difference]: Finished difference Result 335 states and 467 transitions. [2018-10-01 00:27:18,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-10-01 00:27:18,298 INFO L78 Accepts]: Start accepts. Automaton has 132 states. Word has length 323 [2018-10-01 00:27:18,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:27:18,299 INFO L225 Difference]: With dead ends: 335 [2018-10-01 00:27:18,299 INFO L226 Difference]: Without dead ends: 333 [2018-10-01 00:27:18,299 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 388 GetRequests, 258 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s Time [2018-10-01 00:27:18,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2018-10-01 00:27:18,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 329. [2018-10-01 00:27:18,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2018-10-01 00:27:18,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 459 transitions. [2018-10-01 00:27:18,305 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 459 transitions. Word has length 323 [2018-10-01 00:27:18,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:27:18,306 INFO L480 AbstractCegarLoop]: Abstraction has 329 states and 459 transitions. [2018-10-01 00:27:18,306 INFO L481 AbstractCegarLoop]: Interpolant automaton has 132 states. [2018-10-01 00:27:18,306 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 459 transitions. [2018-10-01 00:27:18,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2018-10-01 00:27:18,307 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:27:18,307 INFO L375 BasicCegarLoop]: trace histogram [65, 65, 65, 65, 65, 1, 1, 1] [2018-10-01 00:27:18,308 INFO L423 AbstractCegarLoop]: === Iteration 67 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:27:18,308 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:27:18,308 INFO L82 PathProgramCache]: Analyzing trace with hash -1474338543, now seen corresponding path program 65 times [2018-10-01 00:27:18,308 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:27:18,308 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:27:18,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:27:18,309 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:27:18,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:27:18,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:27:19,497 INFO L134 CoverageAnalysis]: Checked inductivity of 10465 backedges. 0 proven. 10465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:27:19,498 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:27:19,498 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:27:19,505 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:27:19,660 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 66 check-sat command(s) [2018-10-01 00:27:19,660 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:27:19,667 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:27:21,805 INFO L134 CoverageAnalysis]: Checked inductivity of 10465 backedges. 0 proven. 10465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:27:21,826 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:27:21,826 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67] total 133 [2018-10-01 00:27:21,827 INFO L459 AbstractCegarLoop]: Interpolant automaton has 134 states [2018-10-01 00:27:21,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 134 interpolants. [2018-10-01 00:27:21,828 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:27:21,828 INFO L87 Difference]: Start difference. First operand 329 states and 459 transitions. Second operand 134 states. [2018-10-01 00:27:23,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:27:23,881 INFO L93 Difference]: Finished difference Result 340 states and 474 transitions. [2018-10-01 00:27:23,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-10-01 00:27:23,882 INFO L78 Accepts]: Start accepts. Automaton has 134 states. Word has length 328 [2018-10-01 00:27:23,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:27:23,883 INFO L225 Difference]: With dead ends: 340 [2018-10-01 00:27:23,883 INFO L226 Difference]: Without dead ends: 338 [2018-10-01 00:27:23,883 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 394 GetRequests, 262 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s Time [2018-10-01 00:27:23,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2018-10-01 00:27:23,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 334. [2018-10-01 00:27:23,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2018-10-01 00:27:23,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 466 transitions. [2018-10-01 00:27:23,890 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 466 transitions. Word has length 328 [2018-10-01 00:27:23,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:27:23,890 INFO L480 AbstractCegarLoop]: Abstraction has 334 states and 466 transitions. [2018-10-01 00:27:23,890 INFO L481 AbstractCegarLoop]: Interpolant automaton has 134 states. [2018-10-01 00:27:23,890 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 466 transitions. [2018-10-01 00:27:23,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2018-10-01 00:27:23,891 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:27:23,891 INFO L375 BasicCegarLoop]: trace histogram [66, 66, 66, 66, 66, 1, 1, 1] [2018-10-01 00:27:23,891 INFO L423 AbstractCegarLoop]: === Iteration 68 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:27:23,892 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:27:23,892 INFO L82 PathProgramCache]: Analyzing trace with hash 1642322368, now seen corresponding path program 66 times [2018-10-01 00:27:23,892 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:27:23,892 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:27:23,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:27:23,892 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:27:23,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:27:23,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:27:24,535 INFO L134 CoverageAnalysis]: Checked inductivity of 10791 backedges. 0 proven. 10791 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:27:24,535 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:27:24,536 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:27:24,543 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:27:24,707 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 67 check-sat command(s) [2018-10-01 00:27:24,707 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:27:24,713 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:27:26,807 INFO L134 CoverageAnalysis]: Checked inductivity of 10791 backedges. 0 proven. 10791 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:27:26,828 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:27:26,828 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68] total 135 [2018-10-01 00:27:26,829 INFO L459 AbstractCegarLoop]: Interpolant automaton has 136 states [2018-10-01 00:27:26,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 136 interpolants. [2018-10-01 00:27:26,831 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:27:26,831 INFO L87 Difference]: Start difference. First operand 334 states and 466 transitions. Second operand 136 states. [2018-10-01 00:27:29,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:27:29,075 INFO L93 Difference]: Finished difference Result 345 states and 481 transitions. [2018-10-01 00:27:29,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-10-01 00:27:29,075 INFO L78 Accepts]: Start accepts. Automaton has 136 states. Word has length 333 [2018-10-01 00:27:29,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:27:29,077 INFO L225 Difference]: With dead ends: 345 [2018-10-01 00:27:29,077 INFO L226 Difference]: Without dead ends: 343 [2018-10-01 00:27:29,077 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 400 GetRequests, 266 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s Time [2018-10-01 00:27:29,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2018-10-01 00:27:29,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 339. [2018-10-01 00:27:29,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 339 states. [2018-10-01 00:27:29,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 473 transitions. [2018-10-01 00:27:29,085 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 473 transitions. Word has length 333 [2018-10-01 00:27:29,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:27:29,086 INFO L480 AbstractCegarLoop]: Abstraction has 339 states and 473 transitions. [2018-10-01 00:27:29,086 INFO L481 AbstractCegarLoop]: Interpolant automaton has 136 states. [2018-10-01 00:27:29,086 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 473 transitions. [2018-10-01 00:27:29,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2018-10-01 00:27:29,088 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:27:29,088 INFO L375 BasicCegarLoop]: trace histogram [67, 67, 67, 67, 67, 1, 1, 1] [2018-10-01 00:27:29,088 INFO L423 AbstractCegarLoop]: === Iteration 69 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:27:29,088 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:27:29,088 INFO L82 PathProgramCache]: Analyzing trace with hash 315258481, now seen corresponding path program 67 times [2018-10-01 00:27:29,089 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:27:29,089 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:27:29,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:27:29,089 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:27:29,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:27:29,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:27:29,678 INFO L134 CoverageAnalysis]: Checked inductivity of 11122 backedges. 0 proven. 11122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:27:29,678 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:27:29,678 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:27:29,685 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:27:29,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:27:29,769 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:27:32,031 INFO L134 CoverageAnalysis]: Checked inductivity of 11122 backedges. 0 proven. 11122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:27:32,052 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:27:32,052 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69] total 137 [2018-10-01 00:27:32,052 INFO L459 AbstractCegarLoop]: Interpolant automaton has 138 states [2018-10-01 00:27:32,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 138 interpolants. [2018-10-01 00:27:32,054 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:27:32,054 INFO L87 Difference]: Start difference. First operand 339 states and 473 transitions. Second operand 138 states. [2018-10-01 00:27:34,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:27:34,317 INFO L93 Difference]: Finished difference Result 350 states and 488 transitions. [2018-10-01 00:27:34,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-10-01 00:27:34,318 INFO L78 Accepts]: Start accepts. Automaton has 138 states. Word has length 338 [2018-10-01 00:27:34,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:27:34,319 INFO L225 Difference]: With dead ends: 350 [2018-10-01 00:27:34,319 INFO L226 Difference]: Without dead ends: 348 [2018-10-01 00:27:34,319 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 406 GetRequests, 270 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s Time [2018-10-01 00:27:34,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2018-10-01 00:27:34,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 344. [2018-10-01 00:27:34,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2018-10-01 00:27:34,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 480 transitions. [2018-10-01 00:27:34,326 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 480 transitions. Word has length 338 [2018-10-01 00:27:34,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:27:34,326 INFO L480 AbstractCegarLoop]: Abstraction has 344 states and 480 transitions. [2018-10-01 00:27:34,326 INFO L481 AbstractCegarLoop]: Interpolant automaton has 138 states. [2018-10-01 00:27:34,326 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 480 transitions. [2018-10-01 00:27:34,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 344 [2018-10-01 00:27:34,327 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:27:34,328 INFO L375 BasicCegarLoop]: trace histogram [68, 68, 68, 68, 68, 1, 1, 1] [2018-10-01 00:27:34,328 INFO L423 AbstractCegarLoop]: === Iteration 70 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:27:34,328 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:27:34,328 INFO L82 PathProgramCache]: Analyzing trace with hash 1672421472, now seen corresponding path program 68 times [2018-10-01 00:27:34,328 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:27:34,328 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:27:34,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:27:34,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:27:34,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:27:34,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:27:35,023 INFO L134 CoverageAnalysis]: Checked inductivity of 11458 backedges. 0 proven. 11458 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:27:35,024 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:27:35,024 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:27:35,032 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:27:35,115 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:27:35,115 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:27:35,122 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:27:37,364 INFO L134 CoverageAnalysis]: Checked inductivity of 11458 backedges. 0 proven. 11458 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:27:37,384 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:27:37,384 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70] total 139 [2018-10-01 00:27:37,385 INFO L459 AbstractCegarLoop]: Interpolant automaton has 140 states [2018-10-01 00:27:37,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 140 interpolants. [2018-10-01 00:27:37,386 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:27:37,387 INFO L87 Difference]: Start difference. First operand 344 states and 480 transitions. Second operand 140 states. [2018-10-01 00:27:39,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:27:39,782 INFO L93 Difference]: Finished difference Result 355 states and 495 transitions. [2018-10-01 00:27:39,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-10-01 00:27:39,783 INFO L78 Accepts]: Start accepts. Automaton has 140 states. Word has length 343 [2018-10-01 00:27:39,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:27:39,784 INFO L225 Difference]: With dead ends: 355 [2018-10-01 00:27:39,784 INFO L226 Difference]: Without dead ends: 353 [2018-10-01 00:27:39,784 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 412 GetRequests, 274 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s Time [2018-10-01 00:27:39,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2018-10-01 00:27:39,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 349. [2018-10-01 00:27:39,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2018-10-01 00:27:39,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 487 transitions. [2018-10-01 00:27:39,791 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 487 transitions. Word has length 343 [2018-10-01 00:27:39,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:27:39,791 INFO L480 AbstractCegarLoop]: Abstraction has 349 states and 487 transitions. [2018-10-01 00:27:39,791 INFO L481 AbstractCegarLoop]: Interpolant automaton has 140 states. [2018-10-01 00:27:39,791 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 487 transitions. [2018-10-01 00:27:39,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2018-10-01 00:27:39,792 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:27:39,792 INFO L375 BasicCegarLoop]: trace histogram [69, 69, 69, 69, 69, 1, 1, 1] [2018-10-01 00:27:39,793 INFO L423 AbstractCegarLoop]: === Iteration 71 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:27:39,793 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:27:39,793 INFO L82 PathProgramCache]: Analyzing trace with hash -64859183, now seen corresponding path program 69 times [2018-10-01 00:27:39,793 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:27:39,793 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:27:39,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:27:39,794 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:27:39,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:27:39,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:27:40,416 INFO L134 CoverageAnalysis]: Checked inductivity of 11799 backedges. 0 proven. 11799 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:27:40,417 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:27:40,417 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:27:40,424 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:27:40,603 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 70 check-sat command(s) [2018-10-01 00:27:40,603 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:27:40,609 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:27:42,912 INFO L134 CoverageAnalysis]: Checked inductivity of 11799 backedges. 0 proven. 11799 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:27:42,932 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:27:42,933 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71] total 141 [2018-10-01 00:27:42,933 INFO L459 AbstractCegarLoop]: Interpolant automaton has 142 states [2018-10-01 00:27:42,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 142 interpolants. [2018-10-01 00:27:42,935 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:27:42,935 INFO L87 Difference]: Start difference. First operand 349 states and 487 transitions. Second operand 142 states. [2018-10-01 00:27:45,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:27:45,221 INFO L93 Difference]: Finished difference Result 360 states and 502 transitions. [2018-10-01 00:27:45,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-10-01 00:27:45,222 INFO L78 Accepts]: Start accepts. Automaton has 142 states. Word has length 348 [2018-10-01 00:27:45,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:27:45,223 INFO L225 Difference]: With dead ends: 360 [2018-10-01 00:27:45,223 INFO L226 Difference]: Without dead ends: 358 [2018-10-01 00:27:45,223 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 418 GetRequests, 278 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s Time [2018-10-01 00:27:45,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2018-10-01 00:27:45,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 354. [2018-10-01 00:27:45,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 354 states. [2018-10-01 00:27:45,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 494 transitions. [2018-10-01 00:27:45,230 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 494 transitions. Word has length 348 [2018-10-01 00:27:45,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:27:45,230 INFO L480 AbstractCegarLoop]: Abstraction has 354 states and 494 transitions. [2018-10-01 00:27:45,230 INFO L481 AbstractCegarLoop]: Interpolant automaton has 142 states. [2018-10-01 00:27:45,230 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 494 transitions. [2018-10-01 00:27:45,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 354 [2018-10-01 00:27:45,231 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:27:45,232 INFO L375 BasicCegarLoop]: trace histogram [70, 70, 70, 70, 70, 1, 1, 1] [2018-10-01 00:27:45,232 INFO L423 AbstractCegarLoop]: === Iteration 72 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:27:45,232 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:27:45,232 INFO L82 PathProgramCache]: Analyzing trace with hash 2072682240, now seen corresponding path program 70 times [2018-10-01 00:27:45,232 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:27:45,232 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:27:45,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:27:45,233 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:27:45,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:27:45,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:27:45,845 INFO L134 CoverageAnalysis]: Checked inductivity of 12145 backedges. 0 proven. 12145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:27:45,845 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:27:45,845 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:27:45,852 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:27:45,934 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:27:45,934 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:27:45,944 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:27:48,252 INFO L134 CoverageAnalysis]: Checked inductivity of 12145 backedges. 0 proven. 12145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:27:48,272 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:27:48,273 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72] total 143 [2018-10-01 00:27:48,273 INFO L459 AbstractCegarLoop]: Interpolant automaton has 144 states [2018-10-01 00:27:48,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 144 interpolants. [2018-10-01 00:27:48,275 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:27:48,275 INFO L87 Difference]: Start difference. First operand 354 states and 494 transitions. Second operand 144 states. [2018-10-01 00:27:50,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:27:50,485 INFO L93 Difference]: Finished difference Result 365 states and 509 transitions. [2018-10-01 00:27:50,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-10-01 00:27:50,485 INFO L78 Accepts]: Start accepts. Automaton has 144 states. Word has length 353 [2018-10-01 00:27:50,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:27:50,487 INFO L225 Difference]: With dead ends: 365 [2018-10-01 00:27:50,487 INFO L226 Difference]: Without dead ends: 363 [2018-10-01 00:27:50,487 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 424 GetRequests, 282 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s Time [2018-10-01 00:27:50,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2018-10-01 00:27:50,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 359. [2018-10-01 00:27:50,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 359 states. [2018-10-01 00:27:50,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 501 transitions. [2018-10-01 00:27:50,494 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 501 transitions. Word has length 353 [2018-10-01 00:27:50,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:27:50,494 INFO L480 AbstractCegarLoop]: Abstraction has 359 states and 501 transitions. [2018-10-01 00:27:50,494 INFO L481 AbstractCegarLoop]: Interpolant automaton has 144 states. [2018-10-01 00:27:50,494 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 501 transitions. [2018-10-01 00:27:50,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 359 [2018-10-01 00:27:50,495 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:27:50,496 INFO L375 BasicCegarLoop]: trace histogram [71, 71, 71, 71, 71, 1, 1, 1] [2018-10-01 00:27:50,496 INFO L423 AbstractCegarLoop]: === Iteration 73 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:27:50,496 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:27:50,496 INFO L82 PathProgramCache]: Analyzing trace with hash -1462961871, now seen corresponding path program 71 times [2018-10-01 00:27:50,496 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:27:50,496 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:27:50,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:27:50,497 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:27:50,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:27:50,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:27:51,143 INFO L134 CoverageAnalysis]: Checked inductivity of 12496 backedges. 0 proven. 12496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:27:51,143 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:27:51,143 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:27:51,150 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:27:51,340 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 72 check-sat command(s) [2018-10-01 00:27:51,340 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:27:51,349 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:27:53,708 INFO L134 CoverageAnalysis]: Checked inductivity of 12496 backedges. 0 proven. 12496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:27:53,729 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:27:53,729 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73] total 145 [2018-10-01 00:27:53,730 INFO L459 AbstractCegarLoop]: Interpolant automaton has 146 states [2018-10-01 00:27:53,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 146 interpolants. [2018-10-01 00:27:53,732 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:27:53,732 INFO L87 Difference]: Start difference. First operand 359 states and 501 transitions. Second operand 146 states. [2018-10-01 00:27:56,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:27:56,429 INFO L93 Difference]: Finished difference Result 370 states and 516 transitions. [2018-10-01 00:27:56,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-10-01 00:27:56,430 INFO L78 Accepts]: Start accepts. Automaton has 146 states. Word has length 358 [2018-10-01 00:27:56,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:27:56,431 INFO L225 Difference]: With dead ends: 370 [2018-10-01 00:27:56,431 INFO L226 Difference]: Without dead ends: 368 [2018-10-01 00:27:56,431 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 430 GetRequests, 286 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s Time [2018-10-01 00:27:56,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2018-10-01 00:27:56,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 364. [2018-10-01 00:27:56,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 364 states. [2018-10-01 00:27:56,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 508 transitions. [2018-10-01 00:27:56,441 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 508 transitions. Word has length 358 [2018-10-01 00:27:56,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:27:56,441 INFO L480 AbstractCegarLoop]: Abstraction has 364 states and 508 transitions. [2018-10-01 00:27:56,441 INFO L481 AbstractCegarLoop]: Interpolant automaton has 146 states. [2018-10-01 00:27:56,441 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 508 transitions. [2018-10-01 00:27:56,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 364 [2018-10-01 00:27:56,443 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:27:56,443 INFO L375 BasicCegarLoop]: trace histogram [72, 72, 72, 72, 72, 1, 1, 1] [2018-10-01 00:27:56,444 INFO L423 AbstractCegarLoop]: === Iteration 74 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:27:56,444 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:27:56,444 INFO L82 PathProgramCache]: Analyzing trace with hash 1552962976, now seen corresponding path program 72 times [2018-10-01 00:27:56,444 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:27:56,444 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:27:56,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:27:56,445 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:27:56,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:27:56,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:27:57,115 INFO L134 CoverageAnalysis]: Checked inductivity of 12852 backedges. 0 proven. 12852 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:27:57,115 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:27:57,115 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:27:57,122 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:27:57,314 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 73 check-sat command(s) [2018-10-01 00:27:57,314 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:27:57,321 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:27:59,664 INFO L134 CoverageAnalysis]: Checked inductivity of 12852 backedges. 0 proven. 12852 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:27:59,684 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:27:59,685 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 74] total 147 [2018-10-01 00:27:59,685 INFO L459 AbstractCegarLoop]: Interpolant automaton has 148 states [2018-10-01 00:27:59,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 148 interpolants. [2018-10-01 00:27:59,687 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:27:59,687 INFO L87 Difference]: Start difference. First operand 364 states and 508 transitions. Second operand 148 states. [2018-10-01 00:28:02,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:28:02,061 INFO L93 Difference]: Finished difference Result 375 states and 523 transitions. [2018-10-01 00:28:02,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-10-01 00:28:02,061 INFO L78 Accepts]: Start accepts. Automaton has 148 states. Word has length 363 [2018-10-01 00:28:02,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:28:02,063 INFO L225 Difference]: With dead ends: 375 [2018-10-01 00:28:02,063 INFO L226 Difference]: Without dead ends: 373 [2018-10-01 00:28:02,063 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 436 GetRequests, 290 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s Time [2018-10-01 00:28:02,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2018-10-01 00:28:02,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 369. [2018-10-01 00:28:02,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 369 states. [2018-10-01 00:28:02,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 515 transitions. [2018-10-01 00:28:02,069 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 515 transitions. Word has length 363 [2018-10-01 00:28:02,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:28:02,070 INFO L480 AbstractCegarLoop]: Abstraction has 369 states and 515 transitions. [2018-10-01 00:28:02,070 INFO L481 AbstractCegarLoop]: Interpolant automaton has 148 states. [2018-10-01 00:28:02,070 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 515 transitions. [2018-10-01 00:28:02,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 369 [2018-10-01 00:28:02,071 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:28:02,071 INFO L375 BasicCegarLoop]: trace histogram [73, 73, 73, 73, 73, 1, 1, 1] [2018-10-01 00:28:02,071 INFO L423 AbstractCegarLoop]: === Iteration 75 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:28:02,071 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:28:02,072 INFO L82 PathProgramCache]: Analyzing trace with hash 1173382801, now seen corresponding path program 73 times [2018-10-01 00:28:02,072 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:28:02,072 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:28:02,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:28:02,072 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:28:02,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:28:02,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:28:02,927 INFO L134 CoverageAnalysis]: Checked inductivity of 13213 backedges. 0 proven. 13213 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:28:02,927 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:28:02,927 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:28:02,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:28:03,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:28:03,029 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:28:05,422 INFO L134 CoverageAnalysis]: Checked inductivity of 13213 backedges. 0 proven. 13213 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:28:05,443 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:28:05,443 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75] total 149 [2018-10-01 00:28:05,444 INFO L459 AbstractCegarLoop]: Interpolant automaton has 150 states [2018-10-01 00:28:05,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 150 interpolants. [2018-10-01 00:28:05,445 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:28:05,445 INFO L87 Difference]: Start difference. First operand 369 states and 515 transitions. Second operand 150 states. [2018-10-01 00:28:08,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:28:08,030 INFO L93 Difference]: Finished difference Result 380 states and 530 transitions. [2018-10-01 00:28:08,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-10-01 00:28:08,030 INFO L78 Accepts]: Start accepts. Automaton has 150 states. Word has length 368 [2018-10-01 00:28:08,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:28:08,032 INFO L225 Difference]: With dead ends: 380 [2018-10-01 00:28:08,032 INFO L226 Difference]: Without dead ends: 378 [2018-10-01 00:28:08,032 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 442 GetRequests, 294 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s Time [2018-10-01 00:28:08,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2018-10-01 00:28:08,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 374. [2018-10-01 00:28:08,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2018-10-01 00:28:08,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 522 transitions. [2018-10-01 00:28:08,039 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 522 transitions. Word has length 368 [2018-10-01 00:28:08,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:28:08,040 INFO L480 AbstractCegarLoop]: Abstraction has 374 states and 522 transitions. [2018-10-01 00:28:08,040 INFO L481 AbstractCegarLoop]: Interpolant automaton has 150 states. [2018-10-01 00:28:08,040 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 522 transitions. [2018-10-01 00:28:08,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 374 [2018-10-01 00:28:08,041 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:28:08,041 INFO L375 BasicCegarLoop]: trace histogram [74, 74, 74, 74, 74, 1, 1, 1] [2018-10-01 00:28:08,041 INFO L423 AbstractCegarLoop]: === Iteration 76 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:28:08,041 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:28:08,042 INFO L82 PathProgramCache]: Analyzing trace with hash 559563840, now seen corresponding path program 74 times [2018-10-01 00:28:08,042 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:28:08,042 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:28:08,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:28:08,042 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:28:08,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:28:08,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:28:08,693 INFO L134 CoverageAnalysis]: Checked inductivity of 13579 backedges. 0 proven. 13579 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:28:08,693 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:28:08,693 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:28:08,701 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:28:08,790 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:28:08,790 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:28:08,798 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:28:11,246 INFO L134 CoverageAnalysis]: Checked inductivity of 13579 backedges. 0 proven. 13579 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:28:11,267 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:28:11,267 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 76] total 151 [2018-10-01 00:28:11,267 INFO L459 AbstractCegarLoop]: Interpolant automaton has 152 states [2018-10-01 00:28:11,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 152 interpolants. [2018-10-01 00:28:11,269 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:28:11,269 INFO L87 Difference]: Start difference. First operand 374 states and 522 transitions. Second operand 152 states. [2018-10-01 00:28:14,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:28:14,212 INFO L93 Difference]: Finished difference Result 385 states and 537 transitions. [2018-10-01 00:28:14,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-10-01 00:28:14,213 INFO L78 Accepts]: Start accepts. Automaton has 152 states. Word has length 373 [2018-10-01 00:28:14,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:28:14,214 INFO L225 Difference]: With dead ends: 385 [2018-10-01 00:28:14,214 INFO L226 Difference]: Without dead ends: 383 [2018-10-01 00:28:14,214 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 448 GetRequests, 298 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s Time [2018-10-01 00:28:14,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2018-10-01 00:28:14,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 379. [2018-10-01 00:28:14,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2018-10-01 00:28:14,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 529 transitions. [2018-10-01 00:28:14,221 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 529 transitions. Word has length 373 [2018-10-01 00:28:14,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:28:14,222 INFO L480 AbstractCegarLoop]: Abstraction has 379 states and 529 transitions. [2018-10-01 00:28:14,222 INFO L481 AbstractCegarLoop]: Interpolant automaton has 152 states. [2018-10-01 00:28:14,222 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 529 transitions. [2018-10-01 00:28:14,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 379 [2018-10-01 00:28:14,223 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:28:14,223 INFO L375 BasicCegarLoop]: trace histogram [75, 75, 75, 75, 75, 1, 1, 1] [2018-10-01 00:28:14,223 INFO L423 AbstractCegarLoop]: === Iteration 77 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:28:14,223 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:28:14,224 INFO L82 PathProgramCache]: Analyzing trace with hash 1228053489, now seen corresponding path program 75 times [2018-10-01 00:28:14,224 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:28:14,224 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:28:14,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:28:14,224 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:28:14,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:28:14,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:28:14,953 INFO L134 CoverageAnalysis]: Checked inductivity of 13950 backedges. 0 proven. 13950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:28:14,953 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:28:14,953 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:28:14,960 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:28:15,150 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 76 check-sat command(s) [2018-10-01 00:28:15,150 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:28:15,157 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:28:17,667 INFO L134 CoverageAnalysis]: Checked inductivity of 13950 backedges. 0 proven. 13950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:28:17,687 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:28:17,688 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77] total 153 [2018-10-01 00:28:17,688 INFO L459 AbstractCegarLoop]: Interpolant automaton has 154 states [2018-10-01 00:28:17,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 154 interpolants. [2018-10-01 00:28:17,690 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:28:17,690 INFO L87 Difference]: Start difference. First operand 379 states and 529 transitions. Second operand 154 states. [2018-10-01 00:28:20,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:28:20,652 INFO L93 Difference]: Finished difference Result 390 states and 544 transitions. [2018-10-01 00:28:20,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-10-01 00:28:20,653 INFO L78 Accepts]: Start accepts. Automaton has 154 states. Word has length 378 [2018-10-01 00:28:20,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:28:20,654 INFO L225 Difference]: With dead ends: 390 [2018-10-01 00:28:20,654 INFO L226 Difference]: Without dead ends: 388 [2018-10-01 00:28:20,654 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 454 GetRequests, 302 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s Time [2018-10-01 00:28:20,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2018-10-01 00:28:20,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 384. [2018-10-01 00:28:20,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2018-10-01 00:28:20,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 536 transitions. [2018-10-01 00:28:20,661 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 536 transitions. Word has length 378 [2018-10-01 00:28:20,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:28:20,662 INFO L480 AbstractCegarLoop]: Abstraction has 384 states and 536 transitions. [2018-10-01 00:28:20,662 INFO L481 AbstractCegarLoop]: Interpolant automaton has 154 states. [2018-10-01 00:28:20,662 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 536 transitions. [2018-10-01 00:28:20,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 384 [2018-10-01 00:28:20,663 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:28:20,663 INFO L375 BasicCegarLoop]: trace histogram [76, 76, 76, 76, 76, 1, 1, 1] [2018-10-01 00:28:20,664 INFO L423 AbstractCegarLoop]: === Iteration 78 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:28:20,664 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:28:20,664 INFO L82 PathProgramCache]: Analyzing trace with hash -335385888, now seen corresponding path program 76 times [2018-10-01 00:28:20,664 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:28:20,664 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:28:20,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:28:20,665 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:28:20,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:28:20,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:28:21,361 INFO L134 CoverageAnalysis]: Checked inductivity of 14326 backedges. 0 proven. 14326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:28:21,361 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:28:21,361 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:28:21,369 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:28:21,461 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:28:21,462 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:28:21,468 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:28:24,136 INFO L134 CoverageAnalysis]: Checked inductivity of 14326 backedges. 0 proven. 14326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:28:24,156 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:28:24,156 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 78] total 155 [2018-10-01 00:28:24,157 INFO L459 AbstractCegarLoop]: Interpolant automaton has 156 states [2018-10-01 00:28:24,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 156 interpolants. [2018-10-01 00:28:24,159 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:28:24,159 INFO L87 Difference]: Start difference. First operand 384 states and 536 transitions. Second operand 156 states. [2018-10-01 00:28:27,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:28:27,002 INFO L93 Difference]: Finished difference Result 395 states and 551 transitions. [2018-10-01 00:28:27,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-10-01 00:28:27,003 INFO L78 Accepts]: Start accepts. Automaton has 156 states. Word has length 383 [2018-10-01 00:28:27,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:28:27,004 INFO L225 Difference]: With dead ends: 395 [2018-10-01 00:28:27,004 INFO L226 Difference]: Without dead ends: 393 [2018-10-01 00:28:27,004 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 460 GetRequests, 306 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s Time [2018-10-01 00:28:27,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2018-10-01 00:28:27,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 389. [2018-10-01 00:28:27,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2018-10-01 00:28:27,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 543 transitions. [2018-10-01 00:28:27,011 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 543 transitions. Word has length 383 [2018-10-01 00:28:27,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:28:27,011 INFO L480 AbstractCegarLoop]: Abstraction has 389 states and 543 transitions. [2018-10-01 00:28:27,011 INFO L481 AbstractCegarLoop]: Interpolant automaton has 156 states. [2018-10-01 00:28:27,011 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 543 transitions. [2018-10-01 00:28:27,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 389 [2018-10-01 00:28:27,012 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:28:27,013 INFO L375 BasicCegarLoop]: trace histogram [77, 77, 77, 77, 77, 1, 1, 1] [2018-10-01 00:28:27,013 INFO L423 AbstractCegarLoop]: === Iteration 79 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:28:27,013 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:28:27,013 INFO L82 PathProgramCache]: Analyzing trace with hash -793142959, now seen corresponding path program 77 times [2018-10-01 00:28:27,013 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:28:27,013 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:28:27,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:28:27,014 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:28:27,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:28:27,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:28:27,747 INFO L134 CoverageAnalysis]: Checked inductivity of 14707 backedges. 0 proven. 14707 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:28:27,748 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:28:27,748 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:28:27,754 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:28:27,998 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 78 check-sat command(s) [2018-10-01 00:28:27,998 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:28:28,007 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:28:30,541 INFO L134 CoverageAnalysis]: Checked inductivity of 14707 backedges. 0 proven. 14707 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:28:30,563 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:28:30,563 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79] total 157 [2018-10-01 00:28:30,564 INFO L459 AbstractCegarLoop]: Interpolant automaton has 158 states [2018-10-01 00:28:30,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 158 interpolants. [2018-10-01 00:28:30,566 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:28:30,566 INFO L87 Difference]: Start difference. First operand 389 states and 543 transitions. Second operand 158 states. [2018-10-01 00:28:33,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:28:33,544 INFO L93 Difference]: Finished difference Result 400 states and 558 transitions. [2018-10-01 00:28:33,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-10-01 00:28:33,544 INFO L78 Accepts]: Start accepts. Automaton has 158 states. Word has length 388 [2018-10-01 00:28:33,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:28:33,545 INFO L225 Difference]: With dead ends: 400 [2018-10-01 00:28:33,546 INFO L226 Difference]: Without dead ends: 398 [2018-10-01 00:28:33,546 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 466 GetRequests, 310 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s Time [2018-10-01 00:28:33,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2018-10-01 00:28:33,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 394. [2018-10-01 00:28:33,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2018-10-01 00:28:33,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 550 transitions. [2018-10-01 00:28:33,553 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 550 transitions. Word has length 388 [2018-10-01 00:28:33,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:28:33,553 INFO L480 AbstractCegarLoop]: Abstraction has 394 states and 550 transitions. [2018-10-01 00:28:33,553 INFO L481 AbstractCegarLoop]: Interpolant automaton has 158 states. [2018-10-01 00:28:33,553 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 550 transitions. [2018-10-01 00:28:33,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 394 [2018-10-01 00:28:33,555 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:28:33,555 INFO L375 BasicCegarLoop]: trace histogram [78, 78, 78, 78, 78, 1, 1, 1] [2018-10-01 00:28:33,555 INFO L423 AbstractCegarLoop]: === Iteration 80 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:28:33,555 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:28:33,555 INFO L82 PathProgramCache]: Analyzing trace with hash -2044540544, now seen corresponding path program 78 times [2018-10-01 00:28:33,555 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:28:33,555 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:28:33,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:28:33,556 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:28:33,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:28:33,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:28:34,252 INFO L134 CoverageAnalysis]: Checked inductivity of 15093 backedges. 0 proven. 15093 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:28:34,252 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:28:34,252 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:28:34,259 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:28:34,457 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 79 check-sat command(s) [2018-10-01 00:28:34,457 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:28:34,464 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:28:37,020 INFO L134 CoverageAnalysis]: Checked inductivity of 15093 backedges. 0 proven. 15093 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:28:37,042 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:28:37,042 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 80] total 159 [2018-10-01 00:28:37,043 INFO L459 AbstractCegarLoop]: Interpolant automaton has 160 states [2018-10-01 00:28:37,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 160 interpolants. [2018-10-01 00:28:37,045 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:28:37,045 INFO L87 Difference]: Start difference. First operand 394 states and 550 transitions. Second operand 160 states. [2018-10-01 00:28:40,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:28:40,258 INFO L93 Difference]: Finished difference Result 405 states and 565 transitions. [2018-10-01 00:28:40,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-10-01 00:28:40,258 INFO L78 Accepts]: Start accepts. Automaton has 160 states. Word has length 393 [2018-10-01 00:28:40,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:28:40,260 INFO L225 Difference]: With dead ends: 405 [2018-10-01 00:28:40,260 INFO L226 Difference]: Without dead ends: 403 [2018-10-01 00:28:40,260 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 472 GetRequests, 314 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s Time [2018-10-01 00:28:40,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2018-10-01 00:28:40,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 399. [2018-10-01 00:28:40,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2018-10-01 00:28:40,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 557 transitions. [2018-10-01 00:28:40,267 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 557 transitions. Word has length 393 [2018-10-01 00:28:40,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:28:40,267 INFO L480 AbstractCegarLoop]: Abstraction has 399 states and 557 transitions. [2018-10-01 00:28:40,267 INFO L481 AbstractCegarLoop]: Interpolant automaton has 160 states. [2018-10-01 00:28:40,268 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 557 transitions. [2018-10-01 00:28:40,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 399 [2018-10-01 00:28:40,269 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:28:40,269 INFO L375 BasicCegarLoop]: trace histogram [79, 79, 79, 79, 79, 1, 1, 1] [2018-10-01 00:28:40,269 INFO L423 AbstractCegarLoop]: === Iteration 81 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:28:40,269 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:28:40,269 INFO L82 PathProgramCache]: Analyzing trace with hash 53173937, now seen corresponding path program 79 times [2018-10-01 00:28:40,270 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:28:40,270 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:28:40,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:28:40,270 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:28:40,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:28:40,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:28:41,031 INFO L134 CoverageAnalysis]: Checked inductivity of 15484 backedges. 0 proven. 15484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:28:41,031 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:28:41,031 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:28:41,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:28:41,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:28:41,142 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:28:43,805 INFO L134 CoverageAnalysis]: Checked inductivity of 15484 backedges. 0 proven. 15484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:28:43,825 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:28:43,825 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81] total 161 [2018-10-01 00:28:43,826 INFO L459 AbstractCegarLoop]: Interpolant automaton has 162 states [2018-10-01 00:28:43,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 162 interpolants. [2018-10-01 00:28:43,828 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:28:43,828 INFO L87 Difference]: Start difference. First operand 399 states and 557 transitions. Second operand 162 states. [2018-10-01 00:28:46,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:28:46,721 INFO L93 Difference]: Finished difference Result 410 states and 572 transitions. [2018-10-01 00:28:46,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-10-01 00:28:46,721 INFO L78 Accepts]: Start accepts. Automaton has 162 states. Word has length 398 [2018-10-01 00:28:46,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:28:46,723 INFO L225 Difference]: With dead ends: 410 [2018-10-01 00:28:46,723 INFO L226 Difference]: Without dead ends: 408 [2018-10-01 00:28:46,723 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 478 GetRequests, 318 SyntacticMatches, 0 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s Time [2018-10-01 00:28:46,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2018-10-01 00:28:46,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 404. [2018-10-01 00:28:46,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 404 states. [2018-10-01 00:28:46,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 564 transitions. [2018-10-01 00:28:46,730 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 564 transitions. Word has length 398 [2018-10-01 00:28:46,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:28:46,731 INFO L480 AbstractCegarLoop]: Abstraction has 404 states and 564 transitions. [2018-10-01 00:28:46,731 INFO L481 AbstractCegarLoop]: Interpolant automaton has 162 states. [2018-10-01 00:28:46,731 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 564 transitions. [2018-10-01 00:28:46,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 404 [2018-10-01 00:28:46,732 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:28:46,732 INFO L375 BasicCegarLoop]: trace histogram [80, 80, 80, 80, 80, 1, 1, 1] [2018-10-01 00:28:46,733 INFO L423 AbstractCegarLoop]: === Iteration 82 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:28:46,733 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:28:46,733 INFO L82 PathProgramCache]: Analyzing trace with hash 13983776, now seen corresponding path program 80 times [2018-10-01 00:28:46,733 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:28:46,733 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:28:46,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:28:46,734 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:28:46,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:28:46,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:28:47,467 INFO L134 CoverageAnalysis]: Checked inductivity of 15880 backedges. 0 proven. 15880 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:28:47,467 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:28:47,467 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:28:47,474 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:28:47,568 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:28:47,568 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:28:47,577 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:28:50,361 INFO L134 CoverageAnalysis]: Checked inductivity of 15880 backedges. 0 proven. 15880 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:28:50,381 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:28:50,381 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82, 82] total 163 [2018-10-01 00:28:50,382 INFO L459 AbstractCegarLoop]: Interpolant automaton has 164 states [2018-10-01 00:28:50,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 164 interpolants. [2018-10-01 00:28:50,384 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:28:50,384 INFO L87 Difference]: Start difference. First operand 404 states and 564 transitions. Second operand 164 states. [2018-10-01 00:28:54,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:28:54,035 INFO L93 Difference]: Finished difference Result 415 states and 579 transitions. [2018-10-01 00:28:54,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-10-01 00:28:54,036 INFO L78 Accepts]: Start accepts. Automaton has 164 states. Word has length 403 [2018-10-01 00:28:54,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:28:54,037 INFO L225 Difference]: With dead ends: 415 [2018-10-01 00:28:54,037 INFO L226 Difference]: Without dead ends: 413 [2018-10-01 00:28:54,038 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 484 GetRequests, 322 SyntacticMatches, 0 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s Time [2018-10-01 00:28:54,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2018-10-01 00:28:54,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 409. [2018-10-01 00:28:54,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 409 states. [2018-10-01 00:28:54,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 571 transitions. [2018-10-01 00:28:54,045 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 571 transitions. Word has length 403 [2018-10-01 00:28:54,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:28:54,045 INFO L480 AbstractCegarLoop]: Abstraction has 409 states and 571 transitions. [2018-10-01 00:28:54,045 INFO L481 AbstractCegarLoop]: Interpolant automaton has 164 states. [2018-10-01 00:28:54,045 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 571 transitions. [2018-10-01 00:28:54,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 409 [2018-10-01 00:28:54,047 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:28:54,047 INFO L375 BasicCegarLoop]: trace histogram [81, 81, 81, 81, 81, 1, 1, 1] [2018-10-01 00:28:54,047 INFO L423 AbstractCegarLoop]: === Iteration 83 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:28:54,047 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:28:54,047 INFO L82 PathProgramCache]: Analyzing trace with hash 1873669137, now seen corresponding path program 81 times [2018-10-01 00:28:54,048 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:28:54,048 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:28:54,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:28:54,048 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:28:54,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:28:54,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:28:54,820 INFO L134 CoverageAnalysis]: Checked inductivity of 16281 backedges. 0 proven. 16281 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:28:54,820 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:28:54,820 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:28:54,827 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:28:55,052 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 82 check-sat command(s) [2018-10-01 00:28:55,052 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:28:55,060 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:28:57,837 INFO L134 CoverageAnalysis]: Checked inductivity of 16281 backedges. 0 proven. 16281 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:28:57,857 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:28:57,857 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 83] total 165 [2018-10-01 00:28:57,858 INFO L459 AbstractCegarLoop]: Interpolant automaton has 166 states [2018-10-01 00:28:57,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 166 interpolants. [2018-10-01 00:28:57,860 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:28:57,860 INFO L87 Difference]: Start difference. First operand 409 states and 571 transitions. Second operand 166 states. [2018-10-01 00:29:01,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:29:01,487 INFO L93 Difference]: Finished difference Result 420 states and 586 transitions. [2018-10-01 00:29:01,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-10-01 00:29:01,487 INFO L78 Accepts]: Start accepts. Automaton has 166 states. Word has length 408 [2018-10-01 00:29:01,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:29:01,489 INFO L225 Difference]: With dead ends: 420 [2018-10-01 00:29:01,489 INFO L226 Difference]: Without dead ends: 418 [2018-10-01 00:29:01,489 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 490 GetRequests, 326 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s Time [2018-10-01 00:29:01,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2018-10-01 00:29:01,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 414. [2018-10-01 00:29:01,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 414 states. [2018-10-01 00:29:01,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 578 transitions. [2018-10-01 00:29:01,496 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 578 transitions. Word has length 408 [2018-10-01 00:29:01,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:29:01,497 INFO L480 AbstractCegarLoop]: Abstraction has 414 states and 578 transitions. [2018-10-01 00:29:01,497 INFO L481 AbstractCegarLoop]: Interpolant automaton has 166 states. [2018-10-01 00:29:01,497 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 578 transitions. [2018-10-01 00:29:01,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 414 [2018-10-01 00:29:01,498 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:29:01,499 INFO L375 BasicCegarLoop]: trace histogram [82, 82, 82, 82, 82, 1, 1, 1] [2018-10-01 00:29:01,499 INFO L423 AbstractCegarLoop]: === Iteration 84 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:29:01,499 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:29:01,499 INFO L82 PathProgramCache]: Analyzing trace with hash 1421094592, now seen corresponding path program 82 times [2018-10-01 00:29:01,499 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:29:01,499 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:29:01,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:29:01,500 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:29:01,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:29:01,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:29:02,271 INFO L134 CoverageAnalysis]: Checked inductivity of 16687 backedges. 0 proven. 16687 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:29:02,271 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:29:02,271 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:29:02,280 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:29:02,384 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:29:02,384 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:29:02,391 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:29:05,290 INFO L134 CoverageAnalysis]: Checked inductivity of 16687 backedges. 0 proven. 16687 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:29:05,312 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:29:05,312 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84, 84] total 167 [2018-10-01 00:29:05,312 INFO L459 AbstractCegarLoop]: Interpolant automaton has 168 states [2018-10-01 00:29:05,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 168 interpolants. [2018-10-01 00:29:05,314 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:29:05,315 INFO L87 Difference]: Start difference. First operand 414 states and 578 transitions. Second operand 168 states. [2018-10-01 00:29:08,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:29:08,824 INFO L93 Difference]: Finished difference Result 425 states and 593 transitions. [2018-10-01 00:29:08,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-10-01 00:29:08,825 INFO L78 Accepts]: Start accepts. Automaton has 168 states. Word has length 413 [2018-10-01 00:29:08,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:29:08,826 INFO L225 Difference]: With dead ends: 425 [2018-10-01 00:29:08,827 INFO L226 Difference]: Without dead ends: 423 [2018-10-01 00:29:08,827 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 496 GetRequests, 330 SyntacticMatches, 0 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s Time [2018-10-01 00:29:08,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2018-10-01 00:29:08,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 419. [2018-10-01 00:29:08,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 419 states. [2018-10-01 00:29:08,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 585 transitions. [2018-10-01 00:29:08,834 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 585 transitions. Word has length 413 [2018-10-01 00:29:08,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:29:08,835 INFO L480 AbstractCegarLoop]: Abstraction has 419 states and 585 transitions. [2018-10-01 00:29:08,835 INFO L481 AbstractCegarLoop]: Interpolant automaton has 168 states. [2018-10-01 00:29:08,835 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 585 transitions. [2018-10-01 00:29:08,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 419 [2018-10-01 00:29:08,836 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:29:08,836 INFO L375 BasicCegarLoop]: trace histogram [83, 83, 83, 83, 83, 1, 1, 1] [2018-10-01 00:29:08,836 INFO L423 AbstractCegarLoop]: === Iteration 85 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:29:08,837 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:29:08,837 INFO L82 PathProgramCache]: Analyzing trace with hash 1843872113, now seen corresponding path program 83 times [2018-10-01 00:29:08,837 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:29:08,837 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:29:08,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:29:08,838 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:29:08,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:29:08,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:29:09,674 INFO L134 CoverageAnalysis]: Checked inductivity of 17098 backedges. 0 proven. 17098 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:29:09,674 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:29:09,675 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:29:09,684 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:29:10,033 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 84 check-sat command(s) [2018-10-01 00:29:10,033 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:29:10,042 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:29:12,901 INFO L134 CoverageAnalysis]: Checked inductivity of 17098 backedges. 0 proven. 17098 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:29:12,924 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:29:12,924 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 85] total 169 [2018-10-01 00:29:12,925 INFO L459 AbstractCegarLoop]: Interpolant automaton has 170 states [2018-10-01 00:29:12,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 170 interpolants. [2018-10-01 00:29:12,927 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:29:12,928 INFO L87 Difference]: Start difference. First operand 419 states and 585 transitions. Second operand 170 states. [2018-10-01 00:29:16,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:29:16,475 INFO L93 Difference]: Finished difference Result 430 states and 600 transitions. [2018-10-01 00:29:16,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-10-01 00:29:16,476 INFO L78 Accepts]: Start accepts. Automaton has 170 states. Word has length 418 [2018-10-01 00:29:16,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:29:16,477 INFO L225 Difference]: With dead ends: 430 [2018-10-01 00:29:16,477 INFO L226 Difference]: Without dead ends: 428 [2018-10-01 00:29:16,478 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 502 GetRequests, 334 SyntacticMatches, 0 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s Time [2018-10-01 00:29:16,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2018-10-01 00:29:16,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 424. [2018-10-01 00:29:16,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 424 states. [2018-10-01 00:29:16,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 592 transitions. [2018-10-01 00:29:16,486 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 592 transitions. Word has length 418 [2018-10-01 00:29:16,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:29:16,487 INFO L480 AbstractCegarLoop]: Abstraction has 424 states and 592 transitions. [2018-10-01 00:29:16,487 INFO L481 AbstractCegarLoop]: Interpolant automaton has 170 states. [2018-10-01 00:29:16,487 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 592 transitions. [2018-10-01 00:29:16,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 424 [2018-10-01 00:29:16,489 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:29:16,490 INFO L375 BasicCegarLoop]: trace histogram [84, 84, 84, 84, 84, 1, 1, 1] [2018-10-01 00:29:16,490 INFO L423 AbstractCegarLoop]: === Iteration 86 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:29:16,490 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:29:16,490 INFO L82 PathProgramCache]: Analyzing trace with hash 31012192, now seen corresponding path program 84 times [2018-10-01 00:29:16,491 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:29:16,491 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:29:16,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:29:16,491 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:29:16,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:29:16,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:29:17,286 INFO L134 CoverageAnalysis]: Checked inductivity of 17514 backedges. 0 proven. 17514 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:29:17,286 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:29:17,286 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:29:17,296 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:29:17,562 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 85 check-sat command(s) [2018-10-01 00:29:17,562 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:29:17,570 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:29:20,525 INFO L134 CoverageAnalysis]: Checked inductivity of 17514 backedges. 0 proven. 17514 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:29:20,546 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:29:20,546 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86, 86] total 171 [2018-10-01 00:29:20,547 INFO L459 AbstractCegarLoop]: Interpolant automaton has 172 states [2018-10-01 00:29:20,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 172 interpolants. [2018-10-01 00:29:20,549 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:29:20,550 INFO L87 Difference]: Start difference. First operand 424 states and 592 transitions. Second operand 172 states. [2018-10-01 00:29:24,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:29:24,703 INFO L93 Difference]: Finished difference Result 435 states and 607 transitions. [2018-10-01 00:29:24,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-10-01 00:29:24,704 INFO L78 Accepts]: Start accepts. Automaton has 172 states. Word has length 423 [2018-10-01 00:29:24,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:29:24,705 INFO L225 Difference]: With dead ends: 435 [2018-10-01 00:29:24,705 INFO L226 Difference]: Without dead ends: 433 [2018-10-01 00:29:24,706 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 508 GetRequests, 338 SyntacticMatches, 0 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s Time [2018-10-01 00:29:24,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2018-10-01 00:29:24,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 429. [2018-10-01 00:29:24,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 429 states. [2018-10-01 00:29:24,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 599 transitions. [2018-10-01 00:29:24,714 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 599 transitions. Word has length 423 [2018-10-01 00:29:24,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:29:24,714 INFO L480 AbstractCegarLoop]: Abstraction has 429 states and 599 transitions. [2018-10-01 00:29:24,714 INFO L481 AbstractCegarLoop]: Interpolant automaton has 172 states. [2018-10-01 00:29:24,714 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 599 transitions. [2018-10-01 00:29:24,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 429 [2018-10-01 00:29:24,716 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:29:24,716 INFO L375 BasicCegarLoop]: trace histogram [85, 85, 85, 85, 85, 1, 1, 1] [2018-10-01 00:29:24,716 INFO L423 AbstractCegarLoop]: === Iteration 87 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:29:24,716 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:29:24,717 INFO L82 PathProgramCache]: Analyzing trace with hash 2113756881, now seen corresponding path program 85 times [2018-10-01 00:29:24,717 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:29:24,717 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:29:24,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:29:24,717 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:29:24,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:29:24,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:29:25,526 INFO L134 CoverageAnalysis]: Checked inductivity of 17935 backedges. 0 proven. 17935 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:29:25,526 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:29:25,526 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:29:25,534 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:29:25,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:29:25,644 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:29:28,642 INFO L134 CoverageAnalysis]: Checked inductivity of 17935 backedges. 0 proven. 17935 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:29:28,662 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:29:28,663 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87, 87] total 173 [2018-10-01 00:29:28,663 INFO L459 AbstractCegarLoop]: Interpolant automaton has 174 states [2018-10-01 00:29:28,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 174 interpolants. [2018-10-01 00:29:28,666 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:29:28,666 INFO L87 Difference]: Start difference. First operand 429 states and 599 transitions. Second operand 174 states. [2018-10-01 00:29:32,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:29:32,323 INFO L93 Difference]: Finished difference Result 440 states and 614 transitions. [2018-10-01 00:29:32,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-10-01 00:29:32,323 INFO L78 Accepts]: Start accepts. Automaton has 174 states. Word has length 428 [2018-10-01 00:29:32,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:29:32,325 INFO L225 Difference]: With dead ends: 440 [2018-10-01 00:29:32,325 INFO L226 Difference]: Without dead ends: 438 [2018-10-01 00:29:32,325 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 514 GetRequests, 342 SyntacticMatches, 0 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s Time [2018-10-01 00:29:32,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2018-10-01 00:29:32,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 434. [2018-10-01 00:29:32,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2018-10-01 00:29:32,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 606 transitions. [2018-10-01 00:29:32,333 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 606 transitions. Word has length 428 [2018-10-01 00:29:32,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:29:32,333 INFO L480 AbstractCegarLoop]: Abstraction has 434 states and 606 transitions. [2018-10-01 00:29:32,333 INFO L481 AbstractCegarLoop]: Interpolant automaton has 174 states. [2018-10-01 00:29:32,334 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 606 transitions. [2018-10-01 00:29:32,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 434 [2018-10-01 00:29:32,335 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:29:32,335 INFO L375 BasicCegarLoop]: trace histogram [86, 86, 86, 86, 86, 1, 1, 1] [2018-10-01 00:29:32,335 INFO L423 AbstractCegarLoop]: === Iteration 88 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:29:32,336 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:29:32,336 INFO L82 PathProgramCache]: Analyzing trace with hash -1344375808, now seen corresponding path program 86 times [2018-10-01 00:29:32,336 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:29:32,336 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:29:32,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:29:32,336 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:29:32,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:29:32,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:29:33,177 INFO L134 CoverageAnalysis]: Checked inductivity of 18361 backedges. 0 proven. 18361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:29:33,177 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:29:33,177 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:29:33,185 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:29:33,300 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:29:33,301 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:29:33,310 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:29:36,391 INFO L134 CoverageAnalysis]: Checked inductivity of 18361 backedges. 0 proven. 18361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:29:36,410 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:29:36,411 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88, 88] total 175 [2018-10-01 00:29:36,412 INFO L459 AbstractCegarLoop]: Interpolant automaton has 176 states [2018-10-01 00:29:36,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 176 interpolants. [2018-10-01 00:29:36,414 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:29:36,414 INFO L87 Difference]: Start difference. First operand 434 states and 606 transitions. Second operand 176 states. [2018-10-01 00:29:40,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:29:40,478 INFO L93 Difference]: Finished difference Result 445 states and 621 transitions. [2018-10-01 00:29:40,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-10-01 00:29:40,478 INFO L78 Accepts]: Start accepts. Automaton has 176 states. Word has length 433 [2018-10-01 00:29:40,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:29:40,480 INFO L225 Difference]: With dead ends: 445 [2018-10-01 00:29:40,480 INFO L226 Difference]: Without dead ends: 443 [2018-10-01 00:29:40,480 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 520 GetRequests, 346 SyntacticMatches, 0 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s Time [2018-10-01 00:29:40,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2018-10-01 00:29:40,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 439. [2018-10-01 00:29:40,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 439 states. [2018-10-01 00:29:40,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 613 transitions. [2018-10-01 00:29:40,488 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 613 transitions. Word has length 433 [2018-10-01 00:29:40,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:29:40,488 INFO L480 AbstractCegarLoop]: Abstraction has 439 states and 613 transitions. [2018-10-01 00:29:40,488 INFO L481 AbstractCegarLoop]: Interpolant automaton has 176 states. [2018-10-01 00:29:40,489 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 613 transitions. [2018-10-01 00:29:40,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 439 [2018-10-01 00:29:40,490 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:29:40,490 INFO L375 BasicCegarLoop]: trace histogram [87, 87, 87, 87, 87, 1, 1, 1] [2018-10-01 00:29:40,490 INFO L423 AbstractCegarLoop]: === Iteration 89 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:29:40,491 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:29:40,491 INFO L82 PathProgramCache]: Analyzing trace with hash -1466547151, now seen corresponding path program 87 times [2018-10-01 00:29:40,491 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:29:40,491 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:29:40,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:29:40,491 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:29:40,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:29:40,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:29:41,331 INFO L134 CoverageAnalysis]: Checked inductivity of 18792 backedges. 0 proven. 18792 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:29:41,331 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:29:41,332 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:29:41,340 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:29:41,585 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 88 check-sat command(s) [2018-10-01 00:29:41,585 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:29:41,594 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:29:44,587 INFO L134 CoverageAnalysis]: Checked inductivity of 18792 backedges. 0 proven. 18792 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:29:44,614 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:29:44,615 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89, 89] total 177 [2018-10-01 00:29:44,616 INFO L459 AbstractCegarLoop]: Interpolant automaton has 178 states [2018-10-01 00:29:44,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 178 interpolants. [2018-10-01 00:29:44,618 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:29:44,618 INFO L87 Difference]: Start difference. First operand 439 states and 613 transitions. Second operand 178 states. [2018-10-01 00:29:48,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:29:48,574 INFO L93 Difference]: Finished difference Result 450 states and 628 transitions. [2018-10-01 00:29:48,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-10-01 00:29:48,574 INFO L78 Accepts]: Start accepts. Automaton has 178 states. Word has length 438 [2018-10-01 00:29:48,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:29:48,576 INFO L225 Difference]: With dead ends: 450 [2018-10-01 00:29:48,576 INFO L226 Difference]: Without dead ends: 448 [2018-10-01 00:29:48,576 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 526 GetRequests, 350 SyntacticMatches, 0 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s Time [2018-10-01 00:29:48,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2018-10-01 00:29:48,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 444. [2018-10-01 00:29:48,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 444 states. [2018-10-01 00:29:48,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 620 transitions. [2018-10-01 00:29:48,583 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 620 transitions. Word has length 438 [2018-10-01 00:29:48,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:29:48,583 INFO L480 AbstractCegarLoop]: Abstraction has 444 states and 620 transitions. [2018-10-01 00:29:48,583 INFO L481 AbstractCegarLoop]: Interpolant automaton has 178 states. [2018-10-01 00:29:48,583 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 620 transitions. [2018-10-01 00:29:48,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 444 [2018-10-01 00:29:48,585 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:29:48,585 INFO L375 BasicCegarLoop]: trace histogram [88, 88, 88, 88, 88, 1, 1, 1] [2018-10-01 00:29:48,585 INFO L423 AbstractCegarLoop]: === Iteration 90 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:29:48,585 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:29:48,585 INFO L82 PathProgramCache]: Analyzing trace with hash -841094496, now seen corresponding path program 88 times [2018-10-01 00:29:48,586 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:29:48,586 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:29:48,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:29:48,586 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:29:48,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:29:48,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:29:49,421 INFO L134 CoverageAnalysis]: Checked inductivity of 19228 backedges. 0 proven. 19228 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:29:49,421 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:29:49,421 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:29:49,428 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:29:49,539 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:29:49,539 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:29:49,547 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:29:52,764 INFO L134 CoverageAnalysis]: Checked inductivity of 19228 backedges. 0 proven. 19228 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:29:52,786 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:29:52,786 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90, 90] total 179 [2018-10-01 00:29:52,787 INFO L459 AbstractCegarLoop]: Interpolant automaton has 180 states [2018-10-01 00:29:52,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 180 interpolants. [2018-10-01 00:29:52,789 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:29:52,789 INFO L87 Difference]: Start difference. First operand 444 states and 620 transitions. Second operand 180 states. [2018-10-01 00:29:57,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:29:57,304 INFO L93 Difference]: Finished difference Result 455 states and 635 transitions. [2018-10-01 00:29:57,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-10-01 00:29:57,304 INFO L78 Accepts]: Start accepts. Automaton has 180 states. Word has length 443 [2018-10-01 00:29:57,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:29:57,306 INFO L225 Difference]: With dead ends: 455 [2018-10-01 00:29:57,306 INFO L226 Difference]: Without dead ends: 453 [2018-10-01 00:29:57,306 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 532 GetRequests, 354 SyntacticMatches, 0 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s Time [2018-10-01 00:29:57,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2018-10-01 00:29:57,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 449. [2018-10-01 00:29:57,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 449 states. [2018-10-01 00:29:57,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 627 transitions. [2018-10-01 00:29:57,314 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 627 transitions. Word has length 443 [2018-10-01 00:29:57,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:29:57,314 INFO L480 AbstractCegarLoop]: Abstraction has 449 states and 627 transitions. [2018-10-01 00:29:57,314 INFO L481 AbstractCegarLoop]: Interpolant automaton has 180 states. [2018-10-01 00:29:57,314 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 627 transitions. [2018-10-01 00:29:57,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 449 [2018-10-01 00:29:57,316 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:29:57,316 INFO L375 BasicCegarLoop]: trace histogram [89, 89, 89, 89, 89, 1, 1, 1] [2018-10-01 00:29:57,316 INFO L423 AbstractCegarLoop]: === Iteration 91 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:29:57,316 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:29:57,317 INFO L82 PathProgramCache]: Analyzing trace with hash -556273263, now seen corresponding path program 89 times [2018-10-01 00:29:57,317 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:29:57,317 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:29:57,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:29:57,317 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:29:57,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:29:57,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:29:58,178 INFO L134 CoverageAnalysis]: Checked inductivity of 19669 backedges. 0 proven. 19669 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:29:58,178 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:29:58,178 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:29:58,186 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:29:58,429 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 90 check-sat command(s) [2018-10-01 00:29:58,429 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:29:58,439 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:30:01,623 INFO L134 CoverageAnalysis]: Checked inductivity of 19669 backedges. 0 proven. 19669 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:30:01,643 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:30:01,644 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91, 91] total 181 [2018-10-01 00:30:01,644 INFO L459 AbstractCegarLoop]: Interpolant automaton has 182 states [2018-10-01 00:30:01,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 182 interpolants. [2018-10-01 00:30:01,647 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:30:01,647 INFO L87 Difference]: Start difference. First operand 449 states and 627 transitions. Second operand 182 states. [2018-10-01 00:30:06,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:30:06,397 INFO L93 Difference]: Finished difference Result 460 states and 642 transitions. [2018-10-01 00:30:06,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-10-01 00:30:06,397 INFO L78 Accepts]: Start accepts. Automaton has 182 states. Word has length 448 [2018-10-01 00:30:06,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:30:06,399 INFO L225 Difference]: With dead ends: 460 [2018-10-01 00:30:06,399 INFO L226 Difference]: Without dead ends: 458 [2018-10-01 00:30:06,399 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 538 GetRequests, 358 SyntacticMatches, 0 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s Time [2018-10-01 00:30:06,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2018-10-01 00:30:06,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 454. [2018-10-01 00:30:06,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 454 states. [2018-10-01 00:30:06,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 634 transitions. [2018-10-01 00:30:06,407 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 634 transitions. Word has length 448 [2018-10-01 00:30:06,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:30:06,407 INFO L480 AbstractCegarLoop]: Abstraction has 454 states and 634 transitions. [2018-10-01 00:30:06,407 INFO L481 AbstractCegarLoop]: Interpolant automaton has 182 states. [2018-10-01 00:30:06,407 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 634 transitions. [2018-10-01 00:30:06,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 454 [2018-10-01 00:30:06,409 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:30:06,409 INFO L375 BasicCegarLoop]: trace histogram [90, 90, 90, 90, 90, 1, 1, 1] [2018-10-01 00:30:06,409 INFO L423 AbstractCegarLoop]: === Iteration 92 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:30:06,410 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:30:06,410 INFO L82 PathProgramCache]: Analyzing trace with hash 846305600, now seen corresponding path program 90 times [2018-10-01 00:30:06,410 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:30:06,410 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:30:06,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:30:06,411 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:30:06,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:30:06,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:30:07,335 INFO L134 CoverageAnalysis]: Checked inductivity of 20115 backedges. 0 proven. 20115 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:30:07,336 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:30:07,336 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:30:07,344 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:30:07,598 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 91 check-sat command(s) [2018-10-01 00:30:07,598 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:30:07,607 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:30:10,764 INFO L134 CoverageAnalysis]: Checked inductivity of 20115 backedges. 0 proven. 20115 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:30:10,785 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:30:10,785 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92, 92] total 183 [2018-10-01 00:30:10,786 INFO L459 AbstractCegarLoop]: Interpolant automaton has 184 states [2018-10-01 00:30:10,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 184 interpolants. [2018-10-01 00:30:10,788 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:30:10,788 INFO L87 Difference]: Start difference. First operand 454 states and 634 transitions. Second operand 184 states. [2018-10-01 00:30:15,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:30:15,781 INFO L93 Difference]: Finished difference Result 465 states and 649 transitions. [2018-10-01 00:30:15,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-10-01 00:30:15,781 INFO L78 Accepts]: Start accepts. Automaton has 184 states. Word has length 453 [2018-10-01 00:30:15,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:30:15,783 INFO L225 Difference]: With dead ends: 465 [2018-10-01 00:30:15,783 INFO L226 Difference]: Without dead ends: 463 [2018-10-01 00:30:15,783 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 544 GetRequests, 362 SyntacticMatches, 0 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s Time [2018-10-01 00:30:15,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2018-10-01 00:30:15,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 459. [2018-10-01 00:30:15,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 459 states. [2018-10-01 00:30:15,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 641 transitions. [2018-10-01 00:30:15,791 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 641 transitions. Word has length 453 [2018-10-01 00:30:15,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:30:15,791 INFO L480 AbstractCegarLoop]: Abstraction has 459 states and 641 transitions. [2018-10-01 00:30:15,791 INFO L481 AbstractCegarLoop]: Interpolant automaton has 184 states. [2018-10-01 00:30:15,791 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 641 transitions. [2018-10-01 00:30:15,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 459 [2018-10-01 00:30:15,793 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:30:15,793 INFO L375 BasicCegarLoop]: trace histogram [91, 91, 91, 91, 91, 1, 1, 1] [2018-10-01 00:30:15,793 INFO L423 AbstractCegarLoop]: === Iteration 93 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:30:15,794 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:30:15,794 INFO L82 PathProgramCache]: Analyzing trace with hash 1516791537, now seen corresponding path program 91 times [2018-10-01 00:30:15,794 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:30:15,794 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:30:15,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:30:15,795 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:30:15,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:30:15,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:30:16,697 INFO L134 CoverageAnalysis]: Checked inductivity of 20566 backedges. 0 proven. 20566 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:30:16,697 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:30:16,697 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:30:16,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:30:16,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:30:16,827 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:30:20,032 INFO L134 CoverageAnalysis]: Checked inductivity of 20566 backedges. 0 proven. 20566 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:30:20,052 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:30:20,052 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93, 93] total 185 [2018-10-01 00:30:20,053 INFO L459 AbstractCegarLoop]: Interpolant automaton has 186 states [2018-10-01 00:30:20,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 186 interpolants. [2018-10-01 00:30:20,055 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:30:20,056 INFO L87 Difference]: Start difference. First operand 459 states and 641 transitions. Second operand 186 states. [2018-10-01 00:30:24,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:30:24,895 INFO L93 Difference]: Finished difference Result 470 states and 656 transitions. [2018-10-01 00:30:24,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-10-01 00:30:24,895 INFO L78 Accepts]: Start accepts. Automaton has 186 states. Word has length 458 [2018-10-01 00:30:24,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:30:24,897 INFO L225 Difference]: With dead ends: 470 [2018-10-01 00:30:24,897 INFO L226 Difference]: Without dead ends: 468 [2018-10-01 00:30:24,897 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 550 GetRequests, 366 SyntacticMatches, 0 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s Time [2018-10-01 00:30:24,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2018-10-01 00:30:24,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 464. [2018-10-01 00:30:24,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 464 states. [2018-10-01 00:30:24,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 648 transitions. [2018-10-01 00:30:24,904 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 648 transitions. Word has length 458 [2018-10-01 00:30:24,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:30:24,905 INFO L480 AbstractCegarLoop]: Abstraction has 464 states and 648 transitions. [2018-10-01 00:30:24,905 INFO L481 AbstractCegarLoop]: Interpolant automaton has 186 states. [2018-10-01 00:30:24,905 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 648 transitions. [2018-10-01 00:30:24,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 464 [2018-10-01 00:30:24,906 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:30:24,907 INFO L375 BasicCegarLoop]: trace histogram [92, 92, 92, 92, 92, 1, 1, 1] [2018-10-01 00:30:24,907 INFO L423 AbstractCegarLoop]: === Iteration 94 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:30:24,907 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:30:24,907 INFO L82 PathProgramCache]: Analyzing trace with hash -1145864224, now seen corresponding path program 92 times [2018-10-01 00:30:24,907 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:30:24,907 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:30:24,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:30:24,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:30:24,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:30:24,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:30:25,835 INFO L134 CoverageAnalysis]: Checked inductivity of 21022 backedges. 0 proven. 21022 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:30:25,836 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:30:25,836 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:30:25,843 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:30:25,957 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:30:25,957 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:30:25,968 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:30:29,196 INFO L134 CoverageAnalysis]: Checked inductivity of 21022 backedges. 0 proven. 21022 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:30:29,217 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:30:29,217 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94, 94] total 187 [2018-10-01 00:30:29,218 INFO L459 AbstractCegarLoop]: Interpolant automaton has 188 states [2018-10-01 00:30:29,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 188 interpolants. [2018-10-01 00:30:29,221 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:30:29,221 INFO L87 Difference]: Start difference. First operand 464 states and 648 transitions. Second operand 188 states. [2018-10-01 00:30:33,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:30:33,828 INFO L93 Difference]: Finished difference Result 475 states and 663 transitions. [2018-10-01 00:30:33,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-10-01 00:30:33,828 INFO L78 Accepts]: Start accepts. Automaton has 188 states. Word has length 463 [2018-10-01 00:30:33,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:30:33,830 INFO L225 Difference]: With dead ends: 475 [2018-10-01 00:30:33,830 INFO L226 Difference]: Without dead ends: 473 [2018-10-01 00:30:33,830 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 556 GetRequests, 370 SyntacticMatches, 0 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s Time [2018-10-01 00:30:33,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2018-10-01 00:30:33,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 469. [2018-10-01 00:30:33,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 469 states. [2018-10-01 00:30:33,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 655 transitions. [2018-10-01 00:30:33,839 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 655 transitions. Word has length 463 [2018-10-01 00:30:33,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:30:33,839 INFO L480 AbstractCegarLoop]: Abstraction has 469 states and 655 transitions. [2018-10-01 00:30:33,839 INFO L481 AbstractCegarLoop]: Interpolant automaton has 188 states. [2018-10-01 00:30:33,839 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 655 transitions. [2018-10-01 00:30:33,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 469 [2018-10-01 00:30:33,841 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:30:33,841 INFO L375 BasicCegarLoop]: trace histogram [93, 93, 93, 93, 93, 1, 1, 1] [2018-10-01 00:30:33,842 INFO L423 AbstractCegarLoop]: === Iteration 95 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:30:33,842 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:30:33,842 INFO L82 PathProgramCache]: Analyzing trace with hash -43146159, now seen corresponding path program 93 times [2018-10-01 00:30:33,842 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:30:33,842 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:30:33,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:30:33,843 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:30:33,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:30:33,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:30:34,771 INFO L134 CoverageAnalysis]: Checked inductivity of 21483 backedges. 0 proven. 21483 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:30:34,771 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:30:34,771 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:30:34,778 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:30:35,049 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 94 check-sat command(s) [2018-10-01 00:30:35,049 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:30:35,058 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:30:38,538 INFO L134 CoverageAnalysis]: Checked inductivity of 21483 backedges. 0 proven. 21483 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:30:38,560 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:30:38,561 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95, 95] total 189 [2018-10-01 00:30:38,561 INFO L459 AbstractCegarLoop]: Interpolant automaton has 190 states [2018-10-01 00:30:38,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 190 interpolants. [2018-10-01 00:30:38,564 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:30:38,564 INFO L87 Difference]: Start difference. First operand 469 states and 655 transitions. Second operand 190 states. [2018-10-01 00:30:43,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:30:43,236 INFO L93 Difference]: Finished difference Result 480 states and 670 transitions. [2018-10-01 00:30:43,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-10-01 00:30:43,236 INFO L78 Accepts]: Start accepts. Automaton has 190 states. Word has length 468 [2018-10-01 00:30:43,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:30:43,238 INFO L225 Difference]: With dead ends: 480 [2018-10-01 00:30:43,238 INFO L226 Difference]: Without dead ends: 478 [2018-10-01 00:30:43,238 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 562 GetRequests, 374 SyntacticMatches, 0 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s Time [2018-10-01 00:30:43,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2018-10-01 00:30:43,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 474. [2018-10-01 00:30:43,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 474 states. [2018-10-01 00:30:43,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 662 transitions. [2018-10-01 00:30:43,247 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 662 transitions. Word has length 468 [2018-10-01 00:30:43,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:30:43,247 INFO L480 AbstractCegarLoop]: Abstraction has 474 states and 662 transitions. [2018-10-01 00:30:43,247 INFO L481 AbstractCegarLoop]: Interpolant automaton has 190 states. [2018-10-01 00:30:43,247 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 662 transitions. [2018-10-01 00:30:43,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 474 [2018-10-01 00:30:43,249 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:30:43,249 INFO L375 BasicCegarLoop]: trace histogram [94, 94, 94, 94, 94, 1, 1, 1] [2018-10-01 00:30:43,249 INFO L423 AbstractCegarLoop]: === Iteration 96 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:30:43,249 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:30:43,250 INFO L82 PathProgramCache]: Analyzing trace with hash -281174400, now seen corresponding path program 94 times [2018-10-01 00:30:43,250 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:30:43,250 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:30:43,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:30:43,250 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:30:43,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:30:43,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:30:44,202 INFO L134 CoverageAnalysis]: Checked inductivity of 21949 backedges. 0 proven. 21949 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:30:44,202 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:30:44,202 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:30:44,209 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:30:44,325 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:30:44,326 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:30:44,334 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:30:47,888 INFO L134 CoverageAnalysis]: Checked inductivity of 21949 backedges. 0 proven. 21949 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:30:47,909 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:30:47,910 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96, 96] total 191 [2018-10-01 00:30:47,910 INFO L459 AbstractCegarLoop]: Interpolant automaton has 192 states [2018-10-01 00:30:47,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 192 interpolants. [2018-10-01 00:30:47,913 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:30:47,913 INFO L87 Difference]: Start difference. First operand 474 states and 662 transitions. Second operand 192 states. [2018-10-01 00:30:52,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:30:52,826 INFO L93 Difference]: Finished difference Result 485 states and 677 transitions. [2018-10-01 00:30:52,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-10-01 00:30:52,826 INFO L78 Accepts]: Start accepts. Automaton has 192 states. Word has length 473 [2018-10-01 00:30:52,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:30:52,828 INFO L225 Difference]: With dead ends: 485 [2018-10-01 00:30:52,828 INFO L226 Difference]: Without dead ends: 483 [2018-10-01 00:30:52,828 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 568 GetRequests, 378 SyntacticMatches, 0 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s Time [2018-10-01 00:30:52,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2018-10-01 00:30:52,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 479. [2018-10-01 00:30:52,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 479 states. [2018-10-01 00:30:52,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 669 transitions. [2018-10-01 00:30:52,837 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 669 transitions. Word has length 473 [2018-10-01 00:30:52,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:30:52,837 INFO L480 AbstractCegarLoop]: Abstraction has 479 states and 669 transitions. [2018-10-01 00:30:52,837 INFO L481 AbstractCegarLoop]: Interpolant automaton has 192 states. [2018-10-01 00:30:52,837 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 669 transitions. [2018-10-01 00:30:52,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 479 [2018-10-01 00:30:52,839 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:30:52,839 INFO L375 BasicCegarLoop]: trace histogram [95, 95, 95, 95, 95, 1, 1, 1] [2018-10-01 00:30:52,839 INFO L423 AbstractCegarLoop]: === Iteration 97 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:30:52,839 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:30:52,840 INFO L82 PathProgramCache]: Analyzing trace with hash -1299338831, now seen corresponding path program 95 times [2018-10-01 00:30:52,840 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:30:52,840 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:30:52,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:30:52,840 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:30:52,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:30:52,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:30:53,806 INFO L134 CoverageAnalysis]: Checked inductivity of 22420 backedges. 0 proven. 22420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:30:53,806 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:30:53,806 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:30:53,821 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:30:54,091 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 96 check-sat command(s) [2018-10-01 00:30:54,092 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:30:54,103 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:30:57,594 INFO L134 CoverageAnalysis]: Checked inductivity of 22420 backedges. 0 proven. 22420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:30:57,615 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:30:57,615 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97] total 193 [2018-10-01 00:30:57,616 INFO L459 AbstractCegarLoop]: Interpolant automaton has 194 states [2018-10-01 00:30:57,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 194 interpolants. [2018-10-01 00:30:57,618 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:30:57,618 INFO L87 Difference]: Start difference. First operand 479 states and 669 transitions. Second operand 194 states. [2018-10-01 00:31:02,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:31:02,428 INFO L93 Difference]: Finished difference Result 490 states and 684 transitions. [2018-10-01 00:31:02,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2018-10-01 00:31:02,428 INFO L78 Accepts]: Start accepts. Automaton has 194 states. Word has length 478 [2018-10-01 00:31:02,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:31:02,430 INFO L225 Difference]: With dead ends: 490 [2018-10-01 00:31:02,430 INFO L226 Difference]: Without dead ends: 488 [2018-10-01 00:31:02,430 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 574 GetRequests, 382 SyntacticMatches, 0 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s Time [2018-10-01 00:31:02,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2018-10-01 00:31:02,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 484. [2018-10-01 00:31:02,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 484 states. [2018-10-01 00:31:02,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 676 transitions. [2018-10-01 00:31:02,439 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 676 transitions. Word has length 478 [2018-10-01 00:31:02,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:31:02,439 INFO L480 AbstractCegarLoop]: Abstraction has 484 states and 676 transitions. [2018-10-01 00:31:02,439 INFO L481 AbstractCegarLoop]: Interpolant automaton has 194 states. [2018-10-01 00:31:02,439 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 676 transitions. [2018-10-01 00:31:02,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 484 [2018-10-01 00:31:02,441 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:31:02,441 INFO L375 BasicCegarLoop]: trace histogram [96, 96, 96, 96, 96, 1, 1, 1] [2018-10-01 00:31:02,442 INFO L423 AbstractCegarLoop]: === Iteration 98 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:31:02,442 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:31:02,442 INFO L82 PathProgramCache]: Analyzing trace with hash -1708526304, now seen corresponding path program 96 times [2018-10-01 00:31:02,442 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:31:02,442 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:31:02,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:31:02,443 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:31:02,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:31:02,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:31:03,437 INFO L134 CoverageAnalysis]: Checked inductivity of 22896 backedges. 0 proven. 22896 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:31:03,437 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:31:03,437 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:31:03,444 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:31:03,715 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 97 check-sat command(s) [2018-10-01 00:31:03,715 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:31:03,724 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:31:07,223 INFO L134 CoverageAnalysis]: Checked inductivity of 22896 backedges. 0 proven. 22896 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:31:07,245 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:31:07,245 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98, 98] total 195 [2018-10-01 00:31:07,246 INFO L459 AbstractCegarLoop]: Interpolant automaton has 196 states [2018-10-01 00:31:07,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 196 interpolants. [2018-10-01 00:31:07,248 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:31:07,249 INFO L87 Difference]: Start difference. First operand 484 states and 676 transitions. Second operand 196 states. [2018-10-01 00:31:12,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:31:12,412 INFO L93 Difference]: Finished difference Result 495 states and 691 transitions. [2018-10-01 00:31:12,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-10-01 00:31:12,412 INFO L78 Accepts]: Start accepts. Automaton has 196 states. Word has length 483 [2018-10-01 00:31:12,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:31:12,414 INFO L225 Difference]: With dead ends: 495 [2018-10-01 00:31:12,414 INFO L226 Difference]: Without dead ends: 493 [2018-10-01 00:31:12,414 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 580 GetRequests, 386 SyntacticMatches, 0 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s Time [2018-10-01 00:31:12,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2018-10-01 00:31:12,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 489. [2018-10-01 00:31:12,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 489 states. [2018-10-01 00:31:12,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 683 transitions. [2018-10-01 00:31:12,423 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 683 transitions. Word has length 483 [2018-10-01 00:31:12,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:31:12,423 INFO L480 AbstractCegarLoop]: Abstraction has 489 states and 683 transitions. [2018-10-01 00:31:12,423 INFO L481 AbstractCegarLoop]: Interpolant automaton has 196 states. [2018-10-01 00:31:12,423 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 683 transitions. [2018-10-01 00:31:12,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 489 [2018-10-01 00:31:12,425 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:31:12,425 INFO L375 BasicCegarLoop]: trace histogram [97, 97, 97, 97, 97, 1, 1, 1] [2018-10-01 00:31:12,425 INFO L423 AbstractCegarLoop]: === Iteration 99 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:31:12,425 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:31:12,426 INFO L82 PathProgramCache]: Analyzing trace with hash -856787183, now seen corresponding path program 97 times [2018-10-01 00:31:12,426 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:31:12,426 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:31:12,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:31:12,426 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:31:12,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:31:12,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:31:13,452 INFO L134 CoverageAnalysis]: Checked inductivity of 23377 backedges. 0 proven. 23377 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:31:13,452 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:31:13,452 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:31:13,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:31:13,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:31:13,587 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:31:17,137 INFO L134 CoverageAnalysis]: Checked inductivity of 23377 backedges. 0 proven. 23377 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:31:17,158 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:31:17,158 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99, 99] total 197 [2018-10-01 00:31:17,159 INFO L459 AbstractCegarLoop]: Interpolant automaton has 198 states [2018-10-01 00:31:17,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 198 interpolants. [2018-10-01 00:31:17,161 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:31:17,162 INFO L87 Difference]: Start difference. First operand 489 states and 683 transitions. Second operand 198 states. [2018-10-01 00:31:21,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:31:21,775 INFO L93 Difference]: Finished difference Result 500 states and 698 transitions. [2018-10-01 00:31:21,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2018-10-01 00:31:21,775 INFO L78 Accepts]: Start accepts. Automaton has 198 states. Word has length 488 [2018-10-01 00:31:21,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:31:21,777 INFO L225 Difference]: With dead ends: 500 [2018-10-01 00:31:21,777 INFO L226 Difference]: Without dead ends: 498 [2018-10-01 00:31:21,777 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 586 GetRequests, 390 SyntacticMatches, 0 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s Time [2018-10-01 00:31:21,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2018-10-01 00:31:21,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 494. [2018-10-01 00:31:21,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 494 states. [2018-10-01 00:31:21,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 690 transitions. [2018-10-01 00:31:21,786 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 690 transitions. Word has length 488 [2018-10-01 00:31:21,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:31:21,786 INFO L480 AbstractCegarLoop]: Abstraction has 494 states and 690 transitions. [2018-10-01 00:31:21,786 INFO L481 AbstractCegarLoop]: Interpolant automaton has 198 states. [2018-10-01 00:31:21,786 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 690 transitions. [2018-10-01 00:31:21,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 494 [2018-10-01 00:31:21,788 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:31:21,788 INFO L375 BasicCegarLoop]: trace histogram [98, 98, 98, 98, 98, 1, 1, 1] [2018-10-01 00:31:21,788 INFO L423 AbstractCegarLoop]: === Iteration 100 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:31:21,788 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:31:21,788 INFO L82 PathProgramCache]: Analyzing trace with hash 1897038784, now seen corresponding path program 98 times [2018-10-01 00:31:21,789 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:31:21,789 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:31:21,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:31:21,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:31:21,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:31:21,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:31:22,966 INFO L134 CoverageAnalysis]: Checked inductivity of 23863 backedges. 0 proven. 23863 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:31:22,966 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:31:22,966 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:31:22,974 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:31:23,091 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:31:23,091 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:31:23,104 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:31:26,623 INFO L134 CoverageAnalysis]: Checked inductivity of 23863 backedges. 0 proven. 23863 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:31:26,643 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:31:26,643 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100, 100] total 199 [2018-10-01 00:31:26,644 INFO L459 AbstractCegarLoop]: Interpolant automaton has 200 states [2018-10-01 00:31:26,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 200 interpolants. [2018-10-01 00:31:26,647 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:31:26,647 INFO L87 Difference]: Start difference. First operand 494 states and 690 transitions. Second operand 200 states. [2018-10-01 00:31:32,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:31:32,417 INFO L93 Difference]: Finished difference Result 505 states and 705 transitions. [2018-10-01 00:31:32,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2018-10-01 00:31:32,417 INFO L78 Accepts]: Start accepts. Automaton has 200 states. Word has length 493 [2018-10-01 00:31:32,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:31:32,419 INFO L225 Difference]: With dead ends: 505 [2018-10-01 00:31:32,420 INFO L226 Difference]: Without dead ends: 503 [2018-10-01 00:31:32,420 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 592 GetRequests, 394 SyntacticMatches, 0 SemanticMatches, 198 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s Time [2018-10-01 00:31:32,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2018-10-01 00:31:32,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 499. [2018-10-01 00:31:32,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 499 states. [2018-10-01 00:31:32,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 697 transitions. [2018-10-01 00:31:32,430 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 697 transitions. Word has length 493 [2018-10-01 00:31:32,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:31:32,430 INFO L480 AbstractCegarLoop]: Abstraction has 499 states and 697 transitions. [2018-10-01 00:31:32,430 INFO L481 AbstractCegarLoop]: Interpolant automaton has 200 states. [2018-10-01 00:31:32,430 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 697 transitions. [2018-10-01 00:31:32,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 499 [2018-10-01 00:31:32,432 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:31:32,433 INFO L375 BasicCegarLoop]: trace histogram [99, 99, 99, 99, 99, 1, 1, 1] [2018-10-01 00:31:32,433 INFO L423 AbstractCegarLoop]: === Iteration 101 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:31:32,433 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:31:32,433 INFO L82 PathProgramCache]: Analyzing trace with hash 1748372593, now seen corresponding path program 99 times [2018-10-01 00:31:32,434 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:31:32,434 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:31:32,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:31:32,434 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:31:32,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:31:32,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:31:33,492 INFO L134 CoverageAnalysis]: Checked inductivity of 24354 backedges. 0 proven. 24354 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:31:33,493 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:31:33,493 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:31:33,501 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:31:33,796 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 100 check-sat command(s) [2018-10-01 00:31:33,796 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:31:33,805 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:31:37,494 INFO L134 CoverageAnalysis]: Checked inductivity of 24354 backedges. 0 proven. 24354 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:31:37,514 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:31:37,515 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101, 101] total 201 [2018-10-01 00:31:37,516 INFO L459 AbstractCegarLoop]: Interpolant automaton has 202 states [2018-10-01 00:31:37,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 202 interpolants. [2018-10-01 00:31:37,519 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:31:37,519 INFO L87 Difference]: Start difference. First operand 499 states and 697 transitions. Second operand 202 states. [2018-10-01 00:31:42,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:31:42,670 INFO L93 Difference]: Finished difference Result 510 states and 712 transitions. [2018-10-01 00:31:42,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-10-01 00:31:42,670 INFO L78 Accepts]: Start accepts. Automaton has 202 states. Word has length 498 [2018-10-01 00:31:42,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:31:42,673 INFO L225 Difference]: With dead ends: 510 [2018-10-01 00:31:42,673 INFO L226 Difference]: Without dead ends: 508 [2018-10-01 00:31:42,673 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 598 GetRequests, 398 SyntacticMatches, 0 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s Time [2018-10-01 00:31:42,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2018-10-01 00:31:42,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 504. [2018-10-01 00:31:42,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 504 states. [2018-10-01 00:31:42,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 704 transitions. [2018-10-01 00:31:42,685 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 704 transitions. Word has length 498 [2018-10-01 00:31:42,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:31:42,686 INFO L480 AbstractCegarLoop]: Abstraction has 504 states and 704 transitions. [2018-10-01 00:31:42,686 INFO L481 AbstractCegarLoop]: Interpolant automaton has 202 states. [2018-10-01 00:31:42,686 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 704 transitions. [2018-10-01 00:31:42,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 504 [2018-10-01 00:31:42,688 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:31:42,688 INFO L375 BasicCegarLoop]: trace histogram [100, 100, 100, 100, 100, 1, 1, 1] [2018-10-01 00:31:42,689 INFO L423 AbstractCegarLoop]: === Iteration 102 === [GateControllerErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:31:42,689 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:31:42,689 INFO L82 PathProgramCache]: Analyzing trace with hash -1341044128, now seen corresponding path program 100 times [2018-10-01 00:31:42,689 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:31:42,689 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:31:42,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:31:42,690 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:31:42,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:31:42,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:31:50,729 INFO L134 CoverageAnalysis]: Checked inductivity of 24850 backedges. 0 proven. 24850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:31:50,729 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:31:50,729 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:31:50,736 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:31:50,875 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:31:50,876 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:31:50,886 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:32:02,398 INFO L134 CoverageAnalysis]: Checked inductivity of 24850 backedges. 0 proven. 24850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:32:02,420 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:32:02,420 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101, 102] total 203 [2018-10-01 00:32:02,421 INFO L459 AbstractCegarLoop]: Interpolant automaton has 204 states [2018-10-01 00:32:02,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 204 interpolants. [2018-10-01 00:32:02,422 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:32:02,422 INFO L87 Difference]: Start difference. First operand 504 states and 704 transitions. Second operand 204 states. [2018-10-01 00:35:17,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:35:17,345 INFO L93 Difference]: Finished difference Result 1011 states and 1415 transitions. [2018-10-01 00:35:17,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 204 states. [2018-10-01 00:35:17,345 INFO L78 Accepts]: Start accepts. Automaton has 204 states. Word has length 503 [2018-10-01 00:35:17,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:35:17,346 INFO L225 Difference]: With dead ends: 1011 [2018-10-01 00:35:17,346 INFO L226 Difference]: Without dead ends: 0 [2018-10-01 00:35:17,349 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 804 GetRequests, 401 SyntacticMatches, 0 SemanticMatches, 403 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 58.3s Time [2018-10-01 00:35:17,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-01 00:35:17,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-01 00:35:17,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-01 00:35:17,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-01 00:35:17,350 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 503 [2018-10-01 00:35:17,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:35:17,350 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-01 00:35:17,351 INFO L481 AbstractCegarLoop]: Interpolant automaton has 204 states. [2018-10-01 00:35:17,351 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-01 00:35:17,351 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-01 00:35:17,356 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-01 00:35:17,530 WARN L178 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 715 [2018-10-01 00:35:24,591 WARN L178 SmtUtils]: Spent 7.05 s on a formula simplification. DAG size of input: 715 DAG size of output: 705 [2018-10-01 00:35:24,600 INFO L426 ceAbstractionStarter]: For program point L30(lines 30 32) no Hoare annotation was computed. [2018-10-01 00:35:24,600 INFO L426 ceAbstractionStarter]: For program point L30-2(lines 27 33) no Hoare annotation was computed. [2018-10-01 00:35:24,600 INFO L426 ceAbstractionStarter]: For program point L26(line 26) no Hoare annotation was computed. [2018-10-01 00:35:24,600 INFO L426 ceAbstractionStarter]: For program point L26-1(lines 26 33) no Hoare annotation was computed. [2018-10-01 00:35:24,602 INFO L422 ceAbstractionStarter]: At program point L25-1(lines 25 37) the Hoare annotation is: (let ((.cse1 (exists ((GateController_one Int)) (and (<= (* 1000 GateController_one) GateController_thousand) (<= 1 GateController_one))))) (or (let ((.cse0 (+ GateController_gate 47))) (and (<= GateController_time 477) (<= .cse0 GateController_hundred) .cse1 (<= GateController_hundred .cse0))) (let ((.cse2 (+ GateController_gate 54))) (and (<= GateController_time 414) (<= .cse2 GateController_hundred) .cse1 (<= GateController_hundred .cse2))) (let ((.cse3 (+ GateController_gate 2))) (and (<= GateController_hundred .cse3) (<= GateController_time 882) (<= .cse3 GateController_hundred) .cse1)) (let ((.cse4 (+ GateController_gate 73))) (and (<= GateController_time 243) (<= .cse4 GateController_hundred) .cse1 (<= GateController_hundred .cse4))) (let ((.cse5 (+ GateController_gate 70))) (and (<= .cse5 GateController_hundred) (<= GateController_time 270) (<= GateController_hundred .cse5) .cse1)) (let ((.cse6 (+ GateController_gate 94))) (and (<= GateController_time 54) (<= .cse6 GateController_hundred) .cse1 (<= GateController_hundred .cse6))) (let ((.cse7 (+ GateController_gate 89))) (and (<= GateController_hundred .cse7) (<= .cse7 GateController_hundred) (<= GateController_time 99) .cse1)) (let ((.cse8 (+ GateController_gate 84))) (and (<= GateController_time 144) (<= GateController_hundred .cse8) (<= .cse8 GateController_hundred) .cse1)) (let ((.cse9 (+ GateController_gate 42))) (and (<= GateController_hundred .cse9) (<= .cse9 GateController_hundred) (<= GateController_time 522) .cse1)) (let ((.cse10 (+ GateController_gate 60))) (and (<= .cse10 GateController_hundred) (<= GateController_time 360) (<= GateController_hundred .cse10) .cse1)) (let ((.cse11 (+ GateController_gate 82))) (and (<= GateController_hundred .cse11) (<= GateController_time 162) .cse1 (<= .cse11 GateController_hundred))) (let ((.cse12 (+ GateController_gate 40))) (and (<= GateController_hundred .cse12) (<= GateController_time 540) (<= .cse12 GateController_hundred) .cse1)) (and (<= GateController_hundred GateController_gate) (<= GateController_gate GateController_hundred)) (let ((.cse13 (+ GateController_gate 91))) (and (<= .cse13 GateController_hundred) (<= GateController_hundred .cse13) (<= GateController_time 81) .cse1)) (let ((.cse14 (+ GateController_gate 45))) (and (<= .cse14 GateController_hundred) (<= GateController_time 495) (<= GateController_hundred .cse14) .cse1)) (let ((.cse15 (+ GateController_gate 4))) (and (<= GateController_hundred .cse15) (<= .cse15 GateController_hundred) (<= GateController_time 864) .cse1)) (let ((.cse16 (+ GateController_gate 61))) (and (<= GateController_time 351) (<= .cse16 GateController_hundred) (<= GateController_hundred .cse16) .cse1)) (let ((.cse17 (+ GateController_gate 71))) (and (<= GateController_hundred .cse17) (<= .cse17 GateController_hundred) .cse1 (<= GateController_time 261))) (let ((.cse18 (+ GateController_gate 48))) (and (<= .cse18 GateController_hundred) (<= GateController_hundred .cse18) (<= GateController_time 468) .cse1)) (let ((.cse19 (+ GateController_gate 26))) (and (<= GateController_time 666) (<= .cse19 GateController_hundred) .cse1 (<= GateController_hundred .cse19))) (let ((.cse20 (+ GateController_gate 96))) (and (<= GateController_time 36) (<= .cse20 GateController_hundred) .cse1 (<= GateController_hundred .cse20))) (let ((.cse21 (+ GateController_gate 92))) (and (<= .cse21 GateController_hundred) .cse1 (<= GateController_hundred .cse21) (<= GateController_time 72))) (let ((.cse22 (+ GateController_gate 80))) (and (<= GateController_hundred .cse22) (<= GateController_time 180) .cse1 (<= .cse22 GateController_hundred))) (let ((.cse23 (+ GateController_gate 1))) (and (<= .cse23 GateController_hundred) (<= GateController_time 891) (<= GateController_hundred .cse23) .cse1)) (let ((.cse24 (+ GateController_gate 43))) (and (<= .cse24 GateController_hundred) (<= GateController_time 513) (<= GateController_hundred .cse24) .cse1)) (let ((.cse25 (+ GateController_gate 97))) (and (<= GateController_hundred .cse25) (<= .cse25 GateController_hundred) .cse1 (<= GateController_time 27))) (let ((.cse26 (+ GateController_gate 27))) (and (<= GateController_hundred .cse26) (<= .cse26 GateController_hundred) .cse1 (<= GateController_time 657))) (let ((.cse27 (+ GateController_gate 50))) (and (<= GateController_hundred .cse27) (<= .cse27 GateController_hundred) (<= GateController_time 450) .cse1)) (let ((.cse28 (+ GateController_gate 86))) (and (<= GateController_time 126) (<= .cse28 GateController_hundred) (<= GateController_hundred .cse28) .cse1)) (let ((.cse29 (+ GateController_gate 78))) (and (<= GateController_hundred .cse29) (<= .cse29 GateController_hundred) .cse1 (<= GateController_time 198))) (let ((.cse30 (+ GateController_gate 18))) (and (<= GateController_hundred .cse30) (<= GateController_time 738) (<= .cse30 GateController_hundred) .cse1)) (let ((.cse31 (+ GateController_gate 38))) (and (<= GateController_time 558) (<= GateController_hundred .cse31) (<= .cse31 GateController_hundred) .cse1)) (let ((.cse32 (+ GateController_gate 13))) (and (<= GateController_time 783) (<= GateController_hundred .cse32) .cse1 (<= .cse32 GateController_hundred))) (let ((.cse33 (+ GateController_gate 67))) (and (<= GateController_time 297) .cse1 (<= .cse33 GateController_hundred) (<= GateController_hundred .cse33))) (let ((.cse34 (+ GateController_gate 44))) (and (<= GateController_hundred .cse34) (<= .cse34 GateController_hundred) (<= GateController_time 504) .cse1)) (let ((.cse35 (+ GateController_gate 83))) (and (<= GateController_time 153) (<= .cse35 GateController_hundred) (<= GateController_hundred .cse35) .cse1)) GateController_alarmTrain (let ((.cse36 (+ GateController_gate 63))) (and (<= GateController_time 333) (<= GateController_hundred .cse36) .cse1 (<= .cse36 GateController_hundred))) (let ((.cse37 (+ GateController_gate 41))) (and (<= GateController_time 531) (<= GateController_hundred .cse37) (<= .cse37 GateController_hundred) .cse1)) (let ((.cse38 (+ GateController_gate 62))) (and (<= GateController_hundred .cse38) (<= .cse38 GateController_hundred) (<= GateController_time 342) .cse1)) (let ((.cse39 (+ GateController_gate 21))) (and (<= GateController_hundred .cse39) (<= .cse39 GateController_hundred) .cse1 (<= GateController_time 711))) (let ((.cse40 (+ GateController_gate 37))) (and (<= .cse40 GateController_hundred) (<= GateController_time 567) .cse1 (<= GateController_hundred .cse40))) (let ((.cse41 (+ GateController_gate 46))) (and (<= GateController_hundred .cse41) (<= GateController_time 486) (<= .cse41 GateController_hundred) .cse1)) (let ((.cse42 (+ GateController_gate 65))) (and (<= .cse42 GateController_hundred) (<= GateController_hundred .cse42) (<= GateController_time 315) .cse1)) (let ((.cse43 (+ GateController_gate 33))) (and (<= GateController_time 603) (<= .cse43 GateController_hundred) .cse1 (<= GateController_hundred .cse43))) (let ((.cse44 (+ GateController_gate 51))) (and (<= GateController_hundred .cse44) (<= .cse44 GateController_hundred) (<= GateController_time 441) .cse1)) (let ((.cse45 (+ GateController_gate 77))) (and (<= GateController_time 207) (<= .cse45 GateController_hundred) (<= GateController_hundred .cse45) .cse1)) (let ((.cse46 (+ GateController_gate 93))) (and (<= .cse46 GateController_hundred) (<= GateController_time 63) (<= GateController_hundred .cse46) .cse1)) (let ((.cse47 (+ GateController_gate 99))) (and (<= GateController_hundred .cse47) (<= .cse47 GateController_hundred) .cse1 (<= GateController_time 9))) (let ((.cse48 (+ GateController_gate 36))) (and (<= GateController_hundred .cse48) (<= .cse48 GateController_hundred) (<= GateController_time 576) .cse1)) (let ((.cse49 (+ GateController_gate 57))) (and (<= .cse49 GateController_hundred) (<= GateController_hundred .cse49) .cse1 (<= GateController_time 387))) (let ((.cse50 (+ GateController_gate 75))) (and (<= .cse50 GateController_hundred) (<= GateController_hundred .cse50) (<= GateController_time 225) .cse1)) (let ((.cse51 (+ GateController_gate 20))) (and (<= GateController_hundred .cse51) .cse1 (<= GateController_time 720) (<= .cse51 GateController_hundred))) (let ((.cse52 (+ GateController_gate 79))) (and (<= GateController_hundred .cse52) (<= GateController_time 189) (<= .cse52 GateController_hundred) .cse1)) (let ((.cse53 (+ GateController_gate 28))) (and (<= .cse53 GateController_hundred) (<= GateController_hundred .cse53) (<= GateController_time 648) .cse1)) (let ((.cse54 (+ GateController_gate 98))) (and (<= GateController_time 18) (<= GateController_hundred .cse54) (<= .cse54 GateController_hundred) .cse1)) (let ((.cse55 (+ GateController_gate 31))) (and (<= .cse55 GateController_hundred) (<= GateController_hundred .cse55) .cse1 (<= GateController_time 621))) (let ((.cse56 (+ GateController_gate 3))) (and (<= .cse56 GateController_hundred) (<= GateController_hundred .cse56) (<= GateController_time 873) .cse1)) (let ((.cse57 (+ GateController_gate 85))) (and (<= GateController_hundred .cse57) (<= GateController_time 135) .cse1 (<= .cse57 GateController_hundred))) (let ((.cse58 (+ GateController_gate 11))) (and (<= .cse58 GateController_hundred) (<= GateController_hundred .cse58) (<= GateController_time 801) .cse1)) (let ((.cse59 (+ GateController_gate 5))) (and (<= GateController_time 855) (<= .cse59 GateController_hundred) .cse1 (<= GateController_hundred .cse59))) (let ((.cse60 (+ GateController_gate 39))) (and (<= .cse60 GateController_hundred) (<= GateController_hundred .cse60) (<= GateController_time 549) .cse1)) (let ((.cse61 (+ GateController_gate 49))) (and (<= GateController_hundred .cse61) (<= GateController_time 459) (<= .cse61 GateController_hundred) .cse1)) (let ((.cse62 (+ GateController_gate 10))) (and (<= GateController_hundred .cse62) (<= .cse62 GateController_hundred) (<= GateController_time 810) .cse1)) (let ((.cse63 (+ GateController_gate 58))) (and (<= .cse63 GateController_hundred) (<= GateController_time 378) (<= GateController_hundred .cse63) .cse1)) (let ((.cse64 (+ GateController_gate 55))) (and (<= GateController_hundred .cse64) (<= GateController_time 405) (<= .cse64 GateController_hundred) .cse1)) (let ((.cse65 (+ GateController_gate 17))) (and (<= .cse65 GateController_hundred) (<= GateController_time 747) (<= GateController_hundred .cse65) .cse1)) (let ((.cse66 (+ GateController_gate 53))) (and (<= GateController_time 423) (<= .cse66 GateController_hundred) .cse1 (<= GateController_hundred .cse66))) (let ((.cse67 (+ GateController_gate 6))) (and (<= GateController_time 846) .cse1 (<= GateController_hundred .cse67) (<= .cse67 GateController_hundred))) (let ((.cse68 (+ GateController_gate 52))) (and (<= .cse68 GateController_hundred) (<= GateController_time 432) (<= GateController_hundred .cse68) .cse1)) (let ((.cse69 (+ GateController_gate 9))) (and (<= GateController_hundred .cse69) (<= .cse69 GateController_hundred) .cse1 (<= GateController_time 819))) (let ((.cse70 (+ GateController_gate 19))) (and (<= GateController_hundred .cse70) (<= .cse70 GateController_hundred) (<= GateController_time 729) .cse1)) (let ((.cse71 (+ GateController_gate 8))) (and (<= GateController_hundred .cse71) (<= GateController_time 828) (<= .cse71 GateController_hundred) .cse1)) (let ((.cse72 (+ GateController_gate 66))) (and (<= GateController_time 306) (<= .cse72 GateController_hundred) .cse1 (<= GateController_hundred .cse72))) (let ((.cse73 (+ GateController_gate 81))) (and (<= GateController_time 171) (<= .cse73 GateController_hundred) (<= GateController_hundred .cse73) .cse1)) (let ((.cse74 (+ GateController_gate 56))) (and (<= .cse74 GateController_hundred) (<= GateController_hundred .cse74) .cse1 (<= GateController_time 396))) (let ((.cse75 (+ GateController_gate 68))) (and (<= GateController_time 288) (<= .cse75 GateController_hundred) .cse1 (<= GateController_hundred .cse75))) (let ((.cse76 (+ GateController_gate 29))) (and (<= GateController_time 639) (<= GateController_hundred .cse76) (<= .cse76 GateController_hundred) .cse1)) (let ((.cse77 (+ GateController_gate 100))) (and (<= GateController_time 0) (<= GateController_hundred .cse77) (<= .cse77 GateController_hundred) .cse1)) (let ((.cse78 (+ GateController_gate 76))) (and (<= GateController_hundred .cse78) (<= GateController_time 216) .cse1 (<= .cse78 GateController_hundred))) (let ((.cse79 (+ GateController_gate 32))) (and (<= .cse79 GateController_hundred) (<= GateController_time 612) (<= GateController_hundred .cse79) .cse1)) (let ((.cse80 (+ GateController_gate 74))) (and (<= .cse80 GateController_hundred) (<= GateController_hundred .cse80) .cse1 (<= GateController_time 234))) (let ((.cse81 (+ GateController_gate 64))) (and (<= GateController_hundred .cse81) (<= GateController_time 324) .cse1 (<= .cse81 GateController_hundred))) (let ((.cse82 (+ GateController_gate 14))) (and (<= .cse82 GateController_hundred) (<= GateController_hundred .cse82) .cse1 (<= GateController_time 774))) (let ((.cse83 (+ GateController_gate 24))) (and (<= GateController_time 684) (<= GateController_hundred .cse83) .cse1 (<= .cse83 GateController_hundred))) (let ((.cse84 (+ GateController_gate 34))) (and (<= .cse84 GateController_hundred) .cse1 (<= GateController_time 594) (<= GateController_hundred .cse84))) (let ((.cse85 (+ GateController_gate 88))) (and (<= GateController_time 108) (<= .cse85 GateController_hundred) (<= GateController_hundred .cse85) .cse1)) (let ((.cse86 (+ GateController_gate 35))) (and (<= .cse86 GateController_hundred) (<= GateController_hundred .cse86) (<= GateController_time 585) .cse1)) (let ((.cse87 (+ GateController_gate 25))) (and (<= GateController_time 675) (<= .cse87 GateController_hundred) (<= GateController_hundred .cse87) .cse1)) (let ((.cse88 (+ GateController_gate 95))) (and .cse1 (<= GateController_hundred .cse88) (<= .cse88 GateController_hundred) (<= GateController_time 45))) (let ((.cse89 (+ GateController_gate 30))) (and (<= GateController_hundred .cse89) (<= .cse89 GateController_hundred) (<= GateController_time 630) .cse1)) (let ((.cse90 (+ GateController_gate 15))) (and (<= GateController_time 765) (<= .cse90 GateController_hundred) (<= GateController_hundred .cse90) .cse1)) (let ((.cse91 (+ GateController_gate 59))) (and (<= GateController_hundred .cse91) .cse1 (<= .cse91 GateController_hundred) (<= GateController_time 369))) (let ((.cse92 (+ GateController_gate 22))) (and (<= GateController_hundred .cse92) (<= GateController_time 702) .cse1 (<= .cse92 GateController_hundred))) (let ((.cse93 (+ GateController_gate 69))) (and (<= GateController_time 279) (<= .cse93 GateController_hundred) (<= GateController_hundred .cse93) .cse1)) (let ((.cse94 (+ GateController_gate 90))) (and (<= GateController_hundred .cse94) .cse1 (<= GateController_time 90) (<= .cse94 GateController_hundred))) (let ((.cse95 (+ GateController_gate 23))) (and (<= GateController_hundred .cse95) (<= .cse95 GateController_hundred) .cse1 (<= GateController_time 693))) (let ((.cse96 (+ GateController_gate 72))) (and (<= GateController_hundred .cse96) (<= .cse96 GateController_hundred) (<= GateController_time 252) .cse1)) (let ((.cse97 (+ GateController_gate 7))) (and (<= GateController_time 837) (<= GateController_hundred .cse97) (<= .cse97 GateController_hundred) .cse1)) (let ((.cse98 (+ GateController_gate 87))) (and (<= GateController_hundred .cse98) (<= GateController_time 117) (<= .cse98 GateController_hundred) .cse1)) (let ((.cse99 (+ GateController_gate 16))) (and (<= GateController_hundred .cse99) (<= .cse99 GateController_hundred) (<= GateController_time 756) .cse1)) (let ((.cse100 (+ GateController_gate 12))) (and (<= GateController_time 792) (<= GateController_hundred .cse100) (<= .cse100 GateController_hundred) .cse1)))) [2018-10-01 00:35:24,603 INFO L426 ceAbstractionStarter]: For program point GateControllerEXIT(lines 10 40) no Hoare annotation was computed. [2018-10-01 00:35:24,603 INFO L426 ceAbstractionStarter]: For program point GateControllerENTRY(lines 10 40) no Hoare annotation was computed. [2018-10-01 00:35:24,603 INFO L426 ceAbstractionStarter]: For program point GateControllerErr0ASSERT_VIOLATIONASSERT(line 39) no Hoare annotation was computed. [2018-10-01 00:35:24,603 INFO L426 ceAbstractionStarter]: For program point L39(line 39) no Hoare annotation was computed. [2018-10-01 00:35:24,603 INFO L426 ceAbstractionStarter]: For program point GateControllerFINAL(lines 10 40) no Hoare annotation was computed. [2018-10-01 00:35:24,637 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,639 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,639 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,640 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,641 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,642 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,642 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,643 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,644 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,645 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,645 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,646 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,647 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,647 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,648 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,649 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,650 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,650 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,651 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,652 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,652 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,653 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,654 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,654 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,655 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,656 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,656 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,657 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,658 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,658 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,659 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,660 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,660 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,661 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,662 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,662 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,663 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,664 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,664 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,665 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,665 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,666 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,667 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,667 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,668 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,668 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,669 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,670 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,670 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,671 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,671 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,672 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,673 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,673 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,674 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,674 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,675 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,675 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,676 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,677 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,677 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,678 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,678 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,679 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,679 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,680 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,680 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,681 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,681 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,682 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,682 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,683 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,684 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,684 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,685 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,685 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,686 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,686 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,687 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,687 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,688 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,688 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,689 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,689 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,690 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,690 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,691 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,691 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,691 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,692 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,692 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,693 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,693 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,694 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,694 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,695 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,695 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,695 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,696 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,696 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,697 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,697 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,698 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,698 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,698 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,699 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,699 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,700 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,700 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,701 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,701 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,701 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,702 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,702 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,703 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,703 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,703 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,704 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,704 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,705 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,705 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,705 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,706 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,706 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,706 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,707 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,707 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,708 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,708 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,708 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,709 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,709 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,709 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,710 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,710 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,710 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,711 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,711 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,711 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,712 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,712 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,712 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,713 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,713 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,713 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,713 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,714 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,714 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,714 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,715 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,715 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,715 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,716 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,716 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,716 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,716 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,717 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,717 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,717 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,718 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,718 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,718 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,718 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,719 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,719 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,719 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,719 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,720 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,720 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,720 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,720 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,721 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,721 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,721 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,721 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,722 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,722 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,722 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,722 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,722 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,723 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,723 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,723 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,723 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,723 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,724 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,724 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,724 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,724 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,725 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,725 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,725 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,725 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,725 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,726 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,726 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,726 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,726 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,726 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,726 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,825 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,826 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,827 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,828 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,828 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,829 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,830 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,830 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,831 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,832 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,833 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,833 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,834 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,835 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,835 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,836 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,837 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,837 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,838 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,839 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,839 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,840 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,841 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,841 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,842 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,843 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,843 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,844 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,845 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,845 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,846 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,846 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,847 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,848 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,848 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,849 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,850 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,850 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,851 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,852 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,852 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,853 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,853 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,854 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,855 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,855 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,856 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,856 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,857 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,857 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,858 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,859 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,859 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,860 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,860 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,861 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,861 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,862 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,863 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,863 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,864 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,864 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,865 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,865 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,866 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,866 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,867 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,867 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,868 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,868 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,869 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,869 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,870 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,870 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,871 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,871 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,871 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,872 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,872 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,873 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,873 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,873 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,874 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,874 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,874 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,875 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,875 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,875 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,876 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,876 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,876 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,877 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,877 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,878 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,878 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,878 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,879 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,879 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,879 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,880 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,880 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,881 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,881 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,882 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,882 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,882 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,883 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,883 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,884 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,884 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,884 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,885 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,885 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,885 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,886 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,886 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,886 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,886 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,887 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,887 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,887 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,887 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,888 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,888 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,888 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,888 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,889 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,889 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,889 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,889 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,890 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,890 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,890 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,890 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,891 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,891 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,891 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,891 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,892 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,892 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,892 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,892 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,893 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,893 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,894 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,894 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,894 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,894 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,895 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,895 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,895 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,895 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,895 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,896 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,896 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,896 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,896 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,896 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,896 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,897 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,897 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,897 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,897 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,898 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,898 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,898 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,898 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,898 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,899 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,899 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,899 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,899 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,899 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,899 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,900 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,900 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,900 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,900 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,900 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,900 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,901 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,901 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,901 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,901 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,901 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,902 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,902 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,902 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,902 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,902 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,902 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,902 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,903 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,903 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,903 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,903 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,903 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,903 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,903 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,903 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,907 INFO L202 PluginConnector]: Adding new model RailwayCrossing.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.10 12:35:24 BoogieIcfgContainer [2018-10-01 00:35:24,907 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-01 00:35:24,907 INFO L168 Benchmark]: Toolchain (without parser) took 649917.09 ms. Allocated memory was 1.5 GB in the beginning and 1.8 GB in the end (delta: 232.3 MB). Free memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: -219.3 MB). Peak memory consumption was 380.6 MB. Max. memory is 7.1 GB. [2018-10-01 00:35:24,908 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.25 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-10-01 00:35:24,909 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.95 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-10-01 00:35:24,909 INFO L168 Benchmark]: Boogie Preprocessor took 22.53 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-10-01 00:35:24,910 INFO L168 Benchmark]: RCFGBuilder took 398.24 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-10-01 00:35:24,910 INFO L168 Benchmark]: TraceAbstraction took 649446.91 ms. Allocated memory was 1.5 GB in the beginning and 1.8 GB in the end (delta: 232.3 MB). Free memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: -240.4 MB). Peak memory consumption was 359.5 MB. Max. memory is 7.1 GB. [2018-10-01 00:35:24,913 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.25 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 41.95 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 22.53 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 398.24 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 649446.91 ms. Allocated memory was 1.5 GB in the beginning and 1.8 GB in the end (delta: 232.3 MB). Free memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: -240.4 MB). Peak memory consumption was 359.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 39]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 25]: Loop Invariant [2018-10-01 00:35:24,947 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,948 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,948 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,949 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,950 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,950 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,951 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,952 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,952 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,953 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,954 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,954 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,955 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,956 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,956 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,957 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,958 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,958 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,959 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,959 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,960 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,961 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,961 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,962 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,963 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,963 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,964 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,964 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,965 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,965 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,966 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,967 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,967 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,968 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,968 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,969 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,970 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,970 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,971 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,971 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,972 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,972 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,973 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,973 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,974 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,974 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,975 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,976 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,976 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,976 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,977 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,977 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,978 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,978 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,978 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,979 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,979 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,979 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,980 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,980 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,981 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,981 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,981 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,982 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,982 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,982 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,983 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,983 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,983 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,984 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,984 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,984 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,985 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,985 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,985 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,986 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,986 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,986 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,987 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,987 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,987 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,988 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,988 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,988 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,989 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,989 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,989 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,989 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,990 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,990 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,990 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,991 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,991 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,991 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,992 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,992 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,992 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,992 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,993 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,993 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,993 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,994 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,994 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,994 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,994 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,995 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,995 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,995 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,995 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,996 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,996 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,996 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,997 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,997 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,997 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,998 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,998 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,999 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,999 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:24,999 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,000 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,000 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,000 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,001 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,001 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,001 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,002 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,002 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,002 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,003 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,003 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,003 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,004 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,004 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,004 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,005 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,005 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,005 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,006 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,006 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,006 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,006 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,007 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,007 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,007 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,008 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,008 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,008 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,008 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,009 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,009 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,009 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,009 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,010 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,010 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,010 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,011 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,011 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,011 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,011 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,012 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,012 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,012 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,012 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,013 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,013 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,013 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,013 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,014 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,014 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,014 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,014 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,014 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,015 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,015 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,015 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,015 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,015 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,016 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,016 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,016 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,016 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,016 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,017 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,017 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,017 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,017 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,017 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,017 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,018 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,018 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,018 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,018 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,018 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,018 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,019 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,019 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,019 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,019 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,019 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,028 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,029 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,030 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,031 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,031 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,032 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,033 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,034 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,034 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,035 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,035 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,036 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,037 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,037 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,038 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,039 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,039 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,040 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,040 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,041 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,042 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,042 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,043 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,044 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,044 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,045 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,045 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,046 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,047 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,047 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,048 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,049 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,049 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,050 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,050 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,051 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,052 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,052 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,053 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,053 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,054 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,054 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,055 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,056 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,056 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,057 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,057 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,058 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,058 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,059 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,059 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,060 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,061 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,061 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,062 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,062 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,063 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,063 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,064 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,064 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,065 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,065 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,066 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,066 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,067 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,067 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,068 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,068 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,069 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,069 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,070 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,070 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,071 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,071 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,072 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,072 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,073 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,073 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,074 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,074 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,075 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,075 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,076 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,076 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,077 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,077 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,078 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,078 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,078 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,079 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,079 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,080 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,080 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,081 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,081 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,081 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,082 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,082 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,083 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,083 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,083 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,084 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,084 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,085 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,085 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,085 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,086 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,086 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,087 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,087 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,087 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,088 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,088 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,089 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,089 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,089 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,090 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,090 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,090 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,091 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,091 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,091 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,092 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,092 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,092 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,093 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,093 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,093 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,094 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,094 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,094 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,095 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,095 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,095 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,096 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,096 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,096 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,097 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,097 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,097 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,097 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,098 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,098 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,098 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,099 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,099 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,099 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,099 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,100 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,100 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,100 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,100 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,101 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,101 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,101 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,102 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,102 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,102 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,102 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,103 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,103 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,103 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,103 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,103 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,104 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,104 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,104 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,104 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,105 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,105 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,105 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,105 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,105 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,106 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,106 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,106 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,106 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,106 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,107 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,107 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,107 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,107 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,107 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,108 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,108 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,108 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,108 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,108 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,109 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,109 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,109 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,109 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,109 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,109 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,109 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,109 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,110 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,110 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,110 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] [2018-10-01 00:35:25,110 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[GateController_one,QUANTIFIED] Derived loop invariant: (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((time <= 477 && gate + 47 <= hundred) && (exists GateController_one : int :: 1000 * GateController_one <= thousand && 1 <= GateController_one)) && hundred <= gate + 47) || (((time <= 414 && gate + 54 <= hundred) && (exists GateController_one : int :: 1000 * GateController_one <= thousand && 1 <= GateController_one)) && hundred <= gate + 54)) || (((hundred <= gate + 2 && time <= 882) && gate + 2 <= hundred) && (exists GateController_one : int :: 1000 * GateController_one <= thousand && 1 <= GateController_one))) || (((time <= 243 && gate + 73 <= hundred) && (exists GateController_one : int :: 1000 * GateController_one <= thousand && 1 <= GateController_one)) && hundred <= gate + 73)) || (((gate + 70 <= hundred && time <= 270) && hundred <= gate + 70) && (exists GateController_one : int :: 1000 * GateController_one <= thousand && 1 <= GateController_one))) || (((time <= 54 && gate + 94 <= hundred) && (exists GateController_one : int :: 1000 * GateController_one <= thousand && 1 <= GateController_one)) && hundred <= gate + 94)) || (((hundred <= gate + 89 && gate + 89 <= hundred) && time <= 99) && (exists GateController_one : int :: 1000 * GateController_one <= thousand && 1 <= GateController_one))) || (((time <= 144 && hundred <= gate + 84) && gate + 84 <= hundred) && (exists GateController_one : int :: 1000 * GateController_one <= thousand && 1 <= GateController_one))) || (((hundred <= gate + 42 && gate + 42 <= hundred) && time <= 522) && (exists GateController_one : int :: 1000 * GateController_one <= thousand && 1 <= GateController_one))) || (((gate + 60 <= hundred && time <= 360) && hundred <= gate + 60) && (exists GateController_one : int :: 1000 * GateController_one <= thousand && 1 <= GateController_one))) || (((hundred <= gate + 82 && time <= 162) && (exists GateController_one : int :: 1000 * GateController_one <= thousand && 1 <= GateController_one)) && gate + 82 <= hundred)) || (((hundred <= gate + 40 && time <= 540) && gate + 40 <= hundred) && (exists GateController_one : int :: 1000 * GateController_one <= thousand && 1 <= GateController_one))) || (hundred <= gate && gate <= hundred)) || (((gate + 91 <= hundred && hundred <= gate + 91) && time <= 81) && (exists GateController_one : int :: 1000 * GateController_one <= thousand && 1 <= GateController_one))) || (((gate + 45 <= hundred && time <= 495) && hundred <= gate + 45) && (exists GateController_one : int :: 1000 * GateController_one <= thousand && 1 <= GateController_one))) || (((hundred <= gate + 4 && gate + 4 <= hundred) && time <= 864) && (exists GateController_one : int :: 1000 * GateController_one <= thousand && 1 <= GateController_one))) || (((time <= 351 && gate + 61 <= hundred) && hundred <= gate + 61) && (exists GateController_one : int :: 1000 * GateController_one <= thousand && 1 <= GateController_one))) || (((hundred <= gate + 71 && gate + 71 <= hundred) && (exists GateController_one : int :: 1000 * GateController_one <= thousand && 1 <= GateController_one)) && time <= 261)) || (((gate + 48 <= hundred && hundred <= gate + 48) && time <= 468) && (exists GateController_one : int :: 1000 * GateController_one <= thousand && 1 <= GateController_one))) || (((time <= 666 && gate + 26 <= hundred) && (exists GateController_one : int :: 1000 * GateController_one <= thousand && 1 <= GateController_one)) && hundred <= gate + 26)) || (((time <= 36 && gate + 96 <= hundred) && (exists GateController_one : int :: 1000 * GateController_one <= thousand && 1 <= GateController_one)) && hundred <= gate + 96)) || (((gate + 92 <= hundred && (exists GateController_one : int :: 1000 * GateController_one <= thousand && 1 <= GateController_one)) && hundred <= gate + 92) && time <= 72)) || (((hundred <= gate + 80 && time <= 180) && (exists GateController_one : int :: 1000 * GateController_one <= thousand && 1 <= GateController_one)) && gate + 80 <= hundred)) || (((gate + 1 <= hundred && time <= 891) && hundred <= gate + 1) && (exists GateController_one : int :: 1000 * GateController_one <= thousand && 1 <= GateController_one))) || (((gate + 43 <= hundred && time <= 513) && hundred <= gate + 43) && (exists GateController_one : int :: 1000 * GateController_one <= thousand && 1 <= GateController_one))) || (((hundred <= gate + 97 && gate + 97 <= hundred) && (exists GateController_one : int :: 1000 * GateController_one <= thousand && 1 <= GateController_one)) && time <= 27)) || (((hundred <= gate + 27 && gate + 27 <= hundred) && (exists GateController_one : int :: 1000 * GateController_one <= thousand && 1 <= GateController_one)) && time <= 657)) || (((hundred <= gate + 50 && gate + 50 <= hundred) && time <= 450) && (exists GateController_one : int :: 1000 * GateController_one <= thousand && 1 <= GateController_one))) || (((time <= 126 && gate + 86 <= hundred) && hundred <= gate + 86) && (exists GateController_one : int :: 1000 * GateController_one <= thousand && 1 <= GateController_one))) || (((hundred <= gate + 78 && gate + 78 <= hundred) && (exists GateController_one : int :: 1000 * GateController_one <= thousand && 1 <= GateController_one)) && time <= 198)) || (((hundred <= gate + 18 && time <= 738) && gate + 18 <= hundred) && (exists GateController_one : int :: 1000 * GateController_one <= thousand && 1 <= GateController_one))) || (((time <= 558 && hundred <= gate + 38) && gate + 38 <= hundred) && (exists GateController_one : int :: 1000 * GateController_one <= thousand && 1 <= GateController_one))) || (((time <= 783 && hundred <= gate + 13) && (exists GateController_one : int :: 1000 * GateController_one <= thousand && 1 <= GateController_one)) && gate + 13 <= hundred)) || (((time <= 297 && (exists GateController_one : int :: 1000 * GateController_one <= thousand && 1 <= GateController_one)) && gate + 67 <= hundred) && hundred <= gate + 67)) || (((hundred <= gate + 44 && gate + 44 <= hundred) && time <= 504) && (exists GateController_one : int :: 1000 * GateController_one <= thousand && 1 <= GateController_one))) || (((time <= 153 && gate + 83 <= hundred) && hundred <= gate + 83) && (exists GateController_one : int :: 1000 * GateController_one <= thousand && 1 <= GateController_one))) || alarmTrain) || (((time <= 333 && hundred <= gate + 63) && (exists GateController_one : int :: 1000 * GateController_one <= thousand && 1 <= GateController_one)) && gate + 63 <= hundred)) || (((time <= 531 && hundred <= gate + 41) && gate + 41 <= hundred) && (exists GateController_one : int :: 1000 * GateController_one <= thousand && 1 <= GateController_one))) || (((hundred <= gate + 62 && gate + 62 <= hundred) && time <= 342) && (exists GateController_one : int :: 1000 * GateController_one <= thousand && 1 <= GateController_one))) || (((hundred <= gate + 21 && gate + 21 <= hundred) && (exists GateController_one : int :: 1000 * GateController_one <= thousand && 1 <= GateController_one)) && time <= 711)) || (((gate + 37 <= hundred && time <= 567) && (exists GateController_one : int :: 1000 * GateController_one <= thousand && 1 <= GateController_one)) && hundred <= gate + 37)) || (((hundred <= gate + 46 && time <= 486) && gate + 46 <= hundred) && (exists GateController_one : int :: 1000 * GateController_one <= thousand && 1 <= GateController_one))) || (((gate + 65 <= hundred && hundred <= gate + 65) && time <= 315) && (exists GateController_one : int :: 1000 * GateController_one <= thousand && 1 <= GateController_one))) || (((time <= 603 && gate + 33 <= hundred) && (exists GateController_one : int :: 1000 * GateController_one <= thousand && 1 <= GateController_one)) && hundred <= gate + 33)) || (((hundred <= gate + 51 && gate + 51 <= hundred) && time <= 441) && (exists GateController_one : int :: 1000 * GateController_one <= thousand && 1 <= GateController_one))) || (((time <= 207 && gate + 77 <= hundred) && hundred <= gate + 77) && (exists GateController_one : int :: 1000 * GateController_one <= thousand && 1 <= GateController_one))) || (((gate + 93 <= hundred && time <= 63) && hundred <= gate + 93) && (exists GateController_one : int :: 1000 * GateController_one <= thousand && 1 <= GateController_one))) || (((hundred <= gate + 99 && gate + 99 <= hundred) && (exists GateController_one : int :: 1000 * GateController_one <= thousand && 1 <= GateController_one)) && time <= 9)) || (((hundred <= gate + 36 && gate + 36 <= hundred) && time <= 576) && (exists GateController_one : int :: 1000 * GateController_one <= thousand && 1 <= GateController_one))) || (((gate + 57 <= hundred && hundred <= gate + 57) && (exists GateController_one : int :: 1000 * GateController_one <= thousand && 1 <= GateController_one)) && time <= 387)) || (((gate + 75 <= hundred && hundred <= gate + 75) && time <= 225) && (exists GateController_one : int :: 1000 * GateController_one <= thousand && 1 <= GateController_one))) || (((hundred <= gate + 20 && (exists GateController_one : int :: 1000 * GateController_one <= thousand && 1 <= GateController_one)) && time <= 720) && gate + 20 <= hundred)) || (((hundred <= gate + 79 && time <= 189) && gate + 79 <= hundred) && (exists GateController_one : int :: 1000 * GateController_one <= thousand && 1 <= GateController_one))) || (((gate + 28 <= hundred && hundred <= gate + 28) && time <= 648) && (exists GateController_one : int :: 1000 * GateController_one <= thousand && 1 <= GateController_one))) || (((time <= 18 && hundred <= gate + 98) && gate + 98 <= hundred) && (exists GateController_one : int :: 1000 * GateController_one <= thousand && 1 <= GateController_one))) || (((gate + 31 <= hundred && hundred <= gate + 31) && (exists GateController_one : int :: 1000 * GateController_one <= thousand && 1 <= GateController_one)) && time <= 621)) || (((gate + 3 <= hundred && hundred <= gate + 3) && time <= 873) && (exists GateController_one : int :: 1000 * GateController_one <= thousand && 1 <= GateController_one))) || (((hundred <= gate + 85 && time <= 135) && (exists GateController_one : int :: 1000 * GateController_one <= thousand && 1 <= GateController_one)) && gate + 85 <= hundred)) || (((gate + 11 <= hundred && hundred <= gate + 11) && time <= 801) && (exists GateController_one : int :: 1000 * GateController_one <= thousand && 1 <= GateController_one))) || (((time <= 855 && gate + 5 <= hundred) && (exists GateController_one : int :: 1000 * GateController_one <= thousand && 1 <= GateController_one)) && hundred <= gate + 5)) || (((gate + 39 <= hundred && hundred <= gate + 39) && time <= 549) && (exists GateController_one : int :: 1000 * GateController_one <= thousand && 1 <= GateController_one))) || (((hundred <= gate + 49 && time <= 459) && gate + 49 <= hundred) && (exists GateController_one : int :: 1000 * GateController_one <= thousand && 1 <= GateController_one))) || (((hundred <= gate + 10 && gate + 10 <= hundred) && time <= 810) && (exists GateController_one : int :: 1000 * GateController_one <= thousand && 1 <= GateController_one))) || (((gate + 58 <= hundred && time <= 378) && hundred <= gate + 58) && (exists GateController_one : int :: 1000 * GateController_one <= thousand && 1 <= GateController_one))) || (((hundred <= gate + 55 && time <= 405) && gate + 55 <= hundred) && (exists GateController_one : int :: 1000 * GateController_one <= thousand && 1 <= GateController_one))) || (((gate + 17 <= hundred && time <= 747) && hundred <= gate + 17) && (exists GateController_one : int :: 1000 * GateController_one <= thousand && 1 <= GateController_one))) || (((time <= 423 && gate + 53 <= hundred) && (exists GateController_one : int :: 1000 * GateController_one <= thousand && 1 <= GateController_one)) && hundred <= gate + 53)) || (((time <= 846 && (exists GateController_one : int :: 1000 * GateController_one <= thousand && 1 <= GateController_one)) && hundred <= gate + 6) && gate + 6 <= hundred)) || (((gate + 52 <= hundred && time <= 432) && hundred <= gate + 52) && (exists GateController_one : int :: 1000 * GateController_one <= thousand && 1 <= GateController_one))) || (((hundred <= gate + 9 && gate + 9 <= hundred) && (exists GateController_one : int :: 1000 * GateController_one <= thousand && 1 <= GateController_one)) && time <= 819)) || (((hundred <= gate + 19 && gate + 19 <= hundred) && time <= 729) && (exists GateController_one : int :: 1000 * GateController_one <= thousand && 1 <= GateController_one))) || (((hundred <= gate + 8 && time <= 828) && gate + 8 <= hundred) && (exists GateController_one : int :: 1000 * GateController_one <= thousand && 1 <= GateController_one))) || (((time <= 306 && gate + 66 <= hundred) && (exists GateController_one : int :: 1000 * GateController_one <= thousand && 1 <= GateController_one)) && hundred <= gate + 66)) || (((time <= 171 && gate + 81 <= hundred) && hundred <= gate + 81) && (exists GateController_one : int :: 1000 * GateController_one <= thousand && 1 <= GateController_one))) || (((gate + 56 <= hundred && hundred <= gate + 56) && (exists GateController_one : int :: 1000 * GateController_one <= thousand && 1 <= GateController_one)) && time <= 396)) || (((time <= 288 && gate + 68 <= hundred) && (exists GateController_one : int :: 1000 * GateController_one <= thousand && 1 <= GateController_one)) && hundred <= gate + 68)) || (((time <= 639 && hundred <= gate + 29) && gate + 29 <= hundred) && (exists GateController_one : int :: 1000 * GateController_one <= thousand && 1 <= GateController_one))) || (((time <= 0 && hundred <= gate + 100) && gate + 100 <= hundred) && (exists GateController_one : int :: 1000 * GateController_one <= thousand && 1 <= GateController_one))) || (((hundred <= gate + 76 && time <= 216) && (exists GateController_one : int :: 1000 * GateController_one <= thousand && 1 <= GateController_one)) && gate + 76 <= hundred)) || (((gate + 32 <= hundred && time <= 612) && hundred <= gate + 32) && (exists GateController_one : int :: 1000 * GateController_one <= thousand && 1 <= GateController_one))) || (((gate + 74 <= hundred && hundred <= gate + 74) && (exists GateController_one : int :: 1000 * GateController_one <= thousand && 1 <= GateController_one)) && time <= 234)) || (((hundred <= gate + 64 && time <= 324) && (exists GateController_one : int :: 1000 * GateController_one <= thousand && 1 <= GateController_one)) && gate + 64 <= hundred)) || (((gate + 14 <= hundred && hundred <= gate + 14) && (exists GateController_one : int :: 1000 * GateController_one <= thousand && 1 <= GateController_one)) && time <= 774)) || (((time <= 684 && hundred <= gate + 24) && (exists GateController_one : int :: 1000 * GateController_one <= thousand && 1 <= GateController_one)) && gate + 24 <= hundred)) || (((gate + 34 <= hundred && (exists GateController_one : int :: 1000 * GateController_one <= thousand && 1 <= GateController_one)) && time <= 594) && hundred <= gate + 34)) || (((time <= 108 && gate + 88 <= hundred) && hundred <= gate + 88) && (exists GateController_one : int :: 1000 * GateController_one <= thousand && 1 <= GateController_one))) || (((gate + 35 <= hundred && hundred <= gate + 35) && time <= 585) && (exists GateController_one : int :: 1000 * GateController_one <= thousand && 1 <= GateController_one))) || (((time <= 675 && gate + 25 <= hundred) && hundred <= gate + 25) && (exists GateController_one : int :: 1000 * GateController_one <= thousand && 1 <= GateController_one))) || ((((exists GateController_one : int :: 1000 * GateController_one <= thousand && 1 <= GateController_one) && hundred <= gate + 95) && gate + 95 <= hundred) && time <= 45)) || (((hundred <= gate + 30 && gate + 30 <= hundred) && time <= 630) && (exists GateController_one : int :: 1000 * GateController_one <= thousand && 1 <= GateController_one))) || (((time <= 765 && gate + 15 <= hundred) && hundred <= gate + 15) && (exists GateController_one : int :: 1000 * GateController_one <= thousand && 1 <= GateController_one))) || (((hundred <= gate + 59 && (exists GateController_one : int :: 1000 * GateController_one <= thousand && 1 <= GateController_one)) && gate + 59 <= hundred) && time <= 369)) || (((hundred <= gate + 22 && time <= 702) && (exists GateController_one : int :: 1000 * GateController_one <= thousand && 1 <= GateController_one)) && gate + 22 <= hundred)) || (((time <= 279 && gate + 69 <= hundred) && hundred <= gate + 69) && (exists GateController_one : int :: 1000 * GateController_one <= thousand && 1 <= GateController_one))) || (((hundred <= gate + 90 && (exists GateController_one : int :: 1000 * GateController_one <= thousand && 1 <= GateController_one)) && time <= 90) && gate + 90 <= hundred)) || (((hundred <= gate + 23 && gate + 23 <= hundred) && (exists GateController_one : int :: 1000 * GateController_one <= thousand && 1 <= GateController_one)) && time <= 693)) || (((hundred <= gate + 72 && gate + 72 <= hundred) && time <= 252) && (exists GateController_one : int :: 1000 * GateController_one <= thousand && 1 <= GateController_one))) || (((time <= 837 && hundred <= gate + 7) && gate + 7 <= hundred) && (exists GateController_one : int :: 1000 * GateController_one <= thousand && 1 <= GateController_one))) || (((hundred <= gate + 87 && time <= 117) && gate + 87 <= hundred) && (exists GateController_one : int :: 1000 * GateController_one <= thousand && 1 <= GateController_one))) || (((hundred <= gate + 16 && gate + 16 <= hundred) && time <= 756) && (exists GateController_one : int :: 1000 * GateController_one <= thousand && 1 <= GateController_one))) || (((time <= 792 && hundred <= gate + 12) && gate + 12 <= hundred) && (exists GateController_one : int :: 1000 * GateController_one <= thousand && 1 <= GateController_one)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 10 locations, 1 error locations. SAFE Result, 649.0s OverallTime, 102 OverallIterations, 100 TraceHistogramMax, 376.7s AutomataDifference, 0.0s DeadEndRemovalTime, 7.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 1126 SDtfs, 61149 SDslu, 76640 SDs, 0 SdLazy, 53811 SolverSat, 590 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 72.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 30904 GetRequests, 20401 SyntacticMatches, 0 SemanticMatches, 10503 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 232.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=504occurred in iteration=101, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 102 MinimizatonAttempts, 400 StatesRemovedByMinimization, 100 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 104 NumberOfFragments, 2409 HoareAnnotationTreeSize, 1 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 1 FomulaSimplificationsInter, 49 FormulaSimplificationTreeSizeReductionInter, 7.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 1.0s SsaConstructionTime, 10.7s SatisfiabilityAnalysisTime, 238.6s InterpolantComputationTime, 51110 NumberOfCodeBlocks, 51110 NumberOfCodeBlocksAsserted, 2719 NumberOfCheckSat, 50908 ConstructedInterpolants, 25350 QuantifiedInterpolants, 163736328 SizeOfPredicates, 5350 NumberOfNonLiveVariables, 47050 ConjunctsInSsa, 10500 ConjunctsInUnsatCore, 202 InterpolantComputations, 2 PerfectInterpolantSequences, 1/1676601 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/RailwayCrossing.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-01_00-35-25-119.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/RailwayCrossing.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-01_00-35-25-119.csv Received shutdown request...